The coherent structures and wake dynamics of a two-degree-of-freedom vibrating cylinder with low mass ratio at Re=5300 are investigated by means proper orthogonal decomposition (POD) numerical database generated using large-eddy simulations. Two different reduced velocities U*=3.0 U*=5.5, which correspond the initial super-upper branches, considered. This is first time that this kind analysis p...

We prove a version of the Ray-Chaudhuri–Wilson and Frankl–Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a; a; . . . ; ak of length n have k-wise Hamming-distance ‘; if there are exactly ‘ such coordinates, where not all of their coordinates coincide (alternatively, exactly n ‘ of their...

We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of thei...

We present LEEWAVE − a bandwidth-efficient approach to searching range-specified k-nearest neighbors among distributed streams by LEvEl-wise distribution of WAVElet coefficients. To find the k most similar streams to a range-specified reference one, the relevant wavelet coefficients of the reference stream can be sent to the peer sites to compute the similarities. However, bandwidth can be unne...

From 06.05. to 11.05.2007, the Dagstuhl Seminar 07191 Event Processing was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put...

In the previous lecture we introduced a streaming algorithm for estimating the frequency moment F2. The algorithm used very little space, logarithmic in the length of the stream, provided we could store a random function h : {1, . . . , n} → {±1} “for free” in memory. In general this would require n bits of memory, one for each value of the function. However, observe that our analysis used the ...