nils-herrmann/clean_scirepeval huggingface dataset:
Machine Learning for Intelligent Systems

Recent research in machine learning has focused on supervised induction for simple classification and reinforcement learning for simple reactive behaviors. In the process, the field has become disconnected from AI’s original goal of creating complete intelligent agents. In this paper, I review recent work on machine learning for planning, language, vision, and other topics that runs counter to this trend and thus holds interest for the broader AI research community. I also suggest some steps to encourage further research along these lines.
Intelligent Unmanned Air Vehicle Flight Systems

This paper describes an intelligent autonomous airborne flight capability that is being used as a test bed for future technology development. The unmanned air vehicles (UAVs) fly under autonomous control of both an onboard computer and an autopilot. The onboard computer provides the mission control and runs the autonomous Intelligent Controller (IC) software while the autopilot controls the vehicle navigation and flight control. The autonomous airborne flight system is described in detail. An IC architecture directly applicable to the design of unmanned vehicles is also presented. The UAVs may operate independently or in cooperation with one another to carry out a specified mission. The intelligent UAV flight system is used to evaluate and study autonomous UAV control as well as multi-vehicle collaborative control.
Automatic Simplification of Obfuscated JavaScript Code: A Semantics-Based Approach

JavaScript is a scripting language that is commonly used to create sophisticated interactive client-side web applications. However, JavaScript code can also be used to exploit vulnerabilities in the web browser and its extensions, and in recent years it has become a major mechanism for web-based malware delivery. In order to avoid detection, attackers often take advantage of the dynamic nature of JavaScript to create highly obfuscated code. This paper describes a semantics-based approach for automatic deobfuscation of JavaScript code. Experiments using a prototype implementation indicate that our approach is able to penetrate multiple layers of complex obfuscations and extract the core logic of the computation, which makes it easier to understand the behavior of the code.
Compact Proofs of Retrievability

In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client’s data. The central challenge is to build systems that are both efficient and provably secure—that is, it should be possible to extract the client’s data from any prover that passes a verification check. In this paper, we give the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski. Our first scheme, built from BLS signatures and secure in the random oracle model, features a proof-of-retrievability protocol in which the client’s query and server’s response are both extremely short. This scheme allows public verifiability: anyone can act as a verifier, not just the file owner. Our second scheme, which builds on pseudorandom functions (PRFs) and is secure in the standard model, allows only private verification. It features a proof-of-retrievability protocol with an even shorter server’s response than our first scheme, but the client’s query is long. Both schemes rely on homomorphic properties to aggregate a proof into one small authenticator value.
Hybrid Particle Swarm Optimiser with breeding and subpopulations

In this paper we present two hybrid Particle Swarm Optimisers combining the idea of the particle swarm with concepts from Evolutionary Algorithms. The hybrid PSOs combine the traditional velocity and position update rules with the ideas of breeding and subpopulations. Both hybrid models were tested and compared with the standard PSO and standard GA models. This is done to illustrate that PSOs with breeding strategies have the potential to achieve faster convergence and the potential to find a better solution. The objective of this paper is to describe how to make the hybrids benefit from genetic methods and to test their potential and competetiveness on function optimisation.
Computer Architecture with Associative Processor Replacing Last-Level Cache and SIMD Accelerator

This study presents a computer architecture, where a last-level cache and a SIMD accelerator are replaced by an associative processor. Associative processor combines data storage and data processing, and functions as a massively parallel SIMD processor and a memory at the same time. An analytic performance model of this computer architecture is introduced. Comparative analysis supported by cycle-accurate simulation and emulation shows that this architecture may outperform a conventional computer architecture comprising a SIMD coprocessor and a shared last-level cache while consuming less power.
Defining Open Source Software Project Success

Information systems success is one of the most widely used dependent variables in information systems research. In this paper, we identify a range of measures that can be used to assess the success of open source software (OSS) projects. We identify measures based on a review of the literature, a consideration of the OSS development process and an analysis of the opinions of OSS developers. For each measure, we provide examples of how they might be used in a study of OSS development.
Designing Automatic Meter Reading System Using Open Source Hardware and Software

Revised Jul 9, 2017 Accepted Aug 8, 2017 The importance of quality of the measured values is very dependent on the device that measures these values: the size of the sample, the time of measurement, periods of measurement, the mobility and the robustness of the device, etc. Contemporary devices intended for the measurement of physical quantities that are on the market vary in price, as well as and the quality of the measured values. The rule "the more expensive the better" is not necessarily always a rule that is valid because it all depends on the characteristics and capabilities of the device, and the customer’s needs. In this paper, a device based on "Open Source" components of hardware and software will be presented. Device was used to measure voltages and currents on low voltage networks, on which a virtually unlimited number of sensors can be added, and the device is assembled of components available on electronic components Internet.
From wireless sensor networks towards cyber physical systems

In the past two decades, a lot of research activities have been dedicated to the fields of mobile ad hoc network (MANET) and wireless sensor networks (WSN). More recently, the cyber physical system (CPS) has emerged as a promising direction to enrich the interactions between physical and virtual worlds. In this article, we first review some research activities inWSN, including networking issues and coverage and deployment issues. Then,we review some CPS platforms and systems that have been developed recently, including health care, navigation, rescue, intelligent transportation, social networking, and gaming applications. Through these reviews, we hope to demonstrate how CPS applications exploit the physical information collected by WSNs to bridge real and cyber spaces and identify important research challenges related to CPS designs.
Symbol Interdependency in Symbolic and Embodied Cognition

Whether computational algorithms such as latent semantic analysis (LSA) can both extract meaning from language and advance theories of human cognition has become a topic of debate in cognitive science, whereby accounts of symbolic cognition and embodied cognition are often contrasted. Albeit for different reasons, in both accounts the importance of statistical regularities in linguistic surface structure tends to be underestimated. The current article gives an overview of the symbolic and embodied cognition accounts and shows how meaning induction attributed to a specific statistical process or to activation of embodied representations should be attributed to language itself. Specifically, the performance of LSA can be attributed to the linguistic surface structure, more than special characteristics of the algorithm, and embodiment findings attributed to perceptual simulations can be explained by distributional linguistic information.
Potential of Estimating Soil Moisture Under Vegetation Cover by Means of PolSAR

In this paper, the potential of using polarimetric SAR (PolSAR) acquisitions for the estimation of volumetric soil moisture under agricultural vegetation is investigated. Soil-moisture estimation by means of SAR is a topic that is intensively investigated but yet not solved satisfactorily. The key problem is the presence of vegetation cover which biases soil-moisture estimates. In this paper, we discuss the problem of soil-moisture estimation in the presence of agricultural vegetation by means of L-band PolSAR images. SAR polarimetry allows the decomposition of the scattering signature into canonical scattering components and their quantification. We discuss simple canonical models for surface, dihedral, and vegetation scattering and use them to model and interpret scattering processes. The performance and modifications of the individual scattering components are discussed. The obtained surface and dihedral components are then used to retrieve surface soil moisture. The investigations cover, for the first time, the whole vegetation-growing period for three crop types using SAR data and ground measurements acquired in the frame of the AgriSAR campaign.
Unbiased look at dataset bias

Datasets are an integral part of contemporary object recognition research. They have been the chief reason for the considerable progress in the field, not just as source of large amounts of training data, but also as means of measuring and comparing performance of competing algorithms. At the same time, datasets have often been blamed for narrowing the focus of object recognition research, reducing it to a single benchmark performance number. Indeed, some datasets, that started out as data capture efforts aimed at representing the visual world, have become closed worlds unto themselves (e.g. the Corel world, the Caltech-101 world, the PASCAL VOC world). With the focus on beating the latest benchmark numbers on the latest dataset, have we perhaps lost sight of the original purpose? The goal of this paper is to take stock of the current state of recognition datasets. We present a comparison study using a set of popular datasets, evaluated based on a number of criteria including: relative data bias, cross-dataset generalization, effects of closed-world assumption, and sample value. The experimental results, some rather surprising, suggest directions that can improve dataset collection as well as algorithm evaluation protocols. But more broadly, the hope is to stimulate discussion in the community regarding this very important, but largely neglected issue.
A Turing Test for Computer Game Bots

In this paper, a version of the Turing Test is proposed, to test the ability of computer game playing agents (ldquobotsrdquo) to imitate human game players. The proposed test has been implemented as a bot design and programming competition, the 2K BotPrize Contest. The results of the 2008 competition are presented and analyzed. We find that the Test is challenging, but that current techniques show promise. We also suggest probable future directions for developing improved bots.
Service Personnel, Technology, and Their Interaction in Influencing Customer Satisfaction

Managing both the technologies and the personnel needed for providing high-quality, multichannel customer support creates a complex and persistent operational challenge. Adding to this difficulty, it is still unclear how service personnel and these new communication technologies interact to influence the customer’s perceptions of the service being provided. Motivated by both practical importance and inconsistent findings in the academic literature, this exploratory research examines the interaction of media richness, represented by three different technology contexts (telephone, e-mail, and online chat), with six customer service representative (CSR) characteristics and their influences on customer satisfaction. Using a large-sample customer survey data set, the article develops a multigroup structural equation model to analyze these interactions. Results suggest that CSR characteristics influence customer service satisfaction similarly across all three technology-mediated contexts. Of the characteristics studied, service representatives contribute to customer satisfaction more when they exhibit the characteristics of thoroughness, knowledgeableness, and preparedness, regardless of the richness of the medium used. Surprisingly, while three other CSR characteristics studied (courtesy, professionalism, and attentiveness) are traditionally believed to be important in face-to-face encounters, they had no significant impact on customer satisfaction in the technology-mediated contexts studied. Implications for both practitioners and researchers are drawn from the results and future research opportunities are
Software-based resolver-to-digital converter using the PLL tracking algorithm

In this paper, an all-digital resolver-to-digital conversion (RDC) system using phase-locked loop (PLL) tracking algorithm is proposed. Excitation signal is obtained from PWM module of a TMS320F2812 digital signal processor (DSP). According to the excitation signal, the resolver outputs differential sine and cosine signals, which are sampled by a 16-bit peripheral AD7606 module. The rotor angle position is estimated with the PLL tracking algorithm based on DSP. The proposed RDC system is applied to a servo synchronous motor with a resolver coupled to the shaft, and the electrical error of the resolver is ±10'. Finally, responding simulations and experiments are carried out. The results demonstrate that the RDC system has the features with simple hardware structure and low cost, and high-precision resolver-to-digital conversion is achieved.
EEG Signal Classification Using Wavelet Feature Extraction and Neural Networks

Decision support systems have been utilised since 1960, providing physicians with fast and accurate means towards more accurate diagnoses and increased tolerance when handling missing or incomplete data. This paper describes the application of neural network models for classification of electroencephalogram (EEG) signals. Decision making was performed in two stages: initially, a feature extraction scheme using the wavelet transform (WT) has been applied and then a learning-based algorithm classifier performed the classification. The performance of the neural model was evaluated in terms of training performance and classification accuracies and the results confirmed that the proposed scheme has potential in classifying the EEG signals
Latent Dirichlet Allocation

We propose a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams [6], and Hofmann's aspect model , also known as probabilistic latent semantic indexing (pLSI) . In the context of text modeling, our model posits that each document is generated as a mixture of topics, where the continuous-valued mixture proportions are distributed as a latent Dirichlet random variable. Inference and learning are carried out efficiently via variational algorithms. We present empirical results on applications of this model to problems in text modeling, collaborative filtering, and text classification.
Bootstrapping Fine-Grained Classifiers : ! Active Learning with a Crowd in the Loop

We propose an iterative crowd-enabled active learning algorithm for building high-precision visual classifiers from unlabeled images. Our method employs domain experts to identify a small number of examples of a specific visual event. These expert-labeled examples seed a classifier, which is then iteratively trained by active querying of a non-expert crowd. These non-experts actively refine the classifiers at every iteration by answering simple binary questions about the classifiers’ detections. The advantage of this approach is that experts efficiently shepherd an unsophisticated crowd into training a classifier capable of fine-grained distinctions. This obviates the need to label an entire dataset to obtain high-precision classifiers. We find these classifiers are advantageous for creating a large vocabulary of visual attributes for specialized taxonomies. We demonstrate our crowd active learning pipeline by creating classifiers for attributes related to North American birds and fashion.
Graph Based Relational Features for Collective Classification

