OpenRaiser/Intern-Atlas huggingface dataset:
Towards Greener and Safer Mines
Venue: arXiv cs.OH 2010
Year: 2010

Miniaturised sensors and networking are technical proven concepts. Both the technologies are proven and various components e.g., sensors, controls, etc. are commercially available. Technology scene in above areas presents enormous possibilities for developing innovative applications for real life situations. Mining operations in many countries have lot of scope for improving environmental and safety measures. Efforts have been made to develop a system to efficiently monitor a particular environment by deploying a wireless sensor network using commercially available components. Wireless Sensor Network has been integrated with telecom network through a gateway using a suitable topology which can be selected at the application layer. The developed system demonstrates a way to connect wireless sensor network to external network which enables the distant administrator to access real time data and act expediently from long-distance to improve the environmental situation or prevent a disaster. Potentially, it can be used to avoid the awful situations leading to terrible environment in underground mines. Keywords: Wireless sensor network, Mine safety, Environment monitoring and telecom.
Biopsym : a learning environment for transrectal ultrasound guided prostate biopsies
Venue: arXiv cs.OH 2010
Year: 2010

This paper describes a learning environment for image-guided prostate biopsies in cancer diagnosis; it is based on an ultrasound probe simulator virtually exploring real datasets obtained from patients. The aim is to make the training of young physicians easier and faster with a tool that combines lectures, biopsy simulations and recommended exercises to master this medical gesture. It will particularly help acquiring the three-dimensional representation of the prostate needed for practicing biopsy sequences. The simulator uses a haptic feedback to compute the position of the virtual probe from three-dimensional (3D) ultrasound recorded data. This paper presents the current version of this learning environment.
Component Based Development
Venue: arXiv cs.SE 2010
Year: 2010

Component Based Approach has been introduced in core engineering discipline long back but the introduction to component based concept in software perspective is recently developed by Object Management Group. Its benefits from the re-usability point of view is enormous. The intertwining relationship of domain engineering with component based software engineering is analyzed. The object oriented approach and its basic difference with component approach is of great concern. The present study highlights the life-cycle, cost effectiveness and the basic study of component based software from application perspective.
A framework for proving the self-organization of dynamic systems
Venue: arXiv cs.DC 2010
Year: 2010

This paper aims at providing a rigorous definition of self- organization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, cooperative robotics, or ad-hoc networks). We characterize different classes of self-organization through liveness and safety properties that both capture information re- garding the system entropy. We illustrate these classes through study cases. The first ones are two representative P2P overlays (CAN and Pas- try) and the others are specific implementations of Ω(the leader oracle) and one-shot query abstractions for dynamic settings. Our study aims at understanding the limits and respective power of existing self-organized protocols and lays the basis of designing robust algorithm for dynamic systems.
Individual Privacy vs Population Privacy: Learning to Attack Anonymization
Venue: arXiv cs.DB 2010
Year: 2010

Over the last decade there have been great strides made in developing techniques to compute functions privately. In particular, Differential Privacy gives strong promises about conclusions that can be drawn about an individual. In contrast, various syntactic methods for providing privacy (criteria such as kanonymity and l-diversity) have been criticized for still allowing private information of an individual to be inferred. In this report, we consider the ability of an attacker to use data meeting privacy definitions to build an accurate classifier. We demonstrate that even under Differential Privacy, such classifiers can be used to accurately infer "private" attributes in realistic data. We compare this to similar approaches for inferencebased attacks on other forms of anonymized data. We place these attacks on the same scale, and observe that the accuracy of inference of private attributes for Differentially Private data and l-diverse data can be quite similar.
On the Problem of Local Randomness in Privacy Amplification with an Active Adversary
Venue: arXiv cs.CC 2010
Year: 2010

We study the problem of privacy amplification with an active adversary in the information theoretic setting. In this setting, two parties Alice and Bob start out with a shared $n$-bit weak random string $W$, and try to agree on a secret random key $R$ over a public channel fully controlled by an active and unbounded adversary. Typical assumptions are that these two parties have access to local private uniform random bits. In this paper we seek to minimize the requirements on the local randomness used by the two parties. We make two improvements over previous results. First, we reduce the number of random bits needed for each party to $Θ(\ell+\log n)$, where $\ell$ is the security parameter, as long as $W$ has min-entropy $n^{Ω(1)}$. Previously, the best known result needs to use $Θ((\ell+\log n)\log n)$ bits. Our result is also asymptotically optimal. Second, we generalize the problem to the case where the two parties only have local weak random sources instead of truly uniform random bits. We show that when each party has a local weak random source with min-entropy $> n/2$, there is an efficient privacy amplification protocol that works nearly as good as if the two parties have access to local uniform random bits. Next, in the case where each party only has a weak random source with arbitrarily linear min-entropy, we give an efficient privacy amplification protocol where we can achieve security parameter up to $Ω(\log k)$. Our results give the first protocols that achieve privacy amplification when each party only has access to a local weak random source.
Reductions Between Expansion Problems
Venue: arXiv cs.CC 2010
Year: 2010

