nils-herrmann/clean_scirepeval huggingface dataset:
Chapter 3 Large-Scale Image Geolocalization

In this chapter, we explore the task of global image geolocalization— estimating where on the Earth a photograph was captured. We examine variants of the “im2gps” algorithm using millions of “geotagged” Internet photographs as training data. We first discuss a simple to understand nearest-neighbor baseline. Next, we introduce a lazy-learning approach with more sophisticated features that doubles the performance of the original “im2gps” algorithm. Beyond quantifying geolocalization accuracy, we also analyze (a) how the nonuniform distribution of training data impacts the algorithm (b) how performance compares to baselines such as random guessing and land-cover recognition and (c) whether geolocalization is simply landmark or “instance level” recognition at a large scale. We also show that geolocation estimates can provide the basis for image understanding tasks such as population density estimation or land cover estimation. This work was originally described, in part, in “im2gps”  which was the first attempt at global geolocalization using Internet-derived training data.
Simulation of Rigid Origami

This paper presents a system for computer based interactive simulation of origami, based on rigid origami model. Our system shows the continuous process of folding a piece of paper into a folded shape by calculating the configuration from the crease pattern. The configuration of the model is represented by crease angles, and the trajectory is calculated by projecting angles motion to the constrained space. Additionally, polygons are triangulated and crease lines are adjusted in order to make the model more flexible. Flexible motion and comprehensible representation of origami help users to understand the structure of the model and to fold the model from a crease pattern.
Joint image denoising using adaptive principal component analysis and self-similarity

The nonlocal means (NLM) has attracted enormous interest in image denoising problem in recent years. In this paper, we propose an efficient joint denoising algorithm based on adaptive principal component analysis (PCA) and self-similarity that improves the predictability of pixel intensities in reconstructed images. The proposed algorithm consists of two successive steps without iteration: the low-rank approximation based on parallel analysis, and the collaborative filtering. First, for a pixel and its nearest neighbors, the training samples in a local search window are selected to form the similar patch group by the block matching method. Next, it is factorized by singular value decomposition (SVD), whose left and right orthogonal basis denote local and nonlocal image features, respectively. The adaptive PCA automatically chooses the local signal subspace dimensionality of the noisy similar patch group in the SVD domain by the refined parallel analysis with Monte Carlo simulation. Thus, image features can be well preserved after dimensionality reduction, and simultaneously the noise is almost eliminated. Then, after the inverse SVD transform, the denoised image is reconstructed from the aggregate filtered patches by the weighted average method. Finally, the collaborative Wiener filtering is used to further remove the noise. The experimental results validate its generality and effectiveness in a wide range of the noisy images. The proposed algorithm not only produces very promising denoising results that outperforms the state-of-the-art methods in most cases, but also adapts to a variety of noise levels. † Corresponding Author.  E-mail address: guozongming@pku.edu.cn  2013
Voice quality evaluation of recent open source codecs

Averaged frequency responses at different 16, and 24 kHz. External sampling rate does not tell the internal sampling rate. • Supported signal bandwidth depends on bitrate, but no documentation exists bandwidths were found out expirementally • We tested 32kHz sampling with 16ms frame length. There is also 8 ms lookahead. • The results show that bitrates below 32 kbit/s are not useable for voice applications.The voice quality is much worse than with SILK or bitrates shown in steady state
Dynamic Multi-Level Multi-Task Learning for Sentence Simplification

Sentence simplification aims to improve readability and understandability, based on several operations such as splitting, deletion, and paraphrasing. However, a valid simplified sentence should also be logically entailed by its input sentence. In this work, we first present a strong pointercopy mechanism based sequence-to-sequence sentence simplification model, and then improve its entailment and paraphrasing capabilities via multi-task learning with related auxiliary tasks of entailment and paraphrase generation. Moreover, we propose a novel ‘multi-level’ layered soft sharing approach where each auxiliary task shares different (higher versus lower) level layers of the sentence simplification model, depending on the task’s semantic versus lexico-syntactic nature. We also introduce a novel multi-armed bandit based training approach that dynamically learns how to effectively switch across tasks during multi-task learning. Experiments on multiple popular datasets demonstrate that our model outperforms competitive simplification systems in SARI and FKGL automatic metrics, and human evaluation. Further, we present several ablation analyses on alternative layer sharing methods, soft versus hard sharing, dynamic multi-armed bandit sampling approaches, and our model’s learned entailment and paraphrasing skills.
Automated extraction of product comparison matrices from informal product descriptions

