OpenRaiser/Intern-Atlas huggingface dataset:
Under-approximating Cut Sets for Reachability in Large Scale Automata Networks
Venue: arXiv cs.SY 2013
Year: 2013

In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous work and generalised here to finite automata networks. The extracted sets of local states form an under-approximation of the complete minimal cut sets of the dynamics: there may exist smaller or additional cut sets for the given reachability. Applied to qualitative models of biological systems, such cut sets provide potential therapeutic targets that are proven to prevent molecules of interest to become active, up to the correctness of the model. Our new method makes tractable the formal analysis of very large scale networks, as illustrated by the computation of cut sets within a Boolean model of biological pathways interactions gathering more than 9000 components.
Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality
Venue: arXiv cs.IT 2013
Year: 2013

An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate distortion functions for each source and correlation measures which derive from a "strong" data processing inequality. Unlike many standard outer bounds, the proposed bound is not parameterized by a continuous family of auxiliary random variables, but instead only requires maximizing two ratios of divergences which do not depend on the distortion functions under consideration.
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
Venue: arXiv cs.CC 2013
Year: 2013

We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility problem admits no polynomial kernelization when parameterized by both the number of variables and the number of constraints, unless NP \subseteq coNP/poly. This extends to the restricted cases of bounded variable degree and bounded number of variables per constraint, and to covering and packing ILPs. Second, we give a polynomial kernelization for the Cover ILP problem, asking for a solution to Ax >= b with c^Tx <= k, parameterized by k, when A is row-sparse; this generalizes a known polynomial kernelization for the special case with 0/1-variables and coefficients (d-Hitting Set).
Plan Development using Local Probabilistic Models
Venue: arXiv cs.AI 2013
Year: 2013

Approximate models of world state transitions are necessary when building plans for complex systems operating in dynamic environments. External event probabilities can depend on state feature values as well as time spent in that particular state. We assign temporally -dependent probability functions to state transitions. These functions are used to locally compute state probabilities, which are then used to select highly probable goal paths and eliminate improbable states. This probabilistic model has been implemented in the Cooperative Intelligent Real-time Control Architecture (CIRCA), which combines an AI planner with a separate real-time system such that plans are developed, scheduled, and executed with real-time guarantees. We present flight simulation tests that demonstrate how our probabilistic model may improve CIRCA performance.
Coping with the Limitations of Rational Inference in the Framework of Possibility Theory
Venue: arXiv cs.AI 2013
Year: 2013

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does not provide expected results either because it cannot produce them, or even provide counter-intuitive conclusions. This state of facts is not due to the principle of selecting a unique ordering of interpretations (which can be encoded by one possibility distribution), but rather to the absence of constraints expressing pieces of knowledge we have implicitly in mind. It is advocated in this paper that constraints induced by independence information can help finding the right ordering of interpretations. In particular, independence constraints can be systematically assumed with respect to formulas composed of literals which do not appear in the conditional knowledge base, or for default rules with respect to situations which are "normal" according to the other default rules in the base. The notion of independence which is used can be easily expressed in the qualitative setting of possibility theory. Moreover, when a counter-intuitive plausible conclusion of a set of defaults, is in its rational closure, but not in its preferential closure, it is always possible to repair the set of defaults so as to produce the desired conclusion.
Independence with Lower and Upper Probabilities
Venue: arXiv cs.AI 2013
Year: 2013

It is shown that the ability of the interval probability representation to capture epistemological independence is severely limited. Two events are epistemologically independent if knowledge of the first event does not alter belief (i.e., probability bounds) about the second. However, independence in this form can only exist in a 2-monotone probability function in degenerate cases i.e., if the prior bounds are either point probabilities or entirely vacuous. Additional limitations are characterized for other classes of lower probabilities as well. It is argued that these phenomena are simply a matter of interpretation. They appear to be limitations when one interprets probability bounds as a measure of epistemological indeterminacy (i.e., uncertainty arising from a lack of knowledge), but are exactly as one would expect when probability intervals are interpreted as representations of ontological indeterminacy (indeterminacy introduced by structural approximations). The ontological interpretation is introduced and discussed.
Topological Parameters for Time-Space Tradeoff
Venue: arXiv cs.AI 2013
Year: 2013

