nils-herrmann/clean_scirepeval huggingface dataset:
Flexible artificial muscle by bundle of McKibben fiber actuators

McKibben actuator is well known as an artificial muscle because it realizes contraction force and displacement with high energy density. Therefore mechanical engineers have been applied the actuators to biomimetic robots, power assisting wear mechanisms and so on. Generally, “one” actuator has been used as “one” artificial muscle. Namely, if one artificial muscle of 10mm in diameter is necessary, one actuator of 10mm in diameter has been utilized.
Linked knowledge sources for topic classification of microposts: A semantic graph-based approach

Short text messages a.k.a Microposts (e.g. Tweets) have proven to be an effective channel for revealing information about trends and events, ranging from those related to Disaster (e.g. hurricane Sandy) to those related to Violence (e.g. Egyptian revolution). Being informed about such events as they occur could be extremely important to authorities and emergency professionals by allowing such parties to immediately respond. In this work we study the problem of topic classification (TC) of Microposts, which aims to automatically classify short messages based on the subject(s) discussed in them. The accurate TC of Microposts however is a challenging task since the limited number of tokens in a post often implies a lack of sufficient contextual information. In order to provide contextual information to Microposts, we present and evaluate several graph structures surrounding concepts present in linked knowledge sources (KSs). Traditional TC techniques enrich the content of Microposts with features extracted only from the Microposts content. In contrast our approach relies on the generation of different weighted semantic meta-graphs extracted from linked KSs. We introduce a new semantic graph, called category meta-graph. This novel meta-graph provides a more fine grained categorisation of concepts providing a set of novel semantic features. Our findings show that such category meta-graph features effectively improve the performance of a topic classifier of Microposts. Furthermore our goal is also to understand which semantic feature contributes to the performance of a topic classifier. For this reason we propose an approach for automatic estimation of accuracy loss of a topic classifier on new, unseen Microposts. We introduce and evaluate novel topic similarity measures, which capture the similarity between the KS documents and Microposts at a conceptual level, considering the enriched representation of these documents. Extensive evaluation in the context of Emergency Response (ER) and Violence Detection (VD) revealed that our approach outperforms previous approaches using single KS without linked data and Twitter data only up to 31.4% in terms of F1 measure. Our main findings indicate that the new category graph contains useful information for TC and achieves comparable results to previously used semantic graphs. Furthermore our results also indicate that the accuracy of a topic classifier can be accurately predicted using the enhanced text representation, outperforming previous approaches considering content-based similarity measures.
Stream reasoning and complex event processing in ETALIS

Addressing dynamics and notifications in the Semantic Web realm has recently become an important area of research. Run time data is continuously generated by multiple social networks, sensor networks, various on-line services and so forth. How to get advantage of this continuously arriving data (events) remains a challenge – that is, how to integrate heterogeneous event streams, combine them with background knowledge (e.g., an ontology), and perform event processing and stream reasoning. In this paper we describe ETALIS – a system which enables specification and monitoring of changes in near real time. Changes can be specified as complex event patterns, and ETALIS can detect them in real time. Moreover the system can perform reasoning over streaming events with respect to background knowledge. ETALIS implements two languages for specification of event patterns: ETALIS Language for Events, and Event Processing SPARQL. ETALIS has various applicabilities in capturing changes in semantic networks, broadcasting notifications to interested parties, and creating further changes (based on processing of the temporal, static, or slowly evolving knowledge).
3D synthesis of man-made objects based on fine-grained parts

We present a novel approach for 3D shape synthesis from a collection of existing models. The main idea of our approach is to synthesize shapes by recombining fine-grained parts extracted from the existing models based purely on the objects’ geometry. Thus, unlike most previous works, a key advantage of our method is that it does not require a semantic segmentation, nor part correspondences between the shapes of the input set. Our method uses a template shape to guide the synthesis. After extracting a set of fine-grained segments from the input dataset, we compute the similarity among the segments in the collection and segments of the template using shape descriptors. Next, we use the similarity estimates to select, from the set of fine-grained segments, compatible replacements for each part of the template. By sampling different segments for each part of the template, and by using different templates, our method can synthesize many distinct shapes that have a variety of local fine details. Additionally, we maintain the plausibility of the objects by preserving the general structure of the template. We show with several experiments performed on different datasets that our algorithm can be used for synthesizing a wide variety of man-made objects.
The Design and Implementation of a Mobile Learning Resource

