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

Computer Sciences Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 391 - 420 of 1206

Full-Text Articles in Computer Sciences

Establishing Public Confidence In The Viability Of Fingerprint Biometric Technology, Nathan Alan Green Jul 2005

Establishing Public Confidence In The Viability Of Fingerprint Biometric Technology, Nathan Alan Green

Theses and Dissertations

The most common personal authentication techniques used for identity management employ a secret PIN or password that must be remembered. The challenge, for a given user, is that a multitude of such codes must be recalled over the course of the day for transactions involving distinct computer applications. Password mania prevails. Fingerprint biometric technology is an ideal alternate solution to this password recall problem. In spite of their availability for nearly thirty years, fingerprint biometric systems still remain uncommon in public sectors of industry such as education, government, and technology. Technology has improved sufficiently that false acceptance and rejection rates …

Go to article

Accelerated Ray Traced Animations Exploiting Temporal Coherence, Darwin Tarry Baines Jul 2005

Accelerated Ray Traced Animations Exploiting Temporal Coherence, Darwin Tarry Baines

Theses and Dissertations

Ray tracing is a well-know technique for producing realistic graphics. However, the time necessary to generate images is unacceptably long. When producing the many frames that are necessary for animations, the time is magnified. Many methods have been proposed to reduce the calculations necessary in ray tracing. Much of the effort has attempted to reduce the number of rays cast or to reduce the number of intersection calculations. Both of these techniques exploit spatial coherence. These acceleration techniques are expanded not only to exploit spatial coherence but also to exploit temporal coherence in order to reduce calculations by treating animation …

Go to article

Development Of A Web Based Inventory Management System For A Small Retail Business, Chiranjib Sanyal Jul 2005

Development Of A Web Based Inventory Management System For A Small Retail Business, Chiranjib Sanyal

Regis University Student Publications (comprehensive collection)

This project proposes a technical solution that will improve the inventory management for a small business company. The project envisions a situation where a company currently uses a client server based inventory management system in each store. The current system depends upon the store managers for inventory control functions like purchase order creation and inventory usage recording. Currently, each store sends the inventory consumption and ordering information to the corporate office on a weekly basis. As a result, the corporate office doesn't get up-to-date information on inventory level in the stores on a daily basis. Also, there is no established …

Go to article

Task Localization, Similarity, And Transfer; Towards A Reinforcement Learning Task Library System, James Lamond Carroll Jul 2005

Task Localization, Similarity, And Transfer; Towards A Reinforcement Learning Task Library System, James Lamond Carroll

Theses and Dissertations

This thesis develops methods of task localization, task similarity discovery, and task transfer for eventual use in a reinforcement learning task library system, which can effectively “learn to learn,” improving its performance as it encounters various tasks over the lifetime of the learning system.

Go to article

Suitability Of The Nist Shop Data Model As A Neutral File Format For Simulation, Gregory Brent Harward Jul 2005

Suitability Of The Nist Shop Data Model As A Neutral File Format For Simulation, Gregory Brent Harward

Theses and Dissertations

Due to the successful application in internet related fields, Extensible Markup Language (XML) and its related technologies are being explored as a revolutionary software file format technology used to provide increased interoperability in the discrete-event simulation (DES) arena. The National Institute of Standards and Technology (NIST) has developed an XML-based information model (XSD) called the Shop Data Model (SDM), which is used to describe the contents of a neutral file format (NFF) that is being promoted as a means to make manufacturing simulation technology more accessible to a larger group of potential customers. Using a two step process, this thesis …

Go to article

Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher Jul 2005

Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher

All Computer Science and Engineering Research

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for on-demand power adaptation and efficient neighborhood discovery. Simulations based on …

Go to article

Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang Jul 2005

Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang

Computer Science Faculty Research & Creative Works

Cryptographic protocols have been widely used to protect communications over insecure network environments. Existing cryptographic protocols usually contain flaws. To analyze these protocols and find potential flaws in them, the secure properties of them need be studied in depth. This paper attempts to provide a new framework to analyze and prove the secure properties in these protocols. A number of predicates and action functions are used to model the network communication environment. Domain rules are given to describe the transitions of principals' knowledge and belief states. An example of public key authentication protocols has been studied and analysed.

Go to article

Interactive Preferences And Decision-Theoretic Planning, Derek Williams, Kyle Bailey, Alex Dekhtyar, Judy Goldsmith, Beth Goldstein, Raphael Finkel, Joan Mazur Jul 2005

