nils-herrmann/clean_scirepeval huggingface dataset:
A Framework for Multiple-Instance Learning

Multiple-instance learning is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. Each bag may contain many instances, but a bag is labeled positive even if only one of the instances in it falls within the concept. A bag is labeled negative only if all the instances in it are negative. We describe a new general framework, called Diverse Density, for solving multiple-instance learning problems. We apply this framework to learn a simple description of a person from a series of images (bags) containing that person, to a stock selection problem, and to the drug activity prediction problem.
Multi-Bias Non-linear Activation in Deep Neural Networks

As a widely used non-linear activation, Rectified Linear Unit (ReLU) separates noise and signal in a feature map by learning a threshold or bias. However, we argue that the classification of noise and signal not only depends on the magnitude of responses, but also the context of how the feature responses would be used to detect more abstract patterns in higher layers. In order to output multiple response maps with magnitude in different ranges for a particular visual pattern, existing networks employing ReLU and its variants have to learn a large number of redundant filters. In this paper, we propose a multi-bias non-linear activation (MBA) layer to explore the information hidden in the magnitudes of responses. It is placed after the convolution layer to decouple the responses to a convolution kernel into multiple maps by multi-thresholding magnitudes, thus generating more patterns in the feature space at a low computational cost. It provides great flexibility of selecting responses to different visual patterns in different magnitude ranges to form rich representations in higher layers. Such a simple and yet effective scheme achieves the stateof-the-art performance on several benchmarks.
Comparison of Hilbert transform and wavelet methods for the analysis of neuronal synchrony

The quantification of phase synchrony between neuronal signals is of crucial importance for the study of large-scale interactions in the brain. Two methods have been used to date in neuroscience, based on two distinct approaches which permit a direct estimation of the instantaneous phase of a signal [ (1998) 3291; Human Brain Mapping 8 (1999) 194]. The phase is either estimated by using the analytic concept of Hilbert transform or, alternatively, by convolution with a complex wavelet. In both methods the stability of the instantaneous phase over a window of time requires quantification by means of various statistical dependence parameters (standard deviation, Shannon entropy or mutual information). The purpose of this paper is to conduct a direct comparison between these two methods on three signal sets: (1) neural models; (2) intracranial signals from epileptic patients; and (3) scalp EEG recordings. Levels of synchrony that can be considered as reliable are estimated by using the technique of surrogate data. Our results demonstrate that the differences between the methods are minor, and we conclude that they are fundamentally equivalent for the study of neuroelectrical signals. This offers a common language and framework that can be used for future research in the area of synchronization.
Toward Adversarial Online Learning and the Science of Deceptive Machines

Intelligent systems rely on pattern recognition and signaturebased approaches for a wide range of sensors enhancing situational awareness. For example, autonomous systems depend on environmental sensors to perform their tasks and secure systems depend on anomaly detection methods. The availability of large amount of data requires the processing of data in a “streaming” fashion with online algorithms. Yet, just as online learning can enhance adaptability to a non-stationary environment, it introduces vulnerabilities that can be manipulated by adversaries to achieve their goals while evading detection. Although human intelligence might have evolved from social interactions, machine intelligence has evolved as a human intelligence artifact and been kept isolated to avoid ethical dilemmas. As our adversaries become sophisticated, it might be time to revisit this question and examine how we can combine online learning and reasoning leading to the science of deceptive and counter-deceptive machines.
The theory of signal detectability

The problem of signal detectability treated in this paper is the following: Suppose an observer is given a voltage varying with time during a prescribed observation interval and is asked to decide whether its source is noise or is signal plus noise. What method should the observer use to make this decision, and what receiver is a realization of that method? After giving a discussion of theoretical aspects of this problem, the paper presents specific derivations of the optimum receiver for a number of cases of practical interest. The receiver whose output is the value of the likelihood ratio of the input voltage over the observation interval is the answer to the second question no matter which of the various optimum methods current in the literature is employed including the Neyman Pearson observer, Siegert's ideal observer, and.Woodward and Davies' tlobserver.lV An optimum observer required to give a yes or no answer simply chooses an operating level and concludes that the receiver input arose from signal plus noise only when this level is exceeded by the output of his likelihood ratio receiver. Associated with each such operating level are conditional probabilities that the answer is a false alarm and the conditional probability of detection. Graphs of these quantities, called receiver operating characteristic, or ROC, curves are convenient for evaluating a receiver. If the detection problem is changed by varying, for example, the signal power, then a family of ROC curves is generated. Such things as betting curves can easily be obtained from such a family. The operating level to be used in a particular situation must be chosen by the observer. His choice will depend on such factors as the permissable false alarm rate, a priori probabilities, and relative importance of errors. With these theoretical aspects serving as sn introduction, attention is devoted to the derivation of explicit formulas for likelihood ratio, and for probability of detection and probability of false alarm, for a number of particular cases. Stationary, band-limited, white Gaussian noise is assumed.. The seven special cases which sre presented were chosen from the simplest problems in signal detection which closely represent practical situations. Two of the cases form a basis for the best available approximation to the important problem of finding probability of detection when the starting time of the signal, signal frequency, or both, are l l&TlOUn. Furthermore, in these two cases uncertainty in the signal can be varied, and a quantitative relationship between uncertainty and ability to detect signals is presented for these two rather general cases. The variety of examples presented should serve to suggest methods for attacking other simple signal detection problems and to give insight into problems too complicated to allow a direct solution.
Scalable triangulation-based logo recognition

