nils-herrmann/clean_scirepeval huggingface dataset:
Do all birds tweet the same?: characterizing twitter around the world

Social media services have spread throughout the world in just a few years. They have become not only a new source of information, but also new mechanisms for societies world-wide to organize themselves and communicate. Therefore, social media has a very strong impact in many aspects -- at personal level, in business, and in politics, among many others. In spite of its fast adoption, little is known about social media usage in different countries, and whether patterns of behavior remain the same or not. To provide deep understanding of differences between countries can be useful in many ways, e.g.: to improve the design of social media systems (which features work best for which country?), and influence marketing and political campaigns. Moreover, this type of analysis can provide relevant insight into how societies might differ. In this paper we present a summary of a large-scale analysis of Twitter for an extended period of time. We analyze in detail various aspects of social media for the ten countries we identified as most active. We collected one year's worth of data and report differences and similarities in terms of activity, sentiment, use of languages, and network structure. To the best of our knowledge, this is the first on-line social network study of such characteristics.
The Use of Summation to Aggregate Software Metrics Hinders the Performance of Defect Prediction Models

Defect prediction models help software organizations to anticipate where defects will appear in the future. When training a defect prediction model, historical defect data is often mined from a Version Control System (VCS, e.g., Subversion), which records software changes at the file-level. Software metrics, on the other hand, are often calculated at the class- or method-level (e.g., McCabe's Cyclomatic Complexity). To address the disagreement in granularity, the class- and method-level software metrics are aggregated to file-level, often using summation (i.e., McCabe of a file is the sum of the McCabe of all methods within the file). A recent study shows that summation significantly inflates the correlation between lines of code (Sloc) and cyclomatic complexity (Cc) in Java projects. While there are many other aggregation schemes (e.g., central tendency, dispersion), they have remained unexplored in the scope of defect prediction. In this study, we set out to investigate how different aggregation schemes impact defect prediction models. Through an analysis of 11 aggregation schemes using data collected from 255 open source projects, we find that: (1) aggregation schemes can significantly alter correlations among metrics, as well as the correlations between metrics and the defect count; (2) when constructing models to predict defect proneness, applying only the summation scheme (i.e., the most commonly used aggregation scheme in the literature) only achieves the best performance (the best among the 12 studied configurations) in 11 percent of the studied projects, while applying all of the studied aggregation schemes achieves the best performance in 40 percent of the studied projects; (3) when constructing models to predict defect rank or count, either applying only the summation or applying all of the studied aggregation schemes achieves similar performance, with both achieving the closest to the best performance more often than the other studied aggregation schemes; and (4) when constructing models for effort-aware defect prediction, the mean or median aggregation schemes yield performance values that are significantly closer to the best performance than any of the other studied aggregation schemes. Broadly speaking, the performance of defect prediction models are often underestimated due to our community's tendency to only use the summation aggregation scheme. Given the potential benefit of applying additional aggregation schemes, we advise that future defect prediction models should explore a variety of aggregation schemes.
Deep neural networks employing Multi-Task Learning and stacked bottleneck features for speech synthesis

Deep neural networks (DNNs) use a cascade of hidden representations to enable the learning of complex mappings from input to output features. They are able to learn the complex mapping from text-based linguistic features to speech acoustic features, and so perform text-to-speech synthesis. Recent results suggest that DNNs can produce more natural synthetic speech than conventional HMM-based statistical parametric systems. In this paper, we show that the hidden representation used within a DNN can be improved through the use of Multi-Task Learning, and that stacking multiple frames of hidden layer activations (stacked bottleneck features) also leads to improvements. Experimental results confirmed the effectiveness of the proposed methods, and in listening tests we find that stacked bottleneck features in particular offer a significant improvement over both a baseline DNN and a benchmark HMM system.
Using Machine Learning Methods and Linguistic Features in Single-Document Extractive Summarization

Extractive summarization of text documents usually consists of ranking the document sentences and extracting the top-ranked sentences subject to the summary length constraints. In this paper, we explore the contribution of various supervised learning algorithms to the sentence ranking task. For this purpose, we introduce a novel sentence ranking methodology based on the similarity score between a candidate sentence and benchmark summaries. Our experiments are performed on three benchmark summarization corpora: DUC-2002, DUC2007 and MultiLing-2013. The popular linear regression model achieved the best results in all evaluated datasets. Additionally, the linear regression model, which included POS (Part-of-Speech)-based features, outperformed the one with statistical features only.
Advanced single-phase AC-DC converter using single-phase matrix converter topology

This paper proposes advanced single-phase AC-DC converter using single-phase matrix converter (SPMC) topology incorporating with active power filter function. The topology is also capable of incorporating many other features for controlled rectifier operation that includes; bidirectional, regenerative and dual converter capabilities. The PWM technique was used to calculate the switch duty ratio to synthesize the output. Switch commutation arrangements were developed that allows dead time to avoid current spikes of non-ideal switches whilst providing a current path for the inductive load to avoid voltage spikes. Selected simulation and experimental results are presented to verify proposed operation.
Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learning

Deep neural networks (DNNs) enable innovative applications of machine learning like image recognition, machine translation, or malware detection. However, deep learning is often criticized for its lack of robustness in adversarial settings (e.g., vulnerability to adversarial inputs) and general inability to rationalize its predictions. In this work, we exploit the structure of deep learning to enable new learning-based inference and decision strategies that achieve desirable properties such as robustness and interpretability. We take a first step in this direction and introduce the Deep k-Nearest Neighbors (DkNN). This hybrid classifier combines the k-nearest neighbors algorithm with representations of the data learned by each layer of the DNN: a test input is compared to its neighboring training points according to the distance that separates them in the representations. We show the labels of these neighboring points afford confidence estimates for inputs outside the model’s training manifold, including on malicious inputs like adversarial examples– and therein provides protections against inputs that are outside the models understanding. This is because the nearest neighbors can be used to estimate the nonconformity of, i.e., the lack of support for, a prediction in the training data. The neighbors also constitute human-interpretable explanations of predictions. We evaluate the DkNN algorithm on several datasets, and show the confidence estimates accurately identify inputs outside the model, and that the explanations provided by nearest neighbors are intuitive and useful in understanding model failures.
Detecting influenza epidemics using search engine query data

Seasonal influenza epidemics are a major public health concern, causing tens of millions of respiratory illnesses and 250,000 to 500,000 deaths worldwide each year. In addition to seasonal influenza, a new strain of influenza virus against which no previous immunity exists and that demonstrates human-to-human transmission could result in a pandemic with millions of fatalities. Early detection of disease activity, when followed by a rapid response, can reduce the impact of both seasonal and pandemic influenza. One way to improve early detection is to monitor health-seeking behaviour in the form of queries to online search engines, which are submitted by millions of users around the world each day. Here we present a method of analysing large numbers of Google search queries to track influenza-like illness in a population. Because the relative frequency of certain queries is highly correlated with the percentage of physician visits in which a patient presents with influenza-like symptoms, we can accurately estimate the current level of weekly influenza activity in each region of the United States, with a reporting lag of about one day. This approach may make it possible to use search queries to detect influenza epidemics in areas with a large population of web search users.
Challenges of Feature Selection for Big Data Analytics

We're surrounded by huge amounts of large-scale high-dimensional data, but learning tasks require reduced data dimensionality. Feature selection has shown its effectiveness in many applications by building simpler and more comprehensive models, improving learning performance, and preparing clean, understandable data. Some unique characteristics of big data such as data velocity and data variety have presented challenges to the feature selection problem. In this article, the authors envision these challenges for big data analytics. To facilitate and promote feature selection research, they present an open source feature selection repository (scikit-feature) of popular algorithms.
Appearance modeling for tracking in multiple non-overlapping cameras

When viewed from a system of multiple cameras with non-overlapping fields of view, the appearance of an object in one camera view is usually very different from its appearance in another camera view due to the differences in illumination, pose and camera parameters. In order to handle the change in observed colors of an object as it moves from one camera to another, we show that all brightness transfer functions from a given camera to another camera lie in a low dimensional subspace and demonstrate that this subspace can be used to compute appearance similarity. In the proposed approach, the system learns the subspace of inter-camera brightness transfer functions in a training phase during which object correspondences are assumed to be known. Once the training is complete, correspondences are assigned using the maximum a posteriori (MAP) estimation framework using both location and appearance cues. We evaluate the proposed method under several real world scenarios obtaining encouraging results.
SAR image formation toolbox for MATLAB

While many synthetic aperture radar (SAR) image formation techniques exist, two of the most intuitive methods for implementation by SAR novices are the matched filter and backprojection algorithms. The matched filter and (non-optimized) backprojection algorithms are undeniably computationally complex. However, the backprojection algorithm may be successfully employed for many SAR research endeavors not involving considerably large data sets and not requiring time-critical image formation. Execution of both image reconstruction algorithms in MATLAB is explicitly addressed. In particular, a manipulation of the backprojection imaging equations is supplied to show how common MATLAB functions, ifft and interp1, may be used for straight-forward SAR image formation. In addition, limits for scene size and pixel spacing are derived to aid in the selection of an appropriate imaging grid to avoid aliasing. Example SAR images generated though use of the backprojection algorithm are provided given four publicly available SAR datasets. Finally, MATLAB code for SAR image reconstruction using the matched filter and backprojection algorithms is provided.
A Proximity Authentication System for Smartphones

Authenticating whether two smartphones are in close proximity is important in smartphone security. For example, the authentication result can be used to pair two devices and construct a secure communication channel between them. Many existing proximity authentication systems rely on short range networks-the communication is usually restricted in short range networks. However, this approach is inadequate when we want to verify whether the communication distance is within a few centimeters, i.e. near field. To address this challenge, many other techniques construct systems based on the near field communication (NFC) system. Unfortunately, only a small portion of smart devices in the current market are equipped with NFC chips. The purpose of this paper is to provide a close proximity authentication system which does not depend on NFC chips. We devise a system to achieve close proximity authentication by using correlated finger movements on the two smartphones. Human input usually contains errors and is of low entropy, which affects the usability and security of our system. We solve these issues in an efficient way, considering the limited computational resources on smart devices. Our system does not need any prior secret information shared between the two devices, and generates the same high-entropy cryptographic key for both devices in a successful authentication. The efficiency of the system is validated by evaluations on Motorola Droid smartphones.
A Survey on Fully Homomorphic Encryption: An Engineering Perspective

It is unlikely that a hacker is able to compromise sensitive data that is stored in an encrypted form. However, when data is to be processed, it has to be decrypted, becoming vulnerable to attacks. Homomorphic encryption fixes this vulnerability by allowing one to compute directly on encrypted data. In this survey, both previous and current Somewhat Homomorphic Encryption (SHE) schemes are reviewed, and the more powerful and recent Fully Homomorphic Encryption (FHE) schemes are comprehensively studied. The concepts that support these schemes are presented, and their performance and security are analyzed from an engineering standpoint.
Learning Ensembles of Convolutional Neural Networks

Ensemble learning is a method for generating multiple versions of a predictor network and using them to get an aggregated prediction. Given a learning set Ω consists of data {(yn, ~xn), n = 1, ..., N} where y is the class label and ~x is the inputing feature, we train a predictor φ(~x,Ω). With different initialization, we obtain a series of predictors {φk}. Our object is to use the {φk} to get a better predictor, φA.
Learning swing-free trajectories for UAVs with a suspended load

Attaining autonomous flight is an important task in aerial robotics. Often flight trajectories are not only subject to unknown system dynamics, but also to specific task constraints. This paper presents a motion planning method for generating trajectories with minimal residual oscillations (swing-free) for rotorcraft carrying a suspended loads. We rely on a finite-sampling, batch reinforcement learning algorithm to train the system for a particular load. We find criteria that allow the trained agent to be transferred to a variety of models, state and action spaces and produce a number of different trajectories. Through a combination of simulations and experiments, we demonstrate that the inferred policy is robust to noise and the unmodeled dynamics of the system. The contributions of this work are 1) applying reinforcement learning to solve the problem of finding swing-free trajectories for rotorcraft, 2) designing a problem-specific feature vector for value function approximation, 3) giving sufficient conditions for successful learning transfer to different models, state and action spaces, and 4) verification of the resulting trajectories in both simulation and autonomous control of quadrotors with suspended loads.
brat: a Web-based Tool for NLP-Assisted Text Annotation

