nils-herrmann/clean_scirepeval huggingface dataset:
A privacy-preserving approach to policy-based content dissemination

We propose a novel scheme for selective distribution of content, encoded as documents, that preserves the privacy of the users to whom the documents are delivered and is based on an efficient and novel group key management scheme. Our document broadcasting approach is based on access control policies specifying which users can access which documents, or subdocuments. Based on such policies, a broadcast document is segmented into multiple subdocuments, each encrypted with a different key. In line with modern attribute-based access control, policies are specified against identity attributes of users. However our broadcasting approach is privacy-preserving in that users are granted access to a specific document, or subdocument, according to the policies without the need of providing in clear information about their identity attributes to the document publisher. Under our approach, not only does the document publisher not learn the values of the identity attributes of users, but it also does not learn which policy conditions are verified by which users, thus inferences about the values of identity attributes are prevented. Moreover, our key management scheme on which the proposed broadcasting approach is based is efficient in that it does not require to send the decryption keys to the users along with the encrypted document. Users are able to reconstruct the keys to decrypt the authorized portions of a document based on subscription information they have received from the document publisher. The scheme also efficiently handles new subscription of users and revocation of subscriptions.
Event-based Dynamic Face Detection and Tracking Based on Activity

We present the first purely event-based approach for face detection using an ATIS, a neuromorphic camera. We look for pairs of blinking eyes by comparing local activity across the input frame to a predefined range, which is defined by the number of events per second in a specific location. If within range, the signal is checked for additional constraints such as duration, synchronicity and distance between the eyes. After a valid blink is registered, we await a second blink in the same spot to initiate Gaussian trackers above the eyes. Based on their position, a bounding box around the estimated outlines of the face is drawn. The face can then be tracked until it is occluded.
Cascaded pose regression

We present a fast and accurate algorithm for computing the 2D pose of objects in images called cascaded pose regression (CPR). CPR progressively refines a loosely specified initial guess, where each refinement is carried out by a different regressor. Each regressor performs simple image measurements that are dependent on the output of the previous regressors; the entire system is automatically learned from human annotated training examples. CPR is not restricted to rigid transformations: ‘pose’ is any parameterized variation of the object's appearance such as the degrees of freedom of deformable and articulated objects. We compare CPR against both standard regression techniques and human performance (computed from redundant human annotations). Experiments on three diverse datasets (mice, faces, fish) suggest CPR is fast (2–3ms per pose estimate), accurate (approaching human performance), and easy to train from small amounts of labeled data.
Elementary Siphons of Petri Nets and Deadlock Control in FMS

For responsiveness, in the Petri nets theory framework deadlock prevention policies based elementary siphons control are often utilized to deal with deadlocks caused by the sharing of resources in flexible manufacturing system (FMS) which is developing the theory of efficient strict minimal siphons of an S3PR. Analyzer of Petri net models and their P-invariant analysis, and deadlock control are presented as tools for modelling, efficiency structure analysis, control, and investigation of the FMSs when different policies can be implemented for the deadlock prevention. We are to show an effective deadlock prevention policy of a special class of Petri nets namely elementary siphons. As well, both structural analysis and reachability graph analysis and simulation are used for analysis and control of Petri nets. This work is successfully applied Petri nets to deadlock analysis using the concept of elementary siphons, for design of supervisors of some supervisory control problems of FMS and simulation of Petri net tool with MATLAB.
Vehicle licence plate recognition using super-resolution technique

Due to the development of economy and technology, the people's demands on cars are growing and so are the problems, such as finding stolen car, banning violation and parking lot management. It will be time-consuming and low-efficiency if we do those jobs only by human because of the limitation of human being's concentration. Therefore, it has been a popular topic to develop intelligent monitoring system under new video technology within a decade. There are still many rooms for future development and application in the car license detection and recognition fields. For finding stolen car, we can integrate car license detection system and road monitoring system to analyze the videos and trace the objects, so we can gain high-efficiency and low-cost results. For parking lot management system, we can have the result of access management and automatic charge to reduce the human resource through car license recognition system. Automated toll of highway can be done through car license recognition system as well. Because the car license recognition system is mostly applied to security monitoring field and business purposes, the demand of the accuracy is quite strict. There are causes which make the inaccuracy of the license recognition, such as the lack of video resolution, too small license due to the distance and the light and shadow. We will discuss the license recognition system and how to use apply the super-resolution to overcome those above problems.
Blockchain Based Access Control

