Computer Sciences Commons^™

Adaptive Critic Neural Network Force Controller For Atomic Force Microscope-Based Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Automating the task of nanomanipulation is extremely important since it is tedious for humans. This paper proposes an atomic force microscope (AFM) based force controller to push nano particles on the substrates. A block phase correlation-based algorithm is embedded into the controller for the compensation of the thermal drift which is considered as the main external uncertainty during nanomanipulation. Then, the interactive forces and dynamics between the tip and the particle, particle and the substrate are modeled and analyzed. Further, an adaptive critic NN controller based on adaptive dynamic programming algorithm is designed and the task of pushing nano particles …

The Future Leading Mobility Protocol: Mobile Ipv4 Or Mobile Ipv6?, Victor A. Clincy, Mudiraj Padmaja

Faculty Articles

Mobile computing has become an important area of computer networking and is expected to play a fundamental role in the ubiquitous access of Internet resources in the future. In recent years, we have seen increasing demand from end-users to access network resources from anywhere and at anytime from all kinds of devices. A greater degree of connectivity is almost becoming mandatory in todays business world. In addition, mobility of end-users is placing further requirements on network systems and protocols to provide uninterrupted services. Mobile network protocol such as Mobile IPv4 has emerged as one of the promising solutions capable of …

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method …

Exploiting Geographical And Temporal Locality To Boost Search Efficiency In Peer-To-Peer Systems, Hailong Cai, Jun Wang

School of Computing: Faculty Publications

As a hot research topic, many search algorithms have been presented and studied for unstructured peer-to-peer (P2P) systems during the past few years. Unfortunately, current approaches either cannot yield good lookup performance, or incur high search cost and system maintenance overhead. The poor search efficiency of these approaches may seriously limit the scalability of current unstructured P2P systems. In this paper, we propose to exploit two-dimensional locality to improve P2P system search efficiency. We present a locality-aware P2P system architecture called Foreseer, which explicitly exploits geographical locality and temporal locality by constructing a neighbor overlay and a friend overlay, respectively. …

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as …

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.

Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the broadcast domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective …

Privacy Enhanced Superdistribution Of Layered Content With Trusted Access Control, Daniel J. T. Chong, Robert H. Deng

Research Collection School Of Computing and Information Systems

Traditional superdistribution approaches do not address consumer privacy issues and also do not reliably prevent the malicious consumer from indiscriminately copying and redistributing the decryption keys or the decrypted content. The layered nature of common digital content can also be exploited to efficiently provide the consumer with choices over the quality of the content, allowing him/her to pay less for lower quality consumption and vice versa. This paper presents a system that superdistributes encrypted layered content and (1) allows the consumer to select a quality level at which to decrypt and consume the content; (2) prevents the merchant from knowing …

Critical Success Factors For Erp Implementation And Upgrade, Fiona Fui-Hoon Nah, Santiago Delgado

Research Collection School Of Computing and Information Systems

Seven categories of critical success factors were identified from the ERP literature: (1) business plan and vision; (2) change management, (3) communication; (4) ERP team composition, skills and compensation; (5) management support and championship; (6) project management, (7) system analysis, selection and technical implementation. We conducted a case study of two organizations that had implemented and upgraded ERP systems. We adopted Markus and Tanis' four-phase model and compared the importance of these critical success factors across the phases of ERP implementation and upgrade. The importance of these factors across the phases of ERP implementation and upgrade is very similar. 'Business …

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang

Research Collection School Of Computing and Information Systems

This paper presents and elaborates the concept of Web service usage patterns and pattern discovery through service mining. We define three different levels of service usage data: i) user request level, ii) template level and iii) instance level. At each level, we investigate patterns of service usage data and the discovery of these patterns. An algorithm for service pattern discovery at the template level is presented. We show the system architecture of a service-mining enabled service registry repository. Web service patterns, pattern discovery and pattern mining supports the discovery and composition of complex services, which in turn supports the application …

Design And Analysis Of A Class-Aware Recursive Loop Scheduler For Class-Based Scheduling, Raphael Rom, Moshe Sidi, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the existing notion of smoothness based on balancedness, we propose a variance-based metric which is more intuitive and easier to compute.

We propose a recursive loop scheduler for a class-based scheduling scenario based on an optimal weighted round-robin scheduler. We show that it achieves very good allocation smoothness with almost no degradation in intra-class fairness. In addition, we also demonstrate the equivalence between our proposed metric and the balancedness-based metric.

Effects Of Gap Open And Gap Extension Penalties, Hyrum Carroll, Mark J. Clement, Perry Ridge, Quinn O. Snell

