nils-herrmann/clean_scirepeval huggingface dataset:
Correlated discrete data generation using adversarial training

Generative Adversarial Networks (GAN) have shown great promise in tasks like synthetic image generation, image inpainting, style transfer, and anomaly detection. However, generating discrete data is a challenge. This work presents an adversarial training based correlated discrete data (CDD) generation model. It also details an approach for conditional CDD generation. The results of our approach are presented over two datasets; job-seeking candidates skill set (private dataset) and MNIST (public dataset). From quantitative and qualitative analysis of these results, we show that our model performs better as it leverages inherent correlation in the data, than an existing model that overlooks correlation.
Classifying racist texts using a support vector machine

In this poster we present an overview of the techniques we used to develop and evaluate a text categorisation system to automatically classify racist texts. Detecting racism is difficult because the presence of indicator words is insufficient to indicate racist texts, unlike some other text classification tasks. Support Vector Machines (SVM) are used to automatically categorise web pages based on whether or not they are racist. Different interpretations of what constitutes a term are taken, and in this poster we look at three representations of a web page within an SVM -- bag-of-words, bigrams and part-of-speech tags.
Facilitating Learning and Knowledge Transfer through Mentoring

Mentoring is a human resources development process supporting learning and knowledge transfer. Social media and Web services can be used for learning, communication with mentors and monitoring bringing also other advantages. In this paper formal and informal mentoring aspects and the use of IT in mentoring particularly social media and Web support will be shortly presented. Examples of projects where besides knowledge transfer, formal, informal learning also learning in a Web-based community is used are outlined.
Beyond budgeting and Agile Software Development: a Conceptual Framework for the Performance Management of Agile Software Development Teams

Around the same time as the emergence of agile methods as a formalized concept, the management accounting literature introduced the concept of Beyond Budgeting as a performance management model for changing business environments. Both concepts share many similarities with both having a distinctly agile or adaptive perspective. The Beyond Budgeting model promises to enable companies to keep pace with changing business environments, quickly create and adapt strategy and empower people throughout the organization to make effective changes. This research in progress paper attempts to develop the Beyond Budgeting model within the context of agile software development teams. The twelve Beyond Budgeting principles are discussed and a research framework is presented. This framework is being used in two case studies to investigate the organizational issues and challenges that affect the performance of agile software
Early prediction of scholar popularity

