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

Computer Sciences Commons™

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

2009

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 301 - 330 of 1345

Full-Text Articles in Computer Sciences

Visualization Of Hyperspectral Images, Mindy Schockling, Roberto Bonce, Angel Gutierrez, Stefan Robila Sep 2009

Visualization Of Hyperspectral Images, Mindy Schockling, Roberto Bonce, Angel Gutierrez, Stefan Robila

Department of Computer Science Faculty Scholarship and Creative Works

Hyperspectral images provide an innovative means for visualizing information about a scene or object that exists outside of the visible spectrum. Among other capabilities, hyperspectral image data enable detection of contamination in soil, identification of the minerals in an unfamiliar material, and discrimination between real and artificial leaves in a potted plant that are otherwise indistinguishable to the human eye. One of the drawbacks of working with hyperspectral data is that the massive amounts of information they provide requiring efficient means of being processed. In this study wavelet analysis was used to approach this problem by investigating the capabilities it …

Go to article

Verifying Stateful Timed Csp Using Implicit Clocks And Zone Abstraction, Jun Sun, Yang Liu, Jin Song Dong, Xian Zhang Sep 2009

Verifying Stateful Timed Csp Using Implicit Clocks And Zone Abstraction, Jun Sun, Yang Liu, Jin Song Dong, Xian Zhang

Research Collection School Of Computing and Information Systems

In this work, we study model checking of compositional real-time systems. A system is modeled using mutable data variables as well as a compositional timed process. Instead of explicitly manipulating clock variables, a number of compositional timed behavioral patterns are used to capture quantitative timing requirements, e.g. delay, timeout, deadline, timed interrupt, etc. A fully automated abstraction technique is developed to build an abstract finite state machine from the model. The idea is to dynamically create/delete clocks, and maintain/solve a constraint on the clocks. The abstract machine weakly bi-simulates the model and, therefore, LTL model checking or trace-refinement checking are …

Go to article

Refactoring Pipe-Like Mashups For End-User Programmers, Kathryn T. Stolee, Sebastian Elbaum Sep 2009

Refactoring Pipe-Like Mashups For End-User Programmers, Kathryn T. Stolee, Sebastian Elbaum

School of Computing: Technical Reports

Mashups are becoming increasingly popular as end users are able to easily access, manipulate, and compose data from many web sources. We have observed, however, that mashups tend to suffer from deficiencies that propagate as mashups are reused. To address these deficiencies, we would like to bring some of the benefits of software engineering techniques to the end users creating these programs. In this work, we focus on identifying code smells indicative of the deficiencies we observed in web mashups programmed in the popular Yahoo! Pipes environment. Through an empirical study, we explore the impact of those smells on end-user …

Go to article

A Statistical Method For Integrated Data Cleaning And Imputation, Chris Mayfield, Jennifer Neville, Sunil Prabhakar Sep 2009

A Statistical Method For Integrated Data Cleaning And Imputation, Chris Mayfield, Jennifer Neville, Sunil Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Homomorphic Encryption Based K-Out-Of-N Oblivious Transfer Protocols, Mummoorthy Murugesan, Wei Jiang, Erhan Nergiz, Serkan Uzunbaz Sep 2009

Homomorphic Encryption Based K-Out-Of-N Oblivious Transfer Protocols, Mummoorthy Murugesan, Wei Jiang, Erhan Nergiz, Serkan Uzunbaz

Department of Computer Science Technical Reports

No abstract provided.

Go to article

On The Price Of Stability For Undirected Network Design, Giorgos Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob Van Stee Sep 2009

On The Price Of Stability For Undirected Network Design, Giorgos Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob Van Stee

Computer Science Faculty Publications

No abstract provided.

Go to article

A Music Context For Teaching Introductory Computing, Ananya Misra, Doug Blank, Deepak Kumar Sep 2009

A Music Context For Teaching Introductory Computing, Ananya Misra, Doug Blank, Deepak Kumar

Computer Science Faculty Research and Scholarship

We describe myro.chuck, a Python module for controlling music synthesis, and its applications to teaching introductory computer science. The module was built within the Myro framework using the ChucK programming language, and was used in an introductory computer science course combining robots, graphics and music. The results supported the value of music in engaging students and broadening their view of computer science.

Go to article

Toward Automating Requirements Satisfaction Assessment, E. Ashlee Holbrook, Jane Huffman Hayes, Alex Dekhtyar Sep 2009

