nils-herrmann/clean_scirepeval huggingface dataset:
Mobility of an in-pipe robot with screw drive mechanism inside curved pipes

This paper presents motion analyses and experiments of an in-pipe robot with screw drive mechanism while it moves inside curved pipes. This robot is driven by only one motor and composed of two units. One unit works as a rotator and the another one works as a stator. Screw drive mechanism is a better way to travel inside pipelines of small diameter for inspection, because the area for moving of the robot is narrow and the number of actuators can be reduced (minimum is just one). Therefore, the robot can be smaller and lighter. Furthermore, the control becomes easier. Although many kinds of in-pipe robots with screw drive mechanism have been reported to date, the most important problem of such drive mechanism is the difficulty of traveling in pipes other than straight ones. Examples of such pipes are curved pipes like elbow and bent, branch pipes like a T-shape and the pipe where diameter changes. A concrete analysis has not been done yet. In this paper, we concentrate on a helical driving motion of the robot inside the curved pipe and finally perform experiments to determine the characteristics of it.
Integrative Complexity of 41 U . S . Presidents

Although U.S. presidents are one of the most studied groups of political figures and integrative complexity is one of the most widely used constructs in political psychology, no study to date has fully examined the integrative complexity of all U.S. presidents. The present study helps fill in that gap by scoring 41 U.S. presidents’ first four State of the Union speeches for integrative complexity and then comparing these scores with a large range of available situational and personality variables. Results suggest a tendency for presidents’ integrative complexity to be higher at the beginning of their first term and drop at the end. This pattern was pronounced for presidents who eventually won reelection to a second term and was markedly different for presidents who tried to gain reelection but lost. Additional analyses suggested that presidents’ overall integrative complexity scores were in part accounted for by chronic differences between presidents’ complexity levels. Further analyses revealed that this overall integrative complexity score was positively correlated to a set of interpersonal traits (friendliness, affiliation motive, extraversion, and wittiness) and negatively correlated with inflexibility. Discussion centers upon the causes and consequences of presidential complexity.
Distillation as a Defense to Adversarial Perturbations Against Deep Neural Networks

Deep learning algorithms have been shown to perform extremely well on many classical machine learning problems. However, recent studies have shown that deep learning, like other machine learning techniques, is vulnerable to adversarial samples: inputs crafted to force a deep neural network (DNN) to provide adversary-selected outputs. Such attacks can seriously undermine the security of the system supported by the DNN, sometimes with devastating consequences. For example, autonomous vehicles can be crashed, illicit or illegal content can bypass content filters, or biometric authentication systems can be manipulated to allow improper access. In this work, we introduce a defensive mechanism called defensive distillation to reduce the effectiveness of adversarial samples on DNNs. We analytically investigate the generalizability and robustness properties granted by the use of defensive distillation when training DNNs. We also empirically study the effectiveness of our defense mechanisms on two DNNs placed in adversarial settings. The study shows that defensive distillation can reduce effectiveness of sample creation from 95% to less than 0.5% on a studied DNN. Such dramatic gains can be explained by the fact that distillation leads gradients used in adversarial sample creation to be reduced by a factor of 1030. We also find that distillation increases the average minimum number of features that need to be modified to create adversarial samples by about 800% on one of the DNNs we tested.
Adversarial Discriminative Domain Adaptation

Adversarial learning methods are a promising approach to training robust deep networks, and can generate complex samples across diverse domains. They can also improve recognition despite the presence of domain shift or dataset bias: recent adversarial approaches to unsupervised domain adaptation reduce the difference between the training and test domain distributions and thus improve generalization performance. However, while generative adversarial networks (GANs) show compelling visualizations, they are not optimal on discriminative tasks and can be limited to smaller shifts. On the other hand, discriminative approaches can handle larger domain shifts, but impose tied weights on the model and do not exploit a GAN-based loss. In this work, we first outline a novel generalized framework for adversarial adaptation, which subsumes recent state-of-the-art approaches as special cases, and use this generalized view to better relate prior approaches. We then propose a previously unexplored instance of our general framework which combines discriminative modeling, untied weight sharing, and a GAN loss, which we call Adversarial Discriminative Domain Adaptation (ADDA). We show that ADDA is more effective yet considerably simpler than competing domain-adversarial methods, and demonstrate the promise of our approach by exceeding state-of-the-art unsupervised adaptation results on standard domain adaptation tasks as well as a difficult cross-modality object classification task.
Language Models with Pre-Trained (GloVe) Word Embeddings

