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

Physical Sciences and Mathematics Commons™

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

2006

Computer Sciences

Computer Science Faculty Research & Creative Works

Articles 1 - 19 of 19

Full-Text Articles in Physical Sciences and Mathematics

A P2p Integration Architecture For Protein Resources, K. T. Claypool, Sanjay Kumar Madria Oct 2006

A P2p Integration Architecture For Protein Resources, K. T. Claypool, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The availability of a direct pathway from a primary sequence (denovo or DNA derived) to macromolecular structure to biological function using computer-based tools is the ultimate goal for a protein scientist. Today's state of the art protein resources and on-going research and experiments provide the raw data that can enable protein scientists to achieve at least some steps of this goal. Thus, protein scientists are looking towards taking their benchtop research from the specific to a much broader base of using the large resources of available electronic information. However, currently the burden falls on the scientist to manually interface with …

Go to article

Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria Sep 2006

Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey …

Go to article

A Methodology For Structured Object-Oriented Elicitation And Analysis Of Temporal Constraints In Hardware/Software Co-Analysis And Co-Design Of Real-Time Systems, Sun Yan, Xiaoqing Frank Liu, Bruce M. Mcmillin Sep 2006

A Methodology For Structured Object-Oriented Elicitation And Analysis Of Temporal Constraints In Hardware/Software Co-Analysis And Co-Design Of Real-Time Systems, Sun Yan, Xiaoqing Frank Liu, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The hardware/software co-design of a high-quality real-time system relies heavily on the modeling of both the hardware and software components from three aspects: structures, functionalities, and constraints, especially the temporal constraints. However, there is not a systematic process for the elicitation and analysis of temporal constraints in hardware/software co-design. Furthermore, existing object-oriented methods provide no means for the explicit specification of system/component constraints in object models. This paper presents a systematic methodology for structured object-oriented analysis and specification of temporal constraints in hardware/software co-analysis and co-design using an extended High-Order Object-Oriented Modeling Technique (HOOMT). This methodology hierarchically elicits and analyzes …

Go to article

An Instance-Based Structured Object Oriented Method For Co-Analysis/Co-Design Of Concurrent Embedded Systems, Matt Ryan, Xiaoqing Frank Liu, Bruce M. Mcmillin, Ying Cheng, Sule Simsek Sep 2006

An Instance-Based Structured Object Oriented Method For Co-Analysis/Co-Design Of Concurrent Embedded Systems, Matt Ryan, Xiaoqing Frank Liu, Bruce M. Mcmillin, Ying Cheng, Sule Simsek

Computer Science Faculty Research & Creative Works

The current object-oriented class-based approaches to hardware/software co-analysis/co-design of embedded systems are limited in their abilities to properly capture the structure of individual instances of hardware and software components and their interactions. This paper discusses a methodology to extend a structured objectoriented hardware/software co-design methodology based on the High Order Object-oriented Modeling Technique (HOOMT) to incorporate instance-based object and behavioral models. The instance-based structured object-oriented methodology will enable description of a system's structure based on individual instances of hardware and software components and specification of the interactions among them. In addition, lattices are introduced to specify the concurrent behavior of …

Go to article

Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria Jul 2006

Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount …

Go to article

Genetic Code Based Coding And Mathematical Formulation For Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn Jun 2006

Genetic Code Based Coding And Mathematical Formulation For Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn

Computer Science Faculty Research & Creative Works

DNA computation is to use DNA molecules for information storing and processing. Challenges currently faced by DNA computation are (1) lack of theoretical computational models for applications, and (2) high error rate for implementation. This paper attempts to address these problems from genetic coding and mathematical modeling aspects. The proposed genetic coding approach provides a promising alternative to reduce high error rate. The mathematical formulation lays down groundwork for studying theoretical aspects of DNA computation.

Go to article

Data Replication For Improving Data Accessibility In Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara Jan 2006

Data Replication For Improving Data Accessibility In Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara

Computer Science Faculty Research & Creative Works

