id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0806.4468
|
Rui Zhang
|
Rui Zhang, Shuguang Cui, and Ying-Chang Liang
|
On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and
Broadcast Channels
|
To appear in IEEE Transactions on Information Theory
| null |
10.1109/TIT.2009.2030449
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the information-theoretic limits of a secondary or
cognitive radio (CR) network under spectrum sharing with an existing primary
radio network. In particular, the fading cognitive multiple-access channel
(C-MAC) is first studied, where multiple secondary users transmit to the
secondary base station (BS) under both individual transmit-power constraints
and a set of interference-power constraints each applied at one of the primary
receivers. This paper considers the long-term (LT) or the short-term (ST)
transmit-power constraint over the fading states at each secondary transmitter,
combined with the LT or ST interference-power constraint at each primary
receiver. In each case, the optimal power allocation scheme is derived for the
secondary users to achieve the ergodic sum capacity of the fading C-MAC, as
well as the conditions for the optimality of the dynamic
time-division-multiple-access (D-TDMA) scheme in the secondary network. The
fading cognitive broadcast channel (C-BC) that models the downlink transmission
in the secondary network is then studied under the LT/ST transmit-power
constraint at the secondary BS jointly with the LT/ST interference-power
constraint at each of the primary receivers. It is shown that D-TDMA is indeed
optimal for achieving the ergodic sum capacity of the fading C-BC for all
combinations of transmit-power and interference-power constraints.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2008 09:32:01 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Aug 2009 05:59:45 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zhang",
"Rui",
""
],
[
"Cui",
"Shuguang",
""
],
[
"Liang",
"Ying-Chang",
""
]
] |
new_dataset
| 0.963066 |
0807.0245
|
Jing Liu
|
Jing Liu, Jian-Kang Zhang, Kon Max Wong
|
Full Diversity Codes for MISO Systems Equipped with Linear or ML
Detectors
|
16 pages, 8 figures. accepted for publication in IEEE Trans.
Information theory
| null |
10.1109/TIT.2008.928992
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a general criterion for space time block codes (STBC) to
achieve full-diversity with a linear receiver is proposed for a wireless
communication system having multiple transmitter and single receiver antennas
(MISO). Particularly, the STBC with Toeplitz structure satisfies this criterion
and therefore, enables full-diversity. Further examination of this Toeplitz
STBC reveals the following important properties: a) The symbol transmission
rate can be made to approach unity. b) Applying the Toeplitz code to any
signalling scheme having nonzero distance between the nearest constellation
points results in a non-vanishing determinant. In addition, if QAM is used as
the signalling scheme, then for independent MISO flat fading channels, the
Toeplitz codes is proved to approach the optimal diversity-vs-multiplexing
tradeoff with a ZF receiver when the number of channel uses is large. This is,
so far, the first non-orthogonal STBC shown to achieve the optimal tradeoff for
such a receiver. On the other hand, when ML detection is employed in a MISO
system, the Toeplitz STBC achieves the maximum coding gain for independent
channels. When the channel fading coefficients are correlated, the inherent
transmission matrix in the Toeplitz STBC can be designed to minimize the
average worst case pair-wise error probability.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2008 21:49:42 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Liu",
"Jing",
""
],
[
"Zhang",
"Jian-Kang",
""
],
[
"Wong",
"Kon Max",
""
]
] |
new_dataset
| 0.981551 |
0808.1495
|
Shamgar Gurevich
|
Shamgar Gurevich, Ronny Hadani, Nir Sochen
|
The finite harmonic oscillator and its applications to sequences,
communication and radar
|
Accepted for publication in IEEE Transactions on Information Theory
(Communicated by Guang Gong, Department of Electrical and Computer
Engineering, University of Waterloo, Waterloo, Ontario, CANADA)
|
IEEE Transactions on Information Theory, vol. 54, no. 9, September
2008
|
10.1109/TIT.2008.926440
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel system, called the oscillator system, consisting of order of p^3
functions (signals) on the finite field F_p; with p an odd prime, is described
and studied. The new functions are proved to satisfy good auto-correlation,
cross-correlation and low peak-to-average power ratio properties. Moreover, the
oscillator system is closed under the operation of discrete Fourier transform.
Applications of the oscillator system for discrete radar and digital
communication theory are explained. Finally, an explicit algorithm to construct
the oscillator system is presented.
|
[
{
"version": "v1",
"created": "Mon, 11 Aug 2008 16:50:00 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Dec 2008 07:41:28 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Gurevich",
"Shamgar",
""
],
[
"Hadani",
"Ronny",
""
],
[
"Sochen",
"Nir",
""
]
] |
new_dataset
| 0.992668 |
0810.2781
|
Jin Lu
|
Jin Lu, Jos\'e M. F. Moura
|
Linear Time Encoding of LDPC Codes
|
36 pages, 13 figures, submitted to IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2009.2034823
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we propose a linear complexity encoding method for arbitrary
LDPC codes. We start from a simple graph-based encoding method
``label-and-decide.'' We prove that the ``label-and-decide'' method is
applicable to Tanner graphs with a hierarchical structure--pseudo-trees-- and
that the resulting encoding complexity is linear with the code block length.
Next, we define a second type of Tanner graphs--the encoding stopping set. The
encoding stopping set is encoded in linear complexity by a revised
label-and-decide algorithm--the ``label-decide-recompute.'' Finally, we prove
that any Tanner graph can be partitioned into encoding stopping sets and
pseudo-trees. By encoding each encoding stopping set or pseudo-tree
sequentially, we develop a linear complexity encoding method for general LDPC
codes where the encoding complexity is proved to be less than $4 \cdot M \cdot
(\overline{k} - 1)$, where $M$ is the number of independent rows in the parity
check matrix and $\overline{k}$ represents the mean row weight of the parity
check matrix.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2008 19:32:48 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Lu",
"Jin",
""
],
[
"Moura",
"José M. F.",
""
]
] |
new_dataset
| 0.999323 |
0810.3869
|
Vikram Chandrasekhar
|
Vikram Chandrasekhar, Jeffrey G. Andrews, Tarik Muharemovic, Zukang
Shen and Alan Gatherer
|
Power Control in Two-Tier Femtocell Networks
|
29 pages, 10 figures, Revised and resubmitted to the IEEE
Transactions on Wireless Communications
| null |
10.1109/TWC.2009.081386
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a two tier cellular network -- comprised of a central macrocell underlaid
with shorter range femtocell hotspots -- cross-tier interference limits overall
capacity with universal frequency reuse. To quantify near-far effects with
universal frequency reuse, this paper derives a fundamental relation providing
the largest feasible cellular Signal-to-Interference-Plus-Noise Ratio (SINR),
given any set of feasible femtocell SINRs. We provide a link budget analysis
which enables simple and accurate performance insights in a two-tier network. A
distributed utility-based SINR adaptation at femtocells is proposed in order to
alleviate cross-tier interference at the macrocell from cochannel femtocells.
The Foschini-Miljanic (FM) algorithm is a special case of the adaptation. Each
femtocell maximizes their individual utility consisting of a SINR based reward
less an incurred cost (interference to the macrocell). Numerical results show
greater than 30% improvement in mean femtocell SINRs relative to FM. In the
event that cross-tier interference prevents a cellular user from obtaining its
SINR target, an algorithm is proposed that reduces transmission powers of the
strongest femtocell interferers. The algorithm ensures that a cellular user
achieves its SINR target even with 100 femtocells/cell-site, and requires a
worst case SINR reduction of only 16% at femtocells. These results motivate
design of power control schemes requiring minimal network overhead in two-tier
networks with shared spectrum.
|
[
{
"version": "v1",
"created": "Tue, 21 Oct 2008 16:04:16 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Oct 2008 03:26:36 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Apr 2009 16:15:18 GMT"
},
{
"version": "v4",
"created": "Wed, 13 May 2009 19:53:07 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chandrasekhar",
"Vikram",
""
],
[
"Andrews",
"Jeffrey G.",
""
],
[
"Muharemovic",
"Tarik",
""
],
[
"Shen",
"Zukang",
""
],
[
"Gatherer",
"Alan",
""
]
] |
new_dataset
| 0.970779 |
0902.3026
|
Artem Chebotko
|
Artem Chebotko, Yu Deng, Shiyong Lu, Farshad Fotouhi, Anthony Aristar,
Hennie Brugman, Alexander Klassmann, Han Sloetjes, Albert Russel, Peter
Wittenburg
|
OntoELAN: An Ontology-based Linguistic Multimedia Annotator
|
Appeared in the Proceedings of the IEEE Sixth International Symposium
on Multimedia Software Engineering (IEEE-MSE'04), pp. 329-336, Miami, FL,
USA, December, 2004
|
Proceedings of the IEEE Sixth International Symposium on
Multimedia Software Engineering (IEEE-MSE'04), pp. 329-336, Miami, FL, USA,
December, 2004
|
10.1109/MMSE.2004.58
| null |
cs.DL cs.DB cs.MM cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite its scientific, political, and practical value, comprehensive
information about human languages, in all their variety and complexity, is not
readily obtainable and searchable. One reason is that many language data are
collected as audio and video recordings which imposes a challenge to document
indexing and retrieval. Annotation of multimedia data provides an opportunity
for making the semantics explicit and facilitates the searching of multimedia
documents. We have developed OntoELAN, an ontology-based linguistic multimedia
annotator that features: (1) support for loading and displaying ontologies
specified in OWL; (2) creation of a language profile, which allows a user to
choose a subset of terms from an ontology and conveniently rename them if
needed; (3) creation of ontological tiers, which can be annotated with profile
terms and, therefore, corresponding ontological terms; and (4) saving
annotations in the XML format as Multimedia Ontology class instances and,
linked to them, class instances of other ontologies used in ontological tiers.
To our best knowledge, OntoELAN is the first audio/video annotation tool in
linguistic domain that provides support for ontology-based annotation.
|
[
{
"version": "v1",
"created": "Wed, 18 Feb 2009 00:40:37 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chebotko",
"Artem",
""
],
[
"Deng",
"Yu",
""
],
[
"Lu",
"Shiyong",
""
],
[
"Fotouhi",
"Farshad",
""
],
[
"Aristar",
"Anthony",
""
],
[
"Brugman",
"Hennie",
""
],
[
"Klassmann",
"Alexander",
""
],
[
"Sloetjes",
"Han",
""
],
[
"Russel",
"Albert",
""
],
[
"Wittenburg",
"Peter",
""
]
] |
new_dataset
| 0.996744 |
0904.1281
|
Marius Kleiner
|
Marius Kleiner, Bixio Rimoldi
|
Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay
|
5 pages, 1 figure, final version accepted at IEEE Globecom 2009
(Communication Theory Symposium)
| null |
10.1109/GLOCOM.2009.5425427
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present and analyze a joint source-channel coding strategy for the
transmission of a Gaussian source across a Gaussian channel in n channel uses
per source symbol. Among all such strategies, our scheme has the following
properties: i) the resulting mean-squared error scales optimally with the
signal-to-noise ratio, and ii) the scheme is easy to implement and the incurred
delay is minimal, in the sense that a single source symbol is encoded at a
time.
|
[
{
"version": "v1",
"created": "Wed, 8 Apr 2009 08:34:12 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2009 11:22:30 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Kleiner",
"Marius",
""
],
[
"Rimoldi",
"Bixio",
""
]
] |
new_dataset
| 0.997489 |
0906.0037
|
Nadia Fawaz
|
Nadia Fawaz, Keyvan Zarifi, Merouane Debbah, David Gesbert
|
Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay
Networks
|
45 pages, 7 figures, submitted to IEEE Transactions on Information
Theory, December 2008
| null |
10.1109/TIT.2011.2111830
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multi-hop relaying system is analyzed where data sent by a multi-antenna
source is relayed by successive multi-antenna relays until it reaches a
multi-antenna destination. Assuming correlated fading at each hop, each relay
receives a faded version of the signal from the previous level, performs linear
precoding and retransmits it to the next level. Using free probability theory
and assuming that the noise power at relaying levels-- but not at destination--
is negligible, the closed-form expression of the asymptotic instantaneous
end-to-end mutual information is derived as the number of antennas at all
levels grows large. The so-obtained deterministic expression is independent
from the channel realizations while depending only on channel statistics.
Moreover, it also serves as the asymptotic value of the average end-to-end
mutual information. The optimal singular vectors of the precoding matrices that
maximize the average mutual information with finite number of antennas at all
levels are also provided. It turns out that the optimal precoding singular
vectors are aligned to the eigenvectors of the channel correlation matrices.
Thus they can be determined using only the known channel statistics. As the
optimal precoding singular vectors are independent from the system size, they
are also optimal in the asymptotic regime.
|
[
{
"version": "v1",
"created": "Fri, 29 May 2009 22:44:57 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Fawaz",
"Nadia",
""
],
[
"Zarifi",
"Keyvan",
""
],
[
"Debbah",
"Merouane",
""
],
[
"Gesbert",
"David",
""
]
] |
new_dataset
| 0.999596 |
0906.0695
|
Brijesh Rai Kumar
|
Brijesh Kumar Rai, and Bikash Kumar Dey
|
On network coding for sum-networks
|
Accepted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2011.2169532
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A directed acyclic network is considered where all the terminals need to
recover the sum of the symbols generated at all the sources. We call such a
network a sum-network. It is shown that there exists a solvably (and linear
solvably) equivalent sum-network for any multiple-unicast network, and thus for
any directed acyclic communication network. It is also shown that there exists
a linear solvably equivalent multiple-unicast network for every sum-network. It
is shown that for any set of polynomials having integer coefficients, there
exists a sum-network which is scalar linear solvable over a finite field F if
and only if the polynomials have a common root in F. For any finite or cofinite
set of prime numbers, a network is constructed which has a vector linear
solution of any length if and only if the characteristic of the alphabet field
is in the given set. The insufficiency of linear network coding and
unachievability of the network coding capacity are proved for sum-networks by
using similar known results for communication networks. Under fractional vector
linear network coding, a sum-network and its reverse network are shown to be
equivalent. However, under non-linear coding, it is shown that there exists a
solvable sum-network whose reverse network is not solvable.
|
[
{
"version": "v1",
"created": "Wed, 3 Jun 2009 12:22:52 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jul 2009 23:34:13 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Aug 2009 11:52:43 GMT"
},
{
"version": "v4",
"created": "Tue, 30 Aug 2011 08:36:18 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Rai",
"Brijesh Kumar",
""
],
[
"Dey",
"Bikash Kumar",
""
]
] |
new_dataset
| 0.973006 |
0906.2819
|
Mahdi Ramezani
|
Mahdi Ramezani, Masoud Ardakani
|
Disjoint LDPC Coding for Gaussian Broadcast Channels
|
5 pages, 1 figure, 3 tables, To appear in Proc. IEEE International
Symposium on Information Theory (ISIT 2009), Seoul, Korea, June-July 2009
| null |
10.1109/ISIT.2009.5205588
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-density parity-check (LDPC) codes have been used for communication over a
two-user Gaussian broadcast channel. It has been shown in the literature that
the optimal decoding of such system requires joint decoding of both user
messages at each user. Also, a joint code design procedure should be performed.
We propose a method which uses a novel labeling strategy and is based on the
idea behind the bit-interleaved coded modulation. This method does not require
joint decoding and/or joint code optimization. Thus, it reduces the overall
complexity of near-capacity coding in broadcast channels. For different rate
pairs on the boundary of the capacity region, pairs of LDPC codes are designed
to demonstrate the success of this technique.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2009 23:09:04 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ramezani",
"Mahdi",
""
],
[
"Ardakani",
"Masoud",
""
]
] |
new_dataset
| 0.967429 |
0912.3441
|
Georgios Rodolakis
|
Philippe Jacquet, Bernard Mans and Georgios Rodolakis
|
On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
|
Part of this work will be presented in "On Space-Time Capacity Limits
in Mobile and Delay Tolerant Networks", P. Jacquet, B. Mans and G. Rodolakis,
IEEE Infocom, 2010
| null |
10.1109/INFCOM.2010.5462164
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the fundamental capacity limits of space-time journeys of
information in mobile and Delay Tolerant Networks (DTNs), where information is
either transmitted or carried by mobile nodes, using store-carry-forward
routing. We define the capacity of a journey (i.e., a path in space and time,
from a source to a destination) as the maximum amount of data that can be
transferred from the source to the destination in the given journey. Combining
a stochastic model (conveying all possible journeys) and an analysis of the
durations of the nodes' encounters, we study the properties of journeys that
maximize the space-time information propagation capacity, in bit-meters per
second. More specifically, we provide theoretical lower and upper bounds on the
information propagation speed, as a function of the journey capacity. In the
particular case of random way-point-like models (i.e., when nodes move for a
distance of the order of the network domain size before changing direction), we
show that, for relatively large journey capacities, the information propagation
speed is of the same order as the mobile node speed. This implies that,
surprisingly, in sparse but large-scale mobile DTNs, the space-time information
propagation capacity in bit-meters per second remains proportional to the
mobile node speed and to the size of the transported data bundles, when the
bundles are relatively large. We also verify that all our analytical bounds are
accurate in several simulation scenarios.
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2009 16:27:59 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Jacquet",
"Philippe",
""
],
[
"Mans",
"Bernard",
""
],
[
"Rodolakis",
"Georgios",
""
]
] |
new_dataset
| 0.971907 |
1001.2195
|
Uwe Aickelin
|
Yousof Al-Hammadi, Uwe Aickelin, Julie Greensmith
|
DCA for Bot Detection
|
10pages, 5 tables, 6 figures, IEEE World Congress on Computational
Intelligence (WCCI2008), Hong Kong
|
Proceedings of the IEEE World Congress on Computational
Intelligence (WCCI2008), Hong Kong
|
10.1109/CEC.2008.4631034
| null |
cs.AI cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ensuring the security of computers is a non-trivial task, with many
techniques used by malicious users to compromise these systems. In recent years
a new threat has emerged in the form of networks of hijacked zombie machines
used to perform complex distributed attacks such as denial of service and to
obtain sensitive data such as password information. These zombie machines are
said to be infected with a 'bot' - a malicious piece of software which is
installed on a host machine and is controlled by a remote attacker, termed the
'botmaster of a botnet'. In this work, we use the biologically inspired
Dendritic Cell Algorithm (DCA) to detect the existence of a single bot on a
compromised host machine. The DCA is an immune-inspired algorithm based on an
abstract model of the behaviour of the dendritic cells of the human body. The
basis of anomaly detection performed by the DCA is facilitated using the
correlation of behavioural attributes such as keylogging and packet flooding
behaviour. The results of the application of the DCA to the detection of a
single bot show that the algorithm is a successful technique for the detection
of such malicious software without responding to normally running programs.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 15:05:02 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Al-Hammadi",
"Yousof",
""
],
[
"Aickelin",
"Uwe",
""
],
[
"Greensmith",
"Julie",
""
]
] |
new_dataset
| 0.999048 |
1003.1168
|
Jianfeng Zhan
|
Lei Wang, Jianfeng Zhan, Weisong Shi, Yi Liang, Lin Yuan
|
In Cloud, Do MTC or HTC Service Providers Benefit from the Economies of
Scale?
| null |
Proceedings of 2nd Workshop on Many-Task Computing on Grids and
Supercomputers, Co-located with ACM/IEEE SC 2009
|
10.1145/1646468.1646475
| null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we intend to answer one key question to the success of cloud
computing: in cloud, do many task computing (MTC) or high throughput computing
(HTC) service providers, which offer the corresponding computing service to end
users, benefit from the economies of scale? Our research contributions are
three-fold: first, we propose an innovative usage model, called dynamic service
provision (DSP) model, for MTC or HTC service providers. In the DSP model, the
resource provider provides the service of creating and managing runtime
environments for MTC or HTC service providers, and consolidates heterogeneous
MTC or HTC workloads on the cloud platform; second, according to the DSP model,
we design and implement DawningCloud, which provides automatic management for
heterogeneous workloads; third, a comprehensive evaluation of DawningCloud has
been performed in an emulatation experiment. We found that for typical
workloads, in comparison with the previous two cloud solutions, DawningCloud
saves the resource consumption maximally by 46.4% (HTC) and 74.9% (MTC) for the
service providers, and saves the total resource consumption maximally by 29.7%
for the resource provider. At the same time, comparing with the traditional
solution that provides MTC or HTC services with dedicated systems, DawningCloud
is more cost-effective. To this end, we conclude that for typical MTC and HTC
workloads, on the cloud platform, MTC and HTC service providers and the
resource provider can benefit from the economies of scale.
|
[
{
"version": "v1",
"created": "Fri, 5 Mar 2010 00:10:19 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Apr 2010 08:09:42 GMT"
},
{
"version": "v3",
"created": "Mon, 21 Jun 2010 05:50:25 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Wang",
"Lei",
""
],
[
"Zhan",
"Jianfeng",
""
],
[
"Shi",
"Weisong",
""
],
[
"Liang",
"Yi",
""
],
[
"Yuan",
"Lin",
""
]
] |
new_dataset
| 0.994455 |
1005.3143
|
Jezabel Molina-Gil
|
P. Caballero-Gil, J. Molina-Gil, C. Hern\'andez-Goya and C.
Caballero-Gil
|
Stimulating Cooperation in Self-Organized Vehicular Networks
| null |
Proceedings of APCC IEEE Asia Pacific Conference on
Communications. Vol. 82 , (October 2009) pp. 346-349
|
10.1109/APCC.2009.5375621
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Vehicular Ad-hoc NETwork (VANET) is a special form of Mobile Ad-hoc Network
designed to provide communications among nearby vehicles and between vehicles
and nearby fixed roadside equipment. Its main goal is to improve safety and
comfort for passengers, but it can also be used for commercial applications. In
this latter case, it will be necessary to motivate drivers to cooperate and
contribute to packet forwarding in Vehicle-to-Vehicle and Vehicle-to-Roadside
communications. This paper examines the problem, analyzes the drawbacks of
known schemes and proposes a new secure incentive scheme to stimulate
cooperation in VANETs, taking into account factors such as time and distance.
|
[
{
"version": "v1",
"created": "Tue, 18 May 2010 10:24:16 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Caballero-Gil",
"P.",
""
],
[
"Molina-Gil",
"J.",
""
],
[
"Hernández-Goya",
"C.",
""
],
[
"Caballero-Gil",
"C.",
""
]
] |
new_dataset
| 0.989049 |
1006.0109
|
Erik Jakobsson
|
Iliya Bouyukliev, Erik Jakobsson
|
Results on Binary Linear Codes With Minimum Distance 8 and 10
|
Submitted to the IEEE Transactions on Information Theory, May 2010 To
be presented at the ACCT 2010
| null |
10.1109/TIT.2011.2162264
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
All codes with minimum distance 8 and codimension up to 14 and all codes with
minimum distance 10 and codimension up to 18 are classified. Nonexistence of
codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new
exact bounds for binary linear codes. Primarily two algorithms considering the
dual codes are used, namely extension of dual codes with a proper coordinate,
and a fast algorithm for finding a maximum clique in a graph, which is modified
to find a maximum set of vectors with the right dependency structure.
|
[
{
"version": "v1",
"created": "Tue, 1 Jun 2010 10:57:05 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Bouyukliev",
"Iliya",
""
],
[
"Jakobsson",
"Erik",
""
]
] |
new_dataset
| 0.998556 |
1008.3196
|
Amitav Mukherjee
|
Don Torrieri, Amitav Mukherjee, Hyuck Kwon
|
Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot
Symbols
|
To appear, IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2010.06.090814
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe direct-sequence code-division multiple-access
(DS-CDMA) systems with quadriphase-shift keying in which channel estimation,
coherent demodulation, and decoding are iteratively performed without the use
of any training or pilot symbols. An expectation-maximization
channel-estimation algorithm for the fading amplitude, phase, and the
interference power spectral density (PSD) due to the combined interference and
thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate
codes. After initial estimates of the fading amplitude, phase, and interference
PSD are obtained from the received symbols, subsequent values of these
parameters are iteratively updated by using the soft feedback from the channel
decoder. The updated estimates are combined with the received symbols and
iteratively passed to the decoder. The elimination of pilot symbols simplifies
the system design and allows either an enhanced information throughput, an
improved bit error rate, or greater spectral efficiency. The interference-PSD
estimation enables DS-CDMA systems to significantly suppress interference.
|
[
{
"version": "v1",
"created": "Thu, 19 Aug 2010 02:07:52 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Torrieri",
"Don",
""
],
[
"Mukherjee",
"Amitav",
""
],
[
"Kwon",
"Hyuck",
""
]
] |
new_dataset
| 0.999188 |
1008.4463
|
Laura Giarr\'e
|
I. Tinnirello, L. Giarr\'e, G. Neglia
|
MAC design for WiFi infrastructure networks: a game-theoretic approach
|
under review on IEEE Transaction on wireless communications
| null |
10.1109/TWC.2011.062011.100193
| null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In WiFi networks, mobile nodes compete for accessing a shared channel by
means of a random access protocol called Distributed Coordination Function
(DCF). Although this protocol is in principle fair, since all the stations have
the same probability to transmit on the channel, it has been shown that unfair
behaviors may emerge in actual networking scenarios because of non-standard
configurations of the nodes. Due to the proliferation of open source drivers
and programmable cards, enabling an easy customization of the channel access
policies, we propose a game-theoretic analysis of random access schemes.
Assuming that each node is rational and implements a best response strategy, we
show that efficient equilibria conditions can be reached when stations are
interested in both uploading and downloading traffic. More interesting, these
equilibria are reached when all the stations play the same strategy, thus
guaranteeing a fair resource sharing. When stations are interested in upload
traffic only, we also propose a mechanism design, based on an artificial
dropping of layer-2 acknowledgments, to force desired equilibria. Finally, we
propose and evaluate some simple DCF extensions for practically implementing
our theoretical findings.
|
[
{
"version": "v1",
"created": "Thu, 26 Aug 2010 09:41:43 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Tinnirello",
"I.",
""
],
[
"Giarré",
"L.",
""
],
[
"Neglia",
"G.",
""
]
] |
new_dataset
| 0.954921 |
1009.3041
|
Chan Wong Wong
|
Chan Wong Wong, Tan F. Wong, John M.Shea
|
Secret Sharing LDPC Codes for the BPSK-constrained Gaussian Wiretap
Channel
|
submitted to IEEE Trans. on Information Forensics and Security,
special issues on using the physical layer for securing the next generation
of communication systems
| null |
10.1109/TIFS.2011.2139208
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of secret sharing over the Gaussian wiretap channel is
considered. A source and a destination intend to share secret information over
a Gaussian channel in the presence of a wiretapper who observes the
transmission through another Gaussian channel. Two constraints are imposed on
the source-to-destination channel; namely, the source can transmit only binary
phase shift keyed (BPSK) symbols, and symbol-by-symbol hard-decision
quantization is applied to the received symbols of the destination. An
error-free public channel is also available for the source and destination to
exchange messages in order to help the secret sharing process. The wiretapper
can perfectly observe all messages in the public channel. It is shown that a
secret sharing scheme that employs a random ensemble of regular low density
parity check (LDPC) codes can achieve the key capacity of the BPSK-constrained
Gaussian wiretap channel asymptotically with increasing block length. To
accommodate practical constraints of finite block length and limited decoding
complexity, fixed irregular LDPC codes are also designed to replace the regular
LDPC code ensemble in the proposed secret sharing scheme.
|
[
{
"version": "v1",
"created": "Wed, 15 Sep 2010 21:16:58 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Oct 2010 15:22:42 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Jan 2011 03:51:00 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Wong",
"Chan Wong",
""
],
[
"Wong",
"Tan F.",
""
],
[
"Shea",
"John M.",
""
]
] |
new_dataset
| 0.997291 |
1011.3272
|
Tian Peng Ren
|
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Erry Gunawan and Er Yang
Zhang
|
Group-Decodable Space-Time Block Codes with Code Rate > 1
|
Accepted by IEEE Trans. Commun., including 25 pages, 6 figures and 2
tables
| null |
10.1109/TCOMM.2011.020811.090663
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-rate space-time block codes (STBC with code rate > 1) in multi-input
multi-output (MIMO) systems are able to provide both spatial multiplexing gain
and diversity gain, but have high maximum likelihood (ML) decoding complexity.
Since group-decodable (quasi-orthogonal) code structure can reduce the decoding
complexity, we present in this paper systematic methods to construct
group-decodable high-rate STBC with full symbol-wise diversity gain for
arbitrary transmit antenna number and code length. We show that the proposed
group-decodable STBC can achieve high code rate that increases almost linearly
with the transmit antenna number, and the slope of this near-linear dependence
increases with the code length. Comparisons with existing low-rate and
high-rate codes (such as orthogonal STBC and algebraic STBC) are conducted to
show the decoding complexity reduction and good code performance achieved by
the proposed codes.
|
[
{
"version": "v1",
"created": "Mon, 15 Nov 2010 00:34:17 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Nov 2010 12:57:45 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ren",
"Tian Peng",
""
],
[
"Guan",
"Yong Liang",
""
],
[
"Yuen",
"Chau",
""
],
[
"Gunawan",
"Erry",
""
],
[
"Zhang",
"Er Yang",
""
]
] |
new_dataset
| 0.989588 |
1102.2516
|
Enrico Paolini
|
Enrico Paolini, Gianluigi Liva, Marco Chiani
|
High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA
|
6 pages, 2 figures. To be presented at IEEE ICC 2011
| null |
10.1109/icc.2011.5962871
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random
access scheme to the MAC frame. In CSA, the burst a generic user wishes to
transmit in the MAC frame is first split into segments, and these segments are
then encoded through a local a packet-oriented code prior to transmission. On
the receiver side, iterative interference cancellation combined with decoding
of the local code is performed to recover from collisions. The new scheme
generalizes the previously proposed irregular repetition slotted ALOHA (IRSA)
technique, based on a simple repetition of the users' bursts. An interpretation
of the CSA interference cancellation process as an iterative erasure decoding
process over a sparse bipartite graph is identified, and the corresponding
density evolution equations derived. Based on these equations, asymptotically
optimal CSA schemes are designed for several rates and their performance for a
finite number of users investigated through simulation and compared to IRSA
competitors. Throughputs as high as 0.8 are demonstrated. The new scheme turns
out to be a good candidate in contexts where power efficiency is required.
|
[
{
"version": "v1",
"created": "Sat, 12 Feb 2011 14:44:12 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Paolini",
"Enrico",
""
],
[
"Liva",
"Gianluigi",
""
],
[
"Chiani",
"Marco",
""
]
] |
new_dataset
| 0.991047 |
1104.0430
|
Peyman Razaghi
|
Peyman Razaghi, Song Nam Hong. Lei Zhou, Wei Yu, and Giuseppe Caire
|
Two Birds and One Stone: Gaussian Interference Channel with a Shared
Out-of-Band Relay of Limited Rate
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2013.2251413
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The two-user Gaussian interference channel with a shared out-of-band relay is
considered. The relay observes a linear combination of the source signals and
broadcasts a common message to the two destinations, through a perfect link of
fixed limited rate $R_0$ bits per channel use. The out-of-band nature of the
relay is reflected by the fact that the common relay message does not interfere
with the received signal at the two destinations. A general achievable rate is
established, along with upper bounds on the capacity region for the Gaussian
case. For $R_0$ values below a certain threshold, which depends on channel
parameters, the capacity region of this channel is determined in this paper to
within a constant gap of $\Delta=1.95$ bits. We identify interference regimes
where a two-for-one gain in achievable rates is possible for every bit relayed,
up to a constant approximation error. Instrumental to these results is a
carefully-designed quantize-and-forward type of relay strategy along with a
joint decoding scheme employed at destination ends. Further, we also study
successive decoding strategies with optimal decoding order (corresponding to
the order at which common, private, and relay messages are decoded), and show
that successive decoding also achieves two-for-one gains asymptotically in
regimes where a two-for-one gain is achievable by joint decoding; yet,
successive decoding produces unbounded loss asymptotically when compared to
joint decoding, in general.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2011 22:01:30 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Nov 2012 10:40:58 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Razaghi",
"Peyman",
""
],
[
"Zhou",
"Song Nam Hong. Lei",
""
],
[
"Yu",
"Wei",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.995244 |
1107.4922
|
Marco Di Renzo
|
Marco Di Renzo, Dario De Leonardis, Fabio Graziosi, Harald Haas
|
On the Performance of Space Shift Keying (SSK) Modulation with Imperfect
Channel Knowledge
|
IEEE GLOBECOM 2011 (to appear)
| null |
10.1109/GLOCOM.2011.6133562
| null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the sensitivity and robustness of Space Shift Keying
(SSK) modulation to imperfect channel knowledge at the receiver. Unlike the
common widespread belief, we show that SSK modulation is more robust to
imperfect channel knowledge than other state-of-the-art transmission
technologies, and only few training pilots are needed to get reliable enough
channel estimates for data detection. More precisely, we focus our attention on
the so-called Time-Orthogonal-Signal-Design (TOSD-) SSK modulation scheme,
which is an improved version of SSK modulation offering transmit-diversity
gains, and provide the following contributions: i) we develop a closed-form
analytical framework to compute the Average Bit Error Probability (ABEP) of a
mismatched detector for TOSD-SSK modulation, which can be used for arbitrary
transmit-antenna, receive-antenna, channel fading, and training pilots; ii) we
perform a comparative study of the performance of TOSD-SSK modulation and the
Alamouti code under the same imperfect channel knowledge, and show that
TOSD-SSK modulation is more robust to channel estimation errors; iii) we point
out that only few pilot pulses are required to get performance very close to
the perfect channel knowledge lower-bound; and iv) we verify that transmit- and
receive-diversity gains of TOSD-SSK modulation are preserved even for a
mismatched receiver.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2011 12:33:25 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Di Renzo",
"Marco",
""
],
[
"De Leonardis",
"Dario",
""
],
[
"Graziosi",
"Fabio",
""
],
[
"Haas",
"Harald",
""
]
] |
new_dataset
| 0.978265 |
1202.0463
|
Walid Saad
|
Walid Saad, Zhu Han, Tamer Ba\c{s}ar, M\'erouane Debbah, and Are
Hj{\o}rungnes
|
Network Formation Games Among Relay Stations in Next Generation Wireless
Networks
|
IEEE Transactions on Communications, vol. 59, no. 9, pp. 2528-2542,
September 2011
|
IEEE Transactions on Communications, vol. 59, no. 9, pp.
2528-2542, September 2011
|
10.1109/TCOMM.2011.062311.100046
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of relay station (RS) nodes is a key feature in next
generation wireless networks such as 3GPP's long term evolution advanced
(LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper
presents, using game theory, a novel approach for the formation of the tree
architecture that connects the RSs and their serving base station in the
\emph{uplink} of the next generation wireless multi-hop systems. Unlike
existing literature which mainly focused on performance analysis, we propose a
distributed algorithm for studying the \emph{structure} and \emph{dynamics} of
the network. We formulate a network formation game among the RSs whereby each
RS aims to maximize a cross-layer utility function that takes into account the
benefit from cooperative transmission, in terms of reduced bit error rate, and
the costs in terms of the delay due to multi-hop transmission. For forming the
tree structure, a distributed myopic algorithm is devised. Using the proposed
algorithm, each RS can individually select the path that connects it to the BS
through other RSs while optimizing its utility. We show the convergence of the
algorithm into a Nash tree network, and we study how the RSs can adapt the
network's topology to environmental changes such as mobility or the deployment
of new mobile stations. Simulation results show that the proposed algorithm
presents significant gains in terms of average utility per mobile station which
is at least 17.1% better relatively to the case with no RSs and reaches up to
40.3% improvement compared to a nearest neighbor algorithm (for a network with
10 RSs). The results also show that the average number of hops does not exceed
3 even for a network with up to 25 RSs.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2012 15:32:46 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Saad",
"Walid",
""
],
[
"Han",
"Zhu",
""
],
[
"Başar",
"Tamer",
""
],
[
"Debbah",
"Mérouane",
""
],
[
"Hjørungnes",
"Are",
""
]
] |
new_dataset
| 0.98865 |
1204.0034
|
MinJi Kim
|
Giuliano Giacaglia, Xiaomeng Shi, MinJi Kim, Daniel E. Lucani, and
Muriel Medard
|
Systematic Network Coding with the Aid of a Full-Duplex Relay
|
6 pages, 5 figures, submitted to IEEE Globecom
| null |
10.1109/ICC.2013.6655057
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A characterization of systematic network coding over multi-hop wireless
networks is key towards understanding the trade-off between complexity and
delay performance of networks that preserve the systematic structure. This
paper studies the case of a relay channel, where the source's objective is to
deliver a given number of data packets to a receiver with the aid of a relay.
The source broadcasts to both the receiver and the relay using one frequency,
while the relay uses another frequency for transmissions to the receiver,
allowing for a full-duplex operation of the relay. We analyze the decoding
complexity and delay performance of two types of relays: one that preserves the
systematic structure of the code from the source; another that does not. A
systematic relay forwards uncoded packets upon reception, but transmits coded
packets to the receiver after receiving the first coded packet from the source.
On the other hand, a non-systematic relay always transmits linear combinations
of previously received packets. We compare the performance of these two
alternatives by analytically characterizing the expected transmission
completion time as well as the number of uncoded packets forwarded by the
relay. Our numerical results show that, for a poor channel between the source
and the receiver, preserving the systematic structure at the relay (i) allows a
significant increase in the number of uncoded packets received by the receiver,
thus reducing the decoding complexity, and (ii) preserves close to optimal
delay performance.
|
[
{
"version": "v1",
"created": "Fri, 30 Mar 2012 21:41:32 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Giacaglia",
"Giuliano",
""
],
[
"Shi",
"Xiaomeng",
""
],
[
"Kim",
"MinJi",
""
],
[
"Lucani",
"Daniel E.",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.998972 |
1204.2435
|
Mark Flanagan
|
Mark F. Flanagan, Enrico Paolini, Marco Chiani and Marc P. C.
Fossorier
|
Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact
Evaluation
|
17 pages, 6 figures. To appear in IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2013.2262494
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper analyzes the asymptotic exponent of the weight spectrum for
irregular doubly-generalized LDPC (D-GLDPC) codes. In the process, an efficient
numerical technique for its evaluation is presented, involving the solution of
a 4 x 4 system of polynomial equations. The expression is consistent with
previous results, including the case where the normalized weight or stopping
set size tends to zero. The spectral shape is shown to admit a particularly
simple form in the special case where all variable nodes are repetition codes
of the same degree, a case which includes Tanner codes; for this case it is
also shown how certain symmetry properties of the local weight distribution at
the CNs induce a symmetry in the overall weight spectral shape function.
Finally, using these new results, weight and stopping set size spectral shapes
are evaluated for some example generalized and doubly-generalized LDPC code
ensembles.
|
[
{
"version": "v1",
"created": "Wed, 11 Apr 2012 13:02:27 GMT"
},
{
"version": "v2",
"created": "Mon, 13 May 2013 13:10:19 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Flanagan",
"Mark F.",
""
],
[
"Paolini",
"Enrico",
""
],
[
"Chiani",
"Marco",
""
],
[
"Fossorier",
"Marc P. C.",
""
]
] |
new_dataset
| 0.998225 |
1205.6361
|
Martin Monperrus
|
Markus Kimmig, Martin Monperrus (INRIA Lille - Nord Europe, LIFL),
Mira Mezini
|
Querying Source Code with Natural Language
| null |
26th IEEE/ACM International Conference On Automated Software
Engineering (2011) 376-379
|
10.1109/ASE.2011.6100076
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One common task of developing or maintaining software is searching the source
code for information like specific method calls or write accesses to certain
fields. This kind of information is required to correctly implement new
features and to solve bugs. This paper presents an approach for querying source
code with natural language.
|
[
{
"version": "v1",
"created": "Tue, 29 May 2012 13:38:15 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Kimmig",
"Markus",
"",
"INRIA Lille - Nord Europe, LIFL"
],
[
"Monperrus",
"Martin",
"",
"INRIA Lille - Nord Europe, LIFL"
],
[
"Mezini",
"Mira",
""
]
] |
new_dataset
| 0.965494 |
1206.4370
|
Cunsheng Ding
|
Cunsheng Ding
|
Cyclic Codes from Dickson Polynomials
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to their efficient encoding and decoding algorithms cyclic codes, a
subclass of linear codes, have applications in consumer electronics, data
storage systems, and communication systems. In this paper, Dickson polynomials
of the first and second kind over finite fields are employed to construct a
number of classes of cyclic codes. Lower bounds on the minimum weight of some
classes of the cyclic codes are developed. The minimum weights of some other
classes of the codes constructed in this paper are determined. The dimensions
of the codes obtained in this paper are flexible. Most of the codes presented
in this paper are optimal or almost optimal in the sense that they meet some
bound on linear codes. Over ninety cyclic codes of this paper should be used to
update the current database of tables of best linear codes known. Among them
sixty are optimal in the sense that they meet some bound on linear codes and
the rest are cyclic codes having the same parameters as the best linear code in
the current database maintained at http://www.codetables.de/.
|
[
{
"version": "v1",
"created": "Wed, 20 Jun 2012 02:25:11 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 07:34:50 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
]
] |
new_dataset
| 0.999436 |
1208.1350
|
Yi Fang
|
Yi Fang, Jing Xu, Lin Wang, and Guanrong Chen
|
Performance of MIMO Relay DCSK-CD Systems over Nakagami Fading Channels
|
11 pages, 15 figures. IEEE Transactions on Circuits and System-I
| null |
10.1109/TCSI.2012.2215755
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multi-access multiple-input multiple-output (MIMO) relay differential chaos
shift keying cooperative diversity (DCSK-CD) system is proposed in this paper
as a comprehensive cooperation scheme, in which the relay and destination both
employ multiple antennas to strengthen the robustness against signal fading in
a wireless network. It is shown that, with spatial diversity gains, the bit
error rate (BER) performance of the proposed system is remarkably better than
the conventional DCSK non-cooperation (DCSK-NC) and DCSK cooperative
communication (DCSK-CC) systems. Moreover, the exact BER and close-form
expressions of the proposed system are derived over Nakagami fading channels
through the moment generating function (MGF), which is shown to be highly
consistent with the simulation results. Meanwhile, this paper illustrates a
trade-off between the performance and the complexity, and provides a threshold
for the number of relay antennas keeping the user consumed energy constant. Due
to the above-mentioned advantages, the proposed system stands out as a good
candidate or alternative for energy-constrained wireless communications based
on chaotic modulation, especially for low-power and low-cost wireless personal
area networks (WPANs).
|
[
{
"version": "v1",
"created": "Tue, 7 Aug 2012 07:18:51 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Fang",
"Yi",
""
],
[
"Xu",
"Jing",
""
],
[
"Wang",
"Lin",
""
],
[
"Chen",
"Guanrong",
""
]
] |
new_dataset
| 0.998486 |
1209.5513
|
Jun Zhang
|
Jun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, and Kai-Kit Wong
|
On Capacity of Large-Scale MIMO Multiple Access Channels with
Distributed Sets of Correlated Antennas
|
52 pages, 6 figures. Accepted by the IEEE Journal on Selected Areas
in Communications
| null |
10.1109/JSAC.2013.130203
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a deterministic equivalent of ergodic sum rate and an
algorithm for evaluating the capacity-achieving input covariance matrices for
the uplink large-scale multiple-input multiple-output (MIMO) antenna channels
are proposed. We consider a large-scale MIMO system consisting of multiple
users and one base station with several distributed antenna sets. Each link
between a user and an antenna set forms a two-sided spatially correlated MIMO
channel with line-of-sight (LOS) components. Our derivations are based on novel
techniques from large dimensional random matrix theory (RMT) under the
assumption that the numbers of antennas at the terminals approach to infinity
with a fixed ratio. The deterministic equivalent results (the deterministic
equivalent of ergodic sum rate and the capacity-achieving input covariance
matrices) are easy to compute and shown to be accurate for realistic system
dimensions. In addition, they are shown to be invariant to several types of
fading distribution.
|
[
{
"version": "v1",
"created": "Tue, 25 Sep 2012 06:47:02 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Sep 2012 12:38:30 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zhang",
"Jun",
""
],
[
"Wen",
"Chao-Kai",
""
],
[
"Jin",
"Shi",
""
],
[
"Gao",
"Xiqi",
""
],
[
"Wong",
"Kai-Kit",
""
]
] |
new_dataset
| 0.984792 |
1211.3828
|
Hosung Park
|
Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin
|
Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on
Cyclic Difference Families
|
14 pages, submitted to IEEE Transactions on Communications on
November 2012
| null |
10.1109/TCOMM.2013.070213.120879
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a high-rate case, it is difficult to randomly construct good low-density
parity-check (LDPC) codes of short and moderate lengths because their Tanner
graphs are prone to making short cycles. Also, the existing high-rate
quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code
parameters. In this paper, a new construction method of high-rate regular QC
LDPC codes with parity-check matrices consisting of a single row of circulants
with the column-weight 3 or 4 is proposed based on special classes of cyclic
difference families. The proposed QC LDPC codes can be constructed for various
code rates and lengths including the minimum achievable length for a given
design rate, which cannot be achieved by the existing high-rate QC LDPC codes.
It is observed that the parity-check matrices of the proposed QC LDPC codes
have full rank. It is shown that the error correcting performance of the
proposed QC LDPC codes of short and moderate lengths is almost the same as that
of the existing ones through numerical analysis.
|
[
{
"version": "v1",
"created": "Fri, 16 Nov 2012 08:41:11 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Park",
"Hosung",
""
],
[
"Hong",
"Seokbeom",
""
],
[
"No",
"Jong-Seon",
""
],
[
"Shin",
"Dong-Joon",
""
]
] |
new_dataset
| 0.954658 |
1211.4940
|
Muhammad Nazmul Islam
|
Muhammad Nazmul Islam, Byoung-Jo J. Kim, Paul Henry and Eric Rozner
|
A Wireless Channel Sounding System for Rapid Propagation Measurements
|
Submitted to ICC 2013 (2012 AT\&T Intellectual Property. All rights
reserved.)
|
IEEE International Conference on Communications 2013, page
5720-5725
|
10.1109/ICC.2013.6655507
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless systems are getting deployed in many new environments with different
antenna heights, frequency bands and multipath conditions. This has led to an
increasing demand for more channel measurements to understand wireless
propagation in specific environments and assist deployment engineering. We
design and implement a rapid wireless channel sounding system, using the
Universal Software Radio Peripheral (USRP) and GNU Radio software, to address
these demands. Our design measures channel propagation characteristics
simultaneously from multiple transmitter locations. The system consists of
multiple battery-powered transmitters and receivers. Therefore, we can set-up
the channel sounder rapidly at a field location and measure expeditiously by
analyzing different transmitters signals during a single walk or drive through
the environment. Our design can be used for both indoor and outdoor channel
measurements in the frequency range of 1 MHz to 6 GHz. We expect that the
proposed approach, with a few further refinements, can transform the task of
propagation measurement as a routine part of day-to-day wireless network
engineering.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2012 05:32:18 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Islam",
"Muhammad Nazmul",
""
],
[
"Kim",
"Byoung-Jo J.",
""
],
[
"Henry",
"Paul",
""
],
[
"Rozner",
"Eric",
""
]
] |
new_dataset
| 0.999602 |
1212.4626
|
Lior Dikstein
|
Lior Dikstein, Haim H. Permuter and Shlomo Shamai
|
MAC with Action-Dependent State Information at One Encoder
|
1. Parts of this paper appeared in the IEEE International Symposium
on Information Theory (ISIT 2012),Cambridge, MA, US, July 2012 and at the
IEEE 27th Convention of Electrical and Electronics Engineers in Israel (IEEEI
2012), Nov. 2012. 2. This work has been supported by the CORNET Consortium
Israel Ministry for Industry and Commerce
| null |
10.1109/ISIT.2012.6283564
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Problems dealing with the ability to take an action that affects the states
of state-dependent communication channels are of timely interest and
importance. Therefore, we extend the study of action-dependent channels, which
until now focused on point-to-point models, to multiple-access channels (MAC).
In this paper, we consider a two-user, state-dependent MAC, in which one of the
encoders, called the informed encoder, is allowed to take an action that
affects the formation of the channel states. Two independent messages are to be
sent through the channel: a common message known to both encoders and a private
message known only to the informed encoder. In addition, the informed encoder
has access to the sequence of channel states in a non-causal manner. Our
framework generalizes previously evaluated settings of state dependent
point-to-point channels with actions and MACs with common messages. We derive a
single letter characterization of the capacity region for this setting. Using
this general result, we obtain and compute the capacity region for the Gaussian
action-dependent MAC. The unique methods used in solving the Gaussian case are
then applied to obtain the capacity of the Gaussian action-dependent
point-to-point channel; a problem was left open until this work. Finally, we
establish some dualities between action-dependent channel coding and source
coding problems. Specifically, we obtain a duality between the considered MAC
setting and the rate distortion model known as "Successive Refinement with
Actions". This is done by developing a set of simple duality principles that
enable us to successfully evaluate the outcome of one problem given the other.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2012 11:41:03 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Dikstein",
"Lior",
""
],
[
"Permuter",
"Haim H.",
""
],
[
"Shamai",
"Shlomo",
""
]
] |
new_dataset
| 0.989907 |
1302.4201
|
Stefan Certic
|
Stefan Certic
|
The Future of Mobile Security
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/4.0/
|
Mobile devices are more than just phones, they are a lifeline to the outdoor
world, entertainment platform, GPS system, a little black book and a shopping
and banking tool. What is not well known is that these devices are also
gateways. Mobile devices can be used by a hacker as an access point into many
other aspects of your digital life as well the lives of others in your network,
making mobile security about more than just protecting your phone. This is an
overview of technologies supporting mobile data cryptography and two-step
protection mechanisms that may be used to secure online transactions and user
authentication.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2013 09:48:05 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 01:49:39 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Certic",
"Stefan",
""
]
] |
new_dataset
| 0.998324 |
1302.4516
|
Aria Nosratinia
|
Thuy Van Nguyen, Aria Nosratinia, and Dariush Divsalar
|
Bilayer Protograph Codes for Half-Duplex Relay Channels
|
Accepted in IEEE Trans. Wireless Comm
| null |
10.1109/ISIT.2010.5513451
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite encouraging advances in the design of relay codes, several important
challenges remain. Many of the existing LDPC relay codes are tightly optimized
for fixed channel conditions and not easily adapted without extensive
re-optimization of the code. Some have high encoding complexity and some need
long block lengths to approach capacity. This paper presents a high-performance
protograph-based LDPC coding scheme for the half-duplex relay channel that
addresses simultaneously several important issues: structured coding that
permits easy design, low encoding complexity, embedded structure for convenient
adaptation to various channel conditions, and performance close to capacity
with a reasonable block length. The application of the coding structure to
multi-relay networks is demonstrated. Finally, a simple new methodology for
evaluating the end-to-end error performance of relay coding systems is
developed and used to highlight the performance of the proposed codes.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2013 04:54:35 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Van Nguyen",
"Thuy",
""
],
[
"Nosratinia",
"Aria",
""
],
[
"Divsalar",
"Dariush",
""
]
] |
new_dataset
| 0.999792 |
1303.1201
|
Hien Ngo Quoc
|
Himal A. Suraweera, Hien Quoc Ngo, Trung Q. Duong, Chau Yuen, Erik G.
Larsson
|
Multi-Pair Amplify-and-Forward Relaying with Very Large Antenna Arrays
|
IEEE International Conference on Communicatons (ICC), Budapest,
Hungary, June 2013
| null |
10.1109/ICC.2013.6655302
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a multi-pair relay channel where multiple sources simultaneously
communicate with destinations using a relay. Each source or destination has
only a single antenna, while the relay is equipped with a very large antenna
array. We investigate the power efficiency of this system when maximum ratio
combining/maximal ratio transmission (MRC/MRT) or zero-forcing (ZF) processing
is used at the relay. Using a very large array, the transmit power of each
source or relay (or both) can be made inversely proportional to the number of
relay antennas while maintaining a given quality-of-service. At the same time,
the achievable sum rate can be increased by a factor of the number of
source-destination pairs. We show that when the number of antennas grows to
infinity, the asymptotic achievable rates of MRC/MRT and ZF are the same if we
scale the power at the sources. Depending on the large scale fading effect,
MRC/MRT can outperform ZF or vice versa if we scale the power at the relay.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 22:11:50 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Suraweera",
"Himal A.",
""
],
[
"Ngo",
"Hien Quoc",
""
],
[
"Duong",
"Trung Q.",
""
],
[
"Yuen",
"Chau",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.998486 |
1304.6690
|
Ove Edfors
|
Erik G. Larsson, Ove Edfors, Fredrik Tufvesson and Thomas L. Marzetta
|
Massive MIMO for Next Generation Wireless Systems
|
Final manuscript, to appear in IEEE Communications Magazine
|
IEEE Communications Magazine, Vol. 52, No. 2, pp. 186-195, Feb.
2014
|
10.1109/MCOM.2014.6736761
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-user Multiple-Input Multiple-Output (MIMO) offers big advantages over
conventional point-to-point MIMO: it works with cheap single-antenna terminals,
a rich scattering environment is not required, and resource allocation is
simplified because every active terminal utilizes all of the time-frequency
bins. However, multi-user MIMO, as originally envisioned with roughly equal
numbers of service-antennas and terminals and frequency division duplex
operation, is not a scalable technology. Massive MIMO (also known as
"Large-Scale Antenna Systems", "Very Large MIMO", "Hyper MIMO", "Full-Dimension
MIMO" & "ARGOS") makes a clean break with current practice through the use of a
large excess of service-antennas over active terminals and time division duplex
operation. Extra antennas help by focusing energy into ever-smaller regions of
space to bring huge improvements in throughput and radiated energy efficiency.
Other benefits of massive MIMO include the extensive use of inexpensive
low-power components, reduced latency, simplification of the media access
control (MAC) layer, and robustness to intentional jamming. The anticipated
throughput depend on the propagation environment providing asymptotically
orthogonal channels to the terminals, but so far experiments have not disclosed
any limitations in this regard. While massive MIMO renders many traditional
research problems irrelevant, it uncovers entirely new problems that urgently
need attention: the challenge of making many low-cost low-precision components
that work effectively together, acquisition and synchronization for
newly-joined terminals, the exploitation of extra degrees of freedom provided
by the excess of service-antennas, reducing internal power consumption to
achieve total energy efficiency reductions, and finding new deployment
scenarios. This paper presents an overview of the massive MIMO concept and
contemporary research.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 18:25:56 GMT"
},
{
"version": "v2",
"created": "Mon, 20 May 2013 20:22:58 GMT"
},
{
"version": "v3",
"created": "Tue, 21 Jan 2014 21:09:46 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Larsson",
"Erik G.",
""
],
[
"Edfors",
"Ove",
""
],
[
"Tufvesson",
"Fredrik",
""
],
[
"Marzetta",
"Thomas L.",
""
]
] |
new_dataset
| 0.983886 |
1305.0585
|
Changhong Zhao
|
Changhong Zhao, Ufuk Topcu, Na Li and Steven Low
|
Design and Stability of Load-Side Primary Frequency Control in Power
Systems
|
14 pages, 13 figures. To appear in IEEE Transactions on Automatic
Control
| null |
10.1109/TAC.2014.2298140
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a systematic method to design ubiquitous continuous fast-acting
distributed load control for primary frequency regulation in power networks, by
formulating an optimal load control (OLC) problem where the objective is to
minimize the aggregate cost of tracking an operating point subject to power
balance over the network. We prove that the swing dynamics and the branch power
flows, coupled with frequency-based load control, serve as a distributed
primal-dual algorithm to solve OLC. We establish the global asymptotic
stability of a multimachine network under such type of load-side primary
frequency control. These results imply that the local frequency deviations at
each bus convey exactly the right information about the global power imbalance
for the loads to make individual decisions that turn out to be globally
optimal. Simulations confirm that the proposed algorithm can rebalance power
and resynchronize bus frequencies after a disturbance with significantly
improved transient performance.
|
[
{
"version": "v1",
"created": "Thu, 2 May 2013 21:53:17 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Dec 2013 08:46:29 GMT"
},
{
"version": "v3",
"created": "Wed, 4 Dec 2013 21:03:57 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zhao",
"Changhong",
""
],
[
"Topcu",
"Ufuk",
""
],
[
"Li",
"Na",
""
],
[
"Low",
"Steven",
""
]
] |
new_dataset
| 0.953025 |
1308.0037
|
Ryan Williams
|
Ryan K. Williams, Andrea Gasparri, and Bhaskar Krishnamachari
|
Route Swarm: Wireless Network Optimization through Mobility
|
9 pages, 4 figures, submitted to the IEEE International Conference on
Intelligent Robots and Systems (IROS) 2014
| null |
10.1109/IROS.2014.6943092
| null |
cs.SY cs.MA cs.NI cs.RO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we demonstrate a novel hybrid architecture for coordinating
networked robots in sensing and information routing applications. The proposed
INformation and Sensing driven PhysIcally REconfigurable robotic network
(INSPIRE), consists of a Physical Control Plane (PCP) which commands agent
position, and an Information Control Plane (ICP) which regulates information
flow towards communication/sensing objectives. We describe an instantiation
where a mobile robotic network is dynamically reconfigured to ensure high
quality routes between static wireless nodes, which act as source/destination
pairs for information flow. The ICP commands the robots towards evenly
distributed inter-flow allocations, with intra-flow configurations that
maximize route quality. The PCP then guides the robots via potential-based
control to reconfigure according to ICP commands. This formulation, deemed
Route Swarm, decouples information flow and physical control, generating a
feedback between routing and sensing needs and robotic configuration. We
demonstrate our propositions through simulation under a realistic wireless
network regime.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 20:47:14 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Sep 2013 21:16:47 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Feb 2014 02:24:13 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Williams",
"Ryan K.",
""
],
[
"Gasparri",
"Andrea",
""
],
[
"Krishnamachari",
"Bhaskar",
""
]
] |
new_dataset
| 0.999064 |
1309.3841
|
Srinjoy Ganguly Mr.
|
Arpita Chakraborty, Srinjoy Ganguly, Mrinal Kanti Naskar and Anupam
Karmakar
|
A Trust Based Fuzzy Algorithm for Congestion Control in Wireless
Multimedia Sensor Networks (TFCC)
|
6 pages, 5 figures, conference paper
|
Procs. of the IEEE 2013 International Conference on Informatics,
Electronics and Vision (ICIEV 2013), pp.XX-XX, Dhaka, Bangladesh, May 17-18,
(2013)
|
10.1109/ICIEV.2013.6572553
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network congestion has become a critical issue for resource constrained
Wireless Sensor Networks (WSNs), especially for Wireless Multimedia Sensor
Networks (WMSNs)where large volume of multimedia data is transmitted through
the network. If the traffic load is greater than the available capacity of the
sensor network, congestion occurs and it causes buffer overflow, packet drop,
deterioration of network throughput and quality of service (QoS). Again, the
faulty nodes of the network also aggravate congestion by diffusing useless
packets or retransmitting the same packet several times. This results in the
wastage of energy and decrease in network lifetime. To address this challenge,
a new congestion control algorithm is proposed in which the faulty nodes are
identified and blocked from data communication by using the concept of trust.
The trust metric of all the nodes in the WMSN is derived by using a two-stage
Fuzzy inferencing scheme. The traffic flow from source to sink is optimized by
implementing the Link State Routing Protocol. The congestion of the sensor
nodes is controlled by regulating the rate of traffic flow on the basis of the
priority of the traffic. Finally we compare our protocol with other existing
congestion control protocols to show the merit of the work.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 07:42:02 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Nov 2013 23:12:25 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chakraborty",
"Arpita",
""
],
[
"Ganguly",
"Srinjoy",
""
],
[
"Naskar",
"Mrinal Kanti",
""
],
[
"Karmakar",
"Anupam",
""
]
] |
new_dataset
| 0.96547 |
1309.4026
|
Zohaib Awan Mr
|
Abdellatif Zaidi, Zohaib Hassan Awan, Shlomo Shamai (Shitz), and Luc
Vandendorpe
|
Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and
Delayed CSIT
|
To Appear in IEEE Transactions on Information Forensics and Security
| null |
10.1109/TIFS.2013.2278936
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the problem of secure transmission over a two-user multi-input
multi-output (MIMO) X-channel in which channel state information is provided
with one-unit delay to both transmitters (CSIT), and each receiver feeds back
its channel output to a different transmitter. We refer to this model as MIMO
X-channel with asymmetric output feedback and delayed CSIT. The transmitters
are equipped with M-antennas each, and the receivers are equipped with
N-antennas each. For this model, accounting for both messages at each receiver,
we characterize the optimal sum secure degrees of freedom (SDoF) region. We
show that, in presence of asymmetric output feedback and delayed CSIT, the sum
SDoF region of the MIMO X-channel is same as the SDoF region of a two-user MIMO
BC with 2M-antennas at the transmitter, N-antennas at each receiver and delayed
CSIT. This result shows that, upon availability of asymmetric output feedback
and delayed CSIT, there is no performance loss in terms of sum SDoF due to the
distributed nature of the transmitters. Next, we show that this result also
holds if only output feedback is conveyed to the transmitters, but in a
symmetric manner, i.e., each receiver feeds back its output to both
transmitters and no CSIT. We also study the case in which only asymmetric
output feedback is provided to the transmitters, i.e., without CSIT, and derive
a lower bound on the sum SDoF for this model. Furthermore, we specialize our
results to the case in which there are no security constraints. In particular,
similar to the setting with security constraints, we show that the optimal sum
DoF region of the (M,M,N,N)--MIMO X-channel with asymmetric output feedback and
delayed CSIT is same as the DoF region of a two-user MIMO BC with 2M-antennas
at the transmitter, N-antennas at each receiver, and delayed CSIT. We
illustrate our results with some numerical examples.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 16:37:25 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zaidi",
"Abdellatif",
"",
"Shitz"
],
[
"Awan",
"Zohaib Hassan",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
],
[
"Vandendorpe",
"Luc",
""
]
] |
new_dataset
| 0.986475 |
1309.7163
|
Dipankar Saha
|
Dipankar Saha, Subhramita Basak, Sagar Mukherjee, C. K. Sarkar
|
A Low-Voltage, Low-Power 4-bit BCD Adder, designed using the Clock Gated
Power Gating, and the DVT Scheme
|
To appear in the proceedings of 2013 IEEE International Conference on
Signal Processing, Computing and Control (ISPCC,13)
| null |
10.1109/ISPCC.2013.6663444
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a Low-Power, Energy Efficient 4-bit Binary Coded Decimal
(BCD) adder design where the conventional 4-bit BCD adder has been modified
with the Clock Gated Power Gating Technique. Moreover, the concept of DVT
(Dual-vth) scheme has been introduced while designing the full adder blocks to
reduce the Leakage Power, as well as, to maintain the overall performance of
the entire circuit. The reported architecture of 4-bit BCD adder is designed
using 45 nm technology and it consumes 1.384 {\mu}Watt of Average Power while
operating with a frequency of 200 MHz, and a Supply Voltage (Vdd) of 1 Volt.
The results obtained from different simulation runs on SPICE, indicate the
superiority of the proposed design compared to the conventional 4-bit BCD
adder. Considering the product of Average Power and Delay, for the operating
frequency of 200 MHz, a fair 47.41 % reduction compared to the conventional
design has been achieved with this proposed scheme.
|
[
{
"version": "v1",
"created": "Fri, 27 Sep 2013 09:09:37 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Saha",
"Dipankar",
""
],
[
"Basak",
"Subhramita",
""
],
[
"Mukherjee",
"Sagar",
""
],
[
"Sarkar",
"C. K.",
""
]
] |
new_dataset
| 0.986289 |
1401.2952
|
Dawei Ying
|
Dawei Ying, Frederick W. Vook, Timothy A. Thomas, David J. Love and
Amitava Ghosh
|
Kronecker Product Correlation Model and Limited Feedback Codebook Design
in a 3D Channel Model
|
6 pages, 5 figures, to appear at IEEE ICC 2014
| null |
10.1109/ICC.2014.6884258
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A 2D antenna array introduces a new level of control and additional degrees
of freedom in multiple-input-multiple-output (MIMO) systems particularly for
the so-called "massive MIMO" systems. To accurately assess the performance
gains of these large arrays, existing azimuth-only channel models have been
extended to handle 3D channels by modeling both the elevation and azimuth
dimensions. In this paper, we study the channel correlation matrix of a generic
ray-based 3D channel model, and our analysis and simulation results demonstrate
that the 3D correlation matrix can be well approximated by a Kronecker
production of azimuth and elevation correlations. This finding lays the
theoretical support for the usage of a product codebook for reduced complexity
feedback from the receiver to the transmitter. We also present the design of a
product codebook based on Grassmannian line packing.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 19:02:23 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ying",
"Dawei",
""
],
[
"Vook",
"Frederick W.",
""
],
[
"Thomas",
"Timothy A.",
""
],
[
"Love",
"David J.",
""
],
[
"Ghosh",
"Amitava",
""
]
] |
new_dataset
| 0.992909 |
1401.3674
|
Zhili Guo
|
Zhili Guo, Yao Wang, Elza Erkip, Shivendra Panwar
|
Wireless Video Multicast with Cooperative and Incremental Transmission
of Parity Packets
|
11 pages in double-column IEEE journal style. Submitted to IEEE
JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
| null |
10.1109/TMM.2015.2438718
| null |
cs.MM cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a cooperative multicast scheme that uses Randomized
Distributed Space Time Codes (R-DSTC), along with packet level Forward Error
Correction (FEC), is studied. Instead of sending source packets and/or parity
packets through two hops using R-DSTC as proposed in our prior work, the new
scheme delivers both source packets and parity packets using only one hop.
After the source station (access point, AP) first sends all the source packets,
the AP as well as all nodes that have received all source packets together send
the parity packets using R-DSTC. As more parity packets are transmitted, more
nodes can recover all source packets and join the parity packet transmission.
The process continues until all nodes acknowledge the receipt of enough packets
for recovering the source packets. For each given node distribution, the
optimum transmission rates for source and parity packets are determined such
that the video rate that can be sustained at all nodes is maximized. This new
scheme can support significantly higher video rates, and correspondingly higher
PSNR of decoded video, than the prior approaches. Three suboptimal approaches,
which do not require full information about user distribution or the feedback,
and hence are more feasible in practice are also presented. The proposed
suboptimal scheme with only the node count information and without feedback
still outperforms our prior approach that assumes full channel information and
no feedback.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 17:08:41 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Guo",
"Zhili",
""
],
[
"Wang",
"Yao",
""
],
[
"Erkip",
"Elza",
""
],
[
"Panwar",
"Shivendra",
""
]
] |
new_dataset
| 0.994843 |
1402.7292
|
Mohammed ElBamby
|
Mohammed S. ElBamby, Mehdi Bennis, Walid Saad, Matti Latva-aho
|
Dynamic Uplink-Downlink Optimization in TDD-based Small Cell Networks
|
In the IEEE 11th International Symposium on Wireless Communication
Systems (ISWCS) 2014
| null |
10.1109/ISWCS.2014.6933488
| null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic Time-division duplex (TDD) can provide efficient and flexible
splitting of the common wireless cellular resources between uplink (UL) and
downlink (DL) users. In this paper, the UL/DL optimization problem is
formulated as a noncooperative game among the small cell base stations (SCBSs)
in which each base station aims at minimizing its total UL and DL flow delays.
To solve this game, a self-organizing UL/DL resource configuration scheme for
TDD-based small cell networks is proposed. Using the proposed scheme, an SCBS
is able to estimate and learn the UL and DL loads autonomously while optimizing
its UL/DL configuration accordingly. Simulations results show that the proposed
algorithm achieves significant gains in terms of packet throughput in case of
asymmetric UL and DL traffic loads. This gain increases as the traffic
asymmetry increases, reaching up to 97% and 200% gains relative to random and
fixed duplexing schemes respectively. Our results also show that the proposed
algorithm is well- adapted to dynamic traffic conditions and different network
sizes, and operates efficiently in case of severe cross-link interference in
which neighboring cells transmit in opposite directions.
|
[
{
"version": "v1",
"created": "Fri, 28 Feb 2014 16:02:12 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Sep 2014 12:05:05 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"ElBamby",
"Mohammed S.",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Saad",
"Walid",
""
],
[
"Latva-aho",
"Matti",
""
]
] |
new_dataset
| 0.968302 |
1404.1622
|
Ruizhi Liao
|
Ruizhi Liao, Boris Bellalta, Miquel Oliver, Zhisheng Niu
|
MU-MIMO MAC Protocols for Wireless Local Area Networks: A Survey
|
Accepted by IEEE Communications Surveys and Tutorials, 40 pages, 12
figures
| null |
10.1109/COMST.2014.2377373
| null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
As wireless devices boom, and bandwidth-hungry applications (e.g., video and
cloud uploading) get popular, today's Wireless Local Area Networks (WLANs)
become not only crowded but also stressed at throughput. Multi-user
Multiple-Input and Multiple-Output (MU-MIMO), an advanced form of MIMO, has
gained attention due to its huge potential in improving the performance of
WLANs.
This paper surveys random access based MAC protocols for MU-MIMO enabled
WLANs. It first provides background information about the evolution and the
fundamental MAC schemes of IEEE 802.11 Standards and Amendments, and then
identifies the key requirements of designing MU-MIMO MAC protocols for WLANs.
After that, the most representative MU-MIMO MAC proposals in the literature are
overviewed by benchmarking their MAC procedures and examining the key
components, such as the channel state information acquisition, de/pre-coding
and scheduling schemes. Classifications and discussions on important findings
of the surveyed MAC protocols are provided, based on which, the research
challenges for designing effective MU-MIMO MAC protocols, as well as the
envisaged MAC's role in the future heterogeneous networks, are highlighted.
|
[
{
"version": "v1",
"created": "Sun, 6 Apr 2014 21:06:07 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Nov 2014 15:59:05 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Liao",
"Ruizhi",
""
],
[
"Bellalta",
"Boris",
""
],
[
"Oliver",
"Miquel",
""
],
[
"Niu",
"Zhisheng",
""
]
] |
new_dataset
| 0.973993 |
1404.5605
|
Hosein Nikopour
|
Hosein Nikopour, Eric Yi, Alireza Bayesteh, Kelvin Au, Mark Hawryluck,
Hadi Baligh, Jianglei Ma
|
SCMA for Downlink Multiple Access of 5G Wireless Networks
|
Submitted to IEEE Globecom 2014
| null |
10.1109/GLOCOM.2014.7037423
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal
multiple-access technique which can improve spectral efficiency of wireless
radio access. With SCMA, different incoming data streams are directly mapped to
codewords of different multi-dimensional cookbooks, where each codeword
represents a spread transmission layer. Multiple SCMA layers share the same
time-frequency resources of OFDMA. The sparsity of codewords makes the
near-optimal detection feasible through iterative message passing algorithm
(MPA). Such low complexity of multi-layer detection allows excessive codeword
overloading in which the dimension of multiplexed layers exceeds the dimension
of codewords. Optimization of overloading factor along with modulation-coding
levels of layers provides a more flexible and efficient link-adaptation
mechanism. On the other hand, the signal spreading feature of SCMA can improve
link-adaptation as a result of less colored interference. In this paper a
technique is developed to enable multi-user SCMA (MU-SCMA) for downlink
wireless access. User pairing, power sharing, rate adjustment, and scheduling
algorithms are designed to improve the downlink throughput of a heavily loaded
network. The advantage of SCMA spreading for lightly loaded networks is also
evaluated.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 19:43:27 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Nikopour",
"Hosein",
""
],
[
"Yi",
"Eric",
""
],
[
"Bayesteh",
"Alireza",
""
],
[
"Au",
"Kelvin",
""
],
[
"Hawryluck",
"Mark",
""
],
[
"Baligh",
"Hadi",
""
],
[
"Ma",
"Jianglei",
""
]
] |
new_dataset
| 0.971068 |
1405.4819
|
Jun Lin
|
Jun Lin, Chenrong Xiong and Zhiyuan Yan
|
A Reduced Latency List Decoding Algorithm for Polar Codes
|
7 pages, accepted by 2014 IEEE International Workshop on Signal
Processing Systems (SiPS)
| null |
10.1109/SiPS.2014.6986062
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long polar codes can achieve the capacity of arbitrary binary-input discrete
memoryless channels under a low complexity successive cancelation (SC) decoding
algorithm. But for polar codes with short and moderate code length, the
decoding performance of the SC decoding algorithm is inferior. The cyclic
redundancy check (CRC) aided successive cancelation list (SCL) decoding
algorithm has better error performance than the SC decoding algorithm for short
or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm
still suffer from long decoding latency. In this paper, a reduced latency list
decoding (RLLD) algorithm for polar codes is proposed. For the proposed RLLD
algorithm, all rate-0 nodes and part of rate-1 nodes are decoded instantly
without traversing the corresponding subtree. A list maximum-likelihood
decoding (LMLD) algorithm is proposed to decode the maximum likelihood (ML)
nodes and the remaining rate-1 nodes. Moreover, a simplified LMLD (SLMLD)
algorithm is also proposed to reduce the computational complexity of the LMLD
algorithm. Suppose a partial parallel list decoder architecture with list size
$L=4$ is used, for an (8192, 4096) polar code, the proposed RLLD algorithm can
reduce the number of decoding clock cycles and decoding latency by 6.97 and
6.77 times, respectively.
|
[
{
"version": "v1",
"created": "Mon, 19 May 2014 17:59:20 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Oct 2014 14:34:18 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Lin",
"Jun",
""
],
[
"Xiong",
"Chenrong",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.984696 |
1406.4399
|
Stefano Rosati
|
S. Rosati, K. Kruzelecki, G. Heitz, D. Floreano, and B. Rimoldi
|
Dynamic Routing for Flying Ad Hoc Networks
|
Submitted to the IEEE Transactions on Vehicular Technology
| null |
10.1109/TVT.2015.2414819
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper reports experimental results on self-organizing wireless networks
carried by small flying robots. Flying ad hoc networks (FANETs) composed of
small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to
deploy. This makes them a very attractive technology for many civilian and
military applications. Due to the high mobility of the nodes, maintaining a
communication link between the UAVs is a challenging task. The topology of
these networks is more dynamic than that of typical mobile ad hoc networks
(MANETs) and of typical vehicle ad hoc networks (VANETs). As a consequence, the
existing routing protocols designed for MANETs partly fail in tracking network
topology changes. In this work, we compare two different routing algorithms for
ad hoc networks: optimized link-state routing (OLSR), and predictive-OLSR
(P-OLSR). The latter is an OLSR extension that we designed for FANETs; it takes
advantage of the GPS information available on board. To the best of our
knowledge, P-OLSR is currently the only FANET-specific routing technique that
has an available Linux implementation. We present results obtained by both
Media Access Control (MAC) layer emulations and real-world experiments. In the
experiments, we used a testbed composed of two autonomous fixed-wing UAVs and a
node on the ground. Our experiments evaluate the link performance and the
communication range, as well as the routing performance. Our emulation and
experimental results show that P-OLSR significantly outperforms OLSR in routing
in the presence of frequent network topology changes.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 15:15:18 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Nov 2014 10:53:48 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Mar 2015 13:40:03 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Rosati",
"S.",
""
],
[
"Kruzelecki",
"K.",
""
],
[
"Heitz",
"G.",
""
],
[
"Floreano",
"D.",
""
],
[
"Rimoldi",
"B.",
""
]
] |
new_dataset
| 0.994594 |
1407.3435
|
Yun Liao
|
Yun Liao, Tianyu Wang, Lingyang Song, and Zhu Han
|
Listen-and-Talk: Full-duplex Cognitive Radio Networks
|
in proceeding of IEEE Globecom 2014
| null |
10.1109/GLOCOM.2014.7037276
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In traditional cognitive radio networks, secondary users (SUs) typically
access the spectrum of primary users (PUs) by a two-stage "listen-before-talk"
(LBT) protocol, i.e., SUs sense the spectrum holes in the first stage before
transmit in the second stage. In this paper, we propose a novel
"listen-and-talk" (LAT) protocol with the help of the full-duplex (FD)
technique that allows SUs to simultaneously sense and access the vacant
spectrum. Analysis of sensing performance and SU's throughput are given for the
proposed LAT protocol. And we find that due to self-interference caused by FD,
increasing transmitting power of SUs does not always benefit to SU's
throughput, which implies the existence of a power-throughput tradeoff.
Besides, though the LAT protocol suffers from self-interference, it allows
longer transmission time, while the performance of the traditional LBT protocol
is limited by channel spatial correction and relatively shorter transmission
period. To this end, we also present an adaptive scheme to improve SUs'
throughput by switching between the LAT and LBT protocols. Numerical results
are provided to verify the proposed methods and the theoretical results.
|
[
{
"version": "v1",
"created": "Sun, 13 Jul 2014 06:00:36 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Liao",
"Yun",
""
],
[
"Wang",
"Tianyu",
""
],
[
"Song",
"Lingyang",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.960931 |
1407.4515
|
M. Reza Khanzadi
|
M. Reza Khanzadi, Rajet Krishnan, Dan Kuylenstierna, and Thomas
Eriksson
|
Oscillator Phase Noise and Small-Scale Channel Fading in Higher
Frequency Bands
|
IEEE Global Telecommun. Conf. (GLOBECOM), Austin, TX, Dec. 2014
| null |
10.1109/GLOCOMW.2014.7063466
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the effect of oscillator phase noise and channel
variations due to fading on the performance of communication systems at
frequency bands higher than 10GHz. Phase noise and channel models are reviewed
and technology-dependent bounds on the phase noise quality of radio oscillators
are presented. Our study shows that, in general, both channel variations and
phase noise can have severe effects on the system performance at high
frequencies. Importantly, their relative severity depends on the application
scenario and system parameters such as center frequency and bandwidth. Channel
variations are seen to be more severe than phase noise when the relative
velocity between the transmitter and receiver is high. On the other hand,
performance degradation due to phase noise can be more severe when the center
frequency is increased and the bandwidth is kept a constant, or when
oscillators based on low power CMOS technology are used, as opposed to high
power GaN HEMT based oscillators.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 22:25:49 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Sep 2014 07:18:20 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Khanzadi",
"M. Reza",
""
],
[
"Krishnan",
"Rajet",
""
],
[
"Kuylenstierna",
"Dan",
""
],
[
"Eriksson",
"Thomas",
""
]
] |
new_dataset
| 0.997551 |
1407.5711
|
Zhengdao Wang
|
Ronggui Xie, Huarui Yin, Zhengdao Wang, and Xiaohui Chen
|
A Novel Uplink Data Transmission Scheme For Small Packets In Massive
MIMO System
|
IEEE/CIC ICCC 2014 Symposium on Signal Processing for Communications
| null |
10.1109/ICCChina.2014.7008305
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent terminals often produce a large number of data packets of small
lengths. For these packets, it is inefficient to follow the conventional medium
access control (MAC) protocols because they lead to poor utilization of service
resources. We propose a novel multiple access scheme that targets massive
multiple-input multiple-output (MIMO) systems based on compressive sensing
(CS). We employ block precoding in the time domain to enable the simultaneous
transmissions of many users, which could be even more than the number of
receive antennas at the base station. We develop a block-sparse system model
and adopt the block orthogonal matching pursuit (BOMP) algorithm to recover the
transmitted signals. Conditions for data recovery guarantees are identified and
numerical results demonstrate that our scheme is efficient for uplink small
packet transmission.
|
[
{
"version": "v1",
"created": "Tue, 22 Jul 2014 02:13:37 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Sep 2014 00:10:11 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Xie",
"Ronggui",
""
],
[
"Yin",
"Huarui",
""
],
[
"Wang",
"Zhengdao",
""
],
[
"Chen",
"Xiaohui",
""
]
] |
new_dataset
| 0.992215 |
1408.3653
|
Hosein Nikopour
|
Mahmoud Taherzadeh, Hosein Nikopour, Alireza Bayesteh, and Hadi Baligh
|
SCMA Codebook Design
|
Accepted for IEEE VTC-fall 2014
| null |
10.1109/VTCFall.2014.6966170
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multicarrier CDMA is a multiple access scheme in which modulated QAM symbols
are spread over OFDMA tones by using a generally complex spreading sequence.
Effectively, a QAM symbol is repeated over multiple tones. Low density
signature (LDS) is a version of CDMA with low density spreading sequences
allowing us to take advantage of a near optimal message passing algorithm (MPA)
receiver with practically feasible complexity. Sparse code multiple access
(SCMA) is a multi-dimensional codebook-based non-orthogonal spreading
technique. In SCMA, the procedure of bit to QAM symbol mapping and spreading
are combined together and incoming bits are directly mapped to
multi-dimensional codewords of SCMA codebook sets. Each layer has its dedicated
codebook. Shaping gain of a multi-dimensional constellation is one of the main
sources of the performance improvement in comparison to the simple repetition
of QAM symbols in LDS. Meanwhile, like LDS, SCMA enjoys the low complexity
reception techniques due to the sparsity of SCMA codewords. In this paper a
systematic approach is proposed to design SCMA codebooks mainly based on the
design principles of lattice constellations. Simulation results are presented
to show the performance gain of SCMA compared to LDS and OFDMA.
|
[
{
"version": "v1",
"created": "Fri, 15 Aug 2014 21:08:47 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Taherzadeh",
"Mahmoud",
""
],
[
"Nikopour",
"Hosein",
""
],
[
"Bayesteh",
"Alireza",
""
],
[
"Baligh",
"Hadi",
""
]
] |
new_dataset
| 0.999771 |
1409.5532
|
Minho Yang
|
Minho Yang, Sang-Woon Jeon, Dong Ku Kim
|
Linear Degrees of Freedom of MIMO Broadcast Channels with Reconfigurable
Antennas in the Absence of CSIT
|
25 pages, 7 figures, submitted to IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2016.2623792
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The K-user multiple-input and multiple-output (MIMO) broadcast channel (BC)
with no channel state information at the transmitter (CSIT) is considered,
where each receiver is assumed to be equipped with reconfigurable antennas
capable of choosing a subset of receiving modes from several preset modes.
Under general antenna configurations, the sum linear degrees of freedom (LDoF)
of the K-user MIMO BC with reconfigurable antennas is completely characterized,
which corresponds to the maximum sum DoF achievable by linear coding
strategies. The LDoF region is further characterized for a class of antenna
configurations. Similar analysis is extended to the K-user MIMO interference
channels with reconfigurable antennas and the sum LDoF is characterized for a
class of antenna configurations.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2014 06:58:38 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Yang",
"Minho",
""
],
[
"Jeon",
"Sang-Woon",
""
],
[
"Kim",
"Dong Ku",
""
]
] |
new_dataset
| 0.999209 |
1412.4840
|
Constantinos Daskalakis
|
Constantinos Daskalakis, Qinxuan Pan
|
A Counter-Example to Karlin's Strong Conjecture for Fictitious Play
|
55th IEEE Symposium on Foundations of Computer Science
| null |
10.1109/FOCS.2014.10
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fictitious play is a natural dynamic for equilibrium play in zero-sum games,
proposed by [Brown 1949], and shown to converge by [Robinson 1951]. Samuel
Karlin conjectured in 1959 that fictitious play converges at rate
$O(1/\sqrt{t})$ with the number of steps $t$. We disprove this conjecture
showing that, when the payoff matrix of the row player is the $n \times n$
identity matrix, fictitious play may converge with rate as slow as
$\Omega(t^{-1/n})$.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2014 00:24:25 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Dec 2014 03:50:16 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Daskalakis",
"Constantinos",
""
],
[
"Pan",
"Qinxuan",
""
]
] |
new_dataset
| 0.989755 |
1412.6464
|
Christian Napoli
|
Christian Napoli, Giuseppe Pappalardo, Emiliano Tramontana, Zbigniew
Marsza{\l}ek, Dawid Po{\l}ap and Marcin Wo\'zniak
|
Simplified firefly algorithm for 2D image key-points search
|
Published version on: 2014 IEEE Symposium on Computational
Intelligence for Human-like Intelligence
|
IEEE Symposium on Computational Intelligence for Human-like
Intelligence, pp. 118-125, 2014
|
10.1109/CIHLI.2014.7013395
| null |
cs.NE cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to identify an object, human eyes firstly search the field of view
for points or areas which have particular properties. These properties are used
to recognise an image or an object. Then this process could be taken as a model
to develop computer algorithms for images identification. This paper proposes
the idea of applying the simplified firefly algorithm to search for key-areas
in 2D images. For a set of input test images the proposed version of firefly
algorithm has been examined. Research results are presented and discussed to
show the efficiency of this evolutionary computation method.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 18:00:11 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Napoli",
"Christian",
""
],
[
"Pappalardo",
"Giuseppe",
""
],
[
"Tramontana",
"Emiliano",
""
],
[
"Marszałek",
"Zbigniew",
""
],
[
"Połap",
"Dawid",
""
],
[
"Woźniak",
"Marcin",
""
]
] |
new_dataset
| 0.961843 |
1501.01496
|
Boris Bellalta Dr.
|
Boris Bellalta
|
IEEE 802.11ax: High-Efficiency WLANs
|
in IEEE Wireless Communications Magazine, 2015
| null |
10.1109/MWC.2016.7422404
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.11ax-2019 will replace both IEEE 802.11n-2009 and IEEE 802.11ac-2013
as the next high-throughput Wireless Local Area Network (WLAN) amendment. In
this paper, we review the expected future WLAN scenarios and use-cases that
justify the push for a new PHY/MAC IEEE 802.11 amendment. After that, we
overview a set of new technical features that may be included in the IEEE
802.11ax-2019 amendment and describe both their advantages and drawbacks.
Finally, we discuss some of the network-level functionalities that are required
to fully improve the user experience in next-generation WLANs and note their
relation with other on-going IEEE 802.11 amendments.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2015 13:58:39 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Jan 2015 08:38:00 GMT"
},
{
"version": "v3",
"created": "Fri, 15 May 2015 17:42:19 GMT"
},
{
"version": "v4",
"created": "Tue, 28 Jul 2015 15:48:10 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Bellalta",
"Boris",
""
]
] |
new_dataset
| 0.998529 |
1502.03038
|
Heba Aly
|
Heba Aly, Anas Basalamah, Moustafa Youssef
|
LaneQuest: An Accurate and Energy-Efficient Lane Detection System
|
Accepted for publication in the 13th IEEE International Conference on
Pervasive Computing and Communications (IEEE PerCom 2015)
| null |
10.1109/PERCOM.2015.7146523
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current outdoor localization techniques fail to provide the required accuracy
for estimating the car's lane. In this paper, we present LaneQuest: a system
that leverages the ubiquitous and low-energy inertial sensors available in
commodity smart-phones to provide an accurate estimate of the car's current
lane. LaneQuest leverages hints from the phone sensors about the surrounding
environment to detect the car's lane. For example, a car making a right turn
most probably will be in the right-most lane, a car passing by a pothole will
be in a specific lane, and the car's angular velocity when driving through a
curve reflects its lane. Our investigation shows that there are amble
opportunities in the environment, i.e. lane "anchors", that provide cues about
the car's lane. To handle the ambiguous location, sensors noise, and fuzzy lane
anchors; LaneQuest employs a novel probabilistic lane estimation algorithm.
Furthermore, it uses an unsupervised crowd-sourcing approach to learn the
position and lane-span distribution of the different lane-level anchors.
Our evaluation results from implementation on different android devices and
260Km driving traces by 13 drivers in different cities shows that LaneQuest can
detect the different lane-level anchors with an average precision and recall of
more than 90%. This leads to an accurate detection of the exact car's lane
position 80% of the time, increasing to 89% of the time to within one lane.
This comes with a low-energy footprint, allowing LaneQuest to be implemented on
the energy-constrained mobile devices.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 18:53:19 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Aly",
"Heba",
""
],
[
"Basalamah",
"Anas",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.991729 |
1503.06959
|
Luca Baroffio
|
Luca Baroffio, Matteo Cesana, Alessandro Redondi, Marco Tagliasacchi
|
Fast keypoint detection in video sequences
|
submitted to IEEE International Conference on Image Processing 2015
| null |
10.1109/ICASSP.2016.7471895
| null |
cs.CV cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A number of computer vision tasks exploit a succinct representation of the
visual content in the form of sets of local features. Given an input image,
feature extraction algorithms identify a set of keypoints and assign to each of
them a description vector, based on the characteristics of the visual content
surrounding the interest point. Several tasks might require local features to
be extracted from a video sequence, on a frame-by-frame basis. Although
temporal downsampling has been proven to be an effective solution for mobile
augmented reality and visual search, high temporal resolution is a key
requirement for time-critical applications such as object tracking, event
recognition, pedestrian detection, surveillance. In recent years, more and more
computationally efficient visual feature detectors and decriptors have been
proposed. Nonetheless, such approaches are tailored to still images. In this
paper we propose a fast keypoint detection algorithm for video sequences, that
exploits the temporal coherence of the sequence of keypoints. According to the
proposed method, each frame is preprocessed so as to identify the parts of the
input frame for which keypoint detection and description need to be performed.
Our experiments show that it is possible to achieve a reduction in
computational time of up to 40%, without significantly affecting the task
accuracy.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 09:28:28 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Baroffio",
"Luca",
""
],
[
"Cesana",
"Matteo",
""
],
[
"Redondi",
"Alessandro",
""
],
[
"Tagliasacchi",
"Marco",
""
]
] |
new_dataset
| 0.950323 |
1504.00082
|
Behzad Asadi
|
Behzad Asadi, Lawrence Ong, and Sarah J. Johnson
|
A Unified Scheme for Two-Receiver Broadcast Channels with Receiver
Message Side Information
|
accepted and to be presented at the 2015 IEEE International Symposium
on Information Theory (ISIT 2015)
| null |
10.1109/ISIT.2015.7282482
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the capacity regions of two-receiver broadcast
channels where each receiver (i) has both common and private-message requests,
and (ii) knows part of the private message requested by the other receiver as
side information. We first propose a transmission scheme and derive an inner
bound for the two-receiver memoryless broadcast channel. We next prove that
this inner bound is tight for the deterministic channel and the more capable
channel, thereby establishing their capacity regions. We show that this inner
bound is also tight for all classes of two-receiver broadcast channels whose
capacity regions were known prior to this work. Our proposed scheme is
consequently a unified capacity-achieving scheme for these classes of broadcast
channels.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 01:54:06 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Apr 2015 04:16:33 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Asadi",
"Behzad",
""
],
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.995693 |
1504.01320
|
Mohammadreza A. Kashani
|
Bilal A. Ranjha, Mohammadreza A. Kashani, Mohsen Kavehrad, Peng Deng
|
Robust Timing Synchronization for AC-OFDM Based Optical Wireless
Communications
|
Accepted for publication in IEEE ICNS 2015, 10 Pages, 7 figs
| null |
10.1109/ICNSURV.2015.7121217
| null |
cs.IT math.IT physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visible light communications (VLC) have recently attracted a growing interest
and can be a potential solution to realize indoor wireless communication with
high bandwidth capacity for RF-restricted environments such as airplanes and
hospitals. Optical based orthogonal frequency division multiplexing (OFDM)
systems have been proposed in the literature to combat multipath distortion and
intersymbol interference (ISI) caused by multipath signal propagation. In this
paper, we present a robust timing synchronization scheme suitable for
asymmetrically clipped (AC) OFDM based optical intensity modulated direct
detection (IM/DD) wireless systems. Our proposed method works perfectly for
ACO-OFDM, Pulse amplitude modulated discrete multitone (PAM-DMT) and discrete
Hartley transform (DHT) based optical OFDM systems. In contrast to existing
OFDM timing synchronization methods which are either not suitable for AC OFDM
techniques due to unipolar nature of output signal or perform poorly, our
proposed method is suitable for AC OFDM schemes and outperforms all other
available techniques. Both numerical and experimental results confirm the
accuracy of the proposed method. Our technique is also computationally
efficient as it requires very few computations as compared to conventional
methods in order to achieve good accuracy.
|
[
{
"version": "v1",
"created": "Mon, 6 Apr 2015 17:07:20 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ranjha",
"Bilal A.",
""
],
[
"Kashani",
"Mohammadreza A.",
""
],
[
"Kavehrad",
"Mohsen",
""
],
[
"Deng",
"Peng",
""
]
] |
new_dataset
| 0.991764 |
1504.02980
|
Xiaoming Chen
|
Xiaoming Chen, Caijun Zhong, Chau Yuen, Hsiao-Hwa Chen
|
Multi-Antenna Relay Aided Wireless Physical Layer Security
|
17 pages, 4 figures, IEEE Communications Magazine, 2015
| null |
10.1109/MCOM.2015.7355564
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With growing popularity of mobile Internet, providing secure wireless
services has become a critical issue. Physical layer security (PHY-security)
has been recognized as an effective means to enhance wireless security by
exploiting wireless medium characteristics, e.g., fading, noise, and
interference. A particularly interesting PHY-security technology is cooperative
relay due to the fact that it helps to provide distributed diversity and
shorten access distance. This article offers a tutorial on various
multi-antenna relaying technologies to improve security at physical layer. The
state of the art research results on multi-antenna relay aided PHY-security as
well as some secrecy performance optimization schemes are presented. In
particular, we focus on large-scale MIMO (LS-MIMO) relaying technology, which
is effective to tackle various challenging issues for implementing wireless
PHY-security, such as short-distance interception without eavesdropper channel
state information (CSI) and with imperfect legitimate CSI. Moreover, the future
directions are identified for further enhancement of secrecy performance.
|
[
{
"version": "v1",
"created": "Sun, 12 Apr 2015 15:15:57 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chen",
"Xiaoming",
""
],
[
"Zhong",
"Caijun",
""
],
[
"Yuen",
"Chau",
""
],
[
"Chen",
"Hsiao-Hwa",
""
]
] |
new_dataset
| 0.99943 |
1504.03536
|
Dmytro Karamshuk
|
Dmytro Karamshuk, Nishanth Sastry, Andrew Secker, Jigna Chandaria
|
ISP-friendly Peer-assisted On-demand Streaming of Long Duration Content
in BBC iPlayer
|
In Proceedings of IEEE INFOCOM 2015
| null |
10.1109/INFOCOM.2015.7218393
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In search of scalable solutions, CDNs are exploring P2P support. However, the
benefits of peer assistance can be limited by various obstacle factors such as
ISP friendliness - requiring peers to be within the same ISP, bitrate
stratification - the need to match peers with others needing similar bitrate,
and partial participation - some peers choosing not to redistribute content.
This work relates potential gains from peer assistance to the average number
of users in a swarm, its capacity, and empirically studies the effects of these
obstacle factors at scale, using a month-long trace of over 2 million users in
London accessing BBC shows online. Results indicate that even when P2P swarms
are localised within ISPs, up to 88% of traffic can be saved. Surprisingly,
bitrate stratification results in 2 large sub-swarms and does not significantly
affect savings. However, partial participation, and the need for a minimum
swarm size do affect gains. We investigate improvements to gain from increasing
content availability through two well-studied techniques: content bundling -
combining multiple items to increase availability, and historical caching of
previously watched items. Bundling proves ineffective as increased server
traffic from larger bundles outweighs benefits of availability, but simple
caching can considerably boost traffic gains from peer assistance.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2015 13:23:39 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Karamshuk",
"Dmytro",
""
],
[
"Sastry",
"Nishanth",
""
],
[
"Secker",
"Andrew",
""
],
[
"Chandaria",
"Jigna",
""
]
] |
new_dataset
| 0.992959 |
1504.03573
|
Marcus A. Brubaker
|
Marcus A. Brubaker, Ali Punjani and David J. Fleet
|
Building Proteins in a Day: Efficient 3D Molecular Reconstruction
|
To be presented at IEEE Conference on Computer Vision and Pattern
Recognition (CVPR) 2015
| null |
10.1109/CVPR.2015.7298929
| null |
cs.CV q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discovering the 3D atomic structure of molecules such as proteins and viruses
is a fundamental research problem in biology and medicine. Electron
Cryomicroscopy (Cryo-EM) is a promising vision-based technique for structure
estimation which attempts to reconstruct 3D structures from 2D images. This
paper addresses the challenging problem of 3D reconstruction from 2D Cryo-EM
images. A new framework for estimation is introduced which relies on modern
stochastic optimization techniques to scale to large datasets. We also
introduce a novel technique which reduces the cost of evaluating the objective
function during optimization by over five orders or magnitude. The net result
is an approach capable of estimating 3D molecular structure from large scale
datasets in about a day on a single workstation.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2015 14:56:17 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Brubaker",
"Marcus A.",
""
],
[
"Punjani",
"Ali",
""
],
[
"Fleet",
"David J.",
""
]
] |
new_dataset
| 0.991936 |
1505.00953
|
Jiayi Zhang
|
Jiayi Zhang, Linglong Dai, Yanjun Han, Yu Zhang, and Zhaocheng Wang
|
On the Ergodic Capacity of MIMO Free-Space Optical Systems over
Turbulence Channels
|
10 pages, 6 figures, This paper has been accepted by IEEE Journal on
Selected Areas in Communications - Special Issue on Optical Wireless
Communication
| null |
10.1109/JSAC.2015.2452631
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The free-space optical (FSO) communications can achieve high capacity with
huge unlicensed optical spectrum and low operational costs. The corresponding
performance analysis of FSO systems over turbulence channels is very limited,
especially when using multiple apertures at both transmitter and receiver
sides. This paper aim to provide the ergodic capacity characterization of
multiple-input multiple-output (MIMO) FSO systems over atmospheric
turbulence-induced fading channels. The fluctuations of the irradiance of
optical channels distorted by atmospheric conditions is usually described by a
gamma-gamma ($\Gamma \Gamma$) distribution, and the distribution of the sum of
$\Gamma \Gamma$ random variables (RVs) is required to model the MIMO optical
links. We use an $\alpha$-$\mu$ distribution to efficiently approximate the
probability density function (PDF) of the sum of independent and identical
distributed $\Gamma\Gamma$ RVs through moment-based estimators. Furthermore,
the PDF of the sum of independent, but not necessarily identically distributed
$\Gamma \Gamma$ RVs can be efficiently approximated by a finite weighted sum of
PDFs of $\Gamma \Gamma$ distributions. Based on these reliable approximations,
novel and precise analytical expressions for the ergodic capacity of MIMO FSO
systems are derived. Additionally, we deduce the asymptotic simple expressions
in high signal-to-noise ratio regimes, which provide useful insights into the
impact of the system parameters on the ergodic capacity. Finally, our proposed
results are validated via Monte-Carlo simulations.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 11:06:56 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zhang",
"Jiayi",
""
],
[
"Dai",
"Linglong",
""
],
[
"Han",
"Yanjun",
""
],
[
"Zhang",
"Yu",
""
],
[
"Wang",
"Zhaocheng",
""
]
] |
new_dataset
| 0.998992 |
1505.02211
|
Tony Wu
|
Tony F. Wu, Karthik Ganesan, Yunqing Alexander Hu, H.-S. Philip Wong,
Simon Wong, Subhasish Mitra
|
TPAD: Hardware Trojan Prevention and Detection for Trusted Integrated
Circuits
|
17 pages, 23 figures. Extended version of paper to appear in IEEE
Trans. on CAD
| null |
10.1109/TCAD.2015.2474373
| null |
cs.AR cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are increasing concerns about possible malicious modifications of
integrated circuits (ICs) used in critical applications. Such attacks are often
referred to as hardware Trojans. While many techniques focus on hardware Trojan
detection during IC testing, it is still possible for attacks to go undetected.
Using a combination of new design techniques and new memory technologies, we
present a new approach that detects a wide variety of hardware Trojans during
IC testing and also during system operation in the field. Our approach can also
prevent a wide variety of attacks during synthesis, place-and-route, and
fabrication of ICs. It can be applied to any digital system, and can be tuned
for both traditional and split-manufacturing methods. We demonstrate its
applicability for both ASICs and FPGAs. Using fabricated test chips with Trojan
emulation capabilities and also using simulations, we demonstrate: 1. The area
and power costs of our approach can range between 7.4-165% and 0.07-60%,
respectively, depending on the design and the attacks targeted; 2. The speed
impact can be minimal (close to 0%); 3. Our approach can detect 99.998% of
Trojans (emulated using test chips) that do not require detailed knowledge of
the design being attacked; 4. Our approach can prevent 99.98% of specific
attacks (simulated) that utilize detailed knowledge of the design being
attacked (e.g., through reverse-engineering). 5. Our approach never produces
any false positives, i.e., it does not report attacks when the IC operates
correctly.
|
[
{
"version": "v1",
"created": "Sat, 9 May 2015 00:11:31 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Aug 2015 02:19:49 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Wu",
"Tony F.",
""
],
[
"Ganesan",
"Karthik",
""
],
[
"Hu",
"Yunqing Alexander",
""
],
[
"Wong",
"H. -S. Philip",
""
],
[
"Wong",
"Simon",
""
],
[
"Mitra",
"Subhasish",
""
]
] |
new_dataset
| 0.999782 |
1505.07283
|
Lakshmi Natarajan Dr
|
Lakshmi Natarajan, Yi Hong, and Emanuele Viterbo
|
Index Codes for the Gaussian Broadcast Channel using Quadrature
Amplitude Modulation
|
Accepted for publication in IEEE Communications Letters. 4 pages, 2
figures, 1 table
| null |
10.1109/LCOMM.2015.2439268
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose index codes, based on multidimensional QAM constellations, for the
Gaussian broadcast channel, where every receiver demands all the messages from
the source. The efficiency with which an index code exploits receiver side
information in this broadcast channel is characterised by a code design metric
called "side information gain". The known index codes for this broadcast
channel enjoy large side information gains, but do not encode all the source
messages at the same rate, and do not admit message sizes that are powers of
two. The index codes proposed in this letter, which are based on linear codes
over integer rings, overcome both these drawbacks and yet provide large values
of side information gain. With the aid of a computer search, we obtain QAM
index codes for encoding up to 5 messages with message sizes 2^m, m <= 6. We
also present the simulated performance of a new 16-QAM index code, concatenated
with an off-the-shelf LDPC code, which is observed to operate within 4.3 dB of
the broadcast channel capacity.
|
[
{
"version": "v1",
"created": "Wed, 27 May 2015 12:20:08 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Natarajan",
"Lakshmi",
""
],
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.999674 |
1508.01182
|
Ying Li
|
Ying Li, Katherine Guo, Xin Wang, Emina Soljanin, Thomas Woo
|
SEARS: Space Efficient And Reliable Storage System in the Cloud
|
4 pages, IEEE LCN 2015
| null |
10.1109/LCN.2015.7366342
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's cloud storage services must offer storage reliability and fast data
retrieval for large amount of data without sacrificing storage cost. We present
SEARS, a cloud-based storage system which integrates erasure coding and data
deduplication to support efficient and reliable data storage with fast user
response time. With proper association of data to storage server clusters,
SEARS provides flexible mixing of different configurations, suitable for
real-time and archival applications.
Our prototype implementation of SEARS over Amazon EC2 shows that it
outperforms existing storage systems in storage efficiency and file retrieval
time. For 3 MB files, SEARS delivers retrieval time of $2.5$ s compared to $7$
s with existing systems.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 19:14:24 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Li",
"Ying",
""
],
[
"Guo",
"Katherine",
""
],
[
"Wang",
"Xin",
""
],
[
"Soljanin",
"Emina",
""
],
[
"Woo",
"Thomas",
""
]
] |
new_dataset
| 0.976934 |
1508.01572
|
Yukio Hayashi
|
Yukio Hayashi
|
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a
MSQ Network
|
6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 2015
| null |
10.1109/SASOW.2015.11
| null |
cs.DC cs.NI cs.SI nlin.AO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 00:06:30 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Aug 2015 01:54:51 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Sep 2015 02:07:01 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Hayashi",
"Yukio",
""
]
] |
new_dataset
| 0.994996 |
1509.01931
|
Young-Han Kim
|
Xianglan Jin, Young-Han Kim
|
The Approximate Capacity of the MIMO Relay Channel
|
8 pages, 5 figures, submitted to the IEEE Transactions on Information
Theory
| null |
10.1109/ISIT.2014.6875204
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Capacity bounds are studied for the multiple-antenna complex Gaussian relay
channel with t1 transmitting antennas at the sender, r2 receiving and t2
transmitting antennas at the relay, and r3 receiving antennas at the receiver.
It is shown that the partial decode-forward coding scheme achieves within
min(t1,r2) bits from the cutset bound and at least one half of the cutset
bound, establishing a good approximate expression of the capacity. A similar
additive gap of min(t1 + t2, r3) + r2 bits is shown to be achieved by the
compress-forward coding scheme.
|
[
{
"version": "v1",
"created": "Mon, 7 Sep 2015 07:14:20 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Jin",
"Xianglan",
""
],
[
"Kim",
"Young-Han",
""
]
] |
new_dataset
| 0.99092 |
1509.05856
|
Serj Haddad
|
Serj Haddad, Olivier Leveque
|
On the Broadcast Capacity of Large Wireless Networks at Low SNR
|
20 pages, 5 figures, presented at ISIT 2015, submitted to the IEEE
Transactions on Information Theory
| null |
10.1109/ISIT.2015.7282439
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper focuses on the problem of broadcasting information in the
most efficient manner in a large two-dimensional ad hoc wireless network at low
SNR and under line-of-sight propagation. A new communication scheme is
proposed, where source nodes first broadcast their data to the entire network,
despite the lack of sufficient available power. The signal's power is then
reinforced via successive back-and-forth beamforming transmissions between
different groups of nodes in the network, so that all nodes are able to decode
the transmitted information at the end. This scheme is shown to achieve
asymptotically the broadcast capacity of the network, which is expressed in
terms of the largest singular value of the matrix of fading coefficients
between the nodes in the network. A detailed mathematical analysis is then
presented to evaluate the asymptotic behavior of this largest singular value.
|
[
{
"version": "v1",
"created": "Sat, 19 Sep 2015 07:56:25 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Jan 2016 12:38:11 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Haddad",
"Serj",
""
],
[
"Leveque",
"Olivier",
""
]
] |
new_dataset
| 0.953647 |
1510.06828
|
Andrew Thangaraj
|
Asit Kumar Pradhan, Andrew Thangaraj and Arunkumar Subramanian
|
Construction of Near-Capacity Protograph LDPC Code Sequences with
Block-Error Thresholds
|
to appear in the IEEE Transactions on Communications
| null |
10.1109/TCOMM.2015.2500234
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Density evolution for protograph Low-Density Parity-Check (LDPC) codes is
considered, and it is shown that the message-error rate falls
double-exponentially with iterations whenever the degree-2 subgraph of the
protograph is cycle-free and noise level is below threshold. Conditions for
stability of protograph density evolution are established and related to the
structure of the protograph. Using large-girth graphs, sequences of protograph
LDPC codes with block-error threshold equal to bit-error threshold and
block-error rate falling near-exponentially with blocklength are constructed
deterministically. Small-sized protographs are optimized to obtain thresholds
near capacity for binary erasure and binary-input Gaussian channels.
|
[
{
"version": "v1",
"created": "Fri, 23 Oct 2015 05:05:11 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Pradhan",
"Asit Kumar",
""
],
[
"Thangaraj",
"Andrew",
""
],
[
"Subramanian",
"Arunkumar",
""
]
] |
new_dataset
| 0.999423 |
1510.07917
|
Corinne Touati
|
Nof Abuzainab, Corinne Touati
|
Multihop Relaying in Millimeter Wave Networks: A Proportionally Fair
Cooperative Network Formation Game
|
IEEE. 82nd Vehicular Technology Conference: VTC2015-Fall, Sep 2015,
Boston, United States
| null |
10.1109/VTCFall.2015.7391029
| null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave channels suffer from considerable degradation in the channel
quality when the signal is Non Line of Sight (NLOS) between the source and the
destination. Multihop relaying is thus anticipated to improve the communi-
cation between a source and its destination. This is achieved by transmitting
the signal to a sequence of relays in which a Line of Sight (LOS) signal exists
between two nodes along the path, or more generally when the signal is better
than the transmitted signal directly from the source to the destination. In
this paper, we consider a millimeter wave network composed of multiple source-
destination pairs and a set of deployed relays. We formulate the problem of
multihop relaying as a cooperative network formation game in which each relay
chooses which source-destination pair to assist in order to improve the
end-to-end performance, that is, the multihop delay between the source and the
destination. Further, we present an algorithm based on the Nash Bargaining
Solution to ensure fairness among the different source-destination pairs and
assess its efficiency on numerical simulations.
|
[
{
"version": "v1",
"created": "Tue, 27 Oct 2015 14:28:13 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Abuzainab",
"Nof",
""
],
[
"Touati",
"Corinne",
""
]
] |
new_dataset
| 0.999243 |
1510.07932
|
Ekram Hossain
|
Tran Kien Thuc, Ekram Hossain, and Hina Tabassum
|
Downlink Power Control in Two-Tier Cellular Networks with
Energy-Harvesting Small Cells as Stochastic Games
|
IEEE Transactions on Communications, 2015
| null |
10.1109/TCOMM.2015.2497239
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy harvesting in cellular networks is an emerging technique to enhance
the sustainability of power-constrained wireless devices. This paper considers
the co-channel deployment of a macrocell overlaid with small cells. The small
cell base stations (SBSs) harvest energy from environmental sources whereas the
macrocell base station (MBS) uses conventional power supply. Given a stochastic
energy arrival process for the SBSs, we derive a power control policy for the
downlink transmission of both MBS and SBSs such that they can achieve their
objectives (e.g., maintain the signal-to-interference-plus-noise ratio (SINR)
at an acceptable level) on a given transmission channel. We consider a
centralized energy harvesting mechanism for SBSs, i.e., there is a central
energy storage (CES) where energy is harvested and then distributed to the
SBSs. When the number of SBSs is small, the game between the CES and the MBS is
modeled as a single-controller stochastic game and the equilibrium policies are
obtained as a solution of a quadratic programming problem. However, when the
number of SBSs tends to infinity (i.e., a highly dense network), the
centralized scheme becomes infeasible, and therefore, we use a mean field
stochastic game to obtain a distributed power control policy for each SBS. By
solving a system of partial differential equations, we derive the power control
policy of SBSs given the knowledge of mean field distribution and the available
harvested energy levels in the batteries of the SBSs.
|
[
{
"version": "v1",
"created": "Tue, 27 Oct 2015 15:14:32 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Thuc",
"Tran Kien",
""
],
[
"Hossain",
"Ekram",
""
],
[
"Tabassum",
"Hina",
""
]
] |
new_dataset
| 0.993152 |
1511.04192
|
Tianshui Chen
|
Tianshui Chen, Liang Lin, Lingbo Liu, Xiaonan Luo, Xuelong Li
|
DISC: Deep Image Saliency Computing via Progressive Representation
Learning
|
This manuscript is the accepted version for IEEE Transactions on
Neural Networks and Learning Systems (T-NNLS), 2015
| null |
10.1109/TNNLS.2015.2506664
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Salient object detection increasingly receives attention as an important
component or step in several pattern recognition and image processing tasks.
Although a variety of powerful saliency models have been intensively proposed,
they usually involve heavy feature (or model) engineering based on priors (or
assumptions) about the properties of objects and backgrounds. Inspired by the
effectiveness of recently developed feature learning, we provide a novel Deep
Image Saliency Computing (DISC) framework for fine-grained image saliency
computing. In particular, we model the image saliency from both the coarse- and
fine-level observations, and utilize the deep convolutional neural network
(CNN) to learn the saliency representation in a progressive manner.
Specifically, our saliency model is built upon two stacked CNNs. The first CNN
generates a coarse-level saliency map by taking the overall image as the input,
roughly identifying saliency regions in the global context. Furthermore, we
integrate superpixel-based local context information in the first CNN to refine
the coarse-level saliency map. Guided by the coarse saliency map, the second
CNN focuses on the local context to produce fine-grained and accurate saliency
map while preserving object details. For a testing image, the two CNNs
collaboratively conduct the saliency computing in one shot. Our DISC framework
is capable of uniformly highlighting the objects-of-interest from complex
background while preserving well object details. Extensive experiments on
several standard benchmarks suggest that DISC outperforms other
state-of-the-art methods and it also generalizes well across datasets without
additional training. The executable version of DISC is available online:
http://vision.sysu.edu.cn/projects/DISC.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 07:14:13 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Dec 2015 13:11:23 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chen",
"Tianshui",
""
],
[
"Lin",
"Liang",
""
],
[
"Liu",
"Lingbo",
""
],
[
"Luo",
"Xiaonan",
""
],
[
"Li",
"Xuelong",
""
]
] |
new_dataset
| 0.995441 |
1511.06938
|
Mathew Samimi
|
Mathew K. Samimi, George R. MacCartney, Jr., Shu Sun, and Theodore S.
Rappaport
|
28 GHz Millimeter-Wave Ultrawideband Small-Scale Fading Models in
Wireless Channels
|
6 pages, 9 figures, to be published in the 2016 IEEE Vehicular
Technology Conference (VTC2016-Spring), 15-18 May, 2016
| null |
10.1109/VTCSpring.2016.7503970
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents small-scale fading measurements for 28 GHz outdoor
millimeter-wave ultrawideband channels using directional horn antennas at the
transmitter and receiver. Power delay profiles were measured at half-wavelength
spatial increments over a local area (33 wavelengths) on a linear track in two
orthogonal receiver directions in a typical base-to-mobile scenario with fixed
transmitter and receiver antenna beam pointing directions. The voltage path
amplitudes are shown to follow a Rician distribution, with K-factor ranging
from 9 - 15 dB and 5 - 8 dB in line of sight (LOS) and non-line of sight (NLOS)
for a vertical-to-vertical co-polarized antenna scenario, respectively, and
from 3 - 7 dB in both LOS and NLOS vertical-to-horizontal cross-polarized
antenna scenario. The average spatial autocorrelation functions of individual
multipath components reveal that signal amplitudes reach a correlation of 0
after 2 and 5 wavelengths in LOS and NLOS co-polarized V-V antenna scenarios.
The models provided are useful for recreating path gain statistics of
millimeter-wave wideband channel impulse responses over local areas, for the
study of multi-element antenna simulations and channel estimation algorithms.
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2015 23:22:47 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Feb 2016 05:24:27 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Samimi",
"Mathew K.",
""
],
[
"MacCartney,",
"George R.",
"Jr."
],
[
"Sun",
"Shu",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.999823 |
1601.07865
|
Yuyi Mao
|
Yuyi Mao, Jun Zhang, Khaled B. Letaief
|
Grid Energy Consumption and QoS Tradeoff in Hybrid Energy Supply
Wireless Networks
|
14 pages, 7 figures, to appear in IEEE Transactions on Wireless
Communications
| null |
10.1109/TWC.2016.2523981
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hybrid energy supply (HES) wireless networks have recently emerged as a new
paradigm to enable green networks, which are powered by both the electric grid
and harvested renewable energy. In this paper, we will investigate two critical
but conflicting design objectives of HES networks, i.e., the grid energy
consumption and quality of service (QoS). Minimizing grid energy consumption by
utilizing the harvested energy will make the network environmentally friendly,
but the achievable QoS may be degraded due to the intermittent nature of energy
harvesting. To investigate the tradeoff between these two aspects, we introduce
the total service cost as the performance metric, which is the weighted sum of
the grid energy cost and the QoS degradation cost. Base station assignment and
power control is adopted as the main strategy to minimize the total service
cost, while both cases with non-causal and causal side information are
considered. With non-causal side information, a Greedy Assignment algorithm
with low complexity and near-optimal performance is proposed. With causal side
information, the design problem is formulated as a discrete Markov decision
problem. Interesting solution structures are derived, which shall help to
develop an efficient monotone backward induction algorithm. To further reduce
complexity, a Look-Ahead policy and a Threshold-based Heuristic policy are also
proposed. Simulation results shall validate the effectiveness of the proposed
algorithms and demonstrate the unique grid energy consumption and QoS tradeoff
in HES networks.
|
[
{
"version": "v1",
"created": "Thu, 28 Jan 2016 19:05:48 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Mao",
"Yuyi",
""
],
[
"Zhang",
"Jun",
""
],
[
"Letaief",
"Khaled B.",
""
]
] |
new_dataset
| 0.988259 |
1602.04493
|
Hamidreza Ghafghazi
|
Hamidreza Ghafghazi, Amr ElMougy, Hussein T. Mouftah, Carlisle Adams
|
Secure Data Storage Structure and Privacy-Preserving Mobile Search
Scheme for Public Safety Networks
|
7 pages, 3 figures, This work has been accepted to be presented in
Wireless Communications and Networking Conference (WCNC), 2016 IEEE
| null |
10.1109/WCNC.2016.7564866
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a Public Safety (PS) situation, agents may require critical and personally
identifiable information. Therefore, not only does context and location-aware
information need to be available, but also the privacy of such information
should be preserved. Existing solutions do not address such a problem in a PS
environment. This paper proposes a framework in which anonymized Personal
Information (PI) is accessible to authorized public safety agents under a PS
circumstance. In particular, we propose a secure data storage structure along
with privacy-preserving mobile search framework, suitable for Public Safety
Networks (PSNs). As a result, availability and privacy of PI are achieved
simultaneously. However, the design of such a framework encounters substantial
challenges, including scalability, reliability of the data, computation and
communication and storage efficiency, etc. We leverage Secure Indexing (SI)
methods and modify Bloom Filters (BFs) to create a secure data storage
structure to store encrypted meta-data. As a result, our construction enables
secure and privacy-preserving multi-keyword search capability. In addition, our
system scales very well, maintains availability of data, imposes minimum delay,
and has affordable storage overhead. We provide extensive security analysis,
simulation studies, and performance comparison with the state-of-the-art
solutions to demonstrate the efficiency and effectiveness of the proposed
approach. To the best of our knowledge, this work is the first to address such
issues in the context of PSNs.
|
[
{
"version": "v1",
"created": "Sun, 14 Feb 2016 19:47:01 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ghafghazi",
"Hamidreza",
""
],
[
"ElMougy",
"Amr",
""
],
[
"Mouftah",
"Hussein T.",
""
],
[
"Adams",
"Carlisle",
""
]
] |
new_dataset
| 0.978006 |
1602.06888
|
Maria Patterson
|
Maria T Patterson, Nikolas Anderson, Collin Bennett, Jacob Bruggemann,
Robert Grossman, Matthew Handy, Vuong Ly, Dan Mandl, Shane Pederson, Jim
Pivarski, Ray Powell, Jonathan Spring and Walt Wells
|
The Matsu Wheel: A Cloud-based Framework for Efficient Analysis and
Reanalysis of Earth Satellite Imagery
|
10 pages, accepted for presentation to IEEE BigDataService 2016
| null |
10.1109/BigDataService.2016.39
| null |
cs.DC astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Project Matsu is a collaboration between the Open Commons Consortium and NASA
focused on developing open source technology for the cloud-based processing of
Earth satellite imagery. A particular focus is the development of applications
for detecting fires and floods to help support natural disaster detection and
relief. Project Matsu has developed an open source cloud-based infrastructure
to process, analyze, and reanalyze large collections of hyperspectral satellite
image data using OpenStack, Hadoop, MapReduce, Storm and related technologies.
We describe a framework for efficient analysis of large amounts of data
called the Matsu "Wheel." The Matsu Wheel is currently used to process incoming
hyperspectral satellite data produced daily by NASA's Earth Observing-1 (EO-1)
satellite. The framework is designed to be able to support scanning queries
using cloud computing applications, such as Hadoop and Accumulo. A scanning
query processes all, or most of the data, in a database or data repository.
We also describe our preliminary Wheel analytics, including an anomaly
detector for rare spectral signatures or thermal anomalies in hyperspectral
data and a land cover classifier that can be used for water and flood
detection. Each of these analytics can generate visual reports accessible via
the web for the public and interested decision makers. The resultant products
of the analytics are also made accessible through an Open Geospatial Compliant
(OGC)-compliant Web Map Service (WMS) for further distribution. The Matsu Wheel
allows many shared data services to be performed together to efficiently use
resources for processing hyperspectral satellite image data and other, e.g.,
large environmental datasets that may be analyzed for many purposes.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 18:51:14 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Patterson",
"Maria T",
""
],
[
"Anderson",
"Nikolas",
""
],
[
"Bennett",
"Collin",
""
],
[
"Bruggemann",
"Jacob",
""
],
[
"Grossman",
"Robert",
""
],
[
"Handy",
"Matthew",
""
],
[
"Ly",
"Vuong",
""
],
[
"Mandl",
"Dan",
""
],
[
"Pederson",
"Shane",
""
],
[
"Pivarski",
"Jim",
""
],
[
"Powell",
"Ray",
""
],
[
"Spring",
"Jonathan",
""
],
[
"Wells",
"Walt",
""
]
] |
new_dataset
| 0.997882 |
1602.07024
|
Sailik Sengupta
|
Sailik Sengupta, Satya Gautam Vadlamudi, Subbarao Kambhampati,
Marthony Taguinod, Adam Doup\'e, Ziming Zhao, Gail-Joon Ahn
|
Moving Target Defense for Web Applications using Bayesian Stackelberg
Games
|
9 pages, 4 figures
| null | null | null |
cs.CR cs.AI cs.GT cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present complexity in designing web applications makes software security
a difficult goal to achieve. An attacker can explore a deployed service on the
web and attack at his/her own leisure. Moving Target Defense (MTD) in web
applications is an effective mechanism to nullify this advantage of their
reconnaissance but the framework demands a good switching strategy when
switching between multiple configurations for its web-stack. To address this
issue, we propose modeling of a real-world MTD web application as a repeated
Bayesian game. We then formulate an optimization problem that generates an
effective switching strategy while considering the cost of switching between
different web-stack configurations. To incorporate this model into a developed
MTD system, we develop an automated system for generating attack sets of Common
Vulnerabilities and Exposures (CVEs) for input attacker types with predefined
capabilities. Our framework obtains realistic reward values for the players
(defenders and attackers) in this game by using security domain expertise on
CVEs obtained from the National Vulnerability Database (NVD). We also address
the issue of prioritizing vulnerabilities that when fixed, improves the
security of the MTD system. Lastly, we demonstrate the robustness of our
proposed model by evaluating its performance when there is uncertainty about
input attacker information.
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2016 03:44:16 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2016 18:20:38 GMT"
},
{
"version": "v3",
"created": "Thu, 17 Nov 2016 01:04:59 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Sengupta",
"Sailik",
""
],
[
"Vadlamudi",
"Satya Gautam",
""
],
[
"Kambhampati",
"Subbarao",
""
],
[
"Taguinod",
"Marthony",
""
],
[
"Doupé",
"Adam",
""
],
[
"Zhao",
"Ziming",
""
],
[
"Ahn",
"Gail-Joon",
""
]
] |
new_dataset
| 0.979942 |
1602.07533
|
George MacCartney Jr
|
Katsuyuki Haneda, Lei Tian, Yi Zheng, Henrik Asplund, Jian Li, Yi
Wang, David Steer, Clara Li, Tommaso Balercia, Sunguk Lee, YoungSuk Kim,
Amitava Ghosh, Timothy Thomas, Takehiro Nakamura, Yuichi Kakishima, Tetsuro
Imai, Haralabos Papadopoulas, Theodore S. Rappaport, George R. MacCartney
Jr., Mathew K. Samimi, Shu Sun, Ozge Koymen, Sooyoung Hur, Jeongho Park,
Charlie Zhang, Evangelos Mellios, Andreas F. Molisch, Saeed S. Ghassamzadah,
and Arun Ghosh
|
5G 3GPP-like Channel Models for Outdoor Urban Microcellular and
Macrocellular Environments
|
To be published in 2016 IEEE 83rd Vehicular Technology Conference
Spring (VTC 2016-Spring), Nanjing, China, May 2016
| null |
10.1109/VTCSpring.2016.7503971
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the development of new 5G systems to operate in bands up to 100 GHz,
there is a need for accurate radio propagation models at these bands that
currently are not addressed by existing channel models developed for bands
below 6 GHz. This document presents a preliminary overview of 5G channel models
for bands up to 100 GHz. These have been derived based on extensive measurement
and ray tracing results across a multitude of frequencies from 6 GHz to 100
GHz, and this document describes an initial 3D channel model which includes: 1)
typical deployment scenarios for urban microcells (UMi) and urban macrocells
(UMa), and 2) a baseline model for incorporating path loss, shadow fading, line
of sight probability, penetration and blockage models for the typical
scenarios. Various processing methodologies such as clustering and antenna
decoupling algorithms are also presented.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 14:48:05 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Feb 2016 14:02:08 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Haneda",
"Katsuyuki",
""
],
[
"Tian",
"Lei",
""
],
[
"Zheng",
"Yi",
""
],
[
"Asplund",
"Henrik",
""
],
[
"Li",
"Jian",
""
],
[
"Wang",
"Yi",
""
],
[
"Steer",
"David",
""
],
[
"Li",
"Clara",
""
],
[
"Balercia",
"Tommaso",
""
],
[
"Lee",
"Sunguk",
""
],
[
"Kim",
"YoungSuk",
""
],
[
"Ghosh",
"Amitava",
""
],
[
"Thomas",
"Timothy",
""
],
[
"Nakamura",
"Takehiro",
""
],
[
"Kakishima",
"Yuichi",
""
],
[
"Imai",
"Tetsuro",
""
],
[
"Papadopoulas",
"Haralabos",
""
],
[
"Rappaport",
"Theodore S.",
""
],
[
"MacCartney",
"George R.",
"Jr."
],
[
"Samimi",
"Mathew K.",
""
],
[
"Sun",
"Shu",
""
],
[
"Koymen",
"Ozge",
""
],
[
"Hur",
"Sooyoung",
""
],
[
"Park",
"Jeongho",
""
],
[
"Zhang",
"Charlie",
""
],
[
"Mellios",
"Evangelos",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Ghassamzadah",
"Saeed S.",
""
],
[
"Ghosh",
"Arun",
""
]
] |
new_dataset
| 0.999367 |
1602.09019
|
Cristina Cano
|
Cristina Cano, Alberto Pittolo, David Malone, Lutz Lampe, Andrea M.
Tonello, Anand Dabak
|
State-of-the-art in Power Line Communications: from the Applications to
the Medium
|
19 pages, 12 figures. Accepted for publication, IEEE Journal on
Selected Areas in Communications. Special Issue on Power Line Communications
and its Integration with the Networking Ecosystem. 2016
| null |
10.1109/JSAC.2016.2566018
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent decades, power line communication has attracted considerable
attention from the research community and industry, as well as from regulatory
and standardization bodies. In this article we provide an overview of both
narrowband and broadband systems, covering potential applications, regulatory
and standardization efforts and recent research advancements in channel
characterization, physical layer performance, medium access and higher layer
specifications and evaluations. We also identify areas of current and further
study that will enable the continued success of power line communication
technology.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 16:06:02 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Cano",
"Cristina",
""
],
[
"Pittolo",
"Alberto",
""
],
[
"Malone",
"David",
""
],
[
"Lampe",
"Lutz",
""
],
[
"Tonello",
"Andrea M.",
""
],
[
"Dabak",
"Anand",
""
]
] |
new_dataset
| 0.983567 |
1603.04574
|
Tamoor-Ul-Hassan Syed
|
Syed Tamoor-ul-Hassan, Mehdi Bennis, Pedro H. J. Nardelli, Matti
Latva-Aho
|
Caching in Wireless Small Cell Networks: A Storage-Bandwidth Tradeoff
|
accepted for publication, IEEE Comm Letters 2016
| null |
10.1109/LCOMM.2016.2543698
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching contents at the network edge is an efficient mean for offloading
traffic, reducing latency and improving users' quality-of-experience. In this
letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell
base stations are distributed according to a homogeneous Poisson point process
and cache contents according to a given content popularity distribution,
subject to storage constraints. We provide a closed-form expression of the
cache-miss probability, defined as the probability of not satisfying users'
requests over a given coverage area, as a function of signal-to-interference
ratio, cache size, base stations density and content popularity. In particular,
it is shown that for a given minimum cache size, the popularity based caching
strategy achieves lower outage probability for a given base station density
compared to uniform caching. Furthermore, we show that popularity based caching
attains better performance in terms of cache-miss probability for the same
amount of spectrum.
|
[
{
"version": "v1",
"created": "Tue, 15 Mar 2016 07:19:06 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Mar 2016 09:07:27 GMT"
},
{
"version": "v3",
"created": "Thu, 17 Mar 2016 13:11:18 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Tamoor-ul-Hassan",
"Syed",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Nardelli",
"Pedro H. J.",
""
],
[
"Latva-Aho",
"Matti",
""
]
] |
new_dataset
| 0.999546 |
1603.07055
|
Bo Yuan
|
Bo Yuan, Keshab K. Parhi
|
LLR-based Successive-Cancellation List Decoder for Polar Codes with
Multi-bit Decision
|
accepted by IEEE Trans. Circuits and Systems II
| null |
10.1109/TCSII.2016.2546904
| null |
cs.IT cs.AR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to their capacity-achieving property, polar codes have become one of the
most attractive channel codes. To date, the successive cancellation list (SCL)
decoding algorithm is the primary approach that can guarantee outstanding
error-correcting performance of polar codes. However, the hardware designs of
the original SCL decoder have large silicon area and long decoding latency.
Although some recent efforts can reduce either the area or latency of SCL
decoders, these two metrics still cannot be optimized at the same time. This
paper, for the first time, proposes a general log-likelihood-ratio (LLR)-based
SCL decoding algorithm with multi-bit decision. This new algorithm, referred as
LLR-2Kb-SCL, can determine 2K bits simultaneously for arbitrary K with the use
of LLR messages. In addition, a reduced-data-width scheme is presented to
reduce the critical path of the sorting block. Then, based on the proposed
algorithm, a VLSI architecture of the new SCL decoder is developed. Synthesis
results show that for an example (1024, 512) polar code with list size 4, the
proposed LLR-2Kb-SCL decoders achieve significant reduction in both area and
latency as compared to prior works. As a result, the hardware efficiency of the
proposed designs with K=2 and 3 are 2.33 times and 3.32 times of that of the
state-of-the-art works, respectively.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 02:48:35 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Yuan",
"Bo",
""
],
[
"Parhi",
"Keshab K.",
""
]
] |
new_dataset
| 0.997024 |
1604.02333
|
Sung Hoon LIm
|
Sung Hoon Lim, Chien-Yi Wang, and Michael Gastpar
|
Information Theoretic Caching: The Multi-User Case
|
Submitted to IEEE Trans. Inf. Theory and presented in part at ITA
2016. 43 pages, 8 figures
| null |
10.1109/ISIT.2016.7541354
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider a cache aided network in which each user is
assumed to have individual caches, while upon users' requests, an update
message is sent though a common link to all users. First, we formulate a
general information theoretic setting that represents the database as a
discrete memoryless source, and the users' requests as side information that is
available everywhere except at the cache encoder. The decoders' objective is to
recover a function of the source and the side information. By viewing cache
aided networks in terms of a general distributed source coding problem and
through information theoretic arguments, we present inner and outer bounds on
the fundamental tradeoff of cache memory size and update rate. Then, we
specialize our general inner and outer bounds to a specific model of content
delivery networks: File selection networks, in which the database is a
collection of independent equal-size files and each user requests one of the
files independently. For file selection networks, we provide an outer bound and
two inner bounds (for centralized and decentralized caching strategies). For
the case when the user request information is uniformly distributed, we
characterize the rate vs. cache size tradeoff to within a multiplicative gap of
4. By further extending our arguments to the framework of Maddah-Ali and
Niesen, we also establish a new outer bound and two new inner bounds in which
it is shown to recover the centralized and decentralized strategies, previously
established by Maddah-Ali and Niesen. Finally, in terms of rate vs. cache size
tradeoff, we improve the previous multiplicative gap of 72 to 4.7 for the
average case with uniform requests.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 12:38:25 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Lim",
"Sung Hoon",
""
],
[
"Wang",
"Chien-Yi",
""
],
[
"Gastpar",
"Michael",
""
]
] |
new_dataset
| 0.970983 |
1606.00124
|
Seong Ho Chae
|
Seong Ho Chae and Wan Choi
|
Caching Placement in Stochastic Wireless Caching Helper Networks:
Channel Selection Diversity via Caching
|
12 pages, 11 figures. To appear in IEEE Transactions on Wireless
Communications
| null |
10.1109/TWC.2016.2586841
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content delivery success in wireless caching helper networks depends mainly
on cache-based channel selection diversity and network interference. For given
channel fading and network geometry, both channel selection diversity and
network interference dynamically vary according to what and how the caching
helpers cache at their finite storage space. We study probabilistic content
placement (or caching placement) to desirably control cache-based channel
selection diversity and network interference in a stochastic wireless caching
helper network, with sophisticated considerations of wireless fading channels,
interactions among multiple users such as interference and loads at caching
helpers, and arbitrary memory size. Using stochastic geometry, we derive
optimal caching probabilities in closed form to maximize the average success
probability of content delivery and propose an efficient algorithm to find the
solution in a noise-limited network. In an interference-limited network, based
on a lower bound of the average success probability of content delivery, we
find near-optimal caching probabilities in closed form to control the channel
selection diversity and the network interference. We numerically verify that
the proposed content placement is superior to other comparable content
placement strategies.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 06:00:20 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jun 2016 05:53:50 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Chae",
"Seong Ho",
""
],
[
"Choi",
"Wan",
""
]
] |
new_dataset
| 0.989523 |
1606.01799
|
Ian Holmes
|
Ian Holmes
|
Modular non-repeating codes for DNA storage
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1101/057448
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a strategy for constructing codes for DNA-based information
storage by serial composition of weighted finite-state transducers. The
resulting state machines can integrate correction of substitution errors;
synchronization by interleaving watermark and periodic marker signals;
conversion from binary to ternary, quaternary or mixed-radix sequences via an
efficient block code; encoding into a DNA sequence that avoids homopolymer,
dinucleotide, or trinucleotide runs and other short local repeats; and
detection/correction of errors (including local duplications, burst deletions,
and substitutions) that are characteristic of DNA sequencing technologies. We
present software implementing these codes, available at
github.com/ihh/dnastore, with simulation results demonstrating that the
generated DNA is free of short repeats and can be accurately decoded even in
the presence of substitutions, short duplications and deletions.
|
[
{
"version": "v1",
"created": "Mon, 6 Jun 2016 15:53:57 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Jun 2016 12:52:48 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Holmes",
"Ian",
""
]
] |
new_dataset
| 0.997946 |
1606.06259
|
Amir Zadeh
|
Amir Zadeh, Rowan Zellers, Eli Pincus, Louis-Philippe Morency
|
MOSI: Multimodal Corpus of Sentiment Intensity and Subjectivity Analysis
in Online Opinion Videos
|
Accepted as Journal Publication in IEEE Intelligent Systems
|
IEEE Intelligent Systems 31.6 (2016): 82-88
| null | null |
cs.CL cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People are sharing their opinions, stories and reviews through online video
sharing websites every day. Studying sentiment and subjectivity in these
opinion videos is experiencing a growing attention from academia and industry.
While sentiment analysis has been successful for text, it is an understudied
research question for videos and multimedia content. The biggest setbacks for
studies in this direction are lack of a proper dataset, methodology, baselines
and statistical analysis of how information from different modality sources
relate to each other. This paper introduces to the scientific community the
first opinion-level annotated corpus of sentiment and subjectivity analysis in
online videos called Multimodal Opinion-level Sentiment Intensity dataset
(MOSI). The dataset is rigorously annotated with labels for subjectivity,
sentiment intensity, per-frame and per-opinion annotated visual features, and
per-milliseconds annotated audio features. Furthermore, we present baselines
for future studies in this direction as well as a new multimodal fusion
approach that jointly models spoken words and visual gestures.
|
[
{
"version": "v1",
"created": "Mon, 20 Jun 2016 19:23:53 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Aug 2016 02:39:40 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zadeh",
"Amir",
""
],
[
"Zellers",
"Rowan",
""
],
[
"Pincus",
"Eli",
""
],
[
"Morency",
"Louis-Philippe",
""
]
] |
new_dataset
| 0.999805 |
1609.04371
|
Alberto Camacho
|
Jorge A. Baier, Alberto Camacho, Christian Muise and Sheila A.
McIlraith
|
Finite LTL Synthesis is EXPTIME-complete
|
We withdraw this paper because of an error in the proof
| null | null | null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LTL synthesis -- the construction of a function to satisfy a logical
specification formulated in Linear Temporal Logic -- is a 2EXPTIME-complete
problem with relevant applications in controller synthesis and a myriad of
artificial intelligence applications. In this research note we consider De
Giacomo and Vardi's variant of the synthesis problem for LTL formulas
interpreted over finite rather than infinite traces. Rather surprisingly, given
the existing claims on complexity, we establish that LTL synthesis is
EXPTIME-complete for the finite interpretation, and not 2EXPTIME-complete as
previously reported. Our result coincides nicely with the planning perspective
where non-deterministic planning with full observability is EXPTIME-complete
and partial observability increases the complexity to 2EXPTIME-complete; a
recent related result for LTL synthesis shows that in the finite case with
partial observability, the problem is 2EXPTIME-complete.
|
[
{
"version": "v1",
"created": "Wed, 14 Sep 2016 18:23:25 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 14:12:45 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Baier",
"Jorge A.",
""
],
[
"Camacho",
"Alberto",
""
],
[
"Muise",
"Christian",
""
],
[
"McIlraith",
"Sheila A.",
""
]
] |
new_dataset
| 0.999804 |
1610.04211
|
Julien Perez
|
Julien Perez and Fei Liu
|
Gated End-to-End Memory Networks
|
9 pages, 3 figures, 3 tables
| null | null | null |
cs.CL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine reading using differentiable reasoning models has recently shown
remarkable progress. In this context, End-to-End trainable Memory Networks,
MemN2N, have demonstrated promising performance on simple natural language
based reasoning tasks such as factual reasoning and basic deduction. However,
other tasks, namely multi-fact question-answering, positional reasoning or
dialog related tasks, remain challenging particularly due to the necessity of
more complex interactions between the memory and controller modules composing
this family of models. In this paper, we introduce a novel end-to-end memory
access regulation mechanism inspired by the current progress on the connection
short-cutting principle in the field of computer vision. Concretely, we develop
a Gated End-to-End trainable Memory Network architecture, GMemN2N. From the
machine learning perspective, this new capability is learned in an end-to-end
fashion without the use of any additional supervision signal which is, as far
as our knowledge goes, the first of its kind. Our experiments show significant
improvements on the most challenging tasks in the 20 bAbI dataset, without the
use of any domain knowledge. Then, we show improvements on the dialog bAbI
tasks including the real human-bot conversion-based Dialog State Tracking
Challenge (DSTC-2) dataset. On these two datasets, our model sets the new state
of the art.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 19:38:03 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 15:09:29 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Perez",
"Julien",
""
],
[
"Liu",
"Fei",
""
]
] |
new_dataset
| 0.998988 |
1611.01507
|
Yatin Manerkar
|
Yatin A. Manerkar, Caroline Trippel, Daniel Lustig, Michael Pellauer,
Margaret Martonosi
|
Counterexamples and Proof Loophole for the C/C++ to POWER and ARMv7
Trailing-Sync Compiler Mappings
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The C and C++ high-level languages provide programmers with atomic operations
for writing high-performance concurrent code. At the assembly language level, C
and C++ atomics get mapped down to individual instructions or combinations of
instructions by compilers, depending on the ordering guarantees and
synchronization instructions provided by the underlying architecture. These
compiler mappings must uphold the ordering guarantees provided by C/C++ atomics
or the compiled program will not behave according to the C/C++ memory model. In
this paper we discuss two counterexamples to the well-known trailing-sync
compiler mappings for the Power and ARMv7 architectures that were previously
thought to be proven correct. In addition to the counterexamples, we discuss
the loophole in the proof of the mappings that allowed the incorrect mappings
to be proven correct. We also discuss the current state of compilers and
architectures in relation to the bug.
|
[
{
"version": "v1",
"created": "Fri, 4 Nov 2016 19:52:35 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 03:42:46 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Manerkar",
"Yatin A.",
""
],
[
"Trippel",
"Caroline",
""
],
[
"Lustig",
"Daniel",
""
],
[
"Pellauer",
"Michael",
""
],
[
"Martonosi",
"Margaret",
""
]
] |
new_dataset
| 0.997724 |
1611.05376
|
Sven Zehl
|
Sven Zehl, Anatolij Zubow, Adam Wolisz
|
hMAC: Enabling Hybrid TDMA/CSMA on IEEE 802.11 Hardware
| null | null | null |
TKN-16-0004
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present our current work-in-progress on the design and implementation of a
hybrid TDMA/CSMA medium access architecture, hereafter referred to as hMAC,
which can be used on top of commercial IEEE 802.11 off-the-shelf hardware. The
software only solution is based on the popular Linux ATH9K softMAC driver and
hence can be used with standard Linux systems using Atheros based wireless
network devices. The proposed hMAC exploits the standard 802.11 power saving
functionality present in the ATH9K device driver to enable control of the
software packet queues. This allows the assignment of TDMA time slots on
wireless link and traffic class basis. While the solution is placed only in the
device driver, the CSMA/CA functionality on hardware level is still active.
This enables inter-working with standard unmodified 802.11 devices. We tested
our prototypical hMAC implementation in a small test-bed. Therefore, we
implemented a centralized interference management scheme in which pairs of
links suffering from a hidden node problem are assigned to TDMA time slots on a
per-link basis. To show the benefits of the proposed hMAC approach we compared
the results with standard 802.11 DCF and classical, i.e. per-node, TDMA.
Finally, to enable collaboration with the research community, the hMAC source
code is provided as open-source.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2016 17:29:47 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Nov 2016 10:18:21 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Zehl",
"Sven",
""
],
[
"Zubow",
"Anatolij",
""
],
[
"Wolisz",
"Adam",
""
]
] |
new_dataset
| 0.995404 |
1611.05512
|
Mohammad Reza Saniee
|
Mohammad Reza Saniee
|
Unmatched Perturbation Accommodation for an Aerospace Launch Vehicle
Autopilot Using Dynamic Sliding Manifolds
|
5 pages, 6 figures
|
International Journal on Technical and Physical Problems of
Engineering (IJTPE), September 2016, Issue 28, Volume 8, Number 3, Pages
27-31
| null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sliding mode control of a launch vehicle during its atmospheric flight phase
is studied in the presence of unmatched disturbances. Linear time-varying
dynamics of the aerospace vehicle is converted into a systematic formula and
then dynamic sliding manifold as an advanced method is used in order to
overcome the limited capability of conventional sliding manifolds in minimizing
the undesired effects of unmatched perturbations on the control system. At the
end, simulation results are evaluated and the performance of two approaches are
compared in terms of stability and robustness of the autopilot.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 00:13:45 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Saniee",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.997371 |
1611.05740
|
Wacha Bounliphone
|
Wacha Bounliphone, Eugene Belilovsky, Arthur Tenenhaus, Ioannis
Antonoglou, Arthur Gretton, Matthew B. Blashcko
|
Fast Non-Parametric Tests of Relative Dependency and Similarity
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce two novel non-parametric statistical hypothesis tests. The first
test, called the relative test of dependency, enables us to determine whether
one source variable is significantly more dependent on a first target variable
or a second. Dependence is measured via the Hilbert-Schmidt Independence
Criterion (HSIC). The second test, called the relative test of similarity, is
use to determine which of the two samples from arbitrary distributions is
significantly closer to a reference sample of interest and the relative measure
of similarity is based on the Maximum Mean Discrepancy (MMD). To construct
these tests, we have used as our test statistics the difference of HSIC
statistics and of MMD statistics, respectively. The resulting tests are
consistent and unbiased, and have favorable convergence properties. The
effectiveness of the relative dependency test is demonstrated on several
real-world problems: we identify languages groups from a multilingual parallel
corpus, and we show that tumor location is more dependent on gene expression
than chromosome imbalance. We also demonstrate the performance of the relative
test of similarity over a broad selection of model comparisons problems in deep
generative models.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 15:36:31 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Bounliphone",
"Wacha",
""
],
[
"Belilovsky",
"Eugene",
""
],
[
"Tenenhaus",
"Arthur",
""
],
[
"Antonoglou",
"Ioannis",
""
],
[
"Gretton",
"Arthur",
""
],
[
"Blashcko",
"Matthew B.",
""
]
] |
new_dataset
| 0.994828 |
1611.05799
|
Nichola Abdo
|
Philipp Jund, Nichola Abdo, Andreas Eitel, Wolfram Burgard
|
The Freiburg Groceries Dataset
|
Link to dataset:
http://www2.informatik.uni-freiburg.de/~eitel/freiburg_groceries_dataset.html
Link to code: https://github.com/PhilJd/freiburg_groceries_dataset
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing performance of machine learning techniques in the last
few years, the computer vision and robotics communities have created a large
number of datasets for benchmarking object recognition tasks. These datasets
cover a large spectrum of natural images and object categories, making them not
only useful as a testbed for comparing machine learning approaches, but also a
great resource for bootstrapping different domain-specific perception and
robotic systems. One such domain is domestic environments, where an autonomous
robot has to recognize a large variety of everyday objects such as groceries.
This is a challenging task due to the large variety of objects and products,
and where there is great need for real-world training data that goes beyond
product images available online. In this paper, we address this issue and
present a dataset consisting of 5,000 images covering 25 different classes of
groceries, with at least 97 images per class. We collected all images from
real-world settings at different stores and apartments. In contrast to existing
groceries datasets, our dataset includes a large variety of perspectives,
lighting conditions, and degrees of clutter. Overall, our images contain
thousands of different object instances. It is our hope that machine learning
and robotics researchers find this dataset of use for training, testing, and
bootstrapping their approaches. As a baseline classifier to facilitate
comparison, we re-trained the CaffeNet architecture (an adaptation of the
well-known AlexNet) on our dataset and achieved a mean accuracy of 78.9%. We
release this trained model along with the code and data splits we used in our
experiments.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 17:35:21 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Jund",
"Philipp",
""
],
[
"Abdo",
"Nichola",
""
],
[
"Eitel",
"Andreas",
""
],
[
"Burgard",
"Wolfram",
""
]
] |
new_dataset
| 0.99985 |
1611.05803
|
Mohamed Nait Meziane
|
Thomas Picon, Mohamed Nait Meziane, Philippe Ravier, Guy Lamarque,
Clarisse Novello, Jean-Charles Le Bunetel, Yves Raingeaud
|
COOLL: Controlled On/Off Loads Library, a Public Dataset of High-Sampled
Electrical Signals for Appliance Identification
|
5 pages, 2 figures, 3 tables
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper gives a brief description of the Controlled On/Off Loads Library
(COOLL) dataset. This latter is a dataset of high-sampled electrical current
and voltage measurements representing individual appliances consumption. The
measurements were taken in June 2016 in the PRISME laboratory of the University
of Orl\'eans, France. The appliances are mainly controllable appliances (i.e.
we can precisely control their turn-on/off time instants). 42 appliances of 12
types were measured at a 100 kHz sampling frequency.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 18:03:05 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Picon",
"Thomas",
""
],
[
"Meziane",
"Mohamed Nait",
""
],
[
"Ravier",
"Philippe",
""
],
[
"Lamarque",
"Guy",
""
],
[
"Novello",
"Clarisse",
""
],
[
"Bunetel",
"Jean-Charles Le",
""
],
[
"Raingeaud",
"Yves",
""
]
] |
new_dataset
| 0.999879 |
cs/0009021
|
Rajkumar Buyya
|
Rajkumar Buyya, David Abramson, Jon Giddy
|
Nimrod/G: An Architecture of a Resource Management and Scheduling System
in a Global Computational Grid
| null |
HPC Asia 2000, IEEE Press
|
10.1109/HPC.2000.846563
| null |
cs.DC
| null |
The availability of powerful microprocessors and high-speed networks as
commodity components has enabled high performance computing on distributed
systems (wide-area cluster computing). In this environment, as the resources
are usually distributed geographically at various levels (department,
enterprise, or worldwide) there is a great challenge in integrating,
coordinating and presenting them as a single resource to the user; thus forming
a computational grid. Another challenge comes from the distributed ownership of
resources with each resource having its own access policy, cost, and mechanism.
The proposed Nimrod/G grid-enabled resource management and scheduling system
builds on our earlier work on Nimrod and follows a modular and component-based
architecture enabling extensibility, portability, ease of development, and
interoperability of independently developed components. It uses the Globus
toolkit services and can be easily extended to operate with any other emerging
grid middleware services. It focuses on the management and scheduling of
computations over dynamic resources scattered geographically across the
Internet at department, enterprise, or global level with particular emphasis on
developing scheduling schemes based on the concept of computational economy for
a real test bed, namely, the Globus testbed (GUSTO).
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2000 10:44:16 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Buyya",
"Rajkumar",
""
],
[
"Abramson",
"David",
""
],
[
"Giddy",
"Jon",
""
]
] |
new_dataset
| 0.998742 |
cs/0503040
|
Zhenlei Shen
|
Shalinee Kishore, Stuart C. Schwartz, Larry J. Greenstein, H. Vincent
Poor
|
Uplink Throughput in a Single-Macrocell/Single-Microcell CDMA System,
with Application to Data Access Points
|
To appear in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2005.852144
| null |
cs.IT math.IT
| null |
This paper studies a two-tier CDMA system in which the microcell base is
converted into a data access point (DAP), i.e., a limited-range base station
that provides high-speed access to one user at a time. The microcell (or DAP)
user operates on the same frequency as the macrocell users and has the same
chip rate. However, it adapts its spreading factor, and thus its data rate, in
accordance with interference conditions. By contrast, the macrocell serves
multiple simultaneous data users, each with the same fixed rate. The
achieveable throughput for individual microcell users is examined and a simple,
accurate approximation for its probability distribution is presented.
Computations for average throughputs, both per-user and total, are also
presented. The numerical results highlight the impact of a desensitivity
parameter used in the base-selection process.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2005 16:03:45 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Kishore",
"Shalinee",
""
],
[
"Schwartz",
"Stuart C.",
""
],
[
"Greenstein",
"Larry J.",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.993683 |
cs/0503042
|
Zhenlei Shen
|
Shalinee Kishore, Larry J. Greenstein, H. Vincent Poor, Stuart C.
Schwartz
|
Uplink User Capacity in a CDMA System with Hotspot Microcells: Effects
of Finite Transmit Power and Dispersion
|
To appear in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2006.1611065
| null |
cs.IT math.IT
| null |
This paper examines the uplink user capacity in a two-tier code division
multiple access (CDMA) system with hotspot microcells when user terminal power
is limited and the wireless channel is finitely-dispersive. A
finitely-dispersive channel causes variable fading of the signal power at the
output of the RAKE receiver. First, a two-cell system composed of one macrocell
and one embedded microcell is studied and analytical methods are developed to
estimate the user capacity as a function of a dimensionless parameter that
depends on the transmit power constraint and cell radius. Next, novel
analytical methods are developed to study the effect of variable fading, both
with and without transmit power constraints. Finally, the analytical methods
are extended to estimate uplink user capacity for multicell CDMA systems,
composed of multiple macrocells and multiple embedded microcells. In all cases,
the analysis-based estimates are compared with and confirmed by simulation
results.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2005 17:18:16 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Mar 2005 15:49:49 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Kishore",
"Shalinee",
""
],
[
"Greenstein",
"Larry J.",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Schwartz",
"Stuart C.",
""
]
] |
new_dataset
| 0.998502 |
cs/0504016
|
Navin Kashyap
|
Olgica Milenkovic, Navin Kashyap, David Leyba
|
Shortened Array Codes of Large Girth
|
16 pages; 8 figures; to appear in IEEE Transactions on Information
Theory, Aug 2006
| null |
10.1109/TIT.2006.878179
| null |
cs.DM cs.IT math.IT
| null |
One approach to designing structured low-density parity-check (LDPC) codes
with large girth is to shorten codes with small girth in such a manner that the
deleted columns of the parity-check matrix contain all the variables involved
in short cycles. This approach is especially effective if the parity-check
matrix of a code is a matrix composed of blocks of circulant permutation
matrices, as is the case for the class of codes known as array codes. We show
how to shorten array codes by deleting certain columns of their parity-check
matrices so as to increase their girth. The shortening approach is based on the
observation that for array codes, and in fact for a slightly more general class
of LDPC codes, the cycles in the corresponding Tanner graph are governed by
certain homogeneous linear equations with integer coefficients. Consequently,
we can selectively eliminate cycles from an array code by only retaining those
columns from the parity-check matrix of the original code that are indexed by
integer sequences that do not contain solutions to the equations governing
those cycles. We provide Ramsey-theoretic estimates for the maximum number of
columns that can be retained from the original parity-check matrix with the
property that the sequence of their indices avoid solutions to various types of
cycle-governing equations. This translates to estimates of the rate penalty
incurred in shortening a code to eliminate cycles. Simulation results show that
for the codes considered, shortening them to increase the girth can lead to
significant gains in signal-to-noise ratio in the case of communication over an
additive white Gaussian noise channel.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2005 22:32:25 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Apr 2006 05:57:42 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Milenkovic",
"Olgica",
""
],
[
"Kashyap",
"Navin",
""
],
[
"Leyba",
"David",
""
]
] |
new_dataset
| 0.998914 |
cs/0510068
|
Sinan Gezici
|
Sinan Gezici, Zafer Sahinoglu, Hisashi Kobayashi, and H. Vincent Poor
|
Ultra Wideband Impulse Radio Systems with Multiple Pulse Types
|
To appear in the IEEE Journal on Selected Areas in Communications -
Special Issue on Ultrawideband Wireless Communications: Theory and
Applications
| null |
10.1109/JSAC.2005.863880
| null |
cs.IT math.IT
| null |
In an ultra wideband (UWB) impulse radio (IR) system, a number of pulses,
each transmitted in an interval called a "frame", is employed to represent one
information symbol. Conventionally, a single type of UWB pulse is used in all
frames of all users. In this paper, IR systems with multiple types of UWB
pulses are considered, where different types of pulses can be used in different
frames by different users. Both stored-reference (SR) and transmitted-reference
(TR) systems are considered. First, the spectral properties of a multi-pulse IR
system with polarity randomization is investigated. It is shown that the
average power spectral density is the average of the spectral contents of
different pulse shapes. Then, approximate closed-form expressions for the bit
error probability of a multi-pulse SR-IR system are derived for RAKE receivers
in asynchronous multiuser environments. The effects of both inter-frame
interference (IFI) and multiple-access interference (MAI) are analyzed. The
theoretical and simulation results indicate that SR-IR systems that are more
robust against IFI and MAI than a "conventional" SR-IR system can be designed
with multiple types of ultra-wideband pulses. Finally, extensions to
multi-pulse TR-IR systems are briefly described.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2005 16:35:05 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Gezici",
"Sinan",
""
],
[
"Sahinoglu",
"Zafer",
""
],
[
"Kobayashi",
"Hisashi",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.995186 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.