We propose a scalable logo recognition approach that extends the common bag-of-words model and incorporates local geometry in the indexing process. Given a query image and a large logo database, the goal is to recognize the logo contained in the query, if any. We locally group features in triples using multi-scale Delaunay triangulation and represent triangles by signatures capturing both visual appearance and local geometry. Each class is represented by the union of such signatures over all instances in the class. We see large scale recognition as a sub-linear search problem where signatures of the query image are looked up in an inverted index structure of the class models. We evaluate our approach on a large-scale logo recognition dataset with more than four thousand classes.
Validation of the Female Sexual Function Index (FSFI) in women with female orgasmic disorder and in women with hypoactive sexual desire disorder.

The Female Sexual Functioning Index (FSFI; Rosen et al., 2000) is a self-report measure of sexual functioning that has been validated on a clinically diagnosed sample of women with female sexual arousal disorder. The present investigation extended the validation of the FSFI to include women with a primary clinical diagnosis of female orgasmic disorder (FOD; n = 71) or hypoactive sexual desire disorder (HSDD; n = 44). Internal consistency and divergent validity of the FSFI were within the acceptable range for these populations of women. Significant differences between women with FOD and controls and between women with HSDD and controls were noted for each of the FSFI domain and total scores.
Permutation tests for joinpoint regression with applications to cancer rates.

The identification of changes in the recent trend is an important issue in the analysis of cancer mortality and incidence data. We apply a joinpoint regression model to describe such continuous changes and use the grid-search method to fit the regression function with unknown joinpoints assuming constant variance and uncorrelated errors. We find the number of significant joinpoints by performing several permutation tests, each of which has a correct significance level asymptotically. Each p-value is found using Monte Carlo methods, and the overall asymptotic significance level is maintained through a Bonferroni correction. These tests are extended to the situation with non-constant variance to handle rates with Poisson variation and possibly autocorrelated errors. The performance of these tests are studied via simulations and the tests are applied to U.S. prostate cancer incidence and mortality rates.
A multi-agent approach for dynamic production and distribution scheduling

In an age when enterprises are increasingly dependent on their suppliers and customers, individual companies should broaden their scope in order to include other organisations participating in the same value chain. Consequently, different parties of the chain ought to exchange information to make sound decisions in order to cut down global costs or improve customer service. This paper proposes a multi-agent approach for dynamic production and distribution scheduling in a simple supply chain. The approach is based on the continuous supervision of the active schedules and routes, in order to detect possible exceptions and apply corrective actions in a real-time and coordinated manner with other parties. Finally, the paper focuses on the design phase of the distribution stage, where the problem is mathematically formulated as a dynamic vehicle routing problem with time windows and backhauls (DVRP-TWB), and three combinatorial optimisation meta-heuristics are proposed as solving techniques.
A BIOLOGICALLY INSPIRED VISUAL WORKING MEMORY

The ability to look multiple times through a series of pose-adjusted glimpses is fundamental to human vision. This critical faculty allows us to understand highly complex visual scenes. Short term memory plays an integral role in aggregating the information obtained from these glimpses and informing our interpretation of the scene. Computational models have attempted to address glimpsing and visual attention but have failed to incorporate the notion of memory. We introduce a novel, biologically inspired visual working memory architecture that we term the Hebb-Rosenblatt memory. We subsequently introduce a fully differentiable Short Term Attentive Working Memory model (STAWM) which uses transformational attention to learn a memory over each image it sees. The state of our HebbRosenblatt memory is embedded in STAWM as the weights space of a layer. By projecting different queries through this layer we can obtain goal-oriented latent representations for tasks including classification and visual reconstruction. Our model obtains highly competitive classification performance on MNIST and CIFAR-10. As demonstrated through the CelebA dataset, to perform reconstruction the model learns to make a sequence of updates to a canvas which constitute a parts-based representation. Classification with the self supervised representation obtained from MNIST is shown to be in line with the state of the art models (none of which use a visual attention mechanism). Finally, we show that STAWM can be trained under the dual constraints of classification and reconstruction to provide an interpretable visual sketchpad which helps open the ‘black-box’ of deep learning.
The Distributed Computing Paradigms: P2P, Grid, Cluster, Cloud, and Jungle

