nils-herrmann/clean_scirepeval huggingface dataset:
An Autonomous Steering System for Wireless Charging Electric Vehicles to Minimize Power Degradation

Vehicles with wireless power transfer (WPT) is seen as one possible solution to overcome the limitations experienced in commercializing electric vehicles (EVs) due to limited battery power. However, one issue with vehicles with WPT is the power degradation that is experienced as misalignment occurs between the vehicle and the road. In order to overcome this problem, a system that can detect the misalignment between the coils and align the vehicle through autonomous steering is proposed in this paper. The concept of this system has been discussed, and simulation results validate that the proposed system's operational concept is feasible, and will be able to reduce power degradation from misalignment.
Parameter Sharing Reinforcement Learning Architecture for Multi Agent Driving Behaviors

Multi-agent learning provides a potential framework for learning and simulating traffic behaviors. This paper proposes a novel architecture to learn multiple driving behaviors in a traffic scenario. The proposed architecture can learn multiple behaviors independently as well as simultaneously. We take advantage of the homogeneity of agents and learn in a parameter sharing paradigm. To further speed up the training process asynchronous updates are employed into the architecture. While learning different behaviors simultaneously, the given framework was also able to learn cooperation between the agents, without any explicit communication. We applied this framework to learn two important behaviors in driving: 1) Lane-Keeping and 2) Over-Taking. Results indicate faster convergence and learning of a more generic behavior, that is scalable to any number of agents. When compared the results with existing approaches, our results indicate equal and even better performance in some cases.
Design of multifunctional autonomous car using ultrasonic and infrared sensors

The daily routine problems that common man faces on roads while commuting are becoming a serious problem with each passing day. People get late and meet accidents. The model of autonomous car presented in this research paper aims to solve these issues by taking humans off the wheels, so that they do not have to drive anymore and the risk of accidents, getting late and traffic congestions can be reduced to a minimum. This car is able to follow the track, overtake other cars, detect obstacles, take sharp bends and turns, follow traffic signals and turn on its lights under low light conditions. Circuit diagrams for performing all these functions have been presented and the mechanical model of the car has also been shown in the paper, which is practically implemented and successfully run by the authors.
Interactive Attention for Neural Machine Translation

Conventional attention-based Neural Machine Translation (NMT) conducts dynamic alignment in generating the target sentence. By repeatedly reading the representation of source sentence, which keeps fixed after generated by the encoder (Bahdanau et al., 2015), the attention mechanism has greatly enhanced state-of-the-art NMT. In this paper, we propose a new attention mechanism, called INTERACTIVE ATTENTION, which models the interaction between the decoder and the representation of source sentence during translation by both reading and writing operations. INTERACTIVE ATTENTION can keep track of the interaction history and therefore improve the translation performance. Experiments on NIST Chinese-English translation task show that INTERACTIVE ATTENTION can achieve significant improvements over both the previous attention-based NMT baseline and some state-of-the-art variants of attention-based NMT (i.e., coverage models (Tu et al., 2016)). And neural machine translator with our INTERACTIVE ATTENTION can outperform the open source attention-based NMT system Groundhog by 4.22 BLEU points and the open source phrase-based system Moses by 3.94 BLEU points averagely on multiple test sets.
A privacy-compliant fingerprint recognition system based on homomorphic encryption and Fingercode templates

The privacy protection of the biometric data is an important research topic, especially in the case of distributed biometric systems. In this scenario, it is very important to guarantee that biometric data cannot be steeled by anyone, and that the biometric clients are unable to gather any information different from the single user verification/identification. In a biométrie system with high level of privacy compliance, also the server that processes the biométrie matching should not learn anything on the database and it should be impossible for the server to exploit the resulting matching values in order to extract any knowledge about the user presence or behavior. Within this conceptual framework, in this paper we propose a novel complete demonstrator based on a distributed biométrie system that is capable to protect the privacy of the individuals by exploiting cryptosystems. The implemented system computes the matching task in the encrypted domain by exploiting homomorphic encryption and using Fingercode templates. The paper describes the design methodology of the demonstrator and the obtained results. The demonstrator has been fully implemented and tested in real applicative conditions. Experimental results show that this method is feasible in the cases where the privacy of the data is more important than the accuracy of the system and the obtained computational time is satisfactory.
XFI: Software Guards for System Address Spaces

XFI is a comprehensive protection system that offers both flexible access control and fundamental integrity guarantees, at any privilege level and even for legacy code in commodity systems. For this purpose, XFI combines static analysis with inline software guards and a two-stack execution model. We have implemented XFI for Windows on the x86 architecture using binary rewriting and a simple, stand-alone verifier; the implementation's correctness depends on the verifier, but not on the rewriter. We have applied XFI to software such as device drivers and multimedia codecs. The resulting modules function safely within both kernel and user-mode address spaces, with only modest enforcement overheads.
Grammar Variational Autoencoder