Access Control systems are used in computer security to regulate the access to critical or valuable resources. The rights of subjects to access such resources are typically expressed through access control policies, which are evaluated at access request time against the current access context. This paper proposes a new approach based on blockchain technology to publish the policies expressing the right to access a resource and to allow the distributed transfer of such right among users. In our proposed protocol the policies and the rights exchanges are publicly visible on the blockchain, consequently any user can know at any time the policy paired with a resource and the subjects who currently have the rights to access the resource. This solution allows distributed auditability, preventing a party from fraudulently denying the rights granted by an enforceable policy. We also show a possible working implementation based on XACML policies, deployed on the Bitcoin blockchain.
Education , politics and opinions about climate change evidence for interaction effects

U.S. public opinion regarding climate change has become increasingly polarized in recent years, as partisan think tanks and others worked to recast an originally scientific topic into a political wedge issue. Nominally “scientific” arguments against taking anthropogenic climate change seriously have been publicized to reach informed but ideologically receptive audiences. Reflecting the success of such arguments, polls have noted that concern about climate change increased with education among Democrats, but decreased with education among Republicans. These observations lead to the hypothesis that there exist interaction (non-additive) effects between education or knowledge and political orientation, net of other background factors, in predicting public concern about climate change. Two regional telephone surveys, conducted in New Hampshire (n = 541) and Michigan (n = 1, 008) in 2008, included identical climate-change questions that provide opportunities to test this hypothesis. Multivariate analysis of both surveys finds significant interactions. These empirical results fit with theoretical interpretations and several other recent studies. They suggest that the classically identified social bases of concern about the environment in general, and climate in particular, have shifted in recent years. Narrowcast media, including the many Web sites devoted to discrediting climatechange concerns, provide ideal conduits for channeling contrarian arguments to an audience predisposed to believe and electronically spread them further. Activeresponse Web sites by climate scientists could prove critical to counterbalancing contrarian arguments. L. C. Hamilton (B) Sociology Department, University of New Hampshire, Durham, NH, 03824, USA e-mail: Lawrence.Hamilton@unh.edu
The Wiener-Askey Polynomial Chaos for Stochastic Differential Equations

We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener’s polynomial chaos. Specifically, we represent the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces the dimensionality of the system and leads to exponential convergence of the error. Several continuous and discrete processes are treated, and numerical examples show substantial speed-up compared to Monte Carlo simulations for low dimensional stochastic inputs.
Ultra-wideband (UWB) Wilkinson power divider with ultra-narrow dual-notched bands using embedded CPW resonators

In this paper, an ultra-wideband (UWB) Wilkinson power divider with ultra-narrow dual-notched bands is proposed. The multi-mode UWB characteristic is achieved using stepped-impedance open-circuited stub (SIOS) and broadside-coupled microstrip/CPW (BCMC) transition. Then, to cancel the interferences from existed wireless local-area network (WLAN) signals (i.e., 5.2 and 5.8 GHz), two pairs of embedded CPW resonators are employed. To verify the mechanisms mentioned above, an UWB power divider with dual-notched bands is implemented and fabricated. The measurement exhibits dual-notched bands with center frequencies of 5.28 and 5.86 GHz, which has merits of 10-dB notched FBW of 1.5% and 0.68%, respectively.
When learning about the real world is better done virtually : A study of substituting computer simulations for laboratory equipment

This paper examines the effects of substituting a computer simulation for real laboratory equipment in the second semester of a large-scale introductory physics course. The direct current circuit laboratory was modified to compare the effects of using computer simulations with the effects of using real light bulbs, meters, and wires. Two groups of students, those who used real equipment and those who used a computer simulation that explicitly modeled electron flow, were compared in terms of their mastery of physics concepts and skills with real equipment. Students who used the simulated equipment outperformed their counterparts both on a conceptual survey of the domain and in the coordinated tasks of assembling a real circuit and describing how it worked.
Automatic, On-Line Tuning of YARN Container Memory and CPU Parameters

