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 31021 - 31050 of 31947

Full-Text Articles in Entire DC Network

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 …


A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman Jun 1995

A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman

Dartmouth College Undergraduate Theses

No abstract provided.


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 …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 6, June 1995, College Of Engineering And Computer Science, Wright State University Jun 1995

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


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 …


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.


The Rotations Of Maxillary Molars, Mandibular Molars, And Maxillary First Premolars In Acceptable Occlusions, G. Kristian Hansen Jun 1995

The Rotations Of Maxillary Molars, Mandibular Molars, And Maxillary First Premolars In Acceptable Occlusions, G. Kristian Hansen

Loma Linda University Electronic Theses, Dissertations & Projects

The rotation of the maxillary molars is considered important in the orthodontic treatment of malocclusions. In this study a computer analysis program was developed to examine the rotations of maxillary molars, mandibular molars, and maxillary first premolars in casts of permanent dentitions with acceptable occlusions. Ninety three sets of untreated "acceptable occlusion" models from the collection of the Foundation for Orthodontic Research (FOR) were scanned on a flat bed scanner at 600 dots per inch (dpi). The images were analyzed using custom software on a computer. Measurements were made by relating maxillary first permanent molars to the midline, the archform, …


Hodographs And Normals Of Rational Curves And Surfaces, Thomas W. Sederberg, Takafumi Saito, Guo-Jin Wang Jun 1995

Hodographs And Normals Of Rational Curves And Surfaces, Thomas W. Sederberg, Takafumi Saito, Guo-Jin Wang

Faculty Publications

Derivatives and normals of rational Bézier curves and surface patches are discussed. A non-uniformly scaled hodograph of a degree m x n tensor-product rational surface, which provides correct derivative direction but not magnitude, can be written as a degree (2m - 2) x 2n or 2m x (2n - 2) vector function in polynomial Bézier form. Likewise, the scaled normal direction is degree (3m - 2) x(3n - 2). Efficient methods are developed for bounding these directions and the derivative magnitude.


The Forward-Backward Asymmetry For Charm Quarks At The Z Pole, D. Buskulic, Manoj Thulasidas Jun 1995

The Forward-Backward Asymmetry For Charm Quarks At The Z Pole, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

From 1.4 million hadronic Z decays collected by the ALEPH detector at LEP, an enriched sample of Z → cc̄ events is extracted by requiring the presence of a high momentum D∗±. The charm quark forward-backward charge asymmetry at the Z pole is measured to be AFB0.c = (8.0 ± 2.4) % corresponding to an effective electroweak mixing angle of sin2θWeff = 0.2302 ± 0.0054.


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 …


Visual Pattern Recognition Using Neural Networks, Jenlong Moh May 1995

Visual Pattern Recognition Using Neural Networks, Jenlong Moh

Dissertations

Neural networks have been widely studied in a number of fields, such as neural architectures, neurobiology, statistics of neural network and pattern classification. In the field of pattern classification, neural network models are applied on numerous applications, for instance, character recognition, speech recognition, and object recognition. Among these, character recognition is commonly used to illustrate the feature and classification characteristics of neural networks.

In this dissertation, the theoretical foundations of artificial neural networks are first reviewed and existing neural models are studied. The Adaptive Resonance Theory (ART) model is improved to achieve more reasonable classification results. Experiments in applying the …


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."


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.


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 …


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.


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 …


The Effect Of A Database Feedback System On User Performance, H. Chan, K. Wei, Keng Siau May 1995

The Effect Of A Database Feedback System On User Performance, H. Chan, K. Wei, Keng Siau

Research Collection School Of Computing and Information Systems

There are two main approaches to improving the effectiveness of database interfaces. One is to raise the level of abstraction for the content of the user-database interaction. The relational model belonging to the logical level has replaced the hierarchical and network models that belong to the lower physical level. It is likely that the relational model will eventually be replaced by models belonging to the even higher conceptual level, such as entity relationship models and object-oriented models. The second approach is to enhance the actual interaction process. This can be done by providing better feedback to the user. Feedback can …


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.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 4, April 1995, College Of Engineering And Computer Science, Wright State University Apr 1995

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


Evolving Globally Synchronized Cellular Automata, Rajarshi Das, James P. Crutchfield, Melanie Mitchell, James M. Hanson Apr 1995

Evolving Globally Synchronized Cellular Automata, Rajarshi Das, James P. Crutchfield, Melanie Mitchell, James M. Hanson

Computer Science Faculty Publications and Presentations

