Digital Commons Network^™

An Efficient Algorithm For Direct Computation Of Adjacent Block Coefficients In The Transformed Domain, Chaman Sabharwal, Brian Quandt

Computer Science Faculty Research & Creative Works

The current research in many areas of image processing involves operations performed in the compressed domain [Smith and Rowe 1993, Chang 93]. Compressed domain may be DCT, Wavelet, JPEG or MPEG etc. The algorithms for .these transformations may be used for information filtering such as feature extraction and edge detection. The image transformations such as compositing, occluding, and scaling may also be performed in the compressed domain. It is desirable to perform these operations on compressed data directly because the smaller size of data involves less computational complexity. The computation in the compressed domain eliminates the overhead of decoding the …

Direct Finite First-Order Model Generation With Negative Constraint Propagation Heuristic, Olga Shumsky, Ralph W. Wilkerson, Fikret Ercal, William W. Mccune

Computer Science Faculty Research & Creative Works

An Automated Finite First-Order Model Generator Has Been Developed. the Problem is Viewed as a First-Order Satisfiability Problem. Most Existing Model Generators Reduce the Problem to Propositional Satisfiability by Converting the Input First-Order Clauses into Propositional Clauses. This Generator, Unlike Others, Stores the Input First-Order Clauses and Solves the Problem Directly. It Uses an Exhaustive Backtracking Algorithm with Weight-Based Splitting. a Negative Constraint Propagation is Implemented to Reduce the Number of Decision Points and Thus to Speed Up the Search. © 1997 ACM.

User Defined Prewrites For Increasing Concurrency In Design Databases, Sanjay Kumar Madria, A. Embong

Computer Science Faculty Research & Creative Works

We introduce a prewrite operation before a write operation is performed on design databases, a database that consists of objects as engineering designs. A prewrite operation does not actually make a design but it only makes available the model of the design that the transaction will produce in future. Once the prewrite design by a transaction is announced, the transaction executes a pre-commit operation. After the pre-commit, read operations can access the prewrite design even before the pre-committed transaction has finally made the design and committed. Therefore, our algorithm increases the potential concurrency as compared to the algorithms that permit …

A Study Of User Level Scheduling And Software Caching In The Educational Interactive System, Kaoru Tsunoda

Theses Digitization Project

No abstract provided.

Evolutionary Computation Applied To Adaptive Information Filtering, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper, Joost N. Kok

Computer Science Faculty Research & Creative Works

Information Filtering is concerned with filtering data streams in such a way as to leave only pertinent data (information) to be perused. When the data streams are produced in a changing environment the filtering has to adapt too in order to remain effective. Adaptive Information Filtering is concerned with filtering in changing environments. The changes may occur both on the transmission side (the nature of the streams can change), and on the reception side (the interest of a user can change). Weighted trigram analysis is a quick and flexible technique for describing the contents of a document. A novel application …

Scis Networking - January 1997, Nova Southeastern University

CCIS Networking / SCIS Networking magazines

No abstract provided.

A Fast Algorithm For Complete Subcube Recognition, Fikret Erçal, H. J. Burch

Computer Science Faculty Research & Creative Works

The complete subcube recognition problem is defined as, given a collection of available processors on an n-dimensional hypercube, locate a subcube of dimension k that consists entirely of available processors, if one exists. Despite many algorithms proposed so far on this subject, improving the time complexity of this problem remains a challenge. Efficiency limits that can be reached have not been exhausted yet. This paper proposes a novel algorithm to recognize all the overlapping subcubes available on an n-dimensional hypercube whose processors are partially allocated. Given P=2n, as the total number of processors in the hypercube, the new algorithm runs …

Mathematics At Chartres Cathedral, Richard Stout

ACMS Journal 2004

Chartres Cathedral is highly regarded as a magnificent Gothic structure including beautiful stained glass windows and striking sculptures. Mathematics, especially geometry, played a central role in the design of this cathedral. This paper explores that mathematics and how it contributes to the overall effectiveness of the design.

Mathematics And Values: Can Philosophy Guide Projects?, Michael H. Veatch

ACMS Journal 2004

The philosophy of mathematics has provided insight on questions of foundations and mathematical truth; however, it has not been very fruitful in guiding the practice of mathematics. This paper attempts to find points of contact between a Christian worldview and the choice of mathematical projects and methods. Three areas are considered: (i) dubitability in current research, (ii) the intrinsic value of contemporary mathematics to contemporary society, and (iii) the affirmation of human value in the use of mathematics. Finally, a framework for valuing mathematics is proposed as an encouragement to think more deeply about how a Christian might choose a …

A System For Recognizing A Large Class Of Engineering Drawings, Yuhong Yu, Ashok Samal, Sharad C. Seth

School of Computing: Faculty Publications

We present a system for recognizing a large class of engineering drawings characterized by alternating instances of symbols and connection lines. The class includes domains such as flowcharts, logic and electrical circuits, and chemical plant diagrams. The output of the system, a netlist identifying the symbol types and interconnections, may be used for design simulation or as a compact portable representation of the drawing. The automatic recognition task is divided into two stages: 1) Domain-independent rules are used to segment symbols from connection lines in the drawing image that has been thinned, vectorized, and preprocessed in routine ways. 2) A …

