This paper analyzes the role of equilibrium, risk-sharing institutions in leading to the structural transformation in the production technology that brought about the industrial revolution. Guided by history, the model considers two risk-sharing institutions each of complements an existing social structure. The …rst is a ‘Chinese’ style, lineage-based institution: members choose technology base...

Quantum Cellular Automata (QCA) present one of the many emerging computational nanotechnology paradigms. It uses the arrangements of individual electrons, instead of currents and voltages, to encode binary information. Note a QCA cell consists of four quantum dots located at the corners of a square. This tutorial paper provides an introductory material on the design and testing of combinational...

A profile π = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of vertices of G, with repetitions allowed. A median x of π is a vertex for which the sum of the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a profile. Medians are important in location theory and consensus theory. A median graph is a graph fo...

We consider two broad families of non-additive loss functions covering a large number of applications: rational losses and tropical losses. We give new algorithms extending the Followthe-Perturbed-Leader (FPL) algorithm to both of these families of loss functions and similarly give new algorithms extending the Randomized Weighted Majority (RWM) algorithm to both of these families. We prove that...

K. N. Plataniotis A. N. Venetsanopoulos Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto 10 King’s College Road Toronto, Ontario M5S 3G4, Canada E-mail: [email protected] Abstract. A new approach to the problem of impulsive-noise reduction for color images is introduced. The major advantage of the technique is that it filters out the noise compon...

We study the following computational problem: for which values of k, the majority of n bits MAJn can be computed with a depth two formula whose each gate computes a majority function of at most k bits? The corresponding computational model is denoted by MAJk ◦MAJk. We observe that the minimum value of k for which there exists a MAJk ◦MAJk circuit that has high correlation with the majority of n...

Quantization of the synaptic weights is a central problem of hardware implementation of neural networks using 0 technology. In this paper, a particular linear threshold boolean function, called majority function is considered, whose synaptic weights are restricted to only three values: ?1, 0, +1. Some results about the complexity of the circuits composed of such gates are reported. They show th...

The Number On the Forehead (NOF) model is a multiparty communication game between k players that collaboratively want to evaluate a given function F : X1 × · · · ×Xk → Y on some input (x1, . . . , xk) by broadcasting bits according to a predetermined protocol. The input is distributed in such a way that each player i sees all of it except xi (as if xi is written on the forehead of player i). In...

The three-judges protocol, recently advocated by Mclver and Morgan as an example of stepwise refinement of security protocols, studies how to securely compute the majority function to reach a final verdict without revealing each individual judge’s decision. We extend their protocol in two different ways for an arbitrary number of 2n+1 judges. The first generalisation is inherently centralised, ...