In this report, we study the application of the Parametric Timed Automata(PTA) tool to a concrete case of a distributed Heterogeneous Communication System (HCS). The description and requirements of HCS are presented and the system modeling is explained carefully. The system models are developed in UPPAAL and validated by different test cases. Part of the system models are then converted into pa...

We employ parametric and non-parametric cointegration to investigate the extent of integration between African stock markets and the rest of the world. Long-run correlation estimates imply very low association between the two. The two distinct cointegration approaches confirm the latter through recursive estimation. The implication is that global market movements may have little impact on Afric...

In this paper, we examine the problem of predicting machine availability in desktop and enterprise computing environments. Predicting the duration that a machine will run until it restarts (availability duration) is critically useful to application scheduling and resource characterization in federated systems. We describe one parametric model fitting technique and two non-parametric prediction ...

introduction: there are many factors affecting crime rates. economic factors are one of them. also, nature of crimes and the effects of economic factors on them are different. economic crimes have a specific importance in economics of crime. researchers in iran don’t investigate the determinants of crime, especially economic crimes. thus, in this paper we investigate the short- and long run eff...

We investigate a model in which we connect slowly time varying unconditional long-run volatility with short-run conditional volatility whose representation is given as a semi-strong GARCH (1,1) process with heavy tailed errors. We focus on robust estimation of both long-run and short-run volatilities. Our estimation is semiparametric since the long-run volatility is totally unspecified whereas ...

We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneider’s minimum-balance algorithm to obtain a faster minimum-balance algorithm. For a graph with n vertices and m edges, our parametric shortest path algorithm and our minimum-balance algorithm both run in O(nm + n logn) time, improved from O...

Run-time analysis is a type of empirical tool that studies the time consumed by running an algorithm. This type of analysis has been successfully used in some Artificial Intelligence (AI) fields, in paticular in Metaheuristics. This paper is an attempt to bring this tool to the path-planning community. To this end the paper reports a run-time analysis of some AI classical algorithms applied to ...