Interactive Preferences And Decision-Theoretic Planning, Derek Williams, Kyle Bailey, Alex Dekhtyar, Judy Goldsmith, Beth Goldstein, Raphael Finkel, Joan Mazur

Computer Science and Software Engineering

We introduce a suite of interlinked software tools for eliciting preferences, doing decision-theoretic planning, and displaying the plans. The software allows a user to walk through possible trajectories, adjust preferences, and compare potential trajectories. This paper focuses on the elicitation process, the plan display, and interactions between the two.

Go to article

Localization Of Multiple Robots With Simple Sensors, Mike Peasgood, Christopher M. Clark, John Mcphee Jul 2005

Localization Of Multiple Robots With Simple Sensors, Mike Peasgood, Christopher M. Clark, John Mcphee

Computer Science and Software Engineering

This paper presents a distributed particle filter algorithm for localizing multiple mobile robots that are equipped only with low cost/low power sensors. This method is applicable to multi-micro robot systems, where size limitations restrict sensor selection (e.g. small infrared range finders). Localization of three robots in a known environment is conducted by combining measurements from a small number of simple range sensors with inter-robot distances obtained through an acoustic range finder system. The localization problem is formulated as estimating the global position and orientation of a single triangle, where corners of the triangle represent the positions of robots. The robot …

Go to article

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni Jul 2005

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

This paper develops a modular approach to improving effectiveness of searching documents for information by reusing and integrating mature software components such as Lucene APIs, WORDNET, LSA techniques, and domain-specific controlled vocabulary. To evaluate the practical benefits, the prototype was used to query MEDLINE database, and to locate domain-specific controlled vocabulary terms in Materials and Process Specifications. Its extensibility has been demonstrated by incorporating a spell-checker for the input query, and by structuring the retrieved output into hierarchical collections for quicker assimilation. It is also being used to experimentally explore the relationship between LSA and document clustering using 20-mini-newsgroups and …

Go to article

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo Jul 2005

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo

Computer Science and Engineering Dissertations - Archive

This thesis investigates game theory based rate control algorithms for optimizing the bit allocation in video compression. The first algorithm utilizes the cooperative bargaining game in a MB level rate control algorithm to optimize the perceptual quality while guaranteeing "fairness" in bit allocation among macroblocks. The algorithm first allocates the target bits to frames based on their coding complexity; a method to estimate the coding complexity of the remaining frames is proposed. Next, macroblocks of a frame play cooperative games such that each macroblock competes for a share of resources (bits) to optimize its quantization scale while considering the human …

Go to article

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler Jul 2005

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Knowledge representation and reasoning on the Semantic Web is done by means of ontologies. While the quest for suitable ontology languages is still ongoing, OWL [5] has been established as a core standard. It comes in three flavours, as OWL Full, OWL DL and OWL Lite, where OWL Full contains OWL DL, which in turn contains OWL Lite. The latter two coincide semantically with certain description logics and can thus be considered fragments of first-order predicate logic.

Go to article

Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha Jul 2005

Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha

Computer Science and Engineering Theses - Archive

Wireless sensor networks have been recognized as one of the most important technologies in the networking world. Security of sensor networks is one of the major concerns today. To this end, a whole suite of protocols have been designed to provide various security features which includes key management. This thesis covers the issue of group key management in wireless sensor networks. Traditional cryptographic techniques can be used to provide communication privacy and integrity, but do not provide scalable solutions to group key management. A group key management scheme for sensor networks has been discussed that targets at fast response to …

Go to article

Distributed Streaming For Video On Demand, Shraddha Rumade Jul 2005

Distributed Streaming For Video On Demand, Shraddha Rumade

Computer Science and Engineering Theses - Archive

With the advent of digital media, implementing reliable Video on Demand (VoD) systems over the best effort Internet is a potential issue. Distributed streaming for Video on Demand presents a combination of two techniques. The first being Distributed Video Streaming using Multicast (DVSM) [1] involves video streaming from multiple servers to overcome path congestion. The second technique, Asynchronous Hybrid mechanism for Video on Demand [2] implements segmentation-based periodic broadcast to effectively share network bandwidth. In this work we aim at providing path diversity of multiple senders and maximizing bandwidth sharing via multicast. We exploit alternate paths in case of congestion …

Go to article

Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood Jul 2005

Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood

Computer Science and Engineering Dissertations - Archive

