nils-herrmann/clean_scirepeval huggingface dataset:
Real-Time Myoprocessors for a Neural Controlled Powered Exoskeleton Arm

Exoskeleton robots are promising assistive/rehabilitative devices that can help people with force deficits or allow the recovery of patients who have suffered from pathologies such as stroke. The key component that allows the user to control the exoskeleton is the human machine interface (HMI). Setting the HMI at the neuro-muscular level may lead to seamless integration and intuitive control of the exoskeleton arm as a natural extension of the human body. At the core of the exoskeleton HMI there is a model of the human muscle, the "myoprocessor," running in real-time and in parallel to the physiological muscle, that predicts joint torques as a function of the joint kinematics and neural activation levels. This paper presents the development of myoprocessors for the upper limb based on the Hill phenomenological muscle model. Genetic algorithms are used to optimize the internal parameters of the myoprocessors utilizing an experimental database that provides inputs to the model and allows for performance assessment. The results indicate high correlation between joint moment predictions of the model and the measured data. Consequently, the myoprocessor seems an adequate model, sufficiently robust for further integration into the exoskeleton control system
How Smart is Smart Money ? An Empirical Two-Sided Matching Model of Venture Capital

In capital markets, top-tier investors may have better abilities to monitor and manage their investments. In addition, there may be sorting in these markets, with top-tier investors investing in the best deals, second-tier investors investing in the second-best deals, and so forth. To separate and quantify these two effects, a structural model of the market for venture capital is developed and estimated. The model is a two-sided matching model that allows for sorting in equilibrium. It is found that more experienced venture capitalists make more successful investments. This is explained both by their value-adding influence on their investments, and by their access to late stage and biotechnology companies, companies that are more successful on average. Sorting is found to be prevalent and has general implications for the interpretation of empirical evidence of the impact of investors on their investments.
CRMA: collision-resistant multiple access

Efficiently sharing spectrum among multiple users is critical to wireless network performance. In this paper, we propose a novel spectrum sharing protocol called Collision-Resistant Multiple Access (CRMA) to achieve high efficiency. In CRMA, each transmitter views the OFDM physical layer as multiple orthogonal but sharable channels, and independently selects a few channels for transmission. The transmissions that share the same channel naturally add up in the air. The receiver extracts the received signals from all the channels and efficiently decodes the transmissions by solving a simple linear system. We implement our approach in the Qualnet simulator and show that it yields significant improvement over existing spectrum sharing schemes. We also demonstrate the feasibility of our approach using implementation and experiments on GNU Radios.
A natural language planner interface for mobile manipulators

Natural language interfaces for robot control aspire to find the best sequence of actions that reflect the behavior intended by the instruction. This is difficult because of the diversity of language, variety of environments, and heterogeneity of tasks. Previous work has demonstrated that probabilistic graphical models constructed from the parse structure of natural language can be used to identify motions that most closely resemble verb phrases. Such approaches however quickly succumb to computational bottlenecks imposed by construction and search the space of possible actions. Planning constraints, which define goal regions and separate the admissible and inadmissible states in an environment model, provide an interesting alternative to represent the meaning of verb phrases. In this paper we present a new model called the Distributed Correspondence Graph (DCG) to infer the most likely set of planning constraints from natural language instructions. A trajectory planner then uses these planning constraints to find a sequence of actions that resemble the instruction. Separating the problem of identifying the action encoded by the language into individual steps of planning constraint inference and motion planning enables us to avoid computational costs associated with generation and evaluation of many trajectories. We present experimental results from comparative experiments that demonstrate improvements in efficiency in natural language understanding without loss of accuracy.
Computers and Creativity