A Look At Kabbalah, Scott M. Wellman

Honors Theses, 1963-2015

No abstract provided.

The Effects Of Network Latency On Multimedia Applications, James Beach

Honors Theses, 1963-2015

Network latency slows the response time of networks such as the Internet. This is an ever increasing problem as applications migrate towards interactive multimedia. To make multimedia applications viable across the Internet, the underlying data delivery structures of the Internet need to be changed. new technologies in network connections and data delivery schemes need to be further researched and implemented. Two cooperating technologies which demonstrate potential in delivering Internet multimedia applications are RealAudio systems and ATM (Asynchronous Transfer Mode) networks. Reducing network latency will help in bringing smooth, real-time audio and video to networked computers.

Semantic Analysis Of The Postscript Page Description Language, Ben Knuth

Honors Theses, 1963-2015

The Postscript page description language is a functional programming language. Central to the effective use of the language are the functional properties of delayed evaluation and referential transparency. Postscript performs all of its operations via distinct, multiple stacks which stores function binding lists, function parameters, and function code. By way of these stacks, Postscript creates dynamic computational states which leads identical expressions to evaluate to different results. This hints towards the polymorphic quality of an object-oriented language, even though it contradicts the functional precept of manifest interfaces thereby introducing a nonorthogonality. One other streak of object-orientation that shows up in …

Object-Oriented Development In Creating Software Systems, Brooke Frost

Honors Theses, 1963-2015

Object-oriented development has become quite popular and well-known throughout the computer industry. There are three components that are a part of object-oriented development. One component is object-oriented analysis which involves the creation of an object-oriented model based on the application domain of the software system. The second component is object-oriented design which is when the programmers develop an object-oriented model based on the defined requirements for the software system. The last component is object-oriented programming which is the process of implementing the software system so it becomes a reality. Together these three components provide programmers with a beneficial tool in …

Genetic Algorithms: A Visual Search, Paul W. Jones

Honors Theses, 1963-2015

Genetic algorithms apply the biological principles of selection, mutation, and crossover to a population set containing individuals representing target solutions to a given problem. Using these principles genetic algorithms attempt to create a migration of the individuals in subsequent generations toward the optimal solution.

This project is an attempt to visually represent the progress of a genetic algorithm. The coordinate fitness program attempts to find the maximum or minimum value of a given function. It visually represents the progress of the algorithm by providing a plot of each individual in each generation in time. It is then possible to view …

Simulation Of Living Processes Utilizing Concurrency And Object-Oriented Programming, Aaron Ziegler

Honors Theses, 1963-2015

What does it mean to be alive? Is it possible to create artificial life-forms that are truly alive? Can a computer program be alive? To answer these questions, I first explore the history of artificial life, beginning with John von Neumann, who designed algorithms possessing lifelike capabilities, and moving on to other famous attempts, such as Horton Conway's 'Game of Life', and Thomas Ray's remarkable 'Tierra' project.

Also included is a discussion on the merits of Object-Oriented programming for simulating, and ultimately synthesizing life on a computer. concurrency is defined, and its value for stimulating and synthesizing life is made …

An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh

Electrical Engineering and Computer Science - All Scholarship

In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of the root node, we may be able to prune the candidate set by using simple geometrical constraints. This approach can be applied recursively until the size of the candidate set is one for each …

Microlanguages For Operating System Specialization, Calton Pu, Andrew P. Black, Crispin Cowan, Jonathan Walpole, Charles Consel

Computer Science Faculty Publications and Presentations

Specialization is a technique that has the potential to provide operating system clients with the performance and functionality that they need, while still retaining the advantages of a simple generic code base for the operating system maintainer. However, at present the specialization process is labor-intensive and requires the knowledge of an expert in the domain of application behavior. In order to realize the full advantages of specialization, we believe that the process must be automated. This means building tools for specialization, and also making the domain knowledge explicit in some form or other. A specialization toolkit has been developed jointly …

A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Shared, multi-user, workstation networks are characterized by unpredictable variability in system load. Further, the concept of workstation ownership is typically present. For efficient and unobtrusive computing in such environments, applications must not only overlap their computation with communication but also redistribute their computations adaptively based on changes in workstation availability and load. Managing these issues at application level leads to programs that are difficult to write and debug. In this paper, we present a system that manages this dynamic multi-processor environment while exporting a simple message-based programming model of a dedicated, distributed memory multiprocessor to applications. Programmers are thus insulated …

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

Genetic Algorithms For The Extended Gcd Problem, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

We present several genetic algorithms for solving the extended greatest common divisor problem. After defining the problem and discussing previous work, we will state our results.

Webflow - A Visual Programming Paradigm For Web/Java Based Coarse Grain Distributed Computing, Dimple Bhatia, Vanco Burzevski, Maja Camuseva, Geoffrey C. Fox

Northeast Parallel Architecture Center

