Stochastic computing (SC) is an emerging computing technique that promises high density, low power, and error tolerant solutions. In SC, values are encoded as unary bitstreams and SC arithmetic circuits operate on one or more bitstreams. In many cases, the input bitstreams must be correlated or uncorrelated for SC arithmetic to produce accurate results. As a result, a key challenge for designin...

Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.

We derive efficient and accurate analytical pricing bounds and approximations for discrete arithmetic Asian options under time-changed Lévy processes. We extend the conditioning variable approach to derive the lower bound on the Asian option price and construct a sharp upper bound based on the lower bound. We also consider the general partially exact and bounded (PEB) approximations, which incl...

Stochastic Computing (SC) is a computing paradigm that allows for the low-cost and low-power computation of various arithmetic operations using stochastic bit streams digital logic. In contrast to conventional representation schemes used within binary domain, sequence in domain inconsequential, usually non-deterministic. this brief, we exploit stochasticity during switching probabilistic Conduc...

The computational operations of stochastic computing (SC) are governed by probability rules which is different from conventional arithmetic computations. Applications of SC to digital signal and image processing problems have been recently reported in the literature. To improve the computational performance of SC based finite impulse response (FIR) digital filters, a new stochastic inner produc...

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x−y ≥ k, where x and y are variables or constants and k ∈ N is a non-negati...

We have proposed the CoMPACT monitor; it achieves the scalable measurement of the one-way delay distribution for each flow. CoMPACT monitor transforms the one-way delay data obtained by active measurement by using the passively monitored traffic data of the target flow. A recent study reported that using an inter-probe time with Gamma distribution can improve the accuracy of simple active measu...

In this article, we recall different approaches to the constraint-based, symbolic analysis of hybrid discrete-continuous systems and combine them to a technology able to address hybrid systems exhibiting both non-deterministic and probabilistic behavior akin to infinite-state Markov decision processes. To enable mechanized analysis of such systems, we extend the reasoning power of arithmetic sa...

The exact analysis of a network of queues with multiple products is, in general, prohibited because of the non-renewal structure of the arrival and departure processes. Two-moment approximations (decomposition methods, Whitt [9]) have been successfully used to study these systems. The performance of these methods, however, strongly depends on the quality of the approximations used to compute th...