nils-herrmann/clean_scirepeval huggingface dataset:
Semantic Folding Theory And its Application in Semantic Fingerprinting

Human language is recognized as a very complex domain since decades. No computer system has been able to reach human levels of performance so far. The only known computational system capable of proper language processing is the human brain. While we gather more and more data about the brain, its fundamental computational processes still remain obscure. The lack of a sound computational brain theory also prevents the fundamental understanding of Natural Language Processing. As always when science lacks a theoretical foundation, statistical modeling is applied to accommodate as many sampled real-world data as possible. An unsolved fundamental issue is the actual representation of language (data) within the brain, denoted as the Representational Problem. Starting with Jeff Hawkins' Hierarchical Temporal Memory (HTM) theory, a consistent computational theory of the human cortex, we have developed a corresponding theory of language data representation: The Semantic Folding Theory. The process of encoding words, by using a topographic semantic space as distributional reference frame into a sparse binary representational vector is called Semantic Folding and is the central topic of this document. Semantic Folding describes a method of converting language from its symbolic representation (text) into an explicit, semantically grounded representation that can be generically processed by Hawkins' HTM networks. As it turned out, this change in representation, by itself, can solve many complex NLP problems by applying Boolean operators and a generic similarity function like the Euclidian Distance. Many practical problems of statistical NLP systems, like the high cost of computation, the fundamental incongruity of precision and recall , the complex tuning procedures etc., can be elegantly overcome by applying Semantic Folding.
Real time vehicle speed prediction using a Neural Network Traffic Model

Prediction of the traffic information such as flow, density, speed, and travel time is important for traffic control systems, optimizing vehicle operations, and the individual driver. Prediction of future traffic information is a challenging problem due to many dynamic contributing factors. In this paper, various methodologies for traffic information prediction are investigated. We present a speed prediction algorithm, NNTM-SP (Neural Network Traffic Modeling-Speed Prediction) that trained with the historical traffic data and is capable of predicting the vehicle speed profile with the current traffic information. Experimental results show that the proposed algorithm gave good prediction results on real traffic data and the predicted speed profile shows that NNTM-SP correctly predicts the dynamic traffic changes.
Sparse Sensing With Co-Prime Samplers and Arrays

This paper considers the sampling of temporal or spatial wide sense stationary (WSS) signals using a co-prime pair of sparse samplers. Several properties and applications of co-prime samplers are developed. First, for uniform spatial sampling with M and N sensors where M and N are co-prime with appropriate interelement spacings, the difference co-array has O(MN) freedoms which can be exploited in beamforming and in direction of arrival estimation. An M -point DFT filter bank and an N-point DFT filter bank can be used at the outputs of the two sensor arrays and their outputs combined in such a way that there are effectively MN bands (i.e., MN narrow beams with beamwidths proportional to 1/MN), a result following from co-primality. The ideas are applicable to both active and passive sensing, though the details and tradeoffs are different. Time domain sparse co-prime samplers also generate a time domain co-array with O(MN) freedoms, which can be used to estimate the autocorrelation at much finer lags than the sample spacings. This allows estimation of power spectrum of an arbitrary signal with a frequency resolution proportional to 2π/(MNT) even though the pairs of sampled sequences xc(NTn) and xc(MTn) in the time domain can be arbitrarily sparse - in fact from the sparse set of samples xc(NTn) and xc(MTn) one can estimate O(MN) frequencies in the range |ω| <; π/T. It will be shown that the co-array based method for estimating sinusoids in noise offers many advantages over methods based on the use of Chinese remainder theorem and its extensions. Examples are presented throughout to illustrate the various concepts.
OCR of historical printings with an application to building diachronic corpora: A case study using the RIDGES herbal corpus

This article describes the results of a case study that applies Neural Networkbased Optical Character Recognition (OCR) to scanned images of books printed between 1487 and 1870 by training the OCR engine OCRopus (Breuel et al. 2013) on the RIDGES herbal text corpus (Odebrecht et al. 2017, ). Training specific OCR models was possible because the necessary ground truth is available as error-corrected diplomatic transcriptions. The OCR results have been evaluated for accuracy against the ground truth of unseen test sets. Character and word accuracies (percentage of correctly recognized items) for the resulting machine-readable texts of individual documents range from 94% to more than 99% (character level) and from 76% to 97% (word level). This includes the earliest printed books, which were thought to be inaccessible by OCR methods until recently. Furthermore, OCR models trained on one part of the corpus consisting of books with different printing dates and different typesets (mixed models) have been tested for their predictive power on the books from the other part containing yet other fonts, mostly yielding character accuracies well above 90%. It therefore seems possible to construct generalized models trained on a range of fonts that can be applied to a wide variety of historical printings still giving good results. A moderate postcorrection effort of some pages will then enable the training of individual models with even better accuracies. Using this method, diachronic corpora including early printings can be constructed much faster and cheaper than by manual transcription. The OCR methods reported here open up the possibility of transforming our printed textual cultural 1 ar X iv :1 60 8. 02 15 3v 2 [ cs .C L ] 1 F eb 2 01 7 Springmann & Lüdeling OCR of historical printings heritage into electronic text by largely automatic means, which is a prerequisite for the mass conversion of scanned books.
Gender reassignment surgery: an overview

