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 524 for “"Upper Bound"”.
-
A new upper bound in the linear sieve and its applications
In Chapter I we shall prove a new upper bound in the linear sieve. Our purpose in Chapter II is to explain our method in greater detail than was done in Chapter I. Let x be a large number. We consider $\pi\sb2$(x)--the number of prime twins not exceeding x. Using the new upper bound in the linear …
-
Shear strength of reinforced concrete wall-beam structures: upper- bound analysis and experiments
… when subjected to in-plane loading. The upper-bound approach is emphasised. Present shear design practice (e.g. BS8110:1985) relies much upon empirical solutions, but it is inadequately Substantiated by theoretical analyses when compared with design against bending moments. Review of …
-
Scale of Fermion Mass Generation
… weak vector boson scattering implies an upper bound on the scale of electroweak symmetry breaking, Lambda EWSB ≡ 8pv ≈ 1 TeV. Appelquist and Chanowitz have derived an analogous upper bound on the scale of fermion mass generation, proportional to v 2/mf, by considering the …
-
The Maximal Thurston-Bennequin Number on Grid Number n Diagrams
<p>We will prove an upper bound for the Thurston-Bennequin number of Legendrian knots and links on a rectangular grid with arc index n.</p> <p>TB(n)=CR(n)-[n/2]</p> <p>In order to prove the bound, we will separate our work for when n is even and when n is odd. After we prove the upper bound, we …
-
Fair allocation of operations and makespan minimization for multiple robotic agents
… fairness criterion while also guaranteeing an upper bound of 2 on the makespan for identical agents. The algorithm also guarantees an upper bound of 1.618 for 2 uniformly related agents and (1+√(4n−3))/2 for n uniformly related agents. The pairwise approach used in this algorithm has the added …
-
The number of degree sequences of graphs
We give nontrivial upper and lower bounds for the total number of distinct degree sequences among all simple, unlabeled graphs on n vertices (graphical partitions on n vertices). Our upper bound is ... for some constant C, and improvement of ... over the trivial upper bound which is asymptotic to …
-
Thue equations and related topics
Using a classical result of Thue, we give an upper bound for the number of solutions to a family of quartic Thue equations. We also give an upper bound upon the number of solutions to a family of quartic Thue inequalities. Using the Thue-Siegel principle and the theory of linear forms in …
-
Surface-surface intersection with validated error bounds
… arithmetic, we obtain a continuous, validated upper bound for the intersection curve segment in the parametric space of each surface. Application of the validated ODE solver in the context of eliminating the pathological phenomena of straying and looping is discussed. We develop a method to …
-
Global Regularity for Euler Vortex Patch in Bounded Smooth Domains
… regular if it is regular enough initially. In bounded domains, the regularity theory for patch solutions is less complete. In this thesis, I study the Euler vortex patch in a general smooth bounded domain. I prove global in time regularity by providing the upper bound of the growth on curvature …
-
Bayesian Estimators, Error Bounds, and Applications to Imaging
… which gave early impetus to work on a host of bounds on the MMSE of varying degrees of tightness over the last fifty years. The bounds, if sufficiently tight, help us in evaluating the performance of sub-optimal estimators. A widely used lower bound on the MMSE is the Ziv-Zakai lower bound, …
-
Analyzing the opinion dynamics models discrete & continuous
… this purpose, we first consider the agent-based bounded confidence model of the Hegselmann-Krause where multiple agents want to agree on a common scalar, or they can be divided in several subgroups, with each subgroup having its own agreement value. In this model, we restrict ourselves to the …
-
Elimination for Systems of Algebraic Differential Equations
<p>We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of …
-
Network coding for speedup in switches
… terms of speedup. We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually …
-
On Communication Over Correlated Fading Channels With Practical Power Constraints
… the context of fading channels. They derived an upper bound to the probability of error, called the expurgated bound. Here, the proof of the expurgated bound is shown to be flawed. A new upper bound is also derived. It is not known whether the original expurgated bound is valid for the important …
-
A survey of some regression-based and duality methods to value American and Bermudan options Bernard Joseph.
… estimate of the option price is a lower bound. We then look at a dual formation of the optimal stopping problem which is used to generate an upper bound for the option price. The upper bound can be constructed by using any approximation to the option price. By using an approximation that …
-
Mismatched Decoding: Capacity and Error Exponent Upper Bounds
… open problem in information theory. Lower bounds for the mismatch capacity have been studied extensively using random coding techniques. On the other hand, upperbounds for the mismatch capacity were not explored until a few years ago. In this thesis we study a novel technique for tackling …
-
Obtaining performance and programmability using reconfigurable hardware for media processing
… highly unpredictable, we can obtain a quick upper bound estimate on the clock speed based on a few parameters. We also analyze microprocessor architectures and establish an analytical performance model. We use this model to estimate performance bounds using very little information on task …
Page 1 of 27