Digital Commons Network^™

Computational Markets To Regulate Mobile-Agent Systems, Jonathan Bredin, David Kotz, Daniela Rus, Rajiv T. Maheswaran, Cagri Imer, Tamer Başar

Dartmouth Scholarship

Mobile-agent systems allow applications to distribute their resource consumption across the network. By prioritizing applications and publishing the cost of actions, it is possible for applications to achieve faster performance than in an environment where resources are evenly shared. We enforce the costs of actions through markets where user applications bid for computation from host machines. \par We represent applications as collections of mobile agents and introduce a distributed mechanism for allocating general computational priority to mobile agents. We derive a bidding strategy for an agent that plans expenditures given a budget and a series of tasks to complete. We …

Ua8 Ssn Protection Committee Recommendations, Wku Information Technology

WKU Administration Documents

Recommendations of the Social Security Number Protection Committee.

Automated Annotation Of Heegaard Diagrams, Dmitry Mogilevsky '03

Honors Projects

No abstract provided.

A Performance-Driven Framework For Customizing Csp Middleware Support, Guoliang Xing

All Computer Science and Engineering Research

A Distributed Constraint Satisfaction Problem (DCSP) aims to find consistent assignments of values to a set of variables distributed on multiple nodes. Despite its simple definition, DCSPs can model a broad variety of traditional artificial intelligence problems. Furthermore, many problems found in emerging sensor-actuator networks can be formalized to DCSPs. However, due to the platform limitations of networked embedded systems such as sensor-actuators networks, building real-world applications for solving DCSPs not only requires the improved DCSP algorithms but also novel system approaches. This thesis first develops a performance-driven middleware framework for solving DCSP problems. Then the prototype system built with …

Using Contaminated Garbage Collection And Reference Counting Garbage Collection To Provide Automatic Storage Reclamation For Real-Time Systems, Matthew P. Hampton

All Computer Science and Engineering Research

Language support of dynamic storage management simplifies the application programming task immensely. As a result, dynamic storage allocation and garbage collection have become common in general purpose computing. Garbage collection research has led to the development of algorithms for locating program memory that is no longer in use and returning the unused memory to the run-time system for late use by the program. While many programming languages have adopted automatic memory reclamation features, this has not been the trend in Real-Time systems. Many garbage collection methods involve some form of marking the objects in memory. This marking requires time proportional …

Specialized Hardware Support For Dynamic Storage Allocation, Steven M. Donahue

All Computer Science and Engineering Research

With the advent of operating systems and programming languages that can evaluate and guarantee real-time specifications, applications with real-time requirements can be authored in higher-level languages. For example, a version of Java suitable for real-time (RTSJ) has recently reached the status of a reference implementation, and it is likely that other implementations will follow. Analysis to show the feasibility of a given set of tasks must take into account their worst-case execution time, including any storage allocation or deallocation associated with those tasks. In this thesis, we present a hardware-based solution to the problem of storage allocation and (explicit) deallocation …

Ua1b3 Technology Advisory Committee Meeting Minutes, Western Kentucky University

WKU Administration Documents

Meeting regarding the Technical Advisory Committee composition, survey results and improvements to educational technology.

Dynamic Assignment Of Scoped Memory Regions In The Translation Of Java To Real-Time Java, Morgan G. Deters

All Computer Science and Engineering Research

Advances in middleware, operating systems, and popular, general-purpose languages have brought the ideal of reasonably-bound execution time closer to developers who need such assurances for real-time and embedded systems applications. Extensions to the Java libraries and virtual machine have been proposed in a real-time Java standard, which provides for specification of release times, execution costs, and deadlines for a restricted class of threads. To use such features, the programmer is required to use unwieldy code constructs to create region-like areas of storage, associate them with execution scopes, and allocate objects from them. Further, the developer must ensure that they do …

Hashtables For Real-Time And Embedded Systems, Anand Krishnan

All Computer Science and Engineering Research

Real-time are beginning to appear in advanced, high-level programming languages such as Java. When complemented by a real-time operating system, the Real-Time Specification for Java (RTSJ) offers strong execution constraints for applications developed in Java. While the RTSJ make the basic services of Java such as storage and thread management ready for many real-time applications, the collection objects, and the rest of the application run-time library, cannot be used by RTSJ applications until their run-time properties are examined and modified as necessary to make them suitable for use by real-time applications. In this work, we examine the Hashtable collection facility …

Multiflow Tcp, Udp, Ip, And Atm Traffic Generation Module, Eliot I. Sinclair, John W. Lockwood

All Computer Science and Engineering Research

Networking devices must be capable of processing traffic flows from multiple sources. In order to verify that such devices operates properly, a network testbench can be used to inject traffic into the device. The specification of the traffic flows can be difficult. At the low level, there are header fields, data checksums, and packet length fields that all must be formatted correctly. Further, there can be multiple flows of traffic that will arrive simultaneously. It is desirable to specify traffic at a high level of abstraction. A software program can then be written to parse the specification and generate the …