Markov models provide a useful representation of system behavioral actions and state observations, but they do not scale well. Utilizing a hierarchy and abstraction through hierarchical hidden Markov models (HHMMs) improves scalability, but these structures are usually constructed manually using knowledge engineering techniques. We introduce a new method of automatically constructing HHMMs using the output of a sequential data-mining algorithm, Episode Discovery, and apply it to solving automation problems in the intelligent environment domain. Repetitive behavioral actions in sensor rich environments such as smart homes can be observed and categorized into periodic and frequent episodes through data-mining techniques utilizing the …

Go to article

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan Jul 2005

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular technique to embed machine-processable semantics into a text document with tabular data via annotations, resulting sometimes in ill-formed XML fragments, and evaluate this technique vis a vis document querying, manipulation, and integration. The ultimate aim is to be able to author and extract human-readable and machine-comprehensible parts of …

Go to article

The Use Of Multi-Beam Sonars To Image Bubbly Ship Wakes, R Lee Culver, Thomas C. Weber, David L. Bradley Jul 2005

The Use Of Multi-Beam Sonars To Image Bubbly Ship Wakes, R Lee Culver, Thomas C. Weber, David L. Bradley

Center for Coastal and Ocean Mapping

During the past five years, researchers at Penn State University (PSU) have used upward-looking multi-beam (MB) sonar to image the bubbly wakes of surface ships. In 2000, a 19-beam, 5° beam width, 120° sector, 250 kHz MB sonar integrated into an autonomous vehicle was used to obtain a first-of-a-kind look at the three-dimensional variability of bubbles in a large ship wake. In 2001 we acquired a Reson 8101 MB sonar, which operates at 240 kHz and features 101-1.5º beams spanning a 150º sector. In July 2002, the Reson sonar was deployed looking upward from a 1.4 m diameter buoy moored …

Go to article

Multibiometrics Based On Palmprint And Handgeometry, Xiao-Yong Wei, Dan Xu, Chong-Wah Ngo Jul 2005

Multibiometrics Based On Palmprint And Handgeometry, Xiao-Yong Wei, Dan Xu, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper described our approach of multibiometrics in a single image. Firstly, a new method for capturing the key points of hand geometry is proposed. Then, we described our new method of palmprint feature extracting. By using projection transform and wavelet transform, this method considered both the global feature and local detail of a palmprint texture and proposed a new kind of palmprint feature. We also proposed a twice segmentation method for handgeometry feature extraction. In the processing of feature matching, we analyzed the weakness of the traditional Euclidian Square Norm method, and introduced an improved method. The experimental results …

Go to article

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo Jul 2005

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normalized cut (NC). Initially, OM is employed to measure the visual similarity between all pairs of events under the one-to-one mapping constraint among video shots. Then, news events are represented as a complete weighted graph and NC is carried out to globally and optimally partition the graph into event clusters. Finally, based on the cluster size and globality of events, hot events can be automatically detected and selected as the summaries of …

Go to article

Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell Jul 2005

Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell

Computer Science Faculty Research & Creative Works

Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph's vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power …

Go to article

Dream: A Theoretical Analysis, Xueying Qi Jul 2005

Dream: A Theoretical Analysis, Xueying Qi

Computer Science Theses & Dissertations

A Mobile Ad-hoc Network (MANET, for short) is a collection of mobile nodes deployed in support of a short-lived special-purpose operation. Examples include search-and-rescue missions, law-enforcement, multimedia classrooms, and among many others. Unlike cellular or satellite networks, MANET do not rely on any form of pre-existing infrastructure. The mobility of nodes combined with the lack of infrastructure makes routing in MANET notoriously difficult. It was recently suggested that routing in MANET can use to advantage geographic information that the nodes may acquire either by endowing them with a GPS chip or simply by using known localization algorithms. Distance Routing Effect …

Go to article

Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad Jul 2005

Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad

Electrical & Computer Engineering Theses & Dissertations

Automatic speech recognizers perform poorly when training and test data are systematically different in terms of noise and channel characteristics. One manifestation of such differences is variations in the probability density functions (pdfs) between training and test features. Consequently, both automatic speech recognition and automatic speaker identification may be severely degraded. Previous attempts to mm1m1ze this problem include Cepstral Mean and Variance Normalization and transforming all speech features to a uni-variate Gaussian pdf. In this thesis, two techniques are presented for non-linearly scaling speech features to fit them to a target pdf - the first is based on the principles …

