nils-herrmann/clean_scirepeval huggingface dataset:
Using RDMA efficiently for key-value services

This paper describes the design and implementation of HERD, a key-value system designed to make the best use of an RDMA network. Unlike prior RDMA-based key-value systems, HERD focuses its design on reducing network round trips while using efficient RDMA primitives; the result is substantially lower latency, and throughput that saturates modern, commodity RDMA hardware.
 HERD has two unconventional decisions: First, it does not use RDMA reads, despite the allure of operations that bypass the remote CPU entirely. Second, it uses a mix of RDMA and messaging verbs, despite the conventional wisdom that the messaging primitives are slow. A HERD client writes its request into the server's memory; the server computes the reply. This design uses a single round trip for all requests and supports up to 26 million key-value operations per second with 5μs average latency. Notably, for small key-value items, our full system throughput is similar to native RDMA read throughput and is over 2X higher than recent RDMA-based key-value systems. We believe that HERD further serves as an effective template for the construction of RDMA-based datacenter services.
Generalized Learning Vector Quantization

We propose a new learning method, "Generalized Learning Vector Quantization (GLVQ)," in which reference vectors are updated based on the steepest descent method in order to minimize the cost function . The cost function is determined so that the obtained learning rule satisfies the convergence condition. We prove that Kohonen's rule as used in LVQ does not satisfy the convergence condition and thus degrades recognition ability. Experimental results for printed Chinese character recognition reveal that GLVQ is superior to LVQ in recognition ability.
A Simple Relational Classifier

We analyze a Relational Neighbor (RN) classifier, a simple relational predictive model that predicts only based on class labels of related neighbors, using no learning and no inherent attributes. We show that it performs surprisingly well by comparing it to more complex models such as Probabilistic Relational Models and Relational Probability Trees on three data sets from published work. We argue that a simple model such as this should be used as a baseline to assess the performance of relational learners.
Parental Mediation, Online Activities, and Cyberbullying

Cyberbullying, the use of information and communication technologies to intentionally harm others, has become an important area of research. Studies have begun to investigate the extent of cyberbullying and its victims' personality characteristics. Less is known about the effect of specific online activities and the role of parental mediation on the likelihood of being bullied. This study attempts to fill this gap in the literature conducting a secondary analysis of a representative sample of the U.S. youth population, the Teens and Parents survey conducted by the Pew and American Life Project (n = 935). The results indicate that the risk of youth being bullied is higher for adolescents who have an active profile on social networking sites and participate in chat rooms but not in playing games online. Gender differences emerge in risk factors. A few parental mediation techniques are protective, but most are not. The results indicate the need for more parental participation to reduce risks to youth arising from Internet use for interpersonal communication.
Sketch Me That Shoe

We investigate the problem of fine-grained sketch-based image retrieval (SBIR), where free-hand human sketches are used as queries to perform instance-level retrieval of images. This is an extremely challenging task because (i) visual comparisons not only need to be fine-grained but also executed cross-domain, (ii) free-hand (finger) sketches are highly abstract, making fine-grained matching harder, and most importantly (iii) annotated cross-domain sketch-photo datasets required for training are scarce, challenging many state-of-the-art machine learning techniques. In this paper, for the first time, we address all these challenges, providing a step towards the capabilities that would underpin a commercial sketch-based image retrieval application. We introduce a new database of 1,432 sketchphoto pairs from two categories with 32,000 fine-grained triplet ranking annotations. We then develop a deep tripletranking model for instance-level SBIR with a novel data augmentation and staged pre-training strategy to alleviate the issue of insufficient fine-grained training data. Extensive experiments are carried out to contribute a variety of insights into the challenges of data sufficiency and over-fitting avoidance when training deep networks for finegrained cross-domain ranking tasks.
Oblivious Neural Network Predictions via MiniONN Transformations

Machine learning models hosted in a cloud service are increasingly popular but risk privacy: clients sending prediction requests to the service need to disclose potentially sensitive information. In this paper, we explore the problem of privacy-preserving predictions: after each prediction, the server learns nothing about clients' input and clients learn nothing about the model.
 We present MiniONN, the first approach for transforming an existing neural network to an oblivious neural network supporting privacy-preserving predictions with reasonable efficiency. Unlike prior work, MiniONN requires no change to how models are trained. To this end, we design oblivious protocols for commonly used operations in neural network prediction models. We show that MiniONN outperforms existing work in terms of response latency and message sizes. We demonstrate the wide applicability of MiniONN by transforming several typical neural network models trained from standard datasets.