Integrated Coverage And Connectivity Configuration In Wireless Sensor Networks, Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …

P-Fastus: Information Extraction System Implemented In A Constraint Programming Language -Sicstus Prolog, Rajen Subba '03

Honors Projects

P-FASTUS is an Information Extraction system developed in SICStus Prolog based on the implementation of FASTUS. It is program that extracts prespecified information such as the name of the companny, location and the position being advertised from" Job PostingIs'' in text files. The system is composed of different levels of processing phases that are implemented using finite-state transducers.

The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton

Dartmouth Scholarship

We introduce a natural variant of the (metric uncapacitated) k-median problem that we call the online median problem. Whereas the k-median problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities are placed one at a time, a facility cannot be moved once it is placed, and the total number of facilities to be placed, k, is not known in advance. The objective of an online median algorithm is to minimize the competitive ratio, that is, the worst-case ratio of the cost of an online placement to …

System-On-Chip Packet Processor For An Experimental Network Services Platform, David Taylor, Alex Chandra, Yuhua Chen, Sarang Dharmapurikar, John Lockwood, Wenjing Tang, Jonathan Turner

All Computer Science and Engineering Research

As the focus of networking research shifts from raw performance to the delivery of advanced network services, there is a growing need for open-platform systems for extensible networking research. The Applied Research Laboratory at Washington University in Saint Louis has developed a flexible Network Services Platform (NSP) to meet this need. The NSP provides an extensible platform for prototyping next-generation network services and applications. This paper describes the design of a system-on-chip Packet Processor for the NSP which performs all core packet processing functions including segmentation and reassembly, packet classification, route lookup, and queue management. Targeted to a commercial configurable …

Protecting Sensitive Credential Content During Trust Negotiation, Ryan D. Jarvis

Theses and Dissertations

Keeping sensitive information private in a public world is a common concern to users of digital credentials. A digital credential may contain sensitive attributes certifying characteristics about its owner. X.509v3, the most widely used certificate standard, includes support for certificate extensions that make it possible to bind multiple attributes to a public key contained in the certificate. This feature, although convenient, potentially exploits the certificate holder's private information contained in the certificate. There are currently no privacy considerations in place to protect the disclosure of attributes in a certificate. This thesis focuses on protecting sensitive credential content during trust negotiation …

A Thesis On A 3d Input Device For Sketching Characters, Mark A. Schroering

All Computer Science and Engineering Research

The goal of this project is to develop a 3D input device using a stiff piece of paper and a camera. The camera tracks the piece of paper in 3D space. The user orients the paper in 3D space and then draws on the paper using a pen-like device. The camera tracks the movement of the pen on the piece of paper. The location of the pen in 3D space can then be calculated from the orientation of the paper. A drawing application that uses this 3D input device was also developed. The application allows a user to make characters …

Search And Recovery Of The Space Shuttle Columbia: A Geospatial 1st Responder Perspective, Jeffrey M. Williams

Faculty Publications

A first person account of the Texas geospatial volunteers and their efforts to recover the remains of the Space Shuttle Columbia and her crew lost over eastern Texas and western Louisiana on February 1st, 2003.

Icodes: A Ship Load-Planning System, Stephen Goodman, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

The Integrated Computerized Deployment System (ICODES) is a logistic software application of ship load-planning tools that utilizes intelligent software agents in a human-computer collaborative mode. As an example of a new generation of ‘information-centric’ military decision-support systems, ICODES includes expert agents with automatic reasoning and analysis capabilities. This is made possible by an internal virtual representation of the load-planning environment, in terms of ship and cargo characteristics and the complex relationships that constitute the context within which load-planning operations are performed. ICODES agents monitor the principal determinants of cargo stowage, including: the placement and segregation requirements for hazardous cargo items; …

Sils Mrat: A Shipboard Integration Of Logistics Systems And Mission Readiness Analysis Tool, Michael A. Zang, Chris K. Neff, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

SILS (Shipboard Integration of Logistics Systems) is an umbrella program initiated and sponsored by Dr. Phillip Abraham in the Logistics Directorate of the U.S. Office of Naval Research (ONR). The SILS vision is a system of systems that brings together shipboard and shore based data and information sources in a single integrated environment. SILS MRAT (Mission Readiness Analysis Tool) is a high-level shipboard component of SILS, which applies intelligent agent technology to the near real time decision support needs of commanding officers, department heads, and key operations & maintenance personnel. This tool demonstrates the capability of a system architecture to …

On Learning Of Functions Refutably, Sanjay Jain, Efim Kinber, Rolf Wiehagen, Thomas Zeugmann

School of Computer Science & Engineering Faculty Publications

Learning of recursive functions refutably informally means that for every recursive function, the learning machine has either to learn this function or to refute it, that is to signal that it is not able to learn it. Three modi of making precise the notion of refuting are considered. We show that the corresponding types of learning refutably are of strictly increasing power, where already the most stringent of them turns out to be of remarkable topological and algorithmical richness. Furthermore, all these types are closed under union, though in different strengths. Also, these types are shown to be different with …

