Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist
Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist
Computer Science Technical Reports
This study evaluates the multilist and inverted file systems. It describes the structure of the two file system and then proceeds to investigate the performance. The performance is based on quantitative estimates of space requirements for file system, time to retrieve records, time to insert a record, time to delete a record, time to update a record and time to exhaustively read and reorganize the file system. The study then investigates specific situations in which one file system seems to perform better than the other.
Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist
Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist
Computer Science Technical Reports
This study discusses the performance parameter measurements of generic files, the pile file, the sequential file, the indexed-sequential file, the indexed file and the direct file. The file performance measurements are compiled in a software package. The study then describes the use of such software package as a simulation tool in a file design environment.
Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett
Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett
Computer Science Technical Reports
A composite graph is a finite undirected graph in which a positive integer known as a chromaticity is associated with each vertex of the graph. The composite graph coloring problem (CGCP) is the problem of finding the chromatic number of a composite graph, i.e., the minimum number of colors (positive integers) required to assign a sequence of consecutive colors to each vertex of the graph in a manner such that adjacent vertices are not assigned sequences with colors in common and the sequence assigned to a vertex has the number of colors indicated by the chromaticity of the vertex. The …
Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair
Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair
Computer Science Technical Reports
The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …
Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock
Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock
Computer Science Technical Reports
As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …
Matching Multiple Patterns From Right To Left, Samuel W. Bent, M A. Sridhar
Matching Multiple Patterns From Right To Left, Samuel W. Bent, M A. Sridhar
Computer Science Technical Reports
We address the problem of matching multiple pattern strings against a text string. Just as the Aho-Corasick algorithm generalizes the Knuth-Morris-Pratt single-pattern algorithm to handle multiple patterns, we exhibit two generalizations of the Boyer-Moore algorithm to handle multiple patterns. In order to obtain worst-case time bounds better than quadratic, our algorithms remember some of the previous history of the matching.
Ethernet Performance: Design And Implementation Study, Michael M. Chaney, Tachen L. Lo, Daniel C. St. Clair
Ethernet Performance: Design And Implementation Study, Michael M. Chaney, Tachen L. Lo, Daniel C. St. Clair
Computer Science Technical Reports
General concepts concerning local area network designs, functions and topologies will be presented. Ethernet as a multipoint bus topology local area network will be presented in detail. The Carrier Sense Multiple Access/Collision Detect (CSMA/CD) method of fairly regulating access to the shared network bus is studied. The Ethernet Network in relation to the Open Systems Interconnect (OSI) is reviewed, but only the layers pertaining to Ethernet are discussed throughout the majority of the paper. The specifications as described by Xerox, Digital and Intel are presented to help the designer understand the network's physical limitations. Analytical models are used to predict …
A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock
A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock
Computer Science Technical Reports
The representation for serial robotic tasks proposed in this thesis is a language of temporal constraints derived directly from a model of the space of serial plans. It was specifically designed to encompass problems that include disjunctive ordering constraints. This guarantees that the proposed language can completely and, to a certain extent, compactly represent all possible serial robotic tasks. The generality of this language carries a penalty. The proposed language of temporal constraints is NP-Complete. Specific methods have been demonstrated for normalizing constraints posed in this language in order to make subsequent sequencing and analysis more tractable. Using this language, …
Lily-A Generator For Compiler Frontends, Thomas J. Sager
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
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.
Learning Object-Centered Representations, Peter Anthony Sandon
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 …