The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the Unique Games Conjecture (Khot, STOC 2002). In particular, the Small-Set Expansion Hypothesis implies the Unique Games Conjecture (Raghavendra, Steurer, STOC 2010). Our main result is that the Small-Set Expansion Hypothesis is in fact equivalent to a variant of the Unique Games Conjecture. More precisely, the hypothesis is equivalent to the Unique Games Conjecture restricted to instance with a fairly mild condition on the expansion of small sets. Alongside, we obtain the first strong hardness of approximation results for the Balanced Separator and Minimum Linear Arrangement problems. Before, no such hardness was known for these problems even assuming the Unique Games Conjecture. These results not only establish the Small-Set Expansion Hypothesis as a natural unifying hypothesis that implies the Unique Games Conjecture, all its consequences and, in addition, hardness results for other problems like Balanced Separator and Minimum Linear Arrangement, but our results also show that the Small-Set Expansion Hypothesis problem lies at the combinatorial heart of the Unique Games Conjecture. The key technical ingredient is a new way of exploiting the structure of the Unique Games instances obtained from the Small-Set Expansion Hypothesis via (Raghavendra, Steurer, 2010). This additional structure allows us to modify standard reductions in a way that essentially destroys their local-gadget nature. Using this modification, we can argue about the expansion in the graphs produced by the reduction without relying on expansion properties of the underlying Unique Games instance (which would be impossible for a local-gadget reduction).
Distributed Detection over Gaussian Multiple Access Channels with Constant Modulus Signaling
Venue: arXiv cs.IT 2010
Year: 2010

A distributed detection scheme where the sensors transmit with constant modulus signals over a Gaussian multiple access channel is considered. The deflection coefficient of the proposed scheme is shown to depend on the characteristic function of the sensing noise and the error exponent for the system is derived using large deviation theory. Optimization of the deflection coefficient and error exponent are considered with respect to a transmission phase parameter for a variety of sensing noise distributions including impulsive ones. The proposed scheme is also favorably compared with existing amplify-and-forward and detect-and-forward schemes. The effect of fading is shown to be detrimental to the detection performance through a reduction in the deflection coefficient depending on the fading statistics. Simulations corroborate that the deflection coefficient and error exponent can be effectively used to optimize the error probability for a wide variety of sensing noise distributions.
Leakage-Aware Reallocation for Periodic Real-Time Tasks on Multicore Processors
Venue: arXiv cs.DC 2010
Year: 2010

It is an increasingly important issue to reduce the energy consumption of computing systems. In this paper, we consider partition based energy-aware scheduling of periodic real-time tasks on multicore processors. The scheduling exploits dynamic voltage scaling (DVS) and core sleep scheduling to reduce both dynamic and leakage energy consumption. If the overhead of core state switching is non-negligible, however, the performance of this scheduling strategy in terms of energy efficiency might degrade. To achieve further energy saving, we extend the static task scheduling with run-time task reallocation. The basic idea is to aggregate idle time among cores so that as many cores as possible could be put into sleep in a way that the overall energy consumption is reduced. Simulation results show that the proposed approach results in up to 20% energy saving over traditional leakage-aware DVS.
New Methods of Analysis of Narrative and Semantics in Support of Interactivity
Venue: arXiv cs.AI 2010
Year: 2010

Our work has focused on support for film or television scriptwriting. Since this involves potentially varied story-lines, we note the implicit or latent support for interactivity. Furthermore the film, television, games, publishing and other sectors are converging, so that cross-over and re-use of one form of product in another of these sectors is ever more common. Technically our work has been largely based on mathematical algorithms for data clustering and display. Operationally, we also discuss how our algorithms can support collective, distributed problem-solving.
Integration of Flexible Web Based GUI in I-SOAS
Venue: arXiv cs.HC 2010
Year: 2010

It is necessary to improve the concepts of the present web based graphical user interface for the development of more flexible and intelligent interface to provide ease and increase the level of comfort at user end like most of the desktop based applications. This research is conducted targeting the goal of implementing flexible GUI consisting of a visual component manager with different components by functionality, design and purpose. In this research paper we present a Rich Internet Application (RIA) based graphical user interface for web based product development, and going into the details we present a comparison between existing RIA Technologies, adopted methodology in the GUI development and developed prototype.
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
Venue: arXiv cs.IT 2010
Year: 2010

