nils-herrmann/clean_scirepeval huggingface dataset:
Psychopaths know right from wrong but don't care.

Adult psychopaths have deficits in emotional processing and inhibitory control, engage in morally inappropriate behavior, and generally fail to distinguish moral from conventional violations. These observations, together with a dominant tradition in the discipline which sees emotional processes as causally necessary for moral judgment, have led to the conclusion that psychopaths lack an understanding of moral rights and wrongs. We test an alternative explanation: psychopaths have normal understanding of right and wrong, but abnormal regulation of morally appropriate behavior. We presented psychopaths with moral dilemmas, contrasting their judgments with age- and sex-matched (i) healthy subjects and (ii) non-psychopathic, delinquents. Subjects in each group judged cases of personal harms (i.e. requiring physical contact) as less permissible than impersonal harms, even though both types of harms led to utilitarian gains. Importantly, however, psychopaths' pattern of judgments on different dilemmas was the same as those of the other subjects. These results force a rejection of the strong hypothesis that emotional processes are causally necessary for judgments of moral dilemmas, suggesting instead that psychopaths understand the distinction between right and wrong, but do not care about such knowledge, or the consequences that ensue from their morally inappropriate behavior.
Designing a Low-noise, High-resolution, and Portable Four Channel Acquisition System for Recording Surface Electromyographic Signal

In current years, the application of biopotential signals has received a lot of attention in literature. One of these signals is an electromyogram (EMG) generated by active muscles. Surface EMG (sEMG) signal is recorded over the skin, as the representative of the muscle activity. Since its amplitude can be as low as 50 μV, it is sensitive to undesirable noise signals such as power-line interferences. This study aims at designing a battery-powered portable four-channel sEMG signal acquisition system. The performance of the proposed system was assessed in terms of the input voltage and current noise, noise distribution, synchronization and input noise level among different channels. The results indicated that the designed system had several inbuilt operational merits such as low referred to input noise (lower than 0.56 μV between 8 Hz and 1000 Hz), considerable elimination of power-line interference and satisfactory recorded signal quality in terms of signal-to-noise ratio. The muscle conduction velocity was also estimated using the proposed system on the brachial biceps muscle during isometric contraction. The estimated values were in then normal ranges. In addition, the system included a modular configuration to increase the number of recording channels up to 96.
Improving the kinematic performance of the SCARA-Tau PKM

One well acknowledged drawback of traditional parallel kinematic machines (PKMs) is that the ratio of accessible workspace to robot footprint is small for these structures. This is most likely a contributing reason why relatively few PKMs are used in industry today. The SCARA-Tau structure is a parallel robot concept designed with the explicit goal of overcoming this limitation and developing a PKM with a workspace similar to that of a serial type robot of the same size. This paper shows for the first time how a proposed variant of the SCARA-Tau PKM can improve the usability of this robot concept further by significantly reducing the dependence between tool platform position and orientation of the original concept. The inverse kinematics of the proposed variant is derived and a comparison is made between this structure and the original SCARA-Tau concept, both with respect to platform orientation changes and workspace.
Revisiting Distributed Synchronous SGD

Distributed training of deep learning models on large-scale training data is typically conducted with asynchronous stochastic optimization to maximize the rate of updates, at the cost of additional noise introduced from asynchrony. In contrast, the synchronous approach is often thought to be impractical due to idle time wasted on waiting for straggling workers. We revisit these conventional beliefs in this paper, and examine the weaknesses of both approaches. We demonstrate that a third approach, synchronous optimization with backup workers, can avoid asynchronous noise while mitigating for the worst stragglers. Our approach is empirically validated and shown to converge faster and to better test accuracies.
Regressing Heatmaps for Multiple Landmark Localization Using CNNs

We explore the applicability of deep convolutional neural networks (CNNs) for multiple landmark localization in medical image data. Exploiting the idea of regressing heatmaps for individual landmark locations, we investigate several fully convolutional 2D and 3D CNN architectures by training them in an end-to-end manner. We further propose a novel SpatialConfiguration-Net architecture that effectively combines accurate local appearance responses with spatial landmark configurations that model anatomical variation. Evaluation of our different architectures on 2D and 3D hand image datasets show that heatmap regression based on CNNs achieves state-of-the-art landmark localization performance, with SpatialConfiguration-Net being robust even in case of limited amounts of training data.
Random-data perturbation techniques and privacy-preserving data mining

