nils-herrmann/clean_scirepeval huggingface dataset:
FraudFind: Financial fraud detection by analyzing human behavior

Financial fraud is commonly represented by the use of illegal practices where they can intervene from senior managers until payroll employees, becoming a crime punishable by law. There are many techniques developed to analyze, detect and prevent this behavior, being the most important the fraud triangle theory associated with the classic financial audit model. In order to perform this research, a survey of the related works in the existing literature was carried out, with the purpose of establishing our own framework. In this context, this paper presents FraudFind, a conceptual framework that allows to identify and outline a group of people inside an banking organization who commit fraud, supported by the fraud triangle theory. FraudFind works in the approach of continuous audit that will be in charge of collecting information of agents installed in user's equipment. It is based on semantic techniques applied through the collection of phrases typed by the users under study for later being transferred to a repository for later analysis. This proposal encourages to contribute with the field of cybersecurity, in the reduction of cases of financial fraud.
The difference between "giving a rose" and "giving a kiss": Sustained neural activity to the light verb construction.

We used event-related potentials (ERPs) to investigate the neurocognitive mechanisms associated with processing light verb constructions such as "give a kiss". These constructions consist of a semantically underspecified light verb ("give") and an event nominal that contributes most of the meaning and also activates an argument structure of its own ("kiss"). This creates a mismatch between the syntactic constituents and the semantic roles of a sentence. Native speakers read German verb-final sentences that contained light verb constructions (e.g., "Julius gave Anne a kiss"), non-light constructions (e.g., "Julius gave Anne a rose"), and semantically anomalous constructions (e.g., *"Julius gave Anne a conversation"). ERPs were measured at the critical verb, which appeared after all its arguments. Compared to non-light constructions, the light verb constructions evoked a widely distributed, frontally focused, sustained negative-going effect between 500 and 900 ms after verb onset. We interpret this effect as reflecting working memory costs associated with complex semantic processes that establish a shared argument structure in the light verb constructions.
Personalization versus Privacy: An Empirical Examination of the Online Consumer's Dilemma

Personalization refers to the tailoring of products and purchase experience to the tastes of individual consumers based upon their personal and preference information. Recent advances in information acquisition and processing technologies have allowed online vendors to offer varieties of web-based personalization that not only increases switching costs, but also serves as important means of acquiring valuable customer information. However, investments in online personalization may be severely undermined if consumers do not use these services due to privacy concerns. In the absence of any empirical evidence that seeks to understand this consumer dilemma, our research develops a parsimonious model to predict consumers’ usage of online personalization as a result of the tradeoff between their value for personalization and concern for privacy. In addition to this tradeoff, we find that a consumer’s intent to use personalization services is positively influenced by her trust in the vendor. Our findings suggest that: 1. online vendors can improve their abilities to acquire and use customer information through trust building activities; 2. it is of critical importance that vendors understand and evaluate the different values consumers may place in enjoying various types of personalization.
Designing large high-resolution display workspaces

Large, high-resolution displays have enormous potential to aid in scenarios beyond their current usage. Their current usages are primarily limited to presentations, visualization demonstrations, or conducting experiments. In this paper, we present a new usage for such systems: an everyday workspace. We discuss how seemingly small large-display design decisions can have significant impacts on users' perceptions of these workspaces, and thus the usage of the space. We describe the effects that various physical configurations have on the overall usability and perception of the display. We present conclusions on how to broaden the usage scenarios of large, high-resolution displays to enable frequent and effective usage as everyday workspaces while still allowing transformation to collaborative or presentation spaces.
A Theoretical Analysis of Deep Q-Learning

