nils-herrmann/clean_scirepeval huggingface dataset:
Degeneracy-Based Real-Time Sub-Event Detection in Twitter Stream

In this paper, we deal with the task of sub-event detection in evolving events using posts collected from the Twitter stream. By representing a sequence of successive tweets in a short time interval as a weighted graph-of-words, we are able to identify the key moments (sub-events) that compose an event using the concept of graph degeneracy. We then select a tweet to best describe each sub-event using a simple yet effective heuristic. We evaluated our approach using humangenerated summaries containing the actual important sub-events within each event and compare it to two baseline approaches using several performance metrics such as DET curves and precision/recall performance. Extensive experiments on recent sporting event streams indicate that our approach outperforms the dominant sub-event detection methods and constructs a humanreadable event summary by aggregating the most representative tweets of each sub-event.
Query clustering based on bid landscape for sponsored search auction optimization

In sponsored search auctions, the auctioneer operates the marketplace by setting a number of auction parameters such as reserve prices for the task of auction optimization. The auction parameters may be set for each individual keyword, but the optimization problem becomes intractable since the number of keywords is in the millions. To reduce the dimensionality and generalize well, one wishes to cluster keywords or queries into meaningful groups, and set parameters at the keyword-cluster level. For auction optimization, keywords shall be deemed as interchangeable commodities with respect to their valuations from advertisers, represented as bid distributions or landscapes. Clustering keywords for auction optimization shall thus be based on their bid distributions. In this paper we present a formalism of clustering probability distributions, and its application to query clustering where each query is represented as a probability density of click-through rate (CTR) weighted bid and distortion is measured by KL divergence. We first derive a k-means variant for clustering Gaussian densities, which have a closed-form KL divergence. We then develop an algorithm for clustering Gaussian mixture densities, which generalize a single Gaussian and are typically a more realistic parametric assumption for real-world data. The KL divergence between Gaussian mixture densities is no longer analytically tractable; hence we derive a variational EM algorithm that minimizes an upper bound of the total within-cluster KL divergence. The clustering algorithm has been deployed successfully into production, yielding significant improvement in revenue and clicks over the existing production system. While motivated by the specific setting of query clustering, the proposed clustering method is generally applicable to many real-world applications where an example is better characterized by a distribution than a finite-dimensional feature vector in Euclidean space as in the classical k-means.
Effective detection of sophisticated online banking fraud on extremely imbalanced data

Sophisticated online banking fraud reflects the integrative abuse of resources in social, cyber and physical worlds. Its detection is a typical use case of the broad-based Wisdom Web of Things (W2T) methodology. However, there is very limited information available to distinguish dynamic fraud from genuine customer behavior in such an extremely sparse and imbalanced data environment, which makes the instant and effective detection become more and more important and challenging. In this paper, we propose an effective online banking fraud detection framework that synthesizes relevant resources and incorporates several advanced data mining techniques. By building a contrast vector for each transaction based on its customer’s historical behavior sequence, we profile the differentiating rate of each current transaction against the customer’s behavior preference. A novel algorithm, ContrastMiner, is introduced to efficiently mine contrast patterns and distinguish fraudulent from genuine behavior, followed by an effective pattern selection and risk scoring that combines predictions from different models. Results from experiments on large-scale real online banking data demonstrate that our system can achieve substantially higher accuracy and lower alert volume than the latest benchmarking fraud detection system incorporating domain knowledge and traditional fraud detection methods.
Hyperbolic Graph Generator

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erdős-Rényi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.
True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy

Malicious I/O devices might compromise the OS using DMAs. The OS therefore utilizes the IOMMU to map and unmap every target buffer right before and after its DMA is processed, thereby restricting DMAs to their designated locations. This usage model, however, is not truly secure for two reasons: (1) it provides protection at page granularity only, whereas DMA buffers can reside on the same page as other data; and (2) it delays DMA buffer unmaps due to performance considerations, creating a vulnerability window in which devices can access in-use memory. We propose that OSes utilize the IOMMU differently, in a manner that eliminates these two flaws. Our new usage model restricts device access to a set of shadow DMA buffers that are never unmapped, and it copies DMAed data to/from these buffers, thus providing sub-page protection while eliminating the aforementioned vulnerability window. Our key insight is that the cost of interacting with, and synchronizing access to the slow IOMMU hardware---required for zero-copy protection against devices---make copying preferable to zero-copying.
 We implement our model in Linux and evaluate it with standard networking benchmarks utilizing a 40,Gb/s NIC. We demonstrate that despite being more secure than the safest preexisting usage model, our approach provides up to 5x higher throughput. Additionally, whereas it is inherently less scalable than an IOMMU-less (unprotected) system, our approach incurs only 0%--25% performance degradation in comparison.