We introduce the brat rapid annotation tool (BRAT), an intuitive web-based tool for text annotation supported by Natural Language Processing (NLP) technology. BRAT has been developed for rich structured annotation for a variety of NLP tasks and aims to support manual curation efforts and increase annotator productivity using NLP techniques. We discuss several case studies of real-world annotation projects using pre-release versions of BRAT and present an evaluation of annotation assisted by semantic class disambiguation on a multicategory entity mention annotation task, showing a 15% decrease in total annotation time. BRAT is available under an opensource license from: http://brat.nlplab.org
Modelling strategic relationships for process reengineering

Existing models for describing a process such as a business process or a software development process tend to focus on the what or the how of the process For example a health insurance claim process would typically be described in terms of a number of steps for assessing and approving a claim In trying to improve or redesign a process however one also needs to have an understanding of the why for example why do physicians submit treatment plans to insurance companies before giving treatment and why do claims managers seek medical opinions when assessing treatment plans An understanding of the motivations and interests of process participants is often crucial to the successful redesign of processes This thesis proposes a modelling framework i pronounced i star consisting of two mod elling components The Strategic Dependency SD model describes a process in terms of in tentional dependency relationships among agents Agents depend on each other for goals to be achieved tasks to be performed and resources to be furnished Agents are intentional in that they have desires and wants and strategic in that they are concerned about opportunities and vulnerabilities The Strategic Rationale SR model describes the issues and concerns that agents have about existing processes and proposed alternatives and how they might be addressed in terms of a network of means ends relationships An agent s routines for carrying out a process can be analyzed for their ability workability viability and believability Means ends rules are used to suggest methods for addressing issues related issues to be raised and assumptions to be challenged The models are represented in the conceptual modelling language Telos The modelling concepts are axiomatically characterized The utility of the framework is illustrated in each of four application areas requirements engineering business process reengineering organizational impacts analysis and software pro cess modelling Advantages of i over existing modelling techniques in each of these areas are described
Defeating Kyoto : The Conservative Movement ' s Impact on U . S . Climate Change Policy

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
Accessory Axillary Breast Tissues