Despite the great empirical success of deep reinforcement learning, its theoretical foundation is less well understood. In this work, we make the first attempt to theoretically understand the deep Qnetwork (DQN) algorithm (Mnih et al., 2015) from both algorithmic and statistical perspectives. In specific, we focus on a slight simplification of DQN that fully captures its key features. Under mild assumptions, we establish the algorithmic and statistical rates of convergence for the actionvalue functions of the iterative policy sequence obtained by DQN. In particular, the statistical error characterizes the bias and variance that arise from approximating the action-value function using deep neural network, while the algorithmic error converges to zero at a geometric rate. As a byproduct, our analysis provides justifications for the techniques of experience replay and target network, which are crucial to the empirical success of DQN. Furthermore, as a simple extension of DQN, we propose the Minimax-DQN algorithm for zero-sum Markov game with two players. Borrowing the analysis of DQN, we also quantify the difference between the policies obtained by Minimax-DQN and the Nash equilibrium of the Markov game in terms of both the algorithmic and statistical rates of convergence.
Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve

This paper describes a method for finding the rectangle of minimum area in which a given arbitrary plane curve can be contained. The method is of interest in certain packing and optimum layout problems. It consists of first determining the minimal-perimeter convex polygon that encloses the given curve and then selecting the rectangle of minimum area capable of containing this polygon. Three theorems are introduced to show that one side of the minimum-area rectangle must be collinear with an edge of the enclosed polygon and that the minimum-area encasing rectangle for the convex polygon is also the minimum-area rectangle for the curve.
Don't fall into a trap: Physical side-channel analysis of ChaCha20-Poly1305

The stream cipher ChaCha20 and the MAC function Poly1305 have been published as IETF RFC 7539. Since then, the industry is starting to use it more often. For example, it has been implemented by Google in their Chrome browser for TLS and also support has been added to OpenSSL, as well as OpenSSH. It is often claimed, that the algorithms are designed to be resistant to side-channel attacks. However, this is only true, if the only observable side-channel is the timing behavior. In this paper, we show that ChaCha20 is susceptible to power and EM side-channel analysis, which also translates to an attack on Poly1305, if used together with ChaCha20 for key generation. As a first countermeasure, we analyze the effectiveness of randomly shuffling the operations of the ChaCha round function.
Survivable SCADA Via Intrusion-Tolerant Replication

Providers of critical infrastructure services strive to maintain the high availability of their SCADA systems. This paper reports on our experience designing, architecting, and evaluating the first survivable SCADA system-one that is able to ensure correct behavior with minimal performance degradation even during cyber attacks that compromise part of the system. We describe the challenges we faced when integrating modern intrusion-tolerant protocols with a conventional SCADA architecture and present the techniques we developed to overcome these challenges. The results illustrate that our survivable SCADA system not only functions correctly in the face of a cyber attack, but that it also processes in excess of 20 000 messages per second with a latency of less than 30 ms, making it suitable for even large-scale deployments managing thousands of remote terminal units.
Persian Text Normalization using Classification Tree and Support Vector Machine

Text normalization is one of the most important tasks in text processing and text to speech conversion. In this paper, we propose a machine learning method to determine the type of Farsi language non-standard words (NSWs) by only using the structure of these words. Two methods including support vector machines (SVM) and classification and regression trees (CART) were used and evaluated on different training and test sets for NSW type classification in Farsi. The experimental results show that, NSW type classification in Farsi can be efficiently done by using only the structural form of Farsi non-standard words. In addition, the results is compared with a previous work done on normalization using multi-layer perceptron (MLP) neural network and shows that SVM outperforms MLP in both number of efforts and total performance
Projection of RFID-Obtained Product Information on a Retail Stores Indoor Panoramas