The convergence of mobile communications and handheld computers offers the opportunity to develop technology that will assist individuals and groups to learn anytime, anywhere. We describe the theory-informed design, implementation and evaluation of a handheld learning device. It is intended to support children to capture everyday events such as images, notes and sounds, to relate them to web-based learning resources, to organise these into a visual knowledge map, and to share them with other learners and teachers. A working prototype system, for children aged 9–11, is discussed and evaluated, as an exemplar of personal mobile systems for life-long learning.
SSHCure: A Flow-Based SSH Intrusion Detection System

SSH attacks are a main area of concern for network managers, due to the danger associated with a successful compromise. Detecting these attacks, and possibly compromised victims, is therefore a crucial activity. Most existing network intrusion detection systems designed for this purpose rely on the inspection of individual packets and, hence, do not scale to today’s high-speed networks. To overcome this issue, this paper proposes SSHCure, a flow-based intrusion detection system for SSH attacks. It employs an efficient algorithm for the real-time detection of ongoing attacks and allows identification of compromised attack targets. A prototype implementation of the algorithm, including a graphical user interface, is implemented as a plugin for the popular NfSen monitoring tool. Finally, the detection performance of the system is validated with empirical traffic data.
A survey of approaches for verifying model transformations

As with other software development artifacts, model transformations are not bug-free and so must be systematically verified. Their nature, however, means that transformations require specialist verification techniques. This paper brings together current research on model transformation verification by classifying existing approaches along two dimensions. Firstly, we present a coarse-grained classification based on the technical details of the approach (e.g., testing, theorem proving, model checking). Secondly, we present a finer-grained classification which categorizes approaches according to criteria such as level of formality, transformation language, properties verified. The purpose of the survey is to bring together research in model transformation verification to act as a resource for the community. Furthermore, based on the survey, we identify a number of trends in current and past research on model transformation verification.
A Single-Stage LED Driver Based on Interleaved Buck-boost Circuit and LLC Resonant Converter

A single-stage LED driver based on interleaved buck-boost circuit and LLC resonant converter is proposed. The buck-boost circuit and LLC resonant converter are integrated by sharing switches, which can decrease the system cost and improve system efficiency. The input voltage of the buck-boost circuit is half of the rectified voltage, and two buckboost circuits are formed with the two half-bridge switches and corresponding diodes. The two buckboost circuits work in interleaved mode and the inductor current is in discontinuous conduction mode, both helping to achieve the power factor correction. The half-bridge LLC resonant converter is adopted here, and the soft switching characteristic of the LLC resonant converter is not changed by the switch integration. The primary-side switches still work in zero voltage switching (ZVS) mode, and the secondary diodes still work in zero current switching (ZCS) mode, which both reduce the switching losses and improve the efficiency of the system.
Introduction to WordNet: An On-line Lexical Database

Standard alphabetical procedures for organizing lexical information put together words that are spelled alike and scatter words with similar or related meanings haphazardly through the list. Unfortunately, there is no obvious alternative, no other simple way for lexicographers to keep track of what has been done or for readers to find the word they are looking for. But a frequent objection to this solution is that finding things on an alphabetical list can be tedious and time-consuming. Many people who would like to refer to a dictionary decide not to bother with it because finding the information would interrupt their work and break their train of thought.
UnTran: Recognizing Unseen Activities with Unlabeled Data Using Transfer Learning

