Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Purdue University (80)
- Syracuse University (43)
- Dartmouth College (19)
- Missouri University of Science and Technology (16)
- Washington University in St. Louis (15)
-
- Taylor University (10)
- Singapore Management University (8)
- Wright State University (4)
- Butler University (3)
- California Polytechnic State University, San Luis Obispo (3)
- Old Dominion University (3)
- University of Nebraska - Lincoln (3)
- Claremont Colleges (2)
- Florida International University (2)
- Loyola University Chicago (2)
- Portland State University (2)
- University of Massachusetts Amherst (2)
- Brigham Young University (1)
- Illinois Wesleyan University (1)
- Marquette University (1)
- Molloy University (1)
- Technological University Dublin (1)
- University of Nebraska at Omaha (1)
- University of New Hampshire (1)
- Western Kentucky University (1)
- Whittier College (1)
- Keyword
-
- Parallel computing (6)
- Logic programming (4)
- Neural networks (4)
- Parallel algorithms (4)
- Algorithms (3)
-
- Artificial Intelligence (3)
- File system (3)
- Load balancing (3)
- Combinatorics (2)
- Data allocation (2)
- Data partitioning (2)
- Expert systems (2)
- Fast Fourier transform (2)
- Functional Reasoning (2)
- Generic algorithms (2)
- Graph theory (2)
- Graphs (2)
- Mathematics (2)
- Multicomputer Systems (2)
- Network Partitioning (2)
- Parallel-io (2)
- Performance Evaluation (2)
- Physical optimization methods (2)
- Program specification (2)
- Programming paradigms (2)
- Quicksort (2)
- Task Scheduling (2)
- Task allocation. (2)
- Tree machine (2)
- A-Scan (1)
- Publication
-
- Department of Computer Science Technical Reports (80)
- Electrical Engineering and Computer Science - Technical Reports (36)
- Computer Science Technical Reports (16)
- All Computer Science and Engineering Research (15)
- ACMS Conference Proceedings 1991 (10)
-
- Opportunities for Undergraduate Research Experience Program (OURE) (9)
- Research Collection School Of Computing and Information Systems (8)
- Computer Science Faculty Research & Creative Works (7)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (5)
- Computer Science Faculty Publications (4)
- Kno.e.sis Publications (4)
- Computer Science and Software Engineering (3)
- Dartmouth Scholarship (3)
- Scholarship and Professional Work - LAS (3)
- All HMC Faculty Publications and Research (2)
- CSE Conference and Workshop Papers (2)
- Computer Science Department Faculty Publication Series (2)
- Computer Science Faculty Publications and Presentations (2)
- Computer Science: Faculty Publications and Other Works (2)
- FIU Electronic Theses and Dissertations (2)
- Articles (1)
- Center for Coastal and Ocean Mapping (1)
- Electrical Engineering and Computer Science - All Scholarship (1)
- Faculty Publications (1)
- Faculty Works: MCS (1984-2023) (1)
- Honors Projects (1)
- Mathematics (1)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (1)
- Northeast Parallel Architecture Center (1)
- School of Computing: Faculty Publications (1)
Articles 1 - 30 of 226
Full-Text Articles in Physical Sciences and Mathematics
Unix And Security: The Influences Of History, Eugene H. Spafford
Unix And Security: The Influences Of History, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Three Letters On Computer Security And Society, Eugene H. Spafford
Three Letters On Computer Security And Society, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
User Authentication And Related Topics: An Annotated Bibliography, Eugene H. Spafford, Stephen A. Weeber
User Authentication And Related Topics: An Annotated Bibliography, Eugene H. Spafford, Stephen A. Weeber
Department of Computer Science Technical Reports
No abstract provided.
A Note On Many-One And 1-Truth-Table Complete Languages, Steven Homer, Stuart A. Kurtz, James S. Royer
A Note On Many-One And 1-Truth-Table Complete Languages, Steven Homer, Stuart A. Kurtz, James S. Royer
Electrical Engineering and Computer Science - Technical Reports
The polynomial time 1-tt complete sets for EXP and RE are polynomial time many-one complete.
The Combinatorics Of Algebraic Splines, Chanderjit L. Bajaj
The Combinatorics Of Algebraic Splines, Chanderjit L. Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Optimal Algorithms For Multipacket Routing Problems On Rings, Fillia Makedon, Antonios Symvonis
Optimal Algorithms For Multipacket Routing Problems On Rings, Fillia Makedon, Antonios Symvonis
Computer Science Technical Reports
We study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. We prove a new lower bound of 2n/ 3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems the lower bound is kn/ 4,k >2, where k is the number of packets per processor. The trivial algorithm needs in the worst case k | n /2| steps to terminate. An algorithm that completes the routing in …
Visualization Of Four Dimensional Space And Its Applications (Ph.D. Thesis), Jianhua Zhou
Visualization Of Four Dimensional Space And Its Applications (Ph.D. Thesis), Jianhua Zhou
Department of Computer Science Technical Reports
No abstract provided.
An Efficient Neural Algorithm For The Multiclass Problem, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
An Efficient Neural Algorithm For The Multiclass Problem, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
One connectionist approach to the classification problem, which has gained popularity in recent years, is the use of backpropagation-trained feed-forward neural networks. In practice, however, we find that the rate of convergence of net output error is especially low when training networks for multi-class problems. In this paper, we show that while backpropagation will reduce the Euclidean distance between the actual and desired output vectors, the difference between some of the components of these vectors will actually increase in the first iteration. Furthermore, the magnitudes of subsequent weight changes in each iteration are very small, so that many iterations are …
Efficient Maximum-Likelihood Soft-Decision Decoding Of Linear Block Codes Using Algorithm A, Yunghsiang S. Han, Carlos R.P. Hartmann, Chih-Chieh Chen
Efficient Maximum-Likelihood Soft-Decision Decoding Of Linear Block Codes Using Algorithm A, Yunghsiang S. Han, Carlos R.P. Hartmann, Chih-Chieh Chen
Electrical Engineering and Computer Science - Technical Reports
In this report we present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This search is guided by an evaluation function f defined to take advantage of the information provided by the received vector and the inherent properties of the transmitted code. This function f is used to drastically reduce the search …
Parallel Divide And Conquer, Per Brinch Hansen
Parallel Divide And Conquer, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements. The performance of these algorithms is analyzed and measured on a Computing Surface configured as a tree machine with distributed memory.
Do Hypercubes Sort Faster Than Tree Machines?, Per Brinch Hansen
Do Hypercubes Sort Faster Than Tree Machines?, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.
The Fast Fourier Transform, Per Brinch Hansen
The Fast Fourier Transform, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
This tutorial discusses the fast Fourier transform, which has numerous applications in signal and image processing. The FFT computes the frequency components of a signal that has been sampled at n points in O( n log n) time. We explain the FFT and illustrate it by examples and Pascal algorithms. We assume that you are familiar with elementary calculus.
Practical Prefetching Techniques For Parallel File Systems, David Kotz, Carla Schlatter Ellis
Practical Prefetching Techniques For Parallel File Systems, David Kotz, Carla Schlatter Ellis
Dartmouth Scholarship
Parallel disk subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies, and show that prefetching can be implemented efficiently even for the more complex parallel file access patterns. We test these policies across a range of architectural parameters.
Caching And Writeback Policies In Parallel File Systems, David Kotz, Carla Schlatter Ellis
Caching And Writeback Policies In Parallel File Systems, David Kotz, Carla Schlatter Ellis
Dartmouth Scholarship
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. Such parallel disk systems require parallel file system software to avoid performance-limiting bottlenecks. We discuss cache management techniques that can be used in a parallel file system implementation. We examine several writeback policies, and give results of experiments that test their performance.
Knowledge-Based Systems Approach For Offshore Safety Training, B. S. Lee, Venky Shankararaman
Knowledge-Based Systems Approach For Offshore Safety Training, B. S. Lee, Venky Shankararaman
Research Collection School Of Computing and Information Systems
A number of training methods has been used within the offshore industry to impart safety knowledge and safe operating skills. In this paper a Knowledge-Based Safety Training architecture is proposed. The architecture uses both expert system and hypertext methods and is also applicable to plants other than offshore platforms. Special attention is given to the types of knowledge dealt with in safety training and how to represent this knowledge and teach it using various teaching strategies.
Specifying Interdatabase Dependencies In A Multidatabase Environment, Marek Rusinkiewicz, Amit P. Sheth, George Karabatis
Specifying Interdatabase Dependencies In A Multidatabase Environment, Marek Rusinkiewicz, Amit P. Sheth, George Karabatis
Kno.e.sis Publications
The problem of interdatabase dependencies and the effect they have on applications updating interdependent data are addressed. A model that allows specifications of constraints among multiple databases in a declarative fashion is proposed. The separation of the constraints from the application programs facilitates the maintenance of data constraints and allows flexibility in their implementation. It allows investigation of various mechanisms for enforcing the constraints, independently of the application programs. By grouping the constraints together, it is possible to check their completeness and discover possible contradictions among them. The concepts of polytransactions, which use interdatabase dependencies to generate a series of …
Optimal Parallel Algorithms For Periods, Palindromes And Squares (Preliminary Version), Alberto Apostolico, Dany Breslauer, Zvi Galil
Optimal Parallel Algorithms For Periods, Palindromes And Squares (Preliminary Version), Alberto Apostolico, Dany Breslauer, Zvi Galil
Department of Computer Science Technical Reports
No abstract provided.
A Distributed Object-Oriented Discrete Event-Driven Simulation Environment-Dodese, Min Chen
A Distributed Object-Oriented Discrete Event-Driven Simulation Environment-Dodese, Min Chen
FIU Electronic Theses and Dissertations
A new distributed object-oriented discrete event-driven simulation environment, DODESE, is developed to provide a common framework for simulation model design and implementation. The DODESE can be used to define a simulation including all the simulation objects participating in the simulation while the execution of the simulation can be interactively monitored on DODESE. The DODESE system has combined the strengths of both object-oriented paradigms and data base technology to make computer simulation more powerful and has achieved the goals of object-orientation, distribution, reusability, maintainability and extensibility. The system runs on two Sun workstations concurrently connected by an Ethernet. One of the …
Gcache: A Generalized Caching Mechanism, Douglas E. Comer, Shawn Ostermann
Gcache: A Generalized Caching Mechanism, Douglas E. Comer, Shawn Ostermann
Department of Computer Science Technical Reports
No abstract provided.
Representation Requirements For Supporting Knowledge-Based Construction Of Decision-Models In Medicine, Tze-Yun Leong
Representation Requirements For Supporting Knowledge-Based Construction Of Decision-Models In Medicine, Tze-Yun Leong
Research Collection School Of Computing and Information Systems
This paper analyzes the medical knowledge required for formulating decision models in the domain of pulmonary infectious diseases (PIDs) with acquired immunodeficiency syndrome (AIDS). Aiming to support dynamic decision-modeling, the knowledge characterization focuses on the ontology of the clinical decision problem. Relevant inference patterns and knowledge types are identified.
Effects Of Replication On The Duration Of Failure In Distributed Databases, Donald B. Johnson, Larry Raab
Effects Of Replication On The Duration Of Failure In Distributed Databases, Donald B. Johnson, Larry Raab
Computer Science Technical Reports
Replicating data objects has been suggested as a means of increasing the performance of a distributed database system in a network subject to link and site failures. Since a network may partition as a consequence of such failures, a data object may become unavailable from a given site for some period of time. In this paper we study duration failure, which we define as the length of time, once the object becomes unavailable from a particular site, that the object remains unavailable. We show that, for networks composed of highly-reliable components, replication does not substantially reduce the duration of failure. …
Availability Issues In Data Replication In Distributed Database, Donald B. Johnson, Larry Raab
Availability Issues In Data Replication In Distributed Database, Donald B. Johnson, Larry Raab
Computer Science Technical Reports
Replication of data at more than one site in a distributed database has been reported to increase the availability in data in systems where sites and links are subject to failure. We have shown in results summarized in this paper that in many interesting cases the advantage is slight. A well-placed single copy is available to transactions almost as much of the time as is correct replicated data no matter how ingeniously it is managed. We explain these findings in terms of the behavior of the partitions that form in networks where components fail. We also show that known and …
An Organization Of Sparse Gauss Elimination For Solving Pdes On Distributed Memory Machines, Mo Mu, John R. Rice
An Organization Of Sparse Gauss Elimination For Solving Pdes On Distributed Memory Machines, Mo Mu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
How To Count Quickly And Accurately: A Unified Analysis Of Probabilistic Counting And Other Related Problems, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
How To Count Quickly And Accurately: A Unified Analysis Of Probabilistic Counting And Other Related Problems, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Declarative View Of Inheritance In Logic Programming, M. Bugliesi
A Declarative View Of Inheritance In Logic Programming, M. Bugliesi
Department of Computer Science Technical Reports
No abstract provided.
Unstructured Scheduling In Parallel Pde Sparse Solvers On Distributed Memory Machines, Mo Mu, John R. Rice
Unstructured Scheduling In Parallel Pde Sparse Solvers On Distributed Memory Machines, Mo Mu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Constructively Typed Timed Automata, J. F. Peters Iii
Constructively Typed Timed Automata, J. F. Peters Iii
Electrical Engineering and Computer Science - Technical Reports
A new class of communicating automata called typed Timed lnput/Output Automata (tTAi/os) is introduced. A tTAi/o is a predicate automaton used for specifying and reasoning about real-time systems. The typing discipline suggested for predicate automata is in the tradition of Martin-Löf's constructive type theory. A type A is a proposition, which is defined when a prescription for constructing a proof of A is given. A fragment of Girard's linear logic is used in classifying state types. An illustration of the use of tTAi/os in specifying a light-controller is presented. An abstract program is extracted during a proof of an automaton …
A Reconstruction Of Context-Dependent Document Processing In Sgml, Allen Brown Jr., T. Wakayama, Howard A. Blair
A Reconstruction Of Context-Dependent Document Processing In Sgml, Allen Brown Jr., T. Wakayama, Howard A. Blair
Electrical Engineering and Computer Science - Technical Reports
SGML achieves a certain degree of context-dependent document processing through attributes and linking. These mechanisms are deficient in several respects. To address these deficiencies we propose augmenting SGML's LINK and ATTLISTconstructs with two new mechanisms, coordination and (rule-based) attribution. The latter can be used to specify the result of context-dependent processing in a uniform fashion while considerably increasing SGML's expressive power. We illustrate this enhanced power by sketching a specification of (the result of) document layout that can be encoded in SGML augmented with coordination and attribution.
Quadratic Spline Collocation Methods For Elliptic Partial Differential Equations, Christina C. Christara
Quadratic Spline Collocation Methods For Elliptic Partial Differential Equations, Christina C. Christara
Department of Computer Science Technical Reports
No abstract provided.
Complexity Of Network Reliability And Optimal Database Placement Problems, Donald B. Johnson, Larry Raab
Complexity Of Network Reliability And Optimal Database Placement Problems, Donald B. Johnson, Larry Raab
Computer Science Technical Reports
A fundamental problem of distributed database design in an existing network where components can fail is finding an optimal location at which to place the database in a centralized system or copies of each data item in a decentralized or replicated system. In this paper it is proved for the first time exactly how hard this placement problem is under the measure of data availability. Specifically, we show that the optimal placement problem for availability is #P- complete, a measure of intractability at least as severe as NP-completeness. Given the anticipated computational difficulty of finding an exact solution, we go …