nils-herrmann/clean_scirepeval huggingface dataset:
An Optimized FFT-Based Direct Poisson Solver on CUDA GPUs

A highly multithreaded FFT-based direct Poisson solver that makes effective use of the capabilities of the current NVIDIA graphics processing units (GPUs) is presented. Our algorithms carefully manage the multiple layers of the memory hierarchy of the GPUs such that almost all the global memory accesses are coalesced into 128-byte device memory transactions, and all computations are carried out directly on the registers. A new strategy to interleave the FFT computation along each dimension with other computations is used to minimize the total number of accesses to the 3D grid. We illustrate the performance of our algorithms on the NVIDIA Tesla and Fermi architectures for a wide range of grid sizes, up to the largest size that can fit on the device memory ($(512\times 512\times 512)$ on the Tesla C1060/C2050 and $(512\times 256\times 256)$ on the GeForce GTX 280/480). We achieve up to 140 GFLOPS and a bandwidth of 70 GB/s on the Tesla C1060, and up to 375 GFLOPS with a bandwidth of 120GB/s on the GTX 480. The performance of our algorithms is superior to what can be achieved using the CUDA FFT library in combination with well-known parallel algorithms for solving tridiagonal linear systems of equations.
Retinal Vessel Segmentation using Deep Neural Networks

Automatic segmentation of blood vessels in fundus images is of great importance as eye diseases as well as some systemic diseases cause observable pathologic modifications. It is a binary classification problem: for each pixel we consider two possible classes (vessel or non-vessel). We use a GPU implementation of deep max-pooling convolutional neural networks to segment blood vessels. We test our method on publiclyavailable DRIVE dataset and our results demonstrate the high effectiveness of the deep learning approach. Our method achieves an average accuracy and AUC of 0.9466 and 0.9749, respectively.
A tutorial on particle filters for on-line nonlinear/non-Gaussian Bayesian tracking

Increasingly, for many application areas, it is becoming important to include elements of nonlinearity and non-Gaussianity in order to model accurately the underlying dynamics of a physical system. Moreover, it is typically crucial to process data on-line as it arrives, both from the point of view of storage costs as well as for rapid adaptation to changing signal characteristics. In this paper, we review both optimal and suboptimal Bayesian algorithms for nonlinear/non-Gaussian tracking problems, with a focus on particle filters. Particle filters are sequential Monte Carlo methods based on point mass (or “particle”) representations of probability densities, which can be applied to any state-space model and which generalize the traditional Kalman filtering methods. Several variants of the particle filter such as SIR, ASIR, and RPF are introduced within a generic framework of the sequential importance sampling (SIS) algorithm. These are discussed and compared with the standard EKF through an illustrative example.
A Universal Part-of-Speech Tagset

To facilitate future research in unsupervised induction of syntactic structure and to standardize best-practices, we propose a tagset that consists of twelve universal part-of-speech categories. In addition to the tagset, we develop a mapping from 25 different treebank tagsets to this universal set. As a result, when combined with the original treebank data, this universal tagset and mapping produce a dataset consisting of common parts-of-speech for 22 different languages. We highlight the use of this resource via three experiments, that (1) compare tagging accuracies across languages, (2) present an unsupervised grammar induction approach that does not use gold standard part-of-speech tags, and (3) use the universal tags to transfer dependency parsers between languages, achieving state-of-the-art results.
RpStacks: Fast and Accurate Processor Design Space Exploration Using Representative Stall-Event Stacks

CPU architects perform a series of slow timing simulations to explore large processor design space. To minimize the exploration overhead, architects make their best efforts to accelerate each simulation step as well as reduce the number of simulations by predicting the exact performance of designs. However, the existing methods are either too slow to overcome the large number of design points, or inaccurate to safely substitute extra simulation steps with performance predictions.
 In this paper, we propose RpStacks, a fast and accurate processor design space exploration method to 1) identify the current design point's key performance bottlenecks and 2) estimate the exact impacts of latency adjustments without launching an extra step of simulations. The key idea is to selectively collect the information about performance-critical events from a single simulation, construct a small number of event stacks describing the latency of distinctive execution paths, and estimate the overall performance as well as stall-event composition using the stacks. Our proposed method significantly outperforms the existing design space exploration methods in terms of both the latency and the accuracy. For investigating 1,000 design points, RpStacks achieves 26 times speedup on average over a variety of applications while showing high accuracy, when compared to a popular x86 timing simulator.
Syntax-aware Neural Machine Translation Using CCG

