nils-herrmann/clean_scirepeval huggingface dataset:
The Browsemaps: Collaborative Filtering at LinkedIn

Many web properties make extensive use of item-based collaborative filtering, which showcases relationships between pairs of items based on the wisdom of the crowd. This paper presents LinkedIn’s horizontal collaborative filtering infrastructure, known as browsemaps. The platform enables rapid development, deployment, and computation of collaborative filtering recommendations for almost any use case on LinkedIn. In addition, it provides centralized management of scaling, monitoring, and other operational tasks for online serving. We also present case studies on how LinkedIn uses this platform in various recommendation products, as well as lessons learned in the field over the several years this system has been in production.
A unified framework for generalized Linear Discriminant Analysis

Linear discriminant analysis (LDA) is one of the well- known methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.
Projected Gradient Methods for Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although bound-constrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this letter, we propose two projected gradient methods for NMF, both of which exhibit strong optimization properties. We discuss efficient implementations and demonstrate that one of the proposed methods converges faster than the popular multiplicative update approach. A simple Matlab code is also provided.
The Laplacian Pyramid as a Compact Image Code

We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations are first removed by subtracting a lowpass filtered copy of the image from the image itself. The result is a net data compression since the difference, or error, image has low variance and entropy, and the low-pass filtered image may represented at reduced sample density. Further data compression is achieved by quantizing the difference image. These steps are then repeated to compress the low-pass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus, the code tends to enhance salient image features. A further advantage of the present code is that it is well suited for many image analysis tasks as well as for image compression. Fast algorithms are described for coding and decoding.
CloudSpeller: query spelling correction by using a unified hidden markov model with web-scale resources

Query spelling correction is an important component of modern search engines that can help users to express an information need more accurately and thus improve search quality. In this work we proposed and implemented an end-to-end speller correction system, namely CloudSpeller. The CloudSpeller system uses a Hidden Markov Model to effectively model major types of spelling errors in a unified framework, in which we integrate a large-scale lexicon constructed using Wikipedia, an error model trained from high confidence correction pairs, and the Microsoft Web N-gram service. Our system achieves excellent performance on two search query spelling correction datasets, reaching 0.960 and 0.937 F1 scores on the TREC dataset and the MSN dataset respectively.
Show and Tell: Lessons Learned from the 2015 MSCOCO Image Captioning Challenge

Automatically describing the content of an image is a fundamental problem in artificial intelligence that connects computer vision and natural language processing. In this paper, we present a generative model based on a deep recurrent architecture that combines recent advances in computer vision and machine translation and that can be used to generate natural sentences describing an image. The model is trained to maximize the likelihood of the target description sentence given the training image. Experiments on several datasets show the accuracy of the model and the fluency of the language it learns solely from image descriptions. Our model is often quite accurate, which we verify both qualitatively and quantitatively. Finally, given the recent surge of interest in this task, a competition was organized in 2015 using the newly released COCO dataset. We describe and analyze the various improvements we applied to our own baseline and show the resulting performance in the competition, which we won ex-aequo with a team from Microsoft Research.
V-Clip: Fast and Robust Polyhedral Collision Detection

This article presents the Voronoi-clip, or V-Clip, collision detection alogrithm for polyhedral objects specified by a boundary representation. V-Clip tracks the closest pair of features between convex polyhedra, using an approach reminiscent of the Lin-Canny closest features algorithm. V-Clip is an improvement over the latter in several respects. Coding complexity is reduced, and robustness is significantly improved; the implementation has no numerical tolerances and does not exhibit cycling problems. The algorithm also handles penetrating polyhedra, and can therefore be used to detect collisions between nonvconvex polyhedra described as hierarchies of convex pieces. The article presents the theoretical principles of V-Clip, and gives a pseudocode description of the algorithm. It also documents various test that compare V-Clip, Lin-Canny, and the Enhanced GJK algorithm, a simplex-based algorithm that is widely used for the same application. The results show V-Clip to be a strong contender in this field, comparing favorably with the other algorithms in most of the tests, in term of both performance and robustness.
A Use Case Identification Framework and Use Case Canvas for identifying and exploring relevant Blockchain opportunities