Avoiding revascularization with lifestyle changes: The Multicenter Lifestyle Demonstration Project.

The Multicenter Lifestyle Demonstration Project was designed to determine if comprehensive lifestyle changes can be a direct alternative to revascularization for selected patients without increasing cardiac events. A total of 333 patients completed this demonstration project (194 in the experimental group and 139 in the control group). We found that experimental group patients were able to avoid revascularization for at least 3 years by making comprehensive lifestyle changes at substantially lower cost without increasing cardiac morbidity and mortality. These patients reported reductions in angina comparable with what can be achieved with revascularization.
DBpedia - A crystallization point for the Web of Data

The DBpedia project is a community effort to extract structured information from Wikipedia and to make this information accessible on the Web. The resulting DBpedia knowledge base currently describes over 2.6 million entities. For each of these entities, DBpedia defines a globally unique identifier that can be dereferenced over the Web into a rich RDF description of the entity, including human-readable definitions in 30 languages, relationships to other resources, classifications in four concept hierarchies, various facts as well as data-level links to other Web data sources describing the entity. Over the last year, an increasing number of data publishers have begun to set data-level links to DBpedia resources, making DBpedia a central interlinking hub for the emerging Web of data. Currently, the Web of interlinked data sources around DBpedia provides approximately 4.7 billion pieces of information and covers domains such as geographic information, people, companies, films, music, genes, drugs, books, and scientific publications. This article describes the extraction of the DBpedia knowledge base, the current status of interlinking DBpedia with other data sources on the Web, and gives an overview of applications that facilitate the Web of Data around DBpedia.
Automatic Acquisition of Hyponyms from Large Text Corpora

We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexicosyntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.
Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism

Mining association rules with multiple minimum supports is an important generalization of the association-rule-mining problem, which was recently proposed by Liu et al. Instead of setting a single minimum support threshold for all items, they allow users to specify multiple minimum supports to reflect the natures of the items, and an Apriori-based algorithm, named MSapriori, is developed to mine all frequent itemsets. In this paper, we study the same problem but with two additional improvements. First, we propose a FP-tree-like structure, MIS-tree, to store the crucial information about frequent patterns. Accordingly, an efficient MIS-tree-based algorithm, called the CFP-growth algorithm, is developed for mining all frequent itemsets. Second, since each item can have its own minimum support, it is very difficult for users to set the appropriate thresholds for all items at a time. In practice, users need to tune items’ supports and run the mining algorithm repeatedly until a satisfactory end is reached. To speed up this time-consuming tuning process, an efficient algorithm which can maintain the MIS-tree structure without rescanning database is proposed. Experiments on both synthetic and real-life datasets show that our algorithms are much more efficient and scalable than the previous algorithm. D 2004 Elsevier B.V. All rights reserved.
Neural Computations Mediating One-Shot Learning in the Human Brain

Incremental learning, in which new knowledge is acquired gradually through trial and error, can be distinguished from one-shot learning, in which the brain learns rapidly from only a single pairing of a stimulus and a consequence. Very little is known about how the brain transitions between these two fundamentally different forms of learning. Here we test a computational hypothesis that uncertainty about the causal relationship between a stimulus and an outcome induces rapid changes in the rate of learning, which in turn mediates the transition between incremental and one-shot learning. By using a novel behavioral task in combination with functional magnetic resonance imaging (fMRI) data from human volunteers, we found evidence implicating the ventrolateral prefrontal cortex and hippocampus in this process. The hippocampus was selectively "switched" on when one-shot learning was predicted to occur, while the ventrolateral prefrontal cortex was found to encode uncertainty about the causal association, exhibiting increased coupling with the hippocampus for high-learning rates, suggesting this region may act as a "switch," turning on and off one-shot learning as required.
Mechanical thrombectomy in acute ischemic stroke: Consensus statement by ESO-Karolinska Stroke Update 2014/2015, supported by ESO, ESMINT, ESNR and EAN.