s m i l e s ! c h a i n atom ! b r a c k e t _ a t o m | a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c a l i p h a t i c _ o r g a n i c ! ’B’ | ’C’ | ’N’ | ’O’ | ’S ’ | ’P ’ | ’F ’ | ’ I ’ | ’ Cl ’ | ’ Br ’ a r o m a t i c _ o r g a n i c ! ’ c ’ | ’ n ’ | ’ o ’ | ’ s ’ b r a c k e t _ a t o m ! ’ [ ’ BAI ’ ] ’ BAI ! i s o t o p e symbol BAC | symbol BAC | i s o t o p e symbol | symbol BAC ! c h i r a l BAH | BAH | c h i r a l BAH ! hc ou n t BACH | BACH | h co u n t BACH ! c h a r g e c l a s s | c h a r g e | c l a s s symbol ! a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c i s o t o p e ! DIGIT | DIGIT DIGIT | DIGIT DIGIT DIGIT DIGIT ! ’1 ’ | ’2 ’ | ’3 ’ | ’4 ’ | ’5 ’ | ’6 ’ | ’7 ’ | ’8 ’ c h i r a l ! ’@’ | ’@@’ hc ou n t ! ’H’ | ’H’ DIGIT c h a r g e ! ’ ’ | ’ ’ DIGIT | ’ ’ DIGIT DIGIT | ’+ ’ | ’+ ’ DIGIT | ’+ ’ DIGIT DIGIT bond ! ’ ’ | ’= ’ | ’# ’ | ’ / ’ | ’ \ ’ r i n g b o n d ! DIGIT | bond DIGIT branched_a tom ! atom | atom RB | atom BB | atom RB BB RB ! RB r i n g b o n d | r i n g b o n d BB ! BB b ra n ch | b r a n ch b ra nc h ! ’ ( ’ c h a i n ’ ) ’ | ’ ( ’ bond c h a i n ’ ) ’ c h a i n ! branched_a tom | c h a i n branched_a tom | c h a i n bond branched_a tom
Stochastic Variational Deep Kernel Learning

Deep kernel learning combines the non-parametric flexibility of kernel methods with the inductive biases of deep learning architectures. We propose a novel deep kernel learning model and stochastic variational inference procedure which generalizes deep kernel learning approaches to enable classification, multi-task learning, additive covariance structures, and stochastic gradient training. Specifically, we apply additive base kernels to subsets of output features from deep neural architectures, and jointly learn the parameters of the base kernels and deep network through a Gaussian process marginal likelihood objective. Within this framework, we derive an efficient form of stochastic variational inference which leverages local kernel interpolation, inducing points, and structure exploiting algebra. We show improved performance over stand alone deep networks, SVMs, and state of the art scalable Gaussian processes on several classification benchmarks, including an airline delay dataset containing 6 million training points, CIFAR, and ImageNet.
Effective Implementation of DGEMM on Modern Multicore CPU

In this paper we will present a detailed study on tuning double-precision matrix-matrix multiplication (DGEMM) on the Intel Xeon E5-2680 CPU. We selected an optimal algorithm from the instruction set perspective as well software tools optimized for Intel Advance Vector Extensions (AVX). Our optimizations included the use of vector memory operations, and AVX instructions. Our proposed algorithm achieves a performance improvement of 33% compared to the latest results achieved using the Intel Math Kernel Library DGEMM subroutine.
Keyphrase Extraction Using Knowledge Graphs

Extracting keyphrases from documents automatically is an important and interesting task since keyphrases provide a quick summarization for documents. Although lots of efforts have been made on keyphrase extraction, most of the existing methods (the co-occurrence-based methods and the statistic-based methods) do not take semantics into full consideration. The co-occurrence-based methods heavily depend on the co-occurrence relations between two words in the input document, which may ignore many semantic relations. The statistic-based methods exploit the external text corpus to enrich the document, which introduce more unrelated relations inevitably. In this paper, we propose a novel approach to extract keyphrases using knowledge graphs, based on which we could detect the latent relations of two keyterms (i.e., noun words and named entities) without introducing many noises. Extensive experiments over real data show that our method outperforms the state-of-the-art methods including the graph-based co-occurrence methods and statistic-based clustering methods.
Pointwise Shape-Adaptive DCT for High-Quality Denoising and Deblocking of Grayscale and Color Images

The shape-adaptive discrete cosine transform (SA-DCT) transform can be computed on a support of arbitrary shape, but retains a computational complexity comparable to that of the usual separable block-DCT (B-DCT). Despite the near-optimal decorrelation and energy compaction properties, application of the SA-DCT has been rather limited, targeted nearly exclusively to video compression. In this paper, we present a novel approach to image filtering based on the SA-DCT. We use the SA-DCT in conjunction with the Anisotropic Local Polynomial Approximation-Intersection of Confidence Intervals technique, which defines the shape of the transform's support in a pointwise adaptive manner. The thresholded or attenuated SA-DCT coefficients are used to reconstruct a local estimate of the signal within the adaptive-shape support. Since supports corresponding to different points are in general overlapping, the local estimates are averaged together using adaptive weights that depend on the region's statistics. This approach can be used for various image-processing tasks. In this paper, we consider, in particular, image denoising and image deblocking and deringing from block-DCT compression. A special structural constraint in luminance-chrominance space is also proposed to enable an accurate filtering of color images. Simulation experiments show a state-of-the-art quality of the final estimate, both in terms of objective criteria and visual appearance. Thanks to the adaptive support, reconstructed edges are clean, and no unpleasant ringing artifacts are introduced by the fitted transform
A 10-Bit Folded Multi-LSB Decided Resistor String Digital to Analog Converter

A 10-bit folded multi-LSB decided resistor string DAC is presented. The proposed circuits uses the LSBs of the input digital words to decide the output voltage, which can significantly reduce the number of unit resistors up to 75% compared with the traditional resistor string DAC. The measured results show that the INL is less than 0.73 LSB and the maximum DNL is 0.26 LSB. The active chip area is less than 0.25 mm2
Assessment of lexical semantic judgment abilities in alcohol-dependent subjects: An fMRI study

Neuropsychological studies have shown that alcohol dependence is associated with neurocognitive deficits in tasks requiring memory, perceptual motor skills, abstraction and problem solving, whereas language skills are relatively spared in alcoholics despite structural abnormalities in the language-related brain regions. To investigate the preserved mechanisms of language processing in alcohol-dependents, functional brain imaging was undertaken in healthy controls (n=18) and alcohol-dependents (n=16) while completing a lexical semantic judgment task in a 3 T MR scanner. Behavioural data indicated that alcohol-dependents took more time than controls for performing the task but there was no significant difference in their response accuracy. fMRI data analysis revealed that while performing the task, the alcoholics showed enhanced activations in left supramarginal gyrus, precuneus bilaterally, left angular gyrus, and left middle temporal gyrus as compared to control subjects. The extensive activations observed in alcoholics as compared to controls suggest that alcoholics recruit additional brain areas to meet the behavioural demands for equivalent task performance. The results are consistent with previous fMRI studies suggesting compensatory mechanisms for the execution of task for showing an equivalent performance or decreased neural efficiency of relevant brain networks. However, on direct comparison of the two groups, the results did not survive correction for multiple comparisons; therefore, the present findings need further exploration.
Suggesting accurate method and class names

Descriptive names are a vital part of readable, and hence maintainable, code. Recent progress on automatically suggesting names for local variables tantalizes with the prospect of replicating that success with method and class names. However, suggesting names for methods and classes is much more difficult. This is because good method and class names need to be functionally descriptive, but suggesting such names requires that the model goes beyond local context. We introduce a neural probabilistic language model for source code that is specifically designed for the method naming problem. Our model learns which names are semantically similar by assigning them to locations, called embeddings, in a high-dimensional continuous space, in such a way that names with similar embeddings tend to be used in similar contexts. These embeddings seem to contain semantic information about tokens, even though they are learned only from statistical co-occurrences of tokens. Furthermore, we introduce a variant of our model that is, to our knowledge, the first that can propose neologisms, names that have not appeared in the training corpus. We obtain state of the art results on the method, class, and even the simpler variable naming tasks. More broadly, the continuous embeddings that are learned by our model have the potential for wide application within software engineering.
Transferring an automated test generation tool to practice: from pex to fakes and code digger

Producing industry impacts has been an important, yet challenging task for the research community. In this paper, we report experiences on successful technology transfer of Pex and its relatives (tools derived from or associated with Pex) from Microsoft Research and lessons learned from more than eight years of research efforts by the Pex team in collaboration with academia. Moles, a tool associated with Pex, was shipped as Fakes with Visual Studio since August 2012, benefiting a huge user base of Visual Studio around the world. The number of download counts of Pex and its lightweight version called Code Digger has reached tens of thousands within one or two years. Pex4Fun (derived from Pex), an educational gaming website released since June 2010, has achieved high educational impacts, reflected by the number of clicks of the "Ask Pex!" button (indicating the attempts made by users to solve games in Pex4Fun) as over 1.5 million till July 2014. Evolved from Pex4Fun, the Code Hunt website has been used in a very large programming competition. In this paper, we discuss the technology background, tool overview, impacts, project timeline, and lessons learned from the project. We hope that our reported experiences can inspire more high-impact technology-transfer research from the research community.
Verifying higher-order programs with the dijkstra monad

