nils-herrmann/clean_scirepeval huggingface dataset:
A Tale of Two Bases: Local-Nonlocal Regularization on Image Patches with Convolution Framelets

We propose an image representation scheme combining the local and nonlocal characterization of patches in an image. Our representation scheme can be shown to be equivalent to a tight frame constructed from convolving local bases (e.g. wavelet frames, discrete cosine transforms, etc.) with nonlocal bases (e.g. spectral basis induced by nonlinear dimension reduction on patches), and we call the resulting frame elements convolution framelets. Insight gained from analyzing the proposed representation leads to a novel interpretation of a recent highperformance patch-based image inpainting algorithm using Point Integral Method (PIM) and Low Dimension Manifold Model (LDMM) [Osher, Shi and Zhu, 2016]. In particular, we show that LDMM is a weighted `2-regularization on the coefficients obtained by decomposing images into linear combinations of convolution framelets; based on this understanding, we extend the original LDMM to a reweighted version that yields further improved inpainting results. In addition, we establish the energy concentration property of convolution framelet coefficients for the setting where the local basis is constructed from a given nonlocal basis via a linear reconstruction framework; a generalization of this framework to unions of local embeddings can provide a natural setting for interpreting BM3D, one of the state-of-the-art image denoising algorithms.
Combining concept hierarchies and statistical topic models

Statistical topic models provide a general data-driven framework for automated discovery of high-level knowledge from large collections of text documents. While topic models can potentially discover a broad range of themes in a data set, the interpretability of the learned topics is not always ideal. Human-defined concepts, on the other hand, tend to be semantically richer due to careful selection of words to define concepts but they tend not to cover the themes in a data set exhaustively. In this paper, we propose a probabilistic framework to combine a hierarchy of human-defined semantic concepts with statistical topic models to seek the best of both worlds. Experimental results using two different sources of concept hierarchies and two collections of text documents indicate that this combination leads to systematic improvements in the quality of the associated language models as well as enabling new techniques for inferring and visualizing the semantics of a document.
Ontology Development 101 : A Guide to Creating Your First Ontology

1 Why develop an ontology? In recent years the development of ontologies—explicit formal specifications of the terms in the domain and relations among them (Gruber 1993)—has been moving from the realm of ArtificialIntelligence laboratories to the desktops of domain experts. Ontologies have become common on the World-Wide Web. The ontologies on the Web range from large taxonomies categorizing Web sites (such as on Yahoo!) to categorizations of products for sale and their features (such as on Amazon.com). The WWW Consortium (W3C) is developing the Resource Description Framework (Brickley and Guha 1999), a language for encoding knowledge on Web pages to make it understandable to electronic agents searching for information. The Defense Advanced Research Projects Agency (DARPA), in conjunction with the W3C, is developing DARPA Agent Markup Language (DAML) by extending RDF with more expressive constructs aimed at facilitating agent interaction on the Web (Hendler and McGuinness 2000). Many disciplines now develop standardized ontologies that domain experts can use to share and annotate information in their fields. Medicine, for example, has produced large, standardized, structured vocabularies such as SNOMED (Price and Spackman 2000) and the semantic network of the Unified Medical Language System (Humphreys and Lindberg 1993). Broad general-purpose ontologies are emerging as well. For example, the United Nations Development Program and Dun & Bradstreet combined their efforts to develop the UNSPSC ontology which provides terminology for products and services (www.unspsc.org). An ontology defines a common vocabulary for researchers who need to share information in a domain. It includes machine-interpretable definitions of basic concepts in the domain and relations among them. Why would someone want to develop an ontology? Some of the reasons are:
Robust Multilingual Part-of-Speech Tagging via Adversarial Training

Adversarial training (AT)1 is a powerful regularization method for neural networks, aiming to achieve robustness to input perturbations. Yet, the specific effects of the robustness obtained from AT are still unclear in the context of natural language processing. In this paper, we propose and analyze a neural POS tagging model that exploits AT. In our experiments on the Penn Treebank WSJ corpus and the Universal Dependencies (UD) dataset (27 languages), we find that AT not only improves the overall tagging accuracy, but also 1) prevents over-fitting well in low resource languages and 2) boosts tagging accuracy for rare / unseen words. We also demonstrate that 3) the improved tagging performance by AT contributes to the downstream task of dependency parsing, and that 4) AT helps the model to learn cleaner word representations. 5) The proposed AT model is generally effective in different sequence labeling tasks. These positive results motivate further use of AT for natural language tasks.
Design of double L-slot microstrip patch antenna for WiMAX and WLAN application

A dual-band design of a finite ground coplanar waveguide (CPW) fed antenna is presented for simultaneously wireless local area network (WLAN) and worldwide interoperability for Microwave Access (WiMAX) applications. The proposed antenna, comprising a rectangular planar patch element embedded with two L shaped slots. The simulated -10 dBi bandwidth for return loss is from 2 to 6 GHz, covering some of the WiMAX and WLAN bands. The parametric study is performed to understand the characteristics of the proposed antenna. Also, good antenna performances such as radiation patterns and antenna gains over the operating bands have been observed and simulated peak gain of the antenna is 7.68 dBi at 2.8 GHz and maximum return loss is obtained is -35 dBi at 4.8GHz.
FENNEL: streaming graph partitioning for massive scale graphs

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and efficient computations on massive graph data such as web graphs, knowledge graphs, and graphs arising in the context of online social networks. Two families of heuristics for graph partitioning in the streaming setting are in wide use: place the newly arrived vertex in the cluster with the largest number of neighbors or in the cluster with the least number of non-neighbors.
 In this work, we introduce a framework which unifies the two seemingly orthogonal heuristics and allows us to quantify the interpolation between them. More generally, the framework enables a well principled design of scalable, streaming graph partitioning algorithms that are amenable to distributed implementations. We derive a novel one-pass, streaming graph partitioning algorithm and show that it yields significant performance improvements over previous approaches using an extensive set of real-world and synthetic graphs.
 Surprisingly, despite the fact that our algorithm is a one-pass streaming algorithm, we found its performance to be in many cases comparable to the de-facto standard offline software METIS and in some cases even superiror. For instance, for the Twitter graph with more than 1.4 billion of edges, our method partitions the graph in about 40 minutes achieving a balanced partition that cuts as few as 6.8% of edges, whereas it took more than 81/2 hours by METIS to produce a balanced partition that cuts 11.98% of edges. We also demonstrate the performance gains by using our graph partitioner while solving standard PageRank computation in a graph processing platform with respect to the communication cost and runtime.
The Seven Pillars of Causal Reasoning with Reflections on Machine Learning

Systems that operate in purely statistical mode of inference entails theoretical limits on their power and performance. Such systems cannot reason about interventions and retrospection and, therefore, cannot serve as the basis for strong AI. To achieve human-level intelligence, learning machines need the guidance of a model of external reality, similar to the ones used in causal inference tasks. To demonstrate the essential role of such models, this paper presents a summary of seven tasks which are beyond reach of associational learning systems and which have been accomplished using the tools of causal modeling.
CHAPTER 19 Meditation and the Neuroscience of Consciousness : An Introduction

The overall goal of this chapter is to explore the initial findings of neuroscientific research on meditation; in doing so, the chapter also suggests potential avenues of further inquiry. It has three sections that, although integral to the chapter as a whole, may also be read independently. The first section, "Defining Meditation," notes the need for a more precise understanding of meditation as a scientific explanandum. Arguing for the importance of distinguishing the particularities of various traditions, the section presents the theory of meditation from the paradigmatic perspective of Buddhism, and it discusses the difficulties encountered when working with such theories. The section includes an overview of three practices that have been the subject of research, and it ends with a strategy for developing a questionnaire to define more precisely a practice under examination. The second section, "The Intersection of Neuroscience and Meditation," explores some scientific motivations for the neuroscientific examination of meditation in terms of its potential impact on the brain and body of long-term practitioners. After an overview of the mechanisms of mind-body interaction, this section addresses the use of first-person expertise, especially in relation to the potential for research on the neural counterpart of subjective experience. In general terms, the section thus points to the possible contributions of research on meditation to the neuroscience of consciousness. The final section, "Neuroelectric and Neuroimaging Correlates of Meditation," reviews the most relevant neuroelectric and neuroimaging findings of research conducted to date, including some preliminary correlates of the previously discussed Buddhist practices.
Twenty-Five Years of Research on Women Farmers in Africa : Lessons and Implications for Agricultural Research Institutions with an Annotated Bibliography

.................................................................................................................... iv Acknowledgments ...................................................................................................... iv Introduction ............................................................................................................... 1 Labor ..........................................................................................................................2 Gender Division of Labor .................................................................................... 2 Household Labor Availability ............................................................................... 6 Agricultural Labor Markets .................................................................................. 8  Labor and Gender .......................................................................... 9 Land ........................................................................................................................ 10 Access to Land ................................................................................................... 10 Security of Land ................................................................................................ 11 Changing Access to Land ...................................................................................  Gender Issues  21 References ................................................................................................................. 23 Annotated Bibliography ............................................................................................ 27
Groundnut leaf disease detection and classification by using back probagation algorithm

Many studies shows that quality of agricultural products may be reduced from many causes. One of the most important factors contributing to low yield is disease attack. The plant disease such as fungi, bacteria and viruses. The leaf disease completely destroys the quality of the leaf. Common ground nut disease is cercospora. It is one of the type of disease in early stage of ground nut leaf. The upgraded processing pattern comprises of four leading steps. Initially a color renovation constitute intended for the input RGB image is formed, This RGB is converted into HSV because RGB is for Color generation and color descriptor. The next step is plane separation. Next performed the color features. Then using back propagation algorithm detection of leaf disease is done.
Learning Parameterized Models of Image Motion

A f?umeworkfor learning parumeterized models oj‘optical flow from image sequences is presented. A class of motions is represented by U set of orthogonul basis $ow fields that are computed froni a training set using priiicipal component analysis. Many complex image motions can be represeiited by a linear combiriution of U small number of these basisjows. The learned motion models may be usedfilr optical flow estimation und for model-bused recognition. For optical flow estimation we describe a robust, multi-resolution scheme for directly computing the parameters of the learned flow models from image derivatives. As examples we consider learning motion discontinuities, non-rigid motion of human mouths, und urticulated human motion.
AMC: an adaptive multi-level cache algorithm in hybrid storage systems

Hybrid storage systems that consist of flash-based solid state drives (SSDs) and traditional disks are now widely used. In hybrid storage systems, there exists a two-level cache hierarchy that regard dynamic random access memory (DRAM) as the first level cache and SSD as the second level cache for disk storage. However, this two-level cache hierarchy typically uses independent cache replacement policies for each level, which makes cache resource management inefficient and reduces system performance. In this paper, we propose a novel adaptive multi-level cache (AMC) replacement algorithm in hybrid storage systems. The AMC algorithm adaptively adjusts cache blocks between DRAM and SSD cache levels using an integrated solution. AMC uses combined selective promote and demote operations to dynamically determine the level in which the blocks are to be cached. In this manner, the AMC algorithm achieves multi-level cache exclusiveness and makes cache resource management more efficient. By using real-life storage traces, our evaluation shows the proposed algorithm improves hybrid multi-level cache performance and also increases the SSD lifetime compared with traditional multi-level cache replacement algorithms.
Book recommendation system using opinion mining technique

With the changing trends in technologies, and brisk growth in Internet, daily life of an individual has also changed at a very fast pace. The impacts of these technologies are so diverse that it has affected almost every sphere of the life. People start using applications of the Internet in their daily life; they prefer online shopping for their needs more and more. For academician, researchers and students, purchasing the desired book from huge collections of books on the Internet is very tedious work. In this paper, we presented a recommendation technique based on opinion mining to propose top ranked books on different discipline of the computer science. Based on the need of the customers and the reviews collected from them, we have categorized features for the books. We analyze the features on the basis of several characteristics that we have categorized and reviews of the users. Weights are assigned to categorized features according to their importance and usage, and accordingly the ranks are given. Finally, top ten ranked books are listed. This method is expected to be helpful for millions of the users who seek for desired books.
BitIodine: Extracting Intelligence from the Bitcoin Network

Bitcoin, the famous peer-to-peer, decentralized electronic currency system, allows users to benefit from pseudonymity, by generating an arbitrary number of aliases (or addresses) to move funds. However, the complete history of all transactions ever performed, called “blockchain”, is public and replicated on each node. The data it contains is difficult to analyze manually, but can yield a high number of relevant information. In this paper we present a modular framework, BitIodine, which parses the blockchain, clusters addresses that are likely to belong to a same user or group of users, classifies such users and labels them, and finally visualizes complex information extracted from the Bitcoin network. BitIodine labels users semi-automatically with information on their identity and actions which is automatically scraped from openly available information sources. BitIodine also supports manual investigation by finding paths and reverse paths between addresses or users. We tested BitIodine on several real-world use cases, identified an address likely to belong to the encrypted Silk Road cold wallet, or investigated the CryptoLocker ransomware and accurately quantified the number of ransoms paid, as well as information about the victims. We release a prototype of BitIodine as a library for building Bitcoin forensic analysis tools.
Reasoning with Heterogeneous Knowledge for Commonsense Machine Comprehension

Reasoning with commonsense knowledge is critical for natural language understanding. Traditional methods for commonsense machine comprehension mostly only focus on one specific kind of knowledge, neglecting the fact that commonsense reasoning requires simultaneously considering different kinds of commonsense knowledge. In this paper, we propose a multi-knowledge reasoning method, which can exploit heterogeneous knowledge for commonsense machine comprehension. Specifically, we first mine different kinds of knowledge (including event narrative knowledge, entity semantic knowledge and sentiment coherent knowledge) and encode them as inference rules with costs. Then we propose a multiknowledge reasoning model, which selects inference rules for a specific reasoning context using attention mechanism, and reasons by summarizing all valid inference rules. Experiments on RocStories show that our method outperforms traditional models significantly.
Containment of misinformation spread in online social networks

With their blistering expansions in recent years, popular on-line social sites such as Twitter, Facebook and Bebo, have become some of the major news sources as well as the most effective channels for viral marketing nowadays. However, alongside these promising features comes the threat of misinformation propagation which can lead to undesirable effects, such as the widespread panic in the general public due to faulty swine flu tweets on Twitter in 2009. Due to the huge magnitude of online social network (OSN) users and the highly clustered structures commonly observed in these kinds of networks, it poses a substantial challenge to efficiently contain viral spread of misinformation in large-scale social networks.
 In this paper, we focus on how to limit viral propagation of misinformation in OSNs. Particularly, we study a set of problems, namely the β1T -- Node Protectors, which aims to find the smallest set of highly influential nodes whose decontamination with good information helps to contain the viral spread of misinformation, initiated from the set I, to a desired ratio (1 − β) in T time steps. In this family set, we analyze and present solutions including inapproximability result, greedy algorithms that provide better lower bounds on the number of selected nodes, and a community-based heuristic method for the Node Protector problems. To verify our suggested solutions, we conduct experiments on real world traces including NetHEPT, NetHEPT_WC and Facebook networks. Empirical results indicate that our methods are among the best ones for hinting out those important nodes in comparison with other available methods.
Wind Turbine Structural Health Monitoring : A Short Investigation Based on SCADA Data

The use of offshore wind farms has been growing in recent years, as steadier and higher wind speeds can be generally found over water compared to land. Moreover, as human activities tend to complicate the construction of land wind farms, offshore locations, which can be found more easily near densely populated areas, can be seen as an attractive choice. However, the cost of an offshore wind farm is relatively high, and therefore their reliability is crucial if they ever need to be fully integrated into the energy arena. As wind turbines have become more complex, efficient, and expensive structures, they require more sophisticated monitoring systems, especially in offshore sites where the financial losses due to failure could be substantial. This paper presents the preliminary analysis of supervisor control and data acquisition (SCADA) extracts from the Lillgrund wind farm for the purposes of structural health monitoring. A machine learning approach is applied in order to produce individual power curves, and then predict measurements of the power produced of each wind turbine from the measurements of the other wind turbines in the farm. A comparison between neural network and Gaussian process regression is also made.
Semi-Supervised Classification with Graph Convolutional Networks

We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes. In a number of experiments on citation networks and on a knowledge graph dataset we demonstrate that our approach outperforms related methods by a significant margin.
Deep Outdoor Illumination Estimation

We present a CNN-based technique to estimate high-dynamic range outdoor illumination from a single low dynamic range image. To train the CNN, we leverage a large dataset of outdoor panoramas. We fit a low-dimensional physically-based outdoor illumination model to the skies in these panoramas giving us a compact set of parameters (including sun position, atmospheric conditions, and camera parameters). We extract limited field-of-view images from the panoramas, and train a CNN with this large set of input image&#x2013;output lighting parameter pairs. Given a test image, this network can be used to infer illumination parameters that can, in turn, be used to reconstruct an outdoor illumination environment map. We demonstrate that our approach allows the recovery of plausible illumination conditions and enables photorealistic virtual object insertion from a single image. An extensive evaluation on both the panorama dataset and captured HDR environment maps shows that our technique significantly outperforms previous solutions to this problem.