Toward Automating Requirements Satisfaction Assessment, E. Ashlee Holbrook, Jane Huffman Hayes, Alex Dekhtyar

Computer Science and Software Engineering

This paper introduces the automation of satisfaction assessment: the process of determining the satisfaction mapping of natural language textual requirements to natural language design elements. Satisfaction assessment is useful because it assists in discovering unsatisfied requirements early in the lifecycle when such issues can be corrected with lower cost and impact than later. We define the basic terms and concepts for this process and explore the feasibility of developing baseline methods for its automation. This paper describes the satisfaction assessment approach algorithmically and then evaluates the effectiveness of two proposed information retrieval (IR) methods in two industrial studies - one …

Go to article

Accelerating Sift On Parallel Architectures, Amy Apon, Seth Warn, Wesley Emeneker, Jackson Cothren Sep 2009

Accelerating Sift On Parallel Architectures, Amy Apon, Seth Warn, Wesley Emeneker, Jackson Cothren

Publications

SIFT is a widely-used algorithm that extracts features from images; using it to extract information from hundreds of terabytes of aerial and satellite photographs requires parallelization in order to be feasible. We explore accelerating an existing serial SIFT implementation with OpenMP parallelization and GPU execution.

Go to article

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet Sep 2009

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet

School of Computing: Conference and Workshop Papers

Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.

Go to article

Node Security In Hierarchical Sensor Networks: Distribution Of Functions Versus Keys, Biswajit Panja, Sanjay Madria Sep 2009

Node Security In Hierarchical Sensor Networks: Distribution Of Functions Versus Keys, Biswajit Panja, Sanjay Madria

Computer Science Faculty Research & Creative Works

Secure communication involving cluster heads in a sensor network is vital as they are responsible for data aggregation and for taking important decisions in their groups. in this article, we propose a scheme for secure communication via such nodes in a sensor network. in our approach, the base station provides a function to the cluster head of each group, which is used to compute the key for the secure communication with the base station. the protocol is first elucidated for a fixed cluster head in each group and later it is extended for dynamic cluster heads. Each function is computed …

Go to article

Why Quants Fail, M. Thulasidas Sep 2009

Why Quants Fail, M. Thulasidas

Research Collection School Of Computing and Information Systems

Mathematical finance is built on a couple of assumptions. The most fundamental of them is the one on ma ket efficiency. It states that the market prices every asset fairly, and that the prices contain all the information available in the market.

Go to article

Initial Framework For Measuring And Evaluating Heuristic Problem Solving, Zhisheng Huang, Annette Ten Teije, Frank Van Harmelen, Gaston Tagni, Hansjorg Neth, Lael Schooler, Sebastian Rudolph, Pascal Hitzler, Tuvshintur Tserendorj, Yi Huang, Danica Damljanovic, Angus Roberts Sep 2009

Initial Framework For Measuring And Evaluating Heuristic Problem Solving, Zhisheng Huang, Annette Ten Teije, Frank Van Harmelen, Gaston Tagni, Hansjorg Neth, Lael Schooler, Sebastian Rudolph, Pascal Hitzler, Tuvshintur Tserendorj, Yi Huang, Danica Damljanovic, Angus Roberts

Computer Science and Engineering Faculty Publications

One of the key aspects in the development of LarKC is how to evaluate the performance of the platform and its constituent components in order to guarantee that the execution of a pipeline will match the user’s needs and provide the desired solutions (answers) to the user’s queries. Therefore, in this deliverable, the first in a series three documents concerned with the definition of a Framework for Measuring and Evaluating Heuristic Problem Solving, we make the first steps towards defining such framework by considering the theoretical foundations and principles of evaluation and measurement theory, discussing several important aspects related to …

Go to article

Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov Sep 2009

Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov

Computer Science Faculty Publications

Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …

Go to article

Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle Sep 2009

Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle

Conference papers

This paper discusses a new approach to ‘watermarking’ digital signals using linear frequency modulated or ‘chirp’ coding. The principles underlying this approach are based on the use of a matched filter to provide a reconstruction of a chirped code that is uniquely robust in the case of signals with very low signal-to-noise ratios. Chirp coding for authenticating data is generic in the sense that it can be used for a range of data types and applications (the authentication of speech and audio signals, for example). The theoretical and computational aspects of the matched filter and the properties of a chirp …

Go to article

Activity-Aware Electrocardiogram-Based Passive Ongoing Biometric Verification, Janani C. Sriram Sep 2009