In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space specification.
Flexible Policy Construction by Information Refinement
Venue: arXiv cs.AI 2013
Year: 2013

We report on work towards flexible algorithms for solving decision problems represented as influence diagrams. An algorithm is given to construct a tree structure for each decision node in an influence diagram. Each tree represents a decision function and is constructed incrementally. The improvements to the tree converge to the optimal decision function (neglecting computational costs) and the asymptotic behaviour is only a constant factor worse than dynamic programming techniques, counting the number of Bayesian network queries. Empirical results show how expected utility increases with the size of the tree and the number of Bayesian net calculations.
A Probabilistic Model For Sensor Validation
Venue: arXiv cs.AI 2013
Year: 2013

The validation of data from sensors has become an important issue in the operation and control of modern industrial plants. One approach is to use knowledge based techniques to detect inconsistencies in measured data. This article presents a probabilistic model for the detection of such inconsistencies. Based on probability propagation, this method is able to find the existence of a possible fault among the set of sensors. That is, if an error exists, many sensors present an apparent fault due to the propagation from the sensor(s) with a real fault. So the fault detection mechanism can only tell if a sensor has a potential fault, but it can not tell if the fault is real or apparent. So the central problem is to develop a theory, and then an algorithm, for distinguishing real and apparent faults, given that one or more sensors can fail at the same time. This article then, presents an approach based on two levels: (i) probabilistic reasoning, to detect a potential fault, and (ii) constraint management, to distinguish the real fault from the apparent ones. The proposed approach is exemplified by applying it to a power plant model.
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
Venue: arXiv cs.AI 2013
Year: 2013

We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the bounds by numerical experiments.
A Graph-Theoretic Analysis of Information Value
Venue: arXiv cs.AI 2013
Year: 2013

We derive qualitative relationships about the informational relevance of variables in graphical decision models based on a consideration of the topology of the models. Specifically, we identify dominance relations for the expected value of information on chance variables in terms of their position and relationships in influence diagrams. The qualitative relationships can be harnessed to generate nonnumerical procedures for ordering uncertain variables in a decision model by their informational relevance.
Testing Implication of Probabilistic Dependencies
Venue: arXiv cs.AI 2013
Year: 2013

Axiomatization has been widely used for testing logical implications. This paper suggests a non-axiomatic method, the chase, to test if a new dependency follows from a given set of probabilistic dependencies. Although the chase computation may require exponential time in some cases, this technique is a powerful tool for establishing nontrivial theoretical results. More importantly, this approach provides valuable insight into the intriguing connection between relational databases and probabilistic reasoning systems.
Optimal Factory Scheduling using Stochastic Dominance A*
Venue: arXiv cs.AI 2013
Year: 2013

We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA* (Stochastic Dominance A*) algorithm remedies this difficulty by relaxing the pruning condition. We present an improved state-space search formulation for these problems and discuss the conditions under which stochastic scheduling problems can be solved optimally using SDA*. In empirical testing on randomly generated problems, we found that in 70%, the expected cost of the optimal stochastic solution is lower than that of the solution derived using a deterministic approximation, with comparable search effort.
On a numerical algorithm for computing topological characteristics of three-dimensional bodies
Venue: arXiv cs.CG 2013
Year: 2013

We present an algorithm for computing the main topological characteristics of three-dimensional bodies. The algorithm is based on a discretization of Morse theory and uses discrete analogs of smooth functions with only nondegenerate (Morse) and the simplest degenerate critical points.
Energy-aware checkpointing of divisible tasks with soft or hard deadlines
Venue: arXiv cs.DS 2013
Year: 2013

