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

Computer Sciences Commons™

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

2015

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 451 - 480 of 2105

Full-Text Articles in Computer Sciences

Real-Time Laser Beam Alignment To A Remote Target Using Blob Detection And Filtration For Unmanned Mobile Spectroscopy Platform, Jarjees Ahmed Khidir Sep 2015

Real-Time Laser Beam Alignment To A Remote Target Using Blob Detection And Filtration For Unmanned Mobile Spectroscopy Platform, Jarjees Ahmed Khidir

Theses and Dissertations

In a project supported by NASA, a new unmanned air quality monitoring system has been proposed to look for signs of life on Mars. The system development and tests are specially directed to build an unmanned open-path spectrometer for near-ground biogenic gas concentration detection on Mars. Moved by a mobile robot platform, the spectrometer shoots an infra-red laser beam to a remote retro-reflector and examines the reflected signal looking for the absorption peak of the investigated gas. The problem is that the laser beam needs to be constantly aligned to the retro-reflect (the target) while the mobile robot is moving. …


Light-Weight Encryption And Dynamic Data Protection Mechanism For Resource-Constrained Devices, Maytham Mustafa Hammood Sep 2015

Light-Weight Encryption And Dynamic Data Protection Mechanism For Resource-Constrained Devices, Maytham Mustafa Hammood

Theses and Dissertations

Unattended wireless sensor networks (UWSNs) can assist a wide range of monitoring applications in hostile environment (e.g., battlefields, uncultivated fields, volcanic zones, underwater areas, etc.). However, they cannot offload captured or generated data to a sink in real time, and preservation of data at sensor nodes is important. In this work, we accomplish the availability and confidentiality of data in UWSNs. In case of failure or compromise of sensor nodes which can result in unavailability or loss of data, we propose an on-demand data replication method that can dynamically change the extent of replication to improve data survivability with minimal …


A Design For An Identity Resolution Service As An Extension Of The Entity Identity Information Management Model, Fumiko Kobayashi Sep 2015

A Design For An Identity Resolution Service As An Extension Of The Entity Identity Information Management Model, Fumiko Kobayashi

Theses and Dissertations

This research describes the design of an identity resolution service (IRS), which provides extensions and enhancements to the current EIIM model. The IRS provides a set of application programming interfaces (API) which allow identity resolution (IR) to be performed interactively. Interactive IR is a logical extension to the existing EIIM model. It will separate the IR function from the EIIM batch update process. The new (IR) function: 1) Operates interactively 2) Has its own probabilistic matching rules defined separately from the identity rules used in the EIIM update process 3) Has the ability to return a confidence rating alongside a …


Usability Of Error Messages For Introductory Students, Paul A. Schliep Sep 2015

Usability Of Error Messages For Introductory Students, Paul A. Schliep

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

Error messages are an important tool programmers use to help find and fix mistakes or issues in their code. When an error message is unhelpful, it can be difficult to find the issue and may impose additional challenges in learning the language and concepts. Error messages are especially critical for introductory programmers in understanding problems with their code. Unfortunately, not all error messages in programming are beneficial for novice programmers. This paper discusses the general usability of error messages for introductory programmers, analyses of error messages in compilers and DrRacket, and two methodologies intended to improve error handling.


Infotainment Interface Design For Automobiles, Ian R. Buck Sep 2015

Infotainment Interface Design For Automobiles, Ian R. Buck

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

In an increasingly connected, mobile world, situations where users do not interact with their digital lives are becoming few and far between. This can be a problem in situations that demand a user's attention for their safety. Driving is one such situation, and it is doubly important because a significant portion of the western population drives on a daily basis. Researchers have tested different interface designs with the goal of finding one that demands the least cognitive load while still allowing the user to perform the desired task efficiently. In this paper interfaces incorporating auditory cues, voice dictation, and air …


Fall 2015 Sep 2015

Fall 2015

In The Loop

Five minutes with Dean Miller; Snapshot: Enrollment trends; Behind the scenes at MayDay 2015; From class to career and back again; The intern files; Comedy in the classroom; Study abroad program bridges technology and business; Seen and heard; Alumni advice from Bill Gloff; The multimedia afterlife of Sherlock Holmes and related pursuits


Combining Interval And Probabilistic Uncertainty: What Is Computable?, Vladik Kreinovich, Andrzej Pownuk, Olga Kosheleva Sep 2015