Neural machine translation (NMT) models are able to partially learn syntactic information from sequential lexical information. Still, some complex syntactic phenomena such as prepositional phrase attachment are poorly modeled. This work aims to answer two questions: 1) Does explicitly modeling source or target language syntax help NMT? 2) Is tight integration of words and syntax better than multitask training? We introduce syntactic information in the form of CCG supertags either in the source as an extra feature in the embedding, or in the target, by interleaving the target supertags with the word sequence. Our results on WMT data show that explicitly modeling syntax improves machine translation quality for English↔German, a high-resource pair, and for English↔Romanian, a lowresource pair and also several syntactic phenomena including prepositional phrase attachment. Furthermore, a tight coupling of words and syntax improves translation quality more than multitask training.
Randomized, Placebo-Controlled Trial of Methyl B12 for Children with Autism.

Children with autism spectrum disorder (ASD) have been reported to have reduced ability to methylate DNA and elevated markers of oxidative stress. We sought to determine if methyl B12, a key metabolic cofactor for cellular methylation reactions and antioxidant defense, could improve symptoms of ASD.



A total of 57 children with ASD were randomly assigned to 8 weeks of treatment with methyl B12 (75 μg/kg) or saline placebo every 3 days in a subcutaneous injection. The primary outcome measure was overall improvement in symptoms of ASD as measured by the Clinical Global Impressions-Improvement (CGI-I) score. Secondary outcome measures included changes in the Aberrant Behavior Checklist (ABC) and the Social Responsiveness Scale (SRS). Laboratory measures of methionine methylation and antioxidant glutathione metabolism were assessed at baseline and 8 weeks.



A total of 50 children (mean age 5.3 years, 79% male) completed the study. The primary outcome measure - the clinician rated CGI-I score - was statistically significantly better (lower) in the methyl B12 group (2.4) than in the placebo group (3.1) (0.7 greater improvement in the methyl B12 group, 95% CI 1.2-0.2, p = 0.005). Clinical improvement among children treated with methyl B12 was positively correlated with increases in plasma methionine (p = 0.05), decreases in S-adenosyl-l-homocysteine (SAH) (p = 0.007) and improvements in the ratio of S-adenosylmethionine (SAM) to SAH (p = 0.007), indicating an improvement in cellular methylation capacity. No improvements were observed in the parent-rated ABC or SRS.



Methyl B12 treatment improved clinician-rated symptoms of ASD that were correlated with improvements in measures of methionine metabolism and cellular methylation capacity.
Pafnucy - A deep neural network for structure-based drug discovery

Virtual screening is one of the most successful approaches for augmenting the drug discovery process. Currently, there is a notable shift towards machine learning (ML) methodologies to aid this process. Deep learning has recently gained considerable attention as it allows the model to “learn” to extract features that are relevant for the task at hand. We have developed a new deep neural network tailored to estimating the binding affinity of ligandreceptor complexes. The complex is represented with a 3D grid, and the model utilizes a 3D convolution to produce a feature map of this representation, treating the atoms of both proteins and ligands in the same manner. Our network was tested on the CASF “scoring power” benchmark and Astex diverse set and outperformed classical scoring functions. The model, together with usage instructions and examples, is available as a git repository at
The Nature, Importance, and Difficulty of Machine Ethics

The question of whether machine ethics exists or might exist in the future is difficult to answer if we can't agree on what counts as machine ethics. Some might argue that machine ethics obviously exists because humans are machines and humans have ethics. Others could argue that machine ethics obviously doesn't exist because ethics is simply emotional expression and machines can't have emotions. A wide range of positions on machine ethics are possible, and a discussion of the issue could rapidly propel us into deep and unsettled philosophical issues. Perhaps, understandably, few in the scientific arena pursue the issue of machine ethics. As we expand computers' decision-making roles in practical matters, such as computers driving cars, ethical considerations are inevitable. Computer scientists and engineers must examine the possibilities for machine ethics because, knowingly or not, they've already engaged in some form of it. Before we can discuss possible implementations of machine ethics, however, we need to be clear about what we're asserting or denying
Prader-Willi syndrome: a review of clinical, genetic, and endocrine findings

Prader-Willi syndrome (PWS) is a multisystemic complex genetic disorder caused by lack of expression of genes on the paternally inherited chromosome 15q11.2-q13 region. There are three main genetic subtypes in PWS: paternal 15q11-q13 deletion (65-75 % of cases), maternal uniparental disomy 15 (20-30 % of cases), and imprinting defect (1-3 %). DNA methylation analysis is the only technique that will diagnose PWS in all three molecular genetic classes and differentiate PWS from Angelman syndrome. Clinical manifestations change with age with hypotonia and a poor suck resulting in failure to thrive during infancy. As the individual ages, other features such as short stature, food seeking with excessive weight gain, developmental delay, cognitive disability and behavioral problems become evident. The phenotype is likely due to hypothalamic dysfunction, which is responsible for hyperphagia, temperature instability, high pain threshold, hypersomnia and multiple endocrine abnormalities including growth hormone and thyroid-stimulating hormone deficiencies, hypogonadism and central adrenal insufficiency. Obesity and its complications are the major causes of morbidity and mortality in PWS.



