nils-herrmann/clean_scirepeval huggingface dataset:
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges

In barter-exchange markets, agents seek to swap their items with one another, in order to improve their own utilities. These swaps consist of cycles of agents, with each agent receiving the item of the next agent in the cycle. We focus mainly on the upcoming national kidney-exchange market, where patients with kidney disease can obtain compatible donors by swapping their own willing but incompatible donors. With over 70,000 patients already waiting for a cadaver kidney in the US, this market is seen as the only ethical way to significantly reduce the 4,000 deaths per year attributed to kidney diseas.
 The clearing problem involves finding a social welfare maximizing exchange when the maximum length of a cycle is fixed. Long cycles are forbidden, since, for incentive reasons, all transplants in a cycle must be performed simultaneously. Also, in barter-exchanges generally, more agents are affected if one drops out of a longer cycle. We prove that the clearing problem with this cycle-length constraint is NP-hard. Solving it exactly is one of the main challenges in establishing a national kidney exchange.
 We present the first algorithm capable of clearing these markets on a nationwide scale. The key is incremental problem formulation. We adapt two paradigms for the task: constraint generation and column generation. For each, we develop techniques that dramatically improve both runtime and memory usage. We conclude that column generation scales drastically better than constraint generation. Our algorithm also supports several generalizations, as demanded by real-world kidney exchanges.
 Our algorithm replaced CPLEX as the clearing algorithm of the Alliance for Paired Donation, one of the leading kidney exchanges. The match runs are conducted every two weeks and transplants based on our optimizations have already been conducted.
An analysis of review content and reviewer variables that contribute to review helpfulness

Review helpfulness is attracting increasing attention of practitioners and academics. It helps in reducing risks and uncertainty faced by users in online shopping. This study examines uninvestigated variables by looking at not only the review characteristics but also important indicators of reviewers. Several significant review content and two reviewer variables are proposed and an effective review helpfulness prediction model is built using stochastic gradient boosting learning method. This study derived a mechanism to extract novel review content variables from review text. Six popular machine learning models and three real-life Amazon review data sets are used for analysis. Our results are robust to several product categories and along three Amazon review data sets. The results show that review content variables deliver the best performance as compared to the reviewer and state-of-the-art baseline as a standalone model. This study finds that reviewer helpfulness per day and syllables in review text strongly relates to review helpfulness. Moreover, the number of space, aux verb, drives words in review text and productivity score of a reviewer are also effective predictors of review helpfulness. The findings will help customers to write better reviews, help retailers to manage their websites intelligently and aid customers in their product purchasing decisions.
Two privacy-preserving approaches for data publishing with identity reservation

Many approaches have been proposed for publishing useful information while preserving data privacy. Among them, the privacy models of identity-reserved (k, l)-anonymity and identity-reserved $$(\alpha , \beta )$$ (α,β) -anonymity have been proposed to handle the situation where an individual could have multiple records. However, the two models fail to prevent attribute disclosure. To this end, we propose two new privacy models: enhanced identity-reserved l-diversity and enhanced identity-reserved $$(\alpha , \beta )$$ (α,β) -anonymity. Moreover, to implement the two privacy models we design a general anonymization algorithm, called DAnonyIR, with clustering technique by calling different decision functions, which can decrease the information loss caused by generalization. Further, we compare DAnonyIR concerning our two privacy models with existing generalization method GeneIR concerning identity-reserved (k, l)-anonymity and identity-reserved $$(\alpha , \beta )$$ (α,β) -anonymity, respectively. The experimental results show that our two approaches provide stronger privacy preservation, and their information loss and relative error ratio of query answering are less than those of GeneIR.
BFSPMiner: an effective and efficient batch-free algorithm for mining sequential patterns over data streams

Supporting sequential pattern mining from data streams is nowadays a relevant problem in the area of data stream mining research. Actual proposals available in the literature are based on the well-known PrefixSpan approach and are, indeed, able to effectively bound the error of discovered patterns. This approach foresees the idea of dividing the target stream in a collection of manageable chunks, i.e., pieces of stream, in order to gain into effectiveness and efficiency. Unfortunately, mining patterns from stream chunks indeed introduce additional errors with respect to the basic application scenario where the target stream is mined continuously, in a non-batch manner. This is due to several reasons. First, since batches are processed individually, patterns that contain items from two consecutive batches are lost. Secondly, in most batch-based approaches, the decision about the frequency of a pattern is done locally inside a single batch. Thus, if a pattern is frequent in the stream but its items are scattered over different batches, it will be continuously pruned out and will never become frequent due to the algorithm’s lack of the “complete-picture” perspective. In order to address so-delineated pattern mining problems, this paper introduces and experimentally assesses BFSPMiner, a Batch-Free Sequential Pattern Miner algorithm for effectively and efficiently mining patterns in streams without being constrained to the traditional batch-based processing. This allows us, for instance, to discover frequent patterns that would be lost according to alternative batch-based stream mining processing models. We complement our analytical contributions by means of a comprehensive experimental campaign of BFSPMiner against real-world data stream sets and in comparison with current batch-based stream sequential pattern mining algorithms.
ERP components on reaction errors and their functional significance: a tutorial

