Three jet events and new strong couplings at LEP and NLC

We study the effects of new dimension-6 operators, resulting from a general SU(3)C ⊗ SU(2)L ⊗ U(1)Y invariant effective Lagrangian, on three jet production at LEP and at the Next Linear Collider. Contributions to the total event rate and to some event shape variables are analysed in order to establish bounds on these operators. © 1999 Elsevier Science B.V. All rights reserved.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Indirect constraints on the triple gauge boson couplings from Z → bb partial width: An update

We update the indirect bounds on anomalous triple gauge couplings coming from the non-universal one-loop contributions to the Z → bb width. These bounds, which are independent of the Higgs boson mass, are in agreement with the standard model predictions for the gauge boson self-couplings since the present value of R(b) agrees fairly well with the theoretical estimates. Moreover, these indirect constraints on Δg(Z)/1 and g(Z)/5 are most stringent than the present direct bounds on these quantities, while the indirect limit on λ(Z) is weaker than the available experimental data.

Constraining models with superlight gravitino, scalar and pseudoscalar particles

In some supergravity models there are light weakly coupled scalar (S)-and pseudoscalar (P) particles. These particles arise following a superlight gravitino. In these models the decay SIP → γγ exists. We examine constraints on this process considering these photons as responsible by the extragalactic background light. We also consider the amount of SIP particles produced through the fusion of the cosmic background photons and contributing to the effective number of light neutrino species during primordial nucleosynthesis. We obtain bounds on the gravitino mass complementary to the existing ones.

Lower bound to the mass of a relativistic three-boson system in the lightcone

The lower bound masses of the ground-state relativistic three-boson system in 1 + 1, 2 + 1 and 3 + 1 spacetime dimensions are obtained. We have considered a reduction of the ladder Bethe-Salpeter equation to the lightfront in a model with renormalized two-body contact interaction. The lower bounds are deduced with the constraint of reality of the two-boson subsystem mass. It is verified that, in some cases, the lower bound approaches the ground-state binding energy. The corresponding non-relativistic limits are also verified.

Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.

New limits on doubly charged bileptons from CERN LEP data and the search at future electron-positron and electron-photon colliders

We show that the accumulated CERN LEP-II data taken at √s = 130-206 GeV can establish more restrictive bounds on doubly charged bilepton couplings and masses than any other experiment so far. We also analyze the discovery potential of a prospective linear collider operating in both e+e- and e γ modes.

Final state and thermodynamics of a dark energy universe

As it follows from the classical analysis, the typical final state of a dark energy universe where a dominant energy condition is violated is a finite-time, sudden future singularity (a big rip). For a number of dark energy universes (including scalar phantom and effective phantom theories as well as specific quintessence models) we demonstrate that quantum effects play the dominant role near a big rip, driving the universe out of a future singularity (or, at least, moderating it). As a consequence, the entropy bounds with quantum corrections become well defined near a big rip. Similarly, black hole mass loss due to phantom accretion is not so dramatic as was expected: masses do not vanish to zero due to the transient character of the phantom evolution stage. Some examples of cosmological evolution for a negative, time-dependent equation of state are also considered with the same conclusions. The application of negative entropy (or negative temperature) occurrence in the phantom thermodynamics is briefly discussed.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

A decomposition heuristic for the maximal covering location problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature. © 2010 Edson Luiz França Senne et al.

Estabilização de sistemas fuzzy T-S incertos usando realimenta̧ão derivativa

In some practical problems, for instance, in the suppression of vibration in mechanical systems, the state-derivative signals are easier to obtain than the state signals. Thus, a method for state-derivative feedback design applied to uncertain nonlinear systems is proposed in this work. The nonlinear systems are represented by Takagi-Sugeno fuzzy models during the modeling of the problem, allowing to use Linear Matrix Inequalities (LMIs) in the controller design. This type of modeling ease the control design, because, LMIs are easily solved using convex programming technicals. The control design aimed at system stabilisation, with or without bounds on decay rate. The efficiency of design procedure is illustrated through a numerical example.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

A search for a doubly-charged Higgs boson in pp collisions at √s=7 TeV

A search for a doubly-charged Higgs boson in pp collisions at √s=7 TeV is presented. The data correspond to an integrated luminosity of 4. 9 fb-1, collected by the CMS experiment at the LHC. The search is performed using events with three or more isolated charged leptons of any flavor, giving sensitivity to the decays of pair-produced triplet components Φ++Φ--, and Φ++Φ- from associated production. No excess is observed compared to the background prediction, and upper limits at the 95 % confidence level are set on the Φ++ production cross section, under specific assumptions on its branching fractions. Lower bounds on the Φ++ mass are reported, providing significantly more stringent constraints than previously published limits. © 2012 CERN for the benefit of the CMS collaboration.

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.