In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks. In this paper, we solve this problem by replicating data items on mobile hosts. First, we propose three replica allocation methods assuming that each data item is not updated. In these three methods, we take into account the access frequency from mobile hosts to each data item and the status of the network connection. Then, we extend the proposed methods by considering aperiodic updates and integrating user profiles consisting of mobile users'' schedules, access behavior, and read/write patterns. We also show …

Go to article

Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape Jan 2006

Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape

Computer Science Faculty Research & Creative Works

This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such systems, a certain amount of data loss without recovery may be tolerated. The key issue is to define and verify the correctness in the presence of these lost data frames under real-time constraints. This paper describes a temporal verification that if the end processes do not detect that too many frames are lost, defined by comparison of error counters against given threshold values, then there will be a bounded delay between transmission of …

Go to article

Improving Channel Throughput Of Wlans And Ad Hoc Networks Using Explicit Denial Of Requests, Maggie Xiaoyan Cheng, Yadi Ma, Yi Wang Jan 2006

Improving Channel Throughput Of Wlans And Ad Hoc Networks Using Explicit Denial Of Requests, Maggie Xiaoyan Cheng, Yadi Ma, Yi Wang

Computer Science Faculty Research & Creative Works

A new Multiple Access Control scheme for wireless ad hoc networks and WLANs is proposed. This scheme uses explicit denial of channel requests and a busy tone to improve channel throughput. Performance analysis shows significant improvement when the network is under heavy traffic load.

Go to article

A Mathematical Formulation Of Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn Jan 2006

A Mathematical Formulation Of Dna Computation, Mingjun Zhang, Maggie Xiaoyan Cheng, Tzyh-Jong Tarn

Computer Science Faculty Research & Creative Works

DNA computation is to use DNA molecules for information storing and processing. The task is accomplished by encoding and interpreting DNA molecules in suspended solutions before and after the complementary binding reactions. DNA computation is attractive, due to its fast parallel information processing, remarkable energy efficiency, and high storing capacity. Challenges currently faced by DNA computation are (1) lack of theoretical computational models for applications, and (2) high error rate for implementation. This paper attempts to address these problems from mathematical modeling and genetic coding aspects. The first part of this paper presents a mathematical formulation of DNA computation. The …

Go to article

Cadre: A Collaborative Replica Allocation And Deallocation Approach For Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa Jan 2006

Cadre: A Collaborative Replica Allocation And Deallocation Approach For Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa

Computer Science Faculty Research & Creative Works

This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. The main contributions of CADRE are two-fold. First, it collaboratively performs both replica allocation and deallocation in tandem to facilitate optimal replication and to avoid 'thrashing' conditions. Second, it addresses fair replica allocation across the MHs. CADRE deploys a hybrid super-peer architecture in which some of the MHs act as the 'gateway nodes' (GNs) in a given region. GNs facilitate both search and replication. Our performance study indicates that CADRE indeed …

Go to article

Window Query Processing With Proxy Cache, Gao Xing, John Sustersic, A. R. Hurson Jan 2006

Window Query Processing With Proxy Cache, Gao Xing, John Sustersic, A. R. Hurson

Computer Science Faculty Research & Creative Works

A location dependent query (LDQ) result set is valid only in a specific region called the validity region (VR). While limiting the validity of a particular result set to a given area, the VR may also be used in caching implementations to determine if cached results satisfy semantically equivalent queries. Existing LDQ caching schemes rely on the database servers to provide the VR at a cost of high computational overhead. Alternatively, a LDQ proxy cache, which approximates the VR can be employed, freeing the database servers from the high cost of calculating the VR. A LDQ proxy cache architecture is …

Go to article

Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok Jan 2006

Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok

Computer Science Faculty Research & Creative Works

Recent years saw the rapid development of peer-topeer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topologies and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could remedy the technological constraints of P2P networks. However, traditional caching techniques have some major shortcomings that make them unsuitable for similarity search, such as the lack of semantic locality representation and the rigidness of exact matching on data objects. To facilitate the efficient similarity …