Dr. Emsen recently published a case report describing a patient with accessory axillary breast tissue treated with ultrasound-guided liposuction . We recently treated a similar case of bilateral axillary breast tissue, and we offer our contribution to the debate (Figs. 1, 2). Accessory axillary breast tissues are common embriogenic alterations found in 1% to 6% of women that often manifest bilaterally [1,2]. Ectopic breast tissue is at risk for benign and malignant breast disease with reported diagnoses of fibrocystic disease, mastitis, fibroadenoma, atypical hyperplasia, and carcinoma [4 6]. In a review of 82 ectopic breast cancer cases, Marshall et al.  found an increased incidence of cancer in aberrant breast tissue. Ectopic cancers located in the axilla seemed to present with more extensive disease at an earlier age, suggesting that aberrant breast tissue may be at increased risk for malignant change. According to this view, as for any ectopic mass, tissue diagnosis is required and mandatory . We recently treated a 43-year-old woman who was asymptomatic until her second pregnancy (2004), when two bilateral masses appeared in axillae and began to increase in size. Six months after parturition, a clear fluid was continuously secreted throughout few small pores on the skin. Ultrasounddiagnosed breast tissue and excision with histologic examination confirmed the radiologic findings. In this case, we preoperatively contemplated, as Dr. Emsen did, less invasive and aesthetic methods such as liposuction. However, a collegial discussion with our pathologist and an analysis of literature data suggested en bloc removal for a more precise analysis not only of cellular, but also of histologic characteristics of suspected mammary ducts. We believe that liposuction, more traumatic on tissues than simple excision, does not allow for this. Furthermore, although liposuction leaves minimal incision scars, the Fig. 1. A 43-year-old woman. Right axilla with accessory breast tissue.
Trading Is Hazardous to Your Wealth : The Common Stock Investment Performance of Individual Investors