RFID can be used to obtain information about objects present in a physical space, including their approximate location. Handheld RFID readers, smart shelves, zenithal antennas, and autonomous robots can obtain additional information with varying time and space resolutions. The authors present a system that projects this information on a panoramic view of a retail store, allowing users to virtually navigate the space and obtain quasi-real-time information about the products as they actually are in the store. For example, when a user clicks on the image of a shelf in the panorama, product information appears at or near that position from the last RFID-based inventory, which could be as recent as a few seconds ago.
Formal Analysis of Graphical Security Models

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. May not music be described as the mathematics of the sense, mathematics as music of the reason? The musician feels mathematics, the mathematician thinks music: music the dream, mathematics the working life.  The increasing usage of computer-based systems in almost every aspect of our daily life makes more and more dangerous the threat posed by potential attackers , and more and more rewarding a successful attack. Moreover, the complexity of these systems is also increasing, including physical devices, software components and human actors interacting with each other to form so-called socio-technical systems. The importance of socio-technical systems to modern societies requires verifying their security properties formally, while their inherent complexity makes manual analyses impracticable. Graphical models for security offer an unrivalled opportunity to describe socio-technical systems, for they allow to represent different aspects like human behaviour, computation and physical phenomena in an abstract yet uniform manner. Moreover, these models can be assigned a formal semantics, thereby allowing formal verification of their properties. Finally, their appealing graphical notations enable to communicate security concerns in an understandable way also to non-experts, often in charge of the decision making. This dissertation argues that automated techniques can be developed on graphical security models to evaluate qualitative and quantitative security properties of socio-technical systems and to synthesise optimal attack and defence strategies. In support to this claim we develop analysis techniques for widely-used graphical security models such as attack trees and attack-defence trees. Our analyses cope with the optimisation of multiple parameters of an attack and defence scenario. Improving on the literature, in case of conflicting parameters such as probability and cost we compute the set of optimal solutions …
Autonomous local path planning for a mobile robot using a genetic algorithm

This work presents results of our work in development of a genetic algorithm based path-planning algorithm for local obstacle avoidance (local feasible path) of a mobile robot in a given search space. The method tries to find not only a valid path but also an optimal one. The objectives are to minimize the length of the path and the number of turns. The proposed path-planning method allows a free movement of the robot in any direction so that the path-planner can handle complicated search spaces.
Theory of Games and Economic Behavior

The nature of the problems investigated and the techniques employed in this book necessitate a procedure which in many instances is thoroughly mathematical. The mathematical devices used are elementary in the sense that no advanced algebra, or calculus, etc., occurs. (With two, rather unimportant, exceptions: Part of the discussion of an example in 19.7. et sequ. and a remark in A.3.3. make use of some simple integrals.) Concepts originating in set theory, linear geometry and group theory play an important role, but they are invariably taken from the early chapters of those disciplines and are moreover analyzed and explained in special expository sections. Nevertheless the book is not truly elementary because the mathematical deductions are frequently intricate and the logical possibilities are extensively exploited. Thus no specific knowledge of any particular body of advanced mathematics is required. However, the reader who wants to acquaint himself more thoroughly with the subject expounded here, will have to familiarize himself with the mathematical way of reasoning definitely beyond its routine, primitive phases. The character of the procedures will be mostly that of mathematical logics, set theory and functional analysis. We have attempted to present the subject in such a form that a reader who is moderately versed in mathematics can acquire the necessary practice in the course of this study. We hope that we have not entirely failed in this endeavour. In accordance with this, the presentation is not what it would be in a strictly mathematical treatise. All definitions and deductions are considerably broader than they would be there. Besides, purely verbal discussions and analyses take up a considerable amount of space. We have in particular tried to give, whenever possible, a parallel verbal exposition for every major mathematical deduction. It is hoped that this procedure will elucidate in unmathematical language what the Search all I-Revues This Collection
Efficient and Scalable IoT Service Delivery on Cloud

Nowadays, IoT services are typically delivered as physically isolated vertical solutions, in which all system components ranging from sensory devices to applications are customized and tightly coupled for the requirements of each specific project. The efficiency and scalability of such service delivery model are intrinsically limited, posing significant challenges to IoT solution providers. Therefore, we propose a novel PaaS framework that provides essential platform services for IoT solution providers to efficiently deliver and continuously extend their services. This paper first introduces the IoT PaaS architecture, on which IoT solutions can be delivered as virtual verticals by leveraging computing resources and middleware services on cloud. Then we present the detailed mechanism and implementation of domain mediation, which helps solution providers to efficiently provide domain-specific control applications. The proposed approaches are demonstrated through the implementation of a domain mediator for building management and two use cases using the mediator.
Autonomous discovery of the goal space to learn a parameterized skill

