Determination of Freeze-out Conditions from Lattice QCD Calculations

Freeze-out conditions in Heavy Ion Collisions are generally determined by comparing experimental results for ratios of particle yields with theoretical predictions based on applications of the Hadron Resonance Gas model. We discuss here how this model dependent determination of freeze-out parameters may eventually be replaced by theoretical predictions based on equilibrium QCD thermodynamics.Comment: presented at the International Conference "Critical Point and Onset of Deconfinement - CPOD 2011", Wuhan, November 7-11, 201

Running a Production Grid Site at the London e-Science Centre

This paper describes how the London e-Science Centre cluster MARS, a production 400+ Opteron CPU cluster, was integrated into the production Large Hadron Collider Compute Grid. It describes the practical issues that we encountered when deploying and maintaining this system, and details the techniques that were applied to resolve them. Finally, we provide a set of recommendations based on our experiences for grid software development in general that we believe would make the technology more accessible. © 2006 IEEE

Local matching indicators for transport problems with concave costs

In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm

Emission lines of Fe XI in the 257--407 A wavelength region observed in solar spectra from EIS/Hinode and SERTS

Theoretical emission-line ratios involving Fe XI transitions in the 257-407 A wavelength range are derived using fully relativistic calculations of radiative rates and electron impact excitation cross sections. These are subsequently compared with both long wavelength channel Extreme-Ultraviolet Imaging Spectrometer (EIS) spectra from the Hinode satellite (covering 245-291 A), and first-order observations (235-449 A) obtained by the Solar Extreme-ultraviolet Research Telescope and Spectrograph (SERTS). The 266.39, 266.60 and 276.36 A lines of Fe XI are detected in two EIS spectra, confirming earlier identifications of these features, and 276.36 A is found to provide an electron density diagnostic when ratioed against the 257.55 A transition. Agreement between theory and observation is found to be generally good for the SERTS data sets, with discrepancies normally being due to known line blends, while the 257.55 A feature is detected for the first time in SERTS spectra. The most useful Fe XI electron density diagnostic is found to be the 308.54/352.67 intensity ratio, which varies by a factor of 8.4 between N_e = 10^8 and 10^11 cm^-3, while showing little temperature sensitivity. However, the 349.04/352.67 ratio potentially provides a superior diagnostic, as it involves lines which are closer in wavelength, and varies by a factor of 14.7 between N_e = 10^8 and 10^11 cm^-3. Unfortunately, the 349.04 A line is relatively weak, and also blended with the second-order Fe X 174.52 A feature, unless the first-order instrument response is enhanced.Comment: 9 pages, 5 figures, 13 tables; MNRAS in pres

Maximizing Maximal Angles for Plane Straight-Line Graphs

Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any two edges of $G$ that appear consecutively in the circular order of the edges incident to $p$. A plane straight-line graph is called $\phi$-open if each vertex has an incident angle of size at least $\phi$. In this paper we study the following type of question: What is the maximum angle $\phi$ such that for any finite set $S\subset\R^2$ of points in general position we can find a graph from a certain class of graphs on $S$ that is $\phi$-open? In particular, we consider the classes of triangulations, spanning trees, and paths on $S$ and give tight bounds in most cases.Comment: 15 pages, 14 figures. Apart of minor corrections, some proofs that were omitted in the previous version are now include

A Data Quality Framework for Process Mining of Electronic Health Record Data

Reliable research demands data of known quality. This can be very challenging for electronic health record (EHR) based research where data quality issues can be complex and often unknown. Emerging technologies such as process mining can reveal insights into how to improve care pathways but only if technological advances are matched by strategies and methods to improve data quality. The aim of this work was to develop a care pathway data quality framework (CP-DQF) to identify, manage and mitigate EHR data quality in the context of process mining, using dental EHRs as an example. Objectives: To: 1) Design a framework implementable within our e-health record research environments; 2) Scale it to further dimensions and sources; 3) Run code to mark the data; 4) Mitigate issues and provide an audit trail. Methods: We reviewed the existing literature covering data quality frameworks for process mining and for data mining of EHRs and constructed a unified data quality framework that met the requirements of both. We applied the framework to a practical case study mining primary care dental pathways from an EHR covering 41 dental clinics and 231,760 patients in the Republic of Ireland. Results: Applying the framework helped identify many potential data quality issues and mark-up every data point affected. This enabled systematic assessment of the data quality issues relevant to mining care pathways. Conclusion: The complexity of data quality in an EHR-data research environment was addressed through a re-usable and comprehensible framework that met the needs of our case study. This structured approach saved time and brought rigor to the management and mitigation of data quality issues. The resulting metadata is being used within cohort selection, experiment and process mining software so that our research with this data is based on data of known quality. Our framework is a useful starting point for process mining researchers to address EHR data quality concerns

From Physical to Cyber: Escalating Protection for Personalized Auto Insurance

Nowadays, auto insurance companies set personalized insurance rate based on data gathered directly from their customers' cars. In this paper, we show such a personalized insurance mechanism -- wildly adopted by many auto insurance companies -- is vulnerable to exploit. In particular, we demonstrate that an adversary can leverage off-the-shelf hardware to manipulate the data to the device that collects drivers' habits for insurance rate customization and obtain a fraudulent insurance discount. In response to this type of attack, we also propose a defense mechanism that escalates the protection for insurers' data collection. The main idea of this mechanism is to augment the insurer's data collection device with the ability to gather unforgeable data acquired from the physical world, and then leverage these data to identify manipulated data points. Our defense mechanism leveraged a statistical model built on unmanipulated data and is robust to manipulation methods that are not foreseen previously. We have implemented this defense mechanism as a proof-of-concept prototype and tested its effectiveness in the real world. Our evaluation shows that our defense mechanism exhibits a false positive rate of 0.032 and a false negative rate of 0.013.Comment: Appeared in Sensys 201

The Methods to Improve Quality of Service by Accounting Secure Parameters

A solution to the problem of ensuring quality of service, providing a greater number of services with higher efficiency taking into account network security is proposed. In this paper, experiments were conducted to analyze the effect of self-similarity and attacks on the quality of service parameters. Method of buffering and control of channel capacity and calculating of routing cost method in the network, which take into account the parameters of traffic multifractality and the probability of detecting attacks in telecommunications networks were proposed. The both proposed methods accounting the given restrictions on the delay time and the number of lost packets for every type quality of service traffic. During simulation the parameters of transmitted traffic (self-similarity, intensity) and the parameters of network (current channel load, node buffer size) were changed and the maximum allowable load of network was determined. The results of analysis show that occurrence of overload when transmitting traffic over a switched channel associated with multifractal traffic characteristics and presence of attack. It was shown that proposed methods can reduce the lost data and improve the efficiency of network resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text overlap with arXiv:1904.0520