Some years ago we described a negative (Ne) and a later positive (Pe) deflection in the event-related brain potentials (ERPs) of incorrect choice reactions [Falkenstein, M., Hohnsbein, J., Hoormann, J., Blanke, L., 1990.  Brunia, C.H.M., Gaillard, A.W.K., Kok, A. (Eds.), Psychophysiological Brain Research. Tilburg Univesity Press, Tilburg, pp. 192-195. Falkenstein, M., Hohnsbein, J., Hoormann, J., 1991. Electroencephalography and Clinical Neurophysiology, 78, 447-455]. Originally we assumed the Ne to represent a correlate of error detection in the sense of a mismatch signal when representations of the actual response and the required response are compared. This hypothesis was supported by the results of a variety of experiments from our own laboratory and that of Coles [Gehring, W. J., Goss, B., Coles, M.G.H., Meyer, D.E., Donchin, E., 1993.  Bernstein, P.S., Scheffers, M.K., Coles, M.G.H., 1995. Journal of Experimental Psychology: Human Perception and Performance 21, 1312-1322. Scheffers, M.K., Coles, M. G.H., Bernstein, P., Gehring, W.J., Donchin, E., 1996. Psychophysiology 33, 42-54]. However, new data from our laboratory and that of Vidal et al. [Vidal, F., Hasbroucq, T., Bonnet, M., 1999. Biological Psychology, 2000] revealed a small negativity similar to the Ne also after correct responses. Since the above mentioned comparison process is also required after correct responses it is conceivable that the Ne reflects this comparison process itself rather than its outcome. As to the Pe, our results suggest that this is a further error-specific component, which is independent of the Ne, and hence associated with a later aspect of error processing or post-error processing. Our new results with different age groups argue against the hypotheses that the Pe reflects conscious error processing or the post-error adjustment of response strategies. Further research is necessary to specify the functional significance of the Pe.
Evaluation of Android Malware Detection Based on System Calls

With Android being the most widespread mobile platform, protecting it against malicious applications is essential. Android users typically install applications from large remote repositories, which provides ample opportunities for malicious newcomers. In this paper, we evaluate a few techniques for detecting malicious Android applications on a repository level. The techniques perform automatic classification based on tracking system calls while applications are executed in a sandbox environment. We implemented the techniques in the maline tool, and performed extensive empirical evaluation on a suite of around 12,000 applications. The evaluation considers the size and type of inputs used in analyses. We show that simple and relatively small inputs result in an overall detection accuracy of 93% with a 5% benign application classification error, while results are improved to a 96% detection accuracy with up-sampling. This indicates that system-call based techniques are viable to be used in practice. Finally, we show that even simplistic feature choices are effective, suggesting that more heavyweight approaches should be thoroughly (re)evaluated.
Characterization of the Impact of Hardware Islands on OLTP

Modern hardware is abundantly parallel and increasingly heterogeneous. The numerous processing cores have non-uniform access latencies to the main memory and processor caches, which causes variability in the communication costs. Unfortunately, database systems mostly assume that all processing cores are the same and that microarchitecture differences are not significant enough to appear in critical database execution paths. As we demonstrate in this paper, however, non-uniform core topology does appear in the critical path and conventional database architectures achieve suboptimal and even worse, unpredictable performance. We perform a detailed performance analysis of OLTP deployments in servers with multiple cores per CPU (multicore) and multiple CPUs per server (multisocket). We compare different database deployment strategies where we vary the number and size of independent database instances running on a single server, from a single shared-everything instance to fine-grained shared-nothing configurations. We quantify the impact of non-uniform hardware on various deployments by (a) examining how efficiently each deployment uses the available hardware resources and (b) measuring the impact of distributed transactions and skewed requests on different workloads. We show that no strategy is optimal for all cases and that the best choice depends on the combination of hardware topology and workload characteristics. Finally, we argue that transaction processing systems must be aware of the hardware topology in order to achieve predictably high performance.
Multilevel image thresholding by nature-inspired algorithms - A short review