In this work we present a step-by-step implementation of training a Language Model (LM) , using Recurrent Neural Network (RNN) and pre-trained GloVe word embeddings, introduced by Pennigton et al. in . The implementation is following the general idea of training RNNs for LM tasks presented in  , but is rather using Gated Recurrent Unit (GRU)  for a memory cell, and not the more commonly used LSTM . The implementation presented is based on using keras1 .
Research trends on Big Data in Marketing : A text mining and topic modeling based literature analysis

Given the research interest on Big Data in Marketing, we present a research literature analysis based on a text mining semi-automated approach with the goal of identifying the main trends in this domain. In particular, the analysis focuses on relevant terms and topics related with five dimensions: Big Data, Marketing, Geographic location of authors’ affiliation (countries and continents), Products, and Sectors. A total of 1560 articles published from 2010 to 2015 were scrutinized. The findings revealed that research is bipartite between technological and research domains, with Big Data publications not clearly aligning cutting edge techniques toward Marketing benefits. Also, few inter-continental co-authored publications were found. Moreover, findings show that research in Big Data applications to Marketing is still in an embryonic stage, thus making it essential to develop more direct efforts toward business for Big Data to thrive in the Marketing arena.
Efficient Classification for Additive Kernel SVMs

We show that a class of nonlinear kernel SVMs admits approximate classifiers with runtime and memory complexity that is independent of the number of support vectors. This class of kernels, which we refer to as additive kernels, includes widely used kernels for histogram-based image comparison like intersection and chi-squared kernels. Additive kernel SVMs can offer significant improvements in accuracy over linear SVMs on a wide variety of tasks while having the same runtime, making them practical for large-scale recognition or real-time detection tasks. We present experiments on a variety of datasets, including the INRIA person, Daimler-Chrysler pedestrians, UIUC Cars, Caltech-101, MNIST, and USPS digits, to demonstrate the effectiveness of our method for efficient evaluation of SVMs with additive kernels. Since its introduction, our method has become integral to various state-of-the-art systems for PASCAL VOC object detection/image classification, ImageNet Challenge, TRECVID, etc. The techniques we propose can also be applied to settings where evaluation of weighted additive kernels is required, which include kernelized versions of PCA, LDA, regression, k-means, as well as speeding up the inner loop of SVM classifier training algorithms.
Prevalence and predictors of internet bullying.

With the Internet quickly becoming a new arena for social interaction, it has also become a growing venue for bullying among youth. The purpose of the present study was to contrast the prevalence of Internet bullying with physical and verbal bullying among elementary, middle, and high school boys and girls, and to examine whether key predictors of physical and verbal bullying also predicted Internet bullying.



As part of an ongoing, statewide bullying prevention initiative in Colorado, 3,339 youth in Grades 5, 8, and 11 completed questionnaires in 78 school sites during the fall of 2005, and another 2,293 youth in that original sample participated in a follow-up survey in 65 school sites in the spring of 2006. Questionnaires included measures of bullying perpetration and victimization, normative beliefs about bullying, perceptions of peer social support, and perceptions of school climate.



The highest prevalence rates were found for verbal, followed by physical, and then by Internet bullying. Physical and Internet bullying peaked in middle school and declined in high school. Verbal bullying peaked in middle school and remained relatively high during high school. Males were more likely to report physical bullying than females, but no gender differences were found for Internet and verbal bullying. All three types of bullying were significantly related to normative beliefs approving of bullying, negative school climate, and negative peer support.



Preventive interventions that target school bullying by changing norms about bullying and school context may also impact Internet bullying, given the shared predictors.
On the impact of knowledge discovery and data mining

Knowledge Discovery and Data Mining are powerful automated data analysis tools and they are predicted to become the most frequently used analytical tools in the near future. The rapid dissemination of these technologies calls for an urgent examination of their social impact. This paper identifies social issues arising from Knowledge Discovery (KD) and Data Mining (DM). An overview of these technologies is presented, followed by a detailed discussion of each issue. The paper's intention is to primarily illustrate the cultural context of each issue and, secondly, to describe the impact of KD and DM in each case. Existing solutions specific to each issue are identified and examined for feasibility and effectiveness, and a solution that provides a suitably contextually sensitive means for gathering and analysing sensitive data is proposed and briefly outlined. The paper concludes with a discussion of topics for further consideration.
Paragraph: Thwarting Signature Learning by Training Maliciously

