OpenRaiser/Intern-Atlas huggingface dataset:
Sensor Networks: from Dependence Analysis Via Matroid Bases to Online Synthesis
Venue: arXiv cs.IT 2012
Year: 2012

Consider the two related problems of sensor selection and sensor fusion. In the first, given a set of sensors, one wishes to identify a subset of the sensors, which while small in size, captures the essence of the data gathered by the sensors. In the second, one wishes to construct a fused sensor, which utilizes the data from the sensors (possibly after discarding dependent ones) in order to create a single sensor which is more reliable than each of the individual ones. In this work, we rigorously define the dependence among sensors in terms of joint empirical measures and incremental parsing. We show that these measures adhere to a polymatroid structure, which in turn facilitates the application of efficient algorithms for sensor selection. We suggest both a random and a greedy algorithm for sensor selection. Given an independent set, we then turn to the fusion problem, and suggest a novel variant of the exponential weighting algorithm. In the suggested algorithm, one competes against an augmented set of sensors, which allows it to converge to the best fused sensor in a family of sensors, without having any prior data on the sensors' performance.
Analysis of Cell Load Coupling for LTE Network Planning and Optimization
Venue: arXiv cs.IT 2012
Year: 2012

System-centric modeling and analysis are of key significance in planning and optimizing cellular networks. In this paper, we provide a mathematical analysis of performance modeling for LTE networks. The system model characterizes the coupling relation between the cell load factors, taking into account non-uniform traffic demand and interference between the cells with arbitrary network topology. Solving the model enables a network-wide performance evaluation in resource consumption. We develop and prove both sufficient and necessary conditions for the feasibility of the load-coupling system, and provide results related to computational aspects for numerically approaching the solution. The theoretical findings are accompanied with experimental results to instructively illustrate the application in optimizing LTE network configuration.
Identifying Coordination Problems in Software Development: Finding Mismatches between Software and Project Team Structures
Venue: arXiv cs.SE 2012
Year: 2012

Today's dynamic and iterative development environment brings significant challenges for software project management. In distributed project settings, "management by walking around" is no longer an option and project managers may miss out on key project insights. The TESNA (TEchnical Social Network Analysis) method and tool aims to provide project managers both a method and a tool for gaining insights and taking corrective action. TESNA achieves this by analysing a project's evolving social and technical network structures using data from multiple sources, including CVS, email and chat repositories. Using pattern theory, TESNA helps to identify areas where the current state of the project's social and technical networks conflicts with what patterns suggest. We refer to such a conflict as a Socio-Technical Structure Clash (STSC). In this paper we report on our experience of using TESNA to identify STSCs in a corporate environment through the mining of software repositories. We find multiple instances of three STSCs (Conway's Law, Code Ownership and Project Coordination) in many of the on-going development projects, thereby validating the method and tool that we have developed.
Collaborative Personalized Web Recommender System using Entropy based Similarity Measure
Venue: arXiv cs.IR 2012
Year: 2012

On the internet, web surfers, in the search of information, always strive for recommendations. The solutions for generating recommendations become more difficult because of exponential increase in information domain day by day. In this paper, we have calculated entropy based similarity between users to achieve solution for scalability problem. Using this concept, we have implemented an online user based collaborative web recommender system. In this model based collaborative system, the user session is divided into two levels. Entropy is calculated at both the levels. It is shown that from the set of valuable recommenders obtained at level I; only those recommenders having lower entropy at level II than entropy at level I, served as trustworthy recommenders. Finally, top N recommendations are generated from such trustworthy recommenders for an online user.
Exact Safety Verification of Hybrid Systems Based on Bilinear SOS Representation
Venue: arXiv cs.SE 2012
Year: 2012

In this paper, we address the problem of safety verification of nonlinear hybrid systems. A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems efficiently. Some numerical invariants of a hybrid system can be obtained by solving a bilinear SOS programming via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants with rational coefficients, which {\it exactly} satisfy the conditions of invariants. Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Improving Security Levels of IEEE 802.16e Authentication By Diffie-Hellman Method
Venue: arXiv cs.CR 2012
Year: 2012

In this paper, we proposed an authentication method according to Diffie-Hellman. First, we introduce different methods for authentication in IEEE.802.16 then we proposed an authentication method according to Diffie-Hellman and in the last we compare different methods for authentication to improve security in IEEE802.16e. CPN is a useful for simulation and compare protocol together so we use CPN tools in this paper.
Uncertainty Bounds for Spectral Estimation
Venue: arXiv cs.SY 2012
Year: 2012

