Digital Commons Network^™

Self-Organizing File Cabinet, Dawn Lawrie

Dartmouth College Undergraduate Theses

This thesis presents a self-organized file cabinet. This file cabinet uses electronic information to augment the physical world. By using a scanner to transform documents into electronic files, the self-organized file cabinet can index the documents on visual and textual information. The self-organized file cabinet helps the user find the documents at a later date. The focus of this thesis is on the design and evaluation of the self-organized file cabinet. User studies show that this tool is natural to use.

Introduction (1997), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1997

Eleventh ACMS Conference on Mathematics from a Christian Perspective

Table Of Contents (1997), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1997

Eleventh ACMS Conference on Mathematics from a Christian Perspective

Schedule (1997), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1997

Eleventh ACMS Conference on Mathematics from a Christian Perspective

Celluloid Blackness : Race, Modernity, And The Conflicted Roots Of American Cinema (1915-1939), Lincoln Farr

Honors Theses

Introduction: "The Problem of the Twentieth Century" In a full page interview in the New York Times on May 29, 1912, the Swiss psychiatrist Dr. Carl G. Jung told the American people, "It seems to me that you are about to discover yourselves. You have discovered everything else-all the land of this continent; all the resources, all the hidden things of nature."Jung used the interview to address the American people, at a moment which he somehow recognized as crucial in the development of human civilization. America, the "tragic" country which he struggled to comprehend, would soon become the harbinger of …

On Some New Constructions Of Difference Sets, Sarah Agnes Spence

Honors Theses

Difference sets are mathematical structures which arise in algebra and combinatorics, with applications in coding theory. The fundamental question is when and how one can construct difference sets. This largely expository paper looks at standard construction methods and describes recent findings that resulted in new families of difference sets. This paper provides explicit examples of difference sets that arise from the recent constructions. By gaining a thorough understanding of these new techniques, it may be possible to generalize the results to find additional new families of difference sets. The paper also introduces partial and relative difference sets and discusses how …

Impact Of The Adoption Of New Technology (Facnet) On A Minority-Owned Small Business In Colorado, Tamara L. James

McCabe Thesis Collection

FACNET is a computer network that moves Electronic Data Interchange (EDI) from the Department of Defense (DoD) and federal buying sites to and from the certified Value Added Network (VAN).

This study is conducted to answer the following questions about the use FACNET by XYZ Communications:

1) Has FACNET helped reduce the cost of paper used in the business?

2) Has FACNET helped reduce the cost of long distance calls (telephone and fax) in the business?

3) Has FACNET helped reduce the cost of traveling expenses (hotel and transportation) in the business?

4)Has FACNET helped the business to conduct in …

A Vhdl-93 Hardware Description Browser, Laura C. Debrock, Krishnaprasad Thirunarayan

Kno.e.sis Publications

This paper describes the design and implementation of the VHDL-93 Hardware Description Browser, which is a tool for the intelligent retrieval of information from VHDL designs. The Browser consists of two UNIX processes: a TCL/TK Graphical User Interface and a Prolog search engine. The GUI elicits queries from the user and submits them to the Prolog search engine via a two-way communication pipe. The search engine satisfies queries by traversing a forest of parse trees corresponding to the associated VHDL designs. The results are then sent to the GUI for posting.

Two public-domain tools were used to implement the Browser: …

Klz: A Prototype X Protocol Compression System, Ka-Tak Lo

Dartmouth College Undergraduate Theses

One of the most commonly used graphics protocol is the X Protocol, enabling programs to display graphics images. When running the X Protocol over the network, a lot of structured data (messages with fields) need to be transmitted. Delays can be detected by human users when connected through a low-bandwidth network. The solution is to compress the X protocol. XRemote, a network version of the X Protocol, uses Dictionary-based compression. In XRemote, strings are recorded in the dictionary. When a string repeats, its index in the dictionary is transmitted. Higher Bandwidth X (HBX) uses statistical modeling techniques instead. A context …

