Báo cáo toán học: "Computing Evolutionary Chains in Musical Sequences" pdf
Tài liệu Báo cáo khoa học: "Computing Lexical Chains with Graph Clustering" 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...
Báo cáo toán học: " IPv6 address autoconfiguration in geonetworking-enabled VANETs: characterization and evaluation of the ETSI solution" ppt
... by the ETSI TC ITS, and first assess
the feasibility of IPv6 multi-hop communications, by
means of analysis and simulation. Then, we focus on
the IPv6 address auto-configuration, explaining how
IPv6 ... between
the RSU and the CCUs within the RSU’s area of
in uence (i.e., associated GVL area), and therefore
extends the effective coverage area of the RSU...
Báo cáo toán học: " Biological effects monitoring in marine research" pot
... future of marine environmental assessment of contaminants will be closely linked to integrated monitoring - the
combination of chemical monitoring and biological eects monitoring. Biological ... Abstract
The biological eects monitoring plays an important role in marine monitoring. Contaminants and their eects on
sh as well as on other marine organisms belong to the...
Báo cáo toán học: " Radio wave propagation in curved rectangular tunnels at 5.8 GHz for metro applications, simulations and measurements" docx
... Masson et al.: Radio wave propagation in curved
rectangular tunnels at 5.8 GHz for metro applications, simulations and
measurements. EURASIP Journal on Wireless Communications and
Networking 2011 2011:202.
Submit ... measurements at 5.8 GHz are performed in a
curved rectangular tunnel. Finally, a statistical analysis of fast fading is performed on t...
Báo cáo toán học: " Sturm-Liouville BVP in Banach space" pptx
... 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...
Báo cáo toán học: " Transient noise reduction in speech signal with a modified long-term predictor" ppt
... 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...
Báo cáo toán học: " Impact of changes in diet on the availability of land, energy demand, and greenhouse gas emissions of agriculture" docx
... 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...
Báo cáo toán học: " On Score Sets in Tournaments" pptx
... 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...
Báo cáo toán học: "Two Extremal Problems in Graph Theory" pot
... 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...
Báo cáo toán học: "Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold" pot
... 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....
Báo cáo toán học: " Deformation of Chains via a Local Symmetric Group Action" pot
... 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...
Báo cáo toán học: "RESTRICTED SET ADDITION IN GROUPS, II. ˝ A GENERALIZATION OF THE ERDOS-HEILBRONN CONJECTURE" pptx
... −
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...
Báo cáo toán học: "Computing Evolutionary Chains in Musical Sequences" pdf
... 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...
Báo cáo toán học: "Generating random elements in finite groups." pdf
... 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...
Từ khóa: