OpenRaiser/Intern-Atlas huggingface dataset:
Universality of scholarly impact metrics
Venue: arXiv cs.DL 2013
Year: 2013

Given the growing use of impact metrics in the evaluation of scholars, journals, academic institutions, and even countries, there is a critical need for means to compare scientific impact across disciplinary boundaries. Unfortunately, citation-based metrics are strongly biased by diverse field sizes and publication and citation practices. As a result, we have witnessed an explosion in the number of newly proposed metrics that claim to be "universal." However, there is currently no way to objectively assess whether a normalized metric can actually compensate for disciplinary bias. We introduce a new method to assess the universality of any scholarly impact metric, and apply it to evaluate a number of established metrics. We also define a very simple new metric hs, which proves to be universal, thus allowing to compare the impact of scholars across scientific disciplines. These results move us closer to a formal methodology in the measure of scholarly impact.
Robust Precision Positioning Control on Linear Ultrasonic Motor
Venue: arXiv cs.SY 2013
Year: 2013

Ultrasonic motors used in high-precision mechatronics are characterized by strong frictional effects, which are among the main problems in precision motion control. The traditional methods apply model-based nonlinear feedforward to compensate the friction, thus requiring closed-loop stability and safety constraint considerations. Implementation of these methods requires complex designed experiments. This paper introduces a systematic approach using piecewise affine models to emulate the friction effect of the motor motion. The well-known model predictive control method is employed to deal with piecewise affine models. The increased complexity of the model offers a higher tracking precision on a simpler gain scheduling scheme.
The Complexity of the Proper Orientation Number
Venue: arXiv cs.CC 2013
Year: 2013

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V,E)$ is an orientation $D$ of $E(G)$ such that for every two adjacent vertices $ v $ and $ u $, $ d^{-}_{D}(v) \neq d^{-}_{D}(u)$ where $d_{D}^{-}(v)$ is the number of edges with head $v$ in $D$. The proper orientation number of $G$ is defined as $ \overrightarrowχ (G) =\displaystyle \min_{D\in Γ} \displaystyle\max_{v\in V(G)} d^{-}_{D}(v) $ where $Γ$ is the set of proper orientations of $G$. We have $ χ(G)-1 \leq \overrightarrowχ (G)\leq Δ(G) $. We show that, it is $ \mathbf{NP} $-complete to decide whether $\overrightarrowχ(G)=2$, for a given planar graph $G$. Also, we prove that there is a polynomial time algorithm for determining the proper orientation number of 3-regular graphs. In sharp contrast, we will prove that this problem is $ \mathbf{NP} $-hard for 4-regular graphs.
Social Sensor Placement in Large Scale Networks: A Graph Sampling Perspective
Venue: arXiv cs.SI 2013
Year: 2013

Sensor placement for the purpose of detecting/tracking news outbreak and preventing rumor spreading is a challenging problem in a large scale online social network (OSN). This problem is a kind of subset selection problem: choosing a small set of items from a large population so to maximize some prespecified set function. However, it is known to be NP-complete. Existing heuristics are very costly especially for modern OSNs which usually contain hundreds of millions of users. This paper aims to design methods to find \emph{good solutions} that can well trade off efficiency and accuracy. We first show that it is possible to obtain a high quality solution with a probabilistic guarantee from a "{\em candidate set}" of the underlying social network. By exploring this candidate set, one can increase the efficiency of placing social sensors. We also present how this candidate set can be obtained using "{\em graph sampling}", which has an advantage over previous methods of not requiring the prior knowledge of the complete network topology. Experiments carried out on two real datasets demonstrate not only the accuracy and efficiency of our approach, but also effectiveness in detecting and predicting news outbreak.
A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures
Venue: arXiv cs.NE 2013
Year: 2013

We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the nodes and an optimal connectivity matrix, our algorithm uses two subpopulations, each one representing a subtask. We describe the empirical results obtained with simulations of the Alarm and Insurance networks. We show that our algorithm outperforms the deterministic algorithm K2.
MirrorShard: Proof by Computational Reflection with Verified Hints
Venue: arXiv cs.PL 2013
Year: 2013

We describe a method for building composable and extensible verification procedures within the Coq proof assistant. Unlike traditional methods that rely on run-time generation and checking of proofs, we use verified-correct procedures with Coq soundness proofs. Though they are internalized in Coq's logic, our provers support sound extension by users with hints over new domains, enabling automated reasoning about user-defined abstract predicates. We maintain soundness by developing an architecture for modular packaging, construction, and composition of hint databases, which had previously only been implemented in Coq at the level of its dynamically typed, proof-generating tactic language. Our provers also include rich handling of unification variables, enabling integration with other tactic-based deduction steps within Coq. We have implemented our techniques in MirrorShard, an open-source framework for reflective verification. We demonstrate its applicability by instantiating it to separation logic in order to reason about imperative program verification.
Active Sensing as Bayes-Optimal Sequential Decision Making
Venue: arXiv cs.AI 2013
Year: 2013

