Computer Sciences Commons^™

The Self-Organizing Desk, Daniela Rus, Peter De Santis

Dartmouth Scholarship

The self-organizing desk is a system that enhances a physical desk-top with electronic information. It can remember, organize, update, and manipulate the information contained in the documents on a desk. The system consists of a simple robot eye that can survey the desk, a module for smart extraction of information from the images taken by the robot, a module for representing this information in multiple views, and a module that allows a user to interact with this information.

Fast Discrete Polynomial Transforms With Applications To Data Analysis For Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore

Dartmouth Scholarship

Let $\poly = \{P_0,\dots,P_{n-1}\}$ denote a set of polynomials with complex coefficients. Let $\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx$ denote any set of {\it sample points}. For any $f = (f_0,\dots,f_{n-1}) \in \cplx^n$, the {\it discrete polynomial transform} of f (with respect to $\poly$ and $\pts$) is defined as the collection of sums, $\{\fhat(P_0),\dots,\fhat(P_{n-1})\}$, where $\fhat(P_j) = \langle f,P_j \rangle = \sum_{i=0}^{n-1} f_iP_j(z_i)w(i)$ for some associated weight function w. These sorts of transforms find important applications in areas such as medical imaging and signal processing.

In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system …

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.

Influence And Consensus In Group Decision Making Environment, Fiona Fui-Hoon Nah, Byungcho Kim

Research Collection School Of Computing and Information Systems

In this research, the effect of expert support on influence and consensus in group decision making is investigated. The results indicate that ESS support diminishes the group members' influence on the group judgment as well as the influence exerted by the most influential group member. On the other hand, explanations support provided by ESS increases consensus in group decision making.

Using Expert Support And Its Explanation Facilities For Group Decision Making, Fiona Fui-Hoon Nah, Izak Benbasat

Research Collection School Of Computing and Information Systems

As information technology is increasingly used to support group work, it becomes desirable to identify the types of computer-based decision aids that are beneficial for supporting group decision making. In a review of the decision support literature, Benbasat, DeSanctis and Nault (1993) point out the lack of empirical research in examining the use of expert support for group decision making. In our review of the literature in this respect, we identified only one case study (Sviokla, 1989), which examined the processes involved in the pre- and post-use of an expert support system (ESS) called PlanPower by a group of financial …

Theoretical Foundation For Relationship Construct In Information Modeling – Relation Element Theory, Keng Siau

Research Collection School Of Computing and Information Systems

Information modeling is a critical process in software development. One of the key constructs in information modeling is the relationship construct. Though commonly used, the relationship construct is poorly defined and lacks a strong theoretical foundation. The objectives of this research are to define and classify the various relationships based on a theory in linguistic known as the relation element theory. This paper describes the theory, relates the theory to the relationship construct, and discusses the implication of the theory on the relationship construct.

Using The Quantum Computer To Break Elliptic Curve Cryptosystems, Jodie Eicher, Yaw Opoku

Department of Math & Statistics Technical Report Series

This article gives an introduction to Elliptic Curve Cryptography and Quantum Computing. It includes an analysis of Peter Shor’s algorithm for the quantum computer breakdown of Discrete Log Cryptosystems and an analog to Shor’s algorithm for Elliptic Curve Cryptosystems. An extended example is included which illustrates how this modified Shor’s algorithm will work.

Multimedia Data Analysis Using Imagetcl (Extended Version), Charles B. Owen, Fillia Makedon

Computer Science Technical Reports

ImageTcl is an new system which provides powerful Tcl/Tk based media scripting capabilities similar to those of the ViewSystem and Rivl in a unique environment that allows rapid prototyping and development of new components in the C++ language. Powerful user tools automate the creation of new components as well as the addition of new data types and file formats. Applications using ImageTcl at the Dartmouth Experimental Visualization Laboratory (DEVLAB) include multiple stream media data analysis, automatic image annotation, and image sequence motion analysis. ImageTcl combines the high speed of compiled languages with the testing and parameterization advantages of scripting languages.

Multiple Media Stream Data Analysis: Theory And Applications (Extended Version), Charles B. Owen, Fillia Makedon

Computer Science Technical Reports

