This paper examines the role of knowledge elites in modernization. At the eve of the French Revolution, in the spring of 1789, King Louis XVI solicited lists of grievances (Cahiers de Doléances), in which the public could express complaints and suggestions for reforms of the Ancien Regime. We show that the demand for mass education and democratization was particularly high in regions that had a...

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...

Middle (10-50 ms) and long (50-600 ms) latency auditory evoked potentials (AEPs) were investigated in artificially respired, muscle-paralyzed cats. Similarity to human potentials of comparable latencies was examined in two ways: (1) the similarity of waveform features such as peak amplitude, polarity and latency, and (2) the effects of task-related variables on these various waveform features. ...

In this paper we report the simulation procedure along with new, precise, and accurate critical values or percentage points (with 4 decimal places; standard error of the mean ≤0.0001) for six Dixon discordance tests with signifi cance levels α = 0.30, 0.20, 0.10, 0.05, 0.02, 0.01, 0.005 and for normal samples of sizes n up to 100. Prior to our work, critical values (with 3 decimal places) were ...

Quantum query complexity is a model of quantum computation, in which the cost of computing a function is measured by the number of queries that are made to the input given as a black-box. In this model, it was exhibited in the early stage of quantum computing research that there exist quantum algorithms superior to the classical counterparts, such as Deutsch and Jozsa’s algorithm, Simon and Sho...

We give the structure of discrete two-dimensional finite sets A, B ⊆ R2 which are extremal for the recently obtained inequality |A + B| ≥ ( |A| m + |B| n − 1)(m + n − 1), where m and n are the minimum number of parallel lines covering A and B respectively. Via compression techniques, the above bound also holds when m is the maximal number of points of A contained in one of the parallel lines co...