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

Computer Sciences Commons™

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

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 451 - 480 of 1262

Full-Text Articles in Computer Sciences

Separation Of Ssl Protocol Phases Across Process Boundaries, Kirthikar Anantharam May 2006

Separation Of Ssl Protocol Phases Across Process Boundaries, Kirthikar Anantharam

Theses

Secure Sockets Layer is the de-facto standard used in the industry today for secure communications through web sites. An SSL connection is established by performing a Handshake, which is followed by the Record phase. While the SSL Handshake is computationally intensive and can cause of bottlenecks on an application server, the Record phase can cause similar bottlenecks while encrypting large volumes of data.

SSL Accelerators have been used to improve the performance of SSL-based application servers. These devices are expensive, complex to configure and inflexible to customizations. By separating the SSL Handshake and the Record phases into separate software processes, …


Dynamic Recomposition Of Documents From Distributed Data Sources, Abhishek Verma May 2006

Dynamic Recomposition Of Documents From Distributed Data Sources, Abhishek Verma

Theses

Dynamic recomposition of documents refers to the process of on-the-fly creation of documents. A document can be generated from several documents that are stored at distributed data sites. The source can be queried and results obtained in the form of XML. These XML documents can be combined after a series of transformation operations to obtain the target document. The resultant document can be stored statically or in the form of a command, which can be invoked later to recompose this document dynamically. Also, in case a change is made to a document, then only the change can be stored, instead …


A Data Gathering Toolkit For Biological Information Integration, Munira Lokhandwala May 2006

A Data Gathering Toolkit For Biological Information Integration, Munira Lokhandwala

Theses

SYSTERS is a biological information integration system containing protein sequences from many protein databases such as Swiss-Prot and TrEMBL and also protein sequences from complete genomes available at Ensembl, The Arabidopsis Information Resource, SGD and GeneDB. For some protein sequences their encoding nucleotide sequences can be found in their corresponding websites. However, for some protein sequences their encoding nucleotide sequences are missing.

The goal of this thesis is to. collect all nucleotide sequences for the protein sequences in SYSTERS and store them in a common database. There are two cases. The first case is that if the nucleotide sequences can …


Network Activity Arising From Optimal Diameters Of Neuronal Processes, Juliane Gansert May 2006

Network Activity Arising From Optimal Diameters Of Neuronal Processes, Juliane Gansert

Theses

Electrical coupling provides an important pathway for signal transmission between neurons. In several regions of the mammalian brain electrical synapses have been detected, and their role in the synchronization of neural networks and the generation of oscillations has been studied theoretically. Recently, it has been found that the amplitude of the postsynaptic potential is maximized for a specific diameter of the postsynaptic fiber.

In this thesis, the impact of the fiber's diameter on the success or failure of the action potential initiation and propagation is studied theoretically. Systems of two coupled neurons, as well as small networks, are investigated. The …


Finding Role Errors Of The Ncit Gene Hierarchy Using The Ncbi, Marc Oren May 2006

Finding Role Errors Of The Ncit Gene Hierarchy Using The Ncbi, Marc Oren

Theses

Due to the knowledge discovery process of gene information, details such as organism and chromosomal location should be known. Furthermore, the extensive biomedical research in genomics led to discovery of processes and diseases in which a gene plays a role. In the Gene hierarchy of the NCI Thesaurus (NCIT) such knowledge is represented by appropriate roles. However, upon review of the Gene hierarchy of the NCIT, many role errors are found. Realizing that such details are provided by another knowledge repository of NIH, the NCBI gene database, a methodology is presented to use NCBI to discover role errors for the …


Comparative Analysis Of Parametric, Nonparametric And Permutation Methods For Differential Expression, Rahul Patil May 2006

Comparative Analysis Of Parametric, Nonparametric And Permutation Methods For Differential Expression, Rahul Patil

Theses

DNA microarrays permit us to study the expression of thousands of genes simultaneously. They are now used in many different contexts to compare mRNA levels between two or more samples of cells. Microarray experiments typically give us expression measurements on a large number of genes. Increasing popularity of microarray technology has resulted in a number of tests being proposed to detect differentials expression.

The purpose of study is to compare the parametric, non parametric and permutation tests when applied to microarray data for differential expression analysis. t test (parametric), Mann Whitney test (nonparametric) and Significance of analysis (permutation ) test …


The Effects Of Limited Rebuild Buffer And Track Buffers On Rebuild Time In Raid5, Chintan Shah May 2006

