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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1509.00436
|
Sijia Deng
|
Theodore S. Rappaport, Sijia Deng
|
73 GHz Wideband Millimeter-Wave Foliage and Ground Reflection
Measurements and Models
|
6 pages, 4 figures, 2015 IEEE International Conference on
Communications (ICC), ICC Workshops
| null |
10.1109/ICCW.2015.7247347
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents 73 GHz wideband outdoor foliage and ground reflection
measurements. Propagation measurements were made with a 400 Megachip-per-second
sliding correlator channel sounder, with rotatable 27 dBi (7 degrees half-
power beamwidth) horn antennas at both the transmitter and receiver, to study
foliage-induced scattering and de-polarization effects, to assist in developing
future wireless systems that will use adaptive array antennas. Signal
attenuation through foliage was measured to be 0.4 dB/m for both co- and
cross-polarized antenna configurations. Measured ground reflection coefficients
for dirt and gravel ranged from 0.02 to 0.34, for incident angles ranging from
60 degrees to 81 degrees (with respect to the normal incidence of the surface).
These data are useful for link budget design and site-specific (ray-tracing)
models for future millimeter-wave communication systems.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2015 18:47:19 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Rappaport",
"Theodore S.",
""
],
[
"Deng",
"Sijia",
""
]
] |
new_dataset
| 0.999206 |
1509.00940
|
Xiao Lu
|
Xiao Lu, Ping Wang, Dusit Niyato, Dong In Kim, and Zhu Han
|
Wireless Charging Technologies: Fundamentals, Standards, and Network
Applications
|
to appear in IEEE Communications Surveys and Tutorial
| null |
10.1109/COMST.2015.2499783
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless charging is a technology of transmitting power through an air gap to
electrical devices for the purpose of energy replenishment. The recent progress
in wireless charging techniques and development of commercial products have
provided a promising alternative way to address the energy bottleneck of
conventionally portable battery-powered devices. However, the incorporation of
wireless charging into the existing wireless communication systems also brings
along a series of challenging issues with regard to implementation, scheduling,
and power management. In this article, we present a comprehensive overview of
wireless charging techniques, the developments in technical standards, and
their recent advances in network applications. In particular, with regard to
network applications, we review the mobile charger dispatch strategies, static
charger scheduling strategies and wireless charger deployment strategies.
Additionally, we discuss open issues and challenges in implementing wireless
charging technologies. Finally, we envision some practical future network
applications of wireless charging.
|
[
{
"version": "v1",
"created": "Thu, 3 Sep 2015 04:08:24 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Nov 2015 01:02:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Lu",
"Xiao",
""
],
[
"Wang",
"Ping",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Kim",
"Dong In",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.998053 |
1510.00359
|
Mohamed Salah
|
Mohamed Salah, Amr El-Keyi, Yahya Mohasseb and Mohammed Nafie
|
Achievable Degrees of Freedom on K-user MIMO Multi-way Relay Channel
with Common and Private Messages
|
5 double-column pages, 2 figures, 1 table, the paper will be
presented at the IEEE Asilomar Conference Nov. 2015
| null |
10.1109/ACSSC.2015.7421283
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the achievable total degrees of freedom (DoF) of the
MIMO multi-way relay channel that consists of K users, where each user is
equipped with M antennas, and a decode-and-forward relay equipped with N
antennas. In this channel, each user wants to convey K-1 private messages to
the other users in addition to a common message to all of them. Due to the
absence of direct links between the users, communication occurs through the
relay in two phases; a multiple access channel phase (MAC) and a broadcast (BC)
phase. We drive cut-set bounds on the total DoF of the network, and show that
the network has DoF less than or equal to K min(N,M). Achievability of the
upper bound is shown by using signal space alignment for network coding in the
MAC phase, and zero-forcing precoding in the BC phase. We show that introducing
the common messages besides the private messages leads to achieving higher
total DoF than using the private messages only.
|
[
{
"version": "v1",
"created": "Thu, 1 Oct 2015 18:25:11 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Oct 2015 12:29:54 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Oct 2015 19:26:54 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Salah",
"Mohamed",
""
],
[
"El-Keyi",
"Amr",
""
],
[
"Mohasseb",
"Yahya",
""
],
[
"Nafie",
"Mohammed",
""
]
] |
new_dataset
| 0.971342 |
1510.01989
|
Malcolm Atkinson
|
Malcolm Atkinson, Michele Carpen\'e, Emanuele Casarotti, Steffen
Claus, Rosa Filgueira, Anton Frank, Michelle Galea, Tom Garth, Andr\'e
Gem\"und, Heiner Igel, Iraklis Klampanos, Amrey Krause, Lion Krischer, Siew
Hoon Leong, Federica Magnoni, Jonas Matser, Alberto Michelini, Andreas
Rietbrock, Horst Schwichtenberg, Alessandro Spinuso and Jean-Pierre Vilotte
|
VERCE delivers a productive e-Science environment for seismology
research
|
14 pages, 3 figures. Pre-publication version of paper accepted and
published at the IEEE eScience 2015 conference in Munich with substantial
additions, particularly in the analysis of issues
| null |
10.1109/eScience.2015.38
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The VERCE project has pioneered an e-Infrastructure to support researchers
using established simulation codes on high-performance computers in conjunction
with multiple sources of observational data. This is accessed and organised via
the VERCE science gateway that makes it convenient for seismologists to use
these resources from any location via the Internet. Their data handling is made
flexible and scalable by two Python libraries, ObsPy and dispel4py and by data
services delivered by ORFEUS and EUDAT. Provenance driven tools enable rapid
exploration of results and of the relationships between data, which accelerates
understanding and method improvement. These powerful facilities are integrated
and draw on many other e-Infrastructures. This paper presents the motivation
for building such systems, it reviews how solid-Earth scientists can make
significant research progress using them and explains the architecture and
mechanisms that make their construction and operation achievable. We conclude
with a summary of the achievements to date and identify the crucial steps
needed to extend the capabilities for seismologists, for solid-Earth scientists
and for similar disciplines.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2015 15:37:48 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Atkinson",
"Malcolm",
""
],
[
"Carpené",
"Michele",
""
],
[
"Casarotti",
"Emanuele",
""
],
[
"Claus",
"Steffen",
""
],
[
"Filgueira",
"Rosa",
""
],
[
"Frank",
"Anton",
""
],
[
"Galea",
"Michelle",
""
],
[
"Garth",
"Tom",
""
],
[
"Gemünd",
"André",
""
],
[
"Igel",
"Heiner",
""
],
[
"Klampanos",
"Iraklis",
""
],
[
"Krause",
"Amrey",
""
],
[
"Krischer",
"Lion",
""
],
[
"Leong",
"Siew Hoon",
""
],
[
"Magnoni",
"Federica",
""
],
[
"Matser",
"Jonas",
""
],
[
"Michelini",
"Alberto",
""
],
[
"Rietbrock",
"Andreas",
""
],
[
"Schwichtenberg",
"Horst",
""
],
[
"Spinuso",
"Alessandro",
""
],
[
"Vilotte",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.993399 |
1510.02826
|
Adnan Aijaz
|
Adnan Aijaz, Mischa Dohler, A. Hamid Aghvami, Vasilis Friderikos,
Magnus Frodigh
|
Realizing the Tactile Internet: Haptic Communications over Next
Generation 5G Cellular Networks
|
IEEE Wireless Communications - Accepted for Publication
| null |
10.1109/MWC.2016.1500157RP
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prior Internet designs encompassed the fixed, mobile and lately the things
Internet. In a natural evolution to these, the notion of the Tactile Internet
is emerging which allows one to transmit touch and actuation in real-time. With
voice and data communications driving the designs of the current Internets, the
Tactile Internet will enable haptic communications, which in turn will be a
paradigm shift in how skills and labor are digitally delivered globally. Design
efforts for both the Tactile Internet and the underlying haptic communications
are in its infancy. The aim of this article is thus to review some of the most
stringent design challenges, as well as proposing first avenues for specific
solutions to enable the Tactile Internet revolution.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 21:11:47 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Dec 2015 23:17:38 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Aijaz",
"Adnan",
""
],
[
"Dohler",
"Mischa",
""
],
[
"Aghvami",
"A. Hamid",
""
],
[
"Friderikos",
"Vasilis",
""
],
[
"Frodigh",
"Magnus",
""
]
] |
new_dataset
| 0.990325 |
1510.05338
|
Kamal Rahimi Malekshan
|
Kamal Rahimi Malekshan, Weihua Zhuang and Yves Lostanlen
|
Coordination-based Medium Access Control with Space-reservation for
Wireless Ad Hoc Networks
|
12 pages, 12 figures, IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2015.2493544
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Efficient radio spectrum utilization and low energy consumption in mobile
devices are essential in developing next generation wireless networks. This
paper presents a new medium access control (MAC) mechanism to enhance spectrum
efficiency and reduce energy consumption in a wireless ad hoc network. A set of
coordinator nodes, distributed in the network area, periodically schedule
contention-free time slots for all data transmissions/receptions in the
network, based on transmission requests from source nodes. Adjacent
coordinators exchange scheduling information to effectively increase spatial
spectrum reuse and avoid transmission collisions. Moreover, the proposed MAC
scheme allows a node to put its radio interface into a sleep mode when it is
not transmitting/receiving a packet, in order to reduce energy consumption.
Simulation results demonstrate that the proposed scheme achieves substantially
higher throughput and has significantly lower energy consumption in comparison
with existing schemes.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 02:46:35 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Malekshan",
"Kamal Rahimi",
""
],
[
"Zhuang",
"Weihua",
""
],
[
"Lostanlen",
"Yves",
""
]
] |
new_dataset
| 0.997611 |
1510.07728
|
Mahyar Shirvanimoghaddam
|
Mahyar Shirvanimoghaddam, Sarah J. Johnson, Andrew M. Lance
|
Design of Raptor Codes in the Low SNR Regime with Applications in
Quantum Key Distribution
|
The paper has been submitted to IEEE International Communications
Conference (ICC), Kuala Lumpur, Malaysia, May 2016
| null |
10.1109/ICC.2016.7510800
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The focus of this work is on the design of Raptor codes for continuous
variable Quantum key distribution (CV-QKD) systems. We design a highly
efficient Raptor code for very low signal to noise ratios (SNRs), which enables
CV-QKD systems to operate over long distances with a significantly higher
secret key rate compared to conventional fixed rate codes. The degree
distribution design of Raptor codes in the low SNR regime is formulated as a
linear program, where a set of optimized degree distributions are also obtained
through linear programming. Simulation results show that the designed code
achieves efficiencies higher than 94\% for SNRs as low as -20 dB and -30 dB. We
further propose a new error reconciliation protocol for CV-QKD systems by using
Raptor codes and show that it can achieve higher secret key rates over long
distances compared to existing protocols.
|
[
{
"version": "v1",
"created": "Tue, 27 Oct 2015 00:03:50 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Shirvanimoghaddam",
"Mahyar",
""
],
[
"Johnson",
"Sarah J.",
""
],
[
"Lance",
"Andrew M.",
""
]
] |
new_dataset
| 0.99878 |
1511.07556
|
Ke Xiong
|
Xiaofei Di, Ke Xiong, Pingyi Fan, and Hongchuan Yang
|
Simultaneous Wireless Information and Power Transfer in Cooperative
Relay Networks with Rateless Codes
|
31 pages,15 figures, submitted to IEEE Journal
| null |
10.1109/TVT.2016.2588441
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the simultaneous wireless information and power
transfer (SWIPT) in cooperative relay networks, where a relay harvests energy
from the radio frequency (RF) signals transmitted by a source and then uses the
harvested energy to assist the information transmission from the source to its
destination. Both source and relay transmissions use rateless code, which
allows the destination to employ any of the two information receiving
strategies, i.e., the mutual information accumulation (IA) and the energy
accumulation (EA). The SWIPT-enabled relay employs three different SWIPT
receiver architectures, the ideal receiver and two practical receivers (i.e.,
the power splitting (PS) and the time switch (TS) receivers). Accordingly,
three relaying protocols, namely, ideal protocol, PS protocol and TS protocol,
are presented. In order to explore the system performance limits with these
three protocols, optimization problems are formulated to maximize their
achievable information rates. For the ideal protocol, explicit expressions of
the optimal solutions are derived. For the PS protocol, a linear-search
algorithm is designed to solve the non-convex problems. For the TS protocol,
two solving methods are presented. Numerical experiments are carried out to
validate our analysis and algorithms, which also show that, with the same SWIPT
receiver, the IA-based system outperforms the EA-based system, while with the
same information receiving strategy, PS protocol outperforms TS protocol.
Moreover, compared with conventional non-SWIPT and non-rateless-coded systems,
the proposed protocols exhibit considerable performance gains, especially in
relatively low signal-to-noise ratio (SNR) regime. Besides, the effects of the
source-destination direct link and the relay position on system performance are
also discussed, which provides insights on SWIPT-enabled relay systems.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 03:45:42 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Di",
"Xiaofei",
""
],
[
"Xiong",
"Ke",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Yang",
"Hongchuan",
""
]
] |
new_dataset
| 0.993206 |
1601.01089
|
Silas Fong
|
Silas L. Fong and Vincent Y. F. Tan
|
On the Scaling Exponent of Polar Codes for Binary-Input
Energy-Harvesting Channels
|
References updated, typos corrected, to appear in IEEE Journal on
Selected Areas in Communications
| null |
10.1109/JSAC.2016.2611949
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the scaling exponent of polar codes for binary-input
energy-harvesting (EH) channels with infinite-capacity batteries. The EH
process is characterized by a sequence of i.i.d. random variables with finite
variances. The scaling exponent $\mu$ of polar codes for a binary-input
memoryless channel (BMC) characterizes the closest gap between the capacity and
non-asymptotic rates achieved by polar codes with error probabilities no larger
than some non-vanishing $\varepsilon\in(0,1)$. It has been shown that for any
$\varepsilon\in(0,1)$, the scaling exponent $\mu$ for any binary-input
memoryless symmetric channel (BMSC) with $I(q_{Y|X})\in(0,1)$ lies between
3.579 and 4.714 , where the upper bound $4.714$ was shown by an explicit
construction of polar codes. Our main result shows that $4.714$ remains to be a
valid upper bound on the scaling exponent for any binary-input EH channel,
i.e., a BMC subject to additional EH constraints. Our result thus implies that
the EH constraints do not worsen the rate of convergence to capacity if polar
codes are employed. The main result is proved by leveraging the following three
existing results: scaling exponent analyses for BMSCs, construction of polar
codes designed for binary-input memoryless asymmetric channels, and the
save-and-transmit strategy for EH channels.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 06:27:01 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Apr 2016 03:47:09 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Nov 2016 05:17:21 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Fong",
"Silas L.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.956708 |
1601.03872
|
Blesson Varghese
|
Blesson Varghese, Lawan Thamsuhang Subba, Long Thai, Adam Barker
|
Container-Based Cloud Virtual Machine Benchmarking
|
Accepted to the IEEE International Conference on Cloud Engineering
(IEEE IC2E), Berlin, Germany, 2016 - 10 pages
| null |
10.1109/IC2E.2016.28
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the availability of a wide range of cloud Virtual Machines (VMs) it is
difficult to determine which VMs can maximise the performance of an
application. Benchmarking is commonly used to this end for capturing the
performance of VMs. Most cloud benchmarking techniques are typically
heavyweight - time consuming processes which have to benchmark the entire VM in
order to obtain accurate benchmark data. Such benchmarks cannot be used in
real-time on the cloud and incur extra costs even before an application is
deployed.
In this paper, we present lightweight cloud benchmarking techniques that
execute quickly and can be used in near real-time on the cloud. The exploration
of lightweight benchmarking techniques are facilitated by the development of
DocLite - Docker Container-based Lightweight Benchmarking. DocLite is built on
the Docker container technology which allows a user-defined portion (such as
memory size and the number of CPU cores) of the VM to be benchmarked. DocLite
operates in two modes, in the first mode, containers are used to benchmark a
small portion of the VM to generate performance ranks. In the second mode,
historic benchmark data is used along with the first mode as a hybrid to
generate VM ranks. The generated ranks are evaluated against three scientific
high-performance computing applications. The proposed techniques are up to 91
times faster than a heavyweight technique which benchmarks the entire VM. It is
observed that the first mode can generate ranks with over 90% and 86% accuracy
for sequential and parallel execution of an application. The hybrid mode
improves the correlation slightly but the first mode is sufficient for
benchmarking cloud VMs.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2016 10:57:02 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Varghese",
"Blesson",
""
],
[
"Subba",
"Lawan Thamsuhang",
""
],
[
"Thai",
"Long",
""
],
[
"Barker",
"Adam",
""
]
] |
new_dataset
| 0.997925 |
1601.07533
|
Yinong Wang
|
Yinong Wang, Jianhua Yao, Joseph E. Burns, Ronald M. Summers
|
Osteoporotic and Neoplastic Compression Fracture Classification on
Longitudinal CT
|
Contributed 4-Page Paper to be presented at the 2016 IEEE
International Symposium on Biomedical Imaging (ISBI), April 13-16, 2016,
Prague, Czech Republic
| null |
10.1109/ISBI.2016.7493477
| null |
cs.CV q-bio.TO
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Classification of vertebral compression fractures (VCF) having osteoporotic
or neoplastic origin is fundamental to the planning of treatment. We developed
a fracture classification system by acquiring quantitative morphologic and bone
density determinants of fracture progression through the use of automated
measurements from longitudinal studies. A total of 250 CT studies were acquired
for the task, each having previously identified VCFs with osteoporosis or
neoplasm. Thirty-six features or each identified VCF were computed and
classified using a committee of support vector machines. Ten-fold cross
validation on 695 identified fractured vertebrae showed classification
accuracies of 0.812, 0.665, and 0.820 for the measured, longitudinal, and
combined feature sets respectively.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2016 20:20:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Wang",
"Yinong",
""
],
[
"Yao",
"Jianhua",
""
],
[
"Burns",
"Joseph E.",
""
],
[
"Summers",
"Ronald M.",
""
]
] |
new_dataset
| 0.999777 |
1602.02864
|
Da Zheng
|
Da Zheng, Disa Mhembere, Vince Lyzinski, Joshua Vogelstein, Carey E.
Priebe, and Randal Burns
|
Semi-External Memory Sparse Matrix Multiplication for Billion-Node
Graphs
|
published in IEEE Transactions on Parallel and Distributed Systems
| null |
10.1109/TPDS.2016.2618791
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sparse matrix multiplication is traditionally performed in memory and scales
to large matrices using the distributed memory of multiple nodes. In contrast,
we scale sparse matrix multiplication beyond memory capacity by implementing
sparse matrix dense matrix multiplication (SpMM) in a semi-external memory
(SEM) fashion; i.e., we keep the sparse matrix on commodity SSDs and dense
matrices in memory. Our SEM-SpMM incorporates many in-memory optimizations for
large power-law graphs. It outperforms the in-memory implementations of
Trilinos and Intel MKL and scales to billion-node graphs, far beyond the
limitations of memory. Furthermore, on a single large parallel machine, our
SEM-SpMM operates as fast as the distributed implementations of Trilinos using
five times as much processing power. We also run our implementation in memory
(IM-SpMM) to quantify the overhead of keeping data on SSDs. SEM-SpMM achieves
almost 100% performance of IM-SpMM on graphs when the dense matrix has more
than four columns; it achieves at least 65% performance of IM-SpMM on all
inputs. We apply our SpMM to three important data analysis tasks--PageRank,
eigensolving, and non-negative matrix factorization--and show that our SEM
implementations significantly advance the state of the art.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2016 05:30:30 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Feb 2016 01:14:13 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Oct 2016 14:46:57 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zheng",
"Da",
""
],
[
"Mhembere",
"Disa",
""
],
[
"Lyzinski",
"Vince",
""
],
[
"Vogelstein",
"Joshua",
""
],
[
"Priebe",
"Carey E.",
""
],
[
"Burns",
"Randal",
""
]
] |
new_dataset
| 0.976307 |
1605.00760
|
Ming Li Prof.
|
Xiaowen Tian, Ming Li, Guangyu Ti, and Wenfei Liu
|
Fast Detection of Orthogonal Space-Time Block Codes with Unknown Channel
|
Submitted to IEEE Wireless Communications Letters
| null |
10.1109/LCOMM.2016.2591548
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter investigates the problem of blind detection of orthogonal
space-time block codes (OSTBC) over a quasi-static flat multiple-input
multiple-output (MIMO) Rayleigh fading channel. We first introduce a core
iterative least-squares (ILS) algorithm to blindly detect OSTBC signals without
the knowledge of channel state information (SCI) at the receiver. This ILS
algorithm has low computational complexity but may converge to local optimum
which offers unreliable detection result. Then, in order to improve the
detection performance, we propose an enhanced ILS (E-ILS) approach which is
based on statistical analysis of repeated independent ILS procedures on
received data. Extensive simulation studies prove the efficiency of the
proposed E-ILS algorithm with blind detection performance approaching the
optimal maximum-likelihood detector with known CSI.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 06:50:10 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Tian",
"Xiaowen",
""
],
[
"Li",
"Ming",
""
],
[
"Ti",
"Guangyu",
""
],
[
"Liu",
"Wenfei",
""
]
] |
new_dataset
| 0.9972 |
1605.03230
|
Reinhard Heckel
|
Reinhard Heckel
|
Super-Resolution MIMO Radar
|
To appear in Proc. of IEEE International Symposium on Information
Theory (ISIT), Barcelona, Spain, July 2016. Slightly extended version
| null |
10.1109/ISIT.2016.7541532
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multiple input, multiple output (MIMO) radar emits probings signals with
multiple transmit antennas and records the reflections from targets with
multiple receive antennas. Estimating the relative angles, delays, and Doppler
shifts from the received signals allows to determine the locations and
velocities of the targets. Standard approaches to MIMO radar based on digital
matched filtering or compressed sensing only resolve the angle-delay-Doppler
triplets on a $(1/(N_T N_R), 1/B,1/T)$ grid, where $N_T$ and $N_R$ are the
number of transmit and receive antennas, $B$ is the bandwidth of the probing
signals, and $T$ is the length of the time interval over which the reflections
are observed. In this work, we show that the \emph{continuous}
angle-delay-Doppler triplets and the corresponding attenuation factors can be
recovered perfectly by solving a convex optimization problem. This result holds
provided that the angle-delay-Doppler triplets are separated either by $10/(N_T
N_R-1)$ in angle, $10.01/B$ in delay, or $10.01/T$ in Doppler direction.
Furthermore, this result is optimal (up to log factors) in the number of
angle-delay-Doppler triplets that can be recovered.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 22:23:52 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Heckel",
"Reinhard",
""
]
] |
new_dataset
| 0.999792 |
1605.03709
|
Rui Wang
|
Rui Wang, Xi Peng, Jun Zhang, K. B. Letaief
|
Mobility-Aware Caching for Content-Centric Wireless Networks: Modeling
and Methodology
|
16 pages, 5 figures, to appear in IEEE Communications Magazine
| null |
10.1109/MCOM.2016.7537180
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As mobile services are shifting from "connection-centric" communications to
"content-centric" communications, content-centric wireless networking emerges
as a promising paradigm to evolve the current network architecture. Caching
popular content at the wireless edge, including base stations (BSs) and user
terminals (UTs), provides an effective approach to alleviate the heavy burden
on backhaul links, as well as lowering delays and deployment costs. In contrast
to wired networks, a unique characteristic of content-centric wireless networks
(CCWNs) is the mobility of mobile users. While it has rarely been considered by
existing works in caching design, user mobility contains various helpful side
information that can be exploited to improve caching efficiency at both BSs and
UTs. In this paper, we present a general framework on mobility-aware caching in
CCWNs. Key properties of user mobility patterns that are useful for content
caching will be firstly identified, and then different design methodologies for
mobility-aware caching will be proposed. Moreover, two design examples will be
provided to illustrate the proposed framework in details, and interesting
future research directions will be identified.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2016 07:43:16 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Wang",
"Rui",
""
],
[
"Peng",
"Xi",
""
],
[
"Zhang",
"Jun",
""
],
[
"Letaief",
"K. B.",
""
]
] |
new_dataset
| 0.979435 |
1607.03341
|
Tao Jiang
|
Tao Jiang, Chunxing Ni, Yuance Xu
|
Novel 16-QAM and 64-QAM Near-Complementary Sequences with Low PMEPR in
OFDM Systems
|
27 pages, 2 figures, submitted to IEEE Transactions on Communications
| null |
10.1109/TCOMM.2016.2591949
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this paper, we firstly propose a novel construction of $16$-quadrature
amplitude modulation (QAM) near-complementary sequences with low peak-to-mean
envelope power ratio (PMEPR) in orthogonal frequency division multiplexing
(OFDM) systems. The proposed $16$-QAM near-complementary sequences can be
constructed by utilizing novel nonlinear offsets, where the length of the
sequences is $n=2^m$. The family size of the newly constructed $16$-QAM
near-complementary sequences is $8\times (\frac{m!}{2})\times 4^{m+1}$, and the
PMEPR of these sequences is proven to satisfy ${\textrm{PMEPR}}\leq 2.4$. Thus,
the proposed construction can generate a number of $16$-QAM near-complementary
sequences with low PMEPR, resulting in the improvement of the code rate in OFDM
systems. Furthermore, we also propose a novel construction of $64$-QAM
near-complementary sequences with low PMEPR, which is the first proven
construction of $64$-QAM near-complementary sequences. The PMEPRs of two types
of the proposed $64$-QAM near-complementary sequences are proven to satisfy
that ${\textrm{PMEPR}}\leq 3.62$ or ${\textrm{PMEPR}}\leq 2.48$, respectively.
The family size of the newly constructed $64$-QAM near-complementary sequences
is $64\times (\frac{m!}{2})\times 4^{m+1}$.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 13:06:15 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Jiang",
"Tao",
""
],
[
"Ni",
"Chunxing",
""
],
[
"Xu",
"Yuance",
""
]
] |
new_dataset
| 0.989869 |
1610.09447
|
Bin Gu
|
Bin Gu, Zhouyuan Huo, Heng Huang
|
Asynchronous Stochastic Block Coordinate Descent with Variance Reduction
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Asynchronous parallel implementations for stochastic optimization have
received huge successes in theory and practice recently. Asynchronous
implementations with lock-free are more efficient than the one with writing or
reading lock. In this paper, we focus on a composite objective function
consisting of a smooth convex function $f$ and a block separable convex
function, which widely exists in machine learning and computer vision. We
propose an asynchronous stochastic block coordinate descent algorithm with the
accelerated technology of variance reduction (AsySBCDVR), which are with
lock-free in the implementation and analysis. AsySBCDVR is particularly
important because it can scale well with the sample size and dimension
simultaneously. We prove that AsySBCDVR achieves a linear convergence rate when
the function $f$ is with the optimal strong convexity property, and a sublinear
rate when $f$ is with the general convexity. More importantly, a near-linear
speedup on a parallel system with shared memory can be obtained.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 03:39:16 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Nov 2016 20:05:31 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Nov 2016 02:14:36 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Gu",
"Bin",
""
],
[
"Huo",
"Zhouyuan",
""
],
[
"Huang",
"Heng",
""
]
] |
new_dataset
| 0.995167 |
1611.03970
|
Gabriel Nallathambi
|
Gabriel Nallathambi, Jose Principe
|
Signal Processing with Pulse Trains: An Algebraic Approach- Part II
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The integrate and fire converter (IFC) enables an alternative to digital
signal processing. IFC converts analog signal voltages into time between pulses
and it is possible to reconstruct the analog signal from the IFC pulses with an
error as small as required. In this paper, we present the definition of
multiplication in pulse trains created by the IFC based on time domain
operations and prove that it constitutes an Abelian group in the space of IFC
pulse trains. We also show that pulse domain multiplication corresponds to
pointwise multiplication of analog signals. It is further proved that pulse
domain multiplication is distributive over pulse domain addition and hence it
forms a field in the space of IFC pulse trains, which is an important property
for linear signal processing.
|
[
{
"version": "v1",
"created": "Sat, 12 Nov 2016 08:27:55 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Nallathambi",
"Gabriel",
""
],
[
"Principe",
"Jose",
""
]
] |
new_dataset
| 0.970024 |
1611.04012
|
F. Richard Yu
|
Dajun Zhang, F. Richard Yu, Zhexiong Wei, Azzedine Boukerche
|
Trust-based Secure Routing in Software-defined Vehicular Ad Hoc Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rising interest of expedient, safe, and high-efficient
transportation, vehicular ad hoc networks (VANETs) have turned into a critical
technology in smart transportation systems. Because of the high mobility of
nodes, VANETs are vulnerable to security attacks. In this paper, we propose a
novel framework of software-defined VANETs with trust management. Specifically,
we separate the forwarding plane in VANETs from the control plane, which is
responsible for the control functionality, such as routing protocols and trust
management in VANETs. Using the on-demand distance vector routing (TAODV)
protocol as an example, we present a routing protocol named software-defined
trust based ad hoc on-demand distance vector routing (SD-TAODV). Simulation
results are presented to show the effectiveness of the proposed
software-defined VANETs with trust management.
|
[
{
"version": "v1",
"created": "Sat, 12 Nov 2016 16:14:32 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zhang",
"Dajun",
""
],
[
"Yu",
"F. Richard",
""
],
[
"Wei",
"Zhexiong",
""
],
[
"Boukerche",
"Azzedine",
""
]
] |
new_dataset
| 0.992916 |
1611.04033
|
Ibrahim Abu El-Khair
|
Ibrahim Abu El-khair
|
1.5 billion words Arabic Corpus
| null | null | null | null |
cs.CL cs.DL cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This study is an attempt to build a contemporary linguistic corpus for Arabic
language. The corpus produced, is a text corpus includes more than five million
newspaper articles. It contains over a billion and a half words in total, out
of which, there is about three million unique words. The data were collected
from newspaper articles in ten major news sources from eight Arabic countries,
over a period of fourteen years. The corpus was encoded with two types of
encoding, namely: UTF-8, and Windows CP-1256. Also it was marked with two
mark-up languages, namely: SGML, and XML.
|
[
{
"version": "v1",
"created": "Sat, 12 Nov 2016 18:41:58 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"El-khair",
"Ibrahim Abu",
""
]
] |
new_dataset
| 0.991269 |
1611.04279
|
Ngoc Khang Le
|
Ngoc Khang Le
|
Chromatic number of ISK4-free graphs
|
15 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph $G$ is said to be ISK4-free if it does not contain any subdivision of
$K_4$ as an induced subgraph. In this paper, we propose new upper bounds for
chromatic number of ISK4-free graphs and $\{$ISK4, triangle$\}$-free graphs.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 08:11:12 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Le",
"Ngoc Khang",
""
]
] |
new_dataset
| 0.999352 |
1611.04341
|
Krishna Kaipa
|
Peter Beelen, David Glynn, Tom H{\o}holdt, and Krishna Kaipa
|
Counting generalized Reed-Solomon codes
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we count the number of generalized Reed-Solomon (GRS) codes
of dimension k and length n, including the codes coming from a non-degenerate
conic plus nucleus. We compare our results with known formulae for the number
of 3-dimensional MDS codes of length n=6,7,8,9.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 11:24:49 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Beelen",
"Peter",
""
],
[
"Glynn",
"David",
""
],
[
"Høholdt",
"Tom",
""
],
[
"Kaipa",
"Krishna",
""
]
] |
new_dataset
| 0.954773 |
1611.04433
|
Stefan Wagner
|
Stefan Wagner, Klaus Lochmann, Lars Heinemann, Michael Kl\"as, Adam
Trendowicz, Reinhold Pl\"osch, Andreas Seidl, Andreas Goeb, Jonathan Streit
|
The Quamoco Product Quality Modelling and Assessment Approach
|
10 pages, 2 figures, Proc. 34th International Conference on Software
Engineering (ICSE'12). IEEE, 2012
| null |
10.1109/ICSE.2012.6227106
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Published software quality models either provide abstract quality attributes
or concrete quality assessments. There are no models that seamlessly integrate
both aspects. In the project Quamoco, we built a comprehensive approach with
the aim to close this gap.
For this, we developed in several iterations a meta quality model specifying
general concepts, a quality base model covering the most important quality
factors and a quality assessment approach. The meta model introduces the new
concept of a product factor, which bridges the gap between concrete
measurements and abstract quality aspects. Product factors have measures and
instruments to operationalise quality by measurements from manual inspection
and tool analysis. The base model uses the ISO 25010 quality attributes, which
we refine by 200 factors and 600 measures for Java and C# systems.
We found in several empirical validations that the assessment results fit to
the expectations of experts for the corresponding systems. The empirical
analyses also showed that several of the correlations are statistically
significant and that the maintainability part of the base model has the highest
correlation, which fits to the fact that this part is the most comprehensive.
Although we still see room for extending and improving the base model, it shows
a high correspondence with expert opinions and hence is able to form the basis
for repeatable and understandable quality assessments in practice.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 16:08:53 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Wagner",
"Stefan",
""
],
[
"Lochmann",
"Klaus",
""
],
[
"Heinemann",
"Lars",
""
],
[
"Kläs",
"Michael",
""
],
[
"Trendowicz",
"Adam",
""
],
[
"Plösch",
"Reinhold",
""
],
[
"Seidl",
"Andreas",
""
],
[
"Goeb",
"Andreas",
""
],
[
"Streit",
"Jonathan",
""
]
] |
new_dataset
| 0.999087 |
1611.04455
|
Hongyi Liu
|
Vaidehi Dalmia, Hongyi Liu, Shih-Fu Chang
|
Columbia MVSO Image Sentiment Dataset
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Multilingual Visual Sentiment Ontology (MVSO) consists of 15,600 concepts
in 12 different languages that are strongly related to emotions and sentiments
expressed in images. These concepts are defined in the form of Adjective-Noun
Pair (ANP), which are crawled and discovered from online image forum Flickr. In
this work, we used Amazon Mechanical Turk as a crowd-sourcing platform to
collect human judgments on sentiments expressed in images that are uniformly
sampled over 3,911 English ANPs extracted from a tag-restricted subset of MVSO.
Our goal is to use the dataset as a benchmark for the evaluation of systems
that automatically predict sentiments in images or ANPs.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 16:48:12 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Dalmia",
"Vaidehi",
""
],
[
"Liu",
"Hongyi",
""
],
[
"Chang",
"Shih-Fu",
""
]
] |
new_dataset
| 0.999903 |
1611.04491
|
Jinying Chen
|
Jinying Chen, Abhyuday N. Jagannatha, Samah J. Jarad, Hong Yu
|
Ranking medical jargon in electronic health record notes by adapted
distant supervision
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objective: Allowing patients to access their own electronic health record
(EHR) notes through online patient portals has the potential to improve
patient-centered care. However, medical jargon, which abounds in EHR notes, has
been shown to be a barrier for patient EHR comprehension. Existing knowledge
bases that link medical jargon to lay terms or definitions play an important
role in alleviating this problem but have low coverage of medical jargon in
EHRs. We developed a data-driven approach that mines EHRs to identify and rank
medical jargon based on its importance to patients, to support the building of
EHR-centric lay language resources.
Methods: We developed an innovative adapted distant supervision (ADS) model
based on support vector machines to rank medical jargon from EHRs. For distant
supervision, we utilized the open-access, collaborative consumer health
vocabulary, a large, publicly available resource that links lay terms to
medical jargon. We explored both knowledge-based features from the Unified
Medical Language System and distributed word representations learned from
unlabeled large corpora. We evaluated the ADS model using physician-identified
important medical terms.
Results: Our ADS model significantly surpassed two state-of-the-art automatic
term recognition methods, TF*IDF and C-Value, yielding 0.810 ROC-AUC versus
0.710 and 0.667, respectively. Our model identified 10K important medical
jargon terms after ranking over 100K candidate terms mined from over 7,500 EHR
narratives.
Conclusion: Our work is an important step towards enriching lexical resources
that link medical jargon to lay terms/definitions to support patient EHR
comprehension. The identified medical jargon terms and their rankings are
available upon request.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 17:36:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Chen",
"Jinying",
""
],
[
"Jagannatha",
"Abhyuday N.",
""
],
[
"Jarad",
"Samah J.",
""
],
[
"Yu",
"Hong",
""
]
] |
new_dataset
| 0.95856 |
1611.04580
|
Clelia De Felice
|
Clelia De Felice
|
Some conjectures on codes
| null | null | null | null |
cs.FL cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Variable-length codes are the bases of the free submonoids of a free monoid.
There are some important longstanding open questions about the structure of
finite maximal codes. In this paper we discuss this conjectures and their
relations with factorizations of cyclic groups.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 20:59:04 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"De Felice",
"Clelia",
""
]
] |
new_dataset
| 0.999491 |
cs/0405080
|
Riccardo Pucella
|
Riccardo Pucella
|
Reactive Programming in Standard ML
|
11 pages; appeared in Proceedings of the IEEE International
Conference on Computer Languages (ICCL'98), pp. 48-57, 1998
| null |
10.1109/ICCL.1998.674156
| null |
cs.PL
| null |
Reactive systems are systems that maintain an ongoing interaction with their
environment, activated by receiving input events from the environment and
producing output events in response. Modern programming languages designed to
program such systems use a paradigm based on the notions of instants and
activations. We describe a library for Standard ML that provides basic
primitives for programming reactive systems. The library is a low-level system
upon which more sophisticated reactive behaviors can be built, which provides a
convenient framework for prototyping extensions to existing reactive languages.
|
[
{
"version": "v1",
"created": "Sun, 23 May 2004 19:09:11 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Pucella",
"Riccardo",
""
]
] |
new_dataset
| 0.992856 |
cs/0609090
|
Xiaofei Huang
|
Xiaofei Huang
|
Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes
|
Accepted by IEEE Information Theory Workshop, Chengdu, China, 2006
| null |
10.1109/ITW2.2006.323774
| null |
cs.IT math.IT
| null |
Many implementations for decoding LDPC codes are based on the
(normalized/offset) min-sum algorithm due to its satisfactory performance and
simplicity in operations. Usually, each iteration of the min-sum algorithm
contains two scans, the horizontal scan and the vertical scan. This paper
presents a single-scan version of the min-sum algorithm to speed up the
decoding process. It can also reduce memory usage or wiring because it only
needs the addressing from check nodes to variable nodes while the original
min-sum algorithm requires that addressing plus the addressing from variable
nodes to check nodes. To cut down memory usage or wiring further, another
version of the single-scan min-sum algorithm is presented where the messages of
the algorithm are represented by single bit values instead of using fixed point
ones. The software implementation has shown that the single-scan min-sum
algorithm is more than twice as fast as the original min-sum algorithm.
|
[
{
"version": "v1",
"created": "Sat, 16 Sep 2006 00:08:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Huang",
"Xiaofei",
""
]
] |
new_dataset
| 0.985064 |
cs/0702099
|
Ruoheng Liu
|
Ruoheng Liu, Ivana Maric, Predrag Spasojevic, and Roy D. Yates
|
Discrete Memoryless Interference and Broadcast Channels with
Confidential Messages: Secrecy Rate Regions
|
to appear Special Issue of IEEE Transactions on Information Theory on
Information Theoretic Security
| null |
10.1109/TIT.2008.921879
| null |
cs.IT math.IT
| null |
We study information-theoretic security for discrete memoryless interference
and broadcast channels with independent confidential messages sent to two
receivers. Confidential messages are transmitted to their respective receivers
with information-theoretic secrecy. That is, each receiver is kept in total
ignorance with respect to the message intended for the other receiver. The
secrecy level is measured by the equivocation rate at the eavesdropping
receiver. In this paper, we present inner and outer bounds on secrecy capacity
regions for these two communication systems. The derived outer bounds have an
identical mutual information expression that applies to both channel models.
The difference is in the input distributions over which the expression is
optimized. The inner bound rate regions are achieved by random binning
techniques. For the broadcast channel, a double-binning coding scheme allows
for both joint encoding and preserving of confidentiality. Furthermore, we show
that, for a special case of the interference channel, referred to as the switch
channel, the two bound bounds meet. Finally, we describe several transmission
schemes for Gaussian interference channels and derive their achievable rate
regions while ensuring mutual information-theoretic secrecy. An encoding scheme
in which transmitters dedicate some of their power to create artificial noise
is proposed and shown to outperform both time-sharing and simple multiplexed
transmission of the confidential messages.
|
[
{
"version": "v1",
"created": "Sat, 17 Feb 2007 21:02:37 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Dec 2007 23:12:34 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Liu",
"Ruoheng",
""
],
[
"Maric",
"Ivana",
""
],
[
"Spasojevic",
"Predrag",
""
],
[
"Yates",
"Roy D.",
""
]
] |
new_dataset
| 0.957499 |
cs/9809039
|
Chunlei Liu
|
Sonia Fahmy, Raj Jain
|
ABR Flow Control for Multipoint Connections
|
5 pages, 2 figures submitted to IEEE Network Magazine, ATM Forum
Perspectives column
| null |
10.1109/MNET.1998.730745
| null |
cs.NI
| null |
Multipoint capabilities are essential for ATM networks to efficiently support
many applications, including IP multicasting and overlay applications. The
current signaling and routing specifications for ATM define point-to-multipoint
capabilities. Multipoint-to-point connection support is also being discussed by
the signaling and PNNI groups, and will be defined in the near future for the
unspecified bit rate (UBR) service. We examine point-to-multipoint and
multipoint-to-point flow control for the available bit rate (ABR) service, as
discussed in the traffic management working group.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 1998 16:34:07 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Fahmy",
"Sonia",
""
],
[
"Jain",
"Raj",
""
]
] |
new_dataset
| 0.997467 |
cs/9809091
|
Chunlei Liu
|
R. Jain
|
Congestion Control in Computer Networks: Trends and Issues
| null |
IEEE Network, May 1990, pp. 24-30
|
10.1109/65.56532
| null |
cs.NI
| null |
Popular myths that cheaper memory, high-speed links and high-speed processors
will solve the problem of congestion in computer networks are shown to be
false. A simple definition for congestion based on supply and demand of
resources is proposed and is then used to classify various congestion schemes.
The issues that make the congestion problem a difficult one are discussed, and
then the architectural decisions that affect the design of a congestion scheme
are presented. It is argued that long-, medium- and short-term congestion
problems require different solutions. Some of the recent schemes are brifly
surveyed, and areas for further research are discussed.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 1998 04:56:33 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Jain",
"R.",
""
]
] |
new_dataset
| 0.956411 |
cs/9809096
|
Chunlei Liu
|
R. Jain
|
A Timeout Based Congestion Control Scheme for Window Flow- Controlled
Networks
|
also reprinted in C. Partridge, Ed., "Innovations in
Internetworking," Artech House, Norwood, MA 1988
|
IEEE Journal of Selected Areas in Communications, Vol. SAC-4, No.
7, October 1986, pp. 1162-1167
|
10.1109/JSAC.1986.1146431
| null |
cs.NI
| null |
During overload, most networks drop packets due to buffer unavailability. The
resulting timeouts at the source provide an implicit mechanism to convey
congestion signals from the network to the source. On a timeout, a source
should not only retransmit the lost packet, but it should also reduce its load
on the network. Based on this realization, we have developed a simple
congestion control scheme using the acknowledgment timeouts as indications of
packet loss and congestion. This scheme does not require any new message
formats, therefore, it can be used in any network with window flow control,
e.g., ARPAnet or ISO.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 1998 05:12:55 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Jain",
"R.",
""
]
] |
new_dataset
| 0.999342 |
1609.05228
|
Abdorrahman Haeri
|
Abdorrahman Haeri
|
Continuous occurrence theory
|
This paper is not for public publication in this current form. It
needs major revision
| null | null | null |
cs.AI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Usually gradual and continuous changes in entities will lead to appear
events. But usually it is supposed that an event is occurred at once. In this
research an integrated framework called continuous occurrence theory (COT) is
presented to investigate respective path leading to occurrence of the events in
the real world. For this purpose initially fundamental concepts are defined.
Afterwards, the appropriate tools such as occurrence variables computations,
occurrence dependency function and occurrence model are introduced and
explained in a systematic manner. Indeed, COT provides the possibility to: (a)
monitor occurrence of events during time; (b) study background of the events;
(c) recognize the relevant issues of each event; and (d) understand how these
issues affect on the considered event. The developed framework (COT) provides
the necessary context to analyze accurately continual changes of the issues and
the relevant events in the various branches of science and business. Finally,
typical applications of COT and an applied modeling example of it have been
explained and a mathematical programming example is modeled in the occurrence
based environment.
|
[
{
"version": "v1",
"created": "Sat, 6 Aug 2016 10:30:09 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Nov 2016 06:43:07 GMT"
}
] | 2016-11-14T00:00:00 |
[
[
"Haeri",
"Abdorrahman",
""
]
] |
new_dataset
| 0.986548 |
1611.03477
|
Hang Chu
|
Hang Chu, Raquel Urtasun, Sanja Fidler
|
Song From PI: A Musically Plausible Network for Pop Music Generation
|
under review at ICLR 2017
| null | null | null |
cs.SD cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel framework for generating pop music. Our model is a
hierarchical Recurrent Neural Network, where the layers and the structure of
the hierarchy encode our prior knowledge about how pop music is composed. In
particular, the bottom layers generate the melody, while the higher levels
produce the drums and chords. We conduct several human studies that show strong
preference of our generated music over that produced by the recent method by
Google. We additionally show two applications of our framework: neural dancing
and karaoke, as well as neural story singing.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 20:35:47 GMT"
}
] | 2016-11-14T00:00:00 |
[
[
"Chu",
"Hang",
""
],
[
"Urtasun",
"Raquel",
""
],
[
"Fidler",
"Sanja",
""
]
] |
new_dataset
| 0.967803 |
1611.03616
|
Radoslaw Nielek
|
Balcerzak Bartlomiej, Nielek Radoslaw
|
Of Hags and bitches. Ageist attitudes in 2016 presidential debate on
twitter
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we present our exploratory research into the occurrence of
ageist attitudes within the discussion related to the US 2016 presidential
election. We use natural processing techniques to analyze the content tweets
related to Hillary Clinton and Donald Trump. Content analysis shows that
although ageist attitudes are scarce in the discussion, they are mostly focused
on Hillary Clinton rather than Donald Trump. Also, ageist arguments against
Donald Trump appear mostly as a reply to controversies connected with the
health of Hillary Clinton.
|
[
{
"version": "v1",
"created": "Fri, 11 Nov 2016 08:38:07 GMT"
}
] | 2016-11-14T00:00:00 |
[
[
"Bartlomiej",
"Balcerzak",
""
],
[
"Radoslaw",
"Nielek",
""
]
] |
new_dataset
| 0.996346 |
1611.03618
|
Isaac Skog
|
Johan Wahlstr\"om, Isaac Skog, Peter H\"andel
|
Smartphone-based Vehicle Telematics - A Ten-Year Anniversary
| null | null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Just like it has irrevocably reshaped social life, the fast growth of
smartphone ownership is now beginning to revolutionize the driving experience
and change how we think about automotive insurance, vehicle safety systems, and
traffic research. This paper summarizes the first ten years of research in
smartphone-based vehicle telematics, with a focus on user-friendly
implementations and the challenges that arise due to the mobility of the
smartphone. Notable academic and industrial projects are reviewed, and system
aspects related to sensors, energy consumption, cloud computing, vehicular ad
hoc networks, and human-machine interfaces are examined. Moreover, we highlight
the differences between traditional and smartphonebased automotive navigation,
and survey the state-of-the-art in smartphone-based transportation mode
classification, driver classification, and road condition monitoring. Future
advances are expected to be driven by improvements in sensor technology,
evidence of the societal benefits of current implementations, and the
establishment of industry standards for sensor fusion and driver assessment
|
[
{
"version": "v1",
"created": "Fri, 11 Nov 2016 08:55:27 GMT"
}
] | 2016-11-14T00:00:00 |
[
[
"Wahlström",
"Johan",
""
],
[
"Skog",
"Isaac",
""
],
[
"Händel",
"Peter",
""
]
] |
new_dataset
| 0.99672 |
1611.03379
|
Dmitri Strukov B
|
X. Guo, F. Merrikh Bayat, M. Prezioso, Y. Chen, B. Nguyen, N. Do, and
D. B. Strukov
|
Temperature-Insensitive Analog Vector-by-Matrix Multiplier Based on 55
nm NOR Flash Memory Cells
|
4 pages, 11 pages
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have fabricated and successfully tested an analog vector-by-matrix
multiplier, based on redesigned 10x12 arrays of 55 nm commercial NOR flash
memory cells. The modified arrays enable high-precision individual analog
tuning of each cell, with sub-1% accuracy, while keeping the highly optimized
cells, with their long-term state retention, intact. The array has an area of
0.33 um^2 per cell, and is at least one order of magnitude more dense than the
reported prior implementations of nonvolatile analog memories. The demonstrated
vector-by-vector multiplier, using gate coupling to additional periphery cells,
has ~2% precision, limited by the aggregate effect of cell noise, retention,
mismatch, process variations, tuning precision, and capacitive crosstalk. A
differential version of the multiplier has allowed us to demonstrate sub-3%
temperature drift of the output signal in the range between 25C and 85C.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 16:16:33 GMT"
}
] | 2016-11-12T00:00:00 |
[
[
"Guo",
"X.",
""
],
[
"Bayat",
"F. Merrikh",
""
],
[
"Prezioso",
"M.",
""
],
[
"Chen",
"Y.",
""
],
[
"Nguyen",
"B.",
""
],
[
"Do",
"N.",
""
],
[
"Strukov",
"D. B.",
""
]
] |
new_dataset
| 0.977147 |
1611.02546
|
Piotr Gawlowicz
|
Piotr Gaw{\l}owicz and Anatolij Zubow and Mikolaj Chwalisz and Adam
Wolisz
|
UniFlex: Accelerating Networking Research and Experimentation through
Software-Defined Wireless Networking
| null | null | null |
TKN-16-003
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Classical control and management plane for computer networks is addressing
individual parameters of protocol layers within an individual wireless network
device. We argue that this is not sufficient in phase of increasing deployment
of highly re-configurable systems, as well as heterogeneous wireless systems
co-existing in the same radio spectrum which demand harmonized, frequently even
coordinated adaptation of multiple parameters in different protocol layers
(cross-layer) in multiple network devices (cross-node).
We propose UniFlex, a framework enabling unified and flexible radio and
network control. It provides an API enabling coordinated cross-layer control
and management operation over multiple network nodes. The controller logic may
be implemented either in a centralized or distributed manner. This allows to
place time-sensitive control functions close to the controlled device (i.e.,
local control application), off-load more resource hungry network application
to compute servers and make them work together to control entire network.
The UniFlex framework was prototypically implemented and provided to the
research community as open-source. We evaluated the the framework in a number
of use-cases, what proved its usability.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2016 15:05:00 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2016 16:27:14 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Gawłowicz",
"Piotr",
""
],
[
"Zubow",
"Anatolij",
""
],
[
"Chwalisz",
"Mikolaj",
""
],
[
"Wolisz",
"Adam",
""
]
] |
new_dataset
| 0.9975 |
1611.03081
|
Burak Ulas
|
Benedict Carey and Burak Ulas
|
VR 'SPACE OPERA': Mimetic Spectralism in an Immersive Starlight
Audification System
|
7 pages, 4 figures, 1 table
|
Proceedings of 13. Sound and Music Computing Conference (2016):
104-108
| null | null |
cs.SD physics.pop-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a system designed as part of an interactive VR opera,
which immerses a real-time composer and an audience (via a network) in the
historical location of Gobeklitepe, in southern Turkey during an imaginary
scenario set in the Pre-Pottery Neolithic period (8500-5500 BCE), viewed by
some to be the earliest example of a temple, or observatory. In this scene
music is generated, where the harmonic material is determined based on
observations of light variation from pulsating stars, that would have
theoretically been overhead on the 1st of October 8000 BC at 23:00 and animal
calls based on the reliefs in the temple. Based on the observations of the
stars V465 Per, HD 217860, 16 Lac, BG CVn and KIC 6382916, frequency
collections were derived and applied to the generation of musical sound and
notation sequences within a custom VR environment using a novel method
incorporating spectralist techniques. Parameters controlling this 'resynthesis'
can be manipulated by the performer using a Leap Motion controller and Oculus
Rift HMD, yielding both sonic and visual results in the environment. The final
opera is to be viewed via Google Cardboard and delivered over the Internet.
This entire process aims to pose questions about real-time composition through
time distortion and invoke a sense of wonder and meaningfulness through a
ritualistic experience.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 09:54:45 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Carey",
"Benedict",
""
],
[
"Ulas",
"Burak",
""
]
] |
new_dataset
| 0.999622 |
1611.03343
|
Suleiman Yerima
|
Feng Yao, Suleiman Y. Yerima, BooJoong Kang, Sakir Sezer
|
Fuzzy Logic-based Implicit Authentication for Mobile Access Control
|
8 pages, SAI Computing Conference (SAI),13-15 July 2016, London, UK.
arXiv admin note: text overlap with arXiv:1607.08101
| null |
10.1109/SAI.2016.7556097
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to address the increasing compromise of user privacy on mobile
devices, a Fuzzy Logic based implicit authentication scheme is proposed in this
paper. The proposed scheme computes an aggregate score based on selected
features and a threshold in real-time based on current and historic data
depicting user routine. The tuned fuzzy system is then applied to the
aggregated score and the threshold to determine the trust level of the current
user. The proposed fuzzy-integrated implicit authentication scheme is designed
to: operate adaptively and completely in the background, require minimal
training period, enable high system accuracy while provide timely detection of
abnormal activity. In this paper, we explore Fuzzy Logic based authentication
in depth. Gaussian and triangle-based membership functions are investigated and
compared using real data over several weeks from different Android phone users.
The presented results show that our proposed Fuzzy Logic approach is a highly
effective, and viable scheme for lightweight real-time implicit authentication
on mobile devices.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2016 10:15:32 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Yao",
"Feng",
""
],
[
"Yerima",
"Suleiman Y.",
""
],
[
"Kang",
"BooJoong",
""
],
[
"Sezer",
"Sakir",
""
]
] |
new_dataset
| 0.956252 |
1611.03372
|
Hongyang Qu
|
Paolo Izzo, Hongyang Qu and Sandor M. Veres
|
A stochastically verifiable autonomous control architecture with
reasoning
|
Accepted at IEEE Conf. Decision and Control, 2016
| null | null | null |
cs.RO cs.AI cs.SE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new agent architecture called Limited Instruction Set Agent (LISA) is
introduced for autonomous control. The new architecture is based on previous
implementations of AgentSpeak and it is structurally simpler than its
predecessors with the aim of facilitating design-time and run-time verification
methods. The process of abstracting the LISA system to two different types of
discrete probabilistic models (DTMC and MDP) is investigated and illustrated.
The LISA system provides a tool for complete modelling of the agent and the
environment for probabilistic verification. The agent program can be
automatically compiled into a DTMC or a MDP model for verification with Prism.
The automatically generated Prism model can be used for both design-time and
run-time verification. The run-time verification is investigated and
illustrated in the LISA system as an internal modelling mechanism for
prediction of future outcomes.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 16:06:31 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Izzo",
"Paolo",
""
],
[
"Qu",
"Hongyang",
""
],
[
"Veres",
"Sandor M.",
""
]
] |
new_dataset
| 0.962632 |
1611.03404
|
Jeffrey Regier
|
Jeffrey Regier, Kiran Pamnany, Ryan Giordano, Rollin Thomas, David
Schlegel, Jon McAuliffe and Prabhat
|
Learning an Astronomical Catalog of the Visible Universe through
Scalable Bayesian Inference
|
submitting to IPDPS'17
| null | null | null |
cs.DC astro-ph.IM cs.LG stat.AP stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Celeste is a procedure for inferring astronomical catalogs that attains
state-of-the-art scientific results. To date, Celeste has been scaled to at
most hundreds of megabytes of astronomical images: Bayesian posterior inference
is notoriously demanding computationally. In this paper, we report on a
scalable, parallel version of Celeste, suitable for learning catalogs from
modern large-scale astronomical datasets. Our algorithmic innovations include a
fast numerical optimization routine for Bayesian posterior inference and a
statistically efficient scheme for decomposing astronomical optimization
problems into subproblems.
Our scalable implementation is written entirely in Julia, a new high-level
dynamic programming language designed for scientific and numerical computing.
We use Julia's high-level constructs for shared and distributed memory
parallelism, and demonstrate effective load balancing and efficient scaling on
up to 8192 Xeon cores on the NERSC Cori supercomputer.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 17:16:04 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Regier",
"Jeffrey",
""
],
[
"Pamnany",
"Kiran",
""
],
[
"Giordano",
"Ryan",
""
],
[
"Thomas",
"Rollin",
""
],
[
"Schlegel",
"David",
""
],
[
"McAuliffe",
"Jon",
""
],
[
"Prabhat",
"",
""
]
] |
new_dataset
| 0.969172 |
1611.03420
|
Muhammad Farooq-i-Azam
|
Muhammad Farooq-i-Azam, Muhammad Naeem Ayyaz
|
Location and Position Estimation in Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://creativecommons.org/publicdomain/zero/1.0/
|
A wireless sensor network comprises of small sensor nodes each of which
consists of a processing device, small amount of memory, battery and radio
transceiver for communication. The sensor nodes are autonomous and spatially
distributed in an area of investigation. Certain applications and protocols of
wireless sensor networks require that the sensor nodes should be aware of their
position relative to the sensor network. For it to be significant and to be of
value, the data such as temperature, humidity and pressure, gathered by sensor
nodes must be ascribed to the relative position from where it was collected.
For this to happen, the sensor nodes must be aware of their relative positions.
Traditional location finding solutions, such as Global Positioning System, are
not feasible for wireless sensor nodes due to multiple reasons. Therefore, new
methods, techniques and algorithms need to be developed to solve the problem of
location and position estimation of wireless sensor nodes. A number of
algorithms and techniques based upon different characteristics and properties
of sensor nodes have already been proposed for this purpose. This chapter
discusses the basic principles and techniques used in the localization
algorithms, categories of these algorithms and also takes a more closer look at
a few of the representative localization schemes.
|
[
{
"version": "v1",
"created": "Mon, 3 Oct 2016 17:10:27 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Farooq-i-Azam",
"Muhammad",
""
],
[
"Ayyaz",
"Muhammad Naeem",
""
]
] |
new_dataset
| 0.990498 |
1611.03423
|
Barak Pearlmutter
|
At{\i}l{\i}m G\"une\c{s} Baydin and Barak A. Pearlmutter and Jeffrey
Mark Siskind
|
DiffSharp: An AD Library for .NET Languages
|
Extended abstract presented at the AD 2016 Conference, Sep 2016,
Oxford UK
| null | null | null |
cs.MS cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DiffSharp is an algorithmic differentiation or automatic differentiation (AD)
library for the .NET ecosystem, which is targeted by the C# and F# languages,
among others. The library has been designed with machine learning applications
in mind, allowing very succinct implementations of models and optimization
routines. DiffSharp is implemented in F# and exposes forward and reverse AD
operators as general nestable higher-order functions, usable by any .NET
language. It provides high-performance linear algebra primitives---scalars,
vectors, and matrices, with a generalization to tensors underway---that are
fully supported by all the AD operators, and which use a BLAS/LAPACK backend
via the highly optimized OpenBLAS library. DiffSharp currently uses operator
overloading, but we are developing a transformation-based version of the
library using F#'s "code quotation" metaprogramming facility. Work on a
CUDA-based GPU backend is also underway.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 17:50:06 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Baydin",
"Atılım Güneş",
""
],
[
"Pearlmutter",
"Barak A.",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.99859 |
1611.03482
|
Abdullah Zubair Mohammed
|
Mohammed Abdullah Zubair, P. Rajalakshmi
|
Reconfigurable Dual Mode IEEE 802.15.4 Digital Baseband Receiver for
Diverse IoT Applications
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.15.4 takes a center stage in IoT as Low- Rate Wireless Personal Area
Networks(LR-WPANs). The standard specifies Offset Quadrature Phase Shift Keying
Physical Layer (O-QPSK PHY) with half-sine pulse shaping which can be either
analyzed under the class of M-ary PSK signals (QPSK signal with offset) or as
Minimum Shift Keying (MSK) signal. M-ary PSK demodulation is requires perfect
carrier and has minimal error. MSK signals which falls under Continuous Phase
Frequency Shift Keying can be demodulated non-coherently but error performance
is not as good. In our paper, this dual nature of IEEE 802.15.4 PHY is
exploited to propose a dual mode receiver comprising of QPSK demodulator chain
and MSK demodulator chain as a single system on chip. The mode can be
configured manually depending on the type of application or based on the
feedback from a Signal to Noise (SNR) indicator employed in the proposed
receiver. M-ary PSK chain is selected for lower SNRs and MSK for higher SNRs.
Each of these properties are analyzed in detail for both demodulator chains and
we go on to prove that MSK detection can be used for low power, low complex and
low latency while QPSK detection is employed for minimal error.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 07:36:57 GMT"
}
] | 2016-11-11T00:00:00 |
[
[
"Zubair",
"Mohammed Abdullah",
""
],
[
"Rajalakshmi",
"P.",
""
]
] |
new_dataset
| 0.992825 |
1608.05327
|
Igor Konnov
|
Igor Konnov, Marijana Lazic, Helmut Veith and Josef Widder
|
A Short Counterexample Property for Safety and Liveness Verification of
Fault-tolerant Distributed Algorithms
|
16 pages, 11 pages appendix
| null |
10.1145/3009837.3009860
| null |
cs.LO cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
Distributed algorithms have many mission-critical applications ranging from
embedded systems and replicated databases to cloud computing. Due to
asynchronous communication, process faults, or network failures, these
algorithms are difficult to design and verify. Many algorithms achieve fault
tolerance by using threshold guards that, for instance, ensure that a process
waits until it has received an acknowledgment from a majority of its peers.
Consequently, domain-specific languages for fault-tolerant distributed systems
offer language support for threshold guards.
We introduce an automated method for model checking of safety and liveness of
threshold-guarded distributed algorithms in systems where the number of
processes and the fraction of faulty processes are parameters. Our method is
based on a short counterexample property: if a distributed algorithm violates a
temporal specification (in a fragment of LTL), then there is a counterexample
whose length is bounded and independent of the parameters. We prove this
property by (i) characterizing executions depending on the structure of the
temporal formula, and (ii) using commutativity of transitions to accelerate and
shorten executions. We extended the ByMC toolset (Byzantine Model Checker) with
our technique, and verified liveness and safety of 10 prominent fault-tolerant
distributed algorithms, most of which were out of reach for existing
techniques.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 16:43:03 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Nov 2016 10:37:16 GMT"
}
] | 2016-11-10T00:00:00 |
[
[
"Konnov",
"Igor",
""
],
[
"Lazic",
"Marijana",
""
],
[
"Veith",
"Helmut",
""
],
[
"Widder",
"Josef",
""
]
] |
new_dataset
| 0.984619 |
1611.02831
|
Fredrik Johansson
|
Fredrik Johansson
|
Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
|
12 pages, 1 figure
| null | null | null |
cs.MS cs.NA cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arb is a C library for arbitrary-precision interval arithmetic using the
midpoint-radius representation, also known as ball arithmetic. It supports real
and complex numbers, polynomials, power series, matrices, and evaluation of
many special functions. The core number types are designed for versatility and
speed in a range of scenarios, allowing performance that is competitive with
non-interval arbitrary-precision types such as MPFR and MPC floating-point
numbers. We discuss the low-level number representation, strategies for
precision and error bounds, and the implementation of efficient polynomial
arithmetic with interval coefficients.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 06:23:37 GMT"
}
] | 2016-11-10T00:00:00 |
[
[
"Johansson",
"Fredrik",
""
]
] |
new_dataset
| 0.97655 |
1611.02839
|
Kimmo Kettunen
|
Kimmo Kettunen, Eetu M\"akel\"a, Teemu Ruokolainen, Juha Kuokkala and
Laura L\"ofberg
|
Old Content and Modern Tools - Searching Named Entities in a Finnish
OCRed Historical Newspaper Collection 1771-1910
|
24 pages, 13 tables
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Named Entity Recognition (NER), search, classification and tagging of names
and name like frequent informational elements in texts, has become a standard
information extraction procedure for textual data. NER has been applied to many
types of texts and different types of entities: newspapers, fiction, historical
records, persons, locations, chemical compounds, protein families, animals etc.
In general a NER system's performance is genre and domain dependent and also
used entity categories vary (Nadeau and Sekine, 2007). The most general set of
named entities is usually some version of three partite categorization of
locations, persons and organizations. In this paper we report first large scale
trials and evaluation of NER with data out of a digitized Finnish historical
newspaper collection Digi. Experiments, results and discussion of this research
serve development of the Web collection of historical Finnish newspapers.
Digi collection contains 1,960,921 pages of newspaper material from years
1771-1910 both in Finnish and Swedish. We use only material of Finnish
documents in our evaluation. The OCRed newspaper collection has lots of OCR
errors; its estimated word level correctness is about 70-75 % (Kettunen and
P\"a\"akk\"onen, 2016). Our principal NER tagger is a rule-based tagger of
Finnish, FiNER, provided by the FIN-CLARIN consortium. We show also results of
limited category semantic tagging with tools of the Semantic Computing Research
Group (SeCo) of the Aalto University. Three other tools are also evaluated
briefly.
This research reports first published large scale results of NER in a
historical Finnish OCRed newspaper collection. Results of the research
supplement NER results of other languages with similar noisy data.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 07:37:28 GMT"
}
] | 2016-11-10T00:00:00 |
[
[
"Kettunen",
"Kimmo",
""
],
[
"Mäkelä",
"Eetu",
""
],
[
"Ruokolainen",
"Teemu",
""
],
[
"Kuokkala",
"Juha",
""
],
[
"Löfberg",
"Laura",
""
]
] |
new_dataset
| 0.971816 |
1611.03014
|
Muhammad Majid Butt Muhammad Majid Butt
|
M. Majid Butt, Eduard A. Jorswieck and Amr Mohamed
|
Energy and Bursty Packet Loss Tradeoff over Fading Channels: A System
Level Model
| null |
IEEE Systems Journal, 2016
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy efficiency and quality of service (QoS) guarantees are the key design
goals for the 5G wireless communication systems. In this context, we discuss a
multiuser scheduling scheme over fading channels for loss tolerant
applications. The loss tolerance of the application is characterized in terms
of different parameters that contribute to quality of experience for the
application. The mobile users are scheduled opportunistically such that a
minimum QoS is guaranteed. We propose an opportunistic scheduling scheme and
address the cross layer design framework when channel state information is not
perfectly available at the transmitter and the receiver. We characterize the
system energy as a function of different QoS and channel state estimation error
parameters. The optimization problem is formulated using Markov chain framework
and solved using stochastic optimization techniques. The results demonstrate
that the parameters characterizing the packet loss are tightly coupled and
relaxation of one parameter does not benefit the system much if the other
constraints are tight. We evaluate the energy-performance trade-off numerically
and show the effect of channel uncertainty on the packet scheduler design.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 17:08:59 GMT"
}
] | 2016-11-10T00:00:00 |
[
[
"Butt",
"M. Majid",
""
],
[
"Jorswieck",
"Eduard A.",
""
],
[
"Mohamed",
"Amr",
""
]
] |
new_dataset
| 0.999219 |
1404.0417
|
Miltiadis Allamanis
|
Miltiadis Allamanis and Charles Sutton
|
Mining Idioms from Source Code
| null | null |
10.1145/2635868.2635901
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the first method for automatically mining code idioms from a
corpus of previously written, idiomatic software projects. We take the view
that a code idiom is a syntactic fragment that recurs across projects and has a
single semantic role. Idioms may have metavariables, such as the body of a for
loop. Modern IDEs commonly provide facilities for manually defining idioms and
inserting them on demand, but this does not help programmers to write idiomatic
code in languages or using libraries with which they are unfamiliar. We present
HAGGIS, a system for mining code idioms that builds on recent advanced
techniques from statistical natural language processing, namely, nonparametric
Bayesian probabilistic tree substitution grammars. We apply HAGGIS to several
of the most popular open source projects from GitHub. We present a wide range
of evidence that the resulting idioms are semantically meaningful,
demonstrating that they do indeed recur across software projects and that they
occur more frequently in illustrative code examples collected from a Q&A site.
Manual examination of the most common idioms indicate that they describe
important program concepts, including object creation, exception handling, and
resource management.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 23:04:12 GMT"
},
{
"version": "v2",
"created": "Tue, 20 May 2014 13:24:57 GMT"
},
{
"version": "v3",
"created": "Mon, 2 Jun 2014 11:13:13 GMT"
}
] | 2016-11-09T00:00:00 |
[
[
"Allamanis",
"Miltiadis",
""
],
[
"Sutton",
"Charles",
""
]
] |
new_dataset
| 0.981886 |
1502.05831
|
Shengyun Liu
|
Shengyun Liu, Paolo Viotti, Christian Cachin, Vivien Qu\'ema and Marko
Vukoli\'c
|
XFT: Practical Fault Tolerance Beyond Crashes
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite years of intensive research, Byzantine fault-tolerant (BFT) systems
have not yet been adopted in practice. This is due to additional cost of BFT in
terms of resources, protocol complexity and performance, compared with crash
fault-tolerance (CFT). This overhead of BFT comes from the assumption of a
powerful adversary that can fully control not only the Byzantine faulty
machines, but at the same time also the message delivery schedule across the
entire network, effectively inducing communication asynchrony and partitioning
otherwise correct machines at will. To many practitioners, however, such strong
attacks appear irrelevant.
In this paper, we introduce cross fault tolerance or XFT, a novel approach to
building reliable and secure distributed systems and apply it to the classical
state-machine replication (SMR) problem. In short, an XFT SMR protocol provides
the reliability guarantees of widely used asynchronous CFT SMR protocols such
as Paxos and Raft, but also tolerates Byzantine faults in combination with
network asynchrony, as long as a majority of replicas are correct and
communicate synchronously. This allows the development of XFT systems at the
price of CFT (already paid for in practice), yet with strictly stronger
resilience than CFT --- sometimes even stronger than BFT itself.
As a showcase for XFT, we present XPaxos, the first XFT SMR protocol, and
deploy it in a geo-replicated setting. Although it offers much stronger
resilience than CFT SMR at no extra resource cost, the performance of XPaxos
matches that of the state-of-the-art CFT protocols.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2015 11:15:45 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Dec 2015 07:40:58 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Nov 2016 17:27:20 GMT"
}
] | 2016-11-09T00:00:00 |
[
[
"Liu",
"Shengyun",
""
],
[
"Viotti",
"Paolo",
""
],
[
"Cachin",
"Christian",
""
],
[
"Quéma",
"Vivien",
""
],
[
"Vukolić",
"Marko",
""
]
] |
new_dataset
| 0.998349 |
1611.01667
|
Christian Schuessler
|
Christian Schuessler and Roland Gruber
|
A Traversable Fixed Size Small Object Allocator in C++
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At the allocation and deallocation of small objects with fixed size, the
standard allocator of the runtime system has commonly a worse time performance
compared to allocators adapted for a special application field. We propose a
memory allocator, originally developed for mesh primitives but also usable for
any other small equally sized objects. For a large amount of objects it leads
to better results than allocating data with the C ++new instruction and behaves
nowhere worse. The proposed synchronization approach for this allocator behaves
lock-free in practical scenarios without using machine instructions, such as
compare-and-swap. A traversal structure is integrated requiring less memory
than using containers such as STL-vectors or lists, but with comparable time
performance.
|
[
{
"version": "v1",
"created": "Sat, 5 Nov 2016 16:33:02 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2016 20:10:27 GMT"
}
] | 2016-11-09T00:00:00 |
[
[
"Schuessler",
"Christian",
""
],
[
"Gruber",
"Roland",
""
]
] |
new_dataset
| 0.997605 |
1611.01960
|
Sven M\"uelich
|
Sven M\"uelich, Martin Bossert
|
A New Error Correction Scheme for Physical Unclonable Functions
|
6 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Error correction is an indispensable component when Physical Unclonable
Functions (PUFs) are used in cryptographic applications. So far, there exist
schemes that obtain helper data, which they need within the error correction
process. We introduce a new scheme, which only uses an error correcting code
without any further helper data. The main idea is to construct for each PUF
instance an individual code which contains the initial PUF response as
codeword. In this work we use LDPC codes, however other code classes are also
possible. Our scheme allows a trade-off between code rate and cryptographic
security. In addition, decoding with linear complexity is possible.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 09:59:44 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2016 08:49:05 GMT"
}
] | 2016-11-09T00:00:00 |
[
[
"Müelich",
"Sven",
""
],
[
"Bossert",
"Martin",
""
]
] |
new_dataset
| 0.998501 |
1611.01974
|
Balint Daroczy
|
B\'alint Dar\'oczy and Frederick Ayala-G\'omez and Andr\'as Bencz\'ur
|
Item-to-item recommendation based on Contextual Fisher Information
|
9 pages, 8 figures, 4 tables
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web recommendation services bear great importance in e-commerce, as they aid
the user in navigating through the items that are most relevant to her needs.
In a typical Web site, long history of previous activities or purchases by the
user is rarely available. Hence in most cases, recommenders propose items that
are similar to the most recent ones viewed in the current user session. The
corresponding task is called session based item-to-item recommendation. For
frequent items, it is easy to present item-to-item recommendations by "people
who viewed this, also viewed" lists. However, most of the items belong to the
long tail, where previous actions are sparsely available. Another difficulty is
the so-called cold start problem, when the item has recently appeared and had
no time yet to accumulate sufficient number of transactions. In order to
recommend a next item in a session in sparse or cold start situations, we also
have to incorporate item similarity models. In this paper we describe a
probabilistic similarity model based on Random Fields to approximate
item-to-item transition probabilities. We give a generative model for the item
interactions based on arbitrary distance measures over the items including
explicit, implicit ratings and external metadata. The model may change in time
to fit better recent events and recommend the next item based on the updated
Fisher Information. Our new model outperforms both simple similarity baseline
methods and recent item-to-item recommenders, under several different
performance metrics and publicly available data sets. We reach significant
gains in particular for recommending a new item following a rare item.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 10:28:06 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2016 09:31:56 GMT"
}
] | 2016-11-09T00:00:00 |
[
[
"Daróczy",
"Bálint",
""
],
[
"Ayala-Gómez",
"Frederick",
""
],
[
"Benczúr",
"András",
""
]
] |
new_dataset
| 0.99937 |
1410.6572
|
Mason A. Porter
|
Mihai Cucuringu, Puck Rombach, Sang Hoon Lee, Mason A. Porter
|
Detection of Core-Periphery Structure in Networks Using Spectral Methods
and Geodesic Paths
|
This article is part of EJAM's December 2016 special issue on
"Network Analysis and Modelling" (available at
https://www.cambridge.org/core/journals/european-journal-of-applied-mathematics/issue/journal-ejm-volume-27-issue-6/D245C89CABF55DBF573BB412F7651ADB)
|
European Journal of Applied Mathematics, Volume 27, Issue 6
(Network Analysis and Modelling) December 2016, pp. 846-887
|
10.1017/S095679251600022X
| null |
cs.DM cond-mat.dis-nn cs.SI math.CO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce several novel and computationally efficient methods for
detecting "core--periphery structure" in networks. Core--periphery structure is
a type of mesoscale structure that includes densely-connected core vertices and
sparsely-connected peripheral vertices. Core vertices tend to be well-connected
both among themselves and to peripheral vertices, which tend not to be
well-connected to other vertices. Our first method, which is based on
transportation in networks, aggregates information from many geodesic paths in
a network and yields a score for each vertex that reflects the likelihood that
a vertex is a core vertex. Our second method is based on a low-rank
approximation of a network's adjacency matrix, which can often be expressed as
a tensor-product matrix. Our third approach uses the bottom eigenvector of the
random-walk Laplacian to infer a coreness score and a classification into core
and peripheral vertices. We also design an objective function to (1) help
classify vertices into core or peripheral vertices and (2) provide a
goodness-of-fit criterion for classifications into core versus peripheral
vertices. To examine the performance of our methods, we apply our algorithms to
both synthetically-generated networks and a variety of networks constructed
from real-world data sets.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 04:45:42 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 22:08:53 GMT"
},
{
"version": "v3",
"created": "Sun, 6 Nov 2016 20:09:33 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Cucuringu",
"Mihai",
""
],
[
"Rombach",
"Puck",
""
],
[
"Lee",
"Sang Hoon",
""
],
[
"Porter",
"Mason A.",
""
]
] |
new_dataset
| 0.994895 |
1509.07109
|
Sayed Kamaledin Ghiasi-Shirazi
|
Sayed Kamaledin Ghiasi-Shirazi, Mahdi Mohseni, Majid Darvishan, and
Reza Yousefzadeh
|
RSCM Technology for Developing Runtime-Reconfigurable Telecommunication
Applications
| null | null |
10.1016/j.csi.2016.10.015
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Runtime reconfiguration is a fundamental requirement of many
telecommunication applications which also has been addressed by management
standards like CMIP, 3GPP TS 32.602, and NETCONF. Two basic commands considered
by these standards are CREATE and DELETE which operate on managed objects
inside an application. The available configuration management technologies,
like JMX, OSGi, and Fractal, do not support the CREATE and DELETE
reconfiguration commands of the telecommunication standards. In this paper, we
introduce a novel technology, called RSCM, for development of runtime
reconfigurable applications complying with the telecommunication standards. The
RSCM subagent takes the responsibility of loading the application from the
configuration file, executing the runtime reconfiguration commands (including
CREATE and DELETE), enforcing validity of the configuration state, and updating
the configuration file according to the latest reconfiguration commands. We
exploit the modular and object oriented features of the XML technology for
storing the configuration state of a program in a configuration file. The
software development process is tailored such that the design of XML schemas of
managed classes is performed parallel to the design of software classes. In
addition, a novel programming approach based on indirect referencing is
proposed which allows safe and almost immediate deletion of managed objects at
runtime. This indirect referencing mechanism affects the implementation of
associations in class diagrams and prevents methods of a class to use the this
pointer freely. The RSCM technology has been successfully used in several
commercial telecommunication applications; including an SMS service center, an
SMS gateway, and an SMS hub.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 19:48:41 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Nov 2016 03:34:26 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Ghiasi-Shirazi",
"Sayed Kamaledin",
""
],
[
"Mohseni",
"Mahdi",
""
],
[
"Darvishan",
"Majid",
""
],
[
"Yousefzadeh",
"Reza",
""
]
] |
new_dataset
| 0.998126 |
1602.07360
|
Forrest Iandola
|
Forrest N. Iandola, Song Han, Matthew W. Moskewicz, Khalid Ashraf,
William J. Dally, Kurt Keutzer
|
SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB
model size
|
In ICLR Format
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent research on deep neural networks has focused primarily on improving
accuracy. For a given accuracy level, it is typically possible to identify
multiple DNN architectures that achieve that accuracy level. With equivalent
accuracy, smaller DNN architectures offer at least three advantages: (1)
Smaller DNNs require less communication across servers during distributed
training. (2) Smaller DNNs require less bandwidth to export a new model from
the cloud to an autonomous car. (3) Smaller DNNs are more feasible to deploy on
FPGAs and other hardware with limited memory. To provide all of these
advantages, we propose a small DNN architecture called SqueezeNet. SqueezeNet
achieves AlexNet-level accuracy on ImageNet with 50x fewer parameters.
Additionally, with model compression techniques we are able to compress
SqueezeNet to less than 0.5MB (510x smaller than AlexNet).
The SqueezeNet architecture is available for download here:
https://github.com/DeepScale/SqueezeNet
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 00:09:45 GMT"
},
{
"version": "v2",
"created": "Sat, 27 Feb 2016 20:24:20 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Apr 2016 07:21:49 GMT"
},
{
"version": "v4",
"created": "Fri, 4 Nov 2016 21:26:08 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Iandola",
"Forrest N.",
""
],
[
"Han",
"Song",
""
],
[
"Moskewicz",
"Matthew W.",
""
],
[
"Ashraf",
"Khalid",
""
],
[
"Dally",
"William J.",
""
],
[
"Keutzer",
"Kurt",
""
]
] |
new_dataset
| 0.980483 |
1610.08173
|
Salvatore Talarico
|
Salvatore Talarico, Matthew C. Valenti, and Thomas R. Halford
|
Controlled Barrage Regions: Stochastic Modeling, Analysis, and
Optimization
|
7 pages, 3 images, in Military Communication Conference (MILCOM).
arXiv admin note: substantial text overlap with arXiv:1408.5928
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A barrage relay network (BRN) is a broadcast oriented ad hoc network
involving autonomous cooperative communication, a slotted time-division frame
format, and a coarse slot-level synchronization. While inherently a broadcast
protocol, BRNs can support unicast transmission by superimposing a plurality of
controlled barrage regions (CBRs) onto the network. Within each CBRs, a new
packet is injected by the unicast source during the first time slot of each new
radio frame. When a CBRs is sufficiently long that a packet might not be able
to reach the other end within a radio frame, multiple packets can be active at
the same time via spatial pipelining, resulting in interference within the
CBRs. In this paper, the dynamics of packet transmission within a CBRs is
described as a Markov process, and the outage probability of each link within
the CBRs is evaluated in closed form, thereby accounting for fading and
co-channel interference. In order to account for the linkage between
simultaneous active packets and their temporal correlation, a Viterbi-like
algorithm is used. Using this accurate analytical framework, a line network is
optimized, which identifies the code rate, the number of relays, and the length
of a radio frame that maximizes the transport capacity.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 05:33:27 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Nov 2016 04:08:01 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Talarico",
"Salvatore",
""
],
[
"Valenti",
"Matthew C.",
""
],
[
"Halford",
"Thomas R.",
""
]
] |
new_dataset
| 0.98201 |
1611.01642
|
Victor Campmany
|
Victor Campmany, Sergio Silva, Antonio Espinosa, Juan Carlos Moure,
David V\'azquez, Antonio M. L\'opez
|
GPU-based Pedestrian Detection for Autonomous Driving
|
10 pages
|
International Conference on Computational Science 2016 Volume 80
Pages 2377 to 2381
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a real-time pedestrian detection system for the embedded Nvidia
Tegra X1 GPU-CPU hybrid platform. The pipeline is composed by the following
state-of-the-art algorithms: Histogram of Local Binary Patterns (LBP) and
Histograms of Oriented Gradients (HOG) features extracted from the input image;
Pyramidal Sliding Window technique for candidate generation; and Support Vector
Machine (SVM) for classification. Results show a 8x speedup in the target Tegra
X1 platform and a better performance/watt ratio than desktop CUDA platforms in
study.
|
[
{
"version": "v1",
"created": "Sat, 5 Nov 2016 12:47:32 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Campmany",
"Victor",
""
],
[
"Silva",
"Sergio",
""
],
[
"Espinosa",
"Antonio",
""
],
[
"Moure",
"Juan Carlos",
""
],
[
"Vázquez",
"David",
""
],
[
"López",
"Antonio M.",
""
]
] |
new_dataset
| 0.993052 |
1611.01801
|
Qingchao Chen
|
Qingchao Chen, Bo Tan, Kevin Chetty, Karl Woodbridge
|
Activity Recognition Based on Micro-Doppler Signature with In-Home Wi-Fi
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device free activity recognition and monitoring has become a promising
research area with increasing public interest in pattern of life monitoring and
chronic health conditions. This paper proposes a novel framework for in-home
Wi-Fi signal-based activity recognition in e-healthcare applications using
passive micro-Doppler (m-D) signature classification. The framework includes
signal modeling, Doppler extraction and m-D classification. A data collection
campaign was designed to verify the framework where six m-D signatures
corresponding to typical daily activities are sucessfully detected and
classified using our software defined radio (SDR) demo system. Analysis of the
data focussed on potential discriminative characteristics, such as maximum
Doppler frequency and time duration of activity. Finally, a sparsity induced
classifier is applied for adaptting the method in healthcare application
scenarios and the results are compared with those from the well-known Support
Vector Machine (SVM) method.
|
[
{
"version": "v1",
"created": "Sun, 6 Nov 2016 16:06:30 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Chen",
"Qingchao",
""
],
[
"Tan",
"Bo",
""
],
[
"Chetty",
"Kevin",
""
],
[
"Woodbridge",
"Karl",
""
]
] |
new_dataset
| 0.994942 |
1611.01866
|
Giacomo Marciani
|
Giacomo Marciani
|
Marciani Normal Form of context-free grammars
|
preprint, 4 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove the semidecidability of the problem of saying whether
or not a context-free grammar generates a regular language. We introduce the
notion of context-free grammar in Marciani Normal Form. We prove that a
context-free grammar in Marciani Normal Form always generates a regular
language.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 00:47:19 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Marciani",
"Giacomo",
""
]
] |
new_dataset
| 0.960732 |
1611.02025
|
Xavier Holt
|
Xavier Holt, Will Radford, Ben Hachey
|
Presenting a New Dataset for the Timeline Generation Problem
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The timeline generation task summarises an entity's biography by selecting
stories representing key events from a large pool of relevant documents. This
paper addresses the lack of a standard dataset and evaluative methodology for
the problem. We present and make publicly available a new dataset of 18,793
news articles covering 39 entities. For each entity, we provide a gold standard
timeline and a set of entity-related articles. We propose ROUGE as an
evaluation metric and validate our dataset by showing that top Google results
outperform straw-man baselines.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 12:47:25 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Holt",
"Xavier",
""
],
[
"Radford",
"Will",
""
],
[
"Hachey",
"Ben",
""
]
] |
new_dataset
| 0.99951 |
1611.02027
|
Will Radford
|
Will Radford and Andrew Chisholm and Ben Hachey and Bo Han
|
:telephone::person::sailboat::whale::okhand:; or "Call me Ishmael" - How
do you translate emoji?
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on an exploratory analysis of Emoji Dick, a project that leverages
crowdsourcing to translate Melville's Moby Dick into emoji. This distinctive
use of emoji removes textual context, and leads to a varying translation
quality. In this paper, we use statistical word alignment and part-of-speech
tagging to explore how people use emoji. Despite these simple methods, we
observed differences in token and part-of-speech distributions. Experiments
also suggest that semantics are preserved in the translation, and repetition is
more common in emoji.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 12:51:22 GMT"
}
] | 2016-11-08T00:00:00 |
[
[
"Radford",
"Will",
""
],
[
"Chisholm",
"Andrew",
""
],
[
"Hachey",
"Ben",
""
],
[
"Han",
"Bo",
""
]
] |
new_dataset
| 0.998435 |
1512.01416
|
Richard Bornat
|
Richard Bornat (1), Jade Alglave (2 and 3) and Matthew Parkinson (3)
((1) Middlesex University, London, (2) University College, London, (3)
Microsoft Research)
|
New Lace and Arsenic: adventures in weak memory with a program logic
|
This paper reports the joint work of its authors. But the words in
the paper were written by Richard Bornat. Any opprobrium, bug reports,
complaints, and observations about sins of com- mission or omission should be
directed at him. [email protected]
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a program logic for weak memory (also known as relaxed memory).
The logic is based on Hoare logic within a thread, and rely/guarantee between
threads. It is presented via examples, giving proofs of many weak-memory litmus
tests. It extends to coherence but not yet to synchronised assignment
(compare-and-swap, load-logical/store-conditional). It deals with conditionals
and loops but not yet arrays or heap.
The logic uses a version of Hoare logic within threads, and a version of
rely/guarantee between threads, with five stability rules to handle various
kinds of parallelism (external, internal, propagation-free and two kinds of
in-flight parallelism). There are $\mathbb{B}$ and $\mathbb{U}$ modalities to
regulate propagation, and temporal modalities $\mathsf{since}$,
$\mathbb{S}\mathsf{ofar}$ and $\mathbb{O}\mathsf{uat}$ to deal with global
coherence (SC per location).
The logic is presented by example. Proofs and unproofs of about thirty
weak-memory examples, including many litmus tests in various guises, are dealt
with in detail. There is a proof of a version of the token ring.
In version 2: The correspondence with Herding Cats has been clarified. The
stability rules have been simplified: in particular the sat and x= x tests have
been eliminated from external stability checks. The embedding is simplified and
has a more transparent relation to the mechanisms of the logic. Definitions of
U, Sofar and Ouat have been considerably altered. The description of modalities
and the treatment of termination has been reworked. Many proofs are
reconstructed. A comprehensive summary of the logic is an appendix.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2015 14:19:01 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Nov 2016 16:18:44 GMT"
}
] | 2016-11-07T00:00:00 |
[
[
"Bornat",
"Richard",
"",
"2 and 3"
],
[
"Alglave",
"Jade",
"",
"2 and 3"
],
[
"Parkinson",
"Matthew",
""
]
] |
new_dataset
| 0.994863 |
1611.00625
|
Gabriel Synnaeve
|
Gabriel Synnaeve, Nantas Nardelli, Alex Auvolat, Soumith Chintala,
Timoth\'ee Lacroix, Zeming Lin, Florian Richoux, Nicolas Usunier
|
TorchCraft: a Library for Machine Learning Research on Real-Time
Strategy Games
| null | null | null | null |
cs.LG cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present TorchCraft, a library that enables deep learning research on
Real-Time Strategy (RTS) games such as StarCraft: Brood War, by making it
easier to control these games from a machine learning framework, here Torch.
This white paper argues for using RTS games as a benchmark for AI research, and
describes the design and components of TorchCraft.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 05:01:24 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Nov 2016 21:54:28 GMT"
}
] | 2016-11-07T00:00:00 |
[
[
"Synnaeve",
"Gabriel",
""
],
[
"Nardelli",
"Nantas",
""
],
[
"Auvolat",
"Alex",
""
],
[
"Chintala",
"Soumith",
""
],
[
"Lacroix",
"Timothée",
""
],
[
"Lin",
"Zeming",
""
],
[
"Richoux",
"Florian",
""
],
[
"Usunier",
"Nicolas",
""
]
] |
new_dataset
| 0.999166 |
1611.01235
|
Tiffany Hwu
|
Tiffany Hwu, Jacob Isbell, Nicolas Oros, and Jeffrey Krichmar
|
A Self-Driving Robot Using Deep Convolutional Neural Networks on
Neuromorphic Hardware
|
6 pages, 8 figures
| null | null | null |
cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neuromorphic computing is a promising solution for reducing the size, weight
and power of mobile embedded systems. In this paper, we introduce a realization
of such a system by creating the first closed-loop battery-powered
communication system between an IBM TrueNorth NS1e and an autonomous
Android-Based Robotics platform. Using this system, we constructed a dataset of
path following behavior by manually driving the Android-Based robot along steep
mountain trails and recording video frames from the camera mounted on the robot
along with the corresponding motor commands. We used this dataset to train a
deep convolutional neural network implemented on the TrueNorth NS1e. The NS1e,
which was mounted on the robot and powered by the robot's battery, resulted in
a self-driving robot that could successfully traverse a steep mountain path in
real time. To our knowledge, this represents the first time the TrueNorth NS1e
neuromorphic chip has been embedded on a mobile platform under closed-loop
control.
|
[
{
"version": "v1",
"created": "Fri, 4 Nov 2016 01:10:07 GMT"
}
] | 2016-11-07T00:00:00 |
[
[
"Hwu",
"Tiffany",
""
],
[
"Isbell",
"Jacob",
""
],
[
"Oros",
"Nicolas",
""
],
[
"Krichmar",
"Jeffrey",
""
]
] |
new_dataset
| 0.999502 |
1611.01257
|
Brian Keegan
|
Marlon Twyman and Brian C. Keegan and Aaron Shaw
|
Black Lives Matter in Wikipedia: Collaboration and Collective Memory
around Online Social Movements
|
14 pages
| null |
10.1145/2998181.2998232
| null |
cs.SI cs.CY cs.HC physics.soc-ph
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Social movements use social computing systems to complement offline
mobilizations, but prior literature has focused almost exclusively on movement
actors' use of social media. In this paper, we analyze participation and
attention to topics connected with the Black Lives Matter movement in the
English language version of Wikipedia between 2014 and 2016. Our results point
to the use of Wikipedia to (1) intensively document and connect historical and
contemporary events, (2) collaboratively migrate activity to support coverage
of new events, and (3) dynamically re-appraise pre-existing knowledge in the
aftermath of new events. These findings reveal patterns of behavior that
complement theories of collective memory and collective action and help explain
how social computing systems can encode and retrieve knowledge about social
movements as they unfold.
|
[
{
"version": "v1",
"created": "Fri, 4 Nov 2016 03:35:58 GMT"
}
] | 2016-11-07T00:00:00 |
[
[
"Twyman",
"Marlon",
""
],
[
"Keegan",
"Brian C.",
""
],
[
"Shaw",
"Aaron",
""
]
] |
new_dataset
| 0.998112 |
1611.01344
|
Shaull Almagor
|
Shaull Almagor, Jo\"el Ouaknine, James Worrell
|
The Polytope-Collision Problem
|
20 pages, 1 figure. Submitted to STOC 2017
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Orbit Problem consists of determining, given a matrix $A\in
\mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists
$n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in
a seminal work of Kannan and Lipton in the 1980s. Subsequently, Kannan and
Lipton noted that the Orbit Problem becomes considerably harder when the target
$y$ is replaced with a subspace of $\mathbb{R}^d$. Recently, it was shown that
the problem is decidable for vector-space targets of dimension at most three,
followed by another development showing that the problem is in PSPACE for
polytope targets of dimension at most three. In this work, we take a dual look
at the problem, and consider the case where the initial vector $x$ is replaced
with a polytope $P_1$, and the target is a polytope $P_2$. Then, the question
is whether there exists $n\in \mathbb{N}$ such that $A^n P_1\cap P_2\neq
\emptyset$. We show that the problem can be decided in PSPACE for dimension at
most three. As in previous works, decidability in the case of higher dimensions
is left open, as the problem is known to be hard for long-standing
number-theoretic open problems.
Our proof begins by formulating the problem as the satisfiability of a
parametrized family of sentences in the existential first-order theory of
real-closed fields. Then, after removing quantifiers, we are left with
instances of simultaneous positivity of sums of exponentials. Using techniques
from transcendental number theory, and separation bounds on algebraic numbers,
we are able to solve such instances in PSPACE.
|
[
{
"version": "v1",
"created": "Fri, 4 Nov 2016 12:00:41 GMT"
}
] | 2016-11-07T00:00:00 |
[
[
"Almagor",
"Shaull",
""
],
[
"Ouaknine",
"Joël",
""
],
[
"Worrell",
"James",
""
]
] |
new_dataset
| 0.997715 |
1607.02817
|
Prasanth K. P.
|
S. B. Balaji, K. P. Prasanth and P. Vijay Kumar
|
Binary Codes with Locality for Four Erasures
|
5 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, codes with locality for four erasures are considered. An upper
bound on the rate of codes with locality with sequential recovery from four
erasures is derived. The rate bound derived here is field independent. An
optimal construction for binary codes meeting this rate bound is also provided.
The construction is based on regular graphs of girth $6$ and employs the
sequential approach of locally recovering from multiple erasures. An extension
of this construction that generates codes which can sequentially recover from
five erasures is also presented.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 04:32:55 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Oct 2016 17:51:17 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Nov 2016 06:38:44 GMT"
}
] | 2016-11-04T00:00:00 |
[
[
"Balaji",
"S. B.",
""
],
[
"Prasanth",
"K. P.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.998985 |
1611.01042
|
Chung Ho
|
Chung Duc Ho, Hien Quoc Ngo, Michail Matthaiou, and Trung Q. Duong
|
Multi-Way Massive MIMO with Maximum-Ratio Processing and Imperfect CSI
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a multi-way massive multiple-input multiple-output
relaying system, where single-antenna users exchange their information-bearing
signals with the help of one relay station equipped with unconventionally many
antennas. The relay first estimates the channels to all users through the pilot
signals transmitted from them. Then, the relay uses maximum-ratio processing
(i.e. maximum-ratio combining in the multiple-access phase and maximum-ratio
transmission in the broadcast phase) to process the signals. A rigorous
closed-form expression for the spectral efficiency is derived. The effects of
the channel estimation error, the channel estimation overhead, the length of
the training duration, and the randomness of the user locations are analyzed.
We show that by deploying massive antenna arrays at the relay and simple
maximum-ratio processing, we can serve many users in the same time-frequency
resource, while maintaining a given quality-of-service for each user.
|
[
{
"version": "v1",
"created": "Thu, 3 Nov 2016 14:33:13 GMT"
}
] | 2016-11-04T00:00:00 |
[
[
"Ho",
"Chung Duc",
""
],
[
"Ngo",
"Hien Quoc",
""
],
[
"Matthaiou",
"Michail",
""
],
[
"Duong",
"Trung Q.",
""
]
] |
new_dataset
| 0.955916 |
1502.02803
|
Hailong Shi
|
Hailong Shi, Hao Zhang, and Xiqin Wang
|
A TDOA technique with Super-Resolution based on the Volume
Cross-Correlation Function
|
13 pages, submitted and revised to IEEE Trans on Signal Processing
| null |
10.1109/TSP.2016.2548988
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time Difference of Arrival (TDOA) is widely used in wireless localization
systems. Among the enormous approaches of TDOA, high resolution TDOA algorithms
have drawn much attention for its ability to resolve closely spaced signal
delays in multipath environment. However, the state-of-art high resolution TDOA
algorithms still have performance weakness on resolving time delays in a
wireless channel with dense multipath effect, as well as difficulties in
implementation for their high computation complexity. In this paper, we propose
a novel TDOA algorithm with super resolution based on a multi-dimensional
cross-correlation function: the Volume Cross-Correlation Function (VCC). The
proposed TDOA algorithm has excellent time resolution capability in multipath
environment, and it also has a much lower computational complexity. Because our
algorithm does not require priori knowledge about the waveform or power
spectrum of transmitted signals, it has great potential of usage in various
passive wireless localization systems. Numerical simulations is also provided
to demonstrate the validity of our conclusion.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 07:36:41 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Aug 2015 21:00:15 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Nov 2015 14:53:21 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Shi",
"Hailong",
""
],
[
"Zhang",
"Hao",
""
],
[
"Wang",
"Xiqin",
""
]
] |
new_dataset
| 0.987999 |
1601.07661
|
Bolun Cai
|
Bolun Cai, Xiangmin Xu, Kui Jia, Chunmei Qing and Dacheng Tao
|
DehazeNet: An End-to-End System for Single Image Haze Removal
| null | null |
10.1109/TIP.2016.2598681
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single image haze removal is a challenging ill-posed problem. Existing
methods use various constraints/priors to get plausible dehazing solutions. The
key to achieve haze removal is to estimate a medium transmission map for an
input hazy image. In this paper, we propose a trainable end-to-end system
called DehazeNet, for medium transmission estimation. DehazeNet takes a hazy
image as input, and outputs its medium transmission map that is subsequently
used to recover a haze-free image via atmospheric scattering model. DehazeNet
adopts Convolutional Neural Networks (CNN) based deep architecture, whose
layers are specially designed to embody the established assumptions/priors in
image dehazing. Specifically, layers of Maxout units are used for feature
extraction, which can generate almost all haze-relevant features. We also
propose a novel nonlinear activation function in DehazeNet, called Bilateral
Rectified Linear Unit (BReLU), which is able to improve the quality of
recovered haze-free image. We establish connections between components of the
proposed DehazeNet and those used in existing methods. Experiments on benchmark
images show that DehazeNet achieves superior performance over existing methods,
yet keeps efficient and easy to use.
|
[
{
"version": "v1",
"created": "Thu, 28 Jan 2016 06:32:22 GMT"
},
{
"version": "v2",
"created": "Tue, 17 May 2016 08:03:18 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Cai",
"Bolun",
""
],
[
"Xu",
"Xiangmin",
""
],
[
"Jia",
"Kui",
""
],
[
"Qing",
"Chunmei",
""
],
[
"Tao",
"Dacheng",
""
]
] |
new_dataset
| 0.999627 |
1602.02720
|
Mykhail Uss Ph.D.
|
M.L. Uss, B. Vozel, V.V. Lukin, K. Chehdi
|
Multimodal Remote Sensing Image Registration with Accuracy Estimation at
Local and Global Scales
|
48 pages, 8 figures, 5 tables, 51 references Revised arguments in
sections 2 and 3. Additional test cases added in Section 4; comparison with
the state-of-the-art improved. References added. Conclusions unchanged.
Proofread
| null |
10.1109/TGRS.2016.2587321
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on potential accuracy of remote sensing images
registration. We investigate how this accuracy can be estimated without ground
truth available and used to improve registration quality of mono- and
multi-modal pair of images. At the local scale of image fragments, the
Cramer-Rao lower bound (CRLB) on registration error is estimated for each local
correspondence between coarsely registered pair of images. This CRLB is defined
by local image texture and noise properties. Opposite to the standard approach,
where registration accuracy is only evaluated at the output of the registration
process, such valuable information is used by us as an additional input
knowledge. It greatly helps detecting and discarding outliers and refining the
estimation of geometrical transformation model parameters. Based on these
ideas, a new area-based registration method called RAE (Registration with
Accuracy Estimation) is proposed. In addition to its ability to automatically
register very complex multimodal image pairs with high accuracy, the RAE method
provides registration accuracy at the global scale as covariance matrix of
estimation error of geometrical transformation model parameters or as
point-wise registration Standard Deviation. This accuracy does not depend on
any ground truth availability and characterizes each pair of registered images
individually. Thus, the RAE method can identify image areas for which a
predefined registration accuracy is guaranteed. The RAE method is proved
successful with reaching subpixel accuracy while registering eight complex
mono/multimodal and multitemporal image pairs including optical to optical,
optical to radar, optical to Digital Elevation Model (DEM) images and DEM to
radar cases. Other methods employed in comparisons fail to provide in a stable
manner accurate results on the same test cases.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 20:05:42 GMT"
},
{
"version": "v2",
"created": "Wed, 25 May 2016 20:16:54 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Uss",
"M. L.",
""
],
[
"Vozel",
"B.",
""
],
[
"Lukin",
"V. V.",
""
],
[
"Chehdi",
"K.",
""
]
] |
new_dataset
| 0.997951 |
1607.00494
|
Mehdi Korki
|
Hadi Zayyani, Farzan Haddadi, and Mehdi Korki
|
Double-detector for Sparse Signal Detection from One Bit Compressed
Sensing Measurements
|
5 pages, 4 figures
| null |
10.1109/LSP.2016.2613898
| null |
cs.IT math.IT stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter presents the sparse vector signal detection from one bit
compressed sensing measurements, in contrast to the previous works which deal
with scalar signal detection. In this letter, available results are extended to
the vector case and the GLRT detector and the optimal quantizer design are
obtained. Also, a double-detector scheme is introduced in which a sensor level
threshold detector is integrated into network level GLRT to improve the
performance. The detection criteria of oracle and clairvoyant detectors are
also derived. Simulation results show that with careful design of the threshold
detector, the overall detection performance of double-detector scheme would be
better than the sign-GLRT proposed in [1] and close to oracle and clairvoyant
detectors. Also, the proposed detector is applied to spectrum sensing and the
results are near the well known energy detector which uses the real valued data
while the proposed detector only uses the sign of the data.
|
[
{
"version": "v1",
"created": "Sat, 2 Jul 2016 11:51:25 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Zayyani",
"Hadi",
""
],
[
"Haddadi",
"Farzan",
""
],
[
"Korki",
"Mehdi",
""
]
] |
new_dataset
| 0.973202 |
1609.02077
|
Guanbin Li
|
Guanbin Li and Yizhou Yu
|
Visual Saliency Detection Based on Multiscale Deep CNN Features
|
Accepted for publication in IEEE Transactions on Image Processing
| null |
10.1109/TIP.2016.2602079
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual saliency is a fundamental problem in both cognitive and computational
sciences, including computer vision. In this paper, we discover that a
high-quality visual saliency model can be learned from multiscale features
extracted using deep convolutional neural networks (CNNs), which have had many
successes in visual recognition tasks. For learning such saliency models, we
introduce a neural network architecture, which has fully connected layers on
top of CNNs responsible for feature extraction at three different scales. The
penultimate layer of our neural network has been confirmed to be a
discriminative high-level feature vector for saliency detection, which we call
deep contrast feature. To generate a more robust feature, we integrate
handcrafted low-level features with our deep contrast feature. To promote
further research and evaluation of visual saliency models, we also construct a
new large database of 4447 challenging images and their pixelwise saliency
annotations. Experimental results demonstrate that our proposed method is
capable of achieving state-of-the-art performance on all public benchmarks,
improving the F- measure by 6.12% and 10.0% respectively on the DUT-OMRON
dataset and our new dataset (HKU-IS), and lowering the mean absolute error by
9% and 35.3% respectively on these two datasets.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 17:13:16 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Li",
"Guanbin",
""
],
[
"Yu",
"Yizhou",
""
]
] |
new_dataset
| 0.996474 |
1610.07184
|
Soumitra Pal
|
Soumitra Pal, Tingyang Xu, Tianbao Yang, Sanguthevar Rajasekaran,
Jinbo Bi
|
Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual
Coordinate Ascent
| null | null | null | null |
cs.DC math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In prior works, stochastic dual coordinate ascent (SDCA) has been
parallelized in a multi-core environment where the cores communicate through
shared memory, or in a multi-processor distributed memory environment where the
processors communicate through message passing. In this paper, we propose a
hybrid SDCA framework for multi-core clusters, the most common high performance
computing environment that consists of multiple nodes each having multiple
cores and its own shared memory. We distribute data across nodes where each
node solves a local problem in an asynchronous parallel fashion on its cores,
and then the local updates are aggregated via an asynchronous across-node
update scheme. The proposed double asynchronous method converges to a global
solution for $L$-Lipschitz continuous loss functions, and at a linear
convergence rate if a smooth convex loss function is used. Extensive empirical
comparison has shown that our algorithm scales better than the best known
shared-memory methods and runs faster than previous distributed-memory methods.
Big datasets, such as one of 280 GB from the LIBSVM repository, cannot be
accommodated on a single node and hence cannot be solved by a parallel
algorithm. For such a dataset, our hybrid algorithm takes 30 seconds to achieve
a duality gap of $10^{-6}$ on 16 nodes each using 8 cores, which is
significantly faster than the best known distributed algorithms, such as
CoCoA+, that take more than 300 seconds on 16 nodes.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2016 15:17:43 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Nov 2016 17:50:50 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Pal",
"Soumitra",
""
],
[
"Xu",
"Tingyang",
""
],
[
"Yang",
"Tianbao",
""
],
[
"Rajasekaran",
"Sanguthevar",
""
],
[
"Bi",
"Jinbo",
""
]
] |
new_dataset
| 0.998621 |
1611.00377
|
Pascal Budner
|
Pascal Budner, Joern Grahl
|
Collaboration Networks in the Music Industry
|
12 pages, 5 figures, 6 tables
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recording an album brings singers, producers, musicians, audio engineers, and
many other professions together. We know from the press that a few
"super"-producers work with many artists. But how does the large-scale social
structure of the music industry look like? What is the social network behind
the finest albums of all time? In this paper we studied the large-scale
structure of music collaborations using the tools of network science. We
considered all albums in Rolling Stone Magazine's list of '500 Greatest Albums
of All Time' and the '1001 Albums You Must Hear Before You Die' by Robert
Dimery. We found that the existing research on collaboration networks is
corroborated by the particular collaboration network in the music industry.
Furthermore, it has been found that the most important professions of the music
industry in terms of connectivity were main artists and engineers.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 20:17:56 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Budner",
"Pascal",
""
],
[
"Grahl",
"Joern",
""
]
] |
new_dataset
| 0.983365 |
1611.00576
|
Florentin Smarandache
|
W. B. Vasantha Kandasamy, Ilanthenral K, Florentin Smarandache
|
Strong Neutrosophic Graphs and Subgraph Topological Subspaces
|
226 pages, many graphs, Europa Belgique, 2016
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this book authors for the first time introduce the notion of strong
neutrosophic graphs. They are very different from the usual graphs and
neutrosophic graphs. Using these new structures special subgraph topological
spaces are defined. Further special lattice graph of subgraphs of these graphs
are defined and described. Several interesting properties using subgraphs of a
strong neutrosophic graph are obtained. Several open conjectures are proposed.
These new class of strong neutrosophic graphs will certainly find applications
in Neutrosophic Cognitive Maps (NCM), Neutrosophic Relational Maps (NRM) and
Neutrosophic Relational Equations (NRE) with appropriate modifications.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2016 15:10:55 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Kandasamy",
"W. B. Vasantha",
""
],
[
"K",
"Ilanthenral",
""
],
[
"Smarandache",
"Florentin",
""
]
] |
new_dataset
| 0.96745 |
1611.00578
|
Miikka Kuutila M.Sc.
|
Miikka Kuutila, Mika M\"antyl\"a, P\"aivi Raulamo-Jurvanen
|
Benchmarking Web-testing - Selenium versus Watir and the Choice of
Programming Language and Browser
|
40 pages, 3 figures, 26 tables
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context: Selenium is claimed to be the most popular software test automation
tool. Past academic works have mainly neglected testing tools in favor of more
methodological topics. Objective: We investigated the performance of
web-testing tools, to provide empirical evidence supporting choices in software
test tool selection and configuration. Method: We used 4*5 factorial design to
study 20 different configurations for testing a web-store. We studied 5
programming language bindings (C#, Java, Python, and Ruby for Selenium, while
Watir supports Ruby only) and 4 browsers (Google Chrome, Internet Explorer,
Mozilla Firefox and Opera). Performance was measured with execution time,
memory usage, length of the test scripts and stability of the tests. Results:
Considering all measures the best configuration was Selenium with Python
language binding for Chrome. Selenium with Python bindings was the best option
for all browsers. The effect size of the difference between the slowest and
fastest configuration was very high (Cohens d=41.5, 91% increase in execution
time). Overall Internet Explorer was the fastest browser while having the worst
results in the stability. Conclusions: We recommend benchmarking tools before
adopting them. Weighting of factors, e.g. how much test stability is one
willing to sacrifice for faster performance, affects the decision.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 13:00:08 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Kuutila",
"Miikka",
""
],
[
"Mäntylä",
"Mika",
""
],
[
"Raulamo-Jurvanen",
"Päivi",
""
]
] |
new_dataset
| 0.994958 |
1611.00617
|
Carlos Lopez
|
C.F. Lopez, C.-X. Wang and R. Feng
|
A novel 2D non-stationary wideband massive MIMO channel model
|
6 pages, 5 figures, conference
|
IEEE International Workshop on Computer Aided Modelling and Design
of Communication Links and Networks (CAMAD), Toronto, Canada, Oct. 2016
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel two-dimensional (2D) non-stationary wideband
geometry-based stochastic model (GBSM) for massive multiple-input
multiple-output (MIMO) communication systems is proposed. Key characteristics
of massive MIMO channels such as near field effects and cluster evolution along
the array are addressed in this model. Near field effects are modelled by a
second-order approximation to spherical wavefronts, i.e., parabolic wavefronts,
leading to linear drifts of the angles of multipath components (MPCs) and
non-stationarity along the array. Cluster evolution along the array involving
cluster (dis)appearance and smooth average power variations is considered.
Cluster (dis)appearance is modeled by a two-state Markov process and smooth
average power variations are modelled by a spatial lognormal process.
Statistical properties of the channel model such as time autocorrelation
function (ACF), spatial cross-correlation function (CCF), and cluster average
power and Rician factor variations over the array are derived. Finally,
simulation results are presented and analyzed, demonstrating that parabolic
wavefronts and cluster soft evolution are good candidates to model important
massive MIMO channel characteristics.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 14:03:28 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Lopez",
"C. F.",
""
],
[
"Wang",
"C. -X.",
""
],
[
"Feng",
"R.",
""
]
] |
new_dataset
| 0.986568 |
1611.00684
|
Mina Nouredanesh
|
Mina Nouredanesh, Andrew McCormick, Sunil L. Kukreja and James Tung
|
Wearable Vision Detection of Environmental Fall Risks using
Convolutional Neural Networks
|
Accepted paper-The 38th Annual International Conference of the IEEE
Engineering in Medicine and Biology Society (EMBC 2016)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a method to detect environmental hazards related to a fall
risk using a mobile vision system is proposed. First-person perspective videos
are proposed to provide objective evidence on cause and circumstances of
perturbed balance during activities of daily living, targeted to seniors. A
classification problem was defined with 12 total classes of potential fall
risks, including slope changes (e.g., stairs, curbs, ramps) and surfaces (e.g.,
gravel, grass, concrete). Data was collected using a chest-mounted GoPro
camera. We developed a convolutional neural network for automatic feature
extraction, reduction, and classification of frames. Initial results, with a
mean square error of 8%, are promising.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 16:54:39 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Nouredanesh",
"Mina",
""
],
[
"McCormick",
"Andrew",
""
],
[
"Kukreja",
"Sunil L.",
""
],
[
"Tung",
"James",
""
]
] |
new_dataset
| 0.994049 |
1611.00708
|
Mohamad Ali
|
Mohamad Ali, Hassine Moungla, Mohamed Younis, Ahmed Mehaoua
|
Inter-WBANs Interference Mitigation Using Orthogonal Walsh Hadamard
Codes
|
2016 27th IEEE International Symposium on Personal, Indoor and Mobile
Radio Communications (PIMRC), Valencia, Spain
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Wireless Body Area Network (WBAN) provides health care services. The
performance and utility of WBANs can be degraded due to interference. In this
paper, our contribution for co-channel interference mitigation among coexisting
WBANs is threefold. First, we propose a distributed orthogonal code allocation
scheme, namely, OCAIM, where, each WBAN generates sensor interference lists
(SILs), and then all sensors belonging to these lists are allocated orthogonal
codes. Secondly, we propose a distributed time reference correlation scheme,
namely, DTRC, that is used as a building block of OCAIM. DTRC enables eachWBAN
to generate a virtual time-based pattern to relate the different superframes.
Accordingly, DTRC provides each WBAN with the knowledge about, 1) which
superframes and, 2) which time-slots of those superframes interfere with the
time-slots within its superframe. Thirdly, we further analyze the success and
collision probabilities of frames transmissions when the number of coexisting
WBANs grows. The simulation results demonstrate that OCAIM outperforms other
competing schemes in terms of interference mitigation and power savings.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 18:15:19 GMT"
}
] | 2016-11-03T00:00:00 |
[
[
"Ali",
"Mohamad",
""
],
[
"Moungla",
"Hassine",
""
],
[
"Younis",
"Mohamed",
""
],
[
"Mehaoua",
"Ahmed",
""
]
] |
new_dataset
| 0.994259 |
1603.07009
|
Cunsheng Ding
|
Shuxing Li, Cunsheng Ding, Maosheng Xiong, Gennian Ge
|
Narrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes over finite fields are widely employed in communication systems,
storage devices and consumer electronics, as they have efficient encoding and
decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in
most cases among the best cyclic codes. A subclass of good BCH codes are the
narrow-sense BCH codes over $\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is
known about this class of BCH codes when $q>2$. The objective of this paper is
to study some of the codes within this class. In particular, the dimension, the
minimum distance, and the weight distribution of some ternary BCH codes with
length $n=(3^m-1)/2$ are determined in this paper. A class of ternary BCH codes
meeting the Griesmer bound is identified. An application of some of the BCH
codes in secret sharing is also investigated.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 22:12:37 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Nov 2016 15:05:00 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Li",
"Shuxing",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Xiong",
"Maosheng",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.999732 |
1606.05385
|
Theo Steininger
|
T. Steininger, M. Greiner, F. Beaujean, T. En{\ss}lin
|
D2O - a distributed data object for parallel high-performance computing
in Python
| null | null |
10.1186/s40537-016-0052-5
| null |
cs.MS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce D2O, a Python module for cluster-distributed multi-dimensional
numerical arrays. It acts as a layer of abstraction between the algorithm code
and the data-distribution logic. The main goal is to achieve usability without
losing numerical performance and scalability. D2O's global interface is similar
to the one of a numpy.ndarray, whereas the cluster node's local data is
directly accessible for use in customized high-performance modules. D2O is
written in pure Python which makes it portable and easy to use and modify.
Expensive operations are carried out by dedicated external libraries like numpy
and mpi4py. The performance of D2O is on a par with numpy for serial
applications and scales well when moving to an MPI cluster. D2O is open-source
software available under the GNU General Public License v3 (GPL-3) at
https://gitlab.mpcdf.mpg.de/ift/D2O
|
[
{
"version": "v1",
"created": "Thu, 16 Jun 2016 23:19:58 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Aug 2016 08:28:59 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Steininger",
"T.",
""
],
[
"Greiner",
"M.",
""
],
[
"Beaujean",
"F.",
""
],
[
"Enßlin",
"T.",
""
]
] |
new_dataset
| 0.996788 |
1610.08694
|
Vered Shwartz
|
Vered Shwartz and Ido Dagan
|
CogALex-V Shared Task: LexNET - Integrated Path-based and Distributional
Method for the Identification of Semantic Relations
|
5 pages, accepted to the 5th Workshop on Cognitive Aspects of the
Lexicon (CogALex-V), in COLING 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a submission to the CogALex 2016 shared task on the corpus-based
identification of semantic relations, using LexNET (Shwartz and Dagan, 2016),
an integrated path-based and distributional method for semantic relation
classification. The reported results in the shared task bring this submission
to the third place on subtask 1 (word relatedness), and the first place on
subtask 2 (semantic relation classification), demonstrating the utility of
integrating the complementary path-based and distributional information sources
in recognizing concrete semantic relations. Combined with a common similarity
measure, LexNET performs fairly good on the word relatedness task (subtask 1).
The relatively low performance of LexNET and all other systems on subtask 2,
however, confirms the difficulty of the semantic relation classification task,
and stresses the need to develop additional methods for this task.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 10:49:00 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Oct 2016 09:42:41 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Nov 2016 10:10:01 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Shwartz",
"Vered",
""
],
[
"Dagan",
"Ido",
""
]
] |
new_dataset
| 0.96539 |
1611.00027
|
Yasser El-Sonbaty
|
Mahmoud El-Defrawy, Yasser El-Sonbaty and Nahla A. Belal
|
CBAS: context based arabic stemmer
| null |
International Journal on Natural Language Computing (IJNLC) Vol.
4, No.3, June 2015
|
10.5121/ijnlc.2015.4301
| null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabic morphology encapsulates many valuable features such as word root.
Arabic roots are being utilized for many tasks; the process of extracting a
word root is referred to as stemming. Stemming is an essential part of most
Natural Language Processing tasks, especially for derivative languages such as
Arabic. However, stemming is faced with the problem of ambiguity, where two or
more roots could be extracted from the same word. On the other hand,
distributional semantics is a powerful co-occurrence model. It captures the
meaning of a word based on its context. In this paper, a distributional
semantics model utilizing Smoothed Pointwise Mutual Information (SPMI) is
constructed to investigate its effectiveness on the stemming analysis task. It
showed an accuracy of 81.5%, with a at least 9.4% improvement over other
stemmers.
|
[
{
"version": "v1",
"created": "Wed, 28 Oct 2015 10:10:51 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"El-Defrawy",
"Mahmoud",
""
],
[
"El-Sonbaty",
"Yasser",
""
],
[
"Belal",
"Nahla A.",
""
]
] |
new_dataset
| 0.999676 |
1611.00106
|
Mirela Damian
|
Mirela Damian, Erik Demaine, Robin Flatland and Joseph O'Rourke
|
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement
|
22 pages, 10 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that every orthogonal polyhedron of genus at most 2 can be unfolded
without overlap while using only a linear number of orthogonal cuts (parallel
to the polyhedron edges). This is the first result on unfolding general
orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the
existence of at most 2 special leaves in what we call the "unfolding tree"
(which ties back to the genus), so unfolding polyhedra of genus 3 and beyond
requires new techniques.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 02:09:38 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Damian",
"Mirela",
""
],
[
"Demaine",
"Erik",
""
],
[
"Flatland",
"Robin",
""
],
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.985604 |
1611.00289
|
Geoffrey Messier
|
Mohamed Gaafar, and Geoffrey G Messier
|
Petroleum Refinery Multi-Antenna Propagation Measurements
| null | null |
10.1109/LAWP.2015.2509641
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the results of the first multi- antenna propagation
measurement campaign to be conducted at an operating petroleum refining
facility. The measurement equipment transmits pseudo-random noise test signals
from two antennas at a 2.47 GHz carrier with a signal bandwidth of
approximately 25 MHz. The measurement data is analyzed to extract path loss
exponent, shadowing distribution, fading distribution, coherence bandwidth and
antenna correlation. The results reveal an environment where large scale
attenuation is relatively mild, fading is severe and good performance is
expected from both antenna and frequency diversity.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 16:27:31 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Gaafar",
"Mohamed",
""
],
[
"Messier",
"Geoffrey G",
""
]
] |
new_dataset
| 0.955207 |
1611.00291
|
Vikram Krishnamurthy
|
Vikram Krishnamurthy and Anup Aprem and Sujay Bhatt
|
Opportunistic Advertisement Scheduling in Live Social Media: A Multiple
Stopping Time POMDP Approach
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Live online social broadcasting services like YouTube Live and Twitch have
steadily gained popularity due to improved bandwidth, ease of generating
content and the ability to earn revenue on the generated content. In contrast
to traditional cable television, revenue in online services is generated solely
through advertisements, and depends on the number of clicks generated. Channel
owners aim to opportunistically schedule advertisements so as to generate
maximum revenue. This paper considers the problem of optimal scheduling of
advertisements in live online social media. The problem is formulated as a
multiple stopping problem and is addressed in a partially observed Markov
decision process (POMDP) framework. Structural results are provided on the
optimal advertisement scheduling policy. By exploiting the structure of the
optimal policy, best linear thresholds are computed using stochastic
approximation. The proposed model and framework are validated on real datasets,
and the following observations are made: (i) The policy obtained by the
multiple stopping problem can be used to detect changes in ground truth from
online search data (ii) Numerical results show a significant improvement in the
expected revenue by opportunistically scheduling the advertisements. The
revenue can be improved by $20-30\%$ in comparison to currently employed
periodic scheduling.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 16:48:10 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Krishnamurthy",
"Vikram",
""
],
[
"Aprem",
"Anup",
""
],
[
"Bhatt",
"Sujay",
""
]
] |
new_dataset
| 0.962678 |
1611.00331
|
Ayush Pandey
|
Ayush Pandey, Subhamoy Mahajan, Adarsh Kosta, Dhananjay Yadav, Vikas
Pandey, Saurav Sahay, Siddharth Jha, Shubh Agarwal, Aashay Bhise, Raushan
Kumar, Aniket Bhushan, Vraj Parikh, Ankit Lohani, Saurabh Dash, Himanshu
Choudhary, Rahul Kumar, Anurag Sharma, Arnab Mondal, Chendika Karthik Sai, P
N Vamshi
|
Low Cost Autonomous Navigation and Control of a Mechanically Balanced
Bicycle with Dual Locomotion Mode
|
Published in the International Transportation Electrification
Conference (ITEC) in 2015 organized by IEEE Industrial Application Society
(IAS) and SAE India in Chennai, India
|
ITEC India, Publication Year : 2015. Pages 1 - 10
|
10.1109/ITEC-India.2015.7386938
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On the lines of the huge and varied efforts in the field of automation with
respect to technology development and innovation of vehicles to make them run
autonomously, this paper presents an innovation to a bicycle. A normal daily
use bicycle was modified at low cost such that it runs autonomously, while
maintaining its original form i.e. the manual drive. Hence, a bicycle which
could be normally driven by any human and with a press of switch could run
autonomously according to the needs of the user has been developed.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 18:51:27 GMT"
}
] | 2016-11-02T00:00:00 |
[
[
"Pandey",
"Ayush",
""
],
[
"Mahajan",
"Subhamoy",
""
],
[
"Kosta",
"Adarsh",
""
],
[
"Yadav",
"Dhananjay",
""
],
[
"Pandey",
"Vikas",
""
],
[
"Sahay",
"Saurav",
""
],
[
"Jha",
"Siddharth",
""
],
[
"Agarwal",
"Shubh",
""
],
[
"Bhise",
"Aashay",
""
],
[
"Kumar",
"Raushan",
""
],
[
"Bhushan",
"Aniket",
""
],
[
"Parikh",
"Vraj",
""
],
[
"Lohani",
"Ankit",
""
],
[
"Dash",
"Saurabh",
""
],
[
"Choudhary",
"Himanshu",
""
],
[
"Kumar",
"Rahul",
""
],
[
"Sharma",
"Anurag",
""
],
[
"Mondal",
"Arnab",
""
],
[
"Sai",
"Chendika Karthik",
""
],
[
"Vamshi",
"P N",
""
]
] |
new_dataset
| 0.99816 |
1510.01419
|
Abbas Razaghpanah
|
Abbas Razaghpanah, Narseo Vallina-Rodriguez, Srikanth Sundaresan,
Christian Kreibich, Phillipa Gill, Mark Allman, Vern Paxson
|
Haystack: A Multi-Purpose Mobile Vantage Point in User Space
|
13 pages incl. figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite our growing reliance on mobile phones for a wide range of daily
tasks, their operation remains largely opaque. A number of previous studies
have addressed elements of this problem in a partial fashion, trading off
analytic comprehensiveness and deployment scale. We overcome the barriers to
large-scale deployment (e.g., requiring rooted devices) and comprehensiveness
of previous efforts by taking a novel approach that leverages the VPN API on
mobile devices to design Haystack, an in-situ mobile measurement platform that
operates exclusively on the device, providing full access to the device's
network traffic and local context without requiring root access. We present the
design of Haystack and its implementation in an Android app that we deploy via
standard distribution channels. Using data collected from 450 users of the app,
we exemplify the advantages of Haystack over the state of the art and
demonstrate its seamless experience even under demanding conditions. We also
demonstrate its utility to users and researchers in characterizing mobile
traffic and privacy risks.
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 03:34:04 GMT"
},
{
"version": "v2",
"created": "Tue, 17 May 2016 14:46:40 GMT"
},
{
"version": "v3",
"created": "Sat, 29 Oct 2016 15:45:30 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Razaghpanah",
"Abbas",
""
],
[
"Vallina-Rodriguez",
"Narseo",
""
],
[
"Sundaresan",
"Srikanth",
""
],
[
"Kreibich",
"Christian",
""
],
[
"Gill",
"Phillipa",
""
],
[
"Allman",
"Mark",
""
],
[
"Paxson",
"Vern",
""
]
] |
new_dataset
| 0.998257 |
1601.07122
|
Prasanth K. P.
|
S. B. Balaji, K. P. Prasanth and P. Vijay Kumar
|
Binary Codes with Locality for Multiple Erasures Having Short Block
Length
|
17 pages, submitted to ISIT 2016
| null |
10.1109/ISIT.2016.7541380
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The focus of this paper is on linear, binary codes with locality having
locality parameter $r$, that are capable of recovering from $t\geq 2$ erasures
and that moreover, have short block length. Both sequential and parallel
(through orthogonal parity checks) recovery is considered here. In the case of
parallel repair, minimum-block-length constructions for general $t$ are
discussed. In the case of sequential repair, the results include (a) extending
and characterizing minimum-block-length constructions for $t=2$, (b) providing
improved bounds on block length for $t=3$ as well as a general construction for
$t=3$ having short block length, (c) providing short-block-length constructions
for general $r,t$ and (d) providing high-rate constructions for $r=2$ and $t$
in the range $4 \leq t \leq7$. Most of the constructions provided are of binary
codes.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2016 18:09:36 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jan 2016 18:47:46 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Feb 2016 12:25:49 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Balaji",
"S. B.",
""
],
[
"Prasanth",
"K. P.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.960891 |
1603.03315
|
Dimitris Papamichail
|
Dimitris Papamichail, Angela Huang, Andrew Miller, Edward Kennedy,
Jan-Lucas Ott, Georgios Papamichail
|
Most Compact Parsimonious Trees
|
7 pages, 4 figures, 1 table, submitted for peer review
| null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Construction of phylogenetic trees has traditionally focused on binary trees
where all species appear on leaves, a problem for which numerous efficient
solutions have been developed. Certain application domains though, such as
viral evolution and transmission, paleontology, linguistics, and phylogenetic
stemmatics, often require phylogeny inference that involves placing input
species on ancestral tree nodes (live phylogeny), and polytomies. These
requirements, despite their prevalence, lead to computationally harder
algorithmic solutions and have been sparsely examined in the literature to
date. In this article we prove some unique properties of most parsimonious live
phylogenetic trees with polytomies, and describe novel algorithms to find the
such trees without resorting to exhaustive enumeration of all possible tree
topologies.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 16:17:33 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Oct 2016 15:41:52 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Papamichail",
"Dimitris",
""
],
[
"Huang",
"Angela",
""
],
[
"Miller",
"Andrew",
""
],
[
"Kennedy",
"Edward",
""
],
[
"Ott",
"Jan-Lucas",
""
],
[
"Papamichail",
"Georgios",
""
]
] |
new_dataset
| 0.998828 |
1605.05757
|
Menglong Ye
|
Menglong Ye, Edward Johns, Benjamin Walter, Alexander Meining,
Guang-Zhong Yang
|
Robust Image Descriptors for Real-Time Inter-Examination Retargeting in
Gastrointestinal Endoscopy
|
This paper was presented in MICCAI 2016 conference, and a DOI was
linked to the publisher's version
| null |
10.1007/978-3-319-46720-7_52
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For early diagnosis of malignancies in the gastrointestinal tract,
surveillance endoscopy is increasingly used to monitor abnormal tissue changes
in serial examinations of the same patient. Despite successes with optical
biopsy for in vivo and in situ tissue characterisation, biopsy retargeting for
serial examinations is challenging because tissue may change in appearance
between examinations. In this paper, we propose an inter-examination
retargeting framework for optical biopsy, based on an image descriptor designed
for matching between endoscopic scenes over significant time intervals. Each
scene is described by a hierarchy of regional intensity comparisons at various
scales, offering tolerance to long-term change in tissue appearance whilst
remaining discriminative. Binary coding is then used to compress the descriptor
via a novel random forests approach, providing fast comparisons in Hamming
space and real-time retargeting. Extensive validation conducted on 13 in vivo
gastrointestinal videos, collected from six patients, show that our approach
outperforms state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 21:07:35 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Oct 2016 12:19:12 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Ye",
"Menglong",
""
],
[
"Johns",
"Edward",
""
],
[
"Walter",
"Benjamin",
""
],
[
"Meining",
"Alexander",
""
],
[
"Yang",
"Guang-Zhong",
""
]
] |
new_dataset
| 0.964281 |
1607.02937
|
Gabriel Gon\c{c}alves
|
Gabriel Resende Gon\c{c}alves, Sirlene Pio Gomes da Silva, David
Menotti, William Robson Schwartz
|
Benchmark for License Plate Character Segmentation
|
32 pages, single column
|
J. Electron. Imaging. 25(5), 053034 (Oct 24, 2016)
|
10.1117/1.JEI.25.5.053034
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic License Plate Recognition (ALPR) has been the focus of many
researches in the past years. In general, ALPR is divided into the following
problems: detection of on-track vehicles, license plates detection, segmention
of license plate characters and optical character recognition (OCR). Even
though commercial solutions are available for controlled acquisition
conditions, e.g., the entrance of a parking lot, ALPR is still an open problem
when dealing with data acquired from uncontrolled environments, such as roads
and highways when relying only on imaging sensors. Due to the multiple
orientations and scales of the license plates captured by the camera, a very
challenging task of the ALPR is the License Plate Character Segmentation (LPCS)
step, which effectiveness is required to be (near) optimal to achieve a high
recognition rate by the OCR. To tackle the LPCS problem, this work proposes a
novel benchmark composed of a dataset designed to focus specifically on the
character segmentation step of the ALPR within an evaluation protocol.
Furthermore, we propose the Jaccard-Centroid coefficient, a new evaluation
measure more suitable than the Jaccard coefficient regarding the location of
the bounding box within the ground-truth annotation. The dataset is composed of
2,000 Brazilian license plates consisting of 14,000 alphanumeric symbols and
their corresponding bounding box annotations. We also present a new
straightforward approach to perform LPCS efficiently. Finally, we provide an
experimental evaluation for the dataset based on four LPCS approaches and
demonstrate the importance of character segmentation for achieving an accurate
OCR.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 13:32:19 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Oct 2016 16:11:21 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Gonçalves",
"Gabriel Resende",
""
],
[
"da Silva",
"Sirlene Pio Gomes",
""
],
[
"Menotti",
"David",
""
],
[
"Schwartz",
"William Robson",
""
]
] |
new_dataset
| 0.999821 |
1610.09480
|
Manuel Mazzara
|
Dilshat Salikhov, Kevin Khanda, Kamill Gusmanov, Manuel Mazzara,
Nikolaos Mavridis
|
Microservice-based IoT for Smart Buildings
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large percentage of buildings in domestic or special-purpose is expected to
become increasingly "smarter" in the future, due to the immense benefits in
terms of energy saving, safety, flexibility, and comfort, that relevant new
technologies offer. As concerns hardware, software, or platform level, however,
no clearly dominant standards currently exist. Such standards, would ideally,
fulfill a number of important desiderata, which are to be touched upon in this
paper. Here, we will present a prototype platform for supporting multiple
concurrent applications for smart buildings, which is utilizing an advanced
sensor network as well as a distributed microservices architecture, centrally
featuring the Jolie programming language. The architecture and benefits of our
system are discussed, as well as a prototype containing a number of nodes and a
user interface, deployed in a real-world academic building environment. Our
results illustrate the promising nature of our approach, as well as open
avenues for future work towards its wider and larger scale applicability.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 09:51:50 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Salikhov",
"Dilshat",
""
],
[
"Khanda",
"Kevin",
""
],
[
"Gusmanov",
"Kamill",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Mavridis",
"Nikolaos",
""
]
] |
new_dataset
| 0.998481 |
1610.09511
|
Nalin Asanka Gamagedara Arachchilage
|
Nalin Asanka Gamagedara Arachchilage
|
Serious Games for Cyber Security Education
|
244, LAP LAMBERT Academic Publishing, 2016
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Phishing is an online identity theft that aims to steal sensitive information
such as username, passwords and online banking details from its victims.
Phishing education needs to be considered as a means to combat this threat.
This book focuses on a design and development of a mobile game prototype as an
educational tool helping computer users to protect themselves against phishing
attacks. The elements of a game design framework for avoiding phishing attacks
were used to address the game design issues. The mobile game design aimed to
enhance the user's avoidance behaviour through motivation to protect themselves
against phishing threats. A think-aloud study was conducted, along with a pre-
and post-test, to assess the game design framework through the developed mobile
game prototype. The study results showed a significant improvement of
participants' phishing avoidance behaviour in their post-test assessment.
Furthermore, the study findings suggest that participants' threat perception,
safeguard effectiveness, self-efficacy, perceived severity and perceived
susceptibility elements positively impact threat avoidance behaviour, whereas
safeguard cost had a negative impact on it.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 13:56:16 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Arachchilage",
"Nalin Asanka Gamagedara",
""
]
] |
new_dataset
| 0.995516 |
1610.09513
|
Daniel Neil
|
Daniel Neil, Michael Pfeiffer, and Shih-Chii Liu
|
Phased LSTM: Accelerating Recurrent Network Training for Long or
Event-based Sequences
|
Selected for an oral presentation at NIPS, 2016
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recurrent Neural Networks (RNNs) have become the state-of-the-art choice for
extracting patterns from temporal sequences. However, current RNN models are
ill-suited to process irregularly sampled data triggered by events generated in
continuous time by sensors or other neurons. Such data can occur, for example,
when the input comes from novel event-driven artificial sensors that generate
sparse, asynchronous streams of events or from multiple conventional sensors
with different update intervals. In this work, we introduce the Phased LSTM
model, which extends the LSTM unit by adding a new time gate. This gate is
controlled by a parametrized oscillation with a frequency range that produces
updates of the memory cell only during a small percentage of the cycle. Even
with the sparse updates imposed by the oscillation, the Phased LSTM network
achieves faster convergence than regular LSTMs on tasks which require learning
of long sequences. The model naturally integrates inputs from sensors of
arbitrary sampling rates, thereby opening new areas of investigation for
processing asynchronous sensory events that carry timing information. It also
greatly improves the performance of LSTMs in standard RNN applications, and
does so with an order-of-magnitude fewer computes at runtime.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 14:05:10 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Neil",
"Daniel",
""
],
[
"Pfeiffer",
"Michael",
""
],
[
"Liu",
"Shih-Chii",
""
]
] |
new_dataset
| 0.998146 |
1610.09516
|
Sanjaya Wijeratne
|
Lakshika Balasuriya, Sanjaya Wijeratne, Derek Doran, Amit Sheth
|
Finding Street Gang Members on Twitter
|
8 pages, 9 figures, 2 tables, Published as a full paper at 2016
IEEE/ACM International Conference on Advances in Social Networks Analysis and
Mining (ASONAM 2016)
|
The 2016 IEEE/ACM Int. Conf. on Advances in Social Networks
Analysis and Mining. vol. 8, pp. 685-692. San Francisco, CA, USA (2016)
| null | null |
cs.SI cs.CL cs.CY cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most street gang members use Twitter to intimidate others, to present
outrageous images and statements to the world, and to share recent illegal
activities. Their tweets may thus be useful to law enforcement agencies to
discover clues about recent crimes or to anticipate ones that may occur.
Finding these posts, however, requires a method to discover gang member Twitter
profiles. This is a challenging task since gang members represent a very small
population of the 320 million Twitter users. This paper studies the problem of
automatically finding gang members on Twitter. It outlines a process to curate
one of the largest sets of verifiable gang member profiles that have ever been
studied. A review of these profiles establishes differences in the language,
images, YouTube links, and emojis gang members use compared to the rest of the
Twitter population. Features from this review are used to train a series of
supervised classifiers. Our classifier achieves a promising F1 score with a low
false positive rate.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 14:30:57 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Balasuriya",
"Lakshika",
""
],
[
"Wijeratne",
"Sanjaya",
""
],
[
"Doran",
"Derek",
""
],
[
"Sheth",
"Amit",
""
]
] |
new_dataset
| 0.964878 |
1610.09606
|
Wulin Zou
|
Wulin Zou, Zhuo Yang, Wen Tan, Meng Wang, Jingtai Liu, Ningbo Yu
|
Impedance control of a cable-driven series elastic actuator with the
2-DOF control structure
|
6 pages, IROS2016, Accepted
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Series elastic actuators (SEAs) are growingly important in physical
human-robot interaction (HRI) due to their inherent safety and compliance.
Cable-driven SEAs also allow flexible installation and remote torque
transmission, etc. However, there are still challenges for the impedance
control of cable-driven SEAs, such as the reduced bandwidth caused by the
elastic component, and the performance balance between reference tracking and
robustness. In this paper, a velocity sourced cable-driven SEA has been set up.
Then, a stabilizing 2 degrees of freedom (2-DOF) control approach was designed
to separately pursue the goals of robustness and torque tracking. Further, the
impedance control structure for human-robot interaction was designed and
implemented with a torque compensator. Both simulation and practical
experiments have validated the efficacy of the 2-DOF method for the control of
cable-driven SEAs.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2016 05:38:39 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Zou",
"Wulin",
""
],
[
"Yang",
"Zhuo",
""
],
[
"Tan",
"Wen",
""
],
[
"Wang",
"Meng",
""
],
[
"Liu",
"Jingtai",
""
],
[
"Yu",
"Ningbo",
""
]
] |
new_dataset
| 0.984514 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.