nils-herrmann/clean_scirepeval huggingface dataset:
A maximum entropy approach to adaptive statistical language modelling

An adaptive statistical language model is described, which successfully integrates long distance linguistic information with other knowledge sources. Most existing statistical language models exploit only the immediate history of a text. To extract information from further back in the document’s history, we propose and use trigger pairs as the basic information bearing elements. This allows the model to adapt its expectations to the topic of discourse. Next, statistical evidence from multiple sources must be combined. Traditionally, linear interpolation and its variants have been used, but these are shown here to be seriously deficient. Instead, we apply the principle of Maximum Entropy (ME). Each information source gives rise to a set of constraints, to be imposed on the combined estimate. The intersection of these constraints is the set of probability functions which are consistent with all the information sources. The function with the highest entropy within that set is the ME solution. Given consistent statistical evidence, a unique ME solution is guaranteed to exist, and an iterative algorithm exists which is guaranteed to converge to it. The ME framework is extremely general: any phenomenon that can be described in terms of statistics of the text can be readily incorporated. An adaptive language model based on the ME approach was trained on the Wall Street Journal corpus, and showed a 32–39% perplexity reduction over the baseline. When interfaced to SPHINX-II, Carnegie Mellon’s speech recognizer, it reduced its error rate by 10–14%. This thus illustrates the feasibility of incorporating many diverse knowledge sources in a single, unified statistical framework.
Latent Fingerprint Enhancement via Multi-Scale Patch Based Sparse Representation

Latent fingerprint identification plays an important role for identifying and convicting criminals in law enforcement agencies. Latent fingerprint images are usually of poor quality with unclear ridge structure and various overlapping patterns. Although significant advances have been achieved on developing automated fingerprint identification system, it is still challenging to achieve reliable feature extraction and identification for latent fingerprints due to the poor image quality. Prior to feature extraction, fingerprint enhancement is necessary to suppress various noises, and improve the clarity of ridge structures in latent fingerprints. Motivated by the recent success of sparse representation in image denoising, this paper proposes a latent fingerprint enhancement algorithm by combining the total variation model and multiscale patch-based sparse representation. First, the total variation model is applied to decompose the latent fingerprint into cartoon and texture components. The cartoon component with most of the nonfingerprint patterns is removed as the structured noise, whereas the texture component consisting of the weak latent fingerprint is enhanced in the next stage. Second, we propose a multiscale patch-based sparse representation method for the enhancement of the texture component. Dictionaries are constructed with a set of Gabor elementary functions to capture the characteristics of fingerprint ridge structure, and multiscale patch-based sparse representation is iteratively applied to reconstruct high-quality fingerprint image. The proposed algorithm cannot only remove the overlapping structured noises, but also restore and enhance the corrupted ridge structures. In addition, we present an automatic method to segment the foreground of latent image with the sparse coefficients and orientation coherence. Experimental results and comparisons on NIST SD27 latent fingerprint database are presented to show the effectiveness of the proposed algorithm and its superiority over existing algorithms.
Joint Factor Analysis Versus Eigenchannels in Speaker Recognition

We compare two approaches to the problem of session variability in Gaussian mixture model (GMM)-based speaker verification, eigenchannels, and joint factor analysis, on the National Institute of Standards and Technology (NIST) 2005 speaker recognition evaluation data. We show how the two approaches can be implemented using essentially the same software at all stages except for the enrollment of target speakers. We demonstrate the effectiveness of zt-norm score normalization and a new decision criterion for speaker recognition which can handle large numbers of t-norm speakers and large numbers of speaker factors at little computational cost. We found that factor analysis was far more effective than eigenchannel modeling. The best result we obtained was a detection cost of 0.016 on the core condition (all trials) of the evaluation
A Comparison of Fast Blocking Methods for Record Linkage

Blocking methods are used in record linkage systems to reduce the number of candidate record comparison pairs to a feasible number whilst still maintaining linkage accuracy. Blocking methods partition the data sets into blocks or clusters of records which share a blocking attribute or are otherwise similar with respect to a defined criterion. We compare two new blocking methods, bigram indexing and canopy clustering with TFIDF (Term Frequency/Inverse Document Frequency), with two older methods of standard traditional blocking and sorted neighbourhood blocking. The results show that recently blocking methods such as bigram indexing and canopy clustering provide scalable blocking methods while maintaining or improving upon record linkage accuracy. There is a potential for large performance speed-ups and better accuracy to be achieved by these new blocking methods.
A comparison of B2B e-service solutions

