nils-herrmann/clean_scirepeval huggingface dataset:
Closed Shortest Path in the Original Coordinates with an Application to Breast Cancer

Breast cancer is one of the most mediated malignant diseases, because of its high incidence and prevalence, but principally due to its physical and psychological invasiveness. The study of this disease using computer science tools resorts often to the image segmentation operation. Image segmentation, although having been extensively studied, is still an open problem. Shortest path algorithms are extensively used to tackle this problem. There are, however, applications where the starting and ending positions of the shortest path need to be constrained, defining a closed contour enclosing a previously detected seed. Mass and calcification segmentation in mammograms and areola segmentation in digital images are two particular examples of interest within the field of breast cancer research. Usually the closed contour computation is addressed by transforming the image into polar coordinates, where the closed contour is transformed into an open contour between two opposite margins. In this work, after illustrating some of the limitations of this approach, we show how to compute the closed contour in the original coordinate space. After defining a directed acyclic graph appropriate for this task, we address the main difficulty in operating in the original coordinate space. Since small paths collapsing in the seed point are naturally favored, we modulate the cost of the edges to counterbalance this bias. A thorough evaluation is conducted with datasets from the breast cancer field. The algorithm is shown to be fast and reliable and suffers no loss in resolution.
Affective graphs: The visual appeal of Linked Data

The essence and value of Linked Data lies in the ability of humans and machines to query, access and reason upon highly structured and formalised data. Ontology structures provide an unambiguous description of the structure and content of data. While a multitude of software applications and visualisation systems have been developed over the past years for Linked Data, there is still a significant gap that exists between applications that consume Linked Data and interfaces that have been designed with significant focus on aesthetics. Though the importance of aesthetics in affecting the usability, effectiveness and acceptability of user interfaces have long been recognised, little or no explicit attention has been paid to the aesthetics of Linked Data applications. In this paper, we introduce a formalised approach to developing aesthetically pleasing Semantic Web interfaces by following aesthetic principles and guidelines identified from literature. We apply such principles to design and develop a generic approach of using visualisations to support exploration of Linked Data, in an interface that is pleasing to users. This provides users with means to browse ontology structures, enriched with statistics of the underlying data, facilitating exploratory activities and enabling visual query for highly precise information needs. We evaluated our approach in three ways: an initial objective evaluation comparing our approach with other well-known interfaces for the Semantic Web and two user evaluations with Semantic Web researchers.
Investigating the Evolution of Bad Smells in Object-Oriented Code

Software design problems are known and perceived under many different terms such as bad smells, flaws, non-compliance to design principles, violation of heuristics, excessive metric values and antipatterns, signifying the importance of handling them in the construction and maintenance of software. Once a design problem is identified, it can be removed by applying an appropriate refactoring, improving in most cases several aspects of quality such as maintainability, comprehensibility and reusability. This paper, taking advantage of recent advances and tools in the identification of non-trivial bad smells, explores the presence and evolution of such problems by analyzing past versions of code. Several interesting questions can be investigated such as whether the number of problems increases with the passage of software generations, whether problems vanish by time or only by targeted human intervention, whether bad smells occur in the course of evolution of a module or exist right from the beginning and whether refactorings targeting at smell removal are frequent. In contrast to previous studies that investigate the application of refactorings in the history of a software project, we attempt to study the subject from the point of view of the problems themselves distinguishing deliberate maintenance activities from the removal of design problems as a side effect of software evolution. Results are discussed for two open-source systems and three bad smells.
Online Parameter Estimation Technique for Adaptive Control Applications of Interior PM Synchronous Motor Drives

This paper proposes an online parameter estimation method based on a discrete-time dynamic model for the interior permanent-magnet synchronous motors (IPMSMs). The proposed estimation technique, which takes advantage of the difference in dynamics of motor parameters, consists of two affine projection algorithms. The first one is designed to accurately estimate the stator inductances, whereas the second one is designed to precisely estimate the stator resistance, rotor flux linkage, and load torque. In this paper, the adaptive decoupling proportional-integral (PI) controllers with the maximum torque per ampere operation, which utilize the previously identified parameters in real time, are chosen to verify the effectiveness of the proposed parameter estimation scheme. The simulation results via MATLAB/Simulink and the experimental results via a prototype IPMSM drive system with a TI TMS320F28335 DSP are presented under various conditions. A comparative study with the conventional decoupling PI control method is carried out to demonstrate the better performances (i.e., faster dynamic response, less steady-state error, more robustness, etc.) of the adaptive decoupling PI control scheme based on the proposed online parameter estimation technique.
AR-miner: mining informative reviews for developers from mobile app marketplace

