nils-herrmann/clean_scirepeval huggingface dataset:
LookinGood: enhancing performance capture with real-time neural re-rendering

Motivated by augmented and virtual reality applications such as telepresence, there has been a recent focus in real-time performance capture of humans under motion. However, given the real-time constraint, these systems often suffer from artifacts in geometry and texture such as holes and noise in the final rendering, poor lighting, and low-resolution textures. We take the novel approach to augment such real-time performance capture systems with a deep architecture that takes a rendering from an arbitrary viewpoint, and jointly performs completion, super resolution, and denoising of the imagery in real-time. We call this approach neural (re-)rendering, and our live system "LookinGood". Our deep architecture is trained to produce high resolution and high quality images from a coarse rendering in real-time. First, we propose a self-supervised training method that does not require manual ground-truth annotation. We contribute a specialized reconstruction error that uses semantic information to focus on relevant parts of the subject, e.g. the face. We also introduce a salient reweighing scheme of the loss function that is able to discard outliers. We specifically design the system for virtual and augmented reality headsets where the consistency between the left and right eye plays a crucial role in the final user experience. Finally, we generate temporally stable results by explicitly minimizing the difference between two consecutive frames. We tested the proposed system in two different scenarios: one involving a single RGB-D sensor, and upper body reconstruction of an actor, the second consisting of full body 360° capture. Through extensive experimentation, we demonstrate how our system generalizes across unseen sequences and subjects.
Semantic analysis of soccer video using dynamic Bayesian network

Video semantic analysis is formulated based on the low-level image features and the high-level knowledge which is encoded in abstract, nongeometric representations. This paper introduces a semantic analysis system based on Bayesian network (BN) and dynamic Bayesian network (DBN). It is validated in the particular domain of soccer game videos. Based on BN/DBN, it can identify the special events in soccer games such as goal event, corner kick event, penalty kick event, and card event. The video analyzer extracts the low-level evidences, whereas the semantic analyzer uses BN/DBN to interpret the high-level semantics. Different from previous shot-based semantic analysis approaches, the proposed semantic analysis is frame-based for each input frame, it provides the current semantics of the event nodes as well as the hidden nodes. Another contribution is that the BN and DBN are automatically generated by the training process instead of determined by ad hoc. The last contribution is that we introduce a so-called temporal intervening network to improve the accuracy of the semantics output
Balanced-to-Unbalanced Bandpass Filters and the Antenna Application

Novel balanced-to-unbalanced (balun) bandpass filters are presented and carefully examined. By properly converting a symmetric four-port balanced-to-balanced bandpass filter to a three-port device, with two ports forming a balanced output and one port remaining unbalanced, a novel three-port balun bandpass filter with both functions of balun and bandpass filter may be realized. Specifically, a balun bandpass filter is implemented with its center frequency at 0.99 GHz and a 3-dB fractional bandwidth (Bomega) of 10.1%. The implemented balun bandpass filter presents an excellent in-band balance performance with common-mode rejection ratio (Rcm) better than 41 dB (the corresponding amplitude and phase imbalances are within 0.003deg and 1deg) over the pass- band. In this study, a wideband balun bandpass filter is also implemented so as to improve the wideband performance of the quasi- Yagi antenna. Being integrated with the proposed wideband balun bandpass filter, the implemented quasi-Yagi antenna achieves a bandwidth of 48% for IS11 | < -10 dB, with front-to-back ratio better than 13 dB, cross-polarization smaller than -20 dB, and peak gain of 3-5 dBi within the wide operating bandwidth.
Foldable Joints for Foldable Robots

Print-and-fold manufacturing has the potential to democratize access to robots with robots that are easier to fabricate using materials that are easier to procure. Unfortunately, a lack of understanding about how motion can be achieved by folding hinders the scope of print-and-fold robots. In this paper, we show how the basic joints used in robots can be constructed using print-and-fold. Our patterns are parameterized so that users not only get the desired degrees of freedom but can also specify the joint’s range of motion. The joints can be combined with each other to achieve higher degrees of freedom or with rigid bodies to produce foldable linkages. We have folded our basic joints and measured their force–displacement curves. We have composed them into joints with higher degrees of freedom and into foldable mechanisms and found that they achieve the expected kinematics. We have also added actuators and control circuitry to our joints and mechanisms, showing that it is possible to print and fold entire robots with many different kinematics using a uniform process.
A Context Based Dialog System with a Personality