The Internet is evolving not only to provide information and e-commerce transactions, but also to act as the platform through which services are delivered to businesses and customers. These electronic services or e-services could become a key part of the value provided by many businesses [2, 5, 10]. At the core of this evolution is Extensible Markup Language (XML), which has emerged as the foundation of all architectures suggested for such services. XML simplifies the exchange of information by letting users define their own syntax and use underlying technologies of the Internet. However, while organizations can define XML syntax to solve their specific problems, the multitude of syntax (schemas) creates incompatibility problems with schemas developed by others. This is one of the reasons why major organizations are creating business-to-business (B2B) XML framework standards to enable interoperability. To overcome these problems, efforts are underway to develop standards for e-services including eCo by a consortium led by CommerceNet; RosettaNet by a consortium that includes IBM, Microsoft, EDS, SAP, Cisco systems, Compaq and Intel; BizTalk by Microsoft; e-speak by Hewlett Packard (HP), and several others. Since these B2B interoperability standards are likely to be very important in the way businesses interact with each other in the future, an overview of these standardization efforts is certain to be of considerable importance to the IS community. This article describes the components (core modules of platforms for linking Internet-based service providers) of e-services and compares popular B-to-B e-commerce frameworks based on their support for e-service components.
Therapeutic Uses of Active Videogames: A Systematic Review.

Active videogames (AVGs) may be useful for promoting physical activity for therapeutic uses, including for balance, rehabilitation, and management of illness or disease. The literature from 64 peer-reviewed publications that assessed health outcomes of AVGs for therapeutic purposes was synthesized.



PubMed, Medline, and PyschInfo were queried for original studies related to the use of AVGs to improve physical outcomes in patients who were ill or undergoing rehabilitation related to balance, burn treatment, cancer, cerebral palsy, Down's syndrome, extremity dysfunction or amputation, hospitalization, lupus, Parkinson's disease, spinal injury, or stroke. The following inclusion criteria were used: (1) human subjects; (2) English language; (3) not duplicates; (4) new empirical data; and (5) tests an AVG, including commercially available or custom-designed. Studies were included regardless of participants' age or the study design.



Overall, the vast majority of studies demonstrated promising results for improved health outcomes related to therapy, including significantly greater or comparable effects of AVG play versus usual care. However, many studies were pilot trials with small, homogeneous samples, and many studies lacked a control or comparison group. Some trials tested multiweek or multimonth interventions, although many used a single bout of gameplay, and few included follow-up assessments to test sustainability of improved health.



AVGs were acceptable and enjoyable to the populations examined and appear as a promising tool for balance, rehabilitation, and illness management. Future research directions and implications for clinicians are discussed.
3D face recognition: a survey

3D face recognition has become a trending research direction in both industry and academia. It inherits advantages from traditional 2D face recognition, such as the natural recognition process and a wide range of applications. Moreover, 3D face recognition systems could accurately recognize human faces even under dim lights and with variant facial positions and expressions, in such conditions 2D face recognition systems would have immense difficulty to operate. This paper summarizes the history and the most recent progresses in 3D face recognition research domain. The frontier research results are introduced in three categories: pose-invariant recognition, expression-invariant recognition, and occlusion-invariant recognition. To promote future research, this paper collects information about publicly available 3D face databases. This paper also lists important open problems.
Classifying streaming of Twitter data based on sentiment analysis using hybridization

Twitter is a social media that developed rapidly in today’s modern world. As millions of Twitter messages are sent day by day, the value and importance of developing a new technique for detecting spammers become significant. Moreover, legitimate users are affected by means of spams in the form of unwanted URLs, irrelevant messages, etc. Another hot topic of research is sentiment analysis that is based on each tweet sent by the user and opinion mining of the customer reviews. Most commonly natural language processing is used for sentiment analysis. The text is collected from user’s tweets by opinion mining and automatic sentiment analysis that are oriented with ternary classifications, such as “positive,” “neutral,” and “negative.” Due to limited size, unstructured nature, misspells, slangs, and abbreviations, it is more challenging for researchers to find sentiments for Twitter data. In this paper, we collected 600 million public tweets using URL-based security tool and feature generation is applied for sentiment analysis. The ternary classification is processed based on preprocessing technique, and the results of tweets sent by the users are obtained. We use a hybridization technique using two optimization algorithms and one machine learning classifier, namely particle swarm optimization and genetic algorithm and decision tree for classification accuracy by sentiment analysis. The results are compared with previous works, and our proposed method shows a better analysis than that of other classifiers.
Can Markov Models Over Minimal Translation Units Help Phrase-Based SMT?

