Digital Commons Network^™

Paper Abstracts, Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Using Maple To Teach Calculus, Ken Rietz

ACMS Conference Proceedings 1993

No abstract provided.

Georg Cantor And The Battle For Transfinite Set Theory, Joseph W. Dauben

ACMS Conference Proceedings 1993

No abstract provided.

Introduction (1993), Russell Howell

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Using Matlab And Mathematica In Numerical Analysis, John H. Matthews

ACMS Conference Proceedings 1993

No abstract provided.

Abraham Robinson (1918-1974): The Man And The Mathematics, Joseph W. Dauben

ACMS Conference Proceedings 1993

No abstract provided.

Infinity And The Absolute: Insights Into Our World, Our Faith, And Ourselves, Tim Pennings

ACMS Conference Proceedings 1993

No abstract provided.

Devotional Reflections, Jonathan Leech

ACMS Conference Proceedings 1993

No abstract provided.

Georg Cantor And The Battle For Transfinite Set Theory, Joseph Dauben

ACMS Conference Proceedings 1993

Georg Cantor is well known as the founder of transfinite set theory. Equally celebrated, however, are the obstacles he faced in trying to win acceptance for his seemingly unorthodox views, his acrimonious differences with Leopold Kronecker and his unfortunate but progressively debilitating nervous breakdowns that some authors have linked directly to his many problems with set theory. Above all, Cantor's justification of set theory was all the more urgent because of Kronecker's critical denunciation of Cantor's mathematics. In tracing the evolution of Cantorian set theory, it is necessary to examine the opposition it met, and evaluate the technical, philosophical, psychological, …

Table Of Contents (1993), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Schedule (1993), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 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.

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 8, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for alumni of the program. This issue includes list of faculty research and scholarly activity and results of alumni survey.

Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd

Faculty Publications

Fast computer simulation is an essential tool in the design of large parallel computers. Our Fast Accurate Simulation Tool, FAST, is able to accurately simulate large shared memory multiprocessors and their execution of parallel applications at simulation speeds that are one to two orders of magnitude faster than previous comparable simulators. The key ideas involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work by introducing several new …

Assessment Of The Accuracy Of Three Methods Of Computerized Growth Prediction Of The Soft Tissue Profile, In Untreated Individuals, Pat Diciccio

Loma Linda University Electronic Theses, Dissertations & Projects

This study was performed to determine the accuracy and reliability of the long range growth predictions for profile structures by three computer software systems (QuickCeph™ for Apple Macintosh™ systems. Rocky Mountain Data Systems™ for IBM™ mainframe systems, and Facial Print™ for IBM™ personal computers), on untreated individuals. The total sample consisted of 90 Caucasian children from the Burlington Growth Centre. These were subdivided into groups of 15 children in each of mesiofacial, dolichofacial, and brachyfacial growth types for both males and females, with Angle class I occlusions, normal overbite, and normal overjet. Points measured consisted of 14 skeletal and soft …

A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton

Theses and Dissertations

The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …

On Clock Routing Techniques For Vlsi Synchronous Systems, Wasim A. Khan

Masters Theses

The clock signal is vital in maintaining proper dataflow, and thus the total throughput, of a high performance synchronous system.

In this thesis, we develop a clock distribution scheme for high performance systems which maximizes the operating clock frequency. We develop an algorithm which routes a planar clock tree with zero skew, minimum source to sink pathlength, and minimal total wirelength. The algorithm also provides a smooth tradeoff between maximum source to sink pathlength and total wirelength while keeping the clock skew at zero.

In many microprocessor designs, multi-phase clocks are used for improved system design. Routing a multiple clock …

The 1981, 1986, And 1990 Long Term Plans Of The Department Of Computer Sciences, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Some Experiments With A Basic Linear Algebra Routine On Distributed Memory Parallel Systems, H. Byun, Elias N. Houstis, E. A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

Shastra -- An Architecture For Deveopment Of Collaborative Appplications, Vinod Anupam, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Biased Finger Trees And Three-Dimensional Layers Of Maxima, Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer

Department of Computer Science Technical Reports

No abstract provided.

Integrating Theory And Practice In Parallel File Systems, Thomas H. Cormen, David Kotz

Dartmouth Scholarship