The Effects Of Limited Rebuild Buffer And Track Buffers On Rebuild Time In Raid5, Chintan Shah

Theses

Redundant Arrays of Independent Disks (RAID) are very popular for creating large, reliable storage systems. A RAID array consists of multiple independent disks that achieve fault tolerance by parity coding. The contents on a failed disk can be reconstructed on demand by reading and exciusive-ORing the corresponding blocks on surviving disks. Upon disk failure, the array enters rebuild mode when it begins to systematically reconstruct the data of the failed disk on a spare disk, provided one is available. The fundamental element of rebuild is the Rebuild Unit (RU).

Surviving disks engaged in rebuild, process user requests at a higher …


Smart Home Technology For Aging, Fareedh Meeran May 2006

Smart Home Technology For Aging, Fareedh Meeran

Theses

The majority of the growing population, in the US and the rest of the world requires some degree of formal and or informal care either due to the loss of function or failing health as a result of aging and most of them suffer from chronic disorders. The cost and burden of caring for elders is steadily increasing. This thesis focuses on providing the analysis of the technologies with which a Smart Home is built to improve the quality of life of the elderly. A great deal of emphasis is given to the sensor technologies that are the back bone …


First Acm Sigplan Workshop On Languages, Compilers And Hardware Support For Transactional Computing, Jan Vitek, Suresh Jagannathan May 2006

First Acm Sigplan Workshop On Languages, Compilers And Hardware Support For Transactional Computing, Jan Vitek, Suresh Jagannathan

Department of Computer Science Technical Reports

No abstract provided.


Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth May 2006

Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom May 2006

Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom

Theses and Dissertations

Many interesting real-world applications for temporal data mining are hindered by concept drift. One particular form of concept drift is characterized by changes to the underlying feature space. Seemingly little has been done to address this issue. This thesis presents FAE, an incremental ensemble approach to mining data subject to concept drift. FAE achieves better accuracies over four large datasets when compared with a similar incremental learning algorithm.


Analytic Framework For Calculating Brdfs Of Randomly Rough Surfaces, Yinlong Sun May 2006

Analytic Framework For Calculating Brdfs Of Randomly Rough Surfaces, Yinlong Sun

Department of Computer Science Technical Reports

No abstract provided.


Multi-Quality Data Replication In Multimedia Databases, Yi-Cheng Tu, Sunil Prabhakar, Jingfeng Yan, Gang Shen May 2006

Multi-Quality Data Replication In Multimedia Databases, Yi-Cheng Tu, Sunil Prabhakar, Jingfeng Yan, Gang Shen

Department of Computer Science Technical Reports

No abstract provided.


Simulator For Undergraduate Multi-Agent Systems, Charles Smith May 2006

Simulator For Undergraduate Multi-Agent Systems, Charles Smith

Computer Science Honors Theses

In recent years, Multi-Agent Systems (MAS) have for the first time begun to be accepted in mainstream computing. Software companies haave been founded focusing purely on MAS software, telecommunications companies now use agent-based technologies in cell phones, and there have even been two successful DARPA funded, military-grade defense projects in the past ten years. The growth in demand development tools available. The various development platforms focus on mobile devices, large-scale distributed systems, and specific research applications; however, these tools leave an important facet of MAS development unsatisfied--undergraduate research and teaching. Each of the solutions available is either too complex, too …


Distributed Computation In An Interactive Entertainment Environment, Robert Zinchak May 2006

Distributed Computation In An Interactive Entertainment Environment, Robert Zinchak

Computer Science Honors Theses