Combining Interval And Probabilistic Uncertainty: What Is Computable?, Vladik Kreinovich, Andrzej Pownuk, Olga Kosheleva

Departmental Technical Reports (CS)

In many practical problems, we need to process measurement results. For example, we need such data processing to predict future values of physical quantities. In these computations, it is important to take into account that measurement results are never absolutely exact, that there is always measurement uncertainty, because of which the measurement results are, in general, somewhat different from the actual (unknown) values of the corresponding quantities. In some cases, all we know about measurement uncertainty is an upper bound; in this case, we have an interval uncertainty, meaning that all we know about the actual value is that is …


Network Topology Inference With Partial Information, Brett Holbert, Srikar Tati, Simone Silvestri, Thomas F. La Porta, Ananthram Swami Sep 2015

Network Topology Inference With Partial Information, Brett Holbert, Srikar Tati, Simone Silvestri, Thomas F. La Porta, Ananthram Swami

Computer Science Faculty Research & Creative Works

Full knowledge of the routing topology of the Internet is useful for a multitude of network management tasks. However, the full topology is often not known and is instead estimated using topology inference algorithms. Many of these algorithms use Traceroute to probe paths and then use the collected information to infer the topology. We perform real experiments and show that, in practice, routers may severely disrupt the operation of Traceroute and cause it to only provide partial information. We propose iTop, an algorithm for inferring the network topology when only partial information is available. iTop constructs a virtual topology, which …


Rate-Adaptive Concurrent Transmission Scheduling Schemes For Wpans With Directional Antennas, Maggie X. Cheng, Quanmin Ye, Lin Cai Sep 2015

Rate-Adaptive Concurrent Transmission Scheduling Schemes For Wpans With Directional Antennas, Maggie X. Cheng, Quanmin Ye, Lin Cai

Computer Science Faculty Research & Creative Works

We consider the concurrent transmission scheduling problem in a rate-adaptive wireless personal area network (WPAN). In such networks, the physical layer can adaptively change modulation and coding schemes based on the interference level in the environment and accordingly change the data rate. The scheduling problem is to assign users to time slots so that the total throughput is maximized. The challenge is that the achieved data rate of one flow is limited by the interference from other flows in the same slot, which is unknown until the schedule is known. We propose to discretize data rate into several distinct levels …


A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth Sep 2015

A Constraint Language For Static Semantic Analysis Based On Scope Graphs, Hendrik Van Antwerpen, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth

Computer Science Faculty Publications and Presentations

In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We treat name and type resolution as separate building blocks, but our approach can handle language constructs—such as record field access—for which binding and typing are mutually dependent.We also refine and extend our previous scope graph theory to address practical concerns including ambiguity checking and support for …


Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu Sep 2015

Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu

Scholarship and Professional Work - LAS

