nils-herrmann/clean_scirepeval huggingface dataset:
A Maximum-Entropy-Inspired Parser

We present a new parser for parsing down to Penn tree-bank style parse trees that achieves 90.1% average precision/recall for sentences of length 40 and less, and 89.5% for sentences of length 100 and less when trMned and tested on the previously established [5,9,10,15,17] "standard" sections of the Wall Street Journal treebank. This represents a 13% decrease in error rate over the best single-parser results on this corpus [9]. The major technical innovation is tire use of a "ma~ximum-entropy-inspired" model for conditioning and smoothing that let us successfully to test and combine many different conditioning events. We also present some partial results showing the effects of different conditioning information, including a surprising 2% improvement due to guessing the lexical head's pre-terminal before guessing the lexical head.
Signal quality indices and data fusion for determining clinical acceptability of electrocardiograms.

A completely automated algorithm to detect poor-quality electrocardiograms (ECGs) is described. The algorithm is based on both novel and previously published signal quality metrics, originally designed for intensive care monitoring. The algorithms have been adapted for use on short (5-10 s) single- and multi-lead ECGs. The metrics quantify spectral energy distribution, higher order moments and inter-channel and inter-algorithm agreement. Seven metrics were calculated for each channel (84 features in all) and presented to either a multi-layer perceptron artificial neural network or a support vector machine (SVM) for training on a multiple-annotator labelled and adjudicated training dataset. A single-lead version of the algorithm was also developed in a similar manner. Data were drawn from the PhysioNet Challenge 2011 dataset where binary labels were available, on 1500 12-lead ECGs indicating whether the entire recording was acceptable or unacceptable for clinical interpretation. We re-annotated all the leads in both the training set (1000 labelled ECGs) and test dataset (500 12-lead ECGs where labels were not publicly available) using two independent annotators, and a third for adjudication of differences. We found that low-quality data accounted for only 16% of the ECG leads. To balance the classes (between high and low quality), we created extra noisy data samples by adding noise from PhysioNet's noise stress test database to some of the clean 12-lead ECGs. No data were shared between training and test sets. A classification accuracy of 98% on the training data and 97% on the test data were achieved. Upon inspection, incorrectly classified data were found to be borderline cases which could be classified either way. If these cases were more consistently labelled, we expect our approach to achieve an accuracy closer to 100%.
An MPC/hybrid system approach to traction control

This paper describes a hybrid model and a model predictive control (MPC) strategy for solving a traction control problem. The problem is tackled in a systematic way from modeling to control synthesis and implementation. The model is described first in the Hybrid Systems Description Language to obtain a mixed-logical dynamical (MLD) hybrid model of the open-loop system. For the resulting MLD model, we design a receding horizon finite-time optimal controller. The resulting optimal controller is converted to its equivalent piecewise affine form by employing multiparametric programming techniques, and finally experimentally tested on a car prototype. Experiments show that good and robust performance is achieved in a limited development time by avoiding the design of ad hoc supervisory and logical constructs usually required by controllers developed according to standard techniques.
Low-Cost High-Gain and Broadband Substrate- Integrated-Waveguide-Fed Patch Antenna Array for 60-GHz Band

A low-cost high-gain and broadband substrate integrated waveguide (SIW)-fed patch antenna array is demonstrated at the 60-GHz band. A single-layered SIW feeding network with wideband T-junctions and wideband high-gain cavity-backed patch antennas are employed to achieve high gain and wideband performance simultaneously. Although the proposed antenna array has a multilayered structure, it can be fabricated by conventional low-cost single-layered printed circuit board (PCB) technology and then realized by stacking and fixing all of single layers together. The simulated and measured impedance bandwidths of a 4 × 4 antenna array are 27.5% and 22.6% for 10 dB. The discrepancy between simulation and measurement is analyzed. A gain up to 19.6 dBi, and symmetrical unidirectional radiation patterns with low cross polarization are also achieved. With advantages of low fabrication cost and good performances, the proposed antenna array is a promising candidate for millimeter-wave wireless communication systems.
Reinforcement Learning for Coreference Resolution

Coreference resolution is an important step for a number of higher level NLP tasks that involve natural language understanding. Conventional methods treat this task as a classification problem  where a pair of mentions are classified as coreferents or as a clustering problem where each cluster represents a named entity. The availability of partial structured information for supervision motivates the formulation of this problem in a reinforcement learning setting. Using similarity between two clusterings as our reward, we propose to employ function approximation to learn generalizable rules for coreference resolution.
Wideband Patch Antenna for HPM Applications