The distributed computing is done on many systems to solve a large scale problem. The growing of high-speed broadband networks in developed and developing countries, the continual increase in computing power, and the rapid growth of the Internet have changed the way. In it the society manages information and information services. Historically, the state of computing has gone through a series of platform and environmental changes. Distributed computing holds great assurance for using computer systems effectively. As a result, supercomputer sites and datacenters have changed from providing high performance floating point computing capabilities to concurrently servicing huge number of requests from billions of users. The distributed computing system uses multiple computers to solve large-scale problems over the Internet. It becomes data-intensive and network-centric. The applications of distributed computing have become increasingly wide-spread. In distributed computing, the main stress is on the large scale resource sharing and always goes for the best performance. In this article, we have reviewed the work done in the area of distributed computing paradigms. The main stress is on the evolving area of cloud computing.
Hand synergies: Integration of robotics and neuroscience for understanding the control of biological and artificial hands.

The term 'synergy' - from the Greek synergia - means 'working together'. The concept of multiple elements working together towards a common goal has been extensively used in neuroscience to develop theoretical frameworks, experimental approaches, and analytical techniques to understand neural control of movement, and for applications for neuro-rehabilitation. In the past decade, roboticists have successfully applied the framework of synergies to create novel design and control concepts for artificial hands, i.e., robotic hands and prostheses. At the same time, robotic research on the sensorimotor integration underlying the control and sensing of artificial hands has inspired new research approaches in neuroscience, and has provided useful instruments for novel experiments. The ambitious goal of integrating expertise and research approaches in robotics and neuroscience to study the properties and applications of the concept of synergies is generating a number of multidisciplinary cooperative projects, among which the recently finished 4-year European project "The Hand Embodied" (THE). This paper reviews the main insights provided by this framework. Specifically, we provide an overview of neuroscientific bases of hand synergies and introduce how robotics has leveraged the insights from neuroscience for innovative design in hardware and controllers for biomedical engineering applications, including myoelectric hand prostheses, devices for haptics research, and wearable sensing of human hand kinematics. The review also emphasizes how this multidisciplinary collaboration has generated new ways to conceptualize a synergy-based approach for robotics, and provides guidelines and principles for analyzing human behavior and synthesizing artificial robotic systems based on a theory of synergies.
Bethe-ADMM for Tree Decomposition based Parallel MAP Inference

We consider the problem of maximum a posteriori (MAP) inference in discrete graphical models. We present a parallel MAP inference algorithm called Bethe-ADMM based on two ideas: tree-decomposition of the graph and the alternating direction method of multipliers (ADMM). However, unlike the standard ADMM, we use an inexact ADMM augmented with a Bethe-divergence based proximal function, which makes each subproblem in ADMM easy to solve in parallel using the sum-product algorithm. We rigorously prove global convergence of Bethe-ADMM. The proposed algorithm is extensively evaluated on both synthetic and real datasets to illustrate its effectiveness. Further, the parallel Bethe-ADMM is shown to scale almost linearly with increasing number of cores.
The Extended Cohn-Kanade Dataset (CK+): A complete dataset for action unit and emotion-specified expression

In 2000, the Cohn-Kanade (CK) database was released for the purpose of promoting research into automatically detecting individual facial expressions. Since then, the CK database has become one of the most widely used test-beds for algorithm development and evaluation. During this period, three limitations have become apparent: 1) While AU codes are well validated, emotion labels are not, as they refer to what was requested rather than what was actually performed, 2) The lack of a common performance metric against which to evaluate new algorithms, and 3) Standard protocols for common databases have not emerged. As a consequence, the CK database has been used for both AU and emotion detection (even though labels for the latter have not been validated), comparison with benchmark algorithms is missing, and use of random subsets of the original database makes meta-analyses difficult. To address these and other concerns, we present the Extended Cohn-Kanade (CK+) database. The number of sequences is increased by 22% and the number of subjects by 27%. The target expression for each sequence is fully FACS coded and emotion labels have been revised and validated. In addition to this, non-posed sequences for several types of smiles and their associated metadata have been added. We present baseline results using Active Appearance Models (AAMs) and a linear support vector machine (SVM) classifier using a leave-one-out subject cross-validation for both AU and emotion detection for the posed data. The emotion and AU labels, along with the extended image data and tracked landmarks will be made available July 2010.
MUSIC-based algorithm for range-azimuth FMCW radar data processing without estimating number of targets

