nils-herrmann/clean_scirepeval huggingface dataset:
Using Computer Programming to Enhance Science Learning for 5th Graders in Taipei

The purpose of this study is to evaluate the effectiveness of using Scratch Programming in science learning for 5th graders in Taipei. A quasi-experimental design with a single group was used in this study. 96 fifth graders at an elementary school in Taipei participated in 15 weeks of Scratch Programming activities to enrich computer learning during their science learning. Three research instruments were used in this study, including a logical thinking test, a problem solving test, and a learning questionnaire. The results were subjected to t-test and frequency analysis. The findings of this study include (1) the outcomes of the logical thinking test and the problem solving test indicate that students had better performance in logical thinking and problem solving, (2) feedback from the study questionnaire indicates that more than 71.4% of students favored using Scratch Programming in their computer learning, and more than 58.4% of students favored designing Scratch Programming in their science learning, (3) more than 54.7% of students reported that they are willing to do more similar computer programming projects for other science units in the future. In view of the above findings, this study concludes that Scratch Programming is effective for 5th graders in Taipei.
DOES THE BALANCED SCORECARD WORK : AN EMPIRICAL INVESTIGATION Professor

Commentators suggest that between 30 and 60% of large US firms have adopted the Balanced Scorecard, first described by Bob Kaplan and David Norton in their seminal Harvard Business Review paper of 1992 (Kaplan and Norton, 1992; Marr et al, 2004). Empirical evidence that explores the performance impact of the balanced scorecard, however, is extremely rare and much that is available is anecdotal at best. This paper reports a study that set out to explore the performance impact of the balanced scorecard by employing a quasi-experimental design. Up to three years worth of financial data were collected from two sister divisions of an electrical wholesale chain based in the UK, one of which had implemented the balanced scorecard and one of which had not. The relative performance improvements of geographically matched pairs of branches were compared to establish what, if any, performance differentials existed between the branches that had implemented the balanced scorecard and those that had not. The key findings of the study are that while the Electrical division – the division that implemented the balanced scorecard – sees improvements in sales and gross profit; similar performance improvements are also observed in the sister division. Hence the performance impact of the balanced scorecard has to be questioned. Clearly further work on this important topic is required in similar settings where natural experiments occur.
The Alignment Template Approach to Statistical Machine Translation

A phrase-based statistical machine translation approach the alignment template approach is described. This translation approach allows for general many-to-many relations between words. Thereby, the context of words is taken into account in the translation model, and local changes in word order from source to target language can be learned explicitly. The model is described using a log-linear modeling approach, which is a generalization of the often used source-channel approach. Thereby, the model is easier to extend than classical statistical machine translation systems. We describe in detail the process for learning phrasal translations, the feature functions used, and the search algorithm. The evaluation of this approach is performed on three different tasks. For the German-English speech Verbmobil task, we analyze the effect of various system components. On the French-English Canadian Hansards task, the alignment template system obtains significantly better results than a single-word-based translation model. In the Chinese-English 2002 National Institute of Standards and Technology (NIST) machine translation evaluation it yields statistically significantly better NIST scores than all competing research and commercial translation systems.
Simulation and analysis of a single phase AC-DC boost PFC converter with a passive snubber for power quality improvement

In this paper an ac-dc boost Power Factor Correction (PFC) converter with a passive snubber is introduced. The proposed passive snubber decreases the conduction losses but increases the range of soft switching achieved. The switch is given Zero Current Switching (ZCS) turn ON and Zero Voltage switching (ZVS) turn OFF. There are no additional stresses on all the semiconductor devices used. Due to the soft switching features, the PFC converter attains a high power factor of 0.98. The proposed converter with passive snubber is simulated in MATLAB and analyzed mode wise with detailed corresponding waveforms.
Predicting Readers' Sarcasm Understandability by Modeling Gaze Behavior