The Painting Fool is software that we hope will one day be taken seriously as a creative artist in its own right. This aim is being pursued as an Artificial Intelligence (AI) project, with the hope that the technical difficulties overcome along the way will lead to new and improved generic AI techniques. It is also being pursued as a sociological project, where the effect of software which might be deemed as creative is tested in the art world and the wider public. In this chapter, we summarise our progress so far in The Painting Fool project. To do this, we first compare and contrast The Painting Fool with software of a similar nature arising from AI and graphics projects. We follow this with a discussion of the guiding principles from Computational Creativity research that we adhere to in building the software. We then describe five projects with The Painting Fool where our aim has been to produce increasingly interesting and culturally valuable pieces of art. We end by discussing the issues raised in building an automated painter, and describe further work and future prospects for the project. By studying both the technical difficulties and sociological issues involved in engineering software for creative purposes, we hope to help usher in a new era where computers routinely act as our creative collaborators, as well as independent and creative artists, musicians, writers, designers, engineers and scientists, and contribute in meaningful and interesting ways to human culture.
Emotion recognition for human-machine communication

The ability to recognize emotion is one of the hallmarks of emotion intelligence. This paper proposed to recognize emotion using physiological signals obtained from multiple subjects. IAPS images were used to elicit target emotions. Five physiological signals: Blood volume pulse (BVP), Electromyography (EMG), Skin Conductance (SC), Skin Temperature (SKT) and Respiration (RESP) were selected to extract 30 features for recognition. Two pattern classification methods, Fisher discriminant and SVM method are used and compared for emotional state classification. The experimental results indicate that the proposed method provides very stable and successful emotional classification performance as 92% over six emotional states.
Unsupervised Discovery of Morphemes

We present two methods for unsupervised segmentation of words into morphemelike units. The model utilized is especially suited for languages with a rich morphology, such as Finnish. The first method is based on the Minimum Description Length (MDL) principle and works online. In the second method, Maximum Likelihood (ML) optimization is used. The quality of the segmentations is measured using an evaluation method that compares the segmentations produced to an existing morphological analysis. Experiments on both Finnish and English corpora show that the presented methods perform well compared to a current stateof-the-art system.
High-performance complex event processing over streams

In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. These complex event queries filter and correlate events to match specific patterns, and transform the relevant events into new composite events for the use of external monitoring applications. Stream-based execution of these queries enables time-critical actions to be taken in environments such as supply chain management, surveillance and facility management, healthcare, etc. We first propose a complex event language that significantly extends existing event languages to meet the needs of a range of RFID-enabled monitoring applications. We then describe a query plan-based approach to efficiently implementing this language. Our approach uses native operators to efficiently handle query-defined sequences, which are a key component of complex event processing, and pipeline such sequences to subsequent operators that are built by leveraging relational techniques. We also develop a large suite of optimization techniques to address challenges such as large sliding windows and intermediate result sizes. We demonstrate the effectiveness of our approach through a detailed performance analysis of our prototype implementation under a range of data and query workloads as well as through a comparison to a state-of-the-art stream processor.
A Survey of Context-Aware Mobile Computing Research

Context-aware computing is a mobile computing paradigm in which applications can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity). Since it was proposed about a decade ago, many researchers have studied this topic and built several context-aware applications to demonstrate the usefulness of this new technology. Context-aware applications (or the system infrastructure to support them), however, have never been widely available to everyday users. In this survey of research on context-aware systems and applications, we looked in depth at the types of context used and models of context information, at systems that support collecting and disseminating context, and at applications that adapt to the changing context. Through this survey, it is clear that context-aware research is an old but rich area for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.
A 0 . 5V Ultra-Low-Power OTA With Improved Gain and Bandwidth

In the context of ultra-low-power and ultra-low-voltage operational transconductance amplifiers (OTAs), there is the inconvenience of low unity-gain frequency and DC gain. In this paper, we presented a 0.5-V improved ultra-low-power OTA using the transistors operate in weak inversion. The proposed topology based on a bulk-driven input differential pair employed an under-weak-inversion gain-stage in the Miller capacitor feedback path to improve the “pole-splitting” effect. Simulations in a standard 0.18 μm CMOS process resulted on considerable enhancement in the unity-gain bandwidth and the DC gain as well. The topology presents rail-to-rail input and output swings and consumes only 1 μW.
Certification of Programs for Secure Information Flow

