nils-herrmann/clean_scirepeval huggingface dataset:
Color nonuniformity in projection-based displays: analysis and solutions

Large-area displays made up of several projectors show significant variation in color. Here, we identify different projector parameters that cause the color variation and study their effects on the luminance and chrominance characteristics of the display. This work leads to the realization that luminance varies significantly within and across projectors, while chrominance variation is relatively small, especially across projectors of same model. To address this situation, we present a method to achieve luminance matching across all pixels of a multiprojector display that results in photometrically uniform displays. We use a camera as a measurement device for this purpose. Our method comprises a one-time calibration step that generates a per channel per projector luminance attenuation map (LAM), which is then used to correct any image projected on the display at interactive rates on commodity graphics hardware. To the best of our knowledge, this is the first effort to match luminance across all the pixels of a multiprojector display.
Sequence variants in SLITRK1 are associated with Tourette's syndrome.

Tourette's syndrome (TS) is a genetically influenced developmental neuropsychiatric disorder characterized by chronic vocal and motor tics. We studied Slit and Trk-like 1 (SLITRK1) as a candidate gene on chromosome 13q31.1 because of its proximity to a de novo chromosomal inversion in a child with TS. Among 174 unrelated probands, we identified a frameshift mutation and two independent occurrences of the identical variant in the binding site for microRNA hsa-miR-189. These variants were absent from 3600 control chromosomes. SLITRK1 mRNA and hsa-miR-189 showed an overlapping expression pattern in brain regions previously implicated in TS. Wild-type SLITRK1, but not the frameshift mutant, enhanced dendritic growth in primary neuronal cultures. Collectively, these findings support the association of rare SLITRK1 sequence variants with TS.
A complete formalized knowledge representation model for advanced digital forensics timeline analysis

Having a clear view of events that occurred over time is a difficult objective to achieve in digital investigations (DI). Event reconstruction, which allows investigators to understand the timeline of a crime, is one of the most important step of a DI process. This complex task requires exploration of a large amount of events due to the pervasiveness of new technologies nowadays. Any evidence produced at the end of the investigative process must also meet the requirements of the courts, such as reproducibility, verifiability, validation, etc. For this purpose, we propose a new methodology, supported by theoretical concepts, that can assist investigators through the whole process including the construction and the interpretation of the events describing the case. The proposed approach is based on a model which integrates knowledge of experts from the fields of digital forensics and software development to allow a semantically rich representation of events related to the incident. The main purpose of this model is to allow the analysis of these events in an automatic and efficient way. This paper describes the approach and then focuses on the main conceptual and formal aspects: a formal incident modelization and operators for timeline reconstruction and analysis.
An empirical study on developer-related factors characterizing fix-inducing commits

This paper analyzes developer related factors that could influence the likelihood for a commit to induce a fix. Specifically, we focus on factors that could potentially hinder developers’ ability to correctly understand the code components involved in the change to be committed: (i) the coherence of the commit (i.e., how much it is focused on a specific topic), (ii) the experience level of the developer on the files involved in the commit, and (iii) the interfering changes performed by other developers on the files involved in past commits. The results of our study indicate that “fix-inducing” commits (i.e., commits that induced a fix) are significantly less coherent than “clean” commits (i.e., commits that did not induce a fix). Surprisingly, “fix-inducing” commits are performed by more experienced developers, yet, those are the developers performing more complex changes in the system. Finally, “fix-inducing” commits have a higher number of past interfering changes as compared to “clean” commits. Our empirical study sheds light on previously unexplored factors and presents significant results that can be used to improve approaches for defect prediction.
A novel HU-shaped common-mode filter for GHz differential signals

A novel low-cost filter design for common-mode noise suppression in high-speed differential signals is proposed. It is realized by etching a HU-shaped defected-ground structure (DGS) to perturb the return current of the common-mode noise. A simple LC resonator model for the proposed structure is also developed with good agreement to the full-wave simulation and measurement result. It is found that over 15 dB of common-mode noise suppression can be achieved over a wide frequency ranges from 3.6 to 9.1 GHz, while the differential signals still keep good signal integrity in eye-pattern observation.
A 45nm Logic Technology with High-k+Metal Gate Transistors, Strained Silicon, 9 Cu Interconnect Layers, 193nm Dry Patterning, and 100% Pb-free Packaging

A 45 nm logic technology is described that for the first time incorporates high-k + metal gate transistors in a high volume manufacturing process. The transistors feature 1.0 nm EOT high-k gate dielectric, dual band edge workfunction metal gates and third generation strained silicon, resulting in the highest drive currents yet reported for NMOS and PMOS. The technology also features trench contact based local routing, 9 layers of copper interconnect with low-k ILD, low cost 193 nm dry patterning, and 100% Pb-free packaging. Process yield, performance and reliability are demonstrated on 153 Mb SRAM arrays with SRAM cell size of 0.346 mum2, and on multiple microprocessors.
The Predictron: End-To-End Learning and Planning

