nils-herrmann/clean_scirepeval huggingface dataset:
Complex Contagion of Campaign Donations

Money is central in US politics, and most campaign contributions stem from a tiny, wealthy elite. Like other political acts, campaign donations are known to be socially contagious. We study how campaign donations diffuse through a network of more than 50000 elites and examine how connectivity among previous donors reinforces contagion. We find that the diffusion of donations is driven by independent reinforcement contagion: people are more likely to donate when exposed to donors from different social groups than when they are exposed to equally many donors from the same group. Counter-intuitively, being exposed to one side may increase donations to the other side. Although the effect is weak, simultaneous cross-cutting exposure makes donation somewhat less likely. Finally, the independence of donors in the beginning of a campaign predicts the amount of money that is raised throughout a campaign. We theorize that people infer population-wide estimates from their local observations, with elites assessing the viability of candidates, possibly opposing candidates in response to local support. Our findings suggest that theories of complex contagions need refinement and that political campaigns should target multiple communities.
A Tale of Two Consequences

This article looks at the effect of the tick size changes by the Tokyo Stock Exchange on January 14, 2014, and July 22, 2014, on the TOPIX 100 index stocks. The intended consequence of the change is price improvement and shorter time to execution. The author examines at security level metrics, including the spread, trading volume, number of trades, and the size of trades to establish whether this goal is accomplished. An unintended effect might be the reduction in execution sizes, which would then mean that institutions with large orders would have greater difficulty in sourcing liquidity. He looks at a sample of real orders to see if the execution costs have gone up across the orders since the implementation of this change.
Characteristics of Cherenkov radiation in naturally occurring ice

Author(s): Mikkelsen, RE; Poulsen, T; Uggerhoj, UI; Klein, SR |  We revisit the theory of Cherenkov radiation in uniaxial crystals. Historically, a number of flawed attempts have been made at explaining this radiation phenomenon, and a consistent error-free description is nowhere available. We apply our calculation to a large modern day telescope - IceCube. Located in Antarctica, this detector makes use of the naturally occurring ice as a medium to generate Cherenkov radiation. However, due to the high pressure at the depth of the detector site, large volumes of hexagonal ice crystals are formed. We calculate how this affects the Cherenkov radiation yield and angular dependence. We conclude that the effect is small, at most about a percent, and would only be relevant in future high-precision instruments like e.g. Precision IceCube Next Generation Upgrade (PINGU). For radio-Cherenkov experiments which use the presence of a clear Cherenkov cone to determine the arrival direction, any variation in emission angle will directly and linearly translate into a change in apparent neutrino direction. In closing, we also describe a simple experiment to test this formalism and calculate the impact of anisotropy on light yields from lead tungstate crystals as used, for example, in the CMS calorimeter at the CERN LHC.
A Minimalistic Approach to Sum-Product Network Learning for Real Applications

Sum-Product Networks (SPNs) are a class of expressive yet tractable hierarchical graphical models. LearnSPN is a structure learning algorithm for SPNs that uses hierarchical co-clustering to simultaneously identifying similar entities and similar features. The original LearnSPN algorithm assumes that all the variables are discrete and there is no missing data. We introduce a practical, simplified version of LearnSPN, MiniSPN, that runs faster and can handle missing data and heterogeneous features common in real applications. We demonstrate the performance of MiniSPN on standard benchmark datasets and on two datasets from Google's Knowledge Graph exhibiting high missingness rates and a mix of discrete and continuous features.
Inverse Reinforcement Learning in Swarm Systems

Inverse reinforcement learning (IRL) has become a useful tool for learning behavioral models from demonstration data. However, IRL remains mostly unexplored for multi-agent systems. In this paper, we show how the principle of IRL can be extended to homogeneous large-scale problems, inspired by the collective swarming behavior of natural systems. In particular, we make the following contributions to the field: 1) We introduce the swarMDP framework, a sub-class of decentralized partially observable Markov decision processes endowed with a swarm characterization. 2) Exploiting the inherent homogeneity of this framework, we reduce the resulting multi-agent IRL problem to a single-agent one by proving that the agent-specific value functions in this model coincide. 3) To solve the corresponding control problem, we propose a novel heterogeneous learning scheme that is particularly tailored to the swarm setting. Results on two example systems demonstrate that our framework is able to produce meaningful local reward models from which we can replicate the observed global system dynamics.
A theory of contemplation

