nils-herrmann/clean_scirepeval huggingface dataset:
Structure-aware synthesis for predictive woven fabric appearance

Woven fabrics have a wide range of appearance determined by their small-scale 3D structure. Accurately modeling this structural detail can produce highly realistic renderings of fabrics and is critical for predictive rendering of fabric appearance. But building these yarn-level volumetric models is challenging. Procedural techniques are manually intensive, and fail to capture the naturally arising irregularities which contribute significantly to the overall appearance of cloth. Techniques that acquire the detailed 3D structure of real fabric samples are constrained only to model the scanned samples and cannot represent different fabric designs.
 This paper presents a new approach to creating volumetric models of woven cloth, which starts with user-specified fabric designs and produces models that correctly capture the yarn-level structural details of cloth. We create a small database of volumetric exemplars by scanning fabric samples with simple weave structures. To build an output model, our method synthesizes a new volume by copying data from the exemplars at each yarn crossing to match a weave pattern that specifies the desired output structure. Our results demonstrate that our approach generalizes well to complex designs and can produce highly realistic results at both large and small scales.
Improving software developers' fluency by recommending development environment commands

Software developers interact with the development environments they use by issuing commands that execute various programming tools, from source code formatters to build tools. However, developers often only use a small subset of the commands offered by modern development environments, reducing their overall development fluency. In this paper, we use several existing command recommender algorithms to suggest new commands to developers based on their existing command usage history, and also introduce several new algorithms. By running these algorithms on data submitted by several thousand Eclipse users, we describe two studies that explore the feasibility of automatically recommending commands to software developers. The results suggest that, while recommendation is more difficult in development environments than in other domains, it is still feasible to automatically recommend commands to developers based on their usage history, and that using patterns of past discovery is a useful way to do so.
Person re-identification with content and context re-ranking

This paper proposes a novel and efficient re-ranking technque to solve the person re-identification problem in the surveillance application. Previous methods treat person re-identification as a special object retrieval problem, and compute the retrieval result purely based on a unidirectional matching between the probe and all gallery images. However, the correct matching may be not included in the top-k ranking result due to appearance changes caused by variations in illumination, pose, viewpoint and occlusion. To obtain more accurate re-identification results, we propose to reversely query every gallery person image in a new gallery composed of the original probe person image and other gallery person images, and revise the initial query result according to bidirectional ranking lists. The behind philosophy of our method is that images of the same person should not only have similar visual content, refer to content similarity, but also possess similar k-nearest neighbors, refer to context similarity. Furthermore, the proposed bidirectional re-ranking method can be divided into offline and online parts, where the majority of computation load is accomplished by the offline part and the online computation complexity is only proportional to the size of the gallery data set, which is especially suited to the real-time required video investigation task. Extensive experiments conducted on a series of standard data sets have validated the effectiveness and efficiency of our proposed method.
Design of a broadband coaxial to substrate integrated waveguide (SIW) transition

In this paper, a novel design of broadband coaxial to substrate integrated waveguide (SIW) transition has been implemented. The difficulties to get impedance matching between SIW and excitation port especially for thin substrate has been investigated and design steps to overcome the problem has been discussed. A two port SIW section using back-to-back configuration of the proposed transition is designed to operate at X-band (8-12 GHz) and fabricated. The measured result shows a broad bandwidth (30%) and an insertion loss of 1.2 dB in the operating band.
Learning Neural Network Architectures using Backpropagation

Deep neural networks with millions of parameters are at the heart of many state of the art machine learning models today. However, recent works have shown that models with much smaller number of parameters can also perform just as well. In this work, we introduce the problem of architecture-learning, i.e; learning the architecture of a neural network along with weights. We start with a large neural network, and then learn which neurons to prune. To this end, we introduce a new trainable parameter called the Tri-State ReLU, which helps in pruning unnecessary neurons. We also propose a smooth regularizer which encourages the total number of neurons after elimination to be small. The resulting objective is differentiable and simple to optimize. We experimentally validate our method on both small and large networks, and show that it can learn models with considerably smaller number of parameters without affecting prediction accuracy.
Personal data vaults: a locus of control for personal data streams

