4,153 research outputs found
Harry A. Bounds and Elizabeth C. Middleton's wedding invitation
No full textAn invitation and envelope sent to Elizabeth Parrott and Helen Start to attend the wedding of Harry A. Bounds and Elizabeth C. Middleton on October 4, 1910, in Smyrna, Delaware
Harry A. Bounds and Elizabeth C. Middleton's wedding invitation
No full textAn invitation and envelope sent to Elizabeth Parrott and Helen Start to attend the wedding of Harry A. Bounds and Elizabeth C. Middleton on October 4, 1910, in Smyrna, Delaware
Explicit non-asymptotic bounds for the distance to the first-order Edgeworth expansion
No full textIn this article, we study bounds on the uniform distance between the cumulative distribution function of a standardized sum of independent centered random variables with moments of order four and its first-order Edgeworth expansion. Existing bounds are sharpened in two frameworks: when the variables are independent but not identically distributed and in the case of independent and identically distributed random variables. Improvements of these bounds are derived if the third moment of the distribution is zero. We also provide adapted versions of these bounds under additional regularity constraints on the tail behavior of the characteristic function. We finally present an application of our results to the lack of validity of one-sided tests based on the normal approximation of the mean for a fixed sample size.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Statistic
Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams
No full textWe propose a relaxed decision diagram (DD) formulation for obtaining lower bounds on uniform machine scheduling instances, based on separators to separate jobs on different machines. Experiments on the total tardiness for instances with tight due times show that for obtaining nontrivial bounds, it is important to partition the DD nodes on a layer based on their machine finishing time. When the number of jobs is small, DDs provide stronger bounds in less time than a time-indexed LP relaxation.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Algorithmic
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
No full textThis paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions
Inequalities for some Functionals Associated with Bounded Linear Operators in Hilbert Spaces
No full textSome inequalities between the operator norm, numerical radius
and functional are established. New upper bounds for the nonnegative
quantity that complement some recent results of the author are given as well
Valuing Transgenic Cotton Technologies Using a Risk/Return Framework
No full textStochastic Efficiency with Respect to a Function (SERF) is used to rank transgenic cotton technology groups and place an upper and lower bound on their value. Yield and production data from replicated plot experiments are used to build cumulative distribution functions of returns for nontransgenic, Roundup Ready, Bollgard, and stacked gene cotton cultivars. Analysis of Arkansas data indicated that the stacked gene and Roundup Ready technologies would be preferred by a large number of risk neutral and risk averse producers as long as the costs of the technology and seed are below the lower bounds calculated in this manuscript.cotton, financial risk, market value, SERF, transgenic, Agribusiness, Crop Production/Industries, Risk and Uncertainty, Q12, Q16,
Upper bounds for deletion correcting codes
No full textThe world can’t keep up with its own data and therefore needs new ways to store it. Research is being done into new types of experimental data storage like DNA sampling or racetrack memory, which could completely revolutionize the way storage works. However, such storage media are prone to certain type of errors like deletion errors where information is lost. Consequently, there has been a surge in interest in developing deletion correcting codes to address this challenge. We are interested in the maximal size of a code correcting up to a certain number of deletions. Nevertheless, constructing these codes can be quite intricate and therefore we are often limited to working with bounds.In this thesis, we will study and evaluate upper bounds for these codes. We will compare bounds that were derived analytically to bounds that have been computed with the use of linear programs. We will compute upper bounds for 1-, 2- and 3-deletion correcting codes. Moreover, we will show how to compute these bounds with a linear program, by posing the problem of finding a largest deletion correcting code as finding the transversal number on a hypergraph. It will become clear that the bounds computed through linear programming are much stronger than any bound derived analytically.Applied Mathematic
Coming together, coming apart religion, community, and modernity
No full text"While the idea of "community: is increasingly vital to our individual and social well-being, our ordinary communal relations are being eroded by increased mobility, lost traditions, and the growing pluralism of society. Examining this renewed desire for community, Coming Together/Coming Apart locates the current problems in modern capitalism. Out of a common matrix of a lifeworld in crises, contemporary religious, social, and feminist discussions compose an ideological struggle over the reformation of society." "Bounds analyzes a broad range of theorists from Daniel Bell and Stanley Hauerwas to Sharon Welch and Cornel West. In comparing their arguments about community, she illustrates critical assumptions about the roles of morality and religion including the values of difference, the diversity of traditions, and the nature of moral connection."--BOOK JACKET
Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
No full textThe cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies on Laplacian eigenvalues, which approximate the largest and smallest possible cut-sets for a given size of the set V. In this article, we extend the standard spectral approximations by including information about the Laplacian eigenvectors. This additional information leads to provably tighter bounds compared to the standard spectral bounds. We apply our new method to find improved spectral bounds for the well-known Cheeger constant, the Max Cut problem and the expander mixing lemma. We also apply our bounds to study cut sizes in the hypercube graph, and describe an application related to the spreading of epidemics on networks. We further illustrate the performance of our new bounds using simulations, revealing that a significant improvement over the standard bounds is possible.Accepted author manuscriptNetwork Architectures and Service
- …