This paper presents a new model for multiple media stream data analysis as well as descriptions of some applications of this model in development at Dartmouth College. This model formalizes the exploitation of correlations between multiple, potentially heterogeneous, media streams in support of numerous application areas. The goal of the technique is to determine temporal and spatial alignments which optimize a correlation function and indicate commonality and synchronization between media streams. It also provides a framework for comparison of media in unrelated domains. Applications such as text-to-speech alignment, functional magnetic resonance imaging, speaker localization, and degraded media realignment are described.

Hybrid Probabilistic Programs, Alex Dekhtyar, V. S. Subrahmanian

Computer Science and Software Engineering

The precise probability of a compound event (e.g. e₁ V e₂, e₁ Ʌ e₂) depends upon the known relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between the primitive events that constitute the compound event. To date, most research on probabilistic logic programming [20, 24, 25, 26] has assumed that we are ignorant of the relationship between primitive events. Likewise, most research in AI (e.g. Bayesian approaches) has assumed that primitive events are independent. In this paper, we propose a hybrid probabilistic logic programming language in which the user can explicitly associate, …

Dynamic Load Distribution In Mist, K. Al-Saqabi, R. M. Prouty, Dylan Mcnamee, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple architecture types and dynamic variations in the number of processes and available processors. Scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications. For efficiency, the virtual processors (VPs) of each application are gang scheduled on some subset of the available physical processors.

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor

Electrical & Computer Engineering Theses & Dissertations

Formal verification methods have been considered as a powerful complementary approach to define standards and to prove correctness of the systems. In this work, formal specification of Generic Cell Rate Algorithms are defined and proved. The specification process enables standardization for constructing Generic Cell Rate Algorithms. Standardization is an important process in the Asynchronous Transfer Mode (ATM) networks. By employing formal methods, the necessary standards could be constructed to allow different algorithms to be employed which still meet system requirements. Those system requirements are quantified in the Quality of Service (QOS).

Congestion management is a vital concept for networks in …

On-Line File Caching, Neal E. Young

Computer Science Technical Reports

Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache, pay the retrieval cost, and choose files to remove from the cache so that the total size of files in the cache is at most k. This problem generalizes previous paging and caching problems by allowing objects of arbitrary …

Fixpunktsemantik Logischer Programme, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.

Mail Server Installation And Integration, Tim Lewis

Honors Capstone Projects and Theses

No abstract provided.

The Contour Spectrum, Chandrajit L. Bajaj, Valerio Pasucci, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

General Pattern Matching, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Afec: An Adaptive Forward Error- Correction Protocol And Its Analysis, Kihong Park

Department of Computer Science Technical Reports

No abstract provided.

Quality Of Service Provision In Noncooperative Network Environments, Kihong Park, Meera Sitharam, Shaogang Chen

Department of Computer Science Technical Reports

No abstract provided.

Measurement Of The Transverse Spin Correlations In The Decay Z → Τ+Τ-, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the transverse-transverse, CTT, and transverse-normal CTN, τ spin correlations in the decay Z0 → τ+ τ− is presented based on the aplanarity angle of the decay products of both taus. Based on 80 pb−1 of data collected by ALEPH[1] in 1992, 1993 and 1994 on the peak of the Z resonance, the results are: CTT = 1.00 ± 0.14(stat) ± 0.04(syst), CTN =−0.08 ± 0.14(stat) ± 0.02(syst). These values are in agreement with the Standard Model predictions, CTT = 0.989 and CTN = 0.

Report On The 5th Ifip International Workshop On Quality Of Service, Oguz Angin, Andrew T. Campbell, Lai Tee Cheok, Raymond Liao, Koon-Seng Lim, Klara Nahrstedt

Research Collection School Of Computing and Information Systems

This paper presents a summary of the fifth International Workshop on Quality of Service (IWQOS) which was held at Columbia University in May 1997. The goal of this three-day meeting was to foster interaction between researchers active in the area of Quality of Service(QOS) research, to reflect on past experiences and lessons learnt, and to discuss future QOS challenges. To reflect this goal, this year's workshop included a hot program made up of (i) a keynote address on "Programming Telecommunications Networks"; (ii) panels addressing "QOS for Distributed Object Computing Middleware --- Fact or Fiction?" and "Reservations about Reservations"; (iii) a …