Big data analytic technologies such as Hadoop and Spark run on compute clusters that are managed by resource managers such as YARN. YARN manages resources available to individual applications, thereby affecting job performance. Manual tuning of YARN tuning parameters can result in sub-optimal and brittle performance. Parameters that are optimal for one job may not be well suited to another. In this paper we present KERMIT, the first on-line automatic tuning system for YARN. KERMIT optimizes in real-time YARN memory and CPU allocations to individual YARN containers by analysing container response-time performance. Unlike previous automatic tuning methods for specific systems such as Spark or Hadoop, this is the first study that focuses on the more general case of on-line, real-time tuning of YARN container density and how this affects performance of applications running on YARN. KERMIT employs the same tuning code to automatically tune any system that uses YARN, including both Spark and Hadoop. The effectiveness of our technique was evaluated for Hadoop and Spark jobs using the Terasort, TPCx-HS, and SMB benchmarks. KERMIT was able to achieve an efficiency of more than 92% of the best possible tuning configuration (exhaustive search of the parameter space) and up to 30% faster than basic manual tuning.
Improving accuracy in E-Textiles as a platform for pervasive sensing

Recently Electronic Textile (E-Textile) technology enables the weaving computation and communication components into the clothes that we wear and objects that we interact with every day. E-Textile enables the design and development of a broad range of pervasive sensing systems such as smart bed sheets for sleep posture monitoring, insoles in medical shoes for monitoring plantar pressure distribution, smart garments and sensing gloves. However the low cost of E-Textiles come at the cost of accuracy. In this work we propose an actuator-based method that increases the accuracy of E-Textiles by means of enabling real-time calibration. Our proposed system increases system accuracy by 38.55% on average (maximum 58.4%).
Survey over image thresholding techniques and quantitative performance evaluation

ral he tuffect as 3; a Abstract. We conduct an exhaustive survey of image thresholding methods, categorize them, express their formulas under a uniform notation, and finally carry their performance comparison. The thresholding methods are categorized according to the information they are exploiting, such as histogram shape, measurement space clustering, entropy, object attributes, spatial correlation, and local gray-level surface. 40 selected thresholding methods from various categories are compared in the context of nondestructive testing applications as well as for document images. The comparison is based on the combined performance measures. We identify the thresholding algorithms that perform uniformly better over nondestructive testing and document image applications.
Forecasting market demand for new telecommunications services: an introduction

The marketing team of a new telecommunications company is usually tasked with producing forecasts for diverse stakeholders with different needs. Consequently, those outside marketing often realize neither the many reasons for developing forecasts nor the marketing theory used and the challenges involved in doing so. Based on our three decades of experience working with telecommunications operators around the world we seek to redress this situation by presenting a discussion of the issues involved in demand forecasting for new communications services.
Informed Recommender: Basing Recommendations on Consumer Product Reviews

Recommender systems attempt to predict items in which a user might be interested, given some information about the user's and items' profiles. Most existing recommender systems use content-based or collaborative filtering methods or hybrid methods that combine both techniques (see the sidebar for more details). We created Informed Recommender to address the problem of using consumer opinion about products, expressed online in free-form text, to generate product recommendations. Informed recommender uses prioritized consumer product reviews to make recommendations. Using text-mining techniques, it maps each piece of each review comment automatically into an ontology.
Service Function Chaining Resource Allocation: A Survey

Service Function Chaining (SFC) is a crucial technology for future Internet. It aims to overcome the limitation of current deployment models which is rigid and static. Application of this technology relies on algorithms that can optimally mapping SFC to substrate network. This category of algorithms is referred as “Service Function Chaining Resource Allocation (SFC-RA)” algorithms or “VNF placement (VNFP)” algorithms. This paper presents a survey of current researches in SFCRA algorithms. After presenting the formulation and related problems, several variants of SFC-RA problem are summarized. At last, we discussed several future research directions.
New Maximum Power Point Tracker Using Sliding-Mode Observer for Estimation of Solar Array Current in the Grid-Connected Photovoltaic System

A new maximum power point tracker (MPPT) for a grid-connected photovoltaic system without solar array current sensor is proposed. The solar array current information is obtained from the sliding-mode observer and fed into the MPPT to generate the reference voltage. The parameter values such as capacitances can be changed up to 50% from their nominal values, and the linear observer cannot estimate the correct state values under the parameter variations and noisy environments. The structure of a sliding-mode observer is simple, but it shows the robust tracking property against modeling uncertainties and parameter variations. In this paper, the sliding-mode observer for the solar array current has been proposed to compensate for the parameter variations. The mathematical modeling and the experimental results verify the validity of the proposed method
Piccolo: An Ultra-Lightweight Blockcipher

