nils-herrmann/clean_scirepeval huggingface dataset:
A Geometric Theory for Analysis and Synthesis of Sub-6 DoF Parallel Manipulators

Mechanism synthesis is mostly dependent on the designer's experience and intuition and is difficult to automate. This paper aims to develop a rigorous and precise geometric theory for analysis and synthesis of sub-6 DoF (or lower mobility) parallel manipulators. Using Lie subgroups and submanifolds of the special Euclidean group SE(3), we first develop a unified framework for modelling commonly used primitive joints and task spaces. We provide a mathematically rigorous definition of the notion of motion type using conjugacy classes. Then, we introduce a new structure for subchains of parallel manipulators using the product of two subgroups of SE(3) and discuss its realization in terms of the primitive joints. We propose the notion of quotient manipulators that substantially enriches the topologies of serial manipulators. Finally, we present a general procedure for specifying the subchain structures given the desired motion type of a parallel manipulator. The parallel mechanism synthesis problem is thus solved using the realization techniques developed for serial manipulators. Generality of the theory is demonstrated by systematically generating a large class of feasible topologies for (parallel or serial) mechanisms with a desired motion type of either a Lie subgroup or a submanifold.
Structured firewall design

A firewall is a security guard placed at the point of entry between a private network and the outside Internet such that all incoming and outgoing packets have to pass through it. The function of a firewall is to examine every incoming or outgoing packet and decide whether to accept or discard it. This function is conventionally specified by a sequence of rules, where rules often conflict. To resolve conflicts, the decision for each packet is the decision of the first rule that the packet matches. The current practice of designing a firewall directly as a sequence of rules suffers from three types of major problems: (1) the consistency problem, which means that it is difficult to order the rules correctly; (2) the completeness problem, which means that it is difficult to ensure thorough consideration for all types of traffic; (3) the compactness problem, which means that it is difficult to keep the number of rules small (because some rules may be redundant and some rules may be combined into one rule). To achieve consistency, completeness, and compactness, we propose a new method called Structured Firewall Design, which consists of two steps. First, one designs a firewall using a Firewall Decision Diagram instead of a sequence of often conflicting rules. Second, a program converts the firewall decision diagram into a compact, yet functionally equivalent, sequence of rules. This method addresses the consistency problem because a firewall decision diagram is conflict-free. It addresses the completeness problem because the syntactic requirements of a firewall decision diagram force the designer to consider all types of traffic. It also addresses the compactness problem because in the second step we use two algorithms (namely FDD reduction and FDD marking) to combine rules together, and one algorithm (namely Firewall compaction) to remove redundant rules. Moreover, the techniques and algorithms presented in this paper are extensible to other rule-based systems such as IPsec rules.
Understand, Compose and Respond - Answering Visual Questions by a Composition of Abstract Procedures

An image related question defines a specific visual task that is required in order to produce an appropriate answer. The answer may depend on a minor detail in the image and require complex reasoning and use of prior knowledge. When humans perform this task, they are able to do it in a flexible and robust manner, integrating modularly any novel visual capability with diverse options for various elaborations of the task. In contrast, current approaches to solve this problem by a machine are based on casting the problem as an end-to-end learning problem, which lacks such abilities. We present a different approach, inspired by the aforementioned human capabilities. The approach is based on the compositional structure of the question. The underlying idea is that a question has an abstract representation based on its structure, which is compositional in nature. The question can consequently be answered by a composition of procedures corresponding to its substructures. The basic elements of the representation are logical patterns, which are put together to represent the question. These patterns include a parametric representation for object classes, properties and relations. Each basic pattern is mapped into a basic procedure that includes meaningful visual tasks, and the patterns are composed to produce the overall answering procedure. The UnCoRd (Understand Compose and Respond) system, based on this approach, integrates existing detection and classification schemes for a set of object classes, properties and relations. These schemes are incorporated in a modular manner, typical also to human vision. The logical composition of real visual tasks allows using meaningful intermediate results to elaborate the answer (e.g. reasoning) and provide corrections and alternatives when answers are negative. In addition, an external knowledge base is also integrated into the process, to supply common-knowledge information that may be required to understand the question and produce an answer. We performed a qualitative analysis of the system, which demonstrates its representation capabilities and provide suggestions for future developments.
Be Selfish and Avoid Dilemmas: Fork After Withholding (FAW) Attacks on Bitcoin