Terminal Emulation System, Chun-Fu Lee

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Terminal emulation is a personal computer application software which emulates the terminal's behavior to communicate with the mainframe/host computer. It can show the terminal screen on a personal computer screen and make the mainframe/host computer interact with it as it would with a real terminal without any distinction.

Personal computers are increasingly more powerful and efficient today. Their mobility, compatibility, flexibility, and extendibility are definitely superior to the 'dumb' traditional terminals. Terminal emulation is therefore devised to take advantage of these personal computers' redemptions to offset the traditional terminal's drawbacks and inconveniences.

A terminal emulation is actually a very complex …

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

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

The Circulating Processor Model Of Parallel Systems, Amy Apon, Lawrence Dowdy

Publications

This paper introduces the circulating processor model for parallel computer systems. The circulating processor model is a product form queuing network model where the processors are allowed to circulate between the parallel applications instead of the more traditional circulating task model. Certain behaviors of parallel systems are better captured using this new approach. The circulating processor model may be load dependent or load dependent. The load dependent circulating processor model is exact for systems which contain a single parallel application. An exact error is calculated for the load independent circulating processor model for systems which contain a single parallel application. …

Predictable File Access Latency For Multimedia, Dan Revel, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia applications are sensitive to I/O latency and jitter when accessing data in secondary storage. Transparent adaptive prefetching (TAP) uses software feedback to provide multimedia applications with file system quality of service (QoS) guarantees. We are investigating how QoS requirements can be communicated and how they can be met by adaptive resource management. A preliminary test of adaptive prefetching is presented.

Performing Bmmc Permutations Efficiently On Distributed-Memory Multiprocessors With Mpi, Thomas H. Cormen

Computer Science Technical Reports

This paper presents an architecture-independent method for performing BMMC permutations on multiprocessors with distributed memory. All interprocessor communication uses the MPI function MPI_Sendrecv_replace(). The number of elements and number of processors must be powers of 2, with at least one element per processor, and there is no inherent upper bound on the ratio of elements per processor. Our method transmits only data without transmitting any source or target indices, which conserves network bandwidth. When data is transmitted, the source and target processors implicitly agree on each other's identity and the indices of the elements being transmitted. A C-callable implementation of …

Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom

Computer Science Theses & Dissertations

The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.

We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …

Nettest: An Integrated Web-Based Test Tools, Tzy-Tao Yang

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

This report presents the design and implementation of NetTest; a Java program that can be run within a Java enabled Web browser. NetTest is a Web-based test tool, which allows instructors to create or edit tests and students to take tests using a Java-enabled Web-browser. It also allows managers to perform their tasks using similar tools.

NetTest is a server/client program, which is located on the server. While using the NetTest system, the Web browser will automatically download the program and execute it on the client machine. In other words, NetTest can be run on any kind of network …

Parallel Ellpack 3-D Problem Solving Environment, Vassilios Verykios, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Parametric Kinematic Tolerance Analysis Of General Planar Systems, Elisha Sacks, Leo Joskowicz

Department of Computer Science Technical Reports

No abstract provided.

Solving Composite Problems With Interface Relaxation, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Timestamp Based Approach For The Detection And Resolution Of Mutual Conflicts In Real-Time Distributed Systems, Sanjay Kumar Madria

Department of Computer Science Technical Reports

No abstract provided.

A Measurement Of Rb Using Mutually Exclusive Tags, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of Rb using ve mutually exclusive hemisphere tags has been performed by ALEPH using the full LEP1 statistics. Three tags are designed to select the decay of the Z0 to b quarks, while the remaining two select Z0 decays to c and light quarks, and are used to measure the tagging eciencies. The result, Rb = 0:2159 0:0009(stat) 0:0011(syst), is in agreement with the electroweak theory prediction of 0:21580:0003.

