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 1665 for “"Bounding"”.
-
Secure Distance Bounding
… of the prominent areas of such systems: distance bounding. Distance (upper) bounding (DUB) allows a verifier to verify whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location-based services. This thesis has two …
-
Bounding Projective Hypersurface Singularities
We first provide background necessary for understanding monodromy and spectra. We then compare several different methods involving Hodge-theoretic spectra of singularities which produce constraints on the number and type of isolated singularities on a projective hypersurface of fixed degree. In …
-
Ray Collection Bounding Volume Hierarchy
… necessary to efficiently render dynamic scenes. Bounding Volume Hierarchy (BVH) is a commonly used acceleration structure, which aides in rendering complex scenes in 3D space using Ray Tracing by breaking the scene of triangles into a simple hierarchical structure. The algorithm this thesis …
-
Distance-Bounding Grouping-Proof Protocols
… security needed. Currently, there exist distance-bounding protocols that can be used to set an upper limit on how far away a prover can be of a verifier, and grouping-proof protocols that can create a proof of two or more provers being present at the same time. But there exists no protocol that …
-
Essays on bounding stochastic programming problems
… prominent approach is to develop upper and lower bounding approximations to the problem along with procedures to sharpen bounds until an acceptable tolerance is satisfied. The contributions of this dissertation are concerned with the latter approach. The thesis first studies the stochastic linear …
-
Bounding Box Improvement with Reinforcement Learning
… a reinforcement learning technique for improving bounding box localizations of objects in images. The model takes as input a bounding box already known to overlap an object and aims to improve the fit of the box through a series of transformations that shift the location of the box by translation, …
-
Bounding the Norm of Matrix Powers
In this paper I investigate properties of square complex matrices of the form Ak, where A is also a complex matrix, and k is a nonnegative integer. I look at several ways of representing Ak. In particular, I present an identity expressing the kth power of the Schur form T of A in terms of the …
-
New Approaches for Secure Distance- Bounding
… and implement three aspects of secure distance-bounding (DB) schemes as a type of authentication scheme that considers distance as an extra verification parameter. By adding this new parameter to authentication schemes, we can prevent certain attacks that are related to distance, such as relay …
-
Bounding Methods for Facilities Location Problems
… of the optimal solution. Two of the existing bounding methods have been presented only for single facility location models with Euclidean (straight-line) distances. One of these methods uses the dual of the single facility location model to compute a lower bound. This thesis introduces a …
-
Convex Optimization Methods for Bounding Lyapunov Exponents
… the techniques developed here to the problem of bounding the sum of the leading LEs. Tractable SOS programs are derived for some special cases of this problem. The applicability of all the techniques developed here is shown by applying them to various explicit examples. For some systems we …
-
Bounding the Forcing Number of a Graph
The forcing number, denoted F(G), is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the simple graph G. Simple lower and upper bounds are δ ≤ F(G) where δ is the minimum degree and F (G) ≤ n − 1 where n is the order of the graph. This thesis …
-
Aerial Object Detection using Learnable Bounding Boxes
… rely on rectangular shaped, horizontal/vertical bounding boxes drawn over an object to accurately localize its position. Such orthogonal bounding boxes ignore object pose, resulting in reduced object localization, and limiting downstream tasks such as object understanding and tracking. To …
-
Refining Bounding-Box Regression for Object Localization
… regression technique to predict improved object bounding boxes based on an initial proposal using low-level image features extracted from the CNN. In spite of its prevalence, there is little critical analysis of bounding-box regression or in-depth performance evaluation. This thesis surveys an …
-
Over-bounding integrated INS/GNSS output errors.
… issues associated with the integrity risk over-bounding in INS/GNSS integration. The integrity risk over-bounding requires three issues to be considered: Modeling and over-bounding of inertial sensor output errors; modeling and over-bounding of GNSS signal errors; and the over-bounding of the …
-
In-region Location Verification Using Distance Bounding
… two decades to validate such claims is distance bounding protocol. Distance (upper) bounding protocol is used to verify that a user (prover) is no farther than a given distance from the verifier. Distance upper bounding protocols have a number of applications, including: secure localization, …
-
Efficient Shared Memory Algorithms for Bounding Space
… are mainly used in those applications, because bounding them is too complicated and error prone. We introduce a new primitive that provides an abstraction for avoiding unbounded tags. Also, we propose optimally time-efficient implementations of this primitive from bounded objects. In addition to …
-
A bounding surface viscoplasticity model for soils
A unified bounding surface viscoplasticity model is developed to describe the stress-strain time-dependent behaviour of soils using the consistency viscoplastic theory. Unlike the overstress based models, the elasto-viscoplastic model proposed meets the consistency condition, and allows smooth …
-
New Bounding Methods for Global Dynamic Optimization
… global dynamic optimization. Firstly, new bounding and comparison results for dynamic process models are developed, which are more broadly applicable to engineering models than previous results. These new results show for the first time that in a state-of-the-art ODE relaxation framework, …
-
Bounding Reachable Sets for Global Dynamic Optimization
… algorithms typically require obtaining global bounding information of the dynamic system, to aid in locating and verifying the global optimum. The typical approach for providing these bounds is to generate convex relaxations of the dynamic system and minimize them using a local optimization …
Page 1 of 84