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

Computer Sciences Commons™

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

Missouri University of Science and Technology

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1321 - 1350 of 1938

Full-Text Articles in Computer Sciences

Automatic Drift Compensation Using Phase Correlation Method For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani, Eric W. Bohannan Mar 2008

Automatic Drift Compensation Using Phase Correlation Method For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani, Eric W. Bohannan

Electrical and Computer Engineering Faculty Research & Creative Works

Nanomanipulation and nanofabrication with an atomic force microscope (AFM) or other scanning probe microscope (SPM) are a precursor for nanomanufacturing. It is still a challenging task to accomplish nanomanipulation automatically. In ambient conditions without stringent environmental controls, the task of nanomanipulation requires extensive human intervention to compensate for the spatial uncertainties of the SPM. Among these uncertainties, the thermal drift, which affects spatial resolution, is especially hard to solve because it tends to increase with time, and cannot be compensated simultaneously by feedback from the instrument. In this paper, a novel automatic compensation scheme is introduced to measure and estimate …

Go to article

Garuda: Achieving Effective Reliability For Downstream Communication In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz Feb 2008

Garuda: Achieving Effective Reliability For Downstream Communication In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz

Computer Science Faculty Research & Creative Works

There exist several applications of sensor networks where the reliability of data delivery can be critical. Although the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed and are unique to the environment of wireless sensor networks. We then propose a scalable framework for reliable downstream data delivery that is specifically designed to both address and leverage the characteristics of the wireless sensor networks …

Go to article

A Suite Of Robust Controllers For The Manipulation Of Microscale Objects, Qinmin Yang, Jagannathan Sarangapani Feb 2008

A Suite Of Robust Controllers For The Manipulation Of Microscale Objects, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

A suite of novel robust controllers is introduced for the pickup operation of microscale objects in a microelectromechanical system (MEMS). In MEMS, adhesive, surface tension, friction, and van der Waals forces are dominant. Moreover, these forces are typically unknown. The proposed robust controller overcomes the unknown contact dynamics and ensures its performance in the presence of actuator constraints by assuming that the upper bounds on these forces are known. On the other hand, for the robust adaptive critic-based neural network (NN) controller, the unknown dynamic forces are estimated online. It consists of an action NN for compensating the unknown system …

Go to article

Validation Of An Nsp-Based (Negative Selection Pattern) Gene Family Identification Strategy, Ronald L. Frank, Cyriac Kandoth, Fikret Erçal Jan 2008

Validation Of An Nsp-Based (Negative Selection Pattern) Gene Family Identification Strategy, Ronald L. Frank, Cyriac Kandoth, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genome is not yet sequenced. We have developed a novel gene family identification method based on negative selection patterns (NSP) between family members to screen EST-generated contigs. This strategy was tested on five known gene families in Arabidopsis to see if individual paralogs could be identified with accuracy from EST data alone when compared to the actual gene sequences in this fully sequenced genome. Results: The NSP method uniquely identified family members in all …

Go to article

Web-Based Service Exchange System For Agents And Humans Alike, Evens Jean, Machigar Ongtang, A. R. Hurson Jan 2008

Web-Based Service Exchange System For Agents And Humans Alike, Evens Jean, Machigar Ongtang, A. R. Hurson

Computer Science Faculty Research & Creative Works

Semantic Web research aims at bridging the gap between how humans and agents process information readily available on the Internet. One of the great challenges to this goal lies in the fact that humans, contrary to agents, can extract the meaning of words based on its context. This work introduces a service exchange system for the Web that allows agents to intelligently process information, as would humans. This is achieved by the use of thesauri to help agents resolve semantic heterogeneity in the information being processed. The framework for the exchange system has been realized under the aglet platform on …

Go to article

Energy Efficient Correlated Data Aggregation For Wireless Sensor Networks, Seung Jong Park, Raghupathy Sivakumar Jan 2008

Energy Efficient Correlated Data Aggregation For Wireless Sensor Networks, Seung Jong Park, Raghupathy Sivakumar

Computer Science Faculty Research & Creative Works

Data aggregations from Sensors to a sink in wireless sensor networks (WSNs) are typically characterized by correlation along the spatial, semantic, and temporal dimensions. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. For the sensors-to-sink data delivery, we first explore two theoretical solutions: the shortest path tree (SPT) and the minimum spanning tree (MST) approaches. To approximate the optimal solution (MST) in case of perfect correlation among data, we propose a new aggregation which combines the minimum dominating set (MDS) with the shortest path tree (SPT) in order …

Go to article

Social Network Analysis Of Video Bloggers' Community, John Warmbrodt, Hong Sheng, Richard H. Hall Jan 2008