Faculty Publications

Fundamental to multiple sequence alignment algorithms is modeling insertions and deletions (gaps). The most prevalent model is to use gap open and gap extension penalties. While gap open and gap extension penalties are well understood conceptually, their effects on multiple sequence alignment, and consequently on phylogeny scores are not as well understood. We use exhaustive phylogeny searching to explore the effects of varying the gap open and gap extension penalties for three nuclear ribosomal data sets. Particular attention is given to optimal phylogeny scores for 200 alignments of a range of gap open and gap extension penalties and their respective …

Large Grain Size Stochastic Optimization Alignment, Hyrum Carroll, Mark J. Clement, Perry Ridge, Dan Sneddon, Quinn O. Snell

Faculty Publications

DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima problem, where suboptimal guide trees produce incorrect gap insertions. The optimization alignment approach, has been shown to be effective in combining alignment and phylogenetic search in order to avoid the problems associated with poor guide trees. The optimization alignment algorithm operates at a small grain size, aligning each tree found, wasting time producing multiple sequence alignments for suboptimal trees. This research develops and analyzes a large grain size algorithm for optimization alignment that …

Pharmacogenomics: Analyzing Snps In The Cyp2d6 Gene Using Amino Acid Properties, Wesley A. Beckstead, Mark J. Clement, Mark Ebbert, David Mcclellan, Timothy O'Connor

Faculty Publications

Each year people suffer from complications of adverse drug reactions, but with pharmacogenomics there is hope to prevent thousands of these people from suffering or dying needlessly. The CYP2D6 gene is responsible for metabolizing a large portion of these drugs. Because of the gene’s importance, various approaches have been taken to analyze CYP2D6 and single nucleotide polymorphisms (SNPs) throughout its sequence. This study introduces a novel method to analyze the effects of SNPs on encoded protein complexes by focusing on the biochemical properties of each nonsynonymous substitution using the program TreeSAAP. We apply this technique to SNPs found in the …

Steganalysis Embedding Percentage Determination With Learning Vector Quantization, Benjamin M. Rodriguez, Gilbert L. Peterson, Kenneth W. Bauer, Sos S. Agaian

Faculty Publications

Steganography (stego) is used primarily when the very existence of a communication signal is to be kept covert. Detecting the presence of stego is a very difficult problem which is made even more difficult when the embedding technique is not known. This article presents an investigation of the process and necessary considerations inherent in the development of a new method applied for the detection of hidden data within digital images. We demonstrate the effectiveness of learning vector quantization (LVQ) as a clustering technique which assists in discerning clean or non-stego images from anomalous or stego images. This comparison is conducted …

Masthead

Journal of Digital Forensics, Security and Law

No abstract provided.

Front Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Back Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Performance Benchmarks For Custom Applications: Considerations And Strategies, Braulio J. Cabral

Regis University Student Publications (comprehensive collection)

The motivation for this research came from the need to solve a problem affecting not only the company used in this study, but also the many other companies in the information technology industry having similar problem: how to conduct performance benchmarks for custom applications in an effective, unbiased, and accurate manner. This paper presents the pros and cons of existing benchmark methodologies. It proposes a combination of the best characteristics of these benchmarks into a methodology that addresses the problem from an application perspective considering the overall synergy between operating system and software. The author also discusses a software design …

An Automated Method For Rapid Identification Of Putative Gene Family Members In Plants, Ronald L. Frank, Ajay Mane, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Gene duplication events have played a significant role in genome evolution, particularly in plants. Exhaustive searches for all members of a known gene family as well as the identification of new gene families has become increasingly important. Subfunctionalization via changes in regulatory sequences following duplication (adaptive selection) appears to be a common mechanism of evolution in plants and can be accompanied by purifying selection on the coding region. Such negative selection can be detected by a bias toward synonymous over nonsynonymous substitutions. However, the process of identifying this bias requires many steps usually employing several different software programs. We …

Setting Up Information Technology Structures For Trade Unions, Harvey Hecht

Regis University Student Publications (comprehensive collection)

Trade Unions also know as Labor Unions are non-profit organizations whose purpose is to represent workers in their work place, negotiate collective bargaining agreements, and enforce those agreements while representing its membership. In the past three decades, United States Trade Union populations have been dropping. One of the reasons behind the reduction is the lack of leadership to keep infrastructure contemporary and able to meet the changing pace of business. International Union has been working on different projects in an effort to change how they do business. One approach International Union exercised is upgrading its larger premier locals such as …