Gender reassignment (which includes psychotherapy, hormonal therapy and surgery) has been demonstrated as the most effective treatment for patients affected by gender dysphoria (or gender identity disorder), in which patients do not recognize their gender (sexual identity) as matching their genetic and sexual characteristics. Gender reassignment surgery is a series of complex surgical procedures (genital and nongenital) performed for the treatment of gender dysphoria. Genital procedures performed for gender dysphoria, such as vaginoplasty, clitorolabioplasty, penectomy and orchidectomy in male-to-female transsexuals, and penile and scrotal reconstruction in female-to-male transsexuals, are the core procedures in gender reassignment surgery. Nongenital procedures, such as breast enlargement, mastectomy, facial feminization surgery, voice surgery, and other masculinization and feminization procedures complete the surgical treatment available. The World Professional Association for Transgender Health currently publishes and reviews guidelines and standards of care for patients affected by gender dysphoria, such as eligibility criteria for surgery. This article presents an overview of the genital and nongenital procedures available for both male-to-female and female-to-male gender reassignment.
A modified bow tie antenna with U-shape slot for Wireless applications

This paper presents a study on bow tie antenna with U-shape slot, designated for the Wireless applications. It is designed to work on a thick substrate (h = 1.6mm) with a high dielectric constant ( = 4.4) operating at three frequencies (2.4, 4 and 5GHz). Two U-shaped slots are introduced in the both sides of bow tie antenna in order to achieve a very low return loss at these frequencies. The antenna is simulated with HFSSv11 simulator. The proposed antenna can exhibit minimum return loss, Omni-directional radiation pattern, wide impedance bandwidth, VSWR<2, and the stronger current distribution throughout the antenna.
Encoding Time Series as Images for Visual Inspection and Classification Using Tiled Convolutional Neural Networks

Inspired by recent successes of deep learning in computer vision and speech recognition, we propose a novel framework to encode time series data as different types of images, namely, Gramian Angular Fields (GAF) and Markov Transition Fields (MTF). This enables the use of techniques from computer vision for classification. Using a polar coordinate system, GAF images are represented as a Gramian matrix where each element is the trigonometric sum (i.e., superposition of directions) between different time intervals. MTF images represent the first order Markov transition probability along one dimension and temporal dependency along the other. We used Tiled Convolutional Neural Networks (tiled CNNs) on 12 standard datasets to learn high-level features from individual GAF, MTF, and GAF-MTF images that resulted from combining GAF and MTF representations into a single image. The classification results of our approach are competitive with five stateof-the-art approaches. An analysis of the features and weights learned via tiled CNNs explains why the approach works.
Orthogonal Random Features

We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error. We call this technique Orthogonal Random Features (ORF), and provide theoretical and empirical justification for this behavior. Motivated by this discovery, we further propose Structured Orthogonal Random Features (SORF), which uses a class of structured discrete orthogonal matrices to speed up the computation. The method reduces the time cost from O(d2) to O(d log d), where d is the data dimensionality, with almost no compromise in kernel approximation quality compared to ORF. Experiments on several datasets verify the effectiveness of ORF and SORF over the existing methods. We also provide discussions on using the same type of discrete orthogonal structure for a broader range of applications.
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics

Finding optimal solutions for multi-unit combinatorial auctions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for efficiently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.
Combining Human Computing and Machine Learning to Make Sense of Big (Aerial) Data for Disaster Response.