A graph G is called collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is the reduction of G if it is obtained from G by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs G of order n with d(u) + d(v) ≥ 2(n/p − …


A Gene-Based Association Method For Mapping Traits Using Reference Transcriptome Data, Eric R. Gamazon, Heather Wheeler, Kaanan P. Shah, Sahar V. Mozaffari, Keston Aquino-Michaels, Robert J. Carroll, Anne E. Eyler, Joshua C. Denny, Gtex Consortium, Dan L. Nicolae, Nancy J. Cox, Hae Kyung Im Sep 2015

A Gene-Based Association Method For Mapping Traits Using Reference Transcriptome Data, Eric R. Gamazon, Heather Wheeler, Kaanan P. Shah, Sahar V. Mozaffari, Keston Aquino-Michaels, Robert J. Carroll, Anne E. Eyler, Joshua C. Denny, Gtex Consortium, Dan L. Nicolae, Nancy J. Cox, Hae Kyung Im

Bioinformatics Faculty Publications

Genome-wide association studies (GWAS) have identified thousands of variants robustly associated with complex traits. However, the biological mechanisms underlying these associations are, in general, not well understood. We propose a gene-based association method called PrediXcan that directly tests the molecular mechanisms through which genetic variation affects phenotype. The approach estimates the component of gene expression determined by an individual’s genetic profile and correlates ‘imputed’ gene expression with the phenotype under investigation to identify genes involved in the etiology of the phenotype. Genetically regulated gene expression is estimated using whole-genome tissue-dependent prediction models trained with reference transcriptome data sets. PrediXcan enjoys …


Attribute Based Broadcast Encryption With Short Ciphertext And Decryption Key, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Xiaofeng Chen Sep 2015

Attribute Based Broadcast Encryption With Short Ciphertext And Decryption Key, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Xiaofeng Chen

Research Collection School Of Computing and Information Systems

Attribute Based Broadcast Encryption (ABBE) is a combination of Attribute Based Encryption (ABE) and Broadcast Encryption (BE). It allows a broadcaster (or encrypter) to broadcast an encrypted message that can only be decrypted by the receivers who are within a predefined user set and satisfy the access policy specified by the broadcaster. Compared with normal ABE, ABBE allows direct revocation, which is important in many real-time broadcasting applications such as Pay TV. In this paper, we propose two novel ABBE schemes that have distinguishing features: the first scheme is key-policy based and has short ciphertext and constant size decryption key; …


Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong Sep 2015

Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

A microblog repost tree provides strong clues on how an event described therein develops. To help social media users capture the main clues of events on microblogging sites, we propose a novel repost tree summarization framework by effectively differentiating two kinds of messages on repost trees called leaders and followers, which are derived from contentlevel structure information, i.e., contents of messages and the reposting relations. To this end, Conditional Random Fields (CRF) model is used to detect leaders across repost tree paths. We then present a variant of random-walk-based summarization model to rank and select salient messages based on the …


Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun Sep 2015

Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun

Research Collection School Of Computing and Information Systems

Stack Overflow is a popular on-line question and answer site for software developers to share their experience and expertise. Among the numerous questions posted in Stack Overflow, two or more of them may express the same point and thus are duplicates of one another. Duplicate questions make Stack Overflow site maintenance harder, waste resources that could have been used to answer other questions, and cause developers to unnecessarily wait for answers that are already available. To reduce the problem of duplicate questions, Stack Overflow allows questions to be manually marked as duplicates of others. Since there are thousands of questions …


Evidence For Unnatural-Parity Contributions To Electron-Impact Ionization Of Laser-Aligned Atoms, G. S. J. Armstrong, J. Colgan, M. S. Pindzola, S. Amami, Don H. Madison, J. Pursehouse, K. L. Nixon, A. J. Murray Sep 2015

Evidence For Unnatural-Parity Contributions To Electron-Impact Ionization Of Laser-Aligned Atoms, G. S. J. Armstrong, J. Colgan, M. S. Pindzola, S. Amami, Don H. Madison, J. Pursehouse, K. L. Nixon, A. J. Murray

Physics Faculty Research & Creative Works

Recent measurements have examined the electron-impact ionization of excited-state laser-aligned Mg atoms. In this work we show that the ionization cross section arising from the geometry where the aligned atom is perpendicular to the scattering plane directly probes the unnatural parity contributions to the ionization amplitude. The contributions from natural parity partial waves cancel exactly in this geometry. Our calculations resolve the discrepancy between the nonzero measured cross sections in this plane and the zero cross section predicted by distorted-wave approaches. We demonstrate that this is a general feature of ionization from p-state targets by additional studies of ionization from …


Clustering Data Of Mixed Categorical And Numerical Type With Unsupervised Feature Learning, Dao Lam, Mingzhen Wei, Donald C. Wunsch Sep 2015

Clustering Data Of Mixed Categorical And Numerical Type With Unsupervised Feature Learning, Dao Lam, Mingzhen Wei, Donald C. Wunsch

Geosciences and Geological and Petroleum Engineering Faculty Research & Creative Works

Mixed-type categorical and numerical data are a challenge in many applications. This general area of mixed-type data is among the frontier areas, where computational intelligence approaches are often brittle compared with the capabilities of living creatures. In this paper, unsupervised feature learning (UFL) is applied to the mixed-type data to achieve a sparse representation, which makes it easier for clustering algorithms to separate the data. Unlike other UFL methods that work with homogeneous data, such as image and video data, the presented UFL works with the mixed-type data using fuzzy adaptive resonance theory (ART). UFL with fuzzy ART (UFLA) obtains …


On The Multidimensional Stable Marriage Problem, Jared Duker Lichtman Sep 2015

On The Multidimensional Stable Marriage Problem, Jared Duker Lichtman

Computer Science Technical Reports

We provide a problem definition of the stable marriage problem for a general number of parties p under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural way and present so called elemental and compound algorithms to generate matchings for a problem instance. We demonstrate the stability of matchings generated by both algorithms, as well as show that the former runs in O(pn^2) time.


Mobisurround: An Auditory User Interface For Geo-Service Delivery, Keith Gardiner, Charlie Cullen, James Carswell Sep 2015

Mobisurround: An Auditory User Interface For Geo-Service Delivery, Keith Gardiner, Charlie Cullen, James Carswell

Conference papers

This paper describes original research carried out in the area of Location-Based Services (LBS) with an emphasis on Auditory User Interfaces (AUI) for content delivery. Previous work in this area has focused on accurately determining spatial interactions and informing the user mainly by means of the visual modality. mobiSurround is new research that builds upon these principles with a focus on multimodal content delivery and navigation and in particular the development of an AUI. This AUI enables the delivery of rich media content and natural directions using audio. This novel approach provides a hands free method for navigating a space …


Simulations Of Hl-Lhc Crab Cavity Noise Using Headtail, Stanley Steeper Sep 2015

Simulations Of Hl-Lhc Crab Cavity Noise Using Headtail, Stanley Steeper

Physics

The High Luminosity Large Hadron Collider (Hi-Lumi LHC) upgrade -- scheduled to be completed by 2025 -- will improve the existing LHC in many ways. One such upgrade is the addition of Crab Cavities (CCs). The CCs are resonant structures that provide strong transverse kicks to the circulating clouds of particles around each interaction region. As such, the CCs result in a head-on collision of the clouds and a large increase in event rate, leading to reduced statistical uncertainty and potentially faster discoveries. However, the CC field will be modulated by phase and amplitude noise which can have detrimental effects …


Automatic Emotion Identification From Text, Wenbo Wang Sep 2015

Automatic Emotion Identification From Text, Wenbo Wang

Kno.e.sis Publications

Emotions are both prevalent in and essential to most aspects of our lives. They in- fluence our decision-making, affect our social relationships and shape our daily behavior. With the rapid growth of emotion-rich textual content, such as microblog posts, blog posts, and forum discussions, there is a growing need to develop algorithms and techniques for identifying people’s emotions expressed in text. It has valuable implications for the studies of suicide prevention, employee productivity, well-being of people, customer relationship management, etc. However, emotion identification is quite challenging partly due to the following reasons: i) It is a multi-class classification problem that …