Social Network Analysis Of Video Bloggers' Community, John Warmbrodt, Hong Sheng, Richard H. Hall

Business and Information Technology Faculty Research & Creative Works

Video blogs (or vlogs) have become increasingly popular in recent years. As the main motivation for vlogging is to interact with other vloggers, it is important to investigate the structure of the videobloggers' community and the interactions among vloggers. This research conducted a quantitative analysis using social network analysis. A list of personal vloggers was identified from VlogDIR and linking patters of vlogs were analyzed. The results suggest that video bloggers' community is highly decentralized and exhibits a core/periphery structure.

Go to article

Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani Jan 2008

Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, we consider the use of nonlinear networks towards obtaining nearly optimal solutions to the control of nonlinear discrete-time (DT) systems. The method is based on least squares successive approximation solution of the generalized Hamilton-Jacobi-Bellman (GHJB) equation which appears in optimization problems. Successive approximation using the GHJB has not been applied for nonlinear DT systems. The proposed recursive method solves the GHJB equation in DT on a well-defined region of attraction. The definition of GHJB, pre-Hamiltonian function, HJB equation, and method of updating the control function for the affine nonlinear DT systems under small perturbation assumption are proposed. …

Go to article

Image Analysis Techniques For Vertebra Anomaly Detection In X-Ray Images, Mohammed Das Jan 2008

Image Analysis Techniques For Vertebra Anomaly Detection In X-Ray Images, Mohammed Das

Masters Theses

"In this research, imaging techniques are investigated for the analysis and detection of abnormalities in cervical and lumbar vertebrae. Detecting vertebra anomalies pertaining to osteoarthritis such as claw, traction and anterior osteophytes can aide in treatment plans for the patient. New size invariant features were developed for the detection of claw, traction and anterior osteophytes in cervical spine vertebrae. Using a K-means clustering and nearest centroid classification approach, the results were generated that were capable of discriminating cervical vertebrae for presence of anomalies related to osteophytes. The techniques developed can be integrated into systems based on querying spine images to …

Go to article

An Economic Incentive Based Routing Protocol Incorporating Quality Of Service For Mobile Peer-To-Peer Networks, Anil Jade Jan 2008

An Economic Incentive Based Routing Protocol Incorporating Quality Of Service For Mobile Peer-To-Peer Networks, Anil Jade

Masters Theses

"Economic incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P). These models entice node participation to combat free riding and to effectively manage constraint resources in the network. Due to the dynamic topology of the M-P2P network, the connections between the peers become unpredictable and therefore, reliable routing becomes important. Many routing protocols proposed earlier (such as DSR, AODV) are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using economic models to find a cost effective optimal route from the source to the destination, while considering Quality of Service …

Go to article

Co-Optimization: A Generalization Of Coevolution, Travis Service Jan 2008

Co-Optimization: A Generalization Of Coevolution, Travis Service

Masters Theses

"Many problems encountered in computer science are best stated in terms of interactions amongst individuals. For example, many problems are most naturally phrased in terms of finding a candidate solution which performs best against a set of test cases. In such situations, methods are needed to find candidate solutions which are expected to perform best over all test cases. Coevolution holds the promise of addressing such problems by employing principles from biological evolution, where populations of candidate solutions and test cases are evolved over time to produce higher quality solutions...This thesis presents a generalization of coevolution to co-optimization, where optimization …

Go to article

A Time Series Classifier, Christopher Mark Gore Jan 2008

A Time Series Classifier, Christopher Mark Gore

Masters Theses

"A time series is a sequence of data measured at successive time intervals. Time series analysis refers to all of the methods employed to understand such data, either with the purpose of explaining the underlying system producing the data or to try to predict future data points in the time series...An evolutionary algorithm is a non-deterministic method of searching a solution space, and modeled after biological evolutionary processes. A learning classifier system (LCS) is a form of evolutionary algorithm that operates on a population of mapping rules. We introduce the time series classifier TSC, a new type of LCS that …

Go to article

Critical Infrastructure Protection And The Domain Name Service (Dns) System, Mark Edward Snyder Jan 2008

Critical Infrastructure Protection And The Domain Name Service (Dns) System, Mark Edward Snyder

Masters Theses

"Components of the critical infrastructure of any system are natural targets for attack. Any inherent weakness of such components can potentially expose the entire system to vulnerability. The Domain Name System (DNS) is one component of the proper functioning of the Internet. Although DNS is a relatively simple, isolated component, it serves as a straightforward example for the study of distributed systems in general, and as such, we have explored properties of DNS to examine how enterprise-scale, critical infrastructure components are vulnerable to attack, what protections are afforded to defenders of such components, the inherent weaknesses of such systems, and …

