OpenRaiser/Intern-Atlas huggingface dataset:
Kerberos Authentication in Wireless Sensor Networks
Venue: arXiv cs.CR 2012
Year: 2012

We proposed an authentication mechanism in the wireless sensor network. Sensor network uses the Kerberos authentication scheme for the authentication of bases station in the network. Kerberos provides a centralized authentication server whose function is to authenticate user by providing him the ticket to grant request to the base station. In this paper we have provided architecture for the authentication of base station in the wireless sensor network based on the Kerberos server authentication scheme.
Kolmogorov complexity and the asymptotic bound for error-correcting codes
Venue: arXiv cs.IT 2012
Year: 2012

The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,δ)$:= (relative transmission rate, relative minimal distance). Limit points of this set form a closed subset, defined by $R\le α_q(δ)$, where $α_q(δ)$ is a continuous decreasing function called asymptotic bound. Its existence was proved by the first--named author in 1981 ([Man1]), but no approaches to the computation of this function are known, and in [Man5] it was even suggested that this function might be uncomputable in the sense of constructive analysis. In this note we show that the asymptotic bound becomes computable with the assistance of an oracle producing codes in the order of their growing Kolmogorov complexity. Moreover, a natural partition function involving complexity allows us to interpret the asymptotic bound as a curve dividing two different thermodynamic phases of codes.
Verification and Diagnosis Infrastructure of SoC HDL-model
Venue: arXiv cs.OH 2012
Year: 2012

This article describes technology for diagnosing SoC HDL-models, based on transactional graph. Diagnosis method is focused to considerable decrease the time of fault detection and memory for storage of diagnosis matrix by means of forming ternary relations in the form of test, monitor, and functional component. The following problems are solved: creation of digital system model in the form of transaction graph and multi-tree of fault detection tables, as well as ternary matrices for activating functional components in tests, relative to the selected set of monitors; development of a method for analyzing the activation matrix to detect the faults with given depth and synthesizing logic functions for subsequent embedded hardware fault diagnosing.
The Evolution of Cooperation in Business
Venue: arXiv cs.GT 2012
Year: 2012

The development of cooperative relations within and between firms plays an important role in the successful implementation of business strategy. How to produce such relations is less well understood. We build on work in relational contract theory and the evolution of cooperation to examine the conditions under which group based incentives outperform individual based incentives and how they produce more cooperative behavior. Group interactions are modeled as iterated games in which individuals learn optimal strategies under individual and group based reward mechanisms. The space of possible games is examined and it is found that, when individual and group interests are not aligned, group evaluation and reward systems lead to higher group performance and, counter-intuitively, higher individual performance. Such groups include individuals who, quite differently to free-riders, sacrifice their own performance for the good of the group. We discuss the implications of these results for the design of incentive systems.
Control of Probabilistic Systems under Dynamic, Partially Known Environments with Temporal Logic Specifications
Venue: arXiv cs.LO 2012
Year: 2012

We consider the synthesis of control policies for probabilistic systems, modeled by Markov decision processes, operating in partially known environments with temporal logic specifications. The environment is modeled by a set of Markov chains. Each Markov chain describes the behavior of the environment in each mode. The mode of the environment, however, is not known to the system. Two control objectives are considered: maximizing the expected probability and maximizing the worst-case probability that the system satisfies a given specification.
Subtotal ordering -- a pedagogically advantageous algorithm for computing total degree reverse lexicographic order
Venue: arXiv cs.SC 2012
Year: 2012

Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Groebner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and describes why it should be very nearly the same speed the traditional algorithm, all other things being equal. However, experimental evidence suggests that subtotal order is actually slightly faster for the Mathematica Groebner basis implementation more often than not. This is probably because the weight vectors associated with the natural subtotal weight matrix and with the usual total degree reverse lexicographic weight matrix are different, and Mathematica also uses those the corresponding weight vectors to help select successive S polynomials and divisor polynomials: Those selection heuristics appear to work slightly better more often with subtotal weight vectors. However, the most important advantage of exponent subtotals is pedagogical. It is easier to understand than the total degree reverse lexicographic algorithm, and it is more evident why the resulting order is often the fastest known order for computing Groebner bases. Keywords: Term order, Total degree reverse lexicographic, tdeg, grevlex, Groebner basis
A Turing Machine Resisting Isolated Bursts Of Faults
Venue: arXiv cs.CC 2012
Year: 2012

We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing machine M(B) subject to faults that can simulate any fault-free machine under the condition that bursts are not closer to each other than V for an appropriate V = O(B^2).
Multi-Flow Attacks Against Network Flow Watermarks: Analysis and Countermeasures
Venue: arXiv cs.CR 2012
Year: 2012

