Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

2013

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1411 - 1440 of 2092

Full-Text Articles in Computer Sciences

Personal Reflections From Eportfolio: Ahrc New York City, Cindy Guerrero Jan 2013

Personal Reflections From Eportfolio: Ahrc New York City, Cindy Guerrero

Community Action Forum: Seidenberg School

No abstract provided.


Raising The Game: Applying Theory And Analytics To Real-World Threats, Singapore Management University Jan 2013

Raising The Game: Applying Theory And Analytics To Real-World Threats, Singapore Management University

Perspectives@SMU

Safety and security are, on many levels, essential priorities for governments, businesses and individuals. While an increase of defence and security budgets may bring some assurance of peaceful times to come, it seems the world has no lack of insane perpetrators who can still somehow evade, breach, ambush, assail and attack as they please. Enter the “Bayesian Stackelberg Game”, a game theory model that can, and has been applied rather successfully to the allocation of security resources in the United States by Prof Milind Tambe, University of Southern California.


System Fc With Explicit Kind Equality (Extended Version), Stephanie Weirich, Justin Hsu, Richard A. Eisenberg Jan 2013

System Fc With Explicit Kind Equality (Extended Version), Stephanie Weirich, Justin Hsu, Richard A. Eisenberg

Computer Science Faculty Research and Scholarship

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of System F with first-class type equality proofs called coercions. This extensible proof system forms the foundation for type system extensions such as type families (type- level functions) and Generalized Algebraic Datatypes (GADTs). Such features, in conjunction with kind polymorphism and datatype promotion, support expressive compile-time reasoning.

However, the core language lacks explicit kind equality proofs. As a result, type-level computation does not have access to kind- level functions or promoted GADTs, the type-level analogues to expression-level features that have been so useful. In this paper, …


Cultivating Intelligent Tutoring Cognizing Agents In Ill-Defined Domains Using Hybrid Approaches, Rania Hodhod Jan 2013

Cultivating Intelligent Tutoring Cognizing Agents In Ill-Defined Domains Using Hybrid Approaches, Rania Hodhod

Faculty Bibliography

Cognizing agents are those systems that can perceive information from the external environment and can adapt to the changing conditions of that environment. Along the adaptation process a cognizing agent perceives information about the environment and generates reactions. An intelligent tutoring cognizing agent should deal not only with the tutoring system’s world but also with the learner-it should infer and predict new information about the learner and tailor the learning process to fit this specific learner. This paper shows how intelligent tutoring cognizing agents can be cultivated in ill-defined domains using hybrid techniques instantiated in the two example agents AEINS-CA …


An Empirical Study On Symptoms Of Heavier Internet Usage Among Young Adults, Sai Preethi Vishwanathan, Levi Malott, Sriram Chellappan, P. Murali Doraiswamy Jan 2013

An Empirical Study On Symptoms Of Heavier Internet Usage Among Young Adults, Sai Preethi Vishwanathan, Levi Malott, Sriram Chellappan, P. Murali Doraiswamy

Computer Science Faculty Research & Creative Works

Understanding negative consequences of heavy Internet use on mental health is a topic that is gaining significant traction recently. A number of studies have investigated heavy Internet usage, especially among young adults in relation to online games, social media and email. While such studies do provide valuable insights, Internet usage so far has been characterized by means of self-reported surveys only that may suffer from errors and biases. In this paper, we report the findings of a two-month empirical study on heavy Internet usage among students conducted at a college campus. The novelty of the study is that it is …


Special Issue On Medical Simulation, Michel Audette, Hanif M. Ladak Jan 2013

Special Issue On Medical Simulation, Michel Audette, Hanif M. Ladak

Computational Modeling & Simulation Engineering Faculty Publications

We would like to welcome you to this Special Issue on Medical Simulation, the first of its kind not only for SIMULATION: Transactions of The Society for Modeling and Simulation International, but for any technical journal. Our respective backgrounds are an indication of the technical and clinical breadth of medical simulation, as we approach the subject as primarily medical image analysis and biomechanics experts respectively, each with a variety of clinical interests spanning virtual reality (VR)–based neuro-, orthopedic and ear-nose-and-throat surgery. Moreover, we believe that the breadth of the papers that comprise this issue reflects an even broader perspective. After …


Safe Harbor For The Innocent Infringer In The Digital Age, Tonya M. Evans Jan 2013

Safe Harbor For The Innocent Infringer In The Digital Age, Tonya M. Evans

Law Faculty Scholarship

The primary goal of this Article is three-fold: (1) to explore the role of the innocent infringer archetype historically and in the digital age; (2) to highlight the tension between customary and generally accepted online uses and copyright law that compromise efficient use of technology and progress of the digital technologies, the Internet, and society at large; and (3) to offer a legislative fix in the form of safe harbor for direct innocent infringers. Such an exemption seems not only more efficient but also more just in the online environment where unwitting infringement for the average copyright consumer is far …


