Digital Commons Network^™

Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee

Dartmouth Scholarship

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …

Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Alphabetic Minimax Trees Of Degree At Most T*, D. Coppersmith, Maria M. Klawe, Nicholas Pippenger

All HMC Faculty Publications and Research

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction.

Prolog., Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Description is Given of Prolog, a Contraction of Programming in Logic, Which Uses the Formalism of Mathematical Logic as its Primary Design Principle. the Structure of Prolog is Examined, and a Database Program is Described to Illustrate its application. an Application to an Artificial Intelligence Problem, the Towers of Hanoi, is Also Given.

Tutorials For Software : A Comparison Of The Appleworks Software Tutorial With Pre-Entered Data And An Experimental Tutorial With User Entered Data, Toni L. Steil

University of the Pacific Theses and Dissertations

The attention directed toward computer software research has been sparse which is quite evident in particular facets such as learning methods, specifically towards tutorials. Some authors have identified various important issues which include cognitive factors, reduction of presentation of superfluous information, and the importance of interaction with software and hardware. The present . study examined two tutorials which were similar except in their level of required user behaviors. Tutorial A required only user manipulation of disk stored data. Tutorial B required the user to enter the data into the computer, design the screen format, and then to manipulate it. It …

Modelling Dynamic Entities In Relational Database Systems, Dominic Carmen Soda

Masters Theses

No abstract provided.

Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes

Department of Computer Science Technical Reports

No abstract provided.

Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.

Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo

Department of Computer Science Technical Reports

No abstract provided.

Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap

Department of Computer Science Technical Reports

No abstract provided.

Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning, Billy E. Gillett

Computer Science Technical Reports

A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

Predicting Success In High School Computer Programming, John C. Gevedon

Graduate Theses and Dissertations

There are great differences in performance among students taking high school programming courses, and instructors debate over what elements contribute to these differences. Some students develop logical thinking abilities and problem solving techniques, while others fail to develop skills beyond memorization of specific terms and procedures. It is not known whether these differences are causally related to the specific educational environment or student backgrounds. Without more information, the factors that actually contribute to the success of high school students in computer programming courses cannot be accurately determined. It was the purpose of this study then to isolate certain student characteristics …

Representing Graph Families With Edge Grammars, Francine Berman, Gregory Shannon

Department of Computer Science Technical Reports

No abstract provided.

Some Thoughts On A Uniform Generic Command Interface, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.

On The Existence Of Analytical Proofs For Vlsi Computational Networks, Rami Melhem

Department of Computer Science Technical Reports

No abstract provided.

Efficient Parallel Solutions To Some Geometric Problems, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Data Interlock In Vlsi Computational Networks For Sparse Matrix Multiplication, Rami G. Melhem

Department of Computer Science Technical Reports

No abstract provided.

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Whicker, Garth. Agriculture and the Development of Malaysia
• McGaha. Rape, Passion, Lechery, Usury, Incest, Murder and other Matters in The Ravenger's Tragedy
• Harrison, Robert. It was a Day of Very General Awakening . . : Reformation and Revival in Russellville, Kentucky
• King, Betty. An Affirmative Decision for James's Isabel Archer
• Sutton, Joyce. Sex Bias in Performance of Women
• Logsdon, Doug. Poe's Women
• Yoder, Nate. Emily Dickinson and Her Puritan Heritage
• Davis, Aleen. Jay …

Information Sciences A Computer-Based Course Unix 1985, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Utilization Of The Digital Vax 11/750 Computer In The Administration Of An Adult Evening Collegiate Program, Barbara Barr Dabbs

Theses

Unavailable.

Parallel Algorithms For Bridge- And Bi-Connectivity On Minimum Area Meshes, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Controlling Variables Using A Microcomputer Program Compared To The Piagetian Bending Rods Task, Rita Arlene Hrecz

Dissertations and Theses @ UNI

This study compared two formats of controlling variables. Subjects' performance of controlling variables in the Piagetian Bending Rods Task was compared to their performance of controlling variables in the microcomputer interactive program called Measuring Gravitational Forces. The correlation result (0.78 on the Spearman rho and the Pearson Product Moment correlations) and results of the nonparametric Wilcoxon t test and the parametric correlated t indicated no statistically significant difference of subjects' performance of controlling variables in either task. No statistically significant gender difference of subjects' performance of either the Bending Rods Task or the Measuring Gravitational Forces computer program was found. …

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning

Doctoral Dissertations

"A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …