4,782 research outputs found

    Games for Cybersecurity Decision-making

    Get PDF

    When is a Network a Network? Multi-Order Graphical Model Selection in Pathways and Temporal Networks

    Full text link
    We introduce a framework for the modeling of sequential data capturing pathways of varying lengths observed in a network. Such data are important, e.g., when studying click streams in information networks, travel patterns in transportation systems, information cascades in social networks, biological pathways or time-stamped social interactions. While it is common to apply graph analytics and network analysis to such data, recent works have shown that temporal correlations can invalidate the results of such methods. This raises a fundamental question: when is a network abstraction of sequential data justified? Addressing this open question, we propose a framework which combines Markov chains of multiple, higher orders into a multi-layer graphical model that captures temporal correlations in pathways at multiple length scales simultaneously. We develop a model selection technique to infer the optimal number of layers of such a model and show that it outperforms previously used Markov order detection techniques. An application to eight real-world data sets on pathways and temporal networks shows that it allows to infer graphical models which capture both topological and temporal characteristics of such data. Our work highlights fallacies of network abstractions and provides a principled answer to the open question when they are justified. Generalizing network representations to multi-order graphical models, it opens perspectives for new data mining and knowledge discovery algorithms.Comment: 10 pages, 4 figures, 1 table, companion python package pathpy available on gitHu

    Preparation of a Resorbable Osteoinductive Tricalcium Phosphate Ceramic

    Get PDF
    Over the past decade we have demonstrated numerous times that calcium phosphates can be rendered with osteoinductive properties by introducing specific surface microstructures1. Since most of these calcium phosphates contained hydroxyapatite, they are either slowly or not resorbable2. Resorbability is an often sought after characteristic of calcium phosphates so that they can be gradually replaced by newly formed bone. The objective of this study was to prepare a resorbable surface microstructured tricalcium phosphate (TCP) ceramic and evaluate its osteoinductive property and resorption rate after intramuscular implantation in dogs. This material was then compared to the established and slowly resorbable osteoinductive biphasic calcium phosphate ceramic (BCP)

    Міжнародний пакт «Про економічні, соціальні і культурні права»

    Get PDF
    Paper voor ORD 2014 In deze reviewstudie wordt de positie van het voorbereidend middelbaar beroepsonderwijs (vmbo) geanalyseerd als deel van het onderwijsbestel zowel in relatie tot de eerste fase voortgezet onderwijs als in relatie tot de beroepsonderwijskolom. De dualiteit van het vmbo wordt beschouwd ten aanzien van ontwikkelingen in maatschappelijke doelen, keuze- en selectieprocessen, inrichtingskenmerken en deelnamepatronen. Er wordt een historisch perspectief gehanteerd, niet zozeer voor een descriptief overzicht maar om inzicht te krijgen in de ontwikkelingen. Aanvullend vindt een internationale vergelijking plaats met enkele onderwijsstelsels die dezelfde of juist andere kenmerken hebben. Is de meervoudige positie van het vmbo al dan niet herkenbaar in andere stelsels, welke horizontale en verticale verbindingen zijn elders aanwezig, hoe zijn deelnameontwikkelingen vervolgens te begrijpen

    Entropy of complex relevant components of Boolean networks

    Full text link
    Boolean network models of strongly connected modules are capable of capturing the high regulatory complexity of many biological gene regulatory circuits. We study numerically the previously introduced basin entropy, a parameter for the dynamical uncertainty or information storage capacity of a network as well as the average transient time in random relevant components as a function of their connectivity. We also demonstrate that basin entropy can be estimated from time-series data and is therefore also applicable to non-deterministic networks models.Comment: 8 pages, 6 figure

    The Ammann-Beenker tilings revisited

    Full text link
    This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as the solution of a simple optimization problem.Comment: 7 pages, 4 figure

    Rigidity percolation on aperiodic lattices

    Full text link
    We studied the rigidity percolation (RP) model for aperiodic (quasi-crystal) lattices. The RP thresholds (for bond dilution) were obtained for several aperiodic lattices via computer simulation using the "pebble game" algorithm. It was found that the (two rhombi) Penrose lattice is always floppy in view of the RP model. The same was found for the Ammann's octagonal tiling and the Socolar's dodecagonal tiling. In order to impose the percolation transition we used so c. "ferro" modification of these aperiodic tilings. We studied as well the "pinwheel" tiling which has "infinitely-fold" orientational symmetry. The obtained estimates for the modified Penrose, Ammann and Socolar lattices are respectively: pcP=0.836±0.002p_{cP} =0.836\pm 0.002, pcA=0.769±0.002p_{cA} = 0.769\pm0.002, pcS=0.938±0.001p_{cS} = 0.938\pm0.001. The bond RP threshold of the pinwheel tiling was estimated to pc=0.69±0.01p_c = 0.69\pm0.01. It was found that these results are very close to the Maxwell (the mean-field like) approximation for them.Comment: 9 LaTeX pages, 3 PostScript figures included via epsf.st
    corecore