In this paper, we analyze several recent schemes for watermarking network flows that are based on splitting the flow into timing intervals. We show that this approach creates time-dependent correlations that enable an attack that combines multiple watermarked flows. Such an attack can easily be mounted in nearly all applications of network flow watermarking, both in anonymous communication and stepping stone detection. The attack can be used to detect the presence of a watermark, recover the secret parameters, and remove the watermark from a flow. The attack can be effective even if different flows are marked with different values of a watermark. We analyze the efficacy of our attack using a probabilistic model and a Markov-Modulated Poisson Process (MMPP) model of interactive traffic. We also implement our attack and test it using both synthetic and real-world traces, showing that our attack is effective with as few as 10 watermarked flows. Finally, we propose possible countermeasures to defeat the multi-flow attack.
AD in Fortran, Part 1: Design
Venue: arXiv cs.PL 2012
Year: 2012

We propose extensions to Fortran which integrate forward and reverse Automatic Differentiation (AD) directly into the programming model. Irrespective of implementation technology, embedding AD constructs directly into the language extends the reach and convenience of AD while allowing abstraction of concepts of interest to scientific-computing practice, such as root finding, optimization, and finding equilibria of continuous games. Multiple different subprograms for these tasks can share common interfaces, regardless of whether and how they use AD internally. A programmer can maximize a function F by calling a library maximizer, XSTAR=ARGMAX(F,X0), which internally constructs derivatives of F by AD, without having to learn how to use any particular AD tool. We illustrate the utility of these extensions by example: programs become much more concise and closer to traditional mathematical notation. A companion paper describes how these extensions can be implemented by a program that generates input to existing Fortran-based AD tools.
A New Look at Composition of Authenticated Byzantine Generals
Venue: arXiv cs.CR 2012
Year: 2012

The problem of Authenticated Byzantine Generals (ABG) aims to simulate a virtual reliable broadcast channel from the General to all the players via a protocol over a real (point-to-point) network in the presence of faults. We propose a new model to study the self-composition of ABG protocols. The central dogma of our approach can be phrased as follows: Consider a player who diligently executes (only) the delegated protocol but the adversary steals some private information from him. Should such a player be considered faulty? With respect to ABG protocols, we argue that the answer has to be no. In the new model we show that in spite of using unique session identifiers, if $n < 2t$, there cannot exist any ABG protocol that composes in parallel even twice. Further, for $n \geq 2t$, we design ABG protocols that compose for any number of parallel executions. Besides investigating the composition of ABG under a new light, our work also brings out several new insights into Canetti's Universal Composability framework. Specifically, we show that there are several undesirable effects if one deviates from our dogma. This provides further evidence as to why our dogma is the right framework to study the composition of ABG protocols.
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs
Venue: arXiv cs.DM 2012
Year: 2012

Consider a random bipartite multigraph $G$ with $n$ left nodes and $m \geq n \geq 2$ right nodes. Each left node $x$ has $d_x \geq 1$ random right neighbors. The average left degree $Δ$ is fixed, $Δ\geq 2$. We ask whether for the probability that $G$ has a left-perfect matching it is advantageous not to fix $d_x$ for each left node $x$ but rather choose it at random according to some (cleverly chosen) distribution. We show the following, provided that the degrees of the left nodes are independent: If $Δ$ is an integer then it is optimal to use a fixed degree of $Δ$ for all left nodes. If $Δ$ is non-integral then an optimal degree-distribution has the property that each left node $x$ has two possible degrees, $\floorΔ$ and $\ceilΔ$, with probability $p_x$ and $1-p_x$, respectively, where $p_x$ is from the closed interval $[0,1]$ and the average over all $p_x$ equals $\ceilΔ-Δ$. Furthermore, if $n=c\cdot m$ and $Δ>2$ is constant, then each distribution of the left degrees that meets the conditions above determines the same threshold $c^*(Δ)$ that has the following property as $n$ goes to infinity: If $c<c^*(Δ)$ then there exists a left-perfect matching with high probability. If $c>c^*(Δ)$ then there exists no left-perfect matching with high probability. The threshold $c^*(Δ)$ is the same as the known threshold for offline $k$-ary cuckoo hashing for integral or non-integral $k=Δ$.
In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
Venue: arXiv cs.MA 2012
Year: 2012

Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming compressed sensing, matrix completion, and principal components pursuit. This paper develops algorithms for distributed sparsity-regularized rank minimization over networks, when the nuclear- and $\ell_1$-norm are used as surrogates to the rank and nonzero entry counts of the sought matrices, respectively. While nuclear-norm minimization has well-documented merits when centralized processing is viable, non-separability of the singular-value sum challenges its distributed minimization. To overcome this limitation, an alternative characterization of the nuclear norm is adopted which leads to a separable, yet non-convex cost minimized via the alternating-direction method of multipliers. The novel distributed iterations entail reduced-complexity per-node tasks, and affordable message passing among single-hop neighbors. Interestingly, upon convergence the distributed (non-convex) estimator provably attains the global optimum of its centralized counterpart, regardless of initialization. Several application domains are outlined to highlight the generality and impact of the proposed framework. These include unveiling traffic anomalies in backbone networks, predicting networkwide path latencies, and mapping the RF ambiance using wireless cognitive radios. Simulations with synthetic and real network data corroborate the convergence of the novel distributed algorithm, and its centralized performance guarantees.
Statistical Function Tagging and Grammatical Relations of Myanmar Sentences
Venue: arXiv cs.CL 2012
Year: 2012

