nils-herrmann/clean_scirepeval huggingface dataset:
Design and Field Test of a WSN Platform Prototype for Long-Term Environmental Monitoring

Long-term wildfire monitoring using distributed in situ temperature sensors is an accurate, yet demanding environmental monitoring application, which requires long-life, low-maintenance, low-cost sensors and a simple, fast, error-proof deployment procedure. We present in this paper the most important design considerations and optimizations of all elements of a low-cost WSN platform prototype for long-term, low-maintenance pervasive wildfire monitoring, its preparation for a nearly three-month field test, the analysis of the causes of failure during the test and the lessons learned for platform improvement. The main components of the total cost of the platform (nodes, deployment and maintenance) are carefully analyzed and optimized for this application. The gateways are designed to operate with resources that are generally used for sensor nodes, while the requirements and cost of the sensor nodes are significantly lower. We define and test in simulation and in the field experiment a simple, but effective communication protocol for this application. It helps to lower the cost of the nodes and field deployment procedure, while extending the theoretical lifetime of the sensor nodes to over 16 years on a single 1 Ah lithium battery.
Deep Face Recognition: A Survey

Deep learning applies multiple processing layers to learn representations of data with multiple levels of feature extraction. This emerging technique has reshaped the research landscape of face recognition (FR) since 2014, launched by the breakthroughs of Deepface method. Since then, deep FR technique, which leverages hierarchical architecture to stitch together pixels into invariant face representation, has dramatically improved the state-of-the-art performance and fostered successful real-world applications. In this survey, we provide a comprehensive review of the recent developments on deep FR, covering both broad topics on algorithm designs, databases and protocols, and application scenes. First, we summarize different network architectures and loss functions proposed in the rapid evolution of the deep FR methods. Second, the related face processing methods are categorized into two classes: “one-to-many augmentation” and “many-to-one normalization”. Then, we summarize and compare the commonly used databases for both model training and evaluation. Third, we review miscellaneous scenes in deep FR, such as cross-factor, heterogenous, multiplemedia and industry scenes. Finally, the technical challenges of current methods and several promising directions on biometric security, fusion, and privacy are highlighted.
Autonomous NAT Traversal

Traditional NAT traversal methods require the help of a third party for signalling. This paper investigates a new autonomous method for establishing connections to peers behind NAT. The proposed method for autonomous NAT traversal uses fake ICMP messages to initially contact the NATed peer. This paper presents how the method is supposed to work in theory, discusses some possible variations, introduces various concrete implementations of the proposed approach and evaluates empirical results of a measurement study designed to evaluate the efficacy of the idea in practice.
Coordinating multi-agent reinforcement learning with limited communication

Coordinated multi-agent reinforcement learning (MARL) provides a promising approach to scaling learning in large cooperative multiagent systems. Distributed constraint optimization (DCOP) techniques have been used to coordinate action selection among agents during both the learning phase and the policy execution phase (if learning is off-line) to ensure good overall system performance. However, running DCOP algorithms for each action selection through the whole system results in significant communication among agents, which is not practical for most applications with limited communication bandwidth. In this paper, we develop a learning approach that generalizes previous coordinated MARL approaches that use DCOP algorithms and enables MARL to be conducted over a spectrum from independent learning (without communication) to fully coordinated learning depending on agents’ communication bandwidth. Our approach defines an interaction measure that allows agents to dynamically identify their beneficial coordination set (i.e., whom to coordinate with) in different situations and to trade off its performance and communication cost. By limiting their coordination set, agents dynamically decompose the coordination network in a distributed way, resulting in dramatically reduced communication for DCOP algorithms without significantly affecting overall learning performance. Essentially, our learning approach conducts co-adaptation of agents’ policy learning and coordination set identification, which outperforms approaches that sequence them.
Photo-Realistic Talking-Heads from Image Samples

This paper describes a system for creating a photo-realistic model of the human head that can be animated and lip-synched from phonetic transcripts of text. Combined with a state-of-the-art text-to-speech synthesizer (TTS), it generates video animations of talking heads that closely resemble real people. To obtain a naturally looking head, we choose a “data-driven” approach. We record a talking person and apply image recognition to extract automatically bitmaps of facial parts. These bitmaps are normalized and parameterized before being entered into a database. For synthesis, the TTS provides the audio track, as well as the phonetic transcript from which trajectories in the space of parameterized bitmaps are computed for all facial parts. Sampling these trajectories and retrieving the corresponding bitmaps from the database produces animated facial parts. These facial parts are then projected and blended onto an image of the whole head using its pose information. This talking head model can produce new, never recorded speech of the person who was originally recorded. Talking-head animations of this type are useful as a front-end for agents and avatars in multimedia applications such as virtual operators, virtual announcers, help desks, educational, and expert systems.
Designing Neural Networks Using Genetic Algorithms with Graph Generation System