ertification mechanism for verifying the secure flow of information through a program. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily be included in the analysis phase of most existing compilers. Appropriate semantics are presented and proved correct. An important application is the confinement problem: The mechanism can prove that a program cannot cause supposedly nonconfidential results to depend on confidential input data.
A Mobile Transaction Model That Captures Both the Data and Movement Behavior

Unlike distributed transactions, mobile transactions do not originate and end at the same site. The implication of the movement of such transactions is that classical atomicity, concurrency and recovery solutions must be revisited to capture the movement behavior. As an effort in this direction, we define a model of mobile transactions by building on the concepts of split transactions and global transactions in a multidatabase environment. Our view of mobile transactions, called Kangaroo Transactions, incorporates the property that transactions in a mobile computing system hop from one base station to another as the mobile unit moves through cells. Our model is the first to capture this movement behavior as well as the data behavior which reflects the access to data located in databases throughout the static network. The mobile behavior is dynamic and is realized in our model via the use of split operations. The data access behavior is captured by using the idea of global and local transactions in a multidatabase system.
Actor-Critic based Training Framework for Abstractive Summarization

We present a training framework for neural abstractive summarization based on actor-critic approaches from reinforcement learning. In the traditional neural network based methods, the objective is only to maximize the likelihood of the predicted summaries, no other assessment constraints are considered, which may generate low-quality summaries or even incorrect sentences. To alleviate this problem, we employ an actor-critic framework to enhance the training procedure. For the actor, we employ the typical attention based sequenceto-sequence (seq2seq) framework as the policy network for summary generation. For the critic, we combine the maximum likelihood estimator with a well designed global summary quality estimator which is a neural network based binary classifier aiming to make the generated summaries indistinguishable from the human-written ones. Policy gradient method is used to conduct the parameter learning. An alternating training strategy is proposed to conduct the joint training of the actor and critic models. Extensive experiments on some benchmark datasets in different languages show that our framework achieves improvements over the state-of-the-art methods.
Medusa: a programming framework for crowd-sensing applications

The ubiquity of smartphones and their on-board sensing capabilities motivates crowd-sensing, a capability that harnesses the power of crowds to collect sensor data from a large number of mobile phone users. Unlike previous work on wireless sensing, crowd-sensing poses several novel requirements: support for humans-in-the-loop to trigger sensing actions or review results, the need for incentives, as well as privacy and security. Beyond existing crowd-sourcing systems, crowd-sensing exploits sensing and processing capabilities of mobile devices. In this paper, we design and implement Medusa, a novel programming framework for crowd-sensing that satisfies these requirements. Medusa provides high-level abstractions for specifying the steps required to complete a crowd-sensing task, and employs a distributed runtime system that coordinates the execution of these tasks between smartphones and a cluster on the cloud. We have implemented ten crowd-sensing tasks on a prototype of Medusa. We find that Medusa task descriptions are two orders of magnitude smaller than standalone systems required to implement those crowd-sensing tasks, and the runtime has low overhead and is robust to dynamics and resource attacks.
The Power of Word Clusters for Text Classification

The recently introducedInformation Bottleneck method  provides an information theoretic framework, for extr acting features of one variable, that are relevant for the values of an ther variable. Several previous works already suggeste d applying this method for document clustering, gene expression data a nalysis, spectral analysis and more. In this work we present a novel implementation of this method for supervised text cla ssification. Specifically, we apply the information bottlen eck method to find word-clusters that preserve the information a bout document categories and use these clusters as features for classification. Previous work  used a similar clustering procedure to show that word-clusters can significantly redu c the feature space dimensionality, with only a minor change in cl assification accuracy. In this work we present similar resul ts and go further to show that when the training sample is small word clusters can yield significant improvement in classificatio n accuracy (up to18%) over the performance using the words directly.
Weakly Supervised PatchNets: Describing and Aggregating Local Patches for Scene Recognition

