nils-herrmann/clean_scirepeval huggingface dataset:
What Causes Cost Overrun in Transport Infrastructure Projects?

Results from the first statistically significant study of the causes of cost escalation in transport infrastructure projects are presented. The study is based on a sample of 258 rail, bridge, tunnel and road projects worth US$90 billion. The focus is on the dependence of cost escalation on: (1) the length of the project‐implementation phase, (2) the size of the project and (3) the type of project ownership. First, it was found, with very high statistical significance, that cost escalation was strongly dependent on the length of the implementation phase. The policy implications are clear: decision‐makers and planners should be highly concerned about delays and long implementation phases because they translate into risks of substantial cost escalations. Second, projects have grown larger over time, and for bridges and tunnels larger projects have larger percentage cost escalations. Finally, by comparing the cost escalation for three types of project ownership—private, state‐owned enterprise and other public ownership—it was shown that the oft‐seen claim that public ownership is problematic and private ownership effective in curbing cost escalation is an oversimplification. The type of accountability appears to matter more to cost escalation than type of ownership.
Genomic and phenotypic characterisation of a wild Medaka population: Establishing an isogenic population genetic resource in fish

Oryzias latipes (Medaka) has been established as a vertebrate genetic model for over a century, and has recently been rediscovered outside its native Japan. The power of new sequencing methods now makes it possible to reinvigorate Medaka genetics, in particular by establishing a near-isogenic panel derived from a single wild population.  Here we characterise the genomes of wild Medaka catches obtained from a single Southern Japanese population in Kiyosu as a precursor for the establishment of a near isogenic panel of wild lines. The population is free of significant detrimental population structure, and has advantageous linkage disequilibrium properties suitable for establishment of the proposed panel. Analysis of morphometric traits in five representative inbred strains suggests phenotypic mapping will be feasible in the panel. In addition high throughput genome sequencing of these Medaka strains confirms their evolutionary relationships on lines of geographic separation and provides further evidence that there has been little significant interbreeding between the Southern and Northern Medaka population since the Southern/Northern population split. The sequence data suggest that the Southern Japanese Medaka existed as a larger older population which went through a relatively recent bottleneck around 10,000 years ago. In addition we detect patterns of recent positive selection in the Southern population.  These data indicate that the genetic structure of the Kiyosu Medaka samples are suitable for the establishment of a vertebrate near isogenic panel and therefore inbreeding of 200 lines based on this population has commenced. Progress of this project can be tracked at this http URL
Astrophysical and cosmological problems of invisible mass and dark energy in the Universe