Blockchain is a new, foundational technology with a vast amount of application possibilities. However, practitioners might not be aware of which use cases in their own business model might benefit from blockchain technology. To aid them in analyzing their business regarding blockchain suitability, this paper introduces a use case identification framework for blockchain and a use case canvas. In the development process they have been evaluated with internal and external reviews in order to offer the best possible guidance. In combination they offer an analysis framework to help practitioners decide which use cases they should take into account for blockchain technology, which characteristics these blockchain implementations would have, and which specific advantages they would offer.
A Study and Comparison of Sentiment Analysis Methods for Reputation Evaluation

The aim of this paper is to study and compare some of the methods used to evaluate the reputation of items using sentiment analysis. We explain the challenge of the increasing amount of data available on the Internet and the role of sentiment analysis in mining this information. We classify recent solutions into different categories based on techniques, document approach, and rating methods. We present six methods corresponding to different categories and analyze them based on the technique used, advances and results.
Topology and Prediction Focused Research on Graph Convolutional Neural Networks

Important advances have been made using convolutional neural network (CNN) approaches to solve complicated problems in areas that rely on grid structured data such as image processing and object classification. Recently, research on graph convolutional neural networks (GCNN) has increased dramatically as researchers try to replicate the success of CNN for graph structured data. Unfortunately, traditional CNN methods are not readily transferable to GCNN, given the irregularity and geometric complexity of graphs. The emerging field of GCNN is further complicated by research papers that differ greatly in their scope, detail, and level of academic sophistication needed by the reader. The present paper provides a review of some basic properties of GCNN. As a guide to the interested reader, recent examples of GCNN research are then grouped according to techniques that attempt to uncover the underlying topology of the graph model and those that seek to generalize traditional CNN methods on graph data to improve prediction of class membership. Discrete Signal Processing on Graphs (DSPG) is used as a theoretical framework to better understand some of the performance gains and limitations of these recent GCNN approaches. A brief discussion of Topology Adaptive Graph Convolutional Networks (TAGCN) is presented as an approach motivated by DSPG and future research directions using this approach are briefly discussed.
III-nitride micro-emitter arrays : development and applications

III-nitride micro-emitter array technology was developed in the authors’ laboratory around 1999. Since its inception, much progress has been made by several groups and the technology has led to the invention of several novel devices. This paper provides an overview on recent progress in single-chip ac-micro-size light emitting diodes (μLEDs) that can be plugged directly into standard high ac voltage power outlets, self-emissive microdisplays and interconnected μLEDs for boosting light emitting diodes’s wall-plug efficiency, all of which were evolved from III-nitride micro-emitter array technology. Finally, potential applications of III-nitride visible micro-emitter arrays as a light source for DNA microarrays and future prospects of III-nitride deep ultraviolet micro-emitter arrays for label-free protein analysis in microarray format by taking advantage of the direct excitation of intrinsic protein fluorescence are discussed. (Some figures in this article are in colour only in the electronic version)
Versatile low power media access for wireless sensor networks

We propose <i>B-MAC</i>, a carrier sense media access protocol for wireless sensor networks that provides a flexible interface to obtain ultra low power operation, effective collision avoidance, and high channel utilization. To achieve low power operation, <i>B-MAC</i> employs an adaptive preamble sampling scheme to reduce duty cycle and minimize idle listening. <i>B-MAC</i> supports on-the-fly reconfiguration and provides bidirectional interfaces for system services to optimize performance, whether it be for throughput, latency, or power conservation. We build an analytical model of a class of sensor network applications. We use the model to show the effect of changing <i>B-MAC</i>'s parameters and predict the behavior of sensor network applications. By comparing <i>B-MAC</i> to conventional 802.11-inspired protocols, specifically SMAC, we develop an experimental characterization of <i>B-MAC</i> over a wide range of network conditions. We show that <i>B-MAC</i>'s flexibility results in better packet delivery rates, throughput, latency, and energy consumption than S-MAC. By deploying a real world monitoring application with multihop networking, we validate our protocol design and model. Our results illustrate the need for flexible protocols to effectively realize energy efficient sensor network applications.
Hair Follicle Miniaturization in a Woolly Hair Nevus: A Novel "Root" Perspective for a Mosaic Hair Disorder.