Several algorithms for parallel disk systems have appeared in the literature recently, and they are asymptotically optimal in terms of the number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present for the first time a list of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the configuration, independent I/O, and turning off parity, file caching, and prefetching. We summarize recent theoretical and empirical work that justifies the need for these capabilities. In addition, we sketch an organization for a parallel file …

Anns An X Window Based Version Of The Afit Neural Network Simulator, Ching-Seh Wu

Theses and Dissertations

This thesis presents an X Window based neural network simulation environment developed at Air Force Institute of Technology (AFIT) using the techniques of modern software engineering. This artificial neural network simulator is a tool running on Sun SPARCstations and supporting two user modes: end-users and client-programmers. End-users interact with neural network paradigms developed by client-programmers for the purpose of studying and analyzing the execution of a particular Neural Network (NN) paradigm, or class of NN algorithms. Client programmers maintain the system and use this environment for the development of new NN paradigms or algorithms for end-users. The development follows a …

Signal Processing With Neural Networks, Pero Smrzlic

Masters Theses

In this study, we introduce the Adaptive Back Propagation (ABP) learning algorithm, computationally superior to the standard Back Propagation. The ABP is based on the new activation function, with its corresponding adaptive learning parameter. By using the combination of computer simulations and analysis in the domain of activation function, the Method of One Hidden layer was developed for the effective utilization of units in one-hidden layer networks. A parallel version of the ABP was designed and implemented on a nCUBE-2 supercomputer with 128 processors.

The simulation results suggested a strong correlation between frequency of signals and the role of hidden …

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …

Algorithms For Generation Of Path-Methods In Object-Oriented Databases, Ashish Mehta

Dissertations

A path-method is a mechanism in object-oriented databases (OODBs) to retrieve or to update information relevant to one class that is not stored with that class but with some other class. A path-method is a method which traverses from one class through a chain of connections between classes to access information at another class. However, it is a difficult task for a user to write path-methods, because it might require comprehensive knowledge of many classes of the conceptual schema, while a typical user has often incomplete or even inconsistent knowledge of the schema.

This dissertation proposes an approach to the …

Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga

Dissertations

This dissertation presents a data model (called D_model) and an algebra (called D_ algebra) for office documents. The data model adopts a very natural view of modeling office documents. Documents are grouped into classes; each class is characterized by a "frame template", which describes the properties (or attributes) for the class of documents. A frame template is instantiated by providing it with values to form a "frame instance" which becomes the synopsis of the document of the class associated with the frame template. Different frame instances can be grouped into a folder. Therefore, a folder is a set of frame …

Megsdf Mega-System Development Framework, Tamar Zemel

Dissertations

A framework for developing large, complex software systems, called Mega-Systems, is specified. The framework incorporates engineering, managerial, and technological aspects of development, concentrating on an engineering process. MegSDF proposes developing Mega-Systems as open distributed systems, pre-planned to be integrated with other systems, and designed for change.

At the management level, MegSDF divides the development of a Mega-System into multiple coordinated projects, distinguishing between a meta-management for the whole development effort, responsible for long-term, global objectives, and local managements for the smaller projects, responsible for local, temporary objectives.

At the engineering level, MegSDF defines a process model which specifies the tasks …

Techniques Of Petri Net Reduction, Sreeranga Kalavapalli

Theses

Petri Nets have the capability to analyze large and complex concurrent systems. However, there is one constraint. The number of reachability states of the concurrent systems outweighs the capability of Petri Nets. Previous Petri Net reduction techniques focussed on reducing a subnet to a single transition and hence not powerful enough to reduce a Petri Net. This paper presents six reduction rules and discusses their drawbacks. A new reduction technique called Knitting Technique to delete paths of a Petri Net while retaining all the properties of the original net is presented. Further Structural matrix which facilitates reduction is presented.

Recursive Soft Morphological Filters, Padmaja Puttagunta

Theses

Mathematical morphology which is based on set-theoretic concept, extracts object features by choosing a suitable structuring shape as a probe. Morphological filters are set operations that transform an image into a quantitative description of its geometrical structure: Appropriately used, they can eliminate noises or irrelevancies while preserv¬ing the details of the original image. The applications of morphological filters in image processing and analysis are numerous, which include shape recognition, industrial parts inspection, nonlinear filtering, and biomedical image processing.

Soft morphological filters are used for smoothing signals with the advantage of being less sensitive to additive noises and to small variations …