nils-herrmann/clean_scirepeval huggingface dataset:
An analysis of latent sector errors in disk drives

The reliability measures in today's disk drive-based storage systems focus predominantly on protecting against complete disk failures. Previous disk reliability studies have analyzed empirical data in an attempt to better understand and predict disk failure rates. Yet, very little is known about the incidence of latent sector errors i.e., errors that go undetected until the corresponding disk sectors are accessed.
 Our study analyzes data collected from production storage systems over 32 months across 1.53 million disks (both nearline and enterprise class). We analyze factors that impact latent sector errors, observe trends, and explore their implications on the design of reliability mechanisms in storage systems. To the best of our knowledge, this is the first study of such large scale our sample size is at least anorder of magnitude larger than previously published studies and the first one to focus specifically on latent sector errors and their implications on the design and reliability of storage systems.
SMPL: a skinned multi-person linear model

We present a learned model of human body shape and pose-dependent shape variation that is more accurate than previous models and is compatible with existing graphics pipelines. Our Skinned Multi-Person Linear model (SMPL) is a skinned vertex-based model that accurately represents a wide variety of body shapes in natural human poses. The parameters of the model are learned from data including the rest pose template, blend weights, pose-dependent blend shapes, identity-dependent blend shapes, and a regressor from vertices to joint locations. Unlike previous models, the pose-dependent blend shapes are a linear function of the elements of the pose rotation matrices. This simple formulation enables training the entire model from a relatively large number of aligned 3D meshes of different people in different poses. We quantitatively evaluate variants of SMPL using linear or dual-quaternion blend skinning and show that both are more accurate than a Blend-SCAPE model trained on the same data. We also extend SMPL to realistically model dynamic soft-tissue deformations. Because it is based on blend skinning, SMPL is compatible with existing rendering engines and we make it available for research purposes.
An extended Doherty amplifier with high efficiency over a wide power range

An extension of the Doherty amplifier architecture which maintains high efficiency over a wide range of output power (>6 dB) is presented. This extended Doherty amplifier is demonstrated experimentally with InGaP-GaAs HBTs at a frequency of 950 MHz. P/sub 1 dB/ is measured at 27.5 dBm with PAE of 46%. PAE of at least 39% is maintained for over an output power range of 12 dB backed-off from P/sub 1 dB/. This is an improvement over the classical Doherty amplifier, where high efficiency is typically obtained up to 5-6 dB backed-off from P/sub 1 dB/. Generalized design equations for the Doherty amplifier are derived to show a careful choice of the output matching circuit and device scaling parameters can improve efficiencies at lower output power.
Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort

Sort is a fundamental kernel used in many database operations. In-memory sorts are now feasible; sort performance is limited by compute flops and main memory bandwidth rather than I/O. In this paper, we present a competitive analysis of comparison and non-comparison based sorting algorithms on two modern architectures - the latest CPU and GPU architectures. We propose novel CPU radix sort and GPU merge sort implementations which are 2X faster than previously published results. We perform a fair comparison of the algorithms using these best performing implementations on both architectures. While radix sort is faster on current architectures, the gap narrows from CPU to GPU architectures. Merge sort performs better than radix sort for sorting keys of large sizes - such keys will be required to accommodate the increasing cardinality of future databases. We present analytical models for analyzing the performance of our implementations in terms of architectural features such as core count, SIMD and bandwidth. Our obtained performance results are successfully predicted by our models. Our analysis points to merge sort winning over radix sort on future architectures due to its efficient utilization of SIMD and low bandwidth utilization. We simulate a 64-core platform with varying SIMD widths under constant bandwidth per core constraints, and show that large data sizes of 240 (one trillion records), merge sort performance on large key sizes is up to 3X better than radix sort for large SIMD widths on future architectures. Therefore, merge sort should be the sorting method of choice for future databases.
Multi agent simulation of unorganized traffic

