nils-herrmann/clean_scirepeval huggingface dataset:
Grail: context-aware fixing of concurrency bugs

Writing efficient synchronization for multithreaded programs is notoriously hard. The resulting code often contains subtle concurrency bugs. Even worse, many bug fixes introduce new bugs. A classic example, seen widely in practice, is deadlocks resulting from fixing of an atomicity violation. These complexities have motivated the development of automated fixing techniques. Current techniques generate fixes that are typically conservative, giving up on available parallelism. Moreover, some of the techniques cannot guarantee the correctness of a fix, and may introduce deadlocks similarly to manual fix, whereas techniques that ensure correctness do so at the expense of even greater performance loss. We present Grail, a novel fixing algorithm that departs from previous techniques by simultaneously providing both correctness and optimality guarantees. Grail synthesizes bug-free yet optimal lock-based synchronization. To achieve this, Grail builds an analysis model of the buggy code that is both contextual, distinguishing different aliasing contexts to ensure efficiency, and global, accounting for the entire synchronization behavior of the involved threads to ensure correctness. Evaluation of Grail on 12 bugs from popular codebases confirms its practical advantages, especially compared with existing techniques: Grail patches are, in general, >=40% more efficient than the patches produced by other techniques, and incur only 2% overhead.
A radiomics model from joint FDG-PET and MRI texture features for the prediction of lung metastases in soft-tissue sarcomas of the extremities.

This study aims at developing a joint FDG-PET and MRI texture-based model for the early evaluation of lung metastasis risk in soft-tissue sarcomas (STSs). We investigate if the creation of new composite textures from the combination of FDG-PET and MR imaging information could better identify aggressive tumours. Towards this goal, a cohort of 51 patients with histologically proven STSs of the extremities was retrospectively evaluated. All patients had pre-treatment FDG-PET and MRI scans comprised of T1-weighted and T2-weighted fat-suppression sequences (T2FS). Nine non-texture features (SUV metrics and shape features) and forty-one texture features were extracted from the tumour region of separate (FDG-PET, T1 and T2FS) and fused (FDG-PET/T1 and FDG-PET/T2FS) scans. Volume fusion of the FDG-PET and MRI scans was implemented using the wavelet transform. The influence of six different extraction parameters on the predictive value of textures was investigated. The incorporation of features into multivariable models was performed using logistic regression. The multivariable modeling strategy involved imbalance-adjusted bootstrap resampling in the following four steps leading to final prediction model construction: (1) feature set reduction; (2) feature selection; (3) prediction performance estimation; and (4) computation of model coefficients. Univariate analysis showed that the isotropic voxel size at which texture features were extracted had the most impact on predictive value. In multivariable analysis, texture features extracted from fused scans significantly outperformed those from separate scans in terms of lung metastases prediction estimates. The best performance was obtained using a combination of four texture features extracted from FDG-PET/T1 and FDG-PET/T2FS scans. This model reached an area under the receiver-operating characteristic curve of 0.984 ± 0.002, a sensitivity of 0.955 ± 0.006, and a specificity of 0.926 ± 0.004 in bootstrapping evaluations. Ultimately, lung metastasis risk assessment at diagnosis of STSs could improve patient outcomes by allowing better treatment adaptation.
Planning by Incremental Dynamic Programming

Planning by Incremental Dynamic Programming Richard S. Sutton GTE Laboratories Incorporated Waltham, MA 02254 sutton@gte.com  This paper presents the basic results and ideas of dynamic programming as they relate most directly to the concerns of planning in AI. These form the theoretical basis for the incremental planning methods used in the integrated architecture Dyna. These incremental planning methods are based on continually updating an evaluation function and the situation-action mapping of a reactive system. Actions are generated by the reactive system and thus involve minimal delay, while the incremental planning process guarantees that the actions and evaluation function will eventually be optimal|no matter how extensive a search is required. These methods are well suited to stochastic tasks and to tasks in which a complete and accurate model is not available. For tasks too large to implement the situation-action mapping as a table, supervised-learning methods must be used, and their capabilities remain a signi cant limitation of the approach.
Peppermint oil for treatment of irritable bowel syndrome.