In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through checkpointing. We discuss several variants of this multi-criteria problem. Given the workload, we need to decide how many chunks to use, what are the sizes of these chunks, and at which speed each chunk is executed. Furthermore, since a failure may occur during the execution of a chunk, we also need to decide at which speed a chunk should be re-executed in the event of a failure. The goal is to minimize the expectation of the total energy consumption, while enforcing a deadline on the execution time, that should be met either in expectation (soft deadline), or in the worst case (hard deadline). For each problem instance, we propose either an exact solution, or a function that can be optimized numerically. The different models are then compared through an extensive set of experiments.
Variable density preserving topology grids and the digital models for the plane
Venue: arXiv cs.DM 2013
Year: 2013

We define LCL decompositions of the plane and investigate the advantages of using such decompositions in the context of digital topology. We show that discretization schemes based on such decompositions associate, to each LCL tiling of the plane, the digital model preserving the local topological structure of the object. We prove that for any LCL tiling of the plane, the digital model is necessarily a digital 2-manifold. We show that elements of an LCL tiling can be of an arbitrary shape and size. This feature generates a variable density grid with a required resolution in any region of interest, which is extremely important in medicine. Finally, we describe a simple algorithm, which allows transforming regions of interest produced by the image acquisition process into digital spaces with topological features of the regions.
Breathfinding: A Wireless Network that Monitors and Locates Breathing in a Home
Venue: arXiv cs.HC 2013
Year: 2013

This paper explores using RSS measurements on many links in a wireless network to estimate the breathing rate of a person, and the location where the breathing is occurring, in a home, while the person is sitting, laying down, standing, or sleeping. The main challenge in breathing rate estimation is that "motion interference", i.e., movements other than a person's breathing, generally cause larger changes in RSS than inhalation and exhalation. We develop a method to estimate breathing rate despite motion interference, and demonstrate its performance during multiple short (3-7 minute) tests and during a longer 66 minute test. Further, for the same experiments, we show the location of the breathing person can be estimated, to within about 2 m average error in a 56 square meter apartment. Being able to locate a breathing person who is not otherwise moving, without calibration, is important for applications in search and rescue, health care, and security.
ScalienDB: Designing and Implementing a Distributed Database using Paxos
Venue: arXiv cs.DB 2013
Year: 2013

ScalienDB is a scalable, replicated database built on top of the Paxos algorithm. It was developed from 2010 to 2012, when the startup backing it failed. This paper discusses the design decisions of the distributed database, describes interesting parts of the C++ codebase and enumerates lessons learned putting ScalienDB into production at a handful of clients. The source code is available on Github under the AGPL license, but it is no longer developed or maintained.
GEMINI: A Generic Multi-Modal Natural Interface Framework for Videogames
Venue: arXiv cs.HC 2013
Year: 2013

In recent years videogame companies have recognized the role of player engagement as a major factor in user experience and enjoyment. This encouraged a greater investment in new types of game controllers such as the WiiMote, Rock Band instruments and the Kinect. However, the native software of these controllers was not originally designed to be used in other game applications. This work addresses this issue by building a middleware framework, which maps body poses or voice commands to actions in any game. This not only warrants a more natural and customized user-experience but it also defines an interoperable virtual controller. In this version of the framework, body poses and voice commands are respectively recognized through the Kinect's built-in cameras and microphones. The acquired data is then translated into the native interaction scheme in real time using a lightweight method based on spatial restrictions. The system is also prepared to use Nintendo's Wiimote as an auxiliary and unobtrusive gamepad for physically or verbally impractical commands. System validation was performed by analyzing the performance of certain tasks and examining user reports. Both confirmed this approach as a practical and alluring alternative to the game's native interaction scheme. In sum, this framework provides a game-controlling tool that is totally customizable and very flexible, thus expanding the market of game consumers.
Support detection in super-resolution
Venue: arXiv cs.IT 2013
Year: 2013

We study the problem of super-resolving a superposition of point sources from noisy low-pass data with a cut-off frequency f. Solving a tractable convex program is shown to locate the elements of the support with high precision as long as they are separated by 2/f and the noise level is small with respect to the amplitude of the signal.
Understanding Boltzmann Machine and Deep Learning via A Confident Information First Principle
Venue: arXiv cs.NE 2013
Year: 2013