The increasing ubiquity of the mobile phone is creating many opportunities for personal context sensing, and will result in massive databases of individuals' sensitive information incorporating locations, movements, images, text annotations, and even health data. In existing system architectures, users upload their raw (unprocessed or filtered) data streams directly to content-service providers and have little control over their data once they "opt-in".
 We present Personal Data Vaults (PDVs), a privacy architecture in which individuals retain ownership of their data. Data are routinely filtered before being shared with content-service providers, and users or data custodian services can participate in making controlled data-sharing decisions. Introducing a PDV gives users flexible and granular access control over data. To reduce the burden on users and improve usability, we explore three mechanisms for managing data policies: Granular ACL, Trace-audit and Rule Recommender. We have implemented a proof-of-concept PDV and evaluated it using real data traces collected from two personal participatory sensing applications.
Systematic Retrieval of Scientific Literature based on Citation Relations: Introducing the CitNetExplorer Tool

We consider the problem of scientific literature search, and we suggest that citation relations between publications can be very helpful in the systematic retrieval of scientific literature. We introduce a new software tool called CitNetExplorer that can be used for citation-based scientific literature retrieval. To demonstrate the use of CitNetExplorer, we employ the tool to identify publications dealing with the topic of community detection in networks. Citationbased scientific literature retrieval can be especially helpful in situations in which one needs to obtain a comprehensive overview of the literature on a certain research topic, for instance in the preparation of a review article.
Exploring the representation capabilities of the HOG descriptor

Object recognition strategies are increasingly based on regional descriptors such as SIFT or HOG at a sparse set of points or on a dense grid of points. Despite their success on databases such as PASCAL and CALTECH, the capability of such a representation in capturing the essential object content of the image is not well-understood: How large is the equivalence class of images sharing the same HOG descriptor? Are all these images from the same object category, and if not, do the non-category images resemble random images which cannot generically arise from imaged scenes? How frequently do images from two categories share the same HOG-based representation? These questions are increasingly more relevant as very large databases such as ImageNet and LabelMe are being developed where the current object recognition strategies show limited success. We examine these questions by introducing the metameric class of moments of HOG which allows for a target image to be morphed into an impostor image sharing the HOG representation of a source image while retaining the initial visual appearance. We report that two distinct images can be made to share the same HOG representation when the overlap between HOG patches is minimal, and the success of this method falls with increasing overlap. This paper is therefore a step in the direction of developing a sampling theorem for representing images by HOG features.
Quality-of-Service Routing for Supporting Multimedia Applications

In recent years, several new architectures have been developed for supporting multimedia applications such as digital video and audio. However, quality of service routing is an important element that is still missing from these architectures. In this paper we consider a number of issues in QoS routing. We first examine the basic problem of QoS routing, namely, finding a path that satisfy multiple constraints, and its implications on routing metric selection, and then present three path computation algorithms for source routing and for hop-by-hop routing.
Walk the Talk: Connecting Language, Knowledge, and Action in Route Instructions

Following verbal route instructions requires knowledge of language, space, action and perception. We present MARCO, an agent that follows free-form, natural language route instructions by representing and executing a sequence of compound action specifications that model which actions to take under which conditions. MARCO infers implicit actions from knowledge of both linguistic conditional phrases and from spatial action and local configurations. Thus, MARCO performs explicit actions, implicit actions necessary to achieve the stated conditions, and exploratory actions to learn about the world. We gathered a corpus of 786 route instructions from six people in three large-scale virtual indoor environments. Thirtysix other people followed these instructions and rated them for quality. These human participants finished at the intended destination on 69% of the trials. MARCO followed the same instructions in the same environments, with a success rate of 61%. We measured the efficacy of action inference with MARCO variants lacking action inference: executing only explicit actions, MARCO succeeded on just 28% of the trials. For this task, inferring implicit actions is essential to follow poor instructions, but is also crucial for many highly-rated route instructions.
Deep Android Malware Detection

In this paper, we propose a novel android malware detection system that uses a deep convolutional neural network (CNN). Malware classification is performed based on static analysis of the raw opcode sequence from a disassembled program. Features indicative of malware are automatically learned by the network from the raw opcode sequence thus removing the need for hand-engineered malware features. The training pipeline of our proposed system is much simpler than existing n-gram based malware detection methods, as the network is trained end-to-end to jointly learn appropriate features and to perform classification, thus removing the need to explicitly enumerate millions of n-grams during training. The network design also allows the use of long n-gram like features, not computationally feasible with existing methods. Once trained, the network can be efficiently executed on a GPU, allowing a very large number of files to be scanned quickly.
Pick-by-Vision: A first stress test

