Browsing University of Waterloo by Title
Now showing items 7607-7626 of 18947
-
General Quadratic Risk Minimization: a Variational Approach
(University of Waterloo, 2016-07-05)Mean-variance portfolio selection and mean-variance hedging are mainstream research topics in mathematical nance, which can be subsumed within the framework of a general problem of quadratic risk minimization. We study ... -
The general working models of individuals from divorced and conflict-ridden families, risk factors in intimate bonds?
(University of Waterloo, 1999) -
Generalisations of Roth's theorem on finite abelian groups
(University of Waterloo, 2012-12-18)Roth's theorem, proved by Roth in 1953, states that when A is a subset of the integers [1,N] with A dense enough, A has a three term arithmetic progression (3-AP). Since then the bound originally given by Roth has been ... -
A Generalization of M/G/1 Priority Models via Accumulating Priority
(University of Waterloo, 2016-01-08)Priority queueing systems are oftentimes set up so that arriving customers are placed into one of $N$ distinct priority classes. Moreover, to determine the order of service, each customer (upon arriving to the system) is ... -
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
(Springer, 2009-01-31)Let r1, . . . , rs be non-zero integers satisfying r1 + · · · + rs = 0. Let G Z/k1Z⊕· · ·⊕Z/knZ be a finite abelian group with ki |ki−1(2 ≤ i ≤ n), and suppose that (ri , k1) = 1(1 ≤ i ≤ s). Let Dr(G) denote the maximal ... -
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II)
(Elsevier, 2011-02)Let G ≃ Z/k1Z ⊕ · · · ⊕ Z/kN Z be a finite abelian group with ki |ki−1 (2 ≤ i ≤ N). For a matrix Y = (ai,j) ∈ Z R×S satisfying ai,1 + · · · + ai,S = 0 (1 ≤ i ≤ R), let DY (G) denote the maximal cardinality of a set ... -
A Generalization of Roth's Theorem in Function Fields
(University of Michigan, Department of Mathematics, 2012-11)For n ∈ N = {1, 2, ...}, let D3([1, n]) denote the maximal cardinality of an integer subset of [1, n] containing no nontrivial 3-term arithmetic progression. In a fundamental paper [9], Roth proved that D3([1, n]) n/log ... -
A generalization of Roth's theorem in function fields
(World Scientific Publishing, 2009-11)Let 𝔽q[t] denote the polynomial ring over the finite field 𝔽q, and let formula denote the subset of 𝔽q[t] containing all polynomials of degree strictly less than N. For non-zero elements r1, …, rs of 𝔽q satisfying r1 ... -
A Generalization of the Discounted Penalty Function in Ruin Theory
(University of Waterloo, 2008-08-21)As ruin theory evolves in recent years, there has been a variety of quantities pertaining to an insurer's bankruptcy at the centre of focus in the literature. Despite the fact that these quantities are distinct from each ... -
A Generalization of the Erdös-Kac Theorem and its Applications
(Cambridge University Press, 2004-12-01)We axiomatize the main properties of the classical Erdös-Kac Theorem in order to apply it to a general context. We provide applications in the cases of number fields, function fields, and geometrically irreducible varieties ... -
A Generalization of the Turán Theorem and Its Applications
(Cambridge University Press, 2004-12-01)We axiomatize the main properties of the classical Turan Theorem in order to apply it to a general context. We provide applications in the cases of number fields, function fields, and geometrically irreducible varieties ... -
Generalization on Text-based Games using Structured Belief Representations
(University of Waterloo, 2020-12-23)Text-based games are complex, interactive simulations where a player is asked to process the text describing the underlying state of the world to issue textual commands for advancing in a game. Playing these games can be ... -
A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas
(University of Waterloo, 2019-12-19)In this thesis we characterize the minimal non-planar extensions of a signed graph. We consider the following question: Given a subdivision of a planar signed graph (G, Σ), what are the minimal structures that can be added ... -
Generalizations and Applications of the Stochastic Block Model to Basketball Games and Variable Selection Problems
(University of Waterloo, 2017-01-24)Over the past decade, there has been an explosion of network data in a vast number of circumstances, such as the World Wide Web, social networks, gene interactions, economic networks, etc. Scientific analysis of networks ... -
Generalizations of All-or-Nothing Transforms and their Application in Secure Distributed Storage
(University of Waterloo, 2021-01-26)An all-or-nothing transform is an invertible function that maps s inputs to s outputs such that, in the calculation of the inverse, the absence of only one output makes it impossible for an adversary to obtain any information ... -
Generalizations of the Gap Principle and the Thue-Siegel Principle, with Applications to Diophantine Equations
(University of Waterloo, 2019-07-16)In this thesis we develop generalizations of two well-known principles from the theory of Diophantine approximation, namely the gap principle and the Thue-Siegel principle. Our results find their applications in the theory ... -
Generalizations to Corrections of Measurement Error Effects for Dynamic Treatment Regimes
(University of Waterloo, 2022-08-19)Measurement error is a pervasive issue in questions of estimation and inference. Generally, any data which are measured with error will render the results of an analysis which ignores this error unreliable. This is a ... -
A Generalized 2-D Multiport Model for Planar Circuits with Slots in Ground Plane
(University of Waterloo, 2005)With increasing complexity of microwave integrated circuits and tendency towards building integrated modules, real estate in printed circuit boards becomes more at premium. On the other hand, building MIC's on a ... -
A Generalized Adversary Method for Quantum Query Complexity
(University of Waterloo, 2022-05-20)Quantum query complexity measures the minimum number of queries a quantum algorithm needs to make to some input string to compute a function of that input. Query complexity models are widely used throughout quantum computing, ... -
A Generalized Blending Scheme for Arbitrary Order of Continuity
(University of Waterloo, 2023-03-20)In this thesis, new templates and formulas of blending functions, schemes, and algorithms are derived for solving the scattered data interpolation problem. The resulting data fitting scheme interpolates the positions and ...