Physical Sciences and Mathematics Commons^™

Moving Towards Massively Scalable Video-Based Sensor Networks, Wu-Chi Feng, Jonathan Walpole, Calton Pu, Wu-Chang Feng

Computer Science Faculty Publications and Presentations

Networking and computing technologies are becoming advanced enough to enable a wealth of diverse applications that will drastically change our everyday lives. Some past examples of these developments include the World Wide Web and wireless data networking infrastructures. As is quite obvious, the World Wide Web has enabled a fundamental change in the way many people deal with day-to-day tasks. Through the web, one can now make on-line reservations for travel, pay bills through on-line banking services, and view personalized on-line newscasts. More recently, developments in wireless technologies have enabled anywhere, anytime access to information over wireless medium. As wireless …

Infosphere Project: An Overview, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We describe the Infosphere project, which is building the systems software support for information-driven applications such as digital libraries and electronic commerce. The main technical contribution is the Infopipe abstraction to support information flow with quality of service. Using building blocks such as program specialization, software feedback, domain-specific languages, and personalized information filtering, the Infopipe software generates code and manage resources to provide the specified quality of service with support for composition and restructuring.

Modeling The Transient Rate Behavior Of Bandwidth Sharing As A Hybrid Control System, Kang Li, Molly H. Shor, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

This paper uses hybrid control to model a problem of computer network systems, the dynamic behavior of bandwidth sharing among competing TCP traffic. It has been well known in the computer network community that well-behaved (TCP-friendly) congestion control mechanisms are crucial to the robustness of the Internet. Congestion control determines the transmission rate for each flow. Right now, most TCP-friendly research focuses only on the average throughput behavior without considering how the data is sent out in the short-term (e.g. bursty or smooth). However, recent experimental results show that short-term rate adjustments can change the bandwidth sharing result. Therefore, it …

Information Security: Securing Smart Cards With Iris Recognition, Orval E. Phelps

Theses and Dissertations

This thesis examines the application of iris recognition technology to the problem of keeping smart cards secure. In order to understand the technology, a comprehensive literature review was conducted. The biological components of the iris were examined to ensure that they were truly random in development and static through the lifetime of the individual. Specifically, the physical structure of what comprises the iris was examined in detail. The data gathered indicates that the iris is formed early in development, random in structure, and stable throughout the person's lifetime. Next, the iris recognition process and resulting recognition code was examined to …

Design And Specification Of Dynamic, Mobile And Reconfigurable Multiagent Systems, Athie L. Self

Theses and Dissertations

Multiagent Systems use the power of collaborative software agents to solve complex distributed problems. There are many Agent-Oriented Software Engineering (AOSE) methodologies available to assist system designers to create multiagent systems. However, none of these methodologies can specify agents with dynamic properties such as cloning, mobility or agent instantiation. This thesis starts the process to bridge the gap between AOSE methodologies and dynamic agent platforms by incorporating mobility into the current Multiagent Systems Engineering (MaSE) methodology. Mobility was specified within all components composing a mobile agent class. An agent component was also created that integrated the behavior of the components …

Implementation And Analysis Of The Parallel Genetic Rule And Classifier Construction Environment, David M. Strong

Theses and Dissertations

This paper discusses the Genetic Rule and Classifier Construction Environment (GRaCCE), which is an alternative to existing decision rule induction (DRI) algorithms. GRaCCE is a multi-phase algorithm which uses evolutionary search to mine classification rules from data. The current implementation uses a genetic algorithm based 0/1 search to reduce the number of features to a minimal set of features that make the most significant contributions to the classification of the input data set. This feature selection increases the efficiency of the rule induction algorithm that follows. However, feature selection is shown to account for more than 98 percent of the …

Branching Exponent Heterogeneity And Wall Shear Stress Distribution In Vascular Trees, Kelly Lynn Karau, Gary S. Krenz, Christopher A. Dawson

Mathematics, Statistics and Computer Science Faculty Research and Publications

A bifurcating arterial system with Poiseuille flow can function at minimum cost and with uniform wall shear stress if the branching exponent (z) = 3 [where z is defined by (D ₁)^z = (D ₂)^z + (D ₃)^z; D ₁ is the parent vessel diameter and D ₂ and D ₃ are the two daughter vessel diameters at a bifurcation]. Because wall shear stress is a physiologically transducible force, shear stress-dependent control over vessel diameter would appear to provide a means for preserving this optimal structure through maintenance …

Symbolic Dynamics And Computation In Model Gene Networks, R. Edwards, Hava Siegelmann, K. Aziza, L. Glass

Hava Siegelmann

We analyze a class of ordinary differential equations representing a simplified model of a genetic network. In this network, the model genes control the production rates of other genes by a logical function. The dynamics in these equations are represented by a directed graph on an n-dimensional hypercube (n-cube) in which each edge is directed in a unique orientation. The vertices of the n-cube correspond to orthants of state space, and the edges correspond to boundaries between adjacent orthants. The dynamics in these equations can be represented symbolically. Starting from a point on the boundary between neighboring orthants, the equation …

Method And Apparatus For Detection And Prevention Of Calling Card Fraud, Hooshmand Afsar, David S. Janzen, Mark Ross Erickson, Hazel Suzanne Shirley, Christine Louise Fogarty, Michael Scott Nielsen, Douglas Alan Clark

Computer Science and Software Engineering

A method and apparatus for detection and prevention of calling card fraud is disclosed. The invention provides enhanced intelligence and efficiency in part applying by a fraud analysis associated with a calling card bill type or service provider as identified by originating partitions in network switches. Additionally, the invention incorporates a case-subcase arrangement of fraud analysis information and conducts fraud analysis on a case-by-case basis, thereby providing streamlined handling of suspected fraud. Still additionally, the invention includes an administrative monitor that continuously collects and reviews fraud system status information to detect abnormalities in the system.

Transition From Data To Information, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

It is often lamented that we human beings are suffering from an information overload. This is a myth; as shown in Fig.1, there is no information overload. Instead, we are suffering from a data overload. The confusion between data and information is not readily apparent and requires further explanation. Unorganized data are voluminous but of very little value. Over the past 15 years, industry and commerce have made significant efforts to rearrange this unorganized data into purposeful data, utilizing various kinds of database management systems. However, even in this organized form, we are still dealing with data and not …

From Rs-232 To Object Request Brokers: Incremental Object-Oriented Networking Projects, David S. Janzen

Computer Science and Software Engineering

Selecting an appropriate set of laboratory experiences and projects for a Data Communications and Computer Networks course can be difficult due to the broad and deep nature of the topics. Emphasis may be placed on many networking aspects including design, evaluation, efficiency, security, protocols, tools, and applications. This paper presents a set of projects that attempt to integrate software engineering and systems administration topics. The projects emphasize network application programming. Particular attention will be given to a sequence of incremental projects using an object-oriented approach including the use of the Unified Modeling Language (UML) and a design pattern.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 5, February 2001, 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.

Parallel 3d Reconstruction Of Assymmetric Virus Structure From Electron From Electron Micrographs: Algorithms And Experiments, Robert E. Lynch, Dan C. Marinescu, Yongchang Ji, Hong Lin

Department of Computer Science Technical Reports

No abstract provided.

Configuration Space Computations For Polyhedra With Planar Motions, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

A Framework For Supporting The Class Of Space Partitioning, Walid G. Aref, Ihab F. Ilyas

Department of Computer Science Technical Reports

No abstract provided.

Adaptive Proportional-Delay Differentiated Services: Characterization And Performance Evaluation, Matthew K. H. Leung, John C. S. Lui, David K.Y. Yau

Department of Computer Science Technical Reports

No abstract provided.

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that …

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu

Research Collection School Of Computing and Information Systems

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].

A More Efficient Document Retrieval Method For Texpros, Yin Dong

Dissertations

Document processing is a critical element of office automation. Through document classification, extraction and filing, documents are automatically placed into a knowledge base according to certain rules. Document retrieval is a process to get a document back according to a user's requirements and to show the results to the user. Hence, a good user-interface and an efficient retrieval algorithm become core parts of document retrieval.

Unlike previous browsers that have been proposed for this purpose, this dissertation develops a new browser that has a user interface with more tools, and one that has a more efficient retrieval algorithm that can …

Towards Hypermedia Support In Database Systems, Anirban Bhaumik

Theses

The general goal of our research is to automatically generate links and other hypermedia related services to analytical applications. Using a dynamic hypermedia engine (DHE), the following features have been automated for database systems. Based on the database's relational (physical) schema and its original (non-normalized) entity-relationship specification links are generated, database application developers may also specify the relationship between different classes of database elements. These elements can be controlled by the same or different database application, or even by another software system. A DHE prototype has been developed and illustrates the above for a relational database management system.

The DHE …

Visualization Techniques For Routing Protocols And Router Configurations, Vandana Pursnani

Theses

An autonomous system (AS) is a group of routers managed by a particular organization. Exterior gateway protocols (EGP) are used between AS's Internal Gateway Protocols (IGP) is used within an AS. The most common protocols used with TCP/IP are RIP, OSPF (Open Shortest Path First), IGRP / Enhanced IGRP.

The thesis revolves around OSPF protocol OSPF uses flooding to exchange link-state updates between routers. Any change in routing information is flooded to all routers in the network. Areas are introduced to put a boundary on the explosion of link-state updates. Flooding and calculation of the Dijkstra algorithm on a router …

Managing Toxic And Hazardous Substances Of Concern In Manufacturing, Craig Jancerak

Theses

