... formatted
PDF and full text (HTML) versions will be made available soon.
IDMA-based cooperative partial packet recovery: principles and applications
EURASIP Journal on Wireless Communications and Networking ... used for the recovery of partial packets from multiple sources.
In packet transmission, only a few erroneous bits may cause the entire packet to be discarded a...
... proposed affective interaction, the expression system provides a
natural and intermediate interface between humans and service robots. As
addressed in Section 4.3, the system enables service ... influences the affective
states of humans. Consequently, musical mood recognition has strong
possibility of improving the reliability of affective interaction between
humans...
... is just the repetition of the proof of Lemma
3.2, we omit the details of its proof.
With the aid of above preparations, now we will give the proof of Theorem 1.2.
Proof of Theorem 1.2 By(1.8), ... similar to the proof of Lemma 3.1, so we omit
the details of its proof.
Lemma 3.4 Under the conditions of Theorem 1.2, F(x) satisfies the PS condition.
Proof From the proof of Le...
... Vietnam Journal of Mathematics 33:3 (2005) 319–334
Subclasses of Uniformly Starlike and
Convex Functions Defined by
Certain Integral Operator
Maslina Darus
1
,AiniJanteng
2
, and Suzeini Abdul ... (α>0,β >−1) (5)
and
J
α
f(z)=z +
∞
n=2
α +1
α + n
a
n
z
n
, (α>−1). (6)
Uniformly Starlike and Convex Functions Defined by Certain Integral...
... is to construct parametrically new symmetric designs and non-
embeddable quasi-residual designs. The main tool in both constructions are balanced
generalized weighing matrices.
A balanced generalized ... (1963), pp. 399–402.
the electronic journal of combinatorics 8 (2001), #R12 15
Applying balanced generalized weighing matrices to
construct block designs
Yury J...
... matrix and G(M) is a forest then the strong
completion of (Prof(M), ≤) is partially well-ordered.
4 When profile classes are not partially well-ordered
We have half of Theorem 2.2 left to prove, and ... an mì n matrix and (i, j) [m]ì[n], we denote
by M
i,j
the entry of M in row i and column j.ForI ⊆ [m]andJ [n], we let M
IìJ
stand for the submatrix (M
i,j
)
iI,jJ
. We write M
t
fo...
... aussi d´eduire la formule pr´ec´edente du lemme 2 en partant
du membre de droite et en utilisant la formule de Chu-Vandermonde. Inversement on
obtient une preuve combinatoire de cette derni`ere sous ... longueurs k et r devant ˆetre respect e, on obtient le r´esultat.
Remarque. Comme
k+r
k
compte le nombre de mani`eres de m´elanger deux chemins ori-
ent´es de longueur k et r, respective...