In the Bitcoin system, participants are rewarded for solving cryptographic puzzles. In order to receive more consistent rewards over time, some participants organize mining pools and split the rewards from the pool in proportion to each participant's contribution. However, several attacks threaten the ability to participate in pools. The block withholding (BWH) attack makes the pool reward system unfair by letting malicious participants receive unearned wages while only pretending to contribute work. When two pools launch BWH attacks against each other, they encounter the miner's dilemma: in a Nash equilibrium, the revenue of both pools is diminished. In another attack called selfish mining, an attacker can unfairly earn extra rewards by deliberately generating forks.
 In this paper, we propose a novel attack called a fork after withholding (FAW) attack. FAW is not just another attack. The reward for an FAW attacker is always equal to or greater than that for a BWH attacker, and it is usable up to four times more often per pool than in BWH attack. When considering multiple pools --- the current state of the Bitcoin network -- the extra reward for an FAW attack is about 56% more than that for a BWH attack. Furthermore, when two pools execute FAW attacks on each other, the miner's dilemma may not hold: under certain circumstances, the larger pool can consistently win. More importantly, an FAW attack, while using intentional forks, does not suffer from practicality issues, unlike selfish mining. We also discuss partial countermeasures against the FAW attack, but finding a cheap and efficient countermeasure remains an open problem. As a result, we expect to see FAW attacks among mining pools.
Linking Loneliness, Shyness, Smartphone Addiction Symptoms, and Patterns of Smartphone Use to Social Capital

The purpose of this study is to explore the roles of psychological attributes (such as shyness and loneliness) and smartphone usage patterns in predicting smartphone addiction symptoms and social capital. Data were gathered from a sample of 414 university students using online survey in Mainland China. Results from exploratory factor analysis identified five smartphone addiction symptoms: disregard of harmful consequences, preoccupation, inability to control craving, productivity loss, and feeling anxious and lost, which formed the Smartphone Addiction Scale. Results show that the higher one scored in loneliness and shyness, the higher the likelihood one would be addicted to smartphone. Furthermore, this study shows the most powerful predictor inversely affecting both bonding and bridging social capital was loneliness. Moreover, this study presents clear evidence that the use of smartphones for different purposes (especially for information seeking, sociability, and utility) and the exhibition of different addiction symptoms (such as preoccupation and feeling anxious and lost) significantly impacted social capital building. The significant links between smartphone addiction and smartphone usage, loneliness, and shyness have clear implications for treatment and intervention for parents, educators, and policy makers. Suggestions for future research are discussed.
Merging Strategies for Sum-Product Networks: From Trees to Graphs

Learning the structure of sum-product networks (SPNs) – arithmetic circuits over latent and observed variables – has been the subject of much recent research. These networks admit linear time exact inference, and thus help alleviate one of the chief disadvantages of probabilistic graphical models: accurate probabilistic inference algorithms are often computationally expensive. Although, algorithms for inducing their structure from data have come quite far and often outperform algorithms that induce probabilistic graphical models, a key issue with existing approaches is that they induce tree SPNs, a small, inefficient sub-class of SPNs. In this paper, we address this limitation by developing post-processing approaches that induce graph SPNs from tree SPNs by merging similar sub-structures. The key benefits of graph SPNs over tree SPNs include smaller computational complexity which facilitates faster online inference, and better generalization accuracy because of reduced variance, at the cost of slight increase in the learning time. We demonstrate experimentally that our merging techniques significantly improve the accuracy of tree SPNs, achieving state-of-the-art performance on several real world benchmark datasets.
Scale ratio ICP for 3D point clouds with different scales

In this paper we propose a method for matching the scales of 3D point clouds. 3D point sets of the same scene obtained by 3D reconstruction techniques usually differ in scale. To match scales, we estimate the ratio of scales of two given 3D point clouds. By performing PCA of spin images over different scales of two point clouds, two sets of cumulative contribution rate curves are generated. Such sets of curves can be considered to characterize the scale of the given 3D point clouds. To find the scale ratio of two point clouds, we register the two sets of curves by using a variant of ICP that estimates the ratio of scales. Simulations with the Stanford bunny and experimental results with 3D reconstructions of artificial and real scenes demonstrate that the ratio of any 3D point clouds can be effectively used for scale matching.
I/O performance challenges at leadership scale

