nils-herrmann/clean_scirepeval huggingface dataset:
Concentrated Differential Privacy

The Fundamental Law of Information Recovery states, informally, that “overly accurate” estimates of “too many” statistics completely destroys privacy ([DN03] et sequelae). Differential privacy is a mathematically rigorous definition of privacy tailored to analysis of large datasets and equipped with a formal measure of privacy loss [DMNS06, Dwo06]. Moreover, differentially private algorithms take as input a parameter, typically called ε, that caps the permitted privacy loss in any execution of the algorithm and offers a concrete privacy/utility tradeoff. One of the strengths of differential privacy is the ability to reason about cumulative privacy loss over multiple analyses, given the values of ε used in each individual analysis. By appropriate choice of ε it is possible to stay within the bounds of the Fundamental Law while releasing any given number of estimated statistics; however, before this work the bounds were not tight. Roughly speaking, differential privacy ensures that the outcome of any anlysis on a database x is distributed very similarly to the outcome on any neighboring database y that differs from x in just one row (Definition 2.3). That is, differentially private algorithms are randomized, and in particular the max divergence between these two distributions (a sort maximum log odds ratio for any event; see Definition 2.2 below) is bounded by the privacy parameter ε. This absolute guarantee on the maximum privacy loss is now sometimes referred to as “pure” differential privacy. A popular relaxation, (ε, δ)-differential privacy (Definition 2.4)[DKM+06], guarantees that with probability at most 1−δ the privacy loss does not exceed ε.1 Typically δ is taken to be “cryptographically” small, that is, smaller than the inverse of any polynomial in the size of the dataset, and pure differential privacy is simply the special case in which δ = 0. The relaxation frequently permits asymptotically better accuracy than pure differential privacy for the same value of ε, even when δ is very small. What happens in the case of multiple analyses? While the composition of k (ε, 0)-differentially privacy algorithms is at worst (kε, 0)-differentially private, it is also simultaneously ( √
Knowing what to think by knowing who you are: self-categorization and the nature of norm formation, conformity and group polarization.

We contrast two theoretical approaches to social influence, one stressing interpersonal dependence, conceptualized as normative and informational influence (Deutsch & Gerard, 1955), and the other stressing group membership, conceptualized as self-categorization and referent informational influence (Turner, Hogg, Oakes, Reicher & Wetherell, 1987). We argue that both social comparisons to reduce uncertainty and the existence of normative pressure to comply depend on perceiving the source of influence as belonging to one's own category. This study tested these two approaches using three influence paradigms. First we demonstrate that, in Sherif's (1936) autokinetic effect paradigm, the impact of confederates on the formation of a norm decreases as their membership of a different category is made more salient to subjects. Second, in the Asch (1956) conformity paradigm, surveillance effectively exerts normative pressure if done by an in-group but not by an out-group. In-group influence decreases and out-group influence increases when subjects respond privately. Self-report data indicate that in-group confederates create more subjective uncertainty than out-group confederates and public responding seems to increase cohesiveness with in-group - but decrease it with out-group - sources of influence. In our third experiment we use the group polarization paradigm (e.g. Burnstein & Vinokur, 1973) to demonstrate that, when categorical differences between two subgroups within a discussion group are made salient, convergence of opinion between the subgroups is inhibited. Taken together the experiments show that self-categorization can be a crucial determining factor in social influence.
Processing the Text of the Holy Quran: a Text Mining Study

The Holy Quran is the reference book for more than 1.6 billion of Muslims all around the world Extracting information and knowledge from the Holy Quran is of high benefit for both specialized people in Islamic studies as well as non-specialized people. This paper initiates a series of research studies that aim to serve the Holy Quran and provide helpful and accurate information and knowledge to the all human beings. Also, the planned research studies aim to lay out a framework that will be used by researchers in the field of Arabic natural language processing by providing a ”Golden Dataset” along with useful techniques and information that will advance this field further. The aim of this paper is to find an approach for analyzing Arabic text and then providing statistical information which might be helpful for the people in this research area. In this paper the holly Quran text is preprocessed and then different text mining operations are applied to it to reveal simple facts about the terms of the holy Quran. The results show a variety of characteristics of the Holy Quran such as its most important words, its wordcloud and chapters with high term frequencies. All these results are based on term frequencies that are calculated using both Term Frequency (TF) and Term Frequency-Inverse Document Frequency (TF-IDF) methods. Holy Quran; Text Mining; Arabic Natural Language Processing
On Organizational Becoming: Rethinking Organizational Change

Traditional approaches to organizational change have been dominated by assumptions privileging stability, routine, and order. As a result, organizational change has been reified and treated as exceptional rather than natural. In this paper, we set out to offer an account of organizational change on its own terms—to treat change as the normal condition of organizational life. The central question we address is as follows: What must organization(s) be like if change is constitutive of reality? Wishing to highlight the pervasiveness of change in organizations, we talk about organizational becoming. Change, we argue, is the reweaving of actors’ webs of beliefs and habits of action to accommodate new experiences obtained through interactions. Insofar as this is an ongoing process, that is to the extent actors try to make sense of and act coherently in the world, change is inherent in human action, and organizations are sites of continuously evolving human action. In this view, organization is a secondary accomplishment, in a double sense. Firstly, organization is the attempt to order the intrinsic flux of human action, to channel it towards certain ends by generalizing and institutionalizing particular cognitive representations. Secondly, organization is a pattern that is constituted, shaped, and emerging from change. Organization aims at stemming change but, in the process of doing so, it is generated by it. These claims are illustrated by drawing on the work of several organizational ethnographers. The implications of this view for theory and practice are outlined.  The point is that usually we look at change but we do not see it. We speak of change, but we do not think about it. We say that change exists, that everything changes, that change is the very law of things: Yes, we say it and we repeat it; but those are only words, and we reason and philosophize as though change did not exist. In order to think change and see it, there is a whole veil of prejudices to brush aside, some of them artificial, created by philosophical speculation, the others natural
VALE, a switched ethernet for virtual machines

The growing popularity of virtual machines is pushing the demand for high performance communication between them. Past solutions have seen the use of hardware assistance, in the form of "PCI passthrough" (dedicating parts of physical NICs to each virtual machine) and even bouncing traffic through physical switches to handle data forwarding and replication.
 In this paper we show that, with a proper design, very high speed communication between virtual machines can be achieved completely in software. Our architecture, called VALE, implements a Virtual Local Ethernet that can be used by virtual machines, such as QEMU, KVM and others, as well as by regular processes. VALE achieves a throughput of over 17 million packets per second (Mpps) between host processes, and over 2 Mpps between QEMU instances, without any hardware assistance.
 VALE is available for both FreeBSD and Linux hosts, and is implemented as a kernel module that extends our recently proposed netmap framework, and uses similar techniques to achieve high packet rates.
Multi-label hypothesis reuse

Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performance, the relationship among labels should be exploited. Most existing approaches require the label relationship as prior knowledge, or exploit by counting the label co-occurrence. In this paper, we propose the MAHR approach, which is able to automatically discover and exploit label relationship. Our basic idea is that, if two labels are related, the hypothesis generated for one label can be helpful for the other label. MAHR implements the idea as a boosting approach with a hypothesis reuse mechanism. In each boosting round, the base learner for a label is generated by not only learning on its own task but also reusing the hypotheses from other labels, and the amount of reuse across labels provides an estimate of the label relationship. Extensive experimental results validate that MAHR is able to achieve superior performance and discover reasonable label relationship. Moreover, we disclose that the label relationship is usually asymmetric.
Open Source Software Development and Lotka's Law: Bibliometric Patterns in Programming

This research applies Lotka’s Law to metadata on open source software development. Lotka’s Law predicts the proportion of authors at different levels of productivity. Open source software development harnesses the creativity of thousands of programmers worldwide, is important to the progress of the Internet and many other computing environments, and yet has not been widely researched. We examine metadata from the Linux Software Map (LSM), which documents many open source projects, and Sourceforge, one of the largest resources for open source developers. Authoring patterns found are comparable to prior studies of Lotka’s Law for scientific and scholarly publishing. Lotka’s Law was found to be effective in understanding software development productivity patterns, and offer promise in predicting aggregate behavior of open source developers.
Privacy-Preserving Audit and Extraction of Digital Contents

A growing number of online services, such as Google, Yahoo!, and Amazon, are starting to charge users for their storage. Customers often use these services to store valuable data such as email, family photos and videos, and disk backups. Today, a customer must entirely trust such external services to maintain the integrity of hosted data and return it intact. Unfortunately, no service is infallible. To make storage services accountable for data loss, we present protocols that allow a thirdparty auditor to periodically verify the data stored by a service and assist in returning the data intact to the customer. Most importantly, our protocols are privacy-preserving, in that they never reveal the data contents to the auditor. Our solution removes the burden of verification from the customer, alleviates both the customer’s and storage service’s fear of data leakage, and provides a method for independent arbitration of data retention contracts.
Network-based statistic: Identifying differences in brain networks

Large-scale functional or structural brain connectivity can be modeled as a network, or graph. This paper presents a statistical approach to identify connections in such a graph that may be associated with a diagnostic status in case-control studies, changing psychological contexts in task-based studies, or correlations with various cognitive and behavioral measures. The new approach, called the network-based statistic (NBS), is a method to control the family-wise error rate (in the weak sense) when mass-univariate testing is performed at every connection comprising the graph. To potentially offer a substantial gain in power, the NBS exploits the extent to which the connections comprising the contrast or effect of interest are interconnected. The NBS is based on the principles underpinning traditional cluster-based thresholding of statistical parametric maps. The purpose of this paper is to: (i) introduce the NBS for the first time; (ii) evaluate its power with the use of receiver operating characteristic (ROC) curves; and, (iii) demonstrate its utility with application to a real case-control study involving a group of people with schizophrenia for which resting-state functional MRI data were acquired. The NBS identified a expansive dysconnected subnetwork in the group with schizophrenia, primarily comprising fronto-temporal and occipito-temporal dysconnections, whereas a mass-univariate analysis controlled with the false discovery rate failed to identify a subnetwork.
Measuring Method Complexity: UML versus BPMN

Graphical models are used to depict relevant aspects of real-world domains intended to be supported by an information system. Various approaches for modeling exist and approaches such as object-oriented and process-oriented modeling methods are in widespread use. These modeling methods differ in their expressive power as well as in their complexity of use, thereby leading to an important investment decision for organizations seeking to conduct modeling projects. In this paper, we used an established approach for evaluating the complexity of conceptual modeling methods and compared two important industry standards for modeling, Unified Modeling Language and Business Process Modeling Notation, based on their complexity. Our research finds that BPMN has very high levels of complexity when contrasted with UML.
Neural networks performance in exchange rate prediction

Exploration of ANNs for the economic purposes is described and empirically examined with the foreign exchange market data. For the experiments, panel data of the exchange rates (USD/EUR, JPN/USD, USD/ GBP) are examined and optimized to be used for time-series predictions with neural networks. In this stage the input selection, in which the processing steps to prepare the raw data to a suitable input for the models are investigated. The best neural network is found with the best forecasting abilities, based on a certain performance measure. A visual graphs on the experiments data set is presented after processing steps, to illustrate that particular results. The out-of-sample results are compared with training ones. & 2015 Elsevier B.V. All rights reserved.
Portable Features for Classifying Emotional Text

Are word-level affect lexicons useful in detecting emotions at sentence level? Some prior research finds no gain over and above what is obtained with ngram features—arguably the most widely used features in text classification. Here, we experiment with two very different emotion lexicons and show that even in supervised settings, an affect lexicon can provide significant gains. We further show that while ngram features tend to be accurate, they are often unsuitable for use in new domains. On the other hand, affect lexicon features tend to generalize and produce better results than ngrams when applied to a new domain.
The impact of intercultural factors on global software development

This paper examines the concept of culture, and the potential impact of intercultural dynamics of software development. Many of the difficulties confronting today's global software development (GSD) environment have little to do with technical issues; rather, they are "human" issues that occur when extensive collaboration and communication among developers with distinct cultural backgrounds are required. Although project managers are reporting that intercultural factors are impacting software practices and artifacts and deserve more detailed study, little analytical research has been conducted in this area other than anecdotal testimonials by software professionals. This paper presents an introductory analysis of the effect that intercultural factors have on global software development. The paper first establishes a framework for intercultural variations by introducing several models commonly used to define culture. Cross-cultural issues that often arise in software development are then identified. The paper continues by explaining the importance of taking intercultural issues seriously and proposes some ideas for future research in the area
A General Retraining Framework for Scalable Adversarial Classification

Traditional classification algorithms assume that training and test data come from similar distributions. This assumption is violated in adversarial settings, where malicious actors modify instances to evade detection. A number of custom methods have been developed for both adversarial evasion attacks and robust learning. We propose the first systematic and general-purpose retraining framework which can: a) boost robustness of an arbitrary learning algorithm, in the face of b) a broader class of adversarial models than any prior methods. We show that, under natural conditions, the retraining framework minimizes an upper bound on optimal adversarial risk, and show how to extend this result to account for approximations of evasion attacks. Extensive experimental evaluation demonstrates that our retraining methods are nearly indistinguishable from state-of-the-art algorithms for optimizing adversarial risk, but are more general and far more scalable. The experiments also confirm that without retraining, our adversarial framework dramatically reduces the effectiveness of learning. In contrast, retraining significantly boosts robustness to evasion attacks without significantly compromising overall accuracy.
Architectural Implications of Social Media Analytics in Support of Crisis Informatics Research