The Workshop on results of the Project Kosmomikrofizyka-2 (Astroparticle Physics) of the National Academy of Sciences (NAS) of Ukraine"Astrophysical and cosmological problems of invisible mass and dark energy in the Universe"was held on November 21-22, 2012 in the Institute for Nuclear Research, Kyiv, Ukraine (http://lpd.kinr.kiev.ua/kmf12). This Project was carried out during three years (2010-2012) by scientists from various universities and institutes of the National Academy of Sciences of Ukraine; it was a logical continuation of the previous scientific program of the NAS of Ukraine"Researches of structure and composition of the Universe, hidden mass and dark energy (Kosmomikrofizyka)"in 2007-2009. These programs were devoted to theoretical and experimental investigations in astronomy, astrophysics, cosmology, physics of atomic nuclei and particle physics, which are related with the problems of dark matter and dark energy in the Universe.
Determination of the Δ ( 1232 ) axial and pseudoscalar form factors from lattice QCD

We present a lattice QCD calculation of the $\Delta(1232)$ matrix elements of the axial-vector and pseudoscalar currents. The decomposition of these matrix elements into the appropriate Lorentz invariant form factors is carried out and the techniques to calculate the form factors are developed and tested using quenched configurations. Results are obtained for 2+1 domain wall fermions and within a hybrid scheme with domain wall valence and staggered sea quarks. Two Goldberger-Treiman type relations connecting the axial to the pseudoscalar effective couplings are derived. These and further relations based on the pion-pole dominance hypothesis are examined using the lattice QCD results, finding support for their validity. Utilizing lattice QCD results on the axial charges of the nucleon and the $\Delta$, as well as the nucleon-to-$\Delta$ transition coupling constant, we perform a combined chiral fit to all three quantities and study their pion mass dependence as the chiral limit is approached.
DELTACON: A Principled Massive-Graph Similarity Function

How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known node correspondence, i.e. the detection of changes in the connectivity of graphs, arises in numerous settings. In this work, we formally state the axioms and desired properties of the graph similarity functions, and evaluate when state-of-the-art methods fail to detect crucial connectivity changes in graphs. We propose DeltaCon, a principled, intuitive, and scalable algorithm that assesses the similarity between two graphs on the same nodes (e.g. employees of a company, customers of a mobile carrier). Experiments on various synthetic and real graphs showcase the advantages of our method over existing similarity measures. Finally, we employ DeltaCon to real applications: (a) we classify people to groups of high and low creativity based on their brain connectivity graphs, and (b) do temporal anomaly detection in the who-emails-whom Enron graph.
Personalized PageRank to a Target Node

Personalalized PageRank uses random walks to determine the importance or authority of nodes in a graph from the point of view of a given source node. Much past work has considered how to compute personalized PageRank from a given source node to other nodes. In this work we consider the problem of computing personalized PageRanks to a given target node from all source nodes. This problem can be interpreted as finding who supports the target or who is interested in the target. 
We present an efficient algorithm for computing personalized PageRank to a given target up to any given accuracy. We give a simple analysis of our algorithm's running time in both the average case and the parameterized worst-case. We show that for any graph with $n$ nodes and $m$ edges, if the target node is randomly chosen and the teleport probability $\alpha$ is given, the algorithm will compute a result with $\epsilon$ error in time $O\left(\frac{1}{\alpha \epsilon}  We present results from experiments on the Twitter graph which show that the constant factors in our running time analysis are small and our algorithm is efficient in practice.
Fast exact shortest-path distance queries on large networks by pruned landmark labeling

We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations. We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks. In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable query time to those of previous methods.
On the pricing and hedging of options for highly volatile periods

Option pricing is an integral part of modern financial risk management. The well-known Black and Scholes (1973) formula is commonly used for this purpose. This paper is an attempt to extend their work to a situation in which the unconditional volatility of the original asset is increasing during a certain period of time. We consider a market suffering from a financial crisis. We provide the solution for the equation of the underlying asset price as well as finding the hedging strategy. In addition, a closed formula of the pricing problem is proved for a particular case. The suggested formulas are expected to make the valuation of options and the underlying hedging strategies during financial crisis more precise.
GEMINI: Integrative Exploration of Genetic Variation and Genome Annotations

Modern DNA sequencing technologies enable geneticists to rapidly identify genetic variation among many human genomes. However, isolating the minority of variants underlying disease remains an important, yet formidable challenge for medical genetics. We have developed GEMINI (GEnome MINIng), a flexible software package for exploring all forms of human genetic variation. Unlike existing tools, GEMINI integrates genetic variation with a diverse and adaptable set of genome annotations (e.g., dbSNP, ENCODE, UCSC, ClinVar, KEGG) into a unified database to facilitate interpretation and data exploration. Whereas other methods provide an inflexible set of variant filters or prioritization methods, GEMINI allows researchers to compose complex queries based on sample genotypes, inheritance patterns, and both pre-installed and custom genome annotations. GEMINI also provides methods for ad hoc queries and data exploration, a simple programming interface for custom analyses that leverage the underlying database, and both command line and graphical tools for common analyses. We demonstrate GEMINI's utility for exploring variation in personal genomes and family based genetic studies, and illustrate its ability to scale to studies involving thousands of human samples. GEMINI is designed for reproducibility and flexibility and our goal is to provide researchers with a standard framework for medical genomics.
THE LATE-TIME REBRIGHTENING OF TYPE Ia SN 2005gj IN THE MID-INFRARED

A growing number of observations reveal a subset of Type Ia supernovae undergoing circumstellar interaction (SNe Ia-CSM). We present unpublished archival Spitzer Space Telescope data on SNe Ia-CSM 2002ic and 2005gj obtained >1300 and 500 days post-discovery, respectively. Both SNe show evidence for late-time mid-infrared (mid-IR) emission from warm dust. The dust parameters are most consistent with a preexisting dust shell that lies beyond the forward-shock radius, most likely radiatively heated by optical and X-ray emission continuously generated by late-time CSM interaction. In the case of SN 2005gj, the mid-IR luminosity more than doubles after 1 yr post-discovery. While we are not aware of any late-time optical-wavelength observations at these epochs, we attribute this rebrightening to renewed shock interaction with a dense circumstellar shell.
Geolocating the Higgs Boson Candidate at the LHC

The latest results from the ATLAS and CMS experiments at the CERN Large Hadron Collider (LHC) unequivocally confirm the existence of a resonance, X, with mass near 125 GeV which could be the Higgs boson of the Standard Model. Measuring the properties (quantum numbers and couplings) of this resonance is of paramount importance. Initial analyses by the LHC collaborations disfavor specific alternative benchmark hypotheses, e.g. pure pseudoscalars or gravitons. However, this is just the first step in a long-term program of detailed measurements. We consider the most general set of operators in the decay channels X → ZZ,WW,Zγ, γγ and derive the constraint implied by the measured rate. This allows us to provide a useful parametrization of the orthogonal independent Higgs coupling degrees of freedom as coordinates on a suitably defined sphere.
Atmospheric dependence of the stopping cosmic ray muon rate at ground level

The rate of low energy (? 150 MeV) cosmic ray muons was measured at ground level as a function of several atmospheric parameters. Stopped muons were detected in a plastic scintillator block and correlations were determined using a linear regression model. A strong anti-correlation between fractional changes in the ground-level pressure and the stopping muon rate of ?3.0 ? 0.5 was found, and also a ?4.1 ? 0.5 anti-correlation with the fractional change in atmospheric height at 10 kPa pressure. A weak positive correlation with the 10 kPa temperature was also found, but it was shown not to be statistically significant in our data set. The same analysis was applied to the total rate of all charged cosmic ray particles detected with the same apparatus, and good agreement with previous work was seen. The pressure and height correlation parameters for stopping muons are larger than for the total rate of all charged particles by factors of about 1.6 and 3.7, respectively.
Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)