This paper presents the design, fabrication, and characterization of a compact wideband antenna for high-power microwave applications. The antennas proposed are array of high-power wideband patches with high compactness and less than λ/10 thick. The concept developed can be fed by high-voltage signals (up to 60 kV) in repetitive operation. Two designs are produced at central frequencies of 350 MHz and 1 GHz. Their relative bandwidth is larger than 40% at 350 MHz and 25% at 1 GHz for S11 <; - 10 dB, respectively. The arrays studied produce a gain of more than 14 dB.
Customer-Centric Strategic Planning: Integrating CRM in Online Business Systems

Customer Relationship Management (CRM) is increasingly found at the top of corporate agendas. Online companies in particular are embracing CRM as a major element of corporate strategy, because online technological applications permit a precise segmentation, profiling and targeting of customers, and the competitive pressures of the digital markets require a customer-centric corporate culture. The implementation of CRM systems in online organisation determines a complex restructuring of all organisational elements and processes. The strategic planning process will have to adapt to new customer-centric procedures. The present paper analyses the implementation process of a CRM system in online retail businesses and develops a model of the strategic planning function in a customer-centric context.
Energy-efficient deployment of Intelligent Mobile sensor networks

Many visions of the future include people immersed in an environment surrounded by sensors and intelligent devices, which use smart infrastructures to improve the quality of life and safety in emergency situations. Ubiquitous communication enables these sensors or intelligent devices to communicate with each other and the user or a decision maker by means of ad hoc wireless networking. Organization and optimization of network resources are essential to provide ubiquitous communication for a longer duration in large-scale networks and are helpful to migrate intelligence from higher and remote levels to lower and local levels. In this paper, distributed energy-efficient deployment algorithms for mobile sensors and intelligent devices that form an Ambient Intelligent network are proposed. These algorithms employ a synergistic combination of cluster structuring and a peer-to-peer deployment scheme. An energy-efficient deployment algorithm based on Voronoi diagrams is also proposed here. Performance of our algorithms is evaluated in terms of coverage, uniformity, and time and distance traveled until the algorithm converges. Our algorithms are shown to exhibit excellent performance.
Quick detection of brain tumors and edemas: A bounding box method using symmetry

A significant medical informatics task is indexing patient databases according to size, location, and other characteristics of brain tumors and edemas, possibly based on magnetic resonance (MR) imagery. This requires segmenting tumors and edemas within images from different MR modalities. To date, automated brain tumor or edema segmentation from MR modalities remains a challenging, computationally intensive task. In this paper, we propose a novel automated, fast, and approximate segmentation technique. The input is a patient study consisting of a set of MR slices, and its output is a subset of the slices that include axis-parallel boxes that circumscribe the tumors. Our approach is based on an unsupervised change detection method that searches for the most dissimilar region (axis-parallel bounding boxes) between the left and the right halves of a brain in an axial view MR slice. This change detection process uses a novel score function based on Bhattacharya coefficient computed with gray level intensity histograms. We prove that this score function admits a very fast (linear in image height and width) search to locate the bounding box. The average dice coefficients for localizing brain tumors and edemas, over ten patient studies, are 0.57 and 0.52, respectively, which significantly exceeds the scores for two other competitive region-based bounding box techniques.
ContextPlayer: learning contextual music preferences for situational recommendations

Music listening is a very personal and situational behaviour, which suggests that contextual information could be used to greatly enhance music recommendation experience. However, making such use of mobile context, while learning user profiles, is a challenging problem. This case study presents a system for collecting context and usage data from mobile devices, but targeted at recommending music via unsupervised learning of user profiles and relevant situations. The developed data flow system supports both short enough response times and longer asynchronous reasoning on the collected data; furthermore, the mobile phone acts not only as sensor, but the mobile app is directly tied to the effectiveness of the music service user experience (UX). This work describes our system design and discusses issues related to the problem space and to usability tests on such systems, based on an international user trial.
An Approach to Data Privacy in Smart Home using Blockchain Technology

Nowadays, numerous applications of smart home systems provide recommendations for users, including reducing their energy consumption, warnings of defective devices, selecting reliable devices and software, diagnoses, etc . The internet connected, dynamic and heterogeneous nature of the smart home environment creates new security, authentication, and privacy challenges . To solve those challenges, an approach to data privacy in smart home using blockchain technology, which is called smart home based the IoT-Blockchain (SHIB), is proposed in this paper. In order to demonstrate the proposed architecture, an experimental scenario using Ganache, Remix, and web3. js is built among the user, service provider, and smart home to evaluate the performance of the smart contract in the SHIB. Based on the experiment results, the SHIB architecture brings the advantages like data privacy, trust access control, and high extension ability. In addition, the comparison between the proposed architecture and existing models in different parameters such as smart contract, the privacy of data, usage of tokens, updating the policies, and misbehavior judging are performed.
International Journal of Engineering Business Management Performance Measurement Model for the Supplier Selection Based on AHP