Traffic simulation is one of the most complex simulation projects that can be undertaken. The main issues are: modeling of autonomous behavior of drivers, modeling of their interaction, and ability to simulate the traffic and procure reliable realistic results. Organized traffic with drivers heeding to well defined traffic rules is less dynamic and erratic, than modeling unorganized traffic, wherein the drivers either do not heed to well defined traffic rules, or there are no traffic rules in place. This paper shows the viability of applying multi-agent simulation for unorganized traffic. In particular, we model the behavior of drivers, as being cautious, normal, and aggressive, and show results about average speed of vehicles in traffic, number of overtakes, and number of accidents occurring with different proportions of aggressive and cautious drivers. A multi-agent simulator with graphics interface has been implemented to visualize and evaluate the traffic flow.
Effective sensor fusion with event-based sensors and deep network architectures

The use of spiking neuromorphic sensors with state-of-art deep networks is currently an active area of research. Still relatively unexplored are the pre-processing steps needed to transform spikes from these sensors and the types of network architectures that can produce high-accuracy performance using these sensors. This paper discusses several methods for preprocessing the spiking data from these sensors for use with various deep network architectures. The outputs of these preprocessing methods are evaluated using different networks including a deep fusion network composed of Convolutional Neural Networks and Recurrent Neural Networks, to jointly solve a recognition task using the MNIST (visual) and TIDIGITS (audio) benchmark datasets. With only 1000 visual input spikes from a spiking hardware retina, the classification accuracy of 64.5% achieved by a particular trained fusion network increases to 98.31% when combined with inputs from a spiking hardware cochlea.
Learning from Multiple Partially Observed Views - an Application to Multilingual Text Categorization

We address the problem of learning classifiers when observat ions have multiple views, some of which may not be observed for all examples. We a ssume the existence of view generating functions which may complete t he missing views in an approximate way. This situation corresponds for examp le to learning text classifiers from multilingual collections where documents are not available in all languages. In that case, Machine Translation (MT) systems m ay be used to translate each document in the missing languages. We derive a gene ralization error bound for classifiers learned on examples with multiple arti ficially created views. Our result uncovers a trade-off between the size of the train ing set, the number of views, and the quality of the view generating functions. A s a consequence, we identify situations where it is more interesting to use mu ltiple views for learning instead of classical single view learning. An extension of this framework is a natural way to leverage unlabeled multi-view data in semisupervised learning. Experimental results on a subset of the Reuters RCV1/RCV2 co llecti ns support our findings by showing that additional views obtained from M T may significantly improve the classification performance in the cases identifi d by our trade-off.
Machine Learning Models that Remember Too Much

Machine learning (ML) is becoming a commodity. Numerous ML frameworks and services are available to data holders who are not ML experts but want to train predictive models on their data. It is important that ML models trained on sensitive inputs (e.g., personal images or documents) not leak too much information about the training data.
 We consider a malicious ML provider who supplies model-training code to the data holder, does \emph{not} observe the training, but then obtains white- or black-box access to the resulting model. In this setting, we design and implement practical algorithms, some of them very similar to standard ML techniques such as regularization and data augmentation, that "memorize" information about the training dataset in the model\textemdash yet the model is as accurate and predictive as a conventionally trained model. We then explain how the adversary can extract memorized information from the model. We evaluate our techniques on standard ML tasks for image classification (CIFAR10), face recognition (LFW and FaceScrub), and text analysis (20 Newsgroups and IMDB). In all cases, we show how our algorithms create models that have high predictive power yet allow accurate extraction of subsets of their training data.
Barrel menu: a new mobile phone menu for feature rich devices

