Localization of the optimal solution and a posteriori bounds for aggregation

After an aggregated problem has been solved, it is often desirable to estimate the accuracy loss due to the fact that a simpler problem than the original one has been solved. One way of measuring this loss in accuracy is the difference in objective function values. To get the bounds for this difference, Zipkin (Operations Research 1980;28:406) has assumed, that a simple (knapsack-type) localization of an original optimal solution is known. Since then various extensions of Zipkin's bound have been proposed, but under the same assumption. A method to compute the bounds for variable aggregation for convex problems, based on general localization of the original solution is proposed. For some classes of the original problem it is shown how to construct the localization. Examples are given to illustrate the main constructions and a small numerical study is presented.

Using error bounds to compare aggregated generalized transportation models

A comparative study of aggregation error bounds for the generalized transportation problem is presented. A priori and a posteriori error bounds were derived and a computational study was performed to (a) test the correlation between the a priori, the a posteriori, and the actual error and (b) quantify the difference of the error bounds from the actual error. Based on the results we conclude that calculating the a priori error bound can be considered as a useful strategy to select the appropriate aggregation level. The a posteriori error bound provides a good quantitative measure of the actual error.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bounds on contact interactions from LEP1 data and high-Q2 HERA events

A contact four-fermion interaction between light quarks and electrons has been evoked as a possible explanation for the excess of events observed by HERA at high-Q2. We explore the 1-loop effects of such interaction in Γ(Z0 → e+e-) measured at LEP and impose strong bounds on the lower limit of the effective scale. Our results are able to discard some of the contact interactions as possible explanation for the HERA events. © 1997 Elsevier Science B.V.

Bounds on Higgs and gauge-boson interactions from LEP2 data

We derive bounds on Higgs and gauge-boson anomalous interactions using the LEP2 data on the production of three photons and photon pairs in association with hadrons. In the framework of SU(2)L ⊗ U(1)Y effective Lagrangians, we examine all dimension-six operators that lead to anomalous Higgs interactions involving γ and Z. The search for Higgs boson decaying to γγ pairs allow us to obtain constrains on these anomalous couplings that are comparable with the ones originating from the analysis of pp̄ collisions at the Tevatron. Our results also show that if the coefficients of all blind operators are assumed to have the same magnitude, the indirect constraints on the anomalous couplings obtained from this analysis, for Higgs masses MH ≲ 140 GeV, are more restrictive than the ones coming from the W+W- production. © 1998 Elsevier Science B.V. All rights reserved.

APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bounds for the zeros of symmetric kravchuk polynomials

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Bounds on effective interactions from the reaction e+e--->gama gama at LEP

We establish bounds on the mass scale of effective interactions between fermions and photons using the OPAL data for the reaction e+e-→γγ at √s=91.22 GeV.

Lorentz violation bounds on Bhabha scattering

We investigate the effect of Lorentz-violating terms on Bhabha scattering in two distinct cases correspondent to vectorial and axial nonminimal couplings in quantum electrodynamics ( QED). In both cases, we find significant modifications with respect to the usual relativistic result. Our results reveal an anisotropy of the differential cross section which implies new constraints on the possible Lorentz-violating terms.

Error Upper Bounds for a Computational Method for Nonlinear Boundary and Initial-Value Problems

This work develops a computational approach for boundary and initial-value problems by using operational matrices, in order to run an evolutive process in a Hilbert space. Besides, upper bounds for errors in the solutions and in their derivatives can be estimated providing accuracy measures.

Mutual Information Rate and Bounds for It

The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.

Present bounds on new neutral vector resonances from electroweak gauge boson pair production at the LHC

Several extensions of the standard model predict the existence of new neutral spin-1 resonances associated with the electroweak symmetry breaking sector. Using the data from ATLAS (with integrated luminosity of L = 1.02 fb(-1)) and CMS (with integrated luminosity of L = 1.55 fb(-1)) on the production of W+W- pairs through the process pp --> l(+)l(-)' is not an element of(T), we place model independent bounds on these new vector resonances masses, couplings, and widths. Our analyses show that the present data exclude new neutral vector resonances with masses up to 1-2.3 TeV depending on their couplings and widths. We also demonstrate how to extend our analysis framework to different models with a specific example.

Bounds on the density of sources of ultra-high energy cosmic rays from the Pierre Auger Observatory

We derive lower bounds on the density of sources of ultra-high energy cosmic rays from the lack of significant clustering in the arrival directions of the highest energy events detected at the Pierre Auger Observatory. The density of uniformly distributed sources of equal intrinsic intensity was found to be larger than ~(0.06 - 5) × '10 POT. -4' 'Mpc POT. -3' at 95% CL, depending on the magnitude of the magnetic deflections. Similar bounds, in the range (0.2 - 7) × '10 POT. -4' 'Mpc POT. -3', were obtained for sources following the local matter distribution.

High precision swept volume approximation with conservative error bounds

In technical design processes in the automotive industry, digital prototypes rapidly gain importance, because they allow for a detection of design errors in early development stages. The technical design process includes the computation of swept volumes for maintainability analysis and clearance checks. The swept volume is very useful, for example, to identify problem areas where a safety distance might not be kept. With the explicit construction of the swept volume an engineer gets evidence on how the shape of components that come too close have to be modified.rnIn this thesis a concept for the approximation of the outer boundary of a swept volume is developed. For safety reasons, it is essential that the approximation is conservative, i.e., that the swept volume is completely enclosed by the approximation. On the other hand, one wishes to approximate the swept volume as precisely as possible. In this work, we will show, that the one-sided Hausdorff distance is the adequate measure for the error of the approximation, when the intended usage is clearance checks, continuous collision detection and maintainability analysis in CAD. We present two implementations that apply the concept and generate a manifold triangle mesh that approximates the outer boundary of a swept volume. Both algorithms are two-phased: a sweeping phase which generates a conservative voxelization of the swept volume, and the actual mesh generation which is based on restricted Delaunay refinement. This approach ensures a high precision of the approximation while respecting conservativeness.rnThe benchmarks for our test are amongst others real world scenarios that come from the automotive industry.rnFurther, we introduce a method to relate parts of an already computed swept volume boundary to those triangles of the generator, that come closest during the sweep. We use this to verify as well as to colorize meshes resulting from our implementations.