The proliferation of multiplayer games has led to an increase in the total network capacity for processing power in games; this capacity, however, is seldom fully utilized or balanced. One prominent problem of distributed processing in a gaming environment is increased latency time-- which causes player disinterest in the game, potentially causing poor sales as well as the termination of future commercial development of this technology. Existing distributed techniques such as OpenMP, MPI or VMPI are not well suited to gaming applications and may introduce additional overhead. This thesis describes a simple, yet effective technique (based on existing ideas in …


Artificial Societies, Virtual Worlds, And Their Meaningful Integration, Andrew Krausnick May 2006

Artificial Societies, Virtual Worlds, And Their Meaningful Integration, Andrew Krausnick

Computer Science Honors Theses

Artificial societies and virtual worlds are two areas of interest to modern social scientists that are distinctly separate in modern academic study, and are yet undeniably related. Artificial societies are multi-agent systems comprised of autonomous social agents, programmed with their own set of rules and behavior. While virtual worlds are occupied in large part by human controlled agents participating in a collective virtual experience and space. Within both types of virtual environments there can be found a scarcity of resources and intricate cross-entity interaction. This often results in the development and evolution of complex economic and cultural structures. In addition, …


Trust Negotiation For Open Database Access Control, Paul A. Porter May 2006

Trust Negotiation For Open Database Access Control, Paul A. Porter

Theses and Dissertations

Hippocratic databases are designed to protect the privacy of the individuals whose personal information they contain. This thesis presents a model for providing and enforcing access control in an open Hippocratic database system. Previously unknown individuals can gain access to information in the database by authenticating to roles through trust negotiation. Allowing qualified strangers to access the database increases the usefulness of the system without compromising privacy. This thesis presents the design and implementation of two methods for filtering information from database queries. First, we extend a query modification method for use in an open database system. Second, we introduce …


A Comparative Study Of State Emulation In Functional Programming Languages, William Brick May 2006

A Comparative Study Of State Emulation In Functional Programming Languages, William Brick

Computer Science Honors Theses

We examine the methods of emulating state in functional languages. In particular, we investigate the languages J, Scheme, and Haskell; the latter two being representative of the Lisp and ML families, respectively. We provide example code for state emulation in terms of object-orientation and compare this to object-oriented programming without use of state.


Strategies For Encoding Xml Documents In Relational Databases: Comparisons And Contrasts., Jonathan Lee Leonard May 2006

Strategies For Encoding Xml Documents In Relational Databases: Comparisons And Contrasts., Jonathan Lee Leonard

Electronic Theses and Dissertations

The rise of XML as a de facto standard for document and data exchange has created a need to store and query XML documents in relational databases, today's de facto standard for data storage. Two common strategies for storing XML documents in relational databases, a process known as document shredding, are Interval encoding and ORDPATH Encoding. Interval encoding, which uses a fixed mapping for shredding XML documents, tends to favor selection queries, at a potential cost of O(N) for supporting insertion queries. ORDPATH Encoding, which uses a looser mapping for shredding XML, supports fixed-cost insertions, at a potential cost of …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 7, May 2006, College Of Engineering And Computer Science, Wright State University May 2006

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 7, May 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Houston, We Have A Success Story: Technology Transfer At The Nasa Iv&V Facility, Ken Mcgill, Wes Deadrick, Jane Huffman Hayes, Alex Dekhtyar May 2006

Houston, We Have A Success Story: Technology Transfer At The Nasa Iv&V Facility, Ken Mcgill, Wes Deadrick, Jane Huffman Hayes, Alex Dekhtyar

Computer Science and Software Engineering

This paper details, from the point of view of researchers and from the point of view of program managers, the development of and technology transfer from NASA’s research program in Independent Verification and Validation (IV&V).


Modeling And Simulation Of The Videoray Pro Iii Underwater Vehicle, Wei Wang, Christopher M. Clark May 2006

Modeling And Simulation Of The Videoray Pro Iii Underwater Vehicle, Wei Wang, Christopher M. Clark

Computer Science and Software Engineering

Accurate modeling and simulation of underwater vehicles is essential for autonomous control. In this paper, we present a dynamic model of the VideoRay Pro III microROV, in which the hydrodynamic derivatives are determined both theoretically and experimentally, based on the assumption that the motions in different directions are decoupled. The experiments show that this assumption is reasonable within operating conditions of the VideoRay Pro III. A computer simulation with 3D graphics is also developed to help user to visualize the vehicle's motion.


Architectural Tradeoffs For Unifying Campus Grid Resources, Amy Apon, Bart Taylor May 2006

Architectural Tradeoffs For Unifying Campus Grid Resources, Amy Apon, Bart Taylor

Publications

Most universities have a powerful collection of computing resources on campus for use in areas from high performance computing to general access student labs. However, these resources are rarely used to their full potential. Grid computing offers a way to unify these resources and to better utilize the capability they provide. The complexity of some grid tools makes learning to use them a daunting task for users not familiar with using the command line. Combining these tools together into a single web portal interface provides campus faculty and students with an easy way to access the campus resources. This paper …


Relative Clock Drift Rate Based Secure Time Synchronization For Wireless Sensor Networks, Jae Sung Choi May 2006

Relative Clock Drift Rate Based Secure Time Synchronization For Wireless Sensor Networks, Jae Sung Choi

Computer Science and Engineering Theses - Archive

Time synchronization is critical issue to many wireless sensor network applications such that target tracking, TDMA radio scheduling, and secure localization. However, the most of existing time synchronization algorithms in wireless sensor networks did not consider malicious attacks in hostile environments. In this thesis, we propose a Relative Clock Drift Rate Based Secure Time Synchronization (RSTS) schemes to address security problems. RSTS alleviates delay attacks and incorrect time stamp transmissions caused by external or internal malicious attackers. We discuss a simple estimation technique to calculate a relative clock drift rate between sender-receiver clocks, because the estimated relative clock drift rate …


Towards Optimum Play-Out Buffering Delay In Voice Over Ip, Ruchir Pramod Shende May 2006

Towards Optimum Play-Out Buffering Delay In Voice Over Ip, Ruchir Pramod Shende

Computer Science and Engineering Theses - Archive

Voice over Internet Protocol (VoIP) or transmission of real-time voice packets over the Internet is slowly emerging as a cost-effective alternative to the traditional Public Switched Telephone Network (PSTN). However, varying end-to-end delay and packet loss, which are inherent in a packet-switched network like the Internet, lead to relatively lower quality of VoIP calls. The call quality can be improved by adaptively adjusting the play-out buffer at the receiver to reduce the impact of the delay and jitter. A standard play-out strategy uses a weighted moving average of the mean and variance of network delay to adaptively set the play-out …


Reducing Price Fluctuation In Continuous Double Auctions Through Pricing Policy And Shout Improvement, Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sklar May 2006

Reducing Price Fluctuation In Continuous Double Auctions Through Pricing Policy And Shout Improvement, Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sklar

Publications and Research

Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions, especially continuous double auctions, makes it difficult to apply the usual analytic game-theoretic methods. This paper takes an experimental approach, searching a parameterized space of possible auction types, and presents a new pricing policy for continuous double auctions. The paper further demonstrates how this policy, together with a shout improvement rule, helps to reduce the fluctuation of transaction prices in auctions involving agents with minimum intelligence while keeping the overall …


Concept-Based Search Using Parallel Query Expansion, Rahul Rajiv Joshi May 2006

Concept-Based Search Using Parallel Query Expansion, Rahul Rajiv Joshi

Computer Science and Engineering Theses - Archive

We address the problem of irrelevant results for short queries on Web search engines. Short queries fail to provide sufficient context to disambiguate possible meanings associated with the search terms resulting in a set of irrelevant pages that the user has to filter through navigation and sometimes examination. First, we predict the potential concept topics, which are the domains for the search terms. This prediction is based on word occurrences and relationships observed in the various domains (categories) of a corpus. Next, we expand the search terms in each of the predicted domains in parallel. We then submit separate queries, …


Ubca: A Utility Based Clustering Architecture For Peer-To-Peer Networks, Brent Lagesse May 2006

Ubca: A Utility Based Clustering Architecture For Peer-To-Peer Networks, Brent Lagesse

Computer Science and Engineering Theses - Archive

Use of the Peer-to-Peer (P2P) architecture has recently spread in popularity. File sharing and ad hoc networks have contributed to the architecture's usage. P2P generates new challenges in scalability, fairness, and quality of service. Current solutions tend to fall into two main areas: incentives and system design. Incentive-based approaches appeal to the self-interested nature of peers by requiring service to the system in order to access resources. System design includes distributed hash tables and graph-theoretical based designs which have seen some success, but also result in new problems. We introduce a Utility-Based Clustering Architecture, UBCA, designed to address scalability, fairness, …


Alternative Architectures For Improving Document Readability, Ankur Bora May 2006

Alternative Architectures For Improving Document Readability, Ankur Bora

Computer Science and Engineering Theses - Archive

A number of tools have been developed to improve the readability of documents. These tools assist users to make changes which result in an easy to read document. Most of these tools were developed for users who work independently with little interaction with other users. However, in recent years, because of the proliferation of Internet, there has been increased collaboration between users. A user may need to share his document repositories with others so that both can benefit. Another set of users may work with information from a specific domain. These domains may be located in different geographical areas. Some …


Anytime Top-K Queries On Exact And Fuzzy Data, Bhushan P. Chaudhari May 2006

Anytime Top-K Queries On Exact And Fuzzy Data, Bhushan P. Chaudhari

Computer Science and Engineering Theses - Archive

Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this thesis, we initiate research on the anytime behavior of top-k algorithms on exact and fuzzy data. In particular given specific topk algorithms we are interested in studying their progress towards identification of the correct result at any point of the algorithms' execution. We adopt a probabilistic approach where we seek to report at any point the scores of the top-k results the algorithm has identified, as well as associate a confidence with this prediction. Such functionality can be a valuable asset when …