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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1709.04553
|
Yingfei Wang
|
Yingfei Wang, Warren Powell
|
MOLTE: a Modular Optimal Learning Testing Environment
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the relative paucity of empirical testing of learning algorithms
(of any type) by introducing a new public-domain, Modular, Optimal Learning
Testing Environment (MOLTE) for Bayesian ranking and selection problem,
stochastic bandits or sequential experimental design problems. The Matlab-based
simulator allows the comparison of a number of learning policies (represented
as a series of .m modules) in the context of a wide range of problems (each
represented in its own .m module) which makes it easy to add new algorithms and
new test problems. State-of-the-art policies and various problem classes are
provided in the package. The choice of problems and policies is guided through
a spreadsheet-based interface. Different graphical metrics are included. MOLTE
is designed to be compatible with parallel computing to scale up from local
desktop to clusters and clouds. We offer MOLTE as an easy-to-use tool for the
research community that will make it possible to perform much more
comprehensive testing, spanning a broader selection of algorithms and test
problems. We demonstrate the capabilities of MOLTE through a series of
comparisons of policies on a starter library of test problems. We also address
the problem of tuning and constructing priors that have been largely overlooked
in optimal learning literature. We envision MOLTE as a modest spur to provide
researchers an easy environment to study interesting questions involved in
optimal learning.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 22:05:01 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Wang",
"Yingfei",
""
],
[
"Powell",
"Warren",
""
]
] |
new_dataset
| 0.990626 |
1709.04569
|
Abhinav Aggarwal
|
Abhinav Aggarwal, Mahdi Zamani, Mihai Christodorescu
|
REMOTEGATE: Incentive-Compatible Remote Configuration of Security
Gateways
|
Working manuscript
| null | null | null |
cs.CR cs.DC cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Imagine that a malicious hacker is trying to attack a server over the
Internet and the server wants to block the attack packets as close to their
point of origin as possible. However, the security gateway ahead of the source
of attack is untrusted. How can the server block the attack packets through
this gateway? In this paper, we introduce REMOTEGATE, a trustworthy mechanism
for allowing any party (server) on the Internet to configure a security gateway
owned by a second party, at a certain agreed upon reward that the former pays
to the latter for its service. We take an interactive incentive-compatible
approach, for the case when both the server and the gateway are rational, to
devise a protocol that will allow the server to help the security gateway
generate and deploy a policy rule that filters the attack packets before they
reach the server. The server will reward the gateway only when the latter can
successfully verify that it has generated and deployed the correct rule for the
issue. This mechanism will enable an Internet-scale approach to improving
security and privacy, backed by digital payment incentives.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 00:12:15 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Aggarwal",
"Abhinav",
""
],
[
"Zamani",
"Mahdi",
""
],
[
"Christodorescu",
"Mihai",
""
]
] |
new_dataset
| 0.989346 |
1709.04582
|
Minjia Shi
|
Minjia Shi, Zhongyi Zhang, Patrick Sole
|
Pisano period codes
|
10 pages, submitted on 9th, September
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cyclic codes with parity check polynomial the reciprocal of the
characteristic polynomial of the Fibonacci recurrence over a prime finite field
are shown to have either one weight or two weights. When these codes are
irreducible cyclic we obtain many counterexamples to the conjectural
classification of two-weight irreducible cyclic codes of Schmidt and White
(2002). When they are reducible and projective their duals are uniformly
packed.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 01:49:41 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Zhang",
"Zhongyi",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.999459 |
1709.04711
|
Salvatore Pontarelli
|
Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
|
EMOMA: Exact Match in One Memory Access
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important function in modern routers and switches is to perform a lookup
for a key. Hash-based methods, and in particular cuckoo hash tables, are
popular for such lookup operations, but for large structures stored in off-chip
memory, such methods have the downside that they may require more than one
off-chip memory access to perform the key lookup. Although the number of
off-chip memory accesses can be reduced using on-chip approximate membership
structures such as Bloom filters, some lookups may still require more than one
off-chip memory access. This can be problematic for some hardware
implementations, as having only a single off-chip memory access enables a
predictable processing of lookups and avoids the need to queue pending
requests.
We provide a data structure for hash-based lookups based on cuckoo hashing
that uses only one off-chip memory access per lookup, by utilizing an on-chip
pre-filter to determine which of multiple locations holds a key. We make
particular use of the flexibility to move elements within a cuckoo hash table
to ensure the pre-filter always gives the correct response. While this requires
a slightly more complex insertion procedure and some additional memory accesses
during insertions, it is suitable for most packet processing applications where
key lookups are much more frequent than insertions. An important feature of our
approach is its simplicity. Our approach is based on simple logic that can be
easily implemented in hardware, and hardware implementations would benefit most
from the single off-chip memory access per lookup.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 11:32:52 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Pontarelli",
"Salvatore",
""
],
[
"Reviriego",
"Pedro",
""
],
[
"Mitzenmacher",
"Michael",
""
]
] |
new_dataset
| 0.998304 |
1709.04820
|
Damien Sileo
|
Damien Sileo, Camille Pradel, Philippe Muller, Tim Van de Cruys
|
Synapse at CAp 2017 NER challenge: Fasttext CRF
| null |
CAP2017
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present our system for the CAp 2017 NER challenge which is about named
entity recognition on French tweets. Our system leverages unsupervised learning
on a larger dataset of French tweets to learn features feeding a CRF model. It
was ranked first without using any gazetteer or structured external data, with
an F-measure of 58.89\%. To the best of our knowledge, it is the first system
to use fasttext embeddings (which include subword representations) and an
embedding-based sentence representation for NER.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 14:44:30 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Sileo",
"Damien",
""
],
[
"Pradel",
"Camille",
""
],
[
"Muller",
"Philippe",
""
],
[
"Van de Cruys",
"Tim",
""
]
] |
new_dataset
| 0.995439 |
1709.04881
|
Thomas K\"ohler
|
Thomas K\"ohler, Michel B\"atz, Farzad Naderi, Andr\'e Kaup, Andreas
K. Maier, Christian Riess
|
Benchmarking Super-Resolution Algorithms on Real Data
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past decades, various super-resolution (SR) techniques have been
developed to enhance the spatial resolution of digital images. Despite the
great number of methodical contributions, there is still a lack of comparative
validations of SR under practical conditions, as capturing real ground truth
data is a challenging task. Therefore, current studies are either evaluated 1)
on simulated data or 2) on real data without a pixel-wise ground truth.
To facilitate comprehensive studies, this paper introduces the publicly
available Super-Resolution Erlangen (SupER) database that includes real
low-resolution images along with high-resolution ground truth data. Our
database comprises image sequences with more than 20k images captured from 14
scenes under various types of motions and photometric conditions. The datasets
cover four spatial resolution levels using camera hardware binning. With this
database, we benchmark 15 single-image and multi-frame SR algorithms. Our
experiments quantitatively analyze SR accuracy and robustness under realistic
conditions including independent object and camera motion or photometric
variations.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 21:44:29 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Köhler",
"Thomas",
""
],
[
"Bätz",
"Michel",
""
],
[
"Naderi",
"Farzad",
""
],
[
"Kaup",
"André",
""
],
[
"Maier",
"Andreas K.",
""
],
[
"Riess",
"Christian",
""
]
] |
new_dataset
| 0.998304 |
1709.03596
|
Masud Mansuripur
|
Masud Mansuripur and Pramod Khulbe
|
Macro-molecular data storage with petabyte/cm^3 density, highly parallel
read/write operations, and genuine 3D storage capability
|
11 pages, 10 figures, 13 references. arXiv admin note: substantial
text overlap with arXiv: 1709.03568
|
Published in Optical Data Storage 2004, edited by B.V.K. Vijaya
Kumar and Hiromichi Kobori; Proceedings of SPIE 5380, pp272-282 (2004)
|
10.1117/12.562434
| null |
cs.ET physics.app-ph physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital information can be encoded in the building-block sequence of
macro-molecules, such as RNA and single-stranded DNA. Methods of "writing" and
"reading" macromolecular strands are currently available, but they are slow and
expensive. In an ideal molecular data storage system, routine operations such
as write, read, erase, store, and transfer must be done reliably and at high
speed within an integrated chip. As a first step toward demonstrating the
feasibility of this concept, we report preliminary results of DNA readout
experiments conducted in miniaturized chambers that are scalable to even
smaller dimensions. We show that translocation of a single-stranded DNA
molecule (consisting of 50 adenosine bases followed by 100 cytosine bases)
through an ion-channel yields a characteristic signal that is attributable to
the 2-segment structure of the molecule. We also examine the dependence of the
rate and speed of molecular translocation on the adjustable parameters of the
experiment.
|
[
{
"version": "v1",
"created": "Sat, 26 Aug 2017 22:28:05 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Mansuripur",
"Masud",
""
],
[
"Khulbe",
"Pramod",
""
]
] |
new_dataset
| 0.998269 |
1709.04121
|
Yajing Chen
|
Yajing Chen, Shikui Tu, Yuqi Yi and Lei Xu
|
Sketch-pix2seq: a Model to Generate Sketches of Multiple Categories
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sketch is an important media for human to communicate ideas, which reflects
the superiority of human intelligence. Studies on sketch can be roughly
summarized into recognition and generation. Existing models on image
recognition failed to obtain satisfying performance on sketch classification.
But for sketch generation, a recent study proposed a sequence-to-sequence
variational-auto-encoder (VAE) model called sketch-rnn which was able to
generate sketches based on human inputs. The model achieved amazing results
when asked to learn one category of object, such as an animal or a vehicle.
However, the performance dropped when multiple categories were fed into the
model. Here, we proposed a model called sketch-pix2seq which could learn and
draw multiple categories of sketches. Two modifications were made to improve
the sketch-rnn model: one is to replace the bidirectional recurrent neural
network (BRNN) encoder with a convolutional neural network(CNN); the other is
to remove the Kullback-Leibler divergence from the objective function of VAE.
Experimental results showed that models with CNN encoders outperformed those
with RNN encoders in generating human-style sketches. Visualization of the
latent space illustrated that the removal of KL-divergence made the encoder
learn a posterior of latent space that reflected the features of different
categories. Moreover, the combination of CNN encoder and removal of
KL-divergence, i.e., the sketch-pix2seq model, had better performance in
learning and generating sketches of multiple categories and showed promising
results in creativity tasks.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 03:22:27 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Chen",
"Yajing",
""
],
[
"Tu",
"Shikui",
""
],
[
"Yi",
"Yuqi",
""
],
[
"Xu",
"Lei",
""
]
] |
new_dataset
| 0.996582 |
1709.04184
|
Themistoklis Prodromakis
|
Alexantrou Serb, Ali Khiat, Themis Prodromakis
|
Charge-based computing with analogue reconfigurable gates
|
22 pages, 15 figures
| null | null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the world enters the age of ubiquitous computing, the need for
reconfigurable hardware operating close to the fundamental limits of energy
consumption becomes increasingly pressing. Simultaneously, scaling-driven
performance improvements within the framework of traditional analogue and
digital design become progressively more restricted by fundamental physical
constraints. Thus, a true paradigm shift in electronics design is required for
fuelling the next big burst in technology. Here we lay the foundations of a new
design paradigm that fuses analogue and digital thinking by combining digital
electronics with memristive devices for achieving charge-based computation;
information processing where every dissipated charge counts. This is realised
by introducing memristive devices into standard logic gates, thus rendering
them reconfigurable and able to perform analogue computation at a power cost
close to digital. The power of this concept is then showcased by experimentally
demonstrating a hardware data clusterer and a fuzzy NAND gate using this
principle.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 08:36:39 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Serb",
"Alexantrou",
""
],
[
"Khiat",
"Ali",
""
],
[
"Prodromakis",
"Themis",
""
]
] |
new_dataset
| 0.996746 |
1709.04291
|
Mary Katherine Heinrich
|
Heiko Hamann, Mohammad Divband Soorati, Mary Katherine Heinrich,
Daniel Nicolas Hofstadler, Igor Kuksin, Frank Veenstra, Mostafa Wahby, Stig
Anton Nielsen, Sebastian Risi, Tomasz Skrzypczak, Payam Zahadat, Przemyslaw
Wojtaszek, Kasper St{\o}y, Thomas Schmickl, Serge Kernbach, Phil Ayres
|
Flora robotica -- An Architectural System Combining Living Natural
Plants and Distributed Robots
|
16 pages, 12 figures
| null | null | null |
cs.ET cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Key to our project flora robotica is the idea of creating a bio-hybrid system
of tightly coupled natural plants and distributed robots to grow architectural
artifacts and spaces. Our motivation with this ground research project is to
lay a principled foundation towards the design and implementation of living
architectural systems that provide functionalities beyond those of orthodox
building practice, such as self-repair, material accumulation and
self-organization. Plants and robots work together to create a living organism
that is inhabited by human beings. User-defined design objectives help to steer
the directional growth of the plants, but also the system's interactions with
its inhabitants determine locations where growth is prohibited or desired
(e.g., partitions, windows, occupiable space). We report our plant species
selection process and aspects of living architecture. A leitmotif of our
project is the rich concept of braiding: braids are produced by robots from
continuous material and serve as both scaffolds and initial architectural
artifacts before plants take over and grow the desired architecture. We use
light and hormones as attraction stimuli and far-red light as repelling
stimulus to influence the plants. Applied sensors range from simple proximity
sensing to detect the presence of plants to sophisticated sensing technology,
such as electrophysiology and measurements of sap flow. We conclude by
discussing our anticipated final demonstrator that integrates key features of
flora robotica, such as the continuous growth process of architectural
artifacts and self-repair of living architecture.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 12:40:15 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Hamann",
"Heiko",
""
],
[
"Soorati",
"Mohammad Divband",
""
],
[
"Heinrich",
"Mary Katherine",
""
],
[
"Hofstadler",
"Daniel Nicolas",
""
],
[
"Kuksin",
"Igor",
""
],
[
"Veenstra",
"Frank",
""
],
[
"Wahby",
"Mostafa",
""
],
[
"Nielsen",
"Stig Anton",
""
],
[
"Risi",
"Sebastian",
""
],
[
"Skrzypczak",
"Tomasz",
""
],
[
"Zahadat",
"Payam",
""
],
[
"Wojtaszek",
"Przemyslaw",
""
],
[
"Støy",
"Kasper",
""
],
[
"Schmickl",
"Thomas",
""
],
[
"Kernbach",
"Serge",
""
],
[
"Ayres",
"Phil",
""
]
] |
new_dataset
| 0.993853 |
1709.04322
|
Ankit Mondal
|
Ankit Mondal and Ankur Srivastava
|
Power Optimizations in MTJ-based Neural Networks through Stochastic
Computing
|
Accepted in the 2017 IEEE/ACM International Conference on Low Power
Electronics and Design
| null | null | null |
cs.NE cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Artificial Neural Networks (ANNs) have found widespread applications in tasks
such as pattern recognition and image classification. However, hardware
implementations of ANNs using conventional binary arithmetic units are
computationally expensive, energy-intensive and have large area overheads.
Stochastic Computing (SC) is an emerging paradigm which replaces these
conventional units with simple logic circuits and is particularly suitable for
fault-tolerant applications. Spintronic devices, such as Magnetic Tunnel
Junctions (MTJs), are capable of replacing CMOS in memory and logic circuits.
In this work, we propose an energy-efficient use of MTJs, which exhibit
probabilistic switching behavior, as Stochastic Number Generators (SNGs), which
forms the basis of our NN implementation in the SC domain. Further, error
resilient target applications of NNs allow us to introduce Approximate
Computing, a framework wherein accuracy of computations is traded-off for
substantial reductions in power consumption. We propose approximating the
synaptic weights in our MTJ-based NN implementation, in ways brought about by
properties of our MTJ-SNG, to achieve energy-efficiency. We design an algorithm
that can perform such approximations within a given error tolerance in a
single-layer NN in an optimal way owing to the convexity of the problem
formulation. We then use this algorithm and develop a heuristic approach for
approximating multi-layer NNs. To give a perspective of the effectiveness of
our approach, a 43% reduction in power consumption was obtained with less than
1% accuracy loss on a standard classification problem, with 26% being brought
about by the proposed algorithm.
|
[
{
"version": "v1",
"created": "Thu, 17 Aug 2017 19:56:23 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Mondal",
"Ankit",
""
],
[
"Srivastava",
"Ankur",
""
]
] |
new_dataset
| 0.974736 |
1709.04329
|
Longhui Wei
|
Longhui Wei, Shiliang Zhang, Hantao Yao, Wen Gao, Qi Tian
|
GLAD: Global-Local-Alignment Descriptor for Pedestrian Retrieval
|
Accepted by ACM MM2017, 9 pages, 5 figures
| null |
10.1145/3123266.3123279
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The huge variance of human pose and the misalignment of detected human images
significantly increase the difficulty of person Re-Identification (Re-ID).
Moreover, efficient Re-ID systems are required to cope with the massive visual
data being produced by video surveillance systems. Targeting to solve these
problems, this work proposes a Global-Local-Alignment Descriptor (GLAD) and an
efficient indexing and retrieval framework, respectively. GLAD explicitly
leverages the local and global cues in human body to generate a discriminative
and robust representation. It consists of part extraction and descriptor
learning modules, where several part regions are first detected and then deep
neural networks are designed for representation learning on both the local and
global regions. A hierarchical indexing and retrieval framework is designed to
eliminate the huge redundancy in the gallery set, and accelerate the online
Re-ID procedure. Extensive experimental results show GLAD achieves competitive
accuracy compared to the state-of-the-art methods. Our retrieval framework
significantly accelerates the online Re-ID procedure without loss of accuracy.
Therefore, this work has potential to work better on person Re-ID tasks in real
scenarios.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 13:44:46 GMT"
}
] | 2017-09-14T00:00:00 |
[
[
"Wei",
"Longhui",
""
],
[
"Zhang",
"Shiliang",
""
],
[
"Yao",
"Hantao",
""
],
[
"Gao",
"Wen",
""
],
[
"Tian",
"Qi",
""
]
] |
new_dataset
| 0.969936 |
1701.08025
|
Magnus Andersson
|
Hanqing Zhang, Tim Stangner, Krister Wiklund, Alvaro Rodriguez, Magnus
Andersson
|
UmUTracker: A versatile MATLAB program for automated particle tracking
of 2D light microscopy or 3D digital holography data
|
Manuscript including supplementary materials
| null |
10.1016/j.cpc.2017.05.029
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a versatile and fast MATLAB program (UmUTracker) that
automatically detects and tracks particles by analyzing video sequences
acquired by either light microscopy or digital in-line holographic microscopy.
Our program detects the 2D lateral positions of particles with an algorithm
based on the isosceles triangle transform, and reconstructs their 3D axial
positions by a fast implementation of the Rayleigh-Sommerfeld model using a
radial intensity profile. To validate the accuracy and performance of our
program, we first track the 2D position of polystyrene particles using bright
field and digital holographic microscopy. Second, we determine the 3D particle
position by analyzing synthetic and experimentally acquired holograms. Finally,
to highlight the full program features, we profile the microfluidic flow in a
100 micrometer high flow chamber. This result agrees with computational fluid
dynamic simulations. On a regular desktop computer UmUTracker can detect,
analyze, and track multiple particles at 5 frames per second for a template
size of 201 x 201 in a 1024 x 1024 image. To enhance usability and to make it
easy to implement new functions we used object-oriented programming. UmUTracker
is suitable for studies related to: particle dynamics, cell localization,
colloids and microfluidic flow measurement.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 12:20:45 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Apr 2017 08:53:23 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Zhang",
"Hanqing",
""
],
[
"Stangner",
"Tim",
""
],
[
"Wiklund",
"Krister",
""
],
[
"Rodriguez",
"Alvaro",
""
],
[
"Andersson",
"Magnus",
""
]
] |
new_dataset
| 0.998085 |
1703.05401
|
Mohammad Mozaffari
|
Mohammad Mozaffari, Walid Saad, Mehdi Bennis, and Merouane Debbah
|
Mobile Unmanned Aerial Vehicles (UAVs) for Energy-Efficient Internet of
Things Communications
|
Accepted in IEEE Transactions on Wireless Communications, Sept. 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the efficient deployment and mobility of multiple unmanned
aerial vehicles (UAVs), used as aerial base stations to collect data from
ground Internet of Things (IoT) devices, is investigated. In particular, to
enable reliable uplink communications for IoT devices with a minimum total
transmit power, a novel framework is proposed for jointly optimizing the
three-dimensional (3D) placement and mobility of the UAVs, device-UAV
association, and uplink power control. First, given the locations of active IoT
devices at each time instant, the optimal UAVs' locations and associations are
determined. Next, to dynamically serve the IoT devices in a time-varying
network, the optimal mobility patterns of the UAVs are analyzed. To this end,
based on the activation process of the IoT devices, the time instances at which
the UAVs must update their locations are derived. Moreover, the optimal 3D
trajectory of each UAV is obtained in a way that the total energy used for the
mobility of the UAVs is minimized while serving the IoT devices. Simulation
results show that, using the proposed approach, the total transmit power of the
IoT devices is reduced by 45% compared to a case in which stationary aerial
base stations are deployed. In addition, the proposed approach can yield a
maximum of 28% enhanced system reliability compared to the stationary case. The
results also reveal an inherent tradeoff between the number of update times,
the mobility of the UAVs, and the transmit power of the IoT devices. In
essence, a higher number of updates can lead to lower transmit powers for the
IoT devices at the cost of an increased mobility for the UAVs.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 21:59:45 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Sep 2017 16:45:13 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Mozaffari",
"Mohammad",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Debbah",
"Merouane",
""
]
] |
new_dataset
| 0.984832 |
1707.04687
|
Abhronil Sengupta
|
Yong Shim, Shuhan Chen, Abhronil Sengupta, Kaushik Roy
|
Stochastic Spin-Orbit Torque Devices as Elements for Bayesian Inference
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Probabilistic inference from real-time input data is becoming increasingly
popular and may be one of the potential pathways at enabling cognitive
intelligence. As a matter of fact, preliminary research has revealed that
stochastic functionalities also underlie the spiking behavior of neurons in
cortical microcircuits of the human brain. In tune with such observations,
neuromorphic and other unconventional computing platforms have recently started
adopting the usage of computational units that generate outputs
probabilistically, depending on the magnitude of the input stimulus. In this
work, we experimentally demonstrate a spintronic device that offers a direct
mapping to the functionality of such a controllable stochastic switching
element. We show that the probabilistic switching of Ta/CoFeB/MgO
heterostructures in presence of spin-orbit torque and thermal noise can be
harnessed to enable probabilistic inference in a plethora of unconventional
computing scenarios. This work can potentially pave the way for hardware that
directly mimics the computational units of Bayesian inference.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 05:06:43 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Sep 2017 22:15:53 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Shim",
"Yong",
""
],
[
"Chen",
"Shuhan",
""
],
[
"Sengupta",
"Abhronil",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.975442 |
1709.02901
|
Muhammad Ikram
|
Muhammad Ikram and Mohamed Ali Kaafar
|
A First Look at Ad Blocking Apps on Google Play
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online advertisers and analytics services (or trackers), are constantly
tracking users activities as they access web services either through browsers
or a mobile apps. Numerous tools such as browser plugins and specialized mobile
apps have been proposed to limit intrusive advertisements and prevent tracking
on desktop computing and mobile phones. For desktop computing, browser plugins
are heavily studied for their usability and efficiency issues, however, tools
that block ads and prevent trackers in mobile platforms, have received the
least or no attention.
In this paper, we present a first look at 97 Android adblocking apps (or
adblockers), extracted from more than 1.5 million apps from Google Play, that
promise to block advertisements and analytics services. With our data
collection and analysis pipeline of the Android adblockers, we reveal the
presences of third-party tracking libraries and sensitive permissions for
critical resources on user mobile devices as well as have malware in the source
codes. We analyze users' reviews for the in-effectiveness of adblockers in
terms of not blocking ads and trackers. We found that a significant fraction of
adblockers are not fulfilling their advertised functionality.
|
[
{
"version": "v1",
"created": "Sat, 9 Sep 2017 03:54:18 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Sep 2017 05:06:16 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Ikram",
"Muhammad",
""
],
[
"Kaafar",
"Mohamed Ali",
""
]
] |
new_dataset
| 0.995457 |
1709.03496
|
{\L}ukasz Kidzi\'nski
|
{\L}ukasz Kidzi\'nski
|
SweetRS: Dataset for a recommender systems of sweets
|
2 pages, 1 figure
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Benchmarking recommender system and matrix completion algorithms could be
greatly simplified if the entire matrix was known. We built a \url{sweetrs.org}
platform with $77$ candies and sweets to rank. Over $2000$ users submitted over
$44000$ grades resulting in a matrix with $28\%$ coverage. In this report, we
give the full description of the environment and we benchmark the
\textsc{Soft-Impute} algorithm on the dataset.
|
[
{
"version": "v1",
"created": "Sun, 10 Sep 2017 23:19:41 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Kidziński",
"Łukasz",
""
]
] |
new_dataset
| 0.999795 |
1709.03562
|
Andrea Li
|
Andrea S. Li, Alistair E. W. Johnson, Roger G. Mark
|
False arrhythmia alarm reduction in the intensive care unit
|
10 pages, 5 tables, 5 figures
| null |
10.5281/zenodo.889036
| null |
cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
Research has shown that false alarms constitute more than 80% of the alarms
triggered in the intensive care unit (ICU). The high false arrhythmia alarm
rate has severe implications such as disruption of patient care, caregiver
alarm fatigue, and desensitization from clinical staff to real life-threatening
alarms. A method to reduce the false alarm rate would therefore greatly benefit
patients as well as nurses in their ability to provide care. We here develop
and describe a robust false arrhythmia alarm reduction system for use in the
ICU. Building off of work previously described in the literature, we make use
of signal processing and machine learning techniques to identify true and false
alarms for five arrhythmia types. This baseline algorithm alone is able to
perform remarkably well, with a sensitivity of 0.908, a specificity of 0.838,
and a PhysioNet/CinC challenge score of 0.756. We additionally explore dynamic
time warping techniques on both the entire alarm signal as well as on a
beat-by-beat basis in an effort to improve performance of ventricular
tachycardia, which has in the literature been one of the hardest arrhythmias to
classify. Such an algorithm with strong performance and efficiency could
potentially be translated for use in the ICU to promote overall patient care
and recovery.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 19:57:12 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Li",
"Andrea S.",
""
],
[
"Johnson",
"Alistair E. W.",
""
],
[
"Mark",
"Roger G.",
""
]
] |
new_dataset
| 0.994375 |
1709.03642
|
Huu-Hiep Nguyen
|
Hiep H. Nguyen
|
MeshCloak: A Map-Based Approach for Personalized Location Privacy
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Protecting location privacy in mobile services has recently received
significant consideration as Location-Based Service (LBS) can reveal user
locations to attackers. A problem in the existing cloaking schemes is that
location vulnerabilities may be exposed when an attacker exploits a street map
in their attacks. While both real and synthetic trajectories are based on real
street maps, most of previous cloaking schemes assume free space movements to
define the distance between users, resulting in the mismatch between privacy
models and user movements. In this paper, we present MeshCloak, a novel
map-based model for personalized location privacy, which is formulated entirely
in map-based setting and resists inference attacks at a minimal performance
overhead. The key idea of MeshCloak is to quickly build a sparse constraint
graph based on the mutual coverage relationship between queries by
pre-computing the distance matrix and applying quadtree search. MeshCloak also
takes into account real speed profiles and query frequencies. We evaluate the
efficiency and effectiveness of the proposed scheme via a suite of carefully
designed experiments on five real maps.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 01:18:53 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Nguyen",
"Hiep H.",
""
]
] |
new_dataset
| 0.99706 |
1709.03643
|
Makar Plakhotnyk Volodymyrovych
|
Makar Plakhotnyk
|
A HelloWord \textsc{Bib}\negthinspace\TeX~stile file .\textbf{bst}
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A HelloWord \textsc{Bib}\negthinspace\TeX~stile file .\textbf{bst} is
described
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 01:32:46 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Plakhotnyk",
"Makar",
""
]
] |
new_dataset
| 0.999613 |
1709.03723
|
Navroz Charania
|
Navroz Firoz Charania, Mukesh Kumar Giluka, Bheemarjuna Reddy Tamma
and Antony Franklin
|
DEARF: Delay and Energy Aware RAW Formation Scheme to Support Delay
Sensitive M2M Traffic in IEEE 802.11ah Networks
|
Accepted in IEEE ANTS 2016
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IEEE 802.11ah amendment is designed to support upto 8K M2M devices over
the Sub-GHz channel. To achieve this, it introduces new modifications to the
PHY and MAC layers. A dynamic Restricted Access Window~(RAW) mechanism is
introduced at the MAC layer. RAW splits the access for different devices into
small chunks of time. Using the RAW mechanism, we propose a novel Delay and
Energy Aware RAW Formation (DEARF) scheme to support delay sensitive devices
along with other delay tolerant devices. We exploit this to introduce four new
RAWs. These new RAWs help split the access into contention free for delay
sensitive devices and contention based for other devices. For scheduling
resources between these devices, we give the DEARF resource allocation and
evaluate the scheme with help of simulations. Devices suffer a higher delay
but, at high loads, devices using the proposed scheme are able to save 30%
energy per packet and upto 330% energy per device. Packet delivery ratio is
100% at low loads and 90% at high loads as compared to 95% and 27% given by the
traditional access. Other delay tolerant devices save upto 16% on energy per
packet transmitted and 23% on delay at high loads.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 08:02:19 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Charania",
"Navroz Firoz",
""
],
[
"Giluka",
"Mukesh Kumar",
""
],
[
"Tamma",
"Bheemarjuna Reddy",
""
],
[
"Franklin",
"Antony",
""
]
] |
new_dataset
| 0.997384 |
1709.03739
|
Tadashi Matsuo
|
Tadashi Matsuo, Nobutaka Shimada
|
Construction of Latent Descriptor Space and Inference Model of
Hand-Object Interactions
| null |
IEICE Trans. on Info. and Sys., Vol.E100-D, No.6, pp.1350-1359,
2017
|
10.1587/transinf.2016EDP7410
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Appearance-based generic object recognition is a challenging problem because
all possible appearances of objects cannot be registered, especially as new
objects are produced every day. Function of objects, however, has a
comparatively small number of prototypes. Therefore, function-based
classification of new objects could be a valuable tool for generic object
recognition. Object functions are closely related to hand-object interactions
during handling of a functional object; i.e., how the hand approaches the
object, which parts of the object and contact the hand, and the shape of the
hand during interaction. Hand-object interactions are helpful for modeling
object functions. However, it is difficult to assign discrete labels to
interactions because an object shape and grasping hand-postures intrinsically
have continuous variations. To describe these interactions, we propose the
interaction descriptor space which is acquired from unlabeled appearances of
human hand-object interactions. By using interaction descriptors, we can
numerically describe the relation between an object's appearance and its
possible interaction with the hand. The model infers the quantitative state of
the interaction from the object image alone. It also identifies the parts of
objects designed for hand interactions such as grips and handles. We
demonstrate that the proposed method can unsupervisedly generate interaction
descriptors that make clusters corresponding to interaction types. And also we
demonstrate that the model can infer possible hand-object interactions.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 08:34:23 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Matsuo",
"Tadashi",
""
],
[
"Shimada",
"Nobutaka",
""
]
] |
new_dataset
| 0.982708 |
1709.03814
|
Josep Crego
|
Yongchao Deng, Jungi Kim, Guillaume Klein, Catherine Kobus, Natalia
Segal, Christophe Servan, Bo Wang, Dakun Zhang, Josep Crego, Jean Senellart
|
SYSTRAN Purely Neural MT Engines for WMT2017
|
Published in WMT 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes SYSTRAN's systems submitted to the WMT 2017 shared news
translation task for English-German, in both translation directions. Our
systems are built using OpenNMT, an open-source neural machine translation
system, implementing sequence-to-sequence models with LSTM encoder/decoders and
attention. We experimented using monolingual data automatically
back-translated. Our resulting models are further hyper-specialised with an
adaptation technique that finely tunes models according to the evaluation test
sentences.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 12:47:05 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Deng",
"Yongchao",
""
],
[
"Kim",
"Jungi",
""
],
[
"Klein",
"Guillaume",
""
],
[
"Kobus",
"Catherine",
""
],
[
"Segal",
"Natalia",
""
],
[
"Servan",
"Christophe",
""
],
[
"Wang",
"Bo",
""
],
[
"Zhang",
"Dakun",
""
],
[
"Crego",
"Josep",
""
],
[
"Senellart",
"Jean",
""
]
] |
new_dataset
| 0.993399 |
1709.03843
|
Le Zheng
|
Yingming Tsai, Le Zheng and Xiaodong Wang
|
Millimeter-Wave Beamformed Full-dimensional MIMO Channel Estimation
Based on Atomic Norm Minimization
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter-wave (mmWave) full-dimensional (FD) MIMO system employs planar
arrays at both the base station and user equipment and can simultaneously
support both azimuth and elevation beamforming. In this paper, we propose
atomic-norm-based methods for mmWave FD-MIMO channel estimation under both
uniform planar arrays (UPA) and non-uniform planar arrays (NUPA). Unlike
existing algorithms such as compressive sensing (CS) or subspace methods, the
atomic-norm-based algorithms do not require to discretize the angle spaces of
the angle of arrival (AoA) and angle of departure (AoD) into grids, thus
provide much better accuracy in estimation. In the UPA case, to reduce the
computational complexity, the original large-scale 4D atomic norm minimization
problem is approximately reformulated as a semi-definite program (SDP)
containing two decoupled two-level Toeplitz matrices. The SDP is then solved
via the alternating direction method of multipliers (ADMM) where each iteration
involves only closed-form computations. In the NUPA case, the atomic-norm-based
formulation for channel estimation becomes nonconvex and a
gradient-decent-based algorithm is proposed to solve the problem. Simulation
results show that the proposed algorithms achieve better performance than the
CS-based and subspace-based algorithms.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 13:52:30 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Tsai",
"Yingming",
""
],
[
"Zheng",
"Le",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.994881 |
1709.03854
|
Ivan Olier
|
Ivan Olier, Noureddin Sadawi, G. Richard Bickerton, Joaquin
Vanschoren, Crina Grosan, Larisa Soldatova and Ross D. King
|
Meta-QSAR: a large-scale application of meta-learning to drug design and
discovery
|
33 pages and 15 figures. Manuscript accepted for publication in
Machine Learning Journal. This is the author's pre-print version
| null | null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the learning of quantitative structure activity relationships
(QSARs) as a case-study of meta-learning. This application area is of the
highest societal importance, as it is a key step in the development of new
medicines. The standard QSAR learning problem is: given a target (usually a
protein) and a set of chemical compounds (small molecules) with associated
bioactivities (e.g. inhibition of the target), learn a predictive mapping from
molecular representation to activity. Although almost every type of machine
learning method has been applied to QSAR learning there is no agreed single
best way of learning QSARs, and therefore the problem area is well-suited to
meta-learning. We first carried out the most comprehensive ever comparison of
machine learning methods for QSAR learning: 18 regression methods, 6 molecular
representations, applied to more than 2,700 QSAR problems. (These results have
been made publicly available on OpenML and represent a valuable resource for
testing novel meta-learning methods.) We then investigated the utility of
algorithm selection for QSAR problems. We found that this meta-learning
approach outperformed the best individual QSAR learning method (random forests
using a molecular fingerprint representation) by up to 13%, on average. We
conclude that meta-learning outperforms base-learning methods for QSAR
learning, and as this investigation is one of the most extensive ever
comparisons of base and meta-learning methods ever made, it provides evidence
for the general effectiveness of meta-learning over base-learning.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 14:07:13 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Olier",
"Ivan",
""
],
[
"Sadawi",
"Noureddin",
""
],
[
"Bickerton",
"G. Richard",
""
],
[
"Vanschoren",
"Joaquin",
""
],
[
"Grosan",
"Crina",
""
],
[
"Soldatova",
"Larisa",
""
],
[
"King",
"Ross D.",
""
]
] |
new_dataset
| 0.971662 |
1709.03876
|
Sandor P. Fekete
|
S\'andor P. Fekete and Phillip Keldenich
|
Conflict-Free Coloring of Intersection Graphs
|
17 pages, 10 figures; full version of extended abstract that is to
appear in ISAAC 2017
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conflict-free $k$-coloring of a graph $G=(V,E)$ assigns one of $k$
different colors to some of the vertices such that, for every vertex $v$, there
is a color that is assigned to exactly one vertex among $v$ and $v$'s
neighbors. Such colorings have applications in wireless networking, robotics,
and geometry, and are well studied in graph theory. Here we study the
conflict-free coloring of geometric intersection graphs. We demonstrate that
the intersection graph of $n$ geometric objects without fatness properties and
size restrictions may have conflict-free chromatic number in $\Omega(\log
n/\log\log n)$ and in $\Omega(\sqrt{\log n})$ for disks or squares of different
sizes; it is known for general graphs that the worst case is in $\Theta(\log^2
n)$. For unit-disk intersection graphs, we prove that it is NP-complete to
decide the existence of a conflict-free coloring with one color; we also show
that six colors always suffice, using an algorithm that colors unit disk graphs
of restricted height with two colors. We conjecture that four colors are
sufficient, which we prove for unit squares instead of unit disks. For interval
graphs, we establish a tight worst-case bound of two.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 14:46:31 GMT"
}
] | 2017-09-13T00:00:00 |
[
[
"Fekete",
"Sándor P.",
""
],
[
"Keldenich",
"Phillip",
""
]
] |
new_dataset
| 0.996545 |
1612.05954
|
Armin Wei{\ss}
|
Alexei Miasnikov and Svetla Vassileva and Armin Wei{\ss}
|
The conjugacy problem in free solvable groups and wreath product of
abelian groups is in TC$^0$
| null | null | null | null |
cs.CC math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the conjugacy problem in a wreath product $A \wr B$ is
uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the
factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the
power problem for $B$ can be replaced by the slightly weaker cyclic submonoid
membership problem for $B$. Moreover, if $A$ is abelian, the cyclic subgroup
membership problem suffices, which itself is
uniform-$\mathsf{AC}^0$-many-one-reducible to the conjugacy problem in $A \wr
B$.
Furthermore, under certain natural conditions, we give a uniform
$\mathsf{TC}^0$ Turing reduction from the power problem in $A \wr B$ to the
power problems of $A$ and $B$. Together with our first result, this yields a
uniform $\mathsf{TC}^0$ solution to the conjugacy problem in iterated wreath
products of abelian groups - and, by the Magnus embedding, also in free
solvable groups.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2016 17:21:44 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Sep 2017 09:12:08 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Miasnikov",
"Alexei",
""
],
[
"Vassileva",
"Svetla",
""
],
[
"Weiß",
"Armin",
""
]
] |
new_dataset
| 0.994006 |
1702.02287
|
Baichuan Zhang
|
Baichuan Zhang, Mohammad Al Hasan
|
Name Disambiguation in Anonymized Graphs using Network Embedding
|
The 26th ACM International Conference on Information and Knowledge
Management (CIKM 2017) research track full paper
| null | null | null |
cs.SI cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In real-world, our DNA is unique but many people share names. This phenomenon
often causes erroneous aggregation of documents of multiple persons who are
namesake of one another. Such mistakes deteriorate the performance of document
retrieval, web search, and more seriously, cause improper attribution of credit
or blame in digital forensic. To resolve this issue, the name disambiguation
task is designed which aims to partition the documents associated with a name
reference such that each partition contains documents pertaining to a unique
real-life person. Existing solutions to this task substantially rely on feature
engineering, such as biographical feature extraction, or construction of
auxiliary features from Wikipedia. However, for many scenarios, such features
may be costly to obtain or unavailable due to the risk of privacy violation. In
this work, we propose a novel name disambiguation method. Our proposed method
is non-intrusive of privacy because instead of using attributes pertaining to a
real-life person, our method leverages only relational data in the form of
anonymized graphs. In the methodological aspect, the proposed method uses a
novel representation learning model to embed each document in a low dimensional
vector space where name disambiguation can be solved by a hierarchical
agglomerative clustering algorithm. Our experimental results demonstrate that
the proposed method is significantly better than the existing name
disambiguation methods working in a similar setting.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 04:54:09 GMT"
},
{
"version": "v2",
"created": "Thu, 4 May 2017 00:40:44 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Aug 2017 14:29:03 GMT"
},
{
"version": "v4",
"created": "Sat, 9 Sep 2017 23:05:04 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Zhang",
"Baichuan",
""
],
[
"Hasan",
"Mohammad Al",
""
]
] |
new_dataset
| 0.998699 |
1709.02500
|
Mark Amo-Boateng PhD.
|
Mark Amo-Boateng
|
Super-speeds with Zero-RAM: Next Generation Large-Scale Optimization in
Your Laptop!
|
7 pages, 4 figures, 7 tables
| null | null | null |
cs.DC cs.CC cs.DS cs.PF math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents the novel breakthrough general purpose algorithm for
large scale optimization problems. The novel algorithm is capable of achieving
breakthrough speeds for very large-scale optimization on general purpose
laptops and embedded systems. Application of the algorithm to the Griewank
function was possible in up to 1 billion decision variables in double precision
took only 64485 seconds (~18 hours) to solve, while consuming 7,630 MB (7.6 GB)
or RAM on a single threaded laptop CPU. It shows that the algorithm is
computationally and memory (space) linearly efficient, and can find the optimal
or near-optimal solution in a fraction of the time and memory that many
conventional algorithms require. It is envisaged that this will open up new
possibilities of real-time large-scale problems on personal laptops and
embedded systems.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 01:47:56 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Sep 2017 01:14:46 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Amo-Boateng",
"Mark",
""
]
] |
new_dataset
| 0.999412 |
1709.02843
|
Leila Kosseim
|
Elnaz Davoodi and Leila Kosseim
|
CLaC at SemEval-2016 Task 11: Exploring linguistic and psycho-linguistic
Features for Complex Word Identification
|
In Proceedings of the International Workshop on Semantic Evaluation
(SemEval-2016), a workshop of the 15th Annual Conference of the North
American Chapter of the Association for Computational Linguistics: Human
Language Technologies (NAACL-2016) pp 982-985. June 16-17, San Diego,
California
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the system deployed by the CLaC-EDLK team to the
"SemEval 2016, Complex Word Identification task". The goal of the task is to
identify if a given word in a given context is "simple" or "complex". Our
system relies on linguistic features and cognitive complexity. We used several
supervised models, however the Random Forest model outperformed the others.
Overall our best configuration achieved a G-score of 68.8% in the task, ranking
our system 21 out of 45.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 19:34:02 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Davoodi",
"Elnaz",
""
],
[
"Kosseim",
"Leila",
""
]
] |
new_dataset
| 0.982449 |
1709.02885
|
Jekan Thangavelautham
|
Himangshu Kalita, Erik Asphaug, Stephen Schwartz, Jekanthan
Thangavelautham
|
Network of Nano-Landers for In-Situ Characterization of Asteroid Impact
Studies
|
11 pages, 19 figures appearing in the International Astronautical
Congress 2017, Adelaide, Australia
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exploration of asteroids and comets can give insight into the origins of the
solar system and can be instrumental in planetary defence and in-situ resource
utilization (ISRU). Asteroids, due to their low gravity are a challenging
target for surface exploration. Current missions envision performing
touch-and-go operations over an asteroid surface. In this work, we analyse the
feasibility of sending scores of nano-landers, each 1 kg in mass and volume of
1U, or 1000 cm3. These landers would hop, roll and fly over the asteroid
surface. The landers would include science instruments such as stereo cameras,
hand-lens imagers and spectrometers to characterize rock composition. A network
of nano-landers situated on the surface of an asteroid can provide unique and
very detailed measurements of a spacecraft impacting onto an asteroid surface.
A full-scale, artificial impact experiment onto an asteroid can help
characterize its composition and geology and help in the development of
asteroid deflection techniques intended for planetary defence. Scores of
nano-landers could provide multiple complementary views of the impact,
resultant seismic activity and trajectory of the ejecta. The nano-landers can
analyse the pristine, unearthed regolith shielded from effects of UV and cosmic
rays and that may be millions of years old. Our approach to formulating this
mission concepts utilizes automated machine learning techniques in the planning
and design of space systems. We use a form of Darwinian selection to select and
identify suitable number of nano-landers, the on-board instruments and control
system to explore and navigate the asteroid environment. Scenarios are
generated in simulation and evaluated against quantifiable mission goals such
as area explored on the asteroid and amount of data recorded from the impact
event.
|
[
{
"version": "v1",
"created": "Sat, 9 Sep 2017 00:30:42 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Kalita",
"Himangshu",
""
],
[
"Asphaug",
"Erik",
""
],
[
"Schwartz",
"Stephen",
""
],
[
"Thangavelautham",
"Jekanthan",
""
]
] |
new_dataset
| 0.993431 |
1709.02938
|
Siddharth Nair
|
Siddharth H. Nair, Arpita Sinha and Leena Vachhani
|
Hilbert's Space-filling Curve for Regions with Holes
|
Accepted for presentation at the 56th IEEE Conference on Decision and
Control 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a systematic strategy for implementing Hilbert's space
filling curve for use in online exploration tasks and addresses its application
in scenarios wherein the space to be searched obstacles (or holes) whose
locations are not known a priori. Using the self-similarity and locality
preserving properties of Hilbert's space filling curve, a set of evasive
maneuvers are prescribed and characterized for online implementation.
Application of these maneuvers in the case of non-uniform coverage of spaces
and for obstacles of varying sizes is also presented. The results are validated
with representative simulations demonstrating the deployment of the approach.
|
[
{
"version": "v1",
"created": "Sat, 9 Sep 2017 09:56:08 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Nair",
"Siddharth H.",
""
],
[
"Sinha",
"Arpita",
""
],
[
"Vachhani",
"Leena",
""
]
] |
new_dataset
| 0.994531 |
1709.02957
|
Abhijnan Chakraborty
|
Abhijnan Chakraborty, Rajdeep Sarkar, Ayushi Mrigen, Niloy Ganguly
|
Tabloids in the Era of Social Media? Understanding the Production and
Consumption of Clickbaits in Twitter
|
Accepted in 21st ACM Conference on Computer-Supported Cooperative
Work and Social Computing (CSCW 2018)
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the growing shift towards news consumption primarily through social
media sites like Twitter, most of the traditional as well as new-age media
houses are promoting their news stories by tweeting about them. The competition
for user attention in such mediums has led many media houses to use catchy
sensational form of tweets to attract more users - a process known as
clickbaiting. In this work, using an extensive dataset collected from Twitter,
we analyze the social sharing patterns of clickbait and non-clickbait tweets to
determine the organic reach of such tweets. We also attempt to study the
sections of Twitter users who actively engage themselves in following clickbait
and non-clickbait tweets. Comparing the advent of clickbaits with the rise of
tabloidization of news, we bring out several important insights regarding the
news consumers as well as the media organizations promoting news stories on
Twitter.
|
[
{
"version": "v1",
"created": "Sat, 9 Sep 2017 14:26:23 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Chakraborty",
"Abhijnan",
""
],
[
"Sarkar",
"Rajdeep",
""
],
[
"Mrigen",
"Ayushi",
""
],
[
"Ganguly",
"Niloy",
""
]
] |
new_dataset
| 0.998976 |
1709.03167
|
Kevin Bowden
|
Geetanjali Rakshit, Kevin K. Bowden, Lena Reed, Amita Misra, Marilyn
Walker
|
Debbie, the Debate Bot of the Future
|
IWSDS 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chatbots are a rapidly expanding application of dialogue systems with
companies switching to bot services for customer support, and new applications
for users interested in casual conversation. One style of casual conversation
is argument, many people love nothing more than a good argument. Moreover,
there are a number of existing corpora of argumentative dialogues, annotated
for agreement and disagreement, stance, sarcasm and argument quality. This
paper introduces Debbie, a novel arguing bot, that selects arguments from
conversational corpora, and aims to use them appropriately in context. We
present an initial working prototype of Debbie, with some preliminary
evaluation and describe future work.
|
[
{
"version": "v1",
"created": "Sun, 10 Sep 2017 20:22:30 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Rakshit",
"Geetanjali",
""
],
[
"Bowden",
"Kevin K.",
""
],
[
"Reed",
"Lena",
""
],
[
"Misra",
"Amita",
""
],
[
"Walker",
"Marilyn",
""
]
] |
new_dataset
| 0.995669 |
1709.03217
|
Chunming Tang
|
Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi
|
New characterization and parametrization of LCD Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear complementary dual (LCD) cyclic codes were referred historically to as
reversible cyclic codes, which had applications in data storage. Due to a newly
discovered application in cryptography, there has been renewed interest in LCD
codes. In particular, it has been shown that binary LCD codes play an important
role in implementations against side-channel attacks and fault injection
attacks. In this paper, we first present a new characterization of binary LCD
codes in terms of their symplectic basis. Using such a characterization,we
solve a conjecture proposed by Galvez et al. on the minimum distance of binary
LCD codes. Next, we consider the action of the orthogonal group on the set of
all LCD codes, determine all possible orbits of this action, derive simple
closed formulas of the size of the orbits, and present some asymptotic results
of the size of the corresponding orbits. Our results show that almost all
binary LCD codes are odd-like codes with odd-like duals, and about half of
q-ary LCD codes have orthonormal basis, where q is a power of an odd prime.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 02:35:11 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Carlet",
"Claude",
""
],
[
"Mesnager",
"Sihem",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
]
] |
new_dataset
| 0.996592 |
1709.03297
|
Giuseppe Vizzari
|
Luca Crociani, Gregor L\"ammel, H. Joon Park, Giuseppe Vizzari
|
Cellular Automaton Based Simulation of Large Pedestrian Facilities - A
Case Study on the Staten Island Ferry Terminals
|
96th Transportation Research Board annual meeting, Washington,
January 2017
| null | null | null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current metropolises largely depend on a functioning transport infrastructure
and the increasing demand can only be satisfied by a well organized mass
transit. One example for a crucial mass transit system is New York City's
Staten Island Ferry, connecting the two boroughs of Staten Island and Manhattan
with a regular passenger service. Today's demand already exceeds 2500
passengers for a single cycle during peek hours, and future projections suggest
that it will further increase. One way to appraise how the system will cope
with future demand is by simulation. This contribution proposes an integrated
simulation approach to evaluate the system performance with respect to future
demand. The simulation relies on a multiscale modeling approach where the
terminal buildings are simulated by a microscopic and quantitatively valid
cellular automata (CA) and the journeys of the ferries themselves are modeled
by a mesoscopic queue simulation approach. Based on the simulation results
recommendations with respect to the future demand are given.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 08:48:19 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Crociani",
"Luca",
""
],
[
"Lämmel",
"Gregor",
""
],
[
"Park",
"H. Joon",
""
],
[
"Vizzari",
"Giuseppe",
""
]
] |
new_dataset
| 0.999002 |
1709.03358
|
Benjamin Smith
|
Joost Renes, Benjamin Smith (GRACE, LIX)
|
qDSA: Small and Secure Digital Signatures with Curve-based
Diffie--Hellman Key Pairs
|
ASIACRYPT 2017, Dec 2017, Hong Kong, China. 2017
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
qDSA is a high-speed, high-security signature scheme that facilitates
implementations with a very small memory footprint, a crucial requirement for
embedded systems and IoT devices, and that uses the same public keys as modern
Diffie--Hellman schemes based on Montgomery curves (such as Curve25519) or
Kummer surfaces. qDSA resembles an adaptation of EdDSA to the world of Kummer
varieties, which are quotients of algebraic groups by $\pm$1. Interestingly,
qDSA does not require any full group operations or point recovery: all
computations, including signature verification, occur on the quotient where
there is no group law. We include details on four implementations of qDSA,
using Montgomery and fast Kummer surface arithmetic on the 8-bit AVR ATmega and
32-bit ARM Cortex M0 platforms. We find that qDSA significantly outperforms
state-of-the-art signature implementations in terms of stack usage and code
size. We also include an efficient compression algorithm for points on fast
Kummer surfaces, reducing them to the same size as compressed elliptic curve
points for the same security level.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 13:05:58 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Renes",
"Joost",
"",
"GRACE, LIX"
],
[
"Smith",
"Benjamin",
"",
"GRACE, LIX"
]
] |
new_dataset
| 0.995829 |
1709.03404
|
Oskar Schirmer
|
Felix Winkelmann, Oskar Schirmer
|
A Domain-specific Language for High-reliability Software used in the
JUICE SWI Instrument - The hO Language Manual
|
21 pages
| null | null | null |
cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
hO is a custom restricted dialect of Oberon, developed at the Max-Planck
Institute for Solar System Research in G\"ottingen and used in the SWI flight
software for the JUICE mission. hO is applied to reduce the possibility of
syntactically valid but incorrect code, provide better means of statically
analyzing source code, is more readable than C and gives syntactic support for
the software architecture used in the SWI instrument software. By using a
higher-level, application-specific notation a whole range of possible errors is
eliminated and source code size is reduced, while making the code itself easier
to understand, review and analyze.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 14:27:33 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Winkelmann",
"Felix",
""
],
[
"Schirmer",
"Oskar",
""
]
] |
new_dataset
| 0.99859 |
1709.03413
|
Eray Ozkural
|
Eray \"Ozkural
|
Gigamachine: incremental machine learning on desktop computers
|
This is the original submission for my AGI-2010 paper titled
Stochastic Grammar Based Incremental Machine Learning Using Scheme which may
be found on http://agi-conf.org/2010/wp-content/uploads/2009/06/paper_24.pdf
and presented a partial but general solution to the transfer learning problem
in AI. arXiv admin note: substantial text overlap with arXiv:1103.1003
|
Artificial General Intelligence 2010, p. 190
| null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a concrete design for Solomonoff's incremental machine learning
system suitable for desktop computers. We use R5RS Scheme and its standard
library with a few omissions as the reference machine. We introduce a Levin
Search variant based on a stochastic Context Free Grammar together with new
update algorithms that use the same grammar as a guiding probability
distribution for incremental machine learning. The updates include adjusting
production probabilities, re-using previous solutions, learning programming
idioms and discovery of frequent subprograms. The issues of extending the a
priori probability distribution and bootstrapping are discussed. We have
implemented a good portion of the proposed algorithms. Experiments with toy
problems show that the update algorithms work as expected.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 17:39:26 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Özkural",
"Eray",
""
]
] |
new_dataset
| 0.995325 |
1709.03424
|
Maximilien Gadouleau
|
Maximilien Gadouleau
|
Constant-Weight Array Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary constant-weight codes have been extensively studied, due to both their
numerous applications and to their theoretical significance. In particular,
constant-weight codes have been proposed for error correction in store and
forward. In this paper, we introduce constant-weight array codes (CWACs), which
offer a tradeoff between the rate gain of general constant-weight codes and the
low decoding complexity of liftings. CWACs can either be used in the on-shot
setting introduced earlier or in a multi-shot approach, where one codeword
consists of several messages. The multi-shot approach generalizes the one-shot
approach and hence allows for higher rate gains. We first give a construction
of CWACs based on concatenation, which generalizes the traditional erasure
codes, and also provide a decoding algorithm for these codes. Since CWACs can
be viewed as a generalization of both binary constant-weight codes and
nonrestricted Hamming metric codes, CWACs thus provide an additional degree of
freedom to both problems of determining the maximum cardinality of
constant-weight codes and nonrestricted Hamming metric codes. We then
investigate their theoretical significance. We first generalize many classical
bounds derived for Hamming metric codes or constant-weight codes in the CWAC
framework. We finally relate the maximum cardinality of a CWAC to that of a
constant-weight code, of a nonrestricted Hamming metric code, and of a
spherical code.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 15:01:45 GMT"
}
] | 2017-09-12T00:00:00 |
[
[
"Gadouleau",
"Maximilien",
""
]
] |
new_dataset
| 0.99976 |
1709.00604
|
Yimei Li
|
Yimei Li and Yao Liang
|
Compressed Sensing in Multi-Hop Large-Scale Wireless Sensor Networks
Based on Routing Topology Tomography
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data acquisition from a multi-hop large-scale outdoor wireless sensor network
(WSN) deployment for environmental monitoring is full of challenges. This is
because the severe resource constraints on small battery-operated motes (e.g.,
bandwidth, memory, power, and computing capacity), the big data acquisition
volume from the large-scale WSN,and the highly dynamic wireless link conditions
in an outdoor communication environment. We present a novel compressed sensing
approach which can recover the sensing data at the sink with high fidelity when
very few data packets are collected, leading to a significant reduction of the
net-work transmissions and thus an extension of the WSN lifetime. Interplaying
with the dynamic WSN routing topology, the proposed approach is efficient and
simple to implement on the resource-constrained motes without a mote's storing
of any part of the random projection matrix, as opposed to other existing
compressed sensing based schemes. We propose a systematic method via machine
learning to find a suitable representation basis, for any given WSN deployment
and data field, which is both sparse and incoherent with the random projection
matrix in the compressed sensing for data acquisition. We validate our approach
and evaluate its performance using a real-world multi-hop WSN testbed
deployment in situ. The results demonstrate that our approach significantly
outperforms existing compressed sensing approaches by reducing data recovery
errors by an order of magnitude for the entire WSN observation field, while
drastically reducing wireless communication costs at the same time.
|
[
{
"version": "v1",
"created": "Sat, 2 Sep 2017 16:55:06 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Sep 2017 02:56:18 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Li",
"Yimei",
""
],
[
"Liang",
"Yao",
""
]
] |
new_dataset
| 0.987965 |
1709.02414
|
Taylan Sen
|
Tayan Sen, Md Kamrul Hasan, Zach Teicher, M. Ehsan Hoque
|
Automated Dyadic Data Recorder (ADDR) Framework and Analysis of Facial
Cues in Deceptive Communication
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We developed an online framework that can automatically pair two
crowd-sourced participants, prompt them to follow a research protocol, and
record their audio and video on a remote server. The framework comprises two
web applications: an Automatic Quality Gatekeeper for ensuring only high
quality crowd-sourced participants are recruited for the study, and a Session
Controller which directs participants to play a research protocol, such as an
interrogation game. This framework was used to run a research study for
analyzing facial expressions during honest and deceptive communication using a
novel interrogation protocol. The protocol gathers two sets of nonverbal facial
cues in participants: features expressed during questions relating to the
interrogation topic and features expressed during control questions. The
framework and protocol were used to gather 151 dyadic conversations (1.3
million video frames). Interrogators who were lied to expressed the
smile-related lip corner puller cue more often than interrogators who were
being told the truth, suggesting that facial cues from interrogators may be
useful in evaluating the honesty of witnesses in some contexts. Overall, these
results demonstrate that this framework is capable of gathering high quality
data which can identify statistically significant results in a communication
study.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 19:25:26 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Sen",
"Tayan",
""
],
[
"Hasan",
"Md Kamrul",
""
],
[
"Teicher",
"Zach",
""
],
[
"Hoque",
"M. Ehsan",
""
]
] |
new_dataset
| 0.950795 |
1709.02433
|
Joseph O'Rourke
|
Joseph O'Rourke
|
Addendum to: Edge-Unfolding Nearly Flat Convex Caps
|
11 pages, 8 figures, 3 references. Eventually will be incorporated
into [O'R17]: arXiv:1707.01006 [cs.CG]
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This addendum to [O'R17] establishes that a nearly flat acutely triangulated
convex cap in the sense of that paper can be edge-unfolded even if closed to a
polyhedron by adding the convex polygonal base under the cap.
|
[
{
"version": "v1",
"created": "Sat, 2 Sep 2017 19:50:40 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.985282 |
1709.02480
|
Timnit Gebru
|
Timnit Gebru, Jonathan Krause, Yilun Wang, Duyun Chen, Jia Deng, Li
Fei-Fei
|
Fine-Grained Car Detection for Visual Census Estimation
|
AAAI 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Targeted socioeconomic policies require an accurate understanding of a
country's demographic makeup. To that end, the United States spends more than 1
billion dollars a year gathering census data such as race, gender, education,
occupation and unemployment rates. Compared to the traditional method of
collecting surveys across many years which is costly and labor intensive,
data-driven, machine learning driven approaches are cheaper and faster--with
the potential ability to detect trends in close to real time. In this work, we
leverage the ubiquity of Google Street View images and develop a computer
vision pipeline to predict income, per capita carbon emission, crime rates and
other city attributes from a single source of publicly available visual data.
We first detect cars in 50 million images across 200 of the largest US cities
and train a model to predict demographic attributes using the detected cars. To
facilitate our work, we have collected the largest and most challenging
fine-grained dataset reported to date consisting of over 2600 classes of cars
comprised of images from Google Street View and other web sources, classified
by car experts to account for even the most subtle of visual differences. We
use this data to construct the largest scale fine-grained detection system
reported to date. Our prediction results correlate well with ground truth
income data (r=0.82), Massachusetts department of vehicle registration, and
sources investigating crime rates, income segregation, per capita carbon
emission, and other market research. Finally, we learn interesting
relationships between cars and neighborhoods allowing us to perform the first
large scale sociological analysis of cities using computer vision techniques.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 22:56:21 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Gebru",
"Timnit",
""
],
[
"Krause",
"Jonathan",
""
],
[
"Wang",
"Yilun",
""
],
[
"Chen",
"Duyun",
""
],
[
"Deng",
"Jia",
""
],
[
"Fei-Fei",
"Li",
""
]
] |
new_dataset
| 0.999708 |
1709.02489
|
Harry Kalodner
|
Harry Kalodner, Steven Goldfeder, Alishah Chator, Malte M\"oser, and
Arvind Narayanan
|
BlockSci: Design and applications of a blockchain analysis platform
| null | null | null | null |
cs.CR cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analysis of blockchain data is useful for both scientific research and
commercial applications. We present BlockSci, an open-source software platform
for blockchain analysis. BlockSci is versatile in its support for different
blockchains and analysis tasks. It incorporates an in-memory, analytical
(rather than transactional) database, making it several hundred times faster
than existing tools. We describe BlockSci's design and present four analyses
that illustrate its capabilities.
This is a working paper that accompanies the first public release of
BlockSci, available at https://github.com/citp/BlockSci. We seek input from the
community to further develop the software and explore other potential
applications.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 00:11:38 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Kalodner",
"Harry",
""
],
[
"Goldfeder",
"Steven",
""
],
[
"Chator",
"Alishah",
""
],
[
"Möser",
"Malte",
""
],
[
"Narayanan",
"Arvind",
""
]
] |
new_dataset
| 0.999553 |
1709.02505
|
Li Li
|
Li Li and Hua Wei and Yao Huang and Yao Yao and Weiwei Ling and Gong
Chen and Peng Li and Yunlong Cai
|
A Simple Two-stage Equalizer With Simplified Orthogonal Time Frequency
Space Modulation Over Rapidly Time-varying Channels
|
4 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we derive a equivalent delay-Doppler channel matrix of the
Orthogonal Time Frequency Space (OTFS) modulation that has not been studied in
previous literature. It has the similar structure as the banded channel matrix
of OFDM systems over rapidly time-varying channels. However, the band in the
equivalent channel matrix will no longer spread with the increase of the
Doppler spread once the length of maximum channel delay spread and the OTFS
frame duration are deter- mined. Furthermore, the equivalent channel matrix can
simplify the OTFS modulation in the transmitter side. Incorporating the
equivalent channel matrix, we propose a simple two-stage equal- izer in 1
dimensional operations for OTFS modulation. First, the receive signal is
equalized using the conventional OFDM single- tap equalizer in the frequency
domain. The multipath effects can be removed. In the second stage, another low
complexity delay- Doppler domain equalizer is employed to eliminate the effects
of the residual interference caused by the Doppler spread with the equivalent
channel matrix. The simulation results demonstrate that the proposed method is
superior to the conventional single- tap equalizer and full minimum mean
squared error (MMSE) equalizer of OFDM systems in terms of BER in high Doppler
spread scenarios.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 02:15:57 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Li",
"Li",
""
],
[
"Wei",
"Hua",
""
],
[
"Huang",
"Yao",
""
],
[
"Yao",
"Yao",
""
],
[
"Ling",
"Weiwei",
""
],
[
"Chen",
"Gong",
""
],
[
"Li",
"Peng",
""
],
[
"Cai",
"Yunlong",
""
]
] |
new_dataset
| 0.994416 |
1709.02559
|
EPTCS
|
Maike Schwammberger (University of Oldenburg)
|
Imperfect Knowledge in Autonomous Urban Traffic Manoeuvres
|
In Proceedings FVAV 2017, arXiv:1709.02126
|
EPTCS 257, 2017, pp. 59-74
|
10.4204/EPTCS.257.7
| null |
cs.LO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Urban Multi-lane Spatial Logic (UMLSL) was introduced in [13] for proving
safety (collision freedom) in autonomous urban traffic manoeuvres with perfect
knowledge. We now consider a concept of imperfect knowledge, where cars have
less information about other cars. To this end, we introduce the concept of a
multi-view and propose crossing controllers using broadcast communication with
data constraints for turning manoeuvres at intersections.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 06:36:10 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Schwammberger",
"Maike",
"",
"University of Oldenburg"
]
] |
new_dataset
| 0.97026 |
1709.02561
|
EPTCS
|
Benjamin Martin (1), Khalil Ghorbal (2), Eric Goubault (1), Sylvie
Putot (1) ((1) LIX, Ecole Polytechnique, CNRS, Universit\'e Paris-Saclay, (2)
INRIA)
|
Formal Verification of Station Keeping Maneuvers for a Planar Autonomous
Hybrid System
|
In Proceedings FVAV 2017, arXiv:1709.02126
|
EPTCS 257, 2017, pp. 91-104
|
10.4204/EPTCS.257.9
| null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We formally verify a hybrid control law designed to perform a station keeping
maneuver for a planar vehicle. Such maneuver requires that the vehicle reaches
a neighborhood of its station in finite time and remains in it while waiting
for further instructions. We model the dynamics as well as the control law as a
hybrid program and formally verify both the reachability and safety properties
involved. We highlight in particular the automated generation of invariant
regions which turns out to be crucial in performing such verification. We use
the theorem prover Keymaera X to discharge some of the generated proof
obligations.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 06:36:58 GMT"
}
] | 2017-09-11T00:00:00 |
[
[
"Martin",
"Benjamin",
""
],
[
"Ghorbal",
"Khalil",
""
],
[
"Goubault",
"Eric",
""
],
[
"Putot",
"Sylvie",
""
]
] |
new_dataset
| 0.985513 |
1403.7209
|
Istv\'an Z Reguly
|
Istv\'an Z. Reguly and Gihan R. Mudalige and Carlo Bertolli and
Michael B. Giles and Adam Betts and Paul H. J. Kelly and David Radford
|
Acceleration of a Full-scale Industrial CFD Application with OP2
|
Submitted to ACM Transactions on Parallel Computing
|
IEEE Transactions on Parallel and Distributed Systems, vol. 27,
no. 5, pp. 1265-1278, May 1 2016. doi: 10.1109/TPDS.2015.2453972
|
10.1109/TPDS.2015.2453972
| null |
cs.CE cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hydra is a full-scale industrial CFD application used for the design of
turbomachinery at Rolls Royce plc. It consists of over 300 parallel loops with
a code base exceeding 50K lines and is capable of performing complex
simulations over highly detailed unstructured mesh geometries. Unlike simpler
structured-mesh applications, which feature high speed-ups when accelerated by
modern processor architectures, such as multi-core and many-core processor
systems, Hydra presents major challenges in data organization and movement that
need to be overcome for continued high performance on emerging platforms. We
present research in achieving this goal through the OP2 domain-specific
high-level framework. OP2 targets the domain of unstructured mesh problems and
follows the design of an active library using source-to-source translation and
compilation to generate multiple parallel implementations from a single
high-level application source for execution on a range of back-end hardware
platforms. We chart the conversion of Hydra from its original hand-tuned
production version to one that utilizes OP2, and map out the key difficulties
encountered in the process. To our knowledge this research presents the first
application of such a high-level framework to a full scale production code.
Specifically we show (1) how different parallel implementations can be achieved
with an active library framework, even for a highly complicated industrial
application such as Hydra, and (2) how different optimizations targeting
contrasting parallel architectures can be applied to the whole application,
seamlessly, reducing developer effort and increasing code longevity.
Performance results demonstrate that not only the same runtime performance as
that of the hand-tuned original production code could be achieved, but it can
be significantly improved on conventional processor systems. Additionally, we
achieve further...
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 20:14:24 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Reguly",
"István Z.",
""
],
[
"Mudalige",
"Gihan R.",
""
],
[
"Bertolli",
"Carlo",
""
],
[
"Giles",
"Michael B.",
""
],
[
"Betts",
"Adam",
""
],
[
"Kelly",
"Paul H. J.",
""
],
[
"Radford",
"David",
""
]
] |
new_dataset
| 0.999616 |
1701.02718
|
Roozbeh Mottaghi
|
Roozbeh Mottaghi, Connor Schenck, Dieter Fox, Ali Farhadi
|
See the Glass Half Full: Reasoning about Liquid Containers, their Volume
and Content
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans have rich understanding of liquid containers and their contents; for
example, we can effortlessly pour water from a pitcher to a cup. Doing so
requires estimating the volume of the cup, approximating the amount of water in
the pitcher, and predicting the behavior of water when we tilt the pitcher.
Very little attention in computer vision has been made to liquids and their
containers. In this paper, we study liquid containers and their contents, and
propose methods to estimate the volume of containers, approximate the amount of
liquid in them, and perform comparative volume estimations all from a single
RGB image. Furthermore, we show the results of the proposed model for
predicting the behavior of liquids inside containers when one tilts the
containers. We also introduce a new dataset of Containers Of liQuid contEnt
(COQE) that contains more than 5,000 images of 10,000 liquid containers in
context labelled with volume, amount of content, bounding box annotation, and
corresponding similar 3D CAD models.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 18:25:15 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Sep 2017 21:42:02 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Mottaghi",
"Roozbeh",
""
],
[
"Schenck",
"Connor",
""
],
[
"Fox",
"Dieter",
""
],
[
"Farhadi",
"Ali",
""
]
] |
new_dataset
| 0.977464 |
1702.02642
|
Mehrtash Mehrabi
|
Mehrtash Mehrabi and Massoud Ardakani
|
On minimum distance of locally repairable codes
|
This paper has been withdrawn by the author due to some typos
| null |
10.1109/CWIT.2017.7994819
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed and cloud storage systems are used to reliably store large-scale
data. Erasure codes have been recently proposed and used in real-world
distributed and cloud storage systems such as Google File System, Microsoft
Azure Storage, and Facebook HDFS-RAID, to enhance the reliability. In order to
decrease the repair bandwidth and disk I/O, a class of erasure codes called
locally repairable codes (LRCs) have been proposed which have small locality
compare to other erasure codes. Although LRCs have small locality, they have
lower minimum distance compare to the Singleton bound. Hence, seeking the
largest possible minimum distance for LRCs have been the topic of many recent
studies. In this paper, we study the largest possible minimum distance of a
class of LRCs and evaluate them in terms of achievability. Furthermore, we
compare our results with the existence bounds in the literature.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 22:41:40 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Feb 2017 23:42:22 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Mehrabi",
"Mehrtash",
""
],
[
"Ardakani",
"Massoud",
""
]
] |
new_dataset
| 0.999507 |
1705.02116
|
Shuoyao Wang
|
Shuoyao Wang, Suzhi Bi, Ying Jun (Angela) Zhang, Jianwei Huang
|
Electrical Vehicle Charging Station Profit Maximization: Admission,
Pricing, and Online Scheduling
|
This paper has been submitted to IEEE Transactions on Sustainable
Energy for potential journal publication
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid emergence of electric vehicles (EVs) demands an advanced
infrastructure of publicly accessible charging stations that provide efficient
charging services. In this paper, we propose a new charging station operation
mechanism, the JoAP, which jointly optimizes the EV admission control, pricing,
and charging scheduling to maximize the charging station's profit. More
specifically, by introducing a tandem queueing network model, we analytically
characterize the average charging station profit as a function of the admission
control and pricing policies. Based on the analysis, we characterize the
optimal JoAP algorithm. Through extensive simulations, we demonstrate that the
proposed JoAP algorithm on average can achieve 330% and 531% higher profit than
a widely adopted benchmark method under two representative waiting-time penalty
rates.
|
[
{
"version": "v1",
"created": "Fri, 5 May 2017 07:59:36 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 08:18:08 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Wang",
"Shuoyao",
"",
"Angela"
],
[
"Bi",
"Suzhi",
"",
"Angela"
],
[
"Jun",
"Ying",
"",
"Angela"
],
[
"Zhang",
"",
""
],
[
"Huang",
"Jianwei",
""
]
] |
new_dataset
| 0.993103 |
1705.02609
|
EPTCS
|
Antti Kuusisto, Fabian Reiter
|
Emptiness Problems for Distributed Automata
|
In Proceedings GandALF 2017, arXiv:1709.01761. 13 pages, 2 figures
|
EPTCS 256, 2017, pp. 210-222
|
10.4204/EPTCS.256.15
| null |
cs.FL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the decidability of the emptiness problem for three classes of
distributed automata. These devices operate on finite directed graphs, acting
as networks of identical finite-state machines that communicate in an infinite
sequence of synchronous rounds. The problem is shown to be decidable in
LogSpace for a class of forgetful automata, where the nodes see the messages
received from their neighbors but cannot remember their own state. When
restricted to the appropriate families of graphs, these forgetful automata are
equivalent to classical finite word automata, but strictly more expressive than
finite tree automata. On the other hand, we also show that the emptiness
problem is undecidable in general. This already holds for two heavily
restricted classes of distributed automata: those that reject immediately if
they receive more than one message per round, and those whose state diagram
must be acyclic except for self-loops.
|
[
{
"version": "v1",
"created": "Sun, 7 May 2017 12:45:27 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 06:58:50 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Kuusisto",
"Antti",
""
],
[
"Reiter",
"Fabian",
""
]
] |
new_dataset
| 0.991124 |
1706.03827
|
Daniel Roche
|
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
|
Deterministic, Stash-Free Write-Only ORAM
| null |
Proc. ACM Conf. on Computer and Communications Security (CCS) 2017
|
10.1145/3133956.3134051
| null |
cs.CR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Write-Only Oblivious RAM (WoORAM) protocols provide privacy by encrypting the
contents of data and also hiding the pattern of write operations over that
data. WoORAMs provide better privacy than plain encryption and better
performance than more general ORAM schemes (which hide both writing and reading
access patterns), and the write-oblivious setting has been applied to important
applications of cloud storage synchronization and encrypted hidden volumes. In
this paper, we introduce an entirely new technique for Write-Only ORAM, called
DetWoORAM. Unlike previous solutions, DetWoORAM uses a deterministic,
sequential writing pattern without the need for any "stashing" of blocks in
local state when writes fail. Our protocol, while conceptually simple, provides
substantial improvement over prior solutions, both asymptotically and
experimentally. In particular, under typical settings the DetWoORAM writes only
2 blocks (sequentially) to backend memory for each block written to the device,
which is optimal. We have implemented our solution using the BUSE (block device
in user-space) module and tested DetWoORAM against both an encryption only
baseline of dm-crypt and prior, randomized WoORAM solutions, measuring only a
3x-14x slowdown compared to an encryption-only baseline and around 6x-19x
speedup compared to prior work.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 19:58:36 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 09:16:42 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Roche",
"Daniel S.",
""
],
[
"Aviv",
"Adam J.",
""
],
[
"Choi",
"Seung Geol",
""
],
[
"Mayberry",
"Travis",
""
]
] |
new_dataset
| 0.967816 |
1708.09233
|
Patrizio Angelini
|
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jiri Fiala,
Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen Kobourov, Jan
Kratochvil, and Pavel Valtr
|
On Vertex- and Empty-Ply Proximity Drawings
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We initiate the study of the vertex-ply of straight-line drawings, as a
relaxation of the recently introduced ply number. Consider the disks centered
at each vertex with radius equal to half the length of the longest edge
incident to the vertex. The vertex-ply of a drawing is determined by the vertex
covered by the maximum number of disks. The main motivation for considering
this relaxation is to relate the concept of ply to proximity drawings. In fact,
if we interpret the set of disks as proximity regions, a drawing with
vertex-ply number 1 can be seen as a weak proximity drawing, which we call
empty-ply drawing. We show non-trivial relationships between the ply number and
the vertex-ply number. Then, we focus on empty-ply drawings, proving some
properties and studying what classes of graphs admit such drawings. Finally, we
prove a lower bound on the ply and the vertex-ply of planar drawings.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 12:24:25 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 08:55:02 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Angelini",
"Patrizio",
""
],
[
"Chaplick",
"Steven",
""
],
[
"De Luca",
"Felice",
""
],
[
"Fiala",
"Jiri",
""
],
[
"Hancl",
"Jaroslav",
"Jr."
],
[
"Heinsohn",
"Niklas",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kobourov",
"Stephen",
""
],
[
"Kratochvil",
"Jan",
""
],
[
"Valtr",
"Pavel",
""
]
] |
new_dataset
| 0.988064 |
1708.09435
|
Shankar Kulumani
|
Shankar Kulumani and Kuya Takami and Taeyoung Lee
|
Geometric Control for Autonomous Landing on Asteroid Itokawa using
Visual Localization
|
Presented at 2017 AAS Astrodynamics Specialist Conference Stevenson,
WA
| null | null | null |
cs.SY math.OC
|
http://creativecommons.org/licenses/by-sa/4.0/
|
This paper considers the coupled orbit and attitude dynamics of a dumbbell
spacecraft around an asteroid. Geometric methods are used to derive the coupled
equations of motion, defined on the configuration space of the special
Euclidean group, and then a nonlinear controller is designed to enable
trajectory tracking of desired landing trajectories. Rather than relying on
sliding mode control or optimization based methods, the proposed approach
avoids the increased control utilization and computational complexity inherent
in other techniques. The nonlinear controller is used to track a desired
landing trajectory to the asteroid surface. A monocular imaging sensor is used
to provide position and attitude estimates using visual odometry to enable
relative state estimates. We demonstrate this control scheme with a landing
simulation about asteroid Itokawa.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 17:44:51 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 13:13:25 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Kulumani",
"Shankar",
""
],
[
"Takami",
"Kuya",
""
],
[
"Lee",
"Taeyoung",
""
]
] |
new_dataset
| 0.995777 |
1708.09778
|
Veronika Irvine
|
Therese Biedl and Veronika Irvine
|
Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of
periodic graphs
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study a class of graph drawings that arise from bobbin lace
patterns. The drawings are periodic and require a combinatorial embedding with
specific properties which we outline and demonstrate can be verified in linear
time. In addition, a lace graph drawing has a topological requirement: it
contains a set of non-contractible directed cycles which must be homotopic to
$(1,0)$, that is, when drawn on a torus, each cycle wraps once around the minor
meridian axis and zero times around the major longitude axis. We provide an
algorithm for finding the two fundamental cycles of a canonical rectangular
schema in a supergraph that enforces this topological constraint. The polygonal
schema is then used to produce a straight-line drawing of the lace graph inside
a rectangular frame. We argue that such a polygonal schema always exists for
combinatorial embeddings satisfying the conditions of bobbin lace patterns, and
that we can therefore create a pattern, given a graph with a fixed
combinatorial embedding of genus one.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 15:35:46 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Sep 2017 17:00:48 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Sep 2017 00:14:31 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Irvine",
"Veronika",
""
]
] |
new_dataset
| 0.998575 |
1709.01825
|
Satya Bagchi
|
Joydeb Pal, Pramod Kumar Maurya, Shyambhu Mukherjee and Satya Bagchi
|
Generalized twisted centralizer codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important code of length $n^2$ is obtained by taking centralizer of a
square matrix over a finite field $\mathbb{F}_q$. Twisted centralizer codes,
twisted by an element $a \in \mathbb{F}_q$, are also similar type of codes but
different in nature. The main results were embedded on dimension and minimum
distance. In this paper, we have defined a new family of twisted centralizer
codes namely generalized twisted centralizer (GTC) codes by $\mathcal{C}(A,D):=
\lbrace B \in \mathbb{F}_q^{n \times n}|AB=BAD \rbrace$ twisted by a matrix $D$
and investigated results on dimension and minimum distance. Parity-check matrix
and syndromes are also investigated. Length of the centralizer codes is $n^2$
by construction but in this paper, we have constructed centralizer codes of
length $(n^2-i)$, where $i$ is a positive integer. In twisted centralizer
codes, minimum distance can be at most $n$ when the field is binary whereas GTC
codes can be constructed with minimum distance more than $n$.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 13:55:34 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Sep 2017 10:21:54 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Pal",
"Joydeb",
""
],
[
"Maurya",
"Pramod Kumar",
""
],
[
"Mukherjee",
"Shyambhu",
""
],
[
"Bagchi",
"Satya",
""
]
] |
new_dataset
| 0.998268 |
1709.02076
|
Clayton Morrison
|
Donya Quick, Clayton T. Morrison
|
Composition by Conversation
|
6 pages, 8 figures, accepted to ICMC 2017
| null | null | null |
cs.SD cs.CL cs.IR cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Most musical programming languages are developed purely for coding virtual
instruments or algorithmic compositions. Although there has been some work in
the domain of musical query languages for music information retrieval, there
has been little attempt to unify the principles of musical programming and
query languages with cognitive and natural language processing models that
would facilitate the activity of composition by conversation. We present a
prototype framework, called MusECI, that merges these domains, permitting
score-level algorithmic composition in a text editor while also supporting
connectivity to existing natural language processing frameworks.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 05:39:00 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Quick",
"Donya",
""
],
[
"Morrison",
"Clayton T.",
""
]
] |
new_dataset
| 0.998632 |
1709.02081
|
Ha Tran Hong Phan
|
Ha Tran Hong Phan, Ashnil Kumar, David Feng, Michael Fulham, Jinman
Kim
|
An unsupervised long short-term memory neural network for event
detection in cell videos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an automatic unsupervised cell event detection and classification
method, which expands convolutional Long Short-Term Memory (LSTM) neural
networks, for cellular events in cell video sequences. Cells in images that are
captured from various biomedical applications usually have different shapes and
motility, which pose difficulties for the automated event detection in cell
videos. Current methods to detect cellular events are based on supervised
machine learning and rely on tedious manual annotation from investigators with
specific expertise. So that our LSTM network could be trained in an
unsupervised manner, we designed it with a branched structure where one branch
learns the frequent, regular appearance and movements of objects and the second
learns the stochastic events, which occur rarely and without warning in a cell
video sequence. We tested our network on a publicly available dataset of
densely packed stem cell phase-contrast microscopy images undergoing cell
division. This dataset is considered to be more challenging that a dataset with
sparse cells. We compared our method to several published supervised methods
evaluated on the same dataset and to a supervised LSTM method with a similar
design and configuration to our unsupervised method. We used an F1-score, which
is a balanced measure for both precision and recall. Our results show that our
unsupervised method has a higher or similar F1-score when compared to two fully
supervised methods that are based on Hidden Conditional Random Fields (HCRF),
and has comparable accuracy with the current best supervised HCRF-based method.
Our method was generalizable as after being trained on one video it could be
applied to videos where the cells were in different conditions. The accuracy of
our unsupervised method approached that of its supervised counterpart.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 05:58:23 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Phan",
"Ha Tran Hong",
""
],
[
"Kumar",
"Ashnil",
""
],
[
"Feng",
"David",
""
],
[
"Fulham",
"Michael",
""
],
[
"Kim",
"Jinman",
""
]
] |
new_dataset
| 0.987979 |
1709.02096
|
EPTCS
|
St\'ephane Le Roux (Universit\'e Libre de Bruxelles), \'Erik
Martin-Dorel (IRIT, Universit\'e de Toulouse), Jan-Georg Smaus (IRIT,
Universit\'e de Toulouse)
|
An Existence Theorem of Nash Equilibrium in Coq and Isabelle
|
In Proceedings GandALF 2017, arXiv:1709.01761
|
EPTCS 256, 2017, pp. 46-60
|
10.4204/EPTCS.256.4
| null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nash equilibrium (NE) is a central concept in game theory. Here we prove
formally a published theorem on existence of an NE in two proof assistants, Coq
and Isabelle: starting from a game with finitely many outcomes, one may derive
a game by rewriting each of these outcomes with either of two basic outcomes,
namely that Player 1 wins or that Player 2 wins. If all ways of deriving such a
win/lose game lead to a game where one player has a winning strategy, the
original game also has a Nash equilibrium.
This article makes three other contributions: first, while the original proof
invoked linear extension of strict partial orders, here we avoid it by
generalizing the relevant definition. Second, we notice that the theorem also
implies the existence of a secure equilibrium, a stronger version of NE that
was introduced for model checking. Third, we also notice that the constructive
proof of the theorem computes secure equilibria for non-zero-sum priority games
(generalizing parity games) in quasi-polynomial time.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 06:54:50 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Roux",
"Stéphane Le",
"",
"Université Libre de Bruxelles"
],
[
"Martin-Dorel",
"Érik",
"",
"IRIT, Université de Toulouse"
],
[
"Smaus",
"Jan-Georg",
"",
"IRIT,\n Université de Toulouse"
]
] |
new_dataset
| 0.997438 |
1709.02102
|
EPTCS
|
David M\"uller (Technische Universit\"at Dresden), Salomon Sickert
(Technische Universit\"at M\"unchen)
|
LTL to Deterministic Emerson-Lei Automata
|
In Proceedings GandALF 2017, arXiv:1709.01761
|
EPTCS 256, 2017, pp. 180-194
|
10.4204/EPTCS.256.13
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new translation from linear temporal logic (LTL) to
deterministic Emerson-Lei automata, which are omega-automata with a Muller
acceptance condition symbolically expressed as a Boolean formula. The richer
acceptance condition structure allows the shift of complexity from the state
space to the acceptance condition. Conceptually the construction is an enhanced
product construction that exploits knowledge of its components to reduce the
number of states. We identify two fragments of LTL, for which one can easily
construct deterministic automata and show how knowledge of these components can
reduce the number of states. We extend this idea to a general LTL framework,
where we can use arbitrary LTL to deterministic automata translators for parts
of formulas outside the mentioned fragments. Further, we show succinctness of
the translation compared to existing construction. The construction is
implemented in the tool Delag, which we evaluate on several benchmarks of LTL
formulas and probabilistic model checking case studies.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 06:58:10 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Müller",
"David",
"",
"Technische Universität Dresden"
],
[
"Sickert",
"Salomon",
"",
"Technische Universität München"
]
] |
new_dataset
| 0.999034 |
1709.02128
|
Martin Velas
|
Martin Velas, Michal Spanel, Michal Hradis and Adam Herout
|
CNN for Very Fast Ground Segmentation in Velodyne LiDAR Data
|
ICRA 2018 submission
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel method for ground segmentation in Velodyne point
clouds. We propose an encoding of sparse 3D data from the Velodyne sensor
suitable for training a convolutional neural network (CNN). This general
purpose approach is used for segmentation of the sparse point cloud into ground
and non-ground points. The LiDAR data are represented as a multi-channel 2D
signal where the horizontal axis corresponds to the rotation angle and the
vertical axis the indexes channels (i.e. laser beams). Multiple topologies of
relatively shallow CNNs (i.e. 3-5 convolutional layers) are trained and
evaluated using a manually annotated dataset we prepared. The results show
significant improvement of performance over the state-of-the-art method by
Zhang et al. in terms of speed and also minor improvements in terms of
accuracy.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 08:13:36 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Velas",
"Martin",
""
],
[
"Spanel",
"Michal",
""
],
[
"Hradis",
"Michal",
""
],
[
"Herout",
"Adam",
""
]
] |
new_dataset
| 0.989779 |
1709.02177
|
Cedomir Stefanovic
|
Cedomir Stefanovic, Francisco Lazaro, Petar Popovski
|
Frameless ALOHA with Reliability-Latency Guarantees
|
Accepted for presentation at IEEE Globecom 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the novelties brought by 5G is that wireless system design has
increasingly turned its focus on guaranteeing reliability and latency. This
shifts the design objective of random access protocols from throughput
optimization towards constraints based on reliability and latency. For this
purpose, we use frameless ALOHA, which relies on successive interference
cancellation (SIC), and derive its exact finite-length analysis of the
statistics of the unresolved users (reliability) as a function of the
contention period length (latency). The presented analysis can be used to
derive the reliability-latency guarantees. We also optimize the scheme
parameters in order to maximize the reliability within a given latency. Our
approach represents an important step towards the general area of design and
analysis of access protocols with reliability-latency guarantees.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 10:37:14 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Stefanovic",
"Cedomir",
""
],
[
"Lazaro",
"Francisco",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.986882 |
1709.02233
|
Philip Lundrigan
|
Philip Lundrigan, Kyeong Min, Neal Patwari, Sneha Kasera, Kerry Kelly,
Jimmy Moore, Miriah Meyer, Scott C. Collingwood, Flory Nkoy, Bryan Stone, and
Katherine Sward
|
EpiFi: An In-Home Sensor Network Architecture for Epidemiological
Studies
|
13 pages, 12 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design and build a system called EpiFi, which allows epidemiologists to
easily design and deploy experiments in homes. The focus of EpiFi is reducing
the barrier to entry for deploying and using an in-home sensor network. We
present a novel architecture for in-home sensor networks configured using a
single configuration file and provide: a fast and reliable method for device
discovery when installed in the home, a new mechanism for sensors to
authenticate over the air using a subject's home WiFi router, and data
reliability mechanisms to minimize loss in the network through a long-term
deployment. We work collaboratively with pediatric asthma researchers to design
three studies and deploy EpiFi in homes.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 13:45:52 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Lundrigan",
"Philip",
""
],
[
"Min",
"Kyeong",
""
],
[
"Patwari",
"Neal",
""
],
[
"Kasera",
"Sneha",
""
],
[
"Kelly",
"Kerry",
""
],
[
"Moore",
"Jimmy",
""
],
[
"Meyer",
"Miriah",
""
],
[
"Collingwood",
"Scott C.",
""
],
[
"Nkoy",
"Flory",
""
],
[
"Stone",
"Bryan",
""
],
[
"Sward",
"Katherine",
""
]
] |
new_dataset
| 0.999418 |
1709.02235
|
Shahar Tsiper Mr.
|
Shahar Tsiper, Or Dicker, Idan Kaizerman, Zeev Zohar, Mordechai Segev
and Yonina C. Eldar
|
Sparsity-Based Super Resolution for SEM Images
|
Final publication available at ACS Nano Letters
| null |
10.1021/acs.nanolett.7b02091
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The scanning electron microscope (SEM) produces an image of a sample by
scanning it with a focused beam of electrons. The electrons interact with the
atoms in the sample, which emit secondary electrons that contain information
about the surface topography and composition. The sample is scanned by the
electron beam point by point, until an image of the surface is formed. Since
its invention in 1942, SEMs have become paramount in the discovery and
understanding of the nanometer world, and today it is extensively used for both
research and in industry. In principle, SEMs can achieve resolution better than
one nanometer. However, for many applications, working at sub-nanometer
resolution implies an exceedingly large number of scanning points. For exactly
this reason, the SEM diagnostics of microelectronic chips is performed either
at high resolution (HR) over a small area or at low resolution (LR) while
capturing a larger portion of the chip. Here, we employ sparse coding and
dictionary learning to algorithmically enhance LR SEM images of microelectronic
chips up to the level of the HR images acquired by slow SEM scans, while
considerably reducing the noise. Our methodology consists of two steps: an
offline stage of learning a joint dictionary from a sequence of LR and HR
images of the same region in the chip, followed by a fast-online
super-resolution step where the resolution of a new LR image is enhanced. We
provide several examples with typical chips used in the microelectronics
industry, as well as a statistical study on arbitrary images with
characteristic structural features. Conceptually, our method works well when
the images have similar characteristics. This work demonstrates that employing
sparsity concepts can greatly improve the performance of SEM, thereby
considerably increasing the scanning throughput without compromising on
analysis quality and resolution.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 16:23:43 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Tsiper",
"Shahar",
""
],
[
"Dicker",
"Or",
""
],
[
"Kaizerman",
"Idan",
""
],
[
"Zohar",
"Zeev",
""
],
[
"Segev",
"Mordechai",
""
],
[
"Eldar",
"Yonina C.",
""
]
] |
new_dataset
| 0.997842 |
1709.02340
|
Muhammad R. A. Khandaker PhD
|
Muhammad R. A. Khandaker, Christos Masouros and Kai-Kit Wong
|
Secure Full-Duplex Device-to-Device Communication
|
Accepted in IEEE GLOBECOM 2017, Singapore, 4-8 Dec. 2017
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers full-duplex (FD) device-to-device (D2D) communications
in a downlink MISO cellular system in the presence of multiple eavesdroppers.
The D2D pair communicate sharing the same frequency band allocated to the
cellular users (CUs). Since the D2D users share the same frequency as the CUs,
both the base station (BS) and D2D transmissions interfere each other. In
addition, due to limited processing capability, D2D users are susceptible to
external attacks. Our aim is to design optimal beamforming and power control
mechanism to guarantee secure communication while delivering the required
quality-of-service (QoS) for the D2D link. In order to improve security,
artificial noise (AN) is transmitted by the BS. We design robust beamforming
for secure message as well as the AN in the worst-case sense for minimizing
total transmit power with imperfect channel state information (CSI) of all
links available at the BS. The problem is strictly non-convex with infinitely
many constraints. By discovering the hidden convexity of the problem, we derive
a rank-one optimal solution for the power minimization problem.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 16:33:15 GMT"
}
] | 2017-09-08T00:00:00 |
[
[
"Khandaker",
"Muhammad R. A.",
""
],
[
"Masouros",
"Christos",
""
],
[
"Wong",
"Kai-Kit",
""
]
] |
new_dataset
| 0.981029 |
1612.01840
|
Micha\"el Defferrard
|
Micha\"el Defferrard, Kirell Benzi, Pierre Vandergheynst and Xavier
Bresson
|
FMA: A Dataset For Music Analysis
|
ISMIR 2017 camera-ready
| null | null | null |
cs.SD cs.IR
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce the Free Music Archive (FMA), an open and easily accessible
dataset suitable for evaluating several tasks in MIR, a field concerned with
browsing, searching, and organizing large music collections. The community's
growing interest in feature and end-to-end learning is however restrained by
the limited availability of large audio datasets. The FMA aims to overcome this
hurdle by providing 917 GiB and 343 days of Creative Commons-licensed audio
from 106,574 tracks from 16,341 artists and 14,854 albums, arranged in a
hierarchical taxonomy of 161 genres. It provides full-length and high-quality
audio, pre-computed features, together with track- and user-level metadata,
tags, and free-form text such as biographies. We here describe the dataset and
how it was created, propose a train/validation/test split and three subsets,
discuss some suitable MIR tasks, and evaluate some baselines for genre
recognition. Code, data, and usage examples are available at
https://github.com/mdeff/fma
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2016 14:58:59 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 23:14:19 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Sep 2017 18:38:33 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Defferrard",
"Michaël",
""
],
[
"Benzi",
"Kirell",
""
],
[
"Vandergheynst",
"Pierre",
""
],
[
"Bresson",
"Xavier",
""
]
] |
new_dataset
| 0.999893 |
1703.09542
|
Yongzhe Zhang
|
Yongzhe Zhang, Hsiang-Shang Ko, Zhenjiang Hu
|
Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote
Data Access
|
12 pages, 10 figures, extended version of APLAS 2017 paper
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
Pregel is a popular distributed computing model for dealing with large-scale
graphs. However, it can be tricky to implement graph algorithms correctly and
efficiently in Pregel's vertex-centric model, especially when the algorithm has
multiple computation stages, complicated data dependencies, or even
communication over dynamic internal data structures. Some domain-specific
languages (DSLs) have been proposed to provide more intuitive ways to implement
graph algorithms, but due to the lack of support for remote access --- reading
or writing attributes of other vertices through references --- they cannot
handle the above mentioned dynamic communication, causing a class of Pregel
algorithms with fast convergence impossible to implement.
To address this problem, we design and implement Palgol, a more declarative
and powerful DSL which supports remote access. In particular, programmers can
use a more declarative syntax called chain access to naturally specify dynamic
communication as if directly reading data on arbitrary remote vertices. By
analyzing the logic patterns of chain access, we provide a novel algorithm for
compiling Palgol programs to efficient Pregel code. We demonstrate the power of
Palgol by using it to implement several practical Pregel algorithms, and the
evaluation result shows that the efficiency of Palgol is comparable with that
of hand-written code.
|
[
{
"version": "v1",
"created": "Tue, 28 Mar 2017 12:35:33 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Sep 2017 17:00:30 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Zhang",
"Yongzhe",
""
],
[
"Ko",
"Hsiang-Shang",
""
],
[
"Hu",
"Zhenjiang",
""
]
] |
new_dataset
| 0.997431 |
1704.02470
|
Andrey Ignatov
|
Andrey Ignatov, Nikolay Kobyshev, Radu Timofte, Kenneth Vanhoey, Luc
Van Gool
|
DSLR-Quality Photos on Mobile Devices with Deep Convolutional Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite a rapid rise in the quality of built-in smartphone cameras, their
physical limitations - small sensor size, compact lenses and the lack of
specific hardware, - impede them to achieve the quality results of DSLR
cameras. In this work we present an end-to-end deep learning approach that
bridges this gap by translating ordinary photos into DSLR-quality images. We
propose learning the translation function using a residual convolutional neural
network that improves both color rendition and image sharpness. Since the
standard mean squared loss is not well suited for measuring perceptual image
quality, we introduce a composite perceptual error function that combines
content, color and texture losses. The first two losses are defined
analytically, while the texture loss is learned in an adversarial fashion. We
also present DPED, a large-scale dataset that consists of real photos captured
from three different phones and one high-end reflex camera. Our quantitative
and qualitative assessments reveal that the enhanced image quality is
comparable to that of DSLR-taken photos, while the methodology is generalized
to any type of digital camera.
|
[
{
"version": "v1",
"created": "Sat, 8 Apr 2017 10:27:36 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Sep 2017 19:46:11 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Ignatov",
"Andrey",
""
],
[
"Kobyshev",
"Nikolay",
""
],
[
"Timofte",
"Radu",
""
],
[
"Vanhoey",
"Kenneth",
""
],
[
"Van Gool",
"Luc",
""
]
] |
new_dataset
| 0.98931 |
1704.04007
|
Thomas Westerb\"ack
|
Ragnar Freij-Hollanti, Camilla Hollanti, and Thomas Westerb\"ack
|
Matroid Theory and Storage Codes: Bounds and Constructions
|
Invited book chapter in Network Coding and Subspace Designs,
Springer, to appear
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent research on distributed storage systems (DSSs) has revealed
interesting connections between matroid theory and locally repairable codes
(LRCs). The goal of this chapter is to introduce the reader to matroids and
polymatroids, and illustrate their relation to distribute storage systems.
While many of the results are rather technical in nature, effort is made to
increase accessibility via simple examples. The chapter embeds all the
essential features of LRCs, namely locality, availability, and hierarchy
alongside with related generalised Singleton bounds.
|
[
{
"version": "v1",
"created": "Thu, 13 Apr 2017 06:34:54 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Sep 2017 20:52:42 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Freij-Hollanti",
"Ragnar",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Westerbäck",
"Thomas",
""
]
] |
new_dataset
| 0.999026 |
1706.08628
|
Shan Zhang
|
Shan Zhang, Ning Zhang, Xiaojie Fang, Peng Yang, Xuemin (Sherman) Shen
|
Self-Sustaining Caching Stations: Towards Cost-Effective 5G-Enabled
Vehicular Networks
|
IEEE Communications Magazine, to appear
| null |
10.1109/MCOM.2017.1700129
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we investigate the cost-effective 5G-enabled vehicular
networks to support emerging vehicular applications, such as autonomous
driving, in-car infotainment and location-based road services. To this end,
self-sustaining caching stations (SCSs) are introduced to liberate on-road base
stations from the constraints of power lines and wired backhauls. Specifically,
the cache-enabled SCSs are powered by renewable energy and connected to core
networks through wireless backhauls, which can realize "drop-and-play"
deployment, green operation, and low-latency services. With SCSs integrated, a
5G-enabled heterogeneous vehicular networking architecture is further proposed,
where SCSs are deployed along roadside for traffic offloading while
conventional macro base stations (MBSs) provide ubiquitous coverage to
vehicles. In addition, a hierarchical network management framework is designed
to deal with high dynamics in vehicular traffic and renewable energy, where
content caching, energy management and traffic steering are jointly
investigated to optimize the service capability of SCSs with balanced power
demand and supply in different time scales. Case studies are provided to
illustrate SCS deployment and operation designs, and some open research issues
are also discussed.
|
[
{
"version": "v1",
"created": "Mon, 26 Jun 2017 23:52:52 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Zhang",
"Shan",
"",
"Sherman"
],
[
"Zhang",
"Ning",
"",
"Sherman"
],
[
"Fang",
"Xiaojie",
"",
"Sherman"
],
[
"Yang",
"Peng",
"",
"Sherman"
],
[
"Xuemin",
"",
"",
"Sherman"
],
[
"Shen",
"",
""
]
] |
new_dataset
| 0.965776 |
1709.01618
|
Chris Tensmeyer
|
Chris Tensmeyer, Brian Davis, Curtis Wigington, Iain Lee, Bill Barrett
|
PageNet: Page Boundary Extraction in Historical Handwritten Documents
|
HIP 2017 (in submission)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When digitizing a document into an image, it is common to include a
surrounding border region to visually indicate that the entire document is
present in the image. However, this border should be removed prior to automated
processing. In this work, we present a deep learning based system, PageNet,
which identifies the main page region in an image in order to segment content
from both textual and non-textual border noise. In PageNet, a Fully
Convolutional Network obtains a pixel-wise segmentation which is post-processed
into the output quadrilateral region. We evaluate PageNet on 4 collections of
historical handwritten documents and obtain over 94% mean intersection over
union on all datasets and approach human performance on 2 of these collections.
Additionally, we show that PageNet can segment documents that are overlayed on
top of other documents.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 22:54:49 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Tensmeyer",
"Chris",
""
],
[
"Davis",
"Brian",
""
],
[
"Wigington",
"Curtis",
""
],
[
"Lee",
"Iain",
""
],
[
"Barrett",
"Bill",
""
]
] |
new_dataset
| 0.995823 |
1709.01761
|
EPTCS
|
Patricia Bouyer (LSV, CNRS & ENS de Cachan), Andrea Orlandini
(ISTC-CNR, Italy), Pierluigi San Pietro (DEIB, Politecnico di Milano)
|
Proceedings Eighth International Symposium on Games, Automata, Logics
and Formal Verification
| null |
EPTCS 256, 2017
|
10.4204/EPTCS.256
| null |
cs.GT cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Eighth International Symposium on
Games, Automata, Logic and Formal Verification (GandALF 2017). The symposium
took place in Roma, Italy, from the 20th to the 22nd of September 2017. The
GandALF symposium was established by a group of Italian computer scientists
interested in mathematical logic, automata theory, game theory, and their
applications to the specification, design, and verification of complex systems.
Its aim is to provide a forum where people from different areas, and possibly
with different backgrounds, can fruitfully interact. GandALF has a truly
international spirit, as witnessed by the composition of the program and
steering committee and by the country distribution of the submitted papers.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 10:58:27 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Bouyer",
"Patricia",
"",
"LSV, CNRS & ENS de Cachan"
],
[
"Orlandini",
"Andrea",
"",
"ISTC-CNR, Italy"
],
[
"Pietro",
"Pierluigi San",
"",
"DEIB, Politecnico di Milano"
]
] |
new_dataset
| 0.962268 |
1709.01795
|
Samira Briongos
|
Samira Briongos, Gorka Irazoqui, Pedro Malag\'on and Thomas Eisenbarth
|
CacheShield: Protecting Legacy Processes Against Cache Attacks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cache attacks pose a threat to any code whose execution flow or memory
accesses depend on sensitive information. Especially in public clouds, where
caches are shared across several tenants, cache attacks remain an unsolved
problem. Cache attacks rely on evictions by the spy process, which alter the
execution behavior of the victim process. We show that hardware performance
events of cryptographic routines reveal the presence of cache attacks. Based on
this observation, we propose CacheShield, a tool to protect legacy code by
monitoring its execution and detecting the presence of cache attacks, thus
providing the opportunity to take preventative measures. CacheShield can be run
by users and does not require alteration of the OS or hypervisor, while
previously proposed software-based countermeasures require cooperation from the
hypervisor. Unlike methods that try to detect malicious processes, our approach
is lean, as only a fraction of the system needs to be monitored. It also
integrates well into today's cloud infrastructure, as concerned users can opt
to use CacheShield without support from the cloud service provider. Our results
show that CacheShield detects cache attacks fast, with high reliability, and
with few false positives, even in the presence of strong noise.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 12:09:35 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Briongos",
"Samira",
""
],
[
"Irazoqui",
"Gorka",
""
],
[
"Malagón",
"Pedro",
""
],
[
"Eisenbarth",
"Thomas",
""
]
] |
new_dataset
| 0.998459 |
1709.01812
|
Gil Vernik
|
Gil Vernik, Michael Factor, Elliot K. Kolodner, Pietro Michiardi, Effi
Ofer, Francesco Pace
|
Stocator: A High Performance Object Store Connector for Spark
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Stocator, a high performance object store connector for Apache
Spark, that takes advantage of object store semantics. Previous connectors have
assumed file system semantics, in particular, achieving fault tolerance and
allowing speculative execution by creating temporary files to avoid
interference between worker threads executing the same task and then renaming
these files. Rename is not a native object store operation; not only is it not
atomic, but it is implemented using a costly copy operation and a delete.
Instead our connector leverages the inherent atomicity of object creation, and
by avoiding the rename paradigm it greatly decreases the number of operations
on the object store as well as enabling a much simpler approach to dealing with
the eventually consistent semantics typical of object stores. We have
implemented Stocator and shared it in open source. Performance testing shows
that it is as much as 18 times faster for write intensive workloads and
performs as much as 30 times fewer operations on the object store than the
legacy Hadoop connectors, reducing costs both for the client and the object
storage service provider.
|
[
{
"version": "v1",
"created": "Tue, 8 Aug 2017 06:02:03 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Vernik",
"Gil",
""
],
[
"Factor",
"Michael",
""
],
[
"Kolodner",
"Elliot K.",
""
],
[
"Michiardi",
"Pietro",
""
],
[
"Ofer",
"Effi",
""
],
[
"Pace",
"Francesco",
""
]
] |
new_dataset
| 0.99917 |
1709.01848
|
Andrew Yates
|
Andrew Yates, Arman Cohan, Nazli Goharian
|
Depression and Self-Harm Risk Assessment in Online Forums
|
Expanded version of EMNLP17 paper. Added sections 6.1, 6.2, 6.4,
FastText baseline, and CNN-R
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Users suffering from mental health conditions often turn to online resources
for support, including specialized online support communities or general
communities such as Twitter and Reddit. In this work, we present a neural
framework for supporting and studying users in both types of communities. We
propose methods for identifying posts in support communities that may indicate
a risk of self-harm, and demonstrate that our approach outperforms strong
previously proposed methods for identifying such posts. Self-harm is closely
related to depression, which makes identifying depressed users on general
forums a crucial related task. We introduce a large-scale general forum dataset
("RSDD") consisting of users with self-reported depression diagnoses matched
with control users. We show how our method can be applied to effectively
identify depressed users from their use of language alone. We demonstrate that
our method outperforms strong baselines on this general forum dataset.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 14:50:42 GMT"
}
] | 2017-09-07T00:00:00 |
[
[
"Yates",
"Andrew",
""
],
[
"Cohan",
"Arman",
""
],
[
"Goharian",
"Nazli",
""
]
] |
new_dataset
| 0.998354 |
1305.2545
|
Aleksandrs Slivkins
|
Ashwinkumar Badanidiyuru, Robert Kleinberg and Aleksandrs Slivkins
|
Bandits with Knapsacks
|
An extended abstract of this work has appeared in the 54th IEEE
Symposium on Foundations of Computer Science (FOCS 2013). 55 pages. Compared
to the initial "full version" from May'13, this version has a significantly
revised presentation and reflects the current status of the follow-up work.
Also, this version contains a stronger regret bound in one of the main
results
| null |
10.1109/FOCS.2013.30
| null |
cs.DS cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-armed bandit problems are the predominant theoretical model of
exploration-exploitation tradeoffs in learning, and they have countless
applications ranging from medical trials, to communication networks, to Web
search and advertising. In many of these application domains the learner may be
constrained by one or more supply (or budget) limits, in addition to the
customary limitation on the time horizon. The literature lacks a general model
encompassing these sorts of problems. We introduce such a model, called
"bandits with knapsacks", that combines aspects of stochastic integer
programming with online learning. A distinctive feature of our problem, in
comparison to the existing regret-minimization literature, is that the optimal
policy for a given latent distribution may significantly outperform the policy
that plays the optimal fixed arm. Consequently, achieving sublinear regret in
the bandits-with-knapsacks problem is significantly more challenging than in
conventional bandit problems.
We present two algorithms whose reward is close to the information-theoretic
optimum: one is based on a novel "balanced exploration" paradigm, while the
other is a primal-dual algorithm that uses multiplicative updates. Further, we
prove that the regret achieved by both algorithms is optimal up to
polylogarithmic factors. We illustrate the generality of the problem by
presenting applications in a number of different domains including electronic
commerce, routing, and scheduling. As one example of a concrete application, we
consider the problem of dynamic posted pricing with limited supply and obtain
the first algorithm whose regret, with respect to the optimal dynamic policy,
is sublinear in the supply.
|
[
{
"version": "v1",
"created": "Sat, 11 May 2013 21:50:46 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Jun 2013 21:13:51 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Aug 2013 13:52:46 GMT"
},
{
"version": "v4",
"created": "Mon, 20 Oct 2014 19:24:09 GMT"
},
{
"version": "v5",
"created": "Wed, 24 Jun 2015 16:43:30 GMT"
},
{
"version": "v6",
"created": "Fri, 31 Jul 2015 18:36:51 GMT"
},
{
"version": "v7",
"created": "Sat, 17 Jun 2017 18:59:24 GMT"
},
{
"version": "v8",
"created": "Tue, 5 Sep 2017 14:00:33 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Badanidiyuru",
"Ashwinkumar",
""
],
[
"Kleinberg",
"Robert",
""
],
[
"Slivkins",
"Aleksandrs",
""
]
] |
new_dataset
| 0.999575 |
1610.07458
|
Kevin Ryczko
|
Kevin Ryczko, Adam Domurad, Nicholas Buhagiar, Isaac Tamblyn
|
Hashkat: Large-scale simulations of online social networks
| null | null |
10.1007/s13278-017-0424-7
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hashkat (http://hashkat.org) is a free, open source, agent based simulation
software package designed to simulate large-scale online social networks (e.g.
Twitter, Facebook, LinkedIn, etc). It allows for dynamic agent generation, edge
creation, and information propagation. The purpose of hashkat is to study the
growth of online social networks and how information flows within them. Like
real life online social networks, hashkat incorporates user relationships,
information diffusion, and trending topics. Hashkat was implemented in C++, and
was designed with extensibility in mind. The software includes Shell and Python
scripts for easy installation and usability. In this report, we describe all of
the algorithms and features integrated into hashkat before moving on to example
use cases. In general, hashkat can be used to understand the underlying
topology of social networks, validate sampling methods of such networks,
develop business strategy for advertising on online social networks, and test
new features of an online social network before going into production.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 15:32:07 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Ryczko",
"Kevin",
""
],
[
"Domurad",
"Adam",
""
],
[
"Buhagiar",
"Nicholas",
""
],
[
"Tamblyn",
"Isaac",
""
]
] |
new_dataset
| 0.956945 |
1611.09914
|
Vitaly Skachek
|
Vitaly Skachek
|
Batch and PIR Codes and Their Connections to Locally Repairable Codes
|
Survey
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this survey, two related families of codes are discussed: batch codes and
codes for private information retrieval. These two families can be viewed as
natural generalizations of locally repairable codes, which were extensively
studied in the context of coding for fault tolerance in distributed data
storage systems. Bounds on the parameters of the codes, as well as basic
constructions, are presented. Connections between different code families are
discussed.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 22:17:24 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Mar 2017 13:30:18 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Jun 2017 11:47:20 GMT"
},
{
"version": "v4",
"created": "Tue, 5 Sep 2017 14:35:35 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.99977 |
1708.08510
|
Peter Snyder
|
Peter Snyder, Cynthia Taylor, Chris Kanich
|
Most Websites Don't Need to Vibrate: A Cost-Benefit Approach to
Improving Browser Security
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern web browsers have accrued an incredibly broad set of features since
being invented for hypermedia dissemination in 1990. Many of these features
benefit users by enabling new types of web applications. However, some features
also bring risk to users' privacy and security, whether through implementation
error, unexpected composition, or unintended use. Currently there is no general
methodology for weighing these costs and benefits. Restricting access to only
the features which are necessary for delivering desired functionality on a
given website would allow users to enforce the principle of lease privilege on
use of the myriad APIs present in the modern web browser.
However, security benefits gained by increasing restrictions must be balanced
against the risk of breaking existing websites. This work addresses this
problem with a methodology for weighing the costs and benefits of giving
websites default access to each browser feature. We model the benefit as the
number of websites that require the feature for some user-visible benefit, and
the cost as the number of CVEs, lines of code, and academic attacks related to
the functionality. We then apply this methodology to 74 Web API standards
implemented in modern browsers. We find that allowing websites default access
to large parts of the Web API poses significant security and privacy risks,
with little corresponding benefit.
We also introduce a configurable browser extension that allows users to
selectively restrict access to low-benefit, high-risk features on a per site
basis. We evaluated our extension with two hardened browser configurations, and
found that blocking 15 of the 74 standards avoids 52.0% of code paths related
to previous CVEs, and 50.0% of implementation code identified by our metric,
without affecting the functionality of 94.7% of measured websites.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 20:26:51 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Sep 2017 01:30:26 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Snyder",
"Peter",
""
],
[
"Taylor",
"Cynthia",
""
],
[
"Kanich",
"Chris",
""
]
] |
new_dataset
| 0.981067 |
1709.01070
|
Pavel Surynek
|
Marika Ivanov\'a, Pavel Surynek, Diep Thi Ngoc Nguyen
|
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios
with Adversarial Agents
|
arXiv admin note: substantial text overlap with arXiv:1708.07285
| null | null | null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address a problem of area protection in graph-based scenarios with
multiple mobile agents where connectivity is maintained among agents to ensure
they can communicate. The problem consists of two adversarial teams of agents
that move in an undirected graph shared by both teams. Agents are placed in
vertices of the graph; at most one agent can occupy a vertex; and they can move
into adjacent vertices in a conflict free way. Teams have asymmetric goals: the
aim of one team - attackers - is to invade into given area while the aim of the
opponent team - defenders - is to protect the area from being entered by
attackers by occupying selected vertices. The team of defenders need to
maintain connectivity of vertices occupied by its own agents in a visibility
graph. The visibility graph models possibility of communication between pairs
of vertices.
We study strategies for allocating vertices to be occupied by the team of
defenders to block attacking agents where connectivity is maintained at the
same time. To do this we reserve a subset of defending agents that do not try
to block the attackers but instead are placed to support connectivity of the
team. The performance of strategies is tested in multiple benchmarks. The
success of a strategy is heavily dependent on the type of the instance, and so
one of the contributions of this work is that we identify suitable strategies
for diverse instance types.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 07:38:17 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Ivanová",
"Marika",
""
],
[
"Surynek",
"Pavel",
""
],
[
"Nguyen",
"Diep Thi Ngoc",
""
]
] |
new_dataset
| 0.991357 |
1709.01105
|
Ravi Kadlimatti
|
Ravi Kadlimatti and Adly T. Fam
|
Good Code Sets from Complementary Pairs via Discrete Frequency Chips
| null |
Kadlimatti, Ravi, and Adly T. Fam. "Good Code Sets from
Complementary Pairs via Discrete Frequency Chips." Aerospace 4.2 (2017): 28
|
10.3390/aerospace4020028
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
It is shown that replacing the sinusoidal chip in Golay complementary code
pairs by special classes of waveforms that satisfy two conditions,
symmetry/anti-symmetry and quazi-orthogonality in the convolution sense,
renders the complementary codes immune to frequency selective fading and also
allows for concatenating them in time using one frequency band/channel. This
results in a zero-sidelobe region around the mainlobe and an adjacent region of
small cross-correlation sidelobes. The symmetry/anti-symmetry property results
in the zero-sidelobe region on either side of the mainlobe, while
quasi-orthogonality of the two chips keeps the adjacent region of
cross-correlations small. Such codes are constructed using discrete
frequency-coding waveforms (DFCW) based on linear frequency modulation (LFM)
and piecewise LFM (PLFM) waveforms as chips for the complementary code pair, as
they satisfy both the symmetry/anti-symmetry and quasi-orthogonality
conditions. It is also shown that changing the slopes/chirp rates of the DFCW
waveforms (based on LFM and PLFM waveforms) used as chips with the same
complementary code pair results in good code sets with a zero-sidelobe region.
It is also shown that a second good code set with a zero-sidelobe region could
be constructed from the mates of the complementary code pair, while using the
same DFCW waveforms as their chips. The cross-correlation between the two sets
is shown to contain a zero-sidelobe region and an adjacent region of small
cross-correlation sidelobes. Thus, the two sets are quasi-orthogonal and could
be combined to form a good code set with twice the number of codes without
affecting their cross-correlation properties. Or a better good code set with
the same number codes could be constructed by choosing the best candidates form
the two sets. Such code sets find utility in multiple input-multiple output
(MIMO) radar applications.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 18:18:34 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Kadlimatti",
"Ravi",
""
],
[
"Fam",
"Adly T.",
""
]
] |
new_dataset
| 0.998589 |
1709.01241
|
Jayson Lynch
|
Erik D. Demaine, Isaac Grosof, Jayson Lynch
|
Push-Pull Block Puzzles are Hard
|
Full version of CIAC 2017 paper. 17 pages
|
Algorithms and Complexity: 10th International Conference, CIAC
2017, Athens, Greece, May 24-26, 2017, Proceedings
|
10.1007/978-3-319-57586-516
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to
solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve,
settling an open question by Zubaran and Ritt. Push-pull block puzzles are a
type of recreational motion planning problem, similar to Sokoban, that involve
moving a `robot' on a square grid with $1 \times 1$ obstacles. The obstacles
cannot be traversed by the robot, but some can be pushed and pulled by the
robot into adjacent squares. Thin walls prevent movement between two adjacent
squares. This work follows in a long line of algorithms and complexity work on
similar problems. The 2D push-pull block puzzle shows up in the video games
Pukoban as well as The Legend of Zelda: A Link to the Past, giving another
proof of hardness for the latter. This variant of block-pushing puzzles is of
particular interest because of its connections to reversibility, since any
action (e.g., push or pull) can be inverted by another valid action (e.g., pull
or push).
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 05:42:05 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Grosof",
"Isaac",
""
],
[
"Lynch",
"Jayson",
""
]
] |
new_dataset
| 0.996937 |
1709.01320
|
Ahmadreza Montazerolghaem
|
Ahmadreza Montazerolghaem, Mohammad Hossein Yaghmaee, Alberto
Leon-Garcia
|
OpenSIP: Toward Software-Defined SIP Networking
|
IEEE Transactions on Network and Service Management, vol. PP, no. 99,
pp. 1-1. keywords: {Databases;IP networks;Resource management;Routing;Routing
protocols;Servers;OpenFlow.;SDN and NFV orchestration;SIP Network
management;SIP Resource Allocation;SIP Routing}
| null |
10.1109/TNSM.2017.2741258
|
Print ISSN: 1932-4537
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
VoIP is becoming a low-priced and efficient replacement for PSTN in
communication industries. With a widely growing adoption rate, SIP is an
application layer signaling protocol, standardized by the IETF, for creating,
modifying, and terminating VoIP sessions. Generally speaking, SIP routes a call
request to its destination by using SIP proxies. With the increasing use of
SIP, traditional configurations pose certain drawbacks, such as ineffective
routing, un-optimized management of proxy resources (including CPU and memory),
and overload conditions. This paper presents OpenSIP to upgrade the SIP network
framework with emerging technologies, such as SDN and NFV. SDN provides for
management that decouples the data and control planes along with a
software-based centralized control that results in effective routing and
resource management. Moreover, NFV assists SDN by virtualizing various network
devices and functions. However, current SDN elements limit the inspected fields
to layer 2-4 headers, whereas SIP routing information resides in the layer-7
header. A benefit of OpenSIP is that it enforces policies on SIP networking
that are agnostic to higher layers with the aid of a Deep Packet Inspection
(DPI) engine. Among the benefits of OpenSIP is programmability, cost reduction,
unified management, routing, as well as efficient load balancing. The present
study implements OpenSIP on a real testbed which includes Open vSwitch and the
Floodlight controller. The results show that the proposed architecture has a
low overhead and satisfactory performance and, in addition, can take advantage
of a flexible scale-out design during application deployment.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 10:18:56 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Montazerolghaem",
"Ahmadreza",
""
],
[
"Yaghmaee",
"Mohammad Hossein",
""
],
[
"Leon-Garcia",
"Alberto",
""
]
] |
new_dataset
| 0.990388 |
1709.01321
|
Rajdeep Dutta
|
Rajdeep Dutta, Chunjiang Qian, Liang Sun, Daniel Pack
|
A Generic Formation Controller and State Observer for Multiple Unmanned
Systems
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel decentralized controller to drive multiple
unmanned aerial vehicles (UAVs) into a symmetric formation of regular polygon
shape surrounding a mobile target. The proposed controller works for
time-varying information exchange topologies among agents and preserves a
network connectivity while steering UAVs into a formation. The proposed
nonlinear controller is highly generalized and offers flexibility in achieving
the control objective due to the freedom of choosing controller parameters from
a range of values. By the virtue of additional tuning parameters, i.e.
fractional powers on proportional and derivative difference terms, the
nonlinear controller procures a family of UAV trajectories satisfying the same
control objective. An appropriate adjustment of the parameters facilitates in
generating smooth UAV trajectories without causing abrupt position jumps. The
convergence of the closed-loop system is analyzed and established using the
Lyapunov approach. Simulation results validate the effectiveness of the
proposed controller which outperforms an existing formation controller by
driving a team of UAVs elegantly in a target-centric formation. We also present
a nonlinear observer to estimate vehicle velocities with the availability of
position coordinates and heading angles. Simulation results show that the
proposed nonlinear observer results in quick convergence of the estimates to
its true values.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 10:21:06 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Dutta",
"Rajdeep",
""
],
[
"Qian",
"Chunjiang",
""
],
[
"Sun",
"Liang",
""
],
[
"Pack",
"Daniel",
""
]
] |
new_dataset
| 0.977263 |
1709.01347
|
Elisabeth de Carvalho
|
Elisabeth de Carvalho, Emil Bj\"ornson, Jesper H. S{\o}rensen, Erik G.
Larsson, Petar Popovski
|
Random Pilot and Data Access in Massive MIMO for Machine-type
Communications
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A massive MIMO system, represented by a base station with hundreds of
antennas, is capable of spatially multiplexing many devices and thus naturally
suited to serve dense crowds of wireless devices in emerging applications, such
as machine-type communications. Crowd scenarios pose new challenges in the
pilot-based acquisition of channel state information and call for pilot access
protocols that match the intermittent pattern of device activity. A joint pilot
assignment and data transmission protocol based on random access is proposed in
this paper for the uplink of a massive MIMO system. The protocol relies on the
averaging across multiple transmission slots of the pilot collision events that
result from the random access process. We derive new uplink sum rate
expressions that take pilot collisions, intermittent device activity, and
interference into account. Simplified bounds are obtained and used to optimize
the device activation probability and pilot length. A performance analysis
indicates how performance scales as a function of the number of antennas and
the transmission slot duration.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 12:26:21 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"de Carvalho",
"Elisabeth",
""
],
[
"Björnson",
"Emil",
""
],
[
"Sørensen",
"Jesper H.",
""
],
[
"Larsson",
"Erik G.",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.99892 |
1709.01438
|
Pedro Neto
|
Mohammad Safeea, Pedro Neto
|
KUKA Sunrise Toolbox: Interfacing Collaborative Robots with MATLAB
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Collaborative robots are increasingly present in our lives. The KUKA LBR iiwa
equipped with the KUKA Sunrise.OS controller is a good example of a
collaborative/sensitive robot. This paper presents a MATLAB Toolbox, the KUKA
Sunrise Toolbox (KST), to interface KUKA Sunrise.OS using MATLAB. The KST
contains functionalities for networking, real-time control, point-to-point
motion, setters and getters of parameters and physical interaction. KST
includes more than 50 functions and runs on a remote computer connected with
the KUKA Sunrise controller via transmission control Protocol/Internet Protocol
(TCP/IP). The KST potentialities are demonstrated in three use cases.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 15:02:31 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Safeea",
"Mohammad",
""
],
[
"Neto",
"Pedro",
""
]
] |
new_dataset
| 0.956969 |
1709.01459
|
David Joseph Tan
|
David Joseph Tan and Nassir Navab and Federico Tombari
|
6D Object Pose Estimation with Depth Images: A Seamless Approach for
Robotic Interaction and Augmented Reality
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To determine the 3D orientation and 3D location of objects in the
surroundings of a camera mounted on a robot or mobile device, we developed two
powerful algorithms in object detection and temporal tracking that are combined
seamlessly for robotic perception and interaction as well as Augmented Reality
(AR). A separate evaluation of, respectively, the object detection and the
temporal tracker demonstrates the important stride in research as well as the
impact on industrial robotic applications and AR. When evaluated on a standard
dataset, the detector produced the highest f1-score with a large margin while
the tracker generated the best accuracy at a very low latency of approximately
2 ms per frame with one CPU core: both algorithms outperforming the state of
the art. When combined, we achieve a powerful framework that is robust to
handle multiple instances of the same object under occlusion and clutter while
attaining real-time performance. Aiming at stepping beyond the simple scenarios
used by current systems, often constrained by having a single object in absence
of clutter, averting to touch the object to prevent close-range partial
occlusion, selecting brightly colored objects to easily segment them
individually or assuming that the object has simple geometric structure, we
demonstrate the capacity to handle challenging cases under clutter, partial
occlusion and varying lighting conditions with objects of different shapes and
sizes.
|
[
{
"version": "v1",
"created": "Tue, 5 Sep 2017 15:38:26 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Tan",
"David Joseph",
""
],
[
"Navab",
"Nassir",
""
],
[
"Tombari",
"Federico",
""
]
] |
new_dataset
| 0.999716 |
1709.01493
|
Monika Rani
|
Monika Rani and O. P. Vyas
|
Smart Bike Sharing System to make the City even Smarter
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These last years with the growing population in the smart city demands an
efficient transportation sharing (bike sharing) system for developing the smart
city. The Bike sharing as we know is affordable, easily accessible and reliable
mode of transportation. But an efficient bike sharing capable of not only
sharing bike also provides information regarding the availability of bike per
station, route business, time/day-wise bike schedule. The embedded sensors are
able to opportunistically communicate through wireless communication with
stations when available, providing real-time data about tours/minutes, speed,
effort, rhythm, etc. We have been based on our study analysis data to predict
regarding the bike's available at stations, bike schedule, a location of the
nearest hub where a bike is available etc., reduce the user time and effort.
|
[
{
"version": "v1",
"created": "Sat, 5 Aug 2017 08:46:47 GMT"
}
] | 2017-09-06T00:00:00 |
[
[
"Rani",
"Monika",
""
],
[
"Vyas",
"O. P.",
""
]
] |
new_dataset
| 0.997345 |
1410.5926
|
Huaizu Jiang
|
Huaizu Jiang, Zejian Yuan, Ming-Ming Cheng, Yihong Gong, Nanning
Zheng, Jingdong Wang
|
Salient Object Detection: A Discriminative Regional Feature Integration
Approach
| null | null |
10.1007/s11263-016-0977-3
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Salient object detection has been attracting a lot of interest, and recently
various heuristic computational models have been designed. In this paper, we
formulate saliency map computation as a regression problem. Our method, which
is based on multi-level image segmentation, utilizes the supervised learning
approach to map the regional feature vector to a saliency score. Saliency
scores across multiple levels are finally fused to produce the saliency map.
The contributions lie in two-fold. One is that we propose a discriminate
regional feature integration approach for salient object detection. Compared
with existing heuristic models, our proposed method is able to automatically
integrate high-dimensional regional saliency features and choose discriminative
ones. The other is that by investigating standard generic region properties as
well as two widely studied concepts for salient object detection, i.e.,
regional contrast and backgroundness, our approach significantly outperforms
state-of-the-art methods on six benchmark datasets. Meanwhile, we demonstrate
that our method runs as fast as most existing algorithms.
|
[
{
"version": "v1",
"created": "Wed, 22 Oct 2014 07:05:38 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Jiang",
"Huaizu",
""
],
[
"Yuan",
"Zejian",
""
],
[
"Cheng",
"Ming-Ming",
""
],
[
"Gong",
"Yihong",
""
],
[
"Zheng",
"Nanning",
""
],
[
"Wang",
"Jingdong",
""
]
] |
new_dataset
| 0.996083 |
1606.05982
|
Lawrence Ong
|
Lawrence Ong
|
Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer
Receivers
|
Author final manuscript
| null |
10.1109/TIT.2017.2748562
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Index coding models broadcast networks in which a sender sends different
messages to different receivers simultaneously, where each receiver may know
some of the messages a priori. The aim is to find the minimum (normalised)
index codelength that the sender sends. This paper considers unicast index
coding, where each receiver requests exactly one message, and each message is
requested by exactly one receiver. Each unicast index-coding instances can be
fully described by a directed graph and vice versa, where each vertex
corresponds to one receiver. For any directed graph representing a unicast
index-coding instance, we show that if a maximum acyclic induced subgraph
(MAIS) is obtained by removing two or fewer vertices from the graph, then the
minimum index codelength equals the number of vertices in the MAIS, and linear
codes are optimal for the corresponding index-coding instance. Using this
result, we solved all unicast index-coding instances with up to five receivers,
which correspond to all graphs with up to five vertices. For 9819
non-isomorphic graphs among all graphs up to five vertices, we obtained the
minimum index codelength for all message alphabet sizes; for the remaining 28
graphs, we obtained the minimum index codelength if the message alphabet size
is $k^2$ for any positive integer $k$. This work complements the result by
Arbabjolfaei et al. (ISIT 2013), who solved all unicast index-coding instances
with up to five receivers in the asymptotic regime, where the message alphabet
size tends to infinity.
|
[
{
"version": "v1",
"created": "Mon, 20 Jun 2016 06:28:57 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Sep 2017 00:06:00 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Ong",
"Lawrence",
""
]
] |
new_dataset
| 0.999592 |
1701.07616
|
Valerio Bioglio
|
Valerio Bioglio, Frederic Gabry, Ingmar Land, Jean-Claude Belfiore
|
Minimum-Distance Based Construction of Multi-Kernel Polar Codes
|
to appear in IEEE Globecom 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a construction for multi-kernel polar codes based
on the maximization of the minimum distance. Compared to the original
construction based on density evolution, our new design shows particular
advantages for short code lengths, where the polarization effect has less
impact on the performance than the distances of the code. We introduce and
compute the minimum-distance profile and provide a simple greedy algorithm for
the code design. Compared to state-of-the-art punctured or shortened Arikan
polar codes, multi-kernel polar codes with our new design show significantly
improved error-rate performance.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 08:47:04 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Sep 2017 10:06:20 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Bioglio",
"Valerio",
""
],
[
"Gabry",
"Frederic",
""
],
[
"Land",
"Ingmar",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.992003 |
1702.01815
|
Gemma Boleda
|
Gemma Boleda, Sebastian Pad\'o, Nghia The Pham, Marco Baroni
|
Living a discrete life in a continuous world: Reference with distributed
representations
|
Accepted at IWCS 2017. Final version, 9 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reference is a crucial property of language that allows us to connect
linguistic expressions to the world. Modeling it requires handling both
continuous and discrete aspects of meaning. Data-driven models excel at the
former, but struggle with the latter, and the reverse is true for symbolic
models.
This paper (a) introduces a concrete referential task to test both aspects,
called cross-modal entity tracking; (b) proposes a neural network architecture
that uses external memory to build an entity library inspired in the DRSs of
DRT, with a mechanism to dynamically introduce new referents or add information
to referents that are already in the library.
Our model shows promise: it beats traditional neural network architectures on
the task. However, it is still outperformed by Memory Networks, another model
with external memory.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 22:50:49 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Sep 2017 08:44:28 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Boleda",
"Gemma",
""
],
[
"Padó",
"Sebastian",
""
],
[
"Pham",
"Nghia The",
""
],
[
"Baroni",
"Marco",
""
]
] |
new_dataset
| 0.994876 |
1707.09468
|
Rowan Zellers
|
Rowan Zellers, Yejin Choi
|
Zero-Shot Activity Recognition with Verb Attribute Induction
|
accepted to EMNLP 2017
| null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate large-scale zero-shot activity recognition by
modeling the visual and linguistic attributes of action verbs. For example, the
verb "salute" has several properties, such as being a light movement, a social
act, and short in duration. We use these attributes as the internal mapping
between visual and textual representations to reason about a previously unseen
action. In contrast to much prior work that assumes access to gold standard
attributes for zero-shot classes and focuses primarily on object attributes,
our model uniquely learns to infer action attributes from dictionary
definitions and distributed word representations. Experimental results confirm
that action attributes inferred from language can provide a predictive signal
for zero-shot prediction of previously unseen activities.
|
[
{
"version": "v1",
"created": "Sat, 29 Jul 2017 06:05:52 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Sep 2017 19:53:20 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Zellers",
"Rowan",
""
],
[
"Choi",
"Yejin",
""
]
] |
new_dataset
| 0.957525 |
1708.01967
|
Kai Shu
|
Kai Shu, Amy Sliva, Suhang Wang, Jiliang Tang, Huan Liu
|
Fake News Detection on Social Media: A Data Mining Perspective
|
ACM SIGKDD Explorations Newsletter, 2017
| null | null | null |
cs.SI cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media for news consumption is a double-edged sword. On the one hand,
its low cost, easy access, and rapid dissemination of information lead people
to seek out and consume news from social media. On the other hand, it enables
the wide spread of "fake news", i.e., low quality news with intentionally false
information. The extensive spread of fake news has the potential for extremely
negative impacts on individuals and society. Therefore, fake news detection on
social media has recently become an emerging research that is attracting
tremendous attention. Fake news detection on social media presents unique
characteristics and challenges that make existing detection algorithms from
traditional news media ineffective or not applicable. First, fake news is
intentionally written to mislead readers to believe false information, which
makes it difficult and nontrivial to detect based on news content; therefore,
we need to include auxiliary information, such as user social engagements on
social media, to help make a determination. Second, exploiting this auxiliary
information is challenging in and of itself as users' social engagements with
fake news produce data that is big, incomplete, unstructured, and noisy.
Because the issue of fake news detection on social media is both challenging
and relevant, we conducted this survey to further facilitate research on the
problem. In this survey, we present a comprehensive review of detecting fake
news on social media, including fake news characterizations on psychology and
social theories, existing algorithms from a data mining perspective, evaluation
metrics and representative datasets. We also discuss related research areas,
open problems, and future research directions for fake news detection on social
media.
|
[
{
"version": "v1",
"created": "Mon, 7 Aug 2017 02:29:09 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Aug 2017 00:25:03 GMT"
},
{
"version": "v3",
"created": "Sun, 3 Sep 2017 02:40:05 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Shu",
"Kai",
""
],
[
"Sliva",
"Amy",
""
],
[
"Wang",
"Suhang",
""
],
[
"Tang",
"Jiliang",
""
],
[
"Liu",
"Huan",
""
]
] |
new_dataset
| 0.998612 |
1708.07985
|
Alessio Arleo
|
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
|
GiViP: A Visual Profiler for Distributed Graph Processing Systems
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analyzing large-scale graphs provides valuable insights in different
application scenarios. While many graph processing systems working on top of
distributed infrastructures have been proposed to deal with big graphs, the
tasks of profiling and debugging their massive computations remain time
consuming and error-prone. This paper presents GiViP, a visual profiler for
distributed graph processing systems based on a Pregel-like computation model.
GiViP captures the huge amount of messages exchanged throughout a computation
and provides an interactive user interface for the visual analysis of the
collected data. We show how to take advantage of GiViP to detect anomalies
related to the computation and to the infrastructure, such as slow computing
units and anomalous message patterns.
|
[
{
"version": "v1",
"created": "Sat, 26 Aug 2017 15:30:03 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Sep 2017 15:28:25 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Arleo",
"Alessio",
""
],
[
"Didimo",
"Walter",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.998077 |
1708.09603
|
Pascal Giard
|
Pascal Giard, Alexios Balatsoukas-Stimming, Thomas Christoph M\"uller,
Andrea Bonetti, Claude Thibeault, Warren J. Gross, Philippe Flatresse,
Andreas Burg
|
PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes
|
12 pages, 12 figures, 5 tables, to appear in IEEE Journal on Emerging
and Selected Topics in Circuits and Systems
| null |
10.1109/JETCAS.2017.2745704
| null |
cs.AR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a recently proposed class of block codes that provably
achieve the capacity of various communication channels. They received a lot of
attention as they can do so with low-complexity encoding and decoding
algorithms, and they have an explicit construction. Their recent inclusion in a
5G communication standard will only spur more research. However, only a couple
of ASICs featuring decoders for polar codes were fabricated, and none of them
implements a list-based decoding algorithm. In this paper, we present ASIC
measurement results for a fabricated 28 nm CMOS chip that implements two
different decoders: the first decoder is tailored toward error-correction
performance and flexibility. It supports any code rate as well as three
different decoding algorithms: successive cancellation (SC), SC flip and SC
list (SCL). The flexible decoder can also decode both non-systematic and
systematic polar codes. The second decoder targets speed and energy efficiency.
We present measurement results for the first silicon-proven SCL decoder, where
its coded throughput is shown to be of 306.8 Mbps with a latency of 3.34 us and
an energy per bit of 418.3 pJ/bit at a clock frequency of 721 MHz for a supply
of 1.3 V. The energy per bit drops down to 178.1 pJ/bit with a more modest
clock frequency of 308 MHz, lower throughput of 130.9 Mbps and a reduced supply
voltage of 0.9 V. For the other two operating modes, the energy per bit is
shown to be of approximately 95 pJ/bit. The less flexible high-throughput
unrolled decoder can achieve a coded throughput of 9.2 Gbps and a latency of
628 ns for a measured energy per bit of 1.15 pJ/bit at 451 MHz.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 08:03:19 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Sep 2017 09:01:53 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Giard",
"Pascal",
""
],
[
"Balatsoukas-Stimming",
"Alexios",
""
],
[
"Müller",
"Thomas Christoph",
""
],
[
"Bonetti",
"Andrea",
""
],
[
"Thibeault",
"Claude",
""
],
[
"Gross",
"Warren J.",
""
],
[
"Flatresse",
"Philippe",
""
],
[
"Burg",
"Andreas",
""
]
] |
new_dataset
| 0.999852 |
1709.00525
|
Hang Li
|
Hang Li
|
Sensor Network Based Collision-Free Navigation and Map Building for
Mobile Robots
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Safe robot navigation is a fundamental research field for autonomous robots
including ground mobile robots and flying robots. The primary objective of a
safe robot navigation algorithm is to guide an autonomous robot from its
initial position to a target or along a desired path with obstacle avoidance.
With the development of information technology and sensor technology, the
implementations combining robotics with sensor network are focused on in the
recent researches. One of the relevant implementations is the sensor network
based robot navigation. Moreover, another important navigation problem of
robotics is safe area search and map building. In this report, a global
collision-free path planning algorithm for ground mobile robots in dynamic
environments is presented firstly. Considering the advantages of sensor
network, the presented path planning algorithm is developed to a sensor network
based navigation algorithm for ground mobile robots. The 2D range finder sensor
network is used in the presented method to detect static and dynamic obstacles.
The sensor network can guide each ground mobile robot in the detected safe area
to the target. Furthermore, the presented navigation algorithm is extended into
3D environments. With the measurements of the sensor network, any flying robot
in the workspace is navigated by the presented algorithm from the initial
position to the target. Moreover, in this report, another navigation problem,
safe area search and map building for ground mobile robot, is studied and two
algorithms are presented. In the first presented method, we consider a ground
mobile robot equipped with a 2D range finder sensor searching a bounded 2D area
without any collision and building a complete 2D map of the area. Furthermore,
the first presented map building algorithm is extended to another algorithm for
3D map building.
|
[
{
"version": "v1",
"created": "Sat, 2 Sep 2017 03:11:20 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Li",
"Hang",
""
]
] |
new_dataset
| 0.994011 |
1709.00588
|
Zhiheng Zhou
|
Zhiheng Zhou, Congduan Li, Shenghao Yang and Xuan Guang
|
Practical Inner Codes for Batched Sparse Codes in Wireless Multihop
Networks
|
35 pages, 6 figures, Submitted to IEEE Transactions on Vehicular
Technology
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Batched sparse (BATS) code is a promising technology for reliable data
transmission in multi-hop wireless networks. As a BATS code consists of an
outer code and an inner code that typically is a random linear network code,
one main research topic for BATS codes is to design an inner code with good
performance in transmission efficiency and complexity. In this paper, this
issue is addressed with a focus on the problem of minimizing the total number
of packets transmitted by the source and intermediate nodes. Subsequently, the
problem is formulated as a mixed integer nonlinear programming (MINLP) problem
that is NP-hard in general. By exploiting the properties of inner codes and the
incomplete beta function, we construct a nonlinear programming (NLP) problem
that gives a valid upper bound on the best performance that can be achieved by
any feasible solutions. Moreover, both centralized and decentralized real-time
optimization strategies are developed. In particular, the decentralized
approach is performed independently by each node to find a feasible solution in
linear time with the use of look-up tables. Numerical results show that the gap
in performance between our proposed approaches and the upper bound is very
small, which demonstrates that all feasible solutions developed in the paper
are near-optimal with a guaranteed performance bound.
|
[
{
"version": "v1",
"created": "Sat, 2 Sep 2017 14:30:17 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Zhou",
"Zhiheng",
""
],
[
"Li",
"Congduan",
""
],
[
"Yang",
"Shenghao",
""
],
[
"Guang",
"Xuan",
""
]
] |
new_dataset
| 0.99953 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.