One of the key challenges of artificial intelligence is to learn models that are effective in the context of planning. In this document we introduce the predictron architecture. The predictron consists of a fully abstract model, represented by a Markov reward process, that can be rolled forward multiple “imagined” planning steps. Each forward pass of the predictron accumulates internal rewards and values over multiple planning depths. The predictron is trained end-toend so as to make these accumulated values accurately approximate the true value function. We applied the predictron to procedurally generated random mazes and a simulator for the game of pool. The predictron yielded significantly more accurate predictions than conventional deep neural network architectures.
Distance Measurement Model Based on RSSI in WSN

The relationship between RSSI (Received Signal Strength Indication) values and distance is the foundation and the key of ranging and positioning technologies in wireless sensor networks. Log-normal shadowing model (LNSM), as a more general signal propagation model, can better describe the relationship between the RSSI value and distance, but the parameter of variance in LNSM is depended on experiences without self-adaptability. In this paper, it is found that the variance of RSSI value changes along with distance regularly by analyzing a large number of experimental data. Based on the result of analysis, we proposed the relationship function of the variance of RSSI and distance, and established the log-normal shadowing model with dynamic variance (LNSM-DV). At the same time, the method of least squares(LS) was selected to estimate the coefficients in that model, thus LNSM-DV might be adjusted dynamically according to the change of environment and be self-adaptable. The experimental results show that LNSM-DV can further reduce error, and have strong self-adaptability to various environments compared with the LNSM.
RoadGraph: High level sensor data fusion between objects and street network

The RoadGraph is a graph based environmental model for driver assistance systems. It integrates information from different sources like digital maps, onboard sensors and V2X communication into one single model about the vehicle's environment. At the moment of information aggregation some function independent situation analysis is done. In this paper we look at techniques for lane-precise map-matching even with moderate GPS reception using distinct information sources. We also analyze the concepts of aggregating objects from different sources with a-priori knowledge of the street-layout. Results of this novelty approach are shown.
Automatic Optimization Computational Method for Unconventional S . W . A . T . H . Ships Resistance

The paper illustrates the main theoretical and computational aspects of an automatic computer based procedure for the parametric shape optimization of a particular unconventional hull typology: that for a catamaran S.W.A.T.H. ship. The goal of the integrated computational procedure is to find the best shape of the submerged hulls of a new U.S.V. (Unmanned Surface Vehicle) S.W.A.T.H. (Small Waterplane Area Twin Hull) vessel, in terms of minimum wave pattern resistance. After dealing with the theoretical aspects the papers presents the numerical aspects of the main software module of the automatic procedure, which integrates a parametric generation routine for innovative and unconventional S.W.A.T.H. (Small Waterplane Area Twin Hull) vessel geometry, a multi-objective, globally convergent and constrained, optimization algorithm and a Computational Fluid Dynamic (C.F.D.) solver. The integrated process is able to find the best shape of the submerged hull of the vessel, subject to the total displaced volume constraint. The hydrodynamic computation is carried out by means of a free surface potential flow method and it is addressed to find the value of wave resistance of each hull variant. Results of the application of the described computational procedure are presented for two optimization cases and the obtained best shapes are compared with a conventional one, featuring a typical torpedo-shaped body, proving the effectiveness of the method in reducing the resistance by a considerable extent, in the order of 40 percent. S.W.A.T.H., B.E.M., Wave Resistance, Parametric Modeling, Optimization, Genetic Algorithms
FAST: fast architecture sensitive tree search on modern CPUs and GPUs

In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor architectures for database primitives like scan, sort, join and aggregation. However, unlike other primitives, tree search presents significant challenges due to irregular and unpredictable data accesses in tree traversal.
 In this paper, we present FAST, an extremely fast architecture sensitive layout of the index tree. FAST is a binary tree logically organized to optimize for architecture features like page size, cache line size, and SIMD width of the underlying hardware. FAST eliminates impact of memory latency, and exploits thread-level and datalevel parallelism on both CPUs and GPUs to achieve 50 million (CPU) and 85 million (GPU) queries per second, 5X (CPU) and 1.7X (GPU) faster than the best previously reported performance on the same architectures. FAST supports efficient bulk updates by rebuilding index trees in less than 0.1 seconds for datasets as large as 64Mkeys and naturally integrates compression techniques, overcoming the memory bandwidth bottleneck and achieving a 6X performance improvement over uncompressed index search for large keys on CPUs.
An All-Memristor Deep Spiking Neural Network: A Step Towards Realizing the Low Power, Stochastic Brain