Sensory inference under conditions of uncertainty is a major problem in both machine learning and computational neuroscience. An important but poorly understood aspect of sensory processing is the role of active sensing. Here, we present a Bayes-optimal inference and control framework for active sensing, C-DAC (Context-Dependent Active Controller). Unlike previously proposed algorithms that optimize abstract statistical objectives such as information maximization (Infomax) [Butko & Movellan, 2010] or one-step look-ahead accuracy [Najemnik & Geisler, 2005], our active sensing model directly minimizes a combination of behavioral costs, such as temporal delay, response error, and effort. We simulate these algorithms on a simple visual search task to illustrate scenarios in which context-sensitivity is particularly beneficial and optimization with respect to generic statistical objectives particularly inadequate. Motivated by the geometric properties of the C-DAC policy, we present both parametric and non-parametric approximations, which retain context-sensitivity while significantly reducing computational complexity. These approximations enable us to investigate the more complex problem involving peripheral vision, and we notice that the difference between C-DAC and statistical policies becomes even more evident in this scenario.
About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures(Working paper)
Venue: arXiv cs.SI 2013
Year: 2013

The discriminant power of centrality indices for the degree, eigenvector, closeness, betweenness and subgraph centrality is analyzed. It is defined by the number of graphs for which the standard deviation of the centrality of its nodes is zero. On the basis of empirical analysis it is concluded that the subgraph centrality displays better discriminant power than the rest of centralities. We also propose some new conjectures about the types of graphs for which the subgraph centrality does not discriminate among nonequivalent nodes.
Incentive Mechanisms for Internet Congestion Management: Fixed-Budget Rebate versus Time-of-Day Pricing
Venue: arXiv cs.NI 2013
Year: 2013

Mobile data traffic has been steadily rising in the past years. This has generated a significant interest in the deployment of incentive mechanisms to reduce peak-time congestion. Typically, the design of these mechanisms requires information about user demand and sensitivity to prices. Such information is naturally imperfect. In this paper, we propose a \emph{fixed-budget rebate mechanism} that gives each user a reward proportional to his percentage contribution to the aggregate reduction in peak time demand. For comparison, we also study a time-of-day pricing mechanism that gives each user a fixed reward per unit reduction of his peak-time demand. To evaluate the two mechanisms, we introduce a game-theoretic model that captures the \emph{public good} nature of decongestion. For each mechanism, we demonstrate that the socially optimal level of decongestion is achievable for a specific choice of the mechanism's parameter. We then investigate how imperfect information about user demand affects the mechanisms' effectiveness. From our results, the fixed-budget rebate pricing is more robust when the users' sensitivity to congestion is "sufficiently" convex. This feature of the fixed-budget rebate mechanism is attractive for many situations of interest and is driven by its closed-loop property, i.e., the unit reward decreases as the peak-time demand decreases.
Enhanced blind decoding of Tardos codes with new map-based functions
Venue: arXiv cs.CR 2013
Year: 2013

This paper presents a new decoder for probabilistic binary traitor tracing codes under the marking assumption. It is based on a binary hypothesis testing rule which integrates a collusion channel relaxation so as to obtain numerical and simple accusation functions. This decoder is blind as no estimation of the collusion channel prior to the accusation is required. Experimentations show that using the proposed decoder gives better performance than the well-known symmetric version of the Tardos decoder for common attack channels.
For a Semantic Web based Peer-reviewing and Publication of Research Results
Venue: arXiv cs.DL 2013
Year: 2013

This article shows why the diffusion and peer-reviewing of research results would be more efficient, precise and relevant if all or at least some parts of the descriptions and peer-reviews of research results took the form of a fine-grained semantic network, within articles or knowledge bases, as part of the Semantic Web. This article also shows some ways this can be done and hence how research journal/proceeding publishers could allow this. So far, the World Wide Web Consortium (W3C) has not proposed simple notations and cooperation protocols - similar to those illustrated or referred to in this article - but it now seems likely that Wikipedia/Wikidata, Google or the W3C will propose them sooner or later. Then, research journal/proceeding publishers and researchers may or may not quickly use this approach.
Organizing Linked Data Quality Related Methods
Venue: arXiv cs.DL 2013
Year: 2013

