This paper illustrates how to compare different agent-based models and how to compare an agent-based model with real data. As examples we investigate ARFIMA models, the probability density function, and the spectral density function. We illustrate the methodology in an analysis of the agent-based model developed by Levy, Levy, Solomon (2000), and confront it with the S&P 500 for a comparison wi...

In their interesting paper [1], Buscemi et al derive a state-independent entropic trade-off relation for the noise (approximation error) in the measurement of one observable and the necessary disturbance imparted thereby on another observable. We appreciate that this work is very much in the spirit of our recent letter [2], where we have derived two variants of error-disturbance relations for p...

The study tries to explore the dynamics of comovement of stock markets of USA ,Brazil, Mexico, China and India during the period from January, 1996 to July, 2007 using daily closing price data. It attempts to analyze the speed of adjustment coefficients using daily, weekly and monthly data. It also tries to examine the efficiency of the stock market as a result of initiatives and regulatory mea...

When the worst case integration error in a family of functions decays as n−α for some α > 1 and simple averages along an extensible sequence match that rate at a set of sample sizes n1 < n2 < · · · < ∞, then these sample sizes must grow at least geometrically. More precisely, nk+1/nk ≥ ρmust hold for a value 1 < ρ < 2 that increases with α. This result always rules out arithmetic sequences but ...

This article presents a unifying framework to uncertainty quantification for systems subject to several design requirements that depend polynomially on both aleatory and epistemic uncertainties. This methodology, which is based on the Bernstein expansions of polynomials, enables calculating bounding intervals for the range of means, variances and failure probabilities of response metrics corres...

In this paper we prove that the broad class of direct-search methods of directional type, based on imposing sufficient decrease to accept new iterates, exhibits the same worst case complexity bound and global rate of the gradient method for the unconstrained minimization of a convex and smooth function. More precisely, it will be shown that the number of iterations needed to reduce the norm of ...

We investigate the interaction of the source coding mechanism and the transport mechanism for real time data packet transmission over dense networks. We show that single path routing does not make efficient use of network capacity whereas multi path routing techniques do (Proposition 1 and 2). We then consider the interaction of single versus multiple description source coding with single versu...

&lt;span&gt;Optical wireless communication (OWC) has attracted significant interest recently in academia and industry. Free-space optical (FSO) systems are where free space acts as a channel between transceivers that line of sight (LOS) for the successful transmission signals. The FSO transmissions through atmosphere, nevertheless, bring significant challenges, besides uncertainty atmospheric ch...

This report reviews various optimum decision rules for pattern recognition, namely, Bayes rule, Chow's rule (optimum error-reject tradeo ), and a recently proposed class-selective rejection rule. The latter provides an optimum tradeo between the error rate and the average number of (selected) classes. A new general relation between the error rate and the average number of classes is presented. ...

We present a novel Visual Odometry algorithm entitled Circular FREAK-ORB (CFORB). This algorithm detects features using the well-known ORB algorithm [12] and computes feature descriptors using the FREAK algorithm [14]. CFORB is invariant to both rotation and scale changes, and is suitable for use in environments with uneven terrain. Two visual geometric constraints have been utilized in order t...