22 AM J HEALTH-SYST PHARM | VOLUME 73 | NUMBER 2 | JANUARY 15, 2016 Peppermint oil for treatment of irritable bowel syndrome Irritable bowel syndrome (IBS) is a chronic gastrointestinal disorder that affects 5–15% of people worldwide. Typically, patients with IBS experience abdominal pain or discomfort and constipation or diarrhea with other gastrointestinal symptoms, such as abdominal distention and bloating; these symptoms reduce quality of life and can be difficult to control with currently available prescription agents. For these reasons, patients are often compelled to try nonprescription therapies, including natural products. In studies conducted in Australia and the United Kingdom, about 20–50% of patients with IBS reported using complementary and alternative medicines. Thus, it is important that healthcare professionals are knowledgeable of these therapies, including dietary supplements such as peppermint oil. Historically, the ingestion of peppermint oil has been associated with effects on the gastrointestinal tract. It is a classic essential oil known to have carminative properties (i.e., it is a naturally occurring remedy thought to help decrease bloating and gas by allowing passage of flatus) and may even be beneficial as an antiemetic. Peppermint oil comes from a perennial herb (Mentha × piperita), a plant found across North America and Europe. Mentha × piperita is a sterile hybrid of two herbs,  (Menthaspicata) and water mint (Menthaaquatica). The main constituents of peppermint oil include menthol (35–55%), menthone (20–31%), menthyl acetate (3–10%), isomenthone, 1,8-cineole, limonene, b-myrcene, and carvone. Peppermint oil may be obtained through steam distillation of flowering parts that grow aboveground. It is a volatile oil, with menthol accounting for a majority of its potency. Due to the various constituents of peppermint oil, it has a variety of uses, including topical application as an antiseptic and for aches and pains, inhalation as aromatherapy, and oral formulations for flavoring or for use as digestive aids. Relaxation of intestinal muscle, both in vivo and in vitro, and relaxation of the lower esophageal sphincter have been reported with the use of peppermint oil, which is thought of as an antispasmodic that may confer benefits in conditions such as IBS. Several clinical studies of the use of peppermint oil for the treatment of
Discovering Credit Cardholders' Behavior by Multiple Criteria Linear Programming

In credit card portfolio management, predicting the cardholder’s spending behavior is a key to reduce the risk of bankruptcy. Given a set of attributes for major aspects of credit cardholders and predefined classes for spending behaviors, this paper proposes a classification model by using multiple criteria linear programming to discover behavior patterns of credit cardholders. It shows a general classification model that can theoretically handle any class-size. Then, it focuses on a typical case where the cardholders’ behaviors are predefined as four classes. A dataset from a major US bank is used to demonstrate the applicability of the proposed method.
Cloud robotics: architecture, challenges and applications

We extend the computation and information sharing capabilities of networked robotics by proposing a cloud robotic architecture. The cloud robotic architecture leverages the combination of an ad-hoc cloud formed by machine-to-machine (M2M) communications among participating robots, and an infrastructure cloud enabled by machine-to-cloud (M2C) communications. Cloud robotics utilizes an elastic computing model, in which resources are dynamically allocated from a shared resource pool in the ubiquitous cloud, to support task offloading and information sharing in robotic applications. We propose and evaluate communication protocols, and several elastic computing models to handle different applications. We discuss the technical challenges in computation, communications and security, and illustrate the potential benefits of cloud robotics in different applications.
A Novel Modular Design and Modeling Methodology for High Speed High Density Die Package PCB Co-Simulation and Model Library Creation

This paper proposes a novel modular design concept for package physical design, and a modularized and parameterized modeling technique for package model library creation. The proposed modular design reduces the physical design/review cycle by ~50% and can significantly improve the performance consistency. The modularized modeling technique requires the breakdown of the full package model into vertical and horizontal subsets. These subsets are either re-usable or scalable for generating a parameterized full package model. This methodology takes into account the discontinuities at all module interfaces and can therefore accurately capture the entire dimension mismatch. It renders the simulation time 2-5x less, enabling a more efficient die-package-PCB co-simulation. This modeling methodology is used to generate package model library of transceiver channel S parameters and propagation delay. The modeling methodology is validated through comparison to traditional practices in both frequency and time domains and is further correlated to the lab measurements.
Principled Hybrids of Generative and Discriminative Models

When labelled training data is plentiful, discriminative techniques are widely used since they give excellent generalization performance. However, for large-scale applications such as object recognition, hand labelling of data is expensive, and there is much interest in semi-supervised techniques based on generative models in which the majority of the training data is unlabelled. Although the generalization performance of generative models can often be improved by ‘training them discriminatively’, they can then no longer make use of unlabelled data. In an attempt to gain the benefit of both generative and discriminative approaches, heuristic procedure have been proposed [2, 3] which interpolate between these two extremes by taking a convex combination of the generative and discriminative objective functions. In this paper we adopt a new perspective which says that there is only one correct way to train a given model, and that a ‘discriminatively trained’ generative model is fundamentally a new model [7]. From this viewpoint, generative and discriminative models correspond to specific choices for the prior over parameters. As well as giving a principled interpretation of ‘discriminative training’, this approach opens door to very general ways of interpolating between generative and discriminative extremes through alternative choices of prior. We illustrate this framework using both synthetic data and a practical example in the domain of multi-class object recognition. Our results show that, when the supply of labelled training data is limited, the optimum performance corresponds to a balance between the purely generative and the purely discriminative.
SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft

