Báo cáo toán học: "Computing Evolutionary Chains in Musical Sequences" pdf

... t. 3. Two or more lexical chains were found. We merge these chains into a single new chain, and remove the old chains from L. II. Clustering within the weak chains. Algorithms for graph clustering ... connected graphs into dense subgraphs with a similar diameter. We consider each lexical chain in L with diameter 3  m as a weak chain and apply graph clustering to ide...

Ngày tải lên: 20/02/2014, 12:20

... future of marine environmental assessment of contaminants will be closely linked to integrated monitoring - the combination of chemical monitoring and biological eects monitoring. Biological ... Abstract The biological eects monitoring plays an important role in marine monitoring. Contaminants and their eects on sh as well as on other marine organisms belong to the...

Ngày tải lên: 20/06/2014, 20:20

... approximate the s ingular fourth-order BVP to singular second-order BVP by constructing an inte- gral operator. In Section 3, the sufficient condition for the existence of single and mul- tiple ... approved the final manuscript. Competing interests We declare that we have no significant competing financial, professional, or personal interests that might have influenced the performance o...

Ngày tải lên: 20/06/2014, 21:20

... contain transi- ent noise. Every speech signals and transient noise sig- nals are recorded in real environment, separately. The transient noise signals are acquired by using mobile recoding devices ... linear fil- tering methods cannot remove transient noise easily which has abruptly varying characteristic [4-6]. In gen- era l, transient noise is generated by tapping a...

Ngày tải lên: 20/06/2014, 21:20

... article as: Fazeni and Steinmüller: Impact of changes in diet on the availability of land, energy demand, and greenhouse gas emissions of agriculture. Energy, Sustainability and Society 2011 1:6. Submit ... examined simultaneously. Existing studies on this topic often focus on the impact of dietary choices either on energy and emissions...

Ngày tải lên: 20/06/2014, 21:20

... alt =""

Ngày tải lên: 05/08/2014, 15:20

... Yao, Reid’s conjecture on score sets in tournaments, Kexue Tongbao 33 (1988) 481–484 (in Chinese). 7. T. X. Yao, On Reid’s conjecture of score sets for tournaments, Chinese Sci. Bull. 34 (1989) ... of Reid’s conjecture by pure arithmetical analysis which appeared in Chinese [6] in 1988 and in English [7] in 1989. In the following result, we prove that any set of p non...

Ngày tải lên: 06/08/2014, 05:20

... H are graphs, then their union is the graph G ∪ H consisting of disjoint copies of G and H.Ifm is a positive integer, then mG is the graph consisting of m disjoint copies of G. We call a graph ... A in I whichisjoinedtofewerthanq/2 trees of odd order. As in the preceding paragraph we obtain an independent set of G of size greater than (n − 1)/2, contradicting the assumption that G i...

Ngày tải lên: 07/08/2014, 06:20

... matchings and Hamiltonian cycles in random graphs. Annals of Discrete Mathematics 28 (1985) 23-46. [6] B. Bollob´as, T.I. Fenner and A.M. Frieze. An algorithm for finding Hamilton cycles in random graphs. ... Cooper. 1-pancyclic Hamilton cycles in random graphs. Random Structures and Algorithms 3.3 (1992) 277-287 [9] C. Cooper and A. Frieze. Pancyclic random graphs....

Ngày tải lên: 07/08/2014, 06:20

... explicit. Deformation of Chains via a Local Symmetric Group Action Patricia Hersh ∗ Department of Mathematics, Room 2-588 Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge, MA 02139 hersh@math.mit.edu Submitted: ... [El] because we it will allow us to explain why orbits of local symmetric group actions on lattices are always products of ch...

Ngày tải lên: 07/08/2014, 06:20

... − 1 2 . In a certain (rather narrow) range of m, n and in the particular case of R induced by an injective mapping, Theorem 3 improves Theorem 1. To deal with the generalization of the most important and ... Math´ematique, Geneva, 1980. [6] V.F. Lev, Restricted set addition in groups. I. The classical setting, Journal of the London Mathematical Society, to appe...

Ngày tải lên: 07/08/2014, 06:20

... evolu- tionary chain problem. The the Longest Non-Overlapping Evolutionary Chain, Comput- ing the Longest Nearest-Neighbor Non-Overlapping Evolutionary Chain and Computing the Longest Minimum-Weight ... well as the obvious musical- analytical interest in detecting such evolutionary pattern -chains, they have importance in any appli- cation where they might be missed in detecting...

Ngày tải lên: 07/08/2014, 06:23

... theoretically sound algorithm for random generation in finite groups” on arXiv:math [4]. He proposed a new algorithm for generating (almost) random elements of a finite group G in which the cost to set ... U 2 = Z m  2 − 1/g, the final inequality in (c) follows from a simple induction. Proof of Theorem 3. The initial inequality has been proved in Lemma 13. It remains to...

Ngày tải lên: 07/08/2014, 21:20