Filters








619 Hits in 2.7 sec

Tree Echo State Networks

Claudio Gallicchio, Alessio Micheli
2013 Neurocomputing  
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.  ...  In addition, we highlight through the paper other characteristics of the approach: First, we discuss the Markovian characterization of reservoir dynamics, extended to the case of tree domains, that is  ...  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

Special issue on tools for computer performance modeling and reliability analysis

Giuliano Casale, Richard R. Muntz, Giuseppe Serazzi
2009 Performance Evaluation Review  
Each paper presents a general description of tool features together with a discussion on upcoming extensions. .  ...  that allows the specification of composite performance and reliability models based on different formalisms such as stochastic activity networks (SANs), fault trees, and the PEPA stochastic process algebra  ...  PEPA Eclipse Plug-in is centered around the Pepato library for static, Markovian, and ODE analysis of PEPA models by means of numerical and simulative methods.  ... 
doi:10.1145/1530873.1530875 fatcat:ou4f6oof4zc25ieie5kavcykmu

FIG: The Finite Improbability Generator [chapter]

Carlos E. Budde
2020 Lecture Notes in Computer Science  
This paper introduces the statistical model checker FIG 1.2, that estimates transient and steady-state reachability properties in stochastic automata.  ...  Written in C++, FIG can outperform other state-of-the-art tools for Rare Event Simulation.  ...  The author thanks Arnd Hartmanns for excellent discus-  ... 
doi:10.1007/978-3-030-45190-5_27 fatcat:yuhgezuz6vd75fd2rd2ka655hu

Compact Representation of Solution Vectors in Kronecker-Based Markovian Analysis [chapter]

Peter Buchholz, Tuǧrul Dayar, Jan Kriege, M. Can Orhan
2016 Lecture Notes in Computer Science  
Nevertheless, solution vectors used in the analysis of such Kronecker-based Markovian representations still require memory proportional to the size of the reachable state space, and this becomes a bigger  ...  The current paper shows that it is possible to use the hierarchical Tucker decomposition (HTD) to store the solution vectors during Kroneckerbased Markovian analysis relatively compactly and still carry  ...  for transient analysis.  ... 
doi:10.1007/978-3-319-43425-4_18 fatcat:d3b3qks2rbew3hgiccxctm4lke

Consensus of Noisy Multiagent Systems with Markovian Switching Topologies and Time-Varying Delays

Yilun Shang
2015 Mathematical Problems in Engineering  
The design method of consensus gains allows for decoupling the design problem from the graph properties.  ...  This paper concerns the continuous-time consensus of a network of agents under directed switching communication topologies governed by a time-homogeneous Markovian process.  ...  Acknowledgments The author would like to thank Professor Quanxin Zhu for useful suggestions.  ... 
doi:10.1155/2015/453072 fatcat:va7in4wrbngwbmkqjsyzgkkh2a

Recursive Utility for Stochastic Trees

Gordon B. Hazen, James M. Pellissier
1996 Operations Research  
The stochastic tree structure with utility recursion is important because it extends the convenient graphical features of decision trees to the modeling of risky time streams.  ...  Abstract Stochastic trees are semi-Markov processes represented using tree diagrams. Such trees have been found useful for prescriptive modeling of temporal medical treatment choice.  ...  Thanks to Chelsea White for pointing out the previous work by David Kreps.  ... 
doi:10.1287/opre.44.5.788 fatcat:nbnacyvhyjapvnutl3afqcrjwe

Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity

Marco Bernardo
2006 Electronical Notes in Theoretical Computer Science  
The reason is that, besides being a congruence, Markovian bisimilarity is consistent with ordinary lumping, an exact aggregation for Markov chains.  ...  In this paper we show that two non-bisimulation-based Markovian behavioral equivalences -Markovian testing equivalence and Markovian trace equivalence -induce at the Markov chain level an aggregation strictly  ...  Acknowledgement The author wishes to mention that a conjecture of the exactness of the CTMClevel aggregation induced by Markovian testing equivalence was made in 2000, at the end of a discussion with Mario  ... 
doi:10.1016/j.entcs.2005.12.079 fatcat:yqtwv6ip5begxijzjbdtzh6gqq

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.  ...  We also demonstrate our approach by analyzing the transient behavior of the celebrated binary tree algorithm by Capetanakis, Tsybakov and Mikhailov (CTM) [9, 28] , for random access systems.  ... 
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.  ...  We also demonstrate our approach by analyzing the transient behavior of the celebrated binary tree algorithm by Capetanakis, Tsybakov and Mikhailov (CTM) [9, 28] , for random access systems.  ... 
doi:10.1145/1140103.1140299 fatcat:xpvqf5m4xveybgyqtaewdql6wu