Sarcasm understandability or the ability to understand textual sarcasm depends upon readers’ language proficiency, social knowledge, mental state and attentiveness. We introduce a novel method to predict the sarcasm understandability of a reader. Presence of incongruity in textual sarcasm often elicits distinctive eye-movement behavior by human readers. By recording and analyzing the eye-gaze data, we show that eyemovement patterns vary when sarcasm is understood vis-à-vis when it is not. Motivated by our observations, we propose a system for sarcasm understandability prediction using supervised machine learning. Our system relies on readers’ eyemovement parameters and a few textual features, thence, is able to predict sarcasm understandability with an F-score of 93%, which demonstrates its efficacy. The availability of inexpensive embedded-eye-trackers on mobile devices creates avenues for applying such research which benefits web-content creators, review writers and social media analysts alike.
Leveraging graph topology and semantic context for pharmacovigilance through twitter-streams

Adverse drug events (ADEs) constitute one of the leading causes of post-therapeutic death and their identification constitutes an important challenge of modern precision medicine. Unfortunately, the onset and effects of ADEs are often underreported complicating timely intervention. At over 500 million posts per day, Twitter is a commonly used social media platform. The ubiquity of day-to-day personal information exchange on Twitter makes it a promising target for data mining for ADE identification and intervention. Three technical challenges are central to this problem: (1) identification of salient medical keywords in (noisy) tweets, (2) mapping drug-effect relationships, and (3) classification of such relationships as adverse or non-adverse. We use a bipartite graph-theoretic representation called a drug-effect graph (DEG) for modeling drug and side effect relationships by representing the drugs and side effects as vertices. We construct individual DEGs on two data sources. The first DEG is constructed from the drug-effect relationships found in FDA package inserts as recorded in the SIDER database. The second DEG is constructed by mining the history of Twitter users. We use dictionary-based information extraction to identify medically-relevant concepts in tweets. Drugs, along with co-occurring symptoms are connected with edges weighted by temporal distance and frequency. Finally, information from the SIDER DEG is integrate with the Twitter DEG and edges are classified as either adverse or non-adverse using supervised machine learning. We examine both graph-theoretic and semantic features for the classification task. The proposed approach can identify adverse drug effects with high accuracy with precision exceeding 85 % and F1 exceeding 81 %. When compared with leading methods at the state-of-the-art, which employ un-enriched graph-theoretic analysis alone, our method leads to improvements ranging between 5 and 8 % in terms of the aforementioned measures. Additionally, we employ our method to discover several ADEs which, though present in medical literature and Twitter-streams, are not represented in the SIDER databases. We present a DEG integration model as a powerful formalism for the analysis of drug-effect relationships that is general enough to accommodate diverse data sources, yet rigorous enough to provide a strong mechanism for ADE identification.
A Temporal Attentional Model for Rumor Stance Classification

Rumor stance classification is the task of determining the stance towards a rumor in text. This is the first step in effective rumor tracking on social media which is an increasingly important task. In this work, we analyze Twitter users' stance toward a rumorous tweet, in which users could support, deny, query, or comment upon the rumor. We propose a deep attentional CNN-LSTM approach, which takes the sequence of tweets in a thread of conversation as the input. We use neighboring tweets in the timeline as context vectors to capture the temporal dynamism in users' stance evolution. In addition, we use extra features such as friendship, to leverage useful relational features that are readily available in social media. Our model achieves the state-of-the-art results on rumor stance classification on a recent SemEval dataset, improving accuracy and F1 score by 3.6% and 4.2% respectively.
Global burden of cardiovascular diseases: part I: general considerations, the epidemiologic transition, risk factors, and impact of urbanization.

This two-part article provides an overview of the global burden of atherothrombotic cardiovascular disease. Part I initially discusses the epidemiologic transition which has resulted in a decrease in deaths in childhood due to infections, with a concomitant increase in cardiovascular and other chronic diseases; and then provides estimates of the burden of cardiovascular (CV) diseases with specific focus on the developing countries. Next, we summarize key information on risk factors for cardiovascular disease (CVD) and indicate that their importance may have been underestimated. Then, we describe overarching factors influencing variations in CVD by ethnicity and region and the influence of urbanization. Part II of this article describes the burden of CV disease by specific region or ethnic group, the risk factors of importance, and possible strategies for prevention.
Coupled Bayesian Sets Algorithm for Semi-supervised Learning and Information Extraction

