... Communications and Networking
Volume 2008, Article ID 649581, 11 pages
doi:10.1155/2008/649581
Research Article
An Efficient M ultibit Aggregation Scheme for
Multihop Wireless Sensor Networks
Bhushan G. ... rule (2-CV) and 1-bit
CV rule (CV-FT and CV-VT) with the existing weighted
aggregation scheme (WAS) and the counting rule in terms
of numerically computed accuracy and syste...
... pages
doi:10.1155/2008/734258
Research Article
An Efficient Differential MIMO-OFDM Scheme with
Coordinate Interleaving
Kenan Aksoy and
¨
Umit Ayg
¨
ol
¨
u
Department of Electronics and Communications, Faculty ... two transmit antennas with h
1
and
h
2
, respectively. Let the dummy symbols to be transmitted
during the first two transmission periods be a
1
and a
2
. There-
for...
... Communications and Networking
Volume 2008, Article ID 734258, 8 pages
doi:10.1155/2008/734258
Research Article
An Efficient Differential MIMO-OFDM Scheme with
Coordinate Interleaving
Kenan Aksoy and
¨
Umit ... There-
fore, a
1
and −a
∗
2
are transmitted from the first transmit an-
tenna, and a
2
and a
∗
1
are transmitted from the second trans-
mit antenna during the first a...
... 1988.
[7] N. Christin, J. Liebeherr, and T. Abdelzaher, “Enhancing class-
based serv ice architectures with adaptive rate allocation and
dropping mechanisms,” IEEE/ACM Transactions on Network-
ing, vol. ... J.Koo,V.V.Shakhov,andH.Choo ,An Enhanced RED-Based
Scheme for Differentiated Loss Guarantees, vol. 4238 of Lecture
Notes in Computer Science,Springer,NewYork,NY,USA,
2006.
[9] G. Harin...
... Corporation
EURASIP Journal on Advances in Signal Processing
Volume 2011, Article ID 725189, 16 pages
doi:10.1155/2011/725189
Research Article
An Efficient Algorithm for Instantaneous Frequency Estimation
of ... {s
(
t
)
}=a
(
t
)
e
jφ(t)
,
(1)
where H
{s(t)} is the Hilbert transformation of s(t), a(t)is
the signal instantaneous amplitude, and φ(t) is the signal
instantaneous phase....
... good switching
reduction if the transferred data are random and evenly
distributed over the whole data range. For the wide data bus
without evenly distributed random data, the same authors
proposed ... program to be executed sequentially
without any branches, T0 can ideally achieve zero bus
switching. An extra control bus line for signalling sequential
memory access and a local instruction...
... 2, pp. 145–155, 2008.
[4] X. Zhou and B. Bhanu, “Integrating face and gait for human
recognition at a distance in video,” IEEE Transactions on
Systems, Man, and Cybernetics, Part B, vol. 37, ... 2006.
[12] D. Tao, X. Li, X. Wu, and S. J. Maybank, “General tensor
discriminant analysis and gabor features for gait recognition,”
IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol....
... [5].
with minimal impact to the network. Its first deployments
reported that this new standard could handle thousands of
devicesinanAsianmeteringproduct[2].
4. N-DIMENSIONAL ADDRESSING SCHEME AND
ITS ... Journal on Wireless Communications and Networking
Volume 2008, Article ID 765803, 13 pages
doi:10.1155/2008/765803
Research Article
An Efficient Addressing Scheme and Its Routin...
... the PDF peak (standard deviation)
and β is called the shape parameter which is inversely
proportional to the decreasing rate of the peak. Note that
β
= 1andβ = 2 yield Laplacian and Gaussian distributions,
respectively. ... 2008, Article ID 918601, 20 pages
doi:10.1155/2008/918601
Research Article
An Efficient Watermarking Technique for the Protection of
Fingerprint Images
K. Zebbi...
... l
1
-norm and 2-norm Gaussian
kernels.
Gaussian kernels perform better than with l
2
-norm Gaussian
kernel because of the different performances on An2 6. Due
to the modulability of the propeller of An2 6 ... 0.0003 200
Note: KPCA1 and KPCA2 correspond to KPCA with l
1
-norm and
2-norm Gaussian kernels; SKO-KPCA1 and SKO-KPCA2
correspond to KPCA with l
1
-norm and 2-norm Gaussian kerne...