Today's top high performance computing systems run applications with hundreds of thousands of processes, contain hundreds of storage nodes, and must meet massive I/O requirements for capacity and performance. These leadership-class systems face daunting challenges to deploying scalable I/O systems. In this paper we present a case study of the I/O challenges to performance and scalability on Intrepid, the IBM Blue Gene/P system at the Argonne Leadership Computing Facility. Listed in the top 5 fastest supercomputers of 2008, Intrepid runs computational science applications with intensive demands on the I/O system. We show that Intrepid's file and storage system sustain high performance under varying workloads as the applications scale with the number of processes.
A Contrast Enhancement-Based Filter for Removal of Random Valued Impulse Noise

This letter presents a new filtering scheme based on contrast enhancement within the filtering window for removing the random valued impulse noise. The application of a nonlinear function for increasing the difference between a noise-free and noisy pixels results in efficient detection of noisy pixels. As the performance of a filtering system, in general, depends on the number of iterations used, an effective stopping criterion based on noisy image characteristics to determine the number of iterations is also proposed. Extensive simulation results exhibit that the proposed method significantly outperforms many other well-known techniques.
A Broadband Compact Microstrip Rat-Race Hybrid Using a Novel CPW Inverter

A new compact microstrip rat-race hybrid with an octave bandwidth employing a novel frequency-independent coplanar waveguide (CPW) phase inverter is reported in this paper. The 270deg branch of a conventional rat-race is replaced by a -90deg branch, which is realized by a 90deg microstrip line and the CPW phase inverter. A new microstrip-to-CPW transition is introduced for which a lumped-element model is devised to facilitate parameter optimization. The designed transition has an insertion loss less than 0.33 dB across the designed frequency band from 1.5 to 3.5 GHz. The footprint of the proposed design is reduced by 75% and shows almost 60% and 80% enhancements in the 0.5-dB mismatch bandwidth of amplitude and 10deg mismatch bandwidth of phase, respectively, when compared with the conventional implementation. The proposed hybrid can be fabricated using a conventional printed-circuit and plated thru-hole technologies
Better Digit Recognition with a Committee of Simple Neural Nets

We present a new method to train the members of a committee of one-hidden-layer neural nets. Instead of training various nets on subsets of the training data we preprocess the training data for each individual model such that the corresponding errors are decor related. On the MNIST digit recognition benchmark set we obtain a recognition error rate of 0.39%, using a committee of 25 one-hidden-layer neural nets, which is on par with state-of-the-art recognition rates of more complicated systems.
A Probabilistic Approach to Spectral Graph Matching

Spectral Matching (SM) is a computationally efficient approach to approximate the solution of pairwise matching problems that are np-hard. In this paper, we present a probabilistic interpretation of spectral matching schemes and derive a novel Probabilistic Matching (PM) scheme that is shown to outperform previous approaches. We show that spectral matching can be interpreted as a Maximum Likelihood (ML) estimate of the assignment probabilities and that the Graduated Assignment (GA) algorithm can be cast as a Maximum a Posteriori (MAP) estimator. Based on this analysis, we derive a ranking scheme for spectral matchings based on their reliability, and propose a novel iterative probabilistic matching algorithm that relaxes some of the implicit assumptions used in prior works. We experimentally show our approaches to outperform previous schemes when applied to exhaustive synthetic tests as well as the analysis of real image sequences.
Analyzing Process Models Using Graph Reduction Techniques

The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflows, we show how a structural specification may contain deadlock and lack of synchronization conflicts that could compromise the correct execution of workflows. In general, identification of such conflicts is a computationally complex problem and requires development of effective algorithms specific for the target modeling language. We present a visual verification approach and algorithm that employs a set of graph reduction rules to identify structural conflicts in process models for the given workflow modeling language. We also provide insights into the correctness and complexity of the reduction process. Finally, we show how the reduction algorithm may be used to count possible instance subgraphs of a correct process model. The main contribution of the paper is a new technique for satisfying well-defined correctness criteria in process models.
High-performance CMOS pseudo-differential amplifier

A pseudo-differential-input differential-output CMOS amplifier, operating from a minimum supply of V/sub T/+2V/sub DS,SAT/ and exhibiting high current-drive capability as well as fast settling response, is presented. The circuit is also characterized by a wide input differential range that enables its use even as a linear transconductor. For this purpose, a common-mode feedback section is also included. Simulation results confirming the overall excellent performance are provided.
On Detecting Road Regions in a Single UAV Image