The purpose of this paper is to study metrics suitable for assessing uncertainty of power spectra when these are based on finite second-order statistics. The family of power spectra which is consistent with a given range of values for the estimated statistics represents the uncertainty set about the "true" power spectrum. Our aim is to quantify the size of this uncertainty set using suitable notions of distance, and in particular, to compute the diameter of the set since this represents an upper bound on the distance between any choice of a nominal element in the set and the "true" power spectrum. Since the uncertainty set may contain power spectra with lines and discontinuities, it is natural to quantify distances in the weak topology---the topology defined by continuity of moments. We provide examples of such weakly-continuous metrics and focus on particular metrics for which we can explicitly quantify spectral uncertainty. We then consider certain high resolution techniques which utilize filter-banks for pre-processing, and compute worst-case a priori uncertainty bounds solely on the basis of the filter dynamics. This allows the a priori tuning of the filter-banks for improved resolution over selected frequency bands.
A remark on Petersen coloring conjecture of Jaeger
Venue: arXiv cs.DM 2012
Year: 2012

If $G$ and $H$ are two cubic graphs, then we write $H\prec G$, if $G$ admits a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. Let $P$ and $S$ be the Petersen graph and the Sylvester graph, respectively. In this paper, we introduce the Sylvester coloring conjecture. Moreover, we show that if $G$ is a connected bridgeless cubic graph with $G\prec P$, then $G=P$. Finally, if $G$ is a connected cubic graph with $G\prec S$, then $G=S$.
Mathematical and computational modeling for describing the basic behavior of free radicals and antioxidants within epithelial cells
Venue: arXiv cs.CE 2012
Year: 2012

The traditional methods of the biology, based on illustrative descriptions and linear logic explanations, are discussed. This work aims to improve this approach by introducing alternative tools to describe and represent complex biological systems. Two models were developed, one mathematical and another computational, both were made in order to study the biological process between free radicals and antioxidants. Each model was used to study the same process but in different scenarios. The mathematical model was used to study the biological process in an epithelial cells culture; this model was validated with the experimental data of Anne Hanneken's research group from the Department of Molecular and Experimental Medicine, published by the journal Investigative Ophthalmology and Visual Science in July 2006. The computational model was used to study the same process in an individual. The model was made using C++ programming language, supported by the network theory of aging.
Livelock free routing schemes
Venue: arXiv cs.NI 2012
Year: 2012

We give a livelock free routing algorithm for any allowed network. Unlike some other solutions to this problem: 1) packets entering the network have an absolute upper bound on the time to reach their destination; 2) under light loads, packets are delivered to their destinations in nearly optimal time; 3) packets with desired paths far away from congested areas will have routing times far shorter than packets wanting to access congested areas; 4) if the network becomes congested and later clears, the network operates just as it would have when it was initially under a light load. The main ideas of this note appear in a different form in my 1994 patent 5,369,745. This note adds to those results and makes them more mathematical.
Collaborative knowledge networks emergence for innovation: Factors of success analysis and comparison
Venue: arXiv cs.CY 2012
Year: 2012

New product development needs new engineering approaches. Knowledge is a key resource that impacts traditional, organisational, economic and innovative models. Through NICT (New Information and Communication Technologies), globalisation encourages the emergence of networks that overcome traditional organisation boundaries. International enterprises, European-Community Networks of Excellence or Clusters (competitiveness poles) indicate the need to define a new way of thinking. This new way moves towards an agile, continuous innovative use of knowledge. Based on an epistemic study of knowledge management best practices, four examples show the barriers that can be encountered today. This paper aims defining the key elements that enhance collaborative networks. The analysis of best practices from collaborative environments enables the design of high standard information systems and initiate knowledge ecosystems. A balance between formalism required to share knowledge and fuzziness of social networks triggers new initiatives. This ensures the validity of information exchange through virtual collaboration. It helps to maintain group coherence despite exceeding the natural maximum number of collaborators. Finally the main success or failure factors are highlights and commented to ease the transition from economic-driven to expertise-driven models is then facilitated.
Reengineering multi tiered enterprise business applications for performance enhancement and reciprocal or rectangular hyperbolic relation of variation of data transportation time with row pre-fetch size of relational database drivers
Venue: arXiv cs.PF 2012
Year: 2012

Reengineering multi tiered enterprise business applications for performance enhancement and reciprocal or rectangular hyperbolic relation of variation of data transportation time with row pre-fetch size of relational database drivers
Invertible Program Restructurings for Continuing Modular Maintenance
Venue: arXiv cs.SE 2012
Year: 2012