Go to article

Co-Evolutionary Automated Software Correction: A Proof Of Concept, Joshua Lee Wilkerson Jan 2008

Co-Evolutionary Automated Software Correction: A Proof Of Concept, Joshua Lee Wilkerson

Masters Theses

"The task of ensuring that a software artifact is correct can be a very time consuming process. To be able to say that an algorithm is correct is to say that it will produce results in accordance with its specifications for all valid input. One possible way to identify an incorrect implementation is through the use of automated testing (currently an open problem in the field of software engineering); however, actually correcting the implementation is typically a manual task for the software developer. In this thesis a system is presented which automates not only the testing but also the correction …

Go to article

Cross-Layer Design Through Joint Routing And Link Allocation In Wireless Sensor Networks, Xuan Gong Jan 2008

Cross-Layer Design Through Joint Routing And Link Allocation In Wireless Sensor Networks, Xuan Gong

Masters Theses

"Both energy and bandwidth are scarce resources in sensor networks. In the past, the energy efficient routing problem has been extensively studied in efforts to maximize sensor network lifetimes, but the link bandwidth has been optimistically assumed to be abundant. Because energy constraint affects how data should be routed, link bandwidth affects not only the routing topology, but also the allowed data rate on each link, which in turn affects the lifetime. Previous research that focus on energy efficient operations in sensor networks with the sole objective of maximizing network lifetime only consider the energy constraint ignoring the bandwidth constraint. …

Go to article

Preserd - Privacy Ensured Service Discovery In Mobile Peer-To-Peer Environment, Santhosh Muthyapu Jan 2008

Preserd - Privacy Ensured Service Discovery In Mobile Peer-To-Peer Environment, Santhosh Muthyapu

Masters Theses

"In mobile peer-to-peer networks many service discovery protocols have been proposed. Most of these protocols disregard the exposure of the participating peers' privacy details, although they consider the security issues. In these methods, the participating peers must provide their identities, during the service discovery process, to be authorized to utilize the service. However, a peer might not be willing to reveal its identity until it identifies the service providing peer. So these peers face a problem; should the requesting peer or the service providing peer reveal the identity first, and hence, this is similar to the chicken-and-egg problem. The protocol …

Go to article

New Method For Approximating Vague Sets To Fuzzy Sets Based On Voting Model, Jian Liu, Zhizhan Liu, Shunxiang Wu, Yongjian Zhang Jan 2008

New Method For Approximating Vague Sets To Fuzzy Sets Based On Voting Model, Jian Liu, Zhizhan Liu, Shunxiang Wu, Yongjian Zhang

Electrical and Computer Engineering Faculty Research & Creative Works

By analyzing Vague Sets voting model, we bring forth a new method for approximating Vague Sets to Fuzzy Sets, and its general process is presented in the article. In a voting model, firstly, we suppose that the abstainers must vote for once more, and the results are close studied. Then the randomicity, uncertainty, and conformity of voting are found. As we know, an abstainer may favor somebody, oppose somebody, or just abstain. In this article, we suppose the distribution of results is consistent with a normal distribution. So, we advance the new approximation method based on Gauss Distribution. © 2008 …

Go to article

Energy Efficient Clustering And Secure Data Aggregation In Wireless Sensor Networks, Julia Albath Jan 2008

Energy Efficient Clustering And Secure Data Aggregation In Wireless Sensor Networks, Julia Albath

Doctoral Dissertations

"Communication consumes the majority of a wireless sensor network's limited energy. There are several ways to reduce the communication cost. Two approaches used in this work are clustering and in-network aggregation. The choice of a cluster head within each cluster is important because cluster heads use additional energy for their responsibilities and that burden needs to be carefully distributed. We introduce the energy constrained minimum dominating set (ECDS) to model the problem of optimally choosing cluster heads in the presence of energy constraints. We show its applicability to sensor networks and give an approximation algorithm of O(log n) for solving …

Go to article

Business-Oriented Software Process Improvement Based On Cmm And Cmmi Using Qfd, Yan Sun Jan 2008

Business-Oriented Software Process Improvement Based On Cmm And Cmmi Using Qfd, Yan Sun

Doctoral Dissertations

"Software Process Improvement (SPI) has become the key to the survival of many software development organizations. Many international SPI models/standards are developed for SPI. The Capability Maturity Model (CMM) and Capability Maturity Model Integrated (CMMI)) from the Software Engineering Institute are two SPI models. In this study, several existing SPI models and approaches are reviewed, their advantages are identified, and their drawbacks are discussed. A set of new SPI frameworks integrating Quality Function Deployment (QFD) with both CMM and CMMI are developed by combining the best features of previous approaches and addressing their limitations"--Abstract, page iii.