Individual investors who hold common stocks directly pay a tremendous performance penalty for active trading. Of 66,465 households with accounts at a large discount broker during 1991 to 1996, those that trade most earn an annual return of 11.4 percent, while the market returns 17.9 percent. The average household earns an annual return of 16.4 percent, tilts its common stock investment toward high-beta, small, value stocks, and turns over 75 percent of its portfolio annually. Overconfidence can explain high trading levels and the resulting poor performance of individual investors. Our central message is that trading is hazardous to your wealth. The investor’s chief problem—and even his worst enemy—is likely to be himself. Benjamin Graham In 1996, approximately 47 percent of equity investments in the United States were held directly by households, 23 percent by pension funds, and 14 percent by mutual funds ~Securities Industry Fact Book, 1997!. Financial economists have extensively analyzed the return performance of equities managed by mutual funds. There is also a fair amount of research on the performance of equities managed by pension funds. Unfortunately, there is little research on the return performance of equities held directly by households, despite their large ownership of equities.  Graduate School of Management, University of California, Davis. We are grateful to the discount brokerage firm that provided us with the data for this study. We appreciate the comments of Christopher Barry, George Bittlingmayer, Eugene Fama, Ken French, Laurie Krigman, Bing Liang, John Nofsinger, Srinivasan Rangan, Mark Rubinstein, René Stulz ~the editor!, Avanidhar Subrahmanyam, Kent Womack, Jason Zweig, two anonymous reviewers, seminar participants at the American Finance Association Meetings ~New York, 1999!, the 9th Annual Conference on Financial Economics and Accountancy at New York University, Notre Dame University, the University of Illinois, and participants in the Compuserve Investor Forum. All errors are our own.