2,300 research outputs found
Tomographic Studies of the sQGP
Azimuthal correlation functions are used to study jet- and di-jet properties
as a function of centrality in Au+Au collisions at =200
GeV. Utilizing a novel technique to decompose the correlation function into a
(di-)jet and an underlying event, the jet-pair distribution is extracted and
compared to similar results for d+Au collisions obtained at the same collision
energy. A striking similarity is observed between the widths and associated
yields of the (di-)jet distributions for d+Au and peripheral Au+Au collisions.
By contrast, the distributions for mid-central Au+Au collisions indicate an
increase in the di-jet yield with centrality, and a very broad away-side jet
having a possible minimum at . These features point to
significant medium induced modification to the away-side jet and are compatible
with recent predictions of jet-induced "conical flow".Comment: Proc. 21st. Winter Workshop on Nuclear Dynamic
Determination of traffic noise nuisance as a function of traffic type and density in a heavily populated area
On the basis of a study including noise level measurements during the day and night and 1125 interviews with residents, it was found that railway noise creates less of a disturbance than street traffic noise. By far the largest majority of respondents experienced the greatest disturbance during the day. The difference in nuisance decreases as noise level rises
Optimal Scheduling Using Branch and Bound with SPIN 4.0
The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how to apply the new PROMELA primitives of SPIN 4.0 to search effectively for the optimal solution. We show how Branch-and-Bound techniques can be added to the LTL property that is used to find the solution. The LTL property is dynamically changed during the verification. We also show how the syntactical reordering of statements and/or processes in the PROMELA model can improve the search even further. The techniques are illustrated using two running examples: the Travelling Salesman Problem and a job-shop scheduling problem
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is
introduced as a promising application area for answer set programming. As the
model of asynchronous systems a generalisation of communicating automata,
1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a
requirement on the behaviour of the net can be translated into a logic program
such that the bounded model checking problem for the net can be solved by
computing stable models of the corresponding program. The use of the stable
model semantics leads to compact encodings of bounded reachability and deadlock
detection tasks as well as the more general problem of bounded model checking
of linear temporal logic. Correctness proofs of the devised translations are
given, and some experimental results using the translation and the Smodels
system are presented.Comment: 32 pages, to appear in Theory and Practice of Logic Programmin
Condensate density and superfluid mass density of a dilute Bose gas near the condensation transition
We derive, through analysis of the structure of diagrammatic perturbation
theory, the scaling behavior of the condensate and superfluid mass density of a
dilute Bose gas just below the condensation transition. Sufficiently below the
critical temperature, , the system is governed by the mean field
(Bogoliubov) description of the particle excitations. Close to , however,
mean field breaks down and the system undergoes a second order phase
transition, rather than the first order transition predicted in Bogoliubov
theory. Both condensation and superfluidity occur at the same critical
temperature, and have similar scaling functions below , but
different finite size scaling at to leading order in the system size.
Through a simple self-consistent two loop calculation we derive the critical
exponent for the condensate fraction, .Comment: 4 page
Security Attributes Based Digital Rights Management
Most real-life systems delegate responsibilities to different authorities. We apply this model to a digital rights management system, to achieve flexible security. In our model a hierarchy of authorities issues certificates that are linked by cryptographic means. This linkage establishes a chain of control, identity-attribute-rights, and allows flexible rights control over content. Typical security objectives, such as identification, authentication, authorization and access control can be realised. Content keys are personalised to detect illegal super distribution. We describe a working prototype, which we develop using standard techniques, such as standard certificates, XML and Java. We present experimental results to evaluate the scalability of the system. A formal analysis demonstrates that our design is able to detect a form of illegal super distribution
Approximating properties of linear models for input output descriptions
Pade approximations for linear and dynamic programming using Markov processes and new algorithm
Using two- and Three-particle correlations to probe strongly interacting partonic matter
The latest two- and three-particle correlation measurements obtained by the
PHENIX collaboration are presented. Three-particle correlations are consistent
with the presence of conical emission patterns in the data. Two-particle
correlations relative to the collision geometry reveal strong shape and yield
modifications of the away-side jet, that depend on the orientation of the
trigger particle with respect to the event plane. A difference in the geometry
dependence of the per trigger yields in the regions around and can be understood by a different
geometry dependence of jet energy loss and the medium response to the deposited
energy.Comment: 4 pages, 3 figures - To appear in the conference proceedings for
Quark Matter 2009, March 30 - April 4, Knoxville, Tennesse
Directed Explicit Model Checking with HSF-SPIN
We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols
- …