Woolly hair nevus is a mosaic disorder characterized by unruly, tightly curled hair in a circumscribed area of the scalp. This condition may be associated with epidermal nevi. We describe an 11-year-old boy who initially presented with multiple patches of woolly hair and with epidermal nevi on his left cheek and back. He had no nail, teeth, eye, or cardiac abnormalities. Analysis of plucked hairs from patches of woolly hair showed twisting of the hair shaft and an abnormal hair cuticle. Histopathology of a woolly hair patch showed diffuse hair follicle miniaturization with increased vellus hairs.
Learning Multimodal Transition Dynamics for Model-Based Reinforcement Learning

In this paper we study how to learn stochastic, multimodal transition dynamics in reinforcement learning (RL) tasks. We focus on evaluating transition function estimation, while we defer planning over this model to future work. Stochasticity is a fundamental property of many task environments. However, discriminative function approximators have difficulty estimating multimodal stochasticity. In contrast, deep generative models do capture complex high-dimensional outcome distributions. First we discuss why, amongst such models, conditional variational inference (VI) is theoretically most appealing for model-based RL. Subsequently, we compare different VI models on their ability to learn complex stochasticity on simulated functions, as well as on a typical RL gridworld with multimodal dynamics. Results show VI successfully predicts multimodal outcomes, but also robustly ignores these for deterministic parts of the transition dynamics. In summary, we show a robust method to learn multimodal transitions using function approximation, which is a key preliminary for model-based RL in stochastic domains.
Cross-Lingual Propagation for Deep Sentiment Analysis

Across the globe, people are voicing their opinion in social media and various other online fora. Given such data, modern deep learning-based sentiment analysis methods excel at determining the sentiment polarity of what is being said about companies, products, etc. Unfortunately, such deep methods require significant training data, while for many languages, resources and training data are scarce. In this work, we present a cross-lingual propagation algorithm that yields sentiment embedding vectors for numerous languages. We then rely on a dual-channel convolutional neural architecture to incorporate them into the network. This allows us to achieve gains in deep sentiment analysis across a range of languages and domains.
Deep Neural Networks for Acoustic Modeling in Speech Recognition

Most current speech recognition systems use hidden Markov models (HMMs) to deal with the temporal variability of speech and Gaussian mixture models to determine how well each state of each HMM fits a frame or a short window of frames of coefficients that represents the acoustic input. An alternative way to evaluate the fit is to use a feedforward neural network that takes several frames of coefficients as input and produces posterior probabilities over HMM states as output. Deep neural networks with many hidden layers, that are trained using new methods have been shown to outperform Gaussian mixture models on a variety of speech recognition benchmarks, sometimes by a large margin. This paper provides an overview of this progress and represents the shared views of four research groups who have had recent successes in using deep neural networks for acoustic modeling in speech recognition.
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning

Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate features according to heuristics based on general characteristics of the data. For application to large databases, filters have proven to be more practical than wrappers because they are much faster. However, most existing filter algorithms only work with discrete classification problems. This paper describes a fast, correlation-based filter algorithm that can be applied to continuous and discrete problems. The algorithm often outperforms the well-known ReliefF attribute estimator when used as a preprocessing step for naive Bayes, instance-based learning, decision trees, locally weighted regression, and model trees. It performs more feature selection than ReliefF does—reducing the data dimensionality by fifty percent in most cases. Also, decision and model trees built from the preprocessed data are often significantly smaller.
Reconstructing Storyline Graphs for Image Recommendation from Web Community Photos

In this paper, we investigate an approach for reconstructing storyline graphs from large-scale collections of Internet images, and optionally other side information such as friendship graphs. The storyline graphs can be an effective summary that visualizes various branching narrative structure of events or activities recurring across the input photo sets of a topic class. In order to explore further the usefulness of the storyline graphs, we leverage them to perform the image sequential prediction tasks, from which photo recommendation applications can benefit. We formulate the storyline reconstruction problem as an inference of sparse time-varying directed graphs, and develop an optimization algorithm that successfully addresses a number of key challenges of Web-scale problems, including global optimality, linear complexity, and easy parallelization. With experiments on more than 3.3 millions of images of 24 classes and user studies via Amazon Mechanical Turk, we show that the proposed algorithm improves other candidate methods for both storyline reconstruction and image prediction tasks.
Cancer Stem Cells and Their Microenvironment: Biology and Therapeutic Implications