The PEPA eclipse plugin

Mirco Tribastone, Adam Duguid, Stephen Gilmore
2009 Performance Evaluation Review  
Whichever form of analysis is used, models are expressed in a single highlevel language for quantitative modelling, Performance Evaluation Process Algebra (PEPA).  ...  With regards to Markovian analysis, we are developing software modules for transient analysis and the computation of response-time quantiles.  ...  The abstract syntax tree is the input for the various forms of analysis available in the library: static analysis, Markovian analysis, simulation, and ODE analysis.  ... 
doi:10.1145/1530873.1530880 fatcat:oqfvmqt7irahrawrvhuwcgm7kq

Rare Event Simulation for non-Markovian repairable Fault Trees [article]

Carlos E. Budde, Marco Biagi, Raúl E. Monti, Pedro R. D'Argenio, Mariëlle Stoelinga
2019 arXiv   pre-print
We handle DFTs with Markovian and non-Markovian failure and repair distributions (for which no numerical methods exist) and show the efficiency of our approach on several case studies.  ...  Dynamic Fault Trees (DFT) are widely adopted in industry to assess the dependability of safety-critical equipment.  ...  Acknowledgments The authors thank José and Manuel Villén-Altamirano for fruitful discussions, who helped to better understand the application scope of our approach.  ... 
arXiv:1910.11672v2 fatcat:pqbxhwrhhncbzcm7ajfismsney

Formalization of Finite-State Discrete-Time Markov Chains in HOL [chapter]

Liya Liu, Osman Hasan, Sofiène Tahar
2011 Lecture Notes in Computer Science  
For illustration purposes, we utilize our formalization to analyze a simplified binary communication channel.  ...  Markovian models are usually analyzed using computer simulation, and more recently using probabilistic model-checking but these methods either do not guarantee accurate analysis or are not scalable.  ...  Dongyu Qiu from Concordia University, for the useful discussions on Markov Chain theory and their feedback on the reported formalization.  ... 
doi:10.1007/978-3-642-24372-1_8 fatcat:gcdyxbzbbfgs7ofnedbxab7om4

A Bayesian-Based EDA Tool for Nano-circuits Reliability Calculations [chapter]

Walid Ibrahim, Valeriu Beiu
2009 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
nanometer range, the design and manufacturing of future (nano-)circuits will become extremely complex and inevitably will introduce more defects while their functioning will be adversely affected by transient  ...  This paper introduces a novel generic technique for the accurate calculation of the reliability of future nanocircuits.  ...  This transforms a non-Markovian model into a Markovian one.  ... 
doi:10.1007/978-3-642-04850-0_36 fatcat:axtz2aik7rgqdmcxnpvwugnvpa

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

Giuliano Casale, Marco Gribaudo, Giuseppe Serazzi
2011 Lecture Notes in 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 development of software tools for performance evaluation and modeling has been an active research area since the early years of computer science.  ...  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

Snoopy: a tool to design and animate/simulate graph-based formalisms

Monika Heiner, Ronny Richter, Martin Schwarick
2008 Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Systems  
Snoopy provides some features (hierarchical nodes, logical nodes), which are particularly useful for larger models, or models with an higher connectivity degree.  ...  Each of these classes enjoys dedicated animation or simulation features. Our tool runs on Windows and Linux operating systems, and it is available free of charge for non-commercial use.  ...  We wish to acknowledge Thomas Menzel for his initial contributions to the development of Snoopy, and Alexey Tovchigrechko for his valuable enhancements, as well as the work done by former students, including  ... 
doi:10.4108/icst.simutools2008.3098 dblp:conf/simutools/HeinerRS08 fatcat:vjgnouphyza5zanvghton5gesq
« Previous Showing results 1 — 15 out of 619 results