Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 28201 - 28230 of 29852

Full-Text Articles in Entire DC Network

Comparison Of System Identification Techniques For The Dexterous Orbital Servicing System (Doss), Allan Terrence Morris Jul 1995

Comparison Of System Identification Techniques For The Dexterous Orbital Servicing System (Doss), Allan Terrence Morris

Electrical & Computer Engineering Theses & Dissertations

The major contribution of system identification is the development of analytical models of a system. Many identification techniques can adequately describe the input and output map. One of the challenges of these techniques is to correctly infer from the measured data the characteristics of the individual, contributing components producing a more accurate system model.

In this thesis linear, dynamic, multivariable state-space models for three joints of the Dexterous Orbital Servicing System (DOSS) are identified. DOSS is a representative space station manipulator at the NASA Langley Research Center. The dynamic models of the manipulator will first be estimated by applying nonparametric …


Parallel Fast Multipole Algorithm Using Mpi, Daniel Okunbor, Eric Jui-Lin Lu Jun 1995

Parallel Fast Multipole Algorithm Using Mpi, Daniel Okunbor, Eric Jui-Lin Lu

Computer Science Technical Reports

The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is 0( N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the …


Simulation Of A Video-On-Demand System, Song Bac Toh Jun 1995

Simulation Of A Video-On-Demand System, Song Bac Toh

Dartmouth College Undergraduate Theses

This paper presents a simulation study of a video-on-demand system. The focus of the study is the effectiveness of different caching strategies on a video-on-demand system with two levels of cache, RAM and disks, in front of a tape library. Using an event-driven simulator, I show that caching was helpful in increasing the service capacity of the system. On-demand caching showed its advantages especially when the requests were clustered around a few popular titles (in other words, there was temporal locality).


Tias: A Transportable Intelligent Agent System, Kenneth Harker Jun 1995

Tias: A Transportable Intelligent Agent System, Kenneth Harker

Dartmouth College Undergraduate Theses

In recent years, there has been an explosive growth in the amount of information available to our society. In particular, the amount of information available on-line through vast networks like the global Internet has been growing at a staggering rate. This growth rate has by far exceeded the rate of growth in network speeds, as has the number of individuals and organizations seeking access to this information. There is thus a motivation to find abstract methods of manipulating this on-line data in ways that both serve the needs of end users efficiently and use network resources intelligently. In lieu of …


An Interactive Graphical User Interface Generator In The Client-Server Computational Model, Chavva Sudarshan Jun 1995

An Interactive Graphical User Interface Generator In The Client-Server Computational Model, Chavva Sudarshan

Masters Theses & Specialist Projects

Providing a user friendly and sophisticated user interface is a time-consuming and difficult task. On the other hand, the success of a software system is directly related to the quality of the user interface that it provides. In this thesis, a technique for the development of an automatic user interface is described and implemented; that is, we provide a tool that can be used to develop user interfaces on a platform known as the X-Window System. The hallmark of this tool is its ability to aid in developing reasonably sophisticated Graphical User Interfaces (GUI) interactively in relatively short time. The …


Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White Jun 1995

Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White

School of Computing: Faculty Publications

In this paper, we discuss gigabit network applications enabled by "Mission to Planet Earth," an international effort to monitor the Earth as a system. We describe the design of a network architecture to support applications developed as part of this program; introduce a new component, public access resource centers (PARC9s); and discuss how PARC's would facilitate access by users outside the traditional research community. We also describe how a particular class of users, agriculture users, might to Planet Earth program and delivered in a value-added form to them by a so-called AgPARC. The suggested architecture requires the deployment of high-bandwidth …


Dqdbsim User's Manual, Lewis Barnett Iii Jun 1995

Dqdbsim User's Manual, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

DQDBsim is a simulation program for the study of the performance of the Distributed Queue Dual Bus (DQDB) Metropolitan Area Network. The simulation is based on the description of DQDB found in [Ins90]. Only the Queued Arbitrated (QA) service is modeled by DQDBsim the inclusion of Prearbitrated (PA) service is under consideration for inclusion in a future release. This document contains a description of the program instructions for its use details of the formats of input and data files and information on other programs that are used cooperatively with DQDBsim.


Physiologically-Based Pharmacokinetic Modeling Of Skin Absorption Using Dermal Subcompartments, Richard L. Bookout Jr. Jun 1995

Physiologically-Based Pharmacokinetic Modeling Of Skin Absorption Using Dermal Subcompartments, Richard L. Bookout Jr.

Theses and Dissertations

Dermal penetration of chemicals and drugs is important to both toxicologists and pharmacologists. Drug developers try to enhance and environmental professionals try to limit penetration of chemicals through the skin. Both can use predictive biologically-based mathematical models to assist in understanding the processes involved. When these models are based on physiological and biochemical parameters which can be measured in the laboratory, they can be extremely useful. Appropriately validated models based on first principles can be predictive of human exposures when the processes involved are adequately understood. In this thesis we develop four new physiologically-based pharmacokinetic (PBPK) models to predict blood …


Pythia: A Knowledge Based System For Intelligent Scientific Computing, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Anupam Joshi, Catherine E. Houstis Jun 1995

Pythia: A Knowledge Based System For Intelligent Scientific Computing, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Anupam Joshi, Catherine E. Houstis

Department of Computer Science Technical Reports

No abstract provided.


On Learning And Adaptation In Multiagent Systems: A Scientific Computing Perspective, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis Jun 1995

On Learning And Adaptation In Multiagent Systems: A Scientific Computing Perspective, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


//Ellpack: A System For Simulating Partial Differential Equations, Sanjiva Weerawarana, Elias N. Houstis, Ann C. Catlin, John R. Rice Jun 1995

//Ellpack: A System For Simulating Partial Differential Equations, Sanjiva Weerawarana, Elias N. Houstis, Ann C. Catlin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Parallel Ellpack Elliptic Pde Solvers, Elias N. Houstis, S. B. Kim, S. Markus, P. Wu, N. E. Houstis, S. Weerawarana Jun 1995

Parallel Ellpack Elliptic Pde Solvers, Elias N. Houstis, S. B. Kim, S. Markus, P. Wu, N. E. Houstis, S. Weerawarana

Department of Computer Science Technical Reports

No abstract provided.


Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang Jun 1995

Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang

Computer Science Faculty Publications and Presentations

High-performance byte copying is important for many operating systems because it is the principle method used for transferring data between kernel and user protection domains. For example, byte copying is commonly used for transferring data from kernel buffers to user buffers during file system read and IPC recv calls and to kernel buffers from user buffers during 'Write and-send calls. Because of its impact on overall system performance, commercial operating systems tend to employ many specialized byte copy routines, each one optimized for a different circumstance.

This paper revisits the opportunities for optimizing byte copy performance by discussing a series …


Mapping Of Portable Parallel Programs, Song Chen May 1995

Mapping Of Portable Parallel Programs, Song Chen

Dissertations

An efficient parallel program designed for a parallel architecture includes a detailed outline of accurate assignments of concurrent computations onto processors, and data transfers onto communication links, such that the overall execution time is minimized. This process may be complex depending on the application task and the target multiprocessor architecture. Furthermore, this process is to be repeated for every different architecture even though the application task may be the same. Consequently, this has a major impact on the ever increasing cost of software development for multiprocessor systems. A remedy for this problem would be to design portable parallel programs which …


Document Preprocessing And Fuzzy Unsupervised Character Classification, Shy-Shyan Chen May 1995

Document Preprocessing And Fuzzy Unsupervised Character Classification, Shy-Shyan Chen

Dissertations

This dissertation presents document preprocessing and fuzzy unsupervised character classification for automatically reading daily-received office documents that have complex layout structures, such as multiple columns and mixed-mode contents of texts, graphics and half-tone pictures. First, the block segmentation algorithm is performed based on a simple two-step run-length smoothing to decompose a document into single-mode blocks. Next, the block classification is performed based on the clustering rules to classify each block into one of the types such as text, horizontal or vertical lines, graphics, and pictures. The mean white-to-black transition is shown as an invariance for textual blocks, and is useful …


Ph.D. Thesis Proprosal: Transportable Agents, Robert S. Gray May 1995

Ph.D. Thesis Proprosal: Transportable Agents, Robert S. Gray

Computer Science Technical Reports

One of the paradigms that has been suggested for allowing efficient access to remote resources is transportable agents. A transportable agent is a named program that can migrate from machine to machine in a heterogeneous network. The program chooses when and where to migrate. It can suspend its execution at an arbitrary point, transport to another machine and resume execution on the new machine. Transportable agents have several advantages over the traditional client/server model. Transportable agents consume less network bandwidth and do not require a connection between communicating machines -- this is attractive in all networks and particularly attractive in …


Transitions In Masculinity And Hemingway's Developed "Code", Daniel Polk May 1995

Transitions In Masculinity And Hemingway's Developed "Code", Daniel Polk

Honors Theses

The "Hemingway Code" is much more than two words that fit nicely together for a scholar's usage; the words signify a much deeper championing of masculinity, almost a haunting presence. For Ernest Hemingway living life every day, every moment with its fullest masculine fervor, became an obsession, a never-ending quest to be at one with the attitude of never complaining, never crying out, panicking, thinking too much, or regretting. To live a manly life in a series of tactical victories, performed with steadfast ritualistic mannerisms, is to embody masculinity, and therefore the "Hemingway Code."


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

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


A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm May 1995

A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm

Electrical Engineering and Computer Science - Technical Reports

εm is a high-level programming system which puts parallelism within the reach of scientists who are not sophisticated programmers. εm both restricts and simplifies the programming interface, and thereby eases both the conceptual task of the programmer and the analytical task of the compiler. The εm compiler performs automatic data structure definition, scheduling and data partitioning. This document presents the automatic data partitioning algorithm used in εm.


Software Testing Paradigms, A. Subramaniam, G. Zobrist May 1995

Software Testing Paradigms, A. Subramaniam, G. Zobrist

Computer Science Technical Reports

The development of software follows a series of steps adopted from the Classical Life Cycle approach. Amongst all the steps, Software testing demands a lot of attention considering the amount of effort applied in it. There are various techniques by which a software can be tested. A review of techniques available are discussed. A methodology that can be applied to software testing has also been suggested. This document can be used by a programmer to select the technique for software testing and also assists in providing a narrowed view to the vast number of techniques available for software testing.


Discovery Of Integrity Relationships In Relational Databases, D. Harrier, D. C. St. Clair May 1995

Discovery Of Integrity Relationships In Relational Databases, D. Harrier, D. C. St. Clair

Computer Science Technical Reports

The use of database management system integrity constraints has been a powerful tool in raising the quality of data within an application subject database. Unfortunately, the successful use of integrity constraints requires that the database administrator has implemented the constraint before data are inserted into the database.

The results of this research provide a methodology for discovering previously unknown integrity relationships in a relational database. The methodology uses the principles of knowledge discovery from the artificial intelligence community, and Quinlan's ID3 machine learning algorithm as the discovery tool. Experimental results are provided that demonstrate how the methodology can be applied.


A Meta-Interpreter For Circuit-Extraction, Krishnaprasad Thirunarayan May 1995

A Meta-Interpreter For Circuit-Extraction, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The design of a VLSI circuit consists of a description of the circuit in terms of its components and subcomponents, at various levels of detail. To verify that the layout of a VLSI circuit conforms to its design, one needs to work backwards from the lowest-level description of the circuit and recognize the higher-level components it constitutes. This paper is concerned with the application of logic programming techniques in the formal verification of the structural correctness of the VLSI circuit layouts. In particular, we review Michael Dukes' Generalized Extraction System (1990) that compiles design descriptions into a set of extraction …


A Performance Study Of Method Execution Alternatives In A Distributed Object Database System, Shalab Goel, Bharat Bhargava May 1995

A Performance Study Of Method Execution Alternatives In A Distributed Object Database System, Shalab Goel, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Building High Performance Communication Services For Digital Libraries, Shunge Li, Jin Huai, Bharat Bhargava May 1995

Building High Performance Communication Services For Digital Libraries, Shunge Li, Jin Huai, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


On The Distribution For The Duration Of A Randomized Leader Electron Algorithm, James Allen Fill, Hosam M. Mahmoud, Wojciech Szpankowski May 1995

On The Distribution For The Duration Of A Randomized Leader Electron Algorithm, James Allen Fill, Hosam M. Mahmoud, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Real-Time Communication In The Algorithm To Architecture Mapping Model, Somesh M. Varma May 1995

Real-Time Communication In The Algorithm To Architecture Mapping Model, Somesh M. Varma

Electrical & Computer Engineering Theses & Dissertations

The objective of this thesis is to analyze schedules of communication resources to obtain deterministic and contention-free communication in the Algorithm To Architecture Mapping Model (ATAMM). In ATAMM, performance must be deterministic to guarantee meeting deadlines. It is difficult to achieve deterministic performance in the presence of contention during communication. This thesis develops new data-flow models to study and analyze different schedules of communication resources to achieve deterministic and contention-free communication. These models are the Synchronous Communication Marked Graph (SCMG) and the Asynchronous Communication Marked Graph (ACMG). The SCMG is based on message passing synchronous communication. It defines schedules for …


Myriad: Design And Implementation Of A Federated Database Prototype, Ee Peng Lim, San-Yih Hwang, Jaideep Srivastava, Dave Clements, M. Ganesh May 1995

Myriad: Design And Implementation Of A Federated Database Prototype, Ee Peng Lim, San-Yih Hwang, Jaideep Srivastava, Dave Clements, M. Ganesh

Research Collection School Of Computing and Information Systems

A key problem in providing enterprise-wide information is the integration of databases that have been independently developed. An important requirement is to accommodate heterogeneity and maintain the autonomy of component databases. Myriad is a federated database prototype developed at the University of Minnesota, to provide a testbed for investigating alternatives in architecture and algorithms for database integration, query processing and optimization, and concurrency control and recovery. The system incorporates our group's research results in these areas. This paper describes our experiences in the design and implementation of Myriad, and in the project management. Special emphasis is given to discussing design …


Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole May 1995

Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We are currently involved in research to enable PVM to take advantage of shared networks of workstations (NOWs) more effectively. In such a computing environment, it is important to utilize workstations unobtrusively and recover from machine failures. Towards this goal, we have enhanced PVM with transparent task migration, checkpointing, and global scheduling. These enhancements are part of the MIST project which takes an open systems approach in developing a cohesive, distributed parallel computing environment. This open systems approach promotes plug-and-play integration of independently developed modules, such as Condor, DQS, A VS, Prospero, XPVM, PIOUS, Ptools, etc. Transparent task migration, in …


From Formal Security Specifications To Executable Assertions - A Distributed Systems Preliminary Study, C. Serban, B. Mcmillin Apr 1995

From Formal Security Specifications To Executable Assertions - A Distributed Systems Preliminary Study, C. Serban, B. Mcmillin

Computer Science Technical Reports

A security policy for a distributed system can be checked for compliance at run-time, as the system executes, using assertions embedded in software. This paper presents the concept of run-time security assurance, according to a given security policy for a given distributed system, along with mechanisms for its usage. A model problem illustrates the implementation of executable security assertions and their run-time validation on histories (traces) of events.


Cognitive Cooperation Through Visual Interaction, Erika Rogers Apr 1995

Cognitive Cooperation Through Visual Interaction, Erika Rogers

Computer Science and Software Engineering

The purpose of the paper is to describe a cooperative system which was designed to provide intelligent assistance in the domain of diagnostic radiology. The approach taken includes the collection and analysis of human performance data, cognitive modelling of the interaction between perception and problem solving. incorporation of this knowledge into a blackboard-based architecture. implementation of a prototype system and testing and evaluation of the prototype. These stages are described, and then discussed in the context of issues particularly relevant to the study of human-machine cooperation.