Go to article

Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid Jul 2005

Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid

Computational Modeling & Simulation Engineering Theses & Dissertations

Obtaining a well behaved soft-tissue model is one of the most challenging and important tasks in the development of surgical simulation systems. Achieving both accurate and real-time deformation response from a soft-tissue model becomes more difficult as the complexity of the represented anatomy and the degree of deformation increases. One common approach to modeling deformable objects is the Mass-Spring (MS) system method. Mass-Spring systems are attractive to real-time applications due to their relatively low computational requirement and ease of implementation. However, their parameter determination is typically done manually, which becomes tedious when accurate approximation to real-world objects is desired. This …

Go to article

Mining Frequent And Periodic Association Patterns, Guanling Chen, Heng Huang, Minkyong Kim Jul 2005

Mining Frequent And Periodic Association Patterns, Guanling Chen, Heng Huang, Minkyong Kim

Computer Science Technical Reports

Profiling the clients' movement behaviors is useful for mobility modeling, anomaly detection, and location prediction. In this paper, we study clients' frequent and periodic movement patterns in a campus wireless network. We use offline data-mining algorithms to discover patterns from clients' association history, and analyze the reported patterns using statistical methods. Many of our results reflect the common characteristics of a typical academic campus, though we also observed some unusual association patterns. There are two challenges: one is to remove noise from data for efficient pattern discovery, and the other is to interpret discovered patterns. We address the first challenge …

Go to article

Towards Tiny Trusted Third Parties, Alexander Iliev, Sean Smith Jul 2005

Towards Tiny Trusted Third Parties, Alexander Iliev, Sean Smith

Computer Science Technical Reports

Many security protocols hypothesize the existence of a {\em trusted third party (TTP)} to ease handling of computation and data too sensitive for the other parties involved. Subsequent discussion usually dismisses these protocols as hypothetical or impractical, under the assumption that trusted third parties cannot exist. However, the last decade has seen the emergence of hardware-based devices that, to high assurance, can carry out computation unmolested; emerging research promises more. In theory, such devices can perform the role of a trusted third party in real-world problems. In practice, we have found problems. The devices aspire to be general-purpose processors but …

Go to article

More Efficient Secure Function Evaluation Using Tiny Trusted Third Parties, Alexander Iliev, Sean Smith Jul 2005

More Efficient Secure Function Evaluation Using Tiny Trusted Third Parties, Alexander Iliev, Sean Smith

Computer Science Technical Reports

Secure Function Evaluation (SFE) problems. We assume that a really trustworthy TTP device will have very limited protected memory and computation environment---a \emph{tiny TTP}. This precludes trivial solutions like "just run the function in the TTP". Traditional scrambled circuit evaluation approaches to SFE have a very high overhead in using indirectly-addressed arrays---every array access's cost is linear in the array size. The main gain in our approach is that array access can be provided with much smaller overhead---$O(\sqrt{N}\log N)$. This expands the horizon of problems which can be efficiently solved using SFE. Additionally, our technique provides a simple way to …

Go to article

Structural Analysis Of Social Networks With Wireless Users, Guanling Chen, David Kotz Jul 2005

Structural Analysis Of Social Networks With Wireless Users, Guanling Chen, David Kotz

Computer Science Technical Reports

Online interactions between computer users form Internet-based social networks. In this paper we present a structural analysis of two such networks with wireless users. In one network the wireless users participate in a global file-sharing system, and in the other they interact with each other through a local music-streaming application.

Go to article

Cs 208: Computer Programming For Business I, Dennis Kellermeier Jul 2005

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.

Go to article

Cs 466/666: Introduction To Formal Languages, Krishnaprasad Thirunarayan Jul 2005

Cs 466/666: Introduction To Formal Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines). Along with presenting the fundamentals, this course will develop and examine relationships among the various specification methods for the regular languages and the context-free languages, in detail. Overall, we plan to cover the first seven chapters of the text book.

Go to article

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler Jul 2005

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms can be used for the study of structural properties of knowledge represented in formal contexts, with applications to data transformation and merging. In this paper we present a comprehensive treatment of some of the most important morphisms in FCA and their relationships, including dual bonds, scale measures, infomorphisms, and their respective relations to Galois connections. We summarize our results in a concept lattice that cumulates the relationships among the considered morphisms. The purpose of this work is to …

Go to article

First Prev Next Last