Mobile phones have ceased to be devices that people merely use to make phone calls. Today, modern mobile phones offer their users a large selection of features which are accessed via hierarchical menus. These hierarchical menus typically result in deep nested menus that require numerous clicks to navigate through, often resulting in usability issues. This paper presents a prototype of a new menu style (Barrel menu) for mobile phones, and compares the usability of this menu style with that of a traditional hierarchical (Hub-and-Spoke) design. The Barrel menu was found to be as efficient as the Hub-and-Spoke menu in terms of time-on-task and key presses, but was found to cause fewer user errors. In addition, the Barrel menu was found to be better in terms of ease of use, orientation, user satisfaction and learnability. Thus, the Barrel menu shows the potential to be a feasible alternative for mobile phone manufacturers to overcome some of the usability issues associated with Hub-and-Spoke menus.
Dynamic searchable symmetric encryption

Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it.
 SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems.
 To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (Curtmola et al., CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment.
Intelligent Tutoring Systems with Conversational Dialogue

been developed during the last 20 years have proven to be quite successful, particularly in the domains of mathematics, science, and technology. They produce significant learning gains beyond classroom environments. They are capable of engaging most students’ attention and interest for hours. We have been working on a new generation of intelligent tutoring systems that hold mixedinitiative conversational dialogues with the learner. The tutoring systems present challenging problems and questions to the learner, the learner types in answers in English, and there is a lengthy multiturn dialogue as complete solutions or answers evolve. This article presents the tutoring systems that we have been developing. AUTOTUTOR is a conversational agent, with a talking head, that helps college students learn about computer literacy. ANDES, ATLAS, AND WHY2 help adults learn about physics. Instead of being mere information-delivery systems, our systems help students actively construct knowledge through conversations.
EBG-Embedded Multiple-Mode Resonator for UWB Bandpass Filter With Improved Upper-Stopband Performance

An electromagnetic bandgap (EBG) embedded multiple-mode resonator (MMR) is proposed to constitute an upper-stopband-improved and size-miniaturized ultra-wideband (UWB) bandpass filter (BPF). This EBG-embedded MMR is studied to relocate its first three resonant modes within the 3.1-10.6GHz passband, whereas placing its 4th resonant mode at the coupling transmission zero of interdigital coupled-lines that drive this MMR at two sides. Meanwhile, the fifth resonant mode is rejected by virtue of the bandstop behavior of the EBG itself. Thus, a modified UWB BPF with widened upper-stopband, sharpened upper rejection skirt and lowered loss in the passband is finally constituted, designed and fabricated. The measured results demonstrate that the insertion loss is lower than 1.0 dB in the passband (4.0-10.6GHz) and higher than 15.0dB in the upper-stopband (12.0 to 20.0GHz) while the group delay variation in the passband is less than 0.2ns
The longitudinal relationship of personality traits and disorders.

Personality disorders are presumed to be stable because of underlying stable and maladaptive personality traits, but while previous research has demonstrated a link between personality traits and personality disorders cross-sectionally, personality disorders and personality traits have not been linked longitudinally. This study explores the extent to which relevant personality traits are stable in individuals diagnosed with 4 personality disorders (schizotypal, borderline, avoidant, and obsessive-compulsive personality disorders) and examines the assumption that these personality disorders are stable by virtue of stable personality traits. This assumption was tested via the estimation of a series of latent longitudinal models that evaluated whether changes in relevant personality traits lead to subsequent changes in personality disorders. In addition to offering large consistency estimates for personality traits and personality disorders, the results demonstrate significant cross-lagged relationships between trait change and later disorder change for 3 of the 4 personality disorders studied.
Total parser combinators

A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is similar to those of many other parser combinator libraries, with two important differences: one is that the interface clearly specifies which parts of the constructed parsers may be infinite, and which parts have to be finite, using dependent types and a combination of induction and coinduction; and the other is that the parser type is unusually informative.
 The library comes with a formal semantics, using which it is proved that the parser combinators are as expressive as possible. The implementation is supported by a machine-checked correctness proof.
Location recommendation for out-of-town users in location-based social networks

Most previous research on location recommendation services in location-based social networks (LBSNs) makes recommendations without considering where the targeted user is currently located. Such services may recommend a place near her hometown even if the user is traveling out of town. In this paper, we study the issues in making location recommendations for out-of-town users by taking into account user preference, social influence and geographical proximity. Accordingly, we propose a collaborative recommendation framework, called User Preference, Proximity and Social-Based Collaborative Filtering} (UPS-CF), to make location recommendation for mobile users in LBSNs. We validate our ideas by comprehensive experiments using real datasets collected from Foursquare and Gowalla. By comparing baseline algorithms and conventional collaborative filtering approach (and its variants), we show that UPS-CF exhibits the best performance. Additionally, we find that preference derived from similar users is important for in-town users while social influence becomes more important for out-of-town users.
Dynamic Programming for Partially Observable Stochastic Games