How does an evolutionary process interact with a decentralized, distributed system in order to produce globally coordinated behavior? Using a genetic algorithm (GA) to evolve cellular automata (CAs), we show that the evolution of spontaneous synchronization, one type of emergent coordination, takes advantage of the underlying medium's potential to form embedded particles. The particles, typically phase defects between synchronous regions, are designed by the evolutionary process to resolve frustrations in the global phase. We describe in detail one typical solution discovered by the GA, delineating the discovered synchronization algorithm in terms of embedded particles and their interactions. We also use …


Sciagents--An Agent Based Environment For Distributed, Cooperative Scientific Computing, Tzvetan T. Drashansky, Anupam Joshi, John R. Rice Apr 1995

Sciagents--An Agent Based Environment For Distributed, Cooperative Scientific Computing, Tzvetan T. Drashansky, Anupam Joshi, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Error-Bounded Reduction Of Triangle Meshes With Multivariate Data, Chandrajit L. Bajaj, Daniel R. Schikore Apr 1995

Error-Bounded Reduction Of Triangle Meshes With Multivariate Data, Chandrajit L. Bajaj, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.


Exceptions And Exception Handling In Computerized Information Processes, Diane M. Strong, Steven M. Miller Apr 1995

Exceptions And Exception Handling In Computerized Information Processes, Diane M. Strong, Steven M. Miller

Research Collection School Of Computing and Information Systems

Exceptions, situations that cannot be correctly processed by computer systems, occur frequently in computer-based information processes. Five perspectives on exceptions provide insights into why exceptions occur and how they might be eliminated or more efficiently handled. We investigate these perspectives using an in-depth study of an operating information process that has frequent exceptions. Our results support the use of a total quality management (TQM) approach of eliminating exceptions for some exceptions, in particular, those caused by computer systems that are poor matches to organizational processes. However, some exceptions are explained better by a political system perspective of conflicting goals between …


Search For Supersymmetric Particles With R-Parity Violation In Z Decays, D. Buskulic, Manoj Thulasidas Apr 1995

Search For Supersymmetric Particles With R-Parity Violation In Z Decays, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Searches for supersymmetric particles produced in e+e− interactions at the Z peak have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In a data sample collected by the ALEPH detector at LEP up to 1993, and corresponding to almost two million hadronic Z decays, no signal was observed. As a result, supersymmetric particle masses and couplings are at least as well constrained as under the usual assumption of R-parity conservation.


An Upper Limit For The Τ Neutrino Mass From Τ → 5Π(Π0)Ντ Decays, D. Buskulic, M. Thulasidas Apr 1995

An Upper Limit For The Τ Neutrino Mass From Τ → 5Π(Π0)Ντ Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

From a sample of 152,000 τ decays collected by the ALEPH detector at LEP an upper limit of 24 MeV at 95% CL on the τ neutrino mass has been determined. The limit is obtained using a two dimensional likelihood fit of the visible energy and the invariant mass distribution of 25 τ → 5π(π0)ντ events.


Expanding The Potential For Disk-Directed I/O, David Kotz Mar 1995

Expanding The Potential For Disk-Directed I/O, David Kotz

Computer Science Technical Reports

As parallel computers are increasingly used to run scientific applications with large data sets, and as processor speeds continue to increase, it becomes more important to provide fast, effective parallel file systems for data storage and for temporary files. In an earlier work we demonstrated that a technique we call disk-directed I/O has the potential to provide consistent high performance for large, collective, structured I/O requests. In this paper we expand on this potential by demonstrating the ability of a disk-directed I/O system to read irregular subsets of data from a file, and to filter and distribute incoming data according …


A Pseudo-Algorithmic Separation Of Lines From Pseudo-Lines, William Steiger, Ileana Streinu Mar 1995

A Pseudo-Algorithmic Separation Of Lines From Pseudo-Lines, William Steiger, Ileana Streinu

Computer Science: Faculty Publications

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 3, March 1995, College Of Engineering And Computer Science, Wright State University Mar 1995

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

BITs and PCs Newsletter

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


Content-Based Image Retrieval: Color And Edges, Robert S. Gray Mar 1995

Content-Based Image Retrieval: Color And Edges, Robert S. Gray

Computer Science Technical Reports

One of the tools that will be essential for future electronic publishing is a powerful image retrieval system. The author should be able to search an image database for images that convey the desired information or mood; a reader should be able to search a corpus of published work for images that are relevant to his or her needs. Most commercial image retrieval systems associate keywords or text with each image and require the user to enter a keyword or textual description of the desired image. This text-based approach has numerous drawbacks -- associating keywords or text with each image …