Go to article

Practical Experiences In Using Model-Driven Engineering To Develop Trustworthy Computing Systems, Thomas Weigert, Frank Weil Jan 2006

Practical Experiences In Using Model-Driven Engineering To Develop Trustworthy Computing Systems, Thomas Weigert, Frank Weil

Computer Science Faculty Research & Creative Works

In this paper, we describe how Motorola has deployed model-driven engineering in product development, in particular for the development of trustworthy and highly reliable telecommunications systems, and outline the benefits obtained. Model-driven engineering has dramatically increased both the quality and the reliability of software developed in our organization, as well as the productivity of our software engineers. Our experience demonstrates that model-driven engineering significantly improves the development process for trustworthy computing systems.

Go to article

A Hierarchical Secure Routing Protocol Against Black Hole Attacks In Sensor Networks, Jian Yin, Sanjay Kumar Madria Jan 2006

A Hierarchical Secure Routing Protocol Against Black Hole Attacks In Sensor Networks, Jian Yin, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

A black hole attack is a severe attack that can be easily employed against routing in sensor networks. In a black hole attack, a malicious node spuriously announces a short route to the sink node (the destination) to attract additional traffic to the malicious node and then drops them. In this paper, we propose a hierarchical secure routing protocol for detecting and defending against black hole attacks. The proposed protocol uses only symmetric key cryptography to discover a safe route against black hole attacks. The comparison of the proposed protocol with two other existing approaches proves that the proposed scheme …

Go to article

An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu Jan 2006

An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu

Computer Science Faculty Research & Creative Works

Modern product design is a very complicated process which involves groups of designers, manufacturers, suppliers, and customer representatives. Conflicts are unavoidable in collaboration among multiple stakeholders, who have different objectives, requirements, and priorities. Unfortunately, current web-based collaborative engineering design systems do not support collaborative conflict resolution. In this paper, we will develop an intelligent computational argumentation model to enable management of a large scale argumentation network, and resolution of conflicts based on argumentation from many participants. A web-based intelligent argumentation tool is developed as a part of a web-based collaborative engineering design system based on the above model to resolve …

Go to article

Energy And Communication Efficient Group Key Management Protocol For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava Jan 2006

Energy And Communication Efficient Group Key Management Protocol For Hierarchical Sensor Networks, Biswajit Panja, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

In this paper, we describe group key management protocosl for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as input. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the sensor nodes within a group, and the other in a group of cluster heads. The protocol handles …

Go to article

Generalized Distance Metric As A Robust Similarity Measure For Mobile Object Trajectories, Garima Pathak, Sanjay Kumar Madria, Spandan Tiwari Jan 2006

Generalized Distance Metric As A Robust Similarity Measure For Mobile Object Trajectories, Garima Pathak, Sanjay Kumar Madria, Spandan Tiwari

Computer Science Faculty Research & Creative Works

In this paper, we propose a novel generalized distance metric based on a model that incorporates the time axis explicitly. The proposed metric is based fundamentally on the Mahalanobis distance metric, which eliminates the correlation and scaling errors in similarity searches on trajectory databases. We propose the incorporation of a weight matrix in the proposed distance metric, which allows for easy manipulation of the degree of significance of the different spatial and or temporal dimensions.

Go to article

Secrout: A Secure Routing Protocol For Sensor Networks, Jian Yin, Sanjay Kumar Madria Jan 2006

Secrout: A Secure Routing Protocol For Sensor Networks, Jian Yin, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

In this paper, we present a secure routing protocol for sensor networks (SecRout) to safeguard sensor networks under different types of attacks. The SecRout protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path (previous and next nodes) to the destination. It guarantees that the destination will be able to identify and discard the tampered messages and ensure that the messages received are not tampered. Comparing the performance with non-secure routing protocol AODV (ad hoc on demand distance vector routing), the SecRout protocol only has a small byte …

Go to article