An extensive review of the literature was performed and interpreted within the context of clinical practice and frequently asked questions from referring physicians and families to include the current status of the cause and diagnosis of the clinical, genetics and endocrine findings in PWS.



Updated information regarding the early diagnosis and management of individuals with Prader-Willi syndrome is important for all physicians and will be helpful in anticipating and managing or modifying complications associated with this rare obesity-related disorder.
Towards a Chemiresistive Sensor-Integrated Electronic Nose: A Review

Electronic noses have potential applications in daily life, but are restricted by their bulky size and high price. This review focuses on the use of chemiresistive gas sensors, metal-oxide semiconductor gas sensors and conductive polymer gas sensors in an electronic nose for system integration to reduce size and cost. The review covers the system design considerations and the complementary metal-oxide-semiconductor integrated technology for a chemiresistive gas sensor electronic nose, including the integrated sensor array, its readout interface, and pattern recognition hardware. In addition, the state-of-the-art technology integrated in the electronic nose is also presented, such as the sensing front-end chip, electronic nose signal processing chip, and the electronic nose system-on-chip.
Interlingua based Sanskrit-English machine translation

This paper is based on the work towards developing a machine translation system for Sanskrit to English. An interlingua based machine translation system in Paninian framework was developed in this work. As lexical functional grammar can handle semantic information along with syntactic analysis, the proposed system uses lexical functional grammar in different levels of analysis phase. In this system the given Sanskrit text is first converted to an intermediate notation called interlingua. This notation is then used for mapping to the target language, English, and generates the translated output. The proposed system works in the translation of simple and complex sentences in the given corpus. The karaka analysis system of Panini is used for the semantic analysis.
A Case Study on User Experience (UX) Evaluation of Mobile Augmented Reality Prototypes

Mobile Augmented Reality (MAR) blends the real world with digital objects especially in ubiquitous devices such as smartphones. The MAR applications provide an intelligent interface for users. In this, valuable digital information is advertised in physical spaces. However, the success of these applications is tied directly to the degree of user acceptance. This makes understanding the needs and expectations of the MAR’s potential users of paramount importance for designing and building the proper application. The objective of the paper is to expose an important gap in the development of novel applications in the virtual world. Previous research has shown that it is essential to study and understand the needs and expectations of the potential users of the upcoming application or system. Studying user needs and expectations before offering the developed application ensures a minimum level of acceptance and, of course, success. This paper presents a detailed study comprising of a userexperience (UX) evaluation of different prototypes through the use of three different UX evaluation methods. This kind of evaluation allows new developments to offer systems, which do not fail. The main contributions of this study are that it: 1) solicits expectations when consumers use MAR applications, 2) assesses the UX over different prototypes using three different metrics, 3) provides methodological insights on UX evaluation experiments and, 4) is useful for anyone who wants to develop handheld applications after understanding user expectations and how his experience should progress. The results of the study show that users value concreteness, realizability, personalization, novelty, intuitiveness and the usefulness of presented information. Paying attention to these factors can help develop more acceptable MAR applications and lead to more novel future designs.
A Modified Functionally Generated Path Technique ( FGP ) for Making Posterior Unit Metal-Ceramic Crown : A Case Report

In this study a Modified functionally generated path technique for unit crown was used as a new method of constructing of an accurate prosthesis that requires limited occlusal adjustment at the final seating. This article discusses the use of an alternative functionally generated path technique to fabricate a unit metal ceramic crown using a temporary crown and a simple plastic occluder rather than a twin stage one. This article describes a new procedure to generate functional path occlusion for ceramometal unit crown.
Towards Seamless Tracking-Free Web: Improved Detection of Trackers via One-class Learning