In this paper you can explore the application of some notable Boolean-derived methods, namely the Disjunctive Normal Form representation of logic table expansions, and extend them to a real-valued logic model which is able to utilize quantities on the range [0,1], [-1,1], [a,b], (x,y), (x,y,z), and etc. so as to produce a logical programming of arbitrary range, precision, and dimensionality, thereby enabling contemplation at a logical level in notions of arbitrary data, colors, and spatial constructs, with an example of the production of a game character's logic in mathematical form.
Noise fit, estimation error and a Sharpe information criterion

When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjusted Sharpe ratio as model selection criterion analogously to the Akaike Information Criterion (AIC). Selecting a model with the highest adjusted Sharpe ratio selects the model with the highest estimated out-of-sample Sharpe ratio in the same way as selection by AIC does for the log-likelihood as a measure of fit.
Non-concave optimal investment and no-arbitrage: a measure theoretical approach

We consider non-concave and non-smooth random utility functions with do- main of definition equal to the non-negative half-line. We use a dynamic pro- gramming framework together with measurable selection arguments to establish both the no-arbitrage condition characterization and the existence of an optimal portfolio in a (generically incomplete) discrete-time financial market model with finite time horizon. In contrast to the existing literature, we propose to consider a probability space which is not necessarily complete.
Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm

This work provides improved guarantees for streaming principle component analysis (PCA). Given $A_1, \ldots, A_n\in \mathbb{R}^{d\times d}$ sampled independently from distributions satisfying $\mathbb{E}[A_i] = \Sigma$ for $\Sigma \succeq \mathbf{0}$, this work provides an $O(d)$-space linear-time single-pass streaming algorithm for estimating the top eigenvector of $\Sigma$. The algorithm nearly matches (and in certain cases improves upon) the accuracy obtained by the standard batch method that computes top eigenvector of the empirical covariance $\frac{1}{n} \sum_{i \in [n]} A_i$ as analyzed by the matrix Bernstein inequality. Moreover, to achieve constant accuracy, our algorithm improves upon the best previous known sample complexities of streaming algorithms by either a multiplicative factor of $O(d)$ or $1/\mathrm{gap}$ where $\mathrm{gap}$ is the relative distance between the top two eigenvalues of $\Sigma$. 
These results are achieved through a novel analysis of the classic Oja's algorithm, one of the oldest and most popular algorithms for streaming PCA. In particular, this work shows that simply picking a random initial point $w_0$ and applying the update rule $w_{i + 1} = w_i + \eta_i A_i w_i$ suffices to accurately estimate the top eigenvector, with a suitable choice of $\eta_i$. We believe our result sheds light on how to efficiently perform streaming PCA both in theory and in practice and we hope that our analysis may serve as the basis for analyzing many variants and extensions of streaming PCA.
Variational Inference for On-line Anomaly Detection in High-Dimensional Time Series

Approximate variational inference has shown to be a powerful tool for modeling unknown complex probability distributions. Recent advances in the field allow us to learn probabilistic models of sequences that actively exploit spatial and temporal structure. We apply a Stochastic Recurrent Network (STORN) to learn robot time series data. Our evaluation demonstrates that we can robustly detect anomalies both off- and on-line.
The scaling of the minimum sum of edge lengths in uniformly random trees

The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial time, they have remained theoretical and have not been implemented in practical contexts to our knowledge. Here we use one of those algorithms to investigate the growth of this sum as a function of the size of the tree in uniformly random trees. We show that this sum is bounded above by its value in a star tree. We also show that the mean edge length grows logarithmically in optimal linear arrangements, in stark contrast to the linear growth that is expected on optimal arrangements of star trees or on random linear arrangements.
Modular Tracking Framework: A Unified Approach to Registration based Tracking

This paper presents a modular, extensible and highly efficient open source framework for registration based tracking called Modular Tracking Framework (MTF). Targeted at robotics applications, it is implemented entirely in C++ and designed from the ground up to easily integrate with systems that support any of several major vision and robotics libraries including OpenCV, ROS, ViSP and Eigen. It implements more methods, is faster, and more precise than other existing systems. Further, the theoretical basis for its design is a new way to conceptualize registration based trackers that decomposes them into three constituent sub modules - Search Method (SM), Appearance Model (AM) and State Space Model (SSM). 
In the process, we integrate many important advances published after Baker \& Matthews' landmark work in 2004. In addition to being a practical solution for fast and high precision tracking, MTF can also serve as a useful research tool by allowing existing and new methods for any of the sub modules to be studied better. When a new method is introduced for one of these, the breakdown can help to experimentally find the combination of methods for the others that is optimum for it. By extensive use of generic programming, MTF makes it easy to plug in a new method for any of the sub modules so that it can not only be tested comprehensively with existing methods but also become immediately available for deployment in any project that uses the framework. With 16 AMs, 11 SMs and 13 SSMs implemented already, MTF provides over 2000 distinct single layer trackers. It also allows two or more of these to be combined together in several ways to create a practically unlimited variety of novel multi layer trackers.
MGNC-CNN: A Simple Approach to Exploiting Multiple Word Embeddings for Sentence Classification