The Performance Of Data Segmentation Of The Conjugate Gradient On A Non-Uniform Memory Access Parallel System, Brandon Hildreth Jan 2013

The Performance Of Data Segmentation Of The Conjugate Gradient On A Non-Uniform Memory Access Parallel System, Brandon Hildreth

Honors Theses, 1963-2015

Parallel computing is an ever growing field in computer science that is used in everything from cross-discipline research to consumer goods, and because of this it is important to study the efficiency of parallel systems and methods. This thesis will examine storage and execution techniques of matrix vector operations involved in the conjugate Gradient Method on a parallel, non-uniform memory access (NUMA) aware system. In order to fully take advantage of the NUMA memory system, various attempts of segmenting the data are explored. This idea of segmenting becomes complicated when we perform matrix vector computations. Because our data is evenly …


Tr-2013014: New Structured Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng Jan 2013

Tr-2013014: New Structured Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.


Tr-2013013: New Structured Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng Jan 2013

Tr-2013013: New Structured Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.


Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich Jan 2013

Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich

Departmental Technical Reports (CS)

In engineering situations, we usually have a large amount of prior knowledge that needs to be taken into account when processing data. Traditionally, the Bayesian approach is used to process data in the presence of prior knowledge. Sometimes, when we apply the traditional Bayesian techniques to engineering data, we get inconsistencies between the data and prior knowledge. These inconsistencies are usually caused by the fact that in the traditional approach, we assume that we know the {\it exact} sample values, that the prior distribution is {\it exactly} known, etc. In reality, the data is imprecise due to measurement errors, the …


From P-Boxes To P-Ellipsoids: Towards An Optimal Representation Of Imprecise Probabilities, Konstantin K. Semenov, Vladik Kreinovich Jan 2013

From P-Boxes To P-Ellipsoids: Towards An Optimal Representation Of Imprecise Probabilities, Konstantin K. Semenov, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the most widely used ways to represent a probability distribution is by describing its cumulative distribution function (cdf) F(x). In practice, we rarely know the exact values of F(x): for each x, we only know F(x) with uncertainty. In such situations, it is reasonable to describe, for each x, the interval [F(x)] of possible values of x. This representation of imprecise probabilities is known as a p-box; it is effectively used in many applications.

Similar interval bounds are possible for probability density function, for moments, etc. The problem is that when we transform from one of such representations …


Why Inverse F-Transform? A Compression-Based Explanation, Vladik Kreinovich, Irina Perlieva, Vilém Novák Jan 2013

Why Inverse F-Transform? A Compression-Based Explanation, Vladik Kreinovich, Irina Perlieva, Vilém Novák

Departmental Technical Reports (CS)

In many practical situations, e.g., in signal processing, image processing, analysis of temporal data, it is very useful to use fuzzy (F-) transforms. In an F-transform, we first replace a function x(t) by a few local averages (this is called forward F-transform), and then reconstruct the original function from these averages (this is called inverse F-transform). While the formula for the forward F-transform makes perfect intuitive sense, the formula for the inverse F-transform seems, at first glance, somewhat counter-intuitive. On the other hand, its empirical success shows that this formula must have a good justification. In this paper, we provide …


Relation Between Polling And Likert-Scale Approaches To Eliciting Membership Degrees Clarified By Quantum Computing, Renata Hax Sander Reiser, Adriano Maron, Lidiane Visintin, Ana Maria Abeijon, Vladik Kreinovich Jan 2013

Relation Between Polling And Likert-Scale Approaches To Eliciting Membership Degrees Clarified By Quantum Computing, Renata Hax Sander Reiser, Adriano Maron, Lidiane Visintin, Ana Maria Abeijon, Vladik Kreinovich

Departmental Technical Reports (CS)

In fuzzy logic, there are two main approaches to eliciting membership degrees: an approach based on polling experts, and a Likert-scale approach, in which we ask experts to indicate their degree of confidence on a scale -- e.g., on a scale form 0 to 10. Both approaches are reasonable, but they often lead to different membership degrees. In this paper, we analyze the relation between these two approaches, and we show that this relation can be made much clearer if we use models from quantum computing.


Aggregation Operations From Quantum Computing, Lidiane Visintin, Adriano Maron, Renata Reiser, Ana Maria Abeijon, Vladik Kreinovich Jan 2013

Aggregation Operations From Quantum Computing, Lidiane Visintin, Adriano Maron, Renata Reiser, Ana Maria Abeijon, Vladik Kreinovich

Departmental Technical Reports (CS)