Comparison of permanent magnet brushless motor with outer and inner rotor used in e-bike

This paper presents the comparison and optimization of a drive system used in an electric bike with outer and inner rotor permanent magnet brushless motor based on theoretical and experimental analysis of e-bike drive. The analyzed e-bike was equipped with the permanent magnet brushless synchronous motor with mechanical output power in range of 250W. The electric motor together with a planetary gear was mounted in a hub of 26 inch bike wheel. This kind of e-bike can reach maximum speed up to 25km/h. The aim of this paper is to investigate drive system used in the commercial e-bike with outer rotor, and theoretical analysis this same system combined with permanent magnet brushless motor with inner rotor. As a result of work the optimized motor topology with inner rotor is presented.
Learning to target: what works for behavioral targeting

Understanding what interests and delights users is critical to effective behavioral targeting, especially in information-poor contexts. As users interact with content and advertising, their passive behavior can reveal their interests towards advertising. Two issues are critical for building effective targeting methods: what metric to optimize for and how to optimize. More specifically, we first attempt to understand what the learning objective should be for behavioral targeting so as to maximize advertiser's performance. While most popular advertising methods optimize for user clicks, as we will show, maximizing clicks does not necessarily imply maximizing purchase activities or transactions, called conversions, which directly translate to advertiser's revenue. In this work we focus on conversions which makes a more relevant metric but also the more challenging one. Second is the issue of how to represent and combine the plethora of user activities such as search queries, page views, ad clicks to perform the targeting. We investigate several sources of user activities as well as methods for inferring conversion likelihood given the activities. We also explore the role played by the temporal aspect of user activities for targeting, e.g., how recent activities compare to the old ones. Based on a rigorous offline empirical evaluation over 200 individual advertising campaigns, we arrive at what we believe are best practices for behavioral targeting. We deploy our approach over live user traffic to demonstrate its superiority over existing state-of-the-art targeting methods.
FINANCIAL TIME SERIES FORECASTING USING ARTIFICIAL NEURAL NETWORKS

Financial and capital markets (especially stock markets) are considered high return investment fields, which in the same time are dominated by uncertainty and volatility. Stock market prediction tries to reduce this uncertainty and consequently the risk. As stock markets are influenced by many economical, political and even psychological factors, it is very difficult to forecast the movement of future values. Since classical statistical methods (primarily technical and fundamental analysis) are unable to deal with the non-linearity in the dataset, thus it became necessary the utilization of more advanced forecasting procedures. Financial prediction is a research active area and neural networks have been proposed as one of the most promising methods for such predictions. Artificial Neural Networks (ANNs) mimics, simulates the learning capability of the human brain. NNs are able to find accurate solutions in a complex, noisy environment or even to deal efficiently with partial information. In the last decade the ANNs have been widely used for predicting financial markets, because they are capable to detect and reproduce linear and nonlinear relationships among a set of variables. Furthermore they have a potential of learning the underlying mechanics of stock markets, i.e. to capture the complex dynamics and non-linearity of the stock market time series. In this paper, study we will get acquainted with some financial time series analysis concepts and theories linked to stock markets, as well as with the neural networks based systems and hybrid techniques that were used to solve several forecasting problems concerning the capital, financial and stock markets. Putting the foregoing experimental results to use, we will develop, implement a multilayer feedforward neural network based financial time series forecasting system. Thus, this system will be used to predict the future index values of major US and European stock exchanges and the evolution of interest rates as well as the future stock price of some US mammoth companies (primarily from IT branch).
Next Generation Cloud Computing: New Trends and Research Directions

The landscape of cloud computing has significantly changed over the last decade. Not only have more providers and service offerings crowded the space, but also cloud infrastructure that was traditionally limited to single provider data centers is now evolving. In this paper, we firstly discuss the changing cloud infrastructure and consider the use of infrastructure from multiple providers and the benefit of decentralising computing away from data centers. These trends have resulted in the need for a variety of new computing architectures that will be offered by future cloud infrastructure. These architectures are anticipated to impact areas, such as connecting people and devices, data-intensive computing, the service space and self-learning systems. Finally, we lay out a roadmap of challenges thatwill need to be addressed for realising the potential of next generation cloud systems.
Interactive Global Illumination using Fast Ray Tracing