With the popularity of smartphones and mobile devices, mobile application (a.k.a. “app”) markets have been growing exponentially in terms of number of users and downloads. App developers spend considerable effort on collecting and exploiting user feedback to improve user satisfaction, but suffer from the absence of effective user review analytics tools. To facilitate mobile app developers discover the most “informative” user reviews from a large and rapidly increasing pool of user reviews, we present “AR-Miner” — a novel computational framework for App Review Mining, which performs comprehensive analytics from raw user reviews by (i) first extracting informative user reviews by filtering noisy and irrelevant ones, (ii) then grouping the informative reviews automatically using topic modeling, (iii) further prioritizing the informative reviews by an effective review ranking scheme, (iv) and finally presenting the groups of most “informative” reviews via an intuitive visualization approach. We conduct extensive experiments and case studies on four popular Android apps to evaluate AR-Miner, from which the encouraging results indicate that AR-Miner is effective, efficient and promising for app developers.
Belvedere : Engaging Students in Critical Discussion of Science and Public Policy Issues

We describe “Belvedere,” a system to support students engaged in critical discussion of science issues. The design is intended to address cognitive and metacognitive limitations of unpracticed beginners while supporting their practice of this complex skill. Both prior psychological research and formative evaluation studies with users shaped the interface design. We discuss our design rationale, describe our formative evaluation studies and provide examples of student sessions, and discuss ongoing work with the argumentation advisor.
Bots, #StrongerIn, and #Brexit: Computational Propaganda during the UK-EU Referendum

Bots are social media accounts that automate interaction with other users, and they are active on the StrongerInBrexit conversation happening over Twitter. These automated scripts generate content through these platforms and then interact with people. Political bots are automated accounts that are particularly active on public policy issues, elections, and political crises. In this preliminary study on the use of political bots during the UK referendum on EU membership, we analyze the tweeting patterns for both human users and bots. We find that political bots have a small but strategic role in the referendum conversations: (1) the family of hashtags associated with the argument for leaving the EU dominates, (2) different perspectives on the issue utilize different levels of automation, and (3) less than 1 percent of sampled accounts generate almost a third of all
A Multi-Layered Annotated Corpus of Scientific Papers

Scientific literature records the research process with a standardized structure and provides the clues to track the progress in a scientific field. Understanding its internal structure and content is of paramount importance for natural language processing (NLP) technologies. To meet this requirement, we have developed a multi-layered annotated corpus of scientific papers in the domain of Computer Graphics. Sentences are annotated with respect to their role in the argumentative structure of the discourse. The purpose of each citation is specified. Special features of the scientific discourse such as advantages and disadvantages are identified. In addition, a grade is allocated to each sentence according to its relevance for being included in a summary.To the best of our knowledge, this complex, multi-layered collection of annotations and metadata characterizing a set of research papers had never been grouped together before in one corpus and therefore constitutes a newer, richer resource with respect to those currently available in the field.
Performance Investigation of Feature Selection Methods

Sentiment analysis or opinion mining has become an open research domain after proliferation of Internet and Web 2.0 social media. People express their attitudes and opinions on social media including blogs, discussion forums, tweets, etc. and, sentiment analysis concerns about detecting and extracting sentiment or opinion from online text. Sentiment based text classification is different from topical text classification since it involves discrimination based on expressed opinion on a topic. Feature selection is significant for sentiment analysis as the opinionated text may have high dimensions, which can adversely affect the performance of sentiment analysis classifier. This paper explores applicability of feature selection methods for sentiment analysis and investigates their performance for classification in term of recall, precision and accuracy. Five feature selection methods (Document Frequency, Information Gain, Gain Ratio, Chi Squared, and Relief-F) and three popular sentiment feature lexicons (HM, GI and Opinion Lexicon) are investigated on movie reviews corpus with a size of 2000 documents. The experimental results show that Information Gain gave consistent results and Gain Ratio performs overall best for sentimental feature selection while sentiment lexicons gave poor performance. Furthermore, we found that performance of the classifier depends on appropriate number of representative feature selected from text.
Design and Implementation of a TEM Stripline for EMC Testing