Deep ‘Analog Artificial Neural Networks’ (ANNs) perform complex classification problems with remarkably high accuracy. However, they rely on humongous amount of power to perform the calculations, veiling the accuracy benefits. The biological brain on the other hand is significantly more powerful than such networks and consumes orders of magnitude less power, indicating us about some conceptual mismatch. Given that the biological neurons communicate using energy efficient trains of spikes, and the behavior is non-deterministic, incorporating these effects in deep neural networks may drive us few steps towards a more realistic neuron. In this work, we propose how the inherent stochasticity of nano-scale resistive devices can be harnessed to emulate the functionality of a spiking neuron that can be incorporated in a deep Spiking Neural Networks (SNN). At the algorithmic level, we propose how the training can be modified to convert an ANN to an SNN while supporting the stochastic activation function offered by these devices. We devise circuit architectures to incorporate stochastic memristive neurons along with memristive crossbars which perform the functionality of the synaptic weights. We tested the proposed All Memristor deep SNN for image classification and observed only about 1% degradation in accuracy with the deep analog ANN baseline after incorporating the circuit and device related non-idealities. We witnessed that the network is robust to variations and consumes ∼ ×11 less energy than its CMOS counterpart.
A pseudo-class-AB telescopic-cascode operational amplifier

A class-AB architecture for single-stage operational amplifiers is presented. The structure employs a switched-capacitor level shifter to apply the signal to both sink and source output transistors to create the class-AB behavior. Using this structure, the current mirror circuit of traditional class-AB structures can be eliminated. Thus some power can be saved and the operation frequency can be increased. Simulation results of a fast-settling telescopic-cascode op-amp employing this pseudo-class-AB technique confirm the effectiveness of the approach to reduce the power consumption. This approach can be applied to the first stage of a two-stage op-amp as well, to increase the slew rate. The simulated 12-bit 100-Ms/s sample-and-hold amplifier employing the proposed pseudo-class-AB telescopic-cascode op-amp consumes only 16 mW from 3.3 V power supply.
User Identity Linkage by Latent User Space Modelling

User identity linkage across social platforms is an important problem of great research challenge and practical value. In real applications, the task often assumes an extra degree of difficulty by requiring linkage across multiple platforms. While pair-wise user linkage between two platforms, which has been the focus of most existing solutions, provides reasonably convincing linkage, the result depends by nature on the order of platform pairs in execution with no theoretical guarantee on its stability. In this paper, we explore a new concept of ``Latent User Space'' to more naturally model the relationship between the underlying real users and their observed projections onto the varied social platforms, such that the more similar the real users, the closer their profiles in the latent user space. We propose two effective algorithms, a batch model(ULink) and an online model(ULink-On), based on latent user space modelling. Two simple yet effective optimization methods are used for optimizing objective function: the first one based on the constrained concave-convex procedure(CCCP) and the second on accelerated proximal gradient. To our best knowledge, this is the first work to propose a unified framework to address the following two important aspects of the multi-platform user identity linkage problem --- (I) the platform multiplicity and (II) online data generation. We present experimental evaluations on real-world data sets for not only traditional pairwise-platform linkage but also multi-platform linkage. The results demonstrate the superiority of our proposed method over the state-of-the-art ones.
Why do we trust new technology? A study of initial trust formation with organizational information systems

Recent trust research in the information systems (IS) field has described trust as a primary predictor of technology usage and a fundamental construct for understanding user perceptions of technology. Initial trust formation is particularly relevant in an IS context, as users must overcome perceptions of risk and uncertainty before using a novel technology. With initial trust in a more complex, organizational information system, there are a number of external determinants, trusting bases, that may explain trust formation and provide organizations with the needed levers to form or change individuals’ initial trust in technology. In this study, a research model of initial trust formation is developed and includes trusting bases, trusting beliefs, trusting attitude and subjective norm, and trusting intentions. Eight trusting base factors are assessed including personality, cognitive, calculative, and both technology and organizational factors of the institutional base. The model is empirically tested with 443 subjects in the context of initial trust in a national identity system (NID). The proposed model was supported and the results indicate that subjective norm and the cognitive–reputation, calculative, and organizational situational normality base factors significantly influence initial trusting beliefs and other downstream trust constructs. Factors from some of the more commonly investigated bases, personality and technology institutional, did not significantly affect trusting beliefs. The findings have strategic implications for agencies implementing e-government systems and organizational information systems in general.
Simple and Space-Efficient Minimal Perfect Hash Functions

