Computer Sciences Commons^™

Sensor Networks: An Overview, Malik Tubaishat, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

Advances in hardware and wireless network technologies have created low-cost, low-power, multifunctional miniature sensor devices. These devices make up hundreds or thousands of ad hoc tiny sensor nodes spread across a geographical area. These sensor nodes collaborate among themselves to establish a sensing network. A sensor network can provide access to information anytime, anywhere by collecting, processing, analyzing and disseminating data. Thus, the network actively participates in creating a smart environment.

Analyzing Algorithms & Asymptotic Notation, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for BIO/CS 471: Algorithms for Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

Detecting And Representing Relevant Web Deltas In Whoweda, Sanjay Kumar Madria, Wee Keong Ng, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

In this paper, we present a mechanism for detecting and representing changes, given the old and new versions of a set of interlinked Web documents, retrieved in response to a user''s query. In particular, we show how to detect and represent Web deltas, i.e., changes in the Web documents that are relevant to a user''s query in the context of our Web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information is materialized views stored in Web tables in the form of Web tuples. These Web tuples, represented as directed graphs, can be manipulated using a set …

Two Distributed Algorithms For E-Ticket Validation Protocols For Mobile Clients, H. Mohanty, Sanjay Kumar Madria, T. Suman Kumar Reddy, R. K. Ghosh

Computer Science Faculty Research & Creative Works

The e-ticket (electronic ticket) validation problem has relevance in mobile computing environment because of the multiple submission of a ticket that is possible due to intermittent disconnections and mobility of hosts. Here, we propose protocols that are not only sensitive to disconnection but also to location. One of the proposed protocols is the variant of the distributed protocol proposed by Pedone (2000) for Internet users. This shows that a distributed protocol for static network can be restructured for distributed computation in a mobile computing environment. We have also proposed another protocol that uses a hierarchical location database of mobile hosts …

Policy Driven Licensing Model For Component Software, Zhao Qian, Zhou Yu, Mark Perry

Computer Science Publications

Today, it is almost inevitable that software is licensed, rather than sold outright. As a part of the licensing policy, some protection mechanisms, whether hardware, legal or code-based, are invariably built into the license. The application of such mechanisms has primarily been in the realm of off-the-shelf, packaged, consumer software. However, as component-based software gradually becomes mainstream in software development, new component-oriented licensing systems are required. This paper proposes an enterprise component licensing model for the management of software component licenses. The model provides a comprehensive license management framework allowing for extensibility and flexibility. Furthermore, we identify differences between stand-alone …

A Christian Perspective On Mathematics – History Of Mathematics And Study Guides, Johan Deklerk

ACMS Journal 2004

This paper addresses two questions: (1) Will a study of the history of the subject serve any purpose in promoting a Christian perspective on mathematics? (2) Can the "science in context" approach be of further help in promoting such a perspective? The author answers both positively and provides specific examples of how he has done this in his own classes.

Creationism – A Viable Philosophy Of Mathematics, Jonathan Zderad

ACMS Journal 2004

In this paper, the author addresses two classical questions of the philosophy of mathematics: What, if any, of mathematics exists in the objective sense? How do humans know that our knowledge of mathematics is correct? He argues that the Christian doctrine of God as creator provides a basis for answering these questions. He also provides a critique of eight widely discussed philosophies of mathematics.

Protein Alignment Scoring - Pam And Blosum, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for Intro to Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

Representation Of Web Data In A Web Warehouse, Sourav S. Bhowmick, Sanjay Madria, Wee Keong Ng

Computer Science Faculty Research & Creative Works

We believe that, to manage Web data effectively, there is a need to build a data warehouse of Web data, i.e. a Web warehouse. in this paper, we focus on how to represent and store relevant hyperlinked Web documents effectively in a Web warehouse called WHOWEDA (WareHouse of WEb DAta) for further querying and manipulation. We present a simple and general model for representing metadata, structure and content of Web documents and hyperlinks in WHOWEDA. We discuss node and link objects which are used to represent Web documents and hyperlinks respectively in WHOWEDA. These objects are first class objects in …

