Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn
Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn
Electrical Engineering and Computer Science - Technical Reports
We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Construing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn …
Designing Dependencies, Howard A. Blair
Designing Dependencies, Howard A. Blair
Electrical Engineering and Computer Science - Technical Reports
Given a binary recursively enumerable relation R, one or more logic programs over a language L can be constructed and interconnected to produce a dependency relation D on selected predicates within the Herbrand base BL of L isomorphic to R. D can be, optionally, a positive, negative or mixed dependency relation. The construction is applied to representing any effective game of the type introduced by Gurevich and Harrington, which they used to prove Rabin's decision method for S2S, as the dependency relation of a logic program. We allow games over an infinite alphabet of possible moves. We use this representation …
Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary
Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary
Electrical Engineering and Computer Science - Technical Reports
Parallel I/0 subsystems are added to massively parallel computers in order to lessen I/0 bottleneck to some extent. Up to now, a few number of parallel software systems have been designed and implemented to assist programmers in I/0 intensive applications; PASSION is one of them. By providing parallel I/0 support at the language, compiler and run-time level, PASSION system explores the large design space of parallel systems. The target of this paper is to show the performance benefits of using PASSION I/0 libraries at runtime in comparison with using conventional parallel I/0 primitives for high performance parallel I/0 in LU …
A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli
A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli
Electrical Engineering and Computer Science - Technical Reports
As video consumes a significant percentage of the available network bandwidth, understanding video bandwidth requirements will translate into better network control schemes. In this study, several commercially available video streams are statistically analyzed and several modeling approaches are developed. The segmentation techniques are found to be rewarding. However, the improvements due to complexity of the polynomial models are insignificant.
A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm
A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm
Electrical Engineering and Computer Science - Technical Reports
εm is a high-level programming system which puts parallelism within the reach of scientists who are not sophisticated programmers. εm both restricts and simplifies the programming interface, and thereby eases both the conceptual task of the programmer and the analytical task of the compiler. The εm compiler performs automatic data structure definition, scheduling and data partitioning. This document presents the automatic data partitioning algorithm used in εm.
Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr
Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr
Electrical Engineering and Computer Science - Technical Reports
In this paper we introduce a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows us to formulate a number of well-known coding theoretical problems in a uniform manner. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.