The success and impact of activity recognition algorithms largely depends on the availability of the labeled training samples and adaptability of activity recognition models across various domains. In a new environment, the pre-trained activity recognition models face challenges in presence of sensing bias- ness, device heterogeneities, and inherent variabilities in human behaviors and activities. Activity Recognition (AR) system built in one environment does not scale well in another environment, if it has to learn new activities and the annotated activity samples are scarce. Indeed building a new activity recognition model and training the model with large annotated samples often help overcome this challenging problem. However, collecting annotated samples is cost-sensitive and learning activity model at wild is computationally expensive. In this work, we propose an activity recognition framework, UnTran that utilizes source domains' pre-trained autoencoder enabled activity model that transfers two layers of this network to generate a common feature space for both source and target domain activities. We postulate a hybrid AR framework that helps fuse the decisions from a trained model in source domain and two activity models (raw and deep-feature based activity model) in target domain reducing the demand of annotated activity samples to help recognize unseen activities. We evaluated our framework with three real-world data traces consisting of 41 users and 26 activities in total. Our proposed UnTran AR framework achieves ≈ 75% F1 score in recognizing unseen new activities using only 10% labeled activity data in the target domain. UnTran attains ≈ 98% F1 score while recognizing seen activities in presence of only 2-3% of labeled activity samples.
Minimum Complexity Echo State Network

Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the reservoir) and an adaptable readout form the state space. The reservoir is supposed to be sufficiently complex so as to capture a large number of features of the input stream that can be exploited by the reservoir-to-output readout mapping. The field of RC has been growing rapidly with many successful applications. However, RC has been criticized for not being principled enough. Reservoir construction is largely driven by a series of randomized model-building stages, with both researchers and practitioners having to rely on a series of trials and errors. To initialize a systematic study of the field, we concentrate on one of the most popular classes of RC methods, namely echo state network, and ask: What is the minimal complexity of reservoir construction for obtaining competitive models and what is the memory capacity (MC) of such simplified reservoirs? On a number of widely used time series benchmarks of different origin and characteristics, as well as by conducting a theoretical analysis we show that a simple deterministically constructed cycle reservoir is comparable to the standard echo state network methodology. The (short-term) of linear cyclic reservoirs can be made arbitrarily close to the proved optimal value.
New folded configuration of rectangular waveguide filters with asymmetrical transmission zeros

This paper presents a novel filter topology for the implementation of asymmetric responses with transmission zeros (TZs) in rectangular waveguide technology. It is based on a compact folded E-plane arrangement where adjacent resonators are capacitively coupled through rectangular slots, and non-adjacent resonators are coupled through simple inductive windows. The new folded configuration allows the introduction of transmission zeros above the passband, which can be easily controlled. High order filters can be designed by cascading an arbitrary number of resonators in a folded layout. Components based on this novel configuration are amenable to simple manufacturing processes and can be used in high-power environments. A triplexer containing filters implemented with the proposed topology has been designed. Measurements of a manufactured prototype are included to validate the use of this topology in practical applications.
Reranking and Self-Training for Parser Adaptation

Statistical parsers trained and tested on the Penn Wall Street Journal (WSJ) treebank have shown vast improvements over the last 10 years. Much of this improvement, however, is based upon an ever-increasing number of features to be trained on (typically) the WSJ treebank data. This has led to concern that such parsers may be too finely tuned to this corpus at the expense of portability to other genres. Such worries have merit. The standard “Charniak parser” checks in at a labeled precisionrecall f -measure of 89.7% on the Penn WSJ test set, but only 82.9% on the test set from the Brown treebank corpus. This paper should allay these fears. In particular, we show that the reranking parser described in Charniak and Johnson (2005) improves performance of the parser on Brown to 85.2%. Furthermore, use of the self-training techniques described in (McClosky et al., 2006) raise this to 87.8% (an error reduction of 28%) again without any use of labeled Brown data. This is remarkable since training the parser and reranker on labeled Brown data achieves only 88.4%.
Online learning from imbalanced data streams

Learning from imbalanced data has conventionally been conducted on stationary data sets. Recently, there have been several methods proposed for mining imbalanced data streams, in which training data is read in consecutive data chunks. Each data chunk is considered as a conventional imbalanced data set, making it easy to apply sampling methods to balance data chunks. However, one drawback of chunk-based learning methods is that the update of classification models is delayed until a full data chunk is received. Therefore, this paper proposes a new method for online learning from imbalanced data streams, which uses naive Bayes as the base learner. To deal with the problem of class imbalance, a new training instance from the minority class is always involved in learning, but one from the majority class is only used with a small probability. In effect, this method corresponds to an under-sampling technique on imbalanced data streams. We show the effectiveness of the proposed online learning method on ten UCI data sets of various domains. Problems in the performance of naive Bayes on imbalanced data sets are also discussed.
Evaluation of games for teaching computer science

Well-designed educational games (both online and offline) can be a valuable way to engage students with a topic. However, games can also be a time-consuming distraction, so it is useful to be able to identify which are suitable. This paper provides guidelines for evaluating games, and applies them to identify promising games. We begin by defining what is meant by a game, ruling out simple animations or quizzes, and focusing on a more playful approach to education. Based on this definition, we have identified games that are available for teaching topics in computer science, and classified them. We have developed criteria for evaluating games based on existing research on educational games, combined with educational theory and considering them in the context of CS. The criteria developed cover the topics taught, how easy it is to install and run, how engaging the game is, and how much time students might invest to use the game. We find that although there are a number of worth-while games in the field of CS and most are free, the coverage of topics is very patchy, with most focused on programming concepts and binary numbers.
The anatomy of a large-scale social search engine

