318 research outputs found

    A way to synchronize models with seismic faults for earthquake forecasting: Insights from a simple stochastic model

    Full text link
    Numerical models are starting to be used for determining the future behaviour of seismic faults and fault networks. Their final goal would be to forecast future large earthquakes. In order to use them for this task, it is necessary to synchronize each model with the current status of the actual fault or fault network it simulates (just as, for example, meteorologists synchronize their models with the atmosphere by incorporating current atmospheric data in them). However, lithospheric dynamics is largely unobservable: important parameters cannot (or can rarely) be measured in Nature. Earthquakes, though, provide indirect but measurable clues of the stress and strain status in the lithosphere, which should be helpful for the synchronization of the models. The rupture area is one of the measurable parameters of earthquakes. Here we explore how it can be used to at least synchronize fault models between themselves and forecast synthetic earthquakes. Our purpose here is to forecast synthetic earthquakes in a simple but stochastic (random) fault model. By imposing the rupture area of the synthetic earthquakes of this model on other models, the latter become partially synchronized with the first one. We use these partially synchronized models to successfully forecast most of the largest earthquakes generated by the first model. This forecasting strategy outperforms others that only take into account the earthquake series. Our results suggest that probably a good way to synchronize more detailed models with real faults is to force them to reproduce the sequence of previous earthquake ruptures on the faults. This hypothesis could be tested in the future with more detailed models and actual seismic data.Comment: Revised version. Recommended for publication in Tectonophysic

    Applying causality principles to the axiomatization of probabilistic cellular automata

    Full text link
    Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global evolution G is required to be shift-invariant (it acts the same everywhere) and causal (information cannot be transmitted faster than some fixed number of cells per time step). At least in the classical, reversible and quantum cases, these two top-down axiomatic conditions are sufficient to entail more bottom-up, operational descriptions of G. We investigate whether the same is true in the probabilistic case. Keywords: Characterization, noise, Markov process, stochastic Einstein locality, screening-off, common cause principle, non-signalling, Multi-party non-local box.Comment: 13 pages, 6 figures, LaTeX, v2: refs adde

    MOSE': A grid-enabled software platform to solve geoprocessing problems

    Get PDF
    Grid computing has emerged as an important new field in the distributed computing arena. It focus on intensive resource sharing, innovative applications, and in some cases, high-performance orientation. This paper describes how grids technologies can be used to develop an infrastructure for developing geoprocessing applications. We present the MOS`E system, a grid-enabled problem solving environment (PSE) able to support the activities that concern the modelling and simulation of spatio-temporal phenomena for analyzing and managing the identification and the mitigation of natural disasters like floods, wildfires, landslides, etc. MOSE' takes advantages of the standardized resource access and workflow support for loosely coupled software components provided by the web/grid services technologies

    Neural avalanches at the edge-of-chaos?

    Full text link
    Does the brain operate at criticality, to optimize neural computation? Literature uses different fingerprints of criticality in neural networks, leaving the relationship between them mostly unclear. Here, we compare two specific signatures of criticality, and ask whether they refer to observables at the same critical point, or to two differing phase transitions. Using a recurrent spiking neural network, we demonstrate that avalanche criticality does not necessarily lie at edge-of-chaos

    Spatial Heterogeneities in a Simple Earthquake Fault Model

    Get PDF
    Natural earthquake fault systems are composed of a variety of materials with different spatial configurations a complicated, inhomogeneous fault surface. The associated inhomogeneities with their physical properties can result in a variety of spatial and temporal behaviors. As a result, understanding the dynamics of seismic activity in an inhomogeneous environment is fundamental to the investigation of the earthquakes processes. This study presents the results from an inhomogeneous earthquake fault model based on the Olami-Feder-Christensen (OFC) and Rundle-Jackson-Brown (RJB) cellular automata models with long-range interactions that incorporates a fixed percentage of stronger sites, or ‘asperity cells’, into the lattice. These asperity cells are significantly stronger than the surrounding lattice sites but eventually rupture when the applied stress reaches their higher threshold stress. The introduction of these spatial heterogeneities results in temporal clustering in the model that mimics that seen in natural fault systems. Sequences of activity that start with a gradually accelerating number of larger events (foreshocks) prior to a mainshock that is followed by a tail of decreasing activity (aftershocks) are observed for the first time in simple models of this type. These recurrent large events occur at regular intervals, similar to characteristic earthquakes frequently observed in historic seismicity, and the time between events and their magnitude are a function of the stress dissipation parameter. The relative length of the foreshock to aftershock sequences can vary and also depends on the amount of stress dissipation in the system. The magnitude-frequency distribution of events for various amounts of inhomogeneities (asperity sites) in the lattice is investigated in order to provide a better understanding of Gutenberg-Richter (GR) scaling. The spatiotemporal clustering of events in systems with different spatial distribution of asperities and the Thirumalai and Mountain (TM) metric behaviour, an indicator of changes in activity before the main event in the sequence, also are investigated. Accelerating Moment Release (AMR) is observed before the mainshock. The Omori law behaviour for foreshocks and aftershocks is quantified for the model in this study. Finally, a fixed percentage of randomly distributed asperity sites were aggregated into bigger asperity blocks in order to investigate the effect of changing the spatial configuration of stronger sites. The results show that the larger block of asperities generally increases the capability of the fault system to generate larger events, but the total percentage of asperities is important as well. The increasing number of larger events is also associated with an increase in the total number of asperities in the lattice. This work provides further evidence that the spatial and temporal patterns observed in natural seismicity may be controlled by the underlying physical properties and are not solely the result of a simple cascade mechanism and, as a result, may not be inherently unpredictable

    Proceedings of JAC 2010. Journées Automates Cellulaires

    Get PDF
    The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

    Methoden und Beschreibungssprachen zur Modellierung und Verifikation vonSchaltungen und Systemen: MBMV 2015 - Tagungsband, Chemnitz, 03. - 04. März 2015

    Get PDF
    Der Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV 2015) findet nun schon zum 18. mal statt. Ausrichter sind in diesem Jahr die Professur Schaltkreis- und Systementwurf der Technischen Universität Chemnitz und das Steinbeis-Forschungszentrum Systementwurf und Test. Der Workshop hat es sich zum Ziel gesetzt, neueste Trends, Ergebnisse und aktuelle Probleme auf dem Gebiet der Methoden zur Modellierung und Verifikation sowie der Beschreibungssprachen digitaler, analoger und Mixed-Signal-Schaltungen zu diskutieren. Er soll somit ein Forum zum Ideenaustausch sein. Weiterhin bietet der Workshop eine Plattform für den Austausch zwischen Forschung und Industrie sowie zur Pflege bestehender und zur Knüpfung neuer Kontakte. Jungen Wissenschaftlern erlaubt er, ihre Ideen und Ansätze einem breiten Publikum aus Wissenschaft und Wirtschaft zu präsentieren und im Rahmen der Veranstaltung auch fundiert zu diskutieren. Sein langjähriges Bestehen hat ihn zu einer festen Größe in vielen Veranstaltungskalendern gemacht. Traditionell sind auch die Treffen der ITGFachgruppen an den Workshop angegliedert. In diesem Jahr nutzen zwei im Rahmen der InnoProfile-Transfer-Initiative durch das Bundesministerium für Bildung und Forschung geförderte Projekte den Workshop, um in zwei eigenen Tracks ihre Forschungsergebnisse einem breiten Publikum zu präsentieren. Vertreter der Projekte Generische Plattform für Systemzuverlässigkeit und Verifikation (GPZV) und GINKO - Generische Infrastruktur zur nahtlosen energetischen Kopplung von Elektrofahrzeugen stellen Teile ihrer gegenwärtigen Arbeiten vor. Dies bereichert denWorkshop durch zusätzliche Themenschwerpunkte und bietet eine wertvolle Ergänzung zu den Beiträgen der Autoren. [... aus dem Vorwort
    corecore