Statistical Relational Learning (SRL) methods have shown that classification accuracy can be improved by integrating relations between samples. Techniques such as iterative classification or relaxation labeling achieve this by propagating information between related samples during the inference process. When only a few samples are labeled and connections between samples are sparse, collective inference methods have shown large improvements over standard feature-based ML methods. However, in contrast to feature based ML, collective inference methods require complex inference procedures and often depend on the strong assumption of label consistency among related samples. In this paper, we introduce new relational features for standard ML methods by extracting information from direct and indirect relations. We show empirically on three standard benchmark datasets that our relational features yield results comparable to collective inference methods. Finally we show that our proposal outperforms these methods when additional information is available.
Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks

Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs, and imposing smoothness priors on these graphs. However, such techniques do not fully exploit the local stationary structures on user/item graphs, and the number of parameters to learn is linear w.r.t. the number of users and items. We propose a novel approach to overcome these limitations by using geometric deep learning on graphs. Our matrix completion architecture combines a novel multi-graph convolutional neural network that can learn meaningful statistical graph-structured patterns from users and items, and a recurrent neural network that applies a learnable diffusion on the score matrix. Our neural network system is computationally attractive as it requires a constant number of parameters independent of the matrix size. We apply our method on several standard datasets, showing that it outperforms state-of-the-art matrix completion techniques.
Ambiguities in Spacebornene Synthetic Aperture Radar Systems

Several aspects of range and azimuth (time delay and Doppler) ambiguities in spaceborne synthetic aperture radars (SARs) are examined. An accurate method to evaluate the ratio of the intensities of the ambiguities to that of the signal is described. This method has been applied to the nominal SAR system on SEASAT and the variations of this ratio as a function of orbital latitude and attitude control error are discussed. It is also shown that the detailed range migration-azimuth phase history of an ambiguity is different from that of a signal. The images of ambiguities are, therefore, dispersed. Several examples of such dispersed images observed by the SEASAT SAR are presented. These dispersions are eliminated when the processing parameters are adjusted appropriately. Finally, a method is described which uses a set of multiple pulse repetition frequencies to determine the absolute values of the Doppler centroid frequencies for SARs with high carrier frequencies and relatively poor attitude measurements.
Motion-based calibration of multimodal sensor arrays

This paper formulates a new pipeline for automated extrinsic calibration of multi-sensor mobile platforms. The new method can operate on any combination of cameras, navigation sensors and 3D lidars. Current methods for extrinsic calibration are either based on special markers and/or chequerboards, or they require a precise parameters initialisation for the calibration to converge. These two limitations prevent them from being fully automatic. The method presented in this paper removes these restrictions. By combining information extracted from both, platform's motion estimates and external observations, our approach eliminates the need for special markers and also removes the need for manual initialisation. A third advantage is that the motion-based automatic initialisation does not require overlapping field of view between sensors. The paper also provides a method to estimate the accuracy of the resulting calibration. We illustrate the generalisation of our approach and validate its performance by showing results with two contrasting datasets. The first dataset was collected in a city with a car platform, and the second one was collected in a tree-crop farm with a Segway platform.
An index to quantify an individual’s scientific research output that takes into account the effect of multiple coauthorship

I propose the index $$\hbar$$ (“hbar”), defined as the number of papers of an individual that have citation count larger than or equal to the $$\hbar$$ of all coauthors of each paper, as a useful index to characterize the scientific output of a researcher that takes into account the effect of multiple authorship. The bar is higher for $$\hbar.$$
Deep Convolutional Neural Network Design Patterns

Recent research in the deep learning field has produced a plethora of new architectures. At the same time, a growing number of groups are applying deep learning to new applications. Some of these groups are likely to be composed of inexperienced deep learning practitioners who are baffled by the dizzying array of architecture choices and therefore opt to use an older architecture (i.e., Alexnet). Here we attempt to bridge this gap by mining the collective knowledge contained in recent deep learning research to discover underlying principles for designing neural network architectures. In addition, we describe several architectural innovations, including Fractal of FractalNet network, Stagewise Boosting Networks, and Taylor Series Networks (our Caffe code and prototxt files is available at https://github.com/iPhysicist/CNNDesignPatterns). We hope others are inspired to build on our preliminary work.
Learning to learn with the informative vector machine

This paper describes an efficient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn independently from the same GP prior. An efficient algorithm is obtained by extending the informative vector machine (IVM) algorithm to handle the multi-task learning case. The multi-task IVM (MTIVM) saves computation by greedily selecting the most informative examples from the separate tasks. The MT-IVM is also shown to be more efficient than random sub-sampling on an artificial data-set and more effective than the traditional IVM in a speaker dependent phoneme recognition task.