The phrase-based and N-gram-based SMT frameworks complement each other. While the former is better able to memorize, the latter provides a more principled model that captures dependencies across phrasal boundaries. Some work has been done to combine insights from these two frameworks. A recent successful attempt showed the advantage of using phrasebased search on top of an N-gram-based model. We probe this question in the reverse direction by investigating whether integrating N-gram-based translation and reordering models into a phrase-based decoder helps overcome the problematic phrasal independence assumption. A large scale evaluation over 8 language pairs shows that performance does significantly improve.
Constructing Simplicial Complexes over Topological Spaces

Topological data analysis usually begins by constructing a combinatorial structure, such as a simplicial complex, to approximate the lost topology of a sampled point set. Current techniques often assume the input is embedded in a Euclidean space, so these methods do not extend to non-Euclidean or nonmetric spaces. Moreover, complexes suffer from the curse of dimensionality and may get very large even for small input. In this paper, we present an oracle-based framework and algorithms that construct high-dimensional simplicial complexes over arbitrary topological spaces. Using the minimum-sized representation for the simplicial complexes, we design a novel top-down algorithm and analyze it both theoretically and experimentally. We compare its performance to other algorithmic approaches, building up to 27-dimensional complexes on a standard desktop machine. Finally, we apply our framework to problems from three domains: Google search, word composition, and protein structure. ∗Dartmouth College, Hanover, NH (dokto20m@gmail.com) †The D. E. Shaw Group, New York, NY
A Rank-Switching, Open-Row DRAM Controller for Time-Predictable Systems

We introduce ROC, a Rank-switching, Open-row Controller for Double Data Rate Dynamic RAM (DDR DRAM). ROC is optimized for mixed-criticality multicore systems using modern DDR devices: compared to existing real-time memory controllers, it provides significantly lower worst case latency bounds for hard real-time tasks and supports throughput-oriented optimizations for soft real-time applications. The key to improved performance is an innovative rank-switching mechanism which hides the latency of write-read transitions in DRAM devices without requiring unpredictable request reordering. We further employ open row policy to take advantage of the data caching mechanism (row buffering) in each device. ROC provides complete timing isolation between hard and soft tasks and allows for compositional timing analysis over the number of cores and memory ranks in the system. We implemented and synthesized the ROC back end in Verilog RTL, and evaluated its performance on both synthetic tasks and a set of representative benchmarks.
Less is more ? How demographic sample weights can improve public opinion estimates based on Twitter data

Twitter data is widely acknowledged to hold great promise for the study of political behavior and public opinion. However, a key limitation in previous studies is the lack of information about the sociodemographic characteristics of individual users, which raises concerns about the validity of inferences based on this source of data. This paper addresses this challenge by employing supervised machine learning methods to estimate the age, gender, race, party affiliation, propensity to vote, and income of any Twitter user in the U.S. The training dataset for these classifiers was obtained by matching a large dataset of 1 billion geolocated Twitter messages with voting registration records and estimates of home values across 15 different states, resulting in a sample of nearly 250,000 Twitter users whose sociodemographic traits are known. To illustrate the value of this approach, I offer three applications that use information about the predicted demographic composition of a random sample of 500,000 U.S. Twitter users. First, I explore how attention to politics varies across demographics groups. Then, I apply multilevel regression and postratification methods to recover valid estimate of presidential and candidate approval that can serve as early indicators of public opinion changes and thus complement traditional surveys. Finally, I demonstrate the value of Twitter data to study questions that may suffer from social desirability bias.   I would like to thank John Ahlquist, Drew Dimmery, Pat Egan, Martin Elff, Mik Laver, Jeff Lewis, Thomas Leeper, Jonathan Nagler, Molly Roberts, Arthur Spirling, David Sontag for helpful comments and discussions. I also gratefully acknowledges financial support from the Gordon and Betty Moore Foundation and the Alfred P. Sloan Foundation.
Integration of Text and Audio Features for Genre Classification in Music Information Retrieval

