Centrality and Transverse Momentum Dependence of Elliptic Flow of Multistrange Hadrons and ϕ Meson in Au + Au Collisions at √ sNN = 200 GeV

We present high precision measurements of elliptic flow near midrapidity (|y|\u3c1.0) for multistrange hadrons and ϕ meson as a function of centrality and transverse momentum in Au+Au collisions at center of mass energy √sNN=200 GeV. We observe that the transverse momentum dependence of ϕ and Ω v2 is similar to that of π and p, respectively, which may indicate that the heavier strange quark flows as strongly as the lighter up and down quarks. This observation constitutes a clear piece of evidence for the development of partonic collectivity in heavy-ion collisions at the top RHIC energy. Number of constituent quark scaling is found to hold within statistical uncertainty for both 0%–30% and 30%–80% collision centrality. There is an indication of the breakdown of previously observed mass ordering between ϕ and proton v2 at low transverse momentum in the 0%–30% centrality range, possibly indicating late hadronic interactions affecting the proton v2

Jet-like Correlations with Direct-Photon and Neutral-Pion Triggers at sNN=200 GeV

Azimuthal correlations of charged hadrons with direct-photon (γdir) and neutral-pion (π0) trigger particles are analyzed in central Au+Au and minimum-bias p + p collisions at √sN N = 200 GeV in the STAR experiment. The charged-hadron per-trigger yields at mid-rapidity from central Au+Au collisions are compared with p + p collisions to quantify the suppression in Au+Au collisions. The suppression of the away-side associated-particle yields per γdir trigger is independent of the transverse momentum of the trigger particle (ptrig T ), whereas the suppression is smaller at low transverse momentum of the associated charged hadrons (passoc T ). Within uncertainty, similar levels of suppression are observed for γdir and π0 triggers as a function of zT (≡ passoc T /ptrig T ). The results are compared with energy-lossinspired theoretical model predictions. Our studies support previous conclusions that the lost energy reappears predominantly at low transverse momentum, regardless of the trigger energy

engineering approach to atomic transaction verification: use of a simple object model to achieve semantics-based reasoning at compile-time

In this paper, we take an engineering approach to atomic transaction verification. We discuss the design and implementation of a verification tool that can reason about the semantics of atomic database operations. To bridge the gap between language design and automated reasoning, we make use of a simple model of objects that imitates the type-tagged memory structure of an implementation. This simple model is sufficient to describe the operational semantics of the typical features of an object-oriented database programming language, such as bounded iteration, heterogeneity, object creation, and nil values. The same model lends itself to automated reasoning with a theorem prover system. We are thus able to apply theorem prover technology to verification problems that address transaction semantics. The work has applications in the areas of transaction safety, semantics-based concurrency control, and cooperative work. The approach is illustrated by a graph editing example, with heterogeneous node structures

Compensation methods to support generic graph editing: A case study in automated verification of schema requirements for an advanced transaction model

Compensation plays an important role in advanced transaction models, cooperative work, and workflow systems. However, compensation operations are often simply written as a^−1 in transaction model literature. This notation ignores any operation parameters, results, and side effects. A schema designer intending to use an advanced transaction model is expected (required) to write correct method code. However, in the days of cut-and-paste, this is much easier said than done. In this paper, we demonstrate the feasibility of using an off-the-shelf theorem prover (also called a proof assistant) to perform automated verification of compensation requirements for an OODB schema. We report on the results of a case study in verification for a particular advanced transaction model that supports cooperative applications. The case study is based on an OODB schema that provides generic graph editing functionality for the creation, insertion, and manipulation of nodes and links

Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming

Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications including decoding error correcting codes and solving constraint satisfaction and inference problems. BP-based algorithms operate over graph representations, called factor graphs, that are used to model the input. Although in many cases BP-based algorithms exhibit impressive empirical results, not much has been proved when the factor graphs have cycles. This work deals with packing and covering integer programs in which the constraint matrix is zero-one, the constraint vector is integral, and the variables are subject to box constraints. We study the performance of the min-sum algorithm when applied to the corresponding factor graph models of packing and covering LPs. We compare the solutions computed by the min-sum algorithm for packing and covering problems to the optimal solutions of the corresponding linear programming (LP) relaxations. In particular, we prove that if the LP has an optimal fractional solution, then for each fractional component, the min-sum algorithm either computes multiple solutions or the solution oscillates below and above the fraction. This implies that the min-sum algorithm computes the optimal integral solution only if the LP has a unique optimal solution that is integral. The converse is not true in general. For a special case of packing and covering problems, we prove that if the LP has a unique optimal solution that is integral and on the boundary of the box constraints, then the min-sum algorithm computes the optimal solution in pseudo-polynomial time. Our results unify and extend recent results for the maximum weight matching problem by [Sanghavi et al.,'2011] and [Bayati et al., 2011] and for the maximum weight independent set problem [Sanghavi et al.'2009]