Nondeterministic metaheuristic optimization and digital image processing are two very different research fields, both extremely active and applicable. They touch in a very limited area, but that narrow interaction opens new very promising applications for digital image processing and new and different deployment of metaheuristic optimization. Multilevel image thresholding is very important for image segmentation, which in turn is crucial for higher level image analysis. The problem includes exponential combinatorial optimization with complex objective functions which are solvable only by nondeterministic methods. This short review presents successful applications of the natureinspired metaheuristics to multilevel image thresholding.
Material-based Design Computation An Inquiry into Digital Simulation of Physical Material Properties as Design Generators

The paper demonstrates the association between geometry and material behavior, specifically the elastic properties of resin impregnated latex membranes, by means of homogenizing protocols which translate physical properties into geometrical functions. Resin-impregnation patterns are applied to 2-D pre-stretched form-active tension systems to induce 3-D curvature upon release.This method enables form-finding based on material properties, organization and behavior. Some theoretical foundations for material-computation are outlined. A digital tool developed in the Processing (JAVA coded) environment demonstrates the simulation of material behavior and its prediction under specific environmental conditions. Finally, conclusions are drawn from the physical and digital explorations which redefine generative material-based design computation, supporting a synergetic approach to design integrating form, structure, material and environment.
Effectiveness of fundamental frequency (F0) and strength of excitation (SOE) for spoofed speech detection

Current countermeasures used in spoof detectors (for speech synthesis (SS) and voice conversion (VC)) are generally phase-based (as vocoders in SS and VC systems lack phase-information). These approaches may possibly fail for non-vocoder or unit-selection-based spoofs. In this work, we explore excitation source-based features, i.e., fundamental frequency (F0) contour and strength of excitation (SoE) at the glottis as discriminative features using GMM-based classification system. We use F0 and SoE1 estimated from speech signal through zero frequency (ZF) filtering method. Further, SoE2 is estimated from negative peaks of derivative of glottal flow waveform (dGFW) at glottal closure instants (GCIs). On the evaluation set of ASVspoof 2015 challenge database, the F0 and SoEs features along with its dynamic variations achieve an Equal Error Rate (EER) of 12.41%. The source features are fused at score-level with MFCC and recently proposed cochlear filter cepstral coefficients and instantaneous frequency (CFCCIF) features. On fusion with MFCC (CFCCIF), the EER decreases from 4.08% to 3.26% (2.07% to 1.72%). The decrease in EER was evident on both known and unknown vocoder-based attacks. When MFCC, CFCCIF and source features are combined, the EER further decreased to 1.61%. Thus, source features captures complementary information than MFCC and CFCCIF used alone.
Analysis and Design for Intrusion Detection System Based on Data Mining

Network and host Intrusion Detection Systems (IDS) have become a standard component in security infrastructures. As the action of intrusion represents variable, complicated, and uncertainty characteristic, they face so many problems to resolve for intrusion detection. Each approach has its strengths and weaknesses. A truly effective intrusion detection system will employ both technologies. We discusses the differences in host- and network-based intrusion detection techniques to demonstrate how the two can work together to provide additionally effective intrusion detection and protection. We propose a hybrid IDS, which combines network and host IDS, with anomaly and misuse detection mode, utilizes auditing programs to extract an extensive set of features that describe each network connection or host session, and applies data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities.
A critical review of the literature on spreadsheet errors

Article history: Received 8 December 2006 Received in revised form 20 May 2008  2008 Among those who study spreadsheet use, it is widely accepted that errors are prevalent in operational spreadsheets and that errors can lead to poor decisions and cost millions of dollars. However, relatively little is known about what types of errors actually occur, how they were created, how they can be detected, and how they can be avoided or minimized. This paper summarizes and critiques the research literature on spreadsheet errors from the viewpoint of a manager who wishes to improve operational spreadsheet quality. We also offer suggestions for future research directions that can improve the state of knowledge about spreadsheet errors and mitigate spreadsheet risks.
Integrated Pedestrian and Direction Classification Using a Random Decision Forest

For analysing the behaviour of pedestrians in a scene, it is common practice that pedestrian localization, classification, and tracking are conducted consecutively. The direction of a pedestrian, being part of the pose, implies the future path. This paper proposes novel Random Decision Forests (RDFs) to simultaneously classify pedestrians and their directions, without adding an extra module for direction classification to the pedestrian classification module. The proposed algorithm is trained and tested on the TUD multi-view pedestrian and Daimler Mono Pedestrian Benchmark data-sets. The proposed integrated RDF classifiers perform comparable to pedestrian or direction trained separated RDF classifiers. The integrated RDFs yield results comparable to those of state-of-the-art and baseline methods aiming for pedestrian classification or body direction classification, respectively.
The Design and Implementation of CoGaDB: A Column-oriented GPU-accelerated DBMS