A tutorial introduction to designs in unifying theories of programming p. 40 An integration of program analysis and automated theorem proving p. 67 Verifying controlled components p. 87 Efficient CSP[subscript Z] data abstraction p. 108 State/event-based software model checking p. 128 Formalising behaviour trees with CSP p. 148 Generating MSCs from an integrated formal specification language p. 168 UML to B : formal verification of object-oriented models p. 187 Software verification with integrated data type refinement for integer arithmetic p. 207
Efficient and Consistent Flow Update for Software Defined Networks

Software defined network (SDN) provides flexible and scalable routing by separating control plane and data plane. With centralized control, SDN has been widely used in traffic engineering, link failure recovery, and load balancing. This work considers the flow update problem, where a set of flows need to be migrated or rearranged due to change of network status. During flow update, efficiency and consistency are two main challenges. Efficiency refers to how fast these updates are completed, while consistency refers to prevention of blackholes, loops, and network congestions during updates. This paper proposes a scheme that maintains all these properties. It works in four phases. The first phase partitions flows into shorter routing segments to increase update parallelism. The second phase generates a global dependency graph of these segments to be updated. The third phase conducts actual updates and then adjusts dependency graphs accordingly. The last phase deals with deadlocks, if any, and then loops back to phase three if necessary. Through simulations, we validate that our scheme not only ensures freedom of blackholes, loops, congestions, and deadlocks during flow updates, but is also faster than existing schemes.
Acquiring evolvability through adaptive representations

Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be efficient on complex problems, few empirical studieshave been conducted in such domains. In this paper, three neural network representations, a direct encoding, a complexifying encoding, and an implicit encoding capable of adapting the genotype-phenotype mapping are compared on Nothello, a complex game playing domain from the AAAI General Game Playing Competition. Implicit encoding makes the search more efficient and uses several times fewer parameters. Random mutation leads to highly structured phenotypic variation that is acquired during the course of evolution rather than built into the representation itself. Thus, adaptive representations learn to become evolvable, and furthermore do so in a way that makes search efficient on difficult coevolutionary problems.
Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations

In this paper we establish rigorous benchmarks for image classifier robustness. Our first benchmark, IMAGENET-C, standardizes and expands the corruption robustness topic, while showing which classifiers are preferable in safety-critical applications. Unlike recent robustness research, this benchmark evaluates performance on commonplace corruptions not worst-case adversarial corruptions. We find that there are negligible changes in relative corruption robustness from AlexNet to ResNet classifiers, and we discover ways to enhance corruption robustness. Then we propose a new dataset called ICONS-50 which opens research on a new kind of robustness, surface variation robustness. With this dataset we evaluate the frailty of classifiers on new styles of known objects and unexpected instances of known classes. We also demonstrate two methods that improve surface variation robustness. Together our benchmarks may aid future work toward networks that learn fundamental class structure and also robustly generalize.
Audio Signal Classification: History and Current Techniques

Audio signal classification (ASC) consists of extracting relevant features from a sound, and of using these features to identify into which of a set of classes the sound is most likely to fit. The feature extraction and grouping algorithms used can be quite diverse depending on the classification domain of the application. This paper presents background necessary to understand the general research domain of ASC, including signal processing, spectral analysis, psychoacoustics and auditory scene analysis. Also presented are the basic elements of classification systems. Perceptual and physical features are discussed, as well as clustering algorithms and analysis duration. Neural nets and hidden Markov models are discussed as they relate to ASC. These techniques are presented with an overview of the current state of the ASC research literature.
Pedestrian Behaviour Monitoring: Methods and Experiences

The investigation of pedestrian spatio-temporal behaviour is of particular interest in many different research fields. Disciplines like travel behaviour research and tourism research, social sciences, artificial intelligence, geoinformation and many others have approached this subject from different perspectives. Depending on the particular research questions, various methods of data collection and analysis have been developed and applied in order to gain insight into specific aspects of human motion behaviour and the determinants influencing spatial activities. In this contribution, we provide a general overview about most commonly used methods for monitoring and analysing human spatio-temporal behaviour. After discussing frequently used empirical methods of data collection and emphasising related advantages and limitations, we present seven case studies concerning the collection and analysis of human motion behaviour following different purposes.
A Global Hypothesis Verification Framework for 3D Object Recognition in Clutter