Computer systems based on fuzzy logic should be able to generate an output from the handling of inaccurate data input by applying a rule based system. The main contribution of this paper is to show that quantum computing can be used to extend the class of fuzzy sets. The central idea associates the states of a quantum register to membership functions (mFs) of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary qTs. This paper introduces an interpretation of aggregations obtained by classical fuzzy states, that is, by multi-dimensional quantum register associated to mFs on …


A Symmetry-Based Approach To Selecting Membership Functions And Its Relation To Chemical Kinetics, Vladik Kreinovich, Olga Kosheleva, Jorge Y. Cabrera, Mario Gutierrez, Thavatchai Ngamsantivong Jan 2013

A Symmetry-Based Approach To Selecting Membership Functions And Its Relation To Chemical Kinetics, Vladik Kreinovich, Olga Kosheleva, Jorge Y. Cabrera, Mario Gutierrez, Thavatchai Ngamsantivong

Departmental Technical Reports (CS)

In many practical situations, we encounter physical quantities like time for which there is no fixed starting point for measurements: physical properties do not change if we simply change (shift) the starting point. To describe knowledge about such properties, it is desirable to select membership functions which are similarly shift-invariant. We show that while we cannot require that each membership function is shift-invariant, we can require that the linear space of all linear combinations of given membership functions is shift-invariant. We describe all such shift-invariant families of membership functions, and we show that they are naturally related to the corresponding …


Continuous Brightness Estimation (Cobe): Implementation And Its Possible Applications, G. Presti, Davide Andrea Mauro Jan 2013

Continuous Brightness Estimation (Cobe): Implementation And Its Possible Applications, G. Presti, Davide Andrea Mauro

Computer Sciences and Electrical Engineering Faculty Research

This paper presents a time-domain technique based solely on simple operations, like filtering and scaling, to continuously track a sound descriptor correlated to brightness and pitch. In opposition to existing algorithms this approach does not rely on input framing or frequencydomain transforms, ensuring a better temporal resolution and the possibility to model analog-like implementations. In the first part of the document we present the details of our approach to brightness estimation; then we will compare CoBE to the brightness estimation implemented in MIR Toolbox; we introduce and define the concept of “Equivalent Brightness Frequency” (EBF) and finally we show how …


Multiple Bounding Boxes Algorithm In Collision Detection And Its Performances In Sequential Vs Cuda Parallel Processing, Min Qi Jan 2013

Multiple Bounding Boxes Algorithm In Collision Detection And Its Performances In Sequential Vs Cuda Parallel Processing, Min Qi

Electronic Theses and Dissertations

The traditional method for detecting collisions in a 2D computer game uses a axisaligned bounding box around each sprite, and checks to determine if the bounding boxes overlap periodically. Using this single bounding box method may result in a large amount of pixel intersection tests, since a sprite may be composed of areas where the pixels are empty and the intersecting bounding box test results in false positives.

Our algorithm analysis shows that the optimal two or three bounding boxes is the best partition we can get for a reasonable time complexity. The results further show significantly diminishing returns for …


Reducing Communication Delay Variability For A Group Of Robots, Goncalo Martins Jan 2013

Reducing Communication Delay Variability For A Group Of Robots, Goncalo Martins

Electronic Theses and Dissertations

A novel architecture is presented for reducing communication delay variability for a group of robots. This architecture relies on using three components: a microprocessor architecture that allows deterministic real-time tasks; an event-based communication protocol in which nodes transmit in a TDMA fashion, without the need of global clock synchronization techniques; and a novel communication scheme that enables deterministic communications by allowing senders to transmit without regard for the state of the medium or coordination with other senders, and receivers can tease apart messages sent simultaneously with a high probability of success. This approach compared to others, allows simultaneous communications without …


Developing Focused Auditing Tools: A Practical Framework For Creating Formalized Multi-Level Security Policy Specifications, Barbara Ann Brough Jan 2013

Developing Focused Auditing Tools: A Practical Framework For Creating Formalized Multi-Level Security Policy Specifications, Barbara Ann Brough

Theses Digitization Project

The purpose of this study is that formalized policy specifications and focused penetration testing are needed to effectively audit any information system. Designing and maintaining the security system information is the primary duty of the cyber security professional. In today's world, nearly all government agencies manage some form of financial, defense, national security, and/or privacy information security policies. It is also necessary in this environment that agencies are accountable for auditing the security systems that protect this information.


California State University, San Bernardino Managing Cloud Computing Resources With Cloudstack Using Kvm Hypervisor, Ian Buckner Jacobs Jan 2013

California State University, San Bernardino Managing Cloud Computing Resources With Cloudstack Using Kvm Hypervisor, Ian Buckner Jacobs

Theses Digitization Project

The purpose of this project is to present a detailed description of the Enterprise Cloud Computing implementation of CloudStack using KVM. It will explain the purpose and features of the system, the interfaces of the system, what the system will do, and the constraints or limitations implementing CloudStack with the hardware available for this study.