We present an end-to-end deep RNN model to behave as a conversational agent having a particular persona. This conversational system also remembers long range dependencies in the dialog with the help of attention mechanism and context based approach. A speaker model encodes personas in distributed embeddings which represent a variety of characteristics of the persona of the chatbot. These embeddings are learned from the data. Our model yields qualitative performance improvements over the base line sequence to sequence model with persona embeddings.
Evaluation Of Linear Interpolation Smoothing On Naive Bayes Spam Classifier

The inconvenience associated with spams and the cost of having an important mail misclassified as spam have made all efforts at improving spam filtering worthwhile. The Naive Bayes algorithm has been found to be successful in properly classifying mails. However, they are not perfect. Recent researches have introduced the idea of smoothing into the Naive Bayes algorithm and they have been found to produce better classification. This study applies the concept of linear interpolation smoothing to Naive Bayes spam classification. The resulting classifier did well at improving spam classification and also reducing false positives.
Fidelius Charm: Isolating Unsafe Rust Code

The Rust programming language has a safe memory model that promises to eliminate critical memory bugs. While the language is strong in doing so, its memory guarantees are lost when any unsafe blocks are used. Unsafe code is often needed to call library functions written in an unsafe language inside a Rust program. We present Fidelius Charm (FC), a system that protects a programmer-specified subset of data in memory from unauthorized access through vulnerable unsafe libraries. FC does this by limiting access to the program's memory while executing unsafe libraries. FC uses standard features of Rust and utilizes the Linux kernel as a trusted base for splitting the address space into a trusted privileged region under the control of functions written in Rust and a region available to unsafe external libraries. This paper presents our design and implementation of FC, presents two case studies for using FC in Rust TLS libraries, and reports on experiments showing its performance overhead is low for typical uses.
Learning Pulse: Using Wearable Biosensors and Learning Analytics to Investigate and Predict Learning Success in Self-regulated Learning

The Learning Pulse study aims to explore whether physiological data such as heart rate and step count correlate with learning activity data and whether they are good predictors for learning success during self-regulated learning. To verify this hypothesis an experiment was set up involving eight doctoral students at the Open University of the Netherlands. Through wearable sensors, heart rate and step count were constantly monitored and learning activity data were collected. All data were stored in a Learning Record Store in xAPI format. Additionally, with an Activity Rating Tool, the participants rated their learning and working experience by indicating the perceived levels of productivity, stress, challenge and abilities along with the type of activity. These human annotated labels can be used for supervising machine learning algorithms to discriminate the successful learning moments from the unsuccessful ones and eventually discover the attributes that most influence the learning process.
An analysis of LSM caching in NVRAM

The rise of NVRAM technologies promises to change the way we think about system architectures. In order to fully exploit its advantages, it is required to develop systems specially tailored for NVRAM devices. Not only this imposes great challenges, but developing full system architectures from scratch is undesirable in many scenarios due to prohibitive development costs. Instead, we analyze in this paper the behavior of an existing log-structured persistent key-value store, namely LevelDB, when run on top of an emulated NVRAM device. We investigate initial opportunities for improvement when adapting a system tailored for HDD/SSDs to run on top of an NVRAM environment. Furthermore, we analyze the behavior of the legacy DRAM caching component of LevelDB and whether more suitable caching policies are required.
A Multi-ESD-Path Low-Noise Amplifier With a 4.3-A TLP Current Level in 65-nm CMOS

This paper studies the electrostatic discharge (ESD)-protected RF low-noise amplifiers (LNAs) in 65-nm CMOS technology. Three different ESD designs, including double-diode, modified silicon-controlled rectifier (SCR), and modified-SCR with double-diode configurations, are employed to realize ESD-protected LNAs at 5.8 GHz. By using the modified-SCR in conjunction with double-diode, a 5.8-GHz LNA with multiple ESD current paths demonstrates a 4.3-A transmission line pulse (TLP) failure level, corresponding to a ~ 6.5-kV Human-Body-Mode (HBM) ESD protection level. Under a supply voltage of 1.2 V and a drain current of 6.5 mA, the proposed ESD-protected LNA demonstrates a noise figure of 2.57 dB with an associated power gain of 16.7 dB. The input third-order intercept point (IIP3) is - 11 dBm, the input and output return losses are greater than 15.9 and 20 dB, respectively.
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model

Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the syntactic graph to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-ofthe-art on Jobs640, ATIS and Geo880. Experimental results on adversarial examples demonstrate the robustness of the model is also improved by encoding more syntactic information.
Sensor Information Retrieval From Internet of Things: Representation and Indexing