Go to article

Enlightened Computing: An Architecture For Co-Allocating Network, Compute, And Other Grid Resources For High-End Applications, Lina Battestilli, Andrei Hutanut, Gigi Karmous-Edwards, Daniel S. Katz, Jon Maclarent, Joe Mambretti, John H. Moore, Seung Jong Park, Harry G. Perros, Syam Sundar, Savera Tanwir, Steven R. Thorpe, Yufeng Xin Dec 2007

Enlightened Computing: An Architecture For Co-Allocating Network, Compute, And Other Grid Resources For High-End Applications, Lina Battestilli, Andrei Hutanut, Gigi Karmous-Edwards, Daniel S. Katz, Jon Maclarent, Joe Mambretti, John H. Moore, Seung Jong Park, Harry G. Perros, Syam Sundar, Savera Tanwir, Steven R. Thorpe, Yufeng Xin

Computer Science Faculty Research & Creative Works

Many emerging high-performance applications require distributed infrastructure that is significantly more powerful and flexible than traditional Grids. Such applications require the optimization, close integration, and control of all Grid resources, including networks. The EnLIGHTened (ENL) Computing Project has designed an architectural framework that allows Grid applications to dynamically request (in-advance or on-demand) any type of Grid resource: computers, storage, instruments, and deterministic, high-bandwidth network paths, including lightpaths. Based on application requirements, the ENL middleware communicates with Grid resource managers and, when availability is verified, co-allocates all the necessary resources. ENL's Domain Network Manager controls all network resource allocations to dynamically …

Go to article

Research Issues And Overview Of Economic Models In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa Dec 2007

Research Issues And Overview Of Economic Models In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa

Computer Science Faculty Research & Creative Works

The mobile-P2P paradigm is becoming increasingly popular. Existing mobile-P2P solutions largely do not consider economic incentive models for enticing peer participation without eliminating free-riders and for effectively handling mobile resource constraints such as energy. This paper presents an executive summary of the existing solutions and an overview of some of the important issues for handling problems in mobile-P2P networks using economic models. We also present our perspectives on building 'real' mobile-P2P applications using economic models. © 2007 IEEE.

Go to article

Time-Adaptive Numerical Simulation For High Speed Networks, Suman Kumar, Seung Jong Park, S. Sitharama Iyengar, Jung Han Kimn Dec 2007

Time-Adaptive Numerical Simulation For High Speed Networks, Suman Kumar, Seung Jong Park, S. Sitharama Iyengar, Jung Han Kimn

Computer Science Faculty Research & Creative Works

As the bandwidth of networks is increasing exponentially, the computational cost to simulate such type of networks is also growing in a similar fashion. This paper presents a scalable simulation method, called time-adaptive numerical simulation, which can be used to represent dynamics of high-speed networks using fluid-based models. The new method dynamically adjusts the size of a time step for a numerical solver which solves a system of differential equations representing dynamics of protocols and nodes' behaviors. The simulation results show that the time-adaptive-method reduces the computational time while achieving the same accuracy compared to that of a fixed step-size …

Go to article

Sybil Attack Detection In A Hierarchical Sensor Network, Jian Yin, Sanjay Kumar Madria Dec 2007

Sybil Attack Detection In A Hierarchical Sensor Network, Jian Yin, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The Sybil attack is a particularly harmful threat to sensor networks where a single sensor node illegitimately claims multiple identities. a malicious node may generate an arbitrary number of additional node identities using only one physical device. the Sybil attack can disrupt normal functioning of the sensor network, such as the multipath routing, used to explore the multiple disjoint paths between source-destination pairs. But the Sybil attack can disrupt it when a single adversary presents multiple identities, which appear on the multiple paths. Digital certificates are a way to prove identities, but they are not suitable for the sensor network …

Go to article

Transmission Scheduling In Sensor Networks Via Directed Edge Coloring, Maggie Xiaioyan Cheng, Li Yin Dec 2007

Transmission Scheduling In Sensor Networks Via Directed Edge Coloring, Maggie Xiaioyan Cheng, Li Yin

Computer Science Faculty Research & Creative Works

This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicasting and broadcast communication. the algorithm employs edge coloring on a directed graph for transmission scheduling. It is different from previous works that use vertex coloring of a graph for node scheduling, or those that use edge coloring of undirected graphs for link scheduling. the proposed algorithm uses the least number of time slots compared to its counterparts and it avoids both the hidden terminal problem and the exposed terminal problem in both unicast and broadcast communication. ©2007 …