An Intelligent Early Warning System For Software Quality Improvement And Project Management, Xiaoqing Frank Liu, Gautam Kane, Monu Bambroo

Computer Science Faculty Research & Creative Works

One of the main reasons behind unfruitful software development projects is that it is often too late to correct the problems by the time they are detected. It clearly indicates the need for early warning about the potential risks. In this paper, we discuss an intelligent software early warning system based on fuzzy logic using an integrated set of software metrics. It helps to assess risks associated with being behind schedule, over budget, and poor quality in software development and maintenance from multiple perspectives. It handles incomplete, inaccurate, and imprecise information, and resolve conflicts in an uncertain environment in its …

E-Commerce Broker Prototype Implementation And Investigation, Rohini Krishnapura

School of Computing: Technical Reports

Personalization has become a popular solution to today’s Ecomerce challenges. Various personalization techniques have been researched and marketed. But, one technique may not suit all businesses. What is required is a mechanism to enable different policies based possibly on different personalization techniques. The Ebroker architecture presented here provides a mechanism to enable different policies with minimal effort. We present here the various components of the architecture as well as the features that the architecture provides. The details of a prototype design and implementation are also discussed.

Mathematics And The Love Of God: An Introduction To The Thought Of Simone Weil, Scott Taylor

ACMS Journal 2004

Simone Weil was the sister of Andre Weil, one of the twentieth century's foremost mathematicians. She is a widely read and creative writer on spiritual themes. She addressed mathematics extensively in her writings. This paper discusses her views of mathematics and beauty, her critiques of modern science, her views on truth, and her concept that mathematical ideas can serve as symbols of spiritual ideas.

Peer-To-Peer Grids, Geoffrey C. Fox, Dennis Gannon, Sung-Hoon Ko, Shrideep Pallickara, Xiaohong Qiu, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We describe Peer-to-Peer Grids built around Integration of technologies from the peer-to-peer and Grid fields. We focus on the role of Web services linked by a powerful event service using uniform XML interfaces and application level routing. We describe how a rich synchronous and asynchronous collaboration environment can support virtual communities built on top of such infrastructure. Universal access mechanisms are discussed.

Combining Ordering Heuristics And Bundling Techniques For Solving Finite Constraint Satisfaction Problems, Amy Beckwith, Berthe Y. Choueiry

School of Computing: Technical Reports

We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effectively, the latter allow us to reduce it size. We design and compare strategies that combine static and dynamic versions of these two approaches. We show empirically the utility of dynamic variable ordering combined with dynamic bundling in both random problems and puzzles.

A Dynamic Real-Time Scheduling Algorithm For Reduced Energy Consumption In I/O Devices, Rohini Krishnapura, Steve Goddard

School of Computing: Technical Reports

In real-time systems, Dynamic Power Management (DPM) techniques have traditionally centered on the CPU with less focus given to I/O. However, I/O-based DPM techniques have been popularly researched in non-real-time systems. These techniques focus on switching I/O devices to low power states based on some policy. These methods, however, are not applicable to realtime environments because of the non-deterministic nature of the policies. Recently, scheduling techniques to reduce power consumption of I/O devices in real-time systems have emerged. In this paper, we propose an online task scheduling algorithm, Slack Utilization for Reduced Energy (SURE), which utilizes slack in periodic task …

On Modeling Protein Superfamilies With Low Primary Sequence Conservation, Stephen Scott, H. Ji, P. Wen, Dmitri E. Fomenko, Vadim N. Gladyshev

School of Computing: Technical Reports