We introduce a novel, simple convolution neural network (CNN) architecture - multi-group norm constraint CNN (MGNC-CNN) that capitalizes on multiple sets of word embeddings for sentence classification. MGNC-CNN extracts features from input embedding sets independently and then joins these at the penultimate layer in the network to form a final feature vector. We then adopt a group regularization strategy that differentially penalizes weights associated with the subcomponents generated from the respective embedding sets. This model is much simpler than comparable alternative architectures and requires substantially less training time. Furthermore, it is flexible in that it does not require input word embeddings to be of the same dimensionality. We show that MGNC-CNN consistently outperforms baseline models.
A Theory of Ambulance Chasing

Ambulance chasing is a common socio-scientific phenomenon in particle physics. I argue that despite the seeming complexity, it is possible to gain insight into both the qualitative and quantitative features of ambulance chasing dynamics. Compound-Poisson statistics suffices to accommodate the time evolution of the cumulative number of papers on a topic, where basic assumptions that the interest in the topic as well as the number of available ideas decrease with time appear to drive the time evolution. It follows that if the interest scales as an inverse power law in time, the cumulative number of papers on a topic is well described by a di-gamma function, with a distinct logarithmic behavior at large times. In cases where the interest decreases exponentially with time, the model predicts that the total number of papers on the topic will converge to a fixed value as time goes to infinity. I demonstrate that the two models are able to fit at least 9 specific instances of ambulance chasing in particle physics using only two free parameters. In case of the most recent ambulance chasing instance, the ATLAS {\gamma}{\gamma} excess, fits to the current data predict that the total number of papers on the topic will not exceed 310 papers by the June 1. 2016, and prior to the natural cut-off for the validity of the theory.
Data Fluidity in DARIAH – Pushing the Agenda Forward

This paper provides both an update concerning the setting up of the European DARIAH infrastructure and a series of strong action lines related to the development of a data centred strategy for the humanities in the coming years. In particular we tackle various aspect of data management: data hosting, the setting up of a DARIAH seal of approval, the establishment of a charter between cultural heritage institutions and scholars and finally a specific view on certification mechanisms for data.
TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems

TensorFlow is an interface for expressing machine learning algorithms, and an implementation for executing such algorithms. A computation expressed using TensorFlow can be executed with little or no change on a wide variety of heterogeneous systems, ranging from mobile devices such as phones and tablets up to large-scale distributed systems of hundreds of machines and thousands of computational devices such as GPU cards. The system is flexible and can be used to express a wide variety of algorithms, including training and inference algorithms for deep neural network models, and it has been used for conducting research and for deploying machine learning systems into production across more than a dozen areas of computer science and other fields, including speech recognition, computer vision, robotics, information retrieval, natural language processing, geographic information extraction, and computational drug discovery. This paper describes the TensorFlow interface and an implementation of that interface that we have built at Google. The TensorFlow API and a reference implementation were released as an open-source package under the Apache 2.0 license in November, 2015 and are available at www.tensorflow.org.
Solving Society's Big Ills, A Small Step

We look at a collection of conjectures with the unifying message that smaller social systems, tend to be less complex and can be aligned better, towards fulfilling their intended objectives. We touch upon a framework, referred to as the four pronged approach that can aid the analysis of social systems. The four prongs are: 1. The Uncertainty Principle of the Social Sciences 2. The Objectives of a Social System or the Responsibilities of the Players 3. The Need for Smaller Organizations 4. Redirecting Unintended Outcomes Smaller organizations mitigating the disruptive effects of corruption is discussed and also the need for organizations, whose objective is to foster the development of other smaller organizations. We consider a way of life, which is about respect for knowledge and a desire to seek it. Knowledge can help eradicate ignorance, but the accumulation of knowledge can lead to overconfidence. Hence it becomes important to instill an attitude that does not knowledge too seriously, along with the thirst for knowledge. All of this is important to create an environment that is conducive for smaller organizations and can be viewed as a natural extension of studies that fall under the wider category of understanding factors and policies aimed at increasing the welfare or well-being to society.
Generating Natural Questions About an Image

