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 23 for “"Path-width"”.
-
Minors of graphs of large path-width
… every two-connected graph of sufficiently large path-width contains P or Q as a minor.mDefine g(H) as the minimum number for which there exists a positive integer p(H) such that every g(H)-connected H-minor-free graph has path-width at most p(H). Then g(H) = 0 if and only if H is a forest and …
-
Optimal Steering Control of Long Combination Vehicle with Multiple Steered Units: Minimizing Swept Path Width, Off-Tracking and Rearward Amplification
… examining lateral off-tracking, swept path width, and rearward amplification. We utilize an A-double long combination vehicle equipped with two steerable and propelled axles as actuators. To improve maneuverability and lateral stability, we develop mathematical expressions for the …
-
New metrics for finite automaton complexity and subregular language hierarchies
… of NFAs, we introduce and study the string path width and depth path width measures. The string path width on a string w counts the number of all accepting and non-accepting computations on w, and the depth path width on an integer l counts the number of all accepting and non-accepting …
-
Finite Automata with Restricted Nondeterminism and Universality
… nondeterminism include the ambiguity, tree width, and path width, which, respectively, measure the number of accepting computations, the total number of computations, and the number of complete computations of an NFA. We present a polynomial algorithm which decides finiteness of an NFA's …
-
Modeling dendritic shapes - using path planning
… we present a procedural algorithm of using path planning to model dendritic shapes. We generate a dendrite by finding the least-cost paths from multiple endpoints to a common generator and use the dendrite to build the geometric model. With the control handles of endpoint placement, fractal …
-
Particle Swarm Design Optimization of ALA Rotor SynRM for Traction Applications
… for traction applications. The number of flux paths, stator tooth width, and rotor flux path width define the 3-Dimensional search space for the optimization problem. A coupled Finite Element-State Space model is developed for the ''robust" characterization of the machine and is used to setup …
-
Rear Wheel Steering - A Study on Low-Speed Maneuverability and Highway Lateral Comfort
… using two analytical cases; curvature and swept path width, and two driving scenarios; rear-end parking and driving through a T-crossing. Two control laws were used; one feedforward and one feedback. The feedforward control law was designed to keep the body side slip angle zero at steady state …
-
Systematic connectivity in single thread meandering alluvial rivers: statistical generalization of hydraulic geometry
… patterns in depth connectivity with varied path dimensions. Dimensions of measured depth and connective path were made dimensionless through bankfull hydraulic geometry. As these mean statistics scale with river discharge, connective paths should follow the same trends. Systematic …
-
Effects of recreation and environment upon the erosion of mountain footpaths in the Lake District National Park.
… led to concern about the deterioration of footpaths through the erosion of vegetation and soil. Sites were established to monitor path erosion by repeated measurements of cross sections. Results demonstrated that although many sites were stable over a two year period, some deteriorated rapidly. …
-
The role of streetscape factors in pedestrian path choices in Shinjuku, Tokyo
… impact of streetscape variables on pedestrian path choices in a walking environment. Emphasis is increasingly being placed on pedestrianoriented urban design in an attempt to mitigate the negative consequences associated with automobile-based development. However, little research exists on the …
-
REDUCED BANDWIDTH DELTA NETWORKS
… of delta networks it is shown that the full bandwidth of these networks cannot be utilized in many situations and that the amount of network bandwidth that can be utilized varies from application to application. Because the bandwidth required to support a given application does vary, it is …
-
Finite state properties of bounded parthwidth graphs
The concepts of the treewidth and pathwidth of combinatorial structures have come to play a central role in a number of important developments in discrete mathematics and combinatorial algorithm design. In particular, they are of fundamental importance to several general algorithm design techniques …
-
Navy's N-Layer Magnetic Model with application to naval magnetic demining
… throughout time. In order to calculate the swept path width for magnetic minesweeping systems currently in use by the U.S. Mine Warfare (MIW) forces, it is necessary to calculate the vector components of the magnetic field strength which are generated by each of several possible system …
-
Modeling pore structures and airflow in grain beds using discrete element method and pore-scale models
… of this research was to model the airflow paths through grain bulks and predict the resistance to airflow. The discrete element method (DEM) was used to simulate the pore structures of grain bulks. A commercial software package PFC3D (Particle Flow Code in Three Dimension) was used to …
-
Characterization of FPGA-based High Performance Computers
… integer-point FFT, FPGAs exploit a flexible data path width to trade-off circuit cost and speed of computation, improving performance and resource utilization. GPUs cannot fully take advantage of this, having a fixed data-width architecture. For the molecular dynamics application, FPGAs benefit …
-
Certificates and Witnesses for Probabilistic Model Checking
… systems that are similar to trees or paths. Formally, this is captured by the notions of tree width and path width. Our main result here is that the problem of computing minimal witnessing subsystems remains NP-complete even for Markov chains with bounded path width. The hardness proof …
-
Search trees on graphs
… to the ubiquitous notions of tree-depth and tree-width. Many computational and combinatorial questions about BSTs naturally generalize to the STG setting. In this thesis, we concentrate on the following three. Suppose we are given a query distribution and want to compute the search tree that …
-
Tornado Hazard Analysis for the United States using a Stochastic Track Simulation Model
… is utilized to generate the tornado intensity, path width, path length, heading direction, intensity and time/date of spawn. The wind field model was used to compute the tornado wind speed along the tornado footprint. The tracking model was calibrated using the historical tornado information …
-
Damage analysis and mitigation for wood-frame structures subjected to tornado loading
… for the gradient of wind speed along a tornado’s path length and path width. From this, a probabilistic tornado hazard index was developed across the United States which quantified the annual probability of experiencing a tornado of any strength on the Enhanced Fujita scale. Tornado hazard curves …
Page 1 of 2