Activity-Aware Electrocardiogram-Based Passive Ongoing Biometric Verification, Janani C. Sriram

Dartmouth College Master’s Theses

Identity fraud due to lost, stolen or shared information or tokens that represent an individual's identity is becoming a growing security concern. Biometric recognition - the identification or verification of claimed identity, shows great potential in bridging some of the existing security gaps. It has been shown that the human Electrocardiogram (ECG) exhibits sufficiently unique patterns for use in biometric recognition. But it also exhibits significant variability due to stress or activity, and signal artifacts due to movement. In this thesis, we develop a novel activity-aware ECG-based biometric recognition scheme that can verify/identify under different activity conditions. From a pattern …

Go to article

Security And Network Analysis Using Simulation, Victor A. Clincy Sep 2009

Security And Network Analysis Using Simulation, Victor A. Clincy

Faculty Articles

ITGuru is a powerful simulation environment developed by OpNET Corporation. ITGuru is unique because of its ability to model the entire networking domain, including its routers, switches, protocols, servers, and the individual applications they support. ITGuru improves network researchers' and instructors' ability to identify and solve problems throughout the network. The OpNET Corporation provides a FREE academic copy of their simulation environment to universities for both teaching and research.

Go to article

Scientific Programming: The Promises Of Typed, Pure, And Lazy Functional Programming: Part Ii, Konstantin Läufer, George K. Thiruvathukal Sep 2009

Scientific Programming: The Promises Of Typed, Pure, And Lazy Functional Programming: Part Ii, Konstantin Läufer, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This second installment picks up where Konrad Hinsen's article "The Promises of Functional Programming" from the July/August 2009 issue left off, covering static type inference and lazy evaluation in functional programming languages.

Go to article

Reliability Analysis For The Advanced Electric Power Grid: From Cyber Control And Communication To Physical Manifestations Of Failure, Ayman Z. Faza, Sahra Sedigh, Bruce M. Mcmillin Sep 2009

Reliability Analysis For The Advanced Electric Power Grid: From Cyber Control And Communication To Physical Manifestations Of Failure, Ayman Z. Faza, Sahra Sedigh, Bruce M. Mcmillin

Electrical and Computer Engineering Faculty Research & Creative Works

The advanced electric power grid is a cyber-physical system comprised of physical components, such as transmission lines and generators, and a network of embedded systems deployed for their cyber control. The objective of this paper is to qualitatively and quantitatively analyze the reliability of this cyber-physical system. The original contribution of the approach lies in the scope of failures analyzed, which crosses the cyber-physical boundary by investigating physical manifestations of failures in cyber control. As an example of power electronics deployed to enhance and control the operation of the grid, we study Flexible AC Transmission System (FACTS) devices, which are …

Go to article

Vowel Recognition From Articulatory Position Time-Series Data, Jun Wang, Ashok Samal, Jordan R. Green, Tom D. Carrell Sep 2009

Vowel Recognition From Articulatory Position Time-Series Data, Jun Wang, Ashok Samal, Jordan R. Green, Tom D. Carrell

School of Computing: Conference and Workshop Papers

A new approach of recognizing vowels from articulatory position time-series data was proposed and tested in this paper. This approach directly mapped articulatory position time-series data to vowels without extracting articulatory features such as mouth opening. The input time-series data were time-normalized and sampled to fixed-width vectors of articulatory positions. Three commonly used classifiers, Neural Network, Support Vector Machine and Decision Tree were used and their performances were compared on the vectors. A single speaker dataset of eight major English vowels acquired using Electromagnetic Articulograph (EMA) AG500 was used. Recognition rate using cross validation ranged from 76.07% to 91.32% for …

Go to article

Exploiting Set-Level Non-Uniformity Of Capacity Demand To Enhance Cmp Cooperative Caching, Dongyuan Zhan, Hong Jiang, Sharad C. Seth Sep 2009

Exploiting Set-Level Non-Uniformity Of Capacity Demand To Enhance Cmp Cooperative Caching, Dongyuan Zhan, Hong Jiang, Sharad C. Seth

School of Computing: Technical Reports

