83,407 research outputs found

    The United Nations and the Human Rights Issue

    Get PDF
    This paper demonstrates a new class of bugs that is likely to occur in enterprise OpenFlow deployments. In particular, step-by-step, reactive establishment of paths can cause network-wide inconsistencies or performance- and space-related inefficiencies. The cause for this behavior is inconsistent packet processing: as the packets travel through the network they do not encounter consistent state at the OpenFlow controller. To mitigate this problem, we propose to use transactional semantics at the controller to achieve consistent packet processing. We detail the challenges in achieving this goal (including the inability to directly apply database techniques), as well as a potentially promising approach. In particular, we envision the use of multi-commit transactions that could provide the necessary serialization and isolation properties without excessively reducing network performance.QC 20140707</p

    Understanding Artificial Anasazi

    Get PDF
    A replication and analysis of the Artificial Anasazi model is presented. It is shown that the success of replicating historical data is based on two parameters that adjust the carrying capacity of the Long House Valley. Compared to population estimates equal to the carrying capacity the specific agent behavior contributes only a modest improvement of the model to fit the archaeological records.Replication, Model Analysis, Model-Based Archaeology, Population Dynamics, Social-Ecological Systems

    On the Prior and Posterior Distributions Used in Graphical Modelling

    Full text link
    Graphical model learning and inference are often performed using Bayesian techniques. In particular, learning is usually performed in two separate steps. First, the graph structure is learned from the data; then the parameters of the model are estimated conditional on that graph structure. While the probability distributions involved in this second step have been studied in depth, the ones used in the first step have not been explored in as much detail. In this paper, we will study the prior and posterior distributions defined over the space of the graph structures for the purpose of learning the structure of a graphical model. In particular, we will provide a characterisation of the behaviour of those distributions as a function of the possible edges of the graph. We will then use the properties resulting from this characterisation to define measures of structural variability for both Bayesian and Markov networks, and we will point out some of their possible applications.Comment: 28 pages, 6 figure

    Two-pion Bose-Einstein correlations in central Pb-Pb collisions at sNN\sqrt{s_{\rm NN}} = 2.76 TeV

    Get PDF
    The first measurement of two-pion Bose-Einstein correlations in central Pb-Pb collisions at sNN=2.76\sqrt{s_{\rm NN}} = 2.76 TeV at the Large Hadron Collider is presented. We observe a growing trend with energy now not only for the longitudinal and the outward but also for the sideward pion source radius. The pion homogeneity volume and the decoupling time are significantly larger than those measured at RHIC.Comment: 17 pages, 5 captioned figures, 1 table, authors from page 12, published version, figures at http://aliceinfo.cern.ch/ArtSubmission/node/388

    LMEC Syllabus Bigelli 2012-2013

    Get PDF

    Stochastic homogenization of subdifferential inclusions via scale integration

    Get PDF
    We study the stochastic homogenization of the system -div \sigma^\epsilon = f^\epsilon \sigma^\epsilon \in \partial \phi^\epsilon (\nabla u^\epsilon), where (\phi^\epsilon) is a sequence of convex stationary random fields, with p-growth. We prove that sequences of solutions (\sigma^\epsilon,u^\epsilon) converge to the solutions of a deterministic system having the same subdifferential structure. The proof relies on Birkhoff's ergodic theorem, on the maximal monotonicity of the subdifferential of a convex function, and on a new idea of scale integration, recently introduced by A. Visintin.Comment: 23 page

    Different distance measures for fuzzy linear regression with Monte Carlo methods

    Get PDF
    The aim of this study was to determine the best distance measure for estimating the fuzzy linear regression model parameters with Monte Carlo (MC) methods. It is pointed out that only one distance measure is used for fuzzy linear regression with MC methods within the literature. Therefore, three different definitions of distance measure between two fuzzy numbers are introduced. Estimation accuracies of existing and proposed distance measures are explored with the simulation study. Distance measures are compared to each other in terms of estimation accuracy; hence this study demonstrates that the best distance measures to estimate fuzzy linear regression model parameters with MC methods are the distance measures defined by Kaufmann and Gupta (Introduction to fuzzy arithmetic theory and applications. Van Nostrand Reinhold, New York, 1991), Heilpern-2 (Fuzzy Sets Syst 91(2):259–268, 1997) and Chen and Hsieh (Aust J Intell Inf Process Syst 6(4):217–229, 2000). One the other hand, the worst distance measure is the distance measure used by Abdalla and Buckley (Soft Comput 11:991–996, 2007; Soft Comput 12:463–468, 2008). These results would be useful to enrich the studies that have already focused on fuzzy linear regression models
    • …
    corecore