We present a new method of designing neural networks using the genetic algorithm. Recently there have been several reports claiming attempts to design neural networks using genetic algorithms were successful. However, these methods have a problem in scalability, i.e., the convergence characteristic degrades significantly as the size of the network increases. This is because these methods employ direct mapp ing of chromosomes into network connectivities. As an alternative approach, we propose a graph grammatical encoding that will encode graph generation grammar to the chromosome so that it generates more regular connectivity patterns with shorter chromosome length. Experimental results support that our new scheme provides magnitude of speedup in convergence of neural network design and exhibits desirable scaling property.
Relevance Feature Discovery for Text Mining

It is a big challenge to guarantee the quality of discovered relevance features in text documents for describing user preferences because of large scale terms and data patterns. Most existing popular text mining and classification methods have adopted term-based approaches. However, they have all suffered from the problems of polysemy and synonymy. Over the years, there has been often held the hypothesis that pattern-based methods should perform better than term-based ones in describing user preferences; yet, how to effectively use large scale patterns remains a hard problem in text mining. To make a breakthrough in this challenging issue, this paper presents an innovative model for relevance feature discovery. It discovers both positive and negative patterns in text documents as higher level features and deploys them over low-level features (terms). It also classifies terms into categories and updates term weights based on their specificity and their distributions in patterns. Substantial experiments using this model on RCV1, TREC topics and Reuters-21578 show that the proposed model significantly outperforms both the state-of-the-art term-based methods and the pattern based methods.
A knowledge-based table recognition method for Chinese bank statement images

Automatic processing of large volume scanned Chinese bank statements is a urgent demand recently. Conventional methods can not well handle the following challenges of this problem: various layout styles, noises, and especially requirement of fast speed for large Chinese character set. This paper proposes a knowledge based table recognition method to meet fast speed requirement with good accuracy. Two kinds of knowledge are utilized to accelerate the identification of digit columns and the cell recognition: i) geometric knowledge about column alignment and quasi equal digit width, and ii) semantic knowledge about prior format based on the results from an optical character recognition (OCR) engine of digits. Experimental results on a real dataset show the effectiveness of our method.
Fuzzy Logic Based-Map Matching Algorithm for Vehicle Navigation System in Urban Canyons

With the rapid progress in the development of wireless technology, Global Positioning System (GPS) based vehicle navigation systems are being widely deployed in automobiles to serve the location-based needs of users and for efficient traffic management. An essential process in vehicle navigation is to map match the position obtained from GPS (or/and other sensors) on a road network map. This process of map matching in turn helps in mitigating errors from navigation solution. GPS based vehicle navigation systems have difficulties in tracking vehicles in urban canyons due to poor satellite availability. High Sensitivity GPS (HS GPS) receivers can alleviate this problem by acquiring and tracking weak signals (and increasing the availability), but at the cost of high measurement noise and errors due to multipath and cross correlation. Position and velocity results in such conditions are typically biased and have unknown distributions. Thus filtering and other statistical methods are difficult to implement. Soft computing has replaced classical computing on many fronts where uncertainties are difficult to model. Fuzzy logic, based on fuzzy reasoning concepts, is one of the most widely used soft computational methods. In many circumstances, it can take noisy, imprecise input, to yield crisp (i.e. numerically accurate) output. Fuzzy logic can be applied effectively to map match the output from a HS GPS receiver in urban canyons because of its inherent tolerance to imprecise inputs. This paper describes a map matching algorithm based on fuzzy logic. The input of the system comes from a SiRF HS XTrac GPS receiver and a low cost gyro (Murata ENV-05G). The results show an improvement in tracking the vehicle in urban canyon conditions.
Cognitive Context Models and Discourse