The performance of the supplier is a crucial factor for the success or failure of any company. Rational and effective decision making in terms of the supplier selection process can help the organization to optimize cost and quality functions. The nature of supplier selection processes is generally complex, especially when the company has a large variety of products and vendors. Over the years, several solutions and methods have emerged for address‐ ing the supplier selection problem (SSP). Experience and studies have shown that there is no best way for evaluating and selecting a specific supplier process, but that it varies from one organization to another. The aim of this research is to demonstrate how a multiple attribute decision making approach can be effectively applied for the supplier selection process.
Fair and balanced?: bias in bug-fix datasets

Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has been key to this research. Bug tracking systems, and code version histories, record when, how and by whom bugs were fixed; from these sources, datasets that relate file changes to bug fixes can be extracted. These historical datasets can be used to test hypotheses concerning processes of bug introduction, and also to build statistical bug prediction models. Unfortunately, processes and humans are imperfect, and only a fraction of bug fixes are actually labelled in source code version histories, and thus become available for study in the extracted datasets. The question naturally arises, are the bug fixes recorded in these historical datasets a fair representation of the full population of bug fixes? In this paper, we investigate historical data from several software projects, and find strong evidence of systematic bias. We then investigate the potential effects of "unfair, imbalanced" datasets on the performance of prediction techniques. We draw the lesson that bias is a critical problem that threatens both the effectiveness of processes that rely on biased datasets to build prediction models and the generalizability of hypotheses tested on biased data.
Logo Retrieval Using Logo Proposals and Adaptive Weighted Pooling

This letter presents a novel approach for logo retrieval. Considering the fact that logo only occupies a small portion of an image, we apply Faster R-CNN to detect logo proposals first, and then use a two-step pooling strategy with adaptive weight to obtain an accurate global signature. The adaptive weighted pooling method can effectively balance the recall and precision of proposals by incorporating the probability of each proposal being a logo. Experimental results show that the proposed method interprets the similarity between query and database image more accurately and achieves state of the art performance.
Implementation of medical image segmentation in CUDA

As the fast development of GPU, people tend to use it for more general purposes than its original graphic related work. The high parallel computation capabilities of GPU are welcomed by programmers who work at medical image processing which always have to deal with a large scale of voxel computation. The birth of NVIDIAreg CUDAtrade technology and CUDA-enabled GPUs brought a revolution in the general purpose GPU area. In this paper, we propose the implementation of several medical image segmentation algorithms using CUDA and CUDA-enabled GPUs, compare their performance and results to the previous implementation in old version of GPU and CPU, indicate the advantages of using CUDA technology and how to design algorithm to make full use of it.
Survey on LBP based texture descriptors for image classification

The aim of this work is to find the best way for describing a given texture using a local binary pattern (LBP) based approach. First several different approaches are compared, then the best fusion approach is tested on different datasets and compared with several approaches proposed in the literature (for fair comparisons, when possible we have used code shared by the original authors). Our experiments show that a fusion approach based on uniform local quinary pattern (LQP) and a rotation invariant local quinary pattern, where a bin selection based on variance is performed and Neighborhood Preserving Embedding (NPE) feature transform is applied, obtains a method that performs well on all tested datasets. As the classifier, we have tested a stand-alone support vector machine (SVM) and a random subspace ensemble of SVM. We compare several texture descriptors and show that our proposed approach coupled with random subspace ensemble outperforms other recent state-of-the-art approaches. This conclusion is based on extensive experiments conducted in several domains using six benchmark databases.
Amobee at IEST 2018: Transfer Learning from Language Models

This paper describes the system developed at Amobee for the WASSA 2018 implicit emotions shared task (IEST). The goal of this task was to predict the emotion expressed by missing words in tweets without an explicit mention of those words. We developed an ensemble system consisting of language models together with LSTM-based networks containing a CNN attention mechanism. Our approach represents a novel use of language models—specifically trained on a large Twitter dataset—to predict and classify emotions. Our system reached 1st place with a macro F1 score of 0.7145.
Predicting Facial Beauty without Landmarks