Impact Of Varied Low Resolution Phantoms On Intensity Modulated Proton Therapy Dose Distributions, Aarohi Shyam Padhye Jan 2013

Impact Of Varied Low Resolution Phantoms On Intensity Modulated Proton Therapy Dose Distributions, Aarohi Shyam Padhye

Theses Digitization Project

The primary purpose of this thesis is to discuss the usefulness of image segmentation techniques in creating accurate proton dose distribution plans. The calculation of the proton dose distribution has to take into account the material (tissue, bone, brain) in the treatment area of the patients body.


Stereotactic Localization And Targeting Accuracy For Experimental Proton Radiosurgery, Yin Chen Jan 2013

Stereotactic Localization And Targeting Accuracy For Experimental Proton Radiosurgery, Yin Chen

Theses Digitization Project

The purpose of this study was to improve an existing experimental proton radiosurgery system at Loma Linda University Medical Center to reach sub-millimeter accuracy before proton radiosurgery with narrow beams can be used in a clinical trial. Protons, different from photons (i.e., x-rays or gamma rays), are charged with particles that slow down in matter and release a burst of energy near the end of their range (maximum depth of penetration), which is called the Bragg peak, named after the physicist William Henry Bragg who discovered it in 1903. Photon beams deliver most doses over a large area near the …


Application Of Social Network Metrics To A Trust-Aware Collaborative Model For Generating Personalized User Recommendations, Iraklis Varlamis, Magdalini Eirinaki, Malamati Louta Jan 2013

Application Of Social Network Metrics To A Trust-Aware Collaborative Model For Generating Personalized User Recommendations, Iraklis Varlamis, Magdalini Eirinaki, Malamati Louta

Faculty Publications

Social network analysis has emerged as a key technique in modern sociology, but has recently gained a lot of interest in Web mining research, because of the advent and the increasing popularity of social media, such as blogs, social networks, micro-blogging, customer review sites etc. Such media often serve as platforms for information dissemination and product placement or promotion. One way to improve the quality of recommendations provided to the members of social networks is to use trustworthy resources. In this environment, community-based reputation can help estimating the trustworthiness of individual users. Consequently, influence and trust are becoming essential qualities …


The Implementation Of A Thin Client In The Department Of Defense Network System, Sung Ju In Jan 2013

The Implementation Of A Thin Client In The Department Of Defense Network System, Sung Ju In

Theses Digitization Project

The purpose of this project is to introduce and analyze a thin client solution that could enhance the overall Department of Defense (DoD) network system as well as its IT security posture, minimize risk from external threats, and ease of network operations.


Asynchronous Cellular Automata, Kelechi Chidi Anuforo Jan 2013

Asynchronous Cellular Automata, Kelechi Chidi Anuforo

Theses Digitization Project

This study will investigate floating-point asynchronous cellular automata models implemented on Field-Programmable Gate Array (FPGA). It includes single grid and random schedules for individual cells. Cellular automata (CA) are basic representations of calculations that show interesting elaborate responses.


Quantum Cryptography, Razvan Augustin Dinu Jan 2013

Quantum Cryptography, Razvan Augustin Dinu

Theses Digitization Project

This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates.


3d Face Animation With Opengl Es: An Android Application, Ihab Mohamad Zbib Jan 2013

3d Face Animation With Opengl Es: An Android Application, Ihab Mohamad Zbib

Theses Digitization Project

Mobile applications have become ubiquitious with the increase in the popularity and computational power of mobile devices. They can now support rich multimedia user interactions. This project consists of the design and implementaiton of an Android application that renders and animates a three-dimensional model of a human head. The test is synthesized using an Android Text-to-Speech (TTS) engine. The application successfully implements a novel solution for the animated speech synchronization and opens the door for further work in the field of interactive animation. The project can be extended to become an interface for virtual remote communication or animated text messaging.


Online Examination System, Yuvesh Kumar Singh Jan 2013

Online Examination System, Yuvesh Kumar Singh

Theses Digitization Project

The purpose of this project focused on how to implement a secure environment for online-examination in an academic and business environment without the need of any special network topologies and hardware devices. It will not only reduce the instructor's load, but will also enhance the system flexibility to fit every instructor's needs and from the examinees point of view. Contains source code.


Gradebadge: Development Of A Cloud-Based Reward Application, Erwin Toni Soekianto Jan 2013

Gradebadge: Development Of A Cloud-Based Reward Application, Erwin Toni Soekianto

Theses Digitization Project

The purpose of this project is to investigate the use of cloud-based services to deliver cutting edge applications. For this purpose, a prototype of a reward application using badges, called Gradebadge, was developed to illustrate and explore this emerging paradigm.