This paper introduces a novel technique to construct an empirical workload model tting time-varying (transient) trace data. The trace can be a categorical or numerical time-series. We model the trace as a Piecewise Independent stochastic process. To estimate the parameters for our model we rst build a Rate Evolution Graph from the trace data. Piecewise linear regression is then used to construc...

current research, that involves laboratory investigations into the phenomena of solubility, uses circulation equipment that has been developed to study the enlargement of joint aperture. this paper describes the preliminary results of laboratory experiments on ten different length and width of samples, which show that the flow rate through the fissures increases with time as the fissures enlarg...

Models of concurrent systems employ a wide variety of semantics inducing various notions of process equivalence, ranging from linear-time semantics such as trace equivalence to branching-time semantics such as strong bisimilarity. Many of these generalize to system types beyond standard transition systems, featuring, for example, weighted, probabilistic, or game-based transitions; this motivate...

We propose a framework for timing attacks, based on (a variant of) the applied-pi calculus. Since many privacy properties, as well as strong secrecy and game-based security properties, are stated as process equivalences, we focus on (time) trace equivalence. We show that actually, considering timing attacks does not add any complexity: time trace equivalence can be reduced to length trace equiv...

In this work, the interaction between the semi-circular space and the neighboring joint with and without the presence of rock bolts was investigated using the particle flow code (PFC) approach. For this purpose, firstly, the calibration of PFC was performed using both the Brazilian experimental test and the uniaxial compression test. Secondly, a numerical model with the dimension of 100 m...

In [NO88], a particular trace monoid M is constructed such that for the class of length–reducing trace rewriting systems over M , confluence is undecidable. In this paper, we show that this result holds for every trace monoid, which is neither free nor free commutative. Furthermore we will present a new criterion for trace rewriting systems that implies decidability of confluence.