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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1609.03540
|
Babak Salimi
|
Babak Salimi, Dan Suciu
|
ZaliQL: A SQL-Based Framework for Drawing Causal Inference from Big Data
| null | null | null | null |
cs.DB cs.AI cs.LG cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Causal inference from observational data is a subject of active research and
development in statistics and computer science. Many toolkits have been
developed for this purpose that depends on statistical software. However, these
toolkits do not scale to large datasets. In this paper we describe a suite of
techniques for expressing causal inference tasks from observational data in
SQL. This suite supports the state-of-the-art methods for causal inference and
run at scale within a database engine. In addition, we introduce several
optimization techniques that significantly speedup causal inference, both in
the online and offline setting. We evaluate the quality and performance of our
techniques by experiments of real datasets.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2016 19:24:14 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Sep 2016 01:59:05 GMT"
}
] | 2016-09-14T00:00:00 |
[
[
"Salimi",
"Babak",
""
],
[
"Suciu",
"Dan",
""
]
] |
new_dataset
| 0.995376 |
1609.03732
|
Omar Richardson
|
Omar Richardson
|
Large-scale multiscale particle models in inhomogeneous domains:
modelling and implementation
|
This thesis was written as part of a graduation project for the
master Industrial and Applied Mathematics on the Eindhoven University of
Technology
| null | null | null |
cs.CE math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this thesis, we develop multiscale models for particle simulations in
population dynamics. These models are characterised by prescribing particle
motion on two spatial scales: microscopic and macroscopic. At the microscopic
level, each particle has its own mass, position and velocity, while at the
macroscopic level the particles are interpolated to a continuum quantity whose
evolution is governed by a system of transport equations. This way, one can
prescribe various types of interactions on a global scale, whilst still
maintaining high simulation speed for a large number of particles. In addition,
the interplay between particle motion and interaction is well tuned in both
regions of low and high densities.
We analyse links between models on these two scales and prove that under
certain conditions, a system of interacting particles converges to a nonlinear
coupled system of transport equations. We use this as a motivation to derive a
model defined on both modelling scales and prescribe the intercommunication
between them. Simulation takes place in inhomogeneous domains with arbitrary
conditions at inflow and outflow boundaries. We realise this by modelling
obstacles, sources and sinks. Integrating these aspects into the simulation
requires a route planning algorithm for the particles. Several algorithms are
considered and evaluated on accuracy, robustness and efficiency.
All aspects mentioned above are combined in a novel open source prototyping
simulation framework called Mercurial. This computational framework allows the
design of geometries and is built for high performance when large numbers of
particles are involved. Mercurial supports various types of inhomogeneities and
global systems of equations.
We apply our framework to simulate scenarios in crowd dynamics. We compare
our results with test cases from literature to assess the quality of the
simulations.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 09:04:27 GMT"
}
] | 2016-09-14T00:00:00 |
[
[
"Richardson",
"Omar",
""
]
] |
new_dataset
| 0.995403 |
1609.03773
|
Li Cheng
|
Chi Xu, Lakshmi Narasimhan Govindarajan, Yu Zhang, Li Cheng
|
Lie-X: Depth Image Based Articulated Object Pose Estimation, Tracking,
and Action Recognition on Lie Groups
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pose estimation, tracking, and action recognition of articulated objects from
depth images are important and challenging problems, which are normally
considered separately. In this paper, a unified paradigm based on Lie group
theory is proposed, which enables us to collectively address these related
problems. Our approach is also applicable to a wide range of articulated
objects. Empirically it is evaluated on lab animals including mouse and fish,
as well as on human hand. On these applications, it is shown to deliver
competitive results compared to the state-of-the-arts, and non-trivial
baselines including convolutional neural networks and regression forest
methods.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 11:36:26 GMT"
}
] | 2016-09-14T00:00:00 |
[
[
"Xu",
"Chi",
""
],
[
"Govindarajan",
"Lakshmi Narasimhan",
""
],
[
"Zhang",
"Yu",
""
],
[
"Cheng",
"Li",
""
]
] |
new_dataset
| 0.998806 |
1609.03971
|
Fergal Byrne
|
Eric Laukien, Richard Crowder and Fergal Byrne
|
Feynman Machine: The Universal Dynamical Systems Computer
| null | null | null | null |
cs.NE cs.AI cs.ET math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Efforts at understanding the computational processes in the brain have met
with limited success, despite their importance and potential uses in building
intelligent machines. We propose a simple new model which draws on recent
findings in Neuroscience and the Applied Mathematics of interacting Dynamical
Systems. The Feynman Machine is a Universal Computer for Dynamical Systems,
analogous to the Turing Machine for symbolic computing, but with several
important differences. We demonstrate that networks and hierarchies of simple
interacting Dynamical Systems, each adaptively learning to forecast its
evolution, are capable of automatically building sensorimotor models of the
external and internal world. We identify such networks in mammalian neocortex,
and show how existing theories of cortical computation combine with our model
to explain the power and flexibility of mammalian intelligence. These findings
lead directly to new architectures for machine intelligence. A suite of
software implementations has been built based on these principles, and applied
to a number of spatiotemporal learning tasks.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 18:34:59 GMT"
}
] | 2016-09-14T00:00:00 |
[
[
"Laukien",
"Eric",
""
],
[
"Crowder",
"Richard",
""
],
[
"Byrne",
"Fergal",
""
]
] |
new_dataset
| 0.996965 |
1609.03976
|
Ozan \c{C}a\u{g}layan
|
Ozan Caglayan, Lo\"ic Barrault, Fethi Bougares
|
Multimodal Attention for Neural Machine Translation
|
10 pages, under review COLING 2016
| null | null | null |
cs.CL cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The attention mechanism is an important part of the neural machine
translation (NMT) where it was reported to produce richer source representation
compared to fixed-length encoding sequence-to-sequence models. Recently, the
effectiveness of attention has also been explored in the context of image
captioning. In this work, we assess the feasibility of a multimodal attention
mechanism that simultaneously focus over an image and its natural language
description for generating a description in another language. We train several
variants of our proposed attention mechanism on the Multi30k multilingual image
captioning dataset. We show that a dedicated attention for each modality
achieves up to 1.6 points in BLEU and METEOR compared to a textual NMT
baseline.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 18:46:03 GMT"
}
] | 2016-09-14T00:00:00 |
[
[
"Caglayan",
"Ozan",
""
],
[
"Barrault",
"Loïc",
""
],
[
"Bougares",
"Fethi",
""
]
] |
new_dataset
| 0.98508 |
1512.06283
|
Gregory Gutin
|
Gregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlstr\"om, Anders Yeo
|
Chinese Postman Problem on Edge-Colored Multigraphs
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well-known that the Chinese postman problem on undirected and directed
graphs is polynomial-time solvable. We extend this result to edge-colored
multigraphs. Our result is in sharp contrast to the Chinese postman problem on
mixed graphs, i.e., graphs with directed and undirected edges, for which the
problem is NP-hard.
|
[
{
"version": "v1",
"created": "Sat, 19 Dec 2015 20:17:33 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Sep 2016 12:23:35 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Gutin",
"Gregory",
""
],
[
"Jones",
"Mark",
""
],
[
"Sheng",
"Bin",
""
],
[
"Wahlström",
"Magnus",
""
],
[
"Yeo",
"Anders",
""
]
] |
new_dataset
| 0.996298 |
1601.01824
|
Gregory Gutin
|
Gregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlstrom, Anders Yeo
|
Acyclicity in Edge-Colored Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A walk $W$ in edge-colored graphs is called properly colored (PC) if every
pair of consecutive edges in $W$ is of different color. We introduce and study
five types of PC acyclicity in edge-colored graphs such that graphs of PC
acyclicity of type $i$ is a proper superset of graphs of acyclicity of type
$i+1$, $i=1,2,3,4.$ The first three types are equivalent to the absence of PC
cycles, PC trails, and PC walks, respectively. While graphs of types 1, 2 and 3
can be recognized in polynomial time, the problem of recognizing graphs of type
4 is, somewhat surprisingly, NP-hard even for 2-edge-colored graphs (i.e., when
only two colors are used). The same problem with respect to type 5 is
polynomial-time solvable for all edge-colored graphs. Using the five types, we
investigate the border between intractability and tractability for the problems
of finding the maximum number of internally vertex disjoint PC paths between
two vertices and the minimum number of vertices to meet all PC paths between
two vertices.
|
[
{
"version": "v1",
"created": "Fri, 8 Jan 2016 10:50:14 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jan 2016 15:56:26 GMT"
},
{
"version": "v3",
"created": "Mon, 12 Sep 2016 12:20:38 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Gutin",
"Gregory",
""
],
[
"Jones",
"Mark",
""
],
[
"Sheng",
"Bin",
""
],
[
"Wahlstrom",
"Magnus",
""
],
[
"Yeo",
"Anders",
""
]
] |
new_dataset
| 0.999856 |
1604.03755
|
Mario Fritz
|
Abhishek Sharma, Oliver Grau, Mario Fritz
|
VConv-DAE: Deep Volumetric Shape Learning Without Object Labels
| null | null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of affordable depth sensors, 3D capture becomes more and more
ubiquitous and already has made its way into commercial products. Yet,
capturing the geometry or complete shapes of everyday objects using scanning
devices (e.g. Kinect) still comes with several challenges that result in noise
or even incomplete shapes. Recent success in deep learning has shown how to
learn complex shape distributions in a data-driven way from large scale 3D CAD
Model collections and to utilize them for 3D processing on volumetric
representations and thereby circumventing problems of topology and
tessellation. Prior work has shown encouraging results on problems ranging from
shape completion to recognition. We provide an analysis of such approaches and
discover that training as well as the resulting representation are strongly and
unnecessarily tied to the notion of object labels. Thus, we propose a full
convolutional volumetric auto encoder that learns volumetric representation
from noisy data by estimating the voxel occupancy grids. The proposed method
outperforms prior work on challenging tasks like denoising and shape
completion. We also show that the obtained deep embedding gives competitive
performance when used for classification and promising results for shape
interpolation.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 13:14:53 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Aug 2016 10:16:33 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Sep 2016 20:36:36 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Sharma",
"Abhishek",
""
],
[
"Grau",
"Oliver",
""
],
[
"Fritz",
"Mario",
""
]
] |
new_dataset
| 0.997763 |
1604.04684
|
Adam Noel
|
Adam Noel, Dimitrios Makrakis, Abdelhakim Hafid
|
Channel Impulse Responses in Diffusive Molecular Communication with
Spherical Transmitters
|
6 pages, 2 tables, 4 figures. Presented at the 28th Biennial
Symposium on Communications (BSC 2016) in June 2016
| null | null | null |
cs.ET cs.IT math.IT physics.chem-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Molecular communication is an emerging paradigm for systems that rely on the
release of molecules as information carriers. Communication via molecular
diffusion is a popular strategy that is ubiquitous in nature and very fast over
distances on the order of a micron or less. Existing closed-form analysis of
the diffusion channel impulse response generally assumes that the transmitter
is a point source. In this paper, channel impulse responses are derived for
spherical transmitters with either a passive or absorbing receiver. The derived
channel impulse responses are in closed-form for a one-dimensional environment
and can be found via numerical integration for a three-dimensional environment.
The point transmitter assumption (PTA) is formally defined so that its accuracy
can be measured in comparison to the derived spherical transmitter impulse
responses. The spherical transmitter model is much more accurate than the PTA
when the distance between a transmitter and its receiver is small relative to
the size of the transmitter. The derived results are verified via microscopic
particle-based simulations using the molecular communication simulation
platform AcCoRD (Actor-based Communication via Reaction-Diffusion). A spherical
transmitter variation where molecules are released from the surface of a solid
sphere is also considered via simulation.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 03:32:06 GMT"
},
{
"version": "v2",
"created": "Sat, 10 Sep 2016 18:13:51 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Noel",
"Adam",
""
],
[
"Makrakis",
"Dimitrios",
""
],
[
"Hafid",
"Abdelhakim",
""
]
] |
new_dataset
| 0.998709 |
1605.07289
|
Zheng Shou
|
Dongang Wang, Zheng Shou, Hongyi Liu, Shih-Fu Chang
|
EventNet Version 1.1 Technical Report
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EventNet is a large-scale video corpus and event ontology consisting of 500
events associated with event-specific concepts. In order to improve the quality
of the current EventNet, we conduct the following steps and introduce EventNet
version 1.1: (1) manually verify the correctness of event labels for all
videos; (2) remove the YouTube user bias by limiting the maximum number of
videos in each event from the same YouTube user as 3; (3) remove the videos
which are currently not accessible online; (4) remove the video belonging to
multiple event categories. After the above procedure, some events may contain
only a small number of videos, and therefore we crawl more videos for those
events to ensure every event will contain more than 50 videos. Finally,
EventNet version 1.1 contains 67,641 videos, 500 events, and 5,028
event-specific concepts. In addition, we train a Convolutional Neural Network
(CNN) model for event classification via fine-tuning AlexNet using EventNet
version 1.1. Then we use the trained CNN model to extract FC7 layer feature and
train binary classifiers using linear SVM for each event-specific concept. We
believe this new version of EventNet will significantly facilitate research in
computer vision and multimedia, and will put it online for public downloading
in the future.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 05:06:29 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Sep 2016 19:10:33 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Wang",
"Dongang",
""
],
[
"Shou",
"Zheng",
""
],
[
"Liu",
"Hongyi",
""
],
[
"Chang",
"Shih-Fu",
""
]
] |
new_dataset
| 0.999758 |
1607.01845
|
Agustin Indaco
|
Agustin Indaco and Lev Manovich
|
Urban Social Media Inequality: Definition, Measurements, and Application
|
53 pages, 11 figures, 3 tables
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media content shared today in cities, such as Instagram images, their
tags and descriptions, is the key form of contemporary city life. It tells
people where activities and locations that interest them are and it allows them
to share their urban experiences and self-representations. Therefore, any
analysis of urban structures and cultures needs to consider social media
activity. In our paper, we introduce the novel concept of social media
inequality. This concept allows us to quantitatively compare patterns in social
media activities between parts of a city, a number of cities, or any other
spatial areas. We define this concept using an analogy with the concept of
economic inequality. Economic inequality indicates how some economic
characteristics or material resources, such as income, wealth or consumption
are distributed in a city, country or between countries. Accordingly, we can
define social media inequality as the measure of the distribution of
characteristics from social media content shared in a particular geographic
area or between areas. An example of such characteristics is the number of
photos shared by all users of a social network such as Instagram in a given
city or city area, or the content of these photos. We propose that the standard
inequality measures used in other disciplines, such as the Gini coefficient,
can also be used to characterize social media inequality. To test our ideas, we
use a dataset of 7,442,454 public geo-coded Instagram images shared in
Manhattan during five months (March-July) in 2014, and also selected data for
287 Census tracts in Manhattan. We compare patterns in Instagram sharing for
locals and for visitors for all tracts, and also for hours in a 24-hour cycle.
We also look at relations between social media inequality and socio-economic
inequality using selected indicators for Census tracts.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 00:43:25 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Sep 2016 20:45:35 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Indaco",
"Agustin",
""
],
[
"Manovich",
"Lev",
""
]
] |
new_dataset
| 0.985906 |
1608.06338
|
Pichao Wang
|
Pichao Wang, Wanqing Li, Song Liu, Yuyao Zhang, Zhimin Gao and Philip
Ogunbona
|
Large-scale Continuous Gesture Recognition Using Convolutional Neural
Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of continuous gesture recognition from
sequences of depth maps using convolutional neutral networks (ConvNets). The
proposed method first segments individual gestures from a depth sequence based
on quantity of movement (QOM). For each segmented gesture, an Improved Depth
Motion Map (IDMM), which converts the depth sequence into one image, is
constructed and fed to a ConvNet for recognition. The IDMM effectively encodes
both spatial and temporal information and allows the fine-tuning with existing
ConvNet models for classification without introducing millions of parameters to
learn. The proposed method is evaluated on the Large-scale Continuous Gesture
Recognition of the ChaLearn Looking at People (LAP) challenge 2016. It achieved
the performance of 0.2655 (Mean Jaccard Index) and ranked $3^{rd}$ place in
this challenge.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 23:44:34 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Sep 2016 11:11:52 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Wang",
"Pichao",
""
],
[
"Li",
"Wanqing",
""
],
[
"Liu",
"Song",
""
],
[
"Zhang",
"Yuyao",
""
],
[
"Gao",
"Zhimin",
""
],
[
"Ogunbona",
"Philip",
""
]
] |
new_dataset
| 0.994652 |
1609.01329
|
Saad Nadeem
|
Saad Nadeem and Arie Kaufman
|
Depth Reconstruction and Computer-Aided Polyp Detection in Optical
Colonoscopy Video Frames
|
**The title has been modified to highlight the contributions more
clearly. The original title is: "Computer-Aided Detection of Polyps in
Optical Colonoscopy Images". Keywords: Machine learning, computer-aided
detection, segmentation, endoscopy, colonoscopy, videos, polyp, detection,
medical imaging, depth maps, 3D, reconstruction, computed tomography, virtual
colonoscopy, colorectal cancer, SPIE Medical Imaging, 2016
| null |
10.1117/12.2216996
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a computer-aided detection algorithm for polyps in optical
colonoscopy images. Polyps are the precursors to colon cancer. In the US alone,
more than 14 million optical colonoscopies are performed every year, mostly to
screen for polyps. Optical colonoscopy has been shown to have an approximately
25% polyp miss rate due to the convoluted folds and bends present in the colon.
In this work, we present an automatic detection algorithm to detect these
polyps in the optical colonoscopy images. We use a machine learning algorithm
to infer a depth map for a given optical colonoscopy image and then use a
detailed pre-built polyp profile to detect and delineate the boundaries of
polyps in this given image. We have achieved the best recall of 84.0% and the
best specificity value of 83.4%.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 21:12:34 GMT"
},
{
"version": "v2",
"created": "Sat, 10 Sep 2016 16:06:39 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Nadeem",
"Saad",
""
],
[
"Kaufman",
"Arie",
""
]
] |
new_dataset
| 0.994325 |
1609.02960
|
Nizar Habash
|
Salam Khalifa, Nizar Habash, Dana Abdulrahim, Sara Hassan
|
A Large Scale Corpus of Gulf Arabic
|
Language Resources and Evaluation Conference 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most Arabic natural language processing tools and resources are developed to
serve Modern Standard Arabic (MSA), which is the official written language in
the Arab World. Some Dialectal Arabic varieties, notably Egyptian Arabic, have
received some attention lately and have a growing collection of resources that
include annotated corpora and morphological analyzers and taggers. Gulf Arabic,
however, lags behind in that respect. In this paper, we present the Gumar
Corpus, a large-scale corpus of Gulf Arabic consisting of 110 million words
from 1,200 forum novels. We annotate the corpus for sub-dialect information at
the document level. We also present results of a preliminary study in the
morphological annotation of Gulf Arabic which includes developing guidelines
for a conventional orthography. The text of the corpus is publicly browsable
through a web interface we developed for it.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 22:22:53 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Khalifa",
"Salam",
""
],
[
"Habash",
"Nizar",
""
],
[
"Abdulrahim",
"Dana",
""
],
[
"Hassan",
"Sara",
""
]
] |
new_dataset
| 0.999803 |
1609.03047
|
Ken Ivanov
|
Ken Ivanov
|
Autonomous collision attack on OCSP services
|
16 pages, 4 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper describes two important design flaws in Online Certificate Status
Protocol (OCSP), a protocol widely used in PKI environments for managing
digital certificates' credibility in real time. The flaws significantly reduce
the security capabilities of the protocol, and can be exploited by a malicious
third party to generate forged signed certificate statuses and, in the worst
scenario, forged certificates. Description of the flaws, along with expected
exploitation routes, consequences for consuming application layer protocols,
and proposed countermeasures, is given.
|
[
{
"version": "v1",
"created": "Sat, 10 Sep 2016 13:13:19 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Ivanov",
"Ken",
""
]
] |
new_dataset
| 0.989767 |
1609.03109
|
Amr Abdelaziz
|
Amr Abdelaziz, Ron Burton and C. Emre Koksal
|
Message Authentication and Secret Key Agreement in VANETs via Angle of
Arrival
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the scope of VANETs, nature of exchanged safety/warning messages renders
itself highly location dependent as it is usually for incident reporting. Thus,
vehicles are required to periodically exchange beacon messages that include
speed, time and GPS location information. In this paper paper, we present a
physical layer assisted message authentication scheme that uses Angle of
Arrival (AoA) estimation to verify the message originator location based on the
claimed location information. Within the considered vehicular communication
settings, fundamental limits of AoA estimation are developed in terms of its
Cramer Rao Bound (CRB) and existence of efficient estimator. The problem of
deciding whether the received signal is originated from the claimed GPS
location is formulated as a two sided hypotheses testing problem whose solution
is given by Wald test statics. Moreover, we use correct decision, $P_D$, and
false alarm, $P_F$, probabilities as a quantitative performance measure. The
observation posterior likelihood function is shown to satisfy regularity
conditions necessary for asymptotic normality of the ML-AoA estimator. Thus, we
give $P_D$ and $P_F$ in a closed form.
We extend the potential of physical layer contribution in security to provide
physical layer assisted secret key agreement (SKA) protocol. A public key (PK)
based SKA in which communicating vehicles are required to validate their
respective physical location. We show that the risk of the Man in the Middle
attack, which is common in PK-SKA protocols without a trusted third party, is
waived up to the literal meaning of the word "middle".
|
[
{
"version": "v1",
"created": "Sun, 11 Sep 2016 02:23:47 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Abdelaziz",
"Amr",
""
],
[
"Burton",
"Ron",
""
],
[
"Koksal",
"C. Emre",
""
]
] |
new_dataset
| 0.999478 |
1609.03110
|
Prasanth G Narasimha-Shenoi
|
Manoj Changat, Prasanth G.Narasimha-Shenoi, Mary Shallet T.J, Ram
Kumar
|
Directed graphs and its Boundary Vertices
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$.
The maximum distance $md (u,v)$ is defined as
$md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where
$\overrightarrow{d}(u,v)$ denote the length of a shortest directed $u-v$ path
in $D$. This is a metric. The boundary, contour, eccentric and peripheral sets
of a strong digraph $D$ are defined with respect to this metric. The main aim
of this paper is to identify the above said metrically defined sets of a large
strong digraph $D$ in terms of its prime factor decomposition with respect to
cartesian product.
|
[
{
"version": "v1",
"created": "Sun, 11 Sep 2016 02:48:14 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Changat",
"Manoj",
""
],
[
"Narasimha-Shenoi",
"Prasanth G.",
""
],
[
"J",
"Mary Shallet T.",
""
],
[
"Kumar",
"Ram",
""
]
] |
new_dataset
| 0.992676 |
1609.03498
|
Ljiljana Simi\'c
|
Ljiljana Simi\'c, Andra M. Voicu, Petri M\"ah\"onen, Marina Petrova
and J. Pierre de Vries
|
LTE in Unlicensed Bands is neither Friend nor Foe to Wi-Fi
|
accepted for publication in IEEE Access
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Proponents of deploying LTE in the 5 GHz band for providing additional
cellular network capacity have claimed that LTE would be a better neighbour to
Wi-Fi in the unlicensed band, than Wi-Fi is to itself. On the other side of the
debate, the Wi-Fi community has objected that LTE would be highly detrimental
to Wi-Fi network performance. However, there is a lack of transparent and
systematic engineering evidence supporting the contradicting claims of the two
camps, which is essential for ascertaining whether regulatory intervention is
in fact required to protect the Wi-Fi incumbent from the new LTE entrant. To
this end, we present a comprehensive coexistence study of Wi-Fi and
LTE-in-unlicensed, surveying a large parameter space of coexistence mechanisms
and a range of representative network densities and deployment scenarios. Our
results show that, typically, harmonious coexistence between Wi-Fi and LTE is
ensured by the large number of 5 GHz channels. For the worst-case scenario of
forced co-channel operation, LTE is sometimes a better neighbour to Wi-Fi -
when effective node density is low - but sometimes worse - when density is
high. We find that distributed interference coordination is only necessary to
prevent a "tragedy of the commons" in regimes where interference is very
likely. We also show that in practice it does not make a difference to the
incumbent what kind of coexistence mechanism is added to LTE-in-unlicensed, as
long as one is in place. We therefore conclude that LTE is neither friend nor
foe to Wi-Fi in the unlicensed bands in general. We submit that the systematic
engineering analysis exemplified by our case study is a best-practice approach
for supporting evidence-based rulemaking by the regulator.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2016 17:27:23 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Simić",
"Ljiljana",
""
],
[
"Voicu",
"Andra M.",
""
],
[
"Mähönen",
"Petri",
""
],
[
"Petrova",
"Marina",
""
],
[
"de Vries",
"J. Pierre",
""
]
] |
new_dataset
| 0.982244 |
1609.03536
|
Zhenheng Yang
|
Zhenheng Yang and Ram Nevatia
|
A Multi-Scale Cascade Fully Convolutional Network Face Detector
|
Accepted to ICPR 16'
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face detection is challenging as faces in images could be present at
arbitrary locations and in different scales. We propose a three-stage cascade
structure based on fully convolutional neural networks (FCNs). It first
proposes the approximate locations where the faces may be, then aims to find
the accurate location by zooming on to the faces. Each level of the FCN cascade
is a multi-scale fully-convolutional network, which generates scores at
different locations and in different scales. A score map is generated after
each FCN stage. Probable regions of face are selected and fed to the next
stage. The number of proposals is decreased after each level, and the areas of
regions are decreased to more precisely fit the face. Compared to passing
proposals directly between stages, passing probable regions can decrease the
number of proposals and reduce the cases where first stage doesn't propose good
bounding boxes. We show that by using FCN and score map, the FCN cascade face
detector can achieve strong performance on public datasets.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2016 19:13:46 GMT"
}
] | 2016-09-13T00:00:00 |
[
[
"Yang",
"Zhenheng",
""
],
[
"Nevatia",
"Ram",
""
]
] |
new_dataset
| 0.988728 |
1404.4275
|
Qian Xiaochao
|
Xiaochao Qian
|
A Bitcoin system with no mining and no history transactions: Build a
compact Bitcoin system
|
Call for collaborators
| null | null | null |
cs.CE cs.CR q-fin.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an explicit definition of decentralization and show you that
decentralization is almost impossible for the current stage and Bitcoin is the
first truly noncentralized currency in the currency history. We propose a new
framework of noncentralized cryptocurrency system with an assumption of the
existence of a weak adversary for a bank alliance. It abandons the mining
process and blockchain, and removes history transactions from data
synchronization. We propose a consensus algorithm named Converged Consensus for
a noncentralized cryptocurrency system.
|
[
{
"version": "v1",
"created": "Tue, 15 Apr 2014 04:13:37 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Apr 2014 05:24:00 GMT"
},
{
"version": "v3",
"created": "Sat, 3 May 2014 09:04:25 GMT"
},
{
"version": "v4",
"created": "Sun, 11 May 2014 10:59:36 GMT"
},
{
"version": "v5",
"created": "Sat, 17 May 2014 08:04:23 GMT"
},
{
"version": "v6",
"created": "Mon, 2 Jun 2014 05:28:23 GMT"
},
{
"version": "v7",
"created": "Fri, 20 Jun 2014 09:21:53 GMT"
},
{
"version": "v8",
"created": "Wed, 27 Apr 2016 03:03:11 GMT"
},
{
"version": "v9",
"created": "Fri, 9 Sep 2016 00:09:25 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Qian",
"Xiaochao",
""
]
] |
new_dataset
| 0.996481 |
1608.06368
|
Mustafa Hajij
|
Mustafa Hajij and Tamal Dey and Xin Li
|
Segmenting a Surface Mesh into Pants Using Morse Theory
| null | null | null | null |
cs.GR math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pair of pants is a genus zero orientable surface with three boundary
components. A pants decomposition of a surface is a finite collection of
unordered pairwise disjoint simple closed curves embedded in the surface that
decompose the surface into pants. In this paper we present two Morse theory
based algorithms for pants decomposition of a surface mesh. Both algorithms
operates on a choice of an appropriate Morse function on the surface. The first
algorithm uses this Morse function to identify handles that are glued
systematically to obtain a pant decomposition. The second algorithm uses the
Reeb graph of the Morse function to obtain a pant decomposition. Both
algorithms work for surfaces with or without boundaries. Our preliminary
implementation of the two algorithms shows that both algorithms run in much
less time than an existing state-of-the-art method, and the Reeb graph based
algorithm achieves the best time efficiency. Finally, we demonstrate the
robustness of our algorithms against noise.
|
[
{
"version": "v1",
"created": "Tue, 23 Aug 2016 03:14:13 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Aug 2016 03:18:25 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Sep 2016 14:10:41 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Hajij",
"Mustafa",
""
],
[
"Dey",
"Tamal",
""
],
[
"Li",
"Xin",
""
]
] |
new_dataset
| 0.997441 |
1609.02596
|
Ejder Ba\c{s}tu\u{g}
|
Fei Shen, Kenza Hamidouche, Ejder Ba\c{s}tu\u{g}, and M\'erouane
Debbah
|
A Stackelberg Game for Incentive Proactive Caching Mechanisms in
Wireless Networks
|
to be presented at IEEE Global Communications Conference
(GLOBECOM'2016), Washington DC, USA, December 2016
| null | null | null |
cs.IT cs.GT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an incentive proactive cache mechanism in cache-enabled small
cell networks (SCNs) is proposed, in order to motivate the content providers
(CPs) to participate in the caching procedure. A network composed of a single
mobile network operator (MNO) and multiple CPs is considered. The MNO aims to
define the price it charges the CPs to maximize its revenue while the CPs
compete to determine the number of files they cache at the MNO's small base
stations (SBSs) to improve the quality of service (QoS) of their users. This
problem is formulated as a Stackelberg game where a single MNO is considered as
the leader and the multiple CPs willing to cache files are the followers. The
followers game is modeled as a non-cooperative game and both the existence and
uniqueness of a Nash equilibrium (NE) are proved. The closed-form expression of
the NE which corresponds to the amount of storage each CP requests from the MNO
is derived. An optimization problem is formulated at the MNO side to determine
the optimal price that the MNO should charge the CPs. Simulation results show
that at the equilibrium, the MNO and CPs can all achieve a utility that is up
to 50% higher than the cases in which the prices and storage quantities are
requested arbitrarily.
|
[
{
"version": "v1",
"created": "Thu, 8 Sep 2016 21:20:45 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Shen",
"Fei",
""
],
[
"Hamidouche",
"Kenza",
""
],
[
"Baştuğ",
"Ejder",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.999145 |
1609.02657
|
Fu-Hong Liu
|
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu and Hsiang-Hsuan Liu
|
Convex Independence in Permutation Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set C of vertices of a graph is P_3-convex if every vertex outside C has at
most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest
P_3-convex set that contains A. A set M is convexly independent if for every
vertex x \in M, x \notin \sigma(M-x). We show that the maximal number of
vertices that a convexly independent set in a permutation graph can have, can
be computed in polynomial time.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 04:57:33 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Hon",
"Wing-Kai",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Fu-Hong",
""
],
[
"Liu",
"Hsiang-Hsuan",
""
]
] |
new_dataset
| 0.999428 |
1609.02667
|
Xueyang Wang
|
Xueyang Wang and Jerry Backer
|
SIGDROP: Signature-based ROP Detection using Hardware Performance
Counters
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Return-Oriented Programming (ROP) is a software exploit for system
compromise. By chaining short instruction sequences from existing code pieces,
ROP can bypass static code-integrity checking approaches and non-executable
page protections. Existing defenses either require access to source code or
binary, a customized compiler or hardware modifications, or suffer from high
performance and storage overhead. In this work, we propose SIGDROP, a low-cost
approach for ROP detection which uses low-level properties inherent to ROP
attacks. Specifically, we observe special patterns of certain hardware events
when a ROP attack occurs during program execution. Such hardware event-based
patterns form signatures to flag ROP attacks at runtime. SIGDROP leverages
Hardware Performance Counters, which are already present in commodity
processors, to efficiently capture and extract the signatures. Our evaluation
demonstrates that SIGDROP can effectively detect ROP attacks with acceptable
performance overhead and negligible storage overhead.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 06:28:45 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Wang",
"Xueyang",
""
],
[
"Backer",
"Jerry",
""
]
] |
new_dataset
| 0.999019 |
1609.02750
|
Riccardo Spolaor
|
Riccardo Spolaor, Laila Abudahi, Veelasha Moonsamy, Mauro Conti, Radha
Poovendran
|
No Free Charge Theorem: a Covert Channel via USB Charging Cable on
Mobile Devices
|
10 pages, 14 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
More and more people are regularly using mobile and battery-powered handsets,
such as smartphones and tablets. At the same time, thanks to the technological
innovation and to the high user demands, those devices are integrating
extensive functionalities and developers are writing battery-draining apps,
which results in a surge of energy consumption of these devices. This scenario
leads many people to often look for opportunities to charge their devices at
public charging stations: the presence of such stations is already prominent
around public areas such as hotels, shopping malls, airports, gyms and museums,
and is expected to significantly grow in the future. While most of the time the
power comes for free, there is no guarantee that the charging station is not
maliciously controlled by an adversary, with the intention to exfiltrate data
from the devices that are connected to it.
In this paper, we illustrate for the first time how an adversary could
leverage a maliciously controlled charging station to exfiltrate data from the
smartphone via a USB charging cable (i.e., without using the data transfer
functionality), controlling a simple app running on the device, and without
requiring any permission to be granted by the user to send data out of the
device. We show the feasibility of the proposed attack through a prototype
implementation in Android, which is able to send out potentially sensitive
information, such as IMEI, contacts' phone number, and pictures.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 11:48:21 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Spolaor",
"Riccardo",
""
],
[
"Abudahi",
"Laila",
""
],
[
"Moonsamy",
"Veelasha",
""
],
[
"Conti",
"Mauro",
""
],
[
"Poovendran",
"Radha",
""
]
] |
new_dataset
| 0.997085 |
1609.02769
|
Riccardo Spolaor
|
Mauro Conti, Elia Dal Santo and Riccardo Spolaor
|
DELTA: Data Extraction and Logging Tool for Android
|
11 pages, 7 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the past few years, the use of smartphones has increased exponentially,
and so have the capabilities of such devices. Together with an increase in raw
processing power, modern smartphones are equipped with a wide variety of
sensors and expose an extensive set of API (Accessible Programming Interface).
These capabilities allow us to extract a wide spectrum of data that ranges from
information about the environment (e.g., position, orientation) to user habits
(e.g., which apps she uses and when), as well as about the status of the
operating system itself (e.g., memory, network adapters). This data can be
extremely valuable in many research fields such as user authentication,
intrusion detection and detection of information leaks. For these reasons,
researchers need to use a solid and reliable logging tool to collect data from
mobile devices.
In this paper, we first survey the existing logging tools available on the
Android platform, comparing the features offered by different tools and their
impact on the system, and highlighting some of their shortcomings. Then, we
present DELTA - Data Extraction and Logging Tool for Android, which improves
the existing Android logging solutions in terms of flexibility, fine-grained
tuning capabilities, extensibility, and available set of logging features. We
performed a full implementation of DELTA and we run a thorough evaluation on
its performance. The results show that our tool has low impact on the
performance of the system, on battery consumption, and on user experience.
Finally, we make the DELTA source code and toolset available to the research
community.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 12:47:02 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Conti",
"Mauro",
""
],
[
"Santo",
"Elia Dal",
""
],
[
"Spolaor",
"Riccardo",
""
]
] |
new_dataset
| 0.99226 |
1609.02809
|
Edward Dixon Mr
|
Alexei Bastidas, Edward Dixon, Chris Loo, John Ryan
|
Harassment detection: a benchmark on the #HackHarassment dataset
|
Accepted to the Collaborative European Research Conference 2016
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
Online harassment has been a problem to a greater or lesser extent since the
early days of the internet. Previous work has applied anti-spam techniques like
machine-learning based text classification (Reynolds, 2011) to detecting
harassing messages. However, existing public datasets are limited in size, with
labels of varying quality. The #HackHarassment initiative (an alliance of 1
tech companies and NGOs devoted to fighting bullying on the internet) has begun
to address this issue by creating a new dataset superior to its predecssors in
terms of both size and quality. As we (#HackHarassment) complete further rounds
of labelling, later iterations of this dataset will increase the available
samples by at least an order of magnitude, enabling corresponding improvements
in the quality of machine learning models for harassment detection. In this
paper, we introduce the first models built on the #HackHarassment dataset v1.0
(a new open dataset, which we are delighted to share with any interested
researcherss) as a benchmark for future research.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2016 14:23:02 GMT"
}
] | 2016-09-12T00:00:00 |
[
[
"Bastidas",
"Alexei",
""
],
[
"Dixon",
"Edward",
""
],
[
"Loo",
"Chris",
""
],
[
"Ryan",
"John",
""
]
] |
new_dataset
| 0.999627 |
1102.5739
|
Armin Banaei
|
Armin Banaei, Daren B.H. Cline, Costas N. Georghiades, and Shuguang
Cui
|
On the Random 1/2-Disk Routing Scheme in Wireless Ad Hoc Networks
|
This paper has been withdrawn by the author and is replaced by an
updated version under a new title: "On Asymptotic Statistics for Geometric
Routing Schemes in Wireless Ad-Hoc Networks" [arXiv:1211.2496]
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric
routing scheme in which each node chooses the next relay randomly among the
nodes within its transmission range and in the general direction of the
destination. We introduce a notion of convergence for geometric routing schemes
that not only considers the feasibility of packet delivery through possibly
multi-hop relaying, but also requires the packet delivery to occur in a finite
number of hops. We derive sufficient conditions that ensure the asymptotic
\emph{convergence} of the random 1/2-disk routing scheme based on this
convergence notion, and by modeling the packet distance evolution to the
destination as a Markov process, we derive bounds on the expected number of
hops that each packet traverses to reach its destination.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 18:54:33 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Jun 2013 23:51:03 GMT"
}
] | 2016-09-09T00:00:00 |
[
[
"Banaei",
"Armin",
""
],
[
"Cline",
"Daren B. H.",
""
],
[
"Georghiades",
"Costas N.",
""
],
[
"Cui",
"Shuguang",
""
]
] |
new_dataset
| 0.999321 |
1112.0699
|
Lee-Ad Gottlieb
|
Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer
|
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial
Time Approximation Scheme
| null | null |
10.1137/130913328
| null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Traveling Salesman Problem (TSP) is among the most famous NP-hard
optimization problems. We design for this problem a randomized polynomial-time
algorithm that computes a (1+eps)-approximation to the optimal tour, for any
fixed eps>0, in TSP instances that form an arbitrary metric space with bounded
intrinsic dimension.
The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the
above result holds in the special case of TSP in a fixed-dimensional Euclidean
space. Thus, our algorithm demonstrates that the algorithmic tractability of
metric TSP depends on the dimensionality of the space and not on its specific
geometry. This result resolves a problem that has been open since the
quasi-polynomial time algorithm of Talwar (T-04).
|
[
{
"version": "v1",
"created": "Sat, 3 Dec 2011 22:58:13 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Apr 2015 12:56:30 GMT"
}
] | 2016-09-09T00:00:00 |
[
[
"Bartal",
"Yair",
""
],
[
"Gottlieb",
"Lee-Ad",
""
],
[
"Krauthgamer",
"Robert",
""
]
] |
new_dataset
| 0.964966 |
1609.02197
|
Stefano Tomasin
|
Stefano Tomasin, Ingmar Land and Fr\'ed\'eric Gabry
|
Pilot Contamination Attack Detection by Key-Confirmation in Secure MIMO
Systems
|
accepted, appears in IEEE GLOBECOM 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many security techniques working at the physical layer need a correct channel
state information (CSI) at the transmitter, especially when devices are
equipped with multiple antennas. Therefore such techniques are vulnerable to
pilot contamination attacks (PCAs) by which an attacker aims at inducing false
CSI. In this paper we provide a solution to some PCA methods, by letting two
legitimate parties to compare their channel estimates. The comparison is made
in order to minimize the information leakage on the channel to a possible
attacker. By reasonable assumptions on both the channel knowledge by the
attacker and the correlation properties of the attacker and legitimate channels
we show the validity of our solution. An accurate analysis of possible attacks
and countermeasures is provided, together with a numerical evaluation of the
attainable secrecy outage probability when our solution is used in conjunction
with beamforming for secret communications.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 21:28:02 GMT"
}
] | 2016-09-09T00:00:00 |
[
[
"Tomasin",
"Stefano",
""
],
[
"Land",
"Ingmar",
""
],
[
"Gabry",
"Frédéric",
""
]
] |
new_dataset
| 0.998 |
1609.02353
|
Yuval Elovici
|
Mordechai Guri, Yisroel Mirsky, Yuval Elovici
|
9-1-1 DDoS: Threat, Analysis and Mitigation
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 911 emergency service belongs to one of the 16 critical infrastructure
sectors in the United States. Distributed denial of service (DDoS) attacks
launched from a mobile phone botnet pose a significant threat to the
availability of this vital service. In this paper we show how attackers can
exploit the cellular network protocols in order to launch an anonymized DDoS
attack on 911. The current FCC regulations require that all emergency calls be
immediately routed regardless of the caller's identifiers (e.g., IMSI and
IMEI). A rootkit placed within the baseband firmware of a mobile phone can mask
and randomize all cellular identifiers, causing the device to have no genuine
identification within the cellular network. Such anonymized phones can issue
repeated emergency calls that cannot be blocked by the network or the emergency
call centers, technically or legally. We explore the 911 infrastructure and
discuss why it is susceptible to this kind of attack. We then implement
different forms of the attack and test our implementation on a small cellular
network. Finally, we simulate and analyze anonymous attacks on a model of
current 911 infrastructure in order to measure the severity of their impact. We
found that with less than 6K bots (or $100K hardware), attackers can block
emergency services in an entire state (e.g., North Carolina) for days. We
believe that this paper will assist the respective organizations, lawmakers,
and security professionals in understanding the scope of this issue in order to
prevent possible 911-DDoS attacks in the future.
|
[
{
"version": "v1",
"created": "Thu, 8 Sep 2016 09:40:21 GMT"
}
] | 2016-09-09T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Mirsky",
"Yisroel",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.998869 |
1609.02554
|
Fengqiu Wang
|
Shuchao Qin, Fengqiu Wang, Yujie Liu, Qing Wan, Xinran Wang, Yongbing
Xu, Yi Shi, Xiaomu Wang, Rong Zhang
|
A light-stimulated neuromorphic device based on graphene hybrid
phototransistor
|
20 pages, 4 figures
| null | null | null |
cs.ET physics.bio-ph physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neuromorphic chip refers to an unconventional computing architecture that is
modelled on biological brains. It is ideally suited for processing sensory data
for intelligence computing, decision-making or context cognition. Despite rapid
development, conventional artificial synapses exhibit poor connection
flexibility and require separate data acquisition circuitry, resulting in
limited functionalities and significant hardware redundancy. Here we report a
novel light-stimulated artificial synapse based on a graphene-nanotube hybrid
phototransistor that can directly convert optical stimuli into a "neural image"
for further neuronal analysis. Our optically-driven synapses involve multiple
steps of plasticity mechanisms and importantly exhibit flexible tuning of both
short- and long-term plasticity. Furthermore, our neuromorphic phototransistor
can take multiple pre-synaptic light stimuli via wavelength-division
multiplexing and allows advanced optical processing through
charge-trap-mediated optical coupling. The capability of complex neuromorphic
functionalities in a simple silicon-compatible device paves the way for novel
neuromorphic computing architectures involving photonics.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 07:10:22 GMT"
}
] | 2016-09-09T00:00:00 |
[
[
"Qin",
"Shuchao",
""
],
[
"Wang",
"Fengqiu",
""
],
[
"Liu",
"Yujie",
""
],
[
"Wan",
"Qing",
""
],
[
"Wang",
"Xinran",
""
],
[
"Xu",
"Yongbing",
""
],
[
"Shi",
"Yi",
""
],
[
"Wang",
"Xiaomu",
""
],
[
"Zhang",
"Rong",
""
]
] |
new_dataset
| 0.997799 |
0802.0834
|
Jaap-Henk Hoepman
|
Jaap-Henk Hoepman
|
The Ephemeral Pairing Problem
| null |
In 8th Int. Conf. Financial Cryptography, LNCS 3110, pages
212-226, Key West, FL, USA, February 9-12 2004. Springer
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless ad-hoc broadcast networks the pairing problem consists of
establishing a (long-term) connection between two specific physical nodes in
the network that do not yet know each other. We focus on the ephemeral version
of this problem. Ephemeral pairings occur, for example, when electronic
business cards are exchanged between two people that meet, or when one pays at
a check-out using a wireless wallet.
This problem can, in more abstract terms, be phrased as an ephemeral key
exchange problem: given a low bandwidth authentic (or private) communication
channel between two nodes, and a high bandwidth broadcast channel, can we
establish a high-entropy shared secret session key between the two nodes
without relying on any a priori shared secret information.
Apart from introducing this new problem, we present several ephemeral key
exchange protocols, both for the case of authentic channels as well as for the
case of private channels.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2008 16:14:11 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Hoepman",
"Jaap-Henk",
""
]
] |
new_dataset
| 0.986689 |
0912.1178
|
Michel Fliess
|
Michel Fliess (LIX, INRIA Saclay - Ile de France), C\'edric Join
(INRIA Saclay - Ile de France, CRAN), Mamadou Mboup (INRIA Saclay - Ile de
France)
|
Algebraic Change-Point Detection
| null |
Applicable Algebra in Engineering, Communication and Computing
(2010)
| null | null |
cs.NA math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Elementary techniques from operational calculus, differential algebra, and
noncommutative algebra lead to a new approach for change-point detection, which
is an important field of investigation in various areas of applied sciences and
engineering. Several successful numerical experiments are presented.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2009 07:57:08 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Fliess",
"Michel",
"",
"LIX, INRIA Saclay - Ile de France"
],
[
"Join",
"Cédric",
"",
"INRIA Saclay - Ile de France, CRAN"
],
[
"Mboup",
"Mamadou",
"",
"INRIA Saclay - Ile de\n France"
]
] |
new_dataset
| 0.974959 |
1001.3716
|
T.R. Gopalakrishnan Nair
|
Vaidehi. M., T.R. Gopalakrishnan Nair
|
A Multicore Processor based Real-Time System for Automobile management
application
|
9 pages, 4 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose an Intelligent Management System which is capable of
managing the automobile functions using the rigorous real-time principles and a
multicore processor in order to realize higher efficiency and safety for the
vehicle. It depicts how various automobile functionalities can be fine grained
and treated to fit in real time concepts. It also shows how the modern
multicore processors can be of good use in organizing vast amounts of
correlated functions to be executed in real-time with excellent time
commitments. The modeling of the automobile tasks with real time commitments,
organizing appropriate scheduling for various real time tasks and the usage of
a multicore processor enables the system to realize higher efficiency and offer
better safety levels to the vehicle. The industry available real time operating
system is used for scheduling various tasks and jobs on the multicore
processor.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2010 04:34:07 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"M.",
"Vaidehi.",
""
],
[
"Nair",
"T. R. Gopalakrishnan",
""
]
] |
new_dataset
| 0.987895 |
1001.3756
|
T.R. Gopalakrishnan Nair
|
A. Christy Persya, T.R.Gopalakrishnan Nair
|
Fault Tolerant Real Time Systems
|
4 pages, 4 figures
|
International Conference on Next Generation Software Application,
pp 177-180, 2008
| null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real time systems are systems in which there is a commitment for timely
response by the computer to external stimuli. Real time applications have to
function correctly even in presence of faults. Fault tolerance can be achieved
by either hardware or software or time redundancy. Safety-critical applications
have strict time and cost constraints, which means that not only faults have to
be tolerated but also the constraints should be satisfied. Deadline scheduling
means that the taskwith the earliest required response time is processed. The
most common scheduling algorithms are :Rate Monotonic(RM) and Earliest deadline
first(EDF).This paper deals with the interaction between the fault tolerant
strategy and the EDF real time scheduling strategy.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2010 10:18:43 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Persya",
"A. Christy",
""
],
[
"Nair",
"T. R. Gopalakrishnan",
""
]
] |
new_dataset
| 0.996776 |
1001.4459
|
Jaap-Henk Hoepman
|
Gerben Broenink, Jaap-Henk Hoepman, Christian van 't Hof, Rob van
Kranenburg, David Smits, Tijmen Wisman
|
The Privacy Coach: Supporting customer privacy in the Internet of Things
|
10 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Privacy Coach is an application running on a mobile phone that supports
customers in making privacy decisions when confronted with RFID tags. The
approach we take to increase customer privacy is a radical departure from the
mainstream research efforts that focus on implementing privacy enhancing
technologies on the RFID tags themselves. Instead the Privacy Coach functions
as a mediator between customer privacy preferences and corporate privacy
policies, trying to find a match between the two, and informing the user of the
outcome. In this paper we report on the architecture of the Privacy Coach, and
show how it enables users to make informed privacy decisions in a user-friendly
manner. We also spend considerable time to discuss lessons learnt and to
describe future plans to further improve on the Privacy Coach concept.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2010 15:25:29 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Broenink",
"Gerben",
""
],
[
"Hoepman",
"Jaap-Henk",
""
],
[
"Hof",
"Christian van 't",
""
],
[
"van Kranenburg",
"Rob",
""
],
[
"Smits",
"David",
""
],
[
"Wisman",
"Tijmen",
""
]
] |
new_dataset
| 0.982129 |
1002.3015
|
Selva Rani R
|
Shashi Kumar N.R., R. Selvarani, Pushpavathi T.P
|
GPRS Based Intranet Remote Administration GIRA
|
4 pages, 2 figures
|
Journal of Research and Industry, Volume 1, pp 36-39, 2008
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a world of increasing mobility, there is a growing need for people to
communicate with each other and have timely access to information regardless of
the location of the individuals or the information. With the advent of moblle
technology, the way of communication has changed. The gira system is basically
a mobile phone technology service. In this paper we discuss about a novel local
area network control system called gprs based Intranet Remote Administration
gira. This system finds application in a mobile handset. With this system, a
network administrator will have an effective remote control over the network.
gira system is developed using gprs, gcf Generic Connection Framework of j2me,
sockets and rmi technologies
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 06:53:21 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"R.",
"Shashi Kumar N.",
""
],
[
"Selvarani",
"R.",
""
],
[
"P",
"Pushpavathi T.",
""
]
] |
new_dataset
| 0.998933 |
1002.3074
|
Stevan Harnad
|
Arthur Sale, Marc Couture, Eloy Rodrigues, Leslie Carr, Stevan Harnad
|
Open Access Mandates and the "Fair Dealing" Button
|
12 pages, 5 figures, 32 references. To appear in "Dynamic Fair
Dealing: Creating Canadian Culture Online" (Rosemary J. Coombe & Darren
Wershler, Eds.)
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the "Fair Dealing Button," a feature designed for authors who
have deposited their papers in an Open Access Institutional Repository but have
deposited them as "Closed Access" (meaning only the metadata are visible and
retrievable, not the full eprint) rather than Open Access. The Button allows
individual users to request and authors to provide a single eprint via
semi-automated email. The purpose of the Button is to tide over research usage
needs during any publisher embargo on Open Access and, more importantly, to
make it possible for institutions to adopt the
"Immediate-Deposit/Optional-Access" Mandate, without exceptions or opt-outs,
instead of a mandate that allows delayed deposit or deposit waivers, depending
on publisher permissions or embargoes (or no mandate at all). This is only
"Almost-Open Access," but in facilitating exception-free immediate-deposit
mandates it will accelerate the advent of universal Open Access.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 12:52:46 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Sale",
"Arthur",
""
],
[
"Couture",
"Marc",
""
],
[
"Rodrigues",
"Eloy",
""
],
[
"Carr",
"Leslie",
""
],
[
"Harnad",
"Stevan",
""
]
] |
new_dataset
| 0.99158 |
1003.0445
|
Kamyar Moshksar
|
Kamyar Moshksar, Amir K. Khandani
|
On The Design of Signature Codes in Decentralized Wireless Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses a unified approach towards communication in
decentralized wireless networks of separate transmitter-receiver pairs. In
general, users are unaware of each other's codebooks and there is no central
controller to assign the resources in the network to the users. A randomized
signaling scheme is introduced in which each user locally spreads its Gaussian
signal along a randomly generated spreading code comprised of a sequence of
nonzero elements over a certain alphabet. Along with spreading, each
transmitter also masks its output independently from transmission to
transmission. Using a conditional version of entropy power inequality and a key
lemma on the differential entropy of mixed Gaussian random vectors, achievable
rates are developed for the users. It is seen that as the number of users
increases, the achievable Sum Multiplexing Gain of the network approaches that
of a centralized orthogonal scheme where multiuser interference is completely
avoided. An interesting observation is that in general the elements of a
spreading code are not equiprobable over the underlying alphabet. Finally,
using the recently developed extremal inequality of Liu-Viswanath, we present
an optimality result showing that transmission of Gaussian signals via
spreading and masking yields higher achievable rates than the maximum
achievable rate attained by applying masking only.
|
[
{
"version": "v1",
"created": "Mon, 1 Mar 2010 21:54:20 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Moshksar",
"Kamyar",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.99734 |
1609.01755
|
Ulf R\"uegg
|
Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf R\"uegg, and
Reinhard von Hanxleden
|
Compact Layered Drawings of General Directed Graphs
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of layering general directed graphs under height and
possibly also width constraints. Given a directed graph G = (V,A) and a maximal
height, we propose a layering approach that minimizes a weighted sum of the
number of reversed arcs, the arc lengths, and the width of the drawing. We call
this the Compact Generalized Layering Problem (CGLP). Here, the width of a
drawing is defined as the maximum sum of the number of vertices placed on a
layer and the number of dummy vertices caused by arcs traversing the layer. The
CGLP is NP-hard. We present two MIP models for this problem. The first one
(EXT) is our extension of a natural formulation for directed acyclic graphs as
suggested by Healy and Nikolov. The second one (CGL) is a new formulation based
on partial orderings. Our computational experiments on two benchmark sets show
that the CGL formulation can be solved much faster than EXT using standard
commercial MIP solvers. Moreover, we suggest a variant of CGL, called MML, that
can be seen as a heuristic approach. In our experiments, MML clearly improves
on CGL in terms of running time while it does not considerably increase the
average arc lengths and widths of the layouts although it solves a slightly
different problem where the dummy vertices are not taken into account.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2016 22:09:37 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Jabrayilov",
"Adalat",
""
],
[
"Mallach",
"Sven",
""
],
[
"Mutzel",
"Petra",
""
],
[
"Rüegg",
"Ulf",
""
],
[
"von Hanxleden",
"Reinhard",
""
]
] |
new_dataset
| 0.982277 |
1609.01860
|
Venkatesh Venkatesh Venkatesh
|
Venkatesh, C S Sengar, K R Venugopal, S S Iyengar, L M Patnaik
|
RRDVCR: Real-Time Reliable Data Delivery Based on Virtual Coordinating
Routing for Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-time industrial application requires routing protocol that guarantees
data delivery with reliable, efficient and low end-to-end delay. Existing
Routing(THVR) [13] is based velocity of Two-Hop Velocity and protocol relates
two-hop velocity to delay to select the next forwarding node, that has overhead
of exchanging control packets, and depleting the available energy in nodes. We
propose a Real-Time Reliable Data delivery based on Virtual Coordinates Routing
(RRDVCR) algorithm, based on the number of hops to the destination rather than
geographic distance. Selection of forwarding node is based on packet progress
offered by two-hops, link quality and available energy at the forwarding nodes.
All these metric are co-related by dynamic co-relation factor. The proposed
protocol uses selective acknowledgment scheme that results in lower overhead
and energy consumption. Simulation results shows that there is about 22% and
9.5% decrease in energy consumption compared to SPEED [8] and THVR [13]
respectively, 16% and 38% increase in packet delivery compared to THVR [13] and
SPEED[8] respectively, and overhead is reduced by 50%.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 07:26:34 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Venkatesh",
"",
""
],
[
"Sengar",
"C S",
""
],
[
"Venugopal",
"K R",
""
],
[
"Iyengar",
"S S",
""
],
[
"Patnaik",
"L M",
""
]
] |
new_dataset
| 0.999756 |
1609.01985
|
Roly Perera
|
Roly Perera, Simon J. Gay
|
Behavioural Prototypes
|
Extended abstract; presented at 0th Workshop on New Object-Oriented
Languages (NOOL) 2015
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We sketch a simple language of concurrent objects which explores the design
space between type systems and continuous testing. In our language, programs
are collections of communicating automata checked automatically for multiparty
compatibility. This property, taken from the session types literature but here
applied to terms rather than types, guarantees that no state-related errors
arise during execution: no object gets stuck because it was sent the wrong
message, and every message is processed.
|
[
{
"version": "v1",
"created": "Sat, 3 Sep 2016 11:14:51 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Perera",
"Roly",
""
],
[
"Gay",
"Simon J.",
""
]
] |
new_dataset
| 0.996776 |
1609.01987
|
Jason T. L. Wang
|
Lei Hua, Yang Song, Namhee Kim, Christian Laing, Jason T. L. Wang,
Tamar Schlick
|
CHSalign: A Web Server That Builds upon Junction-Explorer and RNAJAG for
Pairwise Alignment of RNA Secondary Structures with Coaxial Helical Stacking
|
45 pages, 5 figures
| null | null | null |
cs.CE q-bio.BM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RNA junctions are important structural elements of RNA molecules. They are
formed when three or more helices come together in three-dimensional space.
Recent studies have focused on the annotation and prediction of coaxial helical
stacking (CHS) motifs within junctions. Here we exploit such predictions to
develop an efficient alignment tool to handle RNA secondary structures with CHS
motifs. Specifically, we build upon our Junction-Explorer software for
predicting coaxial stacking and RNAJAG for modelling junction topologies as
tree graphs to incorporate constrained tree matching and dynamic programming
algorithms into a new method, called CHSalign, for aligning the secondary
structures of RNA molecules containing CHS motifs. Thus, CHSalign is intended
to be an efficient alignment tool for RNAs containing similar junctions.
Experimental results based on thousands of alignments demonstrate that CHSalign
can align two RNA secondary structures containing CHS motifs more accurately
than other RNA secondary structure alignment tools. CHSalign yields a high
score when aligning two RNA secondary structures with similar CHS motifs or
helical arrangement patterns, and a low score otherwise. This new method has
been implemented in a web server, and the program is also made freely
available, at http://bioinformatics.njit.edu/CHSalign/.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 22:31:02 GMT"
}
] | 2016-09-08T00:00:00 |
[
[
"Hua",
"Lei",
""
],
[
"Song",
"Yang",
""
],
[
"Kim",
"Namhee",
""
],
[
"Laing",
"Christian",
""
],
[
"Wang",
"Jason T. L.",
""
],
[
"Schlick",
"Tamar",
""
]
] |
new_dataset
| 0.999618 |
1603.00361
|
Tom\'a\v{s} Masopust
|
Tom\'a\v{s} Masopust
|
Piecewise Testable Languages and Nondeterministic Automata
|
Corrections in section 4.1
| null |
10.4230/LIPIcs.MFCS.2016.67
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A regular language is $k$-piecewise testable if it is a finite boolean
combination of languages of the form $\Sigma^* a_1 \Sigma^* \cdots \Sigma^* a_n
\Sigma^*$, where $a_i\in\Sigma$ and $0\le n \le k$. Given a DFA $A$ and $k\ge
0$, it is an NL-complete problem to decide whether the language $L(A)$ is
piecewise testable and, for $k\ge 4$, it is coNP-complete to decide whether the
language $L(A)$ is $k$-piecewise testable. It is known that the depth of the
minimal DFA serves as an upper bound on $k$. Namely, if $L(A)$ is piecewise
testable, then it is $k$-piecewise testable for $k$ equal to the depth of $A$.
In this paper, we show that some form of nondeterminism does not violate this
upper bound result. Specifically, we define a class of NFAs, called ptNFAs,
that recognize piecewise testable languages and show that the depth of a ptNFA
provides an (up to exponentially better) upper bound on $k$ than the minimal
DFA. We provide an application of our result, discuss the relationship between
$k$-piecewise testability and the depth of NFAs, and study the complexity of
$k$-piecewise testability for ptNFAs.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 17:11:05 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Mar 2016 06:54:39 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Masopust",
"Tomáš",
""
]
] |
new_dataset
| 0.965266 |
1607.05139
|
Erel Segal-Halevi
|
Erel Segal-Halevi and Avinatan Hassidim and Yonatan Aumann
|
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism
|
Accepted to SAGT 2016. This full version (14 pages) includes an
additional example
| null |
10.1007/978-3-662-53354-3_21
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a seminal paper, McAfee (1992) presented the first dominant strategy
truthful mechanism for double auction. His mechanism attains nearly optimal
gain-from-trade when the market is sufficiently large. However, his mechanism
may leave money on the table, since the price paid by the buyers may be higher
than the price paid to the sellers. This money is included in the
gain-from-trade and in some cases it accounts for almost all the
gain-from-trade, leaving almost no gain-from-trade to the traders. We present
SBBA: a variant of McAfee's mechanism which is strongly budget-balanced. There
is a single price, all money is exchanged between buyers and sellers and no
money is left on the table. This means that all gain-from-trade is enjoyed by
the traders. We generalize this variant to spatially-distributed markets with
transit costs.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 15:48:27 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Segal-Halevi",
"Erel",
""
],
[
"Hassidim",
"Avinatan",
""
],
[
"Aumann",
"Yonatan",
""
]
] |
new_dataset
| 0.998957 |
1608.06990
|
Dileep Kalathil
|
Dileep Kalathil, Chenye Wu, Kameshwar Poolla, Pravin Varaiya
|
The Sharing Economy for the Smart Grid
|
11 pages, 11 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The sharing economy has disrupted housing and transportation sectors.
Homeowners can rent out their property when they are away on vacation, car
owners can offer ride sharing services. These sharing economy business models
are based on monetizing under-utilized infrastructure. They are enabled by
peer-to-peer platforms that match eager sellers with willing buyers.
Are there compelling sharing economy opportunities in the electricity sector?
What products or services can be shared in tomorrow's Smart Grid? We begin by
exploring sharing economy opportunities in the electricity sector, and discuss
regulatory and technical obstacles to these opportunities. We then study the
specific problem of a collection of firms sharing their electricity storage. We
characterize equilibrium prices for shared storage in a spot market. We
formulate storage investment decisions of the firms as a non-convex
non-cooperative game. We show that under a mild alignment condition, a Nash
equilibrium exists, it is unique, and it supports the social welfare. We
discuss technology platforms necessary for the physical exchange of power, and
market platforms necessary to trade electricity storage. We close with
synthetic examples to illustrate our ideas.
|
[
{
"version": "v1",
"created": "Thu, 25 Aug 2016 00:04:23 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Sep 2016 03:45:06 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Kalathil",
"Dileep",
""
],
[
"Wu",
"Chenye",
""
],
[
"Poolla",
"Kameshwar",
""
],
[
"Varaiya",
"Pravin",
""
]
] |
new_dataset
| 0.962999 |
1609.01317
|
Nils Kopal <
|
Nils Kopal
|
Volume Raycasting mit OpenCL
|
11 pages, 15 figures, a German paper written for a 3D modeling
masters course in applied computer science at the University of
Duisburg-Essen in 2011
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This German paper was written entirely at the University of Duisburg-Essen in
2011 for a 3D modeling masters course in applied computer science. We publish
this paper, thus, interested people can acquire a first impression of the topic
"volume raycasting". In addition to writing this paper, we developed a
functioning open-source OpenCL raycaster. A video of this raycaster is
available: http://www.youtube.com/watch?v=VMMsQnf4zEY. Additionally, we
archived and published the complete source code of the raycaster in the Google
Code Archive: http://code.google.com/p/gputracer/. If this is no longer the
case, those who are interested can also write an email to the author, hence, we
can provide the source code.
This paper provides an introduction and overview of the topic "volume ray
casting with OpenCL". We show how volume data can be loaded, manipulated, and
visualized by modern GPUs in real time. In addition, we present basic
algorithms and data structures that are necessary for building such a
raycaster. Then, we describe how we built a rudimentary raycaster using OpenCL
and .NET C#. Furthermore, we analyze different gradient operators
(CentralDifference, Sobel3D and Zucker-Hummel) for surface detection and show
an evaluation of these with respect to their performance. Finally, we present
optimization techniques (hitpoint refinement, adaptive sampling, octrees, and
empty-space-skipping) for improving a raycaster.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 20:26:24 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Kopal",
"Nils",
""
]
] |
new_dataset
| 0.969411 |
1609.01322
|
Tugcan Aktas
|
Tugcan Aktas, Giorgio Quer, Tara Javidi, Ramesh R. Rao
|
Mobile Relays for Smart Cities: Mathematical Proofs
|
Technical Report of detailed mathematical proofs for supporting "From
Connected Vehicles to Mobile Relays: Enhanced Wireless Infrastructure for
Smarter Cities", which is to appear in IEEE Global Communications Conference,
Dec. 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increasing number of connected vehicles in densely populated urban areas
provides an interesting opportunity to counteract the high wireless data
demands in high density and highly mobile scenarios. The idea is to support the
macro base station (BS) with a secondary communication tier composed of a set
of smart and connected vehicles that are in movement in the urban area.
As a first step towards a comprehensive cost-benefit analysis of this
architecture, this paper considers the case where these vehicles are equipped
with femto-mobile Access Points (fmAPs) and constitute a mobile out-of-band
relay infrastructure. In particular, three techniques to select an fmAP (if
more than one is available) are proposed and the maximal feasible gain in the
packet delivery rate and data rate as a function of the vehicle density,
average vehicle speeds, handoff overhead cost, as well as physical layer
parameters is characterized. The analytical and simulation results provide a
first benchmark characterizing this architecture and the definition of
guidelines for its future realistic study and implementation.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 20:49:43 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Aktas",
"Tugcan",
""
],
[
"Quer",
"Giorgio",
""
],
[
"Javidi",
"Tara",
""
],
[
"Rao",
"Ramesh R.",
""
]
] |
new_dataset
| 0.989975 |
1609.01437
|
Alonso Silva
|
Albert Y.S. Lam, Longbo Huang, Alonso Silva, Walid Saad
|
A multi-layer market for vehicle-to-grid energy trading in the smart
grid
| null |
IEEE INFOCOM Workshop on Green Networking and Smart Grids (CCSES),
Mar 2012, Orlando, Florida, United States. pp.85 - 90
|
10.1109/INFCOMW.2012.6193525
| null |
cs.GT cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a multi-layer market for vehicle-to-grid energy
trading. In the macro layer, we consider a double auction mechanism, under
which the utility company act as an auctioneer and energy buyers and sellers
interact. This double auction mechanism is strategy-proof and converges
asymptotically. In the micro layer, the aggregators, which are the sellers in
the macro layer, are paid with commissions to sell the energy of plug-in hybrid
electric vehicles (PHEVs) and to maximize their utilities. We analyze the
interaction between the macro and micro layers and study some simplified cases.
Depending on the elasticity of supply and demand, the utility is analyzed under
different scenarios. Simulation results show that our approach can
significantly increase the utility of PHEVs.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2016 08:47:19 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Lam",
"Albert Y. S.",
""
],
[
"Huang",
"Longbo",
""
],
[
"Silva",
"Alonso",
""
],
[
"Saad",
"Walid",
""
]
] |
new_dataset
| 0.997513 |
1609.01472
|
Kardi Teknomo
|
Chelcie Narboneta and Kardi Teknomo
|
OpenTripPlanner, OpenStreetMap, General Transit Feed Specification:
Tools for Disaster Relief and Recovery
|
6 pages, Narboneta, C. G. and Teknomo, K. (2014) OpenTripPlanner,
OpenStreetMap, General Transit Feed Specification: Tools for Disaster Relief
and Recovery, Proceeding of the 7th IEEE International Conference Humanoid,
Nanotechnology, Information Technology Communication and Control, Environment
and Management (HNICEM) 12-16 November 2014 Hotel Centro, Puerto Princesa,
Palawan, Philippines
| null | null | null |
cs.CY cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Open Trip Planner was identified as the most promising open source
multi-modal trip planning software. Open Street Map, which provides mapping
data to Open Trip Planner, is one of the most well-known open source
international repository of geographic data. General Transit Feed
Specification, which provides transportation data to Open Trip Planner, has
been the standard for describing transit systems and platform for numerous
applications. Together, when used to implement an instance of Open Trip
Planner, these software has been helping in traffic decongestion all over the
world by assisting commuters to shift from using private transportation modes
to public ones. Their potential however goes beyond providing multi-modal
public transportation routes. This paper aims to first discuss the researchers'
experience in implementing a public transportation route planner for the
purpose of traffic decongestion.The researchers would examine the prospective
of using the system for disaster preparedness and recovery and concrete ways on
how to realize them.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2016 10:11:27 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Narboneta",
"Chelcie",
""
],
[
"Teknomo",
"Kardi",
""
]
] |
new_dataset
| 0.999783 |
1609.01592
|
Siddhartha Jonnalagadda
|
Ravi P Garg, Kalpana Raja, Siddhartha R Jonnalagadda
|
CRTS: A type system for representing clinical recommendations
| null | null | null | null |
cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: Clinical guidelines and recommendations are the driving wheels of
the evidence-based medicine (EBM) paradigm, but these are available primarily
as unstructured text and are generally highly heterogeneous in nature. This
significantly reduces the dissemination and automatic application of these
recommendations at the point of care. A comprehensive structured representation
of these recommendations is highly beneficial in this regard. Objective: The
objective of this paper to present Clinical Recommendation Type System (CRTS),
a common type system that can effectively represent a clinical recommendation
in a structured form. Methods: CRTS is built by analyzing 125 recommendations
and 195 research articles corresponding to 6 different diseases available from
UpToDate, a publicly available clinical knowledge system, and from the National
Guideline Clearinghouse, a public resource for evidence-based clinical practice
guidelines. Results: We show that CRTS not only covers the recommendations but
also is flexible to be extended to represent information from primary
literature. We also describe how our developed type system can be applied for
clinical decision support, medical knowledge summarization, and citation
retrieval. Conclusion: We showed that our proposed type system is precise and
comprehensive in representing a large sample of recommendations available for
various disorders. CRTS can now be used to build interoperable information
extraction systems that automatically extract clinical recommendations and
related data elements from clinical evidence resources, guidelines, systematic
reviews and primary publications.
Keywords: guidelines and recommendations, type system, clinical decision
support, evidence-based medicine, information storage and retrieval
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2016 15:02:03 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Garg",
"Ravi P",
""
],
[
"Raja",
"Kalpana",
""
],
[
"Jonnalagadda",
"Siddhartha R",
""
]
] |
new_dataset
| 0.987128 |
1609.01622
|
Ripudaman Singh
|
Ripudaman Singh, Brijesh Kumar Rai, and Sanjay Kumar Bose
|
A Cross-layer Contention Based Synchronous MAC Protocol for Transmission
Delay Reduction in Multi-Hop WSNs
|
Accepted to TENCON 2016
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently designed cross-layer contention based synchronous MAC protocols like
the PRMAC protocol, for wireless sensor networks (WSNs) enable a node to
schedule multi-hop transmission of multiple data packets in a cycle. However,
these systems accommodate both the request-to-send data process and the
confirmation-to-send data process in the same data transmission scheduling
window (i.e. data window). This reduces the length of the multi-hop flow setup
in the data window. In a multi-hop scenario, this degrades both the packet
delivery ratio (PDR) and the end-to-end transmission delay (E2ETD). In this
paper, we propose a cross-layer contention based synchronous MAC protocol,
which accommodates the request-to-send data process in the data window and the
confirmation-to-send data process in the sleep window for increased efficiency.
We evaluate our proposed protocol through ns-2.35 simulations and compare its
performance with the PRMAC protocol. Results suggest that in multi-hop
scenario, proposed protocol outperforms PRMAC both in terms of the E2ETD and
the packet delivery ratio (PDR).
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2016 15:51:59 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Singh",
"Ripudaman",
""
],
[
"Rai",
"Brijesh Kumar",
""
],
[
"Bose",
"Sanjay Kumar",
""
]
] |
new_dataset
| 0.971168 |
cs/0508114
|
Xiangyong Zeng
|
Xiangyong Zeng, Lei Hu, Qingchong Liu
|
A Family of Binary Sequences with Optimal Correlation Property and Large
Linear Span
|
21 pages
| null |
10.1093/ietfec/e89-a.7.2029
| null |
cs.CR cs.IT math.IT
| null |
A family of binary sequences is presented and proved to have optimal
correlation property and large linear span. It includes the small set of Kasami
sequences, No sequence set and TN sequence set as special cases. An explicit
lower bound expression on the linear span of sequences in the family is given.
With suitable choices of parameters, it is proved that the family has
exponentially larger linear spans than both No sequences and TN sequences. A
class of ideal autocorrelation sequences is also constructed and proved to have
large linear span.
|
[
{
"version": "v1",
"created": "Thu, 25 Aug 2005 14:16:36 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Sep 2005 14:40:51 GMT"
}
] | 2016-09-07T00:00:00 |
[
[
"Zeng",
"Xiangyong",
""
],
[
"Hu",
"Lei",
""
],
[
"Liu",
"Qingchong",
""
]
] |
new_dataset
| 0.997462 |
1512.07849
|
Konrad Dabrowski
|
Konrad K. Dabrowski, Fran\c{c}ois Dross, Dani\"el Paulusma
|
Colouring Diamond-free Graphs
|
30 pages, 3 figures. An extended abstract of this paper was published
in the proceedings of SWAT 2016 (DOI:10.4230/LIPIcs.SWAT.2016.16)
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Colouring problem is that of deciding, given a graph $G$ and an integer
$k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five
vertices, we classify the computational complexity of Colouring for
$(\mbox{diamond},H)$-free graphs. Our proof is based on combining known results
together with proving that the clique-width is bounded for $(\mbox{diamond},
P_1+2P_2)$-free graphs. Our technique for handling this case is to reduce the
graph under consideration to a $k$-partite graph that has a very specific
decomposition. As a by-product of this general technique we are also able to
prove boundedness of clique-width for four other new classes of
$(H_1,H_2)$-free graphs. As such, our work also continues a recent systematic
study into the (un)boundedness of clique-width of $(H_1,H_2)$-free graphs, and
our five new classes of bounded clique-width reduce the number of open cases
from 13 to 8.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 16:23:35 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Sep 2016 09:22:03 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Dabrowski",
"Konrad K.",
""
],
[
"Dross",
"François",
""
],
[
"Paulusma",
"Daniël",
""
]
] |
new_dataset
| 0.990104 |
1601.04485
|
Jose Velasco
|
Jose Velasco, Daniel Pizarro, Javier Macias-Guarasa and Afsaneh Asaei
|
TDOA Matrices: Algebraic Properties and their Application to Robust
Denoising with Missing Data
| null |
IEEE Transactions on Signal Processing ( Volume: 64, Issue: 20,
Oct.15, 15 2016 )
|
10.1109/TSP.2016.2593690
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Measuring the Time delay of Arrival (TDOA) between a set of sensors is the
basic setup for many applications, such as localization or signal beamforming.
This paper presents the set of TDOA matrices, which are built from noise-free
TDOA measurements, not requiring knowledge of the sensor array geometry. We
prove that TDOA matrices are rank-two and have a special SVD decomposition that
leads to a compact linear parametric representation. Properties of TDOA
matrices are applied in this paper to perform denoising, by finding the TDOA
matrix closest to the matrix composed with noisy measurements. The paper shows
that this problem admits a closed-form solution for TDOA measurements
contaminated with Gaussian noise which extends to the case of having missing
data. The paper also proposes a novel robust denoising method resistant to
outliers, missing data and inspired in recent advances in robust low-rank
estimation. Experiments in synthetic and real datasets show TDOA-based
localization, both in terms of TDOA accuracy estimation and localization error.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 12:01:45 GMT"
},
{
"version": "v2",
"created": "Tue, 24 May 2016 14:00:01 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Velasco",
"Jose",
""
],
[
"Pizarro",
"Daniel",
""
],
[
"Macias-Guarasa",
"Javier",
""
],
[
"Asaei",
"Afsaneh",
""
]
] |
new_dataset
| 0.988752 |
1608.02183
|
Dapeng Tao
|
Yanan Guo, Lei Li, Weifeng Liu, Jun Cheng, and Dapeng Tao
|
Multiview Cauchy Estimator Feature Embedding for Depth and Inertial
Sensor-Based Human Action Recognition
|
This paper has been withdrawn by the author due to a crucial error
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ever-growing popularity of Kinect and inertial sensors has prompted
intensive research efforts on human action recognition. Since human actions can
be characterized by multiple feature representations extracted from Kinect and
inertial sensors, multiview features must be encoded into a unified space
optimal for human action recognition. In this paper, we propose a new
unsupervised feature fusion method termed Multiview Cauchy Estimator Feature
Embedding (MCEFE) for human action recognition. By minimizing empirical risk,
MCEFE integrates the encoded complementary information in multiple views to
find the unified data representation and the projection matrices. To enhance
robustness to outliers, the Cauchy estimator is imposed on the reconstruction
error. Furthermore, ensemble manifold regularization is enforced on the
projection matrices to encode the correlations between different views and
avoid overfitting. Experiments are conducted on the new Chinese Academy of
Sciences - Yunnan University - Multimodal Human Action Database (CAS-YNU-MHAD)
to demonstrate the effectiveness and robustness of MCEFE for human action
recognition.
|
[
{
"version": "v1",
"created": "Sun, 7 Aug 2016 05:50:10 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Sep 2016 08:37:23 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Guo",
"Yanan",
""
],
[
"Li",
"Lei",
""
],
[
"Liu",
"Weifeng",
""
],
[
"Cheng",
"Jun",
""
],
[
"Tao",
"Dapeng",
""
]
] |
new_dataset
| 0.950777 |
1608.07568
|
Daniel Kral
|
Zdenek Dvorak, Daniel Kral, Bojan Mohar
|
Graphic TSP in cubic graphs
| null | null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP
for cubic graphs, which improves the previously best approximation factor of
1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at
the same time. To design our algorithm, we prove that every simple 2-connected
cubic n-vertex graph contains a spanning closed walk of length at most 9n/7-1,
and that such a walk can be found in polynomial time.
|
[
{
"version": "v1",
"created": "Fri, 26 Aug 2016 19:39:42 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Aug 2016 13:23:23 GMT"
},
{
"version": "v3",
"created": "Mon, 5 Sep 2016 15:42:17 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Dvorak",
"Zdenek",
""
],
[
"Kral",
"Daniel",
""
],
[
"Mohar",
"Bojan",
""
]
] |
new_dataset
| 0.989364 |
1609.00435
|
David Jurgens
|
David Jurgens, Srijan Kumar, Raine Hoover, Dan McFarland, Dan Jurafsky
|
Citation Classification for Behavioral Analysis of a Scientific Field
| null | null | null | null |
cs.CL cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Citations are an important indicator of the state of a scientific field,
reflecting how authors frame their work, and influencing uptake by future
scholars. However, our understanding of citation behavior has been limited to
small-scale manual citation analysis. We perform the largest behavioral study
of citations to date, analyzing how citations are both framed and taken up by
scholars in one entire field: natural language processing. We introduce a new
dataset of nearly 2,000 citations annotated for function and centrality, and
use it to develop a state-of-the-art classifier and label the entire ACL
Reference Corpus. We then study how citations are framed by authors and use
both papers and online traces to track how citations are followed by readers.
We demonstrate that authors are sensitive to discourse structure and
publication venue when citing, that online readers follow temporal links to
previous and future work rather than methodological links, and that how a paper
cites related work is predictive of its citation count. Finally, we use changes
in citation roles to show that the field of NLP is undergoing a significant
increase in consensus.
|
[
{
"version": "v1",
"created": "Fri, 2 Sep 2016 00:40:15 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Jurgens",
"David",
""
],
[
"Kumar",
"Srijan",
""
],
[
"Hoover",
"Raine",
""
],
[
"McFarland",
"Dan",
""
],
[
"Jurafsky",
"Dan",
""
]
] |
new_dataset
| 0.998519 |
1609.01055
|
Gilles Tredan
|
Gilles Tredan and Hans Peter Schwefel
|
Fast Abstracts and Student Forum Proceedings - EDCC 2016 - 12th European
Dependable Computing Conference
|
12th European Dependable Computing Conference, Gothenburg, Sweden,
September 5-9, 2016
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Fast Abstracts are short presentations of work in progress or opinion pieces
and aim to serve as a rapid and flexible mechanism to (i) Report on current
work that may or may not be complete; (ii) Introduce new ideas to the
community; (iii) State positions on controversial issues or open problems. On
the other hand, the goal of the Student Forum is to encourage students to
attend EDCC and present their work, exchange ideas with researchers and
practitioners, and get early feedback on their research efforts.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 08:27:10 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Tredan",
"Gilles",
""
],
[
"Schwefel",
"Hans Peter",
""
]
] |
new_dataset
| 0.996579 |
1609.01088
|
Evgeny Burnaev
|
Mikhail Belyaev, Evgeny Burnaev, Ermek Kapushev, Maxim Panov, Pavel
Prikhodko, Dmitry Vetrov, Dmitry Yarotsky
|
GTApprox: surrogate modeling for industrial design
|
31 pages, 11 figures
| null | null | null |
cs.MS cs.CE stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe GTApprox - a new tool for medium-scale surrogate modeling in
industrial design. Compared to existing software, GTApprox brings several
innovations: a few novel approximation algorithms, several advanced methods of
automated model selection, novel options in the form of hints. We demonstrate
the efficiency of GTApprox on a large collection of test problems. In addition,
we describe several applications of GTApprox to real engineering problems.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 10:41:14 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Belyaev",
"Mikhail",
""
],
[
"Burnaev",
"Evgeny",
""
],
[
"Kapushev",
"Ermek",
""
],
[
"Panov",
"Maxim",
""
],
[
"Prikhodko",
"Pavel",
""
],
[
"Vetrov",
"Dmitry",
""
],
[
"Yarotsky",
"Dmitry",
""
]
] |
new_dataset
| 0.997747 |
1609.01186
|
Joaquin Torr\'e Zaffaroni
|
Camilo Melani, Juan V. Echag\"ue, Joaqu\'in Torre Zaffaroni, Daniel
Yankelevich
|
Un caso de big data punta a punta: an\'alisis de datos de transporte y
su uso en el negocio
|
3 pages, in Spanish, 1 figure in Proceedings de AGRANDA 2015,
Rosario, 2015
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we present the results of a data analysis project for a
public-transport company. This project encompassed data preparation, analysis
and visualization of three years of historical data. The data consisted in
ticket purchases and GPS location of the vehicles. This work describes the
project from start to end, including the incorporation of the results in the
business process.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 14:55:03 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Melani",
"Camilo",
""
],
[
"Echagüe",
"Juan V.",
""
],
[
"Zaffaroni",
"Joaquín Torre",
""
],
[
"Yankelevich",
"Daniel",
""
]
] |
new_dataset
| 0.995313 |
1609.01190
|
Harshit Gupta
|
Harshit Gupta, Shubha Brata Nath, Sandip Chakraborty, Soumya K. Ghosh
|
SDFog: A Software Defined Computing Architecture for QoS Aware Service
Orchestration over Edge Devices
|
This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing revolutionized the information technology (IT) industry by
offering dynamic and infinite scaling, on-demand resources and utility-oriented
usage. However, recent changes in user traffic and requirements have exposed
the shortcomings of cloud computing, particularly the inability to deliver
real-time responses and handle massive surge in data volumes. Fog computing,
that brings back partial computation load from the cloud to the edge devices,
is envisioned to be the next big change in computing, and has the potential to
address these challenges. Being a highly distributed, loosely coupled and still
in the emerging phase, standardization, quality-of-service management and
dynamic adaptability are the key challenges faced by fog computing research
fraternity today. This article aims to address these issues by proposing a
service-oriented middleware that leverages the convergence of cloud and fog
computing along with software defined networking (SDN) and network function
virtualization (NFV) to achieve the aforementioned goals. The proposed system,
called "Software Defined Fog" (SDFog), abstracts connected entities as services
and allows applications to orchestrate these services with end-to-end QoS
requirements. A use-case showing the necessity of such a middleware has been
presented to show the efficacy of the SDN-based QoS control over the Fog. This
article aims at developing an integrated system to realize the software-defined
control over fog infrastructure.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 15:02:07 GMT"
}
] | 2016-09-06T00:00:00 |
[
[
"Gupta",
"Harshit",
""
],
[
"Nath",
"Shubha Brata",
""
],
[
"Chakraborty",
"Sandip",
""
],
[
"Ghosh",
"Soumya K.",
""
]
] |
new_dataset
| 0.996232 |
0801.1927
|
Paul M. Aoki
|
Rowena Luk, Melissa Ho, Paul M. Aoki
|
Asynchronous Remote Medical Consultation for Ghana
|
10 pages
| null |
10.1145/1357054.1357173
| null |
cs.HC
| null |
Computer-mediated communication systems can be used to bridge the gap between
doctors in underserved regions with local shortages of medical expertise and
medical specialists worldwide. To this end, we describe the design of a
prototype remote consultation system intended to provide the social,
institutional and infrastructural context for sustained, self-organizing growth
of a globally-distributed Ghanaian medical community. The design is grounded in
an iterative design process that included two rounds of extended design
fieldwork throughout Ghana and draws on three key design principles (social
networks as a framework on which to build incentives within a self-organizing
network; optional and incremental integration with existing referral
mechanisms; and a weakly-connected, distributed architecture that allows for a
highly interactive, responsive system despite failures in connectivity). We
discuss initial experiences from an ongoing trial deployment in southern Ghana.
|
[
{
"version": "v1",
"created": "Sat, 12 Jan 2008 23:43:18 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Luk",
"Rowena",
""
],
[
"Ho",
"Melissa",
""
],
[
"Aoki",
"Paul M.",
""
]
] |
new_dataset
| 0.999021 |
0905.0200
|
Paul M. Aoki
|
Paul M. Aoki, R.J. Honicky, Alan Mainwaring, Chris Myers, Eric Paulos,
Sushmita Subramanian, Allison Woodruff
|
A Vehicle for Research: Using Street Sweepers to Explore the Landscape
of Environmental Community Action
|
10 pages
|
Proc. ACM SIGCHI Conf. on Human Factors in Computing Systems,
Boston, MA, Apr. 2009, 375-384. ACM Press
|
10.1145/1518701.1518762
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Researchers are developing mobile sensing platforms to facilitate public
awareness of environmental conditions. However, turning such awareness into
practical community action and political change requires more than just
collecting and presenting data. To inform research on mobile environmental
sensing, we conducted design fieldwork with government, private, and public
interest stakeholders. In parallel, we built an environmental air quality
sensing system and deployed it on street sweeping vehicles in a major U.S.
city; this served as a "research vehicle" by grounding our interviews and
affording us status as environmental action researchers. In this paper, we
present a qualitative analysis of the landscape of environmental action,
focusing on insights that will help researchers frame meaningful technological
interventions.
|
[
{
"version": "v1",
"created": "Sat, 2 May 2009 11:42:50 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Aoki",
"Paul M.",
""
],
[
"Honicky",
"R. J.",
""
],
[
"Mainwaring",
"Alan",
""
],
[
"Myers",
"Chris",
""
],
[
"Paulos",
"Eric",
""
],
[
"Subramanian",
"Sushmita",
""
],
[
"Woodruff",
"Allison",
""
]
] |
new_dataset
| 0.998009 |
1603.03758
|
Dane Bell
|
Dane Bell and Gus Hahn-Powell and Marco A. Valenzuela-Esc\'arcega and
Mihai Surdeanu
|
Sieve-based Coreference Resolution in the Biomedical Domain
|
This paper appears in LREC 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe challenges and advantages unique to coreference resolution in the
biomedical domain, and a sieve-based architecture that leverages domain
knowledge for both entity and event coreference resolution. Domain-general
coreference resolution algorithms perform poorly on biomedical documents,
because the cues they rely on such as gender are largely absent in this domain,
and because they do not encode domain-specific knowledge such as the number and
type of participants required in chemical reactions. Moreover, it is difficult
to directly encode this knowledge into most coreference resolution algorithms
because they are not rule-based. Our rule-based architecture uses sequentially
applied hand-designed "sieves", with the output of each sieve informing and
constraining subsequent sieves. This architecture provides a 3.2% increase in
throughput to our Reach event extraction system with precision parallel to that
of the stricter system that relies solely on syntactic patterns for extraction.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 20:48:49 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Sep 2016 18:32:35 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Bell",
"Dane",
""
],
[
"Hahn-Powell",
"Gus",
""
],
[
"Valenzuela-Escárcega",
"Marco A.",
""
],
[
"Surdeanu",
"Mihai",
""
]
] |
new_dataset
| 0.998716 |
1608.05971
|
Mohsen Fayyaz
|
Mohsen Fayyaz, Mohammad Hajizadeh Saffar, Mohammad Sabokrou, Mahmood
Fathy, Reinhard Klette, Fay Huang
|
STFCN: Spatio-Temporal FCN for Semantic Video Segmentation
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper presents a novel method to involve both spatial and temporal
features for semantic video segmentation. Current work on convolutional neural
networks(CNNs) has shown that CNNs provide advanced spatial features supporting
a very good performance of solutions for both image and video analysis,
especially for the semantic segmentation task. We investigate how involving
temporal features also has a good effect on segmenting video data. We propose a
module based on a long short-term memory (LSTM) architecture of a recurrent
neural network for interpreting the temporal characteristics of video frames
over time. Our system takes as input frames of a video and produces a
correspondingly-sized output; for segmenting the video our method combines the
use of three components: First, the regional spatial features of frames are
extracted using a CNN; then, using LSTM the temporal features are added;
finally, by deconvolving the spatio-temporal features we produce pixel-wise
predictions. Our key insight is to build spatio-temporal convolutional networks
(spatio-temporal CNNs) that have an end-to-end architecture for semantic video
segmentation. We adapted fully some known convolutional network architectures
(such as FCN-AlexNet and FCN-VGG16), and dilated convolution into our
spatio-temporal CNNs. Our spatio-temporal CNNs achieve state-of-the-art
semantic segmentation, as demonstrated for the Camvid and NYUDv2 datasets.
|
[
{
"version": "v1",
"created": "Sun, 21 Aug 2016 17:34:08 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Sep 2016 15:51:49 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Fayyaz",
"Mohsen",
""
],
[
"Saffar",
"Mohammad Hajizadeh",
""
],
[
"Sabokrou",
"Mohammad",
""
],
[
"Fathy",
"Mahmood",
""
],
[
"Klette",
"Reinhard",
""
],
[
"Huang",
"Fay",
""
]
] |
new_dataset
| 0.950226 |
1608.07662
|
Seok-Hee Hong
|
Seok-Hee Hong, Hiroshi Nagamochi
|
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016). This is an extended
abstract. For a full version of this paper, see Hong S-H, Nagamochi H.:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time,
Technical Report TR 2016-002, Department of Applied Mathematics and Physics,
Kyoto University (2016)
| null | null |
Technical Report TR 2016-002, Department of Applied Mathematics and
Physics, Kyoto University (2016)
|
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thomassen characterized some 1-plane embedding as the forbidden configuration
such that a given 1-plane embedding of a graph is drawable in straight-lines if
and only if it does not contain the configuration [C. Thomassen, Rectilinear
drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988].
In this paper, we characterize some 1-plane embedding as the forbidden
configuration such that a given 1-plane embedding of a graph can be re-embedded
into a straight-line drawable 1-plane embedding of the same graph if and only
if it does not contain the configuration. Re-embedding of a 1-plane embedding
preserves the same set of pairs of crossing edges.
We give a linear-time algorithm for finding a straight-line drawable 1-plane
re-embedding or the forbidden configuration.
|
[
{
"version": "v1",
"created": "Sat, 27 Aug 2016 05:29:29 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Sep 2016 14:47:27 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Hong",
"Seok-Hee",
""
],
[
"Nagamochi",
"Hiroshi",
""
]
] |
new_dataset
| 0.998089 |
1609.00653
|
Markus Fidler
|
Ralf L\"ubben, Markus Fidler
|
A Benchmark for the Performance of Time-varying Closed-loop Flow Control
with Application to TCP
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Closed-loop flow control protocols, such as the prominent implementation TCP,
are prevalent in the Internet, today. TCP has continuously been improved for
greedy traffic sources to achieve high throughput over networks with large
bandwidth delay products. Recently, the increasing use for streaming and
interactive applications, such as voice and video, has shifted the focus
towards its delay performance. Given the need for real-time communication of
non-greedy sources via TCP, we present an estimation method for performance
evaluation of closed-loop flow control protocols. We characterize an end-to-end
connection by a transfer function that provides statistical service guarantees
for arbitrary traffic. The estimation is based on end-to-end measurements at
the application level that include all effects induced by the network and by
the protocol stacks of the end systems. From our measurements, we identify
different causes for delays. We show that significant delays are due to
queueing in protocol stacks. Notably, this occurs even if the utilization is
moderate. Using our estimation method, we compare the impact of fundamental
mechanisms of TCP on delays at the application level: In detail, we analyze
parameters relevant for network dimensioning, including buffer provisioning and
active queue management, and parameters for server configuration, such as the
congestion control algorithm. By applying our method as a benchmark, we find
that a good selection can largely improve the delay performance of TCP.
|
[
{
"version": "v1",
"created": "Fri, 2 Sep 2016 16:20:22 GMT"
}
] | 2016-09-05T00:00:00 |
[
[
"Lübben",
"Ralf",
""
],
[
"Fidler",
"Markus",
""
]
] |
new_dataset
| 0.999124 |
0905.0203
|
Paul M. Aoki
|
Rowena Luk, Matei Zaharia, Melissa Ho, Brian Levine, Paul M. Aoki
|
ICTD for Healthcare in Ghana: Two Parallel Case Studies
|
11 pages
|
Proc. IEEE/ACM Conf. on Information and Communication Technologies
and Development, Doha, Qatar, Apr. 2009, 118-128. IEEE CS Press
|
10.1109/ICTD.2009.5426714
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper examines two parallel case studies to promote remote medical
consultation in Ghana. These projects, initiated independently by different
researchers in different organizations, both deployed ICT solutions in the same
medical community in the same year. The Ghana Consultation Network currently
has over 125 users running a Web-based application over a delay-tolerant
network of servers. OneTouch MedicareLine is currently providing 1700 doctors
in Ghana with free mobile phone calls and text messages to other members of the
medical community. We present the consequences of (1) the institutional context
and identity of the investigators, as well as specific decisions made with
respect to (2) partnerships formed, (3) perceptions of technological
infrastructure, and (4) high-level design decisions. In concluding, we discuss
lessons learned and high-level implications for future ICTD research agendas.
|
[
{
"version": "v1",
"created": "Sat, 2 May 2009 11:54:52 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Luk",
"Rowena",
""
],
[
"Zaharia",
"Matei",
""
],
[
"Ho",
"Melissa",
""
],
[
"Levine",
"Brian",
""
],
[
"Aoki",
"Paul M.",
""
]
] |
new_dataset
| 0.995854 |
1607.01196
|
Fabian Lipp
|
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky,
Oleg Verbitsky, Alexander Wolff
|
Drawing Graphs on Few Lines and Few Planes
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the problem of drawing graphs in 2D and 3D such that their
edges (or only their vertices) can be covered by few lines or planes. We insist
on straight-line edges and crossing-free drawings. This problem has many
connections to other challenging graph-drawing problems such as small-area or
small-volume drawings, layered or track drawings, and drawing graphs with low
visual complexity. While some facts about our problem are implicit in previous
work, this is the first treatment of the problem in its full generality. Our
contribution is as follows.
We show lower and upper bounds for the numbers of lines and planes needed for
covering drawings of graphs in certain graph classes. In some cases our bounds
are asymptotically tight; in some cases we are able to determine exact values.
We relate our parameters to standard combinatorial characteristics of graphs
(such as the chromatic number, treewidth, maximum degree, or arboricity) and to
parameters that have been studied in graph drawing (such as the track number or
the number of segments appearing in a drawing).
We pay special attention to planar graphs. For example, we show that there
are planar graphs that can be drawn in 3-space on a lot fewer lines than in the
plane.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 11:23:46 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Sep 2016 17:32:39 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Chaplick",
"Steven",
""
],
[
"Fleszar",
"Krzysztof",
""
],
[
"Lipp",
"Fabian",
""
],
[
"Ravsky",
"Alexander",
""
],
[
"Verbitsky",
"Oleg",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.972402 |
1607.06275
|
Peng Li
|
Peng Li, Wei Li, Zhengyan He, Xuguang Wang, Ying Cao, Jie Zhou, Wei Xu
|
Dataset and Neural Recurrent Sequence Labeling Model for Open-Domain
Factoid Question Answering
|
10 pages, 3 figures, withdraw experimental results on CNN/Daily Mail
datasets
| null | null | null |
cs.CL cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While question answering (QA) with neural network, i.e. neural QA, has
achieved promising results in recent years, lacking of large scale real-word QA
dataset is still a challenge for developing and evaluating neural QA system. To
alleviate this problem, we propose a large scale human annotated real-world QA
dataset WebQA with more than 42k questions and 556k evidences. As existing
neural QA methods resolve QA either as sequence generation or
classification/ranking problem, they face challenges of expensive softmax
computation, unseen answers handling or separate candidate answer generation
component. In this work, we cast neural QA as a sequence labeling problem and
propose an end-to-end sequence labeling model, which overcomes all the above
challenges. Experimental results on WebQA show that our model outperforms the
baselines significantly with an F1 score of 74.69% with word-based input, and
the performance drops only 3.72 F1 points with more challenging character-based
input.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2016 11:40:50 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Sep 2016 10:56:45 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Li",
"Peng",
""
],
[
"Li",
"Wei",
""
],
[
"He",
"Zhengyan",
""
],
[
"Wang",
"Xuguang",
""
],
[
"Cao",
"Ying",
""
],
[
"Zhou",
"Jie",
""
],
[
"Xu",
"Wei",
""
]
] |
new_dataset
| 0.998786 |
1608.00936
|
Saad Nadeem
|
Saad Nadeem and Arie Kaufman
|
Multimodal Brain Visualization
|
SPIE Medical Imaging 2016, Proc. SPIE Medical Imaging: Biomedical
Applications in Molecular, Structural, and Functional Imaging, 2016
|
SPIE Medical Imaging, pp. 97881Y-97881Y. 2016
|
10.1117/12.2217003
| null |
cs.GR q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current connectivity diagrams of human brain image data are either overly
complex or overly simplistic. In this work we introduce simple yet accurate
interactive visual representations of multiple brain image structures and the
connectivity among them. We map cortical surfaces extracted from human brain
magnetic resonance imaging (MRI) data onto 2D surfaces that preserve shape
(angle), extent (area), and spatial (neighborhood) information for 2D (circular
disk) and 3D (spherical) mapping, split these surfaces into separate patches,
and cluster functional and diffusion tractography MRI connections between pairs
of these patches. The resulting visualizations are easier to compute on and
more visually intuitive to interact with than the original data, and facilitate
simultaneous exploration of multiple data sets, modalities, and statistical
maps.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 19:02:40 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Aug 2016 17:01:31 GMT"
},
{
"version": "v3",
"created": "Tue, 9 Aug 2016 19:55:31 GMT"
},
{
"version": "v4",
"created": "Thu, 1 Sep 2016 14:51:28 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Nadeem",
"Saad",
""
],
[
"Kaufman",
"Arie",
""
]
] |
new_dataset
| 0.959756 |
1609.00070
|
Arun Tejasvi Chaganty
|
Arun Tejasvi Chaganty and Percy Liang
|
How Much is 131 Million Dollars? Putting Numbers in Perspective with
Compositional Descriptions
| null |
ACL (2016), 578-587
|
10.18653/v1/P16-1055
| null |
cs.CL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
How much is 131 million US dollars? To help readers put such numbers in
context, we propose a new task of automatically generating short descriptions
known as perspectives, e.g. "$131 million is about the cost to employ everyone
in Texas over a lunch period". First, we collect a dataset of numeric mentions
in news articles, where each mention is labeled with a set of rated
perspectives. We then propose a system to generate these descriptions
consisting of two steps: formula construction and description generation. In
construction, we compose formulae from numeric facts in a knowledge base and
rank the resulting formulas based on familiarity, numeric proximity and
semantic compatibility. In generation, we convert a formula into natural
language using a sequence-to-sequence recurrent neural network. Our system
obtains a 15.2% F1 improvement over a non-compositional baseline at formula
construction and a 12.5 BLEU point improvement over a baseline description
generation.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2016 00:20:41 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Chaganty",
"Arun Tejasvi",
""
],
[
"Liang",
"Percy",
""
]
] |
new_dataset
| 0.993243 |
1609.00081
|
Tanmoy Chakraborty
|
Tanmoy Chakraborty and Ramasuri Narayanam
|
All Fingers are not Equal: Intensity of References in Scientific
Articles
|
11 pages, 4 figures, 4 tables, Conference on Empirical Methods in
Natural Language Processing (EMNLP 2016)
| null | null | null |
cs.CL cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research accomplishment is usually measured by considering all citations with
equal importance, thus ignoring the wide variety of purposes an article is
being cited for. Here, we posit that measuring the intensity of a reference is
crucial not only to perceive better understanding of research endeavor, but
also to improve the quality of citation-based applications. To this end, we
collect a rich annotated dataset with references labeled by the intensity, and
propose a novel graph-based semi-supervised model, GraLap to label the
intensity of references. Experiments with AAN datasets show a significant
improvement compared to the baselines to achieve the true labels of the
references (46% better correlation). Finally, we provide four applications to
demonstrate how the knowledge of reference intensity leads to design better
real-world applications.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2016 01:34:56 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Chakraborty",
"Tanmoy",
""
],
[
"Narayanam",
"Ramasuri",
""
]
] |
new_dataset
| 0.999144 |
1609.00126
|
Radhika Sukapuram
|
Radhika Sukapuram and Gautam Barua
|
PPCU: Proportional Per-packet Consistent Updates for Software Defined
Networks - A Technical Report
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Software Defined Networks, where the network control plane can be
programmed by updating switch rules, consistently updating switches is a
challenging problem. In a per-packet consistent update (PPC), a packet either
matches the new rules added or the old rules to be deleted, throughout the
network, but not a combination of both. PPC must be preserved during an update
to prevent packet drops and loops, provide waypoint invariance and to apply
policies consistently. No algorithm exists today that confines changes required
during an update to only the affected switches, yet preserves PPC and does not
restrict applicable scenarios. We propose a general update algorithm called
PPCU that preserves PPC, is concurrent and provides an all-or-nothing semantics
for an update, irrespective of the execution speeds of switches and links,
while confining changes to only the affected switches and affected rules. We
use data plane time stamps to identify when the switches must move from the old
rules to the new rules. For this, we use the powerful programming features
provided to the data plane by the emerging programmable switches, which also
guarantee line rate. We prove the algorithm, identify its significant
parameters and analyze the parameters with respect to other algorithms in the
literature.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2016 07:01:36 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Sukapuram",
"Radhika",
""
],
[
"Barua",
"Gautam",
""
]
] |
new_dataset
| 0.991036 |
1609.00133
|
Yuval Elovici
|
Sofia Belikovetsky, Mark Yampolskiy, Jinghui Toh, Yuval Elovici
|
dr0wned - Cyber-Physical Attack with Additive Manufacturing
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Additive manufacturing (AM), or 3D printing, is an emerging manufacturing
technology that is expected to have far-reaching socioeconomic, environmental,
and geopolitical implications. As use of this technology increases, it will
become more common to produce functional parts, including components for
safety-critical systems. AM's dependence on computerization raises the concern
that the manufactured part's quality can be compromised by sabotage. This paper
demonstrates the validity of this concern, as we present the very first full
chain of attack involving AM, beginning with a cyber attack aimed at
compromising a benign AM component, continuing with malicious modification of a
manufactured object's blueprint, leading to the sabotage of the manufactured
functional part, and resulting in the physical destruction of a cyber-physical
system that employs this part. The contributions of this paper are as follows.
We propose a systematic approach to identify opportunities for an attack
involving AM that enables an adversary to achieve his/her goals. Then we
propose a methodology to assess the level of difficulty of an attack, thus
enabling differentiation between possible attack chains. Finally, to
demonstrate the experimental proof for the entire attack chain, we sabotage the
3D printed propeller of a quadcopter UAV, causing the quadcopter to literally
fall from the sky.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2016 07:36:09 GMT"
}
] | 2016-09-02T00:00:00 |
[
[
"Belikovetsky",
"Sofia",
""
],
[
"Yampolskiy",
"Mark",
""
],
[
"Toh",
"Jinghui",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.999156 |
1606.03890
|
Fabrizio Frati
|
Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze,
Vincenzo Roselli
|
Drawing Planar Graphs with Many Collinear Vertices
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider the following problem: Given a planar graph $G$, what is the maximum
number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear
vertices? This problem resides at the core of several graph drawing problems,
including universal point subsets, untangling, and column planarity. The
following results are known for it: Every $n$-vertex planar graph has a planar
straight-line drawing with $\Omega(\sqrt{n})$ collinear vertices; for every
$n$, there is an $n$-vertex planar graph whose every planar straight-line
drawing has $O(n^\sigma)$ collinear vertices, where $\sigma<0.986$; every
$n$-vertex planar graph of treewidth at most two has a planar straight-line
drawing with $\Theta(n)$ collinear vertices. We extend the linear bound to
planar graphs of treewidth at most three and to triconnected cubic planar
graphs. This (partially) answers two open problems posed by Ravsky and
Verbitsky [WG 2011:295--306]. Similar results are not possible for all bounded
treewidth planar graphs or for all bounded degree planar graphs. For planar
graphs of treewidth at most three, our results also imply asymptotically tight
bounds for all of the other above mentioned graph drawing problems.
|
[
{
"version": "v1",
"created": "Mon, 13 Jun 2016 10:46:24 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Jun 2016 11:19:02 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Aug 2016 14:03:38 GMT"
},
{
"version": "v4",
"created": "Wed, 31 Aug 2016 14:02:59 GMT"
}
] | 2016-09-01T00:00:00 |
[
[
"Da Lozzo",
"Giordano",
""
],
[
"Dujmovic",
"Vida",
""
],
[
"Frati",
"Fabrizio",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Roselli",
"Vincenzo",
""
]
] |
new_dataset
| 0.98249 |
1608.08381
|
Adam Woryna
|
Adam Woryna
|
On the set of uniquely decodable codes with a given sequence of code
word lengths
| null |
Discrete Mathematics 340 (2017), pp. 51-57
|
10.1016/j.disc.2016.08.013
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For every natural number $n\geq 2$ and every finite sequence $L$ of natural
numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an
$n$-letter alphabet with the sequence $L$ as the sequence of code word lengths,
as well as its subsets $PR_n(L)$ and $FD_n(L)$ consisting of, respectively, the
prefix codes and the codes with finite delay. We derive the estimation for the
quotient $|UD_n(L)|/|PR_n(L)|$, which allows to characterize those sequences
$L$ for which the equality $PR_n(L)=UD_n(L)$ holds. We also characterize those
sequences $L$ for which the equality $FD_n(L)=UD_n(L)$ holds.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 09:29:08 GMT"
}
] | 2016-09-01T00:00:00 |
[
[
"Woryna",
"Adam",
""
]
] |
new_dataset
| 0.999062 |
1608.08662
|
Marcus Schaefer
|
Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer
|
Hanani-Tutte for Radial Planarity II
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A drawing of a graph $G$ is radial if the vertices of $G$ are placed on
concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are
drawn radially: every edge intersects every circle centered at $c$ at most
once. $G$ is radial planar if it has a radial embedding, that is, a
crossing-free radial drawing. If the vertices of $G$ are ordered or partitioned
into ordered levels (as they are for leveled graphs), we require that the
assignment of vertices to circles corresponds to the given ordering or
leveling. A pair of edges $e$ and $f$ in a graph is independent if $e$ and $f$
do not share a vertex.
We show that a graph $G$ is radial planar if $G$ has a radial drawing in
which every two independent edges cross an even number of times; the radial
embedding has the same leveling as the radial drawing. In other words, we
establish the strong Hanani-Tutte theorem for radial planarity. This
characterization yields a very simple algorithm for radial planarity testing.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 21:41:16 GMT"
}
] | 2016-09-01T00:00:00 |
[
[
"Fulek",
"Radoslav",
""
],
[
"Pelsmajer",
"Michael",
""
],
[
"Schaefer",
"Marcus",
""
]
] |
new_dataset
| 0.998226 |
1608.08740
|
Nachum Dershowitz
|
Nachum Dershowitz
|
1700 Forests
|
For OEIS entry
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since ordered trees and Dyck paths are equinumerous, so are ordered forests
and grand-Dyck paths that start with an upwards step.
|
[
{
"version": "v1",
"created": "Wed, 31 Aug 2016 06:34:20 GMT"
}
] | 2016-09-01T00:00:00 |
[
[
"Dershowitz",
"Nachum",
""
]
] |
new_dataset
| 0.995624 |
1608.08970
|
Md. Jawaherul Alam
|
Md. Jawaherul Alam, Michael T. Goodrich, and Timothy Johnson
|
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java
Bytecode
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a graph visualization tool for visualizing Java bytecode. Our
tool, which we call J-Viz, visualizes connected directed graphs according to a
canonical node ordering, which we call the sibling-first recursive (SFR)
numbering. The particular graphs we consider are derived from applying Shiver's
k-CFA framework to Java bytecode, and our visualizer includes helpful links
between the nodes of an input graph and the Java bytecode that produced it, as
well as a decompiled version of that Java bytecode. We show through several
case studies that the canonical drawing paradigm used in J-Viz is effective for
identifying potential security vulnerabilities and repeated use of the same
code in Java applications.
|
[
{
"version": "v1",
"created": "Wed, 31 Aug 2016 18:03:18 GMT"
}
] | 2016-09-01T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Johnson",
"Timothy",
""
]
] |
new_dataset
| 0.975749 |
1608.08251
|
Igor Polk
|
Igor Polkovnikov
|
Construction of Convex Sets on Quadrilateral Ordered Tiles or Graphs
with Propagation Neighborhood Operations. Dales, Concavity Structures.
Application to Gray Image Analysis of Human-Readable Shapes
|
58 pages, more than 50 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An effort has been made to show mathematicians some new ideas applied to
image analysis. Gray images are presented as tilings. Based on topological
properties of the tiling, a number of gray convex hulls: maximal, minimal, and
oriented ones are constructed and some are proved. They are constructed with
only one operation. Two tilings are used in the Constraint and Allowance types
of operations. New type of concavity described: a dale. All operations are
parallel, possible to realize clock-less. Convexities define what is the
background. They are treated as separate gray objects. There are multiple
relations among them and their descendants. Via that, topological size of
concavities is proposed. Constructed with the same type of operations, Rays and
Angles in a tiling define possible spatial relations. Notions like "strokes"
are defined through concavities. Unusual effects on levelized gray objects are
shown. It is illustrated how alphabet and complex hieroglyphs can be described
through concavities and their relations. A hypothesis of living organisms image
analysis is proposed. A number of examples with symbols and a human face are
calculated with new Asynchwave C++ software library.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2016 21:12:49 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Polkovnikov",
"Igor",
""
]
] |
new_dataset
| 0.959675 |
1608.08339
|
Taehwan Kim
|
Taehwan Kim
|
American Sign Language fingerspelling recognition from video: Methods
for unrestricted recognition and signer-independence
|
PhD Thesis
| null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this thesis, we study the problem of recognizing video sequences of
fingerspelled letters in American Sign Language (ASL). Fingerspelling comprises
a significant but relatively understudied part of ASL, and recognizing it is
challenging for a number of reasons: It involves quick, small motions that are
often highly coarticulated; it exhibits significant variation between signers;
and there has been a dearth of continuous fingerspelling data collected. In
this work, we propose several types of recognition approaches, and explore the
signer variation problem. Our best-performing models are segmental
(semi-Markov) conditional random fields using deep neural network-based
features. In the signer-dependent setting, our recognizers achieve up to about
8% letter error rates. The signer-independent setting is much more challenging,
but with neural network adaptation we achieve up to 17% letter error rates.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 06:12:22 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Kim",
"Taehwan",
""
]
] |
new_dataset
| 0.99912 |
1608.08397
|
Yuval Elovici
|
Mordechai Guri, Matan Monitz, Yuval Elovici
|
USBee: Air-Gap Covert-Channel via Electromagnetic Emission from USB
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years researchers have demonstrated how attackers could use USB
connectors implanted with RF transmitters to exfiltrate data from secure, and
even air-gapped, computers (e.g., COTTONMOUTH in the leaked NSA ANT catalog).
Such methods require a hardware modification of the USB plug or device, in
which a dedicated RF transmitter is embedded. In this paper we present USBee, a
software that can utilize an unmodified USB device connected to a computer as a
RF transmitter. We demonstrate how a software can intentionally generate
controlled electromagnetic emissions from the data bus of a USB connector. We
also show that the emitted RF signals can be controlled and modulated with
arbitrary binary data. We implement a prototype of USBee, and discuss its
design and implementation details including signal generation and modulation.
We evaluate the transmitter by building a receiver and demodulator using GNU
Radio. Our evaluation shows that USBee can be used for transmitting binary data
to a nearby receiver at a bandwidth of 20 to 80 BPS (bytes per second).
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 10:38:54 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Monitz",
"Matan",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.985833 |
1608.08418
|
Fabrizio Montecchiani
|
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
|
1-Bend RAC Drawings of 1-Planar Graphs
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is 1-planar if it has a drawing where each edge is crossed at most
once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right
angles. The relationships between 1-planar graphs and RAC drawings have been
partially studied in the literature. It is known that there are both 1-planar
graphs that are not straight-line RAC drawable and graphs that have a
straight-line RAC drawing but that are not 1-planar. Also, straight-line RAC
drawings always exist for IC-planar graphs, a subclass of 1-planar graphs. One
of the main questions still open is whether every 1-planar graph has a RAC
drawing with at most one bend per edge. We positively answer this question.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 12:28:28 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Didimo",
"Walter",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Mehrabi",
"Saeed",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.999821 |
1608.08425
|
Fabrizio Montecchiani
|
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
|
1-bend Upward Planar Drawings of SP-digraphs
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is proved that every series-parallel digraph whose maximum vertex-degree
is $\Delta$ admits an upward planar drawing with at most one bend per edge such
that each edge segment has one of $\Delta$ distinct slopes. This is shown to be
worst-case optimal in terms of the number of slopes. Furthermore, our
construction gives rise to drawings with optimal angular resolution
$\frac{\pi}{\Delta}$. A variant of the proof technique is used to show that
(non-directed) reduced series-parallel graphs and flat series-parallel graphs
have a (non-upward) one-bend planar drawing with $\lceil\frac{\Delta}{2}\rceil$
distinct slopes if biconnected, and with $\lceil\frac{\Delta}{2}\rceil+1$
distinct slopes if connected.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 12:40:40 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Di Giacomo",
"Emilio",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.952985 |
cs/0105018
|
David M. Kristol
|
David M. Kristol
|
HTTP Cookies: Standards, Privacy, and Politics
| null |
ACM Transactions on Internet Technology, Vol. 1, #2, November 2001
| null | null |
cs.SE cs.CY
| null |
How did we get from a world where cookies were something you ate and where
"non-techies" were unaware of "Netscape cookies" to a world where cookies are a
hot-button privacy issue for many computer users? This paper will describe how
HTTP "cookies" work, and how Netscape's original specification evolved into an
IETF Proposed Standard. I will also offer a personal perspective on how what
began as a straightforward technical specification turned into a political
flashpoint when it tried to address non-technical issues such as privacy.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2001 16:12:44 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Kristol",
"David M.",
""
]
] |
new_dataset
| 0.975811 |
cs/0304046
|
Laura Semini
|
Carlo Montangero and Laura Semini (Dipartimento di Informatica,
Universita' di Pisa, Italy)
|
Distributed States Temporal Logic
|
25 pages, uses xypic
| null | null | null |
cs.LO
| null |
We introduce a temporal logic to reason on global applications in an
asynchronous setting. First, we define the Distributed States Logic (DSL), a
modal logic for localities that embeds the local theories of each component
into a theory of the distributed states of the system. We provide the logic
with a sound and complete axiomatization. The contribution is that it is
possible to reason about properties that involve several components, even in
the absence of a global clock. Then, we define the Distributed States Temporal
Logic (DSTL) by introducing temporal operators a' la Unity. We support our
proposal by working out a pair of examples: a simple secure communication
system, and an algorithm for distributed leader election.
The motivation for this work is that the existing logics for distributed
systems do not have the right expressive power to reason on the systems
behaviour, when the communication is based on asynchronous message passing. On
the other side, asynchronous communication is the most used abstraction when
modelling global applications.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2003 18:54:59 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Montangero",
"Carlo",
"",
"Dipartimento di Informatica,\n Universita' di Pisa, Italy"
],
[
"Semini",
"Laura",
"",
"Dipartimento di Informatica,\n Universita' di Pisa, Italy"
]
] |
new_dataset
| 0.999339 |
cs/0306096
|
Iosif Legrand
|
H.B. Newman, I.C.Legrand, P. Galvez, R. Voicu, C. Cirstoiu
|
MonALISA : A Distributed Monitoring Service Architecture
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 8 pages, pdf. PSN MOET001
| null | null | null |
cs.DC
| null |
The MonALISA (Monitoring Agents in A Large Integrated Services Architecture)
system provides a distributed monitoring service. MonALISA is based on a
scalable Dynamic Distributed Services Architecture which is designed to meet
the needs of physics collaborations for monitoring global Grid systems, and is
implemented using JINI/JAVA and WSDL/SOAP technologies. The scalability of the
system derives from the use of multithreaded Station Servers to host a variety
of loosely coupled self-describing dynamic services, the ability of each
service to register itself and then to be discovered and used by any other
services, or clients that require such information, and the ability of all
services and clients subscribing to a set of events (state changes) in the
system to be notified automatically. The framework integrates several existing
monitoring tools and procedures to collect parameters describing computational
nodes, applications and network performance. It has built-in SNMP support and
network-performance monitoring algorithms that enable it to monitor end-to-end
network performance as well as the performance and state of site facilities in
a Grid. MonALISA is currently running around the clock on the US CMS test Grid
as well as an increasing number of other sites. It is also being used to
monitor the performance and optimize the interconnections among the reflectors
in the VRVS system.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2003 08:33:44 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Newman",
"H. B.",
""
],
[
"Legrand",
"I. C.",
""
],
[
"Galvez",
"P.",
""
],
[
"Voicu",
"R.",
""
],
[
"Cirstoiu",
"C.",
""
]
] |
new_dataset
| 0.997957 |
cs/0307059
|
Scott Guthery Dr.
|
Scott B. Guthery
|
Group Authentication Using The Naccache-Stern Public-Key Cryptosystem
|
7 pages, no figures
| null | null | null |
cs.CR
| null |
A group authentication protocol authenticates pre-defined groups of
individuals such that:
- No individual is identified
- No knowledge of which groups can be successfully authenticated is known to
the verifier
- No sensitive data is exposed
The paper presents a group authentication protocol based on splitting the
private keys of the Naccache-Stern public-key cryptosystem in such a way that
the Boolean expression defining the authenticable groups is implicit in the
split.
|
[
{
"version": "v1",
"created": "Sat, 26 Jul 2003 13:51:13 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Guthery",
"Scott B.",
""
]
] |
new_dataset
| 0.991471 |
cs/0409047
|
Amar Isli
|
Amar Isli
|
An ALC(D)-based combination of temporal constraints and spatial
constraints suitable for continuous (spatial) change
|
in Proceedings of the ECAI Workshop on Spatial and Temporal
Reasoning, pp. 129-133, Valencia, Spain, 2004
| null | null | null |
cs.AI cs.LO
| null |
We present a family of spatio-temporal theories suitable for continuous
spatial change in general, and for continuous motion of spatial scenes in
particular. The family is obtained by spatio-temporalising the well-known
ALC(D) family of Description Logics (DLs) with a concrete domain D, as follows,
where TCSPs denotes "Temporal Constraint Satisfaction Problems", a well-known
constraint-based framework:
(1) temporalisation of the roles, so that they consist of TCSP constraints
(specifically, of an adaptation of TCSP constraints to interval variables); and
(2) spatialisation of the concrete domain D: the concrete domain is now
$D_x$, and is generated by a spatial Relation Algebra (RA) $x$, in the style of
the Region-Connection Calculus RCC8.
We assume durative truth (i.e., holding during a durative interval). We also
assume the homogeneity property (if a truth holds during a given interval, it
holds during all of its subintervals). Among other things, these assumptions
raise the "conflicting" problem of overlapping truths, which the work solves
with the use of a specific partition of the 13 atomic relations of Allen's
interval algebra.
|
[
{
"version": "v1",
"created": "Fri, 24 Sep 2004 15:22:52 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Isli",
"Amar",
""
]
] |
new_dataset
| 0.975645 |
cs/0503052
|
Xiaoyang Gu
|
David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe
Moser
|
Zeta-Dimension
|
21 pages
| null | null | null |
cs.CC cs.IT math.IT
| null |
The zeta-dimension of a set A of positive integers is the infimum s such that
the sum of the reciprocals of the s-th powers of the elements of A is finite.
Zeta-dimension serves as a fractal dimension on the positive integers that
extends naturally usefully to discrete lattices such as the set of all integer
lattice points in d-dimensional space.
This paper reviews the origins of zeta-dimension (which date to the
eighteenth and nineteenth centuries) and develops its basic theory, with
particular attention to its relationship with algorithmic information theory.
New results presented include extended connections between zeta-dimension and
classical fractal dimensions, a gale characterization of zeta-dimension, and a
theorem on the zeta-dimensions of pointwise sums and products of sets of
positive integers.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2005 05:58:43 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Doty",
"David",
""
],
[
"Gu",
"Xiaoyang",
""
],
[
"Lutz",
"Jack H.",
""
],
[
"Mayordomo",
"Elvira",
""
],
[
"Moser",
"Philippe",
""
]
] |
new_dataset
| 0.998834 |
cs/0505033
|
Agathe Merceron
|
Ahmed Bouajjani, Agathe Merceron
|
Parametric Verification of a Group Membership Algorithm
|
34 pages. To appear in Theory and Practice of Logic Programming
(TPLP)
| null | null | null |
cs.LO
| null |
We address the problem of verifying clique avoidance in the TTP protocol. TTP
allows several stations embedded in a car to communicate. It has many
mechanisms to ensure robustness to faults. In particular, it has an algorithm
that allows a station to recognize itself as faulty and leave the
communication. This algorithm must satisfy the crucial 'non-clique' property:
it is impossible to have two or more disjoint groups of stations communicating
exclusively with stations in their own group.
In this paper, we propose an automatic verification method for an arbitrary
number of stations $N$ and a given number of faults $k$. We give an abstraction
that allows to model the algorithm by means of unbounded (parametric) counter
automata. We have checked the non-clique property on this model in the case of
one fault, using the ALV tool as well as the LASH tool.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2005 07:52:36 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Bouajjani",
"Ahmed",
""
],
[
"Merceron",
"Agathe",
""
]
] |
new_dataset
| 0.973619 |
cs/0505058
|
Patrick C. McGuire
|
Patrick C. McGuire, Enrique Diaz-Martinez, Jens Ormo, Javier
Gomez-Elvira, Jose A. Rodriguez-Manfredi, Eduardo Sebastian-Martinez, Helge
Ritter, Robert Haschke, Markus Oesker, Joerg Ontrup
|
The Cyborg Astrobiologist: Scouting Red Beds for Uncommon Features with
Geological Significance
|
to appear in Int'l J. Astrobiology, vol.4, iss.2 (June 2005); 19
pages, 7 figs
|
Int.J.Astrobiol.4:101-113,2005
|
10.1017/S1473550405002533
| null |
cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO cs.SE physics.ins-det q-bio.NC
| null |
The `Cyborg Astrobiologist' (CA) has undergone a second geological field
trial, at a red sandstone site in northern Guadalajara, Spain, near Riba de
Santiuste. The Cyborg Astrobiologist is a wearable computer and video camera
system that has demonstrated a capability to find uncommon interest points in
geological imagery in real-time in the field. The first (of three) geological
structures that we studied was an outcrop of nearly homogeneous sandstone,
which exhibits oxidized-iron impurities in red and and an absence of these iron
impurities in white. The white areas in these ``red beds'' have turned white
because the iron has been removed by chemical reduction, perhaps by a
biological agent. The computer vision system found in one instance several
(iron-free) white spots to be uncommon and therefore interesting, as well as
several small and dark nodules. The second geological structure contained
white, textured mineral deposits on the surface of the sandstone, which were
found by the CA to be interesting. The third geological structure was a 50 cm
thick paleosol layer, with fossilized root structures of some plants, which
were found by the CA to be interesting. A quasi-blind comparison of the Cyborg
Astrobiologist's interest points for these images with the interest points
determined afterwards by a human geologist shows that the Cyborg Astrobiologist
concurred with the human geologist 68% of the time (true positive rate), with a
32% false positive rate and a 32% false negative rate.
(abstract has been abridged).
|
[
{
"version": "v1",
"created": "Mon, 23 May 2005 09:55:37 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"McGuire",
"Patrick C.",
""
],
[
"Diaz-Martinez",
"Enrique",
""
],
[
"Ormo",
"Jens",
""
],
[
"Gomez-Elvira",
"Javier",
""
],
[
"Rodriguez-Manfredi",
"Jose A.",
""
],
[
"Sebastian-Martinez",
"Eduardo",
""
],
[
"Ritter",
"Helge",
""
],
[
"Haschke",
"Robert",
""
],
[
"Oesker",
"Markus",
""
],
[
"Ontrup",
"Joerg",
""
]
] |
new_dataset
| 0.998932 |
cs/0506089
|
Patrick C. McGuire
|
Patrick C. McGuire, Javier Gomez-Elvira, Jose Antonio
Rodriguez-Manfredi, Eduardo Sebastian-Martinez, Jens Ormo, Enrique
Diaz-Martinez, Markus Oesker, Robert Haschke, Joerg Ontrup, Helge Ritter
|
Field geology with a wearable computer: 1st results of the Cyborg
Astrobiologist System
|
accepted by ICINCO 2005, 2nd International Conference on Informatics
in Control, Automation and Robotics, 14-17 September 2005, Barcelona, Spain.
9 pages, 7 figures
|
"Proceedings of the <a
href="http://www.icinco.org">ICINCO</a>'2005 (International Conference on
Informatics in Control, Automation and Robotics)", September 14-17,
Barcelona, Spain, vol. 3, pp. 283-291 (2005).
| null | null |
cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO
| null |
We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist. The Cyborg
Astrobiologist platform has thus far been used for testing and development of
these algorithms and systems: robotic acquisition of quasi-mosaics of images,
real-time image segmentation, and real-time determination of interesting points
in the image mosaics. This work is more of a test of the whole system, rather
than of any one part of the system. However, beyond the concept of the system
itself, the uncommon map (despite its simplicity) is the main innovative part
of the system. The uncommon map helps to determine interest-points in a
context-free manner. Overall, the hardware and software systems function
reliably, and the computer-vision algorithms are adequate for the first field
tests. In addition to the proof-of-concept aspect of these field tests, the
main result of these field tests is the enumeration of those issues that we can
improve in the future, including: dealing with structural shadow and
microtexture, and also, controlling the camera's zoom lens in an intelligent
manner. Nonetheless, despite these and other technical inadequacies, this
Cyborg Astrobiologist system, consisting of a camera-equipped wearable-computer
and its computer-vision algorithms, has demonstrated its ability of finding
genuinely interesting points in real-time in the geological scenery, and then
gathering more information about these interest points in an automated manner.
We use these capabilities for autonomous guidance towards geological
points-of-interest.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2005 10:25:22 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"McGuire",
"Patrick C.",
""
],
[
"Gomez-Elvira",
"Javier",
""
],
[
"Rodriguez-Manfredi",
"Jose Antonio",
""
],
[
"Sebastian-Martinez",
"Eduardo",
""
],
[
"Ormo",
"Jens",
""
],
[
"Diaz-Martinez",
"Enrique",
""
],
[
"Oesker",
"Markus",
""
],
[
"Haschke",
"Robert",
""
],
[
"Ontrup",
"Joerg",
""
],
[
"Ritter",
"Helge",
""
]
] |
new_dataset
| 0.998774 |
cs/0509062
|
Chun-Hao Hsu
|
Chun-Hao Hsu and Achilleas Anastasopoulos
|
Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy
Channels
|
17 pages, 2 figures. This paper is to be presented in the 43rd Annual
Allerton Conference on Communication, Control and Computing, Monticello, IL,
USA, Sept. 28-30, 2005
| null | null | null |
cs.IT math.IT
| null |
We introduce a new family of concatenated codes with an outer low-density
parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code,
and prove that these codes can achieve capacity under any memoryless
binary-input output-symmetric (MBIOS) channel using maximum-likelihood (ML)
decoding with bounded graphical complexity, i.e., the number of edges per
information bit in their graphical representation is bounded. In particular, we
also show that these codes can achieve capacity on the binary erasure channel
(BEC) under belief propagation (BP) decoding with bounded decoding complexity
per information bit per iteration for all erasure probabilities in (0, 1). By
deriving and analyzing the average weight distribution (AWD) and the
corresponding asymptotic growth rate of these codes with a rate-1 inner LDGM
code, we also show that these codes achieve the Gilbert-Varshamov bound with
asymptotically high probability. This result can be attributed to the presence
of the inner rate-1 LDGM code, which is demonstrated to help eliminate high
weight codewords in the LDPC code while maintaining a vanishingly small amount
of low weight codewords.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2005 23:22:34 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Sep 2005 05:26:35 GMT"
},
{
"version": "v3",
"created": "Sat, 24 Sep 2005 18:58:56 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Hsu",
"Chun-Hao",
""
],
[
"Anastasopoulos",
"Achilleas",
""
]
] |
new_dataset
| 0.979664 |
cs/0511094
|
Ignatios Souvatzis
|
Ignatios Souvatzis
|
A Machine-Independent port of the MPD language run time system to NetBSD
|
6 pages
|
Christian Tschudin et al. (Eds.): Proceedings of the Fourth
European BSD Conference, 2005 Basel, Switzerland
| null | null |
cs.DC cs.PL
| null |
SR (synchronizing resources) is a PASCAL - style language enhanced with
constructs for concurrent programming developed at the University of Arizona in
the late 1980s. MPD (presented in Gregory Andrews' book about Foundations of
Multithreaded, Parallel, and Distributed Programming) is its successor,
providing the same language primitives with a different, more C-style, syntax.
The run-time system (in theory, identical, but not designed for sharing) of
those languages provides the illusion of a multiprocessor machine on a single
Unix-like system or a (local area) network of Unix-like machines.
Chair V of the Computer Science Department of the University of Bonn is
operating a laboratory for a practical course in parallel programming
consisting of computing nodes running NetBSD/arm, normally used via PVM, MPI
etc.
We are considering to offer SR and MPD for this, too. As the original
language distributions were only targeted at a few commercial Unix systems,
some porting effort is needed. However, some of the porting effort of our
earlier SR port should be reusable.
The integrated POSIX threads support of NetBSD-2.0 and later allows us to use
library primitives provided for NetBSD's phtread system to implement the
primitives needed by the SR run-time system, thus implementing 13 target CPUs
at once and automatically making use of SMP on VAX, Alpha, PowerPC, Sparc,
32-bit Intel and 64 bit AMD CPUs.
We'll present some methods used for the impementation and compare some
performance values to the traditional implementation.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2005 13:33:14 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Souvatzis",
"Ignatios",
""
]
] |
new_dataset
| 0.999146 |
cs/9511103
| null |
Lawrence C. Paulson
|
A Concrete Final Coalgebra Theorem for ZF Set Theory
|
a greatly revised version has appeared in Mathematical Structures in
Computer Science 9 (1999), 545-567. This version uses different methods and
therefore retains some value
|
published in P. Dybjer, B. Nordstrm and J. Smith (editors), Types
for Proofs and Programs '94 (Springer LNCS 996, published 1995), 120-139
| null | null |
cs.LO
| null |
A special final coalgebra theorem, in the style of Aczel's, is proved within
standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced
by a variant definition of function that admits non-well-founded constructions.
Variant ordered pairs and tuples, of possibly infinite length, are special
cases of variant functions. Analogues of Aczel's Solution and Substitution
Lemmas are proved in the style of Rutten and Turi. The approach is less general
than Aczel's, but the treatment of non-well-founded objects is simple and
concrete. The final coalgebra of a functor is its greatest fixedpoint. The
theory is intended for machine implementation and a simple case of it is
already implemented using the theorem prover Isabelle.
|
[
{
"version": "v1",
"created": "Thu, 29 Mar 2001 00:00:00 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Paulson",
"Lawrence C.",
""
]
] |
new_dataset
| 0.986436 |
cs/9902007
|
Craig Nevill-Manning
|
Ian H. Witten, Gordon W. Paynter, Eibe Frank, Carl Gutwin and Craig G.
Nevill-Manning
|
KEA: Practical Automatic Keyphrase Extraction
|
9 pages
| null | null | null |
cs.DL
| null |
Keyphrases provide semantic metadata that summarize and characterize
documents. This paper describes Kea, an algorithm for automatically extracting
keyphrases from text. Kea identifies candidate keyphrases using lexical
methods, calculates feature values for each candidate, and uses a
machine-learning algorithm to predict which candidates are good keyphrases. The
machine learning scheme first builds a prediction model using training
documents with known keyphrases, and then uses the model to find keyphrases in
new documents. We use a large test corpus to evaluate Kea's effectiveness in
terms of how many author-assigned keyphrases are correctly identified. The
system is simple, robust, and publicly available.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 1999 03:15:45 GMT"
}
] | 2016-08-31T00:00:00 |
[
[
"Witten",
"Ian H.",
""
],
[
"Paynter",
"Gordon W.",
""
],
[
"Frank",
"Eibe",
""
],
[
"Gutwin",
"Carl",
""
],
[
"Nevill-Manning",
"Craig G.",
""
]
] |
new_dataset
| 0.970118 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.