The paper describes development (improvement/extension) approaches for composite (modular) systems (as combinatorial reengineering). The following system improvement/extension actions are considered: (a) improvement of systems component(s) (e.g., improvement of a system component, replacement of a system component); (b) improvement of system component interconnection (compatibility); (c) joint improvement improvement of system components(s) and their interconnection; (d) improvement of system structure (replacement of system part(s), addition of a system part, deletion of a system part, modification of system structure). The study of system improvement approaches involve some crucial issues: (i) scales for evaluation of system components and component compatibility (quantitative scale, ordinal scale, poset-like scale, scale based on interval multiset estimate), (ii) evaluation of integrated system quality, (iii) integration methods to obtain the integrated system quality. The system improvement/extension strategies can be examined as seleciton/combination of the improvement action(s) above and as modification of system structure. The strategies are based on combinatorial optimization problems (e.g., multicriteria selection, knapsack problem, multiple choice problem, combinatorial synthesis based on morphological clique problem, assignment/reassignment problem, graph recoloring problem, spanning problems, hotlink assignment). Here, heuristics are used. Various system improvement/extension strategies are presented including illustrative numerical examples.
Schr\"odinger group and quantum finance

Using the one dimensional free particle symmetries, the quantum finance symmetries are obtained. Namely, it is shown that Black-Scholes equation is invariant under Schr\"odinger group. In order to do this, the one dimensional free non-relativistic particle and its symmetries are revisited. To get the Black-Scholes equation symmetries, the particle mass is identified as the inverse of square of the volatility. Furthermore, using financial variables, a Schr\"odinger algebra representation is constructed.
Magnetostructural transition, metamagnetism, and magnetic phase coexistence in Co 10 Ge 3 O 16

Co${}_{10}$Ge${}_{3}$O${}_{16}$ crystallizes in an intergrowth structure featuring alternating layers of spinel and rock salt. Variable-temperature powder synchrotron x-ray and neutron diffraction, magnetometry, and heat capacity experiments reveal a magnetostructural transition at ${T}_{\mathrm{N}}=203$ K. This rhombohedral-to-monoclinic transition involves a slight elongation of the CoO${}_{6}$ octahedra along the apical axis. Below ${T}_{\mathrm{N}}$, the application of a large magnetic field causes a reorientation of the Co${}^{2+}$ Ising spins. This metamagnetic transition is first order as evidenced by a latent heat observed in temperature-dependent measurements. This transition is initially seen at $T=180$ K as a broad upturn in the $M$--$H$ near ${H}_{\mathrm{C}}=3.9$ T. The upturn sharpens into a kink at $T=120$ K and a ``butterfly'' shape emerges, with the transition causing hysteresis at high fields while linear and reversible behavior persists at low fields. ${H}_{\mathrm{C}}$ decreases as temperature is lowered and the loops at positive and negative fields merge beneath $T=20$ K. The antiferromagnetism is described by ${k}_{\mathrm{M}}=(00\frac{1}{2})$ and below $T=20$ K a small uncompensated component with ${k}_{\mathrm{M}}=(000)$ spontaneously emerges. Despite the Curie-Weiss analysis and ionic radius indicating the Co${}^{2+}$ is in its high-spin state, the low-temperature $M$--$H$ trends toward saturation at ${M}_{\mathrm{S}}=1.0$ ${\ensuremath{\mu}}_{\mathrm{B}}$/Co. We conclude that the field-induced state is a ferrimagnet, rather than a $S=1/2$ ferromagnet. The unusual $H$--$T$ phase diagram is discussed with reference to other metamagnets and Co(II) systems.
Theory of the Raman spectrum of rotated double-layer graphene

