470 resultados para Acoplamento bilinear


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the collider phenomenology of bilinear R-parity violating supergravity, the simplest effective model for supersymmetric neutrino masses accounting for the current neutrino oscillation data. At the CERN Large Hadron Collider the center-of-mass energy will be high enough to probe directly these models through the search for the superpartners of the Standard Model (SM) particles. We analyze the impact of R-parity violation on the canonical supersymmetry searches-that is, we examine how the decay of the lightest supersymmetric particle (LSP) via bilinear R-parity violating interactions degrades the average expected missing momentum of the reactions and show how this diminishes the reach in the usual channels for supersymmetry searches. However, the R-parity violating interactions lead to an enhancement of the final states containing isolated same-sign di-leptons and trileptons, compensating the reach loss in the fully inclusive channel. We show how the searches for displaced vertices associated to LSP decay substantially increase the coverage in supergravity parameter space, giving the corresponding reaches for two reference luminosities of 10 and 100 fb(-1) and compare with those of the R-parity conserving minimal supergravity model.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate a neutrino mass model in which the neutrino data is accounted for by bilinear R-parity violating supersymmetry with anomaly mediated supersymmetry breaking. We focus on the CERN Large Hadron Collider (LHC) phenomenology, studying the reach of generic supersymmetry search channels with leptons, missing energy and jets. A special feature of this model is the existence of long-lived neutralinos and charginos which decay inside the detector leading to detached vertices. We demonstrate that the largest reach is obtained in the displaced vertices channel and that practically all of the reasonable parameter space will be covered with an integrated luminosity of 10 fb(-1). We also compare the displaced vertex reaches of the LHC and Tevatron.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pós-graduação em Física - IFT

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Patente de invenção de um suporte para acoplamento e tração de cadeira de rodas mecanomanual que compreende um primeiro módulo (10) que inclui uma estrutura simplificada capaz de instalação em diversos modelos de cadeira de rodas mecanomanuais (100) e um segundo módulo (20) que inclui um equipamento automotor acoplado ao primeiro módulo (10) de forma rápida e segura pelo próprio usuário controlado por um microcontrolador dotado de um sistema de controle PWM que gera um sinal eletrônico transmitido pelo microcontrolador ao driver de potência e circuitos independentes reguladores de tensão para acionamento do motor (22), incluindo um acelerador indutivo instalado no guidão (25) cujo sinal analógico é convertido por um conversor analógico-digital (A/D) e encamnhiando ao microcontrolador.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pós-graduação em Física - FEG

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Arnold [V.I. Arnold, On matrices depending on parameters, Russian Math. Surveys 26 (2) (1971) 29-43] constructed miniversal deformations of square complex matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced by similarity transformations that smoothly depend on the entries of B. We construct miniversal deformations of matrices under congruence. (C) 2011 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.