Aerial imagery captured via unmanned aerial vehicles (UAVs) is playing an increasingly important role in disaster response. Unlike satellite imagery, aerial imagery can be captured and processed within hours rather than days. In addition, the spatial resolution of aerial imagery is an order of magnitude higher than the imagery produced by the most sophisticated commercial satellites today. Both the United States Federal Emergency Management Agency (FEMA) and the European Commission's Joint Research Center (JRC) have noted that aerial imagery will inevitably present a big data challenge. The purpose of this article is to get ahead of this future challenge by proposing a hybrid crowdsourcing and real-time machine learning solution to rapidly process large volumes of aerial data for disaster response in a time-sensitive manner. Crowdsourcing can be used to annotate features of interest in aerial images (such as damaged shelters and roads blocked by debris). These human-annotated features can then be used to train a supervised machine learning system to learn to recognize such features in new unseen images. In this article, we describe how this hybrid solution for image analysis can be implemented as a module (i.e., Aerial Clicker) to extend an existing platform called Artificial Intelligence for Disaster Response (AIDR), which has already been deployed to classify microblog messages during disasters using its Text Clicker module and in response to Cyclone Pam, a category 5 cyclone that devastated Vanuatu in March 2015. The hybrid solution we present can be applied to both aerial and satellite imagery and has applications beyond disaster response such as wildlife protection, human rights, and archeological exploration. As a proof of concept, we recently piloted this solution using very high-resolution aerial photographs of a wildlife reserve in Namibia to support rangers with their wildlife conservation efforts (SAVMAP project, http://lasig.epfl.ch/savmap ). The results suggest that the platform we have developed to combine crowdsourcing and machine learning to make sense of large volumes of aerial images can be used for disaster response.
SpotFi: Decimeter Level Localization Using WiFi

This paper presents the design and implementation of SpotFi, an accurate indoor localization system that can be deployed on commodity WiFi infrastructure. SpotFi only uses information that is already exposed by WiFi chips and does not require any hardware or firmware changes, yet achieves the same accuracy as state-of-the-art localization systems. SpotFi makes two key technical contributions. First, SpotFi incorporates super-resolution algorithms that can accurately compute the angle of arrival (AoA) of multipath components even when the access point (AP) has only three antennas. Second, it incorporates novel filtering and estimation techniques to identify AoA of direct path between the localization target and AP by assigning values for each path depending on how likely the particular path is the direct path. Our experiments in a multipath rich indoor environment show that SpotFi achieves a median accuracy of 40 cm and is robust to indoor hindrances such as obstacles and multipath.
Compact MIMO Antenna for Portable UWB Applications With Band-Notched Characteristic

A multiple-input-multiple-output (MIMO) band-notched antenna with a compact size of only 22 × 36 mm2 is proposed for portable ultrawideband (UWB) applications. The antenna consists of two square monopole-antenna elements, a T-shaped ground stub, a vertical slot cut on the T-shaped ground stub to reduce mutual coupling, and two strips on the ground plane to create a notched frequency band. Simulation and measurement are used to study the antenna performance in terms of impedance matching, isolation between the two input ports, radiation pattern, efficiency, peak gain, and envelope correlation coefficient. Results show that the antenna can operate from 3.1 to more than 11 GHz with a notched band in 5.15-5.85 GHz. In the center notched frequency, the efficiency drops to 7%, indicating a good interference suppression performance. The mutual coupling is less than -15 and the envelope correlation coefficient is less than 0.1. The performances of the MIMO antenna when installed on a PCB with a standard size, with an USB connector and device housing, are also studied. Results show that the proposed MIMO antenna is a good candidate for portable UWB applications.
Ontology Matching with Word Embeddings

Ontology matching is one of the most important work to achieve the goal of the semantic web. To fulfill this task, element-level matching is an indispensable step to obtain the fundamental alignment. In element-level matching process, previous work generally utilizes WordNet to compute the semantic similarities among elements, but WordNet is limited by its coverage. In this paper, we introduce word embeddings to the field of ontology matching. We testified the superiority of word embeddings and presented a hybrid method to incorporate word embeddings into the computation of the semantic similarities among elements. We performed the experiments on the OAEI benchmark, conference track and real-world ontologies. The experimental results show that in elementlevel matching, word embeddings could achieve better performance than previous methods.
Swinging in the brain: shared neural substrates for behaviors related to sequencing and music

Music consists of precisely patterned sequences of both movement and sound that engage the mind in a multitude of experiences. We move in response to music and we move in order to make music. Because of the intimate coupling between perception and action, music provides a panoramic window through which we can examine the neural organization of complex behaviors that are at the core of human nature. Although the cognitive neuroscience of music is still in its infancy, a considerable behavioral and neuroimaging literature has amassed that pertains to neural mechanisms that underlie musical experience. Here we review neuroimaging studies of explicit sequence learning and temporal production—findings that ultimately lay the groundwork for understanding how more complex musical sequences are represented and produced by the brain. These studies are also brought into an existing framework concerning the interaction of attention and time-keeping mechanisms in perceiving complex patterns of information that are distributed in time, such as those that occur in music.
Understanding hybrid CDN-P2P: why limelight needs its own Red Swoosh

