Báo cáo toán học: " A one–sided Zimin construction" ppt
... an alphabet A is a left (right) maximal Abelian square-free string if, for every a ∈ A, ax (xa) contains Abelian squares. An Abelian square-free string is maximal if it is both left maximal and ... which is a square. Less studied is another kind of repetition that can occur as a substring of a string, called an Abelian square. An Abelian square is a string followed by a permu...
Ngày tải lên: 07/08/2014, 06:22
...
Ngày tải lên: 05/08/2014, 15:21
... Janos Bolyai Mathematical Society, 30–32. [2] T. Banakh. On a cardinal group invariant related to partitions of Abelian groups (in Russian). Mat. Zametki, 64(3):341–350, 1998. English translation ... compact Abelian groups Recall that we consider a compact Abelian group G along with its Haar measure µ. The topology of G is assumed Hausdorff, and µ is assumed to be a complete probability...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "A Relative Laplacian spectral recursion" pptx
... journal of combinatorics 11(2) (2006), #R26 2 A Relative Laplacian spectral recursion Art M. Duval Department of Mathematical Sciences University of Texas at El Paso El Paso, TX 79968-0514 artduval@math.utep.edu Submitted: ... ∂ (Φ ∗ ) and (∂ Φ ) ∗ each map [F ]toa linear combination of faces in the coboundary of F in Φ. In fact, [2, Lemma 6.1] states that ∂ (Φ ∗ ) and (∂ Φ ) ∗ are isomorph...
Ngày tải lên: 07/08/2014, 08:22
Báo cáo toán học: "A note on embedding hypertrees" pptx
... thanks Asaf Shapira for pointing o ut the application of the main theorem to Chv´atal’s result, and t he referee for carefully reading this article. References [1] T. Bohman, A. Frieze, and D. Mubayi, ... theory is that every graph with chromatic number χ > t contains a subgraph with all degrees at least t, and therefore contains a copy of every t-edge tree. Bohman, Frieze, and Mubayi...
Ngày tải lên: 07/08/2014, 21:21
Báo cáo toán học: "A complete treatment of low-energy scattering in one dimension " ppsx
... h 1" alt =""
Ngày tải lên: 05/08/2014, 15:21
Báo cáo toán học: " A novel algorithm to form stable clusters in vehicular ad hoc networks on highways" doc
... IEEE Semiannual Vehicular Technology Conference, Milan, Italy (2004) [7] T Nadeem, S Dashtinezhad, C Liao, L Iftode, TrafficView: Traffic data dissemination using car-to-car communication. ACM Mobile ... includes Multime- dia (e.g.,audio/video) and data (e.g., toll collection, internet access, weather/maps/information) applications. Vehicular ad hoc networks (VANETs) are characterized by high v...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks" pot
... generate data about a phenomenon and relay streams of data to a more resource rich device called sink. This procedure is called data dissemination, which is a preplanned way of distributing data and ... node can disseminate the data towards the rendezvous area instead of storing it locally. Thus, the virtual infrastructure enables data persistence against node failures. Main disadvantag...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " A novel voice activity detection based on phoneme recognition using statistical model" pdf
... Comparative analysis of the proposed VAD algorithms In order to gain a comparative analysis of the proposed VAD performance under different environments such as the vehicle and street, several classic ... with all noises observed in the real world. Recently, the statistical model based VAD approach is considered an attractive approach for noisy speech. Sohn et al. [13] proposed a robust VA...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " A phenomenological model of seizure initiation suggests network structure may explain seizure frequency in idiopathic generalised epilepsy" potx
... (oscar.benjamin@bristol.ac.uk) Thomas H.B. Fitzgerald (thbfitz@gmail.com) Peter Ashwin (p.ashwin@exeter.ac.uk) Krasimira Tsaneva-Atanasova (k.tsaneva-atanasova@bristol.ac.uk) Fahmida Chowdhury (mark.richardson@iop.kcl.ac.uk) Mark ... graphs each having a particular 3-node graph (9 from Fig. 7) as its FTC. 3u2: 7 graphs each having a particular 3-node graph (10 from Fig. 7) as its FTC. 3b:...
Ngày tải lên: 20/06/2014, 20:20