Automatic detection of road regions in aerial images remains a challenging research topic. Most existing approaches work well on the requirement of users to provide some seedlike points/strokes in the road area as the initial location of road regions, or detecting particular roads such as well-paved roads or straight roads. This paper presents a fully automatic approach that can detect generic roads from a single unmanned aerial vehicles (UAV) image. The proposed method consists of two major components: automatic generation of road/nonroad seeds and seeded segmentation of road areas. To know where roads probably are (i.e., road seeds), a distinct road feature is proposed based on the stroke width transformation (SWT) of road image. To the best of our knowledge, it is the first time to introduce SWT as road features, which show the effectiveness on capturing road areas in images in our experiments. Different road features, including the SWT-based geometry information, colors, and width, are then combined to classify road candidates. Based on the candidates, a Gaussian mixture model is built to produce road seeds and background seeds. Finally, starting from these road and background seeds, a convex active contour model segmentation is proposed to extract whole road regions. Experimental results on varieties of UAV images demonstrate the effectiveness of the proposed method. Comparison with existing techniques shows the robustness and accuracy of our method to different roads.
Shift-Reduce Dependency DAG Parsing

 Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and linguistic perspectives, the structure of linguistic phenomena that goes beyond shallow syntax often cannot be fully captured by tree representations. We present a parsing approach that is nearly as simple as current data-driven transition-based dependency parsing frameworks, but outputs directed acyclic graphs (DAGs). We demonstrate the benefits of DAG parsing in two experiments where its advantages over dependency tree parsing can be clearly observed: predicate-argument analysis of English and syntactic analysis of Danish with a representation that includes long-distance dependencies and anaphoric reference links.
The Accuracy-Privacy Tradeoff of Mobile Crowdsensing

Mobile crowdsensing has emerged as an efficient sensing paradigm which combines the crowd intelligence and the sensing power of mobile devices, e.g., mobile phones and Internet of Things (IoT) gadgets. This article addresses the contradicting incentives of privacy preservation by crowdsensing users and accuracy maximization and collection of true data by service providers. We firstly define the individual contributions of crowdsensing users based on the accuracy in data analytics achieved by the service provider from buying their data. We then propose a truthful mechanism for achieving high service accuracy while protecting the privacy based on the user preferences. The users are incentivized to provide true data by being paid based on their individual contribution to the overall service accuracy. Moreover, we propose a coalition strategy which allows users to cooperate in providing their data under one identity, increasing their anonymity privacy protection, and sharing the resulting payoff. Finally, we outline important open research directions in mobile and people-centric crowdsensing.
VEGAS: Visual influEnce GrAph Summarization on Citation Networks

Visually analyzing citation networks poses challenges to many fields of the data mining research. How can we summarize a large citation graph according to the user's interest? In particular, how can we illustrate the impact of a highly influential paper through the summarization? Can we maintain the sensory node-link graph structure while revealing the flow-based influence patterns and preserving a fine readability? The state-of-the-art influence maximization algorithms can detect the most influential node in a citation network, but fail to summarize a graph structure to account for its influence. On the other hand, existing graph summarization methods fold large graphs into clustered views, but can not reveal the hidden influence patterns underneath the citation network. In this paper, we first formally define the Influence Graph Summarization problem on citation networks. Second, we propose a matrix decomposition based algorithm pipeline to solve the IGS problem. Our method can not only highlight the flow-based influence patterns, but also easily extend to support the rich attribute information. A prototype system called VEGAS implementing this pipeline is also developed. Third, we present a theoretical analysis on our main algorithm, which is equivalent to the kernel k-mean clustering. It can be proved that the matrix decomposition based algorithm can approximate the objective of the proposed IGS problem. Last, we conduct comprehensive experiments with real-world citation networks to compare the proposed algorithm with classical graph summarization methods. Evaluation results demonstrate that our method significantly outperforms the previous ones in optimizing both the quantitative IGS objective and the quality of the visual summarizations.
Skin segmentation using color pixel classification: analysis and comparison

This work presents a study of three important issues of the color pixel classification approach to skin segmentation: color representation, color quantization, and classification algorithm. Our analysis of several representative color spaces using the Bayesian classifier with the histogram technique shows that skin segmentation based on color pixel classification is largely unaffected by the choice of the color space. However, segmentation performance degrades when only chrominance channels are used in classification. Furthermore, we find that color quantization can be as low as 64 bins per channel, although higher histogram sizes give better segmentation performance. The Bayesian classifier with the histogram technique and the multilayer perceptron classifier are found to perform better compared to other tested classifiers, including three piecewise linear classifiers, three unimodal Gaussian classifiers, and a Gaussian mixture classifier.