In this paper we report on our ongoing studies around the application of Augmented Reality methods to support the order picking process of logistics applications. Order picking is the gathering of goods out of a prepared range of items following some customer orders. We named the visual support of this order picking process using Head-mounted Displays “Pick-by-Vision”. This work presents the case study of bringing our previously developed Pickby-Vision system from the lab to an experimental factory hall to evaluate it under more realistic conditions. This includes the execution of two user studies. In the first one we compared our Pickby-Vision system with and without tracking to picking using a paper list to check picking performance and quality in general. In a second test we had subjects using the Pick-by-Vision system continuously for two hours to gain in-depth insight into the longer use of our system, checking user strain besides the general performance. Furthermore, we report on the general obstacles of trying to use HMD-based AR in an industrial setup and discuss our observations of user behaviour.
Classification for High Resolution Remote Sensing Imagery Using a Fully Convolutional Network

As a variant of Convolutional Neural Networks (CNNs) in Deep Learning, the Fully Convolutional Network (FCN) model achieved state-of-the-art performance for natural image semantic segmentation. In this paper, an accurate classification approach for high resolution remote sensing imagery based on the improved FCN model is proposed. Firstly, we improve the density of output class maps by introducing Atrous convolution, and secondly, we design a multi-scale network architecture by adding a skip-layer structure to make it capable for multi-resolution image classification. Finally, we further refine the output class map using Conditional Random Fields (CRFs) post-processing. Our classification model is trained on 70 GF-2 true color images, and tested on the other 4 GF-2 images and 3 IKONOS true color images. We also employ object-oriented classification, patch-based CNN classification, and the FCN-8s approach on the same images for comparison. The experiments show that compared with the existing approaches, our approach has an obvious improvement in accuracy. The average precision, recall, and Kappa coefficient of our approach are 0.81, 0.78, and 0.83, respectively. The experiments also prove that our approach has strong applicability for multi-resolution image classification.
Image matching using local symmetry features

We present a new technique for extracting local features from images of architectural scenes, based on detecting and representing local symmetries. These new features are motivated by the fact that local symmetries, at different scales, are a fundamental characteristic of many urban images, and are potentially more invariant to large appearance changes than lower-level features such as SIFT. Hence, we apply these features to the problem of matching challenging pairs of photos of urban scenes. Our features are based on simple measures of local bilateral and rotational symmetries computed using local image operations. These measures are used both for feature detection and for computing descriptors. We demonstrate our method on a challenging new dataset containing image pairs exhibiting a range of dramatic variations in lighting, age, and rendering style, and show that our features can improve matching performance for this difficult task.
A single feed dual-band, linearly/circularly polarized cross-slot millimeter-wave antenna for future 5G networks

A low-profile, single-fed, dual-band, linearly/circularly polarized antenna for future 5G networks in the millimeter wave frequency regime is presented. The antenna comprises of two truncated-corner square patches. A cross-slot is etched on the inner patch. It is shown that this cross-slot generates additional resonances and lowers the axial ratio (AR) of the radiating structure. The proposed antenna is fed asymmetrically by a two-section microstrip line. The overall size of the antenna is only 8 mm × 8 mm. The proposed antenna operates at 28 GHz and 38 GHz. The antenna is linearly polarized in the lower band with an impedance bandwidth from 27.55 GHz to 28.15 GHz for |S11| < −10 dB. The antenna is circularly polarized in the upper band with an impedance bandwidth from 37.2 GHz to 38.3 GHz for |S11| < −10 dB and axial ratio (AR) bandwidth from 37.1 GHz to 38.1 GHz for AR < 3 dB. The antenna has a stable radiation pattern and a gain of greater than 6 dBi over both frequency bands.
Design and Implementation of SecPod, A Framework for Virtualization-Based Security Systems

The OS kernel is critical to the security of a computer system. Many systems have been proposed to improve its security. A fundamental weakness of those systems is that page tables, the data structures that control the memory protection, are not isolated from the vulnerable kernel, and thus subject to tampering. To address that, researchers have relied on virtualization for reliable kernel memory protection. Unfortunately, such memory protection requires to monitor every update to the guest's page tables. This fundamentally conflicts with the recent advances in the hardware virtualization support. In this paper, we present the design and implementation of SecPod, a practical and extensible framework for virtualization-based security systems that can provide both strong isolation and the compatibility with modern hardware. SecPod has two key techniques: paging delegation delegates and audits the kernel's paging operations to a secure space; execution trapping intercepts the (compromised) kernel's attempts to subvert SecPod by misusing privileged instructions. We have implemented a prototype of SecPod based on KVM. Our experiments show that SecPod is both effective and efficient.
Application of Dimensionality Reduction in Recommender System - A Case Study