1. Mental models Since the early 1980s, the notion of mental model has been quite successful in cognitive psychology in general, and in the theory of text processing in particu-Such models have been conceptualized as representations in episodic memory of situations, acts or events spoken or thought about, observed or participated in by human actors, that is of experiences (Ehrlich, Tardieu & Cavazza 1993). In the theory of text processing, such (situation or event) models played a crucial role in establishing the necessary referential basis for the processing of anaphora and other phenomena of coherence (Albrecht & O Brien 1993). They further explained, among many other things, why text recall does not seem to be based on semantic representations of texts, but rather on the mental model construed or updated of the event the text is about (Bower & Morrow 1990). Conversely, mental models also play a role in the much neglected theory of discourse production, viz., as the mental point of departure of all text and talk, from which relevant information may be selected for the strategic construction of their global and local semantic structures. Many experiments have confirmed these hypotheses, and have shown at text comprehension and recall essentially involve a strategic manipulation of models, for instance by matching text information with structures of the The notion of mental space is sometimes also used in formal linguistics as a construct that has similar functions as our notion of a mental model (Faucormier 1985).
Multidimensional materials and device architectures for future hybrid energy storage

A chieving a secure, sustainable energy future is one of the greatest scientific and societal challenges of our time. Electrical energy storage (EES) plays a vital role in daily life because of our dependence on numerous electronic devices that require mobility. There is also a need for large-scale and inexpensive EES for grid and transportation applications. Electricity generated from renewable sources, such as solar and wind, is critical to meeting future energy demands. However, these intermittent renewable sources require efficient EES devices. Rechargeable (secondary) batteries, which use electrochemical reactions for energy storage, are commonly used for EES at small and medium scales1. Lithium-ion batteries currently dominate the market for electronic devices, and are rapidly penetrating the transportation segment and entering into grid scale storage. A multitude of other batteries are available commercially, including well known lead-acid batteries. However, modern technologies require much larger amounts of energy to be stored with a high energy density, quickly and at low cost. Electrochemical capacitors (ECs) can be charged in minutes if not seconds, ensuring fast energy collection, but they store 1–2 orders of magnitude less energy compared with batteries2. Thus, the development of new EES systems is needed in order for large-scale solarand wind-based electrical generation to be practical3,4. The time it takes to charge current batteries is long compared with what it takes to fuel our gasoline vehicles. Therefore, substantial improvements in the energy and power densities of EES systems are also needed to realize the electrification of transportation. Moreover, with the continued miniaturization of electronics, penetration of wireless devices into our homes and clothes, wide use of sensor networks and widely anticipated ‘Internet of Things’, there is an intensive effort to develop miniature, but powerful EES devices. Current thin-film batteries have a very small amount of active material relative to the packaging and other passive components. EES that have a much smaller content of DOI: 10.1038/ncomms12647 OPEN
Supernumerary nostril: a case report

Supernumerary nostril is a congenital anomaly that contains additional nostril with or without accessory cartilage. These rare congenital nasal deformities result from embryological defects. Since 1906, Lindsay ( 1906) has published the first research of bilateral supernumerary nostrils, and only 34 cases have been reported so far in the English literature.



A 1-year-old female baby was brought to our department group for the treatment of an accessory opening above the left nostril which had been presented since her birth. Medical history was non-specific and her birth was normal. The size of a supernumerary nostril was about 0.2 cm diameter and connected to the left nostril. The right one was normal. Minimal procedure was operated for the anomaly. After 1 year, rhinoplasty was performed for the nostril asymmetry.