Go to article

Journal Of Combinatorial Optimization, Special Issue On Communication Networks And Internet Applications, Maggie Xiaoyan Cheng Nov 2007

Journal Of Combinatorial Optimization, Special Issue On Communication Networks And Internet Applications, Maggie Xiaoyan Cheng

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Predictive Congestion Control Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani Nov 2007

Predictive Congestion Control Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Available congestion control schemes, for example transport control protocol (TCP), when applied to wireless networks, result in a large number of packet drops, unfair scenarios and low throughputs with a significant amount of wasted energy due to retransmissions. To fully utilize the hop by hop feedback information, this paper presents a novel, decentralized, predictive congestion control (DPCC) for wireless sensor networks (WSN). The DPCC consists of an adaptive flow and adaptive back-off interval selection schemes that work in concert with energy efficient, distributed power control (DPC). The DPCC detects the onset of congestion using queue utilization and the embedded channel …

Go to article

Effects Of Electromagnetic Interference On Control Area Network Performance, Fei Ren, Y. Rosa Zheng, Maciej Jan Zawodniok, Jagannathan Sarangapani Nov 2007

Effects Of Electromagnetic Interference On Control Area Network Performance, Fei Ren, Y. Rosa Zheng, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the effects of electromagnetic interference (EMI) on control area network (CAN) communications are investigated by hardware experiments. Distinct CAN bit rates, communication cables, and networks are used to test effects of EMI on CAN bus. Waveforms of CAN data frames in EMI environment are observed and analyzed for figuring out details of effects. Experiments show that the EMI pulses frequently encountered in automobile and off-road machinery can cause the reduction of bit rates and errors in high-speed CAN communications. Replacing traditional unshielded parallel communication cables with shielded communication cables is proved to be an effective method of …

Go to article

Electrostatic Force Microscopy Studies Of Boron-Doped Diamond Films, Santosh Gupta, O. A. Williams, Eric W. Bohannan Nov 2007

Electrostatic Force Microscopy Studies Of Boron-Doped Diamond Films, Santosh Gupta, O. A. Williams, Eric W. Bohannan

Computer Science Faculty Research & Creative Works

Much has been learned from electrochemical properties of boron-doped diamond (BDD) thin films synthesized using microwave plasma-assisted chemical vapor deposition about the factors influencing electrochemical activity, but some characteristics are still not entirely understood, such as its electrical conductivity in relation with microscale structure. Therefore, to effectively utilize these materials, understanding both the microscopic structure and physical (electrical, in particular) properties becomes indispensable. in addition to topography using atomic force microscopy, electrostatic force microscopy (EFM) in phase mode measuring the long-range electrostatic force gradients, helps to map the electrical conductivity heterogeneity of boron-doped micro-/nanocrystalline diamond surfaces. the mapping of electrical …

Go to article

Alternative Splicing: Associating Frequency With Isoforms, Anuradha Roy, Jennifer Leopold, Anne M. Maglia Oct 2007

Alternative Splicing: Associating Frequency With Isoforms, Anuradha Roy, Jennifer Leopold, Anne M. Maglia

Computer Science Faculty Research & Creative Works

In the simplest model of protein production, a gene gives rise to a single protein; DNA is transcribed to form pre-mRNA, which is converted to mRNA by splicing or removing introns. The result is a chain of exons that is translated to form a protein. Alternative splicing of exons may result in the formation of multiple proteins from the same gene sequence. However, not all of these proteins may be functional. Thus, we ask whether we can predict and rank (in order of frequency of occurrence and functional importance) the set of possible proteins for a gene. Herein we describe …

Go to article

Determining Domain Similarity And Domain-Protein Similarity Using Functional Similarity Measurements Of Gene Ontology Terms, Lisa Michelle Guntly, Jennifer Leopold, Anne M. Maglia Oct 2007

Determining Domain Similarity And Domain-Protein Similarity Using Functional Similarity Measurements Of Gene Ontology Terms, Lisa Michelle Guntly, Jennifer Leopold, Anne M. Maglia

Computer Science Faculty Research & Creative Works

Protein domains typically correspond to major functional sites of a protein. Therefore, determining similarity between domains can aid in the comparison of protein functions, and can provide a basis for grouping domains based on function. One strategy for comparing domain similarity and domain-protein similarity is to use similarity measurements of annotation terms from the Gene Ontology (GO). In this paper five methods are analyzed in terms of their usefulness for comparing domains, and comparing domains to proteins based on GO terms.

Go to article

First Prev Next Last