Rasterization hardware provides interactive frame rates for rendering dynamic scenes, but lacks the ability of ray tracing required for efficient global illumination simulation. Existing ray tracing based methods yield high quality renderings but are far too slow for interactive use. We present a new parallel global illumination algorithm that perfectly scales, has minimal preprocessing and communication overhead, applies highly efficient sampling techniques based on randomized quasi-Monte Carlo integration, and benefits from a fast parallel ray tracing implementation by shooting coherent groups of rays. Thus a performance is achieved that allows for applying arbitrary changes to the scene, while simulating global illumination including shadows from area light sources, indirect illumination, specular effects, and caustics at interactive frame rates. Ceasing interaction rapidly provides high quality renderings.
An Introduction to Nonlinear Dimensionality Reduction by Maximum Variance Unfolding

Many problems in AI are simplified by clever representations of sensory or symbolic input. How to discover such representations automatically, from large amounts of unlabeled data, remains a fundamental challenge. The goal of statistical methods for dimensionality reduction is to detect and discover low dimensional structure in high dimensional data. In this paper, we review a recently proposed algorithm— maximum variance unfolding—for learning faithful low dimensional representations of high dimensional data. The algorithm relies on modern tools in convex optimization that are proving increasingly useful in many areas of machine learning.
Modified Banker's algorithm for scheduling in multi-AGV systems

In today's highly complex multi-AGV systems key research objective is finding a scheduling and routing policy that avoids deadlock while assuring that vehicle utilization is as high as possible. It is well known that finding such an optimal policy is a NP-hard task in general case. Therefore, big part of the research is oriented towards finding various suboptimal policies that can be applied to real world plants. In this paper we propose modified Banker's algorithm for scheduling in multi-AGV systems. A predetermined mission's path is executed in a way that some non-safe states are allowed in order to achieve better utilization of vehicles. A graph-based method of polynomial complexity for verification of these states is given. Algorithm is tested on a layout of a real plant for packing and warehousing palettes. Results shown at the end of the paper demonstrate advantages of the proposed method compared with other methods based on Banker's algorithm.
Dense Prediction on Sequences with Time-Dilated Convolutions for Speech Recognition

In computer vision pixelwise dense prediction is the task of predicting a label for each pixel in the image. Convolutional neural networks achieve good performance on this task, while being computationally efficient. In this paper we carry these ideas over to the problem of assigning a sequence of labels to a set of speech frames, a task commonly known as framewise classification. We show that dense prediction view of framewise classification offers several advantages and insights, including computational efficiency and the ability to apply batch normalization. When doing dense prediction we pay specific attention to strided pooling in time and introduce an asymmetric dilated convolution, called time-dilated convolution, that allows for efficient and elegant implementation of pooling in time. We show that by using time-dilated convolutions with a very deep VGG-style CNN with batch normalization, we achieve best published single model accuracy result on the switchboard-2000 benchmark dataset.
Low-power FPGA using pre-defined dual-Vdd/dual-Vt fabrics

Traditional FPGAs use uniform supply voltage Vdd and uniform threshold voltage Vt. We propose to use pre-defined dual-Vdd and dual-Vt fabrics to reduce FPGA power. We design FPGA circuits with dual-Vdd/dual-Vt to effectively reduce both dynamic power and leakage power, and define dual-Vdd/dual-Vt FPGA fabrics based on the profiling of benchmark circuits. We further develop CAD algorithms including power-sensitivity based voltage assignment and simulated-annealing based placement to leverage such fabrics. Compared to the conventional fabric using uniform Vdd/Vt at the same target clock frequency, our new fabric using dual Vt achieves 9% to 20% power reduction. However, the pre-defined FPGA fabric using both dual Vdd and dual Vt only achieves on average 2% extra power reduction. It is because that the pre-designed dual-Vdd layout pattern introduces non-negligible performance penalty. Therefore, programmability of supply voltage is needed to achieve significant power saving for dual-Vdd FPGAs. To our best knowledge, it is the first in-depth study on applying both dual-Vdd and dual-Vt to FPGA considering circuits, fabrics and CAD algorithms.
The cost structure of sensemaking

Making sense of a body of data is a common activity in any kind of analysis. Sensemaking is the process of searching for a representation and encoding data in that representation to answer task-specific questions. Different operations during sensemaking require different cognitive and external resources. Representations are chosen and changed to reduce the cost of operations in an information processing task. The power of these representational shifts is generally under-appreciated as is the relation between sensemaking and information retrieval.
We analyze sensemaking tasks and develop a model of the cost structure of sensemaking. We discuss implications for the integrated design of user interfaces, representational tools, and information retrieval systems.
Simultaneous acquisition of spatial harmonics (SMASH): fast imaging with radiofrequency coil arrays.