Study Of Muon-Pair Production At Centre-Of-Mass Energies From 20 To 136 Gev With The Aleph Detector, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The total cross section and the forward-backward asymmetry for the process e+e− → μ+μ−(nγ) are measured in the energy range 20–136 GeV by reconstructing the effective centre-of-mass energy after initial state radiation. The analysis is based on the data recorded with the ALEPH detector at LEP between 1990 and 1995, corresponding to a total integrated luminosity of 143.5 pb−1. Two different approaches are used: in the first one an exclusive selection of events with hard initial state radiation in the energy range 20–88 GeV is directly compared with the Standard Model predictions showing good agreement. In the second one, all …

Source-Aware Multidatabase Query Processing, Ee Peng Lim, Yinyan Cao, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

We introduce a multidatabase model to represent the information that derives from different local databases. This model, known as Tuple-Source (TS) relational model, accommodates tuples from different local databases by attaching them with their source information in the global relations which are also known as TS-relations. In other words, a source attribute is implicit in every TS-relation. To manipulate the global relations, we have developed the TSSQL query language and implemented a distributed query processor to process such queries. In this paper, we report our distributed query processing architecture and algorithms. Our architecture consists of a query mediator and a …

Introduction To Heterogeneous Computing Including Corba (Common Object Request Broker Architecture), Matthew S. Staben

Undergraduate University Honors Capstones

This capstone discusses the ability of two or more machines to cooperatively work to accomplish a task, called heterogeneous computing. It explores different ways for computers to connect. Ultimately, Staben determines that object request brokers compliant systems are ideal for communication across servers.

The Carnot Heterogeneous Database Project: Implemented Applications, Munindar Singh, Phil Cannata, Michael N. Huhns, Nigel Jacobs, Tomasz Ksiezyk, Kayliang Ong, Amit P. Sheth, Christine Tomlinson, Darrell Woelk

Kno.e.sis Publications

The Carnot project was an ambitious research project in heterogeneous databases. It integrated a variety of techniques to address a wide range of problems in achieving interoperation in heterogeneous environments. Here we describe some of the major implemented applications of this project. These applications concern(a) accessing a legacy scientific database, (b) automating a workflow involving legacy systems, (c) cleaning data, and (d) retrieving semantically appropriate information from structured databases in response to text queries. These applications support scientific decision support, business process management, data integrity enhancement, and analytical decision support, respectively. They demonstrate Carnot‘s capabilities for (a) heterogeneous query processing, …

Tact Volume 4 Issue 2, Touro College Department Of Academic Computing

Yearbooks and Newsletters

Touro Academic Computing Technologies "The Newsletter of the Department of Academic Computing at Touro College"

Characterizing A Portable Subset Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing

Kno.e.sis Publications

Goossens defined a structural operational semantics for a subset of VHDL-87 and proved that the parallelism present in VHDL is benign. We extend this work to include VHDL-93 features such as shared variables and postponed processes that change the underlying semantic model. In the presence of shared variables, nondeterministic execution of VHDL-93 processes destroys the unique meaning property. We identify and characterize a class of portable VHDL-93 descriptions for which unique meaning property can be salvaged. Our specification can serve as a correctness criteria for a VHDL-93 simulator.

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

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Prototype Implementation Of The Comprehensive Parallel Integration Tool Parint, Jay Ball

Masters Theses

The ParInt project allows users to integrate multivariate functions using parallel computers via different methods encompassed in an easy to use interface. This thesis describes the initial version of the ParInt package. Various pop up windows of the graphical user interface, program procedures, programming paradigms, integration theory, and future considerations are all described.

Feedback Control Solutions To Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems, Pushkin Kachroo, Kaan Ozbay

Electrical & Computer Engineering Faculty Research

A new method for performing dynamic traffic assignment (DTA) is presented which is applicable in real time, since the solution is based on feedback control. This method employs the design of nonlinear H∞ feedback control systems which is robust to certain class of uncertainties in the system. The solution aims at achieving user equilibrium on alternate routes in a network setting.