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 20 of 99 for “"Traversals"”.
-
Higher-order model checking with traversals
<p>Higher-order recursion schemes are a powerful model of functional computation that grew out of traditional recursive program schemes and generalisations of grammars. It is common to view recursion schemes as generators of possibly-infinite trees, which Ong showed to have a decidable monadic …
-
Figuera: Traversals of Gender in Interactive Fiction
… open expression. Readers may perform multiple traversals of the text; the different narrative strands act as motifs for the work’s themes. The text offers the reader meaningful choices: the reader can navigate to discrete endings. Each narrative line contains deliberate gaps, such that multiple …
-
Modeling Driver Behavior and I-ADAS in Intersection Traversals
… study will characterize real-world intersection traversals to evaluate the effectiveness of I-ADAS while accounting for driver behavior in crash and near-crash scenarios. This study characterized real-world intersection traversals using naturalistic driving datasets: the Second Strategic Highway …
-
Level-based indexing for optimising XML queries
… data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique for this extended index structure is presented, …
-
Graph Locality Prefetcher for Graph Database
… networks as graphs, and queries amount to traversals on the graph. Unlike conventional memory hierarchies that exploit spatial and temporal locality, we observe that graph traversals do not necessarily exhibit these same notions of locality. This results in degraded performance of the …
-
Syntaxes with binding, their programs, and proofs
… lambda calculus, we analyse these well scoped traversals and observe that they all share the same structure. This enables us to formulate them as instances of a more general program whose properties can be established generically. Alas, the programmer is still forced to duplicate this effort …
-
Automatically Optimizing Tree Traversal Algorithms
… substantially enhance temporal locality in tree traversals. We then present a transformation framework called TreeSplicer, that automatically applies these transformations, and uses autotuning techniques to determine appropriate parameters for the transformations. For six benchmark algorithms, we …
-
Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing
… the processing of these large graphs. Graph traversals – wherein a computation proceeds from one vertex to another along the edges of a graph – are an important type of algorithm, as they form the backbone of several other important graph algorithms (e.g., shortest paths, centrality metrics …
-
Graph Processing in Main-Memory Column Stores
… data structures. The integration of graph traversals as an operator into a database management system requires a tight integration into the existing database environment and a development of new components, such as a graph topology-aware optimizer and accompanying graph statistics, …
-
Empirically Evaluated Improvements to Genotypic Spatial Distance Measurement Approaches for the Genetic Algorithm
… distance, for example, is not representative of traversals of genotypic space by the genetic algorithm – a representative measure must include consideration for both mutation and recombination. This dissertation separately explores the properties that mutational and recombinational distances …
-
Fast Parallel Algorithms for Basic Problems
… and reconstruction of a binary tree from its traversals. The research on priority queue was motivated by its various applications. The purpose of studying multiple search and multiple selection is to explore the relationships between four of the most fundamental problems in algorithm design, …
-
A hybrid approach for selecting and optimizing graph traversal strategy for analyzing big code
… Source code analysis is often realized as traversals over source code artifacts represented as graphs. Since the number of artifacts that are analyzed is huge, in millions, the efficiency of the source code analysis technique is very important. The performance of source code analysis …
-
Negotiating new literacies in science : an examination of at-risk and average-achieving ninth-grade readers' online reading comprehension strategies
… at-risk and average-achieving readers construct traversals (unique online paths of information) they locate in formation and generate meaning from science websites? (3) What individual characteristics influenced students' strategies as they locate information and generate meaning from science …
-
Strategic Modelling with Graph Rewriting Tools
… strategies based on top-down or bottom-up traversals do not make sense in this setting. We solve the problem by introducing the notion of position and banning in our located graphs and strategy language to allow for graph traversals and selective rule application based on location within a …
-
Multi-agent simulations (MAS) for assessing massive sensor coverage and deployment
… are not useful for detecting unauthorized traversals and vice versa. Obstacles, sensor mechanisms, mission parameters, and deployment schemes are analyzed for their effect on coverage quality. This work facilitates further research in sensor coverage and deployment strategies using sensor …
-
Learning-based Path-tracking Control for Ground Robots with Discrete Changes in Dynamics
… constructed based on relevant data from previous traversals of the path. We then build on this framework using Bayesian Linear Regression (BLR) to model the robot dynamics which facilitates continuous adaptation to changing dynamics in addition to leveraging data from previous traversals. To make …
-
Relative Damaging Ability Of Galactic Cosmic Rays Determined Using Monte Carlo Simulations Of Track Structure
… will illuminate variations in cell particle traversals and ionization density within cell nuclei. For a cellular target, increased particle traversals, along with increased ionization density, are key identifiers for increased damaging ability. Performing Monte Carlo simulations with the …
-
Faster XML query processing using path index
… the retrieval of data requires substantial tree traversals. Thus, the fundamental differences between query processors are the organisation of the structural summary leading to the extent of the search space reduction, and the efficiency of a tree traversal. We present a query-processing …
Page 1 of 5