This paper describes a context free grammar (CFG) based grammatical relations for Myanmar sentences which combine corpus-based function tagging system. Part of the challenge of statistical function tagging for Myanmar sentences comes from the fact that Myanmar has free-phrase-order and a complex morphological system. Function tagging is a pre-processing step to show grammatical relations of Myanmar sentences. In the task of function tagging, which tags the function of Myanmar sentences with correct segmentation, POS (part-of-speech) tagging and chunking information, we use Naive Bayesian theory to disambiguate the possible function tags of a word. We apply context free grammar (CFG) to find out the grammatical relations of the function tags. We also create a functional annotated tagged corpus for Myanmar and propose the grammar rules for Myanmar sentences. Experiments show that our analysis achieves a good result with simple sentences and complex sentences.
An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay
Venue: arXiv cs.NA 2012
Year: 2012

We present an optimized single-precision implementation of the Sparse Approximate Matrix Multiply (\SpAMM{}) [M. Challacombe and N. Bock, arXiv {\bf 1011.3534} (2010)], a fast algorithm for matrix-matrix multiplication for matrices with decay that achieves an $\mathcal{O} (n \log n)$ computational complexity with respect to matrix dimension $n$. We find that the max norm of the error achieved with a \SpAMM{} tolerance below $2 \times 10^{-8}$ is lower than that of the single-precision {\tt SGEMM} for dense quantum chemical matrices, while outperforming {\tt SGEMM} with a cross-over already for small matrices ($n \sim 1000$). Relative to naive implementations of \SpAMM{} using Intel's Math Kernel Library ({\tt MKL}) or AMD's Core Math Library ({\tt ACML}), our optimized version is found to be significantly faster. Detailed performance comparisons are made for quantum chemical matrices with differently structured sub-blocks. Finally, we discuss the potential of improved hardware prefetch to yield 2--3x speedups.
D-iteration: Evaluation of a Dynamic Partition Strategy
Venue: arXiv cs.DC 2012
Year: 2012

The aim of this paper is to present a first evaluation of a dynamic partition strategy associated to the recently proposed asynchronous distributed computation scheme based on the D-iteration approach. The D-iteration is a fluid diffusion point of view based iteration method to solve numerically linear equations. Using a simple static partition strategy, it has been shown that, when the computation is distributed over K virtual machines (PIDs), the memory size to be handled by each virtual machine decreases linearly with K and the computation speed increases almost linearly with K with a slope becoming closer to one when the number N of linear equations to be solved increases. Here, we want to evaluate how further those results can be improved when a simple dynamic partition strategy is deployed and to show that the dynamic partition strategy allows one to control and equalize the computation load between PIDs without any deep analysis of the matrix or of the underlying graph structure.
Data Confidentiality in Mobile Ad hoc Networks
Venue: arXiv cs.CR 2012
Year: 2012

Mobile ad hoc networks (MANETs) are self-configuring infrastructure-less networks comprised of mobile nodes that communicate over wireless links without any central control on a peer-to-peer basis. These individual nodes act as routers to forward both their own data and also their neighbours' data by sending and receiving packets to and from other nodes in the network. The relatively easy configuration and the quick deployment make ad hoc networks suitable the emergency situations (such as human or natural disasters) and for military units in enemy territory. Securing data dissemination between these nodes in such networks, however, is a very challenging task. Exposing such information to anyone else other than the intended nodes could cause a privacy and confidentiality breach, particularly in military scenarios. In this paper we present a novel framework to enhance the privacy and data confidentiality in mobile ad hoc networks by attaching the originator policies to the messages as they are sent between nodes. We evaluate our framework using the Network Simulator (NS-2) to check whether the privacy and confidentiality of the originator are met. For this we implemented the Policy Enforcement Points (PEPs), as NS-2 agents that manage and enforce the policies attached to packets at every node in the MANET.
Performance Analysis for Bandwidth Allocation in IEEE 802.16 Broadband Wireless Networks using BMAP Queueing
Venue: arXiv cs.NI 2012
Year: 2012

