Multiplicity fluctuations in heavy-ion collisions using canonical and grand-canonical ensemble

We report the higher order cumulants and their ratios for baryon, charge and strangeness multiplicity in canonical and grand-canonical ensembles in ideal thermal model including all the resonances. When the number of conserved quanta is small, an explicit treatment of these conserved charges is required, which leads to a canonical description of the system and the fluctuations are significantly different from the grand canonical ensemble. Cumulant ratios of total charge and net-charge multiplicity as a function of collision energies are also compared in grand canonical ensemble.Comment: 7 pages, 5 Figs, Published versio

Oscillatory Tunnel Splittings in Spin Systems: A Discrete Wentzel-Kramers-Brillouin Approach

Certain spin Hamiltonians that give rise to tunnel splittings that are viewed in terms of interfering instanton trajectories, are restudied using a discrete WKB method, that is more elementary, and also yields wavefunctions and preexponential factors for the splittings. A novel turning point inside the classically forbidden region is analysed, and a general formula is obtained for the splittings. The result is appled to the \Fe8 system. A previous result for the oscillation of the ground state splitting with external magnetic field is extended to higher levels.Comment: RevTex, one ps figur

CONFLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code

We present an instrumenting compiler for enforcing data confidentiality in low-level applications (e.g. those written in C) in the presence of an active adversary. In our approach, the programmer marks secret data by writing lightweight annotations on top-level definitions in the source code. The compiler then uses a static flow analysis coupled with efficient runtime instrumentation, a custom memory layout, and custom control-flow integrity checks to prevent data leaks even in the presence of low-level attacks. We have implemented our scheme as part of the LLVM compiler. We evaluate it on the SPEC micro-benchmarks for performance, and on larger, real-world applications (including OpenLDAP, which is around 300KLoC) for programmer overhead required to restructure the application when protecting the sensitive data such as passwords. We find that performance overheads introduced by our instrumentation are moderate (average 12% on SPEC), and the programmer effort to port OpenLDAP is only about 160 LoC.Comment: Technical report for CONFLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code, appearing at EuroSys 201