2,287 research outputs found

    Partially ordered models

    Full text link
    We provide a formal definition and study the basic properties of partially ordered chains (POC). These systems were proposed to model textures in image processing and to represent independence relations between random variables in statistics (in the later case they are known as Bayesian networks). Our chains are a generalization of probabilistic cellular automata (PCA) and their theory has features intermediate between that of discrete-time processes and the theory of statistical mechanical lattice fields. Its proper definition is based on the notion of partially ordered specification (POS), in close analogy to the theory of Gibbs measure. This paper contains two types of results. First, we present the basic elements of the general theory of POCs: basic geometrical issues, definition in terms of conditional probability kernels, extremal decomposition, extremality and triviality, reconstruction starting from single-site kernels, relations between POM and Gibbs fields. Second, we prove three uniqueness criteria that correspond to the criteria known as bounded uniformity, Dobrushin and disagreement percolation in the theory of Gibbs measures.Comment: 54 pages, 11 figures, 6 simulations. Submited to Journal of Stat. Phy

    A measure of conductivity for lattice fermions at finite density

    Get PDF
    We study the linear response to an external electric field of a system of fermions in a lattice at zero temperature. This allows to measure numerically the Euclidean conductivity which turns out to be compatible with an analytical calculation for free fermions. The numerical method is generalizable to systems with dynamical interactions where no analytical approach is possible.Comment: version to be published in Physics Letters

    La desamortización mexicana de 1847.

    Get PDF

    El Estatuto personal y su problemática

    Get PDF

    Hume: crítica de la religión natura

    Get PDF

    A note on the computation of the Frobenius number of a numerical semigroup

    Full text link
    In this note we observe that the Frobenius number and therefore the conductor of a numerical semigroup can be obtained from the maximal socle degree of the quotient of the corresponding semigroup algebra by the ideal generated by the biggest generator of the semigroup.Comment: Some typos in the introduction have been correcte

    Trees, homology, and automorphism groups of right-angled Artin groups

    Get PDF
    We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this subgroup, based on the number and degree of a certain type of vertices, which we call deep. We then use combinatorial methods to analyze the average value of this Betti number, in terms of the size of the defining tree

    Live demonstration: Neuro-inspired system for realtime vision tilt correction

    Get PDF
    Correcting digital images tilt needs huge quantities of memory, high computational resources, and use to take a considerable amount of time. This demonstration shows how a spikes-based silicon retina dynamic vision sensor (DVS) tilt can corrected in real time using a commercial accelerometer. DVS output is a stream of spikes codified using the address-event representation (AER). Event-based processing is focused on change in real time DVS output addresses. Taking into account this DVS feature, we present an AER based layer able to correct in real time the DVS tilt, using a high speed algorithmic mapping layer and introducing a minimum latency in the system. A co-design platform (the AER-Robot platform), based into a Xilinx Spartan 3 FPGA and an 8051 USB microcontroller, has been used to implement the system
    corecore