Rfid Microscope Lab, Patricia Carranza Sep 2015

Rfid Microscope Lab, Patricia Carranza

Computer Engineering

The RFID Microscope Lab is a new exhibit created for the San Luis Obispo Children's Museum. The goal of the project is to create a modern, interactive exhibit that will teach children about different natural specimens through the use of technology. A computer, custom software, and RFID technology, will be used to display facts, microscopic images, and short videos of ten different specimens.


Era Of Big Data: Danger Of Descrimination, Andra Gumbus, Frances Grodzinsky Sep 2015

Era Of Big Data: Danger Of Descrimination, Andra Gumbus, Frances Grodzinsky

WCBT Faculty Publications

We live in a world of data collection where organizations and marketers know our income, our credit rating and history, our love life, race, ethnicity, religion, interests, travel history and plans, hobbies, health concerns, spending habits and millions of other data points about our private lives. This data, mined for our behaviors, habits, likes and dislikes, is referred to as the “creep factor” of big data [1]. It is estimated that data generated worldwide will be 1.3 zettabytes (ZB) by 2016. The rise of computational power plus cheaper and faster devices to capture, collect, store and process data, translates into …


The Kumaraswamy-G Poisson Family Of Distributions, Manoel Wallace A. Ramos, Pedro Rafael D. Marinho, Gauss M. Cordeiro, Ronaldo V. Da Silva, Gholamhossein Hamedani Sep 2015

The Kumaraswamy-G Poisson Family Of Distributions, Manoel Wallace A. Ramos, Pedro Rafael D. Marinho, Gauss M. Cordeiro, Ronaldo V. Da Silva, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

For any baseline continuous G distribution, we propose a new generalized family called the Kumaraswamy-G Poisson (denoted with the prefix “Kw-GP”) with three extra positive parameters. Some special distributions in the new family such as the Kw-Weibull Poisson, Kw-gamma Poisson and Kw-beta Poisson distributions are introduced. We derive some mathematical properties of the new family including the ordinary moments, generating function and order statistics. The method of maximum likelihood is used to fit the distributions in the new family. We illustrate its potentiality by means of an application to a real data set.


Fast Inference For Interactive Models Of Text, Jeffrey A. Lund Sep 2015

Fast Inference For Interactive Models Of Text, Jeffrey A. Lund

