Search for scalar leptoquarks and T-odd quarks in the acoplanar jet topology using 2.5 fb(-1) of p(p)over-bar collision data at root s=1.96 TeV

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

Search for scalar neutrino superpartners in e+mu final states in p(p)over-bar collisions at root s=1.96 TeV

We report a search for R-parity-violating production and decay of sneutrino particles in the e mu final state with 1.04 +/- 0.06 fb(-1) of data collected with the D(0) detector at the Fermilab Tevatron Collider in 2002-2006. Good agreement between the data and the standard model prediction is observed. With no evidence for new physics, we set limits on the R-parity-violating couplings lambda'(311) and lambda(312) as a function of the sneutrino mass.

Search for scalar neutrino superpartners in e+mu final states in p(p)over-bar collisions at root s=1.96 TeV

We report a search for R-parity-violating production and decay of sneutrino particles in the eμ final state with 1.04±0.06fb-1 of data collected with the D0 detector at the Fermilab Tevatron Collider in 2002-2006. Good agreement between the data and the standard model prediction is observed. With no evidence for new physics, we set limits on the R-parity-violating couplings λ311′ and λ312 as a function of the sneutrino mass. © 2008 The American Physical Society.

Existence of solutions for p(x)-Laplacian problems on a bounded domain

In this paper we study the following p(x)-Laplacian problem: -div(a(x)&VERBAR;&DEL; u&VERBAR;(p(x)-2)&DEL; u)+b(x)&VERBAR; u&VERBAR;(p(x)-2)u = f(x, u), x ε &UOmega;, u = 0, on &PARTIAL; &UOmega;, where 1< p(1) &LE; p(x) &LE; p(2) < n, &UOmega; &SUB; R-n is a bounded domain and applying the mountain pass theorem we obtain the existence of solutions in W-0(1,p(x)) for the p(x)-Laplacian problems in the superlinear and sublinear cases. © 2004 Elsevier Inc. All rights reserved.

Scalar connectivity measures from fast-marching tractography reveal heritability of white matter architecture

Recent advances in diffusion-weighted MRI (DWI) have enabled studies of complex white matter tissue architecture in vivo. To date, the underlying influence of genetic and environmental factors in determining central nervous system connectivity has not been widely studied. In this work, we introduce new scalar connectivity measures based on a computationally-efficient fast-marching algorithm for quantitative tractography. We then calculate connectivity maps for a DTI dataset from 92 healthy adult twins and decompose the genetic and environmental contributions to the variance in these metrics using structural equation models. By combining these techniques, we generate the first maps to directly examine genetic and environmental contributions to brain connectivity in humans. Our approach is capable of extracting statistically significant measures of genetic and environmental contributions to neural connectivity.

Search for the Production of Scalar Bottom Quarks in pp̅ Collisions at √s=1.96 TeV

We report on a search for direct scalar bottom quark (sbottom) pair production in $p \bar{p}$ collisions at $\sqrt{s}=1.96$~TeV, in events with large missing transverse energy and two jets of hadrons in the final state, where at least one of the jets is required to be identified as originating from a $b$ quark. The study uses a CDF Run~II data sample corresponding to 2.65~fb${}^{-1}$ of integrated luminosity. The data are in agreement with the standard model. In an R-parity conserving minimal supersymmetric scenario, and assuming that the sbottom decays exclusively into a bottom quark and a neutralino, 95$\%$ confidence-level upper limits on the sbottom pair production cross section of 0.1~pb are obtained. For neutralino masses below 70~GeV/$c^2$, sbottom masses up to 230~GeV/$c^2$ are excluded at 95$\%$ confidence level.

Top-spin analysis of new scalar and tensor interactions in e(+)e(-) collisions with beam polarization