The original version of this consensus statement on mechanical thrombectomy was approved at the European Stroke Organisation (ESO)-Karolinska Stroke Update conference in Stockholm, 16-18 November 2014. The statement has later, during 2015, been updated with new clinical trials data in accordance with a decision made at the conference. Revisions have been made at a face-to-face meeting during the ESO Winter School in Berne in February, through email exchanges and the final version has then been approved by each society. The recommendations are identical to the original version with evidence level upgraded by 20 February 2015 and confirmed by 15 May 2015. The purpose of the ESO-Karolinska Stroke Update meetings is to provide updates on recent stroke therapy research and to discuss how the results may be implemented into clinical routine. Selected topics are discussed at consensus sessions, for which a consensus statement is prepared and discussed by the participants at the meeting. The statements are advisory to the ESO guidelines committee. This consensus statement includes recommendations on mechanical thrombectomy after acute stroke. The statement is supported by ESO, European Society of Minimally Invasive Neurological Therapy (ESMINT), European Society of Neuroradiology (ESNR), and European Academy of Neurology (EAN).
Multiple PRP injections are more effective than single injections and hyaluronic acid in knees with early osteoarthritis: a randomized, double-blind, placebo-controlled trial

To compare the effectiveness of intraarticular (IA) multiple and single platelet-rich plasma (PRP) injections as well as hyaluronic acid (HA) injections in different stages of osteoarthritis (OA) of the knee. A total of 162 patients with different stages of knee OA were randomly divided into four groups receiving 3 IA doses of PRP, one dose of PRP, one dose of HA or a saline injection (control). Then, each group was subdivided into two groups: early OA (Kellgren–Lawrence grade 0 with cartilage degeneration or grade I–III) and advanced OA (Kellgren–Lawrence grade IV). The patients were evaluated before the injection and at the 6-month follow-ups using the EuroQol visual analogue scale (EQ-VAS) and International Knee Documentation Committee (IKDC) subjective scores. Adverse events and patient satisfaction were recorded. There was a statistically significant improvement in the IKDC and EQ-VAS scores in all the treatment groups compared with the control group. The knee scores of patients treated with three PRP injections were significantly better than those patients of the other groups. There was no significant difference in the scores of patients injected with one dose of PRP or HA. In the early OA subgroups, significantly better clinical results were achieved in the patients treated with three PRP injections, but there was no significant difference in the clinical results of patients with advanced OA among the treatment groups. The clinical results of this study suggest IA PRP and HA treatment for all stages of knee OA. For patients with early OA, multiple (3) PRP injections are useful in achieving better clinical results. For patients with advanced OA, multiple injections do not significantly improve the results of patients in any group.
The GRASP Multiple Micro-UAV Testbed

In the last five years, advances in materials, electronics, sensors, and batteries have fueled a growth in the development of microunmanned aerial vehicles (MAVs) that are between 0.1 and 0.5 m in length and 0.1-0.5 kg in mass . A few groups have built and analyzed MAVs in the 10-cm range [2], . One of the smallest MAV is the Picoftyer with a 60-mmpropellor diameter and a mass of 3.3 g [4]. Platforms in the 50-cm range are more prevalent with several groups having built and flown systems of this size [5]-[7]. In fact, there are severalcommercially available radiocontrolled (PvC) helicopters and research-grade helicopters in this size range .
Maternal depression and early childhood growth in developing countries: systematic review and meta-analysis.

To investigate the relationship between maternal depression and child growth in developing countries through a systematic literature review and meta-analysis.



Six databases were searched for studies from developing countries on maternal depression and child growth published up until 2010. Standard meta-analytical methods were followed and pooled odds ratios (ORs) for underweight and stunting in the children of depressed mothers were calculated using random effects models for all studies and for subsets of studies that met strict criteria on study design, exposure to maternal depression and outcome variables. The population attributable risk (PAR) was estimated for selected studies.



