nils-herrmann/clean_scirepeval huggingface dataset:
Material property of on-metal magnetic sheet attached on NFC/HF-RFID antenna and research of its proper pattern and size on

When a payment system with NFC/HF-RFID is installed in smart-phone, their communication with 13.56MHz is blocked by such metal as battery, coil and PCB. To solve this problem, magnetic sheet with high permeability is set between NFC/HF-RFID antenna and near-by metal. So far thin compound magnetic sheet or thin sintered ferrite has been used. In order to make thickness of these materials thinner, we propose amorphous magnetic sheet. Besides this amorphous magnetic sheet causes to increase the transmission effect.
Treatment of molluscum contagiosum with cantharidin: a practical approach.

Molluscum contagiosum is very common. In this article we discuss the use of cantharidin as a treatment option for molluscum contagiosum and give detailed information about distribution sources, how to apply it, and caveats regarding its use.Molluscum contagiosum is a common viral disease of childhood caused by a poxvirus, which presents with small, firm, dome-shaped, umbilicated papules. It is generally benign and self-limited, with spontaneous resolution within 6 months to several years. Watchful waiting can often be an appropriate management strategy; however, some patients either desire or require treatment. Reasons for actively treating molluscum contagiosum may include alleviation of discomfort and itching (particularly in patients where an eczematous eruption - the so-called "molluscum eczema" - is seen in association) or in patients with ongoing atopic dermatitis where more lesions are likely to be present. Other reasons for treatment include limitation of spread to other areas and people, prevention of scarring and superinfection, and elimination of the social stigma of visible lesions. No one treatment is uniformly effective.Treatment options include destructive therapies (curettage, cryotherapy, cantharidin, and keratolytics, among others), immunomodulators (imiquimod, cimetidine, and Candida antigen), and antivirals (cidofovir). In this article we discuss and describe our first-line treatment approach for those molluscum needing treatment - cantharidin.
An active battery cell balancing topology without using external energy storage elements

Cell balancing circuits are important to extent life-cycle of batteries and to extract maximum power from the batteries. A lot of power electronics topology has been tried for cell balancing in the battery packages. Active cell balancing topologies transfer energy from the cells showing higher performance to the cells showing lower performance to balance voltages across the cells of the battery using energy storage elements like combination of inductor-capacitor or transformer-capacitor or switched capacitor or switched inductor. In this study an active balancing topology without using any energy storage element is proposed. The idea is similar to the switched capacitor topology in which a capacitor or capacitor banks is switched across the cells of battery to balance the voltages. Since a basic battery cell model includes capacitance because of capacitive effect of the cell, this capacitive effect can be utilized in cell balancing. Hence the equalizer capacitors in switched capacitor topology can be eliminated and the cells of battery can be switched with each other. This allows faster energy transfer and hence results in quick equalization. The proposed topology removes the need of extra energy storage elements like capacitors which frequently fails in power electronic circuits, reduces the losses inserted by extra energy storage elements and cost and volume of the circuits and simplifies control algorithm. The proposed balancing circuit can be implemented according to the application requirement. The proposed topology is simulated in MATLAB/Simulink environment and showed better results in terms of balancing speed in comparison to switched capacitor topologies.
Mining communities in networks: a solution for consistency and its evaluation

Online social networks pose significant challenges to computer scientists, physicists, and sociologists alike, for their massive size, fast evolution, and uncharted potential for social computing. One particular problem that has interested us is community identification. Many algorithms based on various metrics have been proposed for communities in networks [18, 24], but a few algorithms scale to very large networks. Three recent community identification algorithms, namely CNM [16], Wakita [59], and Louvain , stand out for their scalability to a few millions of nodes. All of them use modularity as the metric of optimization. However, all three algorithms produce inconsistent communities every time the ordering of nodes to the algorithms changes.
 We propose two quantitative metrics to represent the level of consistency across multiple runs of an algorithm: pairwise membership probability and consistency. Based on these two metrics, we propose a solution that improves the consistency without compromising the modularity. We demonstrate that our solution to use pairwise membership probabilities as link weights generates consistent communities within six or fewer cycles for most networks. However, our iterative, pairwise membership reinforcing approach does not deliver convergence for Flickr, Orkut, and Cyworld networks as well for the rest of the networks. Our approach is empirically driven and is yet to be shown to produce consistent output analytically. We leave further investigation into the topological structure and its impact on the consistency as future work.
 In order to evaluate the quality of clustering, we have looked at 3 of the 48 communities identified in the AS graph. Surprisingly, all have either hierarchical, geographical, or topological interpretations to their groupings. Our preliminary evaluation of the quality of communities is promising. We plan to conduct more thorough evaluation of the communities and study network structures and their evolutions using our approach.