This article presents the top-level of an ontology categorizing and generalizing best practices and quality criteria or measures for Linked Data. It permits to compare these techniques and have a synthetic organized view of what can or should be done for knowledge sharing purposes. This ontology is part of a general knowledge base that can be accessed and complemented by any Web user. Thus, it can be seen as a cooperatively built library for the above cited elements. Since they permit to evaluate information objects and create better ones, these elements also permit knowledge-based tools and techniques - as well as knowledge providers - to be evaluated and categorized based on their input/output information objects. One top-level distinction permitting to organize this ontology is the one between content, medium and containers of descriptions. Various structural, ontological, syntactical and lexical distinctions are then used.
Secure Degrees of Freedom of K-User Gaussian Interference Channels: A Unified View
Venue: arXiv cs.IT 2013
Year: 2013

We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user interference channel with confidential messages (IC-CM), and 3) K-user interference channel with confidential messages and one external eavesdropper (IC-CM-EE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K-1)/(2K-1). We show converses for IC-EE and IC-CM, which imply a converse for IC-CM-EE. We show achievability for IC-CM-EE, which implies achievability for IC-EE and IC-CM. We develop the converses by relating the channel inputs of interfering users to the reliable rates of the interfered users, and by quantifying the secrecy penalty in terms of the eavesdroppers' observations. Our achievability uses structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller sub-space at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.
A Note on Cyclic Codes from APN Functions
Venue: arXiv cs.IT 2013
Year: 2013

Cyclic codes, as linear block error-correcting codes in coding theory, play a vital role and have wide applications. Ding in \cite{D} constructed a number of classes of cyclic codes from almost perfect nonlinear (APN) functions and planar functions over finite fields and presented ten open problems on cyclic codes from highly nonlinear functions. In this paper, we consider two open problems involving the inverse APN functions $f(x)=x^{q^m-2}$ and the Dobbertin APN function $f(x)=x^{2^{4i}+2^{3i}+2^{2i}+2^{i}-1}$. From the calculation of linear spans and the minimal polynomials of two sequences generated by these two classes of APN functions, the dimensions of the corresponding cyclic codes are determined and lower bounds on the minimum weight of these cyclic codes are presented. Actually, we present a framework for the minimal polynomial and linear span of the sequence $s^{\infty}$ defined by $s_t=Tr((1+α^t)^e)$, where $α$ is a primitive element in $GF(q)$. These techniques can also be applied into other open problems in \cite{D}.
Sub-Stream Fairness and Numerical Correctness in MIMO Interference Channels
Venue: arXiv cs.IT 2013
Year: 2013

Signal-to-interference plus noise ratio (SINR) and rate fairness in a system are substantial quality-of-service (QoS) metrics. The acclaimed SINR maximization (max-SINR) algorithm does not achieve fairness between user's streams, i.e., sub-stream fairness is not achieved. To this end, we propose a distributed power control algorithm to render sub-stream fairness in the system. Sub-stream fairness is a less restrictive design metric than stream fairness (i.e., fairness between all streams) thus sum-rate degradation is milder. Algorithmic parameters can significantly differentiate the results of numerical algorithms. A complete picture for comparison of algorithms can only be depicted by varying these parameters. For example, a predetermined iteration number or a negligible increment in the sum-rate can be the stopping criteria of an algorithm. While the distributed interference alignment (DIA) can reasonably achieve sub-stream fairness for the later, the imbalance between sub-streams increases as the preset iteration number decreases. Thus comparison of max-SINR and DIA with a low preset iteration number can only depict a part of the picture. We analyze such important parameters and their effects on SINR and rate metrics to exhibit numerical correctness in executing the benchmarks. Finally, we propose group filtering schemes that jointly design the streams of a user in contrast to max-SINR scheme that designs each stream of a user separately.
Performance of Single User vs. Multiuser Modulation in Wireless Multicarrier (MC) Communications
Venue: arXiv cs.IT 2013
Year: 2013

The main objective of this paper is to compare block transmission system performance analytically for Code Divisional Multiple Access (CDMA) modulations in Generalized Multicarrier environment against linear modulation techniques for both single user and multiuser. The effectivity of GMC-CDMA for multiuser will also be judged for different Direct Sequence CDMA (DS-CDMA) such as MC-CDMA, MC-DS-CDMA, MC-SS-CDMA. The analytical comparison will be in terms of computing probability of bit error for frequency selective and slow flat fading channels for different modulation techniques. The Bit Error Rate should be a good indication for of the performance. The tolerance characteristics of DS-CDMA in frequency-selective channels and MC-CDMA in flat fading channels will be shown analytically and improved capacity and Bit Error Rate performance will be derived for Block Spread Multiuser Multicarrier by relying block symbol spreading and Fast Fourier Transform (FFT) operations. GMC-CDMA should give guaranteed symbol recovery regardless of channel limitations.
The Dendritic Cell Algorithm for Intrusion Detection
Venue: arXiv cs.CR 2013
Year: 2013

