nils-herrmann/clean_scirepeval huggingface dataset:
Transparent Offloading and Mapping (TOM): Enabling Programmer-Transparent Near-Data Processing in GPU Systems

Main memory bandwidth is a critical bottleneck for modern GPU systems due to limited off-chip pin bandwidth. 3D-stacked memory architectures provide a promising opportunity to significantly alleviate this bottleneck by directly connecting a logic layer to the DRAM layers with high bandwidth connections. Recent work has shown promising potential performance benefits from an architecture that connects multiple such 3D-stacked memories and offloads bandwidth-intensive computations to a GPU in each of the logic layers. An unsolved key challenge in such a system is how to enable computation offloading and data mapping to multiple 3D-stacked memories without burdening the programmer such that any application can transparently benefit from near-data processing capabilities in the logic layer.
 Our paper develops two new mechanisms to address this key challenge. First, a compiler-based technique that automatically identifies code to offload to a logic-layer GPU based on a simple cost-benefit analysis. Second, a software/hardware cooperative mechanism that predicts which memory pages will be accessed by offloaded code, and places those pages in the memory stack closest to the offloaded code, to minimize off-chip bandwidth consumption. We call the combination of these two programmer-transparent mechanisms TOM: Transparent Offloading and Mapping.
 Our extensive evaluations across a variety of modern memory-intensive GPU workloads show that, without requiring any program modification, TOM significantly improves performance (by 30% on average, and up to 76%) compared to a baseline GPU system that cannot offload computation to 3D-stacked memories.
Using Data Mining Techniques for Sentiment Shifter Identification

Sentiment shifters, i.e., words and expressions that can affect text polarity, play an important role in opinion mining. However, the limited ability of current automated opinion mining systems to handle shifters represents a major challenge. The majority of existing approaches rely on a manual list of shifters; few attempts have been made to automatically identify shifters in text. Most of them just focus on negating shifters. This paper presents a novel and efficient semi-automatic method for identifying sentiment shifters in drug reviews, aiming at improving the overall accuracy of opinion mining systems. To this end, we use weighted association rule mining (WARM), a well-known data mining technique, for finding frequent dependency patterns representing sentiment shifters from a domain-specific corpus. These patterns that include different kinds of shifter words such as shifter verbs and quantifiers are able to handle both local and long-distance shifters. We also combine these patterns with a lexicon-based approach for the polarity classification task. Experiments on drug reviews demonstrate that extracted shifters can improve the precision of the lexicon-based approach for polarity classification 9.25 percent.
A comparative study of HTM and other neural network models for online sequence learning with streaming data

Online sequence learning from streaming data is one of the most challenging topics in machine learning. Neural network models represent promising candidates for sequence learning due to their ability to learn and recognize complex temporal patterns. In this paper, we present a comparative study of Hierarchical Temporal Memory (HTM), a neurally-inspired model, and other feedforward and recurrent artificial neural network models on both artificial and real-world sequence prediction algorithms. HTM and long-short term memory (LSTM) give the best prediction accuracy. HTM additionally demonstrates many other features that are desirable for real-world sequence learning, such as fast adaptation to changes in the data stream, robustness to sensor noise and fault tolerance. These features make HTM an ideal candidate for online sequence learning problems.
Wheat glutenin subunits and dough elasticity: findings of the EUROWHEAT project