We present several algorithms for identifying thioredoxin (Trx)-fold proteins containing a conserved CxxC motif (two cysteines separated by two residues). The low conservation of primary sequence in this protein superfamily makes conventional methods difficult to use. Therefore, we use structural properties to build our classifiers. These structural properties include secondary structure patterns as well as various properties of the residues in the protein sequences. We use this information to model Trx-fold proteins via hidden Markov models, decision trees, and algorithms in the multipleinstance learning model. In 9-fold and 12-fold jack-knife tests, some of our models performed quite well, with high …

On Generalized Multiple-Instance Learning, Stephen Scott, Jun Zhang, Joshua Brown

School of Computing: Technical Reports

We describe a generalization of the multiple-instance learning model in which a bag’s label is not based on a single instance’s proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. We list potential applications of this model (robot vision, content-based image retrieval, protein sequence identification, and drug discovery) and describe target concepts for these applications that cannot be represented in the conventional multiple-instance learning model. We then adapt a learning-theoretic algorithm for learning in this model and present empirical …

Low-Energy Bist Design For Scan-Based Logic Circuits, Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zhang

School of Computing: Conference and Workshop Papers

In a random testing environment, a significant amount of energy is wasted in the LFSR and in the CUT by useless patterns that do not contribute to fault dropping. Another major source of energy drainage is the loss due to random switching activity in the CUT and in the scan path between applications of two successive vectors. In this work, a new built-in self-test (BIST) scheme for scan-based circuits is proposed for reducing such energy consumption. A mapping logic is designed which modifies the state transitions of the LFSR such that only the useful vectors are generated according to a …

Thesis Digest: Mathematical Interpretation Of Political Power And The Arkansas State Government, Andrew King

Inquiry: The University of Arkansas Undergraduate Research Journal

On the whole, political power can he very difficult to quantify. A person may be powerful due to his or her personal charm, wealth, fame, credibility, or influential connections. Political bodies do not account for these qualities when creating voting procedures; they only assign voting rules to specific positions. For example, most would say that in the United States government that a Senator is more powerful than a Representative, but less powerful than the President, without knowing any way to quantify or verify those differences. Since the 1950's, mathematicians and political scientists have attempted to create mathematical models that partially …

Parametrically Tunable Audio Shelving And Equalizing Ladder Wave Digital Filters, S. A. Samad

Turkish Journal of Electrical Engineering and Computer Sciences

Parametrically tunable audio equalizers are conventionally realized using allpass digital filter networks. They consist of first-order shelving filters and second-order equalizing filters. In this paper, ladder wave digital filters (WDFs) with parametrically tunable coefficients are proposed as shelving and equalizing filters. Similar to the allpass realization, the transfer function power complementary property of WDFs is used to obtain efficient shelving and equalizing filters. However, unlike the allpass structures, the transfer function and the tunable parameters of the ladder WDF are derived from the analog filter equivalent of the digital shelving and equalizing filters. For the shelving WDF, the cut-off frequency …

Under The Plastic: A Quantitative Look At Dvd Video Encoding And Its Impact On Video Modeling, Wu-Chi Feng, Jin Choi, Wu-Chang Feng, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In this paper, we examine the DVD encoding process and the implications this process has video modeling and network traffic analysis. We have assembled a system that allows us to extract the video data from the DVDs as they were encoded for distribution. Analyzing the resulting video trace data, we describe how DVD encodings have evolved over time. In addition, our findings show that the underlying video content is fundamentally different than those produced by basic consumer video capture boards. We demonstrate how this affects current video modeling proposals and their affect on network traffic characterization. This research is based …

Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques, Huseyin Polat, Wenliang Du

Electrical Engineering and Computer Science - All Scholarship

Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers based on like-minded customers' preferences. People use CF systems to cope with information overload. To conduct collaborative filtering, data from customers are needed. However, collecting high quality data from customers is not an easy task because many customers are so concerned about their privacy that they might decide to give false information. CF systems using these data might produce inaccurate recommendations. We propose a randomized perturbation technique to protect users' privacy while still producing accurate recommendations. …