Crisis informatics is a field of research that investigates the use of computer-mediated communication— including social media—by members of the public and other entities during times of mass emergency. Supporting this type of research is challenging because large amounts of ephemeral event data can be generated very quickly and so must then be just as rapidly captured. Such data sets are challenging to analyze because of their heterogeneity and size. We have been designing, developing, and deploying software infrastructure to enable the large-scale collection and analysis of social media data during crisis events. We report on the challenges encountered when working in this space, the desired characteristics of such infrastructure, and the techniques, technology, and architectures that have been most useful in providing both scalability and flexibility. We also discuss the types of analytics this infrastructure supports and implications for future crisis informatics research.
Subpixel image scaling for color‐matrix displays

The perceived resolution of matrix displays increases when the relative position of the color subpixels is taken into account. ‘Subpixel rendering’ algorithms are being used to convert an input image to subpixel-corrected display images. This paper deals with the consequences of the subpixel structure, and the theoretical background of the resolution gain. We will show that this theory allows a low-cost implementation in an image scaler. This leads to high flexibility, allowing different subpixel arrangements and a simple control over the trade-off between perceived resolution and color errors.
Publicly Auditable Secure Multi-Party Computation

In the last few years the efficiency of secure multi-party computation (MPC) increased in several orders of magnitudes. However, this alone might not be enough if we want MPC protocols to be used in practice. A crucial property that is needed in many applications is that everyone can check that a given (secure) computation was performed correctly – even in the extreme case where all the parties involved in the computation are corrupted, and even if the party who wants to verify the result was not participating. This is especially relevant in the clients-servers setting, where many clients provide input to a secure computation performed by a few servers. An obvious example of this is electronic voting, but also in many types of auctions one may want independent verification of the result. Traditionally, this is achieved by using non-interactive zero-knowledge proofs during the computation. A recent trend in MPC protocols is to have a more expensive preprocessing phase followed by a very efficient online phase, e.g., the recent so-called SPDZ protocol by Damg̊ard et al. Applications such as voting and some auctions are perfect use-case for these protocols, as the parties usually know well in advance when the computation will take place, and using those protocols allows us to use only cheap information-theoretic primitives in the actual computation. Unfortunately no protocol of the SPDZ type supports an audit phase. In this paper, we show how to achieve efficient MPC with a public audit. We formalize the concept of publicly auditable secure computation and provide an enhanced version of the SPDZ protocol where, even if all the servers are corrupted, anyone with access to the transcript of the protocol can check that the output is indeed correct. Most importantly, we do so without significantly compromising the performance of SPDZ i.e. our online phase has complexity approximately twice that of SPDZ.