We utilize top polarization in the process e(+)e(-) -> t (t) over bar at the International Linear Collider ( ILC) with transverse beam polarization to probe interactions of the scalar and tensor type beyond the standard model and to disentangle their individual contributions. Ninety percent confidence level limits on the interactions with realistic integrated luminosity are presented and are found to improve by an order of magnitude compared to the case when the spin of the top quark is not measured. Sensitivities of the order of a few times 10(-3) TeV-2 for real and imaginary parts of both scalar and tensor couplings at root s = 500 and 800 GeV with an integrated luminosity of 500 fb(-1) and completely polarized beams are shown to be possible. A powerful model-independent framework for inclusive measurements is employed to describe the spin-momentum correlations, and their C, P, and T properties are presented in a technical appendix.

Inelastic K+p reactions at incident momenta from 1.37 GeV/c to 2.17 GeV/c

A number of recent experiments have suggested the possibility of a highly inelastic resonance in K⁺p scattering. To study the inelastic K⁺p reactions, a 400 K exposure has been taken at the L.R.L. 25 inch bubble chamber. The data are spread over seven K⁺ momenta between 1.37 and 2.17 GeV/c.

Cross-sections have been measured for the reaction K⁺p → pK°π+ which is dominated by the quasi-two body channels K∆ and K*N. Both these channels are strongly peripheral, as at other momenta. The decay of the ∆ is in good agreement with the predictions of the rho-photon analogy of Stodolsky and Sakurai. The data on the K*p channel show evidence of both pseudo scalar and vector exchange.

Cross-sections for the final state pK⁺π+π- shows a strong contribution from the quasi-two body channel K*∆. This reaction is also very peripheral even at threshold. The decay angular distributions indicate the reaction is dominated as at higher momenta by a pion exchange mechanism. The data are also in good agreement with the quark model predictions of Bialas and Zalewski for the K* and ∆ decay.

FPGA montgomery modular multiplication architectures suitable for ECCs over GF(p)

New FPGA architectures for the ordinary Montgomery multiplication algorithm and the FIOS modular multiplication algorithm are presented. The embedded 18×18-bit multipliers and fast carry look-ahead logic located on the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions/subtractions required by these two algorithms. The architectures are developed for use in Elliptic Curve Cryptosystems over GF(p), which require modular field multiplication to perform elliptic curve point addition and doubling. Field sizes of 128-bits and 256-bits are chosen but other field sizes can easily be accommodated, by rapidly reprogramming the FPGA. Overall, the larger the word size of the multiplier, the more efficiently it performs in terms of area/time product. Also, the FIOS algorithm is flexible in that one can tailor the multiplier architecture is to be area efficient, time efficient or a mixture of both by choosing a particular word size. It is estimated that the computation of a 256-bit scalar point multiplication over GF(p) would take about 4.8 ms.

Hardware elliptic curve cryptographic processor over GF(p)

A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications. © 2006 IEEE.

Research-informed design, management and maintenance of infrastructure slopes: development of a multi-scalar approach

The UK’s transport infrastructure is one of the most heavily used in the world. The performance of these networks is critically dependent on the performance of cutting and embankment slopes which make up £20B of the £60B asset value of major highway infrastructure alone. The rail network in particular is also one of the oldest in the world: many of these slopes are suffering high incidents of instability (increasing with time). This paper describes the development of a fundamental understanding of earthwork material and system behaviour, through the systematic integration of research across a range of spatial and temporal scales. Spatially these range from microscopic studies of soil fabric, through elemental materials behaviour to whole slope modelling and monitoring and scaling up to transport networks. Temporally, historical and current weather event sequences are being used to understand and model soil deterioration processes, and climate change scenarios to examine their potential effects on slope performance in futures up to and including the 2080s. The outputs of this research are being mapped onto the different spatial and temporal scales of infrastructure slope asset management to inform the design of new slopes through to changing the way in which investment is made into aging assets. The aim ultimately is to help create a more reliable, cost effective, safer and more resilient transport system.

Laplacian eigenvectors and eigenvalues and almost equitable partitions

Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. © 2006 Elsevier Ltd. All rights reserved.