Defending a server against Internet worms and defending a user’s email inbox against spam bear certain similarities. In both cases, a stream of samples arrives, and a classifier must automatically determine whether each sample falls into a malicious target class (e.g., worm network traffic, or spam email). A learner typically generates a classifier automatically by analyzing two labeled training pools: one of innocuous samples, and one of samples that fall in the malicious target class. Learning techniques have previously found success in settings where the content of the labeled samples used in training is either random, or even constructed by a helpful teacher, who aims to speed learning of an accurate classifier. In the case of learning classifiers for worms and spam, however, an adversary controls the content of the labeled samples to a great extent. In this paper, we describe practical attacks against learning, in which an adversary constructs labeled samples that, when used to train a learner, prevent or severely delay generation of an accurate classifier. We show that even a delusive adversary, whose samples are all correctly labeled, can obstruct learning. We simulate and implement highly effective instances of these attacks against the Polygraph [15] automatic polymorphic worm signature generation algorithms.
Benchmarking short text semantic similarity

Short Text Semantic Similarity measurement is a ne w and rapidly growing field of research. “Short texts” are typically sentence leng th but are not required to be grammatically correct . There is great potential for applying these measure s in fields such as Information Retrieval, Dialogue Management and Question Answering. A datas et of 65 sentence pairs, with similarity ratings, produced in 2006 has become adopted as a de facto Gold Standard benchmark. This paper discusses the adoption of the 2006 dataset, lays do wn a number of criteria that can be used to determine whether a dataset should be awarded a “Go ld Standard” accolade and illustrates its use as a benchmark. Procedures for the generation of furth er Gold Standard datasets in this field are recommended.
Aligning multiple genomic sequences with the threaded blockset aligner.

We define a "threaded blockset," which is a novel generalization of the classic notion of a multiple alignment. A new computer program called TBA (for "threaded blockset aligner") builds a threaded blockset under the assumption that all matching segments occur in the same order and orientation in the given sequences; inversions and duplications are not addressed. TBA is designed to be appropriate for aligning many, but by no means all, megabase-sized regions of multiple mammalian genomes. The output of TBA can be projected onto any genome chosen as a reference, thus guaranteeing that different projections present consistent predictions of which genomic positions are orthologous. This capability is illustrated using a new visualization tool to view TBA-generated alignments of vertebrate Hox clusters from both the mammalian and fish perspectives. Experimental evaluation of alignment quality, using a program that simulates evolutionary change in genomic sequences, indicates that TBA is more accurate than earlier programs. To perform the dynamic-programming alignment step, TBA runs a stand-alone program called MULTIZ, which can be used to align highly rearranged or incompletely sequenced genomes. We describe our use of MULTIZ to produce the whole-genome multiple alignments at the Santa Cruz Genome Browser.
LinkNet: Relational Embedding for Scene Graph

Objects and their relationships are critical contents for image understanding. A scene graph provides a structured description that captures these properties of an image. However, reasoning about the relationships between objects is very challenging and only a few recent works have attempted to solve the problem of generating a scene graph from an image. In this paper, we present a method that improves scene graph generation by explicitly modeling inter-dependency among the entire object instances. We design a simple and effective relational embedding module that enables our model to jointly represent connections among all related objects, rather than focus on an object in isolation. Our method significantly benefits main part of the scene graph generation task: relationship classification. Using it on top of a basic Faster R-CNN, our model achieves state-of-the-art results on the Visual Genome benchmark. We further push the performance by introducing global context encoding module and geometrical layout encoding module. We validate our final model, LinkNet, through extensive ablation studies, demonstrating its efficacy in scene graph generation.
Tiny ImageNet Visual Recognition Challenge

In this work, we investigate the effect of convolutional network depth, receptive field size, dropout layers, rectified activation unit type and dataset noise on its accuracy in Tiny-ImageNet Challenge settings. In order to make a thorough evaluation of the cause of the peformance improvement, we start with a basic 5 layer model with 5×5 convolutional receptive fields. We keep increasing network depth or reducing receptive field size, and continue applying modern techniques, such as PReLu and dropout, to the model. Our model achieves excellent performance even compared to state-of-the-art results, with 0.444 final error rate on the test set.
Control methodologies in networked control systems

The use of a data network in a control loop has gained increasing attentions in recent years due to its cost effective and flexible applications. One of the major challenges in this so-called networked control system (NCS) is the network-induced delay effect in the control loop. Network delays degrade the NCS control performance and destabilize the system. A significant emphasis has been on developing control methodologies to handle the network delay effect in NCS. This survey paper presents recent NCS control methodologies. The overview on NCS structures and description of network delays including characteristics and effects are also covered. r 2003
Towards cloud based mobile ad hoc network simulation