Interacting Data Services For Distributed Earthquake Modeling, Marlon Pierce, Choonhan Youn, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

We present XML schemas and our design for related data services for describing faults and surface displacements, which we use within earthquake modeling codes. These data services are implemented using a Web services approach and are incorporated in a portal architecture with other, general purpose services for application and file management. We make use of many Web services standards, including WSDL and SOAP, with specific implementations in Java. We illustrate how these data models and services may be used to build distributed, interacting applications through data flow.

An Adaptive Qos Routing Protocol With Dispersity For Ad-Hoc Networks, Youngki Hwang, Pramod Varshney

Electrical Engineering and Computer Science - All Scholarship

In this paper, we present the design and simulation of a bandwidth constrained multiple path on-demand routing protocol for ad-hoc networks to support end-to-end Quality of Service, which is known as the Adaptive Dispersity QoS Routing (ADQR) Protocol. We propose a route discovery algorithm to find multiple disjoint paths with longerlived connections, where each path also specifies associated network resource information. This provides an efficient approach for network resource reservation combined with data dispersion and for route maintenance. A longerlived path generally involves less route maintenance, resulting in an increase of bandwidth utilization. We propose a route maintenance algorithm to …

Example Protein Folds, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for BIO/CS 471: Algorithms for Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

The Structure And Functions Of Proteins, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for BIO 271/CS 399: Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

An Additive Schwarz Preconditioner For The Spectral Element Ocean Model Formulation Of The Shallow Water Equations, Craig C. Douglas, Gundolf Haase, Mohamed Iskandarani

Computer Science Faculty Publications

We discretize the shallow water equations with an Adams-Bashford scheme combined with the Crank-Nicholson scheme for the time derivatives and spectral elements for the discretization in space. The resulting coupled system of equations will be reduced to a Schur complement system with a special structure of the Schur complement. This system can be solved with a preconditioned conjugate gradients, where the matrix-vector product is only implicitly given. We derive an overlapping block preconditioner based on additive Schwarz methods for preconditioning the reduced system.

A Deception Based Framework For The Application Of Deceptive Countermeasures In 802.11b Wireless Networks, Suen Yek

Theses : Honours

The advance of 802.11 b wireless networking has been beset by inherent and in-built security problems. Network security tools that are freely available may intercept network transmissions readily and stealthily, making organisations highly vulnerable to attack. Therefore, it is incumbent upon defending organisations to take initiative and implement proactive defences against common network attacks. Deception is an essential element of effective security that has been widely used in networks to understand attack methods and intrusions. However, little thought has been given to the type and the effectiveness of the deception. Deceptions deployed in nature, the military and in cyberspace were …

Digitization In An Archival Environment, Sally Mckay

E-JASL: Electronic Journal of Academic and Special Librarianship (1999-2009, Volumes 1-10)

Introduction

Cultural institutions such as museums, libraries, archives, and historical societies house remarkable collections of cultural artifacts. It is the responsibility of the staff working for those institutions to preserve, protect and provide responsible stewardship for the materials, and to the best of their ability, provide continued long-term access (Russell, 2000).

Advances in technology allow institutions to provide expanded access and education; however, there are important priorities that must be addressed prior to embarking on a digital conversion project.

Digitization in an archival environment includes taking a physical object or analog item, such as an art object, a tape recording, …

Double-Tree Scan: A Novel Low-Power Scan-Path Architecture, Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zhang

School of Computing: Conference and Workshop Papers

In a scan-based system with a large number of flip-flops, a major component of power is consumed during scan-shift and clocking operation in test mode. In this paper, a novel scan-path architecture called double-tree scan (DTS) is proposed that drastically reduces the scan-shift and clock activity during testing. The inherent combinatorial properties of double-tree structure are employed to design the scan architecture, clock gating logic, and a simple shift controller. The design is independent of the structure of the circuit-under-test (CUT) or its test set. It provides a significant reduction both in instantaneous and average power needed for clocking and …