This paper presents an algorithm which based on 2D MUSIC technique and designed for the simultaneous estimation of range and azimuth target location in frequency modulate continuous wave (FMCW) radar systems. Forward-backward spatial smoothing technique is used to improve performance of the algorithm in fully or partially correlated situations. We show that 2D MUSIC spectrum can be estimate by using fast Fourier transform (FFT) without any information about number of targets that provide low computation complexity. The performance of the here-proposed algorithm is compared to the conventional digital beamforming technique (DBF). Simulation and experimental results are presented.
Detecting Code Smells in Python Programs

As a traditional dynamic language, Python is increasingly used in various software engineering tasks. However, due to its flexibility and dynamism, Python is a particularly challenging language to write code in and maintain. Consequently, Python programs contain code smells which indicate potential comprehension and maintenance problems. With the aim of supporting refactoring strategies to enhance maintainability, this paper describes how to detect code smells in Python programs. We introduce 11 Python smells and describe the detection strategy. We also implement a smell detection tool named Pysmell and use it to identify code smells in five real world Python systems. The results show that Pysmell can detect 285 code smell instances in total with the average precision of 97.7%. It reveals that Large Class and Large Method are most prevalent. Our experiment also implies Python programs may be suffering code smells further.
Deformation Constraints in a Mass-Spring Model to Describe Rigid Cloth Behavior

This paper describes a physically-based model for animating cloth objects, derived from elastically deformable models, and improved in order to take into account the non-elastic properties of woven fabrics . A cloth object is first approximated to a deformable surface composed of a network of masses and springs, the movement of which is evaluated using the numerical integration of the fundamental law of dynamics. We show that when a concentration of high stresses occurs in a small region of the surface, the local deformation becomes unrealistic compared to real deformations of textiles . With such an elastic model , the only solution to decrease these deformations has been so far to increase the stiffness of the deformed springs, but we show that it dramatically increases the cost of the algorithm. We present therefore a new method to adapt our model to the particularly stiff properties of textiles, inspired from dynamic inverse procedures. R esume Cet article decrit un modele physique d'animation des tissus, variante des modeles elastiques deformables, et ameliore de fa<;on a prendre en compte les proprietes non elastiques des textiles . Nous modelisons tout d 'abord une piece de tissu par une surface deformable, constituee d 'un reseau de masses et de ressorts. Son mouvement est evalue grace a I'integration numerique de la loi fondamentale de la dynamique. Nous montrons que lorsqu'une forte concentration de contraintes apparait a certains endroits de la surface, la deformation locale y devient irrealiste comparee aux deformations rencontrees dans les tissus reels . A vec un tel modele elastique, la seule solution permettant d'attenuer cette deformation etait jusqu'a present d 'augmenter la raideur des ressorts deformes, mais nous montrons que ceci faisait croitre dramatiquement le cout de I'algorithme. Nous presentons donc ici une nouvelle methode permettant d 'adapter notre mode le aux proprietes particulierement rigides des textiles, inspiree des procedures de dynamique inverse.
Novel Switched Reluctance Machine Configuration With Higher Number of Rotor Poles Than Stator Poles: Concept to Implementation

There is a great demand for efficient, quiet, reliable, and cost-effective motor drives for propulsion systems in hybrid and plug-in hybrid electric vehicles. Owing to a rigid structure and the absence of magnetic source on the rotor, a switched reluctance machine (SRM) is inherently robust and cost effective. In spite of these advantages, several challenges in the control of this machine remain an issue, including high levels of torque ripple, acoustic noise, and a relatively low torque density. This paper presents a new family of SRMs which have higher number of rotor poles than stator poles. Using a newly defined pole design formula, several novel combinations of the stator-rotor poles have been proposed. From the simulation and experimental analysis of a prototype 6/10 configuration, it has been observed that this machine produces higher torque per unit volume and comparable torque ripple when compared to a conventional 6/4 SRM with similar number of phases and constraints in volume. The results presented in this paper make this family of machines a strong contender for survivable high-performance applications for automotive propulsion systems. The simulation and experimental results for the prototype 6/10 configuration have been presented and compared to a conventional 6/4 design for verification.