The continuing evolution of integration in manufacturing automation

Since the wide adoption of Internet technologies in manufacturing automation, integration has become one of the most advertised trends in the field. The concept of integration in automation is by no means new. It was first formulated in the mid 1970s with the computer-integrated manufacturing (CIM) idea. Its aim was to integrate several already existing islands of computer-assisted manufacturing subsystems to a comprehensive and transparent, enterprise-wide information processing system. This article sketches the roots as well as the historical evolution of the integration idea and describes the pieces it takes to complete the picture of integration with its horizontal, vertical, and temporal aspects. Emphasis is put on building blocks like networks and their interconnections, middleware technologies, and application software frameworks. Standardization issues are addressed as well as future challenges in the field.
Detecting and discriminating behavioural anomalies

This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex temporal dynamics and correlations among multiple objects’ behaviours. Specifically, we decompose a complex behaviour pattern according to its temporal characteristics or spatial-temporal visual contexts. The decomposed behaviour is then modelled using a cascade of Dynamic Bayesian Networks (CasDBNs). In contrast to existing standalone models, the proposed behaviour decomposition and cascade modelling offers distinct advantage in simplicity for complex behaviour modelling. Importantly, the decomposition and cascade structure map naturally to the structure of complex behaviour, allowing for a more effective detection of subtle anomalies in surveillance videos. Comparative experiments using both indoor and outdoor data are carried out to demonstrate that, in addition to the novel capability of discriminating different types of anomalies, the proposed framework outperforms existing methods in detecting durational anomalies in complex behaviours and subtle anomalies that are difficult to detect when objects are viewed in isolation. & 2010 Elsevier Ltd. All rights reserved.
Latent Semantic Indexing (LSI): TREC-3 Report

We used LSI for both TREC-3 routing and adhoc tasks. For the routing tasks an LSI space was constructed using the training documents. We compared profiles constructed using just the topic words (no training) with profiles constructed using the average of relevant documents (no use of the topic words). Not surprisingly, the centroid of the relevant documents was 30% better than the topic words. This simple feedback method was quite good compared to the routing performance of other systems. Various combinations of information from the topic words and relevant documents provide small additional improvements in performance. For the adhoc task we compared LSI to keyword vector matching (i.e. using no dimension reduction). Small advantages were obtained for LSI even with the long TREC topic statements.
Polarity Lexicon Building: to what Extent Is the Manual Effort Worth?

Polarity lexicons are a basic resource for analyzing the sentiments and opinions expressed in texts in an automated way. This paper explores three methods to construct polarity lexicons: translating existing lexicons from other languages, extracting polarity lexicons from corpora, and annotating sentiments Lexical Knowledge Bases. Each of these methods require a different degree of human effort. We evaluate how much manual effort is needed and to what extent that effort pays in terms of performance improvement. Experiment setup includes generating lexicons for Basque, and evaluating them against gold standard datasets in different domains. Results show that extracting polarity lexicons from corpora is the best solution for achieving a good performance with reasonable human effort.
Tweeting 'when online is off'? Opportunistically creating mobile ad-hoc networks in response to disrupted infrastructure

In this paper, we present a system that enables people to post and receive tweets despite disruptions of existing network infrastructure. Our system opportunistically deploys mobile ad hoc networks (MANETs) based on Wi-Fi in which people can communicate with each other in a peer-to-peer fashion. A MANET per se constitutes an isolated island, but as people carry devices around that can join other MANETs, eventually people can transport previously collected data to the online world. Compared to other systems that aim to enable communication in crisis, our system differs in two ways: it does not rely on existing network infrastructure, and it exploits established protocols and standards allowing it to run on off-the-shelf, commercially available smartphones. We evaluated our prototype with a group of students and practitioners. Overall, we received positive feedback on the potential of our technology, but also were pointed to limitations requiring future work.
Web science and human-computer interaction: when disciplines collide

Web Science and Human-Computer Interaction (HCI) are interdisciplinary arenas concerned with the intersection of people and technology. After introducing the two disciplines we discuss overlaps and notable differences between them, covering subject matter, scope and methodology. Given the longer history of HCI, we identify and discuss some potential lessons that the Web Science community may be able to take from this field. These concern: the division between interpretivist and positivist approaches; methods and methodology; evaluation; and design focus and methods. In summary, this paper clarifies the relationship between the communities, signposting complementary aspects and ways in which they might collaborate in future.
Large Scale Fashion Search System with Deep Learning and Quantization Indexing

Recently, the problems of clothes recognition and clothing item retrieval have attracted a number of researchers, due to its practical and potential values to real-world applications. The main task is to automatically find relevant clothing items given a single user-provided image without any extra metadata. Most existing systems mainly focus on clothes classification, attribute prediction, and matching the exact in-shop items with the query image. However, these systems do not mention the problem of latency period or the amount of time that users have to wait when they query an image until the query results are retrieved. In this paper, we propose a fashion search system that automatically recognizes clothes and suggests multiple similar clothing items with an impressively low latency. Through extensive experiments, it is verified that our system outperforms almost existing systems in term of clothing item retrieval time.
Design and use paradigms for Gazebo, an open-source multi-robot simulator

Simulators have played a critical role in robotics research as tools for quick and efficient testing of new concepts, strategies, and algorithms. To date, most simulators have been restricted to 2D worlds, and few have matured to the point where they are both highly capable and easily adaptable. Gazebo is designed to fill this niche by creating a 3D dynamic multi-robot environment capable of recreating the complex worlds that would be encountered by the next generation of mobile robots. Its open source status, fine grained control, and high fidelity place Gazebo in a unique position to become more than just a stepping stone between the drawing board and real hardware: data visualization, simulation of remote environments, and even reverse engineering of blackbox systems are all possible applications. Gazebo is developed in cooperation with the Player and Stage projects (Gerkey, B. P., et al., July 2003), (Gerkey, B. P., et al., May 2001), (Vaughan, R. T., et al., Oct. 2003), and is available from http://playerstage.sourceforge.net/gazebo/ gazebo.html.
Voice-based assessments of trustworthiness, competence, and warmth in blind and sighted adults

The study of voice perception in congenitally blind individuals allows researchers rare insight into how a lifetime of visual deprivation affects the development of voice perception. Previous studies have suggested that blind adults outperform their sighted counterparts in low-level auditory tasks testing spatial localization and pitch discrimination, as well as in verbal speech processing; however, blind persons generally show no advantage in nonverbal voice recognition or discrimination tasks. The present study is the first to examine whether visual experience influences the development of social stereotypes that are formed on the basis of nonverbal vocal characteristics (i.e., voice pitch). Groups of 27 congenitally or early-blind adults and 23 sighted controls assessed the trustworthiness, competence, and warmth of men and women speaking a series of vowels, whose voice pitches had been experimentally raised or lowered. Blind and sighted listeners judged both men's and women's voices with lowered pitch as being more competent and trustworthy than voices with raised pitch. In contrast, raised-pitch voices were judged as being warmer than were lowered-pitch voices, but only for women's voices. Crucially, blind and sighted persons did not differ in their voice-based assessments of competence or warmth, or in their certainty of these assessments, whereas the association between low pitch and trustworthiness in women's voices was weaker among blind than sighted participants. This latter result suggests that blind persons may rely less heavily on nonverbal cues to trustworthiness compared to sighted persons. Ultimately, our findings suggest that robust perceptual associations that systematically link voice pitch to the social and personal dimensions of a speaker can develop without visual input.
A systematic mapping review of usability evaluation methods for educational applications on mobile devices

Mobile devices are used more and more frequently by society. In recent years has increased the sale of those devices and therefore in the applications provided to the users. The educational apps are one of the most important, because they offer more significant opportunities for development and growth to society, developing in various areas. In this context, usability becomes a key factor for its adoption.The objective of this paper is to identify which are the usability methods that are used in mobile educational applications by subject area. Therefore, a systematic mapping review was conducted. A total of 1503 studies were identified, and only 174 were selected for this review. The results show that the user test is the most widely used usability evaluation method in mobile educational applications, and the preferred learning topics are foreign languages and information and communication technologies. These results can guide experts and developers to construct usable mobile educational apps by selecting the usability evaluation methods according to the learning topic.
Finding scientific topics.

A first step in identifying the content of a document is determining which topics that document addresses. We describe a generative model for documents, introduced by Blei, Ng, and Jordan [Blei, D. M., Ng, A. Y. & Jordan, M. I. (2003) J. Machine Learn. ], in which each document is generated by choosing a distribution over topics and then choosing each word in the document from a topic selected according to this distribution. We then present a Markov chain Monte Carlo algorithm for inference in this model. We use this algorithm to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics. We show that the extracted topics capture meaningful structure in the data, consistent with the class designations provided by the authors of the articles, and outline further applications of this analysis, including identifying "hot topics" by examining temporal dynamics and tagging abstracts to illustrate semantic content.
Reducibility Among Combinatorial Problems