As one of the solutions to intrusion detection problems, Artificial Immune Systems (AIS) have shown their advantages. Unlike genetic algorithms, there is no one archetypal AIS, instead there are four major paradigms. Among them, the Dendritic Cell Algorithm (DCA) has produced promising results in various applications. The aim of this chapter is to demonstrate the potential for the DCA as a suitable candidate for intrusion detection problems. We review some of the commonly used AIS paradigms for intrusion detection problems and demonstrate the advantages of one particular algorithm, the DCA. In order to clearly describe the algorithm, the background to its development and a formal definition are given. In addition, improvements to the original DCA are presented and their implications are discussed, including previous work done on an online analysis component with segmentation and ongoing work on automated data preprocessing. Based on preliminary results, both improvements appear to be promising for online anomaly-based intrusion detection.
Real-world Transfer of Evolved Artificial Immune System Behaviours between Small and Large Scale Robotic Platforms
Venue: arXiv cs.NE 2013
Year: 2013

In mobile robotics, a solid test for adaptation is the ability of a control system to function not only in a diverse number of physical environments, but also on a number of different robotic platforms. This paper demonstrates that a set of behaviours evolved in simulation on a miniature robot (epuck) can be transferred to a much larger-scale platform (Pioneer), both in simulation and in the real world. The chosen architecture uses artificial evolution of epuck behaviours to obtain a genetic sequence, which is then employed to seed an idiotypic, artificial immune system (AIS) on the Pioneers. Despite numerous hardware and software differences between the platforms, navigation and target-finding experiments show that the evolved behaviours transfer very well to the larger robot when the idiotypic AIS technique is used. In contrast, transferability is poor when reinforcement learning alone is used, which validates the adaptability of the chosen architecture.
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
Venue: arXiv cs.DS 2013
Year: 2013

Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth. In recent work by Bodlaender et al., it was shown that for many connectivity problems, there exist algorithms that use time, linear in the number of vertices, and single exponential in the width of the tree decomposition that is used. The central idea is that it suffices to compute representative sets, and these can be computed efficiently with help of Gaussian elimination. In this paper, we give an experimental evaluation of this technique for the Steiner Tree problem. A comparison of the classic dynamic programming algorithm and the improved dynamic programming algorithm that employs the table reduction shows that the new approach gives significant improvements on the running time of the algorithm and the size of the tables computed by the dynamic programming algorithm, and thus that the rank based approach from Bodlaender et al. does not only give significant theoretical improvements but also is a viable approach in a practical setting, and showcases the potential of exploiting the idea of representative sets for speeding up dynamic programming algorithms.
Towards a More Systematic Approach to Secure Systems Design and Analysis
Venue: arXiv cs.CR 2013
Year: 2013

The task of designing secure software systems is fraught with uncertainty, as data on uncommon attacks is limited, costs are difficult to estimate, and technology and tools are continually changing. Consequently, experts may interpret the security risks posed to a system in different ways, leading to variation in assessment. This paper presents research into measuring the variability in decision making between security professionals, with the ultimate goal of improving the quality of security advice given to software system designers. A set of thirty nine cyber-security experts took part in an exercise in which they independently assessed a realistic system scenario. This study quantifies agreement in the opinions of experts, examines methods of aggregating opinions, and produces an assessment of attacks from ratings of their components. We show that when aggregated, a coherent consensus view of security emerges which can be used to inform decisions made during systems design.
Calibrated Fair Measures of Measure: Indices to Quantify an Individual's Scientific Research Output
Venue: arXiv cs.DL 2013
Year: 2013

Are existing ways of measuring scientific quality reflecting disadvantages of not being part of giant collaborations? How could possible discrimination be avoided? We propose indices defined for each discipline (subfield) and which count the plausible contributions added up by collaborators maintaining the spirit of interdependency. Based on the growing debate about defining potential biases and detecting unethical behavior, a standardized method to measure contributions of the astronomical number of coauthors is introduced.
Contract agreements via logic
Venue: arXiv cs.LO 2013
Year: 2013

We relate two contract models: one based on event structures and game theory, and the other one based on logic. In particular, we show that the notions of agreement and winning strategies in the game-theoretic model are related to that of provability in the logical model.
Harmony search algorithm for the container storage problem
Venue: arXiv cs.NE 2013
Year: 2013

Recently a new metaheuristic called harmony search was developed. It mimics the behaviors of musicians improvising to find the better state harmony. In this paper, this algorithm is described and applied to solve the container storage problem in the harbor. The objective of this problem is to determine a valid containers arrangement, which meets customers delivery deadlines, reduces the number of container rehandlings and minimizes the ship idle time. In this paper, an adaptation of the harmony search algorithm to the container storage problem is detailed and some experimental results are presented and discussed. The proposed approach was compared to a genetic algorithm previously applied to the same problem and recorded a good results.