We present Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, email, web input, text message, or voice. Aardvark then routes the question to the person in the user's extended social network most likely to be able to answer that question. As compared to a traditional web search engine, where the challenge lies in finding the right document to satisfy a user's information need, the challenge in a social search engine like Aardvark lies in finding the right person to satisfy a user's information need. Further, while trust in a traditional search engine is based on authority, in a social search engine like Aardvark, trust is based on intimacy. We describe how these considerations inform the architecture, algorithms, and user interface of Aardvark, and how they are reflected in the behavior of Aardvark users.
An Introduction to Recommendation Systems in Software Engineering

Software engineering is a knowledge-intensive activity that presents many information navigation challenges. Information spaces in software engineering include the source code and change history of the software, discussion lists and forums, issue databases, component technologies and their learning resources, and the development environment. The technical nature, size, and dynamicity of these information spaces motivate the development of a special class of applications to support developers: recommendation systems in software engineering (RSSEs), which are software applications that provide information items estimated to be valuable for a software engineering task in a given context. In this introduction, we review the characteristics of information spaces in software engineering, describe the unique aspects of RSSEs, present an overview of the issues and considerations involved in creating, evaluating, and using RSSEs, and present a general outlook on the current state of research and development in the field of recommendation systems for highly technical domains.
Transforming data to satisfy privacy constraints

Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can also contain other kinds of personal information (e.g., date of birth, zip code, gender) that are potentially identifying when linked with other available data sets. Data are often shared for business or legal reasons. This paper addresses the important issue of preserving the anonymity of the individuals or entities during the data dissemination process. We explore preserving the anonymity by the use of generalizations and suppressions on the potentially identifying portions of the data. We extend earlier works in this area along various dimensions. First, satisfying privacy constraints is considered in conjunction with the usage for the data being disseminated. This allows us to optimize the process of preserving privacy for the specified usage. In particular, we investigate the privacy transformation in the context of data mining applications like building classification and regression models. Second, our work improves on previous approaches by allowing more flexible generalizations for the data. Lastly, this is combined with a more thorough exploration of the solution space using the genetic algorithm framework. These extensions allow us to transform the data so that they are more useful for their intended purpose while satisfying the privacy constraints.
RFID tags for in-situ tire monitoring

A broadband and flexible UHF RFID tag designed to overcome the challenges of placement in tires is presented. The tag antenna design is discussed and its performance is evaluated through read-range, threshold and stretch tests. Next a smart sensing and logging capable EPC Class-1 Gen-2 compliant UHF RFID prototype tag board is presented to demonstrate the feasibility of RFID sensors in tires.
Analyzing multiple configurations of a C program

Preprocessor conditionals are heavily used in C programs since they allow the source code to be configured for different platforms or capabilities. However, preprocessor conditionals, as well as other preprocessor directives, are not part of the C language. They need to be evaluated and removed, and so a single configuration selected, before parsing can take place. Most analysis and program understanding tools run on this preprocessed version of the code so their results are based on a single configuration. This paper describes the approach of CRefactory, a refactoring tool for C programs. A refactoring tool cannot consider only a single configuration: changing the code for one configuration may break the rest of the code. CRefactory analyses the program for all possible configurations simultaneously. CRefactory also preserves preprocessor directives and integrates them in the internal representations. The paper also presents metrics from two case studies to show that CRefactory's program representation is practical.
TED Talks as an Emergent Genre

In her article "TED Talks as an Emergent Genre" Julia Ludewig analyzes TED talks—short, informational, and entertaining presentations that are given during TED conferences in North America and abroad—as a hybrid and emerging genre. Based on a qualitative interpretation of 14 such talks, she offers a list of recurring thematic, argumentative, and rhetorical features, which she aligns with three parent genres—the sales pitch, the memoir, and the academic lecture. Comparing recent versions of TED talks with three older talks from the 1980s and 1990s, she suggests an historical trajectory, which emphasizes the professional performance character of recent talks and their popularization through highly sophisticated and sharable video footage. Julia Ludewig, "TED Talks as an Emergent Genre" page 2 of 9 CLCWeb: Comparative Literature and Culture 19.1 (2017): <http://docs.lib.purdue.edu/clcweb/vol19/iss1/2>