SiMultaneous Acquisition of Spatial Harmonics (SMASH) is a new fast-imaging technique that increases MR image acquisition speed by an integer factor over existing fast-imaging methods, without significant sacrifices in spatial resolution or signal-to-noise ratio. Image acquisition time is reduced by exploiting spatial information inherent in the geometry of a surface coil array to substitute for some of the phase encoding usually produced by magnetic field gradients. This allows for partially parallel image acquisitions using many of the existing fast-imaging sequences. Unlike the data combination algorithms of prior proposals for parallel imaging, SMASH reconstruction involves a small set of MR signal combinations prior to Fourier transformation, which can be advantageous for artifact handling and practical implementation. A twofold savings in image acquisition time is demonstrated here using commercial phased array coils on two different MR-imaging systems. Larger time savings factors can be expected for appropriate coil designs.
An empirical study on large scale text classification with skip-gram embeddings

We investigate the integration of word embeddings as classification features in the setting of large scale text classification. Such representations have been used in a plethora of tasks, however their application in classification scenarios with thousands of classes has not been extensively researched, partially due to hardware limitations. In this work, we examine efficient composition functions to obtain document-level from word-level embeddings and we subsequently investigate their combination with the traditional one-hot-encoding representations. By presenting empirical evidence on large, multi-class, multi-label classification problems, we demonstrate the efficiency and the performance benefits of this combination.
The use of instability to train the core musculature.

Training of the trunk or core muscles for enhanced health, rehabilitation, and athletic performance has received renewed emphasis. Instability resistance exercises have become a popular means of training the core and improving balance. Whether instability resistance training is as, more, or less effective than traditional ground-based resistance training is not fully resolved. The purpose of this review is to address the effectiveness of instability resistance training for athletic, nonathletic, and rehabilitation conditioning. The anatomical core is defined as the axial skeleton and all soft tissues with a proximal attachment on the axial skeleton. Spinal stability is an interaction of passive and active muscle and neural subsystems. Training programs must prepare athletes for a wide variety of postures and external forces, and should include exercises with a destabilizing component. While unstable devices have been shown to be effective in decreasing the incidence of low back pain and increasing the sensory efficiency of soft tissues, they are not recommended as the primary exercises for hypertrophy, absolute strength, or power, especially in trained athletes. For athletes, ground-based free-weight exercises with moderate levels of instability should form the foundation of exercises to train the core musculature. Instability resistance exercises can play an important role in periodization and rehabilitation, and as alternative exercises for the recreationally active individual with less interest or access to ground-based free-weight exercises. Based on the relatively high proportion of type I fibers, the core musculature might respond well to multiple sets with high repetitions (e.g., >15 per set); however, a particular sport may necessitate fewer repetitions.
Uncertainty, Action, and Interaction: In Pursuit of Mixed-Initiative Computing

Recent debate has highlighted differing views on the most promising opportunities for userinterface innovation. 1 One group of investigators has expressed optimism about the potential for refining intelligent-interface agents, suggesting that resear ch should focus on developing more powerful representations and inferential machinery for sensing a use r’s activity and taking automated actions. 2–4 Other researchers have voiced concerns that efforts focused on automation might be better expended on tools and metaphors that enhance the a bilities of users to directly manipulate and inspect objects and information. 5 Rather than advocating one approach over the other, a creative integration of direct manipulati on nd automated services could provide fundamentally new kinds of user experiences, characterize d by deeper, more natural collaborations between users and computers. In particular, there are ich opportunities for interweaving direct control and automation to create mixed-initiative systems and interfaces.
Rekindling network protocol innovation with user-level stacks

Recent studies show that more than 86% of Internet paths allow well-designed TCP extensions, meaning that it is still possible to deploy transport layer improvements despite the existence of middleboxes in the network. Hence, the blame for the slow evolution of protocols (with extensions taking many years to nbecome widely used) should be placed on end systems.
 In this paper, we revisit the case for moving protocols stacks up into user space in order to ease the deployment of new protocols, extensions, or performance optimizations. We present MultiStack, operating system support for user-level protocol stacks. MultiStack runs within commodity operating systems, can concurrently host a large number of isolated stacks, has a fall-back path to the legacy host stack, and is able to process packets at rates of 10Gb/s.
 We validate our design by showing that our mux/demux layer can validate and switch packets at line rate (up to 14.88 Mpps) on a 10 Gbit port using 1-2 cores, and that a proof-of-concept HTTP server running over a basic userspace TCP outperforms by 18-90% both the same server and nginx running over the kernel's stack.