A fundamental task in artificial intelligence and computer vision is to build machines that can behave like a human in recognizing a broad range of visual concepts. This paper aims to investigate and develop intelligent systems for learning the concept of female facial beauty and producing human-like predictors. Artists and social scientists have long been fascinated by the notion of facial beauty, but study by computer scientists has only begun in the last few years. Our work is notably different from and goes beyond previous works in several aspects: 1) we focus on fully-automatic learning approaches that do not require costly manual annotation of landmark facial features but simply take the raw pixels as inputs; 2) our study is based on a collection of data that is an order of magnitude larger than that of any previous study; 3) we imposed no restrictions in terms of pose, lighting, background, expression, age, and ethnicity on the face images used for training and testing. These factors significantly increased the difficulty of the learning task. We show that a biologically-inspired model with multiple layers of trainable feature extractors can produce results that are much more human-like than the previously used eigenface approach. Finally, we develop a novel visualization method to interpret the learned model and revealed the existence of several beautiful features that go beyond the current averageness and symmetry hypotheses.
River flow time series prediction with a range-dependent neural network

Artificial neural networks provide a promising alternative to hydrological time series modelling. However, there are still many fundamental problems requiring further analyses, such as structure identification, parameter estimation, generalization, performance improvement, etc. Based on a proposed clustering algorithm for the training pairs, a new neural network, namely the range-dependent neural network (RDNN) has been developed for better accuracy in hydrological time series prediction. The applicability and potentials of the RDNN in daily streamflow and annual reservoir inflow prediction are examined using data from two watersheds in China. Empirical comparisons of the predictive accuracy, in terms of the model efficiency R and absolute relative errors (ARE), between the RDNN, backpropagation (BP) networks and the threshold auto-regressive (TAR) model are made. The case studies demonstrated that the RDNN network performed significantly better than the BP network, especially for reproducing low-flow events.
Generating Keyword Queries for Natural Language Queries to Alleviate Lexical Chasm Problem

In recent years, the task of reformulating natural language queries has received considerable attention from both industry and academic communities. Because of the lexical chasm problem between natural language queries and web documents, if we directly use natural language queries as inputs for retrieval, the results are usually unsatisfactory. In this work, we formulated the task as a translation problem to convert natural language queries into keyword queries. Since the nature language queries users input are diverse and multi-faceted, general encoder-decoder models cannot effectively handle low-frequency words and out-of-vocabulary words. We propose a novel encoder-decoder method with two decoders: the pointer decoder firstly extracts query terms directly from the source text via copying mechanism, then the generator decoder generates query terms using two attention modules simultaneously considering the source text and extracted query terms. For evaluation and training, we also proposed a semi-automatic method to construct a large-scale dataset about natural language query-keyword query pairs. Experimental results on this dataset demonstrated that our model could achieve better performance than the previous state-of-the-art methods.
Chain Replication for Supporting High Throughput and Availability

Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The approach is intended for supporting large-scale storage services that exhibit high throughput and availability without sacrificing strong consistency guarantees. Besides outlining the chain replication protocols themselves, simulation experiments explore the performance characteristics of a prototype implementation. Throughput, availability, and several objectplacement strategies (including schemes based on distributed hash table routing) are discussed.
Analysis and Modeling of Inertial Sensors Using Allan Variance

It is well known that inertial navigation systems can provide high-accuracy position, velocity, and attitude information over short time periods. However, their accuracy rapidly degrades with time. The requirements for an accurate estimation of navigation information necessitate the modeling of the sensors' error components. Several variance techniques have been devised for stochastic modeling of the error of inertial sensors. They are basically very similar and primarily differ in that various signal processings, by way of weighting functions, window functions, etc., are incorporated into the analysis algorithms in order to achieve a particular desired result for improving the model characterizations. The simplest is the Allan variance. The Allan variance is a method of representing the root means square (RMS) random-drift error as a function of averaging time. It is simple to compute and relatively simple to interpret and understand. The Allan variance method can be used to determine the characteristics of the underlying random processes that give rise to the data noise. This technique can be used to characterize various types of error terms in the inertial-sensor data by performing certain operations on the entire length of data. In this paper, the Allan variance technique will be used in analyzing and modeling the error of the inertial sensors used in different grades of the inertial measurement units. By performing a simple operation on the entire length of data, a characteristic curve is obtained whose inspection provides a systematic characterization of various random errors contained in the inertial-sensor output data. Being a directly measurable quantity, the Allan variance can provide information on the types and magnitude of the various error terms. This paper covers both the theoretical basis for the Allan variance for modeling the inertial sensors' error terms and its implementation in modeling different grades of inertial sensors.