Digital Commons Network^™

Module Embedding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

This paper proposes a code reuse mechanism called module embedding that enables the building of new modules from existing ones through inheritance, overriding of procedures, and overriding of types; the paper also describes an implementation scheme for this mechanism. Module embedding is beneficial when modules and classes are used in combination and need to be extended together, or when modules are more appropriate medium than classes.

Electro-Deposition Of Polymer Chains On An Adsorbing Wall: Density Profiles And Wall Coverage, Grace M. Foo, Ras B. Pandey

Faculty Publications

Growth of polymer density in an electro-deposition model of polymer chains on an impenetrable wall is studied on a two dimensional discrete lattice using a Monte Carlo simulation. Polymer-polymer repulsion and polymer-wall attraction for the adsorbing wall (along with the neutral and repulsive interactions) are considered in an external field. Effects of the field strength (B), temperature (T), and chain length (L-c) on the density profile of the polymer chains and wall coverage are investigated. The spatial density profile shows onset of oscillation near the wall at a characteristic field (B-c) which depends on chain length and temperature, In low …

Learning To See Analogies: A Connectionist Exploration, Douglas S. Blank

Computer Science Faculty Research and Scholarship

The goal of this dissertation is to integrate learning and analogy-making. Although learning and analogy-making both have long histories as active areas of research in cognitive science, not enough attention has been given to the ways in which they may interact. To that end, this project focuses on developing a computer program, called Analogator, that learns to make analogies by seeing examples of many different analogy problems and their solutions. That is, it learns to make analogies by analogy. This approach stands in contrast to most existing computational models of analogy in which particular analogical mechanisms are assumed a priori …

Bias And The Probability Of Generalization, Tony R. Martinez, D. Randall Wilson

Faculty Publications

In order to be useful, a learning algorithm must be able to generalize well when faced with inputs not previously presented to the system. A bias is necessary for any generalization, and as shown by several researchers in recent years, no bias can lead to strictly better generalization than any other when summed over all possible functions or applications. This paper provides examples to illustrate this fact, but also explains how a bias or learning algorithm can be “better” than another in practice when the probability of the occurrence of functions is taken into account. It shows how domain knowledge …

The Platonic Spheroids, Jörg Peters, Leif Kobbelt

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Algorithm For Determining Orientations Of Biological Macro- Molecules Imaged By Electron Microscopy, Timothy S. Baker, Ionana M. Boier Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Collaborative Environments For Scientific Computing The Task Of Algorithm/Software Selection, N. Ramakrishnan, Anupam Joshi, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Compact Recognizers Of Episode Sequences, Alberto Apostolico, Mikhail J. Attalah

Department of Computer Science Technical Reports

No abstract provided.

Interactive Visualization Of Multi- Dimensional Scientific Data (Ph.D. Thesis), Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

Interview: Don Hearn, Karen Aardal

About Harlan D. Mills

No abstract provided.

Ta Da! - The Text Adventure Design Assistant A Visual Tool For The Development Of Adventure Games, Sean Molley

Masters Theses & Specialist Projects

In this paper, I survey past and present tools available to text adventure game authors, and then describe a new product: the Text Adventure Design Assistant (TA DA!), a visual programming system for creating text adventure games. My system consists of two parts: an abstract framework which defines an archetypical game, and a user interface which allows for the construction of games in a visual manner by manipulating the elements of the abstract game to produce a concrete design. The two most popular contemporary programming languages for creating text adventure games, TADS and Inform, are compared and contrasted, and my …

Flow And Congestion Control For Internet Streaming Applications, Shanwei Cen, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The emergence of streaming multimedia players provides users with low latency audio and video content over the Internet. Providing high-quality, best-effort, real-time multimedia content requires adaptive delivery schemes that fairly share the available network bandwidth with reliable data protocols such as TCP. This paper proposes a new flow and congestion control scheme, SCP (Streaming Control Protocol) , for real-time streaming of continuous multimedia data across the Internet. The design of SCP arose from several years of experience in building and using adaptive real-time streaming video players. SCP addresses two issues associated with real-time streaming. First, it uses a congestion control …