Our inspiration comes from Nell (Never Ending Language Learning), a computer program running at Carnegie Mellon University to extract structured information from unstructured web pages. We consider the problem of semi-supervised learning approach to extract category instances (e.g. country(USA), city(New York)) from web pages, starting with a handful of labeled training examples of each category or relation, plus hundreds of millions of unlabeled web documents. Semisupervised approaches using a small number of labeled examples together with many unlabeled examples are often unreliable as they frequently produce an internally consistent, but nevertheless, incorrect set of extractions. We believe that this problem can be overcome by simultaneously learning independent classifiers in a new approach named Coupled Bayesian Sets algorithm, based on Bayesian Sets, for many different categories and relations (in the presence of an ontology defining constraints that couple the training of these classifiers). Experimental results show that simultaneously learning a coupled collection of classifiers for random 11 categories resulted in much more accurate extractions than training classifiers through original Bayesian Sets algorithm, Naive Bayes, BaS-all and Coupled Pattern Learner (the category extractor used in NELL).
Analysis of dynamically scheduled tile algorithms for dense linear algebra on multicore architectures

The objective of this paper is to analyze the dynamic scheduling of dense linear algebra algorithms on shared-memory, multicore architectures. Current numerical libraries, e.g., LAPACK, show clear limitations on such emerging systems mainly due to their coarse granularity tasks. Thus, many numerical algorithms need to be redesigned to better fit the architectural design of the multicore platform. The PLASMA library (Parallel Linear Algebra for Scalable Multi-core Architectures) developed at the University of Tennessee tackles this challenge by using tile algorithms to achieve a finer task granularity. These tile algorithms can then be represented by Directed Acyclic Graphs (DAGs), where nodes are the tasks and edges are the dependencies between the tasks. The paramount key to achieve high performance is to implement a runtime environment to efficiently schedule the DAG across the multicore platform. This paper studies the impact on the overall performance of some parameters, both at the level of the scheduler, e.g., window size and locality, and the algorithms, e.g., Left Looking (LL) and Right Looking (RL) variants. The conclusion of this study claims that some commonly accepted rules for dense linear algebra algorithms may need to be revisited.
Low-rank matrix completion using alternating minimization

Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge .
 In the alternating minimization approach, the low-rank target matrix is written in a bi-linear form, i.e. X = UV†; the algorithm then alternates between finding the best U and the best V. Typically, each alternating step in isolation is convex and tractable. However the overall problem becomes non-convex and is prone to local minima. In fact, there has been almost no theoretical understanding of when this approach yields a good result.
 In this paper we present one of the first theoretical analyses of the performance of alternating minimization for matrix completion, and the related problem of matrix sensing. For both these problems, celebrated recent results have shown that they become well-posed and tractable once certain (now standard) conditions are imposed on the problem. We show that alternating minimization also succeeds under similar conditions. Moreover, compared to existing results, our paper shows that alternating minimization guarantees faster (in particular, geometric) convergence to the true matrix, while allowing a significantly simpler analysis.
A Neural Network Framework for Fair Classifier

Machine learning models are extensively being used in decision making, especially for prediction tasks. These models could be biased or unfair towards a specific sensitive group either of a specific race, gender or age. Researchers have put efforts into characterizing a particular definition of fairness and enforcing them into the models. In this work, mainly we are concerned with the following three definitions, Disparate Impact, Demographic Parity and Equalized Odds. Researchers have shown that Equalized Odds cannot be satisfied in calibrated classifiers unless the classifier is perfect. Hence the primary challenge is to ensure a degree of fairness while guaranteeing as much accuracy as possible. Fairness constraints are complex and need not be convex. Incorporating them into a machine learning algorithm is a significant challenge. Hence, many researchers have tried to come up with a surrogate loss which is convex in order to build fair classifiers. Besides, certain papers try to build fair representations by preprocessing the data, irrespective of the classifier used. Such methods, not only require a lot of unrealistic assumptions but also require human engineered analytical solutions to build a machine learning model. We instead propose an automated solution which is generalizable over any fairness constraint. We use a neural network which is trained on batches and directly enforces the fairness constraint as the loss function without modifying it further. We have also experimented with other complex performance measures such as H-mean loss, Q-mean-loss, F-measure; without the need for any surrogate loss functions. Our experiments prove that the network achieves similar performance as state of the art. Thus, one can just plug-in appropriate loss function as per required fairness constraint and performance measure of the classifier and train a neural network to achieve that.
State of the art of Trust and Reputation Systems in E-Commerce Context