Simulations are considered as the most convenient approach for validating any research proposal. A simulator attempts to model a real-world setting in order to analyze the behavior of any algorithm. A large number of simulation software for ad hoc network has been proposed in literature. These simulators are based on execution of simulation on standalone computers. This paper introduces the notion of `simulation as a service' for mobile ad hoc network's simulation based on cloud computing. Cloud computing is an emerging discipline that enables outsourcing computing task remotely based on pay-as-you-go model. The paper provides a generalized architecture to perform ad hoc network simulations on cloud platforms. Similar to different service models provided by cloud, some service models have been introduced for cloud based simulation. The proposed approach provides different advantages such as dynamic service provisioning to support large scale simulation, sharing of simulation models and reduced cost for simulation etc. The proposed tool has been implemented on Heroku platform that demonstrates the scalability of proposed approach.
Deep neural networks are easily fooled: High confidence predictions for unrecognizable images

Deep neural networks (DNNs) have recently been achieving state-of-the-art performance on a variety of pattern-recognition tasks, most notably visual classification problems. Given that DNNs are now able to classify objects in images with near-human-level performance, questions naturally arise as to what differences remain between computer and human vision. A recent study [30] revealed that changing an image (e.g. of a lion) in a way imperceptible to humans can cause a DNN to label the image as something else entirely (e.g. mislabeling a lion a library). Here we show a related result: it is easy to produce images that are completely unrecognizable to humans, but that state-of-the-art DNNs believe to be recognizable objects with 99.99% confidence (e.g. labeling with certainty that white noise static is a lion). Specifically, we take convolutional neural networks trained to perform well on either the ImageNet or MNIST datasets and then find images with evolutionary algorithms or gradient ascent that DNNs label with high confidence as belonging to each dataset class. It is possible to produce images totally unrecognizable to human eyes that DNNs believe with near certainty are familiar objects, which we call “fooling images” (more generally, fooling examples). Our results shed light on interesting differences between human vision and current DNNs, and raise questions about the generality of DNN computer vision.
17.11 A 0.65ns-response-time 3.01ps FOM fully-integrated low-dropout regulator with full-spectrum power-supply-rejection for wideband communication systems

High performance low-dropout regulators (LDOs) are indispensable in a systemon-a-chip (SoC) due to their low output noise, fast transient response and good power supply rejection (PSR) characteristics. In general, differential analog circuit loads need an LDO with high PSR, digital circuit loads need an LDO with fast load transient response, while single-ended analog/RF circuit loads need an LDO with both high PSR and fast transient response. Figure 17.11.1 shows an LDO embedded in an optical receiver that helps improve the sensitivity of the front-end system. On-chip LDOs with PSR in the GHz range are in high demand for wideband optical communication systems because there is only one photo detector in the optical receiver and supply voltage variations would degrade its sensitivity severely.
Automatic Heavy-weight Static Analysis Tools for Fin- ding Bugs in Safety-critical Embedded C/C++ Code

This paper motivates the use of automatic heavy-weight static analysis tools to find bugs in C (and C++) code for safety-critical embedded systems. By heavy-weight we mean tools that employ powerful analysis to cover all cases. The paper introduces two automatic and relatively heavy-weight tools that are currently employed in the automotive industry, and depicts their underlying techniques, advantages, and disadvantages. Since their results are often imprecise (false positives or false negatives), we advocate the use of alternative techniques such as software bounded model checking (SBMC), which can achieve bit-precise results. Finally, the tool LLBMC is described as an example of a tool implementing SBMC, which makes use of satisfiability modulo theories (SMT) decision procedures as well as the LLVM compiler framework.
Approximate image-based tree-modeling using particle flows

We present a method for producing 3D tree models from input photographs with only limited user intervention. An approximate voxel-based tree volume is estimated using image information. The density values of the voxels are used to produce initial positions for a set of particles. Performing a 3D flow simulation, the particles are traced downwards to the tree basis and are combined to form twigs and branches. If possible, the trunk and the first-order branches are determined in the input photographs and are used as attractors for particle simulation. The geometry of the tree skeleton is produced using botanical rules for branch thicknesses and branching angles. Finally, leaves are added. Different initial seeds for particle simulation lead to a variety, yet similar-looking branching structures for a single set of photographs.
Mandarin tone modeling using recurrent neural networks

We propose an Encoder-Classifier framework to model the Mandarin tones using recurrent neural networks (RNN). In this framework, extracted frames of features for tone classification are fed in to the RNN and casted into a fixed dimensional vector (tone embedding) and then classified into tone types using a softmax layer along with other auxiliary inputs. We investigate various configurations that help to improve the model, including pooling, feature splicing and utilization of syllable-level tone embeddings. Besides, tone embeddings and durations of the contextual syllables are exploited to facilitate tone classification. Experimental results on Mandarin tone classification show the proposed network setups improve tone classification accuracy. The results indicate that the RNN encoderclassifier based tone model flexibly accommodates heterogeneous inputs (sequential and segmental) and hence has the advantages from both the sequential classification tone models and segmental classification tone models.