Privacy is becoming an increasingly important issue in many data-mining applications. This has triggered the development of many privacy-preserving data-mining techniques. A large fraction of them use randomized data-distortion techniques to mask the data for preserving the privacy of sensitive data. This methodology attempts to hide the sensitive data by randomly modifying the data values often using additive noise. This paper questions the utility of the random-value distortion technique in privacy preservation. The paper first notes that random matrices have predictable structures in the spectral domain and then it develops a random matrix-based spectral-filtering technique to retrieve original data from the dataset distorted by adding random values. The proposed method works by comparing the spectrum generated from the observed data with that of random matrices. This paper presents the theoretical foundation and extensive experimental results to demonstrate that, in many cases, random-data distortion preserves very little data privacy. The analytical framework presented in this paper also points out several possible avenues for the development of new privacy-preserving data-mining techniques. Examples include algorithms that explicitly guard against privacy breaches through linear transformations, exploiting multiplicative and colored noise for preserving privacy in data mining applications.
Tool path smoothing of a redundant machine: Application to Automated Fiber Placement

Automated Tape Laying and Fiber Placement of composite materials are the two principal automated processes used for fabrication of large composite structures in aeronautical industry. The aluminum parts produced by High Speed Machining tend to be replaced by carbon fiber composite parts realized with these processes. However, structural parts present reinforcement zones which disturb the tool path follow-up and generate an increase of the manufacturing time. Thus, this paper deals with the optimization of tool paths of a 7-axis machine tool of Fiber Placement with the objective of reducing the manufacturing time while ensuring the requested quality of the final part. In this paper, two complementary methods are detailed. The first method takes advantage of the degree of redundancy of the machine tool to decrease the kinematic loads of the control joints. The second method aims to smooth the orientation of the machine head along the tool path while ensuring quality constraints. These twomethods are then applied on a test tool path and bring to a significant decrease of the manufacturing time (32.9%).
Defect detection and identification in textile fabrics using Multi Resolution Combined Statistical and Spatial Frequency Method

In textile industry, reliable and accurate quality control and inspection becomes an important element. Presently, this is still accomplished by human experience, which is more time consuming and is also prone to errors. Hence automated visual inspection systems become mandatory in textile industries. This Paper presents a novel algorithm of fabric defect detection by making use of Multi Resolution Combined Statistical and Spatial Frequency Method. Defect detection consists of two phases, first is the training and next is the testing phase. In the training phase, the reference fabric images are cropped into non-overlapping sub-windows. By applying MRCSF the features of the textile fabrics are extracted and stored in the database. During the testing phase the same procedure is applied for test fabric and the features are compared with database information. Based on the comparison results, each sub-window is categorized as defective or non-defective. The classification rate obtained by the process of simulation using MATLAB was found to be 99%.
Fingerprint verification by fusion of optical and capacitive sensors

A few works have been presented so far on information fusion for fingerprint verification. None, however, have explicitly investigated the use of multi-sensor fusion, in other words, the integration of the information provided by multiple devices to capture fingerprint images. In this paper, a multi-sensor fingerprint verification system based on the fusion of optical and capacitive sensors is presented. Reported results show that such a multi-sensor system can perform better than traditional fingerprint matchers based on a single sensor.
Control Jujutsu: On the Weaknesses of Fine-Grained Control Flow Integrity

Control flow integrity (CFI) has been proposed as an approach to defend against control-hijacking memory corruption attacks. CFI works by assigning tags to indirect branch targets statically and checking them at runtime. Coarse-grained enforcements of CFI that use a small number of tags to improve the performance overhead have been shown to be ineffective. As a result, a number of recent efforts have focused on fine-grained enforcement of CFI as it was originally proposed. In this work, we show that even a fine-grained form of CFI with unlimited number of tags and a shadow stack (to check calls and returns) is ineffective in protecting against malicious attacks. We show that many popular code bases such as Apache and Nginx use coding practices that create flexibility in their intended control flow graph (CFG) even when a strong static analyzer is used to construct the CFG. These flexibilities allow an attacker to gain control of the execution while strictly adhering to a fine-grained CFI. We then construct two proof-of-concept exploits that attack an unlimited tag CFI system with a shadow stack. We also evaluate the difficulties of generating a precise CFG using scalable static analysis for real-world applications. Finally, we perform an analysis on a number of popular applications that highlights the availability of such attacks.
Photogeometric Scene Flow for High-Detail Dynamic 3D Reconstruction