Layout For Visualizing Large Software Structures In 3d, Colin Ware, Glenn Franck, Monica Parkhi, Tim Dudley

Center for Coastal and Ocean Mapping

There is increasing evidence that 3D visualization of complex structures has advantages over 2D visualization. While nested directed graphs are an important method of representing information in 2D or 3D, they must be effectively organized in order to be understood. Most work on graph layout has assumed that fully automatic layout is desirable. Through our work with graphs representing large software structures, we have found that, due to the importance of the semantic content, it is necessary to combine automatic layout with manual layout. This paper describes a system called GraphVisualizer3D, which was designed to help people understand large nested …

Corrigendum To “Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal”: Mathl. Comput. Modelling, Vol. 25, No. 6, Pp. 7–17, 1997, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

The computer program that was used to generate the graphs for the concentration of inhibitor contained an error. This influenced the scaling in the original Figures 2 and 3. As an example, a sample of the corrected graphs are given below. Copies of other corrected figures can be obtained from the authors. It is important to note that the “pulse” appears for the function rC(r, t). As can be seen, it travels slowly outward with decreasing amplitude. The mathematical analysis in the paper remains unchanged.

Inclusive Production Of Neutral Pions In Hadronic Z Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the inclusive production of π0 mesons in hadronic Z decays is presented and compared to Monte Carlo model predictions. The analysis is based on approximately 2 million hadronic events recorded with the ALEPH detector at LEP at a centre-of-mass energy of ⊡s = 91.2 GeV. Neutral pions are reconstructed using photons measured in the electromagnetic calorimeter and photons from conversion pairs. The inclusive π0 momentum spectrum is measured in the range 0.025 x p = p/p beam 0 per hadronic Z is found to be 4.80 ± 0.07(stat) ± 0.31(sys). The differential inclusive π0 cross section is …

Market-Based Resource Control For Mobile Agents, Jonathan Bredin, David Kotz, Daniela Rus

Computer Science Technical Reports

Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resources. We discuss a system for controlling the activities of mobile agents that uses electronic cash, a banking system, and a set of resource managers. We describe protocols for transactions between agents. We present fixed-pricing and dynamic-pricing policies for resources. We focus on and analyze the sealed-bid second-price auction as a mechanism for dynamic pricing.

Vic*: A Compiler For Virtual-Memory C*, Alex Colvin, Thomas H. Cormen

Computer Science Technical Reports

This paper describes the functionality of ViC*, a compiler for a variant of the data-parallel language C* with support for out-of-core data. The compiler translates C* programs with shapes declared outofcore, which describe parallel data stored on disk. The compiler output is a SPMD-style program in standard C with I/O and library calls added to efficiently access out-of-core parallel data. The ViC* compiler also applies several program transformations to improve out-of-core data layout and access.

Qos And Reliability Models For Network Computing, Ladislau Bölöni, Kyung Koo Jun, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Simulation Study Of Learning Automata Games In Automated Highway Systems, Cem Unsal, Pushkin Kachroo, John S. Bay

Electrical & Computer Engineering Faculty Research

One of the most important issues in Automated Highway System (AHS) deployment is intelligent vehicle control. While the technology to safely maneuver vehicles exists, the problem of making intelligent decisions to improve a single vehicle’s travel time and safety while optimizing the overall traffic flow is still a stumbling block. We propose an artificial intelligence technique called stochastic learning automata to design an intelligent vehicle path controller. Using the information obtained by on-board sensors and local communication modules, two automata are capable of learning the best possible (lateral and longitudinal) actions to avoid collisions. This learning method is capable of …

Searches For Scalar Top And Scalar Bottom Quarks At Lep2, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for scalar top and bottom quarks have been performed with data collected by the ALEPH detector at LEP. The data sample consists of 21.7 pb−1 taken at √ s = 161, 170, and 172 GeV and 5.7 pb−1 taken at √ s = 130 and 136 GeV. No evidence for scalar top quarks or scalar bottom quarks was found in the channels ˜t → cχ, ˜t → bℓν˜, and b˜ → bχ. For the channel ˜t → cχ a limit of 67 GeV/c 2 has been set on the scalar top quark mass, independent of the mixing angle between …

Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein

Dartmouth Scholarship

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms …

Updated Measurement Of The Τ Lepton Lifetime, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A new measurement of the mean lifetime of the τ lepton is presented. Three different analysis methods are applied to a sample of 90000 τ pairs, collected in 1993 and 1994 with the ALEPH detector at LEP. The average of this measurement and those previously published by ALEPH is ττ = 290.1±1.5±1.1fs.

Tertiary Storage In Multimedia Systems: Staging Or Direct Access?, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Multimedia applications that are required to manipulate large collections of objects are becoming increasingly common. Moreover, the size of multimedia objects, which are already huge, are getting even bigger as the resolution of output devices improve. As a result, many multimedia storage systems are not likely to be able to keep all of their objects disk-resident. Instead, a majority of the less popular objects have to be off-loaded to tertiary storage to keep costs down. The speed at which objects can be accessed from tertiary storage is thus an important consideration. In this paper, we propose an adaptive data retrieval …

The Impact Of Multimedia Training On Mental Models Of Simple Processes, Johnny L. Washington, Erika Rogers

Computer Science and Software Engineering

The purpose of this paper is to describe work in progress on a project which is designed to study how multimedia training may impact people’s mental models of sample processes. A tutorial is under development which helps people learn how to construct an abstract model of the steps needed to produce a letter on a typewriter, and how to change this model when the task moues to a computerized setting. Subjects have been recruited to participate in this study, and the current status of the project is discussed.

Outbreak Agent: Intelligent Wearable Technology For Hazardous Environments, Erika Rogers, Robin R. Murphy, Chris Thompson

Computer Science and Software Engineering

The topic of this paper is a project to design an intelligent agent which supports humans in the domain of hazardous site investigation. This software agent will be integrated into wearable technology which is embedded in the protective clothing worn by the humans. An overview of some of the design issues is presented, with a particular emphasis on the visual problem solving component.

Computing Dense Clusters On-Line For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus

Computer Science Technical Reports

We present and analyze the off-line star algorithm for clustering static information systems and the on-line star algorithm for clustering dynamic information systems. These algorithms partition a document collection into a number of clusters that is naturally induced by the collection. We show a lower bound on the accuracy of the clusters produced by these algorithms. We use the random graph model to show that both star algorithms produce correct clusters in time Theta(V + E). Finally, we provide data from extensive experiments.

Approximating Disjoint-Path Problems Using Greedy Algorithms And Packing Integer Programs, Stavros G. Kolliopoulos, Clifford Stein

Computer Science Technical Reports

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T}$ of connection requests. Every connection request in ${\cal T}$ is a vertex pair $(s_i,t_i),$ $1 \leq i \leq K.$ The objective is to connect a maximum number of the pairs via edge(vertex)-disjoint paths. The edge-disjoint path problem can be generalized to the multiple-source unsplittable flow problem where connection request $i$ has a demand $\rho_i$ and every edge $e$ a capacity $u_e.$ All these problems are NP-hard and have a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness …

Purdue-On-Line: A Facility And Distributed Learning Framework To Develop And Deliver Internet Based Education, Elias N. Houstis, Ahmed K. Elmagarmid, Sanjiva Weerawarana, Anthony L. Peiris, Nitesh D. Dhanjani, Gordon L. Coppoc, Abdalfattah Y.M. Nour, Lefteris H. Tsoukalas, Don Jones

Department of Computer Science Technical Reports

No abstract provided.

Some Theory And Practice Of Greedy Off- Line Textual Substitution, Alberto Apostolico, Stefano Lonardi

Department of Computer Science Technical Reports

No abstract provided.

Selecting An Effective Task-Specific Contact Analysis Algorithm, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan

Department of Computer Science Technical Reports

No abstract provided.