When one chooses a main axis of structural decompostion for a software, such as function- or data-oriented decompositions, the other axes become secondary, which can be harmful when one of these secondary axes becomes of main importance. This is called the tyranny of the dominant decomposition. In the context of modular extension, this problem is known as the Expression Problem and has found many solutions, but few solutions have been proposed in a larger context of modular maintenance. We solve the tyranny of the dominant decomposition in maintenance with invertible program transformations. We illustrate this on the typical Expression Problem example. We also report our experiments with Java and Haskell programs and discuss the open problems with our approach.
Rainbow Induced Subgraphs in Replication Graphs
Venue: arXiv cs.DM 2012
Year: 2012

A graph $G$ is called a replication graph of a graph $H$ if $G$ is obtained from $H$ by replacing vertices of $H$ by arbitrary cliques of vertices and then replacing each edge in $H$ by all the edges between corresponding cligues. For a given graph $H$ the $ρ_R(H)$ is the minimal number of vertices of a replication graph $G$ of $H$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$ having exactly one vertex in each replication clique of $G$. We prove some bounds for $ρ_R$ for some classes of graphs and compute some exact values. Also some experimental results obtained by a computer search are presented and conjectures based on them are formulated.
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings
Venue: arXiv cs.SC 2012
Year: 2012

We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic. For an $\nxn$ matrix $A$ over the ring $\Fzfe$, where $f^e$ is a power of an irreducible polynomial $f \in \Fz$ of degree $d$, our algorithm requires $\bigO(ηde^2n)$ operations in $\F$, where our black-box is assumed to require $\bigO(η)$ operations in $\F$ to compute a matrix-vector product by a vector over $\Fzfe$ (and $η$ is assumed greater than $\Pden$). The algorithm only requires additional storage for $\bigO(\Pden)$ elements of $\F$. In particular, if $η=\softO(\Pden)$, then our algorithm requires only $\softO(n^2d^2e^3)$ operations in $\F$, which is an improvement on known dense methods for small $d$ and $e$. For the ring $\ZZ/p^e\ZZ$, where $p$ is a prime, we give an algorithm which is time- and memory-efficient when the number of nontrivial invariant factors is small. We describe a method for dimension reduction while preserving the invariant factors. The time complexity is essentially linear in $μn r e \log p,$ where $μ$ is the number of operations in $\ZZ/p\ZZ$ to evaluate the black-box (assumed greater than $n$) and $r$ is the total number of non-zero invariant factors. To avoid the practical cost of conditioning, we give a Monte Carlo certificate, which at low cost, provides either a high probability of success or a proof of failure. The quest for a time- and memory-efficient solution without restrictions on the number of nontrivial invariant factors remains open. We offer a conjecture which may contribute toward that end.
BIN@ERN: Binary-Ternary Compressing Data Coding
Venue: arXiv cs.IT 2012
Year: 2012

This paper describes a new method of data encoding which may be used in various modern digital, computer and telecommunication systems and devices. The method permits the compression of data for storage or transmission, allowing the exact original data to be reconstructed without any loss of content. The method is characterized by the simplicity of implementation, as well as high speed and compression ratio. The method is based on a unique scheme of binary-ternary prefix-free encoding of characters of the original data. This scheme does not require the transmission of the code tables from encoder to decoder; allows for the linear presentation of the code lists; permits the usage of computable indexes of the prefix codes in a linear list for decoding; makes it possible to estimate the compression ratio prior to encoding; makes the usage of multiplication and division operations, as well as operations with the floating point unnecessary; proves to be effective for static as well as adaptive coding; applicable to character sets of any size; allows for repeated compression to improve the ratio.
Combinatorial Channel Signature Modulation for Wireless ad-hoc Networks
Venue: arXiv cs.IT 2012
Year: 2012

In this paper we introduce a novel modulation and multiplexing method which facilitates highly efficient and simultaneous communication between multiple terminals in wireless ad-hoc networks. We term this method Combinatorial Channel Signature Modulation (CCSM). The CCSM method is particularly efficient in situations where communicating nodes operate in highly time dispersive environments. This is all achieved with a minimal MAC layer overhead, since all users are allowed to transmit and receive at the same time/frequency (full simultaneous duplex). The CCSM method has its roots in sparse modelling and the receiver is based on compressive sampling techniques. Towards this end, we develop a new low complexity algorithm termed Group Subspace Pursuit. Our analysis suggests that CCSM at least doubles the throughput when compared to the state-of-the art.
Deconcentration of Attention: Addressing the Complexity of Software Engineering
Venue: arXiv cs.SE 2012
Year: 2012