In this paper, a stripline for radiated field immunity testing of audio/video products is designed, constructed, calibrated, and verified. Since the canonical one is only suitable for testing equipments with height less than 70 cm, there is a need of a new device which is also in compliance with EN 55020 standard for testing new large sets, like 47'' thin-film transistor liquid crystal display (TFT LCD) television sets, in the frequency range of 150 kHz-150 MHz. Increasing the height and width of testing area causes important problems in terms of field uniformity regarding the higher order modes, characteristic impedance, and reflections in addition to the room resonances and field interference sources like corners at the edges of stripline. Comprehensive numerical study is performed to overcome these problems and obtain the optimum design before the construction. Measured data show that the new stripline is in very good agreement with the specifications determined by the standards and therefore it can be used for the electromagnetic compatibility (EMC) testing.
BogusBiter: A transparent protection against phishing attacks

Many anti-phishing mechanisms currently focus on helping users verify whether a Web site is genuine. However, usability studies have demonstrated that prevention-based approaches alone fail to effectively suppress phishing attacks and protect Internet users from revealing their credentials to phishing sites. In this paper, instead of preventing human users from “biting the bait,” we propose a new approach to protect against phishing attacks with “bogus bites.” We develop BogusBiter, a unique client-side anti-phishing tool, which transparently feeds a relatively large number of bogus credentials into a suspected phishing site. BogusBiter conceals a victim's real credential among bogus credentials, and moreover, it enables a legitimate Web site to identify stolen credentials in a timely manner. Leveraging the power of client-side automatic phishing detection techniques, BogusBiter is complementary to existing preventive anti-phishing approaches. We implemented BogusBiter as an extension to the Firefox 2 Web browser, and evaluated its efficacy through real experiments on both phishing and legitimate Web sites. Our experimental results indicate that it is promising to use BogusBiter to transparently protect against phishing attacks.
Personalized Tour Recommendation Based on User Interests and Points of Interest Visit Durations

Tour recommendation and itinerary planning are challenging tasks for tourists, due to their need to select Points of Interest (POI) to visit in unfamiliar cities, and to select POIs that align with their interest preferences and trip constraints. We propose an algorithm called PERSTOUR for recommending personalized tours using POI popularity and user interest preferences, which are automatically derived from real-life travel sequences based on geotagged photos. Our tour recommendation problem is modelled using a formulation of the Orienteering problem, and considers user trip constraints such as time limits and the need to start and end at specific POIs. In our work, we also reflect levels of user interest based on visit durations, and demonstrate how POI visit duration can be personalized using this time-based user interest. Using a Flickr dataset of four cities, our experiments show the effectiveness of PERSTOUR against various baselines, in terms of tour popularity, interest, recall, precision and F1-score. In particular, our results show the merits of using time-based user interest and personalized POI visit durations, compared to the current practice of using frequency-based user interest and average visit durations.
A Current Control Scheme With Back EMF Cancellation and Tracking Error Adapted Commutation Shift for Switched-Reluctance Motor Drive

In this paper, an improved winding current control scheme for switched-reluctance motor drive is developed and evaluated. The current feedback controller (CFBC) is augmented with an observed back electromotive force (EMF) current feedforward controller (CFFC) and a current tracking error adapted dynamic commutation shift controller (DCSC). In the proposed DCSC, the rising winding current tracking errors of all phases are extracted, synthesized, and processed to generate the suitable advanced commutation shift angle. The effects of motor back EMF and nonlinear winding inductance can be reduced to yield improved winding current tracking waveforms under a wide operation range. The gradual improvements in current responses and efficiencies by augmenting the CFBC with the CFFC and then the DCSC are verified experimentally. Then, the robust speed control scheme is properly designed to achieve good acceleration/deceleration, reversible running, and dynamic characteristics.
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans

A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is di cult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans. In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The rst algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers.
Using county demographics to infer attributes of Twitter users

Social media are increasingly being used to complement traditional survey methods in health, politics, and marketing. However, little has been done to adjust for the sampling bias inherent in this approach. Inferring demographic attributes of social media users is thus a critical step to improving the validity of such studies. While there have been a number of supervised machine learning approaches to this problem, these rely on a training set of users annotated with attributes, which can be difficult to obtain. We instead propose training a demographic attribute classifiers that uses county-level supervision. By pairing geolocated social media with county demographics, we build a regression model mapping text to demographics. We then adopt this model to make predictions at the user level. Our experiments using Twitter data show that this approach is surprisingly competitive with a fully supervised approach, estimating the race of a user with 80% accuracy.
Estimation of Detection Thresholds for Redirected Walking Techniques

In immersive virtual environments (IVEs), users can control their virtual viewpoint by moving their tracked head and walking through the real world. Usually, movements in the real world are mapped one-to-one to virtual camera motions. With redirection techniques, the virtual camera is manipulated by applying gains to user motion so that the virtual world moves differently than the real world. Thus, users can walk through large-scale IVEs while physically remaining in a reasonably small workspace. In psychophysical experiments with a two-alternative forced-choice task, we have quantified how much humans can unknowingly be redirected on physical paths that are different from the visually perceived paths. We tested 12 subjects in three different experiments: (E1) discrimination between virtual and physical rotations, (E2) discrimination between virtual and physical straightforward movements, and (E3) discrimination of path curvature. In experiment E1, subjects performed rotations with different gains, and then had to choose whether the visually perceived rotation was smaller or greater than the physical rotation. In experiment E2, subjects chose whether the physical walk was shorter or longer than the visually perceived scaled travel distance. In experiment E3, subjects estimate the path curvature when walking a curved path in the real world while the visual display shows a straight path in the virtual world. Our results show that users can be turned physically about 49 percent more or 20 percent less than the perceived virtual rotation, distances can be downscaled by 14 percent and upscaled by 26 percent, and users can be redirected on a circular arc with a radius greater than 22 m while they believe that they are walking straight.
A Persona-Based Neural Conversation Model

We present persona-based models for handling the issue of speaker consistency in neural response generation. A speaker model encodes personas in distributed embeddings that capture individual characteristics such as background information and speaking style. A dyadic speakeraddressee model captures properties of interactions between two interlocutors. Our models yield qualitative performance improvements in both perplexity and BLEU scores over baseline sequence-to-sequence models, with similar gains in speaker consistency as measured by human judges.
On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice

Modern storage systems stripe redundant data across multiple disks to provide availability guarantees against disk failures. One form of data redundancy is based on XOR-based erasure codes, which use only XOR operations for encoding and decoding. In addition to providing failure tolerance, a storage system must also provide fast failure recovery to avoid data unavailability. We consider the problem of speeding up the recovery of a single-disk failure for arbitrary XOR-based erasure codes. We address this problem from both theoretical and practical perspectives. We propose a replace recovery algorithm, which uses a hill-climbing technique to search for a fast recovery solution, such that the solution search can be completed within a short time period. We further implement our replace recovery algorithm atop a parallelized architecture to justify its practicality. We experiment our replace recovery algorithm and its parallelized implementation on a networked storage system testbed, and demonstrate that our replace recovery algorithm uses less recovery time than the conventional approach.
Exploiting different word clusterings for class-based RNN language modeling in speech recognition

We propose to exploit the potential of multiple word clusterings in class-based recurrent neural network (RNN) language models for ensemble RNN language modeling. By varying the clustering criteria and the space of word embedding, different word clusterings are obtained to define different word/class factorizations. For each such word/class factorization, several base RNNLMs are learned, and the word prediction probabilities of the base RNNLMs are then combined to form an ensemble prediction. We use a greedy backward model selection procedure to select a subset of models and combine these models for word prediction. The proposed ensemble language modeling method has been evaluated on Penn Treebank test set as well as Wall Street Journal (WSJ) Eval 92 and 93 test sets, where it improved test set perplexity and word error rate over the state-of-the-art single RNNLMs as well as multiple RNNLMs produced by varying RNN learning conditions.