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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1803.08383
|
Marcos Maroto
|
Marcos Maroto, Enrique Ca\~no, Pavel Gonz\'alez, Diego Villegas
|
Head-up Displays (HUD) in driving
|
7 pages
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Head Up Displays (HUDs) were designed originally to present at the usual
viewpoints of the pilot the main sensor data during aircraft missions, because
of placing instrument information in the forward field of view enhances pilots
ability to utilize both instrument and environmental information
simultaneously. The first civilian motor vehicle had a monochrome HUD that was
released in 1988 by General Motors as a technological improvement of HeadDown
Display (HDD) interface, which is commonly used in automobile industry. The HUD
reduces the number and duration of the drivers sight deviations from the road,
by projecting the required information directly into the drivers line of
vision. There are many studies about ways of presenting the information:
standard oneearpiece presentation, threedimensional audio presentation, visual
only or audiovisual presentation. Results have shown that using a 3D auditory
display the time of acquiring targets is approximately 2.2 seconds faster than
using a oneearpiece way. Nevertheless, a disadvantage is when the drivers
attention unconsciously shifts away from the road and goes focused on
processing the information presented by the HUD. By this reason, the time, the
way and the channel are important to represent the information on a HUD. A
solution is a context aware multimodal proactive recommended system that
features personalized content combined with the use of car sensors to determine
when the information has to be presented.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2018 14:46:45 GMT"
}
] | 2018-03-23T00:00:00 |
[
[
"Maroto",
"Marcos",
""
],
[
"Caño",
"Enrique",
""
],
[
"González",
"Pavel",
""
],
[
"Villegas",
"Diego",
""
]
] |
new_dataset
| 0.997796 |
1803.08433
|
Ouyang Zhang
|
Ouyang Zhang and Kannan Srinivasan
|
Dyloc: Dynamic and Collaborative User-controlled AOA based Localizing
System with your laptops
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently, accurate localization system based on commodity WiFi devices is
not broadly available yet. In the literature, the solutions are based on either
network infrastructure like WiFi router, which have at least three antennas, or
sacrifice accuracy with coarse grained information like RSSI. In this work, we
design a new localizing system which is accurate based on AOA estimation and
instantly deployable on users' devices.
Dyloc is designed to be dynamically constructed with user's devices as
network nodes without any network infrastructure. On the platform of laptops,
our system achieve comparable localization accuracy with state-of-the-art work
despite of the limitation of less number and large separation of antennas. We
design multi-stage signal processing to resolve the ambiguity issue arisen in
this scenario. To enable dynamic and collaborative construction, our system can
accurately conduct self-localization and also eliminate the need of
infrastructure anchors, which is due to the dedicated two-layer algorithm
design.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2018 16:17:07 GMT"
}
] | 2018-03-23T00:00:00 |
[
[
"Zhang",
"Ouyang",
""
],
[
"Srinivasan",
"Kannan",
""
]
] |
new_dataset
| 0.999325 |
1803.08495
|
Kevin Chen
|
Kevin Chen, Christopher B. Choy, Manolis Savva, Angel X. Chang, Thomas
Funkhouser, Silvio Savarese
|
Text2Shape: Generating Shapes from Natural Language by Learning Joint
Embeddings
| null | null | null | null |
cs.CV cs.AI cs.GR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method for generating colored 3D shapes from natural language.
To this end, we first learn joint embeddings of freeform text descriptions and
colored 3D shapes. Our model combines and extends learning by association and
metric learning approaches to learn implicit cross-modal connections, and
produces a joint representation that captures the many-to-many relations
between language and physical properties of 3D shapes such as color and shape.
To evaluate our approach, we collect a large dataset of natural language
descriptions for physical 3D objects in the ShapeNet dataset. With this learned
joint embedding we demonstrate text-to-shape retrieval that outperforms
baseline approaches. Using our embeddings with a novel conditional Wasserstein
GAN framework, we generate colored 3D shapes from text. Our method is the first
to connect natural language text with realistic 3D objects exhibiting rich
variations in color, texture, and shape detail. See video at
https://youtu.be/zraPvRdl13Q
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2018 17:57:47 GMT"
}
] | 2018-03-23T00:00:00 |
[
[
"Chen",
"Kevin",
""
],
[
"Choy",
"Christopher B.",
""
],
[
"Savva",
"Manolis",
""
],
[
"Chang",
"Angel X.",
""
],
[
"Funkhouser",
"Thomas",
""
],
[
"Savarese",
"Silvio",
""
]
] |
new_dataset
| 0.999823 |
1702.08388
|
Arkaitz Zubiaga
|
Arkaitz Zubiaga, Bo Wang, Maria Liakata, Rob Procter
|
Political Homophily in Independence Movements: Analysing and Classifying
Social Media Users by National Identity
|
Accepted for publication in IEEE Intelligent Systems
| null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media and data mining are increasingly being used to analyse political
and societal issues. Here we undertake the classification of social media users
as supporting or opposing ongoing independence movements in their territories.
Independence movements occur in territories whose citizens have conflicting
national identities; users with opposing national identities will then support
or oppose the sense of being part of an independent nation that differs from
the officially recognised country. We describe a methodology that relies on
users' self-reported location to build large-scale datasets for three
territories -- Catalonia, the Basque Country and Scotland. An analysis of these
datasets shows that homophily plays an important role in determining who people
connect with, as users predominantly choose to follow and interact with others
from the same national identity. We show that a classifier relying on users'
follow networks can achieve accurate, language-independent classification
performances ranging from 85% to 97% for the three territories.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 17:19:03 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jun 2017 18:01:10 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Mar 2018 11:48:11 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Zubiaga",
"Arkaitz",
""
],
[
"Wang",
"Bo",
""
],
[
"Liakata",
"Maria",
""
],
[
"Procter",
"Rob",
""
]
] |
new_dataset
| 0.996411 |
1710.00958
|
Adib Rastegarnia
|
Douglas Comer and Adib Rastegarnia
|
OSDF: A Framework For Software Defined Network Programming
|
4 pages, 4 figures, accepted as a work in progress paper in CCNC 2018
| null |
10.1109/CCNC.2018.8319173
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using SDN to configure and control a multi-site network involves writing code
that handles low-level details. We describe preliminary work on a framework
that takes a network description and set of policies as input, and handles all
the details of deriving routes and installing flow rules in switches. The paper
describes key software components and reports preliminary results.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2017 02:05:58 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Comer",
"Douglas",
""
],
[
"Rastegarnia",
"Adib",
""
]
] |
new_dataset
| 0.998181 |
1802.09984
|
Victor Marsault
|
Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin,
Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Martin
Schuster, Petra Selmer, and Andr\'es Taylor
|
Formal Semantics of the Language Cypher
|
22 pages
| null | null | null |
cs.DB cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cypher is a query language for property graphs. It was originally designed
and implemented as part of the Neo4j graph database, and it is currently used
in a growing number of commercial systems, industrial applications and research
projects. In this work, we provide denotational semantics of the core fragment
of the read-only part of Cypher, which features in particular pattern matching,
filtering, and most relational operations on tables.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 16:01:36 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Mar 2018 18:27:52 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Francis",
"Nadime",
""
],
[
"Green",
"Alastair",
""
],
[
"Guagliardo",
"Paolo",
""
],
[
"Libkin",
"Leonid",
""
],
[
"Lindaaker",
"Tobias",
""
],
[
"Marsault",
"Victor",
""
],
[
"Plantikow",
"Stefan",
""
],
[
"Rydberg",
"Mats",
""
],
[
"Schuster",
"Martin",
""
],
[
"Selmer",
"Petra",
""
],
[
"Taylor",
"Andrés",
""
]
] |
new_dataset
| 0.998527 |
1803.07170
|
Edmond Awad
|
Edmond Awad, Sydney Levine, Max Kleiman-Weiner, Sohan Dsouza, Joshua
B. Tenenbaum, Azim Shariff, Jean-Fran\c{c}ois Bonnefon, Iyad Rahwan
|
Blaming humans in autonomous vehicle accidents: Shared responsibility
across levels of automation
| null | null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When a semi-autonomous car crashes and harms someone, how are blame and
causal responsibility distributed across the human and machine drivers? In this
article, we consider cases in which a pedestrian was hit and killed by a car
being operated under shared control of a primary and a secondary driver. We
find that when only one driver makes an error, that driver receives the blame
and is considered causally responsible for the harm, regardless of whether that
driver is a machine or a human. However, when both drivers make errors in cases
of shared control between a human and a machine, the blame and responsibility
attributed to the machine is reduced. This finding portends a public
under-reaction to the malfunctioning AI components of semi-autonomous cars and
therefore has a direct policy implication: a bottom-up regulatory scheme (which
operates through tort law that is adjudicated through the jury system) could
fail to properly regulate the safety of shared-control vehicles; instead, a
top-down scheme (enacted through federal laws) may be called for.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 21:20:56 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Mar 2018 04:12:03 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Awad",
"Edmond",
""
],
[
"Levine",
"Sydney",
""
],
[
"Kleiman-Weiner",
"Max",
""
],
[
"Dsouza",
"Sohan",
""
],
[
"Tenenbaum",
"Joshua B.",
""
],
[
"Shariff",
"Azim",
""
],
[
"Bonnefon",
"Jean-François",
""
],
[
"Rahwan",
"Iyad",
""
]
] |
new_dataset
| 0.995837 |
1803.07614
|
Ratheesh K. Mungara
|
Ozgun Y. Bursalioglu, Giuseppe Caire, Ratheesh K. Mungara, Haralabos
C. Papadopoulos and Chenwei Wang
|
Fog Massive MIMO: A User-Centric Seamless Hot-Spot Architecture
|
32 pages, 7 figures and 1 Table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The decoupling of data and control planes, as proposed for 5G networks, will
enable the efficient implementation of multitier networks where user equipment
(UE) nodes obtain coverage and connectivity through the top-tier macro-cells,
and, at the same time, achieve high-throughput low-latency communication
through lower tiers in the hierarchy. This paper considers a new architecture
for such lower tiers, dubbed fog massive MIMO, where the UEs are able to
establish high-throughput low-latency data links in a seamless and
opportunistic manner, as they travel through a dense fog of high-capacity
wireless infrastructure nodes, referred to as remote radio heads (RRHs).
Traditional handover mechanisms in dense multicell networks inherently give
rise to frequent handovers and pilot sequence re-assignments, incurring, as a
result, excessive protocol overhead and significant latency. In the proposed
fog massive MIMO architecture, UEs seamlessly and implicitly associate
themselves to the most convenient RRHs in a completely autonomous manner. Each
UE makes use of a unique uplink pilot sequence, and pilot contamination is
mitigated by a novel coded "on-the-fly" pilot contamination control mechanism.
We analyze the spectral efficiency and the outage probability of the proposed
architecture via stochastic geometry, using some recent results on unique
coverage in Boolean models, and provide a detailed comparison with respect to
an idealized baseline massive MIMO cellular system, that neglects protocol
overhead and latency due to explicit user-cell association. Our analysis,
supported by extensive system simulation, reveals that there exists a "sweet
spot" of the per-pilot user load (number of users per pilot), such that the
proposed system achieves spectral efficiency close to that of an ideal cellular
system with the minimum distance user-base station association and no
pilot/handover overhead.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 19:27:34 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Bursalioglu",
"Ozgun Y.",
""
],
[
"Caire",
"Giuseppe",
""
],
[
"Mungara",
"Ratheesh K.",
""
],
[
"Papadopoulos",
"Haralabos C.",
""
],
[
"Wang",
"Chenwei",
""
]
] |
new_dataset
| 0.992684 |
1803.07648
|
Luca Allodi
|
Luca Allodi and Sebastian Banescu and Henning Femmer and Kristian
Beckers
|
Identifying Relevant Information Cues for Vulnerability Assessment Using
CVSS
|
9 pages, CODASPY 2018
|
Proceedings of the 2018 ACM Conference on Data and Application
Security and Privacy
|
10.1145/3176258.3176340
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The assessment of new vulnerabilities is an activity that accounts for
information from several data sources and produces a `severity' score for the
vulnerability. The Common Vulnerability Scoring System (\CVSS) is the reference
standard for this assessment. Yet, no guidance currently exists on \emph{which
information} aids a correct assessment and should therefore be considered.
In this paper we address this problem by evaluating which information cues
increase (or decrease) assessment accuracy.
We devise a block design experiment with 67 software engineering students
with varying vulnerability information and measure scoring accuracy under
different information sets.
We find that baseline vulnerability descriptions provided by standard
vulnerability sources provide only part of the information needed to achieve an
accurate vulnerability assessment. Further, we find that additional information
on \texttt{assets}, \texttt{attacks}, and \texttt{vulnerability type}
contributes in increasing the accuracy of the assessment; conversely,
information on \texttt{known threats} misleads the assessor and decreases
assessment accuracy and should be avoided when assessing vulnerabilities. These
results go in the direction of formalizing the vulnerability communication to,
for example, fully automate security assessments.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 20:51:07 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Allodi",
"Luca",
""
],
[
"Banescu",
"Sebastian",
""
],
[
"Femmer",
"Henning",
""
],
[
"Beckers",
"Kristian",
""
]
] |
new_dataset
| 0.957767 |
1803.07680
|
Robail Yasrab Dr.
|
Robail Yasrab
|
PaaS Cloud: The Business Perspective
|
24 pages
| null | null | null |
cs.CY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The next generation of PaaS technology accomplishes the true promise of
object-oriented and 4GLs development with less effort. Now PaaS is becoming one
of the core technical services for application development organizations. PaaS
offers a resourceful and agile approach to develop, operate and deploy
applications in a cost-effective manner. It is now turning out to be one of the
preferred choices throughout the world, especially for globally distributed
development environment. However it still lacks the scale of popularity and
acceptance which Software-as-a-Service (SaaS) and Infrastructure-as-a-Service
(IaaS) have attained. PaaS offers a promising future with novel technology
architecture and evolutionary development approach. In this article, we
identify the strengths, weaknesses, opportunities and threats for the PaaS
industry. We then identify the various issues that will affect the different
stakeholders of PaaS industry. This research will outline a set of
recommendations for the PaaS practitioners to better manage this technology.
For PaaS technology researchers, we also outline the number of research areas
that need attention in coming future. Finally, we also included an online
survey to outline PaaS technology market leaders. This will facilitate PaaS
technology practitioners to have a more deep insight into market trends and
technologies.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 22:37:09 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Yasrab",
"Robail",
""
]
] |
new_dataset
| 0.990155 |
1803.07782
|
Vijay Rajanna
|
Vijay Rajanna, Tracy Hammond
|
Gaze-Assisted User Authentication to Counter Shoulder-surfing Attacks
|
5 pages, 7 figures, 2 tables, ACM Richard Tapia Conference, Austin,
2016
|
ACM Richard Tapia Conference, Austin, 2016
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A highly secure, foolproof, user authentication system is still a primary
focus of research in the field of User Privacy and Security. Shoulder-surfing
is an act of spying when an authorized user is logging into a system, and is
promoted by a malicious intent of gaining unauthorized access. We present a
gaze-assisted user authentication system as a potential solution to counter
shoulder-surfing attacks. The system comprises of an eye tracker and an
authentication interface with 12 pre-defined shapes (e.g., triangle, circle,
etc.) that move simultaneously on the screen. A user chooses a set of three
shapes as a password. To authenticate, the user follows the paths of three
shapes as they move, one on each frame, over three consecutive frames.
The system uses either the template matching or decision tree algorithms to
match the scan-path of the user's gaze with the path traversed by the shape.
The system was evaluated with seven users to test the accuracy of both the
algorithms. We found that with the template matching algorithm the system
achieves an accuracy of 95%, and with the decision tree algorithm an accuracy
of 90.2%. We also present the advantages and disadvantages of using both the
algorithms. Our study suggests that gaze-based authentication is a highly
secure method against shoulder-surfing attacks as the unique pattern of eye
movements for each individual makes the system hard to break into.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2018 07:48:22 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Rajanna",
"Vijay",
""
],
[
"Hammond",
"Tracy",
""
]
] |
new_dataset
| 0.999596 |
1803.07808
|
Pei Zhou
|
Pei Zhou, Kaijun Cheng, Xiao Han, Xuming Fang, Yuguang Fang, Rong He,
Yan Long and Yanping Liu
|
IEEE 802.11ay based mmWave WLANs: Design Challenges and Solutions
|
27 pages, 33 figures. Accepted for publication in IEEE Communications
Surveys and Tutorials
| null |
10.1109/COMST.2018.2816920
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter-wave (mmWave) with large spectrum available is considered as the
most promising frequency band for future wireless communications. The IEEE
802.11ad and IEEE 802.11ay operating on 60 GHz mmWave are the two most expected
wireless local area network (WLAN) technologies for ultra-high-speed
communications. For the IEEE 802.11ay standard still under development, there
are plenty of proposals from companies and researchers who are involved with
the IEEE 802.11ay task group. In this survey, we conduct a comprehensive review
on the medium access control layer (MAC) related issues for the IEEE 802.11ay,
some cross-layer between physical layer (PHY) and MAC technologies are also
included. We start with MAC related technologies in the IEEE 802.11ad and
discuss design challenges on mmWave communications, leading to some MAC related
technologies for the IEEE 802.11ay. We then elaborate on important design
issues for IEEE 802.11ay. Specifically, we review the channel bonding and
aggregation for the IEEE 802.11ay, and point out the major differences between
the two technologies. Then, we describe channel access and channel allocation
in the IEEE 802.11ay, including spatial sharing and interference mitigation
technologies. After that, we present an in-depth survey on beamforming training
(BFT), beam tracking, single-user multiple-input-multiple-output (SU-MIMO)
beamforming and multi-user multiple-input-multiple-output (MU-MIMO)
beamforming. Finally, we discuss some open design issues and future research
directions for mmWave WLANs. We hope that this paper provides a good
introduction to this exciting research area for future wireless systems.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2018 09:32:56 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Zhou",
"Pei",
""
],
[
"Cheng",
"Kaijun",
""
],
[
"Han",
"Xiao",
""
],
[
"Fang",
"Xuming",
""
],
[
"Fang",
"Yuguang",
""
],
[
"He",
"Rong",
""
],
[
"Long",
"Yan",
""
],
[
"Liu",
"Yanping",
""
]
] |
new_dataset
| 0.999405 |
1803.07913
|
Manuele Brambilla
|
Amos Sironi, Manuele Brambilla, Nicolas Bourdis, Xavier Lagorce, Ryad
Benosman
|
HATS: Histograms of Averaged Time Surfaces for Robust Event-based Object
Classification
|
Accepted for publication at CVPR2018. Dataset available at
http://www.prophesee.ai/dataset-n-cars/
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event-based cameras have recently drawn the attention of the Computer Vision
community thanks to their advantages in terms of high temporal resolution, low
power consumption and high dynamic range, compared to traditional frame-based
cameras. These properties make event-based cameras an ideal choice for
autonomous vehicles, robot navigation or UAV vision, among others. However, the
accuracy of event-based object classification algorithms, which is of crucial
importance for any reliable system working in real-world conditions, is still
far behind their frame-based counterparts. Two main reasons for this
performance gap are: 1. The lack of effective low-level representations and
architectures for event-based object classification and 2. The absence of large
real-world event-based datasets. In this paper we address both problems. First,
we introduce a novel event-based feature representation together with a new
machine learning architecture. Compared to previous approaches, we use local
memory units to efficiently leverage past temporal information and build a
robust event-based representation. Second, we release the first large
real-world event-based dataset for object classification. We compare our method
to the state-of-the-art with extensive experiments, showing better
classification performance and real-time computation.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2018 13:37:24 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Sironi",
"Amos",
""
],
[
"Brambilla",
"Manuele",
""
],
[
"Bourdis",
"Nicolas",
""
],
[
"Lagorce",
"Xavier",
""
],
[
"Benosman",
"Ryad",
""
]
] |
new_dataset
| 0.979532 |
1803.07926
|
Hung La
|
Huy Xuan Pham, Hung Manh La, David Feil-Seifer, Matthew Dean
|
A Distributed Control Framework of Multiple Unmanned Aerial Vehicles for
Dynamic Wildfire Tracking
|
arXiv admin note: substantial text overlap with arXiv:1704.02630
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wild-land fire fighting is a hazardous job. A key task for firefighters is to
observe the "fire front" to chart the progress of the fire and areas that will
likely spread next. Lack of information of the fire front causes many
accidents. Using Unmanned Aerial Vehicles (UAVs) to cover wildfire is promising
because it can replace humans in hazardous fire tracking and significantly
reduce operation costs. In this paper we propose a distributed control
framework designed for a team of UAVs that can closely monitor a wildfire in
open space, and precisely track its development. The UAV team, designed for
flexible deployment, can effectively avoid in-flight collisions and cooperate
well with neighbors. They can maintain a certain height level to the ground for
safe flight above fire. Experimental results are conducted to demonstrate the
capabilities of the UAV team in covering a spreading wildfire.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 00:07:07 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Pham",
"Huy Xuan",
""
],
[
"La",
"Hung Manh",
""
],
[
"Feil-Seifer",
"David",
""
],
[
"Dean",
"Matthew",
""
]
] |
new_dataset
| 0.960101 |
1803.07927
|
Liangdong Lu
|
Liangdong Lu, Wenping Ma, Ruihu Li, Yuena Ma, Luobin Guo
|
New Quantum MDS codes constructed from Constacyclic codes
|
arXiv admin note: text overlap with arXiv:1803.04168
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum maximum-distance-separable (MDS) codes are an important class of
quantum codes. In this paper, using constacyclic codes and Hermitain
construction, we construct some new quantum MDS codes of the form $q=2am+t$,
$n=\frac{q^{2}+1}{a}$. Most of these quantum MDS codes are new in the sense
that their parameters are not covered be the codes available in the literature.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 05:37:32 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Lu",
"Liangdong",
""
],
[
"Ma",
"Wenping",
""
],
[
"Li",
"Ruihu",
""
],
[
"Ma",
"Yuena",
""
],
[
"Guo",
"Luobin",
""
]
] |
new_dataset
| 0.999742 |
1803.08014
|
Kuan-Ting Yu
|
Kuan-Ting Yu, Alberto Rodriguez
|
Realtime State Estimation with Tactile and Visual Sensing for Inserting
a Suction-held Object
|
8 pages, 10 figures, submitted to IROS 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a real-time state estimation system to recover the pose and
contact formation of an object relative to its environment. In this paper, we
focus on the application of inserting an object picked by a suction cup into a
tight space, an enabling technology for robotic packaging.
We propose a framework that fuses force and visual sensing for improved
accuracy and robustness. Visual sensing is versatile and non-intrusive, but
suffers from occlusions and limited accuracy, especially for tasks involving
contact. Tactile sensing is local, but provides accuracy and robustness to
occlusions. The proposed algorithm to fuse them is based on iSAM, an on-line
optimization technique, which we use to incorporate kinematic measurements from
the robot, contact geometry of the object and the container, and visual
tracking. In this paper, we generalize previous results in planar settings to a
3D task with more complex contact interactions. A key challenge in using force
sensing is that we do not observe contact point locations directly. We propose
a data-driven method to infer the contact formation, which is then used in
real-time by the state estimator. We demonstrate and evaluate the algorithm in
a setup instrumented to provide groundtruth.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2018 17:12:12 GMT"
}
] | 2018-03-22T00:00:00 |
[
[
"Yu",
"Kuan-Ting",
""
],
[
"Rodriguez",
"Alberto",
""
]
] |
new_dataset
| 0.992424 |
1602.06426
|
Cassio Neri
|
Cassio Neri
|
A loopless and branchless $O(1)$ algorithm to generate the next Dyck
word
|
First published on 19 July 2014 at https://github.com/cassioneri/Dyck
| null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Let integer be any C/C++ unsigned integer type up to 64-bits long. Given a
Dyck word the following code returns the next Dyck word of the same size,
provided it exists.
integer next_dyck_word(integer w) {
integer const a = w & -w;
integer const b = w + a;
integer c = w ^ b;
c = (c / a >> 2) + 1;
c = ((c * c - 1) & 0xaaaaaaaaaaaaaaaa) | b;
return c;
}
|
[
{
"version": "v1",
"created": "Sat, 20 Feb 2016 16:24:30 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Mar 2018 20:54:58 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Neri",
"Cassio",
""
]
] |
new_dataset
| 0.997096 |
1705.09427
|
Yuliang Li
|
Yuliang Li, Alin Deutsch, and Victor Vianu
|
SpinArt: A Spin-based Verifier for Artifact Systems
| null | null | null | null |
cs.DB cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data-driven workflows, of which IBM's Business Artifacts are a prime
exponent, have been successfully deployed in practice, adopted in industrial
standards, and have spawned a rich body of research in academia, focused
primarily on static analysis. In previous work, we obtained theoretical results
on the verification of a rich model incorporating core elements of IBM's
successful Guard-Stage-Milestone (GSM) artifact model. The results showed
decidability of verification of temporal properties of a large class of GSM
workflows and established its complexity. Following up on these results, the
present paper reports on the implementation of SpinArt, a practical verifier
based on the classical model-checking tool Spin. The implementation includes
nontrivial optimizations and achieves good performance on real-world business
process examples. Our results shed light on the capabilities and limitations of
off-the-shelf verifiers in the context of data-driven workflows.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 04:13:17 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Sep 2017 17:35:37 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Mar 2018 23:21:27 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Li",
"Yuliang",
""
],
[
"Deutsch",
"Alin",
""
],
[
"Vianu",
"Victor",
""
]
] |
new_dataset
| 0.99885 |
1705.09811
|
Torsten Schaub
|
Martin Gebser and Roland Kaminski and Benjamin Kaufmann and Torsten
Schaub
|
Multi-shot ASP solving with clingo
|
Under consideration for publication in Theory and Practice of Logic
Programming (TPLP)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new flexible paradigm of grounding and solving in Answer Set
Programming (ASP), which we refer to as multi-shot ASP solving, and present its
implementation in the ASP system clingo.
Multi-shot ASP solving features grounding and solving processes that deal
with continuously changing logic programs. In doing so, they remain operative
and accommodate changes in a seamless way. For instance, such processes allow
for advanced forms of search, as in optimization or theory solving, or
interaction with an environment, as in robotics or query-answering. Common to
them is that the problem specification evolves during the reasoning process,
either because data or constraints are added, deleted, or replaced. This
evolutionary aspect adds another dimension to ASP since it brings about state
changing operations. We address this issue by providing an operational
semantics that characterizes grounding and solving processes in multi-shot ASP
solving. This characterization provides a semantic account of grounder and
solver states along with the operations manipulating them.
The operative nature of multi-shot solving avoids redundancies in relaunching
grounder and solver programs and benefits from the solver's learning
capacities. clingo accomplishes this by complementing ASP's declarative input
language with control capacities. On the declarative side, a new directive
allows for structuring logic programs into named and parameterizable
subprograms. The grounding and integration of these subprograms into the
solving process is completely modular and fully controllable from the
procedural side. To this end, clingo offers a new application programming
interface that is conveniently accessible via scripting languages.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 11:52:40 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Mar 2018 16:43:53 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Gebser",
"Martin",
""
],
[
"Kaminski",
"Roland",
""
],
[
"Kaufmann",
"Benjamin",
""
],
[
"Schaub",
"Torsten",
""
]
] |
new_dataset
| 0.972399 |
1707.04131
|
Jonas Rauber
|
Jonas Rauber, Wieland Brendel, Matthias Bethge
|
Foolbox: A Python toolbox to benchmark the robustness of machine
learning models
|
Code and examples available at https://github.com/bethgelab/foolbox
and documentation available at http://foolbox.readthedocs.io
| null | null | null |
cs.LG cs.CR cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Even todays most advanced machine learning models are easily fooled by almost
imperceptible perturbations of their inputs. Foolbox is a new Python package to
generate such adversarial perturbations and to quantify and compare the
robustness of machine learning models. It is build around the idea that the
most comparable robustness measure is the minimum perturbation needed to craft
an adversarial example. To this end, Foolbox provides reference implementations
of most published adversarial attack methods alongside some new ones, all of
which perform internal hyperparameter tuning to find the minimum adversarial
perturbation. Additionally, Foolbox interfaces with most popular deep learning
frameworks such as PyTorch, Keras, TensorFlow, Theano and MXNet and allows
different adversarial criteria such as targeted misclassification and top-k
misclassification as well as different distance measures. The code is licensed
under the MIT license and is openly available at
https://github.com/bethgelab/foolbox . The most up-to-date documentation can be
found at http://foolbox.readthedocs.io .
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 13:59:15 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Aug 2017 03:22:01 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Mar 2018 10:10:10 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Rauber",
"Jonas",
""
],
[
"Brendel",
"Wieland",
""
],
[
"Bethge",
"Matthias",
""
]
] |
new_dataset
| 0.987032 |
1803.06960
|
Joachim Breitner
|
Joachim Breitner and Antal Spector-Zabusky and Yao Li and Christine
Rizkallah and John Wiegley and Stephanie Weirich
|
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
|
30 pages, submitted to ICFP'18
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Good tools can bring mechanical verification to programs written in
mainstream functional languages. We use hs-to-coq to translate significant
portions of Haskell's containers library into Coq, and verify it against
specifications that we derive from a variety of sources including type class
laws, the library's test suite, and interfaces from Coq's standard library. Our
work shows that it is feasible to verify mature, widely-used, highly optimized,
and unmodified Haskell code. We also learn more about the theory of
weight-balanced trees, extend hs-to-coq to handle partiality, and -- since we
found no bugs -- attest to the superb quality of well-tested functional code.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 14:42:25 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Mar 2018 03:15:09 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Breitner",
"Joachim",
""
],
[
"Spector-Zabusky",
"Antal",
""
],
[
"Li",
"Yao",
""
],
[
"Rizkallah",
"Christine",
""
],
[
"Wiegley",
"John",
""
],
[
"Weirich",
"Stephanie",
""
]
] |
new_dataset
| 0.968721 |
1803.07292
|
Mika M\"antyl\"a
|
Mika V. M\"antyl\"a, Fabio Calefato, Maelick Claes
|
Natural Language or Not (NLoN) - A Package for Software Engineering Text
Analysis Pipeline
| null |
MSR '18: 15th International Conference on Mining Software
Repositories, May 28--29, 2018 Gothenburg, Sweden
|
10.1145/3196398.3196444
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of natural language processing (NLP) is gaining popularity in
software engineering. In order to correctly perform NLP, we must pre-process
the textual information to separate natural language from other information,
such as log messages, that are often part of the communication in software
engineering. We present a simple approach for classifying whether some textual
input is natural language or not. Although our NLoN package relies on only 11
language features and character tri-grams, we are able to achieve an area under
the ROC curve performances between 0.976-0.987 on three different data sources,
with Lasso regression from Glmnet as our learner and two human raters for
providing ground truth. Cross-source prediction performance is lower and has
more fluctuation with top ROC performances from 0.913 to 0.980. Compared with
prior work, our approach offers similar performance but is considerably more
lightweight, making it easier to apply in software engineering text mining
pipelines. Our source code and data are provided as an R-package for further
improvements.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 08:32:56 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Mäntylä",
"Mika V.",
""
],
[
"Calefato",
"Fabio",
""
],
[
"Claes",
"Maelick",
""
]
] |
new_dataset
| 0.997378 |
1803.07294
|
Jiani Zhang
|
Jiani Zhang, Xingjian Shi, Junyuan Xie, Hao Ma, Irwin King, Dit-Yan
Yeung
|
GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal
Graphs
| null | null | null | null |
cs.LG cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new network architecture, Gated Attention Networks (GaAN), for
learning on graphs. Unlike the traditional multi-head attention mechanism,
which equally consumes all attention heads, GaAN uses a convolutional
sub-network to control each attention head's importance. We demonstrate the
effectiveness of GaAN on the inductive node classification problem. Moreover,
with GaAN as a building block, we construct the Graph Gated Recurrent Unit
(GGRU) to address the traffic speed forecasting problem. Extensive experiments
on three real-world datasets show that our GaAN framework achieves
state-of-the-art results on both tasks.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 08:33:20 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Zhang",
"Jiani",
""
],
[
"Shi",
"Xingjian",
""
],
[
"Xie",
"Junyuan",
""
],
[
"Ma",
"Hao",
""
],
[
"King",
"Irwin",
""
],
[
"Yeung",
"Dit-Yan",
""
]
] |
new_dataset
| 0.965243 |
1803.07295
|
Rodolfo Delmonte
|
Rodolfo Delmonte
|
Expressivity in TTS from Semantics and Pragmatics
|
Presented at AISV 2015 - Now appearing in Studi AISV, n.1
| null |
10.17469/O2101AISV000026
| null |
cs.CL
|
http://creativecommons.org/publicdomain/zero/1.0/
|
In this paper we present ongoing work to produce an expressive TTS reader
that can be used both in text and dialogue applications. The system called
SPARSAR has been used to read (English) poetry so far but it can now be applied
to any text. The text is fully analyzed both at phonetic and phonological
level, and at syntactic and semantic level. In addition, the system has access
to a restricted list of typical pragmatically marked phrases and expressions
that are used to convey specific discourse function and speech acts and need
specialized intonational contours. The text is transformed into a poem-like
structures, where each line corresponds to a Breath Group, semantically and
syntactically consistent. Stanzas correspond to paragraph boundaries.
Analogical parameters are related to ToBI theoretical indices but their number
is doubled. In this paper, we concentrate on short stories and fables.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 08:35:16 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Delmonte",
"Rodolfo",
""
]
] |
new_dataset
| 0.994349 |
1803.07351
|
Ruobing Shen
|
Ruobing Shen, Xiaoyu Chen, Xiangrui Zheng, Gerhard Reinelt
|
Discrete Potts Model for Generating Superpixels on Noisy Images
|
23 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many computer vision applications, such as object recognition and
segmentation, increasingly build on superpixels. However, there have been so
far few superpixel algorithms that systematically deal with noisy images. We
propose to first decompose the image into equal-sized rectangular patches,
which also sets the maximum superpixel size. Within each patch, a Potts model
for simultaneous segmentation and denoising is applied, that guarantees
connected and non-overlapping superpixels and also produces a denoised image.
The corresponding optimization problem is formulated as a mixed integer linear
program (MILP), and solved by a commercial solver. Extensive experiments on the
BSDS500 dataset images with noises are compared with other state-of-the-art
superpixel methods. Our method achieves the best result in terms of a combined
score (OP) composed of the under-segmentation error, boundary recall and
compactness.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 10:32:55 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Shen",
"Ruobing",
""
],
[
"Chen",
"Xiaoyu",
""
],
[
"Zheng",
"Xiangrui",
""
],
[
"Reinelt",
"Gerhard",
""
]
] |
new_dataset
| 0.978033 |
1803.07386
|
Maneet Singh
|
Akshay Sethi, Maneet Singh, Richa Singh, Mayank Vatsa
|
Residual Codean Autoencoder for Facial Attribute Analysis
|
Accepted in Pattern Recognition Letters
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facial attributes can provide rich ancillary information which can be
utilized for different applications such as targeted marketing, human computer
interaction, and law enforcement. This research focuses on facial attribute
prediction using a novel deep learning formulation, termed as R-Codean
autoencoder. The paper first presents Cosine similarity based loss function in
an autoencoder which is then incorporated into the Euclidean distance based
autoencoder to formulate R-Codean. The proposed loss function thus aims to
incorporate both magnitude and direction of image vectors during feature
learning. Further, inspired by the utility of shortcut connections in deep
models to facilitate learning of optimal parameters, without incurring the
problem of vanishing gradient, the proposed formulation is extended to
incorporate shortcut connections in the architecture. The proposed R-Codean
autoencoder is utilized in facial attribute prediction framework which
incorporates patch-based weighting mechanism for assigning higher weights to
relevant patches for each attribute. The experimental results on publicly
available CelebA and LFWA datasets demonstrate the efficacy of the proposed
approach in addressing this challenging problem.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 12:05:33 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Sethi",
"Akshay",
""
],
[
"Singh",
"Maneet",
""
],
[
"Singh",
"Richa",
""
],
[
"Vatsa",
"Mayank",
""
]
] |
new_dataset
| 0.993064 |
1803.07496
|
Xuehe Wang
|
Xuehe Wang, Lingjie Duan, Junshan Zhang
|
Mobile Social Services with Network Externality: From Separate Pricing
to Bundled Pricing
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, many wireless device providers choose to sell devices bundled with
complementary mobile social services, which exhibit strong positive network
externality. This paper aims to quantify the benefits of selling devices and
complementary services under the following three strategies: separate pricing,
bundled pricing, and hybrid pricing (both the separate and bundled options are
offered). A comprehensive comparison of the above three strategies is carried
out for two popular service models, namely physical connectivity sharing and
virtual content sharing, respectively. We first study the physical service
model where the provider (e.g., FON) offers users customized WiFi devices for
indoor Internet access, and allows service subscribers to physically access all
device owners' WiFi when traveling. Observing that all device-owners contribute
to the connectivity sharing, we show, via a Stackelberg game theoretic
approach, that bundled pricing outperforms separate pricing as long as the
total cost of device and service is reasonably low to stimulate network
externality. Further, hybrid pricing strictly dominates bundled pricing thanks
to the pricing flexibility to keep high marginal profit of device-selling.
Next, we investigate the virtual sharing service model where the provider
(e.g., Apple) sells devices and device-supported applications. Different from
the connectivity service model, in this model service subscribers directly
contribute to the virtual content sharing, and the network externality can be
fairly strong. We prove that hybrid pricing degenerates to bundled pricing if
the network externality degree is larger than the average device valuation,
which is in stark contrast with the connectivity service model in which hybrid
pricing always outperforms bundled pricing.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 15:49:36 GMT"
}
] | 2018-03-21T00:00:00 |
[
[
"Wang",
"Xuehe",
""
],
[
"Duan",
"Lingjie",
""
],
[
"Zhang",
"Junshan",
""
]
] |
new_dataset
| 0.951512 |
1408.6771
|
David Eppstein
|
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna
Lubiw and Ryuhei Uehara
|
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
|
21 pages, 10 figures
|
J. Computational Geometry 9 (1): 71-91, 2018
|
10.20382/jocg.v9i1
| null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When can a plane graph with prescribed edge lengths and prescribed angles
(from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an
infinitesimally thin line, without crossings? This problem generalizes the
classic theory of single-vertex flat origami with prescribed mountain-valley
assignment, which corresponds to the case of a cycle graph. We characterize
such flat-foldable plane graphs by two obviously necessary but also sufficient
conditions, proving a conjecture made in 2001: the angles at each vertex should
sum to $360^\circ$, and every face of the graph must itself be flat foldable.
This characterization leads to a linear-time algorithm for testing flat
foldability of plane graphs with prescribed edge lengths and angles, and a
polynomial-time algorithm for counting the number of distinct folded states.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2014 16:25:49 GMT"
},
{
"version": "v2",
"created": "Sun, 18 Mar 2018 20:23:21 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Abel",
"Zachary",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Eppstein",
"David",
""
],
[
"Lubiw",
"Anna",
""
],
[
"Uehara",
"Ryuhei",
""
]
] |
new_dataset
| 0.973267 |
1706.05593
|
Sherif Abuelenin
|
Sherif M. Abuelenin and Rabab F. Abdel-Kader
|
Closed-Form Mathematical Representations of Interval Type-2 Fuzzy Logic
Systems
|
15 pages, 10 figures, 3 tables
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interval type-2 fuzzy logic systems (IT2 FLSs) have a wide range of
applications due to their abilities to handle uncertainties compared to their
type-1 counterparts. This paper discusses the representation of IT2 FLSs in
closed mathematical form. Two novel inference mechanisms are introduced, each
of them represents a whole IT2 FLS. The two forms are based on approximating
Coupland and John's geometric method and the Nie-Tan method. Having closed-form
representations is preferred in the design of control systems, especially when
stability analysis is studied. Additionally, the simplicity of the proposed
mechanisms, offers an easy way for implementation. Simulation results show that
the proposed method perform very closely to other methods. Simulation results
are provided.
|
[
{
"version": "v1",
"created": "Sat, 17 Jun 2017 23:39:56 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Mar 2018 08:45:27 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Abuelenin",
"Sherif M.",
""
],
[
"Abdel-Kader",
"Rabab F.",
""
]
] |
new_dataset
| 0.95981 |
1708.05063
|
Shankara Narayanan Krishna
|
Parosh Aziz Abdulla, Mohamed Faouzi Atig and S. Krishna
|
Communicating Timed Processes with Perfect Timed Channels
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the model of communicating timed automata (CTA) that extends the
classical models of finite-state processes communicating through FIFO perfect
channels and timed automata, in the sense that the finite-state processes are
replaced by timed automata, and messages inside the perfect channels are
equipped with clocks representing their ages. In addition to the standard
operations (resetting clocks, checking guards of clocks) each automaton can
either (1) append a message to the tail of a channel with an initial age or (2)
receive the message at the head of a channel if its age satisfies a set of
given constraints. In this paper, we show that the reachability problem is
undecidable even in the case of two timed automata connected by one
unidirectional timed channel if one allows global clocks (that the two automata
can check and manipulate). We prove that this undecidability still holds even
for CTA consisting of three timed automata and two unidirectional timed
channels (and without any global clock). However, the reachability problem
becomes decidable (in $\mathsf{EXPTIME}$) in the case of two automata linked
with one unidirectional timed channel and with no global clock. Finally, we
consider the bounded-context case, where in each context, only one timed
automaton is allowed to receive messages from one channel while being able to
send messages to all the other timed channels. In this case we show that the
reachability problem is decidable.
|
[
{
"version": "v1",
"created": "Thu, 10 Aug 2017 05:21:40 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Oct 2017 05:19:22 GMT"
},
{
"version": "v3",
"created": "Thu, 8 Feb 2018 18:05:11 GMT"
},
{
"version": "v4",
"created": "Sun, 18 Mar 2018 12:02:56 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Abdulla",
"Parosh Aziz",
""
],
[
"Atig",
"Mohamed Faouzi",
""
],
[
"Krishna",
"S.",
""
]
] |
new_dataset
| 0.998598 |
1709.00727
|
Vandit Gajjar J
|
Vandit Gajjar, Viraj Mavani, Ayesha Gurnani
|
Hand Gesture Real Time Paint Tool - Box
|
This paper needs a proper writing and experiments need to be
implemented, thus we are withdrawing this submission
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
With current development universally in computing, now a days user
interaction approaches with mouse, keyboard, touch-pens etc. are not
sufficient. Directly using of hands or hand gestures as an input device is a
method to attract people with providing the applications, through Machine
Learning and Computer Vision. Human-computer interaction application in which
you can simply draw different shapes, fill the colors, moving the folder from
one place to another place and rotating your image with rotating your hand
gesture all this will be without touching your device only. In this paper
Machine Learning based hand gestures recognition is presented, with the use of
Computer Vision different types of gesture applications have been created.
|
[
{
"version": "v1",
"created": "Sun, 3 Sep 2017 14:53:05 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Oct 2017 16:59:47 GMT"
},
{
"version": "v3",
"created": "Sun, 18 Mar 2018 05:10:35 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Gajjar",
"Vandit",
""
],
[
"Mavani",
"Viraj",
""
],
[
"Gurnani",
"Ayesha",
""
]
] |
new_dataset
| 0.994748 |
1802.03656
|
Benyou Wang
|
Benyou Wang, Li Wang, Qikang Wei, Lichun Liu
|
TextZoo, a New Benchmark for Reconsidering Text Classification
|
a benchmark need to be completed
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text representation is a fundamental concern in Natural Language Processing,
especially in text classification. Recently, many neural network approaches
with delicate representation model (e.g. FASTTEXT, CNN, RNN and many hybrid
models with attention mechanisms) claimed that they achieved state-of-art in
specific text classification datasets. However, it lacks an unified benchmark
to compare these models and reveals the advantage of each sub-components for
various settings. We re-implement more than 20 popular text representation
models for classification in more than 10 datasets. In this paper, we
reconsider the text classification task in the perspective of neural network
and get serval effects with analysis of the above results.
|
[
{
"version": "v1",
"created": "Sat, 10 Feb 2018 22:34:38 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Mar 2018 03:07:10 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Wang",
"Benyou",
""
],
[
"Wang",
"Li",
""
],
[
"Wei",
"Qikang",
""
],
[
"Liu",
"Lichun",
""
]
] |
new_dataset
| 0.996251 |
1802.09734
|
Zongtao Liu
|
Yang Yang, Zongtao Liu, Chenhao Tan, Fei Wu, Yueting Zhuang and Yafeng
Li
|
To Stay or to Leave: Churn Prediction for Urban Migrants in the Initial
Period
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In China, 260 million people migrate to cities to realize their urban dreams.
Despite that these migrants play an important role in the rapid urbanization
process, many of them fail to settle down and eventually leave the city. The
integration process of migrants thus raises an important issue for scholars and
policymakers.
In this paper, we use Shanghai as an example to investigate migrants'
behavior in their first weeks and in particular, how their behavior relates to
early departure. Our dataset consists of a one-month complete dataset of 698
telecommunication logs between 54 million users, plus a novel and publicly
available housing price data for 18K real estates in Shanghai. We find that
migrants who end up leaving early tend to neither develop diverse connections
in their first weeks nor move around the city. Their active areas also have
higher housing prices than that of staying migrants. We formulate a churn
prediction problem to determine whether a migrant is going to leave based on
her behavior in the first few days. The prediction performance improves as we
include data from more days. Interestingly, when using the same features, the
classifier trained from only the first few days is already as good as the
classifier trained using full data, suggesting that the performance difference
mainly lies in the difference between features.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 06:18:14 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Mar 2018 03:52:16 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Yang",
"Yang",
""
],
[
"Liu",
"Zongtao",
""
],
[
"Tan",
"Chenhao",
""
],
[
"Wu",
"Fei",
""
],
[
"Zhuang",
"Yueting",
""
],
[
"Li",
"Yafeng",
""
]
] |
new_dataset
| 0.999356 |
1803.06647
|
Jinning Li
|
Jinning Li, Siqi Liu, and Mengyao Cao
|
Line Artist: A Multiple Style Sketch to Painting Synthesis Scheme
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Drawing a beautiful painting is a dream of many people since childhood. In
this paper, we propose a novel scheme, Line Artist, to synthesize artistic
style paintings with freehand sketch images, leveraging the power of deep
learning and advanced algorithms. Our scheme includes three models. The Sketch
Image Extraction (SIE) model is applied to generate the training data. It
includes smoothing reality images and pencil sketch extraction. The Detailed
Image Synthesis (DIS) model trains a conditional generative adversarial network
to generate detailed real-world information. The Adaptively Weighted Artistic
Style Transfer (AWAST) model is capable to combine multiple style images with a
content with the VGG19 network and PageRank algorithm. The appealing artistic
images are then generated by optimization iterations. Experiments are operated
on the Kaggle Cats dataset and The Oxford Buildings Dataset. Our synthesis
results are proved to be artistic, beautiful and robust.
|
[
{
"version": "v1",
"created": "Sun, 18 Mar 2018 11:54:22 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Li",
"Jinning",
""
],
[
"Liu",
"Siqi",
""
],
[
"Cao",
"Mengyao",
""
]
] |
new_dataset
| 0.98025 |
1803.06720
|
Felix Beierle
|
Felix Beierle, Vinh Thuy Tran, Mathias Allemand, Patrick Neff,
Winfried Schlee, Thomas Probst, R\"udiger Pryss, Johannes Zimmermann
|
TYDR - Track Your Daily Routine. Android App for Tracking Smartphone
Sensor and Usage Data
|
Accepted for publication at the 5th IEEE/ACM International Conference
on Mobile Software Engineering and Systems (MOBILESoft '18)
| null |
10.1145/3197231.3197235
| null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Android app TYDR (Track Your Daily Routine) which tracks
smartphone sensor and usage data and utilizes standardized psychometric
personality questionnaires. With the app, we aim at collecting data for
researching correlations between the tracked smartphone data and the user's
personality in order to predict personality from smartphone data. In this
paper, we highlight our approaches in addressing the challenges in developing
such an app. We optimize the tracking of sensor data by assessing the trade-off
of size of data and battery consumption and granularity of the stored
information. Our user interface is designed to incentivize users to install the
app and fill out questionnaires. TYDR processes and visualizes the tracked
sensor and usage data as well as the results of the personality questionnaires.
When developing an app that will be used in psychological studies, requirements
posed by ethics commissions / institutional review boards and data protection
officials have to be met. We detail our approaches concerning those
requirements regarding the anonymized storing of user data, informing the users
about the data collection, and enabling an opt-out option. We present our
process for anonymized data storing while still being able to identify
individual users who successfully completed a psychological study with the app.
|
[
{
"version": "v1",
"created": "Sun, 18 Mar 2018 19:24:56 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Beierle",
"Felix",
""
],
[
"Tran",
"Vinh Thuy",
""
],
[
"Allemand",
"Mathias",
""
],
[
"Neff",
"Patrick",
""
],
[
"Schlee",
"Winfried",
""
],
[
"Probst",
"Thomas",
""
],
[
"Pryss",
"Rüdiger",
""
],
[
"Zimmermann",
"Johannes",
""
]
] |
new_dataset
| 0.998635 |
1803.06874
|
Christian Timmerer
|
Anatoliy Zabrovskiy, Christian Feldmann, Christian Timmerer
|
Multi-Codec DASH Dataset
|
6 pages, submitted to ACM MMSys'18 (dataset track)
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of bandwidth-hungry applications and services is constantly
growing. HTTP adaptive streaming of audio-visual content accounts for the
majority of today's internet traffic. Although the internet bandwidth increases
also constantly, audio-visual compression technology is inevitable and we are
currently facing the challenge to be confronted with multiple video codecs.
This paper proposes a multi-codec DASH dataset comprising AVC, HEVC, VP9, and
AV1 in order to enable interoperability testing and streaming experiments for
the efficient usage of these codecs under various conditions. We adopt state of
the art encoding and packaging options and also provide basic quality metrics
along with the DASH segments. Additionally, we briefly introduce a multi-codec
DASH scheme and possible usage scenarios. Finally, we provide a preliminary
evaluation of the encoding efficiency in the context of HTTP adaptive streaming
services and applications.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 11:32:36 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Zabrovskiy",
"Anatoliy",
""
],
[
"Feldmann",
"Christian",
""
],
[
"Timmerer",
"Christian",
""
]
] |
new_dataset
| 0.999739 |
1803.06990
|
Wayan Wicke
|
Harald Unterweger, Jens Kirchner, Wayan Wicke, Arman Ahmadzadeh, Doaa
Ahmed, Vahid Jamali, Christoph Alexiou, Georg Fischer, and Robert Schober
|
Experimental Molecular Communication Testbed Based on Magnetic
Nanoparticles in Duct Flow
|
6 pages, 4 figures, 1 table, invited paper in IEEE International
Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
2018
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simple and easy to implement testbeds are needed to further advance molecular
communication research. To this end, this paper presents an in-vessel molecular
communication testbed using magnetic nanoparticles dispersed in an aqueous
suspension as they are also used for drug targeting in biotechnology. The
transmitter is realized by an electronic pump for injection via a Y-connector.
A second pump provides a background flow for signal propagation. For signal
reception, we employ a susceptometer, an electronic device including a coil,
where the magnetic particles move through and generate an electrical signal. We
present experimental results for the transmission of a binary sequence and the
system response following a single injection. For this flow-driven particle
transport, we propose a simple parameterized mathematical model for evaluating
the system response.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 15:28:05 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Unterweger",
"Harald",
""
],
[
"Kirchner",
"Jens",
""
],
[
"Wicke",
"Wayan",
""
],
[
"Ahmadzadeh",
"Arman",
""
],
[
"Ahmed",
"Doaa",
""
],
[
"Jamali",
"Vahid",
""
],
[
"Alexiou",
"Christoph",
""
],
[
"Fischer",
"Georg",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.998807 |
cs/0610145
|
Peter Berlin
|
Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar
|
A Simple Converse of Burnashev's Reliability
|
10 pages, 1 figure, updated missing reference
|
IEEE Transactions on Information Theory, 55(7):3074-3080, July
2009
|
10.1109/TIT.2009.2021322
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a remarkable paper published in 1976, Burnashev determined the reliability
function of variable-length block codes over discrete memoryless channels with
feedback. Subsequently, an alternative achievability proof was obtained by
Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea
is to alternate between a communication and a confirmation phase until the
receiver detects the codeword used by the sender to acknowledge that the
message is correct. We provide a converse that parallels the Yamamoto-Itoh
achievability construction. Besides being simpler than the original, the
proposed converse suggests that a communication and a confirmation phase are
implicit in any scheme for which the probability of error decreases with the
largest possible exponent. The proposed converse also makes it intuitively
clear why the terms that appear in Burnashev's exponent are necessary.
|
[
{
"version": "v1",
"created": "Wed, 25 Oct 2006 15:51:01 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Oct 2006 18:58:36 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Sep 2008 19:31:06 GMT"
}
] | 2018-03-20T00:00:00 |
[
[
"Berlin",
"Peter",
""
],
[
"Nakiboglu",
"Baris",
""
],
[
"Rimoldi",
"Bixio",
""
],
[
"Telatar",
"Emre",
""
]
] |
new_dataset
| 0.991861 |
0903.0197
|
Sean Cleary
|
Sean Cleary and Katherine St. John
|
Rotation Distance is Fixed-Parameter Tractable
|
9 pages, 3 figures
|
Inform. Process. Lett. 109 (2009), no. 16, 918-922
| null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rotation distance between trees measures the number of simple operations it
takes to transform one tree into another. There are no known polynomial-time
algorithms for computing rotation distance. In the case of ordered rooted
trees, we show that the rotation distance between two ordered trees is
fixed-parameter tractable, in the parameter, k, the rotation distance. The
proof relies on the kernalization of the initial trees to trees with size
bounded by 7k.
|
[
{
"version": "v1",
"created": "Mon, 2 Mar 2009 01:36:50 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Cleary",
"Sean",
""
],
[
"John",
"Katherine St.",
""
]
] |
new_dataset
| 0.999347 |
1701.06341
|
Ramji Venkataramanan
|
Mahed Abroshan, Ramji Venkataramanan and Albert Guillen i Fabregas
|
Coding for Segmented Edit Channels
|
Appeared in IEEE Transactions on Information Theory
|
IEEE Transactions on Information Theory, vol. 64, no.4, pp.
3086-3098, April 2018
|
10.1109/TIT.2017.2788143
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers insertion and deletion channels with the additional
assumption that the channel input sequence is implicitly divided into segments
such that at most one edit can occur within a segment. No segment markers are
available in the received sequence. We propose code constructions for the
segmented deletion, segmented insertion, and segmented insertion-deletion
channels based on subsets of Varshamov-Tenengolts codes chosen with
pre-determined prefixes and/or suffixes. The proposed codes, constructed for
any finite alphabet, are zero-error and can be decoded segment-by-segment. We
also derive an upper bound on the rate of any zero-error code for the segmented
edit channel, in terms of the segment length. This upper bound shows that the
rate scaling of the proposed codes as the segment length increases is the same
as that of the maximal code.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 11:43:00 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Feb 2017 18:44:43 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Aug 2017 09:46:13 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Mar 2018 10:00:24 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Abroshan",
"Mahed",
""
],
[
"Venkataramanan",
"Ramji",
""
],
[
"Fabregas",
"Albert Guillen i",
""
]
] |
new_dataset
| 0.999263 |
1710.04123
|
Liu Feng
|
Feng Liu
|
City Brain, a New Architecture of Smart City Based on the Internet Brain
|
12pages, 5 figures,25conference
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the ten years after the Smart City was put forward, there are still
problems like unclear concept, lack of top-down design and information island.
With the further development of the Internet, the brain-like architecture of
the Internet is becoming clearer and clearer. As a product of combination of
city buildings and the Internet, the Smart City will also have a new
architecture, and the city brain thus appears. Based on the Internet Brain,
this paper describes how to construct the Smart City in the form of brain-like
tissue, and how to evaluate the construction level of the Smart City (City IQ)
relying on the Big SNS (city neural networks) and city cloud reflex arcs.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 05:04:25 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Oct 2017 06:04:39 GMT"
},
{
"version": "v3",
"created": "Fri, 16 Mar 2018 07:48:08 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Liu",
"Feng",
""
]
] |
new_dataset
| 0.997974 |
1802.02398
|
Hongmin Li
|
Hongmin Li, Guoqi Li, Hanchao Liu, Luping Shi
|
Super-resolution of spatiotemporal event-stream image captured by the
asynchronous temporal contrast vision sensor
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Super-resolution (SR) is a useful technology to generate a high-resolution
(HR) visual output from the low-resolution (LR) visual inputs overcoming the
physical limitations of the cameras. However, SR has not been applied to
enhance the resolution of spatiotemporal event-stream images captured by the
frame-free dynamic vision sensors (DVSs). SR of event-stream image is
fundamentally different from existing frame-based schemes since basically each
pixel value of DVS images is an event sequence. In this work, a two-stage
scheme is proposed to solve the SR problem of the spatiotemporal event-stream
image. We use a nonhomogeneous Poisson point process to model the event
sequence, and sample the events of each pixel by simulating a nonhomogeneous
Poisson process according to the specified event number and rate function.
Firstly, the event number of each pixel of the HR DVS image is determined with
a sparse signal representation based method to obtain the HR event-count map
from that of the LR DVS recording. The rate function over time line of the
point process of each HR pixel is computed using a spatiotemporal filter on the
corresponding LR neighbor pixels. Secondly, the event sequence of each new
pixel is generated with a thinning based event sampling algorithm. Two metrics
are proposed to assess the event-stream SR results. The proposed method is
demonstrated through obtaining HR event-stream images from a series of DVS
recordings with the proposed method. Results show that the upscaled HR event
streams has perceptually higher spatial texture detail than the LR DVS images.
Besides, the temporal properties of the upscaled HR event streams match that of
the original input very well. This work enables many potential applications of
event-based vision.
|
[
{
"version": "v1",
"created": "Wed, 7 Feb 2018 12:14:56 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Mar 2018 10:39:03 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Li",
"Hongmin",
""
],
[
"Li",
"Guoqi",
""
],
[
"Liu",
"Hanchao",
""
],
[
"Shi",
"Luping",
""
]
] |
new_dataset
| 0.974087 |
1802.09110
|
Marko Mitrovic
|
Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi
|
Submodularity on Hypergraphs: From Sets to Sequences
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a nutshell, submodular functions encode an intuitive notion of diminishing
returns. As a result, submodularity appears in many important machine learning
tasks such as feature selection and data summarization. Although there has been
a large volume of work devoted to the study of submodular functions in recent
years, the vast majority of this work has been focused on algorithms that
output sets, not sequences. However, in many settings, the order in which we
output items can be just as important as the items themselves.
To extend the notion of submodularity to sequences, we use a directed graph
on the items where the edges encode the additional value of selecting items in
a particular order. Existing theory is limited to the case where this
underlying graph is a directed acyclic graph. In this paper, we introduce two
new algorithms that provably give constant factor approximations for general
graphs and hypergraphs having bounded in or out degrees. Furthermore, we show
the utility of our new algorithms for real-world applications in movie
recommendation, online link prediction, and the design of course sequences for
MOOCs.
|
[
{
"version": "v1",
"created": "Mon, 26 Feb 2018 00:07:17 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Mar 2018 22:19:36 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Mitrovic",
"Marko",
""
],
[
"Feldman",
"Moran",
""
],
[
"Krause",
"Andreas",
""
],
[
"Karbasi",
"Amin",
""
]
] |
new_dataset
| 0.973712 |
1803.03422
|
Mordechai Guri
|
Mordechai Guri, Yosef Solewicz, Andrey Daidakulov, Yuval Elovici
|
MOSQUITO: Covert Ultrasonic Transmissions between Two Air-Gapped
Computers using Speaker-to-Speaker Communication
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we show how two (or more) airgapped computers in the same room,
equipped with passive speakers, headphones, or earphones can covertly exchange
data via ultrasonic waves. Microphones are not required. Our method is based on
the capability of a malware to exploit a specific audio chip feature in order
to reverse the connected speakers from output devices into input devices -
unobtrusively rendering them microphones. We discuss the attack model and
provide technical background and implementation details. We show that although
the reversed speakers/headphones/earphones were not originally designed to
perform as microphones, they still respond well to the near-ultrasonic range
(18kHz to 24kHz). We evaluate the communication channel with different
equipment, and at various distances and transmission speeds, and also discuss
some practical considerations. Our results show that the speaker-to-speaker
communication can be used to covertly transmit data between two air-gapped
computers positioned a maximum of nine meters away from one another. Moreover,
we show that two (microphone-less) headphones can exchange data from a distance
of three meters apart. This enables 'headphones-to-headphones' covert
communication, which is discussed for the first time in this paper.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 09:01:30 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Mar 2018 10:38:38 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Solewicz",
"Yosef",
""
],
[
"Daidakulov",
"Andrey",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.99779 |
1803.05365
|
Chris Mitchell
|
Chris J Mitchell
|
The Hsu-Harn-Mu-Zhang-Zhu group key establishment protocol is insecure
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A significant security vulnerability in a recently published group key
establishment protocol is described. This vulnerability allows a malicious
insider to fraudulently establish a group key with an innocent victim, with the
key chosen by the attacker. This shortcoming is sufficiently serious that the
protocol should not be used.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 15:43:13 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Mar 2018 14:28:30 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Mitchell",
"Chris J",
""
]
] |
new_dataset
| 0.957477 |
1803.06121
|
Jinyong Jeong
|
Jinyong Jeong, Younggun Cho, Young-Sik Shin, Hyunchul Roh, Ayoung Kim
|
Complex Urban LiDAR Data Set
|
Accepted to ICRA2018
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper presents a Light Detection and Ranging (LiDAR) data set that
targets complex urban environments. Urban environments with high-rise buildings
and congested traffic pose a significant challenge for many robotics
applications. The presented data set is unique in the sense it is able to
capture the genuine features of an urban environment (e.g. metropolitan areas,
large building complexes and underground parking lots). Data of two-dimensional
(2D) and threedimensional (3D) LiDAR, which are typical types of LiDAR sensors,
are provided in the data set. The two 16-ray 3D LiDARs are tilted on both sides
for maximal coverage. One 2D LiDAR faces backward while the other faces
forwards to collect data of roads and buildings, respectively. Raw sensor data
from Fiber Optic Gyro (FOG), Inertial Measurement Unit (IMU), and the Global
Positioning System (GPS) are presented in a file format for vehicle pose
estimation. The pose information of the vehicle estimated at 100 Hz is also
presented after applying the graph simultaneous localization and mapping (SLAM)
algorithm. For the convenience of development, the file player and data viewer
in Robot Operating System (ROS) environment were also released via the web
page. The full data sets are available at: http://irap.kaist.ac.kr/dataset. In
this website, 3D preview of each data set is provided using WebGL.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2018 09:23:40 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Jeong",
"Jinyong",
""
],
[
"Cho",
"Younggun",
""
],
[
"Shin",
"Young-Sik",
""
],
[
"Roh",
"Hyunchul",
""
],
[
"Kim",
"Ayoung",
""
]
] |
new_dataset
| 0.998896 |
1803.06141
|
Hossein Kashiyani
|
Hossein Kashiyani, Shahriar B. Shokouhi
|
Patchwise object tracking via structural local sparse appearance model
|
6 pages, 3 figures, Accepted by ICCKE 2017
| null |
10.1109/ICCKE.2017.8167940
| null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we propose a robust visual tracking method which exploits the
relationships of targets in adjacent frames using patchwise joint sparse
representation. Two sets of overlapping patches with different sizes are
extracted from target candidates to construct two dictionaries with
consideration of joint sparse representation. By applying this representation
into structural sparse appearance model, we can take two-fold advantages.
First, the correlation of target patches over time is considered. Second, using
this local appearance model with different patch sizes takes into account local
features of target thoroughly. Furthermore, the position of candidate patches
and their occlusion levels are utilized simultaneously to obtain the final
likelihood of target candidates. Evaluations on recent challenging benchmark
show that our tracking method outperforms the state-of-the-art trackers.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2018 10:06:37 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Kashiyani",
"Hossein",
""
],
[
"Shokouhi",
"Shahriar B.",
""
]
] |
new_dataset
| 0.963471 |
1803.06168
|
Laure Daviaud
|
Mikolaj Bojanczyk, Laure Daviaud and Krishna Shankara Narayanan
|
Regular and First Order List Functions
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define two classes of functions, called regular (respectively,
first-order) list functions, which manipulate objects such as lists, lists of
lists, pairs of lists, lists of pairs of lists, etc. The definition is in the
style of regular expressions: the functions are constructed by starting with
some basic functions (e.g. projections from pairs, or head and tail operations
on lists) and putting them together using four combinators (most importantly,
composition of functions). Our main results are that first-order list functions
are exactly the same as first-order transductions, under a suitable encoding of
the inputs; and the regular list functions are exactly the same as
MSO-transductions.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2018 11:25:25 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Bojanczyk",
"Mikolaj",
""
],
[
"Daviaud",
"Laure",
""
],
[
"Narayanan",
"Krishna Shankara",
""
]
] |
new_dataset
| 0.99913 |
1803.06294
|
Alberto Rodriguez-Natal
|
Alberto Rodriguez-Natal, Vina Ermagan, Kien Nguyen, Sharon Barkai,
Yusheng Ji, Fabio Maino, Albert Cabellos-Aparicio
|
SDN for End-Nodes: Scenario Analysis and Architectural Guidelines
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advent of SDN has brought a plethora of new architectures and controller
designs for many use-cases and scenarios. Existing SDN deployments focus on
campus, datacenter and WAN networks. However, little research efforts have been
devoted to the scenario of effectively controlling a full deployment of
end-nodes (e.g. smartphones) that are transient and scattered across the
Internet. In this paper, we present a rigorous analysis of the challenges
associated with an SDN architecture for end-nodes, show that such challenges
are not found in existing SDN scenarios, and provide practical design
guidelines to address them. Then, and following these guidelines we present a
reference architecture based on a decentralized, distributed and symmetric
controller with a connectionless pull-oriented southbound and an intent-driven
northbound. Finally, we measure a proof-of-concept deployment to assess the
validity of the analysis as well as the architecture.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2018 16:17:32 GMT"
}
] | 2018-03-19T00:00:00 |
[
[
"Rodriguez-Natal",
"Alberto",
""
],
[
"Ermagan",
"Vina",
""
],
[
"Nguyen",
"Kien",
""
],
[
"Barkai",
"Sharon",
""
],
[
"Ji",
"Yusheng",
""
],
[
"Maino",
"Fabio",
""
],
[
"Cabellos-Aparicio",
"Albert",
""
]
] |
new_dataset
| 0.99894 |
1511.00925
|
Jamie Morgenstern
|
Justin Hsu, Jamie Morgenstern, Ryan Rogers, Aaron Roth, Rakesh Vohra
|
Do Prices Coordinate Markets?
| null | null |
10.1145/2897518.2897559
| null |
cs.GT cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Walrasian equilibrium prices can be said to coordinate markets: They support
a welfare optimal allocation in which each buyer is buying bundle of goods that
is individually most preferred. However, this clean story has two caveats.
First, the prices alone are not sufficient to coordinate the market, and buyers
may need to select among their most preferred bundles in a coordinated way to
find a feasible allocation. Second, we don't in practice expect to encounter
exact equilibrium prices tailored to the market, but instead only approximate
prices, somehow encoding "distributional" information about the market. How
well do prices work to coordinate markets when tie-breaking is not coordinated,
and they encode only distributional information?
We answer this question. First, we provide a genericity condition such that
for buyers with Matroid Based Valuations, overdemand with respect to
equilibrium prices is at most 1, independent of the supply of goods, even when
tie-breaking is done in an uncoordinated fashion. Second, we provide
learning-theoretic results that show that such prices are robust to changing
the buyers in the market, so long as all buyers are sampled from the same
(unknown) distribution.
|
[
{
"version": "v1",
"created": "Tue, 3 Nov 2015 14:39:32 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Dec 2015 15:32:41 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Apr 2016 18:28:23 GMT"
},
{
"version": "v4",
"created": "Thu, 12 May 2016 20:11:18 GMT"
},
{
"version": "v5",
"created": "Wed, 22 Jun 2016 14:20:14 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Hsu",
"Justin",
""
],
[
"Morgenstern",
"Jamie",
""
],
[
"Rogers",
"Ryan",
""
],
[
"Roth",
"Aaron",
""
],
[
"Vohra",
"Rakesh",
""
]
] |
new_dataset
| 0.998751 |
1607.02250
|
Yiming Cui
|
Yiming Cui, Ting Liu, Zhipeng Chen, Shijin Wang and Guoping Hu
|
Consensus Attention-based Neural Networks for Chinese Reading
Comprehension
|
9+1 pages, published at COLING 2016
| null | null | null |
cs.CL cs.NE
|
http://creativecommons.org/licenses/by/4.0/
|
Reading comprehension has embraced a booming in recent NLP research. Several
institutes have released the Cloze-style reading comprehension data, and these
have greatly accelerated the research of machine comprehension. In this work,
we firstly present Chinese reading comprehension datasets, which consist of
People Daily news dataset and Children's Fairy Tale (CFT) dataset. Also, we
propose a consensus attention-based neural network architecture to tackle the
Cloze-style reading comprehension problem, which aims to induce a consensus
attention over every words in the query. Experimental results show that the
proposed neural network significantly outperforms the state-of-the-art
baselines in several public datasets. Furthermore, we setup a baseline for
Chinese reading comprehension task, and hopefully this would speed up the
process for future research.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2016 06:46:48 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Jul 2016 05:49:42 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Mar 2018 09:21:09 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Cui",
"Yiming",
""
],
[
"Liu",
"Ting",
""
],
[
"Chen",
"Zhipeng",
""
],
[
"Wang",
"Shijin",
""
],
[
"Hu",
"Guoping",
""
]
] |
new_dataset
| 0.99268 |
1611.02787
|
Bum Jun Kwon
|
Bum Jun Kwon, Virinchi Srinivas, Amol Deshpande, Tudor Dumitra\c{s}
|
Catching Worms, Trojan Horses and PUPs: Unsupervised Detection of Silent
Delivery Campaigns
| null | null |
10.14722/ndss.2017.23220
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing commoditization of the underground economy has given rise to
malware delivery networks, which charge fees for quickly delivering malware or
unwanted software to a large number of hosts. To provide this service, a key
method is the orchestration of silent delivery campaigns, which involve a group
of downloaders that receive remote commands and that deliver their payloads
without any user interaction. These campaigns have not been characterized
systematically, unlike other aspects of malware delivery networks. Moreover,
silent delivery campaigns can evade detection by relying on inconspicuous
downloaders on the client side and on disposable domain names on the server
side. We describe Beewolf, a system for detecting silent delivery campaigns
from Internet-wide records of download events. The key observation behind our
system is that the downloaders involved in these campaigns frequently retrieve
payloads in lockstep. Beewolf identifies such locksteps in an unsupervised and
deterministic manner. By exploiting novel techniques and empirical
observations, Beewolf can operate on streaming data. We utilize Beewolf to
study silent delivery campaigns at scale, on a data set of 33.3 million
download events. This investigation yields novel findings, e.g. malware
distributed through compromised software update channels, a substantial overlap
between the delivery ecosystems for malware and unwanted software, and several
types of business relationships within these ecosystems. Beewolf achieves over
92% true positives and fewer than 5% false positives. Moreover, Beewolf can
detect suspicious downloaders a median of 165 days ahead of existing anti-virus
products and payload-hosting domains a median of 196 days ahead of existing
blacklists.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 01:11:45 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Kwon",
"Bum Jun",
""
],
[
"Srinivas",
"Virinchi",
""
],
[
"Deshpande",
"Amol",
""
],
[
"Dumitraş",
"Tudor",
""
]
] |
new_dataset
| 0.99736 |
1709.08299
|
Yiming Cui
|
Yiming Cui, Ting Liu, Zhipeng Chen, Wentao Ma, Shijin Wang and Guoping
Hu
|
Dataset for the First Evaluation on Chinese Machine Reading
Comprehension
|
5 pages, published at LREC 2018
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
Machine Reading Comprehension (MRC) has become enormously popular recently
and has attracted a lot of attention. However, existing reading comprehension
datasets are mostly in English. To add diversity in reading comprehension
datasets, in this paper we propose a new Chinese reading comprehension dataset
for accelerating related research in the community. The proposed dataset
contains two different types: cloze-style reading comprehension and user query
reading comprehension, associated with large-scale training data as well as
human-annotated validation and hidden test set. Along with this dataset, we
also hosted the first Evaluation on Chinese Machine Reading Comprehension
(CMRC-2017) and successfully attracted tens of participants, which suggest the
potential impact of this dataset.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 03:14:01 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Mar 2018 09:22:50 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Cui",
"Yiming",
""
],
[
"Liu",
"Ting",
""
],
[
"Chen",
"Zhipeng",
""
],
[
"Ma",
"Wentao",
""
],
[
"Wang",
"Shijin",
""
],
[
"Hu",
"Guoping",
""
]
] |
new_dataset
| 0.981798 |
1803.02952
|
Tianran Hu
|
Tianran Hu, Anbang Xu, Zhe Liu, Quanzeng You, Yufan Guo, Vibha Sinha,
Jiebo Luo, Rama Akkiraju
|
Touch Your Heart: A Tone-aware Chatbot for Customer Care on Social Media
|
12 pages, CHI 2018
| null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Chatbot has become an important solution to rapidly increasing customer care
demands on social media in recent years. However, current work on chatbot for
customer care ignores a key to impact user experience - tones. In this work, we
create a novel tone-aware chatbot that generates toned responses to user
requests on social media. We first conduct a formative research, in which the
effects of tones are studied. Significant and various influences of different
tones on user experience are uncovered in the study. With the knowledge of
effects of tones, we design a deep learning based chatbot that takes tone
information into account. We train our system on over 1.5 million real customer
care conversations collected from Twitter. The evaluation reveals that our
tone-aware chatbot generates as appropriate responses to user requests as human
agents. More importantly, our chatbot is perceived to be even more empathetic
than human agents.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 03:18:41 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Mar 2018 01:00:25 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Hu",
"Tianran",
""
],
[
"Xu",
"Anbang",
""
],
[
"Liu",
"Zhe",
""
],
[
"You",
"Quanzeng",
""
],
[
"Guo",
"Yufan",
""
],
[
"Sinha",
"Vibha",
""
],
[
"Luo",
"Jiebo",
""
],
[
"Akkiraju",
"Rama",
""
]
] |
new_dataset
| 0.999315 |
1803.05449
|
Alexis Conneau
|
Alexis Conneau and Douwe Kiela
|
SentEval: An Evaluation Toolkit for Universal Sentence Representations
|
LREC 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce SentEval, a toolkit for evaluating the quality of universal
sentence representations. SentEval encompasses a variety of tasks, including
binary and multi-class classification, natural language inference and sentence
similarity. The set of tasks was selected based on what appears to be the
community consensus regarding the appropriate evaluations for universal
sentence representations. The toolkit comes with scripts to download and
preprocess datasets, and an easy interface to evaluate sentence encoders. The
aim is to provide a fairer, less cumbersome and more centralized way for
evaluating sentence representations.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 18:01:15 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Conneau",
"Alexis",
""
],
[
"Kiela",
"Douwe",
""
]
] |
new_dataset
| 0.958783 |
1803.05457
|
Carissa Schoenick
|
Peter Clark, Isaac Cowhey, Oren Etzioni, Tushar Khot, Ashish
Sabharwal, Carissa Schoenick, Oyvind Tafjord
|
Think you have Solved Question Answering? Try ARC, the AI2 Reasoning
Challenge
|
10 pages, 7 tables, 2 figures
| null | null | null |
cs.AI cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new question set, text corpus, and baselines assembled to
encourage AI research in advanced question answering. Together, these
constitute the AI2 Reasoning Challenge (ARC), which requires far more powerful
knowledge and reasoning than previous challenges such as SQuAD or SNLI. The ARC
question set is partitioned into a Challenge Set and an Easy Set, where the
Challenge Set contains only questions answered incorrectly by both a
retrieval-based algorithm and a word co-occurence algorithm. The dataset
contains only natural, grade-school science questions (authored for human
tests), and is the largest public-domain set of this kind (7,787 questions). We
test several baselines on the Challenge Set, including leading neural models
from the SQuAD and SNLI tasks, and find that none are able to significantly
outperform a random baseline, reflecting the difficult nature of this task. We
are also releasing the ARC Corpus, a corpus of 14M science sentences relevant
to the task, and implementations of the three neural baseline models tested.
Can your model perform better? We pose ARC as a challenge to the community.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 18:04:21 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Clark",
"Peter",
""
],
[
"Cowhey",
"Isaac",
""
],
[
"Etzioni",
"Oren",
""
],
[
"Khot",
"Tushar",
""
],
[
"Sabharwal",
"Ashish",
""
],
[
"Schoenick",
"Carissa",
""
],
[
"Tafjord",
"Oyvind",
""
]
] |
new_dataset
| 0.983982 |
1803.05705
|
Fabian Klute
|
Fabian Klute and Martin N\"ollenburg
|
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
|
This is the full version of a paper with the same title appearing in
the proceedings of the 34th International Symposium on Computational Geometry
(SoCG) 2018
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Circular layouts are a popular graph drawing style, where vertices are placed
on a circle and edges are drawn as straight chords. Crossing minimization in
circular layouts is \NP-hard. One way to allow for fewer crossings in practice
are two-sided layouts that draw some edges as curves in the exterior of the
circle. In fact, one- and two-sided circular layouts are equivalent to one-page
and two-page book drawings, i.e., graph layouts with all vertices placed on a
line (the spine) and edges drawn in one or two distinct half-planes (the pages)
bounded by the spine. In this paper we study the problem of minimizing the
crossings for a fixed cyclic vertex order by computing an optimal $k$-plane set
of exteriorly drawn edges for $k \ge 1$, extending the previously studied case
$k=0$. We show that this relates to finding bounded-degree maximum-weight
induced subgraphs of circle graphs, which is a graph-theoretic problem of
independent interest. We show \NP-hardness for arbitrary $k$, present an
efficient algorithm for $k=1$, and generalize it to an explicit \XP-time
algorithm for any fixed $k$. For the practically interesting case $k=1$ we
implemented our algorithm and present experimental results that confirm the
applicability of our algorithm.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2018 12:11:48 GMT"
}
] | 2018-03-16T00:00:00 |
[
[
"Klute",
"Fabian",
""
],
[
"Nöllenburg",
"Martin",
""
]
] |
new_dataset
| 0.97165 |
1611.08882
|
Ilias Giechaskiel
|
Ilias Giechaskiel and Kasper B. Rasmussen and Ken Eguro
|
Leaky Wires: Information Leakage and Covert Communication Between FPGA
Long Wires
| null | null |
10.1145/3196494.3196518
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Field-Programmable Gate Arrays (FPGAs) are integrated circuits that implement
reconfigurable hardware. They are used in modern systems, creating specialized,
highly-optimized integrated circuits without the need to design and manufacture
dedicated chips. As the capacity of FPGAs grows, it is increasingly common for
designers to incorporate implementations of algorithms and protocols from a
range of third-party sources. The monolithic nature of FPGAs means that all
on-chip circuits, including third party black-box designs, must share common
on-chip infrastructure, such as routing resources. In this paper, we observe
that a "long" routing wire carrying a logical 1 reduces the propagation delay
of other adjacent but unconnected long wires in the FPGA interconnect, thereby
leaking information about its state. We exploit this effect and propose a
communication channel that can be used for both covert transmissions between
circuits, and for exfiltration of secrets from the chip. We show that the
effect is measurable for both static and dynamic signals, and that it can be
detected using very small on-board circuits. In our prototype, we are able to
correctly infer the logical state of an adjacent long wire over 99% of the
time, even without error correction, and for signals that are maintained for as
little as 82us. Using a Manchester encoding scheme, our channel bandwidth is as
high as 6kbps. We characterize the channel in detail and show that it is
measurable even when multiple competing circuits are present and can be
replicated on different generations and families of Xilinx devices (Virtex 5,
Virtex 6, and Artix 7). Finally, we propose countermeasures that can be
deployed by systems and tools designers to reduce the impact of this
information leakage.
|
[
{
"version": "v1",
"created": "Sun, 27 Nov 2016 18:23:07 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Aug 2017 22:29:17 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Mar 2018 18:43:06 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Giechaskiel",
"Ilias",
""
],
[
"Rasmussen",
"Kasper B.",
""
],
[
"Eguro",
"Ken",
""
]
] |
new_dataset
| 0.983194 |
1704.06716
|
Abhishek Gupta
|
Abhishek Gupta, Brigitte Jaumard, Massimo Tornatore, Biswanath
Mukherjee
|
Service Chain (SC) Mapping with Multiple SC Instances in a Wide Area
Network
| null | null |
10.1109/GLOCOM.2017.8254731
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network Function Virtualization (NFV) aims to simplify deployment of network
services by running Virtual Network Functions (VNFs) on commercial
off-the-shelf servers. Service deployment involves placement of VNFs and
in-sequence routing of traffic flows through VNFs comprising a Service Chain
(SC). The joint VNF placement and traffic routing is usually referred as SC
mapping. In a Wide Area Network (WAN), a situation may arise where several
traffic flows, generated by many distributed node pairs, require the same SC,
one single instance (or occurrence) of that SC might not be enough. SC mapping
with multiple SC instances for the same SC turns out to be a very complex
problem, since the sequential traversal of VNFs has to be maintained while
accounting for traffic flows in various directions. Our study is the first to
deal with SC mapping with multiple SC instances to minimize network resource
consumption. Exact mathematical modeling of this problem results in a quadratic
formulation. We propose a two-phase column-generation-based model and solution
in order to get results over large network topologies within reasonable
computational times. Using such an approach, we observe that an appropriate
choice of only a small set of SC instances can lead to solution very close to
the minimum bandwidth consumption.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 22:23:27 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Gupta",
"Abhishek",
""
],
[
"Jaumard",
"Brigitte",
""
],
[
"Tornatore",
"Massimo",
""
],
[
"Mukherjee",
"Biswanath",
""
]
] |
new_dataset
| 0.994829 |
1709.00265
|
Aitor Alvarez-Gila
|
Aitor Alvarez-Gila, Joost van de Weijer, Estibaliz Garrote
|
Adversarial Networks for Spatial Context-Aware Spectral Image
Reconstruction from RGB
|
Accepted at IEEE ICCVW 2017 - "Physics Based Vision meets Deep
Learning" Workshop (PBDL 2017). Added train-test splits and updated results
| null |
10.1109/ICCVW.2017.64
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hyperspectral signal reconstruction aims at recovering the original spectral
input that produced a certain trichromatic (RGB) response from a capturing
device or observer. Given the heavily underconstrained, non-linear nature of
the problem, traditional techniques leverage different statistical properties
of the spectral signal in order to build informative priors from real world
object reflectances for constructing such RGB to spectral signal mapping.
However, most of them treat each sample independently, and thus do not benefit
from the contextual information that the spatial dimensions can provide. We
pose hyperspectral natural image reconstruction as an image to image mapping
learning problem, and apply a conditional generative adversarial framework to
help capture spatial semantics. This is the first time Convolutional Neural
Networks -and, particularly, Generative Adversarial Networks- are used to solve
this task. Quantitative evaluation shows a Root Mean Squared Error (RMSE) drop
of 33.2% and a Relative RMSE drop of 54.0% on the ICVL natural hyperspectral
image dataset.
|
[
{
"version": "v1",
"created": "Fri, 1 Sep 2017 12:00:51 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Mar 2018 14:48:14 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Alvarez-Gila",
"Aitor",
""
],
[
"van de Weijer",
"Joost",
""
],
[
"Garrote",
"Estibaliz",
""
]
] |
new_dataset
| 0.983852 |
1711.05581
|
Romain Jacob
|
Romain Jacob, Licong Zhang, Marco Zimmerling, Jan Beutel, Samarjit
Chakraborty, Lothar Thiele
|
TTW: A Time-Triggered-Wireless Design for CPS [ Extended version ]
|
13 pages, 8 figures. Extended version of the same paper, to be
published in the proceedings of DATE 2018
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/4.0/
|
Wired field buses have proved their effectiveness to support Cyber-Physical
Systems (CPS). However, in avionics, for ease of deployment, or for new
functionality featuring mobile devices, there is a strong interest for wireless
solutions. Low-power wireless protocols have been proposed, but requirements of
a large class of CPS applications can still not be satisfied. This paper
presents Time-Triggered-Wireless (TTW), a distributed low-power wireless system
design that minimizes energy consumption and offers end-to-end timing
predictability, adaptability, reliability, low latency. Our evaluation shows a
reduction of communication latency by a factor 2x and of energy consumption by
33-40% compared to state-of-the-art approaches. This validates the suitability
of TTW for wireless CPS applications and opens the way for implementation and
real-world experience with industry partners.
|
[
{
"version": "v1",
"created": "Wed, 15 Nov 2017 14:15:34 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Mar 2018 10:17:43 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Jacob",
"Romain",
""
],
[
"Zhang",
"Licong",
""
],
[
"Zimmerling",
"Marco",
""
],
[
"Beutel",
"Jan",
""
],
[
"Chakraborty",
"Samarjit",
""
],
[
"Thiele",
"Lothar",
""
]
] |
new_dataset
| 0.999846 |
1803.05039
|
Jice Wang
|
Jice Wang and Hongqi Wu
|
Android Inter-App Communication Threats, Solutions, and Challenges
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Researchers and commercial companies have made a lot of efforts on detecting
malware in Android platform. However, a recent malware threat, App collusion,
makes malware detection challenging. In App collusion, two or more Apps
collaborate to perform malicious actions by communicating with each other,
which makes single App analysis insufficient. In this paper, we first introduce
Android security mechanism and communication channels used by android
Applications. Then we summarize the security vulnerabilities and potential
threats introduced by App communication. Finally, we discuss state of art
researches and challenges on App collusion detection.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2018 20:41:14 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Wang",
"Jice",
""
],
[
"Wu",
"Hongqi",
""
]
] |
new_dataset
| 0.994745 |
1803.05210
|
Luca Ghiani
|
Valerio Mura, Giulia Orr\`u, Roberto Casula, Alessandra Sibiriu,
Giulia Loi, Pierluigi Tuveri, Luca Ghiani, and Gian Luca Marcialis
|
LivDet 2017 Fingerprint Liveness Detection Competition 2017
|
presented at ICB 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fingerprint Presentation Attack Detection (FPAD) deals with distinguishing
images coming from artificial replicas of the fingerprint characteristic, made
up of materials like silicone, gelatine or latex, and images coming from alive
fingerprints. Images are captured by modern scanners, typically relying on
solid-state or optical technologies. Since from 2009, the Fingerprint Liveness
Detection Competition (LivDet) aims to assess the performance of the
state-of-the-art algorithms according to a rigorous experimental protocol and,
at the same time, a simple overview of the basic achievements. The competition
is open to all academics research centers and all companies that work in this
field. The positive, increasing trend of the participants number, which
supports the success of this initiative, is confirmed even this year: 17
algorithms were submitted to the competition, with a larger involvement of
companies and academies. This means that the topic is relevant for both sides,
and points out that a lot of work must be done in terms of fundamental and
applied research.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 11:28:52 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Mura",
"Valerio",
""
],
[
"Orrù",
"Giulia",
""
],
[
"Casula",
"Roberto",
""
],
[
"Sibiriu",
"Alessandra",
""
],
[
"Loi",
"Giulia",
""
],
[
"Tuveri",
"Pierluigi",
""
],
[
"Ghiani",
"Luca",
""
],
[
"Marcialis",
"Gian Luca",
""
]
] |
new_dataset
| 0.999494 |
1803.05223
|
Simon Ostermann
|
Simon Ostermann, Ashutosh Modi, Michael Roth, Stefan Thater, Manfred
Pinkal
|
MCScript: A Novel Dataset for Assessing Machine Comprehension Using
Script Knowledge
|
Accepted at LREC 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a large dataset of narrative texts and questions about these
texts, intended to be used in a machine comprehension task that requires
reasoning using commonsense knowledge. Our dataset complements similar datasets
in that we focus on stories about everyday activities, such as going to the
movies or working in the garden, and that the questions require commonsense
knowledge, or more specifically, script knowledge, to be answered. We show that
our mode of data collection via crowdsourcing results in a substantial amount
of such inference questions. The dataset forms the basis of a shared task on
commonsense and script knowledge organized at SemEval 2018 and provides
challenging test cases for the broader natural language understanding
community.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 11:59:13 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Ostermann",
"Simon",
""
],
[
"Modi",
"Ashutosh",
""
],
[
"Roth",
"Michael",
""
],
[
"Thater",
"Stefan",
""
],
[
"Pinkal",
"Manfred",
""
]
] |
new_dataset
| 0.999722 |
1803.05278
|
Xiaobo Zhou
|
Xiaobo Zhou, Jun Li, Feng Shu, Qingqing Wu, Yongpeng Wu, Wen Chen, and
Hanzo Lajos
|
Secure SWIPT for Directional Modulation Aided AF Relaying Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secure wireless information and power transfer based on directional
modulation is conceived for amplify-and-forward (AF) relaying networks.
Explicitly, we first formulate a secrecy rate maximization (SRM) problem, which
can be decomposed into a twin-level optimization problem and solved by a
one-dimensional (1D) search and semidefinite relaxation (SDR) technique. Then
in order to reduce the search complexity, we formulate an optimization problem
based on maximizing the signal-to-leakage-AN-noise-ratio (Max-SLANR) criterion,
and transform it into a SDR problem. Additionally, the relaxation is proved to
be tight according to the classic Karush-Kuhn-Tucker (KKT) conditions. Finally,
to reduce the computational complexity, a successive convex approximation (SCA)
scheme is proposed to find a near-optimal solution. The complexity of the SCA
scheme is much lower than that of the SRM and the Max-SLANR schemes. Simulation
results demonstrate that the performance of the SCA scheme is very close to
that of the SRM scheme in terms of its secrecy rate and bit error rate (BER),
but much better than that of the zero forcing (ZF) scheme.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 13:45:41 GMT"
}
] | 2018-03-15T00:00:00 |
[
[
"Zhou",
"Xiaobo",
""
],
[
"Li",
"Jun",
""
],
[
"Shu",
"Feng",
""
],
[
"Wu",
"Qingqing",
""
],
[
"Wu",
"Yongpeng",
""
],
[
"Chen",
"Wen",
""
],
[
"Lajos",
"Hanzo",
""
]
] |
new_dataset
| 0.959131 |
1401.6312
|
Bart Bogaerts
|
Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Gerda Janssens and
Marc Denecker
|
Predicate Logic as a Modelling Language: The IDP System
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the technology of the time, Kowalski's seminal 1974 paper {\em Predicate
Logic as a Programming Language} was a breakthrough for the use of logic in
computer science. It introduced two fundamental ideas: on the declarative side,
the use of the Horn clause logic fragment of classical logic, which was soon
extended with negation as failure, on the procedural side the procedural
interpretation which made it possible to write algorithms in the formalism.
Since then, strong progress was made both on the declarative understanding of
the logic programming formalism and in automated reasoning technologies,
particularly in SAT solving, Constraint Programming and Answer Set Programming.
This has paved the way for the development of an extension of logic programming
that embodies a more pure view of logic as a modelling language and its role
for problem solving.
In this paper, we present the \idp language and system. The language is
essentially classical logic extended with one of logic programmings most
important contributions to knowledge representation: the representation of
complex definitions as rule sets under well-founded semantics. The system is a
knowledge base system: a system in which complex declarative information is
stored in a knowledge base which can be used to solve different computational
problems by applying multiple forms of inference. In this view, theories are
declarative modellings, bags of information, descriptions of possible states of
affairs. They are neither procedures nor descriptions of computational
problems. As such, the \idp language and system preserve the fundamental idea
of a declarative reading of logic programs, while they break with the
fundamental idea of the procedural interpretation of logic programs.
|
[
{
"version": "v1",
"created": "Fri, 24 Jan 2014 11:13:43 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Mar 2016 09:43:32 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Mar 2018 13:06:19 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"De Cat",
"Broes",
""
],
[
"Bogaerts",
"Bart",
""
],
[
"Bruynooghe",
"Maurice",
""
],
[
"Janssens",
"Gerda",
""
],
[
"Denecker",
"Marc",
""
]
] |
new_dataset
| 0.992888 |
1611.00616
|
Jiafeng Xu
|
Jiafeng Xu, Karl Henning Halse
|
Dual Quaternion Variational Integrator for Rigid Body Dynamic Simulation
| null | null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a symplectic dual quaternion variational integrator(DQVI) for
simulating single rigid body motion in all six degrees of freedom. Dual
quaternion is used to represent rigid body kinematics and one-step Lie group
variational integrator is used to conserve the geometric structure, energy and
momentum of the system during the simulation. The combination of these two
becomes the first Lie group variational integrator for rigid body simulation
without decoupling translations and rotations. Newton-Raphson method is used to
solve the recursive dynamic equation. This method is suitable for real-time
rigid body simulations with high precision under large time step. DQVI respects
the symplectic structure of the system with excellent long-term conservation of
geometry structure, momentum and energy. It also allows the reference point and
6-by-6 inertia matrix to be arbitrarily defined, which is very convenient for a
variety of engineering problems.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 14:02:16 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Mar 2018 15:49:09 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Xu",
"Jiafeng",
""
],
[
"Halse",
"Karl Henning",
""
]
] |
new_dataset
| 0.994376 |
1704.03329
|
Eike Hermann M\"uller
|
William R. Saunders and James Grant and Eike H. M\"uller
|
A Domain Specific Language for Performance Portable Molecular Dynamics
Algorithms
|
24 pages, 12 figures, 11 tables, accepted for publication in Computer
Physics Communications on 12 Nov 2017
| null |
10.1016/j.cpc.2017.11.006
| null |
cs.DC cs.SE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developers of Molecular Dynamics (MD) codes face significant challenges when
adapting existing simulation packages to new hardware. In a continuously
diversifying hardware landscape it becomes increasingly difficult for
scientists to be experts both in their own domain (physics/chemistry/biology)
and specialists in the low level parallelisation and optimisation of their
codes. To address this challenge, we describe a "Separation of Concerns"
approach for the development of parallel and optimised MD codes: the science
specialist writes code at a high abstraction level in a domain specific
language (DSL), which is then translated into efficient computer code by a
scientific programmer. In a related context, an abstraction for the solution of
partial differential equations with grid based methods has recently been
implemented in the (Py)OP2 library. Inspired by this approach, we develop a
Python code generation system for molecular dynamics simulations on different
parallel architectures, including massively parallel distributed memory systems
and GPUs. We demonstrate the efficiency of the auto-generated code by studying
its performance and scalability on different hardware and compare it to other
state-of-the-art simulation packages. With growing data volumes the extraction
of physically meaningful information from the simulation becomes increasingly
challenging and requires equally efficient implementations. A particular
advantage of our approach is the easy expression of such analysis algorithms.
We consider two popular methods for deducing the crystalline structure of a
material from the local environment of each atom, show how they can be
expressed in our abstraction and implement them in the code generation
framework.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 14:52:55 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Nov 2017 15:02:44 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Saunders",
"William R.",
""
],
[
"Grant",
"James",
""
],
[
"Müller",
"Eike H.",
""
]
] |
new_dataset
| 0.9992 |
1705.06860
|
Sha Hu
|
Sha Hu, Fredrik Rusek, and Ove Edfors
|
Beyond Massive-MIMO: The Potential of Positioning with Large Intelligent
Surfaces
|
Submitted to IEEE Trans. on Signal Processing on Apr. 2017; 30 pages;
13 figures
| null |
10.1109/TSP.2018.2795547
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the potential for positioning with a system where antenna arrays
are deployed as a large intelligent surface (LIS), which is a newly proposed
concept beyond massive-MIMO where future man-made structures are electronically
active with integrated electronics and wireless communication making the entire
environment \lq\lq{}intelligent\rq\rq{}. In a first step, we derive
Fisher-information and Cram\'{e}r-Rao lower bounds (CRLBs) in closed-form for
positioning a terminal located perpendicular to the center of the LIS, whose
location we refer to as being on the central perpendicular line (CPL) of the
LIS. For a terminal that is not on the CPL, closed-form expressions of the
Fisher-information and CRLB seem out of reach, and we alternatively find
approximations of them which are shown to be accurate. Under mild conditions,
we show that the CRLB for all three Cartesian dimensions ($x$, $y$ and $z$)
decreases quadratically in the surface-area of the LIS, except for a terminal
exactly on the CPL where the CRLB for the $z$-dimension (distance from the LIS)
decreases linearly in the same. In a second step, we analyze the CRLB for
positioning when there is an unknown phase $\varphi$ presented in the analog
circuits of the LIS. We then show that the CRLBs are dramatically increased for
all three dimensions but decrease in the third-order of the surface-area.
Moreover, with an infinitely large LIS the CRLB for the $z$-dimension with an
unknown $\varphi$ is 6 dB higher than the case without phase uncertainty, and
the CRLB for estimating $\varphi$ converges to a constant that is independent
of the wavelength $\lambda$. At last, we extensively discuss the impact of
centralized and distributed deployments of LIS, and show that a distributed
deployment of LIS can enlarge the coverage for terminal-positioning and improve
the overall positioning performance.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 04:43:09 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Hu",
"Sha",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Edfors",
"Ove",
""
]
] |
new_dataset
| 0.99799 |
1705.09776
|
Xinfeng Zhang
|
Lingyu Duan, Wei Sun, Xinfeng Zhang, Shiqi Wang, Jie Chen, Jianxiong
Yin, Simon See, Tiejun Huang, Alex C. Kot, Wen Gao
|
Fast MPEG-CDVS Encoder with GPU-CPU Hybrid Computing
| null | null |
10.1109/TIP.2018.2794203
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The compact descriptors for visual search (CDVS) standard from ISO/IEC moving
pictures experts group (MPEG) has succeeded in enabling the interoperability
for efficient and effective image retrieval by standardizing the bitstream
syntax of compact feature descriptors. However, the intensive computation of
CDVS encoder unfortunately hinders its widely deployment in industry for
large-scale visual search. In this paper, we revisit the merits of low
complexity design of CDVS core techniques and present a very fast CDVS encoder
by leveraging the massive parallel execution resources of GPU. We elegantly
shift the computation-intensive and parallel-friendly modules to the
state-of-the-arts GPU platforms, in which the thread block allocation and the
memory access are jointly optimized to eliminate performance loss. In addition,
those operations with heavy data dependence are allocated to CPU to resolve the
extra but non-necessary computation burden for GPU. Furthermore, we have
demonstrated the proposed fast CDVS encoder can work well with those
convolution neural network approaches which has harmoniously leveraged the
advantages of GPU platforms, and yielded significant performance improvements.
Comprehensive experimental results over benchmarks are evaluated, which has
shown that the fast CDVS encoder using GPU-CPU hybrid computing is promising
for scalable visual search.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 06:59:37 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Jun 2017 11:26:11 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Duan",
"Lingyu",
""
],
[
"Sun",
"Wei",
""
],
[
"Zhang",
"Xinfeng",
""
],
[
"Wang",
"Shiqi",
""
],
[
"Chen",
"Jie",
""
],
[
"Yin",
"Jianxiong",
""
],
[
"See",
"Simon",
""
],
[
"Huang",
"Tiejun",
""
],
[
"Kot",
"Alex C.",
""
],
[
"Gao",
"Wen",
""
]
] |
new_dataset
| 0.997233 |
1709.02782
|
Majid Masoumi
|
Majid Masoumi, A. Ben Hamza
|
Global spectral graph wavelet signature for surface analysis of carpal
bones
|
arXiv admin note: substantial text overlap with arXiv:1705.06250
| null |
10.1088/1361-6560/aaa71a
| null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a spectral graph wavelet approach for shape
analysis of carpal bones of human wrist. We apply a metric called global
spectral graph wavelet signature for representation of cortical surface of the
carpal bone based on eigensystem of Laplace-Beltrami operator. Furthermore, we
propose a heuristic and efficient way of aggregating local descriptors of a
carpal bone surface to global descriptor. The resultant global descriptor is
not only isometric invariant, but also much more efficient and requires less
memory storage. We perform experiments on shape of the carpal bones of ten
women and ten men from a publicly-available database. Experimental results show
the excellency of the proposed GSGW compared to recent proposed GPS embedding
approach for comparing shapes of the carpal bones across populations.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 18:30:54 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Masoumi",
"Majid",
""
],
[
"Hamza",
"A. Ben",
""
]
] |
new_dataset
| 0.998708 |
1802.07490
|
Shan Luo Dr
|
Shan Luo, Wenzhen Yuan, Edward Adelson, Anthony G. Cohn and Raul
Fuentes
|
ViTac: Feature Sharing between Vision and Tactile Sensing for Cloth
Texture Recognition
|
6 pages, 5 figures, Accepted for 2018 IEEE International Conference
on Robotics and Automation
| null | null | null |
cs.RO cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vision and touch are two of the important sensing modalities for humans and
they offer complementary information for sensing the environment. Robots could
also benefit from such multi-modal sensing ability. In this paper, addressing
for the first time (to the best of our knowledge) texture recognition from
tactile images and vision, we propose a new fusion method named Deep Maximum
Covariance Analysis (DMCA) to learn a joint latent space for sharing features
through vision and tactile sensing. The features of camera images and tactile
data acquired from a GelSight sensor are learned by deep neural networks. But
the learned features are of a high dimensionality and are redundant due to the
differences between the two sensing modalities, which deteriorates the
perception performance. To address this, the learned features are paired using
maximum covariance analysis. Results of the algorithm on a newly collected
dataset of paired visual and tactile data relating to cloth textures show that
a good recognition performance of greater than 90\% can be achieved by using
the proposed DMCA framework. In addition, we find that the perception
performance of either vision or tactile sensing can be improved by employing
the shared representation space, compared to learning from unimodal data.
|
[
{
"version": "v1",
"created": "Wed, 21 Feb 2018 10:06:14 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Mar 2018 14:57:30 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Luo",
"Shan",
""
],
[
"Yuan",
"Wenzhen",
""
],
[
"Adelson",
"Edward",
""
],
[
"Cohn",
"Anthony G.",
""
],
[
"Fuentes",
"Raul",
""
]
] |
new_dataset
| 0.954137 |
1803.02622
|
Christian Zimmermann
|
Christian Zimmermann, Tim Welschehold, Christian Dornhege, Wolfram
Burgard and Thomas Brox
|
3D Human Pose Estimation in RGBD Images for Robotic Task Learning
|
Accepted to ICRA 2018. Video and Code (ROS node) are available:
http://lmb.informatik.uni-freiburg.de/projects/rgbd-pose3d/
| null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an approach to estimate 3D human pose in real world units from a
single RGBD image and show that it exceeds performance of monocular 3D pose
estimation approaches from color as well as pose estimation exclusively from
depth. Our approach builds on robust human keypoint detectors for color images
and incorporates depth for lifting into 3D. We combine the system with our
learning from demonstration framework to instruct a service robot without the
need of markers. Experiments in real world settings demonstrate that our
approach enables a PR2 robot to imitate manipulation actions observed from a
human teacher.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 12:46:18 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Mar 2018 10:18:18 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Zimmermann",
"Christian",
""
],
[
"Welschehold",
"Tim",
""
],
[
"Dornhege",
"Christian",
""
],
[
"Burgard",
"Wolfram",
""
],
[
"Brox",
"Thomas",
""
]
] |
new_dataset
| 0.967216 |
1803.04442
|
Krzysztof Rzadca
|
Grzegorz Milka, Krzysztof Rzadca
|
Dfuntest: A Testing Framework for Distributed Applications
|
PPAM 2017 Proceedings
| null |
10.1007/978-3-319-78024-5_35
| null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New ideas in distributed systems (algorithms or protocols) are commonly
tested by simulation, because experimenting with a prototype deployed on a
realistic platform is cumbersome. However, a prototype not only measures
performance but also verifies assumptions about the underlying system. We
developed dfuntest - a testing framework for distributed applications that
defines abstractions and test structure, and automates experiments on
distributed platforms. Dfuntest aims to be jUnit's analogue for distributed
applications; a framework that enables the programmer to write robust and
flexible scenarios of experiments. Dfuntest requires minimal bindings that
specify how to deploy and interact with the application. Dfuntest's
abstractions allow execution of a scenario on a single machine, a cluster, a
cloud, or any other distributed infrastructure, e.g. on PlanetLab. A scenario
is a procedure; thus, our framework can be used both for functional tests and
for performance measurements. We show how to use dfuntest to deploy our DHT
prototype on 60 PlanetLab nodes and verify whether the prototype maintains a
correct topology.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 18:25:59 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Milka",
"Grzegorz",
""
],
[
"Rzadca",
"Krzysztof",
""
]
] |
new_dataset
| 0.999203 |
1803.04553
|
Li-Yang Tan
|
Rocco A. Servedio and Li-Yang Tan
|
Luby--Veli\v{c}kovi\'c--Wigderson revisited: Improved correlation bounds
and pseudorandom generators for depth-two circuits
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study correlation bounds and pseudorandom generators for depth-two
circuits that consist of a $\mathsf{SYM}$-gate (computing an arbitrary
symmetric function) or $\mathsf{THR}$-gate (computing an arbitrary linear
threshold function) that is fed by $S$ $\mathsf{AND}$ gates. Such circuits were
considered in early influential work on unconditional derandomization of Luby,
Veli\v{c}kovi\'c, and Wigderson [LVW93], who gave the first non-trivial PRG
with seed length $2^{O(\sqrt{\log(S/\varepsilon)})}$ that $\varepsilon$-fools
these circuits.
In this work we obtain the first strict improvement of [LVW93]'s seed length:
we construct a PRG that $\varepsilon$-fools size-$S$
$\{\mathsf{SYM},\mathsf{THR}\} \circ\mathsf{AND}$ circuits over $\{0,1\}^n$
with seed length \[ 2^{O(\sqrt{\log S })} + \mathrm{polylog}(1/\varepsilon), \]
an exponential (and near-optimal) improvement of the $\varepsilon$-dependence
of [LVW93]. The above PRG is actually a special case of a more general PRG
which we establish for constant-depth circuits containing multiple
$\mathsf{SYM}$ or $\mathsf{THR}$ gates, including as a special case
$\{\mathsf{SYM},\mathsf{THR}\} \circ \mathsf{AC^0}$ circuits. These more
general results strengthen previous results of Viola [Vio06] and essentially
strengthen more recent results of Lovett and Srinivasan [LS11].
Our improved PRGs follow from improved correlation bounds, which are
transformed into PRGs via the Nisan--Wigderson "hardness versus randomness"
paradigm [NW94]. The key to our improved correlation bounds is the use of a
recent powerful \emph{multi-switching} lemma due to H{\aa}stad [H{\aa}s14].
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 22:12:00 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Servedio",
"Rocco A.",
""
],
[
"Tan",
"Li-Yang",
""
]
] |
new_dataset
| 0.999051 |
1803.04631
|
Xiaolong Xie
|
Xiaolong Xie, Yun Liang, Xiuhong Li, Wei Tan
|
CuLDA_CGS: Solving Large-scale LDA Problems on GPUs
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Latent Dirichlet Allocation(LDA) is a popular topic model. Given the fact
that the input corpus of LDA algorithms consists of millions to billions of
tokens, the LDA training process is very time-consuming, which may prevent the
usage of LDA in many scenarios, e.g., online service. GPUs have benefited
modern machine learning algorithms and big data analysis as they can provide
high memory bandwidth and computation power. Therefore, many frameworks, e.g.
Ten- sorFlow, Caffe, CNTK, support to use GPUs for accelerating the popular
machine learning data-intensive algorithms. However, we observe that LDA
solutions on GPUs are not satisfying.
In this paper, we present CuLDA_CGS, a GPU-based efficient and scalable
approach to accelerate large-scale LDA problems. CuLDA_CGS is designed to
efficiently solve LDA problems at high throughput. To it, we first delicately
design workload partition and synchronization mechanism to exploit the benefits
of mul- tiple GPUs. Then, we offload the LDA sampling process to each
individual GPU by optimizing from the sampling algorithm, par- allelization,
and data compression perspectives. Evaluations show that compared with
state-of-the-art LDA solutions, CuLDA_CGS outperforms them by a large margin
(up to 7.3X) on a single GPU. CuLDA_CGS is able to achieve extra 3.0X speedup
on 4 GPUs. The source code is publicly available on https://github.com/cuMF/
CuLDA_CGS.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2018 05:44:40 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Xie",
"Xiaolong",
""
],
[
"Liang",
"Yun",
""
],
[
"Li",
"Xiuhong",
""
],
[
"Tan",
"Wei",
""
]
] |
new_dataset
| 0.999374 |
1803.04827
|
Amin Banitalebi-Dehkordi
|
Amin Banitalebi-Dehkordi, Yuanyuan Dong, Mahsa T. Pourazad, and Panos
Nasiopoulos
|
A Learning-Based Visual Saliency Fusion Model for High Dynamic Range
Video (LBVS-HDR)
| null |
EUSIPCO, 2015
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency prediction for Standard Dynamic Range (SDR) videos has been well
explored in the last decade. However, limited studies are available on High
Dynamic Range (HDR) Visual Attention Models (VAMs). Considering that the
characteristic of HDR content in terms of dynamic range and color gamut is
quite different than those of SDR content, it is essential to identify the
importance of different saliency attributes of HDR videos for designing a VAM
and understand how to combine these features. To this end we propose a
learning-based visual saliency fusion method for HDR content (LVBS-HDR) to
combine various visual saliency features. In our approach various conspicuity
maps are extracted from HDR data, and then for fusing conspicuity maps, a
Random Forests algorithm is used to train a model based on the collected data
from an eye-tracking experiment. Performance evaluations demonstrate the
superiority of the proposed fusion method against other existing fusion
methods.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2018 14:21:09 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Banitalebi-Dehkordi",
"Amin",
""
],
[
"Dong",
"Yuanyuan",
""
],
[
"Pourazad",
"Mahsa T.",
""
],
[
"Nasiopoulos",
"Panos",
""
]
] |
new_dataset
| 0.98291 |
1803.04860
|
Simone Madeo
|
Alexandra Covaci and Simone Madeo and Patrick Motylinski and
St\'ephane Vincent
|
NECTAR: Non-Interactive Smart Contract Protocol using Blockchain
Technology
|
IEEE/ACM 1st International Workshop on Emerging Trends in Software
Engineering for Blockchain (WETSEB 2018)
| null |
10.1145/3194113.3194116
| null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blockchain-driven technologies are considered disruptive because of the
availability of dis-intermediated, censorship-resistant and tamper-proof
digital platforms of distributed trust. Among these technologies, smart
contract platforms have the potential to take over functions usually done by
intermediaries like banks, escrow or legal services. In this paper, we
introduce a novel protocol aiming to execute smart contracts as part of a
blockchain transaction validation. We enable extensions in the execution of
smart contracts while guaranteeing their privacy, correctness and
verifiability. Man-in-the-middle attacks are prevented, since no communication
between participants is requested, and contract validations do not imply the
re-execution of the code by all the nodes in the network. However, proofs of
correct execution are stored on the blockchain and can be verified by multiple
parties. Our solution is based on programming tools which optimize the time
execution and the required memory while preserving the embedded functionality.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2018 14:57:53 GMT"
}
] | 2018-03-14T00:00:00 |
[
[
"Covaci",
"Alexandra",
""
],
[
"Madeo",
"Simone",
""
],
[
"Motylinski",
"Patrick",
""
],
[
"Vincent",
"Stéphane",
""
]
] |
new_dataset
| 0.992142 |
1704.04882
|
Dusko Pavlovic
|
Dusko Pavlovic and Muzamil Yahia
|
Monoidal computer III: A coalgebraic view of computability and
complexity
|
34 pages, 24 figures; in this version: added the Appendix
| null | null | null |
cs.LO cs.CC math.CT math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monoidal computer is a categorical model of intensional computation, where
many different programs correspond to the same input-output behavior. The
upshot of yet another model of computation is that a categorical formalism
should provide a much needed high level language for theory of computation,
flexible enough to allow abstracting away the low level implementation details
when they are irrelevant, or taking them into account when they are genuinely
needed. A salient feature of the approach through monoidal categories is the
formal graphical language of string diagrams, which supports visual reasoning
about programs and computations.
In the present paper, we provide a coalgebraic characterization of monoidal
computer. It turns out that the availability of interpreters and specializers,
that make a monoidal category into a monoidal computer, is equivalent with the
existence of a *universal state space*, that carries a weakly final state
machine for any pair of input and output types. Being able to program state
machines in monoidal computers allows us to represent Turing machines, to
capture their execution, count their steps, as well as, e.g., the memory cells
that they use. The coalgebraic view of monoidal computer thus provides a
convenient diagrammatic language for studying computability and complexity.
|
[
{
"version": "v1",
"created": "Mon, 17 Apr 2017 06:27:29 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Feb 2018 09:00:13 GMT"
},
{
"version": "v3",
"created": "Mon, 12 Mar 2018 01:36:07 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Pavlovic",
"Dusko",
""
],
[
"Yahia",
"Muzamil",
""
]
] |
new_dataset
| 0.988431 |
1708.02721
|
Boyi Jiang
|
Boyi Jiang, Juyong Zhang, Bailin Deng, Yudong Guo and Ligang Liu
|
Deep Face Feature for Face Alignment
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a deep learning based image feature extraction
method designed specifically for face images. To train the feature extraction
model, we construct a large scale photo-realistic face image dataset with
ground-truth correspondence between multi-view face images, which are
synthesized from real photographs via an inverse rendering procedure. The deep
face feature (DFF) is trained using correspondence between face images rendered
from different views. Using the trained DFF model, we can extract a feature
vector for each pixel of a face image, which distinguishes different facial
regions and is shown to be more effective than general-purpose feature
descriptors for face-related tasks such as matching and alignment. Based on the
DFF, we develop a robust face alignment method, which iteratively updates
landmarks, pose and 3D shape. Extensive experiments demonstrate that our method
can achieve state-of-the-art results for face alignment under highly
unconstrained face images.
|
[
{
"version": "v1",
"created": "Wed, 9 Aug 2017 05:39:36 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Mar 2018 12:30:36 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Jiang",
"Boyi",
""
],
[
"Zhang",
"Juyong",
""
],
[
"Deng",
"Bailin",
""
],
[
"Guo",
"Yudong",
""
],
[
"Liu",
"Ligang",
""
]
] |
new_dataset
| 0.987093 |
1803.03663
|
Daniel Paulusma
|
Barnaby Martin, Daniel Paulusma, Erik Jan van Leeuwen
|
Disconnected Cuts in Claw-free Graphs
| null | null | null | null |
cs.DS cs.CC cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A disconnected cut of a connected graph is a vertex cut that itself also
induces a disconnected subgraph. The decision problem whether a graph has a
disconnected cut is called Disconnected Cut. This problem is closely related to
several homomorphism and contraction problems, and fits in an extensive line of
research on vertex cuts with additional properties. It is known that
Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms
are known for several graph classes. However, the complexity of the problem on
claw-free graphs remained an open question. Its connection to the complexity of
the problem to contract a claw-free graph to the 4-vertex cycle $C_4$ led Ito
et al. (TCS 2011) to explicitly ask to resolve this open question.
We prove that Disconnected Cut is polynomial-time solvable on claw-free
graphs, answering the question of Ito et al. The centerpiece of our result is a
novel decomposition theorem for claw-free graphs of diameter 2, which we
believe is of independent interest and expands the research line initiated by
Chudnovsky and Seymour (JCTB 2007-2012) and Hermelin et al. (ICALP 2011). On
our way to exploit this decomposition theorem, we characterize how disconnected
cuts interact with certain cobipartite subgraphs, and prove two further novel
algorithmic results, namely Disconnected Cut is polynomial-time solvable on
circular-arc graphs and line graphs.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 19:23:03 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Martin",
"Barnaby",
""
],
[
"Paulusma",
"Daniel",
""
],
[
"van Leeuwen",
"Erik Jan",
""
]
] |
new_dataset
| 0.977976 |
1803.03667
|
Irina Legchenkova
|
Evgeny Shulzinger, Irina Legchenkova and Edward Bormashenko
|
Co-occurrence of the Benford-like and Zipf Laws Arising from the Texts
Representing Human and Artificial Languages
|
23 pages, 8 figures, 4 tables
| null | null | null |
cs.CL physics.soc-ph stat.OT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate that large texts, representing human (English, Russian,
Ukrainian) and artificial (C++, Java) languages, display quantitative patterns
characterized by the Benford-like and Zipf laws. The frequency of a word
following the Zipf law is inversely proportional to its rank, whereas the total
numbers of a certain word appearing in the text generate the uneven
Benford-like distribution of leading numbers. Excluding the most popular words
essentially improves the correlation of actual textual data with the Zipfian
distribution, whereas the Benford distribution of leading numbers (arising from
the overall amount of a certain word) is insensitive to the same elimination
procedure. The calculated values of the moduli of slopes of double
logarithmical plots for artificial languages (C++, Java) are markedly larger
than those for human ones.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 12:24:42 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Shulzinger",
"Evgeny",
""
],
[
"Legchenkova",
"Irina",
""
],
[
"Bormashenko",
"Edward",
""
]
] |
new_dataset
| 0.998636 |
1803.03705
|
Saeed Mehrabi
|
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio
Montecchiani, Pat Morin, and Luis Fernando Schultz Xavier da Silveira
|
Geodesic Obstacle Representation of Graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An obstacle representation of a graph is a mapping of the vertices onto
points in the plane and a set of connected regions of the plane (called
obstacles) such that the straight-line segment connecting the points
corresponding to two vertices does not intersect any obstacles if and only if
the vertices are adjacent in the graph. The obstacle representation and its
plane variant (in which the resulting representation is a plane straight-line
embedding of the graph) have been extensively studied with the main objective
of minimizing the number of obstacles. Recently, Biedl and Mehrabi (GD 2017)
studied grid obstacle representations of graphs in which the vertices of the
graph are mapped onto the points in the plane while the straight-line segments
representing the adjacency between the vertices is replaced by the $L_1$
(Manhattan) shortest paths in the plane that avoid obstacles.
In this paper, we introduce the notion of geodesic obstacle representations
of graphs with the main goal of providing a generalized model, which comes
naturally when viewing line segments as shortest paths in the Euclidean plane.
To this end, we extend the definition of obstacle representation by allowing
some obstacles-avoiding shortest path between the corresponding points in the
underlying metric space whenever the vertices are adjacent in the graph. We
consider both general and plane variants of geodesic obstacle representations
(in a similar sense to obstacle representations) under any polyhedral distance
function in $\mathbb{R}^d$ as well as shortest path distances in graphs. Our
results generalize and unify the notions of obstacle representations, plane
obstacle representations and grid obstacle representations, leading to a number
of questions on such embeddings.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 21:54:48 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Bose",
"Prosenjit",
""
],
[
"Carmi",
"Paz",
""
],
[
"Dujmovic",
"Vida",
""
],
[
"Mehrabi",
"Saeed",
""
],
[
"Montecchiani",
"Fabrizio",
""
],
[
"Morin",
"Pat",
""
],
[
"da Silveira",
"Luis Fernando Schultz Xavier",
""
]
] |
new_dataset
| 0.984351 |
1803.03733
|
Jie Xu Dr.
|
Xiaowen Cao and Jie Xu and Rui Zhang
|
Mobile Edge Computing for Cellular-Connected UAV: Computation Offloading
and Trajectory Optimization
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies a new mobile edge computing (MEC) setup where an unmanned
aerial vehicle (UAV) is served by cellular ground base stations (GBSs) for
computation offloading. The UAV flies between a give pair of initial and final
locations, during which it needs to accomplish certain computation tasks by
offloading them to some selected GBSs along its trajectory for parallel
execution. Under this setup, we aim to minimize the UAV's mission completion
time by optimizing its trajectory jointly with the computation offloading
scheduling, subject to the maximum speed constraint of the UAV, and the
computation capacity constraints at GBSs. The joint UAV trajectory and
computation offloading optimization problem is, however, non-convex and thus
difficult to be solved optimally. To tackle this problem, we propose an
efficient algorithm to obtain a high-quality suboptimal solution. Numerical
results show that the proposed design significantly reduces the UAV's mission
completion time, as compared to benchmark schemes.
|
[
{
"version": "v1",
"created": "Sat, 10 Mar 2018 01:33:24 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Cao",
"Xiaowen",
""
],
[
"Xu",
"Jie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.994996 |
1803.03786
|
Georgi Karadzhov
|
Georgi Karadzhov, Pepa Gencheva, Preslav Nakov, Ivan Koychev
|
We Built a Fake News & Click-bait Filter: What Happened Next Will Blow
Your Mind!
|
RANLP'2017, 7 pages, 1 figure
| null |
10.26615/978-954-452-049-6_045
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is completely amazing! Fake news and click-baits have totally invaded the
cyber space. Let us face it: everybody hates them for three simple reasons.
Reason #2 will absolutely amaze you. What these can achieve at the time of
election will completely blow your mind! Now, we all agree, this cannot go on,
you know, somebody has to stop it. So, we did this research on fake
news/click-bait detection and trust us, it is totally great research, it really
is! Make no mistake. This is the best research ever! Seriously, come have a
look, we have it all: neural networks, attention mechanism, sentiment lexicons,
author profiling, you name it. Lexical features, semantic features, we
absolutely have it all. And we have totally tested it, trust us! We have
results, and numbers, really big numbers. The best numbers ever! Oh, and
analysis, absolutely top notch analysis. Interested? Come read the shocking
truth about fake news and click-bait in the Bulgarian cyber space. You won't
believe what we have found!
|
[
{
"version": "v1",
"created": "Sat, 10 Mar 2018 10:09:13 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Karadzhov",
"Georgi",
""
],
[
"Gencheva",
"Pepa",
""
],
[
"Nakov",
"Preslav",
""
],
[
"Koychev",
"Ivan",
""
]
] |
new_dataset
| 0.983033 |
1803.03887
|
Hai Hu
|
Hai Hu, Yiwen Zhang
|
Path of Vowel Raising in Chengdu Dialect of Mandarin
|
to appear in the Proceedings of 29th North America Conference on
Chinese Linguistics
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
He and Rao (2013) reported a raising phenomenon of /a/ in /Xan/ (X being a
consonant or a vowel) in Chengdu dialect of Mandarin, i.e. /a/ is realized as
[epsilon] for young speakers but [ae] for older speakers, but they offered no
acoustic analysis. We designed an acoustic study that examined the realization
of /Xan/ in speakers of different age (old vs. young) and gender (male vs.
female) groups, where X represents three conditions: 1) unaspirated consonants:
C ([p], [t], [k]), 2) aspirated consonants: Ch ([ph], [th], [kh]), and 3) high
vowels: V ([i], [y], [u]). 17 native speakers were asked to read /Xan/
characters and the F1 values are extracted for comparison. Our results
confirmed the raising effect in He and Rao (2013), i.e., young speakers realize
/a/ as [epsilon] in /an/, whereas older speakers in the most part realize it as
[ae]. Also, female speakers raise more than male speakers within the same age
group. Interestingly, within the /Van/ condition, older speakers do raise /a/
in /ian/ and /yan/. We interpret this as /a/ first assimilates to its preceding
front high vowels /i/ and /y/ for older speakers, which then becomes
phonologized in younger speakers in all conditions, including /Chan/ and /Can/.
This shows a possible trajectory of the ongoing sound change in the Chengdu
dialect.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2018 02:58:40 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Hu",
"Hai",
""
],
[
"Zhang",
"Yiwen",
""
]
] |
new_dataset
| 0.980324 |
1803.03958
|
Hossein Pourakbar
|
Hossein Pourakbar, Ali Ghaffari
|
Reliable and Real-Time End-to-End Delivery Protocol in Wireless Sensor
Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many routing protocols have been proposed to handle reliability and real-time
routing energy efficiency for wireless sensor networks. In this paper we
propose a new routing protocol with QoS based capabilities for WSNs. We used
priority queues for improve real-time and non-real-time packets forwarding
according to deadline of them. The protocol finds a best-cost, time-sensitive
packet forwarding mechanism for real-time data with minimum consumption of the
energy. In order to avoid of congestion in network our protocol drops those
packets who can't reach their destination in specified time. For service
quality assurance in reliability domain we used packet reception rate as an
important parameter (PRR) in selecting of neighbor nodes. Simulation results
show that our new approach how can provide quality of service parameters.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2018 13:06:20 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Pourakbar",
"Hossein",
""
],
[
"Ghaffari",
"Ali",
""
]
] |
new_dataset
| 0.994749 |
1803.04000
|
Soumil Mandal
|
Soumil Mandal, Sainik Kumar Mahata, Dipankar Das
|
Preparing Bengali-English Code-Mixed Corpus for Sentiment Analysis of
Indian Languages
|
The 13th Workshop on Asian Language Resources (ALR), collocated with
LREC 2018
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
Analysis of informative contents and sentiments of social users has been
attempted quite intensively in the recent past. Most of the systems are usable
only for monolingual data and fails or gives poor results when used on data
with code-mixing property. To gather attention and encourage researchers to
work on this crisis, we prepared gold standard Bengali-English code-mixed data
with language and polarity tag for sentiment analysis purposes. In this paper,
we discuss the systems we prepared to collect and filter raw Twitter data. In
order to reduce manual work while annotation, hybrid systems combining rule
based and supervised models were developed for both language and sentiment
tagging. The final corpus was annotated by a group of annotators following a
few guidelines. The gold standard corpus thus obtained has impressive
inter-annotator agreement obtained in terms of Kappa values. Various metrics
like Code-Mixed Index (CMI), Code-Mixed Factor (CF) along with various aspects
(language and emotion) also qualitatively polled the code-mixed and sentiment
properties of the corpus.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2018 18:13:01 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Mandal",
"Soumil",
""
],
[
"Mahata",
"Sainik Kumar",
""
],
[
"Das",
"Dipankar",
""
]
] |
new_dataset
| 0.997398 |
1803.04058
|
Jaber Kakar
|
Jaber Kakar and Alaa Alameer and Anas Chaaban and Aydin Sezgin and
Arogyaswami Paulraj
|
Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time
Cache-Memory Tradeoff
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An emerging trend of next generation communication systems is to provide
network edges with additional capabilities such as storage resources in the
form of caches to reduce file delivery latency. To investigate this aspect, we
study the fundamental limits of a cache-aided broadcast-relay wireless network
consisting of one central base station, $M$ cache-equipped transceivers and $K$
receivers from a latency-centric perspective. We use the normalized delivery
time (NDT) to capture the per-bit latency for the worst-case file request
pattern, normalized with respect to a reference interference-free system with
unlimited transceiver cache capabilities. The objective is to design the
schemes for cache placement and file delivery in order to minimize the NDT. To
this end, we establish a novel converse and two types of achievability schemes
applicable to both time-variant and invariant channels. The first scheme is a
general one-shot scheme for any $M$ and $K$ that synergistically exploits both
multicasting (coded) caching and distributed zero-forcing opportunities. We
show that the proposed one-shot scheme (i) attains gains attributed to both
individual and collective transceiver caches (ii) is NDT-optimal for various
parameter settings, particularly at higher cache sizes. The second scheme, on
the other hand, designs beamformers to facilitate both subspace interference
alignment and zero-forcing at lower cache sizes. Exploiting both schemes, we
are able to characterize for various special cases of $M$ and $K$ which satisfy
$K+M\leq 4$ the optimal tradeoff between cache storage and latency. The
tradeoff illustrates that the NDT is the preferred choice to capture the
latency of a system rather than the commonly used sum degrees-of-freedom (DoF).
In fact, our optimal tradeoff refutes the popular belief that increasing cache
sizes translates to increasing the achievable sum DoF.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2018 22:32:27 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Kakar",
"Jaber",
""
],
[
"Alameer",
"Alaa",
""
],
[
"Chaaban",
"Anas",
""
],
[
"Sezgin",
"Aydin",
""
],
[
"Paulraj",
"Arogyaswami",
""
]
] |
new_dataset
| 0.997801 |
1803.04168
|
Yang Liu
|
Liangdong Lu, Wenping Ma, Ruihu Li, Yuena Ma, Yang Liu, Hao Cao
|
Entanglement-assisted quantum MDS codes from constacyclic codes with
large minimum distance
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The entanglement-assisted (EA) formalism allows arbitrary classical linear
codes to transform into entanglement-assisted quantum error correcting codes
(EAQECCs) by using pre-shared entanglement between the sender and the receiver.
In this work, we propose a decomposition of the defining set of constacyclic
codes. Using this method, we construct four classes of $q$-ary
entanglement-assisted quantum MDS (EAQMDS) codes based on classical
constacyclic MDS codes by exploiting less pre-shared maximally entangled
states. We show that a class of $q$-ary EAQMDS have minimum distance upper
limit greater than $3q-1$. Some of them have much larger minimum distance than
the known quantum MDS (QMDS) codes of the same length. Most of these $q$-ary
EAQMDS codes are new in the sense that their parameters are not covered by the
codes available in the literature.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 10:04:15 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Lu",
"Liangdong",
""
],
[
"Ma",
"Wenping",
""
],
[
"Li",
"Ruihu",
""
],
[
"Ma",
"Yuena",
""
],
[
"Liu",
"Yang",
""
],
[
"Cao",
"Hao",
""
]
] |
new_dataset
| 0.998984 |
1803.04173
|
Davide Maiorca
|
Bojan Kolosnjaji, Ambra Demontis, Battista Biggio, Davide Maiorca,
Giorgio Giacinto, Claudia Eckert and Fabio Roli
|
Adversarial Malware Binaries: Evading Deep Learning for Malware
Detection in Executables
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine-learning methods have already been exploited as useful tools for
detecting malicious executable files. They leverage data retrieved from malware
samples, such as header fields, instruction sequences, or even raw bytes, to
learn models that discriminate between benign and malicious software. However,
it has also been shown that machine learning and deep neural networks can be
fooled by evasion attacks (also referred to as adversarial examples), i.e.,
small changes to the input data that cause misclassification at test time. In
this work, we investigate the vulnerability of malware detection methods that
use deep networks to learn from raw bytes. We propose a gradient-based attack
that is capable of evading a recently-proposed deep network suited to this
purpose by only changing few specific bytes at the end of each malware sample,
while preserving its intrusive functionality. Promising results show that our
adversarial malware binaries evade the targeted network with high probability,
even though less than 1% of their bytes are modified.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 10:27:17 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Kolosnjaji",
"Bojan",
""
],
[
"Demontis",
"Ambra",
""
],
[
"Biggio",
"Battista",
""
],
[
"Maiorca",
"Davide",
""
],
[
"Giacinto",
"Giorgio",
""
],
[
"Eckert",
"Claudia",
""
],
[
"Roli",
"Fabio",
""
]
] |
new_dataset
| 0.997876 |
1803.04292
|
Bertil Chapuis
|
Bertil Chapuis, Benoit Garbinato
|
Geodabs: Trajectory Indexing Meets Fingerprinting at Scale
| null | null | null | null |
cs.DS cs.DB cs.DC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Finding trajectories and discovering motifs that are similar in large
datasets is a central problem for a wide range of applications. Solutions
addressing this problem usually rely on spatial indexing and on the computation
of a similarity measure in polynomial time. Although effective in the context
of sparse trajectory datasets, this approach is too expensive in the context of
dense datasets, where many trajectories potentially match with a given query.
In this paper, we apply fingerprinting, a copy-detection mechanism used in the
context of textual data, to trajectories. To this end, we fingerprint
trajectories with geodabs, a construction based on geohash aimed at trajectory
fingerprinting. We demonstrate that by relying on the properties of a space
filling curve geodabs can be used to build sharded inverted indexes. We show
how normalization affects precision and recall, two key measures in information
retrieval. We then demonstrate that the probabilistic nature of fingerprinting
has a marginal effect on the quality of the results. Finally, we evaluate our
method in terms of performances and show that, in contrast with existing
methods, it is not affected by the density of the trajectory dataset and that
it can be efficiently distributed.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 14:48:06 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Chapuis",
"Bertil",
""
],
[
"Garbinato",
"Benoit",
""
]
] |
new_dataset
| 0.993761 |
1803.04332
|
R\'emi Cura
|
Remi Cura, Julien Perret, Nicolas Paparoditis
|
A state of the art of urban reconstruction: street, street network,
vegetation, urban feature
|
Extracted from PhD (chap1)
| null | null | null |
cs.OH cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
World population is raising, especially the part of people living in cities.
With increased population and complex roles regarding their inhabitants and
their surroundings, cities concentrate difficulties for design, planning and
analysis. These tasks require a way to reconstruct/model a city. Traditionally,
much attention has been given to buildings reconstruction, yet an essential
part of city were neglected: streets. Streets reconstruction has been seldom
researched. Streets are also complex compositions of urban features, and have a
unique role for transportation (as they comprise roads). We aim at completing
the recent state of the art for building reconstruction (Musialski2012) by
considering all other aspect of urban reconstruction. We introduce the need for
city models. Because reconstruction always necessitates data, we first analyse
which data are available. We then expose a state of the art of street
reconstruction, street network reconstruction, urban features
reconstruction/modelling, vegetation , and urban objects
reconstruction/modelling.
Although reconstruction strategies vary widely, we can order them by the role
the model plays, from data driven approach, to model-based approach, to inverse
procedural modelling and model catalogue matching. The main challenges seems to
come from the complex nature of urban environment and from the limitations of
the available data. Urban features have strong relationships, between them, and
to their surrounding, as well as in hierarchical relations. Procedural
modelling has the power to express these relations, and could be applied to the
reconstruction of urban features via the Inverse Procedural Modelling paradigm.
|
[
{
"version": "v1",
"created": "Thu, 18 Jan 2018 02:11:18 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Cura",
"Remi",
""
],
[
"Perret",
"Julien",
""
],
[
"Paparoditis",
"Nicolas",
""
]
] |
new_dataset
| 0.999704 |
1803.04389
|
Vaibhav Kulkarni
|
Vaibhav Kulkarni, Bertil Chapuis, Beno\^it Garbinato and Abhijit
Mahalunkar
|
Addressing the Free-Rider Problem in Public Transport Systems
| null | null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Public transport network constitutes for an indispensable part of a city by
providing mobility services to the general masses. To improve ease of access
and reduce infrastructural investments, public transport authorities often
adopt proof of payment system. Such a system operates by eliminating ticket
controls when boarding the vehicle and subjecting the travelers to random
ticket checks by affiliated personnel (controllers). Although cost efficient,
such a system promotes free-riders, who deliberately decide to evade fares for
the transport service. A recent survey by the association of European
transport, estimates hefty income losses due to fare evasion, highlighting that
free-riding is a serious problem that needs immediate attention. To this end,
we highlight the attack vectors which can be exploited by free-riders by
analyzing the crowdsourced data about the control-locations. Next, we propose a
framework to generate randomized control-location traces by using generative
adversarial networks (GANs) in order to minimize the attack vectors. Finally,
we propose metrics to evaluate such a system, quantified in terms of increased
risk and higher probability of being subjected to control checks across the
city.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 17:31:47 GMT"
}
] | 2018-03-13T00:00:00 |
[
[
"Kulkarni",
"Vaibhav",
""
],
[
"Chapuis",
"Bertil",
""
],
[
"Garbinato",
"Benoît",
""
],
[
"Mahalunkar",
"Abhijit",
""
]
] |
new_dataset
| 0.998104 |
1701.04210
|
Laura Lopez-Fuentes
|
Laura Lopez-Fuentes, Andrew D.Bagdanov, Joost van de Weijer, Harald
Skinnemoen
|
Bandwidth limited object recognition in high resolution imagery
|
9 pages, 9 figures, accepted in WACV
|
Applications of Computer Vision (WACV), 2017 IEEE Winter
Conference on. IEEE, 2017. p. 1197-1205
|
10.1109/WACV.2017.138
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a novel method to optimize bandwidth usage for object
detection in critical communication scenarios. We develop two operating models
of active information seeking. The first model identifies promising regions in
low resolution imagery and progressively requests higher resolution regions on
which to perform recognition of higher semantic quality. The second model
identifies promising regions in low resolution imagery while simultaneously
predicting the approximate location of the object of higher semantic quality.
From this general framework, we develop a car recognition system via
identification of its license plate and evaluate the performance of both models
on a car dataset that we introduce. Results are compared with traditional JPEG
compression and demonstrate that our system saves up to one order of magnitude
of bandwidth while sacrificing little in terms of recognition performance.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 09:16:35 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Lopez-Fuentes",
"Laura",
""
],
[
"Bagdanov",
"Andrew D.",
""
],
[
"van de Weijer",
"Joost",
""
],
[
"Skinnemoen",
"Harald",
""
]
] |
new_dataset
| 0.995971 |
1705.06476
|
Jason Weston
|
Alexander H. Miller, Will Feng, Adam Fisch, Jiasen Lu, Dhruv Batra,
Antoine Bordes, Devi Parikh, Jason Weston
|
ParlAI: A Dialog Research Software Platform
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce ParlAI (pronounced "par-lay"), an open-source software platform
for dialog research implemented in Python, available at http://parl.ai. Its
goal is to provide a unified framework for sharing, training and testing of
dialog models, integration of Amazon Mechanical Turk for data collection, human
evaluation, and online/reinforcement learning; and a repository of machine
learning models for comparing with others' models, and improving upon existing
architectures. Over 20 tasks are supported in the first release, including
popular datasets such as SQuAD, bAbI tasks, MCTest, WikiQA, QACNN, QADailyMail,
CBT, bAbI Dialog, Ubuntu, OpenSubtitles and VQA. Several models are integrated,
including neural models such as memory networks, seq2seq and attentive LSTMs.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 08:54:47 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Jun 2017 18:35:03 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Aug 2017 04:17:48 GMT"
},
{
"version": "v4",
"created": "Thu, 8 Mar 2018 19:58:17 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Miller",
"Alexander H.",
""
],
[
"Feng",
"Will",
""
],
[
"Fisch",
"Adam",
""
],
[
"Lu",
"Jiasen",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Bordes",
"Antoine",
""
],
[
"Parikh",
"Devi",
""
],
[
"Weston",
"Jason",
""
]
] |
new_dataset
| 0.99848 |
1709.05533
|
Fabian Bl\"ochliger
|
Fabian Bl\"ochliger, Marius Fehr, Marcin Dymczyk, Thomas Schneider and
Roland Siegwart
|
Topomap: Topological Mapping and Navigation Based on Visual SLAM Maps
|
8 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual robot navigation within large-scale, semi-structured environments
deals with various challenges such as computation intensive path planning
algorithms or insufficient knowledge about traversable spaces. Moreover, many
state-of-the-art navigation approaches only operate locally instead of gaining
a more conceptual understanding of the planning objective. This limits the
complexity of tasks a robot can accomplish and makes it harder to deal with
uncertainties that are present in the context of real-time robotics
applications. In this work, we present Topomap, a framework which simplifies
the navigation task by providing a map to the robot which is tailored for path
planning use. This novel approach transforms a sparse feature-based map from a
visual Simultaneous Localization And Mapping (SLAM) system into a
three-dimensional topological map. This is done in two steps. First, we extract
occupancy information directly from the noisy sparse point cloud. Then, we
create a set of convex free-space clusters, which are the vertices of the
topological map. We show that this representation improves the efficiency of
global planning, and we provide a complete derivation of our algorithm.
Planning experiments on real world datasets demonstrate that we achieve similar
performance as RRT* with significantly lower computation times and storage
requirements. Finally, we test our algorithm on a mobile robotic platform to
prove its advantages.
|
[
{
"version": "v1",
"created": "Sat, 16 Sep 2017 15:43:46 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Mar 2018 08:57:54 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Blöchliger",
"Fabian",
""
],
[
"Fehr",
"Marius",
""
],
[
"Dymczyk",
"Marcin",
""
],
[
"Schneider",
"Thomas",
""
],
[
"Siegwart",
"Roland",
""
]
] |
new_dataset
| 0.998001 |
1712.06316
|
Yue Luo
|
Yue Luo, Jimmy Ren, Zhouxia Wang, Wenxiu Sun, Jinshan Pan, Jianbo Liu,
Jiahao Pang, Liang Lin
|
LSTM Pose Machines
|
Poster in IEEE Conference on Computer Vision and Pattern Recognition
(CVPR), 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We observed that recent state-of-the-art results on single image human pose
estimation were achieved by multi-stage Convolution Neural Networks (CNN).
Notwithstanding the superior performance on static images, the application of
these models on videos is not only computationally intensive, it also suffers
from performance degeneration and flicking. Such suboptimal results are mainly
attributed to the inability of imposing sequential geometric consistency,
handling severe image quality degradation (e.g. motion blur and occlusion) as
well as the inability of capturing the temporal correlation among video frames.
In this paper, we proposed a novel recurrent network to tackle these problems.
We showed that if we were to impose the weight sharing scheme to the
multi-stage CNN, it could be re-written as a Recurrent Neural Network (RNN).
This property decouples the relationship among multiple network stages and
results in significantly faster speed in invoking the network for videos. It
also enables the adoption of Long Short-Term Memory (LSTM) units between video
frames. We found such memory augmented RNN is very effective in imposing
geometric consistency among frames. It also well handles input quality
degradation in videos while successfully stabilizes the sequential outputs. The
experiments showed that our approach significantly outperformed current
state-of-the-art methods on two large-scale video pose estimation benchmarks.
We also explored the memory cells inside the LSTM and provided insights on why
such mechanism would benefit the prediction for video-based pose estimations.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 09:56:45 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Mar 2018 02:54:09 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Mar 2018 03:39:55 GMT"
},
{
"version": "v4",
"created": "Fri, 9 Mar 2018 07:44:38 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Luo",
"Yue",
""
],
[
"Ren",
"Jimmy",
""
],
[
"Wang",
"Zhouxia",
""
],
[
"Sun",
"Wenxiu",
""
],
[
"Pan",
"Jinshan",
""
],
[
"Liu",
"Jianbo",
""
],
[
"Pang",
"Jiahao",
""
],
[
"Lin",
"Liang",
""
]
] |
new_dataset
| 0.993974 |
1802.05908
|
Matthias Fey
|
Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank
Weichert
|
Recognizing Cuneiform Signs Using Graph Based Methods
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cuneiform script constitutes one of the earliest systems of writing and
is realized by wedge-shaped marks on clay tablets. A tremendous number of
cuneiform tablets have already been discovered and are incrementally
digitalized and made available to automated processing. As reading cuneiform
script is still a manual task, we address the real-world application of
recognizing cuneiform signs by two graph based methods with complementary
runtime characteristics. We present a graph model for cuneiform signs together
with a tailored distance measure based on the concept of the graph edit
distance. We propose efficient heuristics for its computation and demonstrate
its effectiveness in classification tasks experimentally. To this end, the
distance measure is used to implement a nearest neighbor classifier leading to
a high computational cost for the prediction phase with increasing training set
size. In order to overcome this issue, we propose to use CNNs adapted to graphs
as an alternative approach shifting the computational cost to the training
phase. We demonstrate the practicability of both approaches in an extensive
experimental comparison regarding runtime and prediction accuracy. Although
currently available annotated real-world data is still limited, we obtain a
high accuracy using CNNs, in particular, when the training set is enriched by
augmented examples.
|
[
{
"version": "v1",
"created": "Fri, 16 Feb 2018 12:28:28 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Mar 2018 07:52:49 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Kriege",
"Nils M.",
""
],
[
"Fey",
"Matthias",
""
],
[
"Fisseler",
"Denis",
""
],
[
"Mutzel",
"Petra",
""
],
[
"Weichert",
"Frank",
""
]
] |
new_dataset
| 0.999611 |
1803.03302
|
Jyh-Ming Lien
|
Zhonghua Xi, Yu-Ki Lee, Young-Joo Lee, Yun-hyeong Kim, Huangxin Wang,
Yue Hao, Young-Chang Joo, In-Suk Choi, Jyh-Ming Lien
|
Super Compaction and Pluripotent Shape Transformation via Algorithmic
Stacking for 3D Deployable Structures
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Origami structures enabled by folding and unfolding can create complex 3D
shapes. However, even a small 3D shape can have large 2D unfoldings. The huge
initial dimension of the 2D flattened structure makes fabrication difficult,
and defeats the main purpose, namely compactness, of many origami-inspired
engineering. In this work, we propose a novel algorithmic kirigami method that
provides super compaction of an arbitrary 3D shape with non-negligible surface
thickness called "algorithmic stacking". Our approach computationally finds a
way of cutting the thick surface of the shape into a strip. This strip forms a
Hamiltonian cycle that covers the entire surface and can realize transformation
between two target shapes: from a super compact stacked shape to the input 3D
shape. Depending on the surface thickness, the stacked structure takes merely
0.001% to 6% of the original volume. This super compacted structure not only
can be manufactured in a workspace that is significantly smaller than the
provided 3D shape, but also makes packing and transportation easier for a
deployable application. We further demonstrate that, the proposed stackable
structure also provides high pluripotency and can transform into multiple 3D
target shapes if these 3D shapes can be dissected in specific ways and form a
common stacked structure. In contrast to many designs of origami structure that
usually target at a particular shape, our results provide a universal platform
for pluripotent 3D transformable structures.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 20:54:21 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Xi",
"Zhonghua",
""
],
[
"Lee",
"Yu-Ki",
""
],
[
"Lee",
"Young-Joo",
""
],
[
"Kim",
"Yun-hyeong",
""
],
[
"Wang",
"Huangxin",
""
],
[
"Hao",
"Yue",
""
],
[
"Joo",
"Young-Chang",
""
],
[
"Choi",
"In-Suk",
""
],
[
"Lien",
"Jyh-Ming",
""
]
] |
new_dataset
| 0.998832 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.