Avoiding Deadlock In A Multi-Processor Enviroment, Beth Davis

Honors Capstone Projects and Theses

No abstract provided.

Decision-Support Systems: Notions, Prototypes, And In-Use Applications With Emphasis On Military Applications, Jens G. Pohl, Arthur Chapman, Kym Jason Pohl, Jonathan Primrose, Adam Wozniak

Collaborative Agent Design (CAD) Research Center

This report describes work performed by the Collaborative Agent Design Research Center (CADRC) over the past several years in the design and implementation of collaborative, computer-based, decision-support systems, mostly for military applications. In these systems multiple components, either program modules or separate processes (i.e., software agents), cooperate with each other and human decision makers to solve complex problems. The components are essentially of two types: knowledge-based narrow domain experts that provide services to other agents (i.e., service-agents); and, more autonomous agents (i.e., object-agents) that represent the interests of selected objects in high level information representation schemas.

Based on the notion …

Ampnet - A Highly Available Cluster Interconnection Network, Amy Apon, Larry Bilbur

Publications

No abstract provided.

Development Of Kohonen Neural Network Application As A Pattern Recognition System For An Electronic Nose, Lori Lynn Evesque

Masters Theses

Electronic noses are used to identify and characterize unknown odors in industry. Chemometrics and neural network algorithms are used as pattern recognition systems for these devices. Experimentation with Kohonen clustering as the pattern recognition system for electronic noses was not noted prior to 1997. [BEG] This thesis investigated the use of a Kohonen neural network algorithm as a clustering algorithm for electronic nose data using the chemometrics algorithms built into the electronic nose as a performance standard. A secondary aim was to improve the clustering and identification capabilities of the Kohonen network.

The unsupervised Kohonen network was not able to …

Machine Learning Approaches For Determining Effective Seeds For K -Means Algorithm, Kaveephong Lertwachara

Doctoral Dissertations

In this study, I investigate and conduct an experiment on two-stage clustering procedures, hybrid models in simulated environments where conditions such as collinearity problems and cluster structures are controlled, and in real-life problems where conditions are not controlled. The first hybrid model (NK) is an integration between a neural network (NN) and the k-means algorithm (KM) where NN screens seeds and passes them to KM. The second hybrid (GK) uses a genetic algorithm (GA) instead of the neural network. Both NN and GA used in this study are in their simplest-possible forms.

In the simulated data sets, I investigate two …

Parallel Computation Of The Topological Skeleton Of Vector Fields, Thomas Wischgoll, Gerik Scheuermann

Computer Science and Engineering Faculty Publications

Vector fields occur in many of the problems in science and engineering. In combustion processes, for instance, vector fields describe the flow of the gas. This process can be enhanced using vector field visualization techniques. Also, wind tunnel experiments can be analyzed. An example is the design of an air wing. The wing can be optimized to create a smoother flow around it.

To analyze such kind of datasets topological methods that clearly show the whole structure of the vector field in one picture are a very good tool. During the last years, many extensions were proposed for this method. …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 6, April 2003, 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.

Relaxing The Problem-Size Bound For Out-Of-Core Columnsort, Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen

Computer Science Technical Reports

Previous implementations of out-of-core columnsort limit the problem size to $N \leq \sqrt{(M/P)^3 / 2}$, where $N$ is the number of records to sort, $P$ is the number of processors, and $M$ is the total number of records that the entire system can hold in its memory (so that $M/P$ is the number of records that a single processor can hold in its memory). We implemented two variations to out-of-core columnsort that relax this restriction. Subblock columnsort is based on an algorithmic modification of the underlying columnsort algorithm, and it improves the problem-size bound to $N \leq (M/P)^{5/3} / 4^{2/3}$ …

Stupid Columnsort Tricks, Geeta Chaudhry, Thomas H. Cormen

Computer Science Technical Reports

Leighton's columnsort algorithm sorts on an $r \times s$ mesh, subject to the restrictions that $s$ is a divisor of~$r$ and that $r \geq 2s^2$ (so that the mesh is tall and thin). We show how to mitigate both of these restrictions. One result is that the requirement that $s$ is a divisor of~$r$ is unnecessary; columnsort sorts correctly whether or not $s$ divides~$r$. We present two algorithms that, as long as $s$ is a perfect square, relax the restriction that $r \geq 2s^2$; both reduce the exponent of~$s$ to~$3/2$. One algorithm requires $r \geq 4s^{3/2}$ if $s$ divides~$r$ and …

On-Line Spatial Processing Systems, James Carswell, Michela Bertolotto

Articles

On-line Spatial Processing (OLSP) delivers high performance spatial systems for the modelling and monitoring of dynamic environments. It provides an ideal solution for the management of networks, land and assets, and the real-time tracking of changing spatial systems. OLSP is server-centric, as opposed to the primarily desktop-centric world of GIS. It places spatial data at the heart of the organisation's IT systems and integrates it with business and attribute data. The result is more effective use of spatial data and improved decision support and spatial intelligence throughout the organisation.