A Synthesized Methodology For Eliciting Expert Judgment For Addressing Uncertainty In Decision Analysis, Richard W. Monroe

Engineering Management & Systems Engineering Theses & Dissertations

This dissertation describes the development, refinement, and demonstration of an expert judgment elicitation methodology. The methodology has been developed by synthesizing the literature across several social science and scientific fields. The foremost consideration in the methodology development has been to incorporate elements that are based on reasonable expectations for the human capabilities of the user, the expert in this case.

Many methodologies exist for eliciting assessments for uncertain events. These are frequently elicited in probability form. This methodology differs by incorporating a qualitative element as a beginning step for the elicitation process. The qualitative assessment is a more reasonable way …

Integrating Research Into The Core Curriculum - A Case Study, Erika Rogers

Computer Science and Software Engineering

No abstract provided.

Agent Tcl: A Flexible And Secure Mobile-Agent System, Robert S. Gray

Dartmouth College Ph.D Dissertations

A mobile agent is an autonomous program that can migrate under its own control from machine to machine in a heterogeneous network. In other words, the program can suspend its execution at an arbitrary point, transport itself to another machine, and then resume execution from the point of suspension. Mobile agents have the potential to provide a {\em single, general framework} in which a wide range of distributed applications can be implemented efficiently and easily. Several challenges must be faced, however, most notably reducing migration overhead, protecting a machine from malicious agents (and an agent from malicious machines), and insulating …

Link/Loop/Node Networks, Mark E. Gilbert

Honors Theses

This document is really two separate documents that have been appended together. The first is Link/Loop/Node Networks. This document describes the theory behind link/loop/node networks (LLN), as well as the basic operating instructions for the LLN Simulator (LLNS). The second document is LLN Simulator Technical Reference. This second document describes how the LLNS was constructed using Microsoft Access 2.0, as well as how the LLNS simulates LLN.

Agent Based Systems To Support Multi- Disciplinary Probelm Solving Environments, Anupam Joshi, Naren Ramakrishnan, Tzvetan Drashansky, Elias N. Houstis, John R. Rice, L. H. Tsoukalas

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 6, June 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

Wright State University College of Engineering and Computer Science

The Complexity Of Clerkship Scheduling, Jonathan Feldman

Dartmouth College Undergraduate Theses

Medical students must complete a clerkship program in their fourth year. Individual students have preferences for the clerkships to which they are assigned. However, individual hospitals also have capacities on how many students may be assigned to each clerkship. The problem of scheduling medical students to clerkships is formalized. The problem is then placed in a theoretical framework, and the most general case of Clerkship Scheduling is proven NP-hard. A detailed approximation algorithm is given, and an implementation of this algorithm is discussed and tested.

A Toolkit For Specializing Production Operating System Code, Crispin Cowan, Dylan Mcnamee, Andrew P. Black, Calton Pu, Jonathan Walpole, Charles Krasic, Perry Wagle, Qian Zhang

Computer Science Faculty Publications and Presentations

Specialization has been recognized as a powerful technique for optimizing operating systems. However, specialization has not been broadly applied beyond the research community because the current techniques, based on manual specialization, are time-consuming and error-prone. This paper describes a specialization toolkit that should help broaden the applicability of specializing operating systems by assisting in the automatic generation of specialized code, and {\em guarding} the specialized code to ensure the specialized system continues to be correct. We demonstrate the effectiveness of the toolkit by describing experiences we have had applying it in real, production environments. We report on our experiences with …

Autonomous Construction Of Multi Layer Perceptron Neural Networks, Thomas F. Rathbun

Theses and Dissertations

The construction of Multi Layer Perceptron (MLP) neural networks for classification is explored. A novel algorithm is developed, the MLP Iterative Construction Algorithm (MICA), that designs the network architecture as it trains the weights of the hidden layer nodes. The architecture can be optimized on training set classification accuracy, whereby it always achieves 100% classification accuracies, or it can be optimized for generalization. The test results for MICA compare favorably with those of backpropagation on some data sets and far surpasses backpropagation on others while requiring less FLOPS to train. Feature selection is enhanced by MICA because it affords the …