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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1608.03542
|
Daniel Hewlett
|
Daniel Hewlett, Alexandre Lacoste, Llion Jones, Illia Polosukhin,
Andrew Fandrianto, Jay Han, Matthew Kelcey, David Berthelot
|
WikiReading: A Novel Large-scale Language Understanding Task over
Wikipedia
| null |
Proceedings of the 54th Annual Meeting of the Association for
Computational Linguistics (Volume 1: Long Papers), 2016, pp. 1535-1545
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present WikiReading, a large-scale natural language understanding task and
publicly-available dataset with 18 million instances. The task is to predict
textual values from the structured knowledge base Wikidata by reading the text
of the corresponding Wikipedia articles. The task contains a rich variety of
challenging classification and extraction sub-tasks, making it well-suited for
end-to-end models such as deep neural networks (DNNs). We compare various
state-of-the-art DNN-based architectures for document classification,
information extraction, and question answering. We find that models supporting
a rich answer space, such as word or character sequences, perform best. Our
best-performing model, a word-level sequence to sequence model with a mechanism
to copy out-of-vocabulary words, obtains an accuracy of 71.8%.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 17:34:12 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Mar 2017 19:58:44 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Hewlett",
"Daniel",
""
],
[
"Lacoste",
"Alexandre",
""
],
[
"Jones",
"Llion",
""
],
[
"Polosukhin",
"Illia",
""
],
[
"Fandrianto",
"Andrew",
""
],
[
"Han",
"Jay",
""
],
[
"Kelcey",
"Matthew",
""
],
[
"Berthelot",
"David",
""
]
] |
new_dataset
| 0.983483 |
1610.01471
|
Yuan Cao
|
Yuan Cao, Yonglin Cao
|
The Gray image of constacyclic codes over the finite chain ring
$F_{p^m}[u]/\langle u^k\rangle$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a
prime, and $k, N$ be any positive integers. We denote $R_k=F_{p^m}[u]/\langle
u^k\rangle =F_{p^m}+uF_{p^m}+\ldots+u^{k-1}F_{p^m}$ ($u^k=0$) and
$\lambda=a_0+a_1u+\ldots+a_{k-1}u^{k-1}$ where $a_0, a_1,\ldots, a_{k-1}\in
F_{p^m}$ satisfying $a_0\neq 0$ and $a_1=1$. Let $r$ be a positive integer
satisfying $p^{r-1}+1\leq k\leq p^r$. We defined a Gray map from $R_k$ to
$F_{p^m}^{p^r}$ first, then prove that the Gray image of any linear
$\lambda$-constacyclic code over $R_k$ of length $N$ is a distance invariant
linear $a_0^{p^r}$-constacyclic code over $F_{p^m}$ of length $p^rN$.
Furthermore, the generator polynomials for each linear $\lambda$-constacyclic
code over $R_k$ of length $N$ and its Gray image are given respectively.
Finally, some optimal constacyclic codes over $F_{3}$ and $F_{5}$ are
constructed.
|
[
{
"version": "v1",
"created": "Wed, 5 Oct 2016 15:07:04 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Mar 2017 23:52:34 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Cao",
"Yuan",
""
],
[
"Cao",
"Yonglin",
""
]
] |
new_dataset
| 0.990864 |
1702.06478
|
Juan-Manuel Torres-Moreno
|
Xavier Bost, Ilaria Brunetti, Luis Adri\'an Cabrera-Diego,
Jean-Val\`ere Cossu, Andr\'ea Linhares, Mohamed Morchid, Juan-Manuel
Torres-Moreno, Marc El-B\`eze, Richard Dufour
|
Syst\`emes du LIA \`a DEFT'13
|
12 pages, 3 tables, (Paper in French)
|
Proceedings of the Ninth DEFT Workshop, DEFT2013, Les
Sables-d'Olonne, France, 21st June 2013
| null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 2013 D\'efi de Fouille de Textes (DEFT) campaign is interested in two
types of language analysis tasks, the document classification and the
information extraction in the specialized domain of cuisine recipes. We present
the systems that the LIA has used in DEFT 2013. Our systems show interesting
results, even though the complexity of the proposed tasks.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2017 17:14:56 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Bost",
"Xavier",
""
],
[
"Brunetti",
"Ilaria",
""
],
[
"Cabrera-Diego",
"Luis Adrián",
""
],
[
"Cossu",
"Jean-Valère",
""
],
[
"Linhares",
"Andréa",
""
],
[
"Morchid",
"Mohamed",
""
],
[
"Torres-Moreno",
"Juan-Manuel",
""
],
[
"El-Bèze",
"Marc",
""
],
[
"Dufour",
"Richard",
""
]
] |
new_dataset
| 0.990978 |
1703.04346
|
Chunming Tang
|
Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi
|
Linear codes over Fq which are equivalent to LCD codes
|
arXiv admin note: text overlap with arXiv:1702.08033
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with complementary duals (abbreviated LCD) are linear codes
whose intersection with their dual are trivial. When they are binary, they play
an important role in armoring implementations against side-channel attacks and
fault injection attacks. Non-binary LCD codes in characteristic 2 can be
transformed into binary LCD codes by expansion. In this paper, we introduce a
general construction of LCD codes from any linear codes. Further, we show that
any linear code over $\mathbb F_{q} (q>3)$ is equivalent to an Euclidean LCD
code and any linear code over $\mathbb F_{q^2} (q>2)$ is equivalent to a
Hermitian LCD code. Consequently an $[n,k,d]$-linear Euclidean LCD code over
$\mathbb F_q$ with $q>3$ exists if there is an $[n,k,d]$-linear code over
$\mathbb F_q$ and an $[n,k,d]$-linear Hermitian LCD code over $\mathbb F_{q^2}$
with $q>2$ exists if there is an $[n,k,d]$-linear code over $\mathbb F_{q^2}$.
Hence, when $q>3$ (resp.$q>2$) $q$-ary Euclidean (resp. $q^2$-ary Hermitian)
LCD codes possess the same asymptotical bound as $q$-ary linear codes (resp.
$q^2$-ary linear codes). Finally, we present an approach of constructing LCD
codes by extending linear codes.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 11:48:01 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Mar 2017 12:10:18 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Carlet",
"Claude",
""
],
[
"Mesnager",
"Sihem",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
]
] |
new_dataset
| 0.999756 |
1703.05303
|
Ilya Dumer
|
Ilya Dumer
|
Recursive decoding of Reed-Muller codes
| null |
Proc. 37th Allerton Conf. on Commun., Control, and Computing,
Monticello, IL, USA, 1999, pp. 61-69
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New soft- and hard decision decoding algorithms are presented for general
Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$
and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose
code $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ onto subblocks
$u\in\left\{\genfrac{}{}{0pt}{}{m-1}{r}\right\} $ and
$v\in\left\{\genfrac{}{}{0pt}{}{m-1}{r-1}\right\} .$ In decoding, we first try
to find a subblock $v$ from the better protected code and then proceed with the
block $u$. The likelihoods of the received symbols are recalculated in a way
similar to belief propagation. Thus, decoding is relegated to the two
constituent codes. We repeat this recursion and execute decoding only at the
end nodes $\left\{\genfrac{}{}{0pt}{}{j}{1}\right\} $ and
$\left\{\genfrac{}{}{0pt}{}{j}{j-1}\right\} $. The overall complexity has low
order of $n\log n.$ It is shown that this decoding substantially outperforms
other algorithms of polynomial complexity known for RM codes. In particular,
for medium and high code rates, the algorithm corrects most error patterns of
weight $d\ln d/2.$
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 22:25:18 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Dumer",
"Ilya",
""
]
] |
new_dataset
| 0.964788 |
1703.05381
|
Justinas Miseikis
|
Justinas Miseikis and Matthias Ruther and Bernhard Walzel and Mario
Hirz and Helmut Brunner
|
3D Vision Guided Robotic Charging Station for Electric and Plug-in
Hybrid Vehicles
|
6 pages, 8 figures, OAGM and ARW Joint Workshop 2017 on Vision,
Automation and Robotics
| null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electric vehicles (EVs) and plug-in hybrid vehicles (PHEVs) are rapidly
gaining popularity on our roads. Besides a comparatively high purchasing price,
the main two problems limiting their use are the short driving range and
inconvenient charging process. In this paper we address the following by
presenting an automatic robot-based charging station with 3D vision guidance
for plugging and unplugging the charger. First of all, the whole system concept
consisting of a 3D vision system, an UR10 robot and a charging station is
presented. Then we show the shape-based matching methods used to successfully
identify and get the exact pose of the charging port. The same approach is used
to calibrate the camera-robot system by using just known structure of the
connector plug and no additional markers. Finally, a three-step robot motion
planning procedure for plug-in is presented and functionality is demonstrated
in a series of successful experiments.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 20:49:14 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Miseikis",
"Justinas",
""
],
[
"Ruther",
"Matthias",
""
],
[
"Walzel",
"Bernhard",
""
],
[
"Hirz",
"Mario",
""
],
[
"Brunner",
"Helmut",
""
]
] |
new_dataset
| 0.995225 |
1703.05400
|
Shin-Ming Cheng
|
Shin-Ming Cheng and Pin-Yu Chen and Ching-Chao Lin and Hsu-Chun Hsiao
|
Traffic-aware Patching for Cyber Security in Mobile IoT
|
8 pages, 6 figures, To appear in July 2017 IEEE Communications
Magazine, feature topic on "Traffic Measurements for Cyber Security"
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The various types of communication technologies and mobility features in
Internet of Things (IoT) on the one hand enable fruitful and attractive
applications, but on the other hand facilitates malware propagation, thereby
raising new challenges on handling IoT-empowered malware for cyber security.
Comparing with the malware propagation control scheme in traditional wireless
networks where nodes can be directly repaired and secured, in IoT, compromised
end devices are difficult to be patched. Alternatively, blocking malware via
patching intermediate nodes turns out to be a more feasible and practical
solution. Specifically, patching intermediate nodes can effectively prevent the
proliferation of malware propagation by securing infrastructure links and
limiting malware propagation to local device-to-device dissemination. This
article proposes a novel traffic-aware patching scheme to select important
intermediate nodes to patch, which applies to the IoT system with limited
patching resources and response time constraint. Experiments on real-world
trace datasets in IoT networks are conducted to demonstrate the advantage of
the proposed traffic-aware patching scheme in alleviating malware propagation.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 21:59:05 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Cheng",
"Shin-Ming",
""
],
[
"Chen",
"Pin-Yu",
""
],
[
"Lin",
"Ching-Chao",
""
],
[
"Hsiao",
"Hsu-Chun",
""
]
] |
new_dataset
| 0.986381 |
1703.05467
|
Jin Qi
|
Jin Qi, Miao Le, Chunming Li, Ping Zhou
|
Global and Local Information Based Deep Network for Skin Lesion
Segmentation
|
4 pages, 3 figures. ISIC2017
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
With a large influx of dermoscopy images and a growing shortage of
dermatologists, automatic dermoscopic image analysis plays an essential role in
skin cancer diagnosis. In this paper, a new deep fully convolutional neural
network (FCNN) is proposed to automatically segment melanoma out of skin images
by end-to-end learning with only pixels and labels as inputs. Our proposed FCNN
is capable of using both local and global information to segment melanoma by
adopting skipping layers. The public benchmark database consisting of 150
validation images, 600 test images and 2000 training images in the melanoma
detection challenge 2017 at International Symposium Biomedical Imaging 2017 is
used to test the performance of our algorithm. All large size images (for
example, $4000\times 6000$ pixels) are reduced to much smaller images with
$384\times 384$ pixels (more than 10 times smaller). We got and submitted
preliminary results to the challenge without any pre or post processing. The
performance of our proposed method could be further improved by data
augmentation and by avoiding image size reduction.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 03:23:48 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Qi",
"Jin",
""
],
[
"Le",
"Miao",
""
],
[
"Li",
"Chunming",
""
],
[
"Zhou",
"Ping",
""
]
] |
new_dataset
| 0.978497 |
1703.05530
|
Vincent Andrearczyk
|
Vincent Andrearczyk and Paul F. Whelan
|
Convolutional Neural Network on Three Orthogonal Planes for Dynamic
Texture Classification
|
19 pages, 10 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic Textures (DTs) are sequences of images of moving scenes that exhibit
certain stationarity properties in time such as smoke, vegetation and fire. The
analysis of DT is important for recognition, segmentation, synthesis or
retrieval for a range of applications including surveillance, medical imaging
and remote sensing. Deep learning methods have shown impressive results and are
now the new state of the art for a wide range of computer vision tasks
including image and video recognition and segmentation. In particular,
Convolutional Neural Networks (CNNs) have recently proven to be well suited for
texture analysis with a design similar to a filter bank approach. In this
paper, we develop a new approach to DT analysis based on a CNN method applied
on three orthogonal planes x y , xt and y t . We train CNNs on spatial frames
and temporal slices extracted from the DT sequences and combine their outputs
to obtain a competitive DT classifier. Our results on a wide range of commonly
used DT classification benchmark datasets prove the robustness of our approach.
Significant improvement of the state of the art is shown on the larger
datasets.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 09:30:07 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Andrearczyk",
"Vincent",
""
],
[
"Whelan",
"Paul F.",
""
]
] |
new_dataset
| 0.953556 |
1703.05680
|
Andre Ebert
|
Andre Ebert, Sebastian Feld, Florian Dorfmeister
|
Segmented and Directional Impact Detection for Parked Vehicles using
Mobile Devices
|
4 Pages, 6 Figures, Accepted at the The 23rd International Conference
on Systems, Signals and Image Processing (IWSSIP)
| null |
10.1109/IWSSIP.2016.7502762
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mutual usage of vehicles as well as car sharing became more and more
attractive during the last years. Especially in urban environments with limited
parking possibilities and a higher risk for traffic jams, car rentals and
sharing services may save time and money. But when renting a vehicle it could
already be damaged (e.g., scratches or bumps inflicted by a previous user)
without the damage being perceived by the service provider. In order to address
such problems, we present an automated, motion-based system for impact
detection, that facilitates a common smartphone as a sensor platform. The
system is capable of detecting the impact segment and the point of time of an
impact event on a vehicle's surface, as well as its direction of origin. With
this additional specific knowledge, it may be possible to reconstruct the
circumstances of an impact event, e.g., to prove possible innocence of a
service's customer.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 15:51:56 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Ebert",
"Andre",
""
],
[
"Feld",
"Sebastian",
""
],
[
"Dorfmeister",
"Florian",
""
]
] |
new_dataset
| 0.981272 |
1703.05700
|
Ryo Suzuki
|
Ryo Suzuki, Tom Yeh, Koji Yatani, Mark D. Gross
|
Autocomplete Textures for 3D Printing
| null | null | null | null |
cs.HC cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Texture is an essential property of physical objects that affects aesthetics,
usability, and functionality. However, designing and applying textures to 3D
objects with existing tools remains difficult and time-consuming; it requires
proficient 3D modeling skills. To address this, we investigated an
auto-completion approach for efficient texture creation that automates the
tedious, repetitive process of applying texture while allowing flexible
customization. We developed techniques for users to select a target surface,
sketch and manipulate a texture with 2D drawings, and then generate 3D
printable textures onto an arbitrary curved surface. In a controlled experiment
our tool sped texture creation by 80% over conventional tools, a performance
gain that is higher with more complex target surfaces. This result confirms
that auto-completion is powerful for creating 3D textures.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 16:24:01 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Suzuki",
"Ryo",
""
],
[
"Yeh",
"Tom",
""
],
[
"Yatani",
"Koji",
""
],
[
"Gross",
"Mark D.",
""
]
] |
new_dataset
| 0.999783 |
1603.09137
|
Ross Drummond
|
Ross Drummond, Shi Zhao, David A. Howey, Stephen R. Duncan
|
Circuit Synthesis of Electrochemical Supercapacitor Models
| null | null |
10.1016/j.est.2016.11.003
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with the synthesis of RC electrical circuits from
physics-based supercapacitor models describing conservation and diffusion
relationships. The proposed synthesis procedure uses model discretisation,
linearisation, balanced model order reduction and passive network synthesis to
form the circuits. Circuits with different topologies are synthesized from
several physical models. This work will give greater understanding to the
physical interpretation of electrical circuits and will enable the development
of more generalised circuits, since the synthesized impedance functions are
generated by considering the physics, not from experimental fitting which may
ignore certain dynamics.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 11:44:45 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Drummond",
"Ross",
""
],
[
"Zhao",
"Shi",
""
],
[
"Howey",
"David A.",
""
],
[
"Duncan",
"Stephen R.",
""
]
] |
new_dataset
| 0.999429 |
1604.00642
|
Moein Sarvaghad-Moghaddam
|
Moein Sarvaghad-Moghaddam
|
Multi-objective design of quantum circuits using genetic programming
|
This paper has been withdrawn by the author due to some of
modifications in structures
| null | null | null |
cs.ET cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum computing is a new way of data processing based on the concept of
quantum mechanics. Quantum circuit design is a process of converting a quantum
gate to a series of basic gates and is divided into two general categories
based on the decomposition and composition. In the second group, using
evolutionary algorithms and especially genetic algorithms, multiplication of
matrix gates was used to achieve the final characteristic of quantum circuit.
Genetic programming is a subfield of evolutionary computing in which computer
programs evolve to solve studied problems. In past research that has been done
in the field of quantum circuits design, only one cost metrics (usually quantum
cost) has been investigated. In this paper for the first time, a
multi-objective approach has been provided to design quantum circuits using
genetic programming that considers the depth and the cost of nearest neighbor
metrics in addition to quantum cost metric. Another innovation of this article
is the use of two-step fitness function and taking into account the equivalence
of global phase in quantum gates. The results show that the proposed method is
able to find a good answer in a short time.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 14:33:15 GMT"
},
{
"version": "v2",
"created": "Sat, 28 May 2016 09:19:04 GMT"
},
{
"version": "v3",
"created": "Tue, 14 Mar 2017 15:48:36 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Sarvaghad-Moghaddam",
"Moein",
""
]
] |
new_dataset
| 0.98065 |
1608.00771
|
Lee Braine
|
Christopher D. Clack, Vikram A. Bakshi, Lee Braine
|
Smart Contract Templates: foundations, design landscape and research
directions
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
In this position paper, we consider some foundational topics regarding smart
contracts (such as terminology, automation, enforceability, and semantics) and
define a smart contract as an automatable and enforceable agreement. We explore
a simple semantic framework for smart contracts, covering both operational and
non-operational aspects, and describe templates and agreements for
legally-enforceable smart contracts, based on legal documents. Building upon
the Ricardian Contract, we identify operational parameters in the legal
documents and use these to connect legal agreements to standardised code. We
also explore the design landscape, including increasing sophistication of
parameters, increasing use of common standardised code, and long-term research.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 11:15:34 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Aug 2016 16:48:47 GMT"
},
{
"version": "v3",
"created": "Wed, 15 Mar 2017 12:24:25 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Clack",
"Christopher D.",
""
],
[
"Bakshi",
"Vikram A.",
""
],
[
"Braine",
"Lee",
""
]
] |
new_dataset
| 0.970362 |
1608.05578
|
Larry Bull
|
Larry Bull
|
Haploid-Diploid Evolutionary Algorithms
|
arXiv admin note: text overlap with arXiv:1607.00318
| null | null | null |
cs.NE q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper uses the recent idea that the fundamental haploid-diploid
lifecycle of eukaryotic organisms implements a rudimentary form of learning
within evolution. A general approach for evolutionary computation is here
derived that differs from all previous known work using diploid
representations. The primary role of recombination is also changed from that
previously considered in both natural and artificial evolution under the new
view. Using well-known abstract tuneable models it is shown that varying
fitness landscape ruggedness varies the benefit of the new approach.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 12:17:59 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jan 2017 15:02:32 GMT"
},
{
"version": "v3",
"created": "Wed, 15 Mar 2017 15:48:37 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Bull",
"Larry",
""
]
] |
new_dataset
| 0.972956 |
1610.09849
|
Nuno K. Pratas
|
Nuno K. Pratas, Sarath Pattathil, Cedomir Stefanovic, Petar Popovski
|
Massive Machine-Type Communication (mMTC) Access with Integrated
Authentication
|
Accepted for presentation at ICC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a connection establishment protocol with integrated
authentication, suited for Massive Machine-Type Communications (mMTC). The
protocol is contention-based and its main feature is that a device contends
with a unique signature that also enables the authentication of the device
towards the network. The signatures are inspired by Bloom filters and are
created based on the output of the MILENAGE authentication and encryption
algorithm set, which is used in the authentication and security procedures in
the LTE protocol family. We show that our method utilizes the system resources
more efficiently, achieves lower latency of connection establishment for
Poisson arrivals and allows a $87\%$ signalling overhead reduction. An
important conclusion is that the mMTC traffic benefits profoundly from
integration of security features into the connection establishment/access
protocols, instead of addressing them post-hoc, which has been a common
practice.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 10:20:26 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Mar 2017 08:00:54 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Pratas",
"Nuno K.",
""
],
[
"Pattathil",
"Sarath",
""
],
[
"Stefanovic",
"Cedomir",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.995093 |
1703.03652
|
Andrew Paverd
|
Philipp Mundhenk, Andrew Paverd, Artur Mrowca, Sebastian Steinhorst,
Martin Lukasiewycz, Suhaib A. Fahmy, Samarjit Chakraborty
|
Security in Automotive Networks: Lightweight Authentication and
Authorization
|
Authors' preprint of an article to appear in ACM Transactions on
Design Automation of Electronic Systems (ACM TODAES) 2017
| null |
10.1145/2960407
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing amount of interconnections between vehicles, the attack
surface of internal vehicle networks is rising steeply. Although these networks
are shielded against external attacks, they often do not have any internal
security to protect against malicious components or adversaries who breach the
network perimeter. To secure the in-vehicle network, all communicating
components must be authenticated, and only authorized components should be
allowed to send and receive messages. This is achieved using an authentication
framework. Cryptography is widely used to authenticate communicating parties
and provide secure communication channels (e.g., Internet communication).
However, the real-time performance requirements of in-vehicle networks restrict
the types of cryptographic algorithms and protocols that may be used. In
particular, asymmetric cryptography is computationally infeasible during
vehicle operation.
In this work, we address the challenges of designing authentication protocols
for automotive systems. We present Lightweight Authentication for Secure
Automotive Networks (LASAN), a full lifecycle authentication approach. We
describe the core LASAN protocols and show how they protect the internal
vehicle network while complying with the real-time constraints and low
computational resources of this domain. Unlike previous work, we also explain
how this framework can be integrated into all aspects of the automotive
lifecycle, including manufacturing, vehicle maintenance, and software updates.
We evaluate LASAN in two different ways: First, we analyze the security
properties of the protocols using established protocol verification techniques
based on formal methods. Second, we evaluate the timing requirements of LASAN
and compare these to other frameworks using a new highly modular discrete event
simulator for in-vehicle networks, which we have developed for this evaluation.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 12:25:14 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Mar 2017 09:02:40 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Mundhenk",
"Philipp",
""
],
[
"Paverd",
"Andrew",
""
],
[
"Mrowca",
"Artur",
""
],
[
"Steinhorst",
"Sebastian",
""
],
[
"Lukasiewycz",
"Martin",
""
],
[
"Fahmy",
"Suhaib A.",
""
],
[
"Chakraborty",
"Samarjit",
""
]
] |
new_dataset
| 0.998939 |
1703.04583
|
Ferdinand Brasser
|
Benny Fuhry (1), Raad Bahmani (2), Ferdinand Brasser (2), Florian Hahn
(1), Florian Kerschbaum (3) and Ahmad-Reza Sadeghi (2) ((1) SAP Research, (2)
Technische Universit\"at Darmstadt, (3) University of Waterloo)
|
HardIDX: Practical and Secure Index with SGX
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software-based approaches for search over encrypted data are still either
challenged by lack of proper, low-leakage encryption or slow performance.
Existing hardware-based approaches do not scale well due to hardware
limitations and software designs that are not specifically tailored to the
hardware architecture, and are rarely well analyzed for their security (e.g.,
the impact of side channels). Additionally, existing hardware-based solutions
often have a large code footprint in the trusted environment susceptible to
software compromises. In this paper we present HardIDX: a hardware-based
approach, leveraging Intel's SGX, for search over encrypted data. It implements
only the security critical core, i.e., the search functionality, in the trusted
environment and resorts to untrusted software for the remainder. HardIDX is
deployable as a highly performant encrypted database index: it is logarithmic
in the size of the index and searches are performed within a few milliseconds
rather than seconds. We formally model and prove the security of our scheme
showing that its leakage is equivalent to the best known searchable encryption
schemes. Our implementation has a very small code and memory footprint yet
still scales to virtually unlimited search index sizes, i.e., size is limited
only by the general - non-secure - hardware resources.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 17:09:30 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Fuhry",
"Benny",
""
],
[
"Bahmani",
"Raad",
""
],
[
"Brasser",
"Ferdinand",
""
],
[
"Hahn",
"Florian",
""
],
[
"Kerschbaum",
"Florian",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
]
] |
new_dataset
| 0.993421 |
1703.04603
|
Sebastian Schweizer
|
Egor Derevenetc, Roland Meyer, Sebastian Schweizer
|
Locality and Singularity for Store-Atomic Memory Models
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robustness is a correctness notion for concurrent programs running under
relaxed consistency models. The task is to check that the relaxed behavior
coincides (up to traces) with sequential consistency (SC). Although
computationally simple on paper (robustness has been shown to be
PSPACE-complete for TSO, PGAS, and Power), building a practical robustness
checker remains a challenge. The problem is that the various relaxations lead
to a dramatic number of computations, only few of which violate robustness.
In the present paper, we set out to reduce the search space for robustness
checkers. We focus on store-atomic consistency models and establish two
completeness results. The first result, called locality, states that a
non-robust program always contains a violating computation where only one
thread delays commands. The second result, called singularity, is even stronger
but restricted to programs without lightweight fences. It states that there is
a violating computation where a single store is delayed.
As an application of the results, we derive a linear-size source-to-source
translation of robustness to SC-reachability. It applies to general programs,
regardless of the data domain and potentially with an unbounded number of
threads and with unbounded buffers. We have implemented the translation and
verified, for the first time, PGAS algorithms in a fully automated fashion. For
TSO, our analysis outperforms existing tools.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 17:28:27 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Derevenetc",
"Egor",
""
],
[
"Meyer",
"Roland",
""
],
[
"Schweizer",
"Sebastian",
""
]
] |
new_dataset
| 0.989853 |
1703.04636
|
Giovanni Poggi
|
Luca D'Amiano, Davide Cozzolino, Giovanni Poggi, Luisa Verdoliva
|
A PatchMatch-based Dense-field Algorithm for Video Copy-Move Detection
and Localization
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new algorithm for the reliable detection and localization of
video copy-move forgeries. Discovering well crafted video copy-moves may be
very difficult, especially when some uniform background is copied to occlude
foreground objects. To reliably detect both additive and occlusive copy-moves
we use a dense-field approach, with invariant features that guarantee
robustness to several post-processing operations. To limit complexity, a
suitable video-oriented version of PatchMatch is used, with a multiresolution
search strategy, and a focus on volumes of interest. Performance assessment
relies on a new dataset, designed ad hoc, with realistic copy-moves and a wide
variety of challenging situations. Experimental results show the proposed
method to detect and localize video copy-moves with good accuracy even in
adverse conditions.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 18:08:49 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"D'Amiano",
"Luca",
""
],
[
"Cozzolino",
"Davide",
""
],
[
"Poggi",
"Giovanni",
""
],
[
"Verdoliva",
"Luisa",
""
]
] |
new_dataset
| 0.98863 |
1703.04746
|
Vivek Kulkarni
|
Michael J. Hazoglu, Vivek Kulkarni, Steven S. Skiena, Ken A. Dill
|
Citation histories of papers: sometimes the rich get richer, sometimes
they don't
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a simple model of how a publication's citations change over time,
based on pure-birth stochastic processes with a linear cumulative advantage
effect. The model is applied to citation data from the Physical Review corpus
provided by APS. Our model reveals that papers fall into three different
clusters: papers that have rapid initial citations and ultimately high impact
(fast-hi), fast to rise but quick to plateau (fast-flat), or late bloomers
(slow-late), which may either never achieve many citations, or do so many years
after publication. In "fast-hi" and "slow-late", there is a rich-get-richer
effect: papers that have many citations accumulate additional citations more
rapidly while the "fast-flat" papers do not display this effect. We conclude by
showing that only a few years of post-publication statistics are needed to
identify high impact ("fast-hi") papers.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 22:08:34 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Hazoglu",
"Michael J.",
""
],
[
"Kulkarni",
"Vivek",
""
],
[
"Skiena",
"Steven S.",
""
],
[
"Dill",
"Ken A.",
""
]
] |
new_dataset
| 0.957735 |
1703.04783
|
Shinji Watanabe Shinji Watanabe
|
Tsubasa Ochiai, Shinji Watanabe, Takaaki Hori, John R. Hershey
|
Multichannel End-to-end Speech Recognition
| null | null | null | null |
cs.SD cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of speech recognition is in the midst of a paradigm shift:
end-to-end neural networks are challenging the dominance of hidden Markov
models as a core technology. Using an attention mechanism in a recurrent
encoder-decoder architecture solves the dynamic time alignment problem,
allowing joint end-to-end training of the acoustic and language modeling
components. In this paper we extend the end-to-end framework to encompass
microphone array signal processing for noise suppression and speech enhancement
within the acoustic encoding network. This allows the beamforming components to
be optimized jointly within the recognition architecture to improve the
end-to-end speech recognition objective. Experiments on the noisy speech
benchmarks (CHiME-4 and AMI) show that our multichannel end-to-end system
outperformed the attention-based baseline with input from a conventional
adaptive beamformer.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 22:28:51 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Ochiai",
"Tsubasa",
""
],
[
"Watanabe",
"Shinji",
""
],
[
"Hori",
"Takaaki",
""
],
[
"Hershey",
"John R.",
""
]
] |
new_dataset
| 0.975792 |
1703.04819
|
Sandra Avila
|
Afonso Menegola, Julia Tavares, Michel Fornaciali, Lin Tzy Li, Sandra
Avila, Eduardo Valle
|
RECOD Titans at ISIC Challenge 2017
|
5 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This extended abstract describes the participation of RECOD Titans in parts 1
and 3 of the ISIC Challenge 2017 "Skin Lesion Analysis Towards Melanoma
Detection" (ISBI 2017). Although our team has a long experience with melanoma
classification, the ISIC Challenge 2017 was the very first time we worked on
skin-lesion segmentation. For part 1 (segmentation), our final submission used
four of our models: two trained with all 2000 samples, without a validation
split, for 250 and for 500 epochs respectively; and other two trained and
validated with two different 1600/400 splits, for 220 epochs. Those four
models, individually, achieved between 0.780 and 0.783 official validation
scores. Our final submission averaged the output of those four models achieved
a score of 0.793. For part 3 (classification), the submitted test run as well
as our last official validation run were the result from a meta-model that
assembled seven base deep-learning models: three based on Inception-V4 trained
on our largest dataset; three based on Inception trained on our smallest
dataset; and one based on ResNet-101 trained on our smaller dataset. The
results of those component models were stacked in a meta-learning layer based
on an SVM trained on the validation set of our largest dataset.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 23:11:04 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Menegola",
"Afonso",
""
],
[
"Tavares",
"Julia",
""
],
[
"Fornaciali",
"Michel",
""
],
[
"Li",
"Lin Tzy",
""
],
[
"Avila",
"Sandra",
""
],
[
"Valle",
"Eduardo",
""
]
] |
new_dataset
| 0.999651 |
1703.04824
|
Jan Haji\v{c} Jr
|
Jan Haji\v{c} jr., Pavel Pecina
|
In Search of a Dataset for Handwritten Optical Music Recognition:
Introducing MUSCIMA++
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Optical Music Recognition (OMR) has long been without an adequate dataset and
ground truth for evaluating OMR systems, which has been a major problem for
establishing a state of the art in the field. Furthermore, machine learning
methods require training data. We analyze how the OMR processing pipeline can
be expressed in terms of gradually more complex ground truth, and based on this
analysis, we design the MUSCIMA++ dataset of handwritten music notation that
addresses musical symbol recognition and notation reconstruction. The MUSCIMA++
dataset version 0.9 consists of 140 pages of handwritten music, with 91255
manually annotated notation symbols and 82261 explicitly marked relationships
between symbol pairs. The dataset allows training and evaluating models for
symbol classification, symbol localization, and notation graph assembly, both
in isolation and jointly. Open-source tools are provided for manipulating the
dataset, visualizing the data and further annotation, and the dataset itself is
made available under an open license.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 23:21:26 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Hajič",
"Jan",
"jr."
],
[
"Pecina",
"Pavel",
""
]
] |
new_dataset
| 0.992457 |
1703.04837
|
Xintao Wu
|
Shuhan Yuan, Xintao Wu, Yang Xiang
|
SNE: Signed Network Embedding
|
To appear in PAKDD 2017
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several network embedding models have been developed for unsigned networks.
However, these models based on skip-gram cannot be applied to signed networks
because they can only deal with one type of link. In this paper, we present our
signed network embedding model called SNE. Our SNE adopts the log-bilinear
model, uses node representations of all nodes along a given path, and further
incorporates two signed-type vectors to capture the positive or negative
relationship of each edge along the path. We conduct two experiments, node
classification and link prediction, on both directed and undirected signed
networks and compare with four baselines including a matrix factorization
method and three state-of-the-art unsigned network embedding models. The
experimental results demonstrate the effectiveness of our signed network
embedding.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 23:43:15 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Yuan",
"Shuhan",
""
],
[
"Wu",
"Xintao",
""
],
[
"Xiang",
"Yang",
""
]
] |
new_dataset
| 0.951639 |
1703.04874
|
Jovonni Pharr
|
Jovonni L. Pharr
|
Hacker Combat: A Competitive Sport from Programmatic Dueling &
Cyberwarfare
| null | null | null | null |
cs.CR cs.CY cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The history of humanhood has included competitive activities of many
different forms. Sports have offered many benefits beyond that of
entertainment. At the time of this article, there exists not a competitive
ecosystem for cyber security beyond that of conventional capture the flag
competitions, and the like. This paper introduces a competitive framework with
a foundation on computer science, and hacking. This proposed competitive
landscape encompasses the ideas underlying information security, software
engineering, and cyber warfare. We also demonstrate the opportunity to rank,
score, & categorize actionable skill levels into tiers of capability.
Physiological metrics are analyzed from participants during gameplay. These
analyses provide support regarding the intricacies required for competitive
play, and analysis of play. We use these intricacies to build a case for an
organized competitive ecosystem. Using previous player behavior from gameplay,
we also demonstrate the generation of an artificial agent purposed with
gameplay at a competitive level.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 01:38:16 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Pharr",
"Jovonni L.",
""
]
] |
new_dataset
| 0.973147 |
1703.05148
|
Yanzhi Song
|
Songtao Guo, Yixin Luo, and Yanzhi Song
|
Random Forests and VGG-NET: An Algorithm for the ISIC 2017 Skin Lesion
Classification Challenge
|
ISIC2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This manuscript briefly describes an algorithm developed for the ISIC 2017
Skin Lesion Classification Competition. In this task, participants are asked to
complete two independent binary image classification tasks that involve three
unique diagnoses of skin lesions (melanoma, nevus, and seborrheic keratosis).
In the first binary classification task, participants are asked to distinguish
between (a) melanoma and (b) nevus and seborrheic keratosis. In the second
binary classification task, participants are asked to distinguish between (a)
seborrheic keratosis and (b) nevus and melanoma. The other phases of the
competition are not considered. Our proposed algorithm consists of three steps:
preprocessing, classification using VGG-NET and Random Forests, and calculation
of a final score.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 13:33:55 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Guo",
"Songtao",
""
],
[
"Luo",
"Yixin",
""
],
[
"Song",
"Yanzhi",
""
]
] |
new_dataset
| 0.952193 |
1703.05260
|
Ashutosh Modi
|
Ashutosh Modi and Tatjana Anikina and Simon Ostermann and Manfred
Pinkal
|
InScript: Narrative texts annotated with script information
|
Paper accepted at LREC 2016, 9 pages, The corpus can be downloaded
at: http://www.sfb1102.uni-saarland.de/?page_id=2582
|
LREC 2016
| null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the InScript corpus (Narrative Texts Instantiating Script
structure). InScript is a corpus of 1,000 stories centered around 10 different
scenarios. Verbs and noun phrases are annotated with event and participant
types, respectively. Additionally, the text is annotated with coreference
information. The corpus shows rich lexical variation and will serve as a unique
resource for the study of the role of script knowledge in natural language
processing.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 17:01:20 GMT"
}
] | 2017-03-16T00:00:00 |
[
[
"Modi",
"Ashutosh",
""
],
[
"Anikina",
"Tatjana",
""
],
[
"Ostermann",
"Simon",
""
],
[
"Pinkal",
"Manfred",
""
]
] |
new_dataset
| 0.999617 |
1509.01653
|
Talha Khan
|
Talha Ahmed Khan, Ahmed Alkhateeb, Robert W. Heath Jr
|
Millimeter Wave Energy Harvesting
|
30 pages, published in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2016.2577582
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter wave (mmWave) band, which is a prime candidate for 5G cellular
networks, seems attractive for wireless energy harvesting. This is because it
will feature large antenna arrays as well as extremely dense base station (BS)
deployments. The viability of mmWave for energy harvesting though is unclear,
due to the differences in propagation characteristics such as extreme
sensitivity to building blockages. This paper considers a scenario where
low-power devices extract energy and/or information from the mmWave signals.
Using stochastic geometry, analytical expressions are derived for the energy
coverage probability, the average harvested power, and the overall
(energy-and-information) coverage probability at a typical wireless-powered
device in terms of the BS density, the antenna geometry parameters, and the
channel parameters. Numerical results reveal several network and device level
design insights. At the BSs, optimizing the antenna geometry parameters such as
beamwidth can maximize the network-wide energy coverage for a given user
population. At the device level, the performance can be substantially improved
by optimally splitting the received signal for energy and information
extraction, and by deploying multi-antenna arrays. For the latter, an efficient
low-power multi-antenna mmWave receiver architecture is proposed for
simultaneous energy and information transfer. Overall, simulation results
suggest that mmWave energy harvesting generally outperforms lower frequency
solutions.
|
[
{
"version": "v1",
"created": "Sat, 5 Sep 2015 01:37:32 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Apr 2016 14:45:59 GMT"
},
{
"version": "v3",
"created": "Sat, 11 Mar 2017 00:28:14 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Khan",
"Talha Ahmed",
""
],
[
"Alkhateeb",
"Ahmed",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.997066 |
1608.02339
|
Filippo Bonazzi
|
Elena Reshetova, Filippo Bonazzi, N. Asokan
|
SELint: an SEAndroid policy analysis tool
|
12 pages
|
Proceedings of the 3rd International Conference on Information
Systems Security and Privacy - Volume 1, 2017, pages 47-58
|
10.5220/0006126600470058
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SEAndroid enforcement is now mandatory for Android devices. In order to
provide the desired level of security for their products, Android OEMs need to
be able to minimize their mistakes in writing SEAndroid policies. However,
existing SEAndroid and SELinux tools are not very useful for this purpose. It
has been shown that SEAndroid policies found in commercially available devices
for multiple manufacturers contain mistakes and redundancies. In this paper we
present a new tool, SELint, which aims to help OEMs to produce better SEAndroid
policies. SELint is extensible and configurable to suit the needs of different
OEMs. It is provided with a default configuration based on the AOSP SEAndroid
policy, but can be customized by OEMs.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 07:31:40 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Oct 2016 17:18:37 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Mar 2017 13:35:59 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Reshetova",
"Elena",
""
],
[
"Bonazzi",
"Filippo",
""
],
[
"Asokan",
"N.",
""
]
] |
new_dataset
| 0.999564 |
1609.09359
|
Daniele Lain
|
Alberto Compagno, Mauro Conti, Daniele Lain, Gene Tsudik
|
Don't Skype & Type! Acoustic Eavesdropping in Voice-Over-IP
|
To appear in ACM Asia Conference on Computer and Communications
Security (ASIACCS) 2017. 13 pages, 17 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Acoustic emanations of computer keyboards represent a serious privacy issue.
As demonstrated in prior work, physical properties of keystroke sounds might
reveal what a user is typing. However, previous attacks assumed relatively
strong adversary models that are not very practical in many real-world
settings. Such strong models assume: (i) adversary's physical proximity to the
victim, (ii) precise profiling of the victim's typing style and keyboard,
and/or (iii) significant amount of victim's typed information (and its
corresponding sounds) available to the adversary.
This paper presents and explores a new keyboard acoustic eavesdropping attack
that involves Voice-over-IP (VoIP), called Skype & Type (S&T), while avoiding
prior strong adversary assumptions. This work is motivated by the simple
observation that people often engage in secondary activities (including typing)
while participating in VoIP calls. As expected, VoIP software acquires and
faithfully transmits all sounds, including emanations of pressed keystrokes,
which can include passwords and other sensitive information. We show that one
very popular VoIP software (Skype) conveys enough audio information to
reconstruct the victim's input -- keystrokes typed on the remote keyboard. Our
results demonstrate that, given some knowledge on the victim's typing style and
keyboard model, the attacker attains top-5 accuracy of 91.7% in guessing a
random key pressed by the victim.
Furthermore, we demonstrate that S&T is robust to various VoIP issues (e.g.,
Internet bandwidth fluctuations and presence of voice over keystrokes), thus
confirming feasibility of this attack. Finally, it applies to other popular
VoIP software, such as Google Hangouts.
|
[
{
"version": "v1",
"created": "Thu, 29 Sep 2016 14:24:04 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Mar 2017 18:35:01 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Compagno",
"Alberto",
""
],
[
"Conti",
"Mauro",
""
],
[
"Lain",
"Daniele",
""
],
[
"Tsudik",
"Gene",
""
]
] |
new_dataset
| 0.98099 |
1610.09044
|
Hassan Jameel Asghar
|
Jagmohan Chauhan and Benjamin Zi Hao Zhao and Hassan Jameel Asghar and
Jonathan Chan and Mohamed Ali Kaafar
|
BehavioCog: An Observation Resistant Authentication Scheme
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose that by integrating behavioural biometric gestures---such as
drawing figures on a touch screen---with challenge-response based cognitive
authentication schemes, we can benefit from the properties of both. On the one
hand, we can improve the usability of existing cognitive schemes by
significantly reducing the number of challenge-response rounds by (partially)
relying on the hardness of mimicking carefully designed behavioural biometric
gestures. On the other hand, the observation resistant property of cognitive
schemes provides an extra layer of protection for behavioural biometrics; an
attacker is unsure if a failed impersonation is due to a biometric failure or a
wrong response to the challenge. We design and develop an instantiation of such
a "hybrid" scheme, and call it BehavioCog. To provide security close to a
4-digit PIN---one in 10,000 chance to impersonate---we only need two
challenge-response rounds, which can be completed in less than 38 seconds on
average (as estimated in our user study), with the advantage that unlike PINs
or passwords, the scheme is secure under observation.
|
[
{
"version": "v1",
"created": "Fri, 28 Oct 2016 00:40:19 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Mar 2017 00:34:24 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Chauhan",
"Jagmohan",
""
],
[
"Zhao",
"Benjamin Zi Hao",
""
],
[
"Asghar",
"Hassan Jameel",
""
],
[
"Chan",
"Jonathan",
""
],
[
"Kaafar",
"Mohamed Ali",
""
]
] |
new_dataset
| 0.994539 |
1702.08033
|
Chunming Tang
|
Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi
|
Euclidean and Hermitian LCD MDS codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with complementary duals (abbreviated LCD) are linear codes
whose intersection with their dual is trivial. When they are binary, they play
an important role in armoring implementations against side-channel attacks and
fault injection attacks. Non-binary LCD codes in characteristic 2 can be
transformed into binary LCD codes by expansion. On the other hand, being
optimal codes, maximum distance separable codes (abbreviated MDS) have been of
much interest from many researchers due to their theoretical significant and
practical implications. However, little work has been done on LCD MDS codes. In
particular, determining the existence of $q$-ary $[n,k]$ LCD MDS codes for
various lengths $n$ and dimensions $k$ is a basic and interesting problem. In
this paper, we firstly study the problem of the existence of $q$-ary $[n,k]$
LCD MDS codes and completely solve it for the Euclidean case. More
specifically, we show that for $q>3$ there exists a $q$-ary $[n,k]$ Euclidean
LCD MDS code, where $0\le k \le n\le q+1$, or, $q=2^{m}$, $n=q+2$ and $k= 3
\text{or} q-1$. Secondly, we investigate several constructions of new Euclidean
and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and
Hermitian LCD MDS codes use some linear codes with small dimension or
codimension, self-orthogonal codes and generalized Reed-Solomon codes.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 13:55:24 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Mar 2017 11:46:29 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Carlet",
"Claude",
""
],
[
"Mesnager",
"Sihem",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
]
] |
new_dataset
| 0.999623 |
1703.03831
|
Giacomo Cabri
|
Daniele Grassi, Giacomo Barigazzi, Giacomo Cabri
|
User Longevity and Engagement in Mobile Multiplayer Sports Management
Games
| null | null | null | null |
cs.CY cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
Mobile games are extremely popular and engage millions of people every day.
Even if they are often quite simple, their development features a high degree
of difficulty and requires close attention to both achieve a high satisfaction
from users and grant a return to the developers. In this paper we propose a
model that analyzes users' playing session time in order to evaluate and
maximize the longevity of games, even during the first phases of their
development.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 20:10:41 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Grassi",
"Daniele",
""
],
[
"Barigazzi",
"Giacomo",
""
],
[
"Cabri",
"Giacomo",
""
]
] |
new_dataset
| 0.998904 |
1703.03904
|
Alireza Poshtkohi
|
Alireza Poshtkohi, Ali Haj Abutalebi, Shaahin Hessabi
|
DotGrid: a .NET-based cross-platform software for desktop grids
|
20 pages, 14 figures
|
Int. J. Web and Grid Services, Vol. 3, No. 3, pp.313-332, 2007
|
10.1504/IJWGS.2007.014955
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grid infrastructures that have provided wide integrated use of resources are
becoming the de-facto computing platform for solving large-scale problems in
science, engineering and commerce. In this evolution, desktop grid technologies
allow the grid communities to exploit the idle cycles of pervasive desktop PC
systems to increase the available computing power. In this paper we present
DotGrid, a cross-platform grid software. DotGrid is the first comprehensive
desktop grid software utilising Microsoft's .NET Framework in Windows-based
environments and MONO .NET in Unix-class operating systems to operate. Using
DotGrid services and APIs, grid desktop middleware and applications can be
implemented conveniently. We evaluated our DotGrid's performance by
implementing a set of grid-based applications.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 04:13:25 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Poshtkohi",
"Alireza",
""
],
[
"Abutalebi",
"Ali Haj",
""
],
[
"Hessabi",
"Shaahin",
""
]
] |
new_dataset
| 0.998777 |
1703.03963
|
Anton Eremeev
|
Anton Eremeev, Yulia Kovalenko
|
On Solving Travelling Salesman Problem with Vertex Requisitions
|
To appear in Yugoslav Journal of Operations Research
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the Travelling Salesman Problem with Vertex Requisitions, where
for each position of the tour at most two possible vertices are given. It is
known that the problem is strongly NP-hard. The proposed algorithm for this
problem has less time complexity compared to the previously known one. In
particular, almost all feasible instances of the problem are solvable in O(n)
time using the new algorithm, where n is the number of vertices. The developed
approach also helps in fast enumeration of a neighborhood in the local search
and yields an integer programming model with O(n) binary variables for the
problem.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 12:24:19 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Eremeev",
"Anton",
""
],
[
"Kovalenko",
"Yulia",
""
]
] |
new_dataset
| 0.966638 |
1703.04009
|
Thomas Davidson
|
Thomas Davidson, Dana Warmsley, Michael Macy, Ingmar Weber
|
Automated Hate Speech Detection and the Problem of Offensive Language
|
To appear in the Proceedings of ICWSM 2017. Please cite that version
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key challenge for automatic hate-speech detection on social media is the
separation of hate speech from other instances of offensive language. Lexical
detection methods tend to have low precision because they classify all messages
containing particular terms as hate speech and previous work using supervised
learning has failed to distinguish between the two categories. We used a
crowd-sourced hate speech lexicon to collect tweets containing hate speech
keywords. We use crowd-sourcing to label a sample of these tweets into three
categories: those containing hate speech, only offensive language, and those
with neither. We train a multi-class classifier to distinguish between these
different categories. Close analysis of the predictions and the errors shows
when we can reliably separate hate speech from other offensive language and
when this differentiation is more difficult. We find that racist and homophobic
tweets are more likely to be classified as hate speech but that sexist tweets
are generally classified as offensive. Tweets without explicit hate keywords
are also more difficult to classify.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 18:20:13 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Davidson",
"Thomas",
""
],
[
"Warmsley",
"Dana",
""
],
[
"Macy",
"Michael",
""
],
[
"Weber",
"Ingmar",
""
]
] |
new_dataset
| 0.959749 |
1703.04060
|
Derrick Wing Kwan Ng
|
Lou Zhao, Derrick Wing Kwan Ng, and Jinhong Yuan
|
Multi-user Precoding and Channel Estimation for Hybrid Millimeter Wave
Systems
|
15 pages, accepted for publication, JSAC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we develop a low-complexity channel estimation for hybrid
millimeter wave (mmWave) systems, where the number of radio frequency (RF)
chains is much less than the number of antennas equipped at each transceiver.
The proposed mmWave channel estimation algorithm first exploits multiple
frequency tones to estimate the strongest angle-of-arrivals (AoAs) at both base
station (BS) and user sides for the design of analog beamforming matrices. Then
all the users transmit orthogonal pilot symbols to the BS along the directions
of the estimated strongest AoAs in order to estimate the channel. The estimated
channel will be adopted to design the digital zero-forcing (ZF) precoder at the
BS for the multi-user downlink transmission. The proposed channel estimation
algorithm is applicable to both nonsparse and sparse mmWave channel
environments. Furthermore, we derive a tight achievable rate upper bound of the
digital ZF precoding with the proposed channel estimation algorithm scheme. Our
analytical and simulation results show that the proposed scheme obtains a
considerable achievable rate of fully digital systems, where the number of RF
chains equipped at each transceiver is equal to the number of antennas.
Besides, by taking into account the effect of various types of errors, i.e.,
random phase errors, transceiver analog beamforming errors, and equivalent
channel estimation errors, we derive a closed-form approximation for the
achievable rate of the considered scheme. We illustrate the robustness of the
proposed channel estimation and multi-user downlink precoding scheme against
the system imperfection.
|
[
{
"version": "v1",
"created": "Sun, 12 Mar 2017 02:27:20 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Zhao",
"Lou",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Yuan",
"Jinhong",
""
]
] |
new_dataset
| 0.96225 |
1703.04079
|
Ayan Sinha
|
Ayan Sinha, Asim Unmesh, Qixing Huang and Karthik Ramani
|
SurfNet: Generating 3D shape surfaces using deep residual networks
|
CVPR 2017 paper
| null | null | null |
cs.CV cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D shape models are naturally parameterized using vertices and faces, \ie,
composed of polygons forming a surface. However, current 3D learning paradigms
for predictive and generative tasks using convolutional neural networks focus
on a voxelized representation of the object. Lifting convolution operators from
the traditional 2D to 3D results in high computational overhead with little
additional benefit as most of the geometry information is contained on the
surface boundary. Here we study the problem of directly generating the 3D shape
surface of rigid and non-rigid shapes using deep convolutional neural networks.
We develop a procedure to create consistent `geometry images' representing the
shape surface of a category of 3D objects. We then use this consistent
representation for category-specific shape surface generation from a parametric
representation or an image by developing novel extensions of deep residual
networks for the task of geometry image generation. Our experiments indicate
that our network learns a meaningful representation of shape surfaces allowing
it to interpolate between shape orientations and poses, invent new shape
surfaces and reconstruct 3D shape surfaces from previously unseen images.
|
[
{
"version": "v1",
"created": "Sun, 12 Mar 2017 07:21:50 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Sinha",
"Ayan",
""
],
[
"Unmesh",
"Asim",
""
],
[
"Huang",
"Qixing",
""
],
[
"Ramani",
"Karthik",
""
]
] |
new_dataset
| 0.994359 |
1703.04277
|
Faheem Ullah
|
Faheem Ullah, Adam Johannes Raft, Mojtaba Shahin, Mansooreh Zahedi and
Muhammad Ali Babar
|
Security Support in Continuous Deployment Pipeline
| null | null | null | null |
cs.SE cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Continuous Deployment (CD) has emerged as a new practice in the software
industry to continuously and automatically deploy software changes into
production. Continuous Deployment Pipeline (CDP) supports CD practice by
transferring the changes from the repository to production. Since most of the
CDP components run in an environment that has several interfaces to the
Internet, these components are vulnerable to various kinds of malicious
attacks. This paper reports our work aimed at designing secure CDP by utilizing
security tactics. We have demonstrated the effectiveness of five security
tactics in designing a secure pipeline by conducting an experiment on two CDPs
- one incorporates security tactics while the other does not. Both CDPs have
been analyzed qualitatively and quantitatively. We used assurance cases with
goal-structured notations for qualitative analysis. For quantitative analysis,
we used penetration tools. Our findings indicate that the applied tactics
improve the security of the major components (i.e., repository, continuous
integration server, main server) of a CDP by controlling access to the
components and establishing secure connections.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 07:38:16 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Ullah",
"Faheem",
""
],
[
"Raft",
"Adam Johannes",
""
],
[
"Shahin",
"Mojtaba",
""
],
[
"Zahedi",
"Mansooreh",
""
],
[
"Babar",
"Muhammad Ali",
""
]
] |
new_dataset
| 0.992747 |
1703.04283
|
Fabrizio Montecchiani
|
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio
Montecchiani
|
Universal Slope Sets for 1-Bend Planar Drawings
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar
drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a
new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal
we mean that every planar graph of degree $\Delta$ has a planar drawing with at
most one bend per edge and such that the slopes of the segments forming the
edges belong to the given set of slopes. This improves over previous results in
two ways: Firstly, the best previously known upper bound for the 1-bend planar
slope number was $\frac{3}{2} (\Delta -1)$ (the known lower bound being
$\frac{3}{4} (\Delta -1)$); secondly, all the known algorithms to construct
1-bend planar drawings with $O(\Delta)$ slopes use a different set of slopes
for each graph and can have bad angular resolution, while our algorithm uses a
universal set of slopes, which also guarantees that the minimum angle between
any two edges incident to a vertex is $\frac{\pi}{(\Delta-1)}$.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 08:00:31 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Angelini",
"Patrizio",
""
],
[
"Bekos",
"Michael A.",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.999097 |
1703.04336
|
Sergiu Nisioi
|
Anca Bucur and Sergiu Nisioi
|
A Visual Representation of Wittgenstein's Tractatus Logico-Philosophicus
|
Workshop on Language Technology Resources and Tools for Digital
Humanities (LT4DH)
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a data visualization method together with its
potential usefulness in digital humanities and philosophy of language. We
compile a multilingual parallel corpus from different versions of
Wittgenstein's Tractatus Logico-Philosophicus, including the original in German
and translations into English, Spanish, French, and Russian. Using this corpus,
we compute a similarity measure between propositions and render a visual
network of relations for different languages.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 11:19:56 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Bucur",
"Anca",
""
],
[
"Nisioi",
"Sergiu",
""
]
] |
new_dataset
| 0.995843 |
1703.04347
|
Anjany Kumar Sekuboyina
|
Anjany Sekuboyina, Alexander Valentinitsch, Jan S. Kirschke, and
Bjoern H. Menze
|
A Localisation-Segmentation Approach for Multi-label Annotation of
Lumbar Vertebrae using Deep Nets
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-class segmentation of vertebrae is a non-trivial task mainly due to the
high correlation in the appearance of adjacent vertebrae. Hence, such a task
calls for the consideration of both global and local context. Based on this
motivation, we propose a two-staged approach that, given a computed tomography
dataset of the spine, segments the five lumbar vertebrae and simultaneously
labels them. The first stage employs a multi-layered perceptron performing
non-linear regression for locating the lumbar region using the global context.
The second stage, comprised of a fully-convolutional deep network, exploits the
local context in the localised lumbar region to segment and label the lumbar
vertebrae in one go. Aided with practical data augmentation for training, our
approach is highly generalisable, capable of successfully segmenting both
healthy and abnormal vertebrae (fractured and scoliotic spines). We
consistently achieve an average Dice coefficient of over 90 percent on a
publicly available dataset of the xVertSeg segmentation challenge of MICCAI
2016. This is particularly noteworthy because the xVertSeg dataset is beset
with severe deformities in the form of vertebral fractures and scoliosis.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 11:55:16 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Sekuboyina",
"Anjany",
""
],
[
"Valentinitsch",
"Alexander",
""
],
[
"Kirschke",
"Jan S.",
""
],
[
"Menze",
"Bjoern H.",
""
]
] |
new_dataset
| 0.989625 |
1703.04414
|
Ludovic Chandesris
|
Ludovic Chandesris, Valentin Savin and David Declercq
|
Dynamic-SCFlip Decoding of Polar Codes
|
submitted to IEEE Transactions on Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a generalization of the recently introduced Successive
Cancellation Flip (SCFlip) decoding of polar codes, characterized by a number
of extra decoding attempts, where one or several positions are flipped from the
standard Successive Cancellation (SC) decoding. To make such an approach
effective, we first introduce the concept of higher-order bit-flips, and
propose a new metric to determine the bit-flips that are more likely to correct
the trajectory of the SC decoding. We then propose a generalized SCFlip
decoding algorithm, referred to as Dynamic-SCFlip (D-SCFlip), which dynamically
builds a list of candidate bit-flips, while guaranteeing that extra decoding
attempts are performed by decreasing probability of success. Simulation results
show that D-SCFlip is an effective alternative to SC-List decoding of polar
codes, by providing very good error correcting performance, with an average
computation complexity close to the one of the SC decoder.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 14:27:19 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Chandesris",
"Ludovic",
""
],
[
"Savin",
"Valentin",
""
],
[
"Declercq",
"David",
""
]
] |
new_dataset
| 0.991614 |
1703.04526
|
Maria G. Villarrea-Marroquin
|
Jonathan Montalvo-Urquizo, Mar\'ia G. Villarreal-Marroqu\'in, Jos\'e
J. Hern\'andez-Castillo, H\'ector E. Hern\'andez-Gonz\'alez
|
MWTP: Monterrey Weather, Traffic and Pollution Database for Geospatial
Analysis
|
13 pages, 6 figures, 6 Tables
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MWTP: Monterrey Weather, Traffic and Pollution Database contains a
collection of historic weather conditions, and recent traffic and air pollution
data of the metropolitan area of Monterrey, Mexico. Collected data includes:
temperature, humidity, raining conditions, wind speed, travel distance, travel
time, PM2.5, PM10, O3, among many others. As of February 2017, the MWTP
database contained more than 4 million records of weather data, more than 700
thousand records of traffic data and around 57 thousand of air pollution
measurements. Here, it is described how the data is been collected and
structured into a databased, so it can be used for statistical and geospatial
analysis of the Monterrey area.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 06:54:21 GMT"
}
] | 2017-03-14T00:00:00 |
[
[
"Montalvo-Urquizo",
"Jonathan",
""
],
[
"Villarreal-Marroquín",
"María G.",
""
],
[
"Hernández-Castillo",
"José J.",
""
],
[
"Hernández-González",
"Héctor E.",
""
]
] |
new_dataset
| 0.999663 |
1501.05502
|
Mao Tan
|
Mao Tan, Hua-li Yang, Bin Duan, Yong-xin Su, Feng He
|
Optimizing production scheduling of steel plate hot rolling for economic
load dispatch under time-of-use electricity pricing
|
13 pages, 6 figures, 4 tables
| null |
10.1155/2017/1048081
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time-of-Use (TOU) electricity pricing provides an opportunity for industrial
users to cut electricity costs. Although many methods for Economic Load
Dispatch (ELD) under TOU pricing in continuous industrial processing have been
proposed, there are still difficulties in batch-type processing since power
load units are not directly adjustable and nonlinearly depend on production
planning and scheduling. In this paper, for hot rolling, a typical batch-type
and energy intensive process in steel industry, a production scheduling
optimization model for ELD is proposed under TOU pricing, in which the
objective is to minimize electricity costs while considering penalties caused
by jumps between adjacent slabs. A NSGA-II based multi-objective production
scheduling algorithm is developed to obtain Pareto-optimal solutions, and then
TOPSIS based multi-criteria decision-making is performed to recommend an
optimal solution to facilitate filed operation. Experimental results and
analyses show that the proposed method cuts electricity costs in production,
especially in case of allowance for penalty score increase in a certain range.
Further analyses show that the proposed method has effect on peak load
regulation of power grid.
|
[
{
"version": "v1",
"created": "Thu, 22 Jan 2015 14:10:34 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Mar 2017 07:45:00 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Tan",
"Mao",
""
],
[
"Yang",
"Hua-li",
""
],
[
"Duan",
"Bin",
""
],
[
"Su",
"Yong-xin",
""
],
[
"He",
"Feng",
""
]
] |
new_dataset
| 0.972785 |
1609.03897
|
Reza Faghih Mirzaee
|
Reza Faghih Mirzaee, Niloofar Farahani
|
Design of a Ternary Edge-Triggered D Flip-Flap-Flop for Multiple-Valued
Sequential Logic
|
9 Pages, 7 Figures, 5 Tables
| null | null | null |
cs.AR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Development of large computerized systems requires both combinational and
sequential circuits. Registers and counters are two important examples of
sequential circuits, which are widely used in practical applications like CPUs.
The basic element of sequential logic is Flip-Flop, which stores an input value
and returns two outputs (Q and Q_bar). This paper presents an innovative
ternary D Flip-Flap-Flop, which offers circuit designers to customize their
design by eliminating one of the outputs if it is not required. This unique
feature of the new design leads to considerable power reduction in comparison
with the previously presented structures. The proposed design is simulated and
tested by HSPICE and 45 nm CMOS technology.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 15:33:06 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Mar 2017 18:33:06 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Mar 2017 16:15:21 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Mirzaee",
"Reza Faghih",
""
],
[
"Farahani",
"Niloofar",
""
]
] |
new_dataset
| 0.99681 |
1612.06099
|
Valerio Bioglio
|
Frederic Gabry, Valerio Bioglio, Ingmar Land, Jean-Claude Belfiore
|
Multi-Kernel Construction of Polar Codes
|
to appear in: Workshop on Channel Coding for 5G and Future Networks -
IEEE ICC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a generalized construction for binary polar codes based on mixing
multiple kernels of different sizes in order to construct polar codes of block
lengths that are not only powers of integers. This results in a multi kernel
polar code with very good performance while the encoding complexity remains low
and the decoding follows the same general structure as for the original Arikan
polar codes. The construction provides numerous practical advantages as more
code lengths can be achieved without puncturing or shortening. We observe
numerically that the error-rate performance of our construction outperforms
stateof the-art constructions using puncturing methods.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 10:07:07 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Mar 2017 11:29:17 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Gabry",
"Frederic",
""
],
[
"Bioglio",
"Valerio",
""
],
[
"Land",
"Ingmar",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.964674 |
1703.03594
|
Alireza Poshtkohi
|
Alireza Poshtkohi, M.B. Ghaznavi-Ghoushchi
|
The xDotGrid Native, Cross-Platform, High-Performance xDFS File Transfer
Framework
|
25 pages, 20 figures
|
Computers & Electrical Engineering 38(6), 1409-1432 (2012)
|
10.1016/j.compeleceng.2012.04.007
|
01
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce and describe the highly concurrent xDFS file
transfer protocol and examine its cross-platform and cross-language
implementation in native code for both Linux and Windows in 32 or 64-bit
multi-core processor architectures. The implemented xDFS protocol based on
xDotGrid.NET framework is fully compared with the Globus GridFTP protocol. We
finally propose the xDFS protocol as a new paradigm of distributed systems for
Internet services, and data-intensive Grid and Cloud applications. Also, we
incrementally consider different developmental methods of the optimum file
transfer systems, and their advantages and disadvantages. The vision of this
paper tries as possible to minimize the overhead concerned with the file
transfer protocol itself and to examine optimal software design patterns of
that protocol. In all disk-to-disk tests for transferring a 2GB file with or
without parallelism, the xDFS throughput at minimum 30% and at most 53% was
superior to the GridFTP.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 09:33:45 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Poshtkohi",
"Alireza",
""
],
[
"Ghaznavi-Ghoushchi",
"M. B.",
""
]
] |
new_dataset
| 0.995838 |
1703.03609
|
Mostafa Salehi
|
Saeedreza Shehnepoor, Mostafa Salehi, Reza Farahbakhsh and Noel Crespi
|
NetSpam: a Network-based Spam Detection Framework for Reviews in Online
Social Media
| null | null |
10.1109/TIFS.2017.2675361
| null |
cs.SI cs.CL cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, a big part of people rely on available content in social media in
their decisions (e.g. reviews and feedback on a topic or product). The
possibility that anybody can leave a review provide a golden opportunity for
spammers to write spam reviews about products and services for different
interests. Identifying these spammers and the spam content is a hot topic of
research and although a considerable number of studies have been done recently
toward this end, but so far the methodologies put forth still barely detect
spam reviews, and none of them show the importance of each extracted feature
type. In this study, we propose a novel framework, named NetSpam, which
utilizes spam features for modeling review datasets as heterogeneous
information networks to map spam detection procedure into a classification
problem in such networks. Using the importance of spam features help us to
obtain better results in terms of different metrics experimented on real-world
review datasets from Yelp and Amazon websites. The results show that NetSpam
outperforms the existing methods and among four categories of features;
including review-behavioral, user-behavioral, reviewlinguistic,
user-linguistic, the first type of features performs better than the other
categories.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 10:17:27 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Shehnepoor",
"Saeedreza",
""
],
[
"Salehi",
"Mostafa",
""
],
[
"Farahbakhsh",
"Reza",
""
],
[
"Crespi",
"Noel",
""
]
] |
new_dataset
| 0.982825 |
1703.03631
|
Matias Martinez
|
Matias Martinez, Sylvain Lecomte
|
XamForumDB: a dataset for studying Q&A about cross-platform mobile
applications development
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android and iSO are the two mobile platforms present in almost all
smartphones build during last years. Developing an application that targets
both platforms is a challenge. A traditional way is to build two different
apps, one in Java for Android, the other in Objective-C for iOS. Xamarin is a
framework for developing Android and iOS apps which allows developers to share
most of the application code across multiple implementations of the app, each
for a specific platform. In this paper, we present XamForumDB, a database that
stores discussions, questions and answers extracted from the Xamarin forum. We
envision research community could use it for studying, for instance, the
problematic of developing such kind of applications.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 11:26:56 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Martinez",
"Matias",
""
],
[
"Lecomte",
"Sylvain",
""
]
] |
new_dataset
| 0.999882 |
1703.03677
|
Weile Zhang
|
Weile Zhang and Hai Lin
|
Uncoordinated Frequency Shifts based Pilot Contamination Attack
Detection
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pilot contamination attack is an important kind of active eavesdropping
activity conducted by a malicious user during channel training phase. In this
paper, motivated by the fact that frequency asynchronism could introduce
divergence of the transmitted pilot signals between intended user and attacker,
we propose a new uncoordinated frequency shift (UFS) scheme for detection of
pilot contamination attack in multiple antenna system. An attack detection
algorithm is further developed based on source enumeration method. Both the
asymptotic detection performance analysis and numerical results are provided to
verify the proposed studies. The results demonstrate that the proposed UFS
scheme can achieve comparable detection performance as the existing
superimposed random sequence based scheme, without sacrifice of legitimate
channel estimation performance.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 13:30:51 GMT"
}
] | 2017-03-13T00:00:00 |
[
[
"Zhang",
"Weile",
""
],
[
"Lin",
"Hai",
""
]
] |
new_dataset
| 0.987521 |
1612.06151
|
Hendrik Barfuss
|
Hendrik Barfuss and Michael Buerger and Jasper Podschus and Walter
Kellermann
|
HRTF-based two-dimensional robust least-squares frequency-invariant
beamformer design for robot audition
|
Joint Workshop on Hands-free Speech Communication and Microphone
Arrays (HSCMA), March 2017, San Francisco, CA, USA
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a two-dimensional Head-Related Transfer Function
(HRTF)-based robust beamformer design for robot audition, which allows for
explicit control of the beamformer response for the entire three-dimensional
sound field surrounding a humanoid robot. We evaluate the proposed method by
means of both signal-independent and signal-dependent measures in a robot
audition scenario. Our results confirm the effectiveness of the proposed
two-dimensional HRTF-based beamformer design, compared to our previously
published one-dimensional HRTF-based beamformer design, which was carried out
for a fixed elevation angle only.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 12:19:25 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Feb 2017 08:51:24 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Mar 2017 08:47:38 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Barfuss",
"Hendrik",
""
],
[
"Buerger",
"Michael",
""
],
[
"Podschus",
"Jasper",
""
],
[
"Kellermann",
"Walter",
""
]
] |
new_dataset
| 0.984606 |
1702.01795
|
Peter Patel-Schneider
|
Peter F. Patel-Schneider
|
ASHACL: Alternative Shapes Constraint Language
|
18 pages
| null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
ASHACL, a variant of the W3C Shapes Constraint Language, is designed to
determine whether an RDF graph meets some conditions. These conditions are
grouped into shapes, which validate whether particular RDF terms each meet the
constraints of the shape. Shapes are themselves expressed as RDF triples in an
RDF graph, called a shapes graph.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 21:13:43 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Mar 2017 13:10:02 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Patel-Schneider",
"Peter F.",
""
]
] |
new_dataset
| 0.999827 |
1703.02968
|
Daniele Bernardini
|
Andrea Barillari (1), Daniele Bernardini (1), Pierluigi Crescenzi (2)
((1) Intranet Standard GmbH, Munich, Germany (2) Universit\`a di Firenze,
Italy)
|
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content
|
translated from the paper published in the conference proceedings for
GARR 2017
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose applying the crowdsourcing approach to a software
platform that uses a modern and state-of-the-art 3D game engine. This platform
could facilitate the generation and manipulation of interactive 3D environments
by a community of users producing different content such as cultural heritage,
scientific virtual labs, games, novel art forms and virtual museums.
|
[
{
"version": "v1",
"created": "Wed, 8 Mar 2017 18:16:21 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Barillari",
"Andrea",
""
],
[
"Bernardini",
"Daniele",
""
],
[
"Crescenzi",
"Pierluigi",
""
]
] |
new_dataset
| 0.984849 |
1703.03017
|
Rub\'en Saborido Infantes
|
Rub\'en Saborido, Foutse Khomh, Yann-Ga\"el Gu\'eh\'eneuc, Giuliano
Antoniol
|
Comprehension of Ads-supported and Paid Android Applications: Are They
Different?
|
Accepted for publication in the proceedings of the IEEE International
Conference on Program Comprehension 2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Android market is a place where developers offer paid and-or free apps to
users. Free apps are interesting to users because they can try them immediately
without incurring a monetary cost. However, free apps often have limited
features and-or contain ads when compared to their paid counterparts. Thus,
users may eventually need to pay to get additional features and-or remove ads.
While paid apps have clear market values, their ads-supported versions are not
entirely free because ads have an impact on performance.
In this paper, first, we perform an exploratory study about ads-supported and
paid apps to understand their differences in terms of implementation and
development process. We analyze 40 Android apps and we observe that (i)
ads-supported apps are preferred by users although paid apps have a better
rating, (ii) developers do not usually offer a paid app without a corresponding
free version, (iii) ads-supported apps usually have more releases and are
released more often than their corresponding paid versions, (iv) there is no a
clear strategy about the way developers set prices of paid apps, (v) paid apps
do not usually include more functionalities than their corresponding
ads-supported versions, (vi) developers do not always remove ad networks in
paid versions of their ads-supported apps, and (vii) paid apps require less
permissions than ads-supported apps. Second, we carry out an experimental study
to compare the performance of ads-supported and paid apps and we propose four
equations to estimate the cost of ads-supported apps. We obtain that (i)
ads-supported apps use more resources than their corresponding paid versions
with statistically significant differences and (ii) paid apps could be
considered a most cost-effective choice for users because their cost can be
amortized in a short period of time, depending on their usage.
|
[
{
"version": "v1",
"created": "Wed, 8 Mar 2017 20:04:30 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Saborido",
"Rubén",
""
],
[
"Khomh",
"Foutse",
""
],
[
"Guéhéneuc",
"Yann-Gaël",
""
],
[
"Antoniol",
"Giuliano",
""
]
] |
new_dataset
| 0.998719 |
1703.03070
|
Aytac Azgin
|
Asit Chakraborti, Syed Obaid Amin, Aytac Azgin, Ravishankar Ravindran,
Guo-Qiang Wang
|
SRMCA: A Scalable and Resilient Real-time Multi-party Communication
Architecture
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a scalable and resilient real-time multi-party
communication architecture for the delivery of mixed media streams, for which
content centric networking, with its intelligent network layer, is chosen for
implementation to address the shortcomings of the current IP-based Internet
architecture. Content centric networking (CCN) represents one of the major
proposals targeting future Internet architecture, and is typically optimized
for non-realtime content delivery. Proposed research in this paper addresses
the architectural challenges for large-scale deployment of CCN to serve
real-time applications from the perspective of a multi-party video conferencing
framework, with the necessary architectural components to support application-
and system-level objectives, in regards to quality of experience, resource
utilization, and scalability. We present an in-depth analysis of the proposed
architecture by first providing an analytical driven study for the system, and
then demonstrating its performance by emulating the architecture over a
test-bed with a large number of participants involved in many-to-many
communication sessions. The results suggest that the proposed architecture can
scale well above 50 participants without incurring significant penalty in
signaling, communication, and computing overheads, with capability to support
100 or more participants.
|
[
{
"version": "v1",
"created": "Wed, 8 Mar 2017 23:21:53 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Chakraborti",
"Asit",
""
],
[
"Amin",
"Syed Obaid",
""
],
[
"Azgin",
"Aytac",
""
],
[
"Ravindran",
"Ravishankar",
""
],
[
"Wang",
"Guo-Qiang",
""
]
] |
new_dataset
| 0.969686 |
1703.03101
|
Zhongqi Sun
|
Zhongqi Sun, Li Dai, Kun Liu, Yuanqing Xia, Karl Henrik Johansson
|
Robust MPC for tracking of nonholonomic robots with additive
disturbances
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, two robust model predictive control (MPC) schemes are proposed
for tracking control of nonholonomic systems with bounded disturbances:
tube-MPC and nominal robust MPC (NRMPC). In tube-MPC, the control signal
consists of a control action and a nonlinear feedback law based on the
deviation of the actual states from the states of a nominal system. It renders
the actual trajectory within a tube centered along the optimal trajectory of
the nominal system. Recursive feasibility and input-to-state stability are
established and the constraints are ensured by tightening the input domain and
the terminal region. While in NRMPC, an optimal control sequence is obtained by
solving an optimization problem based on the current state, and the first
portion of this sequence is applied to the real system in an open-loop manner
during each sampling period. The state of nominal system model is updated by
the actual state at each step, which provides additional a feedback. By
introducing a robust state constraint and tightening the terminal region,
recursive feasibility and input-to-state stability are guaranteed. Simulation
results demonstrate the effectiveness of both strategies proposed.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 01:39:27 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Sun",
"Zhongqi",
""
],
[
"Dai",
"Li",
""
],
[
"Liu",
"Kun",
""
],
[
"Xia",
"Yuanqing",
""
],
[
"Johansson",
"Karl Henrik",
""
]
] |
new_dataset
| 0.960577 |
1703.03115
|
Patrick Sol\'e
|
Adel Alahmadi, Cem G\"uneri, Buket \"Ozkaya, Hatoon Shoaib, Patrick
Sol\'e
|
On linear complementary-dual multinegacirculant codes
|
arXiv admin note: text overlap with arXiv:1606.00815
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with complementary-duals (LCD) are linear codes that intersect
with their dual trivially. Multinegacirculant codes of index $2$ that are LCD
are characterized algebraically and some good codes are found in this family.
Exact enumeration is performed for indices 2 and 3, and for all indices $t$ for
a special case of the co-index by using their concatenated structure.
Asymptotic existence results are derived for the special class of such codes
that are one-generator and have co-index a power of two by means of Dickson
polynomials. This shows that there are infinite families of LCD
multinegacirculant codes with relative distance satisfying a modified
Varshamov-Gilbert bound.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 02:57:09 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Alahmadi",
"Adel",
""
],
[
"Güneri",
"Cem",
""
],
[
"Özkaya",
"Buket",
""
],
[
"Shoaib",
"Hatoon",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.998164 |
1703.03186
|
Lucia Maddalena
|
Mario Rosario Guarracino and Lucia Maddalena
|
Segmenting Dermoscopic Images
|
4 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an automatic algorithm, named SDI, for the segmentation of skin
lesions in dermoscopic images, articulated into three main steps: selection of
the image ROI, selection of the segmentation band, and segmentation. We present
extensive experimental results achieved by the SDI algorithm on the lesion
segmentation dataset made available for the ISIC 2017 challenge on Skin Lesion
Analysis Towards Melanoma Detection, highlighting its advantages and
disadvantages.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 09:14:40 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Guarracino",
"Mario Rosario",
""
],
[
"Maddalena",
"Lucia",
""
]
] |
new_dataset
| 0.998864 |
1703.03222
|
B.Sundar Rajan
|
Divya U. S. and B. Sundar Rajan
|
Maximum Likelihood Decoder for Index Coded PSK Modulation for Priority
Ordered Receivers
|
9 pages, 6 figures and 2 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Index coded PSK modulation over an AWGN broadcast channel, for a given index
coding problem (ICP) is studied. For a chosen index code and an arbitrary
mapping (of broadcast vectors to PSK signal points), we have derived a decision
rule for the maximum likelihood (ML) decoder. The message error performance of
a receiver at high SNR is characterized by a parameter called PSK Index Coding
Gain (PSK-ICG). The PSK-ICG of a receiver is determined by a metric called
minimum inter-set distance. For a given ICP with an order of priority among the
receivers, and a chosen $2^N$-PSK constellation we propose an algorithm to find
(index code, mapping) pairs, each of which gives the best performance in terms
of PSK-ICG of the receivers. No other pair of index code (of length $N$ with
$2^N$ broadcast vectors) and mapping can give a better PSK-ICG for the highest
priority receiver. Also, given that the highest priority receiver achieves its
best performance, the next highest priority receiver achieves its maximum gain
possible and so on in the specified order or priority.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 10:45:31 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"S.",
"Divya U.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.999287 |
1703.03378
|
Wei-Han Lee
|
Wei-Han Lee, Ruby Lee
|
Multi-sensor authentication to improve smartphone security
|
Published in International Conference on Information Systems Security
and Privacy (ICISSP), 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The widespread use of smartphones gives rise to new security and privacy
concerns. Smartphone thefts account for the largest percentage of thefts in
recent crime statistics. Using a victim's smartphone, the attacker can launch
impersonation attacks, which threaten the security of the victim and other
users in the network. Our threat model includes the attacker taking over the
phone after the user has logged on with his password or pin. Our goal is to
design a mechanism for smartphones to better authenticate the current user,
continuously and implicitly, and raise alerts when necessary. In this paper, we
propose a multi-sensors-based system to achieve continuous and implicit
authentication for smartphone users. The system continuously learns the owner's
behavior patterns and environment characteristics, and then authenticates the
current user without interrupting user-smartphone interactions. Our method can
adaptively update a user's model considering the temporal change of user's
patterns. Experimental results show that our method is efficient, requiring
less than 10 seconds to train the model and 20 seconds to detect the abnormal
user, while achieving high accuracy (more than 90%). Also the combination of
more sensors provide better accuracy. Furthermore, our method enables adjusting
the security level by changing the sampling rate.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 18:27:48 GMT"
}
] | 2017-03-10T00:00:00 |
[
[
"Lee",
"Wei-Han",
""
],
[
"Lee",
"Ruby",
""
]
] |
new_dataset
| 0.965371 |
1603.01911
|
Andr\'e van Renssen
|
Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia
Mitsou, Andr\'e van Renssen, Marcel Roeloffzen, Yushi Uno
|
Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
| null | null | null | null |
cs.DM cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study a cooperative card game called Hanabi from the
viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has
one among $c$ colors and a number between $1$ and $n$. The aim is to make, for
each color, a pile of cards of that color with all increasing numbers from $1$
to $n$. At each time during the game, each player holds $h$ cards in hand.
Cards are drawn sequentially from a deck and the players should decide whether
to play, discard or store them for future use. One of the features of the game
is that the players can see their partners' cards but not their own and
information must be shared through hints.
We introduce a single-player, perfect-information model and show that the
game is intractable even for this simplified version where we forego both the
hidden information and the multiplayer aspect of the game, even when the player
can only hold two cards in her hand. On the positive side, we show that the
decision version of the problem---to decide whether or not numbers from $1$
through $n$ can be played for every color---can be solved in (almost) linear
time for some restricted cases.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 01:29:25 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 04:53:03 GMT"
},
{
"version": "v3",
"created": "Wed, 8 Mar 2017 02:53:44 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Baffier",
"Jean-Francois",
""
],
[
"Chiu",
"Man-Kwun",
""
],
[
"Diez",
"Yago",
""
],
[
"Korman",
"Matias",
""
],
[
"Mitsou",
"Valia",
""
],
[
"van Renssen",
"André",
""
],
[
"Roeloffzen",
"Marcel",
""
],
[
"Uno",
"Yushi",
""
]
] |
new_dataset
| 0.998688 |
1604.03000
|
Frederic Sala
|
Frederic Sala, Ryan Gabrys, Clayton Schoeny, and Lara Dolecek
|
Exact Reconstruction from Insertions in Synchronization Codes
|
18 pages, 3 figures. Accepted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work studies problems in data reconstruction, an important area with
numerous applications. In particular, we examine the reconstruction of binary
and non-binary sequences from synchronization (insertion/deletion-correcting)
codes. These sequences have been corrupted by a fixed number of symbol
insertions (larger than the minimum edit distance of the code), yielding a
number of distinct traces to be used for reconstruction. We wish to know the
minimum number of traces needed for exact reconstruction. This is a general
version of a problem tackled by Levenshtein for uncoded sequences.
We introduce an exact formula for the maximum number of common supersequences
shared by sequences at a certain edit distance, yielding an upper bound on the
number of distinct traces necessary to guarantee exact reconstruction. Without
specific knowledge of the codewords, this upper bound is tight. We apply our
results to the famous single deletion/insertion-correcting Varshamov-Tenengolts
(VT) codes and show that a significant number of VT codeword pairs achieve the
worst-case number of outputs needed for exact reconstruction. We also consider
extensions to other channels, such as adversarial deletion and
insertion/deletion channels and probabilistic channels.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 15:37:25 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Mar 2017 23:23:20 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Sala",
"Frederic",
""
],
[
"Gabrys",
"Ryan",
""
],
[
"Schoeny",
"Clayton",
""
],
[
"Dolecek",
"Lara",
""
]
] |
new_dataset
| 0.956793 |
1612.07766
|
Joshua Lind
|
Joshua Lind, Ittay Eyal, Peter Pietzuch and Emin G\"un Sirer
|
Teechan: Payment Channels Using Trusted Execution Environments
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blockchain protocols are inherently limited in transaction throughput and
latency. Recent efforts to address performance and scale blockchains have
focused on off-chain payment channels. While such channels can achieve low
latency and high throughput, deploying them securely on top of the Bitcoin
blockchain has been difficult, partly because building a secure implementation
requires changes to the underlying protocol and the ecosystem.
We present Teechan, a full-duplex payment channel framework that exploits
trusted execution environments. Teechan can be deployed securely on the
existing Bitcoin blockchain without having to modify the protocol. It: (i)
achieves a higher transaction throughput and lower transaction latency than
prior solutions; (ii) enables unlimited full-duplex payments as long as the
balance does not exceed the channel's credit; (iii) requires only a single
message to be sent per payment in any direction; and (iv) places at most two
transactions on the blockchain under any execution scenario.
We have built and deployed the Teechan framework using Intel SGX on the
Bitcoin network. Our experiments show that, not counting network latencies,
Teechan can achieve 2,480 transactions per second on a single channel, with
sub-millisecond latencies.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 19:38:29 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Mar 2017 23:51:06 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Lind",
"Joshua",
""
],
[
"Eyal",
"Ittay",
""
],
[
"Pietzuch",
"Peter",
""
],
[
"Sirer",
"Emin Gün",
""
]
] |
new_dataset
| 0.997406 |
1701.08607
|
Samiya Shimly
|
Samiya Shimly, David B. Smith and Samaneh Movassaghi
|
Cross-layer optimized routing with low duty cycle TDMA across multiple
wireless body area networks
|
6 pages, 6 figures, conference submission. arXiv admin note:
substantial text overlap with arXiv:1701.08605
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the performance of two cross-layer optimized dynamic
routing techniques for radio interference mitigation across multiple coexisting
wireless body area networks (BANs), based on real-life measurements. At the
network layer, the best route is selected according to channel state
information from the physical layer, associated with low duty cycle TDMA at the
MAC layer. The routing techniques (i.e., shortest path routing (SPR), and novel
cooperative multi-path routing (CMR) incorporating 3-branch selection
combining) perform real-time and reliable data transfer across BANs operating
near the 2.4 GHz ISM band. An open-access experimental data set of 'everyday'
mixed-activities is used for analyzing the proposed cross-layer optimization.
We show that CMR gains up to 14 dB improvement with 8.3% TDMA duty cycle, and
even 10 dB improvement with 0.2% TDMA duty cycle over SPR, at 10% outage
probability at a realistic signal-to-interference-plus-noise ratio (SINR).
Acceptable packet delivery ratios (PDR) and spectral efficiencies are obtained
from SPR and CMR with reasonably sensitive receivers across a range of TDMA low
duty cycles, with up to 9 dB improvement of CMR over SPR at 90% PDR. The
distribution fits for received SINR through routing are also derived and
validated with theoretical analysis.
|
[
{
"version": "v1",
"created": "Fri, 13 Jan 2017 04:30:36 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Mar 2017 03:05:45 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Shimly",
"Samiya",
""
],
[
"Smith",
"David B.",
""
],
[
"Movassaghi",
"Samaneh",
""
]
] |
new_dataset
| 0.978793 |
1703.02602
|
Carlos Vega
|
Carlos Vega, Paula Roquero, Rafael Leira, Ivan Gonzalez, Javier Aracil
|
Loginson: a transform and load system for very large scale log analysis
in large IT infrastructures
|
23 pages, Figure 12
|
The Journal of Supercomputing; Volume 73-2017; pp 1-22
|
10.1007/s11227-017-1990-1
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, most systems and applications produce log records that are useful
for security and monitoring purposes such as debugging programming errors,
checking system status, and detecting configuration problems or even attacks.
To this end, a log repository becomes necessary whereby logs can be accessed
and visualized in a timely manner. This paper presents Loginson, a
high-performance log centralization system for large-scale log collection and
processing in large IT infrastructures. Besides log collection, Loginson
provides high-level analytics through a visual interface for the purpose of
troubleshooting critical incidents. We note that Loginson outperforms all of
the other log centralization solutions by taking full advantage of the vertical
scalability, and therefore decreasing Capital Expenditure (CAPEX) and Operating
Expense (OPEX) costs for deployment scenarios with a huge volume of log data.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 21:30:17 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Vega",
"Carlos",
""
],
[
"Roquero",
"Paula",
""
],
[
"Leira",
"Rafael",
""
],
[
"Gonzalez",
"Ivan",
""
],
[
"Aracil",
"Javier",
""
]
] |
new_dataset
| 0.999066 |
1703.02798
|
Bruno Clerckx
|
Bruno Clerckx, Zati Bayani Zawawi and Kaibin Huang
|
Wirelessly Powered Backscatter Communications: Waveform Design and
SNR-Energy Tradeoff
|
submitted for publication
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper shows that wirelessly powered backscatter communications is
subject to a fundamental tradeoff between the harvested energy at the tag and
the reliability of the backscatter communication, measured in terms of SNR at
the reader. Assuming the RF transmit signal is a multisine waveform adaptive to
the channel state information, we derive a systematic approach to optimize the
transmit waveform weights (amplitudes and phases) in order to enlarge as much
as possible the SNRenergy region. Performance evaluations confirm the
significant benefits of using multiple frequency components in the adaptive
transmit multisine waveform to exploit the nonlinearity of the rectifier and a
frequency diversity gain.
|
[
{
"version": "v1",
"created": "Wed, 8 Mar 2017 12:01:15 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Clerckx",
"Bruno",
""
],
[
"Zawawi",
"Zati Bayani",
""
],
[
"Huang",
"Kaibin",
""
]
] |
new_dataset
| 0.992735 |
1703.02852
|
Yulong Pei
|
Wouter Ligtenberg and Yulong Pei
|
Introduction to a Temporal Graph Benchmark
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A temporal graph is a data structure, consisting of nodes and edges in which
the edges are associated with time labels. To analyze the temporal graph, the
first step is to find a proper graph dataset/benchmark. While many temporal
graph datasets exist online, none could be found that used the interval labels
in which each edge is associated with a starting and ending time. Therefore we
create a temporal graph data based on Wikipedia reference graph for temporal
analysis. This report aims to provide more details of this graph benchmark to
those who are interested in using it.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 20:19:32 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Ligtenberg",
"Wouter",
""
],
[
"Pei",
"Yulong",
""
]
] |
new_dataset
| 0.999453 |
1703.02866
|
Ramanujan M. S.
|
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
|
The Half-integral Erd\"os-P\'osa Property for Non-null Cycles
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Group Labeled Graph is a pair $(G,\Lambda)$ where $G$ is an oriented graph
and $\Lambda$ is a mapping from the arcs of $G$ to elements of a group. A (not
necessarily directed) cycle $C$ is called non-null if for any cyclic ordering
of the arcs in $C$, the group element obtained by `adding' the labels on
forward arcs and `subtracting' the labels on reverse arcs is not the identity
element of the group. Non-null cycles in group labeled graphs generalize
several well-known graph structures, including odd cycles.
In this paper, we prove that non-null cycles on Group Labeled Graphs have the
half-integral Erd\"os-P\'osa property. That is, there is a function $f:{\mathbb
N}\to {\mathbb N}$ such that for any $k\in {\mathbb N}$, any group labeled
graph $(G,\Lambda)$ has a set of $k$ non-null cycles such that each vertex of
$G$ appears in at most two of these cycles or there is a set of at most $f(k)$
vertices that intersects every non-null cycle. Since it is known that non-null
cycles do not have the integeral Erd\"os-P\'osa property in general, a
half-integral Erd\"os-P\'osa result is the best one could hope for.
|
[
{
"version": "v1",
"created": "Wed, 8 Mar 2017 15:16:05 GMT"
}
] | 2017-03-09T00:00:00 |
[
[
"Lokshtanov",
"Daniel",
""
],
[
"Ramanujan",
"M. S.",
""
],
[
"Saurabh",
"Saket",
""
]
] |
new_dataset
| 0.984073 |
1504.07494
|
John B. Little
|
John B. Little
|
Toric Codes and Finite Geometries
|
11 pages
|
Finite Fields Appl. 45 (2017), 203-216
| null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how the theory of affine geometries over the ring ${\mathbb
Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and
generalized toric codes over ${\mathbb F}_q$. The minimum distance of these
codes is strongly tied to the collections of lines in the finite geometry that
contain subsets of the exponent vectors of the monomials that are evaluated to
produce the standard generator matrix for the code. We argue that this
connection is, in fact, even more direct than the connection with the lattice
geometry of those exponent vectors considered as elements of ${\mathbb Z}^2$ or
${\mathbb R}^2$. This point of view should be useful both as a way to visualize
properties of these codes and as a guide to heuristic searches for good codes
constructed in this fashion. In particular, we will use these ideas to see a
reason why these constructions have been so successful over the field ${\mathbb
F}_8$, but less successful in other cases.
This corrected version (posted on 3/6/2017) adds a necessary hypothesis in
Proposition 2.4. A counterexample to the previous version was pointed out to
the author by Melda G\"or\"ur and the author thanks her for bringing that to
his attention. Theorem 3.2 and Corollary 3.3 are also reformulated so they do
not refer to the new more restricted Proposition 2.4.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 14:23:45 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 22:39:09 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Little",
"John B.",
""
]
] |
new_dataset
| 0.992538 |
1610.04982
|
Hongliang Zhang
|
Hongliang Zhang and Yun Liao and Lingyang Song
|
D2D-U: Device-to-Device Communications in Unlicensed Bands for 5G and
Beyond
| null | null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-to-Device (D2D) communication, which enables direct communication
between nearby mobile devices, is an attractive add-on component to improve
spectrum efficiency and user experience by reusing licensed cellular spectrum
in 5G system. In this paper, we propose to enable D2D communication in
unlicensed spectrum (D2D-U) as an underlay of the uplink LTE network for
further booming the network capacity. A sensing-based protocol is designed to
support the unlicensed channel access for both LTE and D2D users. We further
investigate the subchannel allocation problem to maximize the sum rate of LTE
and D2D users while taking into account their interference to the existing
Wi-Fi systems. Specifically, we formulate the subchannel allocation as a
many-to-many matching problem with externalities, and develop an iterative
user-subchannel swap algorithm. Analytical and simulation results show that the
proposed D2D-U scheme can significantly improve the system sum-rate.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2016 06:32:03 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Mar 2017 02:56:54 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Zhang",
"Hongliang",
""
],
[
"Liao",
"Yun",
""
],
[
"Song",
"Lingyang",
""
]
] |
new_dataset
| 0.999063 |
1610.05432
|
Markus Eich
|
Markus Eich and Sareh Shirazi and Gordon Wyeth
|
ARTiS: Appearance-based Action Recognition in Task Space for Real-Time
Human-Robot Collaboration
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To have a robot actively supporting a human during a collaborative task, it
is crucial that robots are able to identify the current action in order to
predict the next one. Common approaches make use of high-level knowledge, such
as object affordances, semantics or understanding of actions in terms of pre-
and post-conditions. These approaches often require hand-coded a priori
knowledge, time- and resource-intensive or supervised learning techniques.
We propose to reframe this problem as an appearance-based place recognition
problem. In our framework, we regard sequences of visual images of human
actions as a map in analogy to the visual place recognition problem. Observing
the task for the second time, our approach is able to recognize pre-observed
actions in a one-shot learning approach and is thereby able to recognize the
current observation in the task space. We propose two new methods for creating
and aligning action observations within a task map. We compare and verify our
approaches with real data of humans assembling several types of IKEA flat
packs.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 04:45:03 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Mar 2017 03:58:38 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Eich",
"Markus",
""
],
[
"Shirazi",
"Sareh",
""
],
[
"Wyeth",
"Gordon",
""
]
] |
new_dataset
| 0.985425 |
1702.06887
|
Arman Ahmadzadeh
|
Arman Ahmadzadeh, Vahid Jamali, Adam Noel, Robert Schober
|
Diffusive Mobile Molecular Communications Over Time-Variant Channels
|
4 pages, 3 figures, 1 table. Accepted for publication in IEEE
Communications Letters (Author's comment: Manuscript submitted Jan. 19, 2017;
revised Feb. 20, 2017; accepted Feb. 22, 2017)
| null |
10.1109/LCOMM.2017.2678467
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter introduces a formalism for modeling time-variant channels for
diffusive molecular communication systems. In particular, we consider a fluid
environment where one transmitter nano-machine and one receiver nano-machine
are subjected to Brownian motion in addition to the diffusive motion of the
information molecules used for communication. Due to the stochastic movements
of the transmitter and receiver nano-machines, the statistics of the channel
impulse response change over time. We show that the time-variant behaviour of
the channel can be accurately captured by appropriately modifying the diffusion
coefficient of the information molecules. Furthermore, we derive an analytical
expression for evaluation of the expected error probability of a simple
detector for the considered system. The accuracy of the proposed analytical
expression is verified via particle-based simulation of the Brownian motion.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 16:42:27 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Ahmadzadeh",
"Arman",
""
],
[
"Jamali",
"Vahid",
""
],
[
"Noel",
"Adam",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.999446 |
1703.01537
|
Soteris Demetriou
|
Soteris Demetriou, Nan Zhang, Yeonjoon Lee, Xiaofeng Wang, Carl
Gunter, Xiaoyong Zhou, Michael Grace
|
Guardian of the HAN: Thwarting Mobile Attacks on Smart-Home Devices
Using OS-level Situation Awareness
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new development of smart-home systems is to use mobile apps to control IoT
devices across a Home Area Network (HAN). Those systems tend to rely on the
Wi-Fi router to authenticate other devices; as verified in our study, IoT
vendors tend to trust all devices connected to the HAN. This treatment exposes
them to the attack from malicious apps, particularly those running on
authorized phones, which the router does not have information to control, as
confirmed in our measurement study. Mitigating this threat cannot solely rely
on IoT manufacturers, which may need to change the hardware on the devices to
support encryption, increasing the cost of the device, or software developers
who we need to trust to implement security correctly.
In this work, we present a new technique to control the communication between
the IoT devices and their apps in a unified, backward-compatible way. Our
approach, called Hanguard, does not require any changes to the IoT devices
themselves, the IoT apps or the OS of the participating phones. Hanguard
achieves a fine-grained, per-app protection through bridging the OS-level
situation awareness and the router-level per-flow control: each phone runs a
non-system userspace Monitor app to identify the party that attempts to access
the protected IoT device and inform the router through a control plane of its
access decision; the router enforces the decision on the data plane after
verifying whether the phone should be allowed to talk to the device. Hanguard
uses a role-based access control (RBAC) schema which leverages type enforcement
(TE) and multi-category security (MCS) primitives to define highly flexible
access control rules. We implemented our design over both Android and iOS (>95%
of mobile OS market share) and a popular router. Our study shows that Hanguard
is both efficient and effective in practice.
|
[
{
"version": "v1",
"created": "Sat, 4 Mar 2017 23:58:05 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Mar 2017 01:46:20 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Demetriou",
"Soteris",
""
],
[
"Zhang",
"Nan",
""
],
[
"Lee",
"Yeonjoon",
""
],
[
"Wang",
"Xiaofeng",
""
],
[
"Gunter",
"Carl",
""
],
[
"Zhou",
"Xiaoyong",
""
],
[
"Grace",
"Michael",
""
]
] |
new_dataset
| 0.96658 |
1703.02124
|
Jonathan Leach
|
Susan Chan, Ryan E. Warburton, Genevieve Gariepy, Jonathan Leach,
Daniele Faccio
|
Non-line-of-sight tracking of people at long range
| null | null | null | null |
cs.CV physics.ins-det
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A remote-sensing system that can determine the position of hidden objects has
applications in many critical real-life scenarios, such as search and rescue
missions and safe autonomous driving. Previous work has shown the ability to
range and image objects hidden from the direct line of sight, employing
advanced optical imaging technologies aimed at small objects at short range. In
this work we demonstrate a long-range tracking system based on single laser
illumination and single-pixel single-photon detection. This enables us to track
one or more people hidden from view at a stand-off distance of over 50~m. These
results pave the way towards next generation LiDAR systems that will
reconstruct not only the direct-view scene but also the main elements hidden
behind walls or corners.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 16:57:04 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Chan",
"Susan",
""
],
[
"Warburton",
"Ryan E.",
""
],
[
"Gariepy",
"Genevieve",
""
],
[
"Leach",
"Jonathan",
""
],
[
"Faccio",
"Daniele",
""
]
] |
new_dataset
| 0.984408 |
1703.02145
|
Justin Miller
|
Justin Miller, Andres Hasfura, Shih-Yuan Liu, Jonathan P. How
|
Dynamic Arrival Rate Estimation for Campus Mobility on Demand Network
Graphs
|
Appears in 2016 IEEE/RSJ International Conference on Intelligent
Robots and Systems (IROS).
http://ieeexplore.ieee.org/abstract/document/7759357/
|
IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS), Daejeon, 2016, pp. 2285-2292 (2016)
|
10.1109/IROS.2016.7759357
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobility On Demand (MOD) systems are revolutionizing transportation in urban
settings by improving vehicle utilization and reducing parking congestion. A
key factor in the success of an MOD system is the ability to measure and
respond to real-time customer arrival data. Real time traffic arrival rate data
is traditionally difficult to obtain due to the need to install fixed sensors
throughout the MOD network. This paper presents a framework for measuring
pedestrian traffic arrival rates using sensors onboard the vehicles that make
up the MOD fleet. A novel distributed fusion algorithm is presented which
combines onboard LIDAR and camera sensor measurements to detect trajectories of
pedestrians with a 90% detection hit rate with 1.5 false positives per minute.
A novel moving observer method is introduced to estimate pedestrian arrival
rates from pedestrian trajectories collected from mobile sensors. The moving
observer method is evaluated in both simulation and hardware and is shown to
achieve arrival rate estimates comparable to those that would be obtained with
multiple stationary sensors.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 23:02:34 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Miller",
"Justin",
""
],
[
"Hasfura",
"Andres",
""
],
[
"Liu",
"Shih-Yuan",
""
],
[
"How",
"Jonathan P.",
""
]
] |
new_dataset
| 0.986898 |
1703.02166
|
Tran Nam Van
|
Nam Tran Van
|
Building a Syllable Database to Solve the Problem of Khmer Word
Segmentation
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Word segmentation is a basic problem in natural language processing. With the
languages having the complex writing system like the Khmer language in Southern
of Vietnam, this problem really very intractable, posing the significant
challenges. Although there are some experts in Vietnam as well as international
having deeply researched this problem, there are still no reasonable results
meeting the demand, in particular, no treated thoroughly the ambiguous
phenomenon, in the process of Khmer language processing so far. This paper
present a solution based on the syllable division into component clusters using
two syllable models proposed, thereby building a Khmer syllable database, is
still not actually available. This method using a lexical database updated from
the online Khmer dictionaries and some supported dictionaries serving role of
training data and complementary linguistic characteristics. Each component
cluster is labelled and located by the first and last letter to identify
entirety a syllable. This approach is workable and the test results achieve
high accuracy, eliminate the ambiguity, contribute to solving the problem of
word segmentation and applying efficiency in Khmer language processing.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 01:13:39 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Van",
"Nam Tran",
""
]
] |
new_dataset
| 0.996183 |
1703.02195
|
EPTCS
|
Samuel Bucheli (Z\"uhlke Engineering AG), Meghdad Ghari (School of
Mathematics, Institute for Research in Fundamental Sciences (IPM)), Thomas
Studer (University of Bern)
|
Temporal Justification Logic
|
In Proceedings M4M9 2017, arXiv:1703.01736
|
EPTCS 243, 2017, pp. 59-74
|
10.4204/EPTCS.243.5
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Justification logics are modal-like logics with the additional capability of
recording the reason, or justification, for modalities in syntactic structures,
called justification terms. Justification logics can be seen as explicit
counterparts to modal logics. The behavior and interaction of agents in
distributed system is often modeled using logics of knowledge and time. In this
paper, we sketch some preliminary ideas on how the modal knowledge part of such
logics of knowledge and time could be replaced with an appropriate
justification logic.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 03:16:07 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Bucheli",
"Samuel",
"",
"Zühlke Engineering AG"
],
[
"Ghari",
"Meghdad",
"",
"School of\n Mathematics, Institute for Research in Fundamental Sciences"
],
[
"Studer",
"Thomas",
"",
"University of Bern"
]
] |
new_dataset
| 0.98371 |
1703.02200
|
Lu Yu
|
Xingsi Zhong and Yu Fu and Lu Yu and Richard Brooks
|
Stealthy Malware Traffic - Not as Innocent as It Looks
|
9 figures, 2 tables
|
Zhong, Xingsi, Yu Fu, Lu Yu, Richard Brooks, and G. Kumar
Venayagamoorthy. "Stealthy malware traffic-Not as innocent as it looks." In
Malicious and Unwanted Software (MALWARE), 2015 10th International Conference
on, pp. 110-116. IEEE, 2015
|
10.1109/MALWARE.2015.7413691
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Malware is constantly evolving. Although existing countermeasures have
success in malware detection, corresponding counter-countermeasures are always
emerging. In this study, a counter-countermeasure that avoids network-based
detection approaches by camouflaging malicious traffic as an innocuous protocol
is presented. The approach includes two steps: Traffic format transformation
and side-channel massage (SCM). Format transforming encryption (FTE) translates
protocol syntax to mimic another innocuous protocol while SCM obscures traffic
side-channels. The proposed approach is illustrated by transforming Zeus botnet
(Zbot) Command and Control (C&C) traffic into smart grid Phasor Measurement
Unit (PMU) data. The experimental results show that the transformed traffic is
identified by Wireshark as synchrophasor protocol, and the transformed protocol
fools current side-channel attacks. Moreover, it is shown that a real smart
grid Phasor Data Concentrator (PDC) accepts the false PMU data.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 03:30:26 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Zhong",
"Xingsi",
""
],
[
"Fu",
"Yu",
""
],
[
"Yu",
"Lu",
""
],
[
"Brooks",
"Richard",
""
]
] |
new_dataset
| 0.982237 |
1703.02247
|
Marius Rafailescu
|
Marius Rafailescu
|
Fault Tolerant Leader Election in Distributed Systems
| null | null |
10.5121/ijcsit.2017.9102
|
International Journal of Computer Science & Information Technology
(IJCSIT) Vol 9, No 1, February 2017
|
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
There are many distributed systems which use a leader in their logic. When
such systems need to be fault tolerant and the current leader suffers a
technical problem, it is necesary to apply a special algorithm in order to
choose a new leader. In this paper I present a new fault tolerant algorithm
which elects a new leader based on a random roulette wheel selection.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 07:28:05 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Rafailescu",
"Marius",
""
]
] |
new_dataset
| 0.999469 |
1703.02475
|
Silu Huang
|
Silu Huang, Liqi Xu, Jialin Liu, Aaron Elmore, Aditya Parameswaran
|
OrpheusDB: Bolt-on Versioning for Relational Databases
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data science teams often collaboratively analyze datasets, generating dataset
versions at each stage of iterative exploration and analysis. There is a
pressing need for a system that can support dataset versioning, enabling such
teams to efficiently store, track, and query across dataset versions. We
introduce OrpheusDB, a dataset version control system that "bolts on"
versioning capabilities to a traditional relational database system, thereby
gaining the analytics capabilities of the database "for free". We develop and
evaluate multiple data models for representing versioned data, as well as a
light-weight partitioning scheme, LyreSplit, to further optimize the models for
reduced query latencies. With LyreSplit, OrpheusDB is on average 1000x faster
in finding effective (and better) partitionings than competing approaches,
while also reducing the latency of version retrieval by up to 20x relative to
schemes without partitioning. LyreSplit can be applied in an online fashion as
new versions are added, alongside an intelligent migration scheme that reduces
migration time by 10x on average.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 17:09:13 GMT"
}
] | 2017-03-08T00:00:00 |
[
[
"Huang",
"Silu",
""
],
[
"Xu",
"Liqi",
""
],
[
"Liu",
"Jialin",
""
],
[
"Elmore",
"Aaron",
""
],
[
"Parameswaran",
"Aditya",
""
]
] |
new_dataset
| 0.999424 |
1506.06021
|
Emilio Ferrara
|
Emilio Ferrara, Zeyao Yang
|
Measuring Emotional Contagion in Social Media
|
10 pages, 5 figures
|
PloS one, 10(11), e0142390. 2015
|
10.1371/journal.pone.0142390
| null |
cs.SI cs.LG physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media are used as main discussion channels by millions of individuals
every day. The content individuals produce in daily social-media-based
micro-communications, and the emotions therein expressed, may impact the
emotional states of others. A recent experiment performed on Facebook
hypothesized that emotions spread online, even in absence of non-verbal cues
typical of in-person interactions, and that individuals are more likely to
adopt positive or negative emotions if these are over-expressed in their social
network. Experiments of this type, however, raise ethical concerns, as they
require massive-scale content manipulation with unknown consequences for the
individuals therein involved. Here, we study the dynamics of emotional
contagion using Twitter. Rather than manipulating content, we devise a null
model that discounts some confounding factors (including the effect of
emotional contagion). We measure the emotional valence of content the users are
exposed to before posting their own tweets. We determine that on average a
negative post follows an over-exposure to 4.34% more negative content than
baseline, while positive posts occur after an average over-exposure to 4.50%
more positive contents. We highlight the presence of a linear relationship
between the average emotional valence of the stimuli users are exposed to, and
that of the responses they produce. We also identify two different classes of
individuals: highly and scarcely susceptible to emotional contagion. Highly
susceptible users are significantly less inclined to adopt negative emotions
than the scarcely susceptible ones, but equally likely to adopt positive
emotions. In general, the likelihood of adopting positive emotions is much
greater than that of negative emotions.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 14:29:24 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Ferrara",
"Emilio",
""
],
[
"Yang",
"Zeyao",
""
]
] |
new_dataset
| 0.959749 |
1509.01608
|
Emilio Ferrara
|
Santa Agreste, Salvatore Catanese, Pasquale De Meo, Emilio Ferrara,
Giacomo Fiumara
|
Network Structure and Resilience of Mafia Syndicates
|
22 pages, 10 figures, 1 table
|
Information Sciences, 351, 30-47. 2016
|
10.1016/j.ins.2016.02.027
| null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the results of the study of Sicilian Mafia
organization by using Social Network Analysis. The study investigates the
network structure of a Mafia organization, describing its evolution and
highlighting its plasticity to interventions targeting membership and its
resilience to disruption caused by police operations. We analyze two different
datasets about Mafia gangs built by examining different digital trails and
judicial documents spanning a period of ten years: the former dataset includes
the phone contacts among suspected individuals, the latter is constituted by
the relationships among individuals actively involved in various criminal
offenses. Our report illustrates the limits of traditional investigation
methods like tapping: criminals high up in the organization hierarchy do not
occupy the most central positions in the criminal network, and oftentimes do
not appear in the reconstructed criminal network at all. However, we also
suggest possible strategies of intervention, as we show that although criminal
networks (i.e., the network encoding mobsters and crime relationships) are
extremely resilient to different kind of attacks, contact networks (i.e., the
network reporting suspects and reciprocated phone calls) are much more
vulnerable and their analysis can yield extremely valuable insights.
|
[
{
"version": "v1",
"created": "Fri, 4 Sep 2015 21:13:16 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Agreste",
"Santa",
""
],
[
"Catanese",
"Salvatore",
""
],
[
"De Meo",
"Pasquale",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"Fiumara",
"Giacomo",
""
]
] |
new_dataset
| 0.997716 |
1601.05140
|
Aram Galstyan
|
V.S. Subrahmanian, Amos Azaria, Skylar Durst, Vadim Kagan, Aram
Galstyan, Kristina Lerman, Linhong Zhu, Emilio Ferrara, Alessandro Flammini,
Filippo Menczer, Andrew Stevens, Alexander Dekhtyar, Shuyang Gao, Tad Hogg,
Farshad Kooti, Yan Liu, Onur Varol, Prashant Shiralkar, Vinod Vydiswaran,
Qiaozhu Mei, Tim Hwang
|
The DARPA Twitter Bot Challenge
|
IEEE Computer Magazine, in press
|
Computer 49 (6), 38-46. IEEE, 2016
|
10.1109/MC.2016.183
| null |
cs.SI cs.AI cs.CY physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A number of organizations ranging from terrorist groups such as ISIS to
politicians and nation states reportedly conduct explicit campaigns to
influence opinion on social media, posing a risk to democratic processes. There
is thus a growing need to identify and eliminate "influence bots" - realistic,
automated identities that illicitly shape discussion on sites like Twitter and
Facebook - before they get too influential. Spurred by such events, DARPA held
a 4-week competition in February/March 2015 in which multiple teams supported
by the DARPA Social Media in Strategic Communications program competed to
identify a set of previously identified "influence bots" serving as ground
truth on a specific topic within Twitter. Past work regarding influence bots
often has difficulty supporting claims about accuracy, since there is limited
ground truth (though some exceptions do exist [3,7]). However, with the
exception of [3], no past work has looked specifically at identifying influence
bots on a specific topic. This paper describes the DARPA Challenge and
describes the methods used by the three top-ranked teams.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2016 00:23:03 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2016 23:02:08 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Subrahmanian",
"V. S.",
""
],
[
"Azaria",
"Amos",
""
],
[
"Durst",
"Skylar",
""
],
[
"Kagan",
"Vadim",
""
],
[
"Galstyan",
"Aram",
""
],
[
"Lerman",
"Kristina",
""
],
[
"Zhu",
"Linhong",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"Flammini",
"Alessandro",
""
],
[
"Menczer",
"Filippo",
""
],
[
"Stevens",
"Andrew",
""
],
[
"Dekhtyar",
"Alexander",
""
],
[
"Gao",
"Shuyang",
""
],
[
"Hogg",
"Tad",
""
],
[
"Kooti",
"Farshad",
""
],
[
"Liu",
"Yan",
""
],
[
"Varol",
"Onur",
""
],
[
"Shiralkar",
"Prashant",
""
],
[
"Vydiswaran",
"Vinod",
""
],
[
"Mei",
"Qiaozhu",
""
],
[
"Hwang",
"Tim",
""
]
] |
new_dataset
| 0.999047 |
1607.06819
|
Emilio Ferrara
|
Xinxin Yang and Bo-Chiuan Chen and Mrinmoy Maity and Emilio Ferrara
|
Social Politics: Agenda Setting and Political Communication on Social
Media
| null |
International Conference on Social Informatics (pp. 330-344).
Springer. 2016
|
10.1007/978-3-319-47880-7_20
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media play an increasingly important role in political communication.
Various studies investigated how individuals adopt social media for political
discussion, to share their views about politics and policy, or to mobilize and
protest against social issues. Yet, little attention has been devoted to the
main actors of political discussions: the politicians. In this paper, we
explore the topics of discussion of U.S. President Obama and the 50 U.S. State
Governors using Twitter data and agenda-setting theory as a tool to describe
the patterns of daily political discussion, uncovering the main topics of
attention and interest of these actors. We examine over one hundred thousand
tweets produced by these politicians and identify seven macro-topics of
conversation, finding that Twitter represents a particularly appealing vehicle
of conversation for American opposition politicians. We highlight the main
motifs of political conversation of the two parties, discovering that
Republican and Democrat Governors are more or less similarly active on Twitter
but exhibit different styles of communication. Finally, by reconstructing the
networks of occurrences of Governors' hashtags and keywords related to
political issues, we observe that Republicans form a tight core, with a
stronger shared agenda on many issues of discussion.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 20:00:25 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Yang",
"Xinxin",
""
],
[
"Chen",
"Bo-Chiuan",
""
],
[
"Maity",
"Mrinmoy",
""
],
[
"Ferrara",
"Emilio",
""
]
] |
new_dataset
| 0.997665 |
1611.03854
|
Arman Shojaeifard
|
Arman Shojaeifard and Kai-Kit Wong and Marco Di Renzo and Gan Zheng
and Khairi Ashour Hamdi and Jie Tang
|
Massive MIMO-Enabled Full-Duplex Cellular Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we provide a theoretical framework for the study of massive
multiple-input multiple-output (MIMO)-enabled full-duplex (FD) cellular
networks in which the self-interference (SI) channels follow the Rician
distribution and other channels are Rayleigh distributed. To facilitate
bi-directional wireless functionality, we adopt (i) a downlink (DL) linear
zero-forcing with self-interference-nulling (ZF-SIN) precoding scheme at the FD
base stations (BSs), and (ii) an uplink (UL) self-interference-aware (SIA)
fractional power control mechanism at the FD user equipments (UEs). Linear ZF
receivers are further utilized for signal detection in the UL. The results
indicate that the UL rate bottleneck in the baseline FD single-antenna system
can be overcome via exploiting massive MIMO. On the other hand, the findings
may be viewed as a reality-check, since we show that, under state-of-the-art
system parameters, the spectral efficiency (SE) gain of FD massive MIMO over
its half-duplex (HD) counterpart largely depends on the SI cancellation
capability of the UEs. In addition, the anticipated two-fold increase in SE is
shown to be only achievable with an infinitely large number of antennas.
|
[
{
"version": "v1",
"created": "Fri, 11 Nov 2016 20:59:44 GMT"
},
{
"version": "v2",
"created": "Sat, 4 Mar 2017 12:19:47 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Shojaeifard",
"Arman",
""
],
[
"Wong",
"Kai-Kit",
""
],
[
"Di Renzo",
"Marco",
""
],
[
"Zheng",
"Gan",
""
],
[
"Hamdi",
"Khairi Ashour",
""
],
[
"Tang",
"Jie",
""
]
] |
new_dataset
| 0.992921 |
1702.02240
|
Weijun Zhu
|
Weijun Zhu
|
A novel type of Automata for dynamic, heterogeneous and random
architectures
|
8 pages, 4 figure
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the author aims to establish a mathematical model for a mimic
computer. To this end, a novel automaton is proposed. First, a one-dimensional
cellular automaton is used for expressing some dynamic changes in the structure
of a computing unit, a sequential automaton is employed to describe some state
transitions, a hierarchical automaton is employed to express the different
granularities of some computing units, and a probabilistic automaton is used to
depict some random changes of a computing unit. Second, the new automaton is
obtained by combining the various types of automata mentioned above in the
certain logical relationship. To the best of our knowledge, the new automaton
model is the first automaton which can portray the operation semantics for a
mimic computing system, and it can directly describe some behaviors of a mimic
computer.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 00:59:53 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Feb 2017 08:45:07 GMT"
},
{
"version": "v3",
"created": "Sun, 5 Mar 2017 02:03:51 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Zhu",
"Weijun",
""
]
] |
new_dataset
| 0.984239 |
1702.08272
|
Phil Ammirato
|
Phil Ammirato, Patrick Poirson, Eunbyung Park, Jana Kosecka, Alexander
C. Berg
|
A Dataset for Developing and Benchmarking Active Vision
|
To appear at ICRA 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new public dataset with a focus on simulating robotic vision
tasks in everyday indoor environments using real imagery. The dataset includes
20,000+ RGB-D images and 50,000+ 2D bounding boxes of object instances densely
captured in 9 unique scenes. We train a fast object category detector for
instance detection on our data. Using the dataset we show that, although
increasingly accurate and fast, the state of the art for object detection is
still severely impacted by object scale, occlusion, and viewing direction all
of which matter for robotics applications. We next validate the dataset for
simulating active vision, and use the dataset to develop and evaluate a
deep-network-based system for next best move prediction for object
classification using reinforcement learning. Our dataset is available for
download at cs.unc.edu/~ammirato/active_vision_dataset_website/.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 13:23:35 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Mar 2017 20:06:58 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Ammirato",
"Phil",
""
],
[
"Poirson",
"Patrick",
""
],
[
"Park",
"Eunbyung",
""
],
[
"Kosecka",
"Jana",
""
],
[
"Berg",
"Alexander C.",
""
]
] |
new_dataset
| 0.999781 |
1703.01423
|
Jun Shintake
|
Jun Shintake, Harshal Sonar, Egor Piskarev, Jamie Paik and Dario
Floreano
|
Soft Pneumatic Gelatin Actuator for Edible Robotics
|
Submitted to IEEE/RSJ International Conference on Intelligent Robots
and Systems 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a fully edible pneumatic actuator based on gelatin-glycerol
composite. The actuator is monolithic, fabricated via a molding process, and
measures 90 mm in length, 20 mm in width, and 17 mm in thickness. Thanks to the
composite mechanical characteristics similar to those of silicone elastomers,
the actuator exhibits a bending angle of 170.3 {\deg} and a blocked force of
0.34 N at the applied pressure of 25 kPa. These values are comparable to
elastomer based pneumatic actuators. As a validation example, two actuators are
integrated to form a gripper capable of handling various objects, highlighting
the high performance and applicability of the edible actuator. These edible
actuators, combined with other recent edible materials and electronics, could
lay the foundation for a new type of edible robots.
|
[
{
"version": "v1",
"created": "Sat, 4 Mar 2017 09:27:19 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Shintake",
"Jun",
""
],
[
"Sonar",
"Harshal",
""
],
[
"Piskarev",
"Egor",
""
],
[
"Paik",
"Jamie",
""
],
[
"Floreano",
"Dario",
""
]
] |
new_dataset
| 0.998917 |
1703.01441
|
Chaoping Xing
|
Lingfei Jin and Chaoping Xing
|
Algebraic geometry codes with complementary duals exceed the asymptotic
Gilbert-Varshamov bound
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It was shown by Massey that linear complementary dual (LCD for short) codes
are asymptotically good. In 2004, Sendrier proved that LCD codes meet the
asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound
still remains to be the best asymptotical lower bound for LCD codes. In this
paper, we show that an algebraic geometry code over a finite field of even
characteristic is equivalent to an LCD code and consequently there exists a
family of LCD codes that are equivalent to algebraic geometry codes and exceed
the asymptotical GV bound.
|
[
{
"version": "v1",
"created": "Sat, 4 Mar 2017 11:11:11 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.961109 |
1703.01446
|
He Jiang
|
He Jiang, Liming Nie, Zeyi Sun, Zhilei Ren, Weiqiang Kong, Tao Zhang,
Xiapu Luo
|
ROSF: Leveraging Information Retrieval and Supervised Learning for
Recommending Code Snippets
|
14 pages, 6 figures, IEEE Transactions on Services Computing, 2016
| null |
10.1109/TSC.2016.2592909
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When implementing unfamiliar programming tasks, developers commonly search
code examples and learn usage patterns of APIs from the code examples or reuse
them by copy-pasting and modifying. For providing high-quality code examples,
previous studies present several methods to recommend code snippets mainly
based on information retrieval. In this paper, to provide better recommendation
results, we propose ROSF, Recommending cOde Snippets with multi-aspect
Features, a novel method combining both information retrieval and supervised
learning. In our method, we recommend Top-Kcode snippets for a givenfree-form
query based on two stages, i.e., coarse-grained searching and fine-grained
re-ranking. First, we generate a code snippet candidate set by searching a code
snippet corpus using an information retrieval method. Second, we predict
probability values of the code snippets for different relevance scores in the
candidate set by the learned prediction model from a training set, re-rank
these candidate code snippets according to the probability values, and
recommend the final results to developers. We conduct several experiments to
evaluate our method in a large-scale corpus containing 921,713 real-world code
snippets. The results show that ROSF is an effective method for code snippets
recommendation and outperforms the-state-of-the-art methods by 20%-41% in
Precision and 13%-33% in NDCG
|
[
{
"version": "v1",
"created": "Sat, 4 Mar 2017 11:41:31 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Jiang",
"He",
""
],
[
"Nie",
"Liming",
""
],
[
"Sun",
"Zeyi",
""
],
[
"Ren",
"Zhilei",
""
],
[
"Kong",
"Weiqiang",
""
],
[
"Zhang",
"Tao",
""
],
[
"Luo",
"Xiapu",
""
]
] |
new_dataset
| 0.953553 |
1703.01544
|
Felice De Luca
|
Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Alon Efrat, Md Iqbal
Hossain, Stephen Kobourov, Jixian Li, Sammi Abida Salma and Eric Welch
|
L-Graphs and Monotone L-Graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an
$\mathsf{L}$-segment, and two segments intersect each other if and only if the
corresponding vertices are adjacent in the graph. If the corner of each
$\mathsf{L}$-segment in an $\mathsf{L}$-embedding lies on a straight line, we
call it a monotone $\mathsf{L}$-embedding. In this paper we give a full
characterization of monotone $\mathsf{L}$-embeddings by introducing a new class
of graphs which we call "non-jumping" graphs. We show that a graph admits a
monotone $\mathsf{L}$-embedding if and only if the graph is a non-jumping
graph. Further, we show that outerplanar graphs, convex bipartite graphs,
interval graphs, 3-leaf power graphs, and complete graphs are subclasses of
non-jumping graphs. Finally, we show that distance-hereditary graphs and
$k$-leaf power graphs ($k\le 4$) admit $\mathsf{L}$-embeddings.
|
[
{
"version": "v1",
"created": "Sun, 5 Mar 2017 01:41:08 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Ahmed",
"Abu Reyan",
""
],
[
"De Luca",
"Felice",
""
],
[
"Devkota",
"Sabin",
""
],
[
"Efrat",
"Alon",
""
],
[
"Hossain",
"Md Iqbal",
""
],
[
"Kobourov",
"Stephen",
""
],
[
"Li",
"Jixian",
""
],
[
"Salma",
"Sammi Abida",
""
],
[
"Welch",
"Eric",
""
]
] |
new_dataset
| 0.999624 |
1703.01605
|
Yongwei Nie
|
Yongwei Nie, Xu Cao, Chengjiang Long, Ping Li, Guiqing Li
|
L2GSCI: Local to Global Seam Cutting and Integrating for Accurate Face
Contour Extraction
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current face alignment algorithms can robustly find a set of landmarks along
face contour. However, the landmarks are sparse and lack curve details,
especially in chin and cheek areas where a lot of concave-convex bending
information exists. In this paper, we propose a local to global seam cutting
and integrating algorithm (L2GSCI) to extract continuous and accurate face
contour. Our method works in three steps with the help of a rough initial
curve. First, we sample small and overlapped squares along the initial curve.
Second, the seam cutting part of L2GSCI extracts a local seam in each square
region. Finally, the seam integrating part of L2GSCI connects all the redundant
seams together to form a continuous and complete face curve. Overall, the
proposed method is much more straightforward than existing face alignment
algorithms, but can achieve pixel-level continuous face curves rather than
discrete and sparse landmarks. Moreover, experiments on two face benchmark
datasets (i.e., LFPW and HELEN) show that our method can precisely reveal
concave-convex bending details of face contours, which has significantly
improved the performance when compared with the state-ofthe- art face alignment
approaches.
|
[
{
"version": "v1",
"created": "Sun, 5 Mar 2017 15:06:28 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Nie",
"Yongwei",
""
],
[
"Cao",
"Xu",
""
],
[
"Long",
"Chengjiang",
""
],
[
"Li",
"Ping",
""
],
[
"Li",
"Guiqing",
""
]
] |
new_dataset
| 0.990232 |
1703.01646
|
Joseph S. B. Mitchell
|
Joseph S. B. Mitchell
|
A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane
|
Manuscript that was published in SODA 2007, with updates made after
the proceedings version/talk
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Euclidean TSP with neighborhoods (TSPN) problem seeks a shortest tour
that visits a given collection of $n$ regions ({\em neighborhoods}). We present
the first polynomial-time approximation scheme for TSPN for a set of regions
given by arbitrary disjoint fat regions in the plane. This improves
substantially upon the known approximation algorithms, and is the first PTAS
for TSPN on regions of non-comparable sizes. Our result is based on a novel
extension of the $m$-guillotine method. The result applies to regions that are
"fat" in a very weak sense: each region $P_i$ has area $\Omega([diam(P_i)]^2)$,
but is otherwise arbitrary.
|
[
{
"version": "v1",
"created": "Sun, 5 Mar 2017 19:10:17 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Mitchell",
"Joseph S. B.",
""
]
] |
new_dataset
| 0.998711 |
1703.01820
|
Amna Qureshi
|
Amna Qureshi, David Meg\'ias, Helena Rif\`a-Pous
|
PSUM:Peer-to-peer multimedia content distribution using
collusion-resistant fingerprinting
|
38 Pages, Journal
| null |
10.1016/j.jnca.2016.03.007
| null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of peer-to-peer (P2P) networks for multimedia distribution has spread
out globally in recent years. The mass popularity is primarily driven by
cost-effective distribution of content, also giving rise to piracy. An end user
(buyer/peer) of a P2P content distribution system does not want to reveal
his/her identity during a transaction with a content owner (merchant), whereas
the merchant does not want the buyer to further distribute the content
illegally. To date, different P2P distribution systems have been proposed that
provide copyright and privacy protection at a cost of high computational burden
at the merchants and/or at the buyer's end and thus, making these systems
impractical. In this paper, we propose PSUM, a P2P content distribution system
which allows efficient distribution of large-sized multimedia content while
preserving the security and privacy of merchants and buyers. The security of
PSUM is ensured by using an asymmetric fingerprinting protocol based on
collusion-resistant codes. In addition, PSUM enables buyers to obtain digital
contents anonymously, but this anonymity can be revoked as soon as he/she is
found guilty of copyright violation. The paper presents a thorough performance
analysis of PSUM, through different experiments and simulations, and also
analyzes several security compromising attacks and countermeasures.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 11:47:30 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Qureshi",
"Amna",
""
],
[
"Megías",
"David",
""
],
[
"Rifà-Pous",
"Helena",
""
]
] |
new_dataset
| 0.999249 |
1703.01863
|
Benjamin Smith
|
Craig Costello, Benjamin Smith (LIX, GRACE)
|
Montgomery curves and their arithmetic
| null | null | null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Three decades ago, Montgomery introduced a new elliptic curve model for use
in Lenstra's ECM factorization algorithm. Since then, his curves and the
algorithms associated with them have become foundational in the implementation
of elliptic curve cryptosystems. This article surveys the theory and
cryptographic applications of Montgomery curves over non-binary finite fields,
including Montgomery's x-only arithmetic and Ladder algorithm, x-only
Diffie--Hellman, y-coordinate recovery, and 2-dimensional and Euclidean
differential addition chains such as Montgomery's PRAC algorithm.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 13:30:11 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Costello",
"Craig",
"",
"LIX, GRACE"
],
[
"Smith",
"Benjamin",
"",
"LIX, GRACE"
]
] |
new_dataset
| 0.991064 |
1703.01880
|
Wen Jiang
|
Shuai Xu and Wen Jiang
|
A Physarum-inspired model for the probit-based stochastic user
equilibrium problem
|
24 pages,5 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic user equilibrium is an important issue in the traffic assignment
problems, tradition models for the stochastic user equilibrium problem are
designed as mathematical programming problems. In this article, a
Physarum-inspired model for the probit-based stochastic user equilibrium
problem is proposed. There are two main contributions of our work. On the one
hand, the origin Physarum model is modified to find the shortest path in
traffic direction networks with the properties of two-way traffic
characteristic. On the other hand, the modified Physarum-inspired model could
get the equilibrium flows when traveller's perceived transportation cost
complies with normal distribution. The proposed method is constituted with a
two-step procedure. First, the modified Physarum model is applied to get the
auxiliary flows. Second, the auxiliary flows are averaged to obtain the
equilibrium flows. Numerical examples are conducted to illustrate the
performance of the proposed method, which is compared with the Method of
Successive Average method.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 14:07:48 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Xu",
"Shuai",
""
],
[
"Jiang",
"Wen",
""
]
] |
new_dataset
| 0.95905 |
1703.01886
|
Christian Berthet
|
Christian Berthet
|
On Von Schelling Formula for the Generalized Coupon Collector Problem
|
22 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper gives an algebraic proof of the correctness of Von Schelling
formula for the probability of the coupon collector problem waiting time for
non-uniform distributions and partial collections. It introduces a theorem on
sums of powers of subset probabilities which to our knowledge is new. A set of
binomial coefficients is used as a basis for decomposition of these sums of
powers.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 14:15:29 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Berthet",
"Christian",
""
]
] |
new_dataset
| 0.991107 |
1703.01918
|
Ronald Kemker
|
Ronald Kemker, Carl Salvaggio, and Christopher Kanan
|
High-Resolution Multispectral Dataset for Semantic Segmentation
|
9 pages, 8 Figures
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unmanned aircraft have decreased the cost required to collect remote sensing
imagery, which has enabled researchers to collect high-spatial resolution data
from multiple sensor modalities more frequently and easily. The increase in
data will push the need for semantic segmentation frameworks that are able to
classify non-RGB imagery, but this type of algorithmic development requires an
increase in publicly available benchmark datasets with class labels. In this
paper, we introduce a high-resolution multispectral dataset with image labels.
This new benchmark dataset has been pre-split into training/testing folds in
order to standardize evaluation and continue to push state-of-the-art
classification frameworks for non-RGB imagery.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 15:16:56 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Kemker",
"Ronald",
""
],
[
"Salvaggio",
"Carl",
""
],
[
"Kanan",
"Christopher",
""
]
] |
new_dataset
| 0.999712 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.