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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1502.07565
|
Xiaofu Wu Dr
|
Xiaofu Wu, Zhen Yan, Cong Ling, Xiang-Gen Xia
|
Artificial-Noise-Aided Physical Layer Phase Challenge-Response
Authentication for Practical OFDM Transmission
|
33 pages, 13 figures, submitted for possible publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, we have developed a PHYsical layer Phase Challenge-Response
Authentication Scheme (PHY-PCRAS) for independent multicarrier transmission. In
this paper, we make a further step by proposing a novel artificial-noise-aided
PHY-PCRAS (ANA-PHY-PCRAS) for practical orthogonal frequency division
multiplexing (OFDM) transmission, where the Tikhonov-distributed artificial
noise is introduced to interfere with the phase-modulated key for resisting
potential key-recovery attacks whenever a static channel between two legitimate
users is unfortunately encountered. Then, we address various practical issues
for ANA-PHY-PCRAS with OFDM transmission, including correlation among
subchannels, imperfect carrier and timing recoveries. Among them, we show that
the effect of sampling offset is very significant and a search procedure in the
frequency domain should be incorporated for verification. With practical OFDM
transmission, the number of uncorrelated subchannels is often not sufficient.
Hence, we employ a time-separated approach for allocating enough subchannels
and a modified ANA-PHY-PCRAS is proposed to alleviate the discontinuity of
channel phase at far-separated time slots. Finally, the key equivocation is
derived for the worst case scenario. We conclude that the enhanced security of
ANA-PHY-PCRAS comes from the uncertainty of both the wireless channel and
introduced artificial noise, compared to the traditional challenge-response
authentication scheme implemented at the upper layer.
|
[
{
"version": "v1",
"created": "Thu, 26 Feb 2015 14:16:51 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Feb 2016 23:30:40 GMT"
}
] | 2016-02-19T00:00:00 |
[
[
"Wu",
"Xiaofu",
""
],
[
"Yan",
"Zhen",
""
],
[
"Ling",
"Cong",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.992307 |
1602.05925
|
Scott Purdy
|
Scott Purdy
|
Encoding Data for HTM Systems
| null | null | null | null |
cs.NE q-bio.NC
|
http://creativecommons.org/licenses/by/4.0/
|
Hierarchical Temporal Memory (HTM) is a biologically inspired machine
intelligence technology that mimics the architecture and processes of the
neocortex. In this white paper we describe how to encode data as Sparse
Distributed Representations (SDRs) for use in HTM systems. We explain several
existing encoders, which are available through the open source project called
NuPIC, and we discuss requirements for creating encoders for new types of data.
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2016 19:56:39 GMT"
}
] | 2016-02-19T00:00:00 |
[
[
"Purdy",
"Scott",
""
]
] |
new_dataset
| 0.99723 |
1209.3638
|
Josu Doncel
|
Josu Doncel, Urtzi Ayesta, Konstantine Avrachenkov, Peter Jacko
|
Congestion Control of TCP Flows in Internet Routers by Means of Index
Policy
|
To appear in Computer Networks
| null |
10.1016/j.comnet.2013.08.001
| null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we address the problem of fast and fair transmission of flows
in a router, which is a fundamental issue in networks like the Internet. We
model the interaction between a TCP source and a bottleneck queue with the
objective of designing optimal packet admission controls in the bottleneck
queue. We focus on the relaxed version of the problem obtained by relaxing the
fixed buffer capacity constraint that must be satisfied at all time epoch. The
relaxation allows us to reduce the multi-flow problem into a family of
single-flow problems, for which we can analyze both theoretically and
numerically the existence of optimal control policies of special structure. In
particular, we show that for a variety of parameters, TCP flows can be
optimally controlled in routers by so-called index policies, but not always by
threshold policies. We have also implemented index policies in Network
Simulator-3 and tested in a simple topology their applicability in real
networks. The simulation results show that the index policy covers a big range
of desirable properties with respect to fairness between different versions of
TCP models, across users with different round-trip-time and minimum buffer
required to achieve full utility of the queue.
|
[
{
"version": "v1",
"created": "Mon, 17 Sep 2012 12:42:23 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Aug 2013 14:13:08 GMT"
}
] | 2016-02-18T00:00:00 |
[
[
"Doncel",
"Josu",
""
],
[
"Ayesta",
"Urtzi",
""
],
[
"Avrachenkov",
"Konstantine",
""
],
[
"Jacko",
"Peter",
""
]
] |
new_dataset
| 0.998611 |
1406.1062
|
Gabriel Arrobo
|
Gabriel E. Arrobo, Calvin A. Perumalla, Stanley B. Hanke, Thomas P.
Ketterl, Peter J. Fabri, and Richard D. Gitlin
|
An Innovative Wireless Cardiac Rhythm Management (iCRM) System
| null | null |
10.1109/WTS.2014.6835035
| null |
cs.CE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a wireless Communicator to manage and enhance a
Cardiac Rhythm Management System. The system includes: (1) an on-body wireless
Electrocardiogram (ECG), (2) an Intracardiac Electrogram (EGM) embedded inside
an Implantable Cardioverter/Defibrillator, and (3) a Communicator (with a
resident Learning System). The first two devices are existing technology
available in the market and are emulated using data from the Physionet
database, while the Communicator was designed and implemented by our research
team. The value of the information obtained by combining the information
supplied by (1) and (2), presented to the Communicator, improves decision
making regarding use of the actuator or other actions. Preliminary results show
a high level of confidence in the decisions made by the Communicator. For
example, excellent accuracy is achieved in predicting atrial arrhythmia in 8
patients using only external ECG when we used a neural network.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2014 19:29:04 GMT"
}
] | 2016-02-18T00:00:00 |
[
[
"Arrobo",
"Gabriel E.",
""
],
[
"Perumalla",
"Calvin A.",
""
],
[
"Hanke",
"Stanley B.",
""
],
[
"Ketterl",
"Thomas P.",
""
],
[
"Fabri",
"Peter J.",
""
],
[
"Gitlin",
"Richard D.",
""
]
] |
new_dataset
| 0.992377 |
1406.1727
|
Gabriel Arrobo
|
Chao He, Yang Liu, Thomas P. Ketterl, Gabriel E. Arrobo, and Richard
D. Gitlin
|
MIMO In Vivo
|
WAMICON 2014
| null |
10.1109/WAMICON.2014.6857757
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the performance of MIMO for in vivo environments, using ANSYS HFSS
and their complete human body model, to determine the maximum data rates that
can be achieved using an IEEE 802.11n system. Due to the lossy nature of the in
vivo medium, achieving high data rates with reliable performance will be a
challenge, especially since the in vivo antenna performance is strongly
affected by near field coupling to the lossy medium and the signals levels will
be limited by specified specific absorption rate (SAR) levels. We analyzed the
bit error rate (BER) of a MIMO system with one pair of antennas placed in vivo
and the second pair placed inside and outside the body at various distances
from the in vivo antennas. The results were compared to SISO simulations and
showed that by using MIMO in vivo, significant performance gain can be
achieved, and at least two times the data rate can be supported with SAR
limited transmit power levels, making it possible to achieve target data rates
in the 100 Mbps.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2014 05:48:36 GMT"
}
] | 2016-02-18T00:00:00 |
[
[
"He",
"Chao",
""
],
[
"Liu",
"Yang",
""
],
[
"Ketterl",
"Thomas P.",
""
],
[
"Arrobo",
"Gabriel E.",
""
],
[
"Gitlin",
"Richard D.",
""
]
] |
new_dataset
| 0.996316 |
1602.05559
|
Omar Alzubi
|
Hassan Hamdoun, Jafar A. Alzubi, Omar A. Alzubi and Solomon Mangeni
|
Key Economic and Environmental Perspectives on Sustainability in the ICT
Sector
|
5 pages, 4 figures, Journal paper
|
Middle-East Journal of Scientific Research 21 (8): 1341-1345, 2014
|
10.5829/idosi.mejsr.2014.21.08.21709
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Telecommunication networks have become as critical to the 21st century
development as were railways, roads and canals, to the 19th Century
developments and is now seen as enabler to a more sustained business,
environment and society as a whole. Still fascinating has been and is the
exponential rate of growth in this industry. This is one sector where the next
revolution is always just around the corner whether known or unknown. The
telecoms industry is categorized by high rates of innovation in a rapidly
changing technological environment. This in turn is associated with an immense
range of sustainability concerns and challenges for the Telecoms service
providers, the service users and the whole industry and its far reaching
influence on other industries. This paper discusses three key aspects of such
challenges namely; the question of sustainable power/energy supply for the
industry when the change is resulting in increasing energy and operational
cost, the exploitation of technologies advancement for sustainability and their
business and environmental benefits.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2016 20:14:20 GMT"
}
] | 2016-02-18T00:00:00 |
[
[
"Hamdoun",
"Hassan",
""
],
[
"Alzubi",
"Jafar A.",
""
],
[
"Alzubi",
"Omar A.",
""
],
[
"Mangeni",
"Solomon",
""
]
] |
new_dataset
| 0.997427 |
1504.04387
|
Jennifer Golbeck
|
Jennifer Golbeck
|
Benford's Law Applies To Online Social Networks
|
9 pages, 2 figures
| null |
10.1371/journal.pone.0135169
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Benford's Law states that the frequency of first digits of numbers in
naturally occurring systems is not evenly distributed. Numbers beginning with a
1 occur roughly 30\% of the time, and are six times more common than numbers
beginning with a 9. We show that Benford's Law applies to social and behavioral
features of users in online social networks. We consider social data from five
major social networks: Facebook, Twitter, Google Plus, Pinterest, and Live
Journal. We show that the distribution of first significant digits of friend
and follower counts for users in these systems follow Benford's Law. The same
holds for the number of posts users make. We extend this to egocentric
networks, showing that friend counts among the people in an individual's social
network also follow the expected distribution. We discuss how this can be used
to detect suspicious or fraudulent activity online and to validate datasets.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 20:43:35 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Golbeck",
"Jennifer",
""
]
] |
new_dataset
| 0.998057 |
1505.01723
|
Jichang Zhao
|
Yue Hu, Jichang Zhao and Junjie Wu
|
Emoticon-based Ambivalent Expression: A Hidden Indicator for Unusual
Behaviors in Weibo
|
Data sets can be downloaded freely from www.datatang.com/data/47207
or http://pan.baidu.com/s/1mg67cbm. Any issues feel free to contact
[email protected]
| null |
10.1371/journal.pone.0147079
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent decades have witnessed online social media being a big-data window for
quantificationally testifying conventional social theories and exploring much
detailed human behavioral patterns. In this paper, by tracing the emoticon use
in Weibo, a group of hidden "ambivalent users" are disclosed for frequently
posting ambivalent tweets containing both positive and negative emotions.
Further investigation reveals that this ambivalent expression could be a novel
indicator of many unusual social behaviors. For instance, ambivalent users with
the female as the majority like to make a sound in midnights or at weekends.
They mention their close friends frequently in ambivalent tweets, which attract
more replies and thus serve as a more private communication way. Ambivalent
users also respond differently to public affairs from others and demonstrate
more interests in entertainment and sports events. Moreover, the sentiment
shift of words adopted in ambivalent tweets is more evident than usual and
exhibits a clear "negative to positive" pattern. The above observations, though
being promiscuous seemingly, actually point to the self regulation of negative
mood in Weibo, which could find its base from the emotion management theories
in sociology but makes an interesting extension to the online environment.
Finally, as an interesting corollary, ambivalent users are found connected with
compulsive buyers and turn out to be perfect targets for online marketing.
|
[
{
"version": "v1",
"created": "Thu, 7 May 2015 14:35:31 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Hu",
"Yue",
""
],
[
"Zhao",
"Jichang",
""
],
[
"Wu",
"Junjie",
""
]
] |
new_dataset
| 0.998885 |
1505.04546
|
Yukiko Yamauchi
|
Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, and Masafumi Yamashita
|
Plane Formation by Synchronous Mobile Robots in the Three Dimensional
Euclidean Space
| null | null | null | null |
cs.DC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creating a swarm of mobile computing entities frequently called robots,
agents or sensor nodes, with self-organization ability is a contemporary
challenge in distributed computing. Motivated by this, we investigate the plane
formation problem that requires a swarm of robots moving in the three
dimensional Euclidean space to land on a common plane. The robots are fully
synchronous and endowed with visual perception. But they do not have
identifiers, nor access to the global coordinate system, nor any means of
explicit communication with each other. Though there are plenty of results on
the agreement problem for robots in the two dimensional plane, for example, the
point formation problem, the pattern formation problem, and so on, this is the
first result for robots in the three dimensional space. This paper presents a
necessary and sufficient condition for fully-synchronous robots to solve the
plane formation problem that does not depend on obliviousness i.e., the
availability of local memory at robots. An implication of the result is
somewhat counter-intuitive: The robots cannot form a plane from most of the
semi-regular polyhedra, while they can form a plane from every regular
polyhedron (except a regular icosahedron), whose symmetry is usually considered
to be higher than any semi-regular polyhedrdon.
|
[
{
"version": "v1",
"created": "Mon, 18 May 2015 08:15:12 GMT"
},
{
"version": "v2",
"created": "Sun, 24 May 2015 07:49:26 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Feb 2016 10:20:45 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Yamauchi",
"Yukiko",
""
],
[
"Uehara",
"Taichi",
""
],
[
"Kijima",
"Shuji",
""
],
[
"Yamashita",
"Masafumi",
""
]
] |
new_dataset
| 0.988932 |
1601.01199
|
Lutz Bornmann Dr.
|
Andreas Thor, Werner Marx, Loet Leydesdorff, Lutz Bornmann
|
Introducing CitedReferencesExplorer (CRExplorer): A program for
Reference Publication Year Spectroscopy with Cited References Standardization
|
Accepted for publication in the Journal of Informetrics
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new tool - the CitedReferencesExplorer (CRExplorer,
www.crexplorer.net) - which can be used to disambiguate and analyze the cited
references (CRs) of a publication set downloaded from the Web of Science (WoS).
The tool is especially suitable to identify those publications which have been
frequently cited by the researchers in a field and thereby to study for example
the historical roots of a research field or topic. CRExplorer simplifies the
identification of key publications by enabling the user to work with both a
graph for identifying most frequently cited reference publication years (RPYs)
and the list of references for the RPYs which have been most frequently cited.
A further focus of the program is on the standardization of CRs. It is a
serious problem in bibliometrics that there are several variants of the same CR
in the WoS. In this study, CRExplorer is used to study the CRs of all papers
published in the Journal of Informetrics. The analyses focus on the most
important papers published between 1980 and 1990.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 14:56:59 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Feb 2016 10:13:31 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Thor",
"Andreas",
""
],
[
"Marx",
"Werner",
""
],
[
"Leydesdorff",
"Loet",
""
],
[
"Bornmann",
"Lutz",
""
]
] |
new_dataset
| 0.997672 |
1602.02358
|
Haohan Zhu
|
Haohan Zhu, Xianrui Meng and George Kollios
|
NED: An Inter-Graph Node Metric Based On Edit Distance
| null | null | null | null |
cs.DB cs.LG cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Node similarity is a fundamental problem in graph analytics. However, node
similarity between nodes in different graphs (inter-graph nodes) has not
received a lot of attention yet. The inter-graph node similarity is important
in learning a new graph based on the knowledge of an existing graph (transfer
learning on graphs) and has applications in biological, communication, and
social networks. In this paper, we propose a novel distance function for
measuring inter-graph node similarity with edit distance, called NED. In NED,
two nodes are compared according to their local neighborhood structures which
are represented as unordered k-adjacent trees, without relying on labels or
other assumptions. Since the computation problem of tree edit distance on
unordered trees is NP-Complete, we propose a modified tree edit distance,
called TED*, for comparing neighborhood trees. TED* is a metric distance, as
the original tree edit distance, but more importantly, TED* is polynomially
computable. As a metric distance, NED admits efficient indexing, provides
interpretable results, and shows to perform better than existing approaches on
a number of data analysis tasks, including graph de-anonymization. Finally, the
efficiency and effectiveness of NED are empirically demonstrated using
real-world graphs.
|
[
{
"version": "v1",
"created": "Sun, 7 Feb 2016 11:00:03 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Feb 2016 21:14:57 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Feb 2016 04:24:07 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Zhu",
"Haohan",
""
],
[
"Meng",
"Xianrui",
""
],
[
"Kollios",
"George",
""
]
] |
new_dataset
| 0.997744 |
1602.04841
|
Matthew Howard
|
R. B. Ribas Manero and J. Grewal and B. Michael and A. Shafti and K.
Althoefer and J. Ll. Ribas Fernandez and M. J. Howard
|
Wearable Embroidered Muscle Activity Sensing Device for the Human Upper
Leg
|
Preprint submitted to IEEE-EMBC 2016
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Within the last decade, running has become one of the most popular physical
activities in the world. Although the benefits of running are numerous, there
is a risk of Running Related Injuries (RRI) of the lower extremities.
Electromyography (EMG) techniques have previously been used to study causes of
RRIs, but the complexity of this technology limits its use to a laboratory
setting. As running is primarily an outdoors activity, this lack of technology
acts as a barrier to the study of RRIs in natural environments. This study
presents a minimally invasive wearable muscle sensing device consisting of
jogging leggings with embroidered surface EMG (sEMG) electrodes capable of
recording muscle activity data of the quadriceps group. To test the use of the
device, a proof of concept study consisting of $N=2$ runners performing a set
of $5km$ running trials is presented in which the effect of running surfaces on
muscle fatigue, a potential cause of RRIs, is evaluated. Results show that
muscle fatigue can be analysed from the sEMG data obtained through the wearable
device, and that running on soft surfaces (such as sand) may increase the
likelihood of suffering from RRIs.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 21:23:09 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Manero",
"R. B. Ribas",
""
],
[
"Grewal",
"J.",
""
],
[
"Michael",
"B.",
""
],
[
"Shafti",
"A.",
""
],
[
"Althoefer",
"K.",
""
],
[
"Fernandez",
"J. Ll. Ribas",
""
],
[
"Howard",
"M. J.",
""
]
] |
new_dataset
| 0.998286 |
1602.04878
|
Clayton Davis
|
Clayton A Davis, Julia Heiman, Erick Janssen, Stephanie Sanders,
Justin Garcia, Filippo Menczer
|
Kinsey Reporter: Citizen Science for Sex Research
|
Let's Talk About Sex (Apps) Workshop at CSCW 2015
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Kinsey Reporter is a global mobile app to share, explore, and visualize
anonymous data about sex. Reports are submitted via smartphone, then visualized
on a website or downloaded for offline analysis. In this paper we present the
major features of the Kinsey Reporter citizen science platform designed to
preserve the anonymity of its contributors, and preliminary data analyses that
suggest questions for future research.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2016 01:07:32 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Davis",
"Clayton A",
""
],
[
"Heiman",
"Julia",
""
],
[
"Janssen",
"Erick",
""
],
[
"Sanders",
"Stephanie",
""
],
[
"Garcia",
"Justin",
""
],
[
"Menczer",
"Filippo",
""
]
] |
new_dataset
| 0.998384 |
1602.05134
|
Nicholas Rotella
|
Nicholas Rotella, Sean Mason, Stefan Schaal and Ludovic Righetti
|
Inertial Sensor-Based Humanoid Joint State Estimation
|
Accepted to International Conference on Robotics and Automation
(ICRA) 2016
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents methods for the determination of a humanoid robot's joint
velocities and accelerations directly from link-mounted Inertial Measurement
Units (IMUs) each containing a three-axis gyroscope and a three-axis
accelerometer. No information about the global pose of the floating base or its
links is required and precise knowledge of the link IMU poses is not necessary
due to presented calibration routines. Additionally, a filter is introduced to
fuse gyroscope angular velocities with joint position measurements and
compensate the computed joint velocities for time-varying gyroscope biases. The
resulting joint velocities are subject to less noise and delay than filtered
velocities computed from numerical differentiation of joint potentiometer
signals, leading to superior performance in joint feedback control as
demonstrated in experiments performed on a SARCOS hydraulic humanoid.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2016 18:43:43 GMT"
}
] | 2016-02-17T00:00:00 |
[
[
"Rotella",
"Nicholas",
""
],
[
"Mason",
"Sean",
""
],
[
"Schaal",
"Stefan",
""
],
[
"Righetti",
"Ludovic",
""
]
] |
new_dataset
| 0.999413 |
1501.04344
|
Dmitry Zakablukov
|
Dmitry V. Zakablukov
|
Asymptotic bounds of depth for a reversible circuit consisting of NOT,
CNOT and 2-CNOT gates
|
In Russian, 14 pages, 4 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper discusses the asymptotic depth of a reversible circuit consisting
of NOT, CNOT and 2-CNOT gates. Reversible circuit depth function $D(n, q)$ for
a circuit implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb
Z_2^n$ is introduced as a function of $n$ and the number of additional inputs
$q$. It is proved that for the case of implementing a permutation from
$A(\mathbb Z_2^n)$ with a reversible circuit having no additional inputs the
depth is bounded as $D(n, 0) \gtrsim 2^n / (3\log_2 n)$. It is proved that for
the case of implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb
Z_2^n$ with a reversible circuit having $q_0 \sim 2^n$ additional inputs the
depth is bounded as $D(n, q_0) \lesssim 3n$.
|
[
{
"version": "v1",
"created": "Sun, 18 Jan 2015 20:39:52 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Feb 2016 10:11:01 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Zakablukov",
"Dmitry V.",
""
]
] |
new_dataset
| 0.990984 |
1507.01981
|
Wei Quan Lim
|
Wei Quan Lim, Seth Gilbert, Wei Zhong Lim
|
Dynamic Reallocation Problems in Scheduling
|
29 pages; updated references and other minor changes
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we look at the problem of scheduling tasks on a
single-processor system, where each task requires unit time and must be
scheduled within a certain time window, and each task can be added to or
removed from the system at any time. On each operation, the system is allowed
to reschedule any tasks, but the goal is to minimize the number of rescheduled
tasks. Our main result is an allocator that maintains a valid schedule for all
tasks in the system if their time windows have constant size and reschedules
O(1/{\epsilon}*log(1/{\epsilon})) tasks on each insertion as {\epsilon}->0,
where {\epsilon} is a certain measure of the schedule flexibility of the
system. We also show that it is optimal for any allocator that works on
arbitrary instances. We also briefly mention a few variants of the problem,
such as if the tasks have time windows of difference sizes, for which we have
an allocator that we conjecture reschedules only 1 task on each insertion if
the schedule flexibility remains above a certain threshold.
|
[
{
"version": "v1",
"created": "Tue, 7 Jul 2015 22:28:39 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Feb 2016 18:07:17 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Lim",
"Wei Quan",
""
],
[
"Gilbert",
"Seth",
""
],
[
"Lim",
"Wei Zhong",
""
]
] |
new_dataset
| 0.997034 |
1510.07246
|
Anne-Kathrin Schmuck
|
Anne-Kathrin Schmuck, Rupak Majumdar
|
Dynamic Hierarchical Reactive Controller Synthesis
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the formal approach to reactive controller synthesis, a symbolic
controller for a possibly hybrid system is obtained by algorithmically
computing a winning strategy in a two-player game. Such game-solving algorithms
scale poorly as the size of the game graph increases. However, in many
applications, the game graph has a natural hierarchical structure. In this
paper, we propose a modeling formalism and a synthesis algorithm that exploits
this hierarchical structure for more scalable synthesis.
We define local games on hierarchical graphs as a modeling formalism which
decomposes a large-scale reactive synthesis problem in two dimensions. First,
the construction of a hierarchical game graph introduces abstraction layers,
where each layer is again a two-player game graph. Second, every such layer is
decomposed into multiple local game graphs, each corresponding to a node in the
higher level game graph. While local games have the potential to reduce the
state space for controller synthesis, they lead to more complex synthesis
problems where strategies computed for one local game can impose additional
requirements on lower-level local games.
Our second contribution is a procedure to construct a dynamic controller for
local game graphs over hierarchies. The controller computes assume-admissible
winning strategies that satisfy local specifications in the presence of
environment assumptions, and dynamically updates specifications and strategies
due to interactions between games at different abstraction layers at each step
of the play. We show that our synthesis procedure is sound: the controller
constructs a play which satisfies all local specifications. We illustrate our
results through an example controlling an autonomous robot in a known,
multistory building.
|
[
{
"version": "v1",
"created": "Sun, 25 Oct 2015 13:46:40 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Feb 2016 15:37:39 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Schmuck",
"Anne-Kathrin",
""
],
[
"Majumdar",
"Rupak",
""
]
] |
new_dataset
| 0.997897 |
1602.04210
|
Mohammed Al-Maqri
|
Mohammed A. Al-Maqri, Mohamed Othman, Borhanuddin Mohd Ali, Zurina
Mohd Hanapi
|
Adaptive Multi-polling Scheduler for QoS Support of Video Transmission
in IEEE 802.11e WLANs
|
arXiv admin note: text overlap with arXiv:1602.03699,
arXiv:1602.03886
| null |
10.1007/s11235-015-0020-y
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 802.11E Task Group has been established to enhance Quality of Service
(QoS) provision for time-bounded services in the current IEEE 802.11 Medium
Access Control (MAC) protocol. The QoS is introduced throughout Hybrid
Coordination Function Controlled Channel Access (HCCA) for the rigorous QoS
provision. In HCCA, the station is allocated a fixed Transmission Opportunity
(TXOP) based on its TSPEC parameters so that it is efficient for Constant Bit
Rate streams. However, as the profile of Variable Bit Rate (VBR) traffics is
inconstant, they are liable to experience a higher delay especially in bursty
traffic case. In this paper, we present a dynamic TXOP assignment algorithm
called Adaptive Multi-polling TXOP scheduling algorithm (AMTXOP) for supporting
the video traffics transmission over IEEE 802.11e wireless networks. This
scheme invests a piggybacked information about the size of the subsequent video
frames of the uplink streams to assist the Hybrid Coordinator accurately assign
the TXOP according to actual change in the traffic profile. The proposed
scheduler is powered by integrating multi-polling scheme to further reduce the
delay and polling overhead. Extensive simulation experiments have been carried
out to show the efficiency of the AMTXOP over the existing schemes in terms of
the packet delay and the channel utilization.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 05:09:11 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Al-Maqri",
"Mohammed A.",
""
],
[
"Othman",
"Mohamed",
""
],
[
"Ali",
"Borhanuddin Mohd",
""
],
[
"Hanapi",
"Zurina Mohd",
""
]
] |
new_dataset
| 0.991586 |
1602.04281
|
Nicholas Bolten
|
Nicholas Bolten, Amirhossein Amini, Yun Hao, Vaishnavi Ravichandran,
Andre Stephens, Anat Caspi
|
Urban sidewalks: visualization and routing for individuals with limited
mobility
| null | null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People with limited mobility in the U.S. (defined as having difficulty or
inability to walk a quarter of a mile without help and without the use of
special equipment) face a growing informational gap: while pedestrian routing
algorithms are getting faster and more informative, planning a route with a
wheeled device in urban centers is very difficult due to lack of integrated
pertinent information regarding accessibility along the route. Moreover,
reducing access to street-spaces translates to reduced access to other public
information and services that are increasingly made available to the public
along urban streets. To adequately plan a commute, a traveler with limited or
wheeled mobility must know whether her path may be blocked by construction,
whether the sidewalk would be too steep or rendered unusable due to poor
conditions, whether the street can be crossed or a highway is blocking the way,
or whether there is a sidewalk at all. These details populate different
datasets in many modern municipalities, but they are not immediately available
in a convenient, integrated format to be useful to people with limited
mobility. Our project, AccessMap, in its first phase (v.1) overlayed the
information that is most relevant to people with limited mobility on a map,
enabling self-planning of routes. Here, we describe the next phase of the
project: synthesizing commonly available open data (including streets,
sidewalks, curb ramps, elevation data, and construction permit information) to
generate a graph of paths to enable variable cost-function accessible routing.
|
[
{
"version": "v1",
"created": "Sat, 13 Feb 2016 03:42:17 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Bolten",
"Nicholas",
""
],
[
"Amini",
"Amirhossein",
""
],
[
"Hao",
"Yun",
""
],
[
"Ravichandran",
"Vaishnavi",
""
],
[
"Stephens",
"Andre",
""
],
[
"Caspi",
"Anat",
""
]
] |
new_dataset
| 0.987844 |
1602.04294
|
Cristian-Ioan Vasile
|
Cristian-Ioan Vasile, Derya Aksaray, Calin Belta
|
Time Window Temporal Logic
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces time window temporal logic (TWTL), a rich expressivity
language for describing various time bounded specifications. In particular, the
syntax and semantics of TWTL enable the compact representation of serial tasks,
which are typically seen in robotics and control applications. This paper also
discusses the relaxation of TWTL formulae with respect to deadlines of tasks.
Efficient automata-based frameworks to solve synthesis, verification and
learning problems are also presented. The key ingredient to the presented
solution is an algorithm to translate a TWTL formula to an annotated finite
state automaton that encodes all possible temporal relaxations of the
specification. Case studies illustrating the expressivity of the logic and the
proposed algorithms are included.
|
[
{
"version": "v1",
"created": "Sat, 13 Feb 2016 07:10:59 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Vasile",
"Cristian-Ioan",
""
],
[
"Aksaray",
"Derya",
""
],
[
"Belta",
"Calin",
""
]
] |
new_dataset
| 0.999487 |
1602.04376
|
Fahad Muhammad
|
Muhammad Fahad
|
BPCMont: Business Process Change Management Ontology
|
5 pages, 7 Figures
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Change management for evolving collaborative business process development is
crucial when the business logic, transections and workflow change due to
changes in business strategies or organizational and technical environment.
During the change implementation, business processes are analyzed and improved
ensuring that they capture the proposed change and they do not contain any
undesired functionalities or change side-effects. This paper presents Business
Process Change Management approach for the efficient and effective
implementation of change in the business process. The key technology behind our
approach is our proposed Business Process Change Management Ontology (BPCMont)
which is the main contribution of this paper. BPCMont, as a formalized change
specification, helps to revert BP into a consistent state in case of system
crash, intermediate conflicting stage or unauthorized change done, aid in
change traceability in the new and old versions of business processes, change
effects can be seen and estimated effectively, ease for Stakeholders to
validate and verify change implementation, etc.
|
[
{
"version": "v1",
"created": "Sat, 13 Feb 2016 20:27:44 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Fahad",
"Muhammad",
""
]
] |
new_dataset
| 0.998644 |
1602.04568
|
Bruno Woltzenlogel Paleo
|
John Slaney, Bruno Woltzenlogel Paleo
|
Conflict Resolution: a First-Order Resolution Calculus with Decision
Literals and Conflict-Driven Clause Learning
| null | null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper defines the (first-order) conflict resolution calculus: an
extension of the resolution calculus inspired by techniques used in modern
SAT-solvers. The resolution inference is restricted to (first-order)
unit-propagation and the calculus is extended with a mechanism for assuming
decision literals and a new inference rule for clause learning, which is a
first-order generalization of the propositional conflict-driven clause learning
(CDCL) procedure. The calculus is sound (because it can be simulated by natural
deduction) and refutationally complete (because it can simulate resolution),
and these facts are proven in detail here.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 06:28:53 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Slaney",
"John",
""
],
[
"Paleo",
"Bruno Woltzenlogel",
""
]
] |
new_dataset
| 0.999393 |
1602.04629
|
Andres Garcia-Saavedra
|
Ismael Gomez-Miguelez, Andres Garcia-Saavedra, Paul D. Sutton, Pablo
Serrano, Cristina Cano, Douglas J. Leith
|
srsLTE: An Open-Source Platform for LTE Evolution and Experimentation
|
7 pages, 5 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Testbeds are essential for experimental evaluation as well as for product
development. In the context of LTE networks, existing testbed platforms are
limited either in functionality and/or extensibility or are too complex to
modify and customise. In this work we present srsLTE, an open-source platform
for LTE experimentation designed for maximum modularity and code reuse and
fully compliant with LTE Release 8. We show the potential of the srsLTE library
by extending the baseline code to allow LTE transmissions in the unlicensed
bands and coexistence with WiFi. We also expand previous results on this
emerging research area by showing how different vendor-specific mechanisms in
WiFi cards might affect coexistence.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 11:10:43 GMT"
}
] | 2016-02-16T00:00:00 |
[
[
"Gomez-Miguelez",
"Ismael",
""
],
[
"Garcia-Saavedra",
"Andres",
""
],
[
"Sutton",
"Paul D.",
""
],
[
"Serrano",
"Pablo",
""
],
[
"Cano",
"Cristina",
""
],
[
"Leith",
"Douglas J.",
""
]
] |
new_dataset
| 0.999643 |
1602.03886
|
Mohammed Al-Maqri
|
Mohammed A. Al-Maqri, Mohamed Othman, Borhanuddin Mohd Ali, Zurina
Mohd Hanapi
|
Providing Dynamic TXOP for QoS Support of Video Transmission in IEEE
802.11e WLANs
|
arXiv admin note: substantial text overlap with arXiv:1602.03699
| null |
10.4304/jnw.10.9.501-511
| null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe)
enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access
(HCCA). The scheduler of HCCA allocates Transmission Opportunities (TXOPs) to
QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated
at the traffic setup time so that it is only efficient for Constant Bit Rate
(CBR) applications. However, Variable Bit Rate (VBR) traffics are not
efficiently supported as they exhibit nondeterministic profile during the time.
In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for
supporting the video traffics transmission over IEEE 802.11e wireless networks.
This algorithm uses a piggybacked information about the size of the subsequent
video frames of the uplink traffic to assist the Hybrid Coordinator accurately
assign the TXOP according to the fast changes in the VBR profile. The proposed
scheduling algorithm has been evaluated using simulation with different
variability level video streams. The simulation results show that the proposed
algorithm reduces the delay experienced by VBR traffic streams comparable to
HCCA scheduler due to the accurate assignment of the TXOP which preserve the
channel time for transmission.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 13:34:14 GMT"
}
] | 2016-02-15T00:00:00 |
[
[
"Al-Maqri",
"Mohammed A.",
""
],
[
"Othman",
"Mohamed",
""
],
[
"Ali",
"Borhanuddin Mohd",
""
],
[
"Hanapi",
"Zurina Mohd",
""
]
] |
new_dataset
| 0.99884 |
1602.03929
|
Nalin Asanka Gamagedara Arachchilage
|
Nalin Asanka Gamagedara Arachchilage and Melissa Cole
|
Designing a Mobile Game for Home Computer Users to Protect Against
Phishing Attacks
|
8 in International Journal for e-Learning Security (IJeLS), Volume 1,
Issue 1/2, March/June 2011. arXiv admin note: substantial text overlap with
arXiv:1511.07093
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research aims to design an educational mobile game for home computer
users to prevent from phishing attacks. Phishing is an online identity theft
which aims to steal sensitive information such as username, password and online
banking details from victims. To prevent this, phishing education needs to be
considered. Mobile games could facilitate to embed learning in a natural
environment. The paper introduces a mobile game design based on a story which
is simplifying and exaggerating real life. We use a theoretical model derived
from Technology Threat Avoidance Theory (TTAT) to address the game design
issues and game design principles were used as a set of guidelines for
structuring and presenting information. The overall mobile game design was
aimed to enhance avoidance behaviour through motivation of home computer users
to protect against phishing threats. The prototype game design is presented on
Google App Inventor Emulator. We believe by training home computer users to
protect against phishing attacks, would be an aid to enable the cyberspace as a
secure environment.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 00:01:14 GMT"
}
] | 2016-02-15T00:00:00 |
[
[
"Arachchilage",
"Nalin Asanka Gamagedara",
""
],
[
"Cole",
"Melissa",
""
]
] |
new_dataset
| 0.995553 |
1602.03960
|
Sujay Kumar Jauhar
|
Sujay Kumar Jauhar, Peter Turney and Eduard Hovy
|
TabMCQ: A Dataset of General Knowledge Tables and Multiple-choice
Questions
|
Keywords: Data, General Knowledge, Tables, Question Answering, MCQ,
Crowd-sourcing, Mechanical Turk
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe two new related resources that facilitate modelling of general
knowledge reasoning in 4th grade science exams. The first is a collection of
curated facts in the form of tables, and the second is a large set of
crowd-sourced multiple-choice questions covering the facts in the tables.
Through the setup of the crowd-sourced annotation task we obtain implicit
alignment information between questions and tables. We envisage that the
resources will be useful not only to researchers working on question answering,
but also to people investigating a diverse range of other applications such as
information extraction, question parsing, answer type identification, and
lexical semantic modelling.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 03:54:43 GMT"
}
] | 2016-02-15T00:00:00 |
[
[
"Jauhar",
"Sujay Kumar",
""
],
[
"Turney",
"Peter",
""
],
[
"Hovy",
"Eduard",
""
]
] |
new_dataset
| 0.999654 |
1012.1288
|
Dohan Kim
|
Dohan Kim
|
Representations of task assignments in distributed systems using Young
tableaux and symmetric groups
|
This is an Accepted Manuscript of an article published by Taylor &
Francis Group in International Journal of Parallel, Emergent and Distributed
Systems on 02/02/2015, available online:
http://dx.doi.org/10.1080/17445760.2014.997729
|
International Journal of Parallel, Emergent and Distributed
Systems 31 (2016): 152-175
|
10.1080/17445760.2014.997729
| null |
cs.DC math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel approach to representing task assignments for
partitioned agents (respectively, tasks) in distributed systems. A partition of
agents (respectively, tasks) is represented by a Young tableau, which is one of
the main tools in studying symmetric groups and combinatorics. In this paper we
propose a task, agent, and assignment tableau in order to represent a task
assignment for partitioned agents (respectively, tasks) in a distributed
system. This paper is concerned with representations of task assignments rather
than finding approximate or near optimal solutions for task assignments. A
Young tableau approach allows us to raise the expressiveness of partitioned
agents (respectively, tasks) and their task assignments.
|
[
{
"version": "v1",
"created": "Mon, 6 Dec 2010 19:16:18 GMT"
},
{
"version": "v2",
"created": "Sun, 10 Jul 2011 13:45:44 GMT"
},
{
"version": "v3",
"created": "Sun, 25 Sep 2011 18:56:53 GMT"
},
{
"version": "v4",
"created": "Wed, 1 May 2013 15:33:15 GMT"
},
{
"version": "v5",
"created": "Thu, 11 Feb 2016 04:05:41 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Kim",
"Dohan",
""
]
] |
new_dataset
| 0.971841 |
1311.2505
|
Giuliano La Guardia Gadioli
|
Giuliano G. La Guardia
|
On optimal constacyclic codes
|
arXiv admin note: text overlap with arXiv:1310.3265. Accepted for
publishing in Linear Algebra and its Applications
| null | null | null |
cs.IT math-ph math.IT math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the class of constacyclic codes, which is a
natural generalization of the class of cyclic and negacyclic codes. This class
of codes is interesting in the sense that it contains codes with good or even
optimal parameters. In this light, we propose constructions of families of
classical block and convolutional maximum-distance-separable (MDS) constacyclic
codes, as well as families of asymmetric quantum MDS codes derived from
(classical-block) constacyclic codes. These results are mainly derived from the
investigation of suitable properties on cyclotomic cosets of these
corresponding codes.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 17:14:54 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Feb 2016 15:13:12 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"La Guardia",
"Giuliano G.",
""
]
] |
new_dataset
| 0.998914 |
1507.04452
|
Junil Choi
|
Junil Choi and Jianhua Mo and Robert W. Heath Jr
|
Near Maximum-Likelihood Detector and Channel Estimator for Uplink
Multiuser Massive MIMO Systems with One-Bit ADCs
|
13 pages, 8 figures, 2 tables, submitted to IEEE Transactions on
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In massive multiple-input multiple-output (MIMO) systems, it may not be power
efficient to have a high-resolution analog-to-digital converter (ADC) for each
antenna element. In this paper, a near maximum likelihood (nML) detector for
uplink multiuser massive MIMO systems is proposed where each antenna is
connected to a pair of one-bit ADCs, i.e., one for each real and imaginary
component of the baseband signal. The exhaustive search over all the possible
transmitted vectors required in the original maximum likelihood (ML) detection
problem is relaxed to formulate an ML estimation problem. Then, the ML
estimation problem is converted into a convex optimization problem which can be
efficiently solved. Using the solution, the base station can perform simple
symbol-by-symbol detection for the transmitted signals from multiple users. To
further improve detection performance, we also develop a two-stage nML detector
that exploits the structures of both the original ML and the proposed
(one-stage) nML detectors. Numerical results show that the proposed nML
detectors are efficient enough to simultaneously support multiple uplink users
adopting higher-order constellations, e.g., 16 quadrature amplitude modulation.
Since our detectors exploit the channel state information as part of the
detection, an ML channel estimation technique with one-bit ADCs that shares the
same structure with our proposed nML detector is also developed. The proposed
detectors and channel estimator provide a complete low power solution for the
uplink of a massive MIMO system.
|
[
{
"version": "v1",
"created": "Thu, 16 Jul 2015 05:01:30 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Nov 2015 22:54:24 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Feb 2016 00:52:45 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Choi",
"Junil",
""
],
[
"Mo",
"Jianhua",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.968586 |
1512.08168
|
Kazuhiro Inaba
|
Kazuhiro Inaba
|
Quick Brown Fox in Formal Languages
| null | null | null | null |
cs.FL
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Given a finite alphabet $\Sigma$ and a deterministic finite automaton on
$\Sigma$, the problem of determining whether the language recognized by the
automaton contains any pangram is \NP-complete. Various other language classes
and problems around pangrams are analyzed.
|
[
{
"version": "v1",
"created": "Sun, 27 Dec 2015 03:55:18 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jan 2016 13:00:47 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Jan 2016 09:23:20 GMT"
},
{
"version": "v4",
"created": "Fri, 5 Feb 2016 15:52:15 GMT"
},
{
"version": "v5",
"created": "Thu, 11 Feb 2016 00:31:08 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Inaba",
"Kazuhiro",
""
]
] |
new_dataset
| 0.997523 |
1602.03097
|
Jos Wetzels
|
Jos Wetzels
|
Open Sesame: The Password Hashing Competition and Argon2
|
17 pages
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In this document we present an overview of the background to and goals of the
Password Hashing Competition (PHC) as well as the design of its winner, Argon2,
and its security requirements and properties.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 18:39:20 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Feb 2016 12:30:02 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Wetzels",
"Jos",
""
]
] |
new_dataset
| 0.997984 |
1602.03586
|
Ross Atkins
|
Ross Atkins and Puck Rombach and Fiona Skerman
|
Guessing Numbers of Odd Cycles
|
16 pages
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a given number of colours, $s$, the guessing number of a graph is the
base $s$ logarithm of the size of the largest family of colourings of the
vertex set of the graph such that the colour of each vertex can be determined
from the colours of the vertices in its neighbourhood. An upper bound for the
guessing number of the $n$-vertex cycle graph $C_n$ is $n/2$. It is known that
the guessing number equals $n/2$ whenever $n$ is even or $s$ is a perfect
square \cite{Christofides2011guessing}. We show that, for any given integer
$s\geq 2$, if $a$ is the largest factor of $s$ less than or equal to
$\sqrt{s}$, for sufficiently large odd $n$, the guessing number of $C_n$ with
$s$ colours is $(n-1)/2 + \log_s(a)$. This answers a question posed by
Christofides and Markstr\"{o}m in 2011 \cite{Christofides2011guessing}. We also
present an explicit protocol which achieves this bound for every $n$. Linking
this to index coding with side information, we deduce that the information
defect of $C_n$ with $s$ colours is $(n+1)/2 - \log_s(a)$ for sufficiently
large odd $n$. Our results are a generalisation of the $s=2$ case which was
proven in \cite{bar2011index}.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 00:53:50 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Atkins",
"Ross",
""
],
[
"Rombach",
"Puck",
""
],
[
"Skerman",
"Fiona",
""
]
] |
new_dataset
| 0.996145 |
1602.03643
|
Mikael Mortensen
|
Mikael Mortensen and Kristian Valen-Sendstad
|
Oasis: a high-level/high-performance open source Navier-Stokes solver
| null |
Computer Physics Communications, Volume 188, p 177-188, 2015
|
10.1016/j.cpc.2014.10.026
| null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Oasis is a high-level/high-performance finite element Navier-Stokes solver
written from scratch in Python using building blocks from the FEniCS project
(fenicsproject.org). The solver is unstructured and targets large-scale
applications in complex geometries on massively parallel clusters. Oasis
utilizes MPI and interfaces, through FEniCS, to the linear algebra backend
PETSc. Oasis advocates a high-level, programmable user interface through the
creation of highly flexible Python modules for new problems. Through the
high-level Python interface the user is placed in complete control of every
aspect of the solver. A version of the solver, that is using piecewise linear
elements for both velocity and pressure, is shown reproduce very well the
classical, spectral, turbulent channel simulations of Moser, Kim and Mansour at
$Re_{\tau}=180$ [Phys. Fluids, vol 11(4), p. 964]. The computational speed is
strongly dominated by the iterative solvers provided by the linear algebra
backend, which is arguably the best performance any similar implicit solver
using PETSc may hope for. Higher order accuracy is also demonstrated and new
solvers may be easily added within the same framework.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 08:56:43 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Mortensen",
"Mikael",
""
],
[
"Valen-Sendstad",
"Kristian",
""
]
] |
new_dataset
| 0.996991 |
1602.03706
|
Behzad Mirkhanzadeh
|
Behzad Mirkhanzadeh, Naeim Taheri, Siyavash Khorsandi
|
SDxVPN: A Software-Defined Solution for VPN Service Providers
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BGP/MPLS IP VPN and VPLS services are considered to be widely used in IP/MPLS
networks for connecting customers' remote sites. However, service providers
struggle with many challenges to provide these services. Management complexity,
equipment costs, and last but not least, scalability issues emerging as the
customers increase in number, are just some of these problems. Software-defined
networking (SDN) is an emerging paradigm that can solve aforementioned issues
using a logically centralized controller for network devices. In this paper, we
propose a SDN-based solution called SDxVPN which considerably lowers the
complexity of VPN service definition and management. Our method eliminates
complex and costly device interactions that used to be done through several
control plane protocols and enables customers to determine their service
specifications, define restriction policies and even interconnect with other
customers automatically without operator's intervention. We describe our
prototype implementation of SDxVPN and its scalability evaluations under
several representative scenarios. The results indicate the effectiveness of the
proposed solution for deployment to provide large scale VPN services.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 12:46:31 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Mirkhanzadeh",
"Behzad",
""
],
[
"Taheri",
"Naeim",
""
],
[
"Khorsandi",
"Siyavash",
""
]
] |
new_dataset
| 0.99906 |
1602.03722
|
Kai-Uwe Schmidt
|
Kai-Uwe Schmidt
|
Sequences with small correlation
|
Survey paper, 32 pages
|
Des. Codes Cryptogr. 78(1), 237-267, 2016
| null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The extent to which a sequence of finite length differs from a shifted
version of itself is measured by its aperiodic autocorrelations. Of particular
interest are sequences whose entries are 1 or -1, called binary sequences, and
sequences whose entries are complex numbers of unit magnitude, called
unimodular sequences. Since the 1950s, there is sustained interest in sequences
with small aperiodic autocorrelations relative to the sequence length. One of
the main motivations is that a sequence with small aperiodic autocorrelations
is intrinsically suited for the separation of signals from noise, and therefore
has natural applications in digital communications. This survey reviews the
state of knowledge concerning the two central problems in this area: How small
can the aperiodic autocorrelations of a binary or a unimodular sequence
collectively be and how can we efficiently find the best such sequences? Since
the analysis and construction of sequences with small aperiodic
autocorrelations is closely tied to the (often much easier) analysis of
periodic autocorrelation properties, several fundamental results on
corresponding problems in the periodic setting are also reviewed.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 13:25:17 GMT"
}
] | 2016-02-12T00:00:00 |
[
[
"Schmidt",
"Kai-Uwe",
""
]
] |
new_dataset
| 0.962914 |
1512.02385
|
Yigit Ugur
|
Yigit Ugur, Zohaib Hassan Awan and Aydin Sezgin
|
Cloud Radio Access Networks with Coded Caching
|
5 pages, 3 figures, WSA 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cloud radio access network (C-RAN) is considered as a candidate to meet the
expectations of higher data rate de- mands in wireless networks. In C-RAN, low
energy base stations (BSs) are deployed over a small geography and are allowed
to connect to the cloud via finite capacity backhaul links where the
information is processed. A conventional C-RAN, however, requires high capacity
backhaul links, since the requested files need to be transferred first from the
cloud to the BS before conveying them to the users. One approach to overcome
the limitations of the backhaul links is to introduce local storage caches at
the BSs, in which the popular files are stored locally in order to reduce the
load of the backhaul links. Furthermore, we utilize coded caching with the goal
to minimize the total network cost, i.e., the transmit power and the cost
associated with the backhaul links. The initial formulation of the optimization
problem for this model is non-convex. We first reformulate and then convexify
the problem through some relaxation techniques. In comparison to the uncoded
caching at the BSs, our results highlight the benefits associated with coded
caching and show that it decreases the backhaul cost.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 09:56:03 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Feb 2016 11:13:11 GMT"
}
] | 2016-02-11T00:00:00 |
[
[
"Ugur",
"Yigit",
""
],
[
"Awan",
"Zohaib Hassan",
""
],
[
"Sezgin",
"Aydin",
""
]
] |
new_dataset
| 0.980676 |
1602.02744
|
Emanuel Gluskin
|
Emanuel Gluskin
|
The physical and circuit-theoretic significance of the Memristor : Full
version
|
23 pages, 6 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is observed that the inductive and capacitive features of the memristor
reflect (and are a quintessence of) such features of any resistor. The very
presence of the voltage and current state variables, associated by their
electrodynamics sense with electrical and magnetic fields, in the resistive
characteristic v = f(i), forces any resister to accumulate some magnetic and
electrostatic fields and energies around itself, i.e. L and C elements are
always present. From the circuit-theoretic point of view, the role of the
memristor is seen, first of all, in the elimination of the use of a unique
v(i). This makes circuits with hysteresis characteristics relevant, and also
suggests that the concept of memristor should influence the basic problem of
definition of nonlinearity. Since the memristor mainly originates from the
resistor, it was found necessary to overview some unusual cases of resistive
circuits. The present opinion is that the framework of basic circuit theory and
its connection with applications should be logically expanded in order to
naturally include the new element.
|
[
{
"version": "v1",
"created": "Sun, 7 Feb 2016 11:52:56 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Feb 2016 16:37:43 GMT"
}
] | 2016-02-11T00:00:00 |
[
[
"Gluskin",
"Emanuel",
""
]
] |
new_dataset
| 0.997255 |
1510.08883
|
Vitaly Skachek
|
Hui Zhang and Vitaly Skachek
|
Bounds for Batch Codes with Restricted Query Size
|
Submitted to ISIT 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present new upper bounds on the parameters of batch codes with restricted
query size. These bounds are an improvement on the Singleton bound. The
techniques for derivations of these bounds are based on the ideas in the
literature for codes with locality. By employing additional ideas, we obtain
further improvements, which are specific for batch codes.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2015 20:22:40 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Feb 2016 12:19:14 GMT"
}
] | 2016-02-10T00:00:00 |
[
[
"Zhang",
"Hui",
""
],
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.999856 |
1602.02831
|
Brian Butler
|
Brian K. Butler
|
Minimum Distances of the QC-LDPC Codes in IEEE 802 Communication
Standards
|
Submitted to IEEE ISIT 2016. 5 pages, 2 figures, and 7 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work applies earlier results on Quasi-Cyclic (QC) LDPC codes to the
codes specified in six separate IEEE 802 standards, specifying wireless
communications from 54 MHz to 60 GHz. First, we examine the weight matrices
specified to upper bound the codes' minimum distance independent of block
length. Next, we search for the minimum distance achieved for the parity check
matrices selected at each block length. Finally, solutions to the computational
challenges encountered are addressed.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2016 01:03:03 GMT"
}
] | 2016-02-10T00:00:00 |
[
[
"Butler",
"Brian K.",
""
]
] |
new_dataset
| 0.998314 |
1602.02982
|
Olve Mo
|
Bjorn Gustavsen and Olve Mo
|
Variable Transmission Voltage for Loss Minimization in Long Offshore
Wind Farm AC Export Cables
|
To be submitted to IEEE Transactions on Power Delivery
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Connection of offshore wind farms to shore requires the use of submarine
cables. In the case of long HVAC connections, the capacitive charging currents
limit the transfer capability and lead to high losses. This paper shows that
the losses can be substantially reduced by continuously adjusting the cable
operating voltage according to the instantaneous wind farm power
production.Calculations for a 320 MW windfarm connected to shore via a 200 km
cable at 220 kV nominal voltage shows that an annual loss reduction of 9
percent is achievable by simply using a 15 percent tap changer voltage
regulation on the two transformers. Allowing a larger voltage regulation range
leads to further loss reduction (13 percent for 0.4-1.0 p.u. voltage range). If
the windfarm has a low utilization factor, the loss reduction potential is
demonstrated to be as high as 21 percent . The methodology can be applied
without introducing new technology that needs to be developed or qualified.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2016 13:44:03 GMT"
}
] | 2016-02-10T00:00:00 |
[
[
"Gustavsen",
"Bjorn",
""
],
[
"Mo",
"Olve",
""
]
] |
new_dataset
| 0.996876 |
1602.03084
|
Jing Wang
|
Jing Wang, Zhiyuan Yan, Hongmei Xie
|
Local Codes with Cooperative Repair in Distributed Storage System
| null | null | null | null |
cs.IT cs.DC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, the research on local repair codes is mainly confined to repair the
failed nodes within each repair group. But if the extreme cases occur that the
entire repair group has failed, the local code stored in the failed group need
to be recovered as a whole. In this paper, local codes with cooperative repair,
in which the local codes are constructed based on minimum storage regeneration
(MSR) codes, is proposed to achieve repairing the failed groups. Specifically,
the proposed local codes with cooperative repair construct a kind of mutual
interleaving structure among the parity symbols, that the parity symbols of
each local code, named as distributed local parity, can be generated by the
parity symbols of the MSR codes in its two adjacent local codes. Taking
advantage of the structure given, the failed local groups can be repaired
cooperatively by their adjacent local groups with lower repair locality, and
meanwhile the minimum distance of local codes with cooperative repair is
derived. Theoretical analysis and simulation experiments show that, compared
with codes with local regeneration (such as MSR-local codes and MBR-local
codes), the proposed local codes with cooperative repair have benefits in
bandwidth overhead and repair locality for the case of local groups failure.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2016 17:26:26 GMT"
}
] | 2016-02-10T00:00:00 |
[
[
"Wang",
"Jing",
""
],
[
"Yan",
"Zhiyuan",
""
],
[
"Xie",
"Hongmei",
""
]
] |
new_dataset
| 0.995715 |
1203.1450
|
Barak Pearlmutter
|
Alexey Radul and Barak A. Pearlmutter and Jeffrey Mark Siskind
|
AD in Fortran, Part 2: Implementation via Prepreprocessor
| null |
Recent Advances in Algorithmic Differentiation, Springer Lecture
Notes in Computational Science and Engineering volume 87, 2012, ISBN
978-3-642-30022-6, pages 273-284
|
10.1007/978-3-642-30023-3_25
| null |
cs.PL cs.MS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an implementation of the Farfel Fortran AD extensions. These
extensions integrate forward and reverse AD directly into the programming
model, with attendant benefits to flexibility, modularity, and ease of use. The
implementation we describe is a "prepreprocessor" that generates input to
existing Fortran-based AD tools. In essence, blocks of code which are targeted
for AD by Farfel constructs are put into subprograms which capture their
lexical variable context, and these are closure-converted into top-level
subprograms and specialized to eliminate EXTERNAL arguments, rendering them
amenable to existing AD preprocessors, which are then invoked, possibly
repeatedly if the AD is nested.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 12:16:30 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Mar 2012 09:56:48 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Radul",
"Alexey",
""
],
[
"Pearlmutter",
"Barak A.",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.997777 |
1408.5780
|
Aditya Ramamoorthy
|
Oktay Olmez and Aditya Ramamoorthy
|
Fractional repetition codes with flexible repair from combinatorial
designs
|
27 pages in IEEE two-column format. IEEE Transactions on Information
Theory (to appear)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractional repetition (FR) codes are a class of regenerating codes for
distributed storage systems with an exact (table-based) repair process that is
also uncoded, i.e., upon failure, a node is regenerated by simply downloading
packets from the surviving nodes. In our work, we present constructions of FR
codes based on Steiner systems and resolvable combinatorial designs such as
affine geometries, Hadamard designs and mutually orthogonal Latin squares. The
failure resilience of our codes can be varied in a simple manner. We construct
codes with normalized repair bandwidth ($\beta$) strictly larger than one;
these cannot be obtained trivially from codes with $\beta = 1$. Furthermore, we
present the Kronecker product technique for generating new codes from existing
ones and elaborate on their properties. FR codes with locality are those where
the repair degree is smaller than the number of nodes contacted for
reconstructing the stored file. For these codes we establish a tradeoff between
the local repair property and failure resilience and construct codes that meet
this tradeoff. Much of prior work only provided lower bounds on the FR code
rate. In our work, for most of our constructions we determine the code rate for
certain parameter ranges.
|
[
{
"version": "v1",
"created": "Mon, 25 Aug 2014 14:52:00 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Feb 2016 17:25:02 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Olmez",
"Oktay",
""
],
[
"Ramamoorthy",
"Aditya",
""
]
] |
new_dataset
| 0.998463 |
1410.4772
|
Euripides Markou
|
Shantanu Das, Flaminia L. Luccio, Euripides Markou
|
Mobile Agents Rendezvous in spite of a Malicious Agent
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine the problem of rendezvous, i.e., having multiple mobile agents
gather in a single node of the network. Unlike previous studies, we need to
achieve rendezvous in presence of a very powerful adversary, a malicious agent
that moves through the network and tries to block the honest agents and
prevents them from gathering. The malicious agent is assumed to be arbitrarily
fast, has full knowledge of the network and it cannot be exterminated by the
honest agents. On the other hand, the honest agents are assumed to be quite
weak: They are asynchronous and anonymous, they have only finite memory, they
have no prior knowledge of the network and they can communicate with the other
agents only when they meet at a node. Can the honest agents achieve rendezvous
starting from an arbitrary configuration in spite of the malicious agent? We
present some necessary conditions for solving rendezvous in spite of the
malicious agent in arbitrary networks. We then focus on the ring and mesh
topologies and provide algorithms to solve rendezvous. For ring networks, our
algorithms solve rendezvous in all feasible instances of the problem, while we
show that rendezvous is impossible for an even number of agents in unoriented
rings. For the oriented mesh networks, we prove that the problem can be solved
when the honest agents initially form a connected configuration without holes
if and only if they can see which are the occupied nodes within a two-hops
distance. To the best of our knowledge, this is the first attempt to study such
a powerful and mobile fault model, in the context of mobile agents. Our model
lies between the more powerful but static fault model of black holes (which can
even destroy the agents), and the less powerful but mobile fault model of
Byzantine agents (which can only imitate the honest agents but can neither harm
nor stop them).
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 15:50:46 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Feb 2016 19:18:59 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Das",
"Shantanu",
""
],
[
"Luccio",
"Flaminia L.",
""
],
[
"Markou",
"Euripides",
""
]
] |
new_dataset
| 0.998492 |
1507.05724
|
Chen Chen
|
Chen Chen and Daniele Enrico Asoni and David Barrera and George
Danezis and Adrian Perrig
|
HORNET: High-speed Onion Routing at the Network Layer
|
14 pages, 5 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present HORNET, a system that enables high-speed end-to-end anonymous
channels by leveraging next generation network architectures. HORNET is
designed as a low-latency onion routing system that operates at the network
layer thus enabling a wide range of applications. Our system uses only
symmetric cryptography for data forwarding yet requires no per-flow state on
intermediate nodes. This design enables HORNET nodes to process anonymous
traffic at over 93 Gb/s. HORNET can also scale as required, adding minimal
processing overhead per additional anonymous channel. We discuss design and
implementation details, as well as a performance and security evaluation.
|
[
{
"version": "v1",
"created": "Tue, 21 Jul 2015 06:51:44 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Feb 2016 09:15:48 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Feb 2016 10:04:30 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Chen",
"Chen",
""
],
[
"Asoni",
"Daniele Enrico",
""
],
[
"Barrera",
"David",
""
],
[
"Danezis",
"George",
""
],
[
"Perrig",
"Adrian",
""
]
] |
new_dataset
| 0.999102 |
1602.02238
|
Daniele Quercia
|
Giovanni Quattrone, Davide Proserpio, Daniele Quercia, Licia Capra,
Mirco Musolesi
|
Who Benefits from the "Sharing" Economy of Airbnb?
|
In Proceedings of the 26th International ACM Conference on World Wide
Web (WWW), 2016
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sharing economy platforms have become extremely popular in the last few
years, and they have changed the way in which we commute, travel, and borrow
among many other activities. Despite their popularity among consumers, such
companies are poorly regulated. For example, Airbnb, one of the most successful
examples of sharing economy platform, is often criticized by regulators and
policy makers. While, in theory, municipalities should regulate the emergence
of Airbnb through evidence-based policy making, in practice, they engage in a
false dichotomy: some municipalities allow the business without imposing any
regulation, while others ban it altogether. That is because there is no
evidence upon which to draft policies. Here we propose to gather evidence from
the Web. After crawling Airbnb data for the entire city of London, we find out
where and when Airbnb listings are offered and, by matching such listing
information with census and hotel data, we determine the socio-economic
conditions of the areas that actually benefit from the hospitality platform.
The reality is more nuanced than one would expect, and it has changed over the
years. Airbnb demand and offering have changed over time, and traditional
regulations have not been able to respond to those changes. That is why,
finally, we rely on our data analysis to envision regulations that are
responsive to real-time demands, contributing to the emerging idea of
"algorithmic regulation".
|
[
{
"version": "v1",
"created": "Sat, 6 Feb 2016 11:19:51 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Quattrone",
"Giovanni",
""
],
[
"Proserpio",
"Davide",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Capra",
"Licia",
""
],
[
"Musolesi",
"Mirco",
""
]
] |
new_dataset
| 0.963297 |
1602.02396
|
Wouter Bokslag
|
Wouter Bokslag
|
The problem of popular primes: Logjam
|
9 pages, 1 figures
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-sa/4.0/
|
This paper will discuss the Logjam attack on TLS. The Logjam attack allows,
under certain conditions, to defeat the security provided by TLS. This is done
by manipulating server and client into using weak and deprecated export grade
crypto, and subsequently breaking the Diffie-Hellman key exchange. We explore
how the attack works conceptually and how exactly TLS is vulnerable to this
attack. Also, the conditions under which the attack can be mounted are
discussed, and an estimate of the impact of the attack is presented. Lastly,
several mitigations are presented.
|
[
{
"version": "v1",
"created": "Sun, 7 Feb 2016 17:48:20 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Bokslag",
"Wouter",
""
]
] |
new_dataset
| 0.977394 |
1602.02506
|
Thomas Steiner
|
Thomas Steiner
|
Wikipedia Tools for Google Spreadsheets
|
4 pages, 3 Listings, 4 figures
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce the Wikipedia Tools for Google Spreadsheets.
Google Spreadsheets is part of a free, Web-based software office suite offered
by Google within its Google Docs service. It allows users to create and edit
spreadsheets online, while collaborating with other users in realtime.
Wikipedia is a free-access, free-content Internet encyclopedia, whose content
and data is available, among other means, through an API. With the Wikipedia
Tools for Google Spreadsheets, we have created a toolkit that facilitates
working with Wikipedia data from within a spreadsheet context. We make these
tools available as open-source on GitHub
[https://github.com/tomayac/wikipedia-tools-for-google-spreadsheets], released
under the permissive Apache 2.0 license.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 09:40:43 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Steiner",
"Thomas",
""
]
] |
new_dataset
| 0.99366 |
1602.02610
|
Petr Golovach
|
R\'emy Belmonte, Fedor V. Fomin, Petr A. Golovach, and M. S. Ramanujan
|
Metric Dimension of Bounded Tree-length Graphs
| null | null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of resolving sets in a graph was introduced by Slater (1975) and
Harary and Melter (1976) as a way of uniquely identifying every vertex in a
graph. A set of vertices in a graph is a resolving set if for any pair of
vertices x and y there is a vertex in the set which has distinct distances to x
and y. A smallest resolving set in a graph is called a metric basis and its
size, the metric dimension of the graph. The problem of computing the metric
dimension of a graph is a well-known NP-hard problem and while it was known to
be polynomial time solvable on trees, it is only recently that efforts have
been made to understand its computational complexity on various restricted
graph classes. In recent work, Foucaud et al. (2015) showed that this problem
is NP-complete even on interval graphs. They complemented this result by also
showing that it is fixed-parameter tractable (FPT) parameterized by the metric
dimension of the graph. In this work, we show that this FPT result can in fact
be extended to all graphs of bounded tree-length. This includes well-known
classes like chordal graphs, AT-free graphs and permutation graphs. We also
show that this problem is FPT parameterized by the modular-width of the input
graph.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 15:40:03 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Belmonte",
"Rémy",
""
],
[
"Fomin",
"Fedor V.",
""
],
[
"Golovach",
"Petr A.",
""
],
[
"Ramanujan",
"M. S.",
""
]
] |
new_dataset
| 0.987358 |
1602.02665
|
Bruno Gon\c{c}alves
|
Johan Bollen, Bruno Gon\c{c}alves, Ingrid van de Leemput, Guangchen
Ruan
|
The happiness paradox: your friends are happier than you
|
15 pages, 3 figures, 2 tables
| null | null | null |
cs.SI cs.CL cs.HC physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most individuals in social networks experience a so-called Friendship
Paradox: they are less popular than their friends on average. This effect may
explain recent findings that widespread social network media use leads to
reduced happiness. However the relation between popularity and happiness is
poorly understood. A Friendship paradox does not necessarily imply a Happiness
paradox where most individuals are less happy than their friends. Here we
report the first direct observation of a significant Happiness Paradox in a
large-scale online social network of $39,110$ Twitter users. Our results reveal
that popular individuals are indeed happier and that a majority of individuals
experience a significant Happiness paradox. The magnitude of the latter effect
is shaped by complex interactions between individual popularity, happiness, and
the fact that users cluster assortatively by level of happiness. Our results
indicate that the topology of online social networks and the distribution of
happiness in some populations can cause widespread psycho-social effects that
affect the well-being of billions of individuals.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 17:46:18 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Bollen",
"Johan",
""
],
[
"Gonçalves",
"Bruno",
""
],
[
"van de Leemput",
"Ingrid",
""
],
[
"Ruan",
"Guangchen",
""
]
] |
new_dataset
| 0.996158 |
1602.02695
|
Michel Raynal
|
Achour Most\'efaoui (LINA), Michel Raynal (ASAP)
|
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers
in Crash-prone Systems
| null | null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Atomic registers are certainly the most basic objects of computing science.
Their implementation on top of an n-process asynchronous message-passing system
has received a lot of attention. It has been shown that t \textless{} n/2
(where t is the maximal number of processes that may crash) is a necessary and
sufficient requirement to build an atomic register on top of a crash-prone
asynchronous message-passing system. Considering such a context, this paper
presents an algorithm which implements a single-writer multi-reader atomic
register with four message types only, and where no message needs to carry
control information in addition to its type. Hence, two bits are sufficient to
capture all the control information carried by all the implementation messages.
Moreover, the messages of two types need to carry a data value while the
messages of the two other types carry no value at all. As far as we know, this
algorithm is the first with such an optimality property on the size of control
information carried by messages. It is also particularly efficient from a time
complexity point of view.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 19:06:03 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Mostéfaoui",
"Achour",
"",
"LINA"
],
[
"Raynal",
"Michel",
"",
"ASAP"
]
] |
new_dataset
| 0.998391 |
1602.02704
|
Mario Blaum
|
Mario Blaum and Steven R. Hetzler
|
Integrated Interleaved Codes as Locally Recoverable Codes: Properties
and Performance
|
24 pages, 5 figures and 3 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Considerable interest has been paid in recent literature to codes combining
local and global properties for erasure correction. Applications are in cloud
type of implementations, in which fast recovery of a failed storage device is
important, but additional protection is required in order to avoid data loss,
and in RAID type of architectures, in which total device failures coexist with
silent failures at the page or sector level in each device. Existing solutions
to these problems require in general relatively large finite fields. The
techniques of Integrated Interleaved Codes (which are closely related to
Generalized Concatenated Codes) are proposed to reduce significantly the size
of the finite field, and it is shown that when the parameters of these codes
are judiciously chosen, their performance may be competitive with the one of
codes optimizing the minimum distance.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 19:21:52 GMT"
}
] | 2016-02-09T00:00:00 |
[
[
"Blaum",
"Mario",
""
],
[
"Hetzler",
"Steven R.",
""
]
] |
new_dataset
| 0.998151 |
1006.5024
|
Jacob Biehl
|
Jacob T. Biehl, Thea Turner, Pernilla Quarfordt, Bill van Melle, Tony
Dunnigan, Gene Golovchinsky
|
MyUnity: Building Awareness and Fostering Community in the Workplace
|
This paper has been withdrawn to comply with revised corporate
policies
| null | null |
FXPAL-TR-09-021
|
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Successful collaboration depends on effective communication. Ongoing group
awareness facilitates communication by enabling workers to be more informed
about their collaborators, about their activities, and about the interpersonal
dependencies among people working together. In this paper we present MyUnity, a
new system that aids workers in building group awareness. The system uses
multiple sources, both automatic and user-provided, to report colleagues'
location, availability, current tasks, and preferred communication channels.
Information is aggregated, fused and presented as a simple presence state for
each worker. Workers can each independently control what information is
collected by the system, allowing them to participate in the system without
compromising their privacy. Results from a four-week field study show MyUnity
increased group awareness and fostered an increased sense of community in the
workplace. Results provide insights into the utility of awareness systems in
the workplace.
|
[
{
"version": "v1",
"created": "Fri, 25 Jun 2010 17:01:37 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Feb 2016 21:19:07 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Biehl",
"Jacob T.",
""
],
[
"Turner",
"Thea",
""
],
[
"Quarfordt",
"Pernilla",
""
],
[
"van Melle",
"Bill",
""
],
[
"Dunnigan",
"Tony",
""
],
[
"Golovchinsky",
"Gene",
""
]
] |
new_dataset
| 0.988728 |
1510.05216
|
Tiark Rompf
|
Tiark Rompf, Nada Amin
|
From F to DOT: Type Soundness Proofs with Definitional Interpreters
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scala's type system unifies ML modules, object-oriented, and functional
programming. The Dependent Object Types (DOT) family of calculi has been
proposed as a new foundation for Scala and similar languages. Unfortunately, it
is not clear how DOT relates to any well-known type systems, and type soundness
has only been established for very restricted subsets. In fact, important Scala
features are known to break at least one key metatheoretic property such as
environment narrowing or subtyping transitivity, which are usually required for
a type soundness proof.
First, and, perhaps surprisingly, we show how rich DOT calculi can still be
proved sound. The key insight is that narrowing and subtyping transitivity only
need to hold for runtime objects, but not for code that is never executed.
Alas, the dominant method of proving type soundness, Wright and Felleisen's
syntactic approach, is based on term rewriting, which does not a priori make a
distinction between runtime and type assignment time.
Second, we demonstrate how type soundness can be proved for advanced,
polymorphic, type systems with respect to high-level, definitional
interpreters, implemented in Coq. We present the first mechanized soundness
proof in this style for System F<: and several extensions, including mutable
references. Our proofs use only simple induction: another surprising result, as
the combination of big-step semantics, mutable references, and polymorphism is
commonly believed to require co-inductive proof techniques.
Third, we show how DOT-like calculi emerge as generalizations of F<:,
exposing a rich design space of calculi with path-dependent types which we
collectively call System D. Armed with insights from the definitional
interpreter semantics, we also show how equivalent small-step semantics and
soundness proofs in Wright-Felleisen-style can be derived for these systems.
|
[
{
"version": "v1",
"created": "Sun, 18 Oct 2015 09:53:06 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Feb 2016 21:01:58 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Rompf",
"Tiark",
""
],
[
"Amin",
"Nada",
""
]
] |
new_dataset
| 0.975324 |
1601.04967
|
Ling Liu
|
Ling Liu and Cong Ling
|
Polar Codes and Polar Lattices for Independent Fading Channels
|
22 pages, 9 figures, extended version of ISIT 2016 submission. Some
simulation results have been updated
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we design polar codes and polar lattices for i.i.d. fading
channels when the channel state information is only available to the receiver.
For the binary input case, we propose a new design of polar codes through
single-stage polarization to achieve the ergodic capacity. For the non-binary
input case, polar codes are further extended to polar lattices to achieve the
egodic Poltyrev capacity, i.e., the capacity without power limit. When the
power constraint is taken into consideration, we show that polar lattices with
lattice Gaussian shaping achieve the egodic capacity of fading channels. The
coding and shaping are both explicit, and the overall complexity of encoding
and decoding is $O(N \log^2 N)$.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2016 15:55:57 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Jan 2016 10:54:23 GMT"
},
{
"version": "v3",
"created": "Fri, 5 Feb 2016 00:32:17 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Liu",
"Ling",
""
],
[
"Ling",
"Cong",
""
]
] |
new_dataset
| 0.991901 |
1602.00981
|
Oliver Bra\v{c}evac
|
Oliver Bra\v{c}evac and Sebastian Erdweg and Guido Salvaneschi and
Mira Mezini
|
CPL: A Core Language for Cloud Computing -- Technical Report
|
Technical report accompanying the MODULARITY '16 submission
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Running distributed applications in the cloud involves deployment. That is,
distribution and configuration of application services and middleware
infrastructure. The considerable complexity of these tasks resulted in the
emergence of declarative JSON-based domain-specific deployment languages to
develop deployment programs. However, existing deployment programs unsafely
compose artifacts written in different languages, leading to bugs that are hard
to detect before run time. Furthermore, deployment languages do not provide
extension points for custom implementations of existing cloud services such as
application-specific load balancing policies.
To address these shortcomings, we propose CPL (Cloud Platform Language), a
statically-typed core language for programming both distributed applications as
well as their deployment on a cloud platform. In CPL, application services and
deployment programs interact through statically typed, extensible interfaces,
and an application can trigger further deployment at run time. We provide a
formal semantics of CPL and demonstrate that it enables type-safe, composable
and extensible libraries of service combinators, such as load balancing and
fault tolerance.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 15:48:50 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Feb 2016 19:24:30 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Bračevac",
"Oliver",
""
],
[
"Erdweg",
"Sebastian",
""
],
[
"Salvaneschi",
"Guido",
""
],
[
"Mezini",
"Mira",
""
]
] |
new_dataset
| 0.99976 |
1602.01927
|
Jamil Ahmad
|
Zanobya N. Khan, Rashid Jalal Qureshi, and Jamil Ahmad
|
On Feature based Delaunay Triangulation for Palmprint Recognition
| null |
Journal of Platform Technology, 3(4), 9-18 (2015)
| null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Authentication of individuals via palmprint based biometric system is
becoming very popular due to its reliability as it contains unique and stable
features. In this paper, we present a novel approach for palmprint recognition
and its representation. To extract the palm lines, local thresholding technique
Niblack binarization algorithm is adopted. The endpoints of these lines are
determined and a connection is created among them using the Delaunay
triangulation thereby generating a distinct topological structure of each
palmprint. Next, we extract different geometric as well as quantitative
features from the triangles of the Delaunay triangulation that assist in
identifying different individuals. To ensure that the proposed approach is
invariant to rotation and scaling, features were made relative to topological
and geometrical structure of the palmprint. The similarity of the two
palmprints is computed using the weighted sum approach and compared with the
k-nearest neighbor. The experimental results obtained reflect the effectiveness
of the proposed approach to discriminate between different palmprint images and
thus achieved a recognition rate of 90% over large databases.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2016 05:31:41 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Khan",
"Zanobya N.",
""
],
[
"Qureshi",
"Rashid Jalal",
""
],
[
"Ahmad",
"Jamil",
""
]
] |
new_dataset
| 0.966923 |
1602.02047
|
Elvys Linhares Pontes
|
Elvys Linhares Pontes
|
Utiliza\c{c}\~ao de Grafos e Matriz de Similaridade na Sumariza\c{c}\~ao
Autom\'atica de Documentos Baseada em Extra\c{c}\~ao de Frases
|
Dissertation, 83 pages, in Portuguese. in Disserta\c{c}\~ao de
Mestrado, Universidade Federal do Cear\'a, 2015
| null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The internet increased the amount of information available. However, the
reading and understanding of this information are costly tasks. In this
scenario, the Natural Language Processing (NLP) applications enable very
important solutions, highlighting the Automatic Text Summarization (ATS), which
produce a summary from one or more source texts. Automatically summarizing one
or more texts, however, is a complex task because of the difficulties inherent
to the analysis and generation of this summary. This master's thesis describes
the main techniques and methodologies (NLP and heuristics) to generate
summaries. We have also addressed and proposed some heuristics based on graphs
and similarity matrix to measure the relevance of judgments and to generate
summaries by extracting sentences. We used the multiple languages (English,
French and Spanish), CSTNews (Brazilian Portuguese), RPM (French) and DECODA
(French) corpus to evaluate the developped systems. The results obtained were
quite interesting.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2016 14:54:57 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Pontes",
"Elvys Linhares",
""
]
] |
new_dataset
| 0.963149 |
1602.02148
|
Boudhayan Gupta
|
Boudhayan Gupta
|
A replay-attack resistant message authentication scheme using time-based
keying hash functions and unique message identifiers
| null | null | null | null |
cs.CR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Hash-based message authentication codes are an extremely simple yet hugely
effective construction for producing keyed message digests using shared
secrets. HMACs have seen widespread use as ad-hoc digital signatures in many
Internet applications. While messages signed with an HMAC are secure against
sender impersonation and tampering in transit, if used alone they are
susceptible to replay attacks. We propose a construction that extends HMACs to
produce a keyed message digest that has a finite validity period. We then
propose a message signature scheme that uses this time-dependent MAC along with
an unique message identifier to calculate a set of authentication factors using
which a recipient can readily detect and ignore replayed messages, thus
providing perfect resistance against replay attacks. We further analyse
time-based message authentication codes and show that they provide stronger
security guarantees than plain HMACs, even when used independently of the
aforementioned replay attack resistant message signature scheme.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2016 20:50:53 GMT"
}
] | 2016-02-08T00:00:00 |
[
[
"Gupta",
"Boudhayan",
""
]
] |
new_dataset
| 0.991699 |
1511.02503
|
Wei Li
|
Wei Li, Mingquan Qiu, Zhencai Zhu, Bo Wu, Gongbo Zhou
|
Bearing fault diagnosis based on spectrum images of vibration signals
| null |
Measurement Science and Technology, Volume 27, Number 3, 2016
|
10.1088/0957-0233/27/3/035005
| null |
cs.CV cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bearing fault diagnosis has been a challenge in the monitoring activities of
rotating machinery, and it's receiving more and more attention. The
conventional fault diagnosis methods usually extract features from the
waveforms or spectrums of vibration signals in order to realize fault
classification. In this paper, a novel feature in the form of images is
presented, namely the spectrum images of vibration signals. The spectrum images
are simply obtained by doing fast Fourier transformation. Such images are
processed with two-dimensional principal component analysis (2DPCA) to reduce
the dimensions, and then a minimum distance method is applied to classify the
faults of bearings. The effectiveness of the proposed method is verified with
experimental data.
|
[
{
"version": "v1",
"created": "Sun, 8 Nov 2015 16:51:22 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Dec 2015 15:00:22 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jan 2016 14:30:19 GMT"
},
{
"version": "v4",
"created": "Wed, 3 Feb 2016 07:12:04 GMT"
},
{
"version": "v5",
"created": "Thu, 4 Feb 2016 01:52:35 GMT"
}
] | 2016-02-05T00:00:00 |
[
[
"Li",
"Wei",
""
],
[
"Qiu",
"Mingquan",
""
],
[
"Zhu",
"Zhencai",
""
],
[
"Wu",
"Bo",
""
],
[
"Zhou",
"Gongbo",
""
]
] |
new_dataset
| 0.999667 |
1602.01511
|
Can Xiang
|
Chunming Tang, Can Xiang, Keqin Feng
|
Linear codes with a few weights from inhomogeneous quadratic functions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with few weights have been an interesting subject of study for
many years, as these codes have applications in secrete sharing, authentication
codes, association schemes, and strongly regular graphs. In this paper, linear
codes with a few weights are constructed from inhomogeneous quadratic functions
over the finite field $\gf(p)$, where $p$ is an odd prime. They include some
earlier linear codes as special cases. The weight distributions of these linear
codes are also determined.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2016 00:01:54 GMT"
}
] | 2016-02-05T00:00:00 |
[
[
"Tang",
"Chunming",
""
],
[
"Xiang",
"Can",
""
],
[
"Feng",
"Keqin",
""
]
] |
new_dataset
| 0.99671 |
1602.01545
|
Ching-Yi Lai
|
Alexei Ashikhmin and Ching-Yi Lai and Todd Brun
|
Correction of Data and Syndrome Errors by Stabilizer Codes
|
2 figures. This is a short version of our full paper (in preparation)
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Performing active quantum error correction to protect fragile quantum states
highly depends on the correctness of error information--error syndromes. To
obtain reliable error syndromes using imperfect physical circuits, we propose
the idea of quantum data-syndrome (DS) codes that are capable of correcting
both data qubits and syndrome bits errors. We study fundamental properties of
quantum DS codes and provide several CSS-type code constructions of quantum DS
codes.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2016 02:56:50 GMT"
}
] | 2016-02-05T00:00:00 |
[
[
"Ashikhmin",
"Alexei",
""
],
[
"Lai",
"Ching-Yi",
""
],
[
"Brun",
"Todd",
""
]
] |
new_dataset
| 0.959998 |
1602.01171
|
EPTCS
|
Swen Jacobs (Saarland University, Saarbr\"ucken, Germany), Roderick
Bloem (Graz University of Technology, Austria), Romain Brenguier
(Universit\'e Libre de Bruxelles, Brussels, Belgium), Robert K\"onighofer
(Graz University of Technology, Austria), Guillermo A. P\'erez (Universit\'e
Libre de Bruxelles, Brussels, Belgium), Jean-Fran\c{c}ois Raskin
(Universit\'e Libre de Bruxelles, Brussels, Belgium), Leonid Ryzhyk (NICTA,
Sydney, Australia and Carnegie Mellon University, Pittsburgh, USA), Ocan
Sankur (Universit\'e Libre de Bruxelles, Brussels, Belgium), Martina Seidl
(Johannes-Kepler-University, Linz, Austria), Leander Tentrup (Saarland
University, Saarbr\"ucken, Germany), Adam Walker (NICTA, Sydney, Australia)
|
The Second Reactive Synthesis Competition (SYNTCOMP 2015)
|
In Proceedings SYNT 2015, arXiv:1602.00786
|
EPTCS 202, 2016, pp. 27-57
|
10.4204/EPTCS.202.4
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on the design and results of the second reactive synthesis
competition (SYNTCOMP 2015). We describe our extended benchmark library, with 6
completely new sets of benchmarks, and additional challenging instances for 4
of the benchmark sets that were already used in SYNTCOMP 2014. To enhance the
analysis of experimental results, we introduce an extension of our benchmark
format with meta-information, including a difficulty rating and a reference
size for solutions. Tools are evaluated on a set of 250 benchmarks, selected to
provide a good coverage of benchmarks from all classes and difficulties. We
report on changes of the evaluation scheme and the experimental setup. Finally,
we describe the entrants into SYNTCOMP 2015, as well as the results of our
experimental evaluation. In our analysis, we emphasize progress over the tools
that participated last year.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 02:49:55 GMT"
}
] | 2016-02-04T00:00:00 |
[
[
"Jacobs",
"Swen",
"",
"Saarland University, Saarbrücken, Germany"
],
[
"Bloem",
"Roderick",
"",
"Graz University of Technology, Austria"
],
[
"Brenguier",
"Romain",
"",
"Université Libre de Bruxelles, Brussels, Belgium"
],
[
"Könighofer",
"Robert",
"",
"Graz University of Technology, Austria"
],
[
"Pérez",
"Guillermo A.",
"",
"Université\n Libre de Bruxelles, Brussels, Belgium"
],
[
"Raskin",
"Jean-François",
"",
"Université Libre de Bruxelles, Brussels, Belgium"
],
[
"Ryzhyk",
"Leonid",
"",
"NICTA,\n Sydney, Australia and Carnegie Mellon University, Pittsburgh, USA"
],
[
"Sankur",
"Ocan",
"",
"Université Libre de Bruxelles, Brussels, Belgium"
],
[
"Seidl",
"Martina",
"",
"Johannes-Kepler-University, Linz, Austria"
],
[
"Tentrup",
"Leander",
"",
"Saarland\n University, Saarbrücken, Germany"
],
[
"Walker",
"Adam",
"",
"NICTA, Sydney, Australia"
]
] |
new_dataset
| 0.998773 |
1602.01173
|
EPTCS
|
Ioannis Filippidis, Richard M. Murray, Gerard J. Holzmann
|
A multi-paradigm language for reactive synthesis
|
In Proceedings SYNT 2015, arXiv:1602.00786
|
EPTCS 202, 2016, pp. 73-97
|
10.4204/EPTCS.202.6
| null |
cs.LO cs.PL cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a language for describing reactive synthesis problems
that integrates imperative and declarative elements. The semantics is defined
in terms of two-player turn-based infinite games with full information.
Currently, synthesis tools accept linear temporal logic (LTL) as input, but
this description is less structured and does not facilitate the expression of
sequential constraints. This motivates the use of a structured programming
language to specify synthesis problems. Transition systems and guarded commands
serve as imperative constructs, expressed in a syntax based on that of the
modeling language Promela. The syntax allows defining which player controls
data and control flow, and separating a program into assumptions and
guarantees. These notions are necessary for input to game solvers. The
integration of imperative and declarative paradigms allows using the paradigm
that is most appropriate for expressing each requirement. The declarative part
is expressed in the LTL fragment of generalized reactivity(1), which admits
efficient synthesis algorithms, extended with past LTL. The implementation
translates Promela to input for the Slugs synthesizer and is written in Python.
The AMBA AHB bus case study is revisited and synthesized efficiently,
identifying the need to reorder binary decision diagrams during strategy
construction, in order to prevent the exponential blowup observed in previous
work.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 02:50:18 GMT"
}
] | 2016-02-04T00:00:00 |
[
[
"Filippidis",
"Ioannis",
""
],
[
"Murray",
"Richard M.",
""
],
[
"Holzmann",
"Gerard J.",
""
]
] |
new_dataset
| 0.999288 |
1602.01178
|
Tam Nguyen
|
Erik Cambria, Tam V. Nguyen, Brian Cheng, Kenneth Kwok, Jose Sepulveda
|
GECKA3D: A 3D Game Engine for Commonsense Knowledge Acquisition
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Commonsense knowledge representation and reasoning is key for tasks such as
artificial intelligence and natural language understanding. Since commonsense
consists of information that humans take for granted, gathering it is an
extremely difficult task. In this paper, we introduce a novel 3D game engine
for commonsense knowledge acquisition (GECKA3D) which aims to collect
commonsense from game designers through the development of serious games.
GECKA3D integrates the potential of serious games and games with a purpose.
This provides a platform for the acquisition of re-usable and multi-purpose
knowledge, and also enables the development of games that can provide
entertainment value and teach players something meaningful about the actual
world they live in.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 03:32:31 GMT"
}
] | 2016-02-04T00:00:00 |
[
[
"Cambria",
"Erik",
""
],
[
"Nguyen",
"Tam V.",
""
],
[
"Cheng",
"Brian",
""
],
[
"Kwok",
"Kenneth",
""
],
[
"Sepulveda",
"Jose",
""
]
] |
new_dataset
| 0.99872 |
1602.01225
|
Christoph Hackl
|
Christoph M. Hackl and Korbinian Schechner
|
Non-ideal torque control of wind turbine systems: Impacts on annual
energy production
|
6 pages, 8 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss non-ideal torque control in wind turbine systems (WTS). Most
high-level controllers generate a reference torque which is then send to the
underlying electrical drive system (generator+inverter) of the WTS to steer the
turbine/generator to its optimal operation point (depending on the wind speed).
The energy production heavily depends on the mechanical power (i.e. the product
of rotational speed and generator torque). However, since torque sensors in the
MW range are not available or extremely expensive, the torque controllers are
implemented as feedforward controllers and, therefore, are inherently sensitive
to parameter variations/uncertainties. Based on real wind data and a dynamical
WTS model, we discuss causes and impacts of non-ideal (feedforward) torque
control on the energy production and the gross earnings.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 08:49:30 GMT"
}
] | 2016-02-04T00:00:00 |
[
[
"Hackl",
"Christoph M.",
""
],
[
"Schechner",
"Korbinian",
""
]
] |
new_dataset
| 0.998416 |
1602.01416
|
Hossein Shokri Ghadikolaei
|
Roberto Congiu and Hossein Shokri-Ghadikolaei and Carlo Fischione and
Fortunato Santucci
|
On the Relay-Fallback Tradeoff in Millimeter Wave Wireless System
|
6 pages, 5 figures, accepted in IEEE INFOCOM mmNet Workshop
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave (mmWave) communications systems are promising candidate to
support extremely high data rate services in future wireless networks. MmWave
communications exhibit high penetration loss (blockage) and require directional
transmissions to compensate for severe channel attenuations and for high noise
powers. When blockage occurs, there are at least two simple prominent options:
1) switching to the conventional microwave frequencies (fallback option) and 2)
using an alternative non-blocked path (relay option). However, currently it is
not clear under which conditions and network parameters one option is better
than the other. To investigate the performance of the two options, this paper
proposes a novel blockage model that allows deriving maximum achievable
throughput and delay performance of both options. A simple criterion to decide
which option should be taken under which network condition is provided. By a
comprehensive performance analysis, it is shown that the right option depends
on the payload size, beam training overhead, and blockage probability. For a
network with light traffic and low probability of blockage in the direct link,
the fallback option is throughput- and delay-optimal. For a network with heavy
traffic demands and semi-static topology (low beam-training overhead), the
relay option is preferable.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 19:07:30 GMT"
}
] | 2016-02-04T00:00:00 |
[
[
"Congiu",
"Roberto",
""
],
[
"Shokri-Ghadikolaei",
"Hossein",
""
],
[
"Fischione",
"Carlo",
""
],
[
"Santucci",
"Fortunato",
""
]
] |
new_dataset
| 0.999467 |
1601.01289
|
Mirmojtaba Gharibi
|
Mirmojtaba Gharibi, Raouf Boutaba, Steven L. Waslander
|
Internet of Drones
| null | null | null | null |
cs.NI cs.RO
|
http://creativecommons.org/licenses/by/4.0/
|
The Internet of Drones (IoD) is a layered network control architecture
designed mainly for coordinating the access of unmanned aerial vehicles to
controlled airspace, and providing navigation services between locations
referred to as nodes. The IoD provides generic services for various drone
applications such as package delivery, traffic surveillance, search and rescue
and more. In this paper, we present a conceptual model of how such an
architecture can be organized and we specify the features that an IoD system
based on our architecture should implement. For doing so, we extract key
concepts from three existing large scale networks, namely the air traffic
control network, the cellular network, and the Internet and explore their
connections to our novel architecture for drone traffic management.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 19:47:09 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Feb 2016 00:41:06 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Gharibi",
"Mirmojtaba",
""
],
[
"Boutaba",
"Raouf",
""
],
[
"Waslander",
"Steven L.",
""
]
] |
new_dataset
| 0.974644 |
1602.00841
|
Dmitry Namiot
|
Manfred Sneps-Sneppe, Dmitry Namiot
|
On Physical Web models
|
a paper for Sibcon 2016
| null | null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Physical Web is a generic term describes interconnection of physical
objects and web. The Physical Web lets present physical objects in a web. There
are different ways to do that and we will discuss them in our paper. Usually,
the web presentation for a physical object could be implemented with the help
of mobile devices. The basic idea behind the Physical Web is to navigate and
control physical objects in the world surrounding mobile devices with the help
of web technologies. Of course, there are different ways to identify and
enumerate physical objects. In this paper, we describe the existing models as
well as related challenges. In our analysis, we will target objects enumeration
and navigation as well as data retrieving and programming for the Physical Web.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 09:17:37 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Sneps-Sneppe",
"Manfred",
""
],
[
"Namiot",
"Dmitry",
""
]
] |
new_dataset
| 0.999627 |
1602.00895
|
Maria Potop-Butucaru
|
Nesrine Khernane (NPA), Maria Potop-Butucaru (NPA), Claude Chaudet
|
BANZKP: a Secure Authentication Scheme Using Zero Knowledge Proof for
WBANs
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
-Wireless body area network(WBAN) has shown great potential in improving
healthcare quality not only for patients but also for medical staff. However,
security and privacy are still an important issue in WBANs especially in
multi-hop architectures. In this paper, we propose and present the design and
the evaluation of a secure lightweight and energy efficient authentication
scheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge
Proof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the
sensor nodes, with small computational requirement, which is favorable for body
sensors given their limited resources, while the commitment scheme is used to
deal with replay attacks and hence the injection attacks by committing a
message and revealing the key later. Our scheme reduces the memory requirement
by 56.13 % compared to TinyZKP [13], the comparable alternative so far for Body
Area Networks, and uses 10 % less energy.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 12:08:59 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Khernane",
"Nesrine",
"",
"NPA"
],
[
"Potop-Butucaru",
"Maria",
"",
"NPA"
],
[
"Chaudet",
"Claude",
""
]
] |
new_dataset
| 0.999729 |
1602.00914
|
Fei Li
|
Fei Li, Yang Yan, Qiuyan Wang and Tongjiang Yan
|
Binary linear codes with at most 4 weights
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the past decades, linear codes with few weights have been widely studied,
since they have applications in space communications, data storage and
cryptography. In this paper, a class of binary linear codes is constructed and
their weight distribution is determined. Results show that they are at most
4-weight linear codes. Additionally, these codes can be used in secret sharing
schemes.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 13:17:48 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Li",
"Fei",
""
],
[
"Yan",
"Yang",
""
],
[
"Wang",
"Qiuyan",
""
],
[
"Yan",
"Tongjiang",
""
]
] |
new_dataset
| 0.9989 |
1602.00932
|
Georg Nawratil
|
Georg Nawratil and Josef Schicho
|
Addendum to Pentapods with Mobility 2
|
9 pages, 6 figures
| null | null | null |
cs.RO math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a foregoing publication the authors studied pentapods with mobility 2,
where neither all platform anchor points nor all base anchor points are located
on a line. It turned out that the given classification is incomplete. This
addendum is devoted to the discussion of the missing cases resulting in
additional solutions already known to Duporcq.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 14:05:11 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Nawratil",
"Georg",
""
],
[
"Schicho",
"Josef",
""
]
] |
new_dataset
| 0.989411 |
1602.01084
|
Andrew Adamatzky
|
Alex J. L. Morgan, David A. Barrow, Andrew Adamatzky, Martin M.
Hanczyc
|
Simple fluidic digital half-adder
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fluidic one-bit half-adder is made of five channels which intersect at a
junction. Two channels are inputs, two channels are outputs and one channel is
the drain. The channels direct fluid from input fragments to output fragments
and the streams of fluid interact at the junctions. Binary signals are
represented by water droplets introduced in the input channels: presence of a
droplet in an input or output segments symbolises logical {\sc True}, absence
--- {\sc False}. The droplets travel along channels by following a path of
least resistance unless deflected at the junction. We demonstrate the function
of the half-adder in both computer modelling and laboratory experiments, and
propose a design of a one-bit full adder based on simulation.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2016 20:59:28 GMT"
}
] | 2016-02-03T00:00:00 |
[
[
"Morgan",
"Alex J. L.",
""
],
[
"Barrow",
"David A.",
""
],
[
"Adamatzky",
"Andrew",
""
],
[
"Hanczyc",
"Martin M.",
""
]
] |
new_dataset
| 0.999693 |
1410.7041
|
Qiang Huo
|
Qiang Huo, Kun Yang, Lingyang Song, Yonghui Li, Bingli Jiao
|
Compressed Relaying for Two-Way Relay Networks with Correlated Sources
|
11 pages, 4 figures. appears in IEEE Wireless Communications Letters,
2014
|
IEEE Wireless Communications Letters, Vol. 4, No. 1, February 2015
|
10.1109/LWC.2014.2362748
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, a compressed relaying scheme via Huffman and physical-layer
network coding (HPNC) is proposed for two-way relay networks with correlated
sources (TWRN-CS). In the HPNC scheme, both sources first transmit the
correlated raw source messages to the relay simultaneously. The relay performs
physical-layer network coding (PNC) on the received symbols, compresses the
PNC-coded symbols using Huffman coding, and broadcasts the compressed symbols
to both source nodes. Then, each source decodes the other source's messages by
using its own messages as side information. Compression rate and block error
rate (BLER) of the proposed scheme are analyzed. Simulation results demonstrate
that the HPNC scheme can effectively improve the network throughput, and
meanwhile, achieve the superior BLER performance compared with the conventional
non-compressed relaying scheme in TWRN-CS.
|
[
{
"version": "v1",
"created": "Sun, 26 Oct 2014 15:11:58 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Huo",
"Qiang",
""
],
[
"Yang",
"Kun",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Jiao",
"Bingli",
""
]
] |
new_dataset
| 0.990162 |
1512.05023
|
Anirudh Sivaraman Kaushalram
|
Anirudh Sivaraman, Mihai Budiu, Alvin Cheung, Changhoon Kim, Steve
Licking, George Varghese, Hari Balakrishnan, Mohammad Alizadeh, Nick McKeown
|
Packet Transactions: High-level Programming for Line-Rate Switches
|
16 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many algorithms for congestion control, scheduling, network measurement,
active queue management, security, and load balancing require custom processing
of packets as they traverse the data plane of a network switch. To run at line
rate, these data-plane algorithms must be in hardware. With today's switch
hardware, algorithms cannot be changed, nor new algorithms installed, after a
switch has been built.
This paper shows how to program data-plane algorithms in a high-level
language and compile those programs into low-level microcode that can run on
emerging programmable line-rate switching chipsets. The key challenge is that
these algorithms create and modify algorithmic state. The key idea to achieve
line-rate programmability for stateful algorithms is the notion of a packet
transaction : a sequential code block that is atomic and isolated from other
such code blocks. We have developed this idea in Domino, a C-like imperative
language to express data-plane algorithms. We show with many examples that
Domino provides a convenient and natural way to express sophisticated
data-plane algorithms, and show that these algorithms can be run at line rate
with modest estimated die-area overhead.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 01:15:06 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Jan 2016 04:27:07 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Sivaraman",
"Anirudh",
""
],
[
"Budiu",
"Mihai",
""
],
[
"Cheung",
"Alvin",
""
],
[
"Kim",
"Changhoon",
""
],
[
"Licking",
"Steve",
""
],
[
"Varghese",
"George",
""
],
[
"Balakrishnan",
"Hari",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"McKeown",
"Nick",
""
]
] |
new_dataset
| 0.988909 |
1602.00252
|
Erick Stattner
|
Erick Stattner
|
Comment Diffusons-nous sur les R\'eseaux Sociaux ?
|
12 pages, in French. Colloque international et interdisciplinaire
pour les enjeux et usages des technologies de l'information et de la
communication, 2015 (EUTIC 2015)
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of new communication media such as blogs, online newspapers and
social networks allow us to go further in the understanding of human behavior.
Indeed, these public exchange spaces are now firmly planted in our modern
society and appear to be powerful sensors of social behavior and opinion
movements. In this paper, we focus on information spreading and attempt to
understand what are the conditions in which a person decides to speak on a
subject. For this purpose, we propose a set of measures that aim to
characterize the diffusion behavior. Our measures have been used on messages
related to two events that took place in January 2015: presentation by
Microsoft of a new virtual reality headset and the election of a political
party of radical left in Greece.
|
[
{
"version": "v1",
"created": "Sun, 31 Jan 2016 14:31:20 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Stattner",
"Erick",
""
]
] |
new_dataset
| 0.987011 |
1602.00307
|
Hatem Alismail
|
Hatem Alismail, Brett Browning, Simon Lucey
|
Bit-Planes: Dense Subpixel Alignment of Binary Descriptors
|
10 pages. In submission
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary descriptors have been instrumental in the recent evolution of
computationally efficient sparse image alignment algorithms. Increasingly,
however, the vision community is interested in dense image alignment methods,
which are more suitable for estimating correspondences from high frame rate
cameras as they do not rely on exhaustive search. However, classic dense
alignment approaches are sensitive to illumination change. In this paper, we
propose an easy to implement and low complexity dense binary descriptor, which
we refer to as bit-planes, that can be seamlessly integrated within a
multi-channel Lucas & Kanade framework. This novel approach combines the
robustness of binary descriptors with the speed and accuracy of dense alignment
methods. The approach is demonstrated on a template tracking problem achieving
state-of-the-art robustness and faster than real-time performance on consumer
laptops (400+ fps on a single core Intel i7) and hand-held mobile devices (100+
fps on an iPad Air 2).
|
[
{
"version": "v1",
"created": "Sun, 31 Jan 2016 19:51:11 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Alismail",
"Hatem",
""
],
[
"Browning",
"Brett",
""
],
[
"Lucey",
"Simon",
""
]
] |
new_dataset
| 0.979513 |
1602.00398
|
Seunghoon Lee
|
Seunghoon Lee
|
A Short Note on Improved Logic Circuits in a Hexagonal Minesweeper
|
12 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims to present an advanced version of PP-hardness proof of
Minesweeper by Bondt. The advancement includes improved Minesweeper
configurations for 'logic circuits' in a hexagonal Minesweeper. To do so, I
demonstrate logical uncertainty in Minesweeper, which ironically allows a
possibility to make some Boolean operators.
The fact that existing hexagonal logic circuits did not clearly distinguish
the true and false signal needs an improved form of a hexagonal wire. I
introduce new forms of logic circuits such as NOT, AND, OR gates, a curve and a
splitter of wires. Moreover, these new logic circuits complement Bondt's proof
for PP-hardness of Minesweeper by giving a new figure.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2016 06:11:35 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Lee",
"Seunghoon",
""
]
] |
new_dataset
| 0.990013 |
1602.00454
|
Christoph Koutschan
|
Christoph Koutschan and Peter Paule
|
Holonomic Tools for Basic Hypergeometric Functions
| null | null | null | null |
cs.SC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the exception of q-hypergeometric summation, the use of computer algebra
packages implementing Zeilberger's "holonomic systems approach" in a broader
mathematical sense is less common in the field of q-series and basic
hypergeometric functions. A major objective of this article is to popularize
the usage of such tools also in these domains. Concrete case studies showing
software in action introduce to the basic techniques. An application highlight
is a new computer-assisted proof of the celebrated Ismail-Zhang formula, an
important q-analog of a classical expansion formula of plane waves in terms of
Gegenbauer polynomials.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2016 10:04:20 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Koutschan",
"Christoph",
""
],
[
"Paule",
"Peter",
""
]
] |
new_dataset
| 0.968497 |
1602.00503
|
Amine Ghrab
|
Amine Ghrab, Oscar Romero, Sabri Skhiri, Alejandro Vaisman, Esteban
Zim\'anyi
|
GRAD: On Graph Database Modeling
|
28 pages, 13 figures
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graph databases have emerged as the fundamental technology underpinning
trendy application domains where traditional databases are not well-equipped to
handle complex graph data. However, current graph databases support basic graph
structures and integrity constraints with no standard algebra. In this paper,
we introduce GRAD, a native and generic graph database model. GRAD goes beyond
traditional graph database models, which support simple graph structures and
constraints. Instead, GRAD presents a complete graph database model supporting
advanced graph structures, a set of well-defined constraints over these
structures and a powerful graph analysis-oriented algebra.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2016 12:49:25 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Ghrab",
"Amine",
""
],
[
"Romero",
"Oscar",
""
],
[
"Skhiri",
"Sabri",
""
],
[
"Vaisman",
"Alejandro",
""
],
[
"Zimányi",
"Esteban",
""
]
] |
new_dataset
| 0.997167 |
1602.00615
|
William Woodruff
|
William Woodruff
|
EMFS: Repurposing SMTP and IMAP for Data Storage and Synchronization
|
18 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud storage has become a massive and lucrative business, with companies
like Apple, Microsoft, Google, and Dropbox providing hundreds of millions of
clients with synchronized and redundant storage. These services often command
price-to-storage ratios significantly higher than the market rate for physical
storage, as well as increase the surface area for data leakage. In place of
this consumer-unfriendly status quo, I propose using widely available, well
standardized email protocols like SMTP and IMAP in conjunction with free email
service providers to store, synchronize, and share files across discrete
systems.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2016 07:05:36 GMT"
}
] | 2016-02-02T00:00:00 |
[
[
"Woodruff",
"William",
""
]
] |
new_dataset
| 0.99426 |
1511.07922
|
Yi Zhang
|
Yi Zhang
|
Contraction of Ore Ideals with Applications
| null | null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ore operators form a common algebraic abstraction of linear ordinary
differential and recurrence equations. Given an Ore operator $L$ with
polynomial coefficients in $x$, it generates a left ideal $I$ in the Ore
algebra over the field $\mathbf{k}(x)$ of rational functions. We present an
algorithm for computing a basis of the contraction ideal of $I$ in the Ore
algebra over the ring $R[x]$ of polynomials, where $R$ may be either
$\mathbf{k}$ or a domain with $\mathbf{k}$ as its fraction field. This
algorithm is based on recent work on desingularization for Ore operators by
Chen, Jaroschek, Kauers and Singer. Using a basis of the contraction ideal, we
compute a completely desingularized operator for $L$ whose leading coefficient
not only has minimal degree in $x$ but also has minimal content. Completely
desingularized operators have interesting applications such as certifying
integer sequences and checking special cases of a conjecture of Krattenthaler.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 00:15:50 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Nov 2015 21:08:36 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Dec 2015 06:54:48 GMT"
},
{
"version": "v4",
"created": "Thu, 17 Dec 2015 08:54:06 GMT"
},
{
"version": "v5",
"created": "Wed, 23 Dec 2015 12:07:20 GMT"
},
{
"version": "v6",
"created": "Sun, 3 Jan 2016 02:38:59 GMT"
},
{
"version": "v7",
"created": "Thu, 28 Jan 2016 02:47:23 GMT"
},
{
"version": "v8",
"created": "Fri, 29 Jan 2016 03:02:20 GMT"
}
] | 2016-02-01T00:00:00 |
[
[
"Zhang",
"Yi",
""
]
] |
new_dataset
| 0.999774 |
1601.08154
|
Tiago Azevedo
|
Tiago Azevedo, Paulo J. M. de Ara\'ujo, Rosaldo J. F. Rossetti, Ana
Paula C. Rocha
|
JADE, TraSMAPI and SUMO: A tool-chain for simulating traffic light
control
| null |
Proceedings of the 8th International Workshop on Agents in Traffic
and Transportation, ATT'14, held at the Thirteenth International Joint
Conference on Autonomous Agents and Multiagent Systems, AAMAS'14 (2014) 8-15
|
10.13140/2.1.2739.4886
| null |
cs.MA
|
http://creativecommons.org/licenses/by/4.0/
|
Increased stress, fuel consumption, air pollution, accidents and delays are
some of the consequences of traffic congestion usually incurring in tremendous
economic impacts, which society aims to remedy in order to leverage a
sustainable development. Recently, unconventional means for modeling and
controlling such complex traffic systems relying on multi-agent systems have
arisen. This paper contributes to the understanding of such complex and highly
dynamic systems by proposing an open-source tool-chain to implement
multi-agent-based solutions in traffic and transportation. The proposed
approach relies on two very popular tools in both domains, with focus on
traffic light control. This tool-chain consists in combining JADE (Java Agent
DEvelopment Framework), for the implementation of multi-agent systems, with
SUMO (Simulation of Urban MObility), for the microscopic simulation of traffic
interactions. TraSMAPI (Traffic Simulation Manager Application Programming
Interface) is used to combine JADE and SUMO allowing communication between
them. A demonstration of the concept is presented to illustrate the main
features of this tool-chain, using Q-Learning as the reinforcement learning
method for each traffic light agent in a simulated network. Results demonstrate
the feasibility of the proposed framework as a practical means to experiment
with different agent-based designs of intelligent transportation solutions.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2016 15:29:21 GMT"
}
] | 2016-02-01T00:00:00 |
[
[
"Azevedo",
"Tiago",
""
],
[
"de Araújo",
"Paulo J. M.",
""
],
[
"Rossetti",
"Rosaldo J. F.",
""
],
[
"Rocha",
"Ana Paula C.",
""
]
] |
new_dataset
| 0.987693 |
1601.08190
|
Nikhil Krishnan M
|
M. Nikhil Krishnan, P. Vijay Kumar
|
On MBR codes with replication
|
Submitted to ISIT 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An early paper by Rashmi et. al. presented the construction of an
$(n,k,d=n-1)$ MBR regenerating code featuring the inherent double replication
of all code symbols and repair-by-transfer (RBT), both of which are important
in practice. We first show that no MBR code can contain even a single code
symbol that is replicated more than twice. We then go on to present two new
families of MBR codes which feature double replication of all systematic
message symbols. The codes also possess a set of $d$ nodes whose contents
include the message symbols and which can be repaired through help-by-transfer
(HBT). As a corollary, we obtain systematic RBT codes for the case $d=(n-1)$
that possess inherent double replication of all code symbols and having a field
size of $O(n)$ in comparison with the general, $O(n^2)$ field size requirement
of the earlier construction by Rashmi et. al. For the cases $(k=d=n-2)$ or
$(k+1=d=n-2)$, the field size can be reduced to $q=2$, and hence the codes can
be binary. We also give a necessary and sufficient condition for the existence
of MBR codes having double replication of all code symbols and also suggest
techniques which will enable an arbitrary MBR code to be converted to one with
double replication of all code symbols.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2016 16:48:58 GMT"
}
] | 2016-02-01T00:00:00 |
[
[
"Krishnan",
"M. Nikhil",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.991602 |
1601.08227
|
Irene M\'arquez-Corbella
|
Irene M\'arquez-Corbella and Jean-Pierre Tillich
|
Using Reed-Solomon codes in the $\left( U\mid U+V\right)$ construction
and an application to cryptography
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a modification of Reed-Solomon codes that beats the
Guruwami-Sudan $1-\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates
$R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate
rates in a $\left( U\mid U+V\right)$ construction and to decode them with the
Koetter-Vardy soft information decoder. We suggest to use a slightly more
general version of these codes (but which has the same decoding performances as
the $\left( U\mid U+V\right)$-construction) for code-based cryptography, namely
to build a McEliece scheme. The point is here that these codes not only perform
nearly as well (or even better in the low rate regime) as Reed-Solomon codes,
their structure seems to avoid the Sidelnikov-Shestakov attack which broke a
previous McEliece proposal based on generalized Reed-Solomon codes.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2016 19:30:36 GMT"
}
] | 2016-02-01T00:00:00 |
[
[
"Márquez-Corbella",
"Irene",
""
],
[
"Tillich",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.996998 |
1308.3466
|
Frederik Mallmann-Trenn
|
Petra Berenbrink, Funda Erg\"un, Frederik Mallmann-Trenn, and Erfan
Sadeqi Azer
|
Palindrome Recognition In The Streaming Model
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Palindrome Problem one tries to find all palindromes (palindromic
substrings) in a given string. A palindrome is defined as a string which reads
forwards the same as backwards, e.g., the string "racecar". A related problem
is the Longest Palindromic Substring Problem in which finding an arbitrary one
of the longest palindromes in the given string suffices. We regard the
streaming version of both problems. In the streaming model the input arrives
over time and at every point in time we are only allowed to use sublinear
space. The main algorithms in this paper are the following: The first one is a
one-pass randomized algorithm that solves the Palindrome Problem. It has an
additive error and uses $O(\sqrt n$) space. The second algorithm is a two-pass
algorithm which determines the exact locations of all longest palindromes. It
uses the first algorithm as the first pass. The third algorithm is again a
one-pass randomized algorithm, which solves the Longest Palindromic Substring
Problem. It has a multiplicative error using only $O(\log(n))$ space. We also
give two variants of the first algorithm which solve other related practical
problems.
|
[
{
"version": "v1",
"created": "Thu, 15 Aug 2013 18:04:24 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Oct 2013 09:24:29 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Jan 2016 11:55:49 GMT"
}
] | 2016-01-29T00:00:00 |
[
[
"Berenbrink",
"Petra",
""
],
[
"Ergün",
"Funda",
""
],
[
"Mallmann-Trenn",
"Frederik",
""
],
[
"Azer",
"Erfan Sadeqi",
""
]
] |
new_dataset
| 0.969217 |
1511.06940
|
Mathew Samimi
|
Mathew K. Samimi, Shu Sun, and Theodore S. Rappaport
|
MIMO Channel Modeling and Capacity Analysis for 5G Millimeter-Wave
Wireless Systems
|
5 pages, 6 figures, accepted in the 10th European Conference on
Antennas and Propagation (EuCAP'2016), April 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a 3-D statistical channel model of the impulse response
with small-scale spatially correlated random coefficients for multi-element
transmitter and receiver antenna arrays, derived using the physically-based
time cluster - spatial lobe (TCSL) clustering scheme. The small-scale
properties of multipath amplitudes are modeled based on 28 GHz outdoor
millimeter-wave small-scale local area channel measurements. The wideband
channel capacity is evaluated by considering measurement-based
Rician-distributed voltage amplitudes, and the spatial autocorrelation of
multipath amplitudes for each pair of transmitter and receiver antenna
elements. Results indicate that Rician channels may exhibit equal or possibly
greater capacity compared to Rayleigh channels, depending on the number of
antennas.
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2015 23:44:48 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jan 2016 01:37:13 GMT"
}
] | 2016-01-29T00:00:00 |
[
[
"Samimi",
"Mathew K.",
""
],
[
"Sun",
"Shu",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.997799 |
1601.06847
|
Alessandro Biason
|
Alessandro Biason and Michele Zorzi
|
Battery-Powered Devices in WPCNs
|
13 pages, 11 figures, submitted to IEEE Transactions on
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless powered communication networks are becoming an effective solution
for improving self sustainability of mobile devices. In this context, a hybrid
access point transfers energy to a group of nodes, which use the harvested
energy to perform computation or transmission tasks. While the availability of
the wireless energy transfer mechanism opens up new frontiers, an appropriate
choice of the network parameters (e.g., transmission powers, transmission
duration, amount of transferred energy, etc.) is required in order to achieve
high performance. In this work, we study the throughput optimization problem in
a system composed of an access point which recharges the batteries of two
devices at different distances. In the literature, the main focus so far has
been on slot-oriented optimization, in which all the harvested energy is used
in the same slot in which it is harvested. However, this approach is strongly
sub-optimal because it does not exploit the possibility to store the energy and
use it at a later time. Thus, instead of considering the slot-oriented case, we
address the long-term maximization. This assumption greatly increases the
optimization complexity, requiring to consider, e.g., the channel state
realizations, its statistics and the batteries evolution. Our objective is to
find the best scheduling scheme, both for the energy transferred by the access
point and for the data sent by the two nodes. We discuss how to perform the
maximization with optimal as well as approximate techniques and show that the
slot-oriented policies proposed so far are strongly sub-optimal in the long
run.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 23:21:48 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jan 2016 16:55:29 GMT"
}
] | 2016-01-29T00:00:00 |
[
[
"Biason",
"Alessandro",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.972443 |
1601.07633
|
Harinaivo Andriatahiny
|
Harinaivo Andriatahiny
|
The Generalized Reed-Muller codes and the radical powers of a modular
algebra
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First, a new proof of Berman and Charpin's characterization of the
Reed-Muller codes over the binary field or over an arbitrary prime field is
presented. These codes are considered as the powers of the radical of a modular
algebra. Secondly, the same method is used for the study of the Generalized
Reed-Muller codes over a non prime field.
|
[
{
"version": "v1",
"created": "Thu, 28 Jan 2016 03:58:32 GMT"
}
] | 2016-01-29T00:00:00 |
[
[
"Andriatahiny",
"Harinaivo",
""
]
] |
new_dataset
| 0.997657 |
1509.00116
|
M. Salman Asif
|
M. Salman Asif, Ali Ayremlou, Aswin Sankaranarayanan, Ashok
Veeraraghavan, and Richard Baraniuk
|
FlatCam: Thin, Bare-Sensor Cameras using Coded Aperture and Computation
|
12 pages, 10 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
FlatCam is a thin form-factor lensless camera that consists of a coded mask
placed on top of a bare, conventional sensor array. Unlike a traditional,
lens-based camera where an image of the scene is directly recorded on the
sensor pixels, each pixel in FlatCam records a linear combination of light from
multiple scene elements. A computational algorithm is then used to demultiplex
the recorded measurements and reconstruct an image of the scene. FlatCam is an
instance of a coded aperture imaging system; however, unlike the vast majority
of related work, we place the coded mask extremely close to the image sensor
that can enable a thin system. We employ a separable mask to ensure that both
calibration and image reconstruction are scalable in terms of memory
requirements and computational complexity. We demonstrate the potential of the
FlatCam design using two prototypes: one at visible wavelengths and one at
infrared wavelengths.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2015 01:59:59 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jan 2016 20:09:57 GMT"
}
] | 2016-01-28T00:00:00 |
[
[
"Asif",
"M. Salman",
""
],
[
"Ayremlou",
"Ali",
""
],
[
"Sankaranarayanan",
"Aswin",
""
],
[
"Veeraraghavan",
"Ashok",
""
],
[
"Baraniuk",
"Richard",
""
]
] |
new_dataset
| 0.999636 |
1509.04274
|
Swetank Kumar Saha
|
Swetank Kumar Saha, Viral Vijay Vira, Anuj Garg, Dimitrios
Koutsonikolas
|
60 GHz Multi-Gigabit Indoor WLANs: Dream or Reality?
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter-wave (mmWave) technology, recently standardized by IEEE
802.11ad, is emerging as an attractive alternative to the traditional 2.4/5GHz
wireless systems, promising multi-Gigabit wireless throughput. However, the
high attenuation and vulnerability to blockage of 60 GHz links have limited its
applications (until recently) to short-range, line-of-sight, static scenarios.
On the other hand, the question of whether it is feasible to build
general-purpose WLANs out of mmWave radios in dynamic indoor environments with
non-line-of-sight links remains largely unanswered. In this paper, through
extensive measurements with COTS 802.11ad hardware in an indoor office
environment, we investigate the question of whether the mmWave technology, in
spite of its unique propagation characteristics, can serve as a viable choice
for providing multi-Gigabit ubiquitous wireless indoor connectivity. We study
the range of 60 GHz transmissions in indoor environments, the impact of antenna
height, location, orientation, and distance on 60 GHz performance, the
interaction among metrics from different layers of the network stack, the
increased opportunities for spatial reuse, and the impact of human blockage.
Our results reveal a number of challenges that we have to address for 60 GHz
multi-gigabit WLANs to become a reality.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 20:07:50 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jan 2016 01:33:10 GMT"
}
] | 2016-01-28T00:00:00 |
[
[
"Saha",
"Swetank Kumar",
""
],
[
"Vira",
"Viral Vijay",
""
],
[
"Garg",
"Anuj",
""
],
[
"Koutsonikolas",
"Dimitrios",
""
]
] |
new_dataset
| 0.998979 |
1601.06383
|
Kai Wan
|
Kai Wan, Daniela Tuninetti, Pablo Piantanida
|
On Caching with More Users than Files
|
6 pages, 3 figures, submitted to ISIT 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching appears to be an efficient way to reduce peak hour network traffic
congestion by storing some content at the user's cache without knowledge of
later demands. Recently, Maddah-Ali and Niesen proposed a two-phase, placement
and delivery phase, coded caching strategy for centralized systems (where
coordination among users is possible in the placement phase), and for
decentralized systems. This paper investigates the same setup under the further
assumption that the number of users is larger than the number of files. By
using the same uncoded placement strategy of Maddah-Ali and Niesen, a novel
coded delivery strategy is proposed to profit from the multicasting
opportunities that arise because a file may be demanded by multiple users. The
proposed delivery method is proved to be optimal under the constraint of
uncoded placement for centralized systems with two files, moreover it is shown
to outperform known caching strategies for both centralized and decentralized
systems.
|
[
{
"version": "v1",
"created": "Sun, 24 Jan 2016 13:36:36 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Jan 2016 21:13:51 GMT"
}
] | 2016-01-28T00:00:00 |
[
[
"Wan",
"Kai",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Piantanida",
"Pablo",
""
]
] |
new_dataset
| 0.983412 |
1601.07250
|
Yuting Zheng
|
Yuting Zheng
|
Living Innovation Laboratory Model Design and Implementation
|
This is a book draft
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Living Innovation Laboratory (LIL) is an open and recyclable way for
multidisciplinary researchers to remote control resources and co-develop user
centered projects. In the past few years, there were several papers about LIL
published and trying to discuss and define the model and architecture of LIL.
People all acknowledge about the three characteristics of LIL: user centered,
co-creation, and context aware, which make it distinguished from test platform
and other innovation approaches. Its existing model consists of five phases:
initialization, preparation, formation, development, and evaluation.
Goal Net is a goal-oriented methodology to formularize a progress. In this
thesis, Goal Net is adopted to subtract a detailed and systemic methodology for
LIL. LIL Goal Net Model breaks the five phases of LIL into more detailed steps.
Big data, crowd sourcing, crowd funding and crowd testing take place in
suitable steps to realize UUI, MCC and PCA throughout the innovation process in
LIL 2.0. It would become a guideline for any company or organization to develop
a project in the form of an LIL 2.0 project.
To prove the feasibility of LIL Goal Net Model, it was applied to two real
cases. One project is a Kinect game and the other one is an Internet product.
They were both transformed to LIL 2.0 successfully, based on LIL goal net based
methodology. The two projects were evaluated by phenomenography, which was a
qualitative research method to study human experiences and their relations in
hope of finding the better way to improve human experiences. Through
phenomenographic study, the positive evaluation results showed that the new
generation of LIL had more advantages in terms of effectiveness and efficiency.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2016 03:07:03 GMT"
}
] | 2016-01-28T00:00:00 |
[
[
"Zheng",
"Yuting",
""
]
] |
new_dataset
| 0.996072 |
1601.07457
|
Marco Cattani
|
Marco Cattani, Ioannis Protonotarios
|
Gondola: a Parametric Robot Infrastructure for Repeatable Mobile
Experiments
| null | null | null | null |
cs.RO cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When deploying a testbed infrastructure for Wireless Sensor Networks (WSNs),
one of the most challenging feature is to provide repeatable mobility. Wheeled
robots, usually employed for such tasks, strive to adapt to the wide range of
environments where WSNs are deployed, from chaotic office spaces to potato
fields in the farmland. For this reson, these robot systems often require
expensive customization steps that, for example, adapt their localization and
navigation system. To avoid these issues, in this paper we present the design
of Gondola, a parametric robot infrastructure based on pulling wires, rather
than wheels, that avoids the most common problems of wheeled robot and easily
adapts to many WSN's scenarios. Different from wheeled robots, wich movements
are constrained on a 2-dimensional plane, Gondola can easily move in
3-dimensional spaces with no need of a complex localization system and an
accuracy that is comparable with off-the-shelf wheeled robots.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2016 17:29:20 GMT"
}
] | 2016-01-28T00:00:00 |
[
[
"Cattani",
"Marco",
""
],
[
"Protonotarios",
"Ioannis",
""
]
] |
new_dataset
| 0.999263 |
1109.3475
|
Peter Hor\'ak
|
Peter Horak and Bader F. AlBdaiwi
|
Diameter Perfect Lee Codes
| null |
IEEE Transactions on Information Theory, Vol 58, No 8, pp.
5490--5499, August 2012
|
10.1109/TIT.2012.2196257
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lee codes have been intensively studied for more than 40 years. Interest in
these codes has been triggered by the Golomb-Welch conjecture on the existence
of the perfect error-correcting Lee codes. In this paper we deal with the
existence and enumeration of diameter perfect Lee codes. As main results we
determine all $q$ for which there exists a linear diameter-4 perfect Lee code
of word length $n$ over $Z_{q},$ and prove that for each $n\geq 3$ there are
uncountable many diameter-4 perfect Lee codes of word length $n$ over $Z.$ This
is in a strict contrast with perfect error-correcting Lee codes of word length
$n$ over $Z\,$\ as there is a unique such code for $n=3,$ and its is
conjectured that this is always the case when $2n+1$ is a prime. We produce
diameter perfect Lee codes by an algebraic construction that is based on a
group homomorphism. This will allow us to design an efficient algorithm for
their decoding. We hope that this construction will turn out to be useful far
beyond the scope of this paper.
|
[
{
"version": "v1",
"created": "Thu, 15 Sep 2011 20:19:22 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Apr 2012 18:48:37 GMT"
},
{
"version": "v3",
"created": "Fri, 13 Apr 2012 14:19:53 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Horak",
"Peter",
""
],
[
"AlBdaiwi",
"Bader F.",
""
]
] |
new_dataset
| 0.998097 |
1301.5451
|
Qu Xiaobo
|
Xiaobo Qu, Ying Chen, Xiaoxing Zhuang, Zhiyu Yan, Di Guo, Zhong Chen
|
Spread spectrum compressed sensing MRI using chirp radio frequency
pulses
|
4 pages, 4 figures
| null | null | null |
cs.CV math.OC physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compressed sensing has shown great potential in reducing data acquisition
time in magnetic resonance imaging (MRI). Recently, a spread spectrum
compressed sensing MRI method modulates an image with a quadratic phase. It
performs better than the conventional compressed sensing MRI with variable
density sampling, since the coherence between the sensing and sparsity bases
are reduced. However, spread spectrum in that method is implemented via a shim
coil which limits its modulation intensity and is not convenient to operate. In
this letter, we propose to apply chirp (linear frequency-swept) radio frequency
pulses to easily control the spread spectrum. To accelerate the image
reconstruction, an alternating direction algorithm is modified by exploiting
the complex orthogonality of the quadratic phase encoding. Reconstruction on
the acquired data demonstrates that more image features are preserved using the
proposed approach than those of conventional CS-MRI.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 09:59:38 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Qu",
"Xiaobo",
""
],
[
"Chen",
"Ying",
""
],
[
"Zhuang",
"Xiaoxing",
""
],
[
"Yan",
"Zhiyu",
""
],
[
"Guo",
"Di",
""
],
[
"Chen",
"Zhong",
""
]
] |
new_dataset
| 0.994774 |
1601.06880
|
Tadashi Wadayama
|
Tadashi Wadayama and Taisuke Izumi
|
Bounds on Asymptotic Rate of Capacitive Crosstalk Avoidance Codes for
On-chip Buses
|
10 pages, 2 figures, submitted to ISIT 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to prevent the capacitive crosstalk in on-chip buses, several types
of capacitive crosstalk avoidance codes have been devised. These codes are
designed to prohibit transition patterns prone to the capacity crosstalk from
any consecutive two words transmitted to on-chip buses. This paper provides a
rigorous analysis on the asymptotic rate of (p,q)-transition free word
sequences under the assumption that coding is based on a pair of a stateful
encoder and a stateless decoder. The symbols p and q represent k-bit transition
patterns that should not be appeared in any consecutive two words at the same
adjacent k-bit positions. It is proved that the maximum rate of the sequences
equals to the subgraph domatic number of (p,q)-transition free graph. Based on
the theoretical results on the subgraph domatic partition problem, a pair of
lower and upper bounds on the asymptotic rate is derived. We also present that
the asymptotic rate 0.8325 is achievable for the (10,01)-transition free word
sequences.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2016 03:46:11 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Wadayama",
"Tadashi",
""
],
[
"Izumi",
"Taisuke",
""
]
] |
new_dataset
| 0.99781 |
1601.06931
|
Manuel Marin-Jimenez
|
F.M. Castro and M.J. Mar\'in-Jim\'enez and N. Guil and R.
Mu\~noz-Salinas
|
Fisher Motion Descriptor for Multiview Gait Recognition
|
This paper extends with new experiments the one published at
ICPR'2014
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this paper is to identify individuals by analyzing their gait.
Instead of using binary silhouettes as input data (as done in many previous
works) we propose and evaluate the use of motion descriptors based on densely
sampled short-term trajectories. We take advantage of state-of-the-art people
detectors to define custom spatial configurations of the descriptors around the
target person, obtaining a rich representation of the gait motion. The local
motion features (described by the Divergence-Curl-Shear descriptor) extracted
on the different spatial areas of the person are combined into a single
high-level gait descriptor by using the Fisher Vector encoding. The proposed
approach, coined Pyramidal Fisher Motion, is experimentally validated on
`CASIA' dataset (parts B and C), `TUM GAID' dataset, `CMU MoBo' dataset and the
recent `AVA Multiview Gait' dataset. The results show that this new approach
achieves state-of-the-art results in the problem of gait recognition, allowing
to recognize walking people from diverse viewpoints on single and multiple
camera setups, wearing different clothes, carrying bags, walking at diverse
speeds and not limited to straight walking paths.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2016 09:05:26 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Castro",
"F. M.",
""
],
[
"Marín-Jiménez",
"M. J.",
""
],
[
"Guil",
"N.",
""
],
[
"Muñoz-Salinas",
"R.",
""
]
] |
new_dataset
| 0.996156 |
1601.07059
|
Ago-Erik Riet
|
Kristo Visk and Ago-Erik Riet
|
Permutation codes, source coding and a generalisation of
Bollob\'as-Lubell-Yamamoto-Meshalkin and Kraft inequalities
|
5 pages, 1 figure
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a general framework to prove Kraft-type inequalities for
prefix-free permutation codes for source coding with various notions of
permutation code and prefix. We also show that the McMillan-type converse
theorem in most of these cases does not hold, and give a general form of a
counterexample. Our approach is more general and works for other structures
besides permutation codes. The classical Kraft inequality for prefix-free codes
as well as results about permutation codes follow as corollaries of our main
theorem and main counterexample.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2016 15:03:53 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Visk",
"Kristo",
""
],
[
"Riet",
"Ago-Erik",
""
]
] |
new_dataset
| 0.998686 |
1601.07077
|
Matthias Schulz
|
Matthias Schulz, Daniel Wegemer and Matthias Hollick
|
NexMon: A Cookbook for Firmware Modifications on Smartphones to Enable
Monitor Mode
|
Project website: https://seemoo.tu-darmstadt.de/nexmon
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full control over a Wi-Fi chip for research purposes is often limited by its
firmware, which makes it hard to evolve communication protocols and test
schemes in practical environments. Monitor mode, which allows eavesdropping on
all frames on a wireless communication channel, is a first step to lower this
barrier. Use cases include, but are not limited to, network packet analyses,
security research and testing of new medium access control layer protocols.
Monitor mode is generally offered by SoftMAC drivers that implement the media
access control sublayer management entity (MLME) in the driver rather than in
the Wi-Fi chip. On smartphones, however, mostly FullMAC chips are used to
reduce power consumption, as MLME tasks do not need to wake up the main
processor. Even though, monitor mode is also possible in FullMAC scenarios, it
is generally not implemented in today's Wi-Fi firmwares used in smartphones.
This work focuses on bringing monitor mode to Nexus 5 smartphones to enhance
the interoperability between applications that require monitor mode and BCM4339
Wi-Fi chips. The implementation is based on our new C-based programming
framework to extend existing Wi-Fi firmwares.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 17:19:20 GMT"
}
] | 2016-01-27T00:00:00 |
[
[
"Schulz",
"Matthias",
""
],
[
"Wegemer",
"Daniel",
""
],
[
"Hollick",
"Matthias",
""
]
] |
new_dataset
| 0.999704 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.