Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Purdue University (78)
- Syracuse University (40)
- Washington University in St. Louis (34)
- Dartmouth College (33)
- Singapore Management University (22)
-
- Missouri University of Science and Technology (11)
- Loyola University Chicago (5)
- Old Dominion University (5)
- Portland State University (5)
- University of Richmond (5)
- Brigham Young University (4)
- University of Nebraska - Lincoln (4)
- California Polytechnic State University, San Luis Obispo (3)
- Florida International University (3)
- Illinois Wesleyan University (3)
- Maurer School of Law: Indiana University (3)
- University of Massachusetts Amherst (3)
- University of Nebraska at Omaha (3)
- University of New Hampshire (2)
- Western Kentucky University (2)
- Whittier College (2)
- Wright State University (2)
- Butler University (1)
- California State University, Monterey Bay (1)
- Chapman University (1)
- Clemson University (1)
- College of Saint Benedict and Saint John's University (1)
- Marquette University (1)
- Molloy University (1)
- University of Montana (1)
- Keyword
-
- Computer science (6)
- Parallel computing (6)
- Algorithms (5)
- Distributed computing (4)
- HPF (4)
-
- Information dissemination (4)
- Information systems (4)
- Neural networks (4)
- Online systems (4)
- Document storage (3)
- E-Lert (3)
- Electronic Databases (3)
- File system (3)
- Genetic algorithms (3)
- Indiana University Electronic Resources Newsletter (3)
- Information retrieval (3)
- Legal Research (3)
- Parallel-io (3)
- Software development (3)
- Yolanda Jones (3)
- Algorithm (2)
- Data Visualization (2)
- Fortran 90D/HPF (2)
- HPCC (2)
- High Performance Computing (2)
- High Performance Computing and Communication (2)
- Incremental graph partitioning problems (2)
- Indiana University Law Library (2)
- Indiana University School of Law (2)
- Information (2)
- Publication
-
- Department of Computer Science Technical Reports (78)
- All Computer Science and Engineering Research (34)
- Computer Science Technical Reports (24)
- Research Collection School Of Computing and Information Systems (21)
- Northeast Parallel Architecture Center (18)
-
- Dartmouth Scholarship (10)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (9)
- Electrical Engineering and Computer Science - Technical Reports (9)
- Computer Science Faculty Publications (6)
- Computer Science Faculty Publications and Presentations (5)
- Computer Science: Faculty Publications and Other Works (5)
- Department of Math & Statistics Technical Report Series (5)
- Faculty Publications (5)
- CSE Conference and Workshop Papers (4)
- Computer Science Faculty Research & Creative Works (4)
- Electrical Engineering and Computer Science - All Scholarship (4)
- Computer Science Department Faculty Publication Series (3)
- E-lert (3)
- FIU Electronic Theses and Dissertations (3)
- Honors Projects (3)
- Information Systems and Quantitative Analysis Faculty Publications (3)
- Center for Coastal and Ocean Mapping (2)
- Computer Science and Software Engineering (2)
- Kno.e.sis Publications (2)
- Mathematics (2)
- Mathematics and Statistics Faculty Research & Creative Works (2)
- Mechanical and Aerospace Engineering Faculty Research & Creative Works (2)
- Opportunities for Undergraduate Research Experience Program (OURE) (2)
- Collaborative Agent Design (CAD) Research Center (1)
- Faculty Works: MCS (1984-2023) (1)
Articles 1 - 30 of 281
Full-Text Articles in Physical Sciences and Mathematics
Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond
Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond
Mathematics and Statistics Faculty Research & Creative Works
Textbooks and courses on numerical algorithms contain numerous examples which lead students to believe that the algorithm of choice for computing the zeros of a function f1994 is Newton's algorithm. In many of these courses little or no time is spent in providing students with "real world" experiences where Newton's method fails. The work presented in this paper describes a slow convergence problem encountered while trying to use Newton to estimate values for the 2 distributions. The problem occurred while the authors were trying to implement a well-known machine learning algorithm from the field of artificial intelligence. The function being …
Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz N. Ballou, Arlan R. Dekock, David D. Ardayfio
Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz N. Ballou, Arlan R. Dekock, David D. Ardayfio
Computer Science Technical Reports
The control and programming methodology of industrial robots is becoming increasingly important. The speed and accuracy of data generation, and the performance of the robot are considered the most important factors in robotics control. This paper presents and discusses algorithms that solve for the inverse solution for a given point in space at a very high speed based on the top down abstract method. The algorithms are independent of any specific type of manipulator configuration or programming language. The algorithms were implemented for the IBM-PC™ using the FORTRAN language to control the Armdroid™ robot. The program generates 500 sets of …
Transportable Agents, Keith D. Kotay, David Kotz
Transportable Agents, Keith D. Kotay, David Kotz
Dartmouth Scholarship
As network information resources grow in size, it is often most efficient to process queries and updates at the site where the data is located. This processing can be accomplished by using a traditional client-server network interface, which constrains the client to the set of queries supported by the server, or requires the server to send all data to the client for processing. The former is inflexible; the latter is inefficient. Transportable agents, which support the movement of the client computation to the location of the remote resource, have the potential to be more flexible and more efficient. Transportable agents …
Interactive Shape Control And Rapid Display Of A-Patches, Chandrajit L. Bajaj, Jindon Chen, Guoliang Xu
Interactive Shape Control And Rapid Display Of A-Patches, Chandrajit L. Bajaj, Jindon Chen, Guoliang Xu
Department of Computer Science Technical Reports
No abstract provided.
Ariadne User Manual Version 2.0, Edward Mascarenhas, Vernon J. Rego, Vaidy Sunderam
Ariadne User Manual Version 2.0, Edward Mascarenhas, Vernon J. Rego, Vaidy Sunderam
Department of Computer Science Technical Reports
No abstract provided.
Display User Manual Version 1.1, Edward Mascarenhas, Vernon J. Rego
Display User Manual Version 1.1, Edward Mascarenhas, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
Topologies Invariant Under A Group Action, Paul Bankston
Topologies Invariant Under A Group Action, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
We study links between faithful group actions on a set and topologies on that set. In one direction, a group action has its invariant topologies (so we may regard members of the action to be homeomorphisms relative to those topologies); in the other direction, a topology has its preserving group actions (i.e., the subgroups of the homeomorphism group of the topology). This two-way passage allows us to discuss topological features of group actions as well as symmetry features of topologies.
Knowledge-Based Safety Training System (Kbsts): A Prototype Implementation, Venky Shankararaman, B. S. Lee
Knowledge-Based Safety Training System (Kbsts): A Prototype Implementation, Venky Shankararaman, B. S. Lee
Research Collection School Of Computing and Information Systems
A computer-based safety training system for process operators must be able to make effective presentation of textual material, test the trainee's understanding through quizzes and facilitate plant simulation. The general framework of such a system is presented in an earlier paper (Computers in Industry, Vol. 17, 1991, pp. 349–358). In this paper, we discuss the development and implementation of a prototype Knowledge-Based Safety Training System based on the framework. The design philosophy, system architecture and the plant modelling methodology are described.
Toward Scalable Parallel Software: An Active Object Model And Library To Support Von Neumann Languages, George K. Thiruvathukal
Toward Scalable Parallel Software: An Active Object Model And Library To Support Von Neumann Languages, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
Scalable parallel processing has been proposed as the technology scientists and engineers can use today to solve the problems of tomorrow. Many computational Grand Challenge problems require between two and three orders of magnitude than can be provided with the scalable parallel hardware of the early nineteen-nineties. While hardware continues to become more scalable and cheaper, software is not advancing at the same pace and remains a very expensive part of systems development.
A great deal of emphasis on software technology to support scalable parallel processing is placed on von Neumann languages. One of two approaches is common: (a) augment …
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …
Semantics Vs. Syntax Vs. Computations Machine Models For Type-2 Polynomial-Time Bounded Functionals (Preliminary Draft), James S. Royer
Semantics Vs. Syntax Vs. Computations Machine Models For Type-2 Polynomial-Time Bounded Functionals (Preliminary Draft), James S. Royer
Electrical Engineering and Computer Science - Technical Reports
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals, a.k.a. the Mehlhorn-Cook class of type-2 polynomial-time functionals. We develop a direct, polynomial-time analog of effective operation, where the time bound on computations is modeled after Kapron and Cook's scheme for their basic polynomial-time functionals. We show that (i) if P = NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions, and (ii) there is an oracle relative to which these polynomial-time effective operations and the basic feasible functionals have the …
A Case Tool Supporting The Moses Development Methodology, Florida International University Glupe
A Case Tool Supporting The Moses Development Methodology, Florida International University Glupe
FIU Electronic Theses and Dissertations
A new breed of CASE tools is taking advantage of object-oriented development. The CASE tool in this thesis will serve as a top-level guidance platform. The user will be able to follow an agenda in which his progress is recorded for each step of the development process. At the same time, the user will still be able to develop documents, diagrams and source code by using provided editors. The specific object-oriented methodology followed in this thesis is MOSES (Methodology for Object-Oriented Software Engineering of Systems). This advocates an iterative approach to development while providing both textual and graphical deliverables to …
Multiprocessor Document Allocation: A Neural Network Approach, Abdulaziz Sultan Al-Sehibani, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Multiprocessor Document Allocation: A Neural Network Approach, Abdulaziz Sultan Al-Sehibani, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
We consider the problem of distributing the documents to a given set of processors so that the load on each processor is as equal as possible and the amount of communication is as small as possible. This is an NP-Complete problem. We apply continuous as well as discrete Hopfield neural networks to obtain suboptimal solutions for the problem. These networks perform better than a genetic algorithm for this task proposed by Frieder et al. [4]; in particular, the continuous Hopfield network performs extremely well.
1.1, Yolanda Jones
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Computer Science Technical Reports
Many scientific applications that run on today's multiprocessors are bottlenecked by their file I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and improved file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, disk-directed I/O, that flips the usual relationship between server and client to allow the disks (actually, disk servers) to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains are …
A Data-Parallel Programming Library For Education (Dapple), David Kotz
A Data-Parallel Programming Library For Education (Dapple), David Kotz
Computer Science Technical Reports
In the context of our overall goal to bring the concepts of parallel computing into the undergraduate curriculum, we set out to find a parallel-programming language for student use. To make it accessible to students at all levels, and to be independent of any particular hardware platform, we chose to design our own language, based on a data-parallel model and on C++. The result, DAPPLE, is a C++ class library designed to provide the illusion of a data-parallel programming language on conventional hardware and with conventional compilers. DAPPLE defines Vectors and Matrices as basic classes, with all the usual C++ …
Icdm: Integrated Cooperative Decision Making - In Practice, Leonard Myers, Jens G. Pohl
Icdm: Integrated Cooperative Decision Making - In Practice, Leonard Myers, Jens G. Pohl
Collaborative Agent Design (CAD) Research Center
Multi-agent systems provide an attractive architecture for the implementation of complex systems. Much of the research is focussed on complete automation of the decision making process as a means of duplicating human abilities for working with new problems and environments. There as also a need for systems that employ the human as an agent and rely on human abilities for common sense and deep thought. The CAD Research Center at Cal Poly and CDM Technologies have significant experience in building systems of the latter type that assist human users in solving complex problems in planning, design and economics. This experience …
Multimedia Authoring, Development Environments, And Digital Video Editing, Fillia Makedon, James W. Matthews, Charles B. Owen, Samuel A. Rebelsky
Multimedia Authoring, Development Environments, And Digital Video Editing, Fillia Makedon, James W. Matthews, Charles B. Owen, Samuel A. Rebelsky
Dartmouth Scholarship
Multimedia systems integrate text, audio, video, graphics, and other media and allow them to be utilized in a combined and interactive manner. Using this exciting and rapidly developing technology, multimedia applications can provide extensive benefits in a variety of arenas, including research, education, medicine, and commerce. While there are many commercial multimedia development packages, the easy and fast creation of a useful, full-featured multimedia document is not yet a straightforward task.
This paper addresses issues in the development of multimedia documents, ranging from user-interface tools that manipulate multimedia documents to multimedia communication technologies such as compression, digital video editing and …
Devious: A Distributed Environment For Vision Tasks, Phillip R. Romig Iii, Ashok K. Samal
Devious: A Distributed Environment For Vision Tasks, Phillip R. Romig Iii, Ashok K. Samal
CSE Conference and Workshop Papers
We present a system for the integration of computer vision tasks in a distributed environment. This system, called DeViouS, is based on the client/server model and runs in a heterogeneous environment of Unix workstations. It takes advantage of the free cycles in modern workstation environments to distribute and speed up the execution of vision tasks.
Two primary goals of DeViouS are to provide a practical distributed system and a research environment for vision computing. DeViouS is based on a modular design that allows experimentation in various aspects of algorithm design, scheduling and network programming. It can make use of any …
Characterization Of A Class Of Sigmoid Functions With Applications To Neural Networks, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Characterization Of A Class Of Sigmoid Functions With Applications To Neural Networks, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
Sigmoid functions, whose graphs are "S-shaped" curves, appear in a great variety of contexts, such as the transfer functions in many neural networks. Their ubiquity is no accident; these curves are the among the simplest non-linear curves, striking a graceful balance between linear and non-linear behavior.
Covering Radius 1985-1994, G. D. Cohen, S. N. Litsyn, Antoine C. Lobstein, H. F. Mattson Jr
Covering Radius 1985-1994, G. D. Cohen, S. N. Litsyn, Antoine C. Lobstein, H. F. Mattson Jr
Electrical Engineering and Computer Science - Technical Reports
We survey important developments in the theory of covering radius during the period 1985-1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear cases, density and asymptotic results, normality, specific classes of codes, covering radius and dual distance, tables, and open problems.
Building Multimedia Proceedings: The Roles Of Video In Interactive Electronic Conference Proceedings, Samuel A. Rebelsky, Fillia Makedon, James Matthews, Charles Owen, Laura Bright, Kenneth Harker, Nancy Toth
Building Multimedia Proceedings: The Roles Of Video In Interactive Electronic Conference Proceedings, Samuel A. Rebelsky, Fillia Makedon, James Matthews, Charles Owen, Laura Bright, Kenneth Harker, Nancy Toth
Computer Science Technical Reports
Modern computer systems have changed the way that conference proceedings can be presented and archived. No longer are researchers limited by printed text; electronic proceedings allow one to search the proceedings, add and share annotations, and create paths of related concepts through the proceedings. These additional capabilities extend the opportunities and benefit the thought processes of actual conference participants and the new virtual participants who experience the conference through the electronic proceedings.
In this paper, we discuss the construction of electronic conference proceedings, highlighting the role of talks and other presentations (and, particularly, the audio and video of these talks …
Distributed Scheduling In Finite Capacity Networks, Perry Fizzano, Clifford Stein
Distributed Scheduling In Finite Capacity Networks, Perry Fizzano, Clifford Stein
Computer Science Technical Reports
We consider the problem of scheduling unit-sized jobs in a distributed network of processors. Each processor only knows the number of jobs it and its neighbors have. We give an analysis of intuitive algorithm and prove that the algorithm produces schedules that are within a logarithmic factor of the length of the optimal schedule given that the optimal schedule is sufficiently long.
Incremental Equational Programming, Samuel A. Rebelsky
Incremental Equational Programming, Samuel A. Rebelsky
Computer Science Technical Reports
This paper extends Equational Programming (EP)—a declarative, symbolic programming language—to allow programs to manipulate incrementally defined and modified input terms and to avoid repeated work when evaluating these incremental terms. This paper represents two key aspects of this extension: a notation for representing revision and a modification to EP's runtime library to accomodate this notation. Unlike Field's method of incremental term rewriting, which is designed for more general but less efficient term-rewriting systems, this paper's method accomodates EP's restrictions (in particular, EP's decision to disallow overlapping rules) so that it may take advantage of EP's speed.
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Dartmouth Scholarship
Many scientific applications that run on today's multiprocessors are bottlenecked by their file I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and improved file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, \em disk-directed I/O, that flips the usual relationship between server and client to allow the disks (actually, disk servers) to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains …
Problem Solving In Human Beings And Computers (Formerly: Heuristic Problem Solving), Zygmunt Pizlo, Anupam Joshi, Scott M. Graham
Problem Solving In Human Beings And Computers (Formerly: Heuristic Problem Solving), Zygmunt Pizlo, Anupam Joshi, Scott M. Graham
Department of Computer Science Technical Reports
No abstract provided.
Incremental Construction Of Multi-Dimen- Sional Space Partitioning Trees, George Vanecek, Shankara Shastry M.C.
Incremental Construction Of Multi-Dimen- Sional Space Partitioning Trees, George Vanecek, Shankara Shastry M.C.
Department of Computer Science Technical Reports
No abstract provided.
Contour Ranking On Coarse Grained Machines: A Case Study For Low-Level Vision Computations, Farooq Hameed, Ashfaq A. Khokhar, Susanne E. Hambrusch, Jamshed Patel
Contour Ranking On Coarse Grained Machines: A Case Study For Low-Level Vision Computations, Farooq Hameed, Ashfaq A. Khokhar, Susanne E. Hambrusch, Jamshed Patel
Department of Computer Science Technical Reports
No abstract provided.
Study Of Intrusion Of A Software Trace System In The Execution Of Parallel Programs, Kuei Yu Wang
Study Of Intrusion Of A Software Trace System In The Execution Of Parallel Programs, Kuei Yu Wang
Department of Computer Science Technical Reports
No abstract provided.
Locally Resolvable B-Reps, Carlos Gonzalez-Ochoa, George Vanecek
Locally Resolvable B-Reps, Carlos Gonzalez-Ochoa, George Vanecek
Department of Computer Science Technical Reports
No abstract provided.