Multimedia content can be described in versatile ways as its essence is not limited to one view. For music data these multiple views could be a song’s audio features as well as its lyrics. Both of these modalities have their advantages as text may be easier to search in and could cover more of the ‘content semantics’ of a song, while omitting other types of semantic categorisation. (Psycho)acoustic feature sets, on the other hand, provide the means to identify tracks that ‘sound similar’ while less supporting other kinds of semantic categorisation. Those discerning characteristics of different feature sets meet users’ differing information needs. We will explain the nature of text and audio feature sets which describe the same audio tracks. Moreover, we will propose the use of textual data on top of low level audio features for music genre classification. Further, we will show the impact of different combinations of audio features and textual features based on content words.
Artificial Intelligence MArkup Language: A Brief Tutorial

The purpose of this paper is to serve as a reference guide for the development of chatterbots implemented with the AIML language. In order to achieve this, the main concepts in Pattern Recognition area are described because the AIML uses such theoretical framework in their syntactic and semantic structures. After that, AIML language is described and each AIML command/tag is followed by an application example. Also, the usage of AIML embedded tags for the handling of sequence dialogue limitations between humans and machines is shown. Finally, computer systems that assist in the design of chatterbots with the AIML language are classified and described.
Image Texture Feature Extraction Using GLCM Approach

Feature Extraction is a method of capturing visual content of images for indexing & retrieval. Primitive or low level image features can be either general features, such as extraction of color, texture and shape or domain specific features. This paper presents an application of gray level co-occurrence matrix (GLCM) to extract second order statistical texture features for motion estimation of images. The Four features namely, Angular Second Moment, Correlation, Inverse Difference Moment, and Entropy are computed using Xilinx FPGA. The results show that these texture features have high discrimination accuracy, requires less computation time and hence efficiently used for real time Pattern recognition applications.
Contextual RNN-GANs for Abstract Reasoning Diagram Generation

Education University of California, Berkeley (2008-2013) Ph.D. in Computer Science Thesis: Surface Web Semantics for Structured Natural Language Processing Advisor: Dan Klein. Committee members: Dan Klein, Marti Hearst, Line Mikkelsen, Nelson Morgan University of California, Berkeley (2012) Master of Science (M.S.) in Computer Science Thesis: An All-Fragments Grammar for Simple and Accurate Parsing Advisor: Dan Klein Indian Institute of Technology, Kanpur (2004-2008) Bachelor of Technology (B.Tech.) in Computer Science and Engineering GPA: 3.96/4.00 (Institute and Department Rank 2) Cornell University (Summer 2007) CS490 (Independent Research and Reading) GPA: 4.00/4.00 Advisors: Lillian Lee, Claire Cardie
Deep Activity Recognition Models with Triaxial Accelerometers

Despite the widespread installation of accelerometers in almost all mobile phones and wearable devices, activity recognition using accelerometers is still immature due to the poor recognition accuracy of existing recognition methods and the scarcity of labeled training data. We consider the problem of human activity recognition using triaxial accelerometers and deep learning paradigms. This paper shows that deep activity recognition models (a) provide better recognition accuracy of human activities, (b) avoid the expensive design of handcrafted features in existing systems, and (c) utilize the massive unlabeled acceleration samples for unsupervised feature extraction. Moreover, a hybrid approach of deep learning and hidden Markov models (DL-HMM) is presented for sequential activity recognition. This hybrid approach integrates the hierarchical representations of deep activity recognition models with the stochastic modeling of temporal sequences in the hidden Markov models. We show substantial recognition improvement on real world datasets over state-of-the-art methods of human activity recognition using triaxial accelerometers.
Robotics Component Verification on ISS ROKVISS - Preliminary Results for Telepresence

ROKVISS, Germany's newest space robotics technology experiment, was successfully installed outside at the Russian Service Module of the International Space Station (ISS) during an extravehicular space walk at the end of January 2005. Since February 2005 a two joint manipulator is operated from ground via a direct radio link. The aim of ROKVISS is the in flight verification of highly integrated modular robotic joints as well as the demonstration of different control modes, reaching from high system autonomy to force feedback teleoperation (telepresence mode). The experiment will be operated for at least one year in free space to evaluate and qualify intelligent light weight robotics components under realistic circumstances for maintenance and repair tasks as foreseen in upcoming manned and unmanned space applications in near future. This paper focuses in the telepresence control mode, its technology and first results from the space experiment ROKVISS