This article proposes in depth comparative study of the most popular, used and analyzed Trust and Reputation System (TRS) according to the trust and reputation literature and in terms of specific trustworthiness criteria. This survey is realized relying on a selection of trustworthiness criteria that analyze and evaluate the maturity and effectiveness of TRS. These criteria describe the utility, the usability, the performance and the effectiveness of the TRS. We also provide a summary table of the compared TRS within a detailed and granular selection of trust and reputation aspects.
Cost-Sensitive Online Classification

Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, “Cost-Sensitive Online Classification". In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of the cost-sensitive measures made by the proposed algorithms, and extensively examine their empirical performance on a variety of cost-sensitive online classification tasks. Finally, we demonstrate the application of the proposed technique for solving several online anomaly detection tasks, showing that the proposed technique could be a highly efficient and effective tool to tackle cost-sensitive online classification tasks in various application domains.
ElasticTree: Saving Energy in Data Center Networks

Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving a network’s ability to scale up and down, as traffic demands ebb and flow. We present ElasticTree, a network-wide power manager, which dynamically adjusts the set of active network elements — links and switches — to satisfy changing data center traffic loads. We first compare multiple strategies for finding minimum-power network subsets across a range of traffic patterns. We implement and analyze ElasticTree on a prototype testbed built with production OpenFlow switches from three network vendors. Further, we examine the trade-offs between energy efficiency, performance and robustness, with real traces from a production e-commerce website. Our results demonstrate that for data center workloads, ElasticTree can save up to 50% of network energy, while maintaining the ability to handle traffic surges. Our fast heuristic for computing network subsets enables ElasticTree to scale to data centers containing thousands of nodes. We finish by showing how a network admin might configure ElasticTree to satisfy their needs for performance and fault tolerance, while minimizing their network power bill.
Performing edge detection by difference of Gaussians using q-Gaussian kernels

X iv :1 31 1. 25 61 v2 [ cs .C V ] 1 2 N ov 2 01 3 Performing edge detection by difference of Gaussians using q-Gaussian kernels Lucas Assirati, Núbia R. da Silva, 2 Lilian Berton, Alneu de A. Lopes, and Odemir M. Bruno 2 Scientific Computing Group, São Carlos Institute of Physics, University of São Paulo (USP), cx 369 13560-970 São Carlos, São Paulo, Brazil www.scg.ifsc.usp.br Institute of Mathematics and Computer Science, University of São Paulo (USP), Avenida Trabalhador são-carlense, 40
1 BAGGING AND BOOSTING CLASSIFICATION TREES TO PREDICT CHURN

In this paper, the bagging and boosting classification techniques are brought to the attention of marketing researchers. Applied to a customer database of an anonymous U.S. wireless telecom company, bagging — as well as boosting — is proven to significantly improve accuracy in predicting churn. This higher predictive performance could ultimately lead to incremental profit for companies that would be willing to use these methods. Furthermore, results illustrate that the use of a balanced sampling scheme is recommended when predicting a rare event from large datasets, but consequently requires an appropriate bias correction.
Traffic prediction in a bike-sharing system

Bike-sharing systems are widely deployed in many major cities, providing a convenient transportation mode for citizens' commutes. As the rents/returns of bikes at different stations in different periods are unbalanced, the bikes in a system need to be rebalanced frequently. Real-time monitoring cannot tackle this problem well as it takes too much time to reallocate the bikes after an imbalance has occurred. In this paper, we propose a hierarchical prediction model to predict the number of bikes that will be rent from/returned to each station cluster in a future period so that reallocation can be executed in advance. We first propose a bipartite clustering algorithm to cluster bike stations into groups, formulating a two-level hierarchy of stations. The total number of bikes that will be rent in a city is predicted by a Gradient Boosting Regression Tree (GBRT). Then a multi-similarity-based inference model is proposed to predict the rent proportion across clusters and the inter-cluster transition, based on which the number of bikes rent from/ returned to each cluster can be easily inferred. We evaluate our model on two bike-sharing systems in New York City (NYC) and Washington D.C. (D.C.) respectively, confirming our model's advantage beyond baseline approaches (0.03 reduction of error rate), especially for anomalous periods (0.18/0.23 reduction of error rate).