This paper presents a performance analysis for the bandwidth allocation in IEEE 802.16 broadband wireless access (BWA) networks considering the packet-level quality-of-service (QoS) constraints. Adaptive Modulation and Coding (AMC) rate based on IEEE 802.16 standard is used to adjust the transmission rate adaptively in each frame time according to channel quality in order to obtain multiuser diversity gain. To model the arrival process and the traffic source we use the Batch Markov Arrival Process (BMAP), which enables more realistic and more accurate traffic modelling. We determine analytically different performance parameters, such as average queue length, packet dropping probability, queue throughput and average packet delay. Finally, the analytical results are validated numerically.
A Comprehensive Study and Performance Comparison of M-ary Modulation Schemes for an Efficient Wireless Mobile Communication System
Venue: arXiv cs.NI 2012
Year: 2012

Wireless communications has become one of the fastest growing areas in our modern life and creates enormous impact on nearly every feature of our daily life. In this paper, the performance of M-ary modulations schemes (MPSK, MQAM, MFSK) based wireless communication system on audio signal transmission over Additive Gaussian Noise (AWGN) channel are analyzed in terms of bit error probability as a function of SNR. Based on the results obtained in the present study, MPSK and MQAM are showing better performance for lower modulation order whereas these are inferior with higher M. The BER value is smaller in MFSK for higher M, but it is worse due to the distortion in the reproduce signal at the receiver end. The lossless reproduction of recorded voice signal can be achieved at the receiver end with a lower modulation order.
Calculation of the minimum computational complexity based on information entropy
Venue: arXiv cs.CC 2012
Year: 2012

In order to find out the limiting speed of solving a specific problem using computer, this essay provides a method based on information entropy. The relationship between the minimum computational complexity and information entropy change is illustrated. A few examples are served as evidence of such connection. Meanwhile some basic rules of modeling problems are established. Finally, the nature of solving problems with computer programs is disclosed to support this theory and a redefinition of information entropy in this filed is proposed. This will develop a new field of science.
Crowdsourcing Predictors of Behavioral Outcomes
Venue: arXiv cs.CY 2012
Year: 2012

Generating models from large data sets -- and determining which subsets of data to mine -- is becoming increasingly automated. However choosing what data to collect in the first place requires human intuition or experience, usually supplied by a domain expert. This paper describes a new approach to machine science which demonstrates for the first time that non-domain experts can collectively formulate features, and provide values for those features such that they are predictive of some behavioral outcome of interest. This was accomplished by building a web platform in which human groups interact to both respond to questions likely to help predict a behavioral outcome and pose new questions to their peers. This results in a dynamically-growing online survey, but the result of this cooperative behavior also leads to models that can predict user's outcomes based on their responses to the user-generated survey questions. Here we describe two web-based experiments that instantiate this approach: the first site led to models that can predict users' monthly electric energy consumption; the other led to models that can predict users' body mass index. As exponential increases in content are often observed in successful online collaborative communities, the proposed methodology may, in the future, lead to similar exponential rises in discovery and insight into the causal factors of behavioral outcomes.
Multi source feedback based performance appraisal system using Fuzzy logic decision support system
Venue: arXiv cs.AI 2012
Year: 2012

In Multi-Source Feedback or 360 Degree Feedback, data on the performance of an individual are collected systematically from a number of stakeholders and are used for improving performance. The 360-Degree Feedback approach provides a consistent management philosophy meeting the criterion outlined previously. The 360-degree feedback appraisal process describes a human resource methodology that is frequently used for both employee appraisal and employee development. Used in employee performance appraisals, the 360-degree feedback methodology is differentiated from traditional, top-down appraisal methods in which the supervisor responsible for the appraisal provides the majority of the data. Instead it seeks to use information gained from other sources to provide a fuller picture of employees' performances. Similarly, when this technique used in employee development it augments employees' perceptions of training needs with those of the people with whom they interact. The 360-degree feedback based appraisal is a comprehensive method where in the feedback about the employee comes from all the sources that come into contact with the employee on his/her job. The respondents for an employee can be her/his peers, managers, subordinates team members, customers, suppliers and vendors. Hence anyone who comes into contact with the employee, the 360 degree appraisal has four components that include self-appraisal, superior's appraisal, subordinate's appraisal student's appraisal and peer's appraisal .The proposed system is an attempt to implement the 360 degree feedback based appraisal system in academics especially engineering colleges.