We propose a new 64-bit blockcipher Piccolo supporting 80 and 128-bit keys. Adopting several novel design and implementation techniques, Piccolo achieves both high security and notably compact implementation in hardware. We show that Piccolo offers a sufficient security level against known analyses including recent related-key differential attacks and meet-in-the-middle attacks. In our smallest implementation, the hardware requirements for the 80 and the 128-bit key mode are only 683 and 758 gate equivalents, respectively. Moreover, Piccolo requires only 60 additional gate equivalents to support the decryption function due to its involution structure. Furthermore, its efficiency on the energy consumption which is evaluated by energy per bit is also remarkable. Thus, Piccolo is one of the competitive ultra-lightweight blockciphers which are suitable for extremely constrained environments such as RFID tags and sensor nodes.
Integrating Importance, Non-Redundancy and Coherence in Graph-Based Extractive Summarization

We propose a graph-based method for extractive single-document summarization which considers importance, non-redundancy and local coherence simultaneously. We represent input documents by means of a bipartite graph consisting of sentence and entity nodes. We rank sentences on the basis of importance by applying a graph-based ranking algorithm to this graph and ensure non-redundancy and local coherence of the summary by means of an optimization step. Our graph based method is applied to scientific articles from the journal PLOS Medicine. We use human judgements to evaluate the coherence of our summaries. We compare ROUGE scores and human judgements for coherence of different systems on scientific articles. Our method performs considerably better than other systems on this data. Also, our graph-based summarization technique achieves state-of-the-art results on DUC 2002 data. Incorporating our local coherence measure always achieves the best results.
Kalman filtering with state constraints : a survey of linear and nonlinear algorithms

The Kalman filter is the minimum-variance state estimator for linear dynamic systems with Gaussian noise. Even if the noise is non-Gaussian, the Kalman filter is the best linear estimator. For nonlinear systems it is not possible, in general, to derive the optimal state estimator in closed form, but various modifications of the Kalman filter can be used to estimate the state. These modifications include the extended Kalman filter, the unscented Kalman filter, and the particle filter. Although the Kalman filter and its modifications are powerful tools for state estimation, we might have information about a system that the Kalman filter does not incorporate. For example, we may know that the states satisfy equality or inequality constraints. In this case we can modify the Kalman filter to exploit this additional information and get better filtering performance than the Kalman filter provides. This paper provides an overview of various ways to incorporate state constraints in the Kalman filter and its nonlinear modifications. If both the system and state constraints are linear, then all of these different approaches result in the same state estimate, which is the optimal constrained linear state estimate. If either the system or constraints are nonlinear, then constrained filtering is, in general, not optimal, and different approaches give different results.
Beyond Cyberbullying: Self-Disclosure, Harm and Social Support on ASKfm

ASKfm is a social media platform popular among teens and young adults where users can interact anonymously or semi-anonymously. In this paper, we identify the modes of disclosure and interaction that occur on the site, and evaluate why users are motivated to post and interact on the site, despite its reputation for facilitating cyberbullying. Through topic modeling - supplemented with manual annotation - of a large dataset of ASKfm posts, we identify and classify the rich variety of discourse posted on ASKfm, including both positive and negative forms, providing insights into the why individuals continue to engage with the site. These findings are complemented by a survey of young adults (aged 18-20) ASKfm users, which provides additional insights into users' motivations and interaction patterns. We discuss how the affordances specific to platforms like ASKfm, including anonymity and visibility, might enable users to respond to cyberbullying in novel ways, engage in positive forms of self-disclosure, and gain social support on sensitive topics. We conclude with design recommendations that would highlight the positive interactions on the website and help diminish the repurcussions of the negative interactions.
DCA for bot detection

Ensuring the security of computers is a non-trivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emerged in the form of networks of hijacked zombie machines used to perform complex distributed attacks such as denial of service and to obtain sensitive data such as password information. These zombie machines are said to be infected with a dasiahotpsila - a malicious piece of software which is installed on a host machine and is controlled by a remote attacker, termed the dasiabotmaster of a botnetpsila. In this work, we use the biologically inspired dendritic cell algorithm (DCA) to detect the existence of a single hot on a compromised host machine. The DCA is an immune-inspired algorithm based on an abstract model of the behaviour of the dendritic cells of the human body. The basis of anomaly detection performed by the DCA is facilitated using the correlation of behavioural attributes such as keylogging and packet flooding behaviour. The results of the application of the DCA to the detection of a single hot show that the algorithm is a successful technique for the detection of such malicious software without responding to normally running programs.