To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all content blocks, but over much smaller, possibly overlapping subsets of these blocks, known as generations. A penalty of this strategy is throughput reduction. To analyze the throughput loss, we model coding over generations with random generation scheduling as a coupon collector's brotherhood problem. This model enables us to derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure (the latter only when generations do not overlap) and further, to quantify the tradeoff between computational complexity and throughput. Interestingly, with a moderate increase in the generation size, throughput quickly approaches link capacity. Overlaps between generations can further improve throughput substantially for relatively small generation sizes.
On the Inverse Of General Cyclic Heptadiagonal and Anti-Heptadiagonal Matrices
Venue: arXiv cs.SC 2010
Year: 2010

In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work presented in [A. A. KARAWIA, A New Algorithm for Inverting General Cyclic Heptadiagonal Matrices Recursively, arXiv:1011.2306v1 [cs.SC]]. The symbolic algorithms are suited for implementation using Computer Algebra Systems (CAS) such as MATLAB, MAPLE and MATHEMATICA. An illustrative example is given.
Detecting and Tracking the Spread of Astroturf Memes in Microblog Streams
Venue: arXiv cs.SI 2010
Year: 2010

Online social media are complementing and in some cases replacing person-to-person social interaction and redefining the diffusion of information. In particular, microblogs have become crucial grounds on which public relations, marketing, and political battles are fought. We introduce an extensible framework that will enable the real-time analysis of meme diffusion in social media by mining, visualizing, mapping, classifying, and modeling massive streams of public microblogging events. We describe a Web service that leverages this framework to track political memes in Twitter and help detect astroturfing, smear campaigns, and other misinformation in the context of U.S. political elections. We present some cases of abusive behaviors uncovered by our service. Finally, we discuss promising preliminary results on the detection of suspicious memes via supervised learning based on features extracted from the topology of the diffusion networks, sentiment analysis, and crowdsourced annotations.
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
Venue: arXiv cs.DS 2010
Year: 2010

Given a metric space on n points, an α-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of the induced subtree is within an α factor of the optimal Steiner tree cost for X. An α-approximate differentially private algorithm for the Steiner tree problem takes as input a subset X of vertices, and outputs a tree distribution that induces a solution within an α factor of the optimal as before, and satisfies the additional property that for any set X' that differs in a single vertex from X, the tree distributions for X and X' are "close" to each other. Universal and differentially private algorithms for TSP are defined similarly. An α-approximate universal algorithm for the Steiner tree problem or TSP is also an α-approximate differentially private algorithm. It is known that both problems admit O(logn)-approximate universal algorithms, and hence O(log n)-approximate differentially private algorithms as well. We prove an Ω(logn) lower bound on the approximation ratio achievable for the universal Steiner tree problem and the universal TSP, matching the known upper bounds. Our lower bound for the Steiner tree problem holds even when the algorithm is allowed to output a more general solution of a distribution on paths to the root.
Dynamics in parallel of double Boolean automata circuits
Venue: arXiv cs.DM 2010
Year: 2010