Billions of devices are connected in the Internet of Things (IoT)-based sensor networks and they continuously generate a large volume of data. In order to get access to specific data, which is crucial to enable a myriad of new intelligent applications, efficient information retrieval becomes an imminent need for IoT. However, sensor information in the physical world can be heterogeneous, high dimensional, and voluminous due to the complex and dynamic environments. In this paper, we first investigate several IoT search scenarios and propose a uniform representation model for sensor information recordings. Four query models are designed to represent all possible information query styles. With these models, we develop information retrieval architecture for IoT. In essence, an indexing mechanism called efficiency maximization and cost minimization is proposed to solve the property selection problem in the process of index construction and update. Meanwhile, a novel real-time grid R-tree structure is designed to support historical and real-time search for spatiotemporal observation data. Simulation results based on real-world IoT data sets show that storage space is considerably reduced with the sensor model. Furthermore, the proposed indexing mechanisms can improve retrieval efficiency and accuracy, and ensure scalability for large-sized data simultaneously.
Image description with features that summarize

We present a new method for describing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise and stable basis for image description. We develop a new algorithm for feature detection that operates on several projections (feature spaces) of the image using kernel-based optimization techniques to locate local extrema of a continuous scale-space of image regions. Descriptors of these image regions and their relative geometry then form the basis of an image description. The emphasis of the work is on features that summarize image content and are highly robust to viewpoint changes and occlusion yet remain discriminative for matching and registration. We present experimental results of these methods applied to the problem of image retrieval. We find that our method performs comparably to two published techniques: Blobworld and SIFT features. However, compared to these techniques two significant advantages of our method are its (1) stability under large changes in the images and (2) its representational efficiency.
Complementary model update: A method for simultaneous registration and stiffness mapping in flexible environments

Registering a surgical tool to an a priori model of the environment is an important first step in computer-aided surgery. In this paper we present an approach for simultaneous registration and stiffness mapping using blind exploration of flexible environments. During contact-based exploration of flexible environments, the physical interaction with the environment can induce local deformation, leading to erroneous registration if not accounted for. To overcome this issue, a new registration method called complementary model update (CMU), is introduced. By incorporating measurements of the contact force, and contact location, we minimize a unique objective function to cancel out the effect of local deformation. We are thus able to acquire the necessary registration parameters using both geometry and stiffness information. The proposed CMU method is evaluated in simulation and using experimental data obtained by probing silicone models and an ex vivo organ.
ESTIMATION WITH QUADRATIC LOSS

It has long been customary to measure the adequacy of an estimator by the smallness of its mean squared error. The least squares estimators were studied by Gauss and by other authors later in the nineteenth century. A proof that the best unbiased estimator of a linear function of the means of a set of observed random variables is the least squares estimator was given by Markov , a modified version of whose proof is given by David and Neyman . A slightly more general theorem is given by Aitken . Fisher  indicated that for large samples the maximum likelihood estimator approximately minimizes the mean squared error when compared with other reasonable estimators. This paper will be concerned with optimum properties or failure of optimum properties of the natural estimator in certain special problems with the risk usually measured by the mean squared error or, in the case of several parameters, by a quadratic function of the estimators. We shall first mention some recent papers on this subject and then give some results, mostly unpublished, in greater detail. Pitman [13] in 1939 discussed the estimation of location and scale parameters and obtained the best estimator among those invariant under the affine transformations leaving the problem invariant. He considered various loss functions, in particular, mean squared error. , also in 1939, in what may be considered the first paper on statistical decision theory, did the same for location parameters alone, and tried to show in his theorem 5 that the estimator obtained in this way is admissible, that is, that there is no estimator whose risk is no greater at any parameter point, and smaller at some point. However, his proof of theorem 5 is not convincing since he interchanges the order of integration in (30) without comment, and it is not clear that this integral is absolutely convergent. To our knowledge, no counterexample to this theorem is known, but in higher-dimensional cases, where the analogous argument seems at first glance only slightly less plausible, counterexamples are given in Blackwell  (which is discussed briefly at the end of section 3 of this paper) and in ,
e-health first impressions and visual evaluations: key design principles for attention and appeal