Tumor consists of heterogeneous cancer cells including cancer stem cells (CSCs) that can terminally differentiate into tumor bulk. Normal stem cells in normal organs regulate self-renewal within a stem cell niche. Likewise, accumulating evidence has also suggested that CSCs are maintained extrinsically within the tumor microenvironment, which includes both cellular and physical factors. Here, we review the significance of stromal cells, immune cells, extracellular matrix, tumor stiffness, and hypoxia in regulation of CSC plasticity and therapeutic resistance. With a better understanding of how CSC interacts with its niche, we are able to identify potential therapeutic targets for the development of more effective treatments against cancer.
Algebraic gossip: a network coding approach to optimal multiple rumor mongering

The problem of simultaneously disseminating <i>k</i> messages in a large network of <i>n</i> nodes, in a decentralized and distributed manner, where nodes only have knowledge about their own contents, is studied. In every discrete time-step, each node selects a communication partner randomly, uniformly among all nodes and only one message can be transmitted. The goal is to disseminate rapidly, with high probability, all messages to all nodes. It is shown that a random linear coding (RLC) based protocol disseminates all messages to all nodes in time <i>ck + O</i> (√<i>k</i> ln(<i>k</i>) ln(<i>n</i>)), where <i>c</i> < 3.46 using pull-based dissemination and <i>c</i> < 5.96 using push-based dissemination. Simulations suggest that <i>c</i> < 2 might be a tighter bound. Thus, if <i>k</i> ≫ (ln(<i>n</i>))<sup>3</sup>, the time for simultaneous dissemination RLC is asymptotically at most <i>ck</i>, versus the Ω(<i>k</i> log<inf>2</inf>(<i>n</i>))<sup>3</sup> time of sequential dissemination. Furthermore, when <i>k</i> ≫ (ln(<i>n</i>))<sup>3</sup>, the dissemination time is order optimal. When <i>k</i> ≪ (ln(<i>n</i>))<sup>2</sup>, RLC reduces dissemination time by a factor of Ω(√<i>k</i>/ln <i>k</i>) over sequential dissemination. The overhead of the RLC protocol is negligible for messages of reasonable size. A store-and-forward mechanism without coding is also considered. It is shown that this approach performs no better than a sequential approach when <i>k</i>=∞ <i>n</i>. Owing to the distributed nature of the system, the proof requires analysis of an appropriate time-varying Bernoulli process.
Software project management with GAs

A Project Scheduling Problem consists in deciding who does what during the software project lifetime. This is a capital issue in the practice of software engineering, since the total budget and human resources involved must be managed optimally in order to end in a successful project. In short, companies are principally concerned with reducing the duration and cost of projects, and these two goals are in conflict with each other. In this work we tackle the problem by using genetic algorithms (GAs) to solve many different software project scenarios. Thanks to our newly developed instance generator we can perform structured studies on the influence the most important problem attributes have on the solutions. Our conclusions show that GAs are quite flexible and accurate for this application, and an important tool for automatic project management.
Multi-connectivity in 5G mmWave cellular networks

The millimeter wave (mmWave) frequencies offer the potential of orders of magnitude increases in capacity for next-generation cellular wireless systems. However, links in mmWave networks are highly susceptible to blocking and may suffer from rapid variations in quality. Connectivity to multiple cells - both in the mmWave and in the traditional lower frequencies - is thus considered essential for robust connectivity. However, one of the challenges in supporting multi-connectivity in the mmWave space is the requirement for the network to track the direction of each link in addition to its power and timing. With highly directional beams and fast varying channels, this directional tracking may be the main bottleneck in realizing robust mmWave networks. To address this challenge, this paper proposes a novel measurement system based on (i) the UE transmitting sounding signals in directions that sweep the angular space, (ii) the mmWave cells measuring the instantaneous received signal strength along with its variance to better capture the dynamics and, consequently, the reliability of a channel/direction and, finally, (iii) a centralized controller making handover and scheduling decisions based on the mmWave cell reports and transmitting the decisions either via a mmWave cell or conventional microwave cell (when control signaling paths are not available). We argue that the proposed scheme enables efficient and highly adaptive cell selection in the presence of the channel variability expected at mmWave frequencies.