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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1312.4805
|
Marco Baldi
|
Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce
|
Array Convolutional Low-Density Parity-Check Codes
|
4 pages, 2 figures, accepted for publication in IEEE Communications
Letters
| null |
10.1109/LCOMM.2013.120713.132177
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a design technique for obtaining regular time-invariant
low-density parity-check convolutional (RTI-LDPCC) codes with low complexity
and good performance. We start from previous approaches which unwrap a
low-density parity-check (LDPC) block code into an RTI-LDPCC code, and we
obtain a new method to design RTI-LDPCC codes with better performance and
shorter constraint length. Differently from previous techniques, we start the
design from an array LDPC block code. We show that, for codes with high rate, a
performance gain and a reduction in the constraint length are achieved with
respect to previous proposals. Additionally, an increase in the minimum
distance is observed.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 14:46:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Cancellieri",
"Giovanni",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.998676 |
1401.1406
|
Jianfeng Zhan
|
Lei Wang, Jianfeng Zhan, Chunjie Luo, Yuqing Zhu, Qiang Yang,
Yongqiang He, Wanling Gao, Zhen Jia, Yingjie Shi, Shujie Zhang, Chen Zheng,
Gang Lu, Kent Zhan, Xiaona Li, and Bizhu Qiu
|
BigDataBench: a Big Data Benchmark Suite from Internet Services
|
12 pages, 6 figures, The 20th IEEE International Symposium On High
Performance Computer Architecture (HPCA-2014), February 15-19, 2014, Orlando,
Florida, USA
| null |
10.1109/HPCA.2014.6835958
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As architecture, systems, and data management communities pay greater
attention to innovative big data systems and architectures, the pressure of
benchmarking and evaluating these systems rises. Considering the broad use of
big data systems, big data benchmarks must include diversity of data and
workloads. Most of the state-of-the-art big data benchmarking efforts target
evaluating specific types of applications or system software stacks, and hence
they are not qualified for serving the purposes mentioned above. This paper
presents our joint research efforts on this issue with several industrial
partners. Our big data benchmark suite BigDataBench not only covers broad
application scenarios, but also includes diverse and representative data sets.
BigDataBench is publicly available from http://prof.ict.ac.cn/BigDataBench .
Also, we comprehensively characterize 19 big data workloads included in
BigDataBench with varying data inputs. On a typical state-of-practice
processor, Intel Xeon E5645, we have the following observations: First, in
comparison with the traditional benchmarks: including PARSEC, HPCC, and
SPECCPU, big data applications have very low operation intensity; Second, the
volume of data input has non-negligible impact on micro-architecture
characteristics, which may impose challenges for simulation-based big data
architecture research; Last but not least, corroborating the observations in
CloudSuite and DCBench (which use smaller data inputs), we find that the
numbers of L1 instruction cache misses per 1000 instructions of the big data
applications are higher than in the traditional benchmarks; also, we find that
L3 caches are effective for the big data applications, corroborating the
observation in DCBench.
|
[
{
"version": "v1",
"created": "Mon, 6 Jan 2014 12:35:31 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Feb 2014 20:25:01 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Wang",
"Lei",
""
],
[
"Zhan",
"Jianfeng",
""
],
[
"Luo",
"Chunjie",
""
],
[
"Zhu",
"Yuqing",
""
],
[
"Yang",
"Qiang",
""
],
[
"He",
"Yongqiang",
""
],
[
"Gao",
"Wanling",
""
],
[
"Jia",
"Zhen",
""
],
[
"Shi",
"Yingjie",
""
],
[
"Zhang",
"Shujie",
""
],
[
"Zheng",
"Chen",
""
],
[
"Lu",
"Gang",
""
],
[
"Zhan",
"Kent",
""
],
[
"Li",
"Xiaona",
""
],
[
"Qiu",
"Bizhu",
""
]
] |
new_dataset
| 0.995564 |
1401.5297
|
Gergeky Bicz\'ok
|
Gergely Biczok, Santiago Diez Martinez, Thomas Jelle, John Krogstie
|
Navigating MazeMap: indoor human mobility, spatio-logical ties and
future potential
|
6 pages, accepted at PerMoby Workshop at IEEE PerCom 2014
| null |
10.1109/PerComW.2014.6815215
| null |
cs.SY cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Global navigation systems and location-based services have found their way
into our daily lives. Recently, indoor positioning techniques have also been
proposed, and there are several live or trial systems already operating. In
this paper, we present insights from MazeMap, the first live indoor/outdoor
positioning and navigation system deployed at a large university campus in
Norway. Our main contribution is a measurement case study; we show the spatial
and temporal distribution of MazeMap geo-location and wayfinding requests,
construct the aggregated human mobility map of the campus and find strong
logical ties between different locations. On one hand, our findings are
specific to the venue; on the other hand, the nature of available data and
insights coupled with our discussion on potential usage scenarios for indoor
positioning and location-based services predict a successful future for these
systems and applications.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 12:57:08 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Biczok",
"Gergely",
""
],
[
"Martinez",
"Santiago Diez",
""
],
[
"Jelle",
"Thomas",
""
],
[
"Krogstie",
"John",
""
]
] |
new_dataset
| 0.999048 |
1403.5089
|
Ranga Prasad
|
Ranga Prasad, Srikrishna Bhashyam, and A. Chockalingam
|
On the Gaussian Many-to-One X Channel
|
Submitted to IEEE Transactions on Information Theory; Revised and
updated version of the original draft
| null |
10.1109/TIT.2015.2499746
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the Gaussian many-to-one X channel, which is a special case of
general multiuser X channel, is studied. In the Gaussian many-to-one X channel,
communication links exist between all transmitters and one of the receivers,
along with a communication link between each transmitter and its corresponding
receiver. As per the X channel assumption, transmission of messages is allowed
on all the links of the channel. This communication model is different from the
corresponding many-to-one interference channel (IC). Transmission strategies
which involve using Gaussian codebooks and treating interference from a subset
of transmitters as noise are formulated for the above channel. Sum-rate is used
as the criterion of optimality for evaluating the strategies. Initially, a $3
\times 3$ many-to-one X channel is considered and three transmission strategies
are analyzed. The first two strategies are shown to achieve sum-rate capacity
under certain channel conditions. For the third strategy, a sum-rate outer
bound is derived and the gap between the outer bound and the achieved rate is
characterized. These results are later extended to the $K \times K$ case. Next,
a region in which the many-to-one X channel can be operated as a many-to-one IC
without loss of sum-rate is identified. Further, in the above region, it is
shown that using Gaussian codebooks and treating interference as noise achieves
a rate point that is within $K/2 -1$ bits from the sum-rate capacity.
Subsequently, some implications of the above results to the Gaussian
many-to-one IC are discussed. Transmission strategies for the many-to-one IC
are formulated and channel conditions under which the strategies achieve
sum-rate capacity are obtained. A region where the sum-rate capacity can be
characterized to within $K/2-1$ bits is also identified.
|
[
{
"version": "v1",
"created": "Thu, 20 Mar 2014 10:31:29 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Jun 2015 17:18:17 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Prasad",
"Ranga",
""
],
[
"Bhashyam",
"Srikrishna",
""
],
[
"Chockalingam",
"A.",
""
]
] |
new_dataset
| 0.976082 |
1404.3075
|
Marco Baldi
|
Marco Baldi, Nicola Maturo, Giacomo Ricciutelli, Franco Chiaraluce
|
Practical LDPC coded modulation schemes for the fading broadcast channel
with confidential messages
|
6 pages, 4 figures, to be presented at IEEE ICC'14 - Workshop on
Wireless Physical Layer Security
| null |
10.1109/ICCW.2014.6881291
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The broadcast channel with confidential messages is a well studied scenario
from the theoretical standpoint, but there is still lack of practical schemes
able to achieve some fixed level of reliability and security over such a
channel. In this paper, we consider a quasi-static fading channel in which both
public and private messages must be sent from the transmitter to the receivers,
and we aim at designing suitable coding and modulation schemes to achieve such
a target. For this purpose, we adopt the error rate as a metric, by considering
that reliability (security) is achieved when a sufficiently low (high) error
rate is experienced at the receiving side. We show that some conditions exist
on the system feasibility, and that some outage probability must be tolerated
to cope with the fading nature of the channel. The proposed solution exploits
low-density parity-check codes with unequal error protection, which are able to
guarantee two different levels of protection against noise for the public and
the private information, in conjunction with different modulation schemes for
the public and the private message bits.
|
[
{
"version": "v1",
"created": "Fri, 11 Apr 2014 11:27:53 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Maturo",
"Nicola",
""
],
[
"Ricciutelli",
"Giacomo",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.987414 |
1404.6560
|
Jad Hachem
|
Jad Hachem, Nikhil Karamchandani, Suhas Diggavi
|
Content Caching and Delivery over Heterogeneous Wireless Networks
|
A shorter version is to appear in IEEE INFOCOM 2015
| null |
10.1109/INFOCOM.2015.7218445
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emerging heterogeneous wireless architectures consist of a dense deployment
of local-coverage wireless access points (APs) with high data rates, along with
sparsely-distributed, large-coverage macro-cell base stations (BS). We design a
coded caching-and-delivery scheme for such architectures that equips APs with
storage, enabling content pre-fetching prior to knowing user demands. Users
requesting content are served by connecting to local APs with cached content,
as well as by listening to a BS broadcast transmission. For any given content
popularity profile, the goal is to design the caching-and-delivery scheme so as
to optimally trade off the transmission cost at the BS against the storage cost
at the APs and the user cost of connecting to multiple APs. We design a coded
caching scheme for non-uniform content popularity that dynamically allocates
user access to APs based on requested content. We demonstrate the approximate
optimality of our scheme with respect to information-theoretic bounds. We
numerically evaluate it on a YouTube dataset and quantify the trade-off between
transmission rate, storage, and access cost. Our numerical results also suggest
the intriguing possibility that, to gain most of the benefits of coded caching,
it suffices to divide the content into a small number of popularity classes.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 21:22:55 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Mar 2015 08:48:08 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Hachem",
"Jad",
""
],
[
"Karamchandani",
"Nikhil",
""
],
[
"Diggavi",
"Suhas",
""
]
] |
new_dataset
| 0.988535 |
1406.4259
|
Mauro Femminella
|
Luca Felicetti, Mauro Femminella, Gianluca Reali, Tadashi Nakano,
Athanasios V. Vasilakos
|
TCP-like molecular communications
|
Accepted for publication, IEEE Journal on Selected Areas in
Communications, 2014
| null |
10.1109/JSAC.2014.2367653
| null |
cs.ET cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a communication protocol between a pair of
biological nanomachines, transmitter and receiver, built upon molecular
communications in an aqueous environment. In our proposal, the receiver, acting
as a control node, sends a connection setup signal to the transmitter, which
stokes molecules, to start molecule transmission. The molecules transmitted by
the transmitter propagate in the environment and are absorbed by the receiver
through its receptors. When the receiver absorbs the desired quantity of
molecules, it releases a tear-down signal to notify the transmitter to stop the
transmission. The proposed protocol implements a bidirectional communication by
using a number of techniques originally designed for the TCP. In fact, the
proposed protocol is connection-oriented, and uses the TCP-like probing to find
a suitable transmission rate between transmitter and receiver so as to avoid
receiver congestion. Unlike the TCP, however, explicit acknowledgments are not
used, since they would degrade the communication throughput due to the large
delay, a characteristic feature of molecular communications. Thus, the proposed
protocol uses implicit acknowledgments, and feedback signals are sent by the
receiver to throttle the transmission rate at the transmitter, i.e., explicit
negative feedbacks. We also present the results of an extensive simulation
campaign, used to validate the proposed protocol and to properly dimension the
main protocol parameters.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 07:15:10 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Felicetti",
"Luca",
""
],
[
"Femminella",
"Mauro",
""
],
[
"Reali",
"Gianluca",
""
],
[
"Nakano",
"Tadashi",
""
],
[
"Vasilakos",
"Athanasios V.",
""
]
] |
new_dataset
| 0.999855 |
1406.5765
|
Ming Jin
|
Ming Jin, Han Zou, Kevin Weekly, Ruoxi Jia, Alexandre M. Bayen, and
Costas J. Spanos
|
Environmental Sensing by Wearable Device for Indoor Activity and
Location Estimation
|
submitted to the 40th Annual Conference of the IEEE Industrial
Electronics Society (IECON)
| null |
10.1109/IECON.2014.7049320
| null |
cs.HC stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present results from a set of experiments in this pilot study to
investigate the causal influence of user activity on various environmental
parameters monitored by occupant carried multi-purpose sensors. Hypotheses with
respect to each type of measurements are verified, including temperature,
humidity, and light level collected during eight typical activities: sitting in
lab / cubicle, indoor walking / running, resting after physical activity,
climbing stairs, taking elevators, and outdoor walking. Our main contribution
is the development of features for activity and location recognition based on
environmental measurements, which exploit location- and activity-specific
characteristics and capture the trends resulted from the underlying
physiological process. The features are statistically shown to have good
separability and are also information-rich. Fusing environmental sensing
together with acceleration is shown to achieve classification accuracy as high
as 99.13%. For building applications, this study motivates a sensor fusion
paradigm for learning individualized activity, location, and environmental
preferences for energy management and user comfort.
|
[
{
"version": "v1",
"created": "Sun, 22 Jun 2014 21:13:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Jin",
"Ming",
""
],
[
"Zou",
"Han",
""
],
[
"Weekly",
"Kevin",
""
],
[
"Jia",
"Ruoxi",
""
],
[
"Bayen",
"Alexandre M.",
""
],
[
"Spanos",
"Costas J.",
""
]
] |
new_dataset
| 0.999387 |
1406.7116
|
Jalaluddin Qureshi
|
Jalaluddin Qureshi, Chuan Heng Foh, Jianfei Cai
|
Maximum Multipath Routing Throughput in Multirate Wireless Mesh Networks
|
This paper has been accepted for publication in IEEE 80th Vehicular
Technology Conference, VTC-Fall 2014
| null |
10.1109/VTCFall.2014.6966047
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we consider the problem of finding the maximum routing
throughput between any pair of nodes in an arbitrary multirate wireless mesh
network (WMN) using multiple paths. Multipath routing is an efficient technique
to maximize routing throughput in WMN, however maximizing multipath routing
throughput is a NP-complete problem due to the shared medium for
electromagnetic wave transmission in wireless channel, inducing collision-free
scheduling as part of the optimization problem. In this work, we first provide
problem formulation that incorporates collision-free schedule, and then based
on this formulation we design an algorithm with search pruning that jointly
optimizes paths and transmission schedule. Though suboptimal, compared to the
known optimal single path flow, we demonstrate that an efficient multipath
routing scheme can increase the routing throughput by up to 100% for simple
WMNs.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 08:59:11 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Qureshi",
"Jalaluddin",
""
],
[
"Foh",
"Chuan Heng",
""
],
[
"Cai",
"Jianfei",
""
]
] |
new_dataset
| 0.995358 |
1407.4017
|
Dyonisius Dony Ariananda
|
Dyonisius Dony Ariananda, Daniel Romero, and Geert Leus
|
Compressive Periodogram Reconstruction Using Uniform Binning
|
Submitted to IEEE Transactions on Signal Processing
| null |
10.1109/TSP.2015.2430838
| null |
cs.OH math.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, two problems that show great similarities are examined. The
first problem is the reconstruction of the angular-domain periodogram from
spatial-domain signals received at different time indices. The second one is
the reconstruction of the frequency-domain periodogram from time-domain signals
received at different wireless sensors. We split the entire angular or
frequency band into uniform bins. The bin size is set such that the received
spectra at two frequencies or angles, whose distance is equal to or larger than
the size of a bin, are uncorrelated. These problems in the two different
domains lead to a similar circulant structure in the so-called coset
correlation matrix. This circulant structure allows for a strong compression
and a simple least-squares reconstruction method. The latter is possible under
the full column rank condition of the system matrix, which can be achieved by
designing the spatial or temporal sampling patterns based on a circular sparse
ruler. We analyze the statistical performance of the compressively
reconstructed periodogram including bias and variance. We further consider the
case when the bins are so small that the received spectra at two frequencies or
angles, with a spacing between them larger than the size of the bin, can still
be correlated. In this case, the resulting coset correlation matrix is
generally not circulant and thus a special approach is required.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 16:40:57 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Dec 2014 15:50:35 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ariananda",
"Dyonisius Dony",
""
],
[
"Romero",
"Daniel",
""
],
[
"Leus",
"Geert",
""
]
] |
new_dataset
| 0.996861 |
1408.2335
|
Suzhi Bi
|
Suzhi Bi, Chin Keong Ho, and Rui Zhang
|
Wireless Powered Communication: Opportunities and Challenges
|
Accepted for publication by IEEE Communications Magazine
| null |
10.1109/MCOM.2015.7081084
| null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The performance of wireless communication is fundamentally constrained by the
limited battery life of wireless devices, whose operations are frequently
disrupted due to the need of manual battery replacement/recharging. The recent
advance in radio frequency (RF) enabled wireless energy transfer (WET)
technology provides an attractive solution named wireless powered communication
(WPC), where the wireless devices are powered by dedicated wireless power
transmitters to provide continuous and stable microwave energy over the air. As
a key enabling technology for truly perpetual communications, WPC opens up the
potential to build a network with larger throughput, higher robustness, and
increased flexibility compared to its battery-powered counterpart. However, the
combination of wireless energy and information transmissions also raises many
new research problems and implementation issues to be addressed. In this
article, we provide an overview of state-of-the-art RF-enabled WET technologies
and their applications to wireless communications, with highlights on the key
design challenges, solutions, and opportunities ahead.
|
[
{
"version": "v1",
"created": "Mon, 11 Aug 2014 07:40:48 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Dec 2014 12:50:12 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Bi",
"Suzhi",
""
],
[
"Ho",
"Chin Keong",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.99826 |
1409.3940
|
Arpan Chattopadhyay
|
Arpan Chattopadhyay, Avishek Ghosh, Akhila S. Rao, Bharat Dwivedi,
S.V.R. Anand, Marceau Coupechoux, and Anurag Kumar
|
Impromptu Deployment of Wireless Relay Networks: Experiences Along a
Forest Trail
|
7 pages, accepted in IEEE MASS 2014
| null |
10.1109/MASS.2014.33
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are motivated by the problem of impromptu or as- you-go deployment of
wireless sensor networks. As an application example, a person, starting from a
sink node, walks along a forest trail, makes link quality measurements (with
the previously placed nodes) at equally spaced locations, and deploys relays at
some of these locations, so as to connect a sensor placed at some a priori
unknown point on the trail with the sink node. In this paper, we report our
experimental experiences with some as-you-go deployment algorithms. Two
algorithms are based on Markov decision process (MDP) formulations; these
require a radio propagation model. We also study purely measurement based
strategies: one heuristic that is motivated by our MDP formulations, one
asymptotically optimal learning algorithm, and one inspired by a popular
heuristic. We extract a statistical model of the propagation along a forest
trail from raw measurement data, implement the algorithms experimentally in the
forest, and compare them. The results provide useful insights regarding the
choice of the deployment algorithm and its parameters, and also demonstrate the
necessity of a proper theoretical formulation.
|
[
{
"version": "v1",
"created": "Sat, 13 Sep 2014 12:28:01 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chattopadhyay",
"Arpan",
""
],
[
"Ghosh",
"Avishek",
""
],
[
"Rao",
"Akhila S.",
""
],
[
"Dwivedi",
"Bharat",
""
],
[
"Anand",
"S. V. R.",
""
],
[
"Coupechoux",
"Marceau",
""
],
[
"Kumar",
"Anurag",
""
]
] |
new_dataset
| 0.997132 |
1409.6624
|
Bernhard Rumpe
|
Holger Krahn, Bernhard Rumpe, Steven V\"olkel
|
Integrated Definition of Abstract and Concrete Syntax for Textual
Languages
|
15 pages, 12 figures. arXiv admin note: text overlap with
arXiv:1409.2367
|
Proceedings of the ACM/IEEE 10th International Conference on Model
Driven Engineering Languages and Systems (MODELS 2007), Nashville, TN, USA,
LNCS 4735
|
10.1007/978-3-540-75209-7_20
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An understandable concrete syntax and a comprehensible abstract syntax are
two central aspects of defining a modeling language. Both representations of a
language significantly overlap in their structure and also information, but may
also differ in parts of the information. To avoid discrepancies and problems
while handling the language, concrete and abstract syntax need to be
consistently defined. This will become an even bigger problem, when domain
specific languages will become used to a larger extent. In this paper we
present an extended grammar format that avoids redundancy between concrete and
abstract syntax by allowing an integrated definition of both for textual
modeling languages. For an amendment of the usability of the abstract syntax it
furthermore integrates meta-modeling concepts like associations and inheritance
into a well-understood grammar-based approach. This forms a sound foundation
for an extensible grammar and therefore language definition.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 12:39:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Krahn",
"Holger",
""
],
[
"Rumpe",
"Bernhard",
""
],
[
"Völkel",
"Steven",
""
]
] |
new_dataset
| 0.988143 |
1410.0213
|
Iqbal Hussain
|
Iqbal Hussain, Ming Xiao, and Lars K. Rasmussen
|
Buffer-Based Distributed LT Codes
|
14 pages, 17 figures, submitted
|
IEEE Transactions on Communications 2014
|
10.1109/TCOMM.2014.2362111
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We focus on the design of distributed Luby transform (DLT) codes for erasure
networks with multiple sources and multiple relays, communicating to a single
destination. The erasure-floor performance of DLT codes improves with the
maximum degree of the relay-degree distribution. However, for conventional DLT
codes, the maximum degree is upper-bounded by the number of sources. An
additional constraint is that the sources are required to have the same
information block length. We introduce a $D$-bit buffer for each source-relay
link, which allows the relay to select multiple encoded bits from the same
source for the relay-encoding process; thus, the number of sources no longer
limits the maximum degree at the relay. Furthermore, the introduction of
buffers facilitates the use of different information block sizes across
sources. Based on density evolution we develop an asymptotic analytical
framework for optimization of the relay-degree distribution. We further
integrate techniques for unequal erasure protection into the optimization
framework. The proposed codes are considered for both lossless and lossy
source-relay links. Numerical examples show that there is no loss in erasure
performance for transmission over lossy source-relay links as compared to
lossless links. Additional delays, however, may occur. The design framework and
our contributions are demonstrated by a number of illustrative examples,
showing the improvements obtained by the proposed buffer-based DLT codes.
|
[
{
"version": "v1",
"created": "Wed, 1 Oct 2014 13:28:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Hussain",
"Iqbal",
""
],
[
"Xiao",
"Ming",
""
],
[
"Rasmussen",
"Lars K.",
""
]
] |
new_dataset
| 0.999824 |
1410.6831
|
Benjamin Larrousse
|
Benjamin Larrousse, Olivier Beaude and Samson Lasaulce
|
Crawford-Sobel meet Lloyd-Max on the grid
|
ICASSP 2014, 5 pages
|
IEEE International Conference on Acoustics, Speech and Signal
Processing (ICASSP), Florence, Italy, May 2014
|
10.1109/ICASSP.2014.6854781
| null |
cs.OH cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main contribution of this work is twofold. First, we apply, for the first
time, a framework borrowed from economics to a problem in the smart grid
namely, the design of signaling schemes between a consumer and an electricity
aggregator when these have non-aligned objectives. The consumer's objective is
to meet its need in terms of power and send a request (a message) to the
aggregator which does not correspond, in general, to its actual need. The
aggregator, which receives this request, not only wants to satisfy it but also
wants to manage the cost induced by the residential electricity distribution
network. Second, we establish connections between the exploited framework and
the quantization problem. Although the model assumed for the payoff functions
for the consumer and aggregator is quite simple, it allows one to extract
insights of practical interest from the analysis conducted. This allows us to
establish a direct connection with quantization, and more importantly, to open
a much more general challenge for source and channel coding.
|
[
{
"version": "v1",
"created": "Fri, 5 Sep 2014 12:45:14 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Larrousse",
"Benjamin",
""
],
[
"Beaude",
"Olivier",
""
],
[
"Lasaulce",
"Samson",
""
]
] |
new_dataset
| 0.99888 |
1410.8797
|
Seyed Mohammad Azimi-Abarghouyi
|
Seyed Mohammad Azimi-Abarghouyi, Masoumeh Nasiri-Kenari, Behrouz Maham
|
Integer Forcing-and-Forward Transceiver Design for MIMO Multi-Pair
Two-Way Relaying
|
30 pages, 7 figures, Submitted to a IEEE journal
| null |
10.1109/TVT.2016.2518667
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new transmission scheme, named as Integer
Forcing-and-Forward (IFF), for communications among multi-pair multiple-antenna
users in which each pair exchanges their messages with the help of a single
multi antennas relay in the multiple-access and broadcast phases. The proposed
scheme utilizes Integer Forcing Linear Receiver (IFLR) at relay, which uses
equations, i.e., linear integer-combinations of messages, to harness the
intra-pair interference. Accordingly, we propose the design of mean squared
error (MSE) based transceiver, including precoder and projection matrices for
the relay and users, assuming that the perfect channel state information (CSI)
is available. In this regards, in the multiple-access phase, we introduce two
new MSE criteria for the related precoding and filter designs, i.e., the sum of
the equations MSE (Sum-Equation MSE) and the maximum of the equations MSE
(Max-Equation MSE), to exploit the equations in the relay. In addition, the
convergence of the proposed criteria is proven as well. Moreover, in the
broadcast phase, we use the two traditional MSE criteria, i.e. the sum of the
users' mean squred errors (Sum MSE) and the maximum of the users' mean squared
errors (Max MSE), to design the related precoding and filters for recovering
relay's equations by the users. Then, we consider a more practical scenario
with imperfect CSI. For this case, IFLR receiver is modified, and another
transceiver design is proposed, which take into account the effect of channels
estimation error. We evaluate the performance of our proposed strategy and
compare the results with the conventional amplify-and-forward (AF) and
denoise-and-forward (DF) strategies for the same scenario. The results indicate
the substantial superiority of the proposed strategy in terms of the outage
probability and the sum rate.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2014 16:39:08 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Jan 2015 20:43:02 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Feb 2015 13:56:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Azimi-Abarghouyi",
"Seyed Mohammad",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
],
[
"Maham",
"Behrouz",
""
]
] |
new_dataset
| 0.972579 |
1411.1215
|
Blesson Varghese
|
Muhammed Asif Saleem, Blesson Varghese and Adam Barker
|
BigExcel: A Web-Based Framework for Exploring Big Data in Social
Sciences
|
8 pages
|
Workshop of Big Humanities Data at the IEEE International
Conference on Big Data (IEEE BigData) 2014, Washington D. C., USA
|
10.1109/BigData.2014.7004458
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper argues that there are three fundamental challenges that need to be
overcome in order to foster the adoption of big data technologies in
non-computer science related disciplines: addressing issues of accessibility of
such technologies for non-computer scientists, supporting the ad hoc
exploration of large data sets with minimal effort and the availability of
lightweight web-based frameworks for quick and easy analytics. In this paper,
we address the above three challenges through the development of 'BigExcel', a
three tier web-based framework for exploring big data to facilitate the
management of user interactions with large data sets, the construction of
queries to explore the data set and the management of the infrastructure. The
feasibility of BigExcel is demonstrated through two Yahoo Sandbox datasets. The
first dataset is the Yahoo Buzz Score data set we use for quantitatively
predicting trending technologies and the second is the Yahoo n-gram corpus we
use for qualitatively inferring the coverage of important events. A
demonstration of the BigExcel framework and source code is available at
http://bigdata.cs.st-andrews.ac.uk/projects/bigexcel-exploring-big-data-for-social-sciences/.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2014 10:22:27 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Saleem",
"Muhammed Asif",
""
],
[
"Varghese",
"Blesson",
""
],
[
"Barker",
"Adam",
""
]
] |
new_dataset
| 0.964689 |
1412.5867
|
Lidia Dobrescu
|
Lidia Dobrescu
|
Replacing ANSI C with other modern programming languages
|
IEEE International Symposium on Fundamentals of Electrical
Engineering 2014, ISFEE 2014, Bucharest
| null |
10.1109/ISFEE.2014.7050621
| null |
cs.CY cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
Replacing ANSI C language with other modern programming languages such as
Python or Java may be an actual debate topic in technical universities.
Researchers whose primary interests are not in programming area seem to prefer
modern and higher level languages. Keeping standard language ANSI C as a
primary tool for engineers and for microcontrollers programming, robotics and
data acquisition courses is another strong different opinion trend. Function
oriented versus object oriented languages may be another highlighted topic in
actual debates.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2014 14:21:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dobrescu",
"Lidia",
""
]
] |
new_dataset
| 0.998209 |
1412.7512
|
Giuseppe Durisi
|
Giuseppe Durisi, Tobias Koch, Johan \"Ostman, Yury Polyanskiy, Wei
Yang
|
Short-Packet Communications over Multiple-Antenna Rayleigh-Fading
Channels
|
11 pages, 4 figures; to appear in IEEE Transactions on
Communications; the numerical routines used for the simulation results are
part of SPECTRE (short-packet communication toolbox) and can be downloaded at
https://github.com/yp-mit/spectre
| null |
10.1109/TCOMM.2015.2511087
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the current interest in ultra-reliable, low-latency,
machine-type communication systems, we investigate the tradeoff between
reliability, throughput, and latency in the transmission of information over
multiple-antenna Rayleigh block-fading channels. Specifically, we obtain
finite-blocklength, finite-SNR upper and lower bounds on the maximum coding
rate achievable over such channels for a given constraint on the packet error
probability. Numerical evidence suggests that our bounds delimit tightly the
maximum coding rate already for short blocklengths (packets of about 100
symbols). Furthermore, our bounds reveal the existence of a tradeoff between
the rate gain obtainable by spreading each codeword over all available
time-frequency-spatial degrees of freedom, and the rate loss caused by the need
of estimating the fading coefficients over these degrees of freedom. In
particular, our bounds allow us to determine the optimal number of transmit
antennas and the optimal number of time-frequency diversity branches that
maximize the rate. Finally, we show that infinite-blocklength performance
metrics such as the ergodic capacity and the outage capacity yield inaccurate
throughput estimates.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2014 20:41:36 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Aug 2015 15:57:31 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Dec 2015 21:12:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Durisi",
"Giuseppe",
""
],
[
"Koch",
"Tobias",
""
],
[
"Östman",
"Johan",
""
],
[
"Polyanskiy",
"Yury",
""
],
[
"Yang",
"Wei",
""
]
] |
new_dataset
| 0.970934 |
1501.00029
|
Liane Gabora
|
Liane Gabora
|
LIVEIA: A Light-based Immersive Visualization Environment for
Imaginative Actualization
|
6 pages in Gabora, L. (2015). Proc 12th International Conf on
Information Technology: New Generations (pp. 686-691). Washington DC: IEEE
Conf Publishing Services. arXiv admin note: substantial text overlap with
arXiv:1409.1064
| null |
10.1109/ITNG.2015.115
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes an immersive and interactive visualization environment
that uses light as a metaphor for psychological phenomena. Creative life force
is portrayed as ambient light, and peoples' psyches are represented by spheres
that amplify and transform light. Personality characteristics, situations, and
relationships are systematically depicted using a systematic visual language
based on the properties of light and how it interacts with physical objects.
The technology enables users to visualize and creatively experiment with
light-based representations of themselves and others, including patterns of
interaction and how they have come about, and how they could change and unfold
in the future.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 21:57:18 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Apr 2015 18:00:48 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gabora",
"Liane",
""
]
] |
new_dataset
| 0.978887 |
1501.01563
|
Borzoo Rassouli
|
Borzoo Rassouli, Chenxi Hao and Bruno Clerckx
|
A New Proof for the DoF Region of the MIMO Networks with No CSIT
|
Accepted to IEEE Communications Letters. arXiv admin note:
substantial text overlap with arXiv:1401.5676
| null |
10.1109/LCOMM.2014.2382584
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new proof for the degrees of freedom (DoF) region of the
K-user multiple-input multiple-output (MIMO) broadcast channel (BC) with no
channel state information at the transmitter (CSIT) and perfect channel state
information at the receivers (CSIR) is provided. Based on this proof, the
capacity region of a certain class of MIMO BC with channel distribution
information at the transmitter (CDIT) and perfect CSIR is derived. Finally, an
outer bound for the DoF region of the K-user MIMO interference channel (IC)
with no CSIT is provided.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2015 17:14:16 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rassouli",
"Borzoo",
""
],
[
"Hao",
"Chenxi",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.996605 |
1501.02317
|
Xiaoxiong Zhong
|
Xiaoxiong Zhong, Yang Qin, Yuanyuan Yang and Li Li
|
CROR: Coding-Aware Opportunistic Routing in Multi-Channel Cognitive
Radio Networks
|
6 pages, 8 figures, to appear in Proc. of IEEE GlobeCom 2014
| null |
10.1109/GLOCOM.2014.7036791
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive radio (CR) is a promising technology to improve spectrum
utilization. However, spectrum availability is uncertain which mainly depends
on primary user's (PU's) behaviors. This makes it more difficult for most
existing CR routing protocols to achieve high throughput in multi-channel
cognitive radio networks (CRNs). Inter-session network coding and opportunistic
routing can leverage the broadcast nature of the wireless channel to improve
the performance for CRNs. In this paper we present a coding aware opportunistic
routing protocol for multi-channel CRNs, cognitive radio opportunistic routing
(CROR) protocol, which jointly considers the probability of successful spectrum
utilization, packet loss rate, and coding opportunities. We evaluate and
compare the proposed scheme against three other opportunistic routing protocols
with multichannel. It is shown that the CROR, by integrating opportunistic
routing with network coding, can obtain much better results, with respect to
throughput, the probability of PU-SU packet collision and spectrum utilization
efficiency.
|
[
{
"version": "v1",
"created": "Sat, 10 Jan 2015 07:51:15 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Feb 2015 03:29:17 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zhong",
"Xiaoxiong",
""
],
[
"Qin",
"Yang",
""
],
[
"Yang",
"Yuanyuan",
""
],
[
"Li",
"Li",
""
]
] |
new_dataset
| 0.996394 |
1501.02478
|
Lin Gao
|
Yuan Luo, Lin Gao, and Jianwei Huang
|
HySIM: A Hybrid Spectrum and Information Market for TV White Space
Networks
|
This manuscript serves as the online technical report of the article
published in IEEE International Conference on Computer Communications
(INFOCOM), 2015
| null |
10.1109/INFOCOM.2015.7218461
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a hybrid spectrum and information market for a database-assisted
TV white space network, where the geo-location database serves as both a
spectrum market platform and an information market platform. We study the
inter- actions among the database operator, the spectrum licensee, and
unlicensed users systematically, using a three-layer hierarchical model. In
Layer I, the database and the licensee negotiate the commission fee that the
licensee pays for using the spectrum market platform. In Layer II, the database
and the licensee compete for selling information or channels to unlicensed
users. In Layer III, unlicensed users determine whether they should buy the
exclusive usage right of licensed channels from the licensee, or the
information regarding unlicensed channels from the database. Analyzing such a
three-layer model is challenging due to the co-existence of both positive and
negative network externalities in the information market. We characterize how
the network externalities affect the equilibrium behaviours of all parties
involved. Our numerical results show that the proposed hybrid market can
improve the network profit up to 87%, compared with a pure information market.
Meanwhile, the achieved network profit is very close to the coordinated
benchmark solution (the gap is less than 4% in our simulation).
|
[
{
"version": "v1",
"created": "Sun, 11 Jan 2015 18:13:05 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Feb 2016 02:20:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Luo",
"Yuan",
""
],
[
"Gao",
"Lin",
""
],
[
"Huang",
"Jianwei",
""
]
] |
new_dataset
| 0.996527 |
1501.06647
|
Guoqiang Mao Dr
|
Zijie Zhang, Guoqiang Mao, Brian Anderson
|
Energy Efficient Broadcast in Mobile Networks Subject to Channel
Randomness
|
accepted to appear in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2015.2398430
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless communication in a network of mobile devices is a challenging and
resource demanding task, due to the highly dynamic network topology and the
wireless channel randomness. This paper investigates information broadcast
schemes in 2D mobile ad-hoc networks where nodes are initially randomly
distributed and then move following a random direction mobility model. Based on
an in-depth analysis of the popular Susceptible-Infectious-Recovered epidemic
broadcast scheme, this paper proposes a novel energy and bandwidth efficient
broadcast scheme, named the energy-efficient broadcast scheme, which is able to
adapt to fast-changing network topology and channel randomness. Analytical
results are provided to characterize the performance of the proposed scheme,
including the fraction of nodes that can receive the information and the delay
of the information dissemination process. The accuracy of analytical results is
verified using simulations driven by both the random direction mobility model
and a real world trace.
|
[
{
"version": "v1",
"created": "Tue, 27 Jan 2015 03:45:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zhang",
"Zijie",
""
],
[
"Mao",
"Guoqiang",
""
],
[
"Anderson",
"Brian",
""
]
] |
new_dataset
| 0.992901 |
1502.00206
|
Rajiv Ranjan Dr.
|
Khalid Alhamazani, Rajiv Ranjan, Prem Prakash Jayaraman, Karan Mitra,
Chang Liu, Fethi Rabhi, Dimitrios Georgakopoulos, Lizhe Wang
|
Cross-Layer Multi-Cloud Real-Time Application QoS Monitoring and
Benchmarking As-a-Service Framework
|
A revised version of this technical report has been accepted for
publication by IEEE Transactions on Cloud Computing on April 29, 2015
| null |
10.1109/TCC.2015.2441715
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing provides on-demand access to affordable hardware (multi-core
CPUs, GPUs, disks, and networking equipment) and software (databases,
application servers and data processing frameworks) platforms with features
such as elasticity, pay-per-use, low upfront investment and low time to market.
This has led to the proliferation of business critical applications that
leverage various cloud platforms. Such applications hosted on single or
multiple cloud provider platforms have diverse characteristics requiring
extensive monitoring and benchmarking mechanisms to ensure run-time Quality of
Service (QoS) (e.g., latency and throughput). This paper proposes, develops and
validates CLAMBS:Cross-Layer Multi-Cloud Application Monitoring and
Benchmarking as-a-Service for efficient QoS monitoring and benchmarking of
cloud applications hosted on multi-clouds environments. The major highlight of
CLAMBS is its capability of monitoring and benchmarking individual application
components such as databases and web servers, distributed across cloud layers,
spread among multiple cloud providers. We validate CLAMBS using prototype
implementation and extensive experimentation and show that CLAMBS efficiently
monitors and benchmarks application components on multi-cloud platforms
including Amazon EC2 and Microsoft Azure.
|
[
{
"version": "v1",
"created": "Sun, 1 Feb 2015 06:57:47 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Apr 2015 05:28:14 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Alhamazani",
"Khalid",
""
],
[
"Ranjan",
"Rajiv",
""
],
[
"Jayaraman",
"Prem Prakash",
""
],
[
"Mitra",
"Karan",
""
],
[
"Liu",
"Chang",
""
],
[
"Rabhi",
"Fethi",
""
],
[
"Georgakopoulos",
"Dimitrios",
""
],
[
"Wang",
"Lizhe",
""
]
] |
new_dataset
| 0.982577 |
1502.03493
|
Jiun-Ren Lin
|
Jiun-Ren Lin, Timothy Talty, Ozan K. Tonguz
|
On the Potential of Bluetooth Low Energy Technology for Vehicular
Applications
|
8 pages, 5 figures
|
IEEE Communications Magazine, vol. 53, no. 1, January 2015
|
10.1109/MCOM.2015.7010544
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing number of sensors in modern vehicles, using an
Intra-Vehicular Wireless Sensor Network (IVWSN) is a possible solution for the
automotive industry to address the potential issues that arise from additional
wiring harness. Such a solution could help car manufacturers develop vehicles
that have better fuel economy and performance, in addition to supporting new
applications. However, which wireless technology for IVWSNs should be used for
maximizing the aforementioned benefits is still an open issue. In this paper,
we propose to use a new wireless technology known as Bluetooth Low Energy (BLE)
and highlight a new architecture for IVWSN. Based on a comprehensive study
which encompasses an example application, it is shown that BLE is an excellent
option that can be used in IVWSNs for certain applications mainly due to its
good performance and low-power, low-complexity, and low-cost attributes.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 23:54:37 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lin",
"Jiun-Ren",
""
],
[
"Talty",
"Timothy",
""
],
[
"Tonguz",
"Ozan K.",
""
]
] |
new_dataset
| 0.97773 |
1502.06809
|
Alexander Zeh
|
Alexander Zeh, Eitan Yaakobi
|
Optimal Linear and Cyclic Locally Repairable Codes over Small Fields
|
IEEE Information Theory Workshop (ITW) 2015, Apr 2015, Jerusalem,
Israel
| null |
10.1109/ITW.2015.7133123
| null |
cs.IT cs.NI math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider locally repairable codes over small fields and propose
constructions of optimal cyclic and linear codes in terms of the dimension for
a given distance and length. Four new constructions of optimal linear codes
over small fields with locality properties are developed. The first two
approaches give binary cyclic codes with locality two. While the first
construction has availability one, the second binary code is characterized by
multiple available repair sets based on a binary Simplex code. The third
approach extends the first one to q-ary cyclic codes including (binary)
extension fields, where the locality property is determined by the properties
of a shortened first-order Reed-Muller code. Non-cyclic optimal binary linear
codes with locality greater than two are obtained by the fourth construction.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2015 13:43:42 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zeh",
"Alexander",
""
],
[
"Yaakobi",
"Eitan",
""
]
] |
new_dataset
| 0.969911 |
1503.00085
|
Weiyao Lin
|
Weiyao Lin, Krit Panusopone, David M. Baylon, Ming-Ting Sun, Zhenzhong
Chen, Hongxiang Li
|
A Fast Sub-Pixel Motion Estimation Algorithm for H.264/AVC Video Coding
|
This manuscript is the accepted version for TCSVT (IEEE Transactions
on Circuits and Systems for Video Technology)
|
IEEE Trans. Circuits and Systems for Video Technology, vol. 21,
no. 2, pp. 237-242, 2011
|
10.1109/TCSVT.2011.2106290
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion Estimation (ME) is one of the most time-consuming parts in video
coding. The use of multiple partition sizes in H.264/AVC makes it even more
complicated when compared to ME in conventional video coding standards. It is
important to develop fast and effective sub-pixel ME algorithms since (a) The
computation overhead by sub-pixel ME has become relatively significant while
the complexity of integer-pixel search has been greatly reduced by fast
algorithms, and (b) Reducing sub-pixel search points can greatly save the
computation for sub-pixel interpolation. In this paper, a novel fast sub-pixel
ME algorithm is proposed which performs a 'rough' sub-pixel search before the
partition selection, and performs a 'precise' sub-pixel search for the best
partition. By reducing the searching load for the large number of non-best
partitions, the computation complexity for sub-pixel search can be greatly
decreased. Experimental results show that our method can reduce the sub-pixel
search points by more than 50% compared to existing fast sub-pixel ME methods
with negligible quality degradation.
|
[
{
"version": "v1",
"created": "Sat, 28 Feb 2015 07:08:03 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lin",
"Weiyao",
""
],
[
"Panusopone",
"Krit",
""
],
[
"Baylon",
"David M.",
""
],
[
"Sun",
"Ming-Ting",
""
],
[
"Chen",
"Zhenzhong",
""
],
[
"Li",
"Hongxiang",
""
]
] |
new_dataset
| 0.975202 |
1503.01440
|
Jiun-Ren Lin
|
Jiun-Ren Lin, Timothy Talty, Ozan K. Tonguz
|
A Blind Zone Alert System based on Intra-vehicular Wireless Sensor
Networks
|
9 pages, 8 figures, 1 table, IEEE Transactions on Industrial
Informatics, 2015
| null |
10.1109/TII.2015.2404800
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the increasing number of sensors deployed in modern vehicles,
Intra-Vehicular Wireless Sensor Networks (IVWSNs) have recently received a lot
of attention in the automotive industry as they can reduce the amount of wiring
harness inside a vehicle. By removing the wires, car manufacturers can reduce
the weight of a vehicle and improve engine performance, fuel economy, and
reliability. In addition to these direct benefits, an IVWSN is a versatile
platform that can support other vehicular applications as well. An example
application, known as a Side Blind Zone Alert (SBZA) system, which monitors the
blind zone of the vehicle and alerts the driver in a timely manner to prevent
collisions, is discussed in this paper. The performance of the IVWSN-based SBZA
system is evaluated via real experiments conducted on two test vehicles. Our
results show that the proposed system can achieve approximately 95% to 99%
detection rate with less than 15% false alarm rate. Compared to commercial
systems using radars or cameras, the main benefit of the IVWSN-based SBZA is
substantially lower cost.
|
[
{
"version": "v1",
"created": "Wed, 4 Mar 2015 20:08:57 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lin",
"Jiun-Ren",
""
],
[
"Talty",
"Timothy",
""
],
[
"Tonguz",
"Ozan K.",
""
]
] |
new_dataset
| 0.998678 |
1503.02877
|
Dani Korpi
|
Timo Huusari, Yang-Seok Choi, Petteri Liikkanen, Dani Korpi, Shilpa
Talwar, Mikko Valkama
|
Wideband Self-Adaptive RF Cancellation Circuit for Full-Duplex Radio:
Operating Principle and Measurements
|
7 pages, to be presented in 2015 IEEE 81st Vehicular Technology
Conference
| null |
10.1109/VTCSpring.2015.7146163
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel RF circuit architecture for self-interference
cancellation in inband full-duplex radio transceivers. The developed canceller
is able to provide wideband cancellation with waveform bandwidths in the order
of 100 MHz or beyond and contains also self-adaptive or self-healing features
enabling automatic tracking of time-varying self-interference channel
characteristics. In addition to architecture and operating principle
descriptions, we also provide actual RF measurements at 2.4 GHz ISM band
demonstrating the achievable cancellation levels with different bandwidths and
when operating in different antenna configurations and under low-cost highly
nonlinear power amplifier. In a very challenging example with a 100 MHz
waveform bandwidth, around 41 dB total cancellation is obtained while the
corresponding cancellation figure is close to 60 dB with the more conventional
20 MHz carrier bandwidth. Also, efficient tracking in time-varying reflection
scenarios is demonstrated.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 12:02:01 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Huusari",
"Timo",
""
],
[
"Choi",
"Yang-Seok",
""
],
[
"Liikkanen",
"Petteri",
""
],
[
"Korpi",
"Dani",
""
],
[
"Talwar",
"Shilpa",
""
],
[
"Valkama",
"Mikko",
""
]
] |
new_dataset
| 0.996306 |
1503.09039
|
Stelios Stefanatos
|
Stelios Stefanatos, Antonis G. Gotsis and Angeliki Alexiou
|
Operational Region of D2D Communications for Enhancing Cellular Network
Performance
|
to appear in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2015.2446974
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important enabler towards the successful deployment of any new
element/feature to the cellular network is the investigation and
characterization of the operational conditions where its introduction will
enhance performance. Even though there has been significant research activity
on the potential of device-to-device (D2D) communications, there are currently
no clear indications of whether D2D communications are actually able to provide
benefits for a wide range of operational conditions, thus justifying their
introduction to the system. This paper attempts to fill this gap by taking a
stochastic geometry approach on characterizing the set (region) of operational
conditions for which D2D communications enhance performance in terms of average
user rate. For the practically interesting case of a heavy loaded network, the
operational region is provided in closed form as a function of a variety of
parameters such as maximum D2D link distances and user densities, reflecting a
wide range of operational conditions (points). It is shown that under the
appropriate deployment scheme, D2D communications can indeed be beneficial not
only for the usually considered regime of "proximal communications" but to a
wide range of operational conditions that include D2D link distances comparable
to the distance to the cellular access point and considerably large user
densities.
|
[
{
"version": "v1",
"created": "Tue, 31 Mar 2015 13:37:02 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jun 2015 15:34:57 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Stefanatos",
"Stelios",
""
],
[
"Gotsis",
"Antonis G.",
""
],
[
"Alexiou",
"Angeliki",
""
]
] |
new_dataset
| 0.969975 |
1503.09178
|
Shuowen Zhang
|
Shuowen Zhang, Rui Zhang, Teng Joon Lim
|
Constant Envelope Precoding with Adaptive Receiver Constellation in MISO
Fading Channel
|
This is a longer version of a paper to appear in IEEE Transactions on
Wireless Communications
| null |
10.1109/TWC.2016.2592899
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constant envelope (CE) precoding is an appealing transmission technique which
enables the realization of high power amplifier (PA) efficiency. For CE
precoding in a single-user multiple-input single-output (MISO) channel, a
desired constellation is feasible at the receiver if and only if it can be
scaled to lie in an annulus, whose boundaries are characterized by the
instantaneous channel realization. Therefore, if a fixed receiver constellation
is used for CE precoding in a fading channel, where the annulus is
time-varying, there is in general a non-zero probability of encountering a
channel that makes CE precoding infeasible, thereby causing a high probability
of error. To tackle this problem, this paper studies the adaptive receiver
constellation design for CE precoding in a single-user MISO flat-fading channel
with an arbitrary number of antennas at the transmitter. We first investigate
the fixed-rate adaptive receiver constellation design to minimize the symbol
error rate (SER). Specifically, an efficient algorithm is proposed to find the
optimal amplitude-and-phase shift keying (APSK) constellation with two rings
that is both feasible and of the maximum minimum Euclidean distance (MED), for
any given constellation size and instantaneous channel realization. Numerical
results show that by using the optimized fixed-rate adaptive receiver
constellation, our proposed scheme achieves significantly improved SER
performance over CE precoding with a fixed receiver constellation. Furthermore,
based on the family of optimal fixed-rate adaptive two-ring APSK constellation
sets, a variable-rate CE transmission scheme is proposed and numerically
examined.
|
[
{
"version": "v1",
"created": "Tue, 31 Mar 2015 19:38:35 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Apr 2015 19:52:48 GMT"
},
{
"version": "v3",
"created": "Wed, 15 Apr 2015 19:58:34 GMT"
},
{
"version": "v4",
"created": "Thu, 3 Sep 2015 18:31:39 GMT"
},
{
"version": "v5",
"created": "Fri, 15 Jul 2016 08:29:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zhang",
"Shuowen",
""
],
[
"Zhang",
"Rui",
""
],
[
"Lim",
"Teng Joon",
""
]
] |
new_dataset
| 0.984258 |
1504.04663
|
Jinxue Zhang
|
Jinxue Zhang, Rui Zhang, Jingchao Sun, Yanchao Zhang, Chi Zhang
|
TrueTop: A Sybil-Resilient System for User Influence Measurement on
Twitter
|
Accepted by IEEE/ACM Transactions on Networking. This is the Final
version
| null |
10.1109/TNET.2015.2494059
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Influential users have great potential for accelerating information
dissemination and acquisition on Twitter. How to measure the influence of
Twitter users has attracted significant academic and industrial attention.
Existing influential measurement techniques, however, are vulnerable to sybil
users that are thriving on Twitter. Although sybil defenses for online social
networks have been extensively investigated, they commonly assume unique
mappings from human-established trust relationships to online social
associations and thus do not apply to Twitter where users can freely follow
each other. This paper presents TrueTop, the first sybil-resilient system to
measure the influence of Twitter users. TrueTop is firmly rooted in two
observations from real Twitter datasets. First, although non-sybil users may
incautiously follow strangers, they tend to be more careful and selective in
retweeting, replying to, and mentioning other Twitter users. Second,
influential users usually get much more retweets, replies, and mentions than
non-influential users. Detailed theoretical studies and synthetic simulations
show that TrueTop can generate very accurate influence measurement results and
also have strong resilience to sybil attacks.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 00:07:10 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jun 2015 00:35:04 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Oct 2015 22:49:34 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zhang",
"Jinxue",
""
],
[
"Zhang",
"Rui",
""
],
[
"Sun",
"Jingchao",
""
],
[
"Zhang",
"Yanchao",
""
],
[
"Zhang",
"Chi",
""
]
] |
new_dataset
| 0.997857 |
1504.04975
|
Sudarsan Vasista Srinivasan Ranganathan
|
Sudarsan V. S. Ranganathan, Dariush Divsalar, and Richard D. Wesel
|
On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete
Protographs
|
6 pages, 2 figures, 5-page version to appear in the Proceedings of
2015 IEEE International Symposium on Information Theory. Update 1 -
05/29/2015 - Minor changes and added a reference
| null |
10.1109/ISIT.2015.7282491
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of constructing $(3,L)$ quasi-cyclic low-density
parity-check (LDPC) codes from complete protographs. A complete protograph is a
small bipartite graph with two disjoint vertex sets such that every vertex in
the variable-node set is connected to every vertex in the check-node set by a
unique edge. This paper analyzes the required lifting factor for achieving
girths of six or eight in the resulting quasi-cyclic codes with constraints on
lifting. The required lifting factors provide lower bounds on the block-length
of such codes.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 08:58:06 GMT"
},
{
"version": "v2",
"created": "Sat, 30 May 2015 00:32:55 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ranganathan",
"Sudarsan V. S.",
""
],
[
"Divsalar",
"Dariush",
""
],
[
"Wesel",
"Richard D.",
""
]
] |
new_dataset
| 0.999245 |
1505.00181
|
Siyi Wang
|
Weisi Guo, Bin Li, Siyi Wang, Wei Liu
|
Molecular Communications with Longitudinal Carrier Waves: Baseband to
Passband Modulation
|
submitted to IEEE Communications Letters
| null |
10.1109/LCOMM.2015.2448098
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional molecular communications via diffusion (MCvD) systems have used
baseband modulation techniques by varying properties of molecular pulses such
as the amplitude, the frequency of the transversal wave of the pulse, and the
time delay between subsequent pulses. In this letter, we propose and implement
passband modulation with molecules that exhibit longitudinal carrier wave
properties. This is achieved through the oscillation of the transmitter.
Frequency division multiplexing is employed to allow different molecular
information streams to co-exist in the same space and time channel, creating an
effective bandwidth for MCvD.
|
[
{
"version": "v1",
"created": "Fri, 1 May 2015 14:10:26 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Guo",
"Weisi",
""
],
[
"Li",
"Bin",
""
],
[
"Wang",
"Siyi",
""
],
[
"Liu",
"Wei",
""
]
] |
new_dataset
| 0.996379 |
1505.00511
|
Rodrigo de Lamare
|
Andr\'e Uchoa, Cornelius T. Healy and Rodrigo C. de Lamare
|
Iterative Detection and Decoding Algorithms using LDPC Codes for MIMO
Systems in Block-Fading Channels
|
17 pages, 4 figures, IEEE Transactions on Vehicular Technology, 2015
| null |
10.1109/TVT.2015.2432099
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose iterative detection and decoding (IDD) algorithms with Low-Density
Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems
operating in block-fading and fast Rayleigh fading channels. Soft-input
soft-output minimum mean-square error receivers with successive interference
cancellation are considered. In particular, we devise a novel strategy to
improve the bit error rate (BER) performance of IDD schemes, which takes into
account the soft \textit{a posteriori} output of the decoder in a block-fading
channel when Root-Check LDPC codes are used. A MIMO IDD receiver with soft
information processing that exploits the code structure and the behavior of the
log likelihood ratios is also developed. Moreover, we present a scheduling
algorithm for decoding LDPC codes in block-fading channels. Simulations show
that the proposed techniques result in significant gains in terms of BER for
both block-fading and fast-fading channels.
|
[
{
"version": "v1",
"created": "Mon, 4 May 2015 02:03:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Uchoa",
"André",
""
],
[
"Healy",
"Cornelius T.",
""
],
[
"de Lamare",
"Rodrigo C.",
""
]
] |
new_dataset
| 0.969166 |
1505.04679
|
Changho Suh
|
Sunghyun Kim, I-Hsiang Wang, Changho Suh
|
A Relay Can Increase Degrees of Freedom in Bursty Interference Networks
|
submitted to the IEEE Transactions on Information Theory
| null |
10.1109/ISIT.2015.7282617
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the benefits of relays in multi-user wireless networks with
bursty user traffic, where intermittent data traffic restricts the users to
bursty transmissions. To this end, we study a two-user bursty MIMO Gaussian
interference channel with a relay, where two Bernoulli random states govern the
bursty user traffic. We show that an in-band relay can provide a degrees of
freedom (DoF) gain in this bursty channel. This beneficial role of in-band
relays in the bursty channel is in direct contrast to their role in the
non-bursty channel which is not as significant to provide a DoF gain. More
importantly, we demonstrate that for certain antenna configurations, an in-band
relay can help achieve interference-free performances with increased DoF. We
find the benefits particularly substantial with low data traffic, as the DoF
gain can grow linearly with the number of antennas at the relay. In this work,
we first derive an outer bound from which we obtain a necessary condition for
interference-free DoF performances. Then, we develop a novel scheme that
exploits information of the bursty traffic states to achieve them.
|
[
{
"version": "v1",
"created": "Mon, 18 May 2015 15:18:26 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kim",
"Sunghyun",
""
],
[
"Wang",
"I-Hsiang",
""
],
[
"Suh",
"Changho",
""
]
] |
new_dataset
| 0.994913 |
1506.01394
|
Guoru Ding
|
Guoru Ding, Jinlong Wang, Qihui Wu, Yu-Dong Yao, Fei Song, and
Theodoros A. Tsiftsis
|
Cellular-Base-Station Assisted Device-to-Device Communications in TV
White Space
|
Accepted by IEEE Journal on Selected Areas in Communications, to
appear, 2015
| null |
10.1109/JSAC.2015.2452532
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a systematic approach to exploit TV white space (TVWS)
for device-to-device (D2D) communications with the aid of the existing cellular
infrastructure. The goal is to build a location-specific TVWS database, which
provides a look-up table service for any D2D link to determine its maximum
permitted emission power (MPEP) in an unlicensed digital TV (DTV) band. To
achieve this goal, the idea of mobile crowd sensing is firstly introduced to
collect active spectrum measurements from massive personal mobile devices.
Considering the incompleteness of crowd measurements, we formulate the problem
of unknown measurements recovery as a matrix completion problem and apply a
powerful fixed point continuation algorithm to reconstruct the unknown elements
from the known elements. By joint exploitation of the big spectrum data in its
vicinity, each cellular base station further implements a nonlinear support
vector machine algorithm to perform irregular coverage boundary detection of a
licensed DTV transmitter. With the knowledge of the detected coverage boundary,
an opportunistic spatial reuse algorithm is developed for each D2D link to
determine its MPEP. Simulation results show that the proposed approach can
successfully enable D2D communications in TVWS while satisfying the
interference constraint from the licensed DTV services. In addition, to our
best knowledge, this is the first try to explore and exploit TVWS inside the
DTV protection region resulted from the shadowing effect. Potential application
scenarios include communications between internet of vehicles in the
underground parking, D2D communications in hotspots such as subway, game
stadiums, and airports, etc.
|
[
{
"version": "v1",
"created": "Mon, 1 Jun 2015 02:39:51 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ding",
"Guoru",
""
],
[
"Wang",
"Jinlong",
""
],
[
"Wu",
"Qihui",
""
],
[
"Yao",
"Yu-Dong",
""
],
[
"Song",
"Fei",
""
],
[
"Tsiftsis",
"Theodoros A.",
""
]
] |
new_dataset
| 0.999472 |
1506.03495
|
Jose Rodrigues Jr
|
Daniel Y. T. Chino, Letricia P. S. Avalhais, Jose F. Rodrigues Jr.,
Agma J. M. Traina
|
BoWFire: Detection of Fire in Still Images by Integrating Pixel Color
and Texture Analysis
|
8 pages, Proceedings of the 28th SIBGRAPI Conference on Graphics,
Patterns and Images, IEEE Press
| null |
10.1109/SIBGRAPI.2015.19
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emergency events involving fire are potentially harmful, demanding a fast and
precise decision making. The use of crowdsourcing image and videos on crisis
management systems can aid in these situations by providing more information
than verbal/textual descriptions. Due to the usual high volume of data,
automatic solutions need to discard non-relevant content without losing
relevant information. There are several methods for fire detection on video
using color-based models. However, they are not adequate for still image
processing, because they can suffer on high false-positive results. These
methods also suffer from parameters with little physical meaning, which makes
fine tuning a difficult task. In this context, we propose a novel fire
detection method for still images that uses classification based on color
features combined with texture classification on superpixel regions. Our method
uses a reduced number of parameters if compared to previous works, easing the
process of fine tuning the method. Results show the effectiveness of our method
of reducing false-positives while its precision remains compatible with the
state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 22:16:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chino",
"Daniel Y. T.",
""
],
[
"Avalhais",
"Letricia P. S.",
""
],
[
"Rodrigues",
"Jose F.",
"Jr."
],
[
"Traina",
"Agma J. M.",
""
]
] |
new_dataset
| 0.997521 |
1506.06691
|
Alex James Dr
|
Olga Krestinskaya, Irina Fedorova, Alex Pappachen James
|
Memristor Load Current Mirror Circuit
|
4th International Conference on Advances in Computing, Communications
and Informaticst, IEEE, August, 2015
| null |
10.1109/ICACCI.2015.7275664
| null |
cs.ET
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Simple current mirrors with semiconductor resistive loads suffer from large
on-chip area, leakage currents and thermal effects. In this paper, we report
the feasibility of using memristive loads as a replacement of semiconductor
resistors in simplistic current mirror configuration. We report power, area and
total harmonic distribution, and report the corner conditions on resistance
tolerances.
|
[
{
"version": "v1",
"created": "Mon, 22 Jun 2015 17:18:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Krestinskaya",
"Olga",
""
],
[
"Fedorova",
"Irina",
""
],
[
"James",
"Alex Pappachen",
""
]
] |
new_dataset
| 0.999474 |
1506.07158
|
Kiran Venugopal
|
Kiran Venugopal, Matthew C. Valenti, and Robert W. Heath Jr
|
Device-to-Device Millimeter Wave Communications: Interference, Coverage,
Rate, and Finite Topologies
|
32 pages, 17 figures, Submitted to IEEE Transactions on Wireless
Communications
| null |
10.1109/TWC.2016.2580510
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emerging applications involving device-to-device communication among wearable
electronics require Gbps throughput, which can be achieved by utilizing
millimeter wave (mmWave) frequency bands. When many such communicating devices
are indoors in close proximity, like in a train car or airplane cabin,
interference can be a serious impairment. This paper uses stochastic geometry
to analyze the performance of mmWave networks with a finite number of
interferers in a finite network region. Prior work considered either lower
carrier frequencies with different antenna and channel assumptions, or a
network with an infinite spatial extent. In this paper, human users not only
carry potentially interfering devices, but also act to block interfering
signals. Using a sequence of simplifying assumptions, accurate expressions for
coverage and rate are developed that capture the effects of key antenna
characteristics like directivity and gain, and are a function of the finite
area and number of users. The assumptions are validated through a combination
of analysis and simulation. The main conclusions are that mmWave frequencies
can provide Gbps throughput even with omni-directional transceiver antennas,
and larger, more directive antenna arrays give better system performance.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 19:50:25 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jun 2016 18:10:31 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Venugopal",
"Kiran",
""
],
[
"Valenti",
"Matthew C.",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.998092 |
1506.07367
|
Thomas Nyman
|
Brian McGillion, Tanel Dettenborn, Thomas Nyman, N. Asokan
|
Open-TEE - An Open Virtual Trusted Execution Environment
|
Author's version of article to appear in 14th IEEE International
Conference on Trust, Security and Privacy in Computing and Communications,
TrustCom 2015, Helsinki, Finland, August 20-22, 2015
| null |
10.1109/Trustcom.2015.400
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hardware-based Trusted Execution Environments (TEEs) are widely deployed in
mobile devices. Yet their use has been limited primarily to applications
developed by the device vendors. Recent standardization of TEE interfaces by
GlobalPlatform (GP) promises to partially address this problem by enabling
GP-compliant trusted applications to run on TEEs from different vendors.
Nevertheless ordinary developers wishing to develop trusted applications face
significant challenges. Access to hardware TEE interfaces are difficult to
obtain without support from vendors. Tools and software needed to develop and
debug trusted applications may be expensive or non-existent.
In this paper, we describe Open-TEE, a virtual, hardware-independent TEE
implemented in software. Open-TEE conforms to GP specifications. It allows
developers to develop and debug trusted applications with the same tools they
use for developing software in general. Once a trusted application is fully
debugged, it can be compiled for any actual hardware TEE. Through performance
measurements and a user study we demonstrate that Open-TEE is efficient and
easy to use. We have made Open- TEE freely available as open source.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 13:59:20 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2015 11:31:38 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"McGillion",
"Brian",
""
],
[
"Dettenborn",
"Tanel",
""
],
[
"Nyman",
"Thomas",
""
],
[
"Asokan",
"N.",
""
]
] |
new_dataset
| 0.996831 |
1507.00095
|
Sanghun Im
|
Sanghun Im, Hyoungsuk Jeon, Jinho Choi, and Jeongseok Ha
|
Secret Key Agreement with Large Antenna Arrays under the Pilot
Contamination Attack
|
15 pages, 5 figures, and the paper is under minor revision for the
publication in IEEE transactions on wireless communications
| null |
10.1109/TWC.2015.2456894
| null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a secret key agreement (SKA) protocol for a multi-user
time-division duplex system where a base-station (BS) with a large antenna
array (LAA) shares secret keys with users in the presence of non-colluding
eavesdroppers. In the system, when the BS transmits random sequences to
legitimate users for sharing common randomness, the eavesdroppers can attempt
the pilot contamination attack (PCA) in which each of eavesdroppers transmits
its target user's training sequence in hopes of acquiring possible information
leak by steering beam towards the eavesdropper. We show that there exists a
crucial complementary relation between the received signal strengths at the
eavesdropper and its target user. This relation tells us that the eavesdropper
inevitably leaves a trace that enables us to devise a way of measuring the
amount of information leakage to the eavesdropper even if PCA parameters are
unknown. To this end, we derive an estimator for the channel gain from the BS
to the eavesdropper and propose a rate-adaptation scheme for adjusting the
length of secret key under the PCA. Extensive analysis and evaluations are
carried out under various setups, which show that the proposed scheme
adequately takes advantage of the LAA to establish the secret keys under the
PCA.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2015 02:43:16 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Im",
"Sanghun",
""
],
[
"Jeon",
"Hyoungsuk",
""
],
[
"Choi",
"Jinho",
""
],
[
"Ha",
"Jeongseok",
""
]
] |
new_dataset
| 0.998852 |
1507.02853
|
Patrick Hagge Cording
|
Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li
G{\o}rtz
|
Finger Search in Grammar-Compressed Strings
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grammar-based compression, where one replaces a long string by a small
context-free grammar that generates the string, is a simple and powerful
paradigm that captures many popular compression schemes. Given a grammar, the
random access problem is to compactly represent the grammar while supporting
random access, that is, given a position in the original uncompressed string
report the character at that position. In this paper we study the random access
problem with the finger search property, that is, the time for a random access
query should depend on the distance between a specified index $f$, called the
\emph{finger}, and the query index $i$. We consider both a static variant,
where we first place a finger and subsequently access indices near the finger
efficiently, and a dynamic variant where also moving the finger such that the
time depends on the distance moved is supported.
Let $n$ be the size the grammar, and let $N$ be the size of the string. For
the static variant we give a linear space representation that supports placing
the finger in $O(\log N)$ time and subsequently accessing in $O(\log D)$ time,
where $D$ is the distance between the finger and the accessed index. For the
dynamic variant we give a linear space representation that supports placing the
finger in $O(\log N)$ time and accessing and moving the finger in $O(\log D +
\log \log N)$ time. Compared to the best linear space solution to random
access, we improve a $O(\log N)$ query bound to $O(\log D)$ for the static
variant and to $O(\log D + \log \log N)$ for the dynamic variant, while
maintaining linear space. As an application of our results we obtain an
improved solution to the longest common extension problem in grammar compressed
strings. To obtain our results, we introduce several new techniques of
independent interest, including a novel van Emde Boas style decomposition of
grammars.
|
[
{
"version": "v1",
"created": "Fri, 10 Jul 2015 11:17:32 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jan 2016 12:48:20 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Jun 2016 08:58:48 GMT"
},
{
"version": "v4",
"created": "Wed, 16 Nov 2016 12:29:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Bille",
"Philip",
""
],
[
"Christiansen",
"Anders Roy",
""
],
[
"Cording",
"Patrick Hagge",
""
],
[
"Gørtz",
"Inge Li",
""
]
] |
new_dataset
| 0.996401 |
1508.03940
|
Zhen Gao
|
Zhen Gao, Linglong Dai, De Mi, Zhaocheng Wang, Muhammad Ali Imran, and
Muhammad Zeeshan Shakir
|
MmWave Massive MIMO Based Wireless Backhaul for 5G Ultra-Dense Network
|
This paper has been accepted by IEEE Wireless Communications
Magazine. This paper is related to 5G, ultra-dense network (UDN), millimeter
waves (mmWave) fronthaul/backhaul, massive MIMO, sparsity/low-rank property
of mmWave massive MIMO channels, sparse channel estimation, compressive
sensing (CS), hybrid digital/analog precoding/combining, and hybrid
beamforming. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7306533
|
IEEE Wireless Communications, vol. 22, no. 5, pp. 13-21, Oct. 2015
|
10.1109/MWC.2015.7306533
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ultra-dense network (UDN) has been considered as a promising candidate for
future 5G network to meet the explosive data demand. To realize UDN, a
reliable, Gigahertz bandwidth, and cost-effective backhaul connecting
ultra-dense small-cell base stations (BSs) and macro-cell BS is prerequisite.
Millimeter-wave (mmWave) can provide the potential Gbps traffic for wireless
backhaul. Moreover, mmWave can be easily integrated with massive MIMO for the
improved link reliability. In this article, we discuss the feasibility of
mmWave massive MIMO based wireless backhaul for 5G UDN, and the benefits and
challenges are also addressed. Especially, we propose a digitally-controlled
phase-shifter network (DPSN) based hybrid precoding/combining scheme for mmWave
massive MIMO, whereby the low-rank property of mmWave massive MIMO channel
matrix is leveraged to reduce the required cost and complexity of transceiver
with a negligible performance loss. One key feature of the proposed scheme is
that the macro-cell BS can simultaneously support multiple small-cell BSs with
multiple streams for each smallcell BS, which is essentially different from
conventional hybrid precoding/combining schemes typically limited to
single-user MIMO with multiple streams or multi-user MIMO with single stream
for each user. Based on the proposed scheme, we further explore the fundamental
issues of developing mmWave massive MIMO for wireless backhaul, and the
associated challenges, insight, and prospect to enable the mmWave massive MIMO
based wireless backhaul for 5G UDN are discussed.
|
[
{
"version": "v1",
"created": "Mon, 17 Aug 2015 07:20:01 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Aug 2015 16:07:49 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Nov 2015 15:38:19 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gao",
"Zhen",
""
],
[
"Dai",
"Linglong",
""
],
[
"Mi",
"De",
""
],
[
"Wang",
"Zhaocheng",
""
],
[
"Imran",
"Muhammad Ali",
""
],
[
"Shakir",
"Muhammad Zeeshan",
""
]
] |
new_dataset
| 0.988431 |
1508.06093
|
Jie Xu Dr.
|
Jie Xu, Lingjie Duan, Rui Zhang
|
Energy Group-Buying with Loading Sharing for Green Cellular Networks
|
This is a longer version of a paper to be appear in IEEE Journal on
Selected Areas in Communications Special Issue on Energy-Efficient Techniques
for 5G Wireless Communication Systems
| null |
10.1109/JSAC.2016.2544603
| null |
cs.IT cs.GT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the emerging hybrid electricity market, mobile network operators (MNOs) of
cellular networks can make day-ahead energy purchase commitments at low prices
and real-time flexible energy purchase at high prices. To minimize electricity
bills, it is essential for MNOs to jointly optimize the day-ahead and real-time
energy purchase based on their time-varying wireless traffic load. In this
paper, we consider two different MNOs coexisting in the same area, and exploit
their collaboration in both energy purchase and wireless load sharing for
energy cost saving. Specifically, we propose a new approach named energy group
buying with load sharing, in which the two MNOs are aggregated as a single
group to make the day-ahead and real-time energy purchase, and their base
stations (BSs) share the wireless traffic to maximally turn lightly-loaded BSs
into sleep mode. When the two MNOs belong to the same entity and aim to
minimize their total energy cost, we use the two-stage stochastic programming
to obtain the optimal day-ahead and real-time energy group buying jointly with
wireless load sharing. When the two MNOs belong to different entities and are
self-interested in minimizing their individual energy costs, we propose a novel
repeated Nash bargaining scheme for them to negotiate and share their energy
costs under energy group buying and load sharing. Our proposed repeated Nash
bargaining scheme is shown to achieve Pareto-optimal and fair energy cost
reductions for both MNOs.
|
[
{
"version": "v1",
"created": "Tue, 25 Aug 2015 10:03:59 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Dec 2015 16:38:39 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Xu",
"Jie",
""
],
[
"Duan",
"Lingjie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.961795 |
1509.00395
|
Sijia Deng
|
Sijia Deng, Mathew K. Samimi, Theodore S. Rappaport
|
28 GHz and 73 GHz Millimeter-Wave Indoor Propagation Measurements and
Path Loss Models
|
7 pages, 9 figures, 2015 IEEE International Conference on
Communications (ICC), ICC Workshops
| null |
10.1109/ICCW.2015.7247348
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents 28 GHz and 73 GHz millimeter- wave propagation
measurements performed in a typical office environment using a 400
Megachip-per-second broadband sliding correlator channel sounder and highly
directional steerable 15 dBi (30 degrees beamwidth) and 20 dBi (15 degrees
beamwidth) horn antennas. Power delay profiles were acquired for 48
transmitter-receiver location combinations over distances ranging from 3.9 m to
45.9 m with maximum transmit powers of 24 dBm and 12.3 dBm at 28 GHz and 73
GHz, respectively. Directional and omnidirectional path loss models and RMS
delay spread statistics are presented for line-of-sight and non-line-of-sight
environments for both co- and cross-polarized antenna configurations. The LOS
omnidirectional path loss exponents were 1.1 and 1.3 at 28 GHz and 73 GHz, and
2.7 and 3.2 in NLOS at 28 GHz and 73 GHz, respectively, for
vertically-polarized antennas. The mean directional RMS delay spreads were 18.4
ns and 13.3 ns, with maximum values of 193 ns and 288 ns at 28 GHz and 73 GHz,
respectively.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2015 17:16:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Deng",
"Sijia",
""
],
[
"Samimi",
"Mathew K.",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.998722 |
1509.01187
|
Mohammad Mozaffari
|
Mohammad Mozaffari, Walid Saad, Mehdi Bennis, Merouane Debbah
|
Unmanned Aerial Vehicle with Underlaid Device-to-Device Communications:
Performance and Tradeoffs
|
accepted in the IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2016.2531652
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the deployment of an unmanned aerial vehicle (UAV) as a flying
base station used to provide on the fly wireless communications to a given
geographical area is analyzed. In particular, the co-existence between the UAV,
that is transmitting data in the downlink, and an underlaid device-todevice
(D2D) communication network is considered. For this model, a tractable
analytical framework for the coverage and rate analysis is derived. Two
scenarios are considered: a static UAV and a mobile UAV. In the first scenario,
the average coverage probability and the system sum-rate for the users in the
area are derived as a function of the UAV altitude and the number of D2D users.
In the second scenario, using the disk covering problem, the minimum number of
stop points that the UAV needs to visit in order to completely cover the area
is computed. Furthermore, considering multiple retransmissions for the UAV and
D2D users, the overall outage probability of the D2D users is derived.
Simulation and analytical results show that, depending on the density of D2D
users, optimal values for the UAV altitude exist for which the system sum-rate
and the coverage probability are maximized. Moreover, our results also show
that, by enabling the UAV to intelligently move over the target area, the total
required transmit power of UAV while covering the entire area, is minimized.
Finally, in order to provide a full coverage for the area of interest, the
tradeoff between the coverage and delay, in terms of the number of stop points,
is discussed.
|
[
{
"version": "v1",
"created": "Thu, 3 Sep 2015 18:06:04 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Feb 2016 09:17:32 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Mozaffari",
"Mohammad",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Debbah",
"Merouane",
""
]
] |
new_dataset
| 0.958703 |
1509.07223
|
Chenxi Liu
|
Chenxi Liu, Nan Yang, Jinhong Yuan, and Robert Malaney
|
Secure Transmission for Relay Wiretap Channels in the Presence of
Spatially Random Eavesdroppers
|
7 pages, 5 figures, accepted by IEEE Globecom 2015 Workshop on
Trusted Communications with Physical Layer Security
| null |
10.1109/GLOCOMW.2015.7414069
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a secure transmission scheme for a relay wiretap channel, where a
source communicates with a destination via a decode-and-forward relay in the
presence of spatially random-distributed eavesdroppers. We assume that the
source is equipped with multiple antennas, whereas the relay, the destination,
and the eavesdroppers are equipped with a single antenna each. In the proposed
scheme, in addition to information signals, the source transmits artificial
noise signals in order to confuse the eavesdroppers. With the target of
maximizing the secrecy throughput of the relay wiretap channel, we derive a
closed-form expression for the transmission outage probability and an
easy-to-compute expression for the secrecy outage probability. Using these
expressions, we determine the optimal power allocation factor and wiretap code
rates that guarantee the maximum secrecy throughput, while satisfying a secrecy
outage probability constraint. Furthermore, we examine the impact of source
antenna number on the secrecy throughput, showing that adding extra transmit
antennas at the source brings about a significant increase in the secrecy
throughput.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 03:22:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Liu",
"Chenxi",
""
],
[
"Yang",
"Nan",
""
],
[
"Yuan",
"Jinhong",
""
],
[
"Malaney",
"Robert",
""
]
] |
new_dataset
| 0.99144 |
1510.02574
|
Jun Lin
|
Jun Lin, Chenrong Xiong and Zhiyuan Yan
|
A High Throughput List Decoder Architecture for Polar Codes
|
submitted to IEEE TVLSI
| null |
10.1109/TVLSI.2015.2499777
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While long polar codes can achieve the capacity of arbitrary binary-input
discrete memoryless channels when decoded by a low complexity successive
cancelation (SC) algorithm, the error performance of the SC algorithm is
inferior for polar codes with finite block lengths. The cyclic redundancy check
(CRC) aided successive cancelation list (SCL) decoding algorithm has better
error performance than the SC algorithm. However, current CRC aided SCL
(CA-SCL) decoders still suffer from long decoding latency and limited
throughput. In this paper, a reduced latency list decoding (RLLD) algorithm for
polar codes is proposed. Our RLLD algorithm performs the list decoding on a
binary tree, whose leaves correspond to the bits of a polar code. In existing
SCL decoding algorithms, all the nodes in the tree are traversed and all
possibilities of the information bits are considered. Instead, our RLLD
algorithm visits much fewer nodes in the tree and considers fewer possibilities
of the information bits. When configured properly, our RLLD algorithm
significantly reduces the decoding latency and hence improves throughput, while
introducing little performance degradation. Based on our RLLD algorithm, we
also propose a high throughput list decoder architecture, which is suitable for
larger block lengths due to its scalable partial sum computation unit. Our
decoder architecture has been implemented for different block lengths and list
sizes using the TSMC 90nm CMOS technology. The implementation results
demonstrate that our decoders achieve significant latency reduction and area
efficiency improvement compared with other list polar decoders in the
literature.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 06:11:34 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Lin",
"Jun",
""
],
[
"Xiong",
"Chenrong",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.994681 |
1510.03125
|
Chunhua Shen
|
Qichang Hu, Sakrapee Paisitkriangkrai, Chunhua Shen, Anton van den
Hengel, Fatih Porikli
|
Fast detection of multiple objects in traffic scenes with a common
detection framework
|
Appearing in IEEE Transactions on Intelligent Transportation Systems
| null |
10.1109/TITS.2015.2496795
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traffic scene perception (TSP) aims to real-time extract accurate on-road
environment information, which in- volves three phases: detection of objects of
interest, recognition of detected objects, and tracking of objects in motion.
Since recognition and tracking often rely on the results from detection, the
ability to detect objects of interest effectively plays a crucial role in TSP.
In this paper, we focus on three important classes of objects: traffic signs,
cars, and cyclists. We propose to detect all the three important objects in a
single learning based detection framework. The proposed framework consists of a
dense feature extractor and detectors of three important classes. Once the
dense features have been extracted, these features are shared with all
detectors. The advantage of using one common framework is that the detection
speed is much faster, since all dense features need only to be evaluated once
in the testing phase. In contrast, most previous works have designed specific
detectors using different features for each of these objects. To enhance the
feature robustness to noises and image deformations, we introduce spatially
pooled features as a part of aggregated channel features. In order to further
improve the generalization performance, we propose an object subcategorization
method as a means of capturing intra-class variation of objects. We
experimentally demonstrate the effectiveness and efficiency of the proposed
framework in three detection applications: traffic sign detection, car
detection, and cyclist detection. The proposed framework achieves the
competitive performance with state-of- the-art approaches on several benchmark
datasets.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 02:30:22 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Hu",
"Qichang",
""
],
[
"Paisitkriangkrai",
"Sakrapee",
""
],
[
"Shen",
"Chunhua",
""
],
[
"Hengel",
"Anton van den",
""
],
[
"Porikli",
"Fatih",
""
]
] |
new_dataset
| 0.998254 |
1510.04039
|
Nadine Kroher
|
Nadine Kroher, Emilia G\'omez
|
Automatic Transcription of Flamenco Singing from Polyphonic Music
Recordings
|
Submitted to the IEEE Transactions on Audio, Speech and Language
Processing
| null |
10.1109/TASLP.2016.2531284
| null |
cs.SD cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic note-level transcription is considered one of the most challenging
tasks in music information retrieval. The specific case of flamenco singing
transcription poses a particular challenge due to its complex melodic
progressions, intonation inaccuracies, the use of a high degree of
ornamentation and the presence of guitar accompaniment. In this study, we
explore the limitations of existing state of the art transcription systems for
the case of flamenco singing and propose a specific solution for this genre: We
first extract the predominant melody and apply a novel contour filtering
process to eliminate segments of the pitch contour which originate from the
guitar accompaniment. We formulate a set of onset detection functions based on
volume and pitch characteristics to segment the resulting vocal pitch contour
into discrete note events. A quantised pitch label is assigned to each note
event by combining global pitch class probabilities with local pitch contour
statistics. The proposed system outperforms state of the art singing
transcription systems with respect to voicing accuracy, onset detection and
overall performance when evaluated on flamenco singing datasets.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 10:53:00 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kroher",
"Nadine",
""
],
[
"Gómez",
"Emilia",
""
]
] |
new_dataset
| 0.998762 |
1510.07320
|
S. Hussain Raza
|
S. Hussain Raza, Matthias Grundmann, Irfan Essa
|
Geometric Context from Videos
|
Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference
on
| null |
10.1109/CVPR.2013.396
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel algorithm for estimating the broad 3D geometric structure
of outdoor video scenes. Leveraging spatio-temporal video segmentation, we
decompose a dynamic scene captured by a video into geometric classes, based on
predictions made by region-classifiers that are trained on appearance and
motion features. By examining the homogeneity of the prediction, we combine
predictions across multiple segmentation hierarchy levels alleviating the need
to determine the granularity a priori. We built a novel, extensive dataset on
geometric context of video to evaluate our method, consisting of over 100
ground-truth annotated outdoor videos with over 20,000 frames. To further scale
beyond this dataset, we propose a semi-supervised learning framework to expand
the pool of labeled data with high confidence predictions obtained from
unlabeled data. Our system produces an accurate prediction of geometric context
of video achieving 96% accuracy across main geometric classes.
|
[
{
"version": "v1",
"created": "Sun, 25 Oct 2015 22:58:30 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Raza",
"S. Hussain",
""
],
[
"Grundmann",
"Matthias",
""
],
[
"Essa",
"Irfan",
""
]
] |
new_dataset
| 0.95746 |
1511.01646
|
Peter Trifonov
|
Peter Trifonov, Vera Miloslavskaya
|
Polar Subcodes
|
Accepted to IEEE JSAC special issue on Recent Advances In Capacity
Approaching Codes
| null |
10.1109/JSAC.2015.2504269
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An extension of polar codes is proposed, which allows some of the frozen
symbols, called dynamic frozen symbols, to be data-dependent. A construction of
polar codes with dynamic frozen symbols, being subcodes of extended BCH codes,
is proposed. The proposed codes have higher minimum distance than classical
polar codes, but still can be efficiently decoded using the successive
cancellation algorithm and its extensions. The codes with Arikan, extended BCH
and Reed-Solomon kernel are considered. The proposed codes are shown to
outperform LDPC and turbo codes, as well as polar codes with CRC.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2015 08:06:50 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Trifonov",
"Peter",
""
],
[
"Miloslavskaya",
"Vera",
""
]
] |
new_dataset
| 0.999846 |
1511.07374
|
Shu Sun Ms.
|
Shu Sun, Timothy A. Thomas, Theodore S. Rappaport, Huan Nguyen, Istvan
Z. Kovacs, and Ignacio Rodrigue
|
Path Loss, Shadow Fading, and Line-Of-Sight Probability Models for 5G
Urban Macro-Cellular Scenarios
|
to appear in proceedings of IEEE Global Communications Conference
Workshop, Dec. 2015
| null |
10.1109/GLOCOMW.2015.7414036
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents key parameters including the line-of-sight (LOS)
probability, large-scale path loss, and shadow fading models for the design of
future fifth generation (5G) wireless communication systems in urban
macro-cellular (UMa) scenarios, using the data obtained from propagation
measurements at 38 GHz in Austin, US, and at 2, 10, 18, and 28 GHz in Aalborg,
Denmark. A comparison of different LOS probability models is performed for the
Aalborg environment. Alpha-betagamma and close-in reference distance path loss
models are studied in depth to show their value in channel modeling.
Additionally, both single-slope and dual-slope omnidirectional path loss models
are investigated to analyze and contrast their root-mean-square (RMS) errors on
measured path loss values. While the results show that the dual-slope
large-scale path loss model can slightly reduce RMS errors compared to its
singleslope counterpart in non-line-of-sight (NLOS) conditions, the improvement
is not significant enough to warrant adopting the dual-slope path loss model.
Furthermore, the shadow fading magnitude versus distance is explored, showing a
slight increasing trend in LOS and a decreasing trend in NLOS based on the
Aalborg data, but more measurements are necessary to gain a better knowledge of
the UMa channels at centimeter- and millimeter-wave frequency bands.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 19:26:01 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Nov 2015 18:47:56 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sun",
"Shu",
""
],
[
"Thomas",
"Timothy A.",
""
],
[
"Rappaport",
"Theodore S.",
""
],
[
"Nguyen",
"Huan",
""
],
[
"Kovacs",
"Istvan Z.",
""
],
[
"Rodrigue",
"Ignacio",
""
]
] |
new_dataset
| 0.992036 |
1512.04116
|
Mordechai Guri
|
Mordechai Guri, Yuri Poliak, Bracha Shapira, Yuval Elovici
|
JoKER: Trusted Detection of Kernel Rootkits in Android Devices via JTAG
Interface
|
IEEE TrustCom 2015
| null |
10.1109/Trustcom.2015.358
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smartphones and tablets have become prime targets for malware, due to the
valuable private and corporate information they hold. While Anti-Virus (AV)
program may successfully detect malicious applications (apps), they remain
ineffective against low-level rootkits that evade detection mechanisms by
masking their own presence. Furthermore, any detection mechanism run on the
same physical device as the monitored OS can be compromised via application,
kernel or boot-loader vulnerabilities. Consequentially, trusted detection of
kernel rootkits in mobile devices is a challenging task in practice. In this
paper we present JoKER - a system which aims at detecting rootkits in the
Android kernel by utilizing the hardware's Joint Test Action Group (JTAG)
interface for trusted memory forensics. Our framework consists of components
that extract areas of a kernel's memory and reconstruct it for further
analysis. We present the overall architecture along with its implementation,
and demonstrate that the system can successfully detect the presence of
stealthy rootkits in the kernel. The results show that although JTAG's main
purpose is system testing, it can also be used for malware detection where
traditional methods fail.
|
[
{
"version": "v1",
"created": "Sun, 13 Dec 2015 20:16:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Poliak",
"Yuri",
""
],
[
"Shapira",
"Bracha",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.998966 |
1512.04133
|
George Cushen
|
George Cushen
|
A Person Re-Identification System For Mobile Devices
|
Appearing in Proceedings of the 11th IEEE/ACM International
Conference on Signal Image Technology & Internet Systems (SITIS 2015)
| null |
10.1109/SITIS.2015.96
| null |
cs.CV cs.CR cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Person re-identification is a critical security task for recognizing a person
across spatially disjoint sensors. Previous work can be computationally
intensive and is mainly based on low-level cues extracted from RGB data and
implemented on a PC for a fixed sensor network (such as traditional CCTV). We
present a practical and efficient framework for mobile devices (such as smart
phones and robots) where high-level semantic soft biometrics are extracted from
RGB and depth data. By combining these cues, our approach attempts to provide
robustness to noise, illumination, and minor variations in clothing. This
mobile approach may be particularly useful for the identification of persons in
areas ill-served by fixed sensors or for tasks where the sensor position and
direction need to dynamically adapt to a target. Results on the BIWI dataset
are preliminary but encouraging. Further evaluation and demonstration of the
system will be available on our website.
|
[
{
"version": "v1",
"created": "Sun, 13 Dec 2015 22:33:17 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Cushen",
"George",
""
]
] |
new_dataset
| 0.986495 |
1601.02699
|
Juyeop Kim Dr.
|
Juyeop Kim, Sang Won Choi, Won-Yong Shin, Yong-Soo Song and Yong-Kyu
Kim
|
Group Communication Over LTE : A Radio Access Perspective
|
will be published in IEEE Communications Magazine
| null |
10.1109/MCOM.2016.7452261
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long Term Evolution (LTE), which has its root on commercial mobile
communications, recently becomes an influential solution to future public
safety communications. To verify the feasibility of LTE for public safety, it
is essential to investigate whether an LTE system optimized for one-to-one
communications is capable of providing group communication, which is one of the
most important service concepts in public safety. In general, a number of first
responders for public safety need to form a group for communicating with each
other or sharing the common data for collaboration on their mission. In this
article, we analyze how the current LTE system can support group communication
in a radio access aspect. Based on the requirements for group communication, we
validate whether each LTE-enabled radio access method can efficiently support
group communication. In addition, we propose a new multicast transmission
scheme, termed index-coded Hybrid Automatic Retransmission reQuest (HARQ). By
applying the index coding concept to HARQ operations, we show that the LTE
system can provide group communication more sophisticatedly in terms of radio
resource efficiency and scalability. We finally evaluate the performance of
LTE-enabled group communication using several radio access methods and show how
the proposed transmission scheme brings the performance enhancement via system
level simulations.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2016 00:22:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kim",
"Juyeop",
""
],
[
"Choi",
"Sang Won",
""
],
[
"Shin",
"Won-Yong",
""
],
[
"Song",
"Yong-Soo",
""
],
[
"Kim",
"Yong-Kyu",
""
]
] |
new_dataset
| 0.998274 |
1601.03121
|
Behzad Asadi
|
Behzad Asadi, Lawrence Ong, Sarah J. Johnson
|
A Unified Inner Bound for the Two-Receiver Memoryless Broadcast Channel
with Channel State and Message Side Information
|
Extended version of the same-titled paper submitted to the 2016 IEEE
International Symposium on Information Theory
| null |
10.1109/ISIT.2016.7541284
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the two-receiver memoryless broadcast channel with states where
each receiver requests both common and private messages, and may know part of
the private message requested by the other receiver as receiver message side
information (RMSI). We address two categories of the channel (i) channel with
states known causally to the transmitter, and (ii) channel with states known
non-causally to the transmitter. Starting with the channel without RMSI, we
first propose a transmission scheme and derive an inner bound for the causal
category. We then unify our inner bound for the causal category and the
best-known inner bound for the non-causal category, although their transmission
schemes are different. Moving on to the channel with RMSI, we first apply a
pre-coding to the transmission schemes of the causal and non-causal categories
without RMSI. We then derive a unified inner bound as a result of having a
unified inner bound when there is no RMSI, and applying the same pre-coding to
both categories. We show that our inner bound is tight for some new cases as
well as the cases whose capacity region was known previously.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2016 03:30:47 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Asadi",
"Behzad",
""
],
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.974021 |
1602.00066
|
Lin Chen
|
Lin Chen, Zhiping Xiao, Kaigui Bian, Shuyu Shi, Rui Li, Yusheng Ji
|
Skolem Sequence Based Self-adaptive Broadcast Protocol in Cognitive
Radio Networks
|
A full version with technical proofs. Accepted by IEEE VTC 2016
Spring
| null |
10.1109/VTCSpring.2016.7504475
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The base station (BS) in a multi-channel cognitive radio (CR) network has to
broadcast to secondary (or unlicensed) receivers/users on more than one
broadcast channels via channel hopping (CH), because a single broadcast channel
can be reclaimed by the primary (or licensed) user, leading to broadcast
failures. Meanwhile, a secondary receiver needs to synchronize its clock with
the BS's clock to avoid broadcast failures caused by the possible clock drift
between the CH sequences of the secondary receiver and the BS. In this paper,
we propose a CH-based broadcast protocol called SASS, which enables a BS to
successfully broadcast to secondary receivers over multiple broadcast channels
via channel hopping. Specifically, the CH sequences are constructed on basis of
a mathematical construct---the Self-Adaptive Skolem sequence. Moreover, each
secondary receiver under SASS is able to adaptively synchronize its clock with
that of the BS without any information exchanges, regardless of any amount of
clock drift.
|
[
{
"version": "v1",
"created": "Sat, 30 Jan 2016 03:04:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chen",
"Lin",
""
],
[
"Xiao",
"Zhiping",
""
],
[
"Bian",
"Kaigui",
""
],
[
"Shi",
"Shuyu",
""
],
[
"Li",
"Rui",
""
],
[
"Ji",
"Yusheng",
""
]
] |
new_dataset
| 0.999684 |
1602.00173
|
Ejder Ba\c{s}tu\u{g}
|
Georgios Paschos, Ejder Ba\c{s}tu\u{g}, Ingmar Land, Giuseppe Caire,
and M\'erouane Debbah
|
Wireless Caching: Technical Misconceptions and Business Barriers
|
a version of this paper has been accepted to IEEE Communications
Magazine, Special Issue on Communications, Caching, and Computing for
Content-Centric Mobile Networks
| null |
10.1109/MCOM.2016.7537172
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching is a hot research topic and poised to develop into a key technology
for the upcoming 5G wireless networks. The successful implementation of caching
techniques however, crucially depends on joint research developments in
different scientific domains such as networking, information theory, machine
learning, and wireless communications. Moreover, there exist business barriers
related to the complex interactions between the involved stakeholders, the
users, the cellular operators, and the Internet content providers. In this
article we discuss several technical misconceptions with the aim to uncover
enabling research directions for caching in wireless systems. Ultimately we
make a speculative stakeholder analysis for wireless caching in 5G.
|
[
{
"version": "v1",
"created": "Sun, 31 Jan 2016 00:06:41 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Jun 2016 21:51:12 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Paschos",
"Georgios",
""
],
[
"Baştuğ",
"Ejder",
""
],
[
"Land",
"Ingmar",
""
],
[
"Caire",
"Giuseppe",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.995873 |
1602.03602
|
Yong Zeng
|
Yong Zeng, Rui Zhang, and Teng Joon Lim
|
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and
Challenges
|
To appear in IEEE Communications Magazine
| null |
10.1109/MCOM.2016.7470933
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless communication systems that include unmanned aerial vehicles (UAVs)
promise to provide cost-effective wireless connectivity for devices without
infrastructure coverage. Compared to terrestrial communications or those based
on high-altitude platforms (HAPs), on-demand wireless systems with low-altitude
UAVs are in general faster to deploy, more flexibly re-configured, and are
likely to have better communication channels due to the presence of short-range
line-of-sight (LoS) links. However, the utilization of highly mobile and
energy-constrained UAVs for wireless communications also introduces many new
challenges. In this article, we provide an overview of UAV-aided wireless
communications, by introducing the basic networking architecture and main
channel characteristics, highlighting the key design considerations as well as
the new opportunities to be exploited.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 02:00:58 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Zhang",
"Rui",
""
],
[
"Lim",
"Teng Joon",
""
]
] |
new_dataset
| 0.999276 |
1602.03617
|
Johann Bengua
|
Johann A. Bengua, Hoang D. Tuan, Ho N. Phien, Ha H. Kha
|
Two-hop Power-Relaying for Linear Wireless Sensor Networks
|
Submitted to IEEE ICCE 2016
| null |
10.1109/CCE.2016.7562622
| null |
cs.NI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents two-hop relay gain-scheduling control in a Wireless
Sensor Network to estimate a static target prior characterized by Gaussian
probability distribution. The target is observed by a network of linear
sensors, whose observations are transmitted to a fusion center for carrying out
final estimation via a amplify-and-forward relay node. We are concerned with
the joint transmission power allocation for sensors and relay to optimize the
minimum mean square error (MMSE) estimator, which is deployed at the fusion
center. Particularly, such highly nonlinear optimization problems are solved by
an iterative procedure of very low computational complexity. Simulations are
provided to support the efficiency of our proposed power allocation.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 05:26:31 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Bengua",
"Johann A.",
""
],
[
"Tuan",
"Hoang D.",
""
],
[
"Phien",
"Ho N.",
""
],
[
"Kha",
"Ha H.",
""
]
] |
new_dataset
| 0.970518 |
1603.01926
|
Matthew Kokshoorn
|
Matthew Kokshoorn, He Chen, Peng Wang, Yonghui Li, Branka Vucetic
|
Millimeter Wave MIMO Channel Estimation using Overlapped Beam Patterns
and Rate Adaptation
|
This is an extended version of a paper accepted to appear in IEEE
Transactions on Signal Processing
| null |
10.1109/TSP.2016.2614488
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with the channel estimation problem in Millimeter
wave (mmWave) wireless systems with large antenna arrays. By exploiting the
inherent sparse nature of the mmWave channel, we first propose a fast channel
estimation (FCE) algorithm based on a novel overlapped beam pattern design,
which can increase the amount of information carried by each channel
measurement and thus reduce the required channel estimation time compared to
the existing non-overlapped designs. We develop a maximum likelihood (ML)
estimator to optimally extract the path information from the channel
measurements. Then, we propose a novel rate-adaptive channel estimation (RACE)
algorithm, which can dynamically adjust the number of channel measurements
based on the expected probability of estimation error (PEE). The performance of
both proposed algorithms is analyzed. For the FCE algorithm, an approximate
closed-form expression for the PEE is derived. For the RACE algorithm, a lower
bound for the minimum signal energy-to-noise ratio required for a given number
of channel measurements is developed based on the Shannon-Hartley theorem.
Simulation results show that the FCE algorithm significantly reduces the number
of channel estimation measurements compared to the existing algorithms using
non-overlapped beam patterns. By adopting the RACE algorithm, we can achieve up
to a 6dB gain in signal energy-to-noise ratio for the same PEE compared to the
existing algorithms.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 03:54:02 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Jul 2016 04:21:34 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Sep 2016 07:22:50 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kokshoorn",
"Matthew",
""
],
[
"Chen",
"He",
""
],
[
"Wang",
"Peng",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.99808 |
1603.03551
|
Zhiyong Chen
|
Hui Liu, Zhiyong Chen, Liang Qian
|
The three primary colors of mobile systems
|
submitted to IEEE Communications Magazine -- Feature Topic: Mobile 3C
Networks
| null |
10.1109/MCOM.2016.7565182
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the notion of "mobile 3C systems in which the
"Communications", "Computing", and "Caching" (i.e., 3C) make up the three
primary resources/funcationalties, akin to the three primary colors, for a
mobile system. We argue that in future mobile networks, the roles of computing
and caching are as intrinsic and essential as communications, and only the
collective usage of these three primary resources can support the sustainable
growth of mobile systems. By defining the 3C resources in their canonical
forms, we reveal the important fact that "caching" affects the mobile system
performance by introducing non-causality into the system, whereas "computing"
achieves capacity gains by performing logical operations across mobile system
entities. Many existing capacity-enhancing techniques such as coded multicast,
collaborative transmissions, and proactive content pushing can be cast into the
native 3C framework for analytical tractability. We further illustrate the
mobile 3C concepts with practical examples, including a system on
broadcast-unicast convergence for massive media content delivery. The mobile 3C
design paradigm opens up new possibilities as well as key research problems
bearing academic and practice significance.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 07:41:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Liu",
"Hui",
""
],
[
"Chen",
"Zhiyong",
""
],
[
"Qian",
"Liang",
""
]
] |
new_dataset
| 0.960266 |
1603.04079
|
George MacCartney Jr
|
Katsuyuki Haneda, Lei Tian, 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, Arun Ghosh
|
Indoor 5G 3GPP-like Channel Models for Office and Shopping Mall
Environments
|
To be published in 2016 IEEE International Conference on
Communications Workshops (ICCW), Kuala Lumpur, Malaysia, May, 2016
| null |
10.1109/ICCW.2016.7503868
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Future mobile communications systems are likely to be very different to those
of today with new service innovations driven by increasing data traffic demand,
increasing processing power of smart devices and new innovative applications.
To meet these service demands the telecommunications industry is converging on
a common set of 5G requirements which includes network speeds as high as 10
Gbps, cell edge rate greater than 100 Mbps, and latency of less than 1 msec. To
reach these 5G requirements the industry is looking at new spectrum bands in
the range up to 100 GHz where there is spectrum availability for wide bandwidth
channels. For the development of new 5G systems to operate in bands up to 100
GHz there is a need for accurate radio propagation models which are not
addressed by existing channel models developed for bands below 6 GHz. This
paper presents a preliminary overview of the 5G channel models for bands up to
100 GHz in indoor offices and shopping malls, derived from extensive
measurements across a multitude of bands. These studies have found some
extensibility of the existing 3GPP models to the higher frequency bands up to
100 GHz. The measurements indicate that the smaller wavelengths introduce an
increased sensitivity of the propagation models to the scale of the environment
and show some frequency dependence of the path loss as well as increased
occurrence of blockage. Further, the penetration loss is highly dependent on
the material and tends to increase with frequency. The small-scale
characteristics of the channel such as delay spread and angular spread and the
multipath richness is somewhat similar over the frequency range, which is
encouraging for extending the existing 3GPP models to the wider frequency
range. Further work will be carried out to complete these models, but this
paper presents the first steps for an initial basis for the model development.
|
[
{
"version": "v1",
"created": "Sun, 13 Mar 2016 21:38:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Haneda",
"Katsuyuki",
""
],
[
"Tian",
"Lei",
""
],
[
"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.993909 |
1603.04341
|
Maria Gregori
|
Maria Gregori, Jes\'us G\'omez-Vilardeb\'o, Javier Matamoros and Deniz
G\"und\"uz
|
Wireless Content Caching for Small Cell and D2D Networks
|
To appear in the IEEE Journal on Selected Areas - Series on Green
Communications and Networking
| null |
10.1109/JSAC.2016.2545413
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fifth generation wireless networks must provide fast and reliable
connectivity while coping with the ongoing traffic growth. It is of paramount
importance that the required resources, such as energy and bandwidth, do not
scale with traffic. While the aggregate network traffic is growing at an
unprecedented rate, users tend to request the same popular contents at
different time instants. Therefore, caching the most popular contents at the
network edge is a promising solution to reduce the traffic and the energy
consumption over the backhaul links. In this paper, two scenarios are
considered, where caching is performed either at a small base station, or
directly at the user terminals, which communicate using \ac{D2D}
communications. In both scenarios, joint design of the transmission and caching
policies is studied when the user demands are known in advance. This joint
design offers two different caching gains, namely, the \textit{pre-downloading}
and \textit{local caching gains}. It is shown that the finite cache capacity
limits the attainable gains, and creates an inherent tradeoff between the two
types of gains. In this context, a continuous time optimization problem is
formulated to determine the optimal transmission and caching policies that
minimize a generic cost function, such as energy, bandwidth, or throughput. The
jointly optimal solution is obtained by demonstrating that caching files at a
constant rate is optimal, which allows to reformulate the problem as a
finite-dimensional convex program. The numerical results show that the proposed
joint transmission and caching policy dramatically reduces the total cost,
which is particularised to the total energy consumption at the \ac{MBS}, as
well as to the total economical cost for the service provider, when users
demand economical incentives for delivering content to other users over the D2D
links.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 16:46:16 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Gregori",
"Maria",
""
],
[
"Gómez-Vilardebó",
"Jesús",
""
],
[
"Matamoros",
"Javier",
""
],
[
"Gündüz",
"Deniz",
""
]
] |
new_dataset
| 0.98345 |
1603.04418
|
Fei Miao
|
Fei Miao, Shuo Han, Shan Lin, John A. Stankovic, Hua Huang, Desheng
Zhang, Sirajum Munir, Tian He, George J. Pappas
|
Taxi Dispatch with Real-Time Sensing Data in Metropolitan Areas: A
Receding Horizon Control Approach
|
Accepted. Key words--Intelligent Transportation System, Real-Time
Taxi Dispatch, Receding Horizon Control, Mobility Pattern
|
IEEE Transactions on Automation Science and Engineering (TASE),
2016
|
10.1145/2735960.2735961
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional taxi systems in metropolitan areas often suffer from
inefficiencies due to uncoordinated actions as system capacity and customer
demand change. With the pervasive deployment of networked sensors in modern
vehicles, large amounts of information regarding customer demand and system
status can be collected in real time. This information provides opportunities
to perform various types of control and coordination for large-scale
intelligent transportation systems. In this paper, we present a receding
horizon control (RHC) framework to dispatch taxis, which incorporates highly
spatiotemporally correlated demand/supply models and real-time GPS location and
occupancy information. The objectives include matching spatiotemporal ratio
between demand and supply for service quality with minimum current and
anticipated future taxi idle driving distance. Extensive trace-driven analysis
with a data set containing taxi operational records in San Francisco shows that
our solution reduces the average total idle distance by 52%, and reduces the
supply demand ratio error across the city during one experimental time slot by
45%. Moreover, our RHC framework is compatible with a wide variety of
predictive models and optimization problem formulations. This compatibility
property allows us to solve robust optimization problems with corresponding
demand uncertainty models that provide disruptive event information.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 19:51:33 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Miao",
"Fei",
""
],
[
"Han",
"Shuo",
""
],
[
"Lin",
"Shan",
""
],
[
"Stankovic",
"John A.",
""
],
[
"Huang",
"Hua",
""
],
[
"Zhang",
"Desheng",
""
],
[
"Munir",
"Sirajum",
""
],
[
"He",
"Tian",
""
],
[
"Pappas",
"George J.",
""
]
] |
new_dataset
| 0.999705 |
1603.07357
|
Blesson Varghese
|
Blesson Varghese, Lawan Thamsuhang Subba, Long Thai, Adam Barker
|
DocLite: A Docker-Based Lightweight Cloud Benchmarking Tool
|
16th IEEE/ACM International Symposium on Cluster, Cloud and Grid
Computing (CCGrid), 2016, Cartagena, Colombia. arXiv admin note: substantial
text overlap with arXiv:1601.03872
| null |
10.1109/CCGrid.2016.14
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing benchmarking methods are time consuming processes as they typically
benchmark the entire Virtual Machine (VM) in order to generate accurate
performance data, making them less suitable for real-time analytics. The
research in this paper is aimed to surmount the above challenge by presenting
DocLite - Docker Container-based Lightweight benchmarking tool. DocLite
explores lightweight cloud benchmarking methods for rapidly executing
benchmarks in near real-time. DocLite is built on the Docker container
technology, which allows a user-defined memory size and number of CPU cores of
the VM to be benchmarked. The tool incorporates two benchmarking methods - the
first referred to as the native method employs containers to benchmark a small
portion of the VM and generate performance ranks, and the second uses historic
benchmark data along with the native method as a hybrid to generate VM ranks.
The proposed methods are evaluated on three use-cases and are observed to be up
to 91 times faster than benchmarking the entire VM. In both methods, small
containers provide the same quality of rankings as a large container. The
native method generates ranks with over 90% and 86% accuracy for sequential and
parallel execution of an application compared against benchmarking the whole
VM. The hybrid method did not improve the quality of the rankings
significantly.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 20:55:44 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Varghese",
"Blesson",
""
],
[
"Subba",
"Lawan Thamsuhang",
""
],
[
"Thai",
"Long",
""
],
[
"Barker",
"Adam",
""
]
] |
new_dataset
| 0.999749 |
1603.08876
|
Alexander Barg
|
Alexander Barg, Itzhak Tamo, and Serge Vladuts
|
Locally recoverable codes on algebraic curves
|
16pp. An extended abstract of this submission was posted earlier as
arXiv:1501.04904 and was published in Proceedings of the 2015 IEEE
International Symposium on Information Theory, Hong Kong, China, June 14-19,
2015, pp. 1252--1256
| null |
10.1109/ISIT.2015.7282656
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code over a finite alphabet is called locally recoverable (LRC code) if
every symbol in the encoding is a function of a small number (at most $r$)
other symbols of the codeword. In this paper we introduce a construction of LRC
codes on algebraic curves, extending a recent construction of Reed-Solomon like
codes with locality. We treat the following situations: local recovery of a
single erasure, local recovery of multiple erasures, and codes with several
disjoint recovery sets for every coordinate (the {\em availability problem}).
For each of these three problems we describe a general construction of codes on
curves and construct several families of LRC codes. We also describe a
construction of codes with availability that relies on automorphism groups of
curves.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2016 18:32:57 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Tamo",
"Itzhak",
""
],
[
"Vladuts",
"Serge",
""
]
] |
new_dataset
| 0.999834 |
1604.00861
|
Heikki Huttunen
|
Giambattista Parascandolo, Heikki Huttunen, Tuomas Virtanen
|
Recurrent Neural Networks for Polyphonic Sound Event Detection in Real
Life Recordings
|
To appean in Proceedings of IEEE ICASSP 2016
| null |
10.1109/ICASSP.2016.7472917
| null |
cs.SD cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an approach to polyphonic sound event detection in
real life recordings based on bi-directional long short term memory (BLSTM)
recurrent neural networks (RNNs). A single multilabel BLSTM RNN is trained to
map acoustic features of a mixture signal consisting of sounds from multiple
classes, to binary activity indicators of each event class. Our method is
tested on a large database of real-life recordings, with 61 classes (e.g.
music, car, speech) from 10 different everyday contexts. The proposed method
outperforms previous approaches by a large margin, and the results are further
improved using data augmentation techniques. Overall, our system reports an
average F1-score of 65.5% on 1 second blocks and 64.7% on single frames, a
relative improvement over previous state-of-the-art approach of 6.8% and 15.1%
respectively.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2016 13:54:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Parascandolo",
"Giambattista",
""
],
[
"Huttunen",
"Heikki",
""
],
[
"Virtanen",
"Tuomas",
""
]
] |
new_dataset
| 0.987592 |
1604.02937
|
Eric Rondeau
|
Jari Porras, Ahmed Seffah, Eric Rondeau (CRAN), Karl Andersson,
Klimova Alexandra (ITMO)
|
PERCCOM: A Master Program in Pervasive Computing and COMmunications for
Sustainable Development
| null |
29th IEEE Conference on Software Engineering Education and
Training, Apr 2016, Dallas, United States. 2016
|
10.1109/CSEET.2016.39
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the Erasmus Mundus Joint Master Degree in Pervasive
Computing and Communications for Sustainable Development (PERCCOM). This
program brings together 11 academic partners and 8 industry partners to combine
advanced Information and Communication Technologies (ICT) with environmental
awareness to enable world-class education and unique competences for ICT
professionals who can build cleaner, greener, more resource and energy
efficient cyber-physical systems. First, this paper describes the rationale and
motivations for ICT education for sustainability challenges. It then details
the structure and contents of the programs including the courses offered at the
three teaching locations (Nancy France, Lappeenranta Finland, and Lulea
Sweden). The ways that the program has been running as well as students
selection, their thesis works, involvement of industry, are also discussed. The
program was built and managed using a solid academic standards and strategies
student-centered learning.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 13:10:52 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Porras",
"Jari",
"",
"CRAN"
],
[
"Seffah",
"Ahmed",
"",
"CRAN"
],
[
"Rondeau",
"Eric",
"",
"CRAN"
],
[
"Andersson",
"Karl",
"",
"ITMO"
],
[
"Alexandra",
"Klimova",
"",
"ITMO"
]
] |
new_dataset
| 0.992553 |
1604.04906
|
Johannes Stegmaier
|
Johannes Stegmaier, Julian Arz, Benjamin Schott, Jens C. Otte, Andrei
Kobitski, G. Ulrich Nienhaus, Uwe Str\"ahle, Peter Sanders, Ralf Mikut
|
Generating Semi-Synthetic Validation Benchmarks for Embryomics
|
Accepted publication at IEEE International Symposium on Biomedical
Imaging: From Nano to Macro (ISBI), 2016
| null |
10.1109/ISBI.2016.7493359
| null |
cs.CV q-bio.CB q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Systematic validation is an essential part of algorithm development. The
enormous dataset sizes and the complexity observed in many recent time-resolved
3D fluorescence microscopy imaging experiments, however, prohibit a
comprehensive manual ground truth generation. Moreover, existing simulated
benchmarks in this field are often too simple or too specialized to
sufficiently validate the observed image analysis problems. We present a new
semi-synthetic approach to generate realistic 3D+t benchmarks that combines
challenging cellular movement dynamics of real embryos with simulated
fluorescent nuclei and artificial image distortions including various
parametrizable options like cell numbers, acquisition deficiencies or multiview
simulations. We successfully applied the approach to simulate the development
of a zebrafish embryo with thousands of cells over 14 hours of its early
existence.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2016 18:29:48 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Stegmaier",
"Johannes",
""
],
[
"Arz",
"Julian",
""
],
[
"Schott",
"Benjamin",
""
],
[
"Otte",
"Jens C.",
""
],
[
"Kobitski",
"Andrei",
""
],
[
"Nienhaus",
"G. Ulrich",
""
],
[
"Strähle",
"Uwe",
""
],
[
"Sanders",
"Peter",
""
],
[
"Mikut",
"Ralf",
""
]
] |
new_dataset
| 0.999698 |
1605.02410
|
Alexey Kovalev
|
Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko
|
Distance verification for LDPC codes
|
5 pages, 1 figure, to appear in Proceedings of ISIT 2016 - IEEE
International Symposium on Information Theory, Barcelona
| null |
10.1109/ISIT.2016.7541755
| null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of finding code distance has been long studied for the generic
ensembles of linear codes and led to several algorithms that substantially
reduce exponential complexity of this task. However, no asymptotic complexity
bounds are known for distance verification in other ensembles of linear codes.
Our goal is to re-design the existing generic algorithms of distance
verification and derive their complexity for LDPC codes. We obtain new
complexity bounds with provable performance expressed in terms of the
erasure-correcting thresholds of long LDPC codes. These bounds exponentially
reduce complexity estimates known for linear codes.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 03:59:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dumer",
"Ilya",
""
],
[
"Kovalev",
"Alexey A.",
""
],
[
"Pryadko",
"Leonid P.",
""
]
] |
new_dataset
| 0.961693 |
1606.00397
|
Siddharth Jain
|
Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck
|
Duplication-Correcting Codes for Data Storage in the DNA of Living
Organisms
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/ISIT.2016.7541455
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to store data in the DNA of a living organism has applications in
a variety of areas including synthetic biology and watermarking of patented
genetically-modified organisms. Data stored in this medium is subject to errors
arising from various mutations, such as point mutations, indels, and tandem
duplication, which need to be corrected to maintain data integrity. In this
paper, we provide error-correcting codes for errors caused by tandem
duplications, which create a copy of a block of the sequence and insert it in a
tandem manner, i.e., next to the original. In particular, we present two
families of codes for correcting errors due to tandem-duplications of a fixed
length, the first family can correct any number of errors while the second
corrects a bounded number of errors. We also study codes for correcting tandem
duplications of length up to a given constant $k$, where we are primarily
focused on the cases of $k=2,3$. Finally, we provide a full classification of
the sets of lengths allowed in tandem duplication that result in a unique root
for all sequences.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 18:55:45 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Jain",
"Siddharth",
""
],
[
"Farnoud",
"Farzad",
""
],
[
"Schwartz",
"Moshe",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.997961 |
1607.01383
|
Karim Banawan
|
Karim Banawan, Sennur Ulukus
|
MIMO Wiretap Channel under Receiver Side Power Constraints with
Applications to Wireless Power Transfer and Cognitive Radio
|
Submitted to IEEE Transactions on Communications, September 2015.
Accepted for publication, July 2016
| null |
10.1109/TCOMM.2016.2593739
| null |
cs.IT cs.CR cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the multiple-input multiple-output (MIMO) wiretap channel under a
minimum receiver-side power constraint in addition to the usual maximum
transmitter-side power constraint. This problem is motivated by energy
harvesting communications with wireless energy transfer, where an added goal is
to deliver a minimum amount of energy to a receiver in addition to delivering
secure data to another receiver. In this paper, we characterize the exact
secrecy capacity of the MIMO wiretap channel under transmitter and
receiver-side power constraints. We first show that solving this problem is
equivalent to solving the secrecy capacity of the wiretap channel under a
double-sided correlation matrix constraint on the channel input. We show the
converse by extending the channel enhancement technique to our case. We present
two achievable schemes that achieve the secrecy capacity: the first achievable
scheme uses a Gaussian codebook with a fixed mean, and the second achievable
scheme uses artificial noise (or cooperative jamming) together with a Gaussian
codebook. The role of the mean or the artificial noise is to enable energy
transfer without sacrificing from the secure rate. This is the first instance
of a channel model where either the use of a mean signal or the use of channel
prefixing via artificial noise is strictly necessary for the MIMO wiretap
channel. We then extend our work to consider a maximum receiver-side power
constraint. This problem is motivated by cognitive radio applications, where an
added goal is to decrease the received signal energy (interference temperature)
at a receiver. We further extend our results to: requiring receiver-side power
constraints at both receivers; considering secrecy constraints at both
receivers to study broadcast channels with confidential messages; and removing
the secrecy constraints to study the classical broadcast channel.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 19:49:39 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Banawan",
"Karim",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.996562 |
1609.07589
|
Won-Yong Shin
|
Won-Yong Shin, Vien V. Mai, Bang Chul Jung, Hyun Jong Yang
|
Opportunistic Network Decoupling With Virtual Full-Duplex Operation in
Multi-Source Interfering Relay Networks
|
22 pages, 5 figures, To appear in IEEE Transactions on Mobile
Computing
| null |
10.1109/TMC.2016.2614979
| null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new achievability scheme, termed opportunistic network
decoupling (OND), operating in virtual full-duplex mode. In the scheme, a novel
relay scheduling strategy is utilized in the $K\times N\times K$ channel with
interfering relays, consisting of $K$ source--destination pairs and $N$
half-duplex relays in-between them. A subset of relays using alternate relaying
is opportunistically selected in terms of producing the minimum total
interference level, thereby resulting in network decoupling. As our main
result, it is shown that under a certain relay scaling condition, the OND
protocol achieves $K$ degrees of freedom even in the presence of interfering
links among relays. Numerical evaluation is also shown to validate the
performance of the proposed OND. Our protocol basically operates in a fully
distributed fashion along with local channel state information, thereby
resulting in a relatively easy implementation.
|
[
{
"version": "v1",
"created": "Sat, 24 Sep 2016 09:36:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Shin",
"Won-Yong",
""
],
[
"Mai",
"Vien V.",
""
],
[
"Jung",
"Bang Chul",
""
],
[
"Yang",
"Hyun Jong",
""
]
] |
new_dataset
| 0.987931 |
1610.00125
|
Yiannis Andreopoulos
|
Joseph Doyle, Vasileios Giotsas, Mohammad Ashraful Anam and Yiannis
Andreopoulos
|
Dithen: A Computation-as-a-Service Cloud Platform For Large-Scale
Multimedia Processing
|
to appear in IEEE Transactions on Cloud Computing. arXiv admin note:
substantial text overlap with arXiv:1604.04804
| null |
10.1109/TCC.2016.2617363
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Dithen, a novel computation-as-a-service (CaaS) cloud platform
specifically tailored to the parallel execution of large-scale multimedia
tasks. Dithen handles the upload/download of both multimedia data and
executable items, the assignment of compute units to multimedia workloads, and
the reactive control of the available compute units to minimize the cloud
infrastructure cost under deadline-abiding execution. Dithen combines three key
properties: (i) the reactive assignment of individual multimedia tasks to
available computing units according to availability and predetermined
time-to-completion constraints; (ii) optimal resource estimation based on
Kalman-filter estimates; (iii) the use of additive increase multiplicative
decrease (AIMD) algorithms (famous for being the resource management in the
transport control protocol) for the control of the number of units servicing
workloads. The deployment of Dithen over Amazon EC2 spot instances is shown to
be capable of processing more than 80,000 video transcoding, face detection and
image processing tasks (equivalent to the processing of more than 116 GB of
compressed data) for less than $1 in billing cost from EC2. Moreover, the
proposed AIMD-based control mechanism, in conjunction with the Kalman
estimates, is shown to provide for more than 27% reduction in EC2 spot instance
cost against methods based on reactive resource estimation. Finally, Dithen is
shown to offer a 38% to 500% reduction of the billing cost against the current
state-of-the-art in CaaS platforms on Amazon EC2 (Amazon Lambda and Amazon
Autoscale). A baseline version of Dithen is currently available at
http://www.dithen.com under the "AutoScale" option.
|
[
{
"version": "v1",
"created": "Sat, 1 Oct 2016 12:33:35 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Doyle",
"Joseph",
""
],
[
"Giotsas",
"Vasileios",
""
],
[
"Anam",
"Mohammad Ashraful",
""
],
[
"Andreopoulos",
"Yiannis",
""
]
] |
new_dataset
| 0.998416 |
1611.04989
|
Raj Nath Patel
|
Raj Nath Patel, Prakash B. Pimpale, M Sasikumar
|
Recurrent Neural Network based Part-of-Speech Tagger for Code-Mixed
Social Media Text
|
7 pages, Published at the Tool Contest on POS tagging for Indian
Social Media Text, ICON 2016
|
In Proceedings of the Tool Contest on POS tagging for Indian
Social Media Text, ICON 2016
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes Centre for Development of Advanced Computing's (CDACM)
submission to the shared task-'Tool Contest on POS tagging for Code-Mixed
Indian Social Media (Facebook, Twitter, and Whatsapp) Text', collocated with
ICON-2016. The shared task was to predict Part of Speech (POS) tag at word
level for a given text. The code-mixed text is generated mostly on social media
by multilingual users. The presence of the multilingual words,
transliterations, and spelling variations make such content linguistically
complex. In this paper, we propose an approach to POS tag code-mixed social
media text using Recurrent Neural Network Language Model (RNN-LM) architecture.
We submitted the results for Hindi-English (hi-en), Bengali-English (bn-en),
and Telugu-English (te-en) code-mixed data.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2016 19:02:35 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Nov 2016 04:28:06 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Patel",
"Raj Nath",
""
],
[
"Pimpale",
"Prakash B.",
""
],
[
"Sasikumar",
"M",
""
]
] |
new_dataset
| 0.958025 |
1611.05105
|
Matteo Cimini
|
Matteo Cimini, Dale Miller, and Jeremy G. Siek
|
Well-Typed Languages are Sound
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Type soundness is an important property of modern programming languages. In
this paper we explore the idea that "well-typed languages are sound": the idea
that the appropriate typing discipline over language specifications guarantees
that the language is type sound. We instantiate this idea for a certain class
of languages defined using small step operational semantics by ensuring the
progress and preservation theorems. Our first contribution is a syntactic
discipline for organizing and restricting language specifications so that they
automatically satisfy the progress theorem. This discipline is not novel but
makes explicit the way expert language designers have been organizing a certain
class of languages for long time. We give a formal account of this discipline
by representing language specifications as (higher-order) logic programs and by
giving a meta type system over that collection of formulas. Our second
contribution is a methodology and meta type system for guaranteeing that
languages satisfy the preservation theorem. Ultimately, we proved that language
specifications that conform to our meta type systems are guaranteed to be type
sound. We have implemented these ideas in the TypeSoundnessCertifier, a tool
that takes language specifications in the form of logic programs and type
checks them according to our meta type systems. For those languages that pass
our type checker, our tool automatically produces a proof of type soundness
that can be machine-checked by the Abella proof assistant. For those languages
that fail our type checker, the tool pinpoints the design mistakes that hinder
type soundness. We have applied the TypeSoundnessCertifier to a large number of
programming languages, including those with recursive types, polymorphism,
letrec, exceptions, lists and other common types and operators.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2016 00:56:59 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Cimini",
"Matteo",
""
],
[
"Miller",
"Dale",
""
],
[
"Siek",
"Jeremy G.",
""
]
] |
new_dataset
| 0.969273 |
1611.05205
|
Pierre Leone
|
Pierre Leone and Steve Alpern
|
Search-and-Rescue Rendezvous
| null | null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a new type of asymmetric rendezvous search problem in which Agent
II needs to give Agent I a `gift' which can be in the form of information or
material. The gift can either be transfered upon meeting, as in traditional
rendezvous, or it can be dropped o? by II at a location he passes, in the hope
it will be found by I. The gift might be a water bottle for a traveller lost in
the desert; a supply cache for Lieutenant Scott in the Antarctic; or important
information (left as a gift). The common aim of the two agents is to minimize
the time taken for I to either meet II or find the gift. We find optimal agent
paths and droppo? times when the search region is a line, the initial distance
between the players is known and one or both of the players can leave gifts.
When there are no gifts this is the classical asymmetric rendezvous problem
solved by Alpern and Gal in 1995 [10]. We exhibit strategies solving these
various problems and use a `rendezvous algorithm' to establish their
optimality.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2016 10:13:18 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Leone",
"Pierre",
""
],
[
"Alpern",
"Steve",
""
]
] |
new_dataset
| 0.997673 |
cs/0010010
|
P. J. Costa Branco
|
J.F. Martins, P. J. Costa Branco, A.J. Pires, J.A. Dente
|
Fault Detection using Immune-Based Systems and Formal Language
Algorithms
|
To appear as an Invited paper in IEEE Conference on Decision and
Control (CDC2000), 6 pages
| null |
10.1109/CDC.2000.914202
| null |
cs.CE cs.LG
| null |
This paper describes two approaches for fault detection: an immune-based
mechanism and a formal language algorithm. The first one is based on the
feature of immune systems in distinguish any foreign cell from the body own
cell. The formal language approach assumes the system as a linguistic source
capable of generating a certain language, characterised by a grammar. Each
algorithm has particular characteristics, which are analysed in the paper,
namely in what cases they can be used with advantage. To test their
practicality, both approaches were applied on the problem of fault detection in
an induction motor.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2000 17:54:38 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Martins",
"J. F.",
""
],
[
"Branco",
"P. J. Costa",
""
],
[
"Pires",
"A. J.",
""
],
[
"Dente",
"J. A.",
""
]
] |
new_dataset
| 0.979632 |
cs/0410012
|
Ioan Raicu
|
Catalin Dumitrescu, Ioan Raicu, Matei Ripeanu, Ian Foster
|
DiPerF: an automated DIstributed PERformance testing Framework
|
8 pages, 8 figures, will appear in IEEE/ACM Grid2004, November 2004
| null |
10.1109/GRID.2004.21
| null |
cs.PF cs.DC
| null |
We present DiPerF, a distributed performance testing framework, aimed at
simplifying and automating service performance evaluation. DiPerF coordinates a
pool of machines that test a target service, collects and aggregates
performance metrics, and generates performance statistics. The aggregate data
collected provide information on service throughput, on service "fairness" when
serving multiple clients concurrently, and on the impact of network latency on
service performance. Furthermore, using this data, it is possible to build
predictive models that estimate a service performance given the service load.
We have tested DiPerF on 100+ machines on two testbeds, Grid3 and PlanetLab,
and explored the performance of job submission services (pre WS GRAM and WS
GRAM) included with Globus Toolkit 3.2.
|
[
{
"version": "v1",
"created": "Tue, 5 Oct 2004 22:38:14 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Dumitrescu",
"Catalin",
""
],
[
"Raicu",
"Ioan",
""
],
[
"Ripeanu",
"Matei",
""
],
[
"Foster",
"Ian",
""
]
] |
new_dataset
| 0.954466 |
cs/0412118
|
Chiranjeeb Buragohain
|
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
|
Power Aware Routing for Sensor Databases
| null |
Proceedings of IEEE INFOCOM 2005, March 13-17, 2005 Miami
|
10.1109/INFCOM.2005.1498455
| null |
cs.NI cs.DC
| null |
Wireless sensor networks offer the potential to span and monitor large
geographical areas inexpensively. Sensor network databases like TinyDB are the
dominant architectures to extract and manage data in such networks. Since
sensors have significant power constraints (battery life), and high
communication costs, design of energy efficient communication algorithms is of
great importance. The data flow in a sensor database is very different from
data flow in an ordinary network and poses novel challenges in designing
efficient routing algorithms. In this work we explore the problem of energy
efficient routing for various different types of database queries and show that
in general, this problem is NP-complete. We give a constant factor
approximation algorithm for one class of query, and for other queries give
heuristic algorithms. We evaluate the efficiency of the proposed algorithms by
simulation and demonstrate their near optimal performance for various network
sizes.
|
[
{
"version": "v1",
"created": "Thu, 30 Dec 2004 02:02:35 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Buragohain",
"Chiranjeeb",
""
],
[
"Agrawal",
"Divyakant",
""
],
[
"Suri",
"Subhash",
""
]
] |
new_dataset
| 0.994809 |
cs/0501057
|
Kenjiro Yanagi
|
Jun Ichi Fujii, Ritsuo Nakamoto, Kenjiro Yanagi
|
Concavity of the auxiliary function appearing in quantum reliability
function an classical-quantum channels
|
submitted in IEEE Trans. IT
| null |
10.1109/ISIT.2005.1523466
| null |
cs.IT math.IT
| null |
Concavity of the auxiliary function which appears in the random coding
exponent as the lower bound of the quantum reliability function for general
quantum states is proven for s between 0 and 1.
|
[
{
"version": "v1",
"created": "Sat, 22 Jan 2005 01:22:10 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Fujii",
"Jun Ichi",
""
],
[
"Nakamoto",
"Ritsuo",
""
],
[
"Yanagi",
"Kenjiro",
""
]
] |
new_dataset
| 0.992586 |
cs/0501085
|
Oliver Henkel
|
Oliver Henkel
|
Space Frequency Codes from Spherical Codes
|
5 pages. Final version for the 2005 IEEE International Symposium on
Information Theory
| null |
10.1109/ISIT.2005.1523553
| null |
cs.IT math.IT
| null |
A new design method for high rate, fully diverse ('spherical') space
frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary
numbers of antennas and subcarriers. The construction exploits a differential
geometric connection between spherical codes and space time codes. The former
are well studied e.g. in the context of optimal sequence design in CDMA
systems, while the latter serve as basic building blocks for space frequency
codes. In addition a decoding algorithm with moderate complexity is presented.
This is achieved by a lattice based construction of spherical codes, which
permits lattice decoding algorithms and thus offers a substantial reduction of
complexity.
|
[
{
"version": "v1",
"created": "Fri, 28 Jan 2005 21:37:37 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Aug 2005 13:24:07 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Henkel",
"Oliver",
""
]
] |
new_dataset
| 0.999471 |
cs/0502091
|
Ricardo Corin
|
J.G. Cederquist, R. Corin, M.A.C. Dekker, S. Etalle and J.I. den
Hartog
|
An Audit Logic for Accountability
|
To appear in Proceedings of IEEE Policy 2005
| null |
10.1109/POLICY.2005.5
| null |
cs.CR cs.LO
| null |
We describe and implement a policy language. In our system, agents can
distribute data along with usage policies in a decentralized architecture. Our
language supports the specification of conditions and obligations, and also the
possibility to refine policies. In our framework, the compliance with usage
policies is not actively enforced. However, agents are accountable for their
actions, and may be audited by an authority requiring justifications.
|
[
{
"version": "v1",
"created": "Thu, 24 Feb 2005 15:16:03 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2005 21:08:53 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Apr 2005 20:08:50 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Cederquist",
"J. G.",
""
],
[
"Corin",
"R.",
""
],
[
"Dekker",
"M. A. C.",
""
],
[
"Etalle",
"S.",
""
],
[
"Hartog",
"J. I. den",
""
]
] |
new_dataset
| 0.952303 |
cs/0506012
|
Farhad Meshkati
|
Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz
|
A Non-Cooperative Power Control Game in Delay-Constrained
Multiple-Access Networks
|
To apprear in the proceedings of the 2005 IEEE International
Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
| null |
10.1109/ISIT.2005.1523426
| null |
cs.IT math.IT
| null |
A game-theoretic approach for studying power control in multiple-access
networks with transmission delay constraints is proposed. A non-cooperative
power control game is considered in which each user seeks to choose a transmit
power that maximizes its own utility while satisfying the user's delay
requirements. The utility function measures the number of reliable bits
transmitted per joule of energy and the user's delay constraint is modeled as
an upper bound on the delay outage probability. The Nash equilibrium for the
proposed game is derived, and its existence and uniqueness are proved. Using a
large-system analysis, explicit expressions for the utilities achieved at
equilibrium are obtained for the matched filter, decorrelating and minimum mean
square error multiuser detectors. The effects of delay constraints on the
users' utilities (in bits/Joule) and network capacity (i.e., the maximum number
of users that can be supported) are quantified.
|
[
{
"version": "v1",
"created": "Sun, 5 Jun 2005 17:47:23 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Meshkati",
"Farhad",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Schwartz",
"Stuart C.",
""
]
] |
new_dataset
| 0.974363 |
cs/0506042
|
Deepak Sridhara
|
Deepak Sridhara, Christine Kelley, and Joachim Rosenthal
|
Tree-Based Construction of LDPC Codes
|
5 pages, 12 figures. To appear in the Proceedings of IEEE
International Symposium on Information Theory, Sept. 4-9, 2005, Adelaide,
Australia
| null |
10.1109/ISIT.2005.1523456
| null |
cs.IT math.IT
| null |
We present a construction of LDPC codes that have minimum pseudocodeword
weight equal to the minimum distance, and perform well with iterative decoding.
The construction involves enumerating a d-regular tree for a fixed number of
layers and employing a connection algorithm based on mutually orthogonal Latin
squares to close the tree. Methods are presented for degrees d=p^s and d =
p^s+1, for p a prime, -- one of which includes the well-known
finite-geometry-based LDPC codes.
|
[
{
"version": "v1",
"created": "Sun, 12 Jun 2005 09:00:09 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Sridhara",
"Deepak",
""
],
[
"Kelley",
"Christine",
""
],
[
"Rosenthal",
"Joachim",
""
]
] |
new_dataset
| 0.99797 |
cs/0506093
|
Oscar Takeshita
|
Oscar Y. Takeshita
|
On Maximum Contention-Free Interleavers and Permutation Polynomials over
Integer Rings
|
13 pages, 2 figures, submitted as a correspondence to the IEEE
Transactions on Information Theory, revised version
| null |
10.1109/TIT.2005.864450
| null |
cs.IT math.IT
| null |
An interleaver is a critical component for the channel coding performance of
turbo codes. Algebraic constructions are of particular interest because they
admit analytical designs and simple, practical hardware implementation.
Contention-free interleavers have been recently shown to be suitable for
parallel decoding of turbo codes. In this correspondence, it is shown that
permutation polynomials generate maximum contention-free interleavers, i.e.,
every factor of the interleaver length becomes a possible degree of parallel
processing of the decoder. Further, it is shown by computer simulations that
turbo codes using these interleavers perform very well for the 3rd Generation
Partnership Project (3GPP) standard.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2005 20:30:06 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Nov 2005 00:06:31 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Takeshita",
"Oscar Y.",
""
]
] |
new_dataset
| 0.994448 |
cs/0508011
|
Kazuto Ogawa
|
Kazuto Ogawa, Goichiro Hanaoka and Hideki Imai
|
A Secure Traitor Tracing Scheme against Key Exposure
|
5 pages, IEEE International Symposium on Information Theory 2005
(ISIT 2005)
| null |
10.1109/ISIT.2005.1523670
| null |
cs.CR
| null |
Copyright protection is a major issue in distributing digital content. On the
other hand, improvements to usability are sought by content users. In this
paper, we propose a secure {\it traitor tracing scheme against key exposure
(TTaKE)} which contains the properties of both a traitor tracing scheme and a
forward secure public key cryptosystem. Its structure fits current digital
broadcasting systems and it may be useful in preventing traitors from making
illegal decoders and in minimizing the damage from accidental key exposure. It
can improve usability through these properties.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2005 07:36:51 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Ogawa",
"Kazuto",
""
],
[
"Hanaoka",
"Goichiro",
""
],
[
"Imai",
"Hideki",
""
]
] |
new_dataset
| 0.989618 |
cs/0508019
|
Pascal Vontobel
|
Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch,
Dejan Vukobratovic
|
On the Minimal Pseudo-Codewords of Codes from Finite Geometries
|
To appear in Proc. 2005 IEEE International Symposium on Information
Theory, Adelaide, Australia, September 4-9, 2005
| null |
10.1109/ISIT.2005.1523484
| null |
cs.IT cs.DM math.IT
| null |
In order to understand the performance of a code under maximum-likelihood
(ML) decoding, it is crucial to know the minimal codewords. In the context of
linear programming (LP) decoding, it turns out to be necessary to know the
minimal pseudo-codewords. This paper studies the minimal codewords and minimal
pseudo-codewords of some families of codes derived from projective and
Euclidean planes. Although our numerical results are only for codes of very
modest length, they suggest that these code families exhibit an interesting
property. Namely, all minimal pseudo-codewords that are not multiples of a
minimal codeword have an AWGNC pseudo-weight that is strictly larger than the
minimum Hamming weight of the code. This observation has positive consequences
not only for LP decoding but also for iterative decoding.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2005 16:34:05 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Vontobel",
"Pascal O.",
""
],
[
"Smarandache",
"Roxana",
""
],
[
"Kiyavash",
"Negar",
""
],
[
"Teutsch",
"Jason",
""
],
[
"Vukobratovic",
"Dejan",
""
]
] |
new_dataset
| 0.999296 |
cs/0508057
|
Miguel Rodrigues PhD
|
M. R. D. Rodrigues, I. Chatzigeorgiou, I. J. Wassell and R. Carrasco
|
On the Performance of Turbo Codes in Quasi-Static Fading Channels
|
To appear in the Proceedings of the 2005 IEEE International Symposium
on Information Theory, Adelaide, Australia, September 4-9, 2005
| null |
10.1109/ISIT.2005.1523410
| null |
cs.IT math.IT
| null |
In this paper, we investigate in detail the performance of turbo codes in
quasi-static fading channels both with and without antenna diversity. First, we
develop a simple and accurate analytic technique to evaluate the performance of
turbo codes in quasi-static fading channels. The proposed analytic technique
relates the frame error rate of a turbo code to the iterative decoder
convergence threshold, rather than to the turbo code distance spectrum.
Subsequently, we compare the performance of various turbo codes in quasi-static
fading channels. We show that, in contrast to the situation in the AWGN
channel, turbo codes with different interleaver sizes or turbo codes based on
RSC codes with different constraint lengths and generator polynomials exhibit
identical performance. Moreover, we also compare the performance of turbo codes
and convolutional codes in quasi-static fading channels under the condition of
identical decoding complexity. In particular, we show that turbo codes do not
outperform convolutional codes in quasi-static fading channels with no antenna
diversity; and that turbo codes only outperform convolutional codes in
quasi-static fading channels with antenna diversity.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2005 10:14:52 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Rodrigues",
"M. R. D.",
""
],
[
"Chatzigeorgiou",
"I.",
""
],
[
"Wassell",
"I. J.",
""
],
[
"Carrasco",
"R.",
""
]
] |
new_dataset
| 0.995328 |
cs/0605118
|
Deepak Sridhara
|
Christine A. Kelley, Deepak Sridhara, and Joachim Rosenthal
|
Pseudocodeword weights for non-binary LDPC codes
|
5 pages, 3 figures. To appear in Proceedings of the 2006 IEEE
International Symposium on Information Theory, July 9-14, 2006, Seattle, USA
| null |
10.1109/ISIT.2006.262072
| null |
cs.IT math.IT
| null |
Pseudocodewords of q-ary LDPC codes are examined and the weight of a
pseudocodeword on the q-ary symmetric channel is defined. The weight definition
of a pseudocodeword on the AWGN channel is also extended to two-dimensional
q-ary modulation such as q-PAM and q-PSK. The tree-based lower bounds on the
minimum pseudocodeword weight are shown to also hold for q-ary LDPC codes on
these channels.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2006 22:03:41 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Kelley",
"Christine A.",
""
],
[
"Sridhara",
"Deepak",
""
],
[
"Rosenthal",
"Joachim",
""
]
] |
new_dataset
| 0.981485 |
cs/0608021
|
Eyal Lubetzky
|
Noga Alon, Eyal Lubetzky
|
The Shannon capacity of a graph and the independence numbers of its
powers
| null |
IEEE Trans. on Information Theory 52 (2006), 2172-2176
|
10.1109/TIT.2006.872856
| null |
cs.IT cs.DM math.IT
| null |
The independence numbers of powers of graphs have been long studied, under
several definitions of graph products, and in particular, under the strong
graph product. We show that the series of independence numbers in strong powers
of a fixed graph can exhibit a complex structure, implying that the Shannon
Capacity of a graph cannot be approximated (up to a sub-polynomial factor of
the number of vertices) by any arbitrarily large, yet fixed, prefix of the
series. This is true even if this prefix shows a significant increase of the
independence number at a given power, after which it stabilizes for a while.
|
[
{
"version": "v1",
"created": "Thu, 3 Aug 2006 14:46:36 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Alon",
"Noga",
""
],
[
"Lubetzky",
"Eyal",
""
]
] |
new_dataset
| 0.99649 |
cs/0609018
|
Peyman Razaghi
|
Peyman Razaghi, Wei Yu
|
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay
Channels
|
Submitted to IEEE Trans. Info. Theory
| null |
10.1109/TIT.2007.904983
| null |
cs.IT math.IT
| null |
This paper describes an efficient implementation of binning for the relay
channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC
codes to approach the theoretically promised rate of the decode-and-forward
relaying strategy by incorporating relay-generated information bits in
specially designed bilayer graphical code structures. While conventional LDPC
codes are sensitively tuned to operate efficiently at a certain channel
parameter, the proposed bilayer LDPC codes are capable of working at two
different channel parameters and two different rates: that at the relay and at
the destination. To analyze the performance of bilayer LDPC codes, bilayer
density evolution is devised as an extension of the standard density evolution
algorithm. Based on bilayer density evolution, a design methodology is
developed for the bilayer codes in which the degree distribution is iteratively
improved using linear programming. Further, in order to approach the
theoretical decode-and-forward rate for a wide range of channel parameters,
this paper proposes two different forms bilayer codes, the bilayer-expurgated
and bilayer-lengthened codes. It is demonstrated that a properly designed
bilayer LDPC code can achieve an asymptotic infinite-length threshold within
0.24 dB gap to the Shannon limits of two different channels simultaneously for
a wide range of channel parameters. By practical code construction,
finite-length bilayer codes are shown to be able to approach within a 0.6 dB
gap to the theoretical decode-and-forward rate of the relay channel at a block
length of $10^5$ and a bit-error probability (BER) of $10^{-4}$. Finally, it is
demonstrated that a generalized version of the proposed bilayer code
construction is applicable to relay networks with multiple relays.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2006 19:34:55 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Razaghi",
"Peyman",
""
],
[
"Yu",
"Wei",
""
]
] |
new_dataset
| 0.998449 |
cs/0609023
|
Himanshu Thapliyal
|
Himanshu Thapliyal, M. B. Srinivas
|
Novel Reversible TSG Gate and Its Application for Designing Components
of Primitive Reversible/Quantum ALU
|
5 Pages; Published in Proceedings of the Fifth IEEE International
Conference on Information, Communications and Signal Processing (ICICS 2005),
Bangkok, Thailand, 6-9 December 2005,pp.1425-1429
| null |
10.1109/ICICS.2005.1689293
| null |
cs.AR
| null |
In recent years, reversible logic has emerged as a promising computing
paradigm having application in low power CMOS, quantum computing,
nanotechnology, and optical computing. The classical set of gates such as AND,
OR, and EXOR are not reversible. This paper utilizes a new 4 * 4 reversible
gate called TSG gate to build the components of a primitive reversible/quantum
ALU. The most significant aspect of the TSG gate is that it can work singly as
a reversible full adder, that is reversible full adder can now be implemented
with a single gate only. A Novel reversible 4:2 compressor is also designed
from the TSG gate which is later used to design a novel 8x8 reversible Wallace
tree multiplier. It is proved that the adder, 4:2 compressor and multiplier
architectures designed using the TSG gate are better than their counterparts
available in literature, in terms of number of reversible gates and garbage
outputs. This is perhaps, the first attempt to design a reversible 4:2
compressor and a reversible Wallace tree multiplier as far as existing
literature and our knowledge is concerned. Thus, this paper provides an initial
threshold to build more complex systems which can execute complicated
operations using reversible logic.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2006 16:09:04 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Thapliyal",
"Himanshu",
""
],
[
"Srinivas",
"M. B.",
""
]
] |
new_dataset
| 0.960462 |
cs/0610025
|
M Anand
|
M. Anand, P. Vijay Kumar
|
Low Correlation Sequences over the QAM Constellation
|
21 pages, 3 figures. To appear in IEEE Transactions on Information
Theory in February 2008
| null |
10.1109/TIT.2007.913512
| null |
cs.IT math.IT
| null |
This paper presents the first concerted look at low correlation sequence
families over QAM constellations of size M^2=4^m and their potential
applicability as spreading sequences in a CDMA setting.
Five constructions are presented, and it is shown how such sequence families
have the ability to transport a larger amount of data as well as enable
variable-rate signalling on the reverse link.
Canonical family CQ has period N, normalized maximum-correlation parameter
theta_max bounded above by A sqrt(N), where 'A' ranges from 1.8 in the 16-QAM
case to 3.0 for large M. In a CDMA setting, each user is enabled to transfer 2m
bits of data per period of the spreading sequence which can be increased to 3m
bits of data by halving the size of the sequence family. The technique used to
construct CQ is easily extended to produce larger sequence families and an
example is provided.
Selected family SQ has a lower value of theta_max but permits only (m+1)-bit
data modulation. The interleaved 16-QAM sequence family IQ has theta_max <=
sqrt(2) sqrt(N) and supports 3-bit data modulation.
The remaining two families are over a quadrature-PAM (Q-PAM) subset of size
2M of the M^2-QAM constellation. Family P has a lower value of theta_max in
comparison with Family SQ, while still permitting (m+1)-bit data modulation.
Interleaved family IP, over the 8-ary Q-PAM constellation, permits 3-bit data
modulation and interestingly, achieves the Welch lower bound on theta_max.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2006 14:27:46 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jul 2007 11:58:25 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Nov 2007 17:53:06 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Anand",
"M.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.976369 |
cs/0610090
|
Himanshu Thapliyal
|
Himanshu Thapliyal, Hamid R. Arabnia and A.P Vinod
|
Combined Integer and Floating Point Multiplication Architecture(CIFM)
for FPGAs and Its Reversible Logic Implementation
|
Published in the proceedings of the The 49th IEEE International
Midwest Symposium on Circuits and Systems (MWSCAS 2006), Puerto Rico, August
2006. Nominated for the Student Paper Award(12 papers are nominated for
Student paper Award among all submissions)
| null |
10.1109/MWSCAS.2006.382306
| null |
cs.AR
| null |
In this paper, the authors propose the idea of a combined integer and
floating point multiplier(CIFM) for FPGAs. The authors propose the replacement
of existing 18x18 dedicated multipliers in FPGAs with dedicated 24x24
multipliers designed with small 4x4 bit multipliers. It is also proposed that
for every dedicated 24x24 bit multiplier block designed with 4x4 bit
multipliers, four redundant 4x4 multiplier should be provided to enforce the
feature of self repairability (to recover from the faults). In the proposed
CIFM reconfigurability at run time is also provided resulting in low power. The
major source of motivation for providing the dedicated 24x24 bit multiplier
stems from the fact that single precision floating point multiplier requires
24x24 bit integer multiplier for mantissa multiplication. A reconfigurable,
self-repairable 24x24 bit multiplier (implemented with 4x4 bit multiply
modules) will ideally suit this purpose, making FPGAs more suitable for integer
as well floating point operations. A dedicated 4x4 bit multiplier is also
proposed in this paper. Moreover, in the recent years, reversible logic has
emerged as a promising technology having its applications in low power CMOS,
quantum computing, nanotechnology, and optical computing. It is not possible to
realize quantum computing without reversible logic. Thus, this paper also paper
provides the reversible logic implementation of the proposed CIFM. The
reversible CIFM designed and proposed here will form the basis of the
completely reversible FPGAs.
|
[
{
"version": "v1",
"created": "Sat, 14 Oct 2006 10:39:42 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Thapliyal",
"Himanshu",
""
],
[
"Arabnia",
"Hamid R.",
""
],
[
"Vinod",
"A. P",
""
]
] |
new_dataset
| 0.993046 |
cs/0611118
|
Florentin Smarandache
|
Haibin Wang, Andre Rogatko, Florentin Smarandache, Rajshekhar
Sunderraman
|
A Neutrosophic Description Logic
|
18 pages. Presented at the IEEE International Conference on Granular
Computing, Georgia State University, Atlanta, USA, May 2006
|
Proceedings of 2006 IEEE International Conference on Granular
Computing, edited by Yan-Qing Zhang and Tsau Young Lin, Georgia State
University, Atlanta, pp. 305-308, 2006
|
10.1142/S1793005708001100
| null |
cs.AI
| null |
Description Logics (DLs) are appropriate, widely used, logics for managing
structured knowledge. They allow reasoning about individuals and concepts, i.e.
set of individuals with common properties. Typically, DLs are limited to
dealing with crisp, well defined concepts. That is, concepts for which the
problem whether an individual is an instance of it is yes/no question. More
often than not, the concepts encountered in the real world do not have a
precisely defined criteria of membership: we may say that an individual is an
instance of a concept only to a certain degree, depending on the individual's
properties. The DLs that deal with such fuzzy concepts are called fuzzy DLs. In
order to deal with fuzzy, incomplete, indeterminate and inconsistent concepts,
we need to extend the fuzzy DLs, combining the neutrosophic logic with a
classical DL. In particular, concepts become neutrosophic (here neutrosophic
means fuzzy, incomplete, indeterminate, and inconsistent), thus reasoning about
neutrosophic concepts is supported. We'll define its syntax, its semantics, and
describe its properties.
|
[
{
"version": "v1",
"created": "Wed, 22 Nov 2006 20:04:21 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Mar 2008 00:49:49 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Wang",
"Haibin",
""
],
[
"Rogatko",
"Andre",
""
],
[
"Smarandache",
"Florentin",
""
],
[
"Sunderraman",
"Rajshekhar",
""
]
] |
new_dataset
| 0.996797 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.