Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"transitive closure"”.
-
Transitive Closure Logic and Multihead Automata with Nested Pebbles
… complexity theory. These extensions include transitive closure logic and deterministic transitive closure logic, which extend first-order logic with transitive closure operators. It is known that deterministic transitive closure logic captures the complexity class of the languages that are …
-
Graph Analytics with Data Science Languages
… Finally, we study the crucial graph algorithm, transitive closure. We propose a disk-based transitive closure solution that operates on the bit-matrix. The solution is within the Python ecosystem while adhering to the principles of database systems. Our experimental study shows the superiority …
-
Efficient parallel computation on multiprocessors with optical interconnection networks
… and selection; Boolean matrix multiplication, transitive closure and their applications to connected component problems. We implement an optimal sorting algorithm on an n-processor LARPBS. With this optimal sorting algorithm at disposal, we study the sorting problem for higher dimensional …
-
A binary relation inference network for constrained optimization
… some optimization problems (shortest path, transitive closure, assignment, etc.) into network convergence problems and divides the work load evenly among all processors. Link weights are known. It can operate in synchronous discrete-time, asynchronous discrete-time, and continuous-time …
-
Improving the Efficiency of Graph-Based Static Analysis
… usually conducted in the form of solving dynamic transitive closure on the abstract graph of programs. The inefficiency arises from not only the high complexity of transitive closure itself but also the high redundancies of the analysis techniques. This dissertation studies improving the …
-
Executable specifications for Java programs
… written in first-order relational logic with transitive closure, and the imperative language for this purpose is Java. By being able to mix imperative code with executable declarative specifications, the user can easily express constraint problems in-place, i.e. in terms of the existing data …
-
Incremental Processing and Optimization of Update Streams
… query processing: incremental processing of transitive closure queries over data streams, and incremental re-optimization of queries. In addition to addressing these specific challenges, we also develop a working prototype system Aspen, which serves as an end-to-end stream processing system …
-
Dynamic Data Structures for Two Dimensional Searching
… (if one exists). The third problem, dynamic transitive closure, considers a planar acyclic digraph embedded in the plane, and asks for testing the existence of and/or reporting a directed path between two query vertices. In all of the three problems the update operations consist of …
-
Automating abstraction functions
… declarative first-order logic with relations and transitive closure. We observe that the abstraction functions programmers write in practice may often be viewed as navigation queries on the heap, and two of our techniques exploit this insight to synthesize executable code from declarative …
-
Perpetual requirements engineering
… of change management consists of projecting the transitive closure of the this dependency relation based on the set of artifacts that have actually changed and assessing how the related artifacts changed. The latter description of the traditional change management process generally occurs after …
-
High Performance Reference Counting and Conservative Garbage Collection
… Tracing identifies live objects by performing a transitive closure over the object graph starting with the stacks, registers, and global variables as roots. Objects not reached by the trace are implicitly dead, so the collector reclaims them. In contrast, reference counting explicitly identifies …
-
High Performance Reference Counting and Conservative Garbage Collection
… Tracing identifies live objects by performing a transitive closure over the object graph starting with the stacks, registers, and global variables as roots. Objects not reached by the trace are implicitly dead, so the collector reclaims them. In contrast, reference counting explicitly identifies …
-
Object Association Across Multiple Moving Cameras In Planar Scenes
… exist, ensuring coherency in association, i.e. transitive closure is maintained between more than two cameras, is an essential requirement. To ensure such coherency we pose the problem of object associating across cameras as a k-dimensional matching and use an approximation to find the …
-
On the analysis of complex networks : fundamental limits, scalable algorithms, and applications
… framework. In Chapter 4, we formulate the transitive noise problem in networks as the inverse of matrix transitive closure and introduce an algorithm to solve it efficiently. We demonstrate the effectiveness of our approach in several applications such as regulatory network inference, …