This paper explains a calculational design technique for ne-grained parallel programs by means of an example. The example deals with the recognition of K-rotation invariant (or K-rotated) segments which is a generalisation of the well-known square recognition problem. Two parallel programs are derived. The rst one determines for each segment of N successive inputs whether it is K-rotated, the l...

This paper investigates how to improve the worst case runtime of INSERTION SORT while keeping it in-place, incremental and adaptive. To sort an array of n elements with w bits for each element, classic INSERTION SORT runs in O(n) operations with wn bits space. GAPPED INSERTION SORT has a runtime of O(n lg n) with a high probability of only using (1+ )wn bits space. This paper shows that ROTATED...

Hebrew-speaking students performed lexical decisions on Hebrew letter strings that appeared at different orientations. Response times evidenced a strong interaction between string length and orientation. At angular deviations of less than 60 degrees from the upright, neither orientation nor string length had any effect, suggesting that words were directly, and probably holistically, recognized....

We consider a notion of sequential functional of -nite type, more generous than the familiar notion embodied in Plotkin’s language PCF. We study both the “full” and “e4ective” partial type structures arising from this notion of sequentiality. The full type structure coincides with that given by the strongly stable model of Bucciarelli and Ehrhard; it has also been characterized by van Oosten in...

In auctions where a seller can post a reserve price but if the object fails to sell cannot commit never to attempt to resell it, revenue equivalence between repeated first price and second price auctions without commitment results. When the time between auctions goes to zero, seller expected revenues converge to those of a static auction with no reserve price. With many bidders, the seller equi...

Much recent interest surrounds listeners' abilities to adapt to various transformations that distort speech. An extreme example is spectral rotation, in which the spectrum of low-pass filtered speech is inverted around a center frequency (2 kHz here). Spectral shape and its dynamics are completely altered, rendering speech virtually unintelligible initially. However, intonation, rhythm, and con...

We study the rigorous design and analysis of stacked rotated gratings (SRGs) for novel photonic devices. A concept of sampling frequency is proposed to systematically design SRGs. With the help of a rectangular sampling lattice, we extend the standard 3D rigorous coupled-wave analysis (RCWA) algorithm to the analysis of SRGs. The resultant SRG-RCWA algorithm can be used to exactly analyze SRGs ...

In this paper we introduce rotated constellations of signals in multi-carrier code-division multiple-access (MC CDMA). The performance of this new system is obtained and compared to that of conventional MC-CDMA system. Numerical results consider a typical indoor environment.

Ideally computer pattern recognition systems should be insensitive to scaling, translation, distortion and rotation. Many neural network models have been proposed to address this purpose. The Neocognitron is a multi-layered neural network model for pattern recognition introduced by Fukushima in the early 1980s. It was considered effective and, after supervised learning, it can recognise input p...

we consider a class of hypergraphs called hypercycles and we show that a hypercycle $c_n^{d,alpha}$ is shellable or sequentially the cohen--macaulay if and only if $nin{3,5}$. also, we characterize cohen--macaulay hypercycles. these results are hypergraph versions of results proved for cycles in graphs.