Digital Commons Network^™

A Priori Grid Adaption Strategies For Elliptic Pdes, Calvin J. Ribbens

Department of Computer Science Technical Reports

No abstract provided.

Some Experiments With Tcp/Ip Protocols Over An X.25 Network, John T. Korb, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Periodic Phenomena In The Classical Adams Spectral Sequence, Mark Mahowald, Paul L. Shick

Mathematics and Computer Science

We investigate certain periodic phenomena in the classical Adams spectral sequence which are related to the polynomial generators υ_n in π∗(ΒΡ). We define the notion of a class α in Ext_Α(Ζ/2,Ζ/2) being υ_n-periodic or υ_n-torsion and prove that classes that are υ_n-torsion are also υ_κ-torsion for all κ such that 0 ≤ κ ≤ n. This allows us to define a chromatic filtration of Ext_Α(Ζ/2,Ζ/2) paralleling the chromatic filtration of the Novikov spectral sequence Ε₂-term …

Parallel Algorithms For Line Detection On A Mesh, Concettina Guerra, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Sun Workstations As Cypress Implets, Douglas E. Comer, Gregory H. Smith

Department of Computer Science Technical Reports

No abstract provided.

Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage

Department of Computer Science Technical Reports

No abstract provided.

Perception Of A Quadrilaleral, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A New Approach To The Dynamic Maintenance Of Maximal Points In A Plane, Greg N. Frederickson, Susan Rodger

Department of Computer Science Technical Reports

No abstract provided.

Meta-Level Programming: A Compiled Approach, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

There has been some intense research lately focused on the area of meta-level inference systems. In logic programming, the limitations of Prolog are widely recognized and a meta-level approach has been suggested. Unfortunately, only meta-interpreters have been considered so far. Moreover, these meta-interpreters are often themselves written on top of a Prolog interpreter. These cascaded layers of interpreters result in an enormous slow down, rendering the resulting system practically useless for all but a small number of toy applications. This paper will report on the implementation of a fast incremental metaProlog compiler. In the process, it will explore some of …

A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager

Computer Science Technical Reports

No abstract provided.

The Performance Of Numerical Methods For Elliptic Problems With Mixed Boundary Conditions, Wayne R. Dyksen, Calvin J. Ribbens, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.

Lily-A Generator For Compiler Frontends, Thomas J. Sager

Computer Science Technical Reports

In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers.

A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager

Computer Science Technical Reports

An algorithm for storage and retrieval in a small dynamic cache is presented. This algorithm is based on C.C. Chang’s ordered minimal perfect hashing scheme. Our algorithm has the property that it divides the set of objects that could occupy the cache into an arbitrary number of equivalence classes. The only restriction on which objects can occupy the cache are that no two objects in the same equivalence class can be in the cache at the same time. Retrieval from the cache is performed in constant time. Update of the cache is performed in logarithmic time.

An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa

Electrical Engineering and Computer Science - All Scholarship

The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …

Sorting And Selecting In Rounds, Nicholas Pippenger

All HMC Faculty Publications and Research

We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being “explicit modulo expansion”; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and selecting will follow. Using the best currently available explicit constructions for expanding graphs, we present the best currently known explicit algorithms for sorting and selecting in rounds.

The Complexity Of Computations By Networks, Nicholas Pippenger

All HMC Faculty Publications and Research

We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.

Proof And Intuition, Michael Detlefsen

ACMS Journal 2004

This paper aims to give a clear exposition of two critiques of logicism. The intuitionist, Brouwer, is best known for rejecting the law of the excluded middle (his "special critique.") The paper argues that Brouwer's "general critique" is deeper and more extensive than this. That is, Brouwer is arguing that mathematical knowledge requires a kind of direct mathematical experience, analogous to sensory experience and this cannot be attained simply by linguistic operations independently of experience. It also discusses Poincare's critiques - that there is a huge difference between genuine mathematical insight and an ability to logically manipulate mathematical truths and …

Nova University Doctor Of Education In Computer Education [1987], Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

The Gradient Model Load Balancing Method, Frank C. H. Lin, Robert M. Keller

All HMC Faculty Publications and Research

A dynamic load balancing method is proposed for a class of large-diameter multiprocessor systems. The method is based on the "gradient model," which entails transferring backlogged tasks to nearby idle processors according to a pressure gradient indirectly established by requests from idle processors. The algorithm is fully distributed and asynchronous. Global balance is achieved by successive refinements of many localized balances. The gradient model is formulated so as to be independent of system topology.

Learning Object-Centered Representations, Peter Anthony Sandon

Computer Science Technical Reports

When we look at a familiar object from a novel viewpoint, we are usually able to recognize it. In this thesis, we address the problem of learning to recognize objects under transformations associated with viewpoint. Our vision model combines a hierarchical representation of shape features with an explicit representation of the transformation. Shape features are represented in a layered pyramid-shaped subnetwork, while the transformation is explicitly represented in an auxiliary subnetwork. The two connectionist networks are conjunctively combined to allow object- centered shape features to be computed in the upper layers of the network. A simulation of a 2-D translation …

Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley

CCAC Theses and Dissertations

At the University of Central Florida Library, the librarians with collection development assignments, and the Head of Collection Development, were frustrated in their attempts to fulfill their responsibilities. Those librarians did not report to the Department Head, but to other departments, and only a small percentage of their time was set aside for collection development. This meant that collection development duties frequently were deferred to other duties. There also was uncertainty about what duties could be expected of these librarians. Some functioned only as liaisons to academic departments, while others did extensive selection of material, wrote collection development policies, and …

Strategic Planning For A Special Library, Donald A. Guerriero

CCAC Theses and Dissertations

STRATEGIC PLANNING FOR A SPECIAL LIBRARY

The Technical and Management Information Center of the U.S. Defense Communications Agency is a special library providing worldwide library and information services in the subject fields of communications, electronics, command and control, and computer sciences. A project was designed with the objective of developing a strategic plan for this library. Long-range and strategic planning methods commonly used in business organizations were used. An extensive review of the literature on strategic planning was done to determine the best methods available for use in a special library environment. The methods used to develop the strategic plan …

The Computer As A Collection Management Tool, Suzanne B. Mclaren, Hugh H. Genoways, Duane A. Schlitter

University of Nebraska State Museum: Mammalogy Papers

Since the mid-1960s, discussion of computer use for information retrieval in museum collections has usually focused on research potential. Much attention has been given to the idea of networking and the ability to access data across great distances. However, the potential for collection management usage has also proven to be a legitimate rationale for computerization. Numerous aspects of collection management are discussed for which the computer may be employed. Topics include creating cross-reference files, updating taxonomic and geographic information, pinpointing mismatched specimens, locating lost and uncataloged material, controlling loan procedures, producing accession files for insurance purposes, curating all or part …

Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock

All Computer Science and Engineering Research

A fundamental need in future information systems is an effective method of accurately representing and monitoring dynamic, real-world situations inside a computer. Information is represented using an Extended Open World Assumption (EOWA), in which the data are explicitly true or false. Reasoning within the EOWA is done through the use of a dynamic dependency net which only represents those beliefs and justifications that are both currently valid and in current use. In this paper, we present definitions and uses of the EOWA and dynamic dependency net in our current research of developing a database with which we can use deductive …