Typical dimensionality reduction methods focus on directly reducing the number of random variables while retaining maximal variations in the data. In this paper, we consider the dimensionality reduction in parameter spaces of binary multivariate distributions. We propose a general Confident-Information-First (CIF) principle to maximally preserve parameters with confident estimates and rule out unreliable or noisy parameters. Formally, the confidence of a parameter can be assessed by its Fisher information, which establishes a connection with the inverse variance of any unbiased estimate for the parameter via the Cramér-Rao bound. We then revisit Boltzmann machines (BM) and theoretically show that both single-layer BM without hidden units (SBM) and restricted BM (RBM) can be solidly derived using the CIF principle. This can not only help us uncover and formalize the essential parts of the target density that SBM and RBM capture, but also suggest that the deep neural network consisting of several layers of RBM can be seen as the layer-wise application of CIF. Guided by the theoretical analysis, we develop a sample-specific CIF-based contrastive divergence (CD-CIF) algorithm for SBM and a CIF-based iterative projection procedure (IP) for RBM. Both CD-CIF and IP are studied in a series of density estimation experiments.
Approximating the optimal competitive ratio for an ancient online scheduling problem
Venue: arXiv cs.DS 2013
Year: 2013

We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorithm whose competitive ratio is at most (1+ε) times that of an optimal online algorithm could be achieved in polynomial time, where m, the number of machines, is a part of the input. It substantially improves upon the previous results by almost closing the gap between the currently best known lower bound of 1.88 (Rudin, Ph.D thesis, 2001) and the best known upper bound of 1.92 (Fleischer, Wahl, Journal of Scheduling, 2000). It has been known by folklore that an online problem could be viewed as a game between an adversary and the online player. Our approach extensively explores such a structure and builds up a completely new framework to show that, for the online over list scheduling problem, given any ε>0, there exists a uniform threshold K which is polynomial in m such that if the competitive ratio of an online algorithm is ρ<=2, then there exists a list of at most K jobs to enforce the online algorithm to achieve a competitive ratio of at least ρ-O(ε). Our approach is substantially different from that of Gunther et al. (Gunther et al., SODA 2013), in which an approximation scheme for online over time scheduling problems is given, where the number of machines is fixed. Our method could also be extended to several related online over list scheduling models.
Modeling and Performance Analysis of Pull-Based Live Streaming Schemes in Peer-to-Peer Network
Venue: arXiv cs.NI 2013
Year: 2013

Recent years mesh-based Peer-to-Peer live streaming has become a promising way for service providers to offer high-quality live video streaming service to Internet users. In this paper, we make a detailed study on modeling and performance analysis of the pull-based P2P streaming systems. We establish the analytical framework for the pull-based streaming schemes in P2P network, give accurate models of the chunk selection and peer selection strategies, and organize them into three categories, i.e., the chunk first scheme, the peer first scheme and the epidemic scheme. Through numerical performance evaluation, the impacts of some important parameters, such as size of neighbor set, reply number, buffer size and so on are investigated. For the peer first and chunk first scheme, we show that the pull-based schemes do not perform as well as the push-based schemes when peers are limited to reply only one request in each time slot. When the reply number increases, the pull-based streaming schemes will reach close to optimal playout probability. As to the pull-based epidemic scheme, we find it has unexpected poor performance, which is significantly different from the push-based epidemic scheme. Therefore we propose a simple, efficient and easily deployed push-pull scheme which can significantly improve the playout probability.
Design and Implementation of an IP based authentication mechanism for Open Source Proxy Servers in Interception Mode
Venue: arXiv cs.NI 2013
Year: 2013

Proxy servers are being increasingly deployed at organizations for performance benefits; however, there still exists drawbacks in ease of client authentication in interception proxy mode mainly for Open Source Proxy Servers. Technically, an interception mode is not designed for client authentication, but implementation in certain organizations does require this feature. In this paper, we focus on the World Wide Web, highlight the existing transparent proxy authentication mechanisms, its drawbacks and propose an authentication scheme for transparent proxy users by using external scripts based on the clients Internet Protocol Address. This authentication mechanism has been implemented and verified on Squid-one of the most widely used HTTP Open Source Proxy Server.