We study theoretically the Raman spectrum of the rotated double-layer graphene, consisting of two graphene layers rotated with respect to each other by an arbitrary angle \theta. We find a relatively simple dependence of the Raman G peak intensity on the angle \theta. On the other hand, the Raman 2D peak position, intensity, and width show a much more complicated dependence on the angle \theta. We account for all of these effects, including dependence on the incoming photon energy, in good agreement with the experimental data. We find that it is sufficient to include the interaction between the graphene layers on the electronic degrees of freedom (resulting in the occurrence of van Hove singularities in the density of states). We assume that the phonon degrees of freedom are unaffected by the interaction between the layers. Furthermore, we decompose the Raman 2D peak into two components having very different linewidths; these widths are almost independent of the angle \theta. The change in the intensity and the peak position of one of these two components gives insight into the dependence of the overall Raman 2D peak features as a function of the angle \theta. Additionally, we show regions in the phonon spectrum giving rise to the Raman 2D peak signal. This work provides an insight into the interplay between the mechanical degree of freedom (angle \theta) and the electronic degrees of freedom (singularities in the density of states) in rotated double-layer graphene. Additionally, this work provides a way to establish experimentally the value of the rotation angle \theta using Raman spectroscopy measurement. This procedure becomes even more robust if one repeats the Raman spectroscopy measurement with a different incoming photon energy.
Constraint Satisfaction over Generalized Staircase Constraints

One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds, down staircase (DS) and up staircase (US). We first examine several properties of GS constraints, and then show that arc consistency is sufficient to determine a solution to a CSP over DS constraints. Further, we propose an optimal O(cd) time and space algorithm to compute arc consistency for GS constraints where c is the number of constraints and d is the size of the largest domain. Next, observing that arc consistency is not necessary for solving a DSCSP, we propose a more efficient algorithm for solving it. With regard to US constraints, arc consistency is not known to be sufficient to determine a solution, and therefore, methods such as path consistency or variable elimination are required. Since arc consistency acts as a subroutine for these existing methods, replacing it by our optimal O(cd) arc consistency algorithm produces a more efficient method for solving a USCSP.
Central clearing of OTC derivatives: Bilateral vs multilateral netting

We study the impact of central clearing of over-the-counter (OTC) transactions on counterparty exposures in a market with OTC transactions across several asset classes with heterogeneous characteristics. The impact of introducing a central counterparty (CCP) on expected interdealer exposure is determined by the tradeoff between multilateral netting across dealers on one hand and bilateral netting across asset classes on the other hand. We find this tradeoff to be sensitive to assumptions on heterogeneity of asset classes in terms of `riskyness' of the asset class as well as correlation of exposures across asset classes. In particular, while an analysis assuming independent, homogeneous exposures suggests that central clearing is efficient only if one has an unrealistically high number of participants, the opposite conclusion is reached if differences in riskyness and correlation across asset classes are realistically taken into account. We argue that empirically plausible specifications of model parameters lead to the conclusion that central clearing does reduce interdealer exposures: the gain from multilateral netting in a CCP overweighs the loss of netting across asset classes in bilateral netting agreements. When a CCP exists for interest rate derivatives, adding a CCP for credit derivatives is shown to decrease overall exposures. These findings are shown to be robust to the statistical assumptions of the model as well as the choice of risk measure used to quantify exposures.
Targeted Social Mobilization in a Global Manhunt

Social mobilization, the ability to mobilize large numbers of people via social networks to achieve highly distributed tasks, has received significant attention in recent times. This growing capability, facilitated by modern communication technology, is highly relevant to endeavors which require the search for individuals that possess rare information or skills, such as finding medical doctors during disasters, or searching for missing people. An open question remains, as to whether in time-critical situations, people are able to recruit in a targeted manner, or whether they resort to so-called blind search, recruiting as many acquaintances as possible via broadcast communication. To explore this question, we examine data from our recent success in the U.S. State Department's Tag Challenge, which required locating and photographing 5 target persons in 5 different cities in the United States and Europe – in under 12 hours – based only on a single mug-shot. We find that people are able to consistently route information in a targeted fashion even under increasing time pressure. We derive an analytical model for social-media fueled global mobilization and use it to quantify the extent to which people were targeting their peers during recruitment. Our model estimates that approximately 1 in 3 messages were of targeted fashion during the most time-sensitive period of the challenge. This is a novel observation at such short temporal scales, and calls for opportunities for devising viral incentive schemes that provide distance or time-sensitive rewards to approach the target geography more rapidly. This observation of ′12 hours of separation' between individuals has applications in multiple areas from emergency preparedness, to political mobilization.