Nowadays, the performance of processors is primarily bound by a fixed energy budget, the power wall. This forces hardware vendors to optimize processors for specific tasks, which leads to an increasingly heterogeneous hardware landscape. Although efficient algorithms for modern processors such as GPUs are heavily investigated, we also need to prepare the database optimizer to handle computations on heterogeneous processors. GPUs are an interesting base for case studies, because they already offer many difficulties we will face tomorrow. In this paper, we present CoGaDB, a main-memory DBMS with built-in GPU acceleration, which is optimized for OLAP workloads. CoGaDB uses the self-tuning optimizer framework HyPE to build a hardware-oblivious optimizer, which learns cost models for database operators and efficiently distributes a workload on available processors. Furthermore, CoGaDB implements efficient algorithms on CPU and GPU and efficiently supports star joins. We show in this paper, how these novel techniques interact with each other in a single system. Our evaluation shows that CoGaDB quickly adapts to the underlying hardware by increasing the accuracy of its cost models at runtime.
For Peer Review Partial least squares regression

Partial least squares (pls) regression (a.k.a projection on latent structures) is a recent technique that combines features from and generalizes principal component analysis (pca) and multiple linear regression. Its goal is to predict a set of dependent variables from a set of independent variables or predictors. This prediction is achieved by extracting from the predictors a set of orthogonal factors called latent variables which have the best predictive power. These latent variables can be used to create displays akin to pca displays. The quality of the prediction obtained from a pls regression model is evaluated with cross-validation techniques such as the bootstrap and jackknife. There are two main variants of pls regression: The most common one separates the rôles of independent and independent variables; the second one—used mostly to analyze brain imaging data—gives the same rôles to dependent and independent variables.
The Advanced Health and Disaster Aid Network: A Light-Weight Wireless Medical System for Triage

Advances in semiconductor technology have resulted in the creation of miniature medical embedded systems that can wirelessly monitor the vital signs of patients. These lightweight medical systems can aid providers in large disasters who become overwhelmed with the large number of patients, limited resources, and insufficient information. In a mass casualty incident, small embedded medical systems facilitate patient care, resource allocation, and real-time communication in the advanced health and disaster aid network (AID-N). We present the design of electronic triage tags on lightweight, embedded systems with limited memory and computational power. These electronic triage tags use noninvasive, biomedical sensors (pulse oximeter, electrocardiogram, and blood pressure cuff) to continuously monitor the vital signs of a patient and deliver pertinent information to first responders. This electronic triage system facilitates the seamless collection and dissemination of data from the incident site to key members of the distributed emergency response community. The real-time collection of data through a mesh network in a mass casualty drill was shown to approximately triple the number of times patients that were triaged compared with the traditional paper triage system.
Internet Banking Adoption Among Young Intellectuals

The aim of this paper is to study technology acceptance of internet banking among undergraduate students in Malaysia. Thus, the theoretical framework of the paper is based on modified version of Technology Acceptance Model (TAM). This paper develops a technology acceptance model for internet banking, a conceptual framework to explain the factors influencing undergraduate students' acceptance of internet banking. The model employs perceived usefulness (PU), perceived ease of use (PEOU), perceived credibility (PC) and computer self-efficacy (CSE). The first two are two initial constructs for TAM model. The rest are new constructs to be included in the model in order to have an extension of TAM model that better reflects the students’ view. The results suggest that PU, PEOU and PC had a significant relationship with behavioral intention. Further, these measures are good determinant for undergraduate acceptance for internet banking. Results also suggest that PU and PEOU had a significant relationship with CSE. On the contrary, CSE did not associate with PC. Also, PEOU had JIBC December 2007,  The paper is useful in providing the understanding of the TAM among undergraduate from Malaysians’ perspective.
Control design for PMM-based starter generator system for More Electric Aircraft

The paper deals with the control design of aircraft starter-generator system based on permanent magnet machine fed by active front end rectifier. The analysis of the starter-generator system can be split into 2 parts; starter and generator mode. Their respective control structures are proposed along with mathematical equations that represent the power system. Direct current field weakening method is selected for this high speed application while DC current control is considered during the generator mode. The nature of dynamic limiter employed along with the field weakening controller creates 2 states of operation. Linearized open loop plant models for both starter and generator modes are derived. The plants are verified with equivalent linear and non-linear Simulink models. Appropriate controllers are designed based on the closed loop analysis.