Seventeen studies including a total of 13,923 mother and child pairs from 11 countries met inclusion criteria. The children of mothers with depression or depressive symptoms were more likely to be underweight (OR: 1.5; 95% confidence interval, CI: 1.2-1.8) or stunted (OR: 1.4; 95% CI: 1.2-1.7). Subanalysis of three longitudinal studies showed a stronger effect: the OR for underweight was 2.2 (95% CI: 1.5-3.2) and for stunting, 2.0 (95% CI: 1.0-3.9). The PAR for selected studies indicated that if the infant population were entirely unexposed to maternal depressive symptoms 23% to 29% fewer children would be underweight or stunted.



Maternal depression was associated with early childhood underweight and stunting. Rigorous prospective studies are needed to identify mechanisms and causes. Early identification, treatment and prevention of maternal depression may help reduce child stunting and underweight in developing countries.
Tracing female gamer identity. An empirical study into gender and stereotype threat perceptions

It seems that women stand outside game culture resulting in a low gamer identity profile. A nuanced and detailed examination of how gender identity and threatening experiences tap into their play practices has hitherto been lacking however. The present study fills this gap by examining how female players express a gamer identity and how this relates to perceptions of threat and stigmatization. Based on a large-scale survey directed at female players, a statistical model is specified taking into account how respondents attribute a gamer label to their self-concept. Results suggest that the cognitive, evaluative, and affective dimensions of female identity predict gamer identification in distinct ways. Whereas the mere cognitive process of categorizing as a woman is not related to gamer identity, women who feel closely connected to other women are less inclined to self-identify as gamer. However, group appraisal of womanhood is positively related to identifying as a gamer. When taking into account stigmatization, experienced discrimination by male players seems to discourage women to label themselves as gamer.
Lightly supervised recognition for automatic alignment of large coherent speech recordings

Large quantities of audio data with associated text such as audiobooks are nowadays available. These data are attractive for a range of research areas as they include features that go beyond the level of single sentences. The proposed approach allows high quality transcriptions and associated alignments of this form of data to be automatically generated. It combines information from lightly supervised recognition and the original text to yield the final transcription. The scheme is fully automatic and has been successfully applied to a number of audiobooks. Performance measurements show low word/sentence error rates as well as high sentence boundary accuracy.
MapReduce : Distributed Computing for Machine Learning

We use Hadoop, an open-source implementation of Google’s distributed file system and the MapReduce framework for distributed data processing, on modestly-sized compute clusters to evaluate its efficacy for standard machine learning tasks. We show benchmark performance on searching and sorting tasks to investigate the effects of various system configurations. We also distinguish classes of machine-learning problems that are reasonable to address within the MapReduce framework, and offer improvements to the Hadoop implementation. We conclude that MapReduce is a good choice for basic operations on large datasets, although there are complications to be addressed for more complex machine learning tasks.
A master-slave blockchain paradigm and application in digital rights management

Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme (MSB) for pervasive computing that suitable for general PC, mobile device such as smart phones or PADs to participants in the working of mining and verification, in which we separated traditional blockchain model in 2 layer defined as master node layer and a series of slavery agents layer, then we proposed 2 approaches for partially computing model(P-CM) and non-computing of model(NCM) in the MSB blockchain, Finally large amounts of simulations manifest the proposed master-slave blockchain scheme is feasible, extendible and suitable for pervasive computing especially in the 5G generation environment, and can apply in the DRM-related applications.
The Digital Marauder's Map: A New Threat to Location Privacy

"The Marauder's Map" is a magical map in J. K. Rowling's fantasy series, "Harry Potter and the Prisoner of Azkaban". It shows all moving objects within the boundary of the "Hogwarts School of Witchcraft and Wizardry". In this paper, we introduce a similar attack to location privacy in wireless networks. Our system, namely the digital Marauder's map, can reveal the locations of WiFi-enabled mobile devices within the coverage area of a single high-gain antenna. The digital Marauder's map is built solely with off-the-shelf wireless equipments, and features a mobile design that can be quickly deployed to a new location and instantly used without training. We present a comprehensive set of theoretical analysis and experimental results which demonstrate the coverage and localization accuracy of the digital Marauder's map.