Photometric stereo (PS) is an established technique for high-detail reconstruction of 3D geometry and appearance. To correct for surface integration errors, PS is often combined with multiview stereo (MVS). With dynamic objects, PS reconstruction also faces the problem of computing optical flow (OF) for image alignment under rapid changes in illumination. Current PS methods typically compute optical flow and MVS as independent stages, each one with its own limitations and errors introduced by early regularization. In contrast, scene flow methods estimate geometry and motion, but lack the fine detail from PS. This paper proposes photogeometric scene flow (PGSF) for high-quality dynamic 3D reconstruction. PGSF performs PS, OF, and MVS simultaneously. It is based on two key observations: (i) while image alignment improves PS, PS allows for surfaces to be relit to improve alignment, (ii) PS provides surface gradients that render the smoothness term in MVS unnecessary, leading to truly data-driven, continuous depth estimates. This synergy is demonstrated in the quality of the resulting RGB appearance, 3D geometry, and 3D motion.
A reputation-based approach for choosing reliable resources in peer-to-peer networks

Peer-to-peer (P2P) applications have seen an enormous success, and recently introduced P2P services have reached tens of millions of users. A feature that significantly contributes to the success of many P2P applications is user anonymity. However, anonymity opens the door to possible misuses and abuses, exploiting the P2P network as a way to spread tampered with resources, including Trojan Horses, viruses, and spam. To address this problem we propose a self-regulating system where the P2P network is used to implement a robust reputation mechanism. Reputation sharing is realized through a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download. This way, spreading of malicious contents will be reduced and eventually blocked. Our approach can be straightforwardly piggybacked on existing P2P protocols and requires modest modifications to current implementations.
Interactive spacetime control for animation

Interactive Spacetime Control for Animation Michael F. Cohen* Department of Computer Science University of Utah Salt Lake City, Utah 84112 This paper describes new techniques to design physically based, goal directed motion of synthetic creatures. More specifically, it concentrates on developing an interactive framework for specifying constraints and objectives for the motion, and for guiding the numericrd solution of the optimization problem thus defined. The ability to define, modify and guide constrained spacetime problems is provided through an interactive user interface. Innovations that are introduced include, (1) the subdivision of spacetime into discrete pieces, or Spacetime Windows, over which subproblems can be formulated and solved, (2) the use of cubic B-spline approximation techniques to define a C2 function for the creature’s time dependent degrees of freedom, (3) the use of both symbolic and numerical processes to construct and solve the constrained optimization problem, and (4) the ability to specify inequality and conditional constraints. Creatures, in the context of this work, consist of rigid links connected by joints defining a set of generalized degrees of freedom. Hybrid symbolic and numeric techniques to solve the resulting complex constrained optimization problems are made possible by the special structure of physically based models of such creatures, and by the recent development of symbolic algebraic languages. A graphical user interface process handles communication between the user and two other processes; one devoted to symbolic differentiation and manipulation of the constraints and objectives, and one that performs the iterative numerical solution of the optimization problem. The user interface itself provides both high and low level definition of, interaction with, and inspection of, the optimization process and the resulting animation. Implementation issues and experiments with the Spacetime Windows system are discussed, CR Categories: 1.3.7: [Computer Graphics] ThreeDimensional Graphics and Realism; 1.6.3 [Simulation and Modeling] Applications; G.].6 [Constrained Optimization]
Can you hear me now?!: it must be BGP

Industry observers expect VoIP to eventually replace most of the existing land-line telephone connections. Currently however, quality and reliability concerns largely limit VoIP usage to either personal calls on cross-domain services such as Skype and Vonage, or to single-domain services such as trunking, where a core ISP carries long-distance voice as VoIP only within its backbone, to save cost with a unified voice/data infrastructure. This paper investigates the factors that prevent cross-domain VoIP deployments from achieving the quality and reliability of existing land-line telephony (PSTN). We ran over 50,000 VoIP phone calls between 24 locations in US and Europe for a three-week period. Our results indicate that VoIP usability is hindered as much by BGP's slow convergence as network congestion. In fact, about half of the unintelligible VoIP samples in our data occur within 10 minutes of a BGP update
Cross-Modal Multistep Fusion Network With Co-Attention for Visual Question Answering

Visual question answering (VQA) is receiving increasing attention from researchers in both the computer vision and natural language processing fields. There are two key components in the VQA task: feature extraction and multi-modal fusion. For feature extraction, we introduce a novel co-attention scheme by combining Sentence-guide Word Attention (SWA) and Question-guide Image Attention in a unified framework. To be specific, the textual attention SWA relies on the semantics of the whole question sentence to calculate contributions of different question words for text representation. For the multi-modal fusion, we propose a “Cross-modal Multistep Fusion (CMF)” network to generate multistep features and achieve multiple interactions for two modalities, rather than focusing on modeling complex interactions between two modals like most current feature fusion methods. To avoid the linear increase of the computational cost, we share the parameters for each step in the CMF. Extensive experiments demonstrate that the proposed method can achieve competitive or better performance than the state of the art.
A Performance Isolation Analysis of Disk-Intensive Workloads on Container-Based Clouds