This article attempts to describe specific mental techniques that are related to resolving very complex tasks in software engineering. This subject may be familiar to some software specialists to different extents; however, there is currently no common consensus and popular terminology for this subject area. In this article, the area is charted from a practical usability perspective. This article also proposes to treat software engineering itself as research on human thinking because software is meant to simulate thinking.
A General Solver Based on Sparse Resultants
Venue: arXiv cs.SC 2012
Year: 2012

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its degree is a function of the mixed volumes of the Newton polytopes. We sketch the sparse resultant constructions of Canny and Emiris and show how they reduce the problem of root-finding to an eigenproblem. A novel method for achieving this reduction is presented which does not increase the dimension of the problem. Together with an implementation of the sparse resultant construction, it provides a general solver for polynomial systems. We discuss the overall implementation and illustrate its use by applying it to concrete problems from vision, robotics and structural biology. The high efficiency and accuracy of the solutions suggest that sparse elimination may be the method of choice for systems of moderate size.
Descriptive complexity for pictures languages (extended abstract)
Venue: arXiv cs.LO 2012
Year: 2012

This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. - We uniformly generalize to any dimension the characterization by Giammarresi et al. \cite{GRST96} of the class of \emph{recognizable} picture languages in existential monadic second-order logic. - We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata of any dimension. They are the first machine-independent characterizations of complexity classes of cellular automata. Our characterizations are essentially deduced from normalization results we prove for first-order and existential second-order logics over pictures. They are obtained in a general and uniform framework that allows to extend them to other "regular" structures. Finally, we describe some hierarchy results that show the optimality of our logical characterizations and delineate their limits.
Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids
Venue: arXiv cs.CC 2012
Year: 2012

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex bodies and the shortest and closest lattice vector problems under general norms.
Tools for parsimonious edge-colouring of graphs with maximum degree three
Venue: arXiv cs.DM 2012
Year: 2012

The notion of a $δ$-minimum edge-colouring was introduced by J-L. Fouquet (in his french PhD Thesis \cite{FouPhD}). Here we present some structural properties of $δ$-minimum edge-colourings, partially taken from the above thesis. The paper serves as an auxiliary tool for another paper submitted by the authors to Graphs and Combinatorics.
Turing Impossibility Properties for Stack Machine Programming
Venue: arXiv cs.LO 2012
Year: 2012

The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing impossibility properties concerning different method interfaces for stack machine programming.
Outbound SPIT Filter with Optimal Performance Guarantees
Venue: arXiv cs.NI 2012
Year: 2012

This paper presents a formal framework for identifying and filtering SPIT calls (SPam in Internet Telephony) in an outbound scenario with provable optimal performance. In so doing, our work is largely different from related previous work: our goal is to rigorously formalize the problem in terms of mathematical decision theory, find the optimal solution to the problem, and derive concrete bounds for its expected loss (number of mistakes the SPIT filter will make in the worst case). This goal is achieved by considering an abstracted scenario amenable to theoretical analysis, namely SPIT detection in an outbound scenario with pure sources. Our methodology is to first define the cost of making an error (false positive and false negative), apply Wald's sequential probability ratio test to the individual sources, and then determine analytically error probabilities such that the resulting expected loss is minimized. The benefits of our approach are: (1) the method is optimal (in a sense defined in the paper); (2) the method does not rely on manual tuning and tweaking of parameters but is completely self-contained and mathematically justified; (3) the method is computationally simple and scalable. These are desirable features that would make our method a component of choice in larger, autonomic frameworks.
Quantized Network Coding for Sparse Messages
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we study the data gathering problem in the context of power grids by using a network of sensors, where the sensed data have inter-node redundancy. Specifically, we propose a new transmission method, calledquantized network coding, which performs linear net-work coding in the field of real numbers, and quantization to accommodate the finite capacity of edges. By using the concepts in compressed sensing literature, we propose to use l1-minimization to decode the quantized network coded packets, especially when the number of received packets at the decoder is less than the size of sensed data (i.e. number of nodes). We also propose an appropriate design for network coding coefficients, based on restricted isometry property, which results in robust l1-min decoding. Our numerical analysis show that the proposed quantized network coding scheme with l1-min decoding can achieve significant improvements, in terms of compression ratio and delivery delay, compared to conventional packet forwarding.