This document describes the need for, and design of, diagnostic software that provides circuit verification, fault isolation, and troubleshooting aids. The difference between verification software and true diagnostic software is explained. A modular design of diagnostic software is proposed, consisting of a series of 3-part tests, a test manager, results...
The k-ary n-cube structure is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. Machines based on the k-ary n-cube topology have been advocated as ideal parallel architectures for their powerful interconnecting features.
In this paper, we examine the k-ary n-cube from the graph...
Compactness in deep learning can be critical to a model’s viability in low-resource applications, and a common approach to extreme model compression is quantization. We consider Iterative Product Quantization (iPQ) with Quant-Noise [Fan et al., 2020] to be state-of-the-art in this area, but this quantization framework suffers from preventable inference...
As fifth generation telecommunications equipment becomes more viable and reliable, demand for high-speed, low-latency, viewpoint specific data analysis is expected to dramatically increase. Systems such as self-driving cars, traffic cameras, warehouses and other commercial buildings will be using fifth generation telecommunications to form ‘smart cities’, driving demand for the edge....
Artificial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the planning techniques, hierarchical- decomposition planning has been the technique most employed in industrial-strength planners. Hierarchical-decomposition planning is...
We describe a set of data flow techniques and code transformations that translate a single instruction stream, multiple data stream (SIMD) Dataparallel C program into a semantically equivalent single program, multiple data stream (SPMD) C program suitable for execution on shared memory multiprocessor computers, such as the Sequent Balance and...
Practical parallel programming demands that the details of distributing data to processors and inter- processor communication be managed by the compiler. These tasks quickly become too di cult for a programmer to do by hand for all but the simplest parallel programs. Yet, many parallel languages still require the programmer...
AM is a computer program written by Doug Lenat that discovers elementary
mathematics starting from some initial knowledge of set theory. The success of this
program is not clearly understood.
This work is an attempt to explore the search space of AM in order to understand the success and eventual...
This thesis consists of two major components. The first part is concerned with video object instance segmentation (VOS), which is the task of assigning per-pixel labels perframe of a video sequence to indicate foreground object instance membership, given the first frame ground truth mask. VOS has myriad applications, from video...
Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from a single, unified linguistic framework. Multiparadigm programming languages are claimed to have benefits to both pedagogy and complex application creation. The beneficial...
Polyhedra are geometric representations of linear systems of equations and
inequalities. Since polyhedra are used to represent the iteration domains of nested
loop programs, procedures for operating on polyhedra can be used for doing loop
transformations and other program restructuring transformations which are needed
in parallelizing compilers. Thus a need...
This study compares three approaches in the design of an autonomous machine listening agent that predicts harbor porpoise ultrasonic echolocation clicks in diverse noise environments. Considering the temporal variations of noisy coastal ocean soundscapes which the harbor porpoises inhabit, we propose a leave-one-day-out (LODO) cross-validation strategy in the training of...
In a constant weight code, each code word contains a constant number of 1's. If this number is equal to half the length of the code word then the code is called balanced. These codes find many applications in computer and communication systems noise reduction in VLSI systems, fault masking...
Metric spaces (X, d) are ubiquitous objects in mathematics and computer science that are able to capture pairwise distance relationships d(x, y) between points x, y ∈ X. Because of this, it is natural to ask what useful generalizations there are of metric spaces for capturing “k-wise distance relationships” d(x1,...
We consider three problems on simplicial complexes: the Optimal Bounded Chain Problem, the Optimal Homologous Chain Problem, and 2-Dim-Bounded-Surface. The Optimal Bounded Chain Problem asks to find the minimum weight d-chain in a simplicial complex K bounded by a given (d−1)-chain, if such a d-chain exists. The Optimal Homologous Chain...
This paper synthesizes various works Wang tiles up to this point, including: the reduction from the Halting Problem to Wang Tiling Problem and notions around various aspects of periodicity, including minimal period, aperiodicity, and axis-aligned periodicity. Additionally it includes new work, including: a proof that a tiling can be periodic...
We will describe two known strategies for static processor
allocation in an n-cube multiprocessor, namely the buddy system
strategy and the gray code strategy, and then propose a new strategy
that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in
cube recognition. Furthermore, our strategy is suitable for...
Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
Secure two-party computation (2PC) is the task of performing arbitrary calculations on secret inputs provided by two parties, while maintaining secrecy if at least one party is honest. 2PC has been applied to privacy-preserving record linkage and machine learning, in areas such as medicine where maintaining privacy is crucial. One...
Although machine learning systems are often effective in real-world applications, there are situations in which they can be even better when provided with some degree of end user feedback. This is especially true when the machine learning system needs to customize itself to the end user's preferences, such as in...