Filters








499 Hits in 6.1 sec

Extension of some MAP results to transient MAPs and Markovian binary trees

Sophie Hautphenne, Miklós Telek
2013 Performance evaluation (Print)  
Telek: Extension of some MAP results -p. 24/27 Questions MAPs Transient MAP Markovian Binary Tree q Basic results q Basic results q Basic results q Similarity transformation q Number of  ...  What are the answers to these questions for Transient MAPs (TMAPs) and Markovian Binary Trees (MBTs)? Basic results The inter-arrival time is PHase type distributed.  ... 
doi:10.1016/j.peva.2013.05.003 fatcat:wgjxubke2bh2voi6h4lio4djci

Tree Echo State Networks

Claudio Gallicchio, Alessio Micheli
2013 Neurocomputing  
The critical role of the relation between the choice of the state mapping function and the Markovian characterization of the task is analyzed and experimentally investigated on both artificial and real-world  ...  Second, we study two types of state mapping functions to map the tree structured state of TreeESN into a fixed-size feature representation for classification or regression tasks.  ...  Acknowledgements The authors would like to thank Alessandro Sperduti and Markus Hagenbuchner for providing the INEX2006 dataset.  ... 
doi:10.1016/j.neucom.2012.08.017 fatcat:nkhr5wleqrfjzckaeh3lo76ct4

Markovian Bias of Neural-based Architectures With Feedback Connections [chapter]

Peter Tiňo, Barbara Hammer, Mikael Bodén
2007 Studies in Computational Intelligence  
Finally, potential applications of the Markovian architectural predisposition of dynamic neural networks in bioinformatics are presented.  ...  In particular, in the context of such architectural predispositions, we study computational and learning capabilities of typical dynamic neural network architectures.  ...  In other words, after some initial transients, state trajectory of the system (2) "samples" the invariant set K (chaos game algorithm).  ... 
doi:10.1007/978-3-540-73954-8_5 fatcat:qs5x4mpg3fhsffxaltqd4gxnki

Exact Analysis of TTL Cache Networks: The Case of Caching Policies driven by Stopping Times [article]

Daniel S. Berger, Philipp Gland, Sahil Singla, Florin Ciucu
2014 arXiv   pre-print
The obtained results are further generalized, using the second method, to feedforward networks with Markov arrival processes (MAP) requests.  ...  The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times.  ...  Assume a complete binary tree of height h with 2 h−1 arriving n-state MAPs. All nodes implement either R or Σ caches, with an m-state PH-distribution for the TTLs.  ... 
arXiv:1402.5987v1 fatcat:hj7rrnjv6jetxkibayoejm2nrm

Path integrals in the symbol space of chaotic mappings

C Beck, T Tel
1995 Journal of Physics A: Mathematical and General  
This path integral is based on arbitrary non-Markovian stochastic processes generated by the symbolic dynamics of the map rather than the Wiener process.  ...  Our approach can be regarded as an extension of the thermodynamic formalism to infinitely many invene temperams. The concept of R€nyi enhopies is generalized 10 entrapy functionals.  ...  Acknowledgments This work has been supported by the Hungarian National Science Foundation (OTKA) under grant nos 2090, T4439, and by the International Relation Offices of Hungary and Germany, Project X231.3  ... 
doi:10.1088/0305-4470/28/7/012 fatcat:bf6pavhqlbeuxamzgfdagwgite

Exact analysis of TTL cache networks

Daniel S. Berger, Philipp Gland, Sahil Singla, Florin Ciucu
2014 Performance evaluation (Print)  
Moreover, numerical results highlight that existing Poisson approximations in binary-tree topologies are subject to relative errors as large as 30%, depending on the tree depth.  ...  The second method further generalizes these results to feedforward networks with Markov arrival process (MAP) requests.  ...  Acknowledgments We thank Peter Buchholz from the University of Dortmund for his help and guidance in using the Nsolve tool to derive the numerical results presented in Section 6.  ... 
doi:10.1016/j.peva.2014.07.001 fatcat:xias23ve7fcg3lea7ryuunzsau

Synthesizing and Optimizing FDIR Recovery Strategies from Fault Trees [chapter]

Liana Mikaelyan, Sascha Müller, Andreas Gerndt, Thomas Noll
2019 Communications in Computer and Information Science  
Redundancy concepts are an integral part of the design of space systems. Deciding when to activate which redundancy and which component should be replaced can be a difficult task.  ...  We discuss techniques on how this Recovery Automaton can be further optimized to contain fewer states and transitions and show the effectiveness of our approach on two case studies.  ...  In the future, we would like to extend the Recovery Automata model to deal with input of Fault Trees with transient and repairable faults and consider how the merging rules can be transferred.  ... 
doi:10.1007/978-3-030-12988-0_3 fatcat:lmubthxl4jehvmm3ko6atqbb74

GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems

Sherif H. Elmeligy Abdelhamid, Chris J. Kuhlman, Madhav V. Marathe, Henning S. Mortveit, S. S. Ravi, Ramesh Balasubramaniam
2015 PLoS ONE  
It illustrates how GDSC was used to find classes of GDS that produce arbitrarily large limit cycles, and limit cycles that form undirected binary hypercubes in attractor graphs.  ...  A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges.  ...  We thank our external collaborators and members of the Network Dynamics and Simulation Science Laboratory (NDSSL). We thank Persistent Systems Ltd.  ... 
doi:10.1371/journal.pone.0133660 pmid:26263006 pmcid:PMC4532456 fatcat:mmb2vvvz5jc6fddkbecvjqoz4i

Process algebra for performance evaluation

Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoen
2002 Theoretical Computer Science  
In total we consider four related calculi and investigate their relationship to existing Markovian process algebras.  ...  The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for di erent types of Markovian process  ...  In addition, we would like to acknowledge the valuable comments and suggestions of Pedro R.  ... 
doi:10.1016/s0304-3975(00)00305-4 fatcat:uab7q45gs5c43ixjzujjthe3dy

Tools for Performance Evaluation of Computer Systems: Historical Evolution and Perspectives [chapter]

Giuliano Casale, Marco Gribaudo, Giuseppe Serazzi
2011 Lecture Notes in Computer Science  
The development of software tools for performance evaluation and modeling has been an active research area since the early years of computer science.  ...  A review of recent works that provide new perspectives to software tools for performance modeling is presented, followed by a number of ideas on future research directions for the area.  ...  The authors wishes to thank the anonymous reviewer for the valuable comments that helped to improve the quality of the paper.  ... 
doi:10.1007/978-3-642-25575-5_3 fatcat:lvrjwulipjcn5kaq3or4invg2e

Intermittency as metastability: a predictive approach to evolution in disordered environments [article]

Matteo Smerlak
2020 arXiv   pre-print
My results unify the concepts of intermittency in linear systems and Markovian metastability, and provide a generally applicable method to reduce, and predict, the dynamics of disordered linear systems  ...  In the presence of disorder, these systems tend to form localized structures which alternate between long periods of relative stasis and short bursts of activity.  ...  McCandlish and J. P. Garrahan for pointing me to Ref. [28, 34, 35] and Ref. [31, 32]  ... 
arXiv:2009.03608v2 fatcat:aeyim6vrezfdlnbyzuewwdgqkq

Transient analysis of tree-Like processes and its application to random access systems

J. Van Velthoven, B. Van Houdt, C. Blondia
2006 Proceedings of the joint international conference on Measurement and modeling of computer systems - SIGMETRICS '06/Performance '06  
As opposed to the standard tree-like process, such a process marks part of the time epochs by following a set of Markovian rules.  ...  A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs.  ...  Matrix-analytic models include notions such as the Markovian arrival process (MAP) and the phasetype (PH) distribution, both in discrete and continuous time.  ... 
doi:10.1145/1140277.1140299 dblp:conf/sigmetrics/VelthovenHB06 fatcat:paclvtnis5dxthiiq3vyrqfnwa

Transient analysis of tree-Like processes and its application to random access systems

J. Van Velthoven, B. Van Houdt, C. Blondia
2006 Performance Evaluation Review  
As opposed to the standard tree-like process, such a process marks part of the time epochs by following a set of Markovian rules.  ...  A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs.  ...  Matrix-analytic models include notions such as the Markovian arrival process (MAP) and the phasetype (PH) distribution, both in discrete and continuous time.  ... 
doi:10.1145/1140103.1140299 fatcat:xpvqf5m4xveybgyqtaewdql6wu

A multimedia framework for effective language training

Markus Gross, Christian Voegeli
2007 Computers & graphics  
The entire framework is based on information theory and utilizes a Markovian language model derived from linguistic analysis of language corpora for English, French, and German.  ...  The results show significant improvements in writing skills in both groups after small amounts of daily training.  ...  ; Doo-Young Kwon for designing a part of the user interface; all children and parents for participating in the user study; and the Swiss Dyslexia Association for helping us to recruit them.  ... 
doi:10.1016/j.cag.2007.09.001 fatcat:rq4nw5ivg5espovjkd5aps3zwu

The PEPA eclipse plugin

Mirco Tribastone, Adam Duguid, Stephen Gilmore
2009 Performance Evaluation Review  
The PEPA Eclipse Plug-in supports the creation and analysis of performance models from small-scale Markov models to large-scale simulation studies and differential equation systems.  ...  Whichever form of analysis is used, models are expressed in a single highlevel language for quantitative modelling, Performance Evaluation Process Algebra (PEPA).  ...  Acknowledgement The helpful comments of the anonymous referees are appreciated. This work has been partially sponsored by the EU-funded project SENSORIA, IST-2005-016004.  ... 
doi:10.1145/1530873.1530880 fatcat:oqfvmqt7irahrawrvhuwcgm7kq
« Previous Showing results 1 — 15 out of 499 results