At 1 year follow-up, the functional and cosmetic result was satisfactory. In this case, it is important that we have early preoperative diagnosis. Also, it is desirable that we should perform a corrective surgery as soon as possible for the patient's psychosocial growth.
Machine Learning, 1{34 () Text Classiication from Labeled and Unlabeled Documents Using Em

This paper shows that the accuracy of learned text classiiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. This is important because in many text classiication problems obtaining training labels is expensive, while large quantities of unlabeled documents are readily available. We introduce an algorithm for learning from labeled and unlabeled documents based on the combination of Expectation-Maximization (EM) and a naive Bayes classiier. The algorithm rst trains a classiier using the available labeled documents, and probabilistically labels the unlabeled documents. It then trains a new classiier using the labels for all the documents, and iterates to convergence. This basic EM procedure works well when the data conform to the generative assumptions of the model. However these assumptions are often violated in practice, and poor performance can result. We present two extensions to the algorithm that improve classiication accuracy under these conditions: (1) a weighting factor to modulate the contribution of the unlabeled data, and (2) the use of multiple mixture components per class. Experimental results, obtained using text from three diierent real-world tasks, show that the use of unlabeled data reduces classiication error by up to 30%.
A unified approach to statistical tomography using coordinate descent optimization

Over the past years there has been considerable interest in statistically optimal reconstruction of cross-sectional images from tomographic data. In particular, a variety of such algorithms have been proposed for maximum a posteriori (MAP) reconstruction from emission tomographic data. While MAP estimation requires the solution of an optimization problem, most existing reconstruction algorithms take an indirect approach based on the expectation maximization (EM) algorithm. We propose a new approach to statistically optimal image reconstruction based on direct optimization of the MAP criterion. The key to this direct optimization approach is greedy pixel-wise computations known as iterative coordinate decent (ICD). We propose a novel method for computing the ICD updates, which we call ICD/Newton-Raphson. We show that ICD/Newton-Raphson requires approximately the same amount of computation per iteration as EM-based approaches, but the new method converges much more rapidly (in our experiments, typically five to ten iterations). Other advantages of the ICD/Newton-Raphson method are that it is easily applied to MAP estimation of transmission tomograms, and typical convex constraints, such as positivity, are easily incorporated.
Unpacking Blockchains

The Bitcoin digital currency appeared in 2009. Since this time, researchers and practitioners have looked “under the hood” of the open source Bitcoin currency, and discovered that Bitcoin’s “Blockchain” software architecture is useful for non-monetary purposes too. By coalescing the research and practice on Blockchains, this work begins to unpack Blockchains as a general phenomenon, therein, arguing that all Blockchain phenomena can be conceived as being comprised of transaction platforms and digital ledgers, and illustrating where public key encryption plays a differential role in facilitating these features of Blockchains
SOCIAL DIALOGUE WITH EMBODIED CONVERSATIONAL AGENTS

The functions of social dialogue between people in the context of performing a task is discussed, as well as approaches to modelling such dialogue in embodied conversational agents. A study of an agent’s use of social dialogue is presented, comparing embodied interactions with similar interactions conducted over the phone, assessing the impact these media have on a wide range of behavioural, task and subjective measures. Results indicate that subjects’ perceptions of the agent are sensitive to both interaction style (social vs. task-only dialogue) and
EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications

The concept of smart grid has emerged as a convergence of traditional power system engineering and information and communication technology. It is vital to the success of next generation of power grid, which is expected to be featuring reliable, efficient, flexible, clean, friendly, and secure characteristics. In this paper, we propose an efficient and privacy-preserving aggregation scheme, named EPPA, for smart grid communications. EPPA uses a superincreasing sequence to structure multidimensional data and encrypt the structured data by the homomorphic Paillier cryptosystem technique. For data communications from user to smart grid operation center, data aggregation is performed directly on ciphertext at local gateways without decryption, and the aggregation result of the original data can be obtained at the operation center. EPPA also adopts the batch verification technique to reduce authentication cost. Through extensive analysis, we demonstrate that EPPA resists various security threats and preserve user privacy, and has significantly less computation and communication overhead than existing competing approaches.
Seq2seq Fingerprint: An Unsupervised Deep Molecular Embedding for Drug Discovery

Many of today's drug discoveries require expertise knowledge and insanely expensive biological experiments for identifying the chemical molecular properties. However, despite the growing interests of using supervised machine learning algorithms to automatically identify those chemical molecular properties, there is little advancement of the performance and accuracy due to the limited amount of training data. In this paper, we propose a novel unsupervised molecular embedding method, providing a continuous feature vector for each molecule to perform further tasks, e.g., solubility classification. In the proposed method, a multi-layered Gated Recurrent Unit (GRU) network is used to map the input molecule into a continuous feature vector of fixed dimensionality, and then another deep GRU network is employed to decode the continuous vector back to the original molecule. As a result, the continuous encoding vector is expected to contain rigorous and enough information to recover the original molecule and predict its chemical properties. The proposed embedding method could utilize almost unlimited molecule data for the training phase. With sufficient information encoded in the vector, the proposed method is also robust and task-insensitive. The performance and robustness are confirmed and interpreted in our extensive experiments.
Dynamic node creation in backpropagation networks

A novel method called dynamic node creation (DNC) that attacks issues of training large networks and of testing networks with different numbers of hidden layer units is presented. DNC sequentially adds nodes one at a time to the hidden layer(s) of the network until the desired approximation accuracy is achieved. Simulation results for parity, symmetry, binary addition, and the encoder problem are presented. The procedure was capable of finding known minimal topologies in many cases, and was always within three nodes of the minimum. Computational expense for finding the solutions was comparable to training normal backpropagation (BP) networks with the same final topologies. Starting out with fewer nodes than needed to solve the problem actually seems to help find a solution. The method yielded a solution for every problem tried. BP applied to the same large networks with randomized initial weights was unable, after repeated attempts, to replicate some minimum solutions found by DNC.<<ETX>>