*IACR-Long Ashton Research Station, Department of Agricultural Sciences, University of Bristol, Long Ashton BS41 9AF, UK (tel: +1275-392181; fax: +1275-394299;  peter.shewry@bbsrc.ac.uk) {Institut National de la Recherche Agronomique, Centre de Recherches de Nantes, Laboratoire de BiochimieetdeTechnologiedesProtéines,B.P.71627, Ruede laGéraudière,Nantes 44316,Cedex03, France xDipartimento di Agrobiologia ed Agrochimica, Via San Camillo de Lellis, Viterbo 01100, Lazio, Italy {Institute of Food Research, Norwich Laboratory, Norwich Research Park, Colney Lane, Norwich NR4 7UA, UK
Unsupervised Morpheme Segmentation and Morphology Induction from Text Corpora Using Morfessor 1.0

In this work, we describe the first public version of the Morfessor software, which is a program that takes as input a corpus of unannotated text and produces a segmentation of the word forms observed in the text. The segmentation obtained often resembles a linguistic morpheme segmentation. Morfessor is not language-dependent. The number of segments per word is not restricted to two or three as in some other existing morphology learning models. The current version of the software essentially implements two morpheme segmentation models presented earlier by us (Creutz and Lagus, 2002; Creutz, 2003). The document contains user’s instructions, as well as the mathematical formulation of the model and a description of the search algorithm used. Additionally, a few experiments on Finnish and English text corpora are reported in order to give the user some ideas of how to apply the program to his own data sets and how to evaluate the results.
Credit Card Fraud Detection: A Hybrid Approach Using Fuzzy Clustering &amp; Neural Network

Due to the rapid progress of the e-commerce and online banking, use of credit cards has increased considerably leading to a large number of fraud incidents. In this paper, we have proposed a novel approach towards credit card fraud detection in which the fraud detection is done in three phases. The first phase does the initial user authentication and verification of card details. If the check is successfully cleared, then the transaction is passed to the next phase where fuzzy c-means clustering algorithm is applied to find out the normal usage patterns of credit card users based on their past activity. A suspicion score is calculated according to the extent of deviation from the normal patterns and thereby the transaction is classified as legitimate or suspicious or fraudulent. Once a transaction is found to be suspicious, neural network based learning mechanism is applied to determine whether it was actually a fraudulent activity or an occasional deviation by a genuine user. Extensive experimentation with stochastic models shows that the combined use of clustering technique along with learning helps in detecting fraudulent activities effectively while minimizing the generation of false alarms.
The Perception of Biometric Technology: A Survey

This paper outlines the perceptions of 391 individuals on issues relating to biometric technology. The results from this survey are broadly in line with other consumer perception surveys conducted in 2003 and 2005, despite the increase in numbers of applications and deployments that affect individuals. Noticeably, 25% of the respondents had not heard of biometrics. Those who had heard of biometrics expressed several concerns, including cleanliness of the devices, safety (with respect to iris and retinal identification), applications for which their biometrics were going to be used, and who would have access to their biometric information. Results demonstrated overwhelming support for biometrics applications involving law enforcement and obtaining passports, while applications involving time and attendance tracking and access to public schools ranked lowest on the list.
Review of Wheeled Mobile Robots’ Navigation Problems and Application Prospects in Agriculture

Robot navigation in the environment with obstacles is still a challenging problem. In this paper, the navigation problems with wheeled mobile robots (WMRs) are reviewed, the navigation mechanism of WMRs is analyzed in detail, the methods of solving the sub problems such as mapping, localization and path planning which all both related to robot navigation are summarized and the advantages and disadvantages of the existing methods are expounded. Especially in the agricultural field, the precise navigation of robots in the complex agricultural environment is the prerequisite for the completion of various tasks. This paper is aimed at the special complexity of the agricultural environment, prospected the application of the solution to the navigation problem of WMRs in agricultural engineering, put forward the research direction to solve the problems of precise navigation in agricultural environments.
Decision Combination in Multiple Classifier Systems

A multiple classifier system is a powerful solution to difficult pattern recognition problems involving large class sets and noisy input because it allows simultaneous use of arbitrary feature descriptors and classification procedures. Decisions by the classifiers can be represented as rankings of classes so that they are comparable across different types of classifiers and different instances of a problem. The rankings can be combined by methods that either reduce or rerank a given set of classes. An intersection method and a union method are proposed for class set reduction. Three methods based on the highest rank, the Borda count, and logistic regression are proposed for class set reranking. These methods have been tested in applications on degraded machine-printed characters and words from large lexicons, resulting in substantial improvement in overall correctness.
Online Learning with Predictable Sequences

We present methods for online linear optimization that take advantage of benign (as opposed to worst-case) sequences. Specifically if the sequence encountered by the learner is described well by a known “predictable process”, the algorithms presented enjoy tighter bounds as compared to the typical worst case bounds. Additionally, the methods achieve the usual worst-case regret bounds if the sequence is not benign. Our approach can be seen as a way of adding prior knowledge about the sequence within the paradigm of online learning. The setting is shown to encompass partial and side information. Variance and path-length bounds [11, 9] can be seen as particular examples of online learning with simple predictable sequences. We further extend our methods and results to include competing with a set of possible predictable processes (models), that is “learning” the predictable process itself concurrently with using it to obtain better regret guarantees. We show that such model selection is possible under various assumptions on the available feedback. Our results suggest a promising direction of further research with potential applications to stock market and time series prediction.
Simulink Modeling and Design of an Efficient Hardware-Constrained FPGA-Based PMSM Speed Controller

The aim of this paper is to present a holistic approach to modeling and field programmable gate array (FPGA) implementation of a permanent magnet synchronous motor (PMSM) speed controller. The whole system is modeled in the Matlab Simulink environment. The controller is then translated to discrete time and remodeled using System Generator blocks, directly synthesizable into FPGA hardware. The algorithm is further refined and factorized to take into account hardware constraints, so as to fit into a low-cost FPGA, without significantly increasing the execution time. The resulting controller is then integrated together with sensor interfaces and analysis tools and implemented into an FPGA device. Experimental results validate the controller and verify the design.
Signal Characteristics on Sensor Data Compression in IoT -An Investigation

In Internet of Things (IoT), numerous and diverse types of sensors generate a plethora of data that needs to be stored and processed with minimum loss of information. This demands efficient compression mechanisms where loss of information is minimized. Hence data generated by diverse sensors with different signal features require optimum balance between compression gain and information loss. This paper presents a unique analysis of contemporary lossy compression algorithms applied on real field sensor data with different sensor dynamics. The aim of the work is to classify the compression algorithms based on the signal characteristics of sensor data and to map them to different sensor data types to ensure efficient compression. The present work is the stepping stone for a future recommender system to choose the preferred compression techniques for the given type of sensor data.
Evaluating a tool for improving accessibility to charts and graphs

We discuss factors in the design and evaluation of natural language-driven assistive technologies that generate descriptions of, and allow interaction with, graphical representations of numerical data. In particular, we provide data in favor of 1) screen-reading technologies as a usable, useful, and cost-effective means of interacting with graphs. The data also show that by carrying out evaluation of Assistive Technologies on populations other than the target communities, certain subtleties of navigation and interaction may be lost or distorted.
A review of empirical research on manufacturing flexibility

Manufacturing flexibility is widely recognized as a critical component to achieving a competitive advantage in the marketplace. A comprehensive look at the empirical research pertaining to manufacturing flexibility highlights the very fragmented nature of this body of work. We present a comprehensive contingency-based framework for examining the content related issues involving the relationships and variables included in past studies. We also examine several important Ž . research designrmethodology issues e.g., sampling, data collection and measurement and propose solutions to some identified problems. q 2000 Elsevier Science B.V. All rights reserved.
Inferring Dockless Shared Bike Distribution in New Cities

Recently, dockless shared bike services have achieved great success and reinvented bike sharing business in China. When expanding bike sharing business into a new city, most start-ups always wish to find out how to cover the whole city with a suitable bike distribution. In this paper, we study the problem of inferring bike distribution in new cities, which is challenging. As no dockless bikes are deployed in the new city, we propose to learn insights on bike distribution from cities populated with dockless bikes. We exploit multi-source data to identify important features that affect bike distributions and develop a novel inference model combining Factor Analysis and Convolutional Neural Network techniques. The extensive experiments on real-life datasets show that the proposed solution provides significantly more accurate inference results compared with competitive prediction methods.
Kalman Filtering in Wireless Sensor Networks

Challenges associated with the scarcity of bandwidth and power in wireless communications have to be addressed. For the state-estimation problems discussed in the paper, observations about a common state are collected by physically distributed terminals. To perform state estimation, wireless sensor networks (WSNs) may share these observations with each other or communicate them to a fusion center for centralized processing. With K vector observations {yk(n)}K k=1 available, the optimal mean squared error (MSE) estimation of the state x(n) for the linear model is accomplished by a Kalman filter.
Comparative study of Proportional Integral and Backstepping controller for Buck converter

This paper describes the comparative study of Proportional Integral (PI) and Backstepping controller for Buck converter with R-load and DC motor. Backstepping approach is an efficient control design procedure for both regulation and tracking problems. This approach is based upon a systematic procedure which guarantees global regulation and tracking. The proposed control scheme is to stabilize the output (voltage or speed) and tracking error to converge zero asymptotically. Buck converter system is simulated in MATLAB, using state reconstruction techniques. Simulation results of buck converter with R-load and PMDC motor reveals that, settling time of Backstepping controller is less than PI controller
Transmitter Beam Selection in Millimeter-Wave MIMO With In-Band Position-Aiding

Emerging wireless communication systems will be characterized by a tight coupling between communication and positioning. This is particularly apparent in millimeter-wave (mm-wave) communications, where devices use a large number of antennas, and the propagation is well described by geometric channel models. For mm-wave communications, initial access, consisting in the beam selection and alignment of two devices, is challenging and time consuming in the absence of location information. Conversely, accurate positioning relies on high-quality communication links with proper beam alignment. This paper studies this interaction and proposes a new position-aided transmitter beam selection protocol, which considers the problem of joint communication and positioning in scenarios with direct line-of-sight and scattering. Simulation results show significant reductions in latency with respect to a standard protocol.
Effect of Machine Translation in Interlingual Conversation: Lessons from a Formative Study

Language barrier is the primary challenge for effective cross-lingual conversations. Spoken language translation (SLT) is perceived as a cost-effective alternative to less affordable human interpreters, but little research has studied how people interact with such technology. Using a prototype translator application, we performed a formative evaluation to elicit how people interact with the technology and adapt their conversation style. We conducted two sets of studies with a total of 23 pairs (46 participants). Participants worked on storytelling tasks to simulate natural conversations with 3 different interface settings. Our findings show that collocutors naturally adapt their style of speech production and comprehension to compensate for inadequacies in SLT. We conclude the paper with design guidelines that emerged from the analysis.
Growth of the flickr social network

Online social networking sites like MySpace, Orkut, and Flickr are among the most popular sites on the Web and continue to experience dramatic growth in their user population. The popularity of these sites offers a unique opportunity to study the dynamics of social networks at scale. Having a proper understanding of how online social networks grow can provide insights into the network structure, allow predictions of future growth, and enable simulation of systems on networks of arbitrary size. However, to date, most empirical studies have focused on static network snapshots rather than growth dynamics.
 In this paper, we collect and examine detailed growth data from the Flickr online social network, focusing on the ways in which new links are formed. Our study makes two contributions. First, we collect detailed data covering three months of growth, encompassing 950,143 new users and over 9.7 million new links, and we make this data available to the research community. Second, we use a first-principles approach to investigate the link formation process. In short, we find that links tend to be created by users who already have many links, that users tend to respond to incoming links by creating links back to the source, and that users link to other users who are already close in the network.
Context-Aware Collaborative Filtering System: Predicting the User's Preference in the Ubiquitous Computing Environment

In this paper we present a context-aware collaborative filtering system that predicts a user’s preference in different context situations based on past experiences. We extend collaborative filtering techniques so that what other like-minded users have done in similar context can be used to predict a user’s preference towards an activity in the current context. Such a system can help predict the user’s behavior in different situations without the user actively defining it. For example, it could recommend activities customized for Bob for the given weather, location, and traveling companion(s), based on what other people like Bob have done in similar context.
To personalize or not to personalize: modeling queries with variation in user intent

In most previous work on personalized search algorithms, the results for all queries are personalized in the same manner. However, as we show in this paper, there is a lot of variation across queries in the benefits that can be achieved through personalization. For some queries, everyone who issues the query is looking for the same thing. For other queries, different people want very different results even though they express their need in the same way. We examine variability in user intent using both explicit relevance judgments and large-scale log analysis of user behavior patterns. While variation in user behavior is correlated with variation in explicit relevance judgments the same query, there are many other factors, such as result entropy, result quality, and task that can also affect the variation in behavior. We characterize queries using a variety of features of the query, the results returned for the query, and people's interaction history with the query. Using these features we build predictive models to identify queries that can benefit from personalization.
Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms

A key operation in network analysis is the discovery of cohesive subgraphs. The notion of $k$-truss has gained considerable popularity in this regard, based on its rich structure and efficient computability. However, many complex networks such as social, biological and communication networks feature uncertainty, best modeled using probabilities. Unfortunately the problem of discovering k-trusses in probabilistic graphs has received little attention to date. In this paper, given a probabilistic graph G, number k and parameter γ --(0,1], we define a (k,γ)-truss as a maximal connected subgraph H ⊆ G, in which for each edge, the probability that it is contained in at least (k-2) triangles is at least γ. We develop an efficient dynamic programming algorithm for decomposing a probabilistic graph into such maximal (k,γ)-trusses. The above definition of a (k,γ)-truss is local in that the "witness" graphs that has the (k-2) triangles containing an edge in H may be quite different for distinct edges. Hence, we also propose: a global (k,γ)-truss, which in addition to being a local (k,γ)-truss, has to satisfy the condition that the probability that H contains a k-truss is at least γ. We show that unlike local (k,γ)-trusses, the global (k,γ)-truss decomposition on a probabilistic graph is intractable. We propose a novel sampling technique which enables approximate discovery of global (k,γ)-trusses with high probability. Our extensive experiments on real datasets demonstrate the efficacy of our proposed approach and the usefulness of local and global (k,γ)-truss.
A DYNAMIC FUZZY-COGNITIVE-MAP APPROACH BASED ON RANDOM NEURAL NETWORKS

A fuzzy cognitive map is a graphical means of representing arbitrarily complex models of interrelations between concepts. The purpose of this paper is to describe a dynamic fuzzy cognitive map based on the random neural network model. Previously, we have developed a random fuzzy cognitive map and illustrated its application in the modeling of processes. The adaptive fuzzy cognitive map changes its fuzzy causal web as causal patterns change and as experts update their causal knowledge. Our model carries out inferences via numerical calculation instead of symbolic deduction. We show how the dynamic random fuzzy cognitive map can reveal implications of models composed of dynamic processes.