Modern programming languages, ranging from Haskell and ML, to JavaScript, C# and Java, all make extensive use of higher-order state. This paper advocates a new verification methodology for higher-order stateful programs, based on a new monad of predicate transformers called the Dijkstra monad.
 Using the Dijkstra monad has a number of benefits. First, the monad naturally yields a weakest pre-condition calculus. Second, the computed specifications are structurally simpler in several ways, e.g., single-state post-conditions are sufficient (rather than the more complex two-state post-conditions). Finally, the monad can easily be varied to handle features like exceptions and heap invariants, while retaining the same type inference algorithm.
 We implement the Dijkstra monad and its type inference algorithm for the F* programming language. Our most extensive case study evaluates the Dijkstra monad and its F* implementation by using it to verify JavaScript programs.
 Specifically, we describe a tool chain that translates programs in a subset of JavaScript decorated with assertions and loop invariants to F*. Once in F*, our type inference algorithm computes verification conditions and automatically discharges their proofs using an SMT solver. We use our tools to prove that a core model of the JavaScript runtime in F* respects various invariants and that a suite of JavaScript source programs are free of runtime errors.
A Model of Perceptual Task Effort for Bar Charts and its Role in Recognizing Intention

This paper presents a model of perceptual task effort for use in hypothesizing the message that a bar chart is intended to convey. It presents our rules, based on research by cognitive psychologists, for estimating perceptual task effort, and discusses the results of an eye tracking experiment that demonstrates the validity of our model. These rules comprise a model that captures the relative difficulty that a viewer would have performing one perceptual task versus another on a specific bar chart. The paper outlines the role of our model of relative perceptual task effort in recognizing the intended message of an information graphic. Potential applications of this work include using this message to provide (1) a more complete representation of the content of the document to be used for searching and indexing in digital libraries, and (2) alternative access to the information graphic for visually impaired users or users of low-bandwidth environments.
An intelligent SMS-based remote Water Metering System

The Integrated Prepaid Water Meter System is a technology for prepaid billing of water along with sufficient monitoring of the water meter readings automatically from a remote place without any human intervention. This system promises fast and accurate billing of water as well as prevents any misuse of it. In this paper, a technique having adequate security support, for prepaid billing of water using Short Message Service (SMS) has been illustrated. Existing Global System for Mobile communications (GSM) networks have been used for sending and receiving SMS. A prototype of the system has been designed and developed for system exploration and experiment.
Exploring Multiple Execution Paths for Malware Analysis

Malicious code (or Malware) is defined as software that fulfills the deliberately harmful intent of an attacker. Malware analysis is the process of determining the behavior and purpose of a given Malware sample (such as a virus, worm, or Trojan horse). This process is a necessary step to be able to develop effective detection techniques and removal tools. Currently, Malware analysis is mostly a manual process that is tedious and time-intensive. To mitigate this problem, a number of analysis tools have been proposed that automatically extract the behavior of an unknown program by executing it in a restricted environment and recording the operating system calls that are invoked. The problem of dynamic analysis tools is that only a single program execution is observed. Unfortunately, however, it is possible that certain malicious actions are only triggered under specific circumstances (e.g., on a particular day, when a certain file is present, or when a certain command is received). In this paper, we propose a system that allows us to explore multiple execution paths and identify malicious actions that are executed only when certain conditions are met. This enables us to automatically extract a more complete view of the program under analysis and identify under which circumstances suspicious actions are carried out. Our experimental results demonstrate that many Malware samples show different behavior depending on input read from the environment. Thus, by exploring multiple execution paths, we can obtain a more complete picture of their actions.
The flipped classroom: a course redesign to foster learning and engagement in a health professions school.

Recent calls for educational reform highlight ongoing concerns about the ability of current curricula to equip aspiring health care professionals with the skills for success. Whereas a wide range of proposed solutions attempt to address apparent deficiencies in current educational models, a growing body of literature consistently points to the need to rethink the traditional in-class, lecture-based course model. One such proposal is the flipped classroom, in which content is offloaded for students to learn on their own, and class time is dedicated to engaging students in student-centered learning activities, like problem-based learning and inquiry-oriented strategies. In 2012, the authors flipped a required first-year pharmaceutics course at the University of North Carolina Eshelman School of Pharmacy. They offloaded all lectures to self-paced online videos and used class time to engage students in active learning exercises. In this article, the authors describe the philosophy and methodology used to redesign the Basic Pharmaceutics II course and outline the research they conducted to investigate the resulting outcomes. This article is intended to serve as a guide to instructors and educational programs seeking to develop, implement, and evaluate innovative and practical strategies to transform students' learning experience. As class attendance, students' learning, and the perceived value of this model all increased following participation in the flipped classroom, the authors conclude that this approach warrants careful consideration as educators aim to enhance learning, improve outcomes, and fully equip students to address 21st-century health care needs.