Traditional feature encoding scheme (e.g., Fisher vector) with local descriptors (e.g., SIFT) and recent convolutional neural networks (CNNs) are two classes of successful methods for image recognition. In this paper, we propose a hybrid representation, which leverages the discriminative capacity of CNNs and the simplicity of descriptor encoding schema for image recognition, with a focus on scene recognition. To this end, we make three main contributions from the following aspects. First, we propose a patch-level and end-to-end architecture to model the appearance of local patches, called PatchNet. PatchNet is essentially a customized network trained in a weakly supervised manner, which uses the image-level supervision to guide the patch-level feature extraction. Second, we present a hybrid visual representation, called VSAD, by utilizing the robust feature representations of PatchNet to describe local patches and exploiting the semantic probabilities of PatchNet to aggregate these local patches into a global representation. Third, based on the proposed VSAD representation, we propose a new state-of-the-art scene recognition approach, which achieves an excellent performance on two standard benchmarks: MIT Indoor67 (86.2%) and SUN397 (73.0%).
Improved ID3 algorithm

as the classical algorithm of the decision tree classification algorithm, ID3 is famous for the merits of high classifying speed easy, strong learning ability and easy construction. But when use it to classify, there does exist the problem of inclining to chose attributions which has many values, which affects its practicality. This paper for solving the problem a decision tree algorithm based on attribute-importance is proposed. The improved algorithm uses attribute-importance to increase information gain of attribution which has fewer attributions and compares ID3 with improved ID3 by an example. The experimental analysis of the data show that the improved ID3 algorithm can get more reasonable and more effective rules.
Overlapping Community Detection in Temporal Text Networks

Network is a powerful language to represent relational data. One way to understand network is to analyze groups of nodes which share same properties or functions. The task of discovering such groups is known as community detection. Generally, two types of information can be utilized to fulfill this task, i.e., the link structures and the node attributes. The temporal text network is a special kind of network that contains both sources of information. Typical representatives include online blog networks, the World Wide Web (WWW) and academic citation networks.In this paper, we study the problem of overlapping community detection in temporal text network. By examining 32 large temporal text networks, we find a lot of edges connecting two nodes with no common community and discover that nodes in the same community share similar textual contents. This scenario cannot be quantitatively modeled by practically all existing community detection methods. Motivated by these empirical observations, we propose MAGIC (Model Affiliation Graph with Interacting Communities), a generative model which captures community interactions and considers the information from both link structures and node attributes. Our experiments on three categories of datasets show that MAGIC achieves obvious improvements over 4 state-of-theart methods in terms of 4 widely-used metrics. CCS Concepts •Data Mining → Graph Mining; •Networks → Network Clustering;
Local information statistics of LBP and HOG for pedestrian detection

We present several methods of pedestrian detection in intensity images using different local statistical measures applied to two classes of features extensively used in pedestrian detection: uniform local binary patterns - LBP and a modified version of histogram of oriented gradients - HOG. Our work extracts local binary patterns and magnitude and orientation of the gradient image. Then we divide the image into blocks. Within each block we extract different statistics like: histogram (weighted by the gradient magnitude in the case of HOG), information, entropy and energy of the local binary code. We use Adaboost for training four classifiers and we analyze the classification error of each method on the Daimler benchmark pedestrian dataset.
Closing the learning-planning loop with predictive state representations

A central problem in artificial intelligence is that of planning to maximize future reward under uncertainty in a partially observable environment. In this paper we propose and demonstrate a novel algorithm which accurately learns a model of such an environment directly from sequences of action-observation pairs. We then close the loop from observations to actions by planning in the learned model and recovering a policy which is near-optimal in the original environment. Specifically, we present an efficient and statistically consistent spectral algorithm for learning the parameters of a Predictive State Representation (PSR). We demonstrate the algorithm by learning a model of a simulated high-dimensional, vision-based mobile robot planning task, and then perform approximate point-based planning in the learned PSR. Analysis of our results shows that the algorithm learns a state space which efficiently captures the essential features of the environment. This representation allows accurate prediction with a small number of parameters, and enables successful and efficient planning.