There has been an explosion of work in the vision & language community during the past few years from image captioning to video transcription, and answering questions about images. These tasks have focused on literal descriptions of the image. To move beyond the literal, we choose to explore how questions about an image are often directed at commonsense inference and the abstract events evoked by objects in the image. In this paper, we introduce the novel task of Visual Question Generation (VQG), where the system is tasked with asking a natural and engaging question when shown an image. We provide three datasets which cover a variety of images from object-centric to event-centric, with considerably more abstract training data than provided to state-of-the-art captioning systems thus far. We train and test several generative and retrieval models to tackle the task of VQG. Evaluation results show that while such models ask reasonable questions for a variety of images, there is still a wide gap with human performance which motivates further work on connecting images with commonsense knowledge and pragmatics. Our proposed task offers a new challenge to the community which we hope furthers interest in exploring deeper connections between vision & language.
Deep learning in bioinformatics

In the era of big data, transformation of biomedical big data into valuable knowledge has been one of the most important challenges in bioinformatics. Deep learning has advanced rapidly since the early 2000s and now demonstrates state-of-the-art performance in various fields. Accordingly, application of deep learning in bioinformatics to gain insight from data has been emphasized in both academia and industry. Here, we review deep learning in bioinformatics, presenting examples of current research. To provide a useful and comprehensive perspective, we categorize research both by the bioinformatics domain (i.e. omics, biomedical imaging, biomedical signal processing) and deep learning architecture (i.e. deep neural networks, convolutional neural networks, recurrent neural networks, emergent architectures) and present brief descriptions of each study. Additionally, we discuss theoretical and practical issues of deep learning in bioinformatics and suggest future research directions. We believe that this review will provide valuable insights and serve as a starting point for researchers to apply deep learning approaches in their bioinformatics studies.
Colloquium: Strongly interacting photons in one-dimensional continuum

Photons, the particles of light, are in most conditions very weakly interacting. Nevertheless, it is possible to make them interact by altering environmental conditions, for instance, in the interior of certain materials or by squeezing them in confined geometries. In this Colloquium the topic of photons interacting strongly when confined to a one-dimensional geometry is discussed from experimental and theoretical perspectives.
Bouncing universes in scalar-tensor gravity around conformal invariance

We consider the possibility to produce a bouncing universe in the framework of scalar-tensor gravity when the scalar field has a nonconformal coupling to the Ricci scalar. We prove that bouncing universes regular in the future with essentially the same dynamics as for the conformal coupling case do exist when the coupling deviates slightly from it. This is found numerically for more substantial deviations as well. In some cases however new features are found like the ability of the system to leave the effective phantom regime.
Recursive Neural Conditional Random Fields for Aspect-based Sentiment Analysis

In aspect-based sentiment analysis, extracting aspect terms along with the opinions being expressed from user-generated content is one of the most important subtasks. Previous studies have shown that exploiting connections between aspect and opinion terms is promising for this task. In this paper, we propose a novel joint model that integrates recursive neural networks and conditional random fields into a unified framework for explicit aspect and opinion terms co-extraction. The proposed model learns high-level discriminative features and double propagate information between aspect and opinion terms, simultaneously. Moreover, it is flexible to incorporate hand-crafted features into the proposed model to further boost its information extraction performance. Experimental results on the SemEval Challenge 2014 dataset show the superiority of our proposed model over several baseline methods as well as the winning systems of the challenge.
A molecular perspective on the limits of life: Enzymes under pressure

From a purely operational standpoint, the existence of microbes that can grow under extreme conditions, or "extremophiles", leads to the question of how the molecules making up these microbes can maintain both their structure and function. While microbes that live under extremes of temperature have been heavily studied, those that live under extremes of pressure have been neglected, in part due to the difficulty of collecting samples and performing experiments under the ambient conditions of the microbe. However, thermodynamic arguments imply that the effects of pressure might lead to different organismal solutions than from the effects of temperature. Observationally, some of these solutions might be in the condensed matter properties of the intracellular milieu in addition to genetic modifications of the macromolecules or repair mechanisms for the macromolecules. Here, the effects of pressure on enzymes, which are proteins essential for the growth and reproduction of an organism, and some adaptations against these effects are reviewed and amplified by the results from molecular dynamics simulations. The aim is to provide biological background for soft matter studies of these systems under pressure.