Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Purdue University (83)
- Missouri University of Science and Technology (46)
- Air Force Institute of Technology (45)
- Washington University in St. Louis (41)
- Syracuse University (26)
-
- Singapore Management University (25)
- New Jersey Institute of Technology (20)
- Dartmouth College (15)
- Wright State University (15)
- Old Dominion University (14)
- Portland State University (10)
- Western Michigan University (9)
- Taylor University (7)
- Loyola University Chicago (5)
- University of Nebraska - Lincoln (5)
- William & Mary (4)
- Brigham Young University (3)
- Clemson University (3)
- Edith Cowan University (3)
- Selected Works (3)
- University of Tennessee, Knoxville (3)
- Butler University (2)
- Illinois Wesleyan University (2)
- Sheridan College (2)
- Southern University and A&M College (2)
- University of Alabama in Huntsville (2)
- University of North Florida (2)
- University of Richmond (2)
- Bryn Mawr College (1)
- Central Washington University (1)
- Keyword
-
- College of Engineering and Computer Science (10)
- Computer Science (10)
- Engineering (10)
- Newsletters (10)
- Science news (10)
-
- Technical writing (10)
- Object-oriented programming (Computer science) (7)
- Software engineering (6)
- Expert systems (Computer science) (5)
- Parallel computing (5)
- Genetic algorithms (4)
- Mapping (4)
- Object-oriented databases (4)
- Air warfare--Simulation methods (3)
- Computer science (3)
- Computer simulation (3)
- File system (3)
- Parallel processing (Electronic computers) (3)
- Parallel programming (Computer science) (3)
- Reasoning (3)
- Algorithm (2)
- Algorithm Design (2)
- Algorithms (2)
- Computer software--Development (2)
- Computer war games (2)
- Data distribution (2)
- Discrete-time systems (2)
- Distributed processing (2)
- Electroencephalography (2)
- Embeddings (2)
- Publication
-
- Department of Computer Science Technical Reports (83)
- Computer Science Technical Reports (46)
- Theses and Dissertations (45)
- All Computer Science and Engineering Research (41)
- Research Collection School Of Computing and Information Systems (25)
-
- Theses (13)
- BITs and PCs Newsletter (10)
- Northeast Parallel Architecture Center (10)
- Masters Theses (9)
- Computer Science Faculty Research & Creative Works (8)
- ACMS Conference Proceedings 1993 (7)
- Dissertations (7)
- Electrical Engineering and Computer Science - Technical Reports (7)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (6)
- Computer Science Theses & Dissertations (5)
- Computer Science: Faculty Publications and Other Works (5)
- Dissertations and Theses (5)
- Kno.e.sis Publications (5)
- Computer Science Faculty Publications and Presentations (4)
- Dissertations, Theses, and Masters Projects (4)
- Faculty Publications (4)
- Computer Science Faculty Publications (3)
- Dartmouth Scholarship (3)
- Electrical Engineering and Computer Science - All Scholarship (3)
- School of Computing: Faculty Publications (3)
- The Harlan D. Mills Collection (3)
- Department of Math & Statistics Technical Report Series (2)
- Electrical & Computer Engineering Theses & Dissertations (2)
- Electronic Dissertations and Theses (2)
- Honors Capstone Projects and Theses (2)
- Publication Type
Articles 1 - 30 of 415
Full-Text Articles in Physical Sciences and Mathematics
A Simulated Annealing/Tabu Search Algorithm For The Vehicle Routing Problem, Jeffrey Dale White, Billy E. Gillett
A Simulated Annealing/Tabu Search Algorithm For The Vehicle Routing Problem, Jeffrey Dale White, Billy E. Gillett
Computer Science Technical Reports
The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was introduced in 1958 by G. B. Dantzig and J. H. Ramser. This thesis creates three algorithms that endeavor to find an optimal solution for each problem tested. Two of the algorithms (Simulated Annealing and Tabu Search) have been used previously to solve this problem. These two solution methods are revisited to discover whether a new approach to creating routes will produce the best-known optimal values every time. New routes are created by forming route neighborhoods and then selecting cities from these neighborhoods for insertion. …
Process Driven Software Engineering Environments, John Hayes Lampkin, T. Lo, Daniel C. St. Clair
Process Driven Software Engineering Environments, John Hayes Lampkin, T. Lo, Daniel C. St. Clair
Computer Science Technical Reports
Software development organizations have begun using Software Engineering Environments (SEEs) with the goal of enhancing the productivity of software developers and improving the quality of software products. The encompassing nature of a SEE means that it is typically very tightly coupled with the way an organization does business. To be most effective, the components of a SEE must be well integrated and the SEE itself must be integrated with the organization.
The challenge of tool integration increases considerably when the components of the environment come from different vendors and support varying degrees of “openness”. The challenge of integration with the …
Subsumption In Modal Logic, Dirk Heydtmann, Ralph W. Wilkerson
Subsumption In Modal Logic, Dirk Heydtmann, Ralph W. Wilkerson
Computer Science Technical Reports
Subsumption has long been known as a technique to detect redundant clauses in the search space of automated deduction systems for classical first order logic. In recent years several automated deduction methods for non-classical modal logics have been developed. This thesis explores, how subsumption can be made to work in the context of these modal logic deduction methods.
Many modern modal logic deduction methods follow an indirect approach. They translate the modal sentences into some other target language, and then determine whether there exists a proof in that language, rather than doing deduction in the modal language itself. Consequently, subsumption …
The Difficulty Of Approximating The Chromatic Number For Random Composite Graphs, Jeffrey Wayne Jenness, Billy E. Gillett
The Difficulty Of Approximating The Chromatic Number For Random Composite Graphs, Jeffrey Wayne Jenness, Billy E. Gillett
Computer Science Technical Reports
Combinatorial Optimization is an important class of techniques for solving Combinatorial Problems. Many practical problems are Combinatorial Problems, such as the Traveling Salesman Problem (TSP) and Composite Graph Coloring Problem (CGCP). Unfortunately, both of these problems are NP-complete and it is not known if efficient algorithms exist to solve these problems. Even approximation with guaranteed results can be just as difficult. Recently, many generalized search techniques have been developed to improve upon the solutions found by the heuristic algorithms.
This paper presents results for CGCP. In particular, exact and heuristic algorithms are presented and analyzed. This study is made, to …
A Syntax-Directed Editor For Borland’S Turbo Pascal, John Gatewood Ham, Thomas J. Sager
A Syntax-Directed Editor For Borland’S Turbo Pascal, John Gatewood Ham, Thomas J. Sager
Computer Science Technical Reports
This study details the design and implementation of the LSD program, a syntax-directed editor for use in editing the source code for Borland’s Turbo Pascal. LSD is a dual-mode editor which allows both traditional text editing and also grammar-based editing. LSD promotes better programming for novice users by allowing the user to edit the program with a graphical representation of a parse tree. A list of syntactically correct choices is displayed at each point where a choice must be made in the structure of the program. Since only these choices are available, no syntax errors are possible. For more advanced …
Fault-Tolerant Ring Embeddings In Hypercubes -- A Reconfigurable Approach, Jun-Lin Liu, Bruce M. Mcmillin
Fault-Tolerant Ring Embeddings In Hypercubes -- A Reconfigurable Approach, Jun-Lin Liu, Bruce M. Mcmillin
Computer Science Technical Reports
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (without redundant processors and links). The fundamental idea for these schemes is to embed a basic network on the hypercube without fully utilizing the nodes on the hypercube. The remaining nodes can be used as spares to reconfigure the embeddings in case of faults. The result of this research shows that by carefully embedding the application graphs, the topological properties of the embedding can be preserved under fault conditions, and reconfiguration can be carried out efficiently.
In this dissertation, we choose the ring as the basic network …
Effect Of Joystick Versus Control Yoke Use On Personal Computer (Pc) Flight Training: A Comparative Analysis, Gregory Alan Fontaine
Effect Of Joystick Versus Control Yoke Use On Personal Computer (Pc) Flight Training: A Comparative Analysis, Gregory Alan Fontaine
Master's Theses - Daytona Beach
The purpose of this study was to provide a comparative performance analysis of a generic control yoke device and a generic joystick device. The comparison provided data needed for further evaluation of personal computer (PC) aircrew training device (ATD) potential. Both devices were used in support of the same PC flight simulation software program, and were evaluated using the experimental research method. Objective and subjective data were obtained during controlled testing, and subsequently analyzed using basic summation and t-test methods. The results tested the research hypothesis that there is no significant difference in personal computer ATD operator performance using a …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 10, December 1993, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 10, December 1993, 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.
Parallel H-V Drawings Of Binary Trees, Panagiotis T. Metaxas, Grammati E. Pantziou, Antonis Symvonis
Parallel H-V Drawings Of Binary Trees, Panagiotis T. Metaxas, Grammati E. Pantziou, Antonis Symvonis
Computer Science Technical Reports
In this paper we present a method to obtain optimal h-v and inclusion drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in $O(\log^2 n)$ parallel time by using a polynomial number of EREW processors. The number of processors reduces substantially when we study minimum area drawings. The method can be extended to compute optimal inclusion layouts in the case where each leaf $l$ of the tree is represented by rectangle $l_x \times l_y$ (the dimensions of which are part of the input). For …
Probing Tcp Implementations, Douglas E. Comer, John C. Lin
Probing Tcp Implementations, Douglas E. Comer, John C. Lin
Department of Computer Science Technical Reports
No abstract provided.
An Optimal O(Log Log N) Time Parallel Algorithm For Detecting All Squares In A String, Albert Apostolico, Dany Breslauer
An Optimal O(Log Log N) Time Parallel Algorithm For Detecting All Squares In A String, Albert Apostolico, Dany Breslauer
Department of Computer Science Technical Reports
No abstract provided.
A Generalized Schwarz Splitting Method Based On Hermite Collocation For Elliptic Boundary Value Problems, Yu-Ling Lai, Apostolos Hadjidimos, Elias N. Houstis
A Generalized Schwarz Splitting Method Based On Hermite Collocation For Elliptic Boundary Value Problems, Yu-Ling Lai, Apostolos Hadjidimos, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Parallel Dynamic Mesh Generation And Domain Decomposition, Poting Wu, Elias N. Houstis
Parallel Dynamic Mesh Generation And Domain Decomposition, Poting Wu, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Combinatorial Optimization Problems For Which Almost Every Algorithm Is Asymptotically Optimal, Wojciech Szpankowski
Combinatorial Optimization Problems For Which Almost Every Algorithm Is Asymptotically Optimal, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Probabilistic Analysis Of A String Editing Problem And Its Variations, Guy Louchard, Wojciech Szpankowski
A Probabilistic Analysis Of A String Editing Problem And Its Variations, Guy Louchard, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Scheduling Policy With Maximal Stability Region For Rings Networks With Spatial Reuse, Leonidas Georgiadis, Wojciech Szpankowski, Leondros Tassiulas
A Scheduling Policy With Maximal Stability Region For Rings Networks With Spatial Reuse, Leonidas Georgiadis, Wojciech Szpankowski, Leondros Tassiulas
Department of Computer Science Technical Reports
No abstract provided.
Extending Multidatabase Transaction Management Techniques To Software Development Environments, Aidong Zhang, Omran Bukhres
Extending Multidatabase Transaction Management Techniques To Software Development Environments, Aidong Zhang, Omran Bukhres
Department of Computer Science Technical Reports
No abstract provided.
C3: A Parallel Model For Coarse-Grained Machines, Susanne E. Hambrusch, Ashfaq A. Khokhar
C3: A Parallel Model For Coarse-Grained Machines, Susanne E. Hambrusch, Ashfaq A. Khokhar
Department of Computer Science Technical Reports
No abstract provided.
A View-Based Approach To Relaxing Global Serializability In Multidatabase Systems, Aidong Zhang, Evaggelia Pitoura, Bharat K. Bhargava
A View-Based Approach To Relaxing Global Serializability In Multidatabase Systems, Aidong Zhang, Evaggelia Pitoura, Bharat K. Bhargava
Department of Computer Science Technical Reports
No abstract provided.
Constructing Distributed Schedulers Using The Messiahs Interface Language, Steve J. Chapin, Eugene H. Spafford
Constructing Distributed Schedulers Using The Messiahs Interface Language, Steve J. Chapin, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Data Structures And Algorithms For The String Statistics Problem, Alberto Apostolico, Franco P. Preparata
Data Structures And Algorithms For The String Statistics Problem, Alberto Apostolico, Franco P. Preparata
Department of Computer Science Technical Reports
No abstract provided.
The Use Of Neural Networks To Support "Intelligent" Scientific Computing, Anupam Joshi, Csanjiva Weerawarana, Elias N. Houstis
The Use Of Neural Networks To Support "Intelligent" Scientific Computing, Anupam Joshi, Csanjiva Weerawarana, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Asymptotic Behavior Of The Lempel-Ziv Parsing Scheme And Digital Search Trees, Philippe Jaquet, Wojciech Szpankowski
Asymptotic Behavior Of The Lempel-Ziv Parsing Scheme And Digital Search Trees, Philippe Jaquet, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Scheduling Support Mechanisms For Autonomous, Heterogeneous, Distributed Systems (Ph.D. Thesis), Steve J. Chapin
Scheduling Support Mechanisms For Autonomous, Heterogeneous, Distributed Systems (Ph.D. Thesis), Steve J. Chapin
Department of Computer Science Technical Reports
No abstract provided.
Parallel Numerical Methods For Partial Differential Equations (Ph.D. Thesis), Sang-Bae Kim
Parallel Numerical Methods For Partial Differential Equations (Ph.D. Thesis), Sang-Bae Kim
Department of Computer Science Technical Reports
No abstract provided.
Correctness Proof Of A Geometric Constraint Solver, Ioannis Fudos, Christoph M. Hoffmann
Correctness Proof Of A Geometric Constraint Solver, Ioannis Fudos, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Object-Orientation In Multidatabase Systems, Evaggelia Pitoura, Omran Bukhres, Ahmed K. Elmagarmid
Object-Orientation In Multidatabase Systems, Evaggelia Pitoura, Omran Bukhres, Ahmed K. Elmagarmid
Department of Computer Science Technical Reports
No abstract provided.
Collaborative Multimedia Game Environments, Vinod Anupam, Chandrajit L. Bajaj
Collaborative Multimedia Game Environments, Vinod Anupam, Chandrajit L. Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Developing A Graphical User Interface To Support A Real-Time Digital Signal Processing System, Jeffrey C. Miller
Developing A Graphical User Interface To Support A Real-Time Digital Signal Processing System, Jeffrey C. Miller
Theses and Dissertations
A graphical software user interface for a VMEbus-based real-time digital signal processing system was designed. Use, requirements were defined and the Rumbaugh object-oriented analysis and design technique was applied to analyze the requirements and produce an object-oriented design. The software design includes a graphical, mouse- and keyboard driven user interface, specialized hardware driver modules, and operating system interfaces. An implementation plan was also developed to map the design into the C programming language using existing system code, automatically generated code, and newly written code. Based on the implementation plan, a limited software system prototype w successfully developed and demonstrated. The …
Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston
Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston
Theses and Dissertations
Ranking and selection procedures are statistical methods used to compare and choose the best among a group of similar statistically distributed populations. The two predominant approaches to solving ranking and selection problems are Guptas subset selection formulation and Bechhofers indifference- zone formulation. For the indifference-zone formulation where the populations have equal sample sizes, Barr and Rizvi developed an integral expression of the probability of correct selection PCS. Given appropriate parameters, the integral expression can be solved to determine the common sample size required to attain a desired PCS. Tables with selected solutions to the integral expression are available for a …