The popularity of Cloud computing due to the increasing number of customers has led Cloud providers to adopt resource-sharing solutions to meet growing demand for infrastructure resources. As the adoption of resource-sharing/consolidation in Cloud computing became arguably a well-established solution, the ability the underlying virtualization systems of preventing performance interferences from customers must also be understood. Virtualization systems based on containers, such as LXC, are the basis of the next-generation of Cloud computing and have become the most popular solution under PaaS/IaaS Cloud platforms with the rise of Docker -- an open platform for developers and sysadmins to build, ship, and run distributed applications. Such platforms have enticed many attentions globally, since they leverage container-based virtualization systems to offer high scalability while low performance overheads, the performance might be solely aggravated if the customers' workloads are consolidated onto the same hardware and the isolation layer does not properly isolate the shared resources. Performance isolation is an inherent concern of such systems due to the nature as they are conceived and is still an unexplored and open research topic, the consequences might influence in the adoption under shared Cloud computing platforms where Quality-of-Service is a crucial factor that cannot be disregarded. In this paper we analyze the performance interference suffered by disk-intensive workloads within very noisy-perturbed containers (different hardware components stressed). Our results show workload combinations whose performance degradation goes up to 38%, but in contrast we expose a workload-balanced scenario wherein the performance does not suffer any interference.
Extracting depth and matte using a color-filtered aperture

This paper presents a method for automatically extracting a scene depth map and the alpha matte of a foreground object by capturing a scene through RGB color filters placed in the camera lens aperture. By dividing the aperture into three regions through which only light in one of the RGB color bands can pass, we can acquir three shifted views of a scene in the RGB planes of an image in a single exposure. In other words, a captured image has depth-dependent color misalignment. We develop a color alignment measure to estimate disparities between the RGB planes for depth reconstruction. We also exploit color misalignment cues in our matting algorithm in order to disambiguate between the foreground and background regions even where their colors are similar. Based on the extracted depth and matte, the color misalignment in the captured image can be canceled, and various image editing operations can be applied to the reconstructed image, including novel view synthesis, postexposure refocusing, and composition over different backgrounds.
Advances in Very Deep Convolutional Neural Networks for LVCSR

Very deep CNNs with small 3 × 3 kernels have recently been shown to achieve very strong performance as acoustic models in hybrid NN-HMM speech recognition systems. In this paper we investigate how to efficiently scale these models to larger datasets. Specifically, we address the design choice of pooling and padding along the time dimension which renders convolutional evaluation of sequences highly inefficient. We propose a new CNN design without timepadding and without timepooling, which is slightly suboptimal for accuracy, but has two significant advantages: it enables sequence training and deployment by allowing efficient convolutional evaluation of full utterances, and, it allows for batch normalization to be straightforwardly adopted to CNNs on sequence data. Through batch normalization, we recover the lost peformance from removing the time-pooling, while keeping the benefit of efficient convolutional evaluation. We demonstrate the performance of our models both on larger scale data than before, and after sequence training. Our very deep CNN model sequence trained on the 2000h switchboard dataset obtains 9.4 word error rate on the Hub5 test-set, matching with a single model the performance of the 2015 IBM system combination, which was the previous best published result.
Evolving Robust Robot Team Morphologies for Collective Construction

This research falls within evolutionary robotics and the larger taxonomy of cooperative multi-robot systems. A study of comparative methods to adapt the behaviors and morphologies of simulated robot teams that must solve a collective construction task is presented. Multiple versions of an indirect (developmental) encoding method for the artificial evolution of (team) behaviors and morphologies were tested. The indirect encoding method was able to adapt team morphology (number of sensors) and behavior (ANN controller connections and weights) that out-performed a team with fixed morphology and adaptive behavior. Results also indicated that the developmental method was appropriate for evolving controllers that were able to generalize to a range of team morphologies that solved the collective construction task with a high degree of task performance.
Disentangled Representation Learning for Text Style Transfer

This paper tackles the problem of disentangling the latent variables of style and content in language models. We propose a simple, yet effective approach, which incorporates auxiliary objectives: a multi-task classification objective, and dual adversarial objectives for label prediction and bag-ofwords prediction, respectively. We show, both qualitatively and quantitatively, that the style and content are indeed disentangled in the latent space, using this approach. This disentangled latent representation learning method is applied to attribute (e.g. style) transfer on non-parallel corpora. We achieve similar content preservation scores compared to previous state-of-the-art approaches, and significantly better style-transfer strength scores. Our code is made publicly available for replicability and extension purposes .