Theses and Dissertations

Probabilistic models of text are a useful tool for enabling the analysis of large collections of digital text. For example, Latent Dirichlet Allocation can quickly produce topical summaries of large collections of text documents. Many important uses cases of such models include human interaction during the inference process for these models of text. For example, the Interactive Topic Model extends Latent Dirichlet Allocation to incorporate human expertiese during inference in order to produce topics which are better suited to individual user needs. However, interactive use cases of probabalistic models of text introduce new constraints on inference - the inference procedure …


Real-Time Targeted Influence Maximization For Online Advertisements, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan Sep 2015

Real-Time Targeted Influence Maximization For Online Advertisements, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Advertising in social network has become a multi-billion dollar industry. A main challenge is to identify key influencers who can effectively contribute to the dissemination of information. Although the influence maximization problem, which finds a seed set of k most influential users based on certain propagation models, has been well studied, it is not target-aware and cannot be directly applied to online advertising. In this paper, we propose a new problem, named Keyword-Based Targeted Influence Maximization (KB-TIM), to find a seed set that maximizes the expected influence over users who are relevant to a given advertisement. To solve the problem, …


Developing Java Programs On Android Mobile Phones Using Speech Recognition, Santhrushna Gande Sep 2015

Developing Java Programs On Android Mobile Phones Using Speech Recognition, Santhrushna Gande

Electronic Theses, Projects, and Dissertations

Nowadays Android operating system based mobile phones and tablets are widely used and had millions of users around the world. The popularity of this operating system is due to its multi-tasking, ease of access and diverse device options. “Java Programming Speech Recognition Application” is an Android application used for handicapped individuals who are not able or have difficultation to type on a keyboard. This application allows the user to write a compute program (in Java Language) by dictating the words and without using a keyboard. The user needs to speak out the commands and symbols required for his/her program. The …


Bioinformatics Approaches To Single-Cell Analysis In Developmental Biology, Dicle Yalcin, Zeynep M. Hakguder, Hasan H. Otu Sep 2015

Bioinformatics Approaches To Single-Cell Analysis In Developmental Biology, Dicle Yalcin, Zeynep M. Hakguder, Hasan H. Otu

Department of Electrical and Computer Engineering: Faculty Publications

Individual cells within the same population show various degrees of heterogeneity, which may be better handled with single-cell analysis to address biological and clinical questions. Single-cell analysis is especially important in developmental biology as subtle spatial and temporal differences in cells have significant associations with cell fate decisions during differentiation and with the description of a particular state of a cell exhibiting an aberrant phenotype. Biotechnological advances, especially in the area of microfluidics, have led to a robust, massively parallel and multi-dimensional capturing, sorting, and lysis of single-cells and amplification of related macromolecules, which have enabled the use of imaging …


Cobweb: A Robust Map Update System Using Gps Trajectories, Zhangqing Shan, Hao Wu, Weiwei Sun, Baihua Zheng Sep 2015

Cobweb: A Robust Map Update System Using Gps Trajectories, Zhangqing Shan, Hao Wu, Weiwei Sun, Baihua Zheng

Research Collection School Of Computing and Information Systems

The accuracy and completeness of a digital map plays a critical role in determining the quality of most location-based services. Unfortunately, road networks change frequently. Consequently, we study the issue of automatic map update in this paper. We propose a system called COBWEB which takes all the unmatched trajectories as input and generates the missing road segments with both the geometry properties and topology features well preserved. We conduct a comprehensive experimental study via real trajectory data generated by roughly 15,000 taxis in Singapore within a 5-month period. Compared with existing work, COBWEB demonstrates a better and more stable performance …


Near-Duplicate Image Retrieval Based On Contextual Descriptor, Jinliang Yao, Bing Yang, Qiuming Zhu Sep 2015

Near-Duplicate Image Retrieval Based On Contextual Descriptor, Jinliang Yao, Bing Yang, Qiuming Zhu

Computer Science Faculty Publications

The state of the art of technology for near-duplicate image retrieval is mostly based on the Bag-of-Visual-Words model. However, visual words are easy to result in mismatches because of quantization errors of the local features the words represent. In order to improve the precision of visual words matching, contextual descriptors are designed to strengthen their discriminative power and measure the contextual similarity of visual words. This paper presents a new contextual descriptor that measures the contextual similarity of visual words to immediately discard the mismatches and reduce the count of candidate images. The new contextual descriptor encodes the relationships of …