Domain analysts, product managers, or customers aim to capture the important features and differences among a set of related products. A case-by-case reviewing of each product description is a laborious and time-consuming task that fails to deliver a condense view of a family of product. In this article, we investigate the use of automated techniques for synthesizing a product comparison matrix (PCM) from a set of product descriptions written in natural language. We describe a tool-supported process, based on term recognition, information extraction, clustering, and similarities, capable of identifying and organizing features and values in a PCM – despite the informality and absence of structure in the textual descriptions of products. We evaluate our proposal against numerous categories of products mined from BestBuy. Our empirical results show that the synthesized PCMs exhibit numerous quantitative, comparable information that can potentially complement or even refine technical descriptions of products. The user study shows that our automatic approach is capable of extracting a significant portion of correct features and correct values. This approach has been implemented in MatrixMiner a web environment with an interactive support for automatically synthesizing PCMs from informal product descriptions. MatrixMiner also maintains traceability with the original descriptions and the technical specifications for further refinement or maintenance by users.  to JSS January 5, 2017
Nursing bedside clinical handover - an integrated review of issues and tools.

This article reviews the available literature that supports implementing bedside clinical handover in nursing clinical practice and then seeks to identify key issues if any.



Clinical handover practices are recognised as being an essential component in the effective transfer of clinical care between health practitioners. It is recognised that the point where a patient is 'handed over' from one clinician to another is significant in maintaining continuity of care and that doing this poorly can have significant safety issues for the patient.



An integrated literature review.



A literature review of 45 articles was undertaken to understand bedside clinical handover and the issues related to the implementation of this process.



It was identified that there are a number of clinical handover mnemonics available that provide structure to the process and that areas such as confidentiality, inclusion of the patient/carer and involving the multidisciplinary team remain topical issues for practitioners in implementing good clinical handover practices.



This literature review identified a lack of literature available about the transfer of responsibility and accountability during clinical handover and auditing practices of the clinical handover process. The nurses were more concerned about confidentiality issues than were patients. The use of a structured tool was strongly supported; however, no one singular tool was considered suitable for all clinical areas.


 TO CLINICAL PRACTICE
Nursing clinicians seeking to implement best practice within their professional speciality should consider some of the issues raised within this article and seek to address these issues by developing strategies to overcome them.
Data Mining the Data Processing Technologies for Inventory Management

This research applied various data mining approaches to investigate the innovations of data processing technologies for inventory management based on the database of the United States Patent and Trademark Office. The first objective of data mining in this study is to find the core technologies by evaluating patent citation matrix and patent strength. This information can help companies to choose suitable tools through the understanding of the most essential innovations. A total of 63 core technologies were identified from 949 patents under the US patent class of 705/28. Besides, a network of patent development paths was also derived to illustrate the correlations of core advancements. Finally, this study adopted the method of nonhierarchical clustering analysis to identify key groups of technologies through the symmetrical matrix of relative correlation strength. Enterprise can refer the findings of clustering to recognize the trend and characteristics of data processing technologies for their strategic technology management.
Unsupervised Diverse Colorization via Generative Adversarial Networks

Colorization of grayscale images is a hot topic in computer vision. Previous research mainly focuses on producing a color image to recover the original one in a supervised learning fashion. However, since many colors share the same gray value, an input grayscale image could be diversely colorized while maintaining its reality. In this paper, we design a novel solution for unsupervised diverse colorization. Specifically, we leverage conditional generative adversarial networks to model the distribution of real-world item colors, in which we develop a fully convolutional generator with multi-layer noise to enhance diversity, with multi-layer condition concatenation to maintain reality, and with stride 1 to keep spatial information. With such a novel network architecture, the model yields highly competitive performance on the open LSUN bedroom dataset. The Turing test on 80 humans further indicates our generated color schemes are highly convincible.
Strategic asset allocation

To implement strategic asset allocation, we must determine risk and return expectations for the various asset classes. Starting from the paradigm that long-run asset returns are determined by the long-run fundamentals of the economy, a fair value approach to building expectations is crucial. This paper proposes to formalize a quantitative and systematic methodology for optimizing portfolios, from the determination of long-run fundamental pillars through the modeling of asset returns and the assessment of market risks. We apply forecasting models and build in the specific of the main asset classes (equities, bonds and alternative investments) depending on the uncertainties they represent for the risk-averse investor. Our resulting allocations within the equity asset class, and with regard to the place of alternative investments, question the choices of long-term institutional investors such as pension funds that have shifted their long-run allocations in response to the recent financial crisis.
Predicting program properties from 'big code'