A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple encodings from such domains into the set of words over a finite alphabet these problems can be converted into language recognition problems, and we can inquire into their computational complexity. It is reasonable to consider such a problem satisfactorily solved when an algorithm for its solution is found which terminates within a number of steps bounded by a polynomial in the length of the input. Many problems with wide applicability – e.g., set cover, knapsack, hitting set, max cut, and satisfiability – lack a polynomial algorithm for solving them, but also lack a proof that no such polynomial algorithm exists. Hence, they remain “open problems.” This paper references the recent work, “On the Reducibility of Combinatorial Problems” . BODY A large class of open problems are mutually convertible via poly-time reductions. Hence, either all can be solved in poly-time, or none can.
An Empirical Investigation into Programming Language Syntax

Recent studies in the literature have shown that syntax remains a significant barrier to novice computer science students in the field. While this syntax barrier is known to exist, whether and how it varies across programming languages has not been carefully investigated. For this article, we conducted four empirical studies on programming language syntax as part of a larger analysis into the, so called, programming language wars. We first present two surveys conducted with students on the intuitiveness of syntax, which we used to garner formative clues on what words and symbols might be easy for novices to understand. We followed up with two studies on the accuracy rates of novices using a total of six programming languages: Ruby, Java, Perl, Python, Randomo, and Quorum. Randomo was designed by randomly choosing some keywords from the ASCII table (a metaphorical placebo). To our surprise, we found that languages using a more traditional C-style syntax (both Perl and Java) did not afford accuracy rates significantly higher than a language with randomly generated keywords, but that languages which deviate (Quorum, Python, and Ruby) did. These results, including the specifics of syntax that are particularly problematic for novices, may help teachers of introductory programming courses in choosing appropriate first languages and in helping students to overcome the challenges they face with syntax.
Why Your Encrypted Database Is Not Secure

Encrypted databases, a popular approach to protecting data from compromised database management systems (DBMS's), use abstract threat models that capture neither realistic databases, nor realistic attack scenarios. In particular, the "snapshot attacker" model used to support the security claims for many encrypted databases does not reflect the information about past queries available in any snapshot attack on an actual DBMS.
 We demonstrate how this gap between theory and reality causes encrypted databases to fail to achieve their "provable security" guarantees.
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time

The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy. To achieve this result, we modify the classic Bron–Kerbosch algorithm and show that it runs in time O(dn3d/3). We also provide matching upper and lower bounds showing that the largest possible number of maximal cliques in an n-vertex graph with degeneracy d (when d is a multiple of 3 and n≥ d +3) is (n−d)3d/3. Therefore, our algorithm matches the Θ(d(n−d)3d/3) worst-case output size of the problem whenever n−d = Ω(n).
The expansion of Google Scholar versus Web of Science: a longitudinal study

Web of Science (WoS) and Google Scholar (GS) are prominent citation services with distinct indexing mechanisms. Comprehensive knowledge about the growth patterns of these two citation services is lacking. We analyzed the development of citation counts in WoS and GS for two classic articles and 56 articles from diverse research fields, making a distinction between retroactive growth (i.e., the relative difference between citation counts up to mid-2005 measured in mid-2005 and citation counts up to mid-2005 measured in April 2013) and actual growth (i.e., the relative difference between citation counts up to mid-2005 measured in April 2013 and citation counts up to April 2013 measured in April 2013). One of the classic articles was used for a citation-by-citation analysis. Results showed that GS has substantially grown in a retroactive manner (median of 170 % across articles), especially for articles that initially had low citations counts in GS as compared to WoS. Retroactive growth of WoS was small, with a median of 2 % across articles. Actual growth percentages were moderately higher for GS than for WoS (medians of 54 vs. 41 %). The citation-by-citation analysis showed that the percentage of citations being unique in WoS was lower for more recent citations (6.8 % for citations from 1995 and later vs. 41 % for citations from before 1995), whereas the opposite was noted for GS (57 vs. 33 %). It is concluded that, since its inception, GS has shown substantial expansion, and that the majority of recent works indexed in WoS are now also retrievable via GS. A discussion is provided on quantity versus quality of citations, threats for WoS, weaknesses of GS, and implications for literature research and research evaluation.