We present here the recent work at NPAC aimed at developing WebFlow---a general purpose Web based visual interactive programming environment for coarse grain distributed computing. We follow the 3-tier architecture with the central control and integration WebVM layer in tier-2, interacting with the visual graph editor applets in tier-1 (front-end) and the legacy systems in tier-3. WebVM is given by a mesh of Java Web servers such as Jeeves from JavaSoft or Jigsaw from MIT/W3C. All system control structures are implemented as URL-addressable servlets which enable Web browser-based authoring, monitoring, publication, documentation and software distribution tools for distributed computing. We …

The "Hoover" Project: Home Occupants Vehicular Electronic Reconnaissance, Kelvin Chan

SWITCH

The article explains telepresence, as well as its potential in safety and security, along with its traditional usage of traversing dangerous situations. This article describes a dystopian plan to place drones equipped with cameras and microphones in all homes in the Silicon Valley as a vehicle for telepresence. The data achieved through this method would also be stored into a public domain browser on the internet, free for anyone in the public to view, including larger corporations and the government. The idea behind this is the assimilation of data behind all cultures for understanding and to assist law enforcement in …

Vertex-Edge Pseudo-Visibility Graphs: Characterization And Recognition, Joseph O'Rourke, Ileana Streinu

Computer Science: Faculty Publications

We extend the notion of polygon visibility graphs to pseudo-polygons defined on generalized configurations of points. We consider both vertex-to-vertex, as well as vertex-to-edge visibility in pseudo-polygons. We study the characterization and recognition problems for vertex-edge pseudo-visibility graphs. Given a bipartite graph G satisfying three simple properties, which can all be checked in polynomial time, we show that we can define a generalized configuration of points and a pseudo-polygon on it, so that its vertex-edge pseudo-visibility graph is G. This provides a full characterization of vertex-edge pseudo-visibility graphs and a polynomial-time algorithm for the decision problem. It also implies that …

Webassess, Justin Anthony Brown

Theses : Honours

This project and research has resulted in the development of a World Wide Web (WWW) based testing system. WEBassess can be accessed and used from any point in the world that has a connection to the WWW. The WEBassess system allows for the creation and completion of tests through the WWW interface. Scoring and feedback of submitted tests is completely automated, allowing students to see their test result immediately, including visual indicators for correct and incorrect answers. These test results may then be viewed by academic staff, showing complete test details, such as unit code, test title, score, percentage, date …

Adaptive Multicast Routing In Wormhole Networks, Ran Libeskind-Hadas, Tom Hehre '96, Andrew Hutchings '98, Mark Reyes '98, Kevin Watkins '97

All HMC Faculty Publications and Research

Multicast communication has applications in a number of fundamental operations in parallel computing. An effective multicast routing algorithm must be free from both livelock and deadlock while minimizing communication latency. We describe two classes of multicast wormhole routing algorithms that employ the multi-destination wormhole hardware mechanism proposed by Lin et al. [12] and Panda et al. [17]. Specific examples of these classes of algorithms are described and experimental results suggests that such algorithms enjoy low communication latencies across a range of network loads.

A Concurrency Control Algorithm For An Open And Safe Nested Transaction Model, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a concurrency control algorithm for an open and safe nested transaction model. We use prewrite operations in our model to increase the concurrency. Prewrite operations are modeled as subtransactions in the nested transaction tree. The subtransaction which initiates prewrite subtransactions are modelled as recovery point subtransaction. The recovery point subtransaction can release their locks before its ancestors commit. Thus, our model increases the concurrency in comparison to other nested transaction models. Our model is useful an environment of long-running transactions common in object oriented databases, computer aided design and in the software development process

The Effects Of User Interface Metaphors On The Learnability Of Computer Systems By Field Dependent And Field Independent Computer Users, Robert N. Urwiler Jr.

CCAC Theses and Dissertations

This study was designed to assess the differences in the learning performance (speed and accuracy) with which field dependent and field independent subjects could complete a set of checkbook management tasks using software employing a user interface making strong use of common checkbook management metaphors versus software employing an interface adhering to a defacto industry standard-based graphical user interface design guideline. It was hypothesized that both field dependent and field independent users would complete tasks more quickly and accurately using both user interface types.

From a population of traditional and non-traditional college students, 64 individuals volunteered to participate in the …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 1, January 1997, 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.

Multiprocessor Out-Of-Core Ffts With Distributed Memory And Parallel Disks, Thomas H. Cormen, Jake Wegmann, David M. Nicol

Computer Science Technical Reports

This paper extends an earlier out-of-core Fast Fourier Transform (FFT) method for a uniprocessor with the Parallel Disk Model (PDM) to use multiple processors. Four out-of-core multiprocessor methods are examined. Operationally, these methods differ in the size of "mini-butterfly" computed in memory and how the data are organized on the disks and in the distributed memory of the multiprocessor. The methods also perform differing amounts of I/O and communication. Two of them have the remarkable property that even though they are computing the FFT on a multiprocessor, all interprocessor communication occurs outside the mini-butterfly computations. Performance results on a small …