We present a new approach for predicting program properties from massive codebases (aka "Big Code"). Our approach first learns a probabilistic model from existing data and then uses this model to predict properties of new, unseen programs.
 The key idea of our work is to transform the input program into a representation which allows us to phrase the problem of inferring program properties as structured prediction in machine learning. This formulation enables us to leverage powerful probabilistic graphical models such as conditional random fields (CRFs) in order to perform joint prediction of program properties.
 As an example of our approach, we built a scalable prediction engine called JSNice for solving two kinds of problems in the context of JavaScript: predicting (syntactic) names of identifiers and predicting (semantic) type annotations of variables. Experimentally, JSNice predicts correct names for 63% of name identifiers and its type annotation predictions are correct in 81% of the cases. In the first week since its release, JSNice was used by more than 30,000 developers and in only few months has become a popular tool in the JavaScript developer community.
 By formulating the problem of inferring program properties as structured prediction and showing how to perform both learning and inference in this context, our work opens up new possibilities for attacking a wide range of difficult problems in the context of "Big Code" including invariant generation, decompilation, synthesis and others.
Pedestrian Detection Using Wavelet Templates

This paper presents a trainable object detection architecture that is applied to detecting people in static images of cluttered scenes. This problem poses several challenges. People are highly non-rigid objects with a high degree of variability in size, shape, color, and texture. Unlike previous approaches, this system learns from examples and does not rely on any a priori (hand-crafted) models or on motion. The detection technique is based on the novel idea of the wavelet template that deenes the shape of an object in terms of a subset of the wavelet coeecients of the image. It is invariant to changes in color and texture and can be used to robustly deene a rich and complex class of objects such as people. We show how the invariant properties and computational eeciency of the wavelet template make it an eeective tool for object detection.
Wafer level fabrication method of hemispherical reflector coupled micro-led array stimulator for optogenetics

We report a monolithic wafer-level fabrication method for a hemispherical reflector coupled light-emitting-diode (LED) array using isotropic etching of silicon. These neural stimulators collect the backside as well as the front side emission of the μ-LEDs and thus provide higher intensity, which is imperative for opsin expressions in optogenetics experiments. Aluminum was used as the reflective layer and the planarization of polymer on the reflector cavity was done using polydimethylsiloxane (PDMS). The lateral and vertical profiles of silicon etching were measured and the light intensity increase due to the reflector was investigated. It was found that the intensity increases by a minimum of 49% and maximum of 65% when coupling a reflector with the μ-LEDs.
Unequal Wilkinson Power Divider With Reduced Arm Length For Size Miniaturization

This paper presents a compact unequal Wilkinson power divider (WPD) with a reduced arm length. The unequal power divider consists of four arms and the isolation elements, including a compensating capacitor and isolation resistor. Compared with the conventional WPD, the electric length θ of the arms between the input port and the isolation elements is much shorter, and thus, compact size can be obtained. A theoretical analysis is carried out, and design equations are obtained. In addition, a study is carried out to characterize the isolation bandwidth and output port return loss bandwidth with different values of θ. For validation, two power dividers operating at 1.5 GHz are implemented with various size and isolation bandwidths. Around 50% size reduction and good performance are obtained.
DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks

Depression is a prevailing issue and is an increasing problem in many people’s lives. Without observable diagnostic criteria, the signs of depression may go unnoticed, resulting in high demand for detecting depression in advance automatically. This paper tackles the challenging problem of forecasting severely depressed moods based on self-reported histories. Despite the large amount of research on understanding individual moods including depression, anxiety, and stress based on behavioral logs collected by pervasive computing devices such as smartphones, forecasting depressed moods is still an open question. This paper develops a recurrent neural network algorithm that incorporates categorical embedding layers for forecasting depression. We collected largescale records from 2,382 self-declared depressed people to conduct the experiment. Experimental results show that our method forecast the severely depressed mood of a user based on self-reported histories, with higher accuracy than SVM. The results also showed that the long-term historical information of a user improves the accuracy of forecasting depressed mood.
Yoga for bronchial asthma: a controlled study.

Fifty three patients with asthma underwent training for two weeks in an integrated set of yoga exercises, including breathing exercises, suryanamaskar, yogasana (physical postures), pranayama (breath slowing techniques), dhyana (meditation), and a devotional session, and were told to practise these exercises for 65 minutes daily. They were then compared with a control group of 53 patients with asthma matched for age, sex, and type and severity of asthma, who continued to take their usual drugs. There was a significantly greater improvement in the group who practised yoga in the weekly number of attacks of asthma, scores for drug treatment, and peak flow rate. This study shows the efficacy of yoga in the long term management of bronchial asthma, but the physiological basis for this beneficial effect needs to be examined in more detail.
Change Detection in Feature Space Using Local Binary Similarity Patterns

