Case study of the uniaxial anisotropic spin-1 bilinear-biquadratic Heisenberg model on a triangular lattice

We study the spin-1 model on a triangular lattice in the presence of a uniaxial anisotropy field using a cluster mean-field (CMF) approach. The interplay among antiferromagnetic exchange, lattice geometry, and anisotropy forces Gutzwiller mean-field approaches to fail in a certain region of the phase diagram. There, the CMF method yields two supersolid phases compatible with those present in the spin-1/2 XXZ model onto which the spin-1 system maps. Between these two supersolid phases, the three-sublattice order is broken and the results of the CMF approach depend heavily on the geometry and size of the cluster. We discuss the possible presence of a spin liquid in this region.

Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powers

In this paper we present error analysis for a Monte Carlo algorithm for evaluating bilinear forms of matrix powers. An almost Optimal Monte Carlo (MAO) algorithm for solving this problem is formulated. Results for the structure of the probability error are presented and the construction of robust and interpolation Monte Carlo algorithms are discussed. Results are presented comparing the performance of the Monte Carlo algorithm with that of a corresponding deterministic algorithm. The two algorithms are tested on a well balanced matrix and then the effects of perturbing this matrix, by small and large amounts, is studied.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

Probing bilinear R-parity violating supergravity at the LHC

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.

Tridiagonal canonical matrices of bilinear or sesquilinear forms and of pairs of symmetric, skew-symmetric, or Hermitian forms

Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field of characteristic different from 2. (C) 2008 Elsevier Inc. All rights reserved.

A strong provably secure IBE scheme without bilinear map

Identity-based encryption (IBE) allows one party to send ciphered messages to another using an arbitrary identity string as an encryption key. Since IBE does not require prior generation and distribution of keys, it greatly simplifies key management in public-key cryptography. According to the Menezes-Okamoto-Vanstone (MOV) reduction theory, the IBE scheme based on bilinear map loses the high efficiency of elliptic curve because of the requirement of large security parameters. Therefore, it is important to build a provably secure IBE scheme without bilinear map. To this end, this paper proposes an improved IBE scheme that is different from the previous schemes because this new scheme does not use symmetric encryption algorithm. Furthermore, it can be proven to be secure against adaptively chosen identity and chosen plaintext attacks in the standard model. Elaborated security and performance analysis demonstrate that this new scheme outperforms the previous ones in terms of the time complexity for encryption and decryption.

Controle preditivo bilinear aplicado a um motor de indução

The present work is based on the applied bilinear predictive control applied to an induction motor. As in particular case of the technique based on predictive control in nonlinem systems, these have desperted great interest, a time that present the advantage of being simpler than the non linear in general and most representative one than the linear one. One of the methods, adopted here, uses the linear model "quasi linear for step of time" based in Generalized Predictive Control. The modeling of the induction motor is made by the Vectorial control with orientation given for the indirect rotor. The system is formed by an induction motor of 3 cv with rotor in squirregate, set in motion for a group of benches of tests developed for this work, presented resulted for a variation of +5% in the value of set-point and for a variation of +10% and -10% in the value of the applied nominal load to the motor. The results prove a good efficiency of the predictive bilinear controllers, then compared with the linear cases

Estudo e implementação de um controlador preditivo generalizado bilinear compensado adaptativo

The present work presents the study and implementation of an adaptive bilinear compensated generalized predictive controller. This work uses conventional techniques of predictive control and includes techniques of adaptive control for better results. In order to solve control problems frequently found in the chemical industry, bilinear models are considered to represent the dynamics of the studied systems. Bilinear models are simpler than general nonlinear model, however it can to represent the intrinsic not-linearities of industrial processes. The linearization of the model, by the approach to time step quasilinear , is used to allow the application of the equations of the generalized predictive controller (GPC). Such linearization, however, generates an error of prediction, which is minimized through a compensation term. The term in study is implemented in an adaptive form, due to the nonlinear relationship between the input signal and the prediction error.Simulation results show the efficiency of adaptive predictive bilinear controller in comparison with the conventional.

Efeito Kerr magneto-óptico; Ressonância ferromagnética; Acoplamento bilinear; Acoplamento biquadrático

In this work, we investigated the magnetic properties of a monocrystalline Fe thin film and of Fe(80 Å)/Cr(t)/Fe(80 Å) tri-layers, with the nonmagnetic metallic Cr spacer layer thickness varying between 9 Å < t < 40 Å. The samples were deposited by the DC Sputtering on Magnesium Oxide (MgO) substrates, with (100) crystal orientation. For this investigation, experimental magneto-optical Kerr effect (MOKE) magnetometry and ferromagnetic resonance (FMR) techniques were employeed. In this case, these techniques allowed us to study the static and dynamical magnetization properties of our tri-layers. The experimental results were interpreted based on the phenomenological model that takes into account the relevant energy terms to the magnetic free energy to describe the system behavior. In the case of the monocrystalline Fe film, we performed an analytical discussion on the magnetization curves and developed a numerical simulation based on the Stoner-Wohlfarth model, that enables the numerical adjustment of the experimental magnetization curves and obtainment of the anisotropy field values. On the other hand, for the tri-layers, we analyzed the existence of bilinear and biquadratic couplings between the magnetizations of adjacent ferromagnetic layers from measurements of magnetization curves. With the FMR fields and line width angular dependencies, information on the anisotropy in three layers was obtained and the effects of different magnetic relaxation mechanisms were evidenced. It was also possible to observe the dependence of the epitaxy of the multilayers with growth and sputtering parameters. Additionally it was developed the technique of AC magnetic susceptibility in order to obtain further information during the investigation of magnetic thin films

Probing bilinear R-parity violating supergravity at the LHC

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.

CERN LHC signals for a neutrino mass model with bilinear R-parity violating minimal anomaly mediated supersymmetry

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.

Probing neutralino properties in minimal supergravity with bilinear R-parity violation

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

Miniversal deformations of matrices of bilinear forms

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.

An integer linear programming approach for bilinear integer programming

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.