We investigate the use of dimensionality reduction to improve performance for a new class of data analysis software called “recommender systems”. Recommender systems apply knowledge discovery techniques to the problem of making product recommendations during a live customer interaction. These systems are achieving widespread success in E-commerce nowadays, especially with the advent of the Internet. The tremendous growth of customers and products poses three key challenges for recommender systems in the E-commerce domain. These are: producing high quality recommendations, performing many recommendations per second for millions of customers and products, and achieving high coverage in the face of data sparsity. One successful recommender system technology is collaborative filtering , which works by matching customer preferences to other customers in making recommendations. Collaborative filtering has been shown to produce high quality recommendations, but the performance degrades with the number of customers and products. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very largescale problems. This paper presents two different experiments where we have explored one technology called Singular Value Decomposition (SVD) to reduce the dimensionality of recommender system databases. Each experiment compares the quality of a recommender system using SVD with the quality of a recommender system using collaborative filtering. The first experiment compares the effectiveness of the two recommender systems at predicting consumer preferences based on a database of explicit ratings of products. The second experiment compares the effectiveness of the two recommender systems at producing Top-N lists based on a real-life customer purchase database from an E-Commerce site. Our experience suggests that SVD has the potential to meet many of the challenges of recommender systems, under certain conditions.
Efficient structure detection via random consensus graph

In this paper, we propose an efficient method to detect the underlying structures in data. The same as RANSAC, we randomly sample MSSs (minimal size samples) and generate hypotheses. Instead of analyzing each hypothesis separately, the consensus information in all hypotheses is naturally fused into a hypergraph, called random consensus graph, with real structures corresponding to its dense subgraphs. The sampling process is essentially a progressive refinement procedure of the random consensus graph. Due to the huge number of hyperedges, it is generally inefficient to detect dense subgraphs on random consensus graphs. To overcome this issue, we construct a pairwise graph which approximately retains the dense subgraphs of the random consensus graph. The underlying structures are then revealed by detecting the dense subgraphs of the pair-wise graph. Since our method fuses information from all hypotheses, it can robustly detect structures even under a small number of MSSs. The graph framework enables our method to simultaneously discover multiple structures. Besides, our method is very efficient, and scales well for large scale problems. Extensive experiments illustrate the superiority of our proposed method over previous approaches, achieving several orders of magnitude speedup along with satisfactory accuracy and robustness.
Validating the performance of a 32nm CMOS high speed serial link receiver with adaptive equalization and baud-rate clock data recovery

On-Die features available for validation and test on an integrated circuit play a major role in evaluating the performance of the functionality being realized by the circuit in a post-silicon environment and can considerably reduce time to market of the end-product. In the case of high-speed IO, it is also important to note that the type of on-die hooks required to debug and validate the performance and robustness of the design depend on several factors, of which the type of I/O architecture chosen plays a key role. In order to support high data rates, the serial I/O design in this paper implements a receiver with adaptive equalization engine for the compensation of inter-symbol interference (ISI) and real-time environmental changes (temperature and voltage). This paper describes the debug hooks and their usage models in such a high-speed I/O designed using a 32nm CMOS process. These hooks have been tested in the lab and proven to be very useful. While the main focus of the paper is to describe the hooks, how they are used in the lab for observing the robustness in the dynamic behavior of the adaptive loops and the measurement results; the reader is also provided with a brief insight into the equations describing the loops behavior together with a description of the loops implementation details.
Denoising Distantly Supervised Open-Domain Question Answering

Careful Reading Fast Skimming p1: As the capital of Ireland, Dublin is ... p3: Dublin is the capital of Ireland. Besides, Dublin is one of famous tourist cities in Ireland and ... p1: As the capital of Ireland, Dublin is ... p3: Dublin is the capital of Ireland. Besides, Ottawa is one of famous tourist cities in Ireland and ... Paragraph Selector Paragraph Reader P(pi |q,P) P(a|q,pi ) P(a|q,P)= P(a|q,pi )P(pi |q,P) pi∈P ∑