In general, the problem of change detection is studied in color space. Most proposed methods aim at dynamically finding the best color thresholds to detect moving objects against a background model. Background models are often complex to handle noise affecting pixels. Because the pixels are considered individually, some changes cannot be detected because it involves groups of pixels and some individual pixels may have the same appearance as the background. To solve this problem, we propose to formulate the problem of background subtraction in feature space. Instead of comparing the color of pixels in the current image with colors in a background model, features in the current image are compared with features in the background model. The use of a feature at each pixel position allows accounting for change affecting groups of pixels, and at the same time adds robustness to local perturbations. With the advent of binary feature descriptors such as BRISK or FREAK, it is now possible to use features in various applications at low computational cost. We thus propose to perform background subtraction with a small binary descriptor that we named Local Binary Similarity Patterns (LBSP). We show that this descriptor outperforms color, and that a simple background subtractor using LBSP outperforms many sophisticated state of the art methods in baseline scenarios.
Feature-Rich Named Entity Recognition for Bulgarian Using Conditional Random Fields

The paper presents a feature-rich approach to the automatic recognition and categorization of named entities (persons, organizations, locations, and miscellaneous) in news text for Bulgarian. We combine well-established features used for other languages with language-specific lexical, syntactic and morphological information. In particular, we make use of the rich tagset annotation of the BulTreeBank (680 morpho-syntactic tags), from which we derive suitable task-specific tagsets (local and nonlocal). We further add domain-specific gazetteers and additional unlabeled data, achieving F1=89.4%, which is comparable to the state-of-the-art results for English.
CALIBRATION OF ZMPT 101 B VOLTAGE SENSOR MODULE USING POLYNOMIAL REGRESSION FOR ACCURATE LOAD MONITORING

Smart Electricity is quickly developing as the results of advancements in sensor technology. The accuracy of a sensing device is the backbone of every measurement and the fundamental of every electrical quantity measurement is the voltage and current sensing. The sensor calibration in the context of this research means the marking or scaling of the voltage sensor so that it can present accurate sampled voltage from the ADC output using appropriate algorithm. The peakpeak input voltage (measured with a standard FLUKE 115 meter) to the sensor is correlated with the peak-peak ADC output of the sensor using 1 to 5th order polynomial regression, in order to determine the best fitting relationship between them. The arduino microcontroller is used to receive the ADC conversion and is also programmed to calculate the root mean square value of the supply voltage. The analysis of the polynomials shows that the third order polynomial gives the best relationship between the analog input and ADC output. The accuracy of the algorithm is tested in measuring the root mean square values of the supply voltage using instantaneous voltage calculation and peak-peak voltage methods. The error in the measurement is less than 1% in the peak-peak method and less than 2.5% in the instantaneous method for voltage measurements above 50V AC, which is very good for measurements in utility. Therefore, the proposed calibration method will facilitate more accurate voltage and power computing for researchers and designers especially in load monitoring where the applied voltage is 240V or 120V ranges.
Induction of Root and Pattern Lexicon for Unsupervised Morphological Analysis of Arabic

We propose an unsupervised approach to learning non-concatenative morphology, which we apply to induce a lexicon of Arabic roots and pattern templates. The approach is based on the idea that roots and patterns may be revealed through mutually recursive scoring based on hypothesized pattern and root frequencies. After a further iterative refinement stage, morphological analysis with the induced lexicon achieves a root identification accuracy of over 94%. Our approach differs from previous work on unsupervised learning of Arabic morphology in that it is applicable to naturally-written, unvowelled text.
An experimental study on the applicability of evolutionary algorithms to craniofacial superimposition in forensic identification

0020-0255/$ see front matter 2009  Corresponding author.  One of the crucial tasks throughout all this process is the craniofacial superimposition which tries to find a good fit between a 3D model of the skull and the 2D photo of the face. This photographic supra-projection stage is usually carried out manually by forensic anthropologists. It is thus very time consuming and presents several difficulties. In this paper, we aim to demonstrate that real-coded evolutionary algorithms are suitable approaches to tackle craniofacial superimposition. To do so, we first formulate this complex task in forensic identification as a numerical optimization problem. Then, we adapt three different evolutionary algorithms to solve it: two variants of a real-coded genetic algorithm and the state of the art evolution strategy CMA-ES. We also consider an existing binary-coded genetic algorithm as a baseline. Results on several superimposition problems of real-world identification cases solved by the Physical Anthropology lab at the University of Granada (Spain) are considered to test our proposals.