Property (T)(T) for noncommutative universal lattices

We establish a new spectral criterion for Kazhdan's property $(T)$ which is applicable to a large class of discrete groups defined by generators and relations. As the main application, we prove property $(T)$ for the groups $EL_n(R)$, where $n\geq 3$ and $R$ is an arbitrary finitely generated associative ring. We also strengthen some of the results on property $(T)$ for Kac-Moody groups from a paper of Dymara and Januszkiewicz (Invent. Math 150 (2002)).Comment: 47 pages; final versio

R-parity Violation and General Soft Supersymmetry Breaking

We consider the most general class possible of soft supersymmetry breaking terms that can be added to the MSSM, with and without R-parity violation, consistent with the sole requirement that no quadratic divergences are induced. We renormalise the resulting theory through one loop and give an example of how a previously ignored term might affect the sparticle spectrum.Comment: 11 pages, 1 figure. Plain TeX, uses Harvmac (Big) and epsf. Added references and typo corrected (v2

New scalar resonances from sneutrino-Higgs mixing in supersymmetry with small lepton number (R-parity) violation

We consider new s-channel scalar exchanges in top quark and massive gauge-bosons pair production in e+e- collisions, in supersymmetry with a small lepton number violation. We show that a soft bilinear lepton number violating term in the scalar potential which mixes the Higgs and the slepton fields can give rise to a significant scalar resonance enhancement in e+e- -> ZZ, W+W- and in e+e- -> t t(bar). The sneutrino-Higgs mixed state couples to the incoming light leptons through its sneutrino component and to either the top quark or the massive gauge bosons through its Higgs component. Such a scalar resonance in these specific production channels cannot result from trilinear Yukawa-like R-parity violation alone, and may, therefore, stand as strong evidence for the existence of R-parity violating bilinears in the supersymmetric scalar potential. We use the LEP2 measurements of the WW and ZZ cross-sections to place useful constrains on this scenario, and investigate the expectations for the sensitivity of a future linear collider to these signals. We find that signals of these scalar resonances, in particular in top-pair production, are well within the reach of linear colliders in the small lepton number violation scenario.Comment: 22 pages in revtex, 10 figures embadded in the text using epsfi

Heavy Majorana Neutrinos in the Effective Lagrangian Description: Application to Hadron Colliders

We consider the effects of heavy Majorana neutrinos N with sub-TeV masses. We argue that the mere presence of these particles would be a signal of physics beyond the minimal seesaw mechanism and their interactions are, therefore, best described using an effective Lagrangian. We then consider the complete set of leading effective operators (up to dimension 6) involving the N and Standard Model fields and show that these interactions can be relatively easy to track at high-energy colliders. For example, we find that an exchange of a TeV-scale heavy vector field can yield thousands of characteristic same-sign lepton number violating l^+ l^+ j j events (j=light jet) at the LHC if m_N < 600 GeV, which can also have a distinctive forward-backward asymmetry signal; even the Tevatron has good prospects for this signature if m_N < 300 GeV.Comment: 4 pages, 1 figur

Strong solidity of group factors from lattices in SO(n,1) and SU(n,1)

We show that the group factors of ICC lattices in either SO(n,1) or SU(n,1), n \geq 2, are strongly solid in the sense of Ozawa and Popa. This strengthens a result of Ozawa and Popa showing that these factors do not have Cartan subalgebras

Tracking Target Signal Strengths on a Grid using Sparsity

Multi-target tracking is mainly challenged by the nonlinearity present in the measurement equation, and the difficulty in fast and accurate data association. To overcome these challenges, the present paper introduces a grid-based model in which the state captures target signal strengths on a known spatial grid (TSSG). This model leads to \emph{linear} state and measurement equations, which bypass data association and can afford state estimation via sparsity-aware Kalman filtering (KF). Leveraging the grid-induced sparsity of the novel model, two types of sparsity-cognizant TSSG-KF trackers are developed: one effects sparsity through $\ell_1$-norm regularization, and the other invokes sparsity as an extra measurement. Iterative extended KF and Gauss-Newton algorithms are developed for reduced-complexity tracking, along with accurate error covariance updates for assessing performance of the resultant sparsity-aware state estimators. Based on TSSG state estimates, more informative target position and track estimates can be obtained in a follow-up step, ensuring that track association and position estimation errors do not propagate back into TSSG state estimates. The novel TSSG trackers do not require knowing the number of targets or their signal strengths, and exhibit considerably lower complexity than the benchmark hidden Markov model filter, especially for a large number of targets. Numerical simulations demonstrate that sparsity-cognizant trackers enjoy improved root mean-square error performance at reduced complexity when compared to their sparsity-agnostic counterparts.Comment: Submitted to IEEE Trans. on Signal Processin

Opportunity Trajectory Reconstruction Techniques for Evaluation of ATC Systems

This paper describes some key points of a new tool being currently developed by Eurocontrol for the assessment of air traffic control (ATC) multisensor trackers performance. It summarizes the algorithmic foundations of the high-accuracy trajectory reconstruction process used to obtain reference trajectories from recorded measures. These trajectories will serve as a reference for the evaluation of the accuracy of ATC data processing centers. The performance of the system is illustrated with some reconstruction experiments on synthetic and real data

Automatic-dependent surveillance-broadcast experimental deployment using system wide information management

This paper describes an automatic-dependent surveillance-broadcast (ADS-B) implementation for air-to-air and ground-based experimental surveillance within a prototype of a fully automated air traffic management (ATM) system, under a trajectory-based-operations paradigm. The system is built using an air-inclusive implementation of system wide information management (SWIM). This work describes the relations between airborne and ground surveillance (SURGND), the prototype surveillance systems, and their algorithms. System's performance is analyzed with simulated and real data. Results show that the proposed ADS-B implementation can fulfill the most demanding surveillance accuracy requirements

The Need for New Search Strategies for Fourth Generation Quarks at the LHC

Most limits on the fourth generation heavy top quark (the t') are based on the assumed dominance of t' -> Wb, which is expected to be case in the minimal fourth generation framework with a single Higgs (the so called SM4). Here we show, within a variant of a Two Higgs Doublet Model with four generations of fermions, that, in general, a different t' detection strategy is required if the physics that underlies the new heavy fermionic degrees of freedom goes beyond the "naive" SM4. We find that the recent CMS lower bounds: m_{t'}< 450 GeV in the semi-leptonic channel pp -> t't' -> l\nu qqbb and m_{t'}< 557 GeV in the dilepton channel pp -> t't' ->ll\nu \nu bb, that were obtained using the customary (SM4-driven) detection strategies, do not apply. In particular, we demonstrate that if the decay t' -> ht dominates, then applying the "standard" CMS search tools leads to a considerably relaxed lower bound: m_{t'} >~350 GeV. We, therefore, suggest an alternative search strategy that is more sensitive to beyond SM4 dynamics of the fourth generation fermions.Comment: 12 pages, 8 figure

A Software System Development Life Cycle Model for Improved Stakeholders’ Communication and Collaboration

Software vendors and entrepreneurs, who try to introduce an innovative software product to a specific organization or an entire market, enter a long and tedious process. During this process, the market and various organizations evaluate the product from different perspectives, such as software robustness, manufacturer reliability, and corporate need for the product. The vendors and entrepreneurs engaged in this process encounter decision crossroads for which no relevant guidance exists in the literature. The research closely monitored the processes associated with the introduction and assimilation of an innovative off-the-shelf (OTS) software product into five different organizations in different vertical market segments. Observations were carried out to assess organizational and marketing processes and to document and analyze what the software product undergoes before it is accepted for acquisition or full implementation within the organization. The research outcomes offer a unified, collaborative multi-tier System Development Life Cycle (SDLC) framework and methodology for packaged OTS software products that greatly improves communication and collaboration among the stakeholders. Each tier addresses a different force or stakeholder involved in the software market: vendor, customer, consultants and integrators. All stakeholders refer to the same time-line thus; tasks of various stakeholders are streamlined. Adherence to the unified time-line brings about an increased amount of stakeholder interaction, communication and collaboration. Newly found tasks that improve communication and collaboration among stakeholders include (1) offering of the OTS software product together with personnel as a bundle, (2) an improvisation-intensive iterative task of weaving potential customers’ requirements into the prototype, and (3) a third sale milestone, representing the successful diffusion of the product. The significance of this interdisciplinary research stems from its unique position at a crossroad between software engineering, marketing, and business administration, which has not yet been sufficiently explored or cultivated