Design plays a critical role in the development of e-health, greatly impacting the outreach potential for pertinent health communication. Design influences viewers' initial evaluations of electronic displays of health information, as well as directly impacting the likelihood one will attend to and favorably evaluate the information, essential actions for processing the health concepts presented. Individuals with low health literacy, representing a hard-to-reach audience susceptible to worsened health outcomes, will benefit greatly from the application of theory-based design principles. Design principles that have been shown to appeal and engage audiences are the necessary first step for effective message delivery. Design principles, which directly impact increased attention, favorable evaluations, and greater information processing abilities, include: web aesthetics, visual complexity, affordances, prototypicality, and persuasive imagery. These areas of theory-driven design research should guide scholars in e-health investigation with research goals of broader outreach, reduction of disparities, and potential avenues for reduced health care costs. Improving design by working with this hard-to-reach audience will simultaneously improve practice, as the applications of key design principles through theory-driven design research will allow practitioners to create effective e-health that will benefit people more broadly.
Distributed Secondary Level Control for Energy Storage Management in DC Microgrids

DC microgrids have been known to be a promising solution for improving renewable energy integration with electrical grid and enhancing the system’s overall energy efficiency. A key component of this microgrid is the energy storage system, which besides smoothing the intermittent behavior of renewable sources, also allows intentional islanding and the execution of optimization routines to improve the microgrid performance. Assuming that storage systems in commercial and residential buildings will mostly be composed of multiple storage units, an energy storage management system, which provides charge/discharge monitoring and state-of-charge (SOC) equalization, is needed to prevent overcharging the units or their uneven use, which can lead to faster deterioration of battery banks. This paper proposes an energy storage management system based on distributed secondary level control, which promotes charge/discharge control and provides SOC equalization simultaneously. The SOC imbalance compensation alters the energy storage unit virtual droop resistance according to the difference between the unit SOC and the microgrid average SOC, thus the compensation intensity is dependent on the imbalance level being suitable to be employed in dc bus signaling controlled microgrids.
CMT-bone: A Mini-App for Compressible Multiphase Turbulence Simulation Software

Designed with the goal of mimicking key features of real HPC workloads, mini-apps have become an important tool for co-design. An investigation of mini-app behavior can provide system designers with insight into the impact of architectures, programming models, and tools on application performance. Mini-apps can also serve as a platform for fast algorithm design space exploration, allowing the application developers to evaluate their design choices before significantly redesigning the application codes. Consequently, it is prudent to develop a mini-app alongside the full blown application it is intended to represent. In this paper, we present CMT-bone a mini-app for the compressible multiphase turbulence (CMT) application, CMT-nek, being developed to extend the physics of the CESAR Nek5000 application code. CMT-bone consists of the most computationally intensive kernels of CMT-nek and the communication operations involved in nearest-neighbor updates and vector reductions. The mini-app represents CMT-nek in its most mature state and going forward it will be developed in parallel with the CMT-nek application to keep pace with key new performance impacting changes. We describe these kernels and discuss the role that CMT-bone has played in enabling interdisciplinary collaboration by allowing application developers to work with computer scientists on performance optimization on current architectures and performance analysis on notional future systems.
A second generation computer forensic analysis system

The architecture of existing – first generation – computer forensic tools, including the widely used EnCase and FTK products, is rapidly becoming outdated. Tools are not keeping pace with increased complexity and data volumes of modern investigations. This paper discuses the limitations of first generation computer forensic tools. Several metrics for measuring the efficacy and performance of computer forensic tools are introduced. A set of requirements for second generation tools are proposed. A high-level design for a (work in progress) second generation computer forensic analysis system is presented. a 2009 Digital Forensic Research workshop.
3D geo-database research: Retrospective and future directions

3D geo-database research is a promising field to support challenging applications such as 3D urban planning, environmental monitoring, infrastructure management, and early warning or disaster management and response. In these fields, interdisciplinary research in GIScience and related fields is needed to support the modelling, analysis, management, and integration of large geo-referenced data sets, which describe human activities and geophysical phenomena. Geo-databases may serve as platforms to integrate 2D maps, 3D geo-scientific models, and other geo-referenced data. However, current geo-databases do not provide sufficient 3D data modelling and data handling techniques. New 3D geo-databases are needed to handle surface and volume models. This article first presents a 25-year retrospective of geo-database research. Data modelling, standards, and indexing of geo-data are discussed in detail. New directions for the development of 3D geo-databases to open new fields for interdisciplinary research are addressed. Two scenarios in the fields of early warning and emergency response demonstrate the combined management of human and geophysical phenomena. The article concludes with a critical outlook on open research problems. & 2011 Elsevier Ltd. All rights reserved.