Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this p...

Received Jul 22, 2012 Revised Oct 23, 2012 Accepted Nov 14, 2012 Time series forecasting is an active research area that has drawn considerable attention for applications in a variety of areas. Auto-Regressive Integrated Moving Average (ARIMA) models are one of the most important time series models used in financial market forecasting over the past three decades but not very often used to forec...

In this paper, we show how the dynamics of Q-learning can be visualized and analyzed from a perspective of Evolutionary Dynamics (ED). More specifically, we show how ED can be used as a model for Qlearning in stochastic games. Analysis of the evolutionary stable strategies and attractors of the derived ED from the Reinforcement Learning (RL) application then predict the desired parameters for R...

In assessing counterfactuals, should we consider circumstances which match the actual circumstances in all probablistically independent fact or all causally independent fact? Jonathan Schaffer argues the latter and claims that the former approach, advanced by me, cannot deal with the case of Morgenbesser’s coin. More generally, he argues that, where there is a difference between the two, his ac...

The aim of this thesis is assess the usefulness of the statistical analysis of coin hoards for the examination of aspects of ancient societies including coin use and exchange. Special attention was paid to various aspects of ‘formation processes.’ The thesis was divided into three parts. Part I — Background. This Part initially reviews the history of the project and then goes on to examine the ...

We provide a polynomial time reduction from Bayesian incentive compatible mechanism design to algorithm for welfare maximization problems. Unlike prior results, our achieves exact compatibility problems with multi-dimensional and continuous type spaces. The key technical barrier preventing in black-box reductions is that repairing violations of constraints requires understanding the distributio...

Network Functions Virtualization (NFV) allows the implementation in software of middleboxes traditionally available as specialized hardware. services can be implemented SFCs (Service Function Chains) based onvirtualization technologies that run on commodity Although most virtualized functions have classic middlebox functionalities (e.g. firewalls or intrusion detectors) NFV technology used to l...

Suppose that attached to each site z ∈ Z is a coin with bias θ(z), and only finitely many of these coins have non-zero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}z∈Z, using only the outcomes of these coin tosses and no information about the path of the random walker, up t...

We review the quantum version of a well known problem of cryptography called coin tossing (" flipping a coin via telephone "). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly distributed random bit which is common to both parties. The only resource they can use to perform this task is a classical or quantum communication channel. In ...

This paper represents algorithm for recognition of the coins of different denomination. The proposed system first uses a canny edge detection to generate an edge map, then uses CHT (Circular Hough transform) to recognize the coins and further find the radii of them. Based on the radius of the coin, the coins of different denomination are classified. The experimental result shows that the Hough ...