In this paper, we quantify the potential gains of hybrid CDN-P2P for two of the leading CDN companies, Akamai and Limelight. We first develop novel measurement methodology for mapping the topologies of CDN networks. We then consider ISP-friendly P2P distribution schemes which work in conjunction with the CDNs to localize traffic within regions of ISPs. To evaluate these schemes, we use two recent, real-world traces: a video-on-demand trace and a large-scale software update trace. We find that hybrid CDN-P2P can significantly reduce the cost of content distribution, even when peer sharing is localized within ISPs and further localized within regions of ISPs. We conclude that hybrid CDN-P2P distribution can economically satisfy the exponential growth of Internet video content without placing an unacceptable burden on regional ISPs.
Analysis , Design , and Optimization of Spiral Inductors and Transformers for Si RF IC ’ s

Silicon integrated circuit spiral inductors and transformers are analyzed using electromagnetic analysis. With appropriate approximations, the calculations are reduced to electrostatic and magnetostatic calculations. The important effects of substrate loss are included in the analysis. Classic circuit analysis and network analysis techniques are used to derive two-port parameters from the circuits. From two-port measurements, loworder, frequency-independent lumped circuits are used to model the physical behavior over a broad-frequency range. The analysis is applied to traditional square and polygon inductors and transformer structures as well as to multilayer metal structures and coupled inductors. A custom computer-aided-design tool called ASITIC is described, which is used for the analysis, design, and optimization of these structures. Measurements taken over a frequency range from 100 MHz to 5 GHz show good agreement with theory.
The meaningful use of big data: four perspectives - four challenges

Twenty-five Semantic Web and Database researchers met at the 2011 STI Semantic Summit in Riga, Latvia July 6-8, 2011[1] to discuss the opportunities and challenges posed by Big Data for the Semantic Web, Semantic Technologies, and Database communities. The unanimous conclusion was that the greatest shared challenge was not only engineering Big Data, but also doing so meaningfully. The following are four expressions of that challenge from different perspectives.
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks

Reputation systems have been popular in estimating the trustworthiness and predicting the future behavior of nodes in a large-scale distributed system where nodes may transact with one another without prior knowledge or experience. One of the fundamental challenges in distributed reputation management is to understand vulnerabilities and develop mechanisms that can minimize the potential damages to a system by malicious nodes. In this paper, we identify three vulnerabilities that are detrimental to decentralized reputation management and propose TrustGuard - a safeguard framework for providing a highly dependable and yet efficient reputation system. First, we provide a dependable trust model and a set of formal methods to handle strategic malicious nodes that continuously change their behavior to gain unfair advantages in the system. Second, a transaction based reputation system must cope with the vulnerability that malicious nodes may misuse the system by flooding feedbacks with fake transactions. Third, but not least, we identify the importance of filtering out dishonest feedbacks when computing reputation-based trust of a node, including the feedbacks filed by malicious nodes through collusion. Our experiments show that, comparing with existing reputation systems, our framework is highly dependable and effective in countering malicious nodes regarding strategic oscillating behavior, flooding malevolent feedbacks with fake transactions, and dishonest feedbacks.
The Promise of the Sharing Economy among Disadvantaged Communities

The digital-sharing economy presents opportunities for individuals to find temporary employment, generate extra income, increase reciprocity, enhance social interaction, and access resources not otherwise attainable. Although the sharing economy is profitable, little is known about its use among the unemployed or those struggling financially. This paper describes the results of a participatory-design based workshop to investigate the perception and feasibility of finding temporary employment and sharing spare resources using sharing-economy applications. Specifically, this study included 20 individuals seeking employment in a U.S. city suffering economic decline. We identify success factors of the digital-sharing economy to these populations, identify shortcomings and propose mitigation strategies based on prior research related to trust, social capital and theories of collective efficacy. Finally, we contribute new principles that may foster collaborative consumption within this population and identify new concepts for practical employment applications among these populations.
Food Recommendation using Ontology and Heuristics

Recommender systems are needed to find food items of one’s interest. We review recommender systems and recommendation methods. We propose a food personalization framework based on adaptive hypermedia. We extend Hermes framework with food recommendation functionality. We combine TF-IDF term extraction method with cosine similarity measure. Healthy heuristics and standard food database are incorporated into the knowledgebase. Based on the performed evaluation, we conclude that semantic recommender systems in general outperform traditional recommenders systems with respect to accuracy, precision, and recall, and that the proposed recommender has a better F-measure than existing semantic recommenders.