40,310 research outputs found

    Statistical mechanics of lossy compression for non-monotonic multilayer perceptrons

    Full text link
    A lossy data compression scheme for uniformly biased Boolean messages is investigated via statistical mechanics techniques. We utilize tree-like committee machine (committee tree) and tree-like parity machine (parity tree) whose transfer functions are non-monotonic. The scheme performance at the infinite code length limit is analyzed using the replica method. Both committee and parity treelike networks are shown to saturate the Shannon bound. The AT stability of the Replica Symmetric solution is analyzed, and the tuning of the non-monotonic transfer function is also discussed.Comment: 29 pages, 7 figure

    Error correcting code using tree-like multilayer perceptron

    Full text link
    An error correcting code using a tree-like multilayer perceptron is proposed. An original message \mbi{s}^0 is encoded into a codeword \boldmath{y}_0 using a tree-like committee machine (committee tree) or a tree-like parity machine (parity tree). Based on these architectures, several schemes featuring monotonic or non-monotonic units are introduced. The codeword \mbi{y}_0 is then transmitted via a Binary Asymmetric Channel (BAC) where it is corrupted by noise. The analytical performance of these schemes is investigated using the replica method of statistical mechanics. Under some specific conditions, some of the proposed schemes are shown to saturate the Shannon bound at the infinite codeword length limit. The influence of the monotonicity of the units on the performance is also discussed.Comment: 23 pages, 3 figures, Content has been extended and revise

    Boom and Bust Carbon-Nitrogen Dynamics during Reforestation

    Get PDF
    Legacies of historical land use strongly shape contemporary ecosystem dynamics. In old-field secondary forests, tree growth embodies a legacy of soil changes affected by previous cultivation. Three patterns of biomass accumulation during reforestation have been hypothesized previously, including monotonic to steady state, non-monotonic with a single peak then decay to steady state, and multiple oscillations around the steady state. In this paper, the conditions leading to the emergence of these patterns is analyzed. Using observations and models, we demonstrate that divergent reforestation patterns can be explained by contrasting time-scales in ecosystem carbon-nitrogen cycles that are influenced by land use legacies. Model analyses characterize non-monotonic plant-soil trajectories as either single peaks or multiple oscillations during an initial transient phase controlled by soil carbon-nitrogen conditions at the time of planting. Oscillations in plant and soil pools appear in modeled systems with rapid tree growth and low initial soil nitrogen, which stimulate nitrogen competition between trees and decomposers and lead the forest into a state of acute nitrogen deficiency. High initial soil nitrogen dampens oscillations, but enhances the magnitude of the tree biomass peak. These model results are supported by data derived from the long-running Calhoun Long-Term Soil-Ecosystem Experiment from 1957 to 2007. Observed carbon and nitrogen pools reveal distinct tree growth and decay phases, coincident with soil nitrogen depletion and partial re-accumulation. Further, contemporary tree biomass loss decreases with the legacy soil C:N ratio. These results support the idea that non-monotonic reforestation trajectories may result from initial transients in the plant-soil system affected by initial conditions derived from soil changes associated with land-use history

    Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

    Get PDF
    In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.operational research;cost allocation;game theory

    Efficient algorithms for a class of partitioning problems

    Get PDF
    The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques

    Statistical mechanics of lossy compression using multilayer perceptrons

    Full text link
    Statistical mechanics is applied to lossy compression using multilayer perceptrons for unbiased Boolean messages. We utilize a tree-like committee machine (committee tree) and tree-like parity machine (parity tree) whose transfer functions are monotonic. For compression using committee tree, a lower bound of achievable distortion becomes small as the number of hidden units K increases. However, it cannot reach the Shannon bound even where K -> infty. For a compression using a parity tree with K >= 2 hidden units, the rate distortion function, which is known as the theoretical limit for compression, is derived where the code length becomes infinity.Comment: 12 pages, 5 figure

    SAT Modulo Monotonic Theories

    Full text link
    We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories arise from many common problems, e.g., graph properties such as reachability, shortest paths, connected components, minimum spanning tree, and max-flow/min-cut, and then demonstrate our framework by building SMT solvers for each of these theories. We apply these solvers to procedural content generation problems, demonstrating major speed-ups over state-of-the-art approaches based on SAT or Answer Set Programming, and easily solving several instances that were previously impractical to solve

    A New Quartet Tree Heuristic for Hierarchical Clustering

    Get PDF
    We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the case that the optimal tree embeds all quartets as non-optimal topologies). We present a heuristic for reconstructing the optimal-weight tree, and a canonical manner to derive the quartet-topology weights from a given distance matrix. The method repeatedly transforms a bifurcating tree, with all objects involved as leaves, achieving a monotonic approximation to the exact single globally optimal tree. This contrasts to other heuristic search methods from biological phylogeny, like DNAML or quartet puzzling, which, repeatedly, incrementally construct a solution from a random order of objects, and subsequently add agreement values.Comment: 22 pages, 14 figure
    • …
    corecore