A perfect hash function (PHF) h : U → [0, m − 1] for a key set S is a function that maps the keys of S to unique values. The minimum amount of space to represent a PHF for a given set S is known to be approximately 1.44n/m bits, where n = |S|. In this paper we present new algorithms for construction and evaluation of PHFs of a given set (for m = n and m = 1.23n), with the following properties: 1. Evaluation of a PHF requires constant time. 2. The algorithms are simple to describe and implement, and run in linear time. 3. The amount of space needed to represent the PHFs is around a factor 2 from the information theoretical minimum. No previously known algorithm has these properties. To our knowledge, any algorithm in the literature with the third property either: – Requires exponential time for construction and evaluation, or – Uses near-optimal space only asymptotically, for extremely large n. Thus, our main contribution is a scheme that gives low space usage for realistic values of n. The main technical ingredient is a new way of basing PHFs on random hypergraphs. Previously, this approach has been used to design simple PHFs with superlinear space usage. ⋆ This work was supported in part by GERINDO Project–grant MCT/CNPq/CTINFO 552.087/02-5, and CNPq Grants 30.5237/02-0 (Nivio Ziviani) and 142786/2006-3 (Fabiano C. Botelho) 3 This version of the paper is identical to the one published in the WADS 2007 proceedings. Unfortunately, it does not give reference and credit to the paper The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables, by Chazelle et al.,  They present a way of constructing PHFs that is equivalent to ours. It is explained as a modification of the “Bloomier Filter” data structure at the end of Section 3.3, but they do not make explicit that a PHF is constructed. Thus, the simple construction of a PHF described must be attributed to Chazelle et al. The new contribution of this paper is to analyze and optimize the constant of the space usage considering implementation aspects as well as a way of constructing MPHFs from that PHFs.
Building event-centric knowledge graphs from news

Knowledge graphs have gained increasing popularity in the past couple of years, thanks to their adoption in everyday search engines. Typically, they consist of fairly static and encyclopedic facts about persons and organizations – e.g. a celebrity’s birth date, occupation and family members – obtained from large repositories such as Freebase or Wikipedia. In this paper, we present a method and tools to automatically build knowledge graphs from news articles. As news articles describe changes in the world through the events they report, we present an approach to create Event-Centric Knowledge Graphs (ECKGs) using state-of-the-art natural language processing and semantic web techniques. Such ECKGs capture long-term developments and histories on hundreds of thousands of entities and are complementary to the static encyclopedic information in traditional knowledge graphs. We describe our event-centric representation schema, the challenges in extracting event information from news, our open source pipeline, and the knowledge graphs we have extracted from four different news corpora: general news (Wikinews), the FIFA world cup, the Global Automotive Industry, and Airbus A380 airplanes. Furthermore, we present an assessment on the accuracy of the pipeline in extracting the triples of the knowledge graphs. Moreover, through an event-centered browser and visualization tool we show how approaching information from news in an event-centric manner can increase the user’s understanding of the domain, facilitates the reconstruction of news story lines, and enable to perform exploratory investigation of news hidden facts.
QEMU, a Fast and Portable Dynamic Translator

We present the internals of QEMU, a fast machine emulator using an original portable dynamic translator. It emulates several CPUs (x86, PowerPC, ARM and Sparc) on several hosts (x86, PowerPC, ARM, Sparc, Alpha and MIPS). QEMU supports full system emulation in which a complete and unmodified operating system is run in a virtual machine and Linux user mode emulation where a Linux process compiled for one target CPU can be run on another CPU.
Massive MIMO for next generation wireless systems

Multi-user MIMO offers big advantages over conventional point-to-point MIMO: it works with cheap single-antenna terminals, a rich scattering environment is not required, and resource allocation is simplified because every active terminal utilizes all of the time-frequency bins. However, multi-user MIMO, as originally envisioned, with roughly equal numbers of service antennas and terminals and frequency-division duplex operation, is not a scalable technology. Massive MIMO (also known as large-scale antenna systems, very large MIMO, hyper MIMO, full-dimension MIMO, and ARGOS) makes a clean break with current practice through the use of a large excess of service antennas over active terminals and time-division duplex operation. Extra antennas help by focusing energy into ever smaller regions of space to bring huge improvements in throughput and radiated energy efficiency. Other benefits of massive MIMO include extensive use of inexpensive low-power components, reduced latency, simplification of the MAC layer, and robustness against intentional jamming. The anticipated throughput depends on the propagation environment providing asymptotically orthogonal channels to the terminals, but so far experiments have not disclosed any limitations in this regard. While massive MIMO renders many traditional research problems irrelevant, it uncovers entirely new problems that urgently need attention: the challenge of making many low-cost low-precision components that work effectively together, acquisition and synchronization for newly joined terminals, the exploitation of extra degrees of freedom provided by the excess of service antennas, reducing internal power consumption to achieve total energy efficiency reductions, and finding new deployment scenarios. This article presents an overview of the massive MIMO concept and contemporary research on the topic.