A parameterized skill is a mapping from multiple goals/task parameters to the policy parameters to accomplish them. Existing works in the literature show how a parameterized skill can be learned given a task space that defines all the possible achievable goals. In this work, we focus on tasks defined in terms of final states (goals), and we face on the challenge where the agent aims to autonomously acquire a parameterized skill to manipulate an initially unknown environment. In this case, the task space is not known a priori and the agent has to autonomously discover it. The agent may posit as a task space its whole sensory space (i.e. the space of all possible sensor readings) as the achievable goals will certainly be a subset of this space. However, the space of achievable goals may be a very tiny subspace in relation to the whole sensory space, thus directly using the sensor space as task space exposes the agent to the curse of dimensionality and makes existing autonomous skill acquisition algorithms inefficient. In this work we present an algorithm that actively discovers the manifold of the achievable goals within the sensor space. We validate the algorithm by employing it in multiple different simulated scenarios where the agent actions achieve different types of goals: moving a redundant arm, pushing an object, and changing the color of an object.
The Dual-State Theory of Prefrontal Cortex Dopamine Function with Relevance to Catechol-<ce:italic>O</ce:italic>-Methyltransferase Genotypes and Schizophrenia

There is now general consensus that at least some of the cognitive deficits in schizophrenia are related to dysfunctions in the prefrontal cortex (PFC) dopamine (DA) system. At the cellular and synaptic level, the effects of DA in PFC via D1- and D2-class receptors are highly complex, often apparently opposing, and hence difficult to understand with regard to their functional implications. Biophysically realistic computational models have provided valuable insights into how the effects of DA on PFC neurons and synaptic currents as measured in vitro link up to the neural network and cognitive levels. They suggest the existence of two discrete dynamical regimes, a D1-dominated state characterized by a high energy barrier among different network patterns that favors robust online maintenance of information and a D2-dominated state characterized by a low energy barrier that is beneficial for flexible and fast switching among representational states. These predictions are consistent with a variety of electrophysiological, neuroimaging, and behavioral results in humans and nonhuman species. Moreover, these biophysically based models predict that imbalanced D1:D2 receptor activation causing extremely low or extremely high energy barriers among activity states could lead to the emergence of cognitive, positive, and negative symptoms observed in schizophrenia. Thus, combined experimental and computational approaches hold the promise of allowing a detailed mechanistic understanding of how DA alters information processing in normal and pathological conditions, thereby potentially providing new routes for the development of pharmacological treatments for schizophrenia.
A Parameter-Free Spatio-Temporal Pattern Mining Model to Catalog Global Ocean Dynamics

As spatio-temporal data have become ubiquitous, an increasing challenge facing computer scientists is that of identifying discrete patterns in continuous spatio-temporal fields. In this paper, we introduce a parameter-free pattern mining application that is able to identify dynamic anomalies in ocean data, known as ocean eddies. Despite ocean eddy monitoring being an active field of research, we provide one of the first quantitative analyses of the performance of the most used monitoring algorithms. We present an incomplete information validation technique, that uses the performance of two methods to construct an imperfect ground truth to test the significance of patterns discovered as well as the relative performance of pattern mining algorithms. These methods, in addition to the validation schemes discussed provide researchers new directions in analyzing large unlabeled climate datasets.
Predicting Human Trustfulness from Facebook Language

Trustfulness — one’s general tendency to have confidence in unknown people or situations — predicts many important real-world outcomes such as mental health and likelihood to cooperate with others such as clinicians. While datadriven measures of interpersonal trust have previously been introduced, here, we develop the first language-based assessment of the personality trait of trustfulness by fitting one’s language to an accepted questionnaire-based trust score. Further, using trustfulness as a type of case study, we explore the role of questionnaire size as well as word count in developing language-based predictive models of users’ psychological traits. We find that leveraging a longer questionnaire can yield greater test set accuracy, while, for training, we find it beneficial to include users who took smaller questionnaires which offers more observations for training. Similarly, after noting a decrease in individual prediction error as word count increased, we found a word count-weighted training scheme was helpful when there were very few users in the first place.
Answer Set Solving in Practice

Answer set programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of knowledge representation and reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP,aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP’s solving technology,modeling language and methodology,while illustrating the overall solving process by practical examples.