This thesis examined data management from an object relational database perspective. The database used was a product from Cornell University called PREDATOR. The context of the evaluation is the life-cycle of a manufactured product. The manufacturing life-cycle was chosen to correspond to an environmental life-cycle being done at NJIT. However, the goal was to use a generic model that could be applied to many situations.

The first phase developed the conceptual life-cycle model. At a high level, the model was not designed with a programming language in mind. Several questions needed to be answered and the a [sic] model answers …

Mobile-Agent Versus Client/Server Performance: Scalability In An Information-Retrieval Task, Robert S. Gray, David Kotz, Ronald A. Peterson Jr, Peter Gerken, Martin Hofmann, Daria Chacon, Greg Hill, Niranjan Suri

Computer Science Technical Reports

Mobile agents are programs that can jump from host to host in the network, at times and to places of their own choosing. Many groups have developed mobile-agent software platforms, and several mobile-agent applications. Experiments show that mobile agents can, among other things, lead to faster applications, reduced bandwidth demands, or less dependence on a reliable network connection. There are few if any studies of the scalability of mobile-agent servers, particularly as the number of clients grows. We present some recent performance and scalability experiments that compare three mobile-agent platforms with each other and with a traditional client/server approach. The …

Modeling An Algebraic Stepper, John Clements, Mathew Flatt, Matthias Felleisen

Computer Science and Software Engineering

Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which are the most important tools. In this paper, we make the case that other tools, such as debuggers and steppers, deserve semantic models, too, and that using these models can help in developing these tools. Our concrete starting point is the algebraic stepper in DrScheme, our Scheme programming environment. The algebraic stepper explains a Scheme computation in terms of an algebraic rewriting of the program text. A program is rewritten until it is in …

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

CSE 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.

Optimization Of Amplifier Placements In Switch-Based Optical Networks, Ling Zong, Byrav Ramamurthy

CSE Conference and Workshop Papers

Wavelength division multiplexing (WDM) offers a solution to the problem of exploiting the large bandwidth on optical links; it is the current favorite multiplexing technology for optical communication networks. Due to the high cost of an optical amplifier, it is desirable to strategically place the amplifiers throughout the network in a way that guarantees that all the signals are adequately amplified while minimizing the total number amplifiers being used. Previous studies all consider a star-based network. This paper demonstrates an original approach for solving the problem in switch-based WDM optical network assuming the traffic matrix is always the permutation of …

Design Verification And Functional Testing Of Finite State Machines, Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr

CSE Conference and Workshop Papers

The design of a finite state machine can be verified by simulating all its state transitions. Typically, state transitions involve many don’t care inputs that must be fully expanded for an exhaustive functional verification. However, by exploiting the knowledge about the design structure it is shown that only a few vectors from the fully expanded set suffice for both design verification and testing for manufacturing defects. The main contributions of the paper include a unified fault model for design errors and manufacturing faults and a function-based analysis of the circuit structure for the purpose of generating tests under the unified …

A Generator Of Random Instances Of Binary Finite Constraint Satisfaction Problems With Controllable Levels Of Interchangeability, Hui Zou, Amy Beckwith, Berthe Y. Choueiry

CSE Technical Reports

In order to test the performance of algorithms for solving Constraint Satisfaction Problems (CSPs), we must establish a large collection of CSP instances that meet a given set of specifications, such as the number of variables, domain size, constraint density, tightness, etc. The goal of this report is to describe a generator of instances that have a specified degree of interchangeability. An example of such a generator is described in (Freuder and Sabin 1997), which generates non-reflexive constraints and does not allow us to control concurrently the degree of interchangeability and tightness. We have developed a technique and written a …

Adaptive Segmentation Of Document Images, Don Sylwester, Sharad C. Seth

CSE Conference and Workshop Papers

A single-parameter text-line extraction algorithm is described along with an efficient technique for estimating the optimal value for the parameter for individual images without need for ground truth. The algorithm is based on three simple tree operations, cut, glue and flip. An XY-tree representing the segmentation is incrementally transformed to reflect a change in the parameter while intrinsic measures of the cost of the transformation are used to detect when specific tree operations would cause an error if they were performed, allowing these errors to be avoided. The algorithm correctly identified 98.8% of the area of the ground truth bounding …

Infrastructure Support For Controlled Experimentation With Software Testing And Regression Testing Techniques, Hyunsook Do, Sebastian Elbaum, Gregg Rothermel

CSE Technical Reports

Where the creation, understanding, and assessment of software testing and regression testing techniques are concerned, controlled experimentation is an indispensable research methodology. Obtaining the infrastructure necessary to support such experimentation, however, is difficult and expensive. As a result, progress in experimentation with testing techniques has been slow, and empirical data on the costs and effectiveness of techniques remains relatively scarce. To help address this problem, we have been designing and constructing infrastructure to support controlled experimentation with testing and regression testing techniques. This paper reports on the challenges faced by researchers experimenting with testing techniques, including those that inform the …