Co-Operative Lane-Level Positioning Using Markov Localization, Thanh-Son Dao, Keith Yu Kit Leung, Christopher M. Clark, Jan Paul Huissoon

Computer Science and Software Engineering

The majority of today's navigation techniques for intelligent transportation systems use Global Positioning Systems (GPS) that can provide position information with bounded errors. However, because of the low accuracy and multi-path problem, it is challenging to determine a vehicle's position at lane level. With Markov-based approach based on sharing information among a group of vehicles that are traveling close to each other, the lane positions of vehicles can be found. The algorithm shows its effectiveness in both simulations and experiments with real data.

Development Of A Microscopic Traffic Simulator For Inter-Vehicle Communication Application Research, Keith Yu Kit Leung, Thanh-Son Dao, Christopher M. Clark, Jan Paul Huissoon

Computer Science and Software Engineering

This paper describes the development of a microscopic traffic simulator purposely designed for ITS researchers studying inter-vehicle communication (IVC) concepts and applications in large traffic networks. The simulator can represent real life vehicles within the simulation by using data from vehicle Global Positioning System (GPS) receivers, enabling validation of theories with real vehicle data. The software is developed on top of the existing microscopic traffic simulator VISSIM with the added flexibility of modelling and efficiently handling communication between large numbers of vehicles. This along with the software architecture was discussed in detail.

Improving Error Discovery Using Guided Model Checking, Neha Shyam Rungta

Theses and Dissertations

State exploration in directed software model checking is guided using a heuristic function to move states near errors to the front of the search queue. Distance heuristic functions rank states based on the number of transitions needed to move the current program state into an error location. Lack of calling context information causes the heuristic function to underestimate the true distance to the error; however, inlining functions at call sites in the control flow graph to capture calling context leads to exponential growth in the computation. This paper presents a new algorithm that implicitly inlines functions at call sites to …

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 …

Jigsaw: Solving The Puzzle Of Enterprise 802.11 Analysis, Yu-Chung Cheng, John M. Bellardo, Péter Benkö, Alex C. Snoeren, Geoffrey M. Voelker, Stefan Savage

Computer Science and Software Engineering

The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11 based networks ubiquitous in the enterprise. Modern universities, corporate campuses and government offices routinely de-ploy scores of access points to blanket their sites with wireless Internet access. However, while the fine-grained behavior of the 802.11 protocol itself has been well studied, our understanding of how large 802.11 networks behave in their full empirical complex-ity is surprisingly limited. In this paper, we present a system called Jigsaw that uses multiple monitors to provide a single unified view of all physical, link, network and …

Adaptive Online Program Analysis: Concepts, Infrastructure, And Applications, Matthew B. Dwyer, Alex Kinneer, Sebastian Elbaum

School of Computing: Technical Reports

Dynamic analysis of state-based properties is being applied to problems such as validation, intrusion detection, and program steering and reconfiguration. Dynamic analysis of such properties, however, is used rarely in practice due to its associated run-time overhead that causes multiple orders of magnitude slowdown of program execution. In this paper, we present an approach for exploiting the state-fullness of specifications to reduce the cost of dynamic program analysis. With our approach, the results of the analysis are guaranteed to be identical to those of the traditional, expensive dynamic analyses, yet with overheads between 23% and 33% relative to the un-instrumented …

Good Benchmarks Are Hard To Find: Toward The Benchmark For Information Retrieval Applications In Software Engineering, Alex Dekhtyar, Jane Huffman Hayes

Computer Science and Software Engineering

Seven to eight years ago, the number of applications of Information Retrieval (IR) methods in Software Engineering was close to zero. These days, IR and text mining methods are accepted approaches to analysis of textual artifacts generated during the software lifcycle. The incentive to try IR methods in such analysis is strong: the field comes with a reputation for proven industrial and academic success, and some important Software Engineering problems related to textual artifacts, can be translated into an instance of a standard IR problem in a reasonably straightforward manner.

In this position paper, we observe that part of the …

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 …

The Great Plains Network (Gpn) Middleware Test Bed, Amy Apon, Gregory Monaco, Gordon Springer

Publications

GPN (Great Plains Network) is a consortium of public universities in seven mid-western states. GPN goals include regional strategic planning and the development of a collaboration environment, middleware services and a regional grid for sharing computational, storage and data resources. A major challenge is to arrive at a common authentication and authorization service, based on the set of heterogeneous identity providers at each institution. GPN has built a prototype middleware test bed that includes Shibboleth and other NMI-EDIT middleware components. The test bed includes several prototype end-user applications, and is being used to further our research into fine-grained access control …