As the Memory Wall remains a bottleneck for Chip Multiprocessors (CMP), the effective management of CMP last level caches becomes of paramount importance in minimizing expensive off-chip memory accesses. For the CMPs with private last level caches, Cooperative Caching (CC) has been proposed to enable capacity sharing among private caches by spilling an evicted block from one cache to another. But this eviction-driven CC does not necessarily promote cache performance since it implicitly favors the applications full of block evictions regardless of their real capacity demand. The recent Dynamic Spill-Receive (DSR) paradigm improves cooperative caching by prioritizing applications with higher …

Go to article

Multi-View Ear Recognition Based On Moving Least Square Pose Interpolation, Heng Liu, David Zhang, Zhiyuan Zhang Sep 2009

Multi-View Ear Recognition Based On Moving Least Square Pose Interpolation, Heng Liu, David Zhang, Zhiyuan Zhang

Research Collection School Of Computing and Information Systems

Based on moving least square, a multi-view ear pose interpolation and corresponding recognition approach is proposed. This work firstly analyzes the shape characteristics of actual trace caused by ear pose varying in feature space. Then according to training samples pose projection, we manage to recover the complete multi-view ear pose manifold by using moving least square pose interpolation. The constructed multi-view ear pose manifolds can be easily utilized to recognize ear images captured under different views based on finding the minimal projection distance to the manifolds. The experimental results and some comparisons show the new method is superior to manifold …

Go to article

Efficient Conditional Proxy Re-Encryption With Chosen-Ciphertext Security, Jian Weng, Yanjiang Yang, Qiang Tang, Robert H. Deng Sep 2009

Efficient Conditional Proxy Re-Encryption With Chosen-Ciphertext Security, Jian Weng, Yanjiang Yang, Qiang Tang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus is more useful in many applications. In this paper, based on a careful observation on the existing definitions and security notions for C-PRE, we re-formalize more rigorous definition and security notions for C-PRE. We further propose a more efficient C-PRE scheme, and prove its chosen-ciphertext security under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model. In addition, we point out that a recent C-PRE scheme …

Go to article

Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li Sep 2009

Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li

Research Collection School Of Computing and Information Systems

Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN …

Go to article

Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo Sep 2009

Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for the discovery of common patterns in a small set of images by region matching. The issues in feature robustness, matching robustness and noise artifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strategy, specifically with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation. However, the matching pattern of M2M is dispersed and unregulated in nature, leading to the challenges of mining a common pattern while identifying the underlying transformation. To avoid …

Go to article

A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy Sep 2009

A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy

Research Collection School Of Computing and Information Systems

The problem of polysemy in keyword-based image search arises mainly from the inherent ambiguity in user queries. We propose a latent model based approach that resolves user search ambiguity by allowing sense specific diversity in search results. Given a query keyword and the images retrieved by issuing the query to an image search engine, we first learn a latent visual sense model of these polysemous images. Next, we use Wikipedia to disambiguate the word sense of the original query, and issue these Wiki-senses as new queries to retrieve sense specific images. A sense-specific image classifier is then learnt by combining …

Go to article

Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang Sep 2009

Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang

Research Collection School Of Computing and Information Systems

Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM − tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the …

Go to article

Detecting Automotive Exhaust Gas Based On Fuzzy Inference System, Li. Shujin, Ming Bai, Quan Wang, Bo Chen, Xiaobing Zhao, Ting Yang, Zhaoxia Wang Sep 2009

Detecting Automotive Exhaust Gas Based On Fuzzy Inference System, Li. Shujin, Ming Bai, Quan Wang, Bo Chen, Xiaobing Zhao, Ting Yang, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

This paper proposes a method of detecting automotive exhaust gas based on fuzzy logic inference after analyzing the principle of the infrared automobile exhaust gas analyzer and the influence of the environmental temperature on analyzer. This paper analyses the measurement error caused by environmental temperature, and then makes a non-linear error correction of temperature for the infrared sensor using fuzzy inference. The results of simulation have clearly demonstrated that the proposed fuzzy compensation scheme is better than the non-fuzzy method.

Go to article

Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma Sep 2009

Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma

Research Collection School Of Computing and Information Systems

Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements (“streaming traffic”) while offering sufficient capacity over longer time intervals to delay-tolerant users (“elastic traffic”). While our strategy may not satisfy classical notions of fairness, we aim to reduce congestion and increase overall throughput of elastic users. Using time-scale decomposition, we develop approximations to evaluate the performance of our differentiated admission control strategy to support integrated services with transmission bit-rate requirements in a …

Go to article

Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu Sep 2009

Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user's relevance feedback is often provided for the top K retrieved items. In …

Go to article

First Prev Next Last