We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable Markov decision processes (POMDPs) and iterated elimination of dominated strategies in normal form games. We prove that when applied to finite-horizon POSGs, the algorithm iteratively eliminates very weakly dominated strategies without first forming a normal form representation of the game. For the special case in which agents share the same payoffs, the algorithm can be used to find an optimal solution. We present preliminary empirical results and discuss ways to further exploit POMDP theory in solving POSGs.
PACRR: A Position-Aware Neural IR Model for Relevance Matching

In order to adopt deep learning for information retrieval, models are needed that can capture all relevant information required to assess the relevance of a document to a given user query. While previous works have successfully captured unigram term matches, how to fully employ position-dependent information such as proximity and term dependencies has been insufficiently explored. In this work, we propose a novel neural IR model named PACRR aiming at better modeling position-dependent interactions between a query and a document. Extensive experiments on six years’ TREC Web Track data confirm that the proposed model yields better results under multiple benchmarks.
Business Process Comparison: A Methodology and Case Study

Business processes often exhibit a high degree of variability. Process variants may manifest due to the differences in the nature of clients, heterogeneity in the type of cases, etc. Through the use of process mining techniques, one can benefit from historical event data to extract non-trivial knowledge for improving business process performance. Although some research has been performed on supporting process comparison within the process mining context, applying process comparison in practice is far from trivial. Considering all comparable attributes, for example, leads to an exponential number of possible comparisons. In this paper we introduce a novel methodology for applying process comparison in practice. We successfully applied the methodology in a case study within Xerox Services, where a forms handling process was analyzed and actionable insights were obtained by comparing different process variants
Causality : Models , Reasoning , and Inference

For most researchers in the ever growing fields of probabilistic graphical models, belief networks, causal influence and probabilistic inference, ACM Turing award winner Dr. Pearl and his seminary papers on causality are well-known and acknowledged. Representation and determination of Causality, the relationship between an event (the cause) and a second event (the effect), where the second event is understood as a consequence of the first, is a challenging problem. Over the years, Dr. pearl has written significantly on both Art and Science of Cause and Effect. In this book on "Causality: Models, Reasoning and Inference", the inventor of Bayesian belief networks discusses and elaborates on his earlier workings including but not limited to Reasoning with Cause and Effect, Causal inference in statistics, Simpson's paradox, Causal Diagrams for Empirical Research, Robustness of Causal Claims, Causes and explanations, and Probabilities of causation Bounds and identification.
Interruptions on software teams: a comparison of paired and solo programmers

This study explores interruption patterns among software developers who program in pairs versus those who program solo. Ethnographic observations indicate that interruption length, content, type, occurrence time, and interrupter and interruptee strategies differed markedly for radically collocated pair programmers versus the programmers who primarily worked alone. After presenting an analysis of 242 interruptions drawn from more than 40 hours of observation data, we discuss how team configuration and work setting influenced how and when developers handled interruptions. We then suggest ways that CSCW systems might better support pair programming and, more broadly, provide interruption-handling support for workers in knowledge-intensive occupations.
1 Sex , Syntax , and Semantics

Many languages have a grammatical gender system whereby all nouns are assigned a gender (most commonly feminine, masculine, or neuter). Two studies examined whether (1) the assignment of genders to nouns is truly arbitrary (as has been claimed), and (2) whether the grammatical genders assigned to nouns have semantic consequences. In the first study, English speakers’ intuitions about the genders of animals (but not artifacts) were found to correlate with the grammatical genders assigned to the names of these objects in Spanish and German. These findings suggest that the assignment of genders to nouns is not entirely arbitrary but may to some extent reflect the perceived masculine or feminine properties of the nouns’ referents. Results of the second study suggested that people’s ideas about the genders of objects are strongly influenced by the grammatical genders assigned to these objects in their native language. Spanish and German speakers’ memory for object--name pairs (e.g., apple--Patricia) was better for pairs where the gender of the proper name was congruent with the grammatical gender of the object name (in their native language), than when the two genders were incongruent. This was true even though both groups performed the task in English. These results suggest that grammatical gender may not be as arbitrary or as purely grammatical as was previously