Prediction of scholar popularity has become an important research topic for a number of reasons. In this paper, we tackle the problem of predicting the popularity {\it trend} of scholars by concentrating on making predictions both as earlier and accurate as possible. In order to perform the prediction task, we first extract the popularity trends of scholars from a training set. To that end, we apply a time series clustering algorithm called K-Spectral Clustering (K-SC) to identify the popularity trends as cluster centroids. We then predict trends for scholars in a test set by solving a classification problem. Specifically, we first compute a set of measures for individual scholars based on the distance between earlier points in her particular popularity curve and the identified centroids. We then combine those distance measures with a set of academic features (e.g., number of publications, number of venues, etc) collected during the same monitoring period, and use them as input to a classification method. One aspect that distinguishes our method from other approaches is that the monitoring period, during which we gather information on each scholar popularity and academic features, is determined on a per scholar basis, as part of our approach. Using total citation count as measure of scientific popularity, we evaluate our solution on the popularity time series of more than 500,000 Computer Science scholars, gathered from Microsoft Azure Marketplace (https://datamarket.azure.com/dataset/mrc/microsoftacademic). The experimental results show that the our prediction method outperforms other alternative prediction methods. We also show how to apply our method jointly with regression models to improve the prediction of scholar popularity values (e.g., number of citations) at a given future time.
Millimeter wave cavity backed aperture coupled microstrip patch antenna

In this paper, a new single element broad band cavity backed multi-layer microstrip patch antenna is presented. This antenna is designed to be used in 79 GHz MIMO radar applications, and is fabricated with advanced high resolution multi-layer PCB technology. It has a wide bandwidth of 11.43 GHz, which is 14.5% of the center frequency. The beam widths in both E and H-planes are very wide, and are 144 degrees and 80 degrees respectively. Also, the antenna gain and efficiency are respectively 4.7 dB and 87%. Furthermore, measurements have been done, and show a good agreement with simulations.
Optimal control approach for pneumatic artificial muscle with using pressure-force conversion model

In this paper, we propose an optimal control framework for pneumatic actuators. In particular, we consider using Pneumatic Artificial Muscle (PAM) as a part of Pneumatic-Electric (PE) hybrid actuation system. An optimal control framework can be useful for PE hybrid system to properly distribute desired torque outputs to the actuators that have different characteristics. In the optimal control framework, the standard choice to represent control cost is squared force or torque outputs. However, since the control input for PAM is pressure rather than the force or the torque, we should explicitly consider the pressure of PAM as the control cost in an objective function of the optimal control method. We show that we are able to use pressure input as the control cost for PAM by explicitly considering the model which represents a relationship between the pressure input and the force output of PAM. We demonstrate that one-DOF robot with the PE hybrid actuation system can generate pressure-optimized ball throwing movements by using the optimal control method.
Person Re-Identification by Support Vector Ranking

This paper addresses the problem of multi-camera person reidentification as a ranking problem using a scaleable combination model of Boosting and Support Vector Machines.  Most existing work has concentrated on compiling feature sets as a template to describe an individual, followed by template matching using a direct distance measure chosen independently from the data [2, 4, 6]. Gray and Tao  proposed to use Adaboost to search through a large feature set for those features that are more relevant (more discriminative). Regardless of the choice of features and distance mea sures, re-identification by these approaches are difficult because the re is often too much of an overlap between feature distributions of different objects.  In this work, we present a novel reformulation of the person re-identification problem. While previous approaches have looked a t this problem as a classification of correct vs incorrect match, we propo se an approach based on the information retrieval concept of document ranking . The main difference between this approach and previous pers on re-identification techniques is that we are not concerned with comparing direct distance scores between correct and incorrect matches. Ins tead, we are only interested in the relative ranking of these scores that reflects the relevance of each likely match to the query image. There are two main approaches for ranking: Boosting and Support Vector Machines (SVMs). Boosting involves picking weak rankers in each individual feature dimension, which is likely to lead to very weak rankers thus reducing matching effectiveness. In contrast, ranking SVMs seek to learn a ranking function in a higher dimensional feature space holistically (rather than individual feature dimension) where true matches and wrong matches can be made more separable than in the original feature space. However, they can also be computationally and spatially intensive when dealing with large numbers of negative samples. In order to overcome these problems, we explore an Ensemble of Primal SVMs (PRSVM)  that reduces the computation and memory cost by using several SVMs trained on subsets of the data while incorporating the SVM parameter C into the framework.  Given a dataset X = {(xi,yi)}i=1 wherexi is a multidimensional feature vector representing the appearance of a person captured in one view,yi is its label andm is the number of training samples (images of people). Each query feature vector xi, has relevant feature vectors,x i, j, and related irrelevant feature vectors x − i, j′ . The goal of ranking any paired image relevance is to learn a ranking function δ for all pairs of (xi,x + i, j) and(xi,x − i, j′) such that the relevance ranking score δ (xi,x + i, j) is larger thanδ (xi,x i, j′). In our workδ is computed by a linear function w: δ (xi,xi, j) = w|xi − xi, j|, (1)
Question Answering on Freebase via Relation Extraction and Textual Evidence

Existing knowledge-based question answering systems often rely on small annotated training data. While shallow methods like relation extraction are robust to data scarcity, they are less expressive than the deep meaning representation methods like semantic parsing, thereby failing at answering questions involving multiple constraints. Here we alleviate this problem by empowering a relation extraction method with additional evidence from Wikipedia. We first present a neural network based relation extractor to retrieve the candidate answers from Freebase, and then infer over Wikipedia to validate these answers. Experiments on the WebQuestions question answering dataset show that our method achieves an F1 of 53.3%, a substantial improvement over the state-of-the-art.
The synthesis and rendering of eroded fractal terrains

In standard fractal terrain models based on fractional Brownian motion the statistical character of the surface is, by design, the same everywhere. A new approach to the synthesis of fractal terrain height fields is presented which, in contrast to previous techniques, features locally independent control of the frequencies composing the surface, and thus local control of fractal dimension and other statistical characteristics. The new technique, termed noise synthesis, is intermediate in difficulty of implementation, between simple stochastic subdivision and Fourier filtering or generalized stochastic subdivision, and does not suffer the drawbacks of creases or periodicity. Varying the local crossover scale of fractal character or the fractal dimension with altitude or other functions yields more realistic first approximations to eroded landscapes. A simple physical erosion model is then suggested which simulates hydraulic and thermal erosion processes to create gloabl stream/valley networks and talus slopes. Finally, an efficient ray tracing algorithm for general height fields, of which most fractal terrains are a subset, is presented.
SPARTan: Scalable PARAFAC2 for Large & Sparse Data

In exploratory tensor mining, a common problem is how to analyze a set of variables across a set of subjects whose observations do not align naturally. For example, when modeling medical features across a set of patients, the number and duration of treatments may vary widely in time, meaning there is no meaningful way to align their clinical records across time points for analysis purposes. To handle such data, the state-of-the-art tensor model is the so-called PARAFAC2, which yields interpretable and robust output and can naturally handle sparse data. However, its main limitation up to now has been the lack of efficient algorithms that can handle large-scale datasets.
 In this work, we fill this gap by developing a scalable method to compute the PARAFAC2 decomposition of large and sparse datasets, called SPARTan. Our method exploits special structure within PARAFAC2, leading to a novel algorithmic reformulation that is both faster (in absolute time) and more memory-efficient than prior work. We evaluate SPARTan on both synthetic and real datasets, showing 22X performance gains over the best previous implementation and also handling larger problem instances for which the baseline fails. Furthermore, we are able to apply SPARTan to the mining of temporally-evolving phenotypes on data taken from real and medically complex pediatric patients. The clinical meaningfulness of the phenotypes identified in this process, as well as their temporal evolution over time for several patients, have been endorsed by clinical experts.
Algorithms for time series knowledge mining

Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe disadvantages for knowledge discovery. The Time Series Knowledge Representation (TSKR) is a new hierarchical language for interval patterns expressing the temporal concepts of coincidence and partial order. We present effective and efficient mining algorithms for such patterns based on itemset techniques. A novel form of search space pruning effectively reduces the size of the mining result to ease interpretation and speed up the algorithms. On a real data set a concise set of TSKR patterns can explain the underlying temporal phenomena, whereas the patterns found with Allen's relations are far more numerous yet only explain fragments of the data.
"I spy with my little eye!": breadth of attention, inattentional blindness, and tactical decision making in team sports.

Failures of awareness are common when attention is otherwise engaged. Such failures are prevalent in attention-demanding team sports, but surprisingly no studies have explored the inattentional blindness paradigm in complex sport game-related situations. The purpose of this paper is to explore the link between breadth of attention, inattentional blindness, and tactical decision-making in team ball sports. A series of studies revealed that inattentional blindness exists in the area of team ball sports (Experiment 1). More tactical instructions can lead to a narrower breadth of attention, which increases inattentional blindness, whereas fewer tactical instructions widen the breadth of attention in the area of team ball sports (Experiment 2). Further meaningful exogenous stimuli reduce inattentional blindness (Experiment 3). The results of all experiments are discussed in connection with consciousness and attention theories as well as creativity and training in team sports.
A line-structure-preserving approach to image resizing

This paper proposes a content-aware image resizing method which simultaneously preserves both salient image features and important line structure properties: parallelism, collinearity and orientation. When there are prominent line structures in the image, image resizing methods without explicitly taking these properties into account could produce line structure distortions in their results. Since the human visual system is very sensitive to line structures, such distortions often become noticeable and disturbing. Our method couples mesh deformations for image resizing with similarity transforms for line features. Mesh deformations are used to control content preservation while similarity transforms are analyzed in the Hough space to maintain line structure properties. Our method strikes a good balance between preserving content and maintaining line structure properties. Experiments show the proposed method often outperforms methods without taking line structures into account, especially for scenes with prominent line structures.
Motivating physical activity at work: using persuasive social media for competitive step counting

Previous research has suggested that social and competitive interaction over online social networking sites could be harnessed in order to motivate behaviour change in users. This paper presents the design and in-the-wild evaluation of StepMatron, a Facebook application designed to provide social and competitive context for daily pedometer readings in order to motivate physical activity in the working environment. A study was conducted in order to determine whether interactions between users via the application more successfully motivated physical activity than simply recording daily step counts in a similar application. Ten participants (1 male), all nurses working in a UK hospital, used the application across two conditions over the course of the study. In the socially-enabled condition, participants could view each other's step data and make comparisons and comments. In the non-social condition, participants could only view their own personal step data. A significant increase in step activity was observed in the socially enabled condition. Our findings highlight the potential of social media as a means for generating positive behaviour change. They also suggest that simple mobile devices can function as an inexpensive, accessible and powerful trigger towards this behaviour change without necessitating the use of overly complex and expensive mobile applications or devices.
Learning by Googling

The goal of giving a well-defined meaning to information is currently shared by endeavors such as the Semantic Web as well as by current trends within Knowledge Management. They all depend on the large-scale formalization of knowledge and on the availability of formal metadata about information resources. However, the question how to provide the necessary formal metadata in an effective and efficient way is still not solved to a satisfactory extent. Certainly, the most effective way to provide such metadata as well as formalized knowledge is to let humans encode them directly into the system, but this is neither efficient nor feasible. Furthermore, as current social studies show, individual knowledge is often less powerful than the collective knowledge of a certain community.As a potential way out of the knowledge acquisition bottleneck, we present a novel methodology that acquires collective knowledge from the World Wide Web using the GoogleTM API. In particular, we present PANKOW, a concrete instantiation of this methodology which is evaluated in two experiments: one with the aim of classifying novel instances with regard to an existing ontology and one with the aim of learning sub-/superconcept relations.
WikiMirs: a mathematical information retrieval system for wikipedia

Mathematical formulae in structural formats such as MathML and LaTeX are becoming increasingly available. Moreover, repositories and websites, including ArXiv and Wikipedia, and growing numbers of digital libraries use these structural formats to present mathematical formulae. This presents an important new and challenging area of research, namely Mathematical Information Retrieval (MIR). In this paper, we propose WikiMirs, a tool to facilitate mathematical formula retrieval in Wikipedia. WikiMirs is aimed at searching for similar mathematical formulae based upon both textual and spatial similarities, using a new indexing and matching model developed for layout structures. A hierarchical generalization technique is proposed to generate sub-trees from presentation trees of mathematical formulae, and similarity is calculated based upon matching at different levels of these trees. Experimental results show that WikiMirs can efficiently support sub-structure matching and similarity matching of mathematical formulae. Moreover, WikiMirs obtains both higher accuracy and better ranked results over Wikipedia in comparison to Wikipedia Search and Egomath. We conclude that WikiMirs provides a new, alternative, and hopefully better service for users to search mathematical expressions within Wikipedia.
Gender differences in the relationship between internet addiction and depression: A cross-lagged study in Chinese adolescents

The present study explored the role of gender in the association between Internet addiction and depression. Three-wave longitudinal panel data were collected from self-reported questionnaires that were completed by 1715 adolescents in grades 6e8 in China. Cross-lagged structural equation modeling was used to examine the relationship between Internet addiction and depression. In male adolescents, depression was found to significantly predict subsequent Internet addiction, suggesting that depression was the cause of Internet addiction and supporting the mood enhancement hypothesis. In female adolescents, Internet addiction was found to significantly predict subsequent depression, indicating that Internet addiction leads to depression and supporting the social displacement hypothesis. These results indicate that the relationship between Internet addiction and depression depended on gender. In addition, it was found that males and females exhibit different behavioral patterns and motivations of Internet usage. Males were more likely to use the Internet for pleasure and less likely to surf the Internet to search for information, compared with females. Although both males and females were prone to surfing the Internet alone, males were more likely to go online with friends compared with females. These findings suggest that gender-specific preventative and interventional strategies should be developed to reduce Internet addiction.
Internet of multimedia things: Vision and challenges

Internet of Things (IoT) systems cannot successfully realize the notion of ubiquitous connectivity of everything if they are not capable to truly include ‘multimedia things’. However, the current research and development activities in the field do not mandate the features of multimedia objects, thus leaving a gap to benefit from multimedia content based services and applications. In this paper, we analyze this issue by contemplating the concept of IoT and drawing an inspiration towards the perspective vision of ‘Internet of Multimedia Things’ (IoMT). Therein, we introduce IoMT as a novel paradigm in which smart heterogeneous multimedia things can interact and cooperate with one another and with other things connected to the Internet to facilitate multimedia based services and applications that are globally available to the users. Some applications and use-cases for IoMT are presented to reflect the possibilities enabled by this new paradigm. An IoMT architecture is then presented which is segregated into four distinct stages; (i) Multimedia sensing, (ii) Reporting and addressability, (iii) Multimedia-aware cloud, and (iv) Multi-agent systems. Instead of proposing specific technical solutions for each individual stage of the presented architecture, we survey the already existing technologies, providing a synthesis for the realization of the vision of IoMT. Subsequently, various requirements and challenges as well as the feasibility of existing solutions for each stage of proposed IoMT architecture are comprehensively discussed.