Pipelines to recognize 3D objects despite clutter and occlusions usually end up with a final verification stage whereby recognition hypotheses are validated or dismissed based on how well they explain sensor measurements. Unlike previous work, we propose a Global Hypothesis Verification (GHV) approach which regards all hypotheses jointly so as to account for mutual interactions. GHV provides a principled framework to tackle the complexity of our visual world by leveraging on a plurality of recognition paradigms and cues. Accordingly, we present a 3D object recognition pipeline deploying both global and local 3D features as well as shape and color. Thereby, and facilitated by the robustness of the verification process, diverse object hypotheses can be gathered and weak hypotheses need not be suppressed too early to trade sensitivity for specificity. Experiments demonstrate the effectiveness of our proposal, which significantly improves over the state-of-art and attains ideal performance (no false negatives, no false positives) on three out of the six most relevant and challenging benchmark datasets.
Multi-view Clustering via Multi-manifold Regularized Nonnegative Matrix Factorization

Multi-view clustering integrates complementary information from multiple views to gain better clustering performance rather than relying on a single view. NMF based multi-view clustering algorithms have shown their competitiveness among different multi-view clustering algorithms. However, NMF fails to preserve the locally geometrical structure of the data space. In this paper, we propose a multi-manifold regularized nonnegative matrix factorization framework (MMNMF) which can preserve the locally geometrical structure of the manifolds for multi-view clustering. MMNMF regards that the intrinsic manifold of the dataset is embedded in a convex hull of all the views' manifolds, and incorporates such an intrinsic manifold and an intrinsic (consistent) coefficient matrix with a multi-manifold regularizer to preserve the locally geometrical structure of the multi-view data space. We use linear combination to construct the intrinsic manifold, and propose two strategies to find the intrinsic coefficient matrix, which lead to two instances of the framework. Experimental results show that the proposed algorithms outperform existing NMF based algorithms for multi-view clustering.
Confusion Matrix

A confusion matrix (Kohavi and Provost, 1998) contains information about actual and predicted classifications done by a classification system. Performance of such systems is commonly evaluated using the data in the matrix. The following table shows the confusion matrix for a two class classifier. The entries in the confusion matrix have the following meaning in the context of our study: ● a is the number of correct predictions that an instance is negative, ● b is the number of incorrect predictions that an instance is positive, ● c is the number of incorrect of predictions that an instance negative, and ● d is the number of correct predictions that an instance is positive. Predicted Negative Positive Actual Negative a b Positive c d
Humpectomy and spreader flaps.

In a primary rhinoplasty that requires a humpectomy, the dorsal aspect of the upper lateral cartilages is commonly discarded. Many of these patients need spreader grafts to reconstruct the middle third of the nose. However, it is possible to reconstruct the upper lateral cartilages into "spreader flaps" that act much like spreader grafts. In the process of making spreader flaps, an incremental humpectomy is performed on the dorsal septum and bony hump. This humpectomy procedure is more accurate than the conventional humpectomy that involves resection of the bone, and septum as a single unit. The open and closed approaches of this technique are discussed in this article.
Based on the Texture Analysis to Inspect the Tread Worn Status on the Tire

Tire is the most important equipment, especial drive on the road. To increase friction and safety, variant treads are in the surface of tire. However, the friction and safety is decrease, while the tread worn. This study proposed Texture Based Region of Interested (TBRI) algorithm to evaluate ROI which bound the specific textures that is suitable to evaluate the status of tread worn by Discriminative Robust Local Ternary Pattern (DRLTP). Consequently, the study proposed a computer vision technology to inspect the status of the tread.
Navigating the massive world of reddit: using backbone networks to map user interests in social media

In the massive online worlds of social media, users frequently rely on organizing themselves around specific topics of interest to find and engage with like-minded people. However, navigating these massive worlds and finding topics of specific interest often proves difficult because the worlds are mostly organized haphazardly, leaving users to find relevant interests by word of mouth or using a basic search feature. Here, we report on a method using the backbone of a network to create a map of the primary topics of interest in any social network. To demonstrate the method, we build an interest map for the social news web site reddit and show how such a map could be used to navigate a social media world. Moreover, we analyze the network properties of the reddit social network and find that it has a scale-free, small-world, and modular community structure, much like other online social networks such as Facebook and Twitter. We suggest that the integration of interest maps into popular social media platforms will assist users in organizing themselves into more specific interest groups, which will help alleviate the overcrowding effect often observed in large online communities. Subjects Network Science and Online Social Networks, Visual Analytics