Numerous tools have been developed to aggressively block the execution of popular JavaScript programs in Web browsers. Such blocking also affects functionality of webpages and impairs user experience. As a consequence, many privacy preserving tools that have been developed to limit online tracking, often executed via JavaScript programs, may suffer from poor performance and limited uptake. A mechanism that can isolate JavaScript programs necessary for proper functioning of the website from tracking JavaScript programs would thus be useful. Through the use of a manually labelled dataset composed of 2,612 JavaScript programs, we show how current privacy preserving tools are ineffective in finding the right balance between blocking tracking JavaScript programs and allowing functional JavaScript code. To the best of our knowledge, this is the first study to assess the performance of current web privacy preserving tools in determining tracking vs. functional JavaScript programs. To improve this balance, we examine the two classes of JavaScript programs and hypothesize that tracking JavaScript programs share structural similarities that can be used to differentiate them from functional JavaScript programs. The rationale of our approach is that web developers often “borrow” and customize existing pieces of code in order to embed tracking (resp. functional) JavaScript programs into their webpages. We then propose one-class machine learning classifiers using syntactic and semantic features extracted from JavaScript programs. When trained only on samples of tracking JavaScript programs, our classifiers achieve accuracy of 99%, where the best of the privacy preserving tools achieve accuracy of 78%. The performance of our classifiers is comparable to that of traditional two-class SVM. One-class classification, where a training set of only tracking JavaScript programs is used for learning, has the advantage that it requires fewer labelled examples that can be obtained via manual inspection of public lists of well-known trackers. We further test our classifiers and several popular privacy preserving tools on a larger corpus of 4,084 websites with 135,656 JavaScript programs. The output of our best classifier on this data is between 20 to 64% different from the tools under study. We manually analyse a sample of the JavaScript programs for which our classifier is in disagreement with all other privacy preserving tools, and show that our approach is not only able to enhance user web experience by correctly classifying more functional JavaScript programs, but also discovers previously unknown tracking services.
Time-Bounded Authentication of FPGAs

This paper introduces a novel technique to authenticate and identify field-programmable gate arrays (FPGAs). The technique uses the reconfigurability feature of FPGAs to perform self-characterization and extract the unique timing of the FPGA building blocks over the space of possible inputs. The characterization circuit is then exploited for constructing a physically unclonable function (PUF). The PUF can accept different forms of challenges including pulsewidth, digital binary, and placement challenges. The responses from the PUF are only verifiable by entities with access to the unique timing signature. However, the authentic device is the only entity who can respond within a given time constraint. The constraint is set by the gap between the speed of PUF evaluation on authentic hardware and simulation of its behavior. A suite of authentication protocols is introduced based on the time-bounded mechanism. We ensure that the responses are robust to fluctuations in operational conditions such as temperature and voltage variations by employing: 1) a linear calibration mechanism that adjusts the clock frequency by a feedback from on-chip temperature and voltage sensor readings, and 2) a differential PUF structure with real-valued responses that cancels out the common impact of variations on delays. Security against various attacks is discussed and a proof-of-concept implementation of signature extraction and authentication are demonstrated on Xilinx Virtex 5 FPGAs.
Reliable Gender Prediction Based on Users’ Video Viewing Behavior

With the growth of the digital advertising market, it has become more important than ever to target the desired audiences. Among various demographic traits, gender information plays a key role in precisely targeting the potential consumers in online advertising and ecommerce. However, such personal information is generally unavailable to digital media sellers. In this paper, we propose a novel task-specific multi-task learning algorithm to predict users' gender information from their video viewing behaviors. To detect as many desired users as possible, while controlling the Type I error rate at a user-specified level, we further propose Bayes testing and decision procedures to efficiently identify male and female users, respectively. Comprehensive experiments have justified the effectiveness and reliability of our framework.
Measuring user acceptance of emerging information technologies: an assessment of possible method biases

The measurement scales for the perceived usefulness and perceived ease of we constructs introduced by Davis [12/ have become widely used for forecasting user acceptance of emerging information technologies. An experiment was conducted to examine whether grouping of items caused artifactual inflation of reliability and validity measures. We found support for our hypothesis that the reliability and validity stemmed notfrom item grouping butfrom the constructs of perceived usefulness and perceived ease of use being clearly defined, and the items used co measure each of these consn-ucts clearly capturing the essence of the conscrucI.
Adaptive Mho type distance relaying scheme with fault resistance compensation

This paper describes an adaptive distance relaying scheme which can eliminate the effect of fault resistance on distance relay zone reach. Distance relay is commonly used as main protection to protect transmission line from any type of fault. For a stand-alone distance relay, fault resistance can make Mho type distance relay to be under reached and thus the fault will be isolated at a longer time. In this scheme, the relay detects the fault location using a two-terminal algorithm. By knowing fault location, fault voltage at the fault point can be calculated by using equivalent sequence network connection as seen from local terminal. Then, fault resistance is calculated by using simple equation considering contribution from remote terminal current. Finally, the compensation of fault resistance is done onto calculated apparent resistance as seen at relaying point. The modeling and simulation was carried out using Matlab/Simulink software. Several cases were carried out and the results show the validity of the scheme.
Missing data correction in still images and image sequences

The ability to replace missing data in images and video is of key importance to many application fields. The general-purpose algorithm presented here is inspired by texture synthesis techniques but is suited to any complex natural scene and not restricted to stationary patterns. It has the property to be adapted to both still images and image sequences and to incorporate temporal information when available while preserving the simplicity of the algorithm. This method gives very good results in various situations without user intervention. The resulting computational cost is relatively low and corrections are usually produced within seconds.