In this paper, we give some results concerning the dynamics of double Boolean automata circuits (dbac's for short), namely, networks associated to interaction graphs composed of two side-circuits that share a node. More precisely, we give formulas for the number of attractors of any period, as well as the total number of attractors of these networks.
A Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness
Venue: arXiv cs.LO 2010
Year: 2010

We identify a subtle error in LTL formulas reduction method used as one optimization step in an LTL to Büchi automata translation. The error led to some incorrect answers of the established model checker DiVinE. This paper should help authors of other model checkers to avoid this error.
Uniform Memory and Serialization for Lambda Calculus
Venue: arXiv cs.LO 2010
Year: 2010

This paper introduces a special type of systems, defines their properties, and then demonstrates that a reduction machine for pure untyped extensional lambda calculus can be implemented as a system of the introduced type. Specifically, we discuss uniform memory as a special kind of graphs and real time operation of state machines that use the uniform memory as their state. Also, we consider a special case of serialization, the latter being useful for the mechanism that compares results during computation, not after the computation is done. However, we start with detailed explanation of our motivation for this work.
Combinatorial Geometry of Graph Partitioning - I
Venue: arXiv cs.DS 2010
Year: 2010

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new directions of progress in the {\sc $c$-Balanced Separator} problem. More specifically, we propose a family of mathematical programs, that depend upon a parameter $p > 0$, and is an extension of the uniform version of the SDPs proposed by Goemans and Linial for this problem. In fact for the case, when $p=1$, if one can solve this program in polynomial time then simply using the Goemans-Williamson's randomized rounding algorithm for {\sc Max Cut} \cite{WG95} will give an $O(1)$-factor approximation algorithm for {\sc $c$-Balanced Separator} improving the best known approximation factor of $O(\sqrt{\log n})$ due to Arora, Rao and Vazirani \cite{ARV}. This family of programs is not convex but one can transform them into so called \emph{\textbf{concave programs}} in which one optimizes a concave function over a convex feasible set. It is well known that the optima of such programs lie at one of the extreme points of the feasible set \cite{TTT85}. Our main contribution is a combinatorial characterization of some extreme points of the feasible set of the mathematical program, for $p=1$ case, which to the best of our knowledge is the first of its kind. We further demonstrate how this characterization can be used to solve the program in a restricted setting. Non-convex programs have recently been investigated by Bhaskara and Vijayaraghvan \cite{BV11} in which they design algorithms for approximating Matrix $p$-norms although their algorithmic techniques are analytical in nature.
Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$
Venue: arXiv cs.FL 2010
Year: 2010

Brlek et al. (2008) studied smooth infinite words and established some results on letter frequency, recurrence, reversal and complementation for 2-letter alphabets having same parity. In this paper, we explore smooth infinite words over $n$-letter alphabet $\{a_1,a_2,...,a_n\}$, where $a_1<a_2<...<a_n$ are positive integers and have same remainder when divided by $n$. And let $a_i=n\cdot q_i+r,\;q_i\in N$ for $i=1,2,...,n$, where $r=0,1,2,...,n-1$. We use distinct methods to prove that (1) if $r=0$, the letters frequency of two times differentiable well-proportioned infinite words is $1/n$, which suggests that the letter frequency of the generalized Kolakoski sequences is $1/2$ for 2-letter even alphabets; (2) the smooth infinite words are recurrent; (3) if $r=0$ or $r>0 \text{ and }n$ is an even number, the generalized Kolakoski words are uniformly recurrent for the alphabet $Σ_n$ with the cyclic order; (4) the factor set of three times differentiable infinite words is not closed under any nonidentical permutation. Brlek et al.'s results are only the special cases of our corresponding results.
New Algorithms on Wavelet Trees and Applications to Information Retrieval
Venue: arXiv cs.DS 2010
Year: 2010

Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the virtues of this versatile data structure. In particular we show how to use wavelet trees to solve fundamental algorithmic problems such as {\em range quantile} queries, {\em range next value} queries, and {\em range intersection} queries. We explore several applications of these queries in Information Retrieval, in particular {\em document retrieval} in hierarchical and temporal documents, and in the representation of {\em inverted lists}.
Cascading Link Failure in the Power Grid: A Percolation-Based Analysis
Venue: arXiv cs.NI 2010
Year: 2010

Large-scale power blackouts caused by cascading failure are inflicting enormous socioeconomic costs. We study the problem of cascading link failures in power networks modelled by random geometric graphs from a percolation-based viewpoint. To reflect the fact that links fail according to the amount of power flow going through them, we introduce a model where links fail according to a probability which depends on the number of neighboring links. We devise a mapping which maps links in a random geometric graph to nodes in a corresponding dual covering graph. This mapping enables us to obtain the first-known analytical conditions on the existence and non-existence of a large component of operational links after degree-dependent link failures. Next, we present a simple but descriptive model for cascading link failure, and use the degree-dependent link failure results to obtain the first-known analytical conditions on the existence and non-existence of cascading link failures.
Bounds from a Card Trick
Venue: arXiv cs.IT 2010
Year: 2010

We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources.
Closed-Form Solutions to A Category of Nuclear Norm Minimization Problems
Venue: arXiv cs.IT 2010
Year: 2010

It is an efficient and effective strategy to utilize the nuclear norm approximation to learn low-rank matrices, which arise frequently in machine learning and computer vision. So the exploration of nuclear norm minimization problems is gaining much attention recently. In this paper we shall prove that the following Low-Rank Representation (LRR) \cite{icml_2010_lrr,lrr_extention} problem: {eqnarray*} \min_{Z} \norm{Z}_*, & {s.t.,} & X=AZ, {eqnarray*} has a unique and closed-form solution, where $X$ and $A$ are given matrices. The proof is based on proving a lemma that allows us to get closed-form solutions to a category of nuclear norm minimization problems.