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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1511.02490
|
Chris Cummins
|
Chris Cummins, Pavlos Petoumenos, Michel Steuwer, and Hugh Leather
|
Autotuning OpenCL Workgroup Size for Stencil Patterns
|
8 pages, 6 figures, presented at the 6th International Workshop on
Adaptive Self-tuning Computing Systems (ADAPT '16)
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Selecting an appropriate workgroup size is critical for the performance of
OpenCL kernels, and requires knowledge of the underlying hardware, the data
being operated on, and the implementation of the kernel. This makes portable
performance of OpenCL programs a challenging goal, since simple heuristics and
statically chosen values fail to exploit the available performance. To address
this, we propose the use of machine learning-enabled autotuning to
automatically predict workgroup sizes for stencil patterns on CPUs and
multi-GPUs.
We present three methodologies for predicting workgroup sizes. The first,
using classifiers to select the optimal workgroup size. The second and third
proposed methodologies employ the novel use of regressors for performing
classification by predicting the runtime of kernels and the relative
performance of different workgroup sizes, respectively. We evaluate the
effectiveness of each technique in an empirical study of 429 combinations of
architecture, kernel, and dataset, comparing an average of 629 different
workgroup sizes for each. We find that autotuning provides a median 3.79x
speedup over the best possible fixed workgroup size, achieving 94% of the
maximum performance.
|
[
{
"version": "v1",
"created": "Sun, 8 Nov 2015 14:56:12 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Nov 2015 23:22:04 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Jan 2016 15:50:33 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Cummins",
"Chris",
""
],
[
"Petoumenos",
"Pavlos",
""
],
[
"Steuwer",
"Michel",
""
],
[
"Leather",
"Hugh",
""
]
] |
new_dataset
| 0.995891 |
1601.00978
|
Joseph Paul Cohen
|
Joseph Paul Cohen and Henry Z. Lo and Tingting Lu and Wei Ding
|
Crater Detection via Convolutional Neural Networks
|
2 Pages. Submitted to 47th Lunar and Planetary Science Conference
(LPSC 2016)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Craters are among the most studied geomorphic features in the Solar System
because they yield important information about the past and present geological
processes and provide information about the relative ages of observed geologic
formations. We present a method for automatic crater detection using advanced
machine learning to deal with the large amount of satellite imagery collected.
The challenge of automatically detecting craters comes from their is complex
surface because their shape erodes over time to blend into the surface.
Bandeira provided a seminal dataset that embodied this challenge that is still
an unsolved pattern recognition problem to this day. There has been work to
solve this challenge based on extracting shape and contrast features and then
applying classification models on those features. The limiting factor in this
existing work is the use of hand crafted filters on the image such as Gabor or
Sobel filters or Haar features. These hand crafted methods rely on domain
knowledge to construct. We would like to learn the optimal filters and features
based on training examples. In order to dynamically learn filters and features
we look to Convolutional Neural Networks (CNNs) which have shown their
dominance in computer vision. The power of CNNs is that they can learn image
filters which generate features for high accuracy classification.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 21:03:59 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Cohen",
"Joseph Paul",
""
],
[
"Lo",
"Henry Z.",
""
],
[
"Lu",
"Tingting",
""
],
[
"Ding",
"Wei",
""
]
] |
new_dataset
| 0.999705 |
1601.01008
|
Zahra Derakhshandeh
|
Zahra Derakhshandeh, Robert Gmyr, Andrea W. Richa, Christian
Scheideler, Thim Strothmann
|
Universal Coating for Programmable Matter
|
32 pages, 6 figures
| null | null | null |
cs.ET cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea behind universal coating is to have a thin layer of a specific
substance covering an object of any shape so that one can measure a certain
condition (like temperature or cracks) at any spot on the surface of the object
without requiring direct access to that spot. We study the universal coating
problem in the context of self-organizing programmable matter consisting of
simple computational elements, called particles, that can establish and release
bonds and can actively move in a self-organized way. Based on that matter, we
present a worst-case work-optimal universal coating algorithm that uniformly
coats any object of arbitrary shape and size that allows a uniform coating. Our
particles are anonymous, do not have any global information, have constant-size
memory, and utilize only local interactions.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 22:43:20 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Derakhshandeh",
"Zahra",
""
],
[
"Gmyr",
"Robert",
""
],
[
"Richa",
"Andrea W.",
""
],
[
"Scheideler",
"Christian",
""
],
[
"Strothmann",
"Thim",
""
]
] |
new_dataset
| 0.982715 |
1601.01191
|
Fabien Mathieu
|
The Dang Huynh (LINCS), Fabien Mathieu (LINCS), Laurent Viennot (GANG,
LINCS)
|
LiveRank: How to Refresh Old Datasets
| null | null |
10.1080/15427951.2015.1098756
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the problem of refreshing a dataset. More precisely ,
given a collection of nodes gathered at some time (Web pages, users from an
online social network) along with some structure (hyperlinks, social
relationships), we want to identify a significant fraction of the nodes that
still exist at present time. The liveness of an old node can be tested through
an online query at present time. We call LiveRank a ranking of the old pages so
that active nodes are more likely to appear first. The quality of a LiveRank is
measured by the number of queries necessary to identify a given fraction of the
active nodes when using the LiveRank order. We study different scenarios from a
static setting where the Liv-eRank is computed before any query is made, to
dynamic settings where the LiveRank can be updated as queries are processed.
Our results show that building on the PageRank can lead to efficient LiveRanks,
for Web graphs as well as for online social networks.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 14:25:23 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Huynh",
"The Dang",
"",
"LINCS"
],
[
"Mathieu",
"Fabien",
"",
"LINCS"
],
[
"Viennot",
"Laurent",
"",
"GANG,\n LINCS"
]
] |
new_dataset
| 0.988758 |
1601.01216
|
Ramin Norousi
|
Ramin Norousi, Volker J. Schmid
|
Automatic 3D object detection of Proteins in Fluorescent labeled
microscope images with spatial statistical analysis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since manual object detection is very inaccurate and time consuming, some
automatic object detection tools have been developed in recent years. At the
moment, there is no image analysis software available which provides an
automatic, objective assessment of 3D foci which is generally applicable.
Complications arise from discrete foci which are very close or even come in
contact to other foci, moreover they are of variable sizes and show variable
signal-to-noise, and must be analyzed fully in 3D. Therefore we introduce the
3D-OSCOS (3D-Object Segmentation and Colocalization Analysis based on Spatial
statistics) algorithm which is implemented as a user-friendly toolbox for
interactive detection of 3D objects and visualization of labeled images.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 15:49:49 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Norousi",
"Ramin",
""
],
[
"Schmid",
"Volker J.",
""
]
] |
new_dataset
| 0.986162 |
1601.01245
|
Anit Yadav
|
Rashmi Singh, Yatindra Nath Singh, Anita Yadav
|
Loop Free Multipath Routing Algorithm
| null | null | null | null |
cs.NI
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Single path routing that is currently used in the internet routers,is easy to
implement as it simplifies the routing tables and packet flow paths. However it
is not optimal and has shortcomings in utilizing the network resources
optimally, load balancing & fast recovery in case of faults (fault tolerance).
The given algorithm resolves all these problems by using all possible multiple
paths for transfer of information, while retaining loop-free property. We have
proposed a new dynamic loop-free multipath routing algorithm which improves
network throughput and network resource utilization, reduces average
transmission delay, and is not affected by faults in the links and router
nodes. The main idea of this algorithm is to maintain multiple possible next
hops for a destination along with weights. At every node, the traffic to a
destination is split among multiple next hops in proportion to the estimated
weights. The number of multiple next hops also changes depending on the traffic
conditions, but it is never less than one.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 17:24:36 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Singh",
"Rashmi",
""
],
[
"Singh",
"Yatindra Nath",
""
],
[
"Yadav",
"Anita",
""
]
] |
new_dataset
| 0.999575 |
1601.01298
|
Hamideh Vosoughpour Yazdchi
|
Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour
|
Visibility Graphs, Dismantlability, and the Cops and Robbers Game
|
23 pages
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study versions of cop and robber pursuit-evasion games on the visibility
graphs of polygons, and inside polygons with straight and curved sides. Each
player has full information about the other player's location, players take
turns, and the robber is captured when the cop arrives at the same point as the
robber. In visibility graphs we show the cop can always win because visibility
graphs are dismantlable, which is interesting as one of the few results
relating visibility graphs to other known graph classes. We extend this to show
that the cop wins games in which players move along straight line segments
inside any polygon and, more generally, inside any simply connected planar
region with a reasonable boundary. Essentially, our problem is a type of
pursuit-evasion using the link metric rather than the Euclidean metric, and our
result provides an interesting class of infinite cop-win graphs.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 20:26:31 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Lubiw",
"Anna",
""
],
[
"Snoeyink",
"Jack",
""
],
[
"Vosoughpour",
"Hamideh",
""
]
] |
new_dataset
| 0.997814 |
1601.00738
|
Jiaan Zeng
|
Jiaan Zeng
|
Resource Sharing for Multi-Tenant NoSQL Data Store in Cloud
|
PhD dissertation, December 2015
| null | null | null |
cs.DC cs.AI cs.DB cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-tenancy hosting of users in cloud NoSQL data stores is favored by cloud
providers because it enables resource sharing at low operating cost.
Multi-tenancy takes several forms depending on whether the back-end file system
is a local file system (LFS) or a parallel file system (PFS), and on whether
tenants are independent or share data across tenants. In this thesis I focus on
and propose solutions to two cases: independent data-local file system, and
shared data-parallel file system.
In the independent data-local file system case, resource contention occurs
under certain conditions in Cassandra and HBase, two state-of-the-art NoSQL
stores, causing performance degradation for one tenant by another. We
investigate the interference and propose two approaches. The first provides a
scheduling scheme that can approximate resource consumption, adapt to workload
dynamics and work in a distributed fashion. The second introduces a
workload-aware resource reservation approach to prevent interference. The
approach relies on a performance model obtained offline and plans the
reservation according to different workload resource demands. Results show the
approaches together can prevent interference and adapt to dynamic workloads
under multi-tenancy.
In the shared data-parallel file system case, it has been shown that running
a distributed NoSQL store over PFS for shared data across tenants is not cost
effective. Overheads are introduced due to the unawareness of the NoSQL store
of PFS. This dissertation targets the key-value store (KVS), a specific form of
NoSQL stores, and proposes a lightweight KVS over a parallel file system to
improve efficiency. The solution is built on an embedded KVS for high
performance but uses novel data structures to support concurrent writes.
Results show the proposed system outperforms Cassandra and Voldemort in several
different workloads.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 05:15:12 GMT"
}
] | 2016-01-06T00:00:00 |
[
[
"Zeng",
"Jiaan",
""
]
] |
new_dataset
| 0.959461 |
1601.00740
|
Ashesh Jain
|
Ashesh Jain, Hema S Koppula, Shane Soh, Bharad Raghavan, Avi Singh,
Ashutosh Saxena
|
Brain4Cars: Car That Knows Before You Do via Sensory-Fusion Deep
Learning Architecture
|
Journal Version (ICCV and ICRA combination with more system details)
http://brain4cars.com
| null | null | null |
cs.RO cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advanced Driver Assistance Systems (ADAS) have made driving safer over the
last decade. They prepare vehicles for unsafe road conditions and alert drivers
if they perform a dangerous maneuver. However, many accidents are unavoidable
because by the time drivers are alerted, it is already too late. Anticipating
maneuvers beforehand can alert drivers before they perform the maneuver and
also give ADAS more time to avoid or prepare for the danger.
In this work we propose a vehicular sensor-rich platform and learning
algorithms for maneuver anticipation. For this purpose we equip a car with
cameras, Global Positioning System (GPS), and a computing device to capture the
driving context from both inside and outside of the car. In order to anticipate
maneuvers, we propose a sensory-fusion deep learning architecture which jointly
learns to anticipate and fuse multiple sensory streams. Our architecture
consists of Recurrent Neural Networks (RNNs) that use Long Short-Term Memory
(LSTM) units to capture long temporal dependencies. We propose a novel training
procedure which allows the network to predict the future given only a partial
temporal context. We introduce a diverse data set with 1180 miles of natural
freeway and city driving, and show that we can anticipate maneuvers 3.5 seconds
before they occur in real-time with a precision and recall of 90.5\% and 87.4\%
respectively.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 05:25:14 GMT"
}
] | 2016-01-06T00:00:00 |
[
[
"Jain",
"Ashesh",
""
],
[
"Koppula",
"Hema S",
""
],
[
"Soh",
"Shane",
""
],
[
"Raghavan",
"Bharad",
""
],
[
"Singh",
"Avi",
""
],
[
"Saxena",
"Ashutosh",
""
]
] |
new_dataset
| 0.998686 |
1601.00834
|
Jordane Lorandel M.
|
Lorandel Jordane, Jean-Christophe Pr\'evotet and Maryline H\'elard
|
Fast Power and Energy Efficiency Analysis of FPGA-based Wireless
Base-band Processing
|
Presented at HIP3ES, 2016
| null | null |
HIP3ES/2016/4
|
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, demands for high performance keep on increasing in the wireless
communication domain. This leads to a consistent rise of the complexity and
designing such systems has become a challenging task. In this context, energy
efficiency is considered as a key topic, especially for embedded systems in
which design space is often very constrained. In this paper, a fast and
accurate power estimation approach for FPGA-based hardware systems is applied
to a typical wireless communication system. It aims at providing power
estimates of complete systems prior to their implementations. This is made
possible by using a dedicated library of high-level models that are
representative of hardware IPs. Based on high-level simulations, design space
exploration is made a lot faster and easier. The definition of a scenario and
the monitoring of IP's time-activities facilitate the comparison of several
domain-specific systems. The proposed approach and its benefits are
demonstrated through a typical use case in the wireless communication domain.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 14:14:21 GMT"
}
] | 2016-01-06T00:00:00 |
[
[
"Jordane",
"Lorandel",
""
],
[
"Prévotet",
"Jean-Christophe",
""
],
[
"Hélard",
"Maryline",
""
]
] |
new_dataset
| 0.992437 |
1409.2332
|
Neng Wan
|
Neng Wan and Weiran Yao
|
Partially Independent Control Scheme for Spacecraft Rendezvous in
Near-Circular Orbits
|
18 pages, 7 figures, Submitted to ASCE Journal of Aerospace
Engineering
| null | null | null |
cs.SY math.DS math.OC physics.space-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the complexity and inconstancy of the space environment, accurate
mathematical models for spacecraft rendezvous are difficult to obtain, which
consequently complicates the control tasks. In this paper, a linearized
time-variant plant model with external perturbations is adopted to approximate
the real circumstance. To realize the robust stability with optimal performance
cost, a partially independent control scheme is proposed, which consists of a
robust anti-windup controller for the in-plane motion and a ${{H}_{\infty}}$
controller for the out-of-plane motion. Finally, a rendezvous simulation is
given to corroborate the practicality and advantages of the partially
independent control scheme over a coupled control scheme.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 13:18:49 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Oct 2014 08:11:46 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Apr 2015 14:53:15 GMT"
},
{
"version": "v4",
"created": "Mon, 4 Jan 2016 04:32:32 GMT"
}
] | 2016-01-05T00:00:00 |
[
[
"Wan",
"Neng",
""
],
[
"Yao",
"Weiran",
""
]
] |
new_dataset
| 0.997849 |
1512.06338
|
Yinglei Song
|
Yinglei Song
|
Lower Bounds for the Domination Numbers of Connected Graphs without
Short Cycles
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we obtain lower bounds for the domination numbers of connected
graphs with girth at least $7$. We show that the domination number of a
connected graph with girth at least $7$ is either $1$ or at least
$\frac{1}{2}(3+\sqrt{8(m-n)+9})$, where $n$ is the number of vertices in the
graph and $m$ is the number of edges in the graph. For graphs with minimum
degree $2$ and girth at least $7$, the lower bound can be improved to
$\max{\{\sqrt{n}, \sqrt{\frac{2m}{3}}\}}$, where $n$ and $m$ are the numbers of
vertices and edges in the graph respectively. In cases where the graph is of
minimum degree $2$ and its girth $g$ is at least $12$, the lower bound can be
further improved to $\max{\{\sqrt{n}, \sqrt{\frac{\lfloor \frac{g}{3}
\rfloor-1}{3}m}\}}$.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2015 09:12:46 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Jan 2016 10:49:17 GMT"
}
] | 2016-01-05T00:00:00 |
[
[
"Song",
"Yinglei",
""
]
] |
new_dataset
| 0.976386 |
1601.00073
|
Oliver Kennedy
|
Arindam Nandi, Ying Yang, Oliver Kennedy, Boris Glavic, Ronny Fehling,
Zhen Hua Liu, Dieter Gawlick
|
Mimir: Bringing CTables into Practice
|
Under submission; The first two authors should be considered a joint
first-author
| null | null | null |
cs.DB cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present state of the art in analytics requires high upfront investment of
human effort and computational resources to curate datasets, even before the
first query is posed. So-called pay-as-you-go data curation techniques allow
these high costs to be spread out, first by enabling queries over uncertain and
incomplete data, and then by assessing the quality of the query results. We
describe the design of a system, called Mimir, around a recently introduced
class of probabilistic pay-as-you-go data cleaning operators called Lenses.
Mimir wraps around any deterministic database engine using JDBC, extending it
with support for probabilistic query processing. Queries processed through
Mimir produce uncertainty-annotated result cursors that allow client
applications to quickly assess result quality and provenance. We also present a
GUI that provides analysts with an interactive tool for exploring the
uncertainty exposed by the system. Finally, we present optimizations that make
Lenses scalable, and validate this claim through experimental evidence.
|
[
{
"version": "v1",
"created": "Fri, 1 Jan 2016 11:21:33 GMT"
}
] | 2016-01-05T00:00:00 |
[
[
"Nandi",
"Arindam",
""
],
[
"Yang",
"Ying",
""
],
[
"Kennedy",
"Oliver",
""
],
[
"Glavic",
"Boris",
""
],
[
"Fehling",
"Ronny",
""
],
[
"Liu",
"Zhen Hua",
""
],
[
"Gawlick",
"Dieter",
""
]
] |
new_dataset
| 0.963213 |
1601.00184
|
Asaf Shabtai
|
Ben Feher, Lior Sidi, Asaf Shabtai, Rami Puzis
|
The Security of WebRTC
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WebRTC is an API that allows users to share streaming information, whether it
is text, sound, video or files. It is supported by all major browsers and has a
flexible underlying infrastructure. In this study we review current WebRTC
structure and security in the contexts of communication disruption,
modification and eavesdropping. In addition, we examine WebRTC security in a
few representative scenarios, setting up and simulating real WebRTC
environments and attacks.
|
[
{
"version": "v1",
"created": "Sat, 2 Jan 2016 15:59:55 GMT"
}
] | 2016-01-05T00:00:00 |
[
[
"Feher",
"Ben",
""
],
[
"Sidi",
"Lior",
""
],
[
"Shabtai",
"Asaf",
""
],
[
"Puzis",
"Rami",
""
]
] |
new_dataset
| 0.985031 |
1601.00287
|
Vincent Lostanlen
|
Vincent Lostanlen and St\'ephane Mallat
|
Wavelet Scattering on the Pitch Spiral
|
Proceedings of the 18th International Conference on Digital Audio
Effects (DAFx-15), Trondheim, Norway, Nov 30 - Dec 3, 2015, pp. 429--432. 4
pages, 3 figures
|
Proceedings of the 18th International Conference on Digital Audio
Effects (DAFx-15), Trondheim, Norway, Nov 30 - Dec 3, 2015, pp. 429--432
| null | null |
cs.SD cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new representation of harmonic sounds that linearizes the
dynamics of pitch and spectral envelope, while remaining stable to deformations
in the time-frequency plane. It is an instance of the scattering transform, a
generic operator which cascades wavelet convolutions and modulus
nonlinearities. It is derived from the pitch spiral, in that convolutions are
successively performed in time, log-frequency, and octave index. We give a
closed-form approximation of spiral scattering coefficients for a nonstationary
generalization of the harmonic source-filter model.
|
[
{
"version": "v1",
"created": "Sun, 3 Jan 2016 12:30:38 GMT"
}
] | 2016-01-05T00:00:00 |
[
[
"Lostanlen",
"Vincent",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.998292 |
1403.5864
|
Ying Long
|
Ying Long and Yao Shen
|
Mapping parcel-level urban areas for a large geographical area
|
21 pages, 9 figures, 3 tables
| null |
10.1080/00045608.2015.1095062
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a vital indicator for measuring urban development, urban areas are
expected to be identified explicitly and conveniently with widely available
dataset thereby benefiting the planning decisions and relevant urban studies.
Existing approaches to identify urban areas normally based on mid-resolution
sensing dataset, socioeconomic information (e.g. population density) generally
associate with low-resolution in space, e.g. cells with several square
kilometers or even larger towns/wards. Yet, few of them pay attention to
defining urban areas with micro data in a fine-scaled manner with large extend
scale by incorporating the morphological and functional characteristics. This
paper investigates an automated framework to delineate urban areas in the
parcel level, using increasingly available ordnance surveys for generating all
parcels (or geo-units) and ubiquitous points of interest (POIs) for inferring
density of each parcel. A vector cellular automata model was adopted for
identifying urban parcels from all generated parcels, taking into account
density, neighborhood condition, and other spatial variables of each parcel. We
applied this approach for mapping urban areas of all 654 Chinese cities and
compared them with those interpreted from mid-resolution remote sensing images
and inferred by population density and road intersections. Our proposed
framework is proved to be more straight-forward, time-saving and fine-scaled,
compared with other existing ones, and reclaim the need for consistency,
efficiency and availability in defining urban areas with well-consideration of
omnipresent spatial and functional factors across cities.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 06:39:17 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Long",
"Ying",
""
],
[
"Shen",
"Yao",
""
]
] |
new_dataset
| 0.999547 |
1404.6563
|
Jad Hachem
|
Jad Hachem, Nikhil Karamchandani, Suhas Diggavi
|
Coded Caching for Multi-level Popularity and Access
|
Parts of the results in this paper have already been published and
are available on arXiv: abs/1404.6560, abs/1504.05931, and the older version
of this submission
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To address the exponentially rising demand for wireless content, use of
caching is emerging as a potential solution. It has been recently established
that joint design of content delivery and storage (coded caching) can
significantly improve performance over conventional caching. Coded caching is
well suited to emerging heterogeneous wireless architectures which consist of a
dense deployment of local-coverage wireless access points (APs) with high data
rates, along with sparsely-distributed, large-coverage macro-cell base stations
(BS). This enables design of coded caching-and-delivery schemes that equip APs
with storage, and place content in them in a way that creates coded-multicast
opportunities for combining with macro-cell broadcast to satisfy users even
with different demands. Such coded-caching schemes have been shown to be
order-optimal with respect to the BS transmission rate, for a system with
single-level content, i.e., one where all content is uniformly popular. In this
work, we consider a system with non-uniform popularity content which is divided
into multiple levels, based on varying degrees of popularity. The main
contribution of this work is the derivation of an order-optimal scheme which
judiciously shares cache memory among files with different popularities. To
show order-optimality we derive new information-theoretic lower bounds, which
use a sliding-window entropy inequality, effectively creating a non-cutset
bound. We also extend the ideas to when users can access multiple caches along
with the broadcast. Finally we consider two extreme cases of user distribution
across caches for the multi-level popularity model: a single user per cache
(single-user setup) versus a large number of users per cache (multi-user
setup), and demonstrate a dichotomy in the order-optimal strategies for these
two extreme cases.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 21:32:41 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Dec 2015 20:51:25 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Hachem",
"Jad",
""
],
[
"Karamchandani",
"Nikhil",
""
],
[
"Diggavi",
"Suhas",
""
]
] |
new_dataset
| 0.996248 |
1507.06836
|
Pablo Arrighi
|
Pablo Arrighi and Gilles Dowek
|
Discrete geodesics and cellular automata
|
13 pages, 3 figures
| null | null | null |
cs.DM gr-qc
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a dynamical notion of discrete geodesics, understood as
straightest trajectories in discretized curved spacetime. The notion is
generic, as it is formulated in terms of a general deviation function, but
readily specializes to metric spaces such as discretized pseudo-riemannian
manifolds. It is effective: an algorithm for computing these geodesics
naturally follows, which allows numerical validation---as shown by computing
the perihelion shift of a Mercury-like planet. It is consistent, in the
continuum limit, with the standard notion of timelike geodesics in a
pseudo-riemannian manifold. Whether the algorithm fits within the framework of
cellular automata is discussed at length. KEYWORDS: Discrete connection,
parallel transport, general relativity, Regge calculus.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 13:20:01 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Dec 2015 12:48:32 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Arrighi",
"Pablo",
""
],
[
"Dowek",
"Gilles",
""
]
] |
new_dataset
| 0.974775 |
1507.08792
|
R.B. Sandeep
|
R. B. Sandeep, Naveen Sivadasan
|
A cubic vertex kernel for Diamond-free Edge Deletion and more
|
A preliminary version of this paper has appeared in the proceedings
of IPEC 2015
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A diamond is a graph obtained by removing an edge from a complete graph on
four vertices. A graph is diamond-free if it does not contain an induced
diamond. The Diamond-free Edge Deletion problem asks whether there exist at
most $k$ edges in the input graph $G$ whose deletion results in a diamond-free
graph. For this problem, a polynomial kernel of $O(k^4$) vertices was found by
Fellows et. al. (Discrete Optimization, 2011).
In this paper, we give an improved kernel of $O(k^3)$ vertices for
Diamond-free Edge Deletion. Further, we give an $O(k^2)$ vertex kernel for a
related problem {Diamond,K_t}-free Edge Deletion, where $t\geq 4$ is any fixed
integer. To complement our results, we prove that these problems are
NP-complete even for $K_4$-free graphs and can be solved neither in
subexponential time (i.e., $2^{o(|G|)}$) nor in parameterized subexponential
time (i.e., $2^{o(k)}\cdot |G|^{O(1)}$), unless Exponential Time Hypothesis
fails. Our reduction implies the hardness and lower bound for a general class
of problems, where these problems come as a special case.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 08:06:38 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Dec 2015 17:02:10 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Sandeep",
"R. B.",
""
],
[
"Sivadasan",
"Naveen",
""
]
] |
new_dataset
| 0.999831 |
1511.04359
|
Giuliano La Guardia Gadioli
|
Giuliano Gadioli La Guardia and Marcelo Muniz Silva Alves
|
On cyclotomic cosets and code constructions
|
Accepted for publication in Linear Algebra and its Applications
|
Linear Algebra and its Applications, v. 488, p. 302-319, 2016
| null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New properties of $q$-ary cyclotomic cosets modulo $n = q^{m} - 1$, where $q
\geq 3$ is a prime power, are investigated in this paper. Based on these
properties, the dimension as well as bounds for the designed distance of some
families of classical cyclic codes can be computed. As an application, new
families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new
families of convolutional codes are constructed in this work. These new CSS
codes have parameters better than the ones available in the literature. The
convolutional codes constructed here have free distance greater than the ones
available in the literature.
|
[
{
"version": "v1",
"created": "Thu, 12 Nov 2015 14:48:14 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"La Guardia",
"Giuliano Gadioli",
""
],
[
"Alves",
"Marcelo Muniz Silva",
""
]
] |
new_dataset
| 0.999823 |
1512.08991
|
Rasha Montaser
|
Rasha Montaser, Ahmed Younes and Mahmoud Abdel-Aty
|
New Designs of Universal Reversible Gate Library
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present new algorithms to synthesize exact universal reversible gate
library for various types of gates and costs. We use the powerful algebraic
software GAP for implementation and examination of our algorithms and the
reversible logic synthesis problems have been reduced to group theory problems.
It is shown that minimization of arbitrary cost functions of gates and orders
of magnitude are faster than its previously counterparts for reversible logic
synthesis. Experimental results show that a significant improvement over the
previously proposed synthesis algorithm is obtained compared with the existing
approaches to reversible logic synthesis.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 16:20:10 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Montaser",
"Rasha",
""
],
[
"Younes",
"Ahmed",
""
],
[
"Abdel-Aty",
"Mahmoud",
""
]
] |
new_dataset
| 0.977391 |
1512.09207
|
Liliana Cojocaru
|
Liliana Cojocaru
|
Around Context-Free Grammars - a Normal Form, a Representation Theorem,
and a Regular Approximation
|
31 pages, 5 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a normal form for context-free grammars, called Dyck normal
form. This is a syntactical restriction of the Chomsky normal form, in which
the two nonterminals occurring on the right-hand side of a rule are paired
nonterminals. This pairwise property allows to define a homomorphism from Dyck
words to words generated by a grammar in Dyck normal form. We prove that for
each context-free language L, there exist an integer K and a homomorphism h
such that L=h(D'_K), where D'_K is a subset of the one-sided Dyck language over
K letters. Through a transition-like diagram for a context-free grammar in Dyck
normal form, we effectively build a regular language R that satisfies the
Chomsky-Schutzenberger theorem. Using graphical approaches we refine R such
that the Chomsky-Schutzenberger theorem still holds. Based on this readjustment
we sketch a transition diagram for a regular grammar that generates a regular
superset approximation for the initial context-free language.
|
[
{
"version": "v1",
"created": "Thu, 31 Dec 2015 03:51:05 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Cojocaru",
"Liliana",
""
]
] |
new_dataset
| 0.998194 |
1512.09239
|
Corinne Touati
|
Eitan Altman (MAESTRO), Corinne Touati
|
Load Balancing Congestion Games and their Asymptotic Behavior
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A central question in routing games has been to establish conditions for the
uniqueness of the equilibrium, either in terms of network topology or in terms
of costs. This question is well understood in two classes of routing games. The
first is the non-atomic routing introduced by Wardrop on 1952 in the context of
road traffic in which each player (car) is infinitesimally small; a single car
has a negligible impact on the congestion. Each car wishes to minimize its
expected delay. Under arbitrary topology, such games are known to have a convex
potential and thus a unique equilibrium. The second framework is splitable
atomic games: there are finitely many players, each controlling the route of a
population of individuals (let them be cars in road traffic or packets in the
communication networks). In this paper, we study two other frameworks of
routing games in which each of several players has an integer number of
connections (which are population of packets) to route and where there is a
constraint that a connection cannot be split. Through a particular game with a
simple three link topology, we identify various novel and surprising properties
of games within these frameworks. We show in particular that equilibria are non
unique even in the potential game setting of Rosenthal with strictly convex
link costs. We further show that non-symmetric equilibria arise in symmetric
networks. I. INTRODUCTION A central question in routing games has been to
establish conditions for the uniqueness of the equilibria, either in terms of
the network topology or in terms of the costs. A survey on these issues is
given in [1]. The question of uniqueness of equilibria has been studied in two
different frameworks. The first, which we call F1, is the non-atomic routing
introduced by Wardrop on 1952 in the context of road traffic in which each
player (car) is infinitesimally small; a single car has a negligible impact on
the congestion. Each car wishes to minimize its expected delay. Under arbitrary
topology, such games are known to have a convex potential and thus have a
unique equilibrium [2]. The second framework, denoted by F2, is splitable
atomic games. There are finitely many players, each controlling the route of a
population of individuals. This type of games have already been studied in the
context of road traffic by Haurie and Marcotte [3] but have become central in
the telecom community to model routing decisions of Internet Service Providers
that can decide how to split the traffic of their subscribers among various
routes so as to minimize network congestion [4]. In this paper we study
properties of equilibria in two other frameworks of routing games which exhibit
surprising
|
[
{
"version": "v1",
"created": "Thu, 31 Dec 2015 08:21:35 GMT"
}
] | 2016-01-01T00:00:00 |
[
[
"Altman",
"Eitan",
"",
"MAESTRO"
],
[
"Touati",
"Corinne",
""
]
] |
new_dataset
| 0.997893 |
1212.6882
|
Vivek Nittoor
|
Vivek S. Nittoor
|
Regular Bipartite Graphs And Their Properties
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new notation for representing labeled regular bipartite graphs
of arbitrary degree. Several enumeration problems for labeled and unlabeled
regular bipartite graphs have been introduced. A general algorithm for
enumerating all non-isomorphic 2-regular bipartite graphs for a specified
number of vertices has been described and a mathematical proof has been
provided for its completeness. An abstraction of m Symmetric Permutation Tree
in order to visualize a labeled r-Regular Bipartite Graph with 2m vertices and
enumerate its automorphism group has been introduced. An algorithm to generate
the partition associated with two compatible permutations has been introduced.
The relationship between Automorphism Group and permutation enumeration problem
has been used to derive formulae for the number of compatible permutations
corresponding to a specified partition.
|
[
{
"version": "v1",
"created": "Mon, 31 Dec 2012 12:46:01 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jan 2013 15:05:04 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Mar 2013 16:50:05 GMT"
},
{
"version": "v4",
"created": "Tue, 29 Dec 2015 16:29:29 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Nittoor",
"Vivek S.",
""
]
] |
new_dataset
| 0.999528 |
1302.3831
|
Diederik Aerts
|
Diederik Aerts and Sandro Sozzo
|
Quantum Entanglement in Concept Combinations
|
16 pages, no figures
|
International Journal of Theoretical Physics, 53, pp. 3587-3603,
2014
|
10.1007/s10773-013-1946-z
| null |
cs.AI cs.CL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research in the application of quantum structures to cognitive science
confirms that these structures quite systematically appear in the dynamics of
concepts and their combinations and quantum-based models faithfully represent
experimental data of situations where classical approaches are problematical.
In this paper, we analyze the data we collected in an experiment on a specific
conceptual combination, showing that Bell's inequalities are violated in the
experiment. We present a new refined entanglement scheme to model these data
within standard quantum theory rules, where 'entangled measurements and
entangled evolutions' occur, in addition to the expected 'entangled states',
and present a full quantum representation in complex Hilbert space of the data.
This stronger form of entanglement in measurements and evolutions might have
relevant applications in the foundations of quantum theory, as well as in the
interpretation of nonlocality tests. It could indeed explain some
non-negligible 'anomalies' identified in EPR-Bell experiments.
|
[
{
"version": "v1",
"created": "Fri, 15 Feb 2013 18:20:25 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Aug 2013 17:51:50 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Aerts",
"Diederik",
""
],
[
"Sozzo",
"Sandro",
""
]
] |
new_dataset
| 0.954804 |
1304.0100
|
Diederik Aerts
|
Diederik Aerts and Sandro Sozzo
|
Entanglement Zoo I: Foundational and Structural Aspects
|
11 pages
|
Quantum Interaction. Lecture Notes in Computer Science, 8369, pp.
84-96, 2014
|
10.1007/978-3-642-54943-4_8
| null |
cs.AI quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We put forward a general classification for a structural description of the
entanglement present in compound entities experimentally violating Bell's
inequalities, making use of a new entanglement scheme that we developed
recently. Our scheme, although different from the traditional one, is
completely compatible with standard quantum theory, and enables quantum
modeling in complex Hilbert space for different types of situations. Namely,
situations where entangled states and product measurements appear ('customary
quantum modeling'), and situations where states and measurements and evolutions
between measurements are entangled ('nonlocal box modeling', 'nonlocal
non-marginal box modeling'). The role played by Tsirelson's bound and marginal
distribution law is emphasized. Specific quantum models are worked out in
detail in complex Hilbert space within this new entanglement scheme.
|
[
{
"version": "v1",
"created": "Sat, 30 Mar 2013 12:41:48 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Sep 2013 15:57:52 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Aerts",
"Diederik",
""
],
[
"Sozzo",
"Sandro",
""
]
] |
new_dataset
| 0.999558 |
1304.0102
|
Diederik Aerts
|
Diederik Aerts and Sandro Sozzo
|
Entanglement Zoo II: Examples in Physics and Cognition
|
11 pages
|
Quantum Interaction. Lecture Notes in Computer Science, 8369, pp.
97-109, 2014
|
10.1007/978-3-642-54943-4_9
| null |
cs.AI quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have recently presented a general scheme enabling quantum modeling of
different types of situations that violate Bell's inequalities. In this paper,
we specify this scheme for a combination of two concepts. We work out a quantum
Hilbert space model where 'entangled measurements' occur in addition to the
expected 'entanglement between the component concepts', or 'state
entanglement'. We extend this result to a macroscopic physical entity, the
'connected vessels of water', which maximally violates Bell's inequalities. We
enlighten the structural and conceptual analogies between the cognitive and
physical situations which are both examples of a nonlocal non-marginal box
modeling in our classification.
|
[
{
"version": "v1",
"created": "Sat, 30 Mar 2013 12:46:29 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Sep 2013 16:04:15 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Aerts",
"Diederik",
""
],
[
"Sozzo",
"Sandro",
""
]
] |
new_dataset
| 0.999126 |
1512.08626
|
Danil Nemirovsky
|
Danil Nemirovsky
|
Block Advertisement Protocol
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoin, a decentralized cryptocurrency, has attracted a lot of attention
from academia, financial service industry and enthusiasts. The trade-off
between transaction confirmation throughput and centralization of hash power do
not allow Bitcoin to perform at the same level as modern payment systems. Block
Advertisement Protocol is proposed as a step to resolve this issue. The
protocol allows block mining and block relaying to happen in parallel. The
protocol dictates a miner to advertise the block it is going to mine allowing
other miners to collect all the transactions in advance. When a block in mined,
only header is relayed since most of data about the block is already known to
all miners.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 2015 09:08:46 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Nemirovsky",
"Danil",
""
]
] |
new_dataset
| 0.999438 |
1512.08846
|
Raymond Scaringe
|
Raymond P. Scaringe
|
Apollonius Solutions in Rd
|
30 pages, 9 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voronoi and related diagrams have technological applications, for example, in
motion planning and surface reconstruction, and also find significant use in
materials science, molecular biology, and crystallography. Apollonius diagrams
arguably provide the most natural division of space for many materials and
technology problems, but compared to Voronoi and power diagrams, their use has
been limited, presumably by the complexity of their calculation. In this work,
we report explicit equations for the vertices of the Apollonius diagram in a
d-dimensional Euclidean space. We show that there are special lines that
contain vertices of more than one type of diagram and this property can be
exploited to develop simple vertex expressions for the Apollonius diagram.
Finding the Apollonius vertices is not significantly more difficult or
expensive than computing those of the power diagram and have application beyond
their use in calculating the diagram. The expressions reported here lend
themselves to the use of standard vector and matrix libraries and the stability
and precision their use implies. They can also be used in algorithms with
multi-precision numeric types and those adhering to the exact algorithms
paradigm. The results have been coded in C++ for the 2-d and 3-d cases and an
example of their use in characterizing the shape of a void in a molecular
crystal is given.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 04:24:58 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Scaringe",
"Raymond P.",
""
]
] |
new_dataset
| 0.999761 |
1512.08891
|
Rob van Glabbeek
|
Rob van Glabbeek, Peter H\"ofner, Wee Lum Tan and Marius Portmann
|
Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing
Loops
|
arXiv admin note: text overlap with arXiv:1312.7645
|
Proc. Modeling, Analysis and Simulation of Wireless and Mobile
Systems, MSWiM'13, ACM, 2013, pp. 91-100
|
10.1145/2507924.2507943
| null |
cs.NI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the area of mobile ad-hoc networks and wireless mesh networks, sequence
numbers are often used in routing protocols to avoid routing loops. It is
commonly stated in protocol specifications that sequence numbers are sufficient
to guarantee loop freedom if they are monotonically increased over time. A
classical example for the use of sequence numbers is the popular Ad hoc
On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is
not only a common belief, it has been claimed in the abstract of its RFC and at
least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO)
and HWMP also claim loop freedom due to the same use of sequence numbers.
In this paper we show that AODV is not a priori loop free; by this we counter
the proposed proofs in the literature. In fact, loop freedom hinges on
non-evident assumptions to be made when resolving ambiguities occurring in the
RFC. Thus, monotonically increasing sequence numbers, by themselves, do not
guarantee loop freedom.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 09:51:05 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"van Glabbeek",
"Rob",
""
],
[
"Höfner",
"Peter",
""
],
[
"Tan",
"Wee Lum",
""
],
[
"Portmann",
"Marius",
""
]
] |
new_dataset
| 0.998921 |
1512.08943
|
Gregory Chockler
|
Vita Bortnikov, Gregory Chockler, Dmitri Perelman, Alexey Roytman,
Shlomit Shachor, and Ilya Shnayderman
|
Reconfigurable State Machine Replication from Non-Reconfigurable
Building Blocks
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reconfigurable state machine replication is an important enabler of
elasticity for replicated cloud services, which must be able to dynamically
adjust their size as a function of changing load and resource availability. We
introduce a new generic framework to allow the reconfigurable state machine
implementation to be derived from a collection of arbitrary non-reconfigurable
state machines. Our reduction framework follows the black box approach, and
does not make any assumptions with respect to its execution environment apart
from reliable channels. It allows higher-level services to leverage speculative
command execution to ensure uninterrupted progress during the reconfiguration
periods as well as in situations where failures prevent the reconfiguration
agreement from being reached in a timely fashion. We apply our framework to
obtain a reconfigurable speculative state machine from the non-reconfigurable
Paxos implementation, and analyze its performance on a realistic distributed
testbed. Our results show that our framework incurs negligible overheads in the
absence of reconfiguration, and allows steady throughput to be maintained
throughout the reconfiguration periods.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 13:47:32 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Bortnikov",
"Vita",
""
],
[
"Chockler",
"Gregory",
""
],
[
"Perelman",
"Dmitri",
""
],
[
"Roytman",
"Alexey",
""
],
[
"Shachor",
"Shlomit",
""
],
[
"Shnayderman",
"Ilya",
""
]
] |
new_dataset
| 0.977197 |
1512.09070
|
Robert B. Allen
|
Robert Burnell Allen
|
Repositories with Direct Representation
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new generation of digital repositories could be based on direct
representation of the contents with rich semantics and models rather than be
collections of documents. The contents of such repositories would be highly
structured which should help users to focus on meaningful relationships of the
contents. These repositories would implement earlier proposals for
model-oriented information organization by extending current work on ontologies
to cover state changes, instances, and scenarios. They could also apply other
approaches such as object-oriented design and frame semantics. In addition to
semantics, the representation needs to allow for discourse and repository
knowledge-support services and policies. For instance, the knowledge base would
need to be systematically updated as new findings and theories reshape it.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 19:27:15 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Allen",
"Robert Burnell",
""
]
] |
new_dataset
| 0.985836 |
1512.09132
|
Julian Dibbelt
|
Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner
|
Dynamic Time-Dependent Route Planning in Road Networks with User
Preferences
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been tremendous progress in algorithmic methods for computing
driving directions on road networks. Most of that work focuses on
time-independent route planning, where it is assumed that the cost on each arc
is constant per query. In practice, the current traffic situation significantly
influences the travel time on large parts of the road network, and it changes
over the day. One can distinguish between traffic congestion that can be
predicted using historical traffic data, and congestion due to unpredictable
events, e.g., accidents. In this work, we study the \emph{dynamic and
time-dependent} route planning problem, which takes both prediction (based on
historical data) and live traffic into account. To this end, we propose a
practical algorithm that, while robust to user preferences, is able to
integrate global changes of the time-dependent metric~(e.g., due to traffic
updates or user restrictions) faster than previous approaches, while allowing
subsequent queries that enable interactive applications.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 20:58:03 GMT"
}
] | 2015-12-31T00:00:00 |
[
[
"Baum",
"Moritz",
""
],
[
"Dibbelt",
"Julian",
""
],
[
"Pajor",
"Thomas",
""
],
[
"Wagner",
"Dorothea",
""
]
] |
new_dataset
| 0.952694 |
1412.3224
|
Zhaoyu Dong
|
Dong Zhaoyu, Gao Bing, Zhao Yinliang, Song Shaolong, Du Yanning
|
Prophet: A Speculative Multi-threading Execution Model with
Architectural Support Based on CMP
|
9 pages
| null |
10.1109/EmbeddedCom-ScalCom.2009.128
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Speculative multi-threading (SpMT) has been proposed as a perspective method
to exploit Chip Multiprocessors (CMP) hardware potential. It is a thread level
speculation (TLS) model mainly depending on software and hardware co-design.
This paper researches speculative thread-level parallelism of general purpose
programs and a speculative multi-threading execution model called Prophet is
presented. The architectural support for Prophet execution model is designed
based on CMP. In Prophet the inter-thread data dependency are predicted by
pre-computation slice (p-slice) to reduce RAW violation. Prophet
multi-versioning Cache system along with thread state control mechanism in
architectural support are utilized for buffering the speculative data, and a
snooping bus based cache coherence protocol is used to detect data dependence
violation. The simulation-based evaluation shows that the Prophet system could
achieve significant speedup for general-purpose programs.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2014 08:43:27 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Zhaoyu",
"Dong",
""
],
[
"Bing",
"Gao",
""
],
[
"Yinliang",
"Zhao",
""
],
[
"Shaolong",
"Song",
""
],
[
"Yanning",
"Du",
""
]
] |
new_dataset
| 0.974279 |
1512.07919
|
Alice Allen
|
Alice Allen, G. Bruce Berriman, Kimberly DuPrie, Jessica Mink, Robert
Nemiroff, Thomas Robitaille, Lior Shamir, Keith Shortridge, Mark Taylor,
Peter Teuben, John Wallin
|
Improving Software Citation and Credit
|
Birds of a Feather session organized by the Astrophysics Source Code
Library (ASCL, http://ascl.net/ ); to be published in Proceedings of ADASS
XXV (Sydney, Australia; October, 2015). 4 pages
| null | null | null |
cs.DL astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The past year has seen movement on several fronts for improving software
citation, including the Center for Open Science's Transparency and Openness
Promotion (TOP) Guidelines, the Software Publishing Special Interest Group that
was started at January's AAS meeting in Seattle at the request of that
organization's Working Group on Astronomical Software, a Sloan-sponsored
meeting at GitHub in San Francisco to begin work on a cohesive research
software citation-enabling platform, the work of Force11 to "transform and
improve" research communication, and WSSSPE's ongoing efforts that include
software publication, citation, credit, and sustainability.
Brief reports on these efforts were shared at the BoF, after which
participants discussed ideas for improving software citation, generating a list
of recommendations to the community of software authors, journal publishers,
ADS, and research authors. The discussion, recommendations, and feedback will
help form recommendations for software citation to those publishers represented
in the Software Publishing Special Interest Group and the broader community.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 21:01:08 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Allen",
"Alice",
""
],
[
"Berriman",
"G. Bruce",
""
],
[
"DuPrie",
"Kimberly",
""
],
[
"Mink",
"Jessica",
""
],
[
"Nemiroff",
"Robert",
""
],
[
"Robitaille",
"Thomas",
""
],
[
"Shamir",
"Lior",
""
],
[
"Shortridge",
"Keith",
""
],
[
"Taylor",
"Mark",
""
],
[
"Teuben",
"Peter",
""
],
[
"Wallin",
"John",
""
]
] |
new_dataset
| 0.995019 |
1512.08144
|
Umberto Mart\'inez-Pe\~nas
|
Umberto Mart\'inez-Pe\~nas and Ruud Pellikaan
|
Rank error-correcting pairs
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Error-correcting pairs were introduced independently by Pellikaan and
K\"otter as a general method of decoding linear codes with respect to the
Hamming metric using coordinatewise products of vectors, and are used for many
well-known families of codes. In this paper, we define new types of vector
products, extending the coordinatewise product, some of which preserve symbolic
products of linearized polynomials after evaluation and some of which coincide
with usual products of matrices. Then we define rank error-correcting pairs for
codes that are linear over the extension field and for codes that are linear
over the base field, and relate both types. Bounds on the minimum rank distance
of codes and MRD conditions are given. Finally we show that some well-known
families of rank-metric codes admit rank error-correcting pairs, and show that
the given algorithm generalizes the classical algorithm using error-correcting
pairs for the Hamming metric.
|
[
{
"version": "v1",
"created": "Sat, 26 Dec 2015 20:49:19 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Martínez-Peñas",
"Umberto",
""
],
[
"Pellikaan",
"Ruud",
""
]
] |
new_dataset
| 0.974346 |
1512.08201
|
Przemys{\l}aw Skurowski
|
Kamil Rzepka, Przemys{\l}aw Skurowski, B{\l}a\.zej Adamczyk, Adam
Pil\'sniak
|
Design of portable power consumption measuring system for green
computing needs
|
submitted to Studia Informatica ( http://studiainformatica.polsl.pl/
)
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The article presents the design of a digital power measurement device
intended for the green IT. Article comprises: use case analysis, accuracy and
precision measurements and real life test of apache web server as exemplary
application.
|
[
{
"version": "v1",
"created": "Sun, 27 Dec 2015 10:47:29 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Rzepka",
"Kamil",
""
],
[
"Skurowski",
"Przemysław",
""
],
[
"Adamczyk",
"Błażej",
""
],
[
"Pilśniak",
"Adam",
""
]
] |
new_dataset
| 0.99002 |
1512.08230
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Thirty eight things to do with live slime mould
|
this is a draft of the chapter to appear in 'Advances in
Unconventional Computing' (Sprineer, 2016)
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slime mould \emph{Physarum polycephalum} is a large single cell capable for
distributed sensing, concurrent information processing, parallel computation
and decentralised actuation. The ease of culturing and experimenting with
Physarum makes this slime mould an ideal substrate for real-world
implementations of unconventional sensing and computing devices. In the last
decade the Physarum became a swiss knife of the unconventional computing: give
the slime mould a problem it will solve it. We provide a concise summary of
what exact computing and sensing operations are implemented with live slime
mould. The Physarum devices range from morphological processors for
computational geometry to experimental archeology tools, from self-routing
wires to memristors, from devices approximating a shortest path to analog
physical models of space exploration.
|
[
{
"version": "v1",
"created": "Sun, 27 Dec 2015 15:39:34 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.950263 |
1512.08292
|
Saeed Mehrabi
|
Saeed Mehrabi
|
Guarding the Vertices of an Orthogonal Terrain using Vertex Guards
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A terrain T is an x-monotone polygonal chain in the plane; T is orthogonal if
each edge of T is either horizontal or vertical. In this paper, we give an
exact algorithm for the problem of guarding the convex vertices of an
orthogonal terrain with the minimum number of reflex vertices.
|
[
{
"version": "v1",
"created": "Mon, 28 Dec 2015 00:01:52 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Mehrabi",
"Saeed",
""
]
] |
new_dataset
| 0.999782 |
1512.08454
|
Yongge Wang
|
Yongge Wang
|
Quantum Resistant Random Linear Code Based Public Key Encryption Scheme
RLCE
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lattice based encryption schemes and linear code based encryption schemes
have received extensive attention in recent years since they have been
considered as post-quantum candidate encryption schemes. Though LLL reduction
algorithm has been one of the major cryptanalysis techniques for lattice based
cryptographic systems, key recovery cryptanalysis techniques for linear code
based cryptographic systems are generally scheme specific. In recent years,
several important techniques such as Sidelnikov-Shestakov attack, filtration
attacks, and algebraic attacks have been developed to crypt-analyze linear code
based encryption schemes. Though most of these cryptanalysis techniques are
relatively new, they prove to be very powerful and many systems have been
broken using them. Thus it is important to design linear code based
cryptographic systems that are immune against these attacks. This paper
proposes linear code based encryption scheme RLCE which shares many
characteristics with random linear codes. Our analysis shows that the scheme
RLCE is secure against existing attacks and we hope that the security of the
RLCE scheme is equivalent to the hardness of decoding random linear codes.
Example parameters for different security levels are recommended for the scheme
RLCE.
|
[
{
"version": "v1",
"created": "Mon, 28 Dec 2015 16:50:24 GMT"
}
] | 2015-12-29T00:00:00 |
[
[
"Wang",
"Yongge",
""
]
] |
new_dataset
| 0.998983 |
1401.2220
|
Pascal Giard
|
Georges Kaddoum and Pascal Giard
|
Analog Network Coding for Multi-User Spread-Spectrum Communication
Systems
|
6 pages, 2 figures, to appear at IEEE WCNC'14
| null |
10.1109/WCNC.2014.6952033
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents another look at an analog network coding scheme for
multi-user spread-spectrum communication systems. Our proposed system combines
coding and cooperation between a relay and users to boost the throughput and to
exploit interference. To this end, each pair of users, $\mathcal{A}$ and
$\mathcal{B}$, that communicate with each other via a relay $\mathcal{R}$
shares the same spreading code. The relay has two roles, it synchronizes
network transmissions and it broadcasts the combined signals received from
users. From user $\mathcal{B}$'s point of view, the signal is decoded, and
then, the data transmitted by user $\mathcal{A}$ is recovered by subtracting
user $\mathcal{B}$'s own data. We derive the analytical performance of this
system for an additive white Gaussian noise channel with the presence of
multi-user interference, and we confirm its accuracy by simulation.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 03:06:12 GMT"
}
] | 2015-12-25T00:00:00 |
[
[
"Kaddoum",
"Georges",
""
],
[
"Giard",
"Pascal",
""
]
] |
new_dataset
| 0.976157 |
1502.02927
|
Claudia Tinnirello
|
Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala and Claudia
Tinnirello
|
On the shape of the general error locator polynomial for cyclic codes
|
33 pages, 12 tables, Submitted to IEEE Transactions on Information
Theory in Feb. 2015, Revised version submitted in Dec. 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A general result on the explicit form of the general error locator polynomial
for all cyclic codes is given, along with several results for infinite classes
of cyclic codes with $t=2$ and $t=3$. From these, a theoretically justification
of the sparsity of the general error locator polynomial is obtained for all
cyclic codes with $t\leq 3$ and $n<63$, except for three cases where the
sparsity is proved by a computer check. Moreover, we discuss some consequences
of our results to the understanding of the complexity of bounded-distance
decoding of cyclic codes.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 14:54:15 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Aug 2015 09:05:44 GMT"
},
{
"version": "v3",
"created": "Thu, 24 Dec 2015 09:22:44 GMT"
}
] | 2015-12-25T00:00:00 |
[
[
"Caruso",
"Fabrizio",
""
],
[
"Orsini",
"Emmanuela",
""
],
[
"Sala",
"Massimiliano",
""
],
[
"Tinnirello",
"Claudia",
""
]
] |
new_dataset
| 0.997269 |
1505.01466
|
Gabi Sarkis
|
Gabi Sarkis, Pascal Giard, Alexander Vardy, Claude Thibeault, and
Warren J. Gross
|
Fast List Decoders for Polar Codes
|
to appear in the IEEE Journal on Selected Areas in Communications -
Special Issue on Recent Advances In Capacity Approaching Codes, 2016
| null |
10.1109/JSAC.2015.2504299
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes asymptotically achieve the symmetric capacity of memoryless
channels, yet their error-correcting performance under successive-cancellation
(SC) decoding for short and moderate length codes is worse than that of other
modern codes such as low-density parity-check (LDPC) codes. Of the many methods
to improve the error-correction performance of polar codes, list decoding
yields the best results, especially when the polar code is concatenated with a
cyclic redundancy check (CRC). List decoding involves exploring several
decoding paths with SC decoding, and therefore tends to be slower than SC
decoding itself, by an order of magnitude in practical implementations. In this
paper, we present a new algorithm based on unrolling the decoding tree of the
code that improves the speed of list decoding by an order of magnitude when
implemented in software. Furthermore, we show that for software-defined radio
applications, our proposed algorithm is faster than the fastest software
implementations of LDPC decoders in the literature while offering comparable
error-correction performance at similar or shorter code lengths.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2015 19:15:44 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Nov 2015 16:36:22 GMT"
}
] | 2015-12-25T00:00:00 |
[
[
"Sarkis",
"Gabi",
""
],
[
"Giard",
"Pascal",
""
],
[
"Vardy",
"Alexander",
""
],
[
"Thibeault",
"Claude",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.999553 |
1512.07805
|
Maomeng Su
|
Maomeng Su, Mingxing Zhang, Kang Chen, Yongwei Wu, and Guoliang Li
|
RFP: A Remote Fetching Paradigm for RDMA-Accelerated Systems
|
11 pages, 10 figures; Key Words: RDMA and InfiniBand, Remote Fetching
Paradigm, IOPS, and Small Data
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Remote Direct Memory Access (RDMA) is an efficient way to improve the
performance of traditional client-server systems. Currently, there are two main
design paradigms for RDMA-accelerated systems. The first allows the clients to
directly operate the server's memory and totally bypasses the CPUs at server
side. The second follows the traditional server-reply paradigm, which asks the
server to write results back to the clients. However, the first method has to
expose server's memory and needs tremendous re-design of upper-layer software,
which is complex, unsafe, error-prone, and inefficient. The second cannot
achieve high input/output operations per second (IOPS), because it employs
out-bound RDMA-write at server side which is not efficient.
We find that the performance of out-bound RDMA-write and in-bound RDMA-read
is asymmetric and the latter is 5 times faster than the former. Based on this
observation, we propose a novel design paradigm named Remote Fetching Paradigm
(RFP). In RFP, the server is still responsible for processing requests from the
clients. However, counter-intuitively, instead of sending results back to the
clients through out-bound RDMA-write, the server only writes the results in
local memory buffers, and the clients use in-bound RDMA-read to remotely fetch
these results. Since in-bound RDMA-read achieves much higher IOPS than
out-bound RDMA-write, our model is able to bring higher performance than the
traditional models.
In order to prove the effectiveness of RFP, we design and implement an
RDMA-accelerated in-memory key-value store following the RFP model. To further
improve the IOPS, we propose an optimization mechanism that combines status
checking and result fetching. Experiment results show that RFP can improve the
IOPS by 160%~310% against state-of-the-art models for in-memory key-value
stores.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 12:49:43 GMT"
}
] | 2015-12-25T00:00:00 |
[
[
"Su",
"Maomeng",
""
],
[
"Zhang",
"Mingxing",
""
],
[
"Chen",
"Kang",
""
],
[
"Wu",
"Yongwei",
""
],
[
"Li",
"Guoliang",
""
]
] |
new_dataset
| 0.981218 |
1512.07872
|
Carla Michini
|
Alberto Del Pia and Carla Michini
|
On the diameter of lattice polytopes
| null | null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we show that the diameter of a d-dimensional lattice polytope
in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a
d-dimensional half-integral polytope is at most 3/2 d. We also show that for
half-integral polytopes the latter bound is tight for any d.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 17:54:21 GMT"
}
] | 2015-12-25T00:00:00 |
[
[
"Del Pia",
"Alberto",
""
],
[
"Michini",
"Carla",
""
]
] |
new_dataset
| 0.982415 |
1405.7290
|
Christian Jacobs
|
Christian T. Jacobs, Alexandros Avdis, Gerard J. Gorman, Matthew D.
Piggott
|
PyRDM: A Python-based library for automating the management and online
publication of scientific software and data
|
Revised version. The main changes are: Added pdfLaTeX to the
dependencies list; Improved Figure 1 to show the 'publish' option selected in
Diamond; Added two paragraphs to explain why users would want to use PyRDM;
Added some content on the PyRDM roadmap, and also some content regarding
engagement with libraries and research software engineers
|
Journal of Open Research Software 2:e28 (2014) 1-6
|
10.5334/jors.bj
| null |
cs.CE cs.DL cs.MS
|
http://creativecommons.org/licenses/by/3.0/
|
The recomputability and reproducibility of results from scientific software
requires access to both the source code and all associated input and output
data. However, the full collection of these resources often does not accompany
the key findings published in journal articles, thereby making it difficult or
impossible for the wider scientific community to verify the correctness of a
result or to build further research on it. This paper presents a new
Python-based library, PyRDM, whose functionality aims to automate the process
of sharing the software and data via online, citable repositories such as
Figshare. The library is integrated into the workflow of an open-source
computational fluid dynamics package, Fluidity, to demonstrate an example of
its usage.
|
[
{
"version": "v1",
"created": "Wed, 28 May 2014 16:07:12 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Aug 2014 10:48:05 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Jacobs",
"Christian T.",
""
],
[
"Avdis",
"Alexandros",
""
],
[
"Gorman",
"Gerard J.",
""
],
[
"Piggott",
"Matthew D.",
""
]
] |
new_dataset
| 0.996267 |
1412.4646
|
Robert Merca\c{s}
|
Maxime Crochemore and Robert Mercas
|
Fewer runs than word length
| null | null | null | null |
cs.DM cs.DS cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work takes another look at the number of runs that a string might contain
and provides an alternative proof for the bound. We also propose another
stronger conjecture that states that, for a fixed order on the alphabet, within
every factor of a word there are at most as many occurrences of Lyndon roots
corresponding to runs in a word as the length of the factor (only first such
occurrences for each run are considered).
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2014 15:54:46 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Oct 2015 06:49:32 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Dec 2015 08:06:19 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Crochemore",
"Maxime",
""
],
[
"Mercas",
"Robert",
""
]
] |
new_dataset
| 0.966255 |
1505.07002
|
Martin Monperrus
|
Matias Martinez and Thomas Durieux and Jifeng Xuan and Romain
Sommerard and Martin Monperrus
|
Automatic Repair of Real Bugs: An Experience Report on the Defects4J
Dataset
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Defects4J is a large, peer-reviewed, structured dataset of real-world Java
bugs. Each bug in Defects4J is provided with a test suite and at least one
failing test case that triggers the bug. In this paper, we report on an
experiment to explore the effectiveness of automatic repair on Defects4J. The
result of our experiment shows that 47 bugs of the Defects4J dataset can be
automatically repaired by state-of- the-art repair. This sets a baseline for
future research on automatic repair for Java. We have manually analyzed 84
different patches to assess their real correctness. In total, 9 real Java bugs
can be correctly fixed with test-suite based repair. This analysis shows that
test-suite based repair suffers from under-specified bugs, for which trivial
and incorrect patches still pass the test suite. With respect to practical
applicability, it takes in average 14.8 minutes to find a patch. The experiment
was done on a scientific grid, totaling 17.6 days of computation time. All
their systems and experimental results are publicly available on Github in
order to facilitate future research on automatic repair.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2015 15:21:34 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Dec 2015 11:09:46 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Martinez",
"Matias",
""
],
[
"Durieux",
"Thomas",
""
],
[
"Xuan",
"Jifeng",
""
],
[
"Sommerard",
"Romain",
""
],
[
"Monperrus",
"Martin",
""
]
] |
new_dataset
| 0.999467 |
1512.07341
|
Fei Li
|
Qiuyan Wang, Fei Li, Kelan Ding and Dongdai Lin
|
Complete weight enumerators of two classes of linear codes
|
15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, linear codes with few weights have been constructed and extensively
studied. In this paper, for an odd prime p, we determined the complete weight
enumerator of two classes of p-ary linear codes constructed from defining set.
Results show that the codes are at almost seven-weight linear codes and they
may have applications in secret sharing schemes.
|
[
{
"version": "v1",
"created": "Wed, 23 Dec 2015 02:56:15 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Wang",
"Qiuyan",
""
],
[
"Li",
"Fei",
""
],
[
"Ding",
"Kelan",
""
],
[
"Lin",
"Dongdai",
""
]
] |
new_dataset
| 0.994128 |
1512.07347
|
Yun Fan
|
Yun Fan and Liang Zgang
|
Galois Self-Dual Constacyclic Codes
|
Key words: Constacyclic code, Galois inner product, $q$-coset
function, isometry, Galois self-dual code
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generalizing Euclidean inner product and Hermitian inner product, we
introduce Galois inner products, and study the Galois self-dual constacyclic
codes in a very general setting by a uniform method. The conditions for
existence of Galois self-dual and isometrically Galois self-dual constacyclic
codes are obtained. As consequences, the results on self-dual, iso-dual and
Hermitian self-dual constacyclic codes are derived.
|
[
{
"version": "v1",
"created": "Wed, 23 Dec 2015 03:28:52 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Zgang",
"Liang",
""
]
] |
new_dataset
| 0.992906 |
1512.07469
|
Yueling Che
|
Yueling Che, Lingjie Duan, and Rui Zhang
|
Dynamic Base Station Operation in Large-Scale Green Cellular Networks
|
Submitted for possible journal publication. 29 pages, 6 figures, and
1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, to minimize the on-grid energy cost in a large-scale green
cellular network, we jointly design the optimal base station (BS) on/off
operation policy and the on-grid energy purchase policy from a network-level
perspective. Due to the fluctuations of the on-grid energy prices, the
harvested renewable energy, and the network traffic loads over time, as well as
the BS coordination to hand over the traffic offloaded from the inactive BSs to
the active BSs, it is generally NP-hard to find a network-level optimal
adaptation policy that can minimize the on-grid energy cost over a long-term
and yet assures the downlink transmission quality at the same time. Aiming at
the network-level dynamic system design, we jointly apply stochastic geometry
(Geo) for large-scale green cellular network analysis and dynamic programming
(DP) for adaptive BS on/off operation design and on-grid energy purchase
design, and thus propose a new Geo-DP design approach. By this approach, we
obtain the optimal BS on/off policy, which shows that the optimal BSs' active
operation probability in each horizon is just sufficient to assure the required
downlink transmission quality with time-varying load in the large-scale
cellular network. We also propose a suboptimal on-grid energy purchase policy
with low-complexity, where the low-price on-grid energy is over-purchased in
the current horizon only when the current storage level and the future
renewable energy level are both low. We compare the proposed policy with the
existing schemes and show that our proposed policy can more efficiently save
the on-grid energy cost over time.
|
[
{
"version": "v1",
"created": "Wed, 23 Dec 2015 13:43:51 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Che",
"Yueling",
""
],
[
"Duan",
"Lingjie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.999485 |
1512.07502
|
J.T. Turner
|
J.T. Turner, David Aha, Leslie Smith, Kalyan Moy Gupta
|
Convolutional Architecture Exploration for Action Recognition and Image
Classification
|
12 pages. 11 tables. 0 Images. Written Summer 2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convolutional Architecture for Fast Feature Encoding (CAFFE) [11] is a
software package for the training, classifying, and feature extraction of
images. The UCF Sports Action dataset is a widely used machine learning dataset
that has 200 videos taken in 720x480 resolution of 9 different sporting
activities: diving, golf, swinging, kicking, lifting, horseback riding,
running, skateboarding, swinging (various gymnastics), and walking. In this
report we report on a caffe feature extraction pipeline of images taken from
the videos of the UCF Sports Action dataset. A similar test was performed on
overfeat, and results were inferior to caffe. This study is intended to explore
the architecture and hyper parameters needed for effective static analysis of
action in videos and classification over a variety of image datasets.
|
[
{
"version": "v1",
"created": "Wed, 23 Dec 2015 14:54:43 GMT"
}
] | 2015-12-24T00:00:00 |
[
[
"Turner",
"J. T.",
""
],
[
"Aha",
"David",
""
],
[
"Smith",
"Leslie",
""
],
[
"Gupta",
"Kalyan Moy",
""
]
] |
new_dataset
| 0.99419 |
1505.07726
|
Can Xiang
|
Can Xiang
|
Linear Codes from a Generic Construction
|
arXiv admin note: text overlap with arXiv:1503.06511,
arXiv:1503.06512 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A generic construction of linear codes over finite fields has recently
received a lot of attention, and many one-weight, two-weight and three-weight
codes with good error correcting capability have been produced with this
generic approach. The first objective of this paper is to establish
relationships among some classes of linear codes obtained with this approach,
so that the parameters of some classes of linear codes can be derived from
those of other classes with known parameters. In this way, linear codes with
new parameters will be derived. The second is to present a class of
three-weight binary codes and consider their applications in secret sharing.
|
[
{
"version": "v1",
"created": "Thu, 28 May 2015 15:25:06 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Dec 2015 12:27:17 GMT"
}
] | 2015-12-23T00:00:00 |
[
[
"Xiang",
"Can",
""
]
] |
new_dataset
| 0.996533 |
1511.08605
|
Bruno Courcelle
|
Bruno Courcelle (LaBRI)
|
Fly-automata for checking MSO 2 graph properties
|
Submitted for publication in December 2015
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A more descriptive but too long title would be : Constructing fly-automata to
check properties of graphs of bounded tree-width expressed by monadic
second-order formulas written with edge quantifications. Such properties are
called MSO2 in short. Fly-automata (FA) run bottom-up on terms denoting graphs
and compute "on the fly" the necessary states and transitions instead of
looking into huge, actually unimplementable tables. In previous works, we have
constructed FA that process terms denoting graphs of bounded clique-width, in
order to check their monadic second-order (MSO) properties (expressed by
formulas without edge quan-tifications). Here, we adapt these FA to incidence
graphs, so that they can check MSO2 properties of graphs of bounded tree-width.
This is possible because: (1) an MSO2 property of a graph is nothing but an MSO
property of its incidence graph and (2) the clique-width of the incidence graph
of a graph is linearly bounded in terms of its tree-width. Our constructions
are actually implementable and usable. We detail concrete constructions of
automata in this perspective.
|
[
{
"version": "v1",
"created": "Fri, 27 Nov 2015 10:19:43 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Dec 2015 09:13:45 GMT"
}
] | 2015-12-23T00:00:00 |
[
[
"Courcelle",
"Bruno",
"",
"LaBRI"
]
] |
new_dataset
| 0.969386 |
1512.03476
|
Daniel Harabor D
|
Daniel Guimarans and Daniel Harabor and Pascal van Hentenryck
|
Simulation and Analysis of Container Freight Train Operations at Port
Botany
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over two million containers crossed the docks at Sydney's Port Botany in
2011/12; a figure that is forecast increase more than threefold by the end of
the next decade. To cope with such large growth in volumes the NSW Government
plans to double rail mode share at the port by the year 2020. Conventional
wisdom from industry and the media says that existing infrastructure cannot
handle such volumes. In this paper we use a combination of data analytics and
simulation to examine operations at the port and evaluate the efficacy of
current infrastructure to handle projected growth in volumes. Contrary to
conventional wisdom we find that current rail resources appear distinctly
under-utilised. Moreover: (i) the peak rail capacity of Port Botany is 1.78
million TEU per annum; over six times higher than 2011/12 rail volumes; (ii)
there are no infrastructural impediments to the achievement of peak rail
capacity; (iii) operational changes, not infrastructural investment, are the
key to unlocking the potential of the port; (iv) Port Botany is well positioned
to handle projected increases in container volumes over the next decade and
beyond, including the 28% rail mode share target established by the New South
Wales State Government.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 22:52:18 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Dec 2015 01:23:14 GMT"
}
] | 2015-12-23T00:00:00 |
[
[
"Guimarans",
"Daniel",
""
],
[
"Harabor",
"Daniel",
""
],
[
"van Hentenryck",
"Pascal",
""
]
] |
new_dataset
| 0.969665 |
1512.06997
|
Adrian Segall
|
Adrian Segall
|
HDR - A Hysteresis-Driven Routing Algorithm for Energy Harvesting Tag
Networks
| null | null | null |
CE Tech Report # 005
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work contains a first attempt to treat the problem of routing in networks
with energy harvesting units. We propose HDR - a Hysteresis Based Routing
Algorithm and analyse it in a simple diamond network. We also consider a
network with three forwarding nodes. The results are used to give insight into
its application in general topology networks and to general harvesting
patterns.
|
[
{
"version": "v1",
"created": "Tue, 22 Dec 2015 09:27:39 GMT"
}
] | 2015-12-23T00:00:00 |
[
[
"Segall",
"Adrian",
""
]
] |
new_dataset
| 0.965547 |
1512.07012
|
Samouriq Difrawi
|
Hamoinba Vebarin and Samourqi Difrawi
|
SRPS: Secure Routing Protocol for Static Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In sensor networks, nodes cooperatively work to collect data and forward it
to the final destination. Many protocols have been proposed in the literature
to provide routing and secure routing for ad hoc and sensor networks, but these
protocols either very expensive to be used in very resource-limited
environments such as sensor networks, or suffer from the lack of one or more
security guarantees and vulnerable to attacks such as wormhole, Sinkhole,
Sybil, blackhole, selective forwarding, rushing, and fabricating attacks. In
this paper we propose a secure lightweight routing protocol called SRPS. SRPS
uses symmetric cryptographic entities within the capabilities of the sensors,
supports intermediate node authentication of the routing information in
addition to end-to-end authentication, provides secure multiple disjoint paths,
and thwarts all the known attacks against routing infrastructure against
Byzantine cooperative attack model. We analyze the security guarantees of SRPS
and use Ns-2 simulations to show the effectiveness of SRPS in counter-measuring
known attacks against the routing infrastructure. Overhead cost analysis is
conducted to prove the lightweight-ness of SRPS
|
[
{
"version": "v1",
"created": "Tue, 22 Dec 2015 10:09:41 GMT"
}
] | 2015-12-23T00:00:00 |
[
[
"Vebarin",
"Hamoinba",
""
],
[
"Difrawi",
"Samourqi",
""
]
] |
new_dataset
| 0.999724 |
1308.3119
|
Qiuyu Peng
|
Qiuyu Peng, Anwar Walid, Jaehyun Hwang, Steven H. Low
|
Multipath TCP: Analysis, Design and Implementation
|
15 pages
| null |
10.1109/TNET.2014.2379698
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-path TCP (MP-TCP) has the potential to greatly improve application
performance by using multiple paths transparently. We propose a fluid model for
a large class of MP-TCP algorithms and identify design criteria that guarantee
the existence, uniqueness, and stability of system equilibrium. We clarify how
algorithm parameters impact TCP-friendliness, responsiveness, and window
oscillation and demonstrate an inevitable tradeoff among these properties. We
discuss the implications of these properties on the behavior of existing
algorithms and motivate a new design that generalizes existing algorithms and
strikes a good balance among TCP-friendliness, responsiveness, and window
oscillation. We have implemented our algorithm in the Linux kernel. We use our
prototype to compare the new algorithm with existing MP-TCP algorithms.
|
[
{
"version": "v1",
"created": "Wed, 14 Aug 2013 13:36:03 GMT"
},
{
"version": "v2",
"created": "Tue, 20 May 2014 22:45:01 GMT"
},
{
"version": "v3",
"created": "Sun, 7 Dec 2014 19:53:08 GMT"
}
] | 2015-12-22T00:00:00 |
[
[
"Peng",
"Qiuyu",
""
],
[
"Walid",
"Anwar",
""
],
[
"Hwang",
"Jaehyun",
""
],
[
"Low",
"Steven H.",
""
]
] |
new_dataset
| 0.997913 |
1512.06161
|
Mario Blaum
|
Mario Blaum
|
On Locally Recoverable (LRC) Codes
|
11 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present simple constructions of optimal erasure-correcting LRC codes by
exhibiting their parity-check matrices. When the number of local parities in a
parity group plus the number of global parities is smaller than the size of the
parity group, the constructed codes are optimal with a field of size at least
the length of the code. We can reduce the size of the field to at least the
size of the parity groups when the number of global parities equals the number
of local parities in a parity group plus one.
|
[
{
"version": "v1",
"created": "Fri, 18 Dec 2015 23:08:30 GMT"
}
] | 2015-12-22T00:00:00 |
[
[
"Blaum",
"Mario",
""
]
] |
new_dataset
| 0.951595 |
1512.06178
|
EPTCS
|
Marisa Navarro (UPV/EHU)
|
Proceedings XV Jornadas sobre Programaci\'on y Lenguajes
| null |
EPTCS 200, 2015
|
10.4204/EPTCS.200
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains a selection of the papers presented at the XV Jornadas
sobre Programaci\'on y Lenguajes (PROLE 2015), held at Santander, Spain, during
September 15th-17th, 2015. Previous editions of the workshop were held in
C\'adiz (2014), Madrid (2013), Almer\'ia (2012), A Coru\~na (2011), Val\`encia
(2010), San Sebasti\'an (2009), Gij\'on (2008), Zaragoza (2007), Sitges (2006),
Granada (2005), M\'alaga (2004), Alicante (2003), El Escorial (2002), and
Almagro (2001). Programming languages provide a conceptual framework which is
necessary for the development, analysis, optimization and understanding of
programs and programming tasks. The aim of the PROLE series of conferences
(PROLE stems from PROgramaci\'on y LEnguajes) is to serve as a meeting point
for Spanish research groups which develop their work in the area of programming
and programming languages. The organization of this series of events aims at
fostering the exchange of ideas, experiences and results among these groups.
Promoting further collaboration is also one of its main goals.
|
[
{
"version": "v1",
"created": "Sat, 19 Dec 2015 02:15:49 GMT"
}
] | 2015-12-22T00:00:00 |
[
[
"Navarro",
"Marisa",
"",
"UPV/EHU"
]
] |
new_dataset
| 0.963437 |
1512.06383
|
Chuang Zhang
|
Chuang Zhang, Dongning Guo, Pingyi Fan
|
Tracking Angles of Departure and Arrival in a Mobile Millimeter Wave
Channel
|
6 pages, 7 figures, submitted to ICC 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave provides a very promising approach for meeting the
ever-growing traffic demand in next generation wireless networks. To utilize
this band, it is crucial to obtain the channel state information in order to
perform beamforming and combining to compensate for severe path loss. In
contrast to lower frequencies, a typical millimeter wave channel consists of a
few dominant paths. Thus it is generally sufficient to estimate the path gains,
angles of departure (AoDs), and angles of arrival (AoAs) of those paths.
Proposed in this paper is a dual timescale model to characterize abrupt channel
changes (e.g., blockage) and slow variations of AoDs and AoAs. This work
focuses on tracking the slow variations and detecting abrupt changes. A Kalman
filter based tracking algorithm and an abrupt change detection method are
proposed. The tracking algorithm is compared with the adaptive algorithm due to
Alkhateeb, Ayach, Leus and Heath (2014) in the case with single radio frequency
chain. Simulation results show that to achieve the same tracking performance,
the proposed algorithm requires much lower signal-to-noise-ratio (SNR) and much
fewer pilots than the other algorithm. Moreover, the change detection method
can always detect abrupt changes with moderate number of pilots and SNR.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2015 15:35:38 GMT"
}
] | 2015-12-22T00:00:00 |
[
[
"Zhang",
"Chuang",
""
],
[
"Guo",
"Dongning",
""
],
[
"Fan",
"Pingyi",
""
]
] |
new_dataset
| 0.999313 |
1410.4034
|
Fran\c{c}ois Gonze FG
|
Fran\c{c}ois Gonze and Rapha\"el M. Jungers
|
On the Synchronizing Probability Function and the Triple Rendezvous Time
for Synchronizing Automata
|
A preliminary version of the results has been presented at the
conference LATA 2015. The current ArXiv version includes the most recent
improvement on the triple rendezvous time upper bound as well as formal
proofs of all the results
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cerny's conjecture is a longstanding open problem in automata theory. We
study two different concepts, which allow to approach it from a new angle. The
first one is the triple rendezvous time, i.e., the length of the shortest word
mapping three states onto a single one. The second one is the synchronizing
probability function of an automaton, a recently introduced tool which
reinterprets the synchronizing phenomenon as a two-player game, and allows to
obtain optimal strategies through a Linear Program.
Our contribution is twofold. First, by coupling two different novel
approaches based on the synchronizing probability function and properties of
linear programming, we obtain a new upper bound on the triple rendezvous time.
Second, by exhibiting a family of counterexamples, we disprove a conjecture on
the growth of the synchronizing probability function. We then suggest natural
follow-ups towards Cernys conjecture.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 12:18:05 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Oct 2014 11:38:07 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Nov 2014 15:42:30 GMT"
},
{
"version": "v4",
"created": "Mon, 5 Jan 2015 17:40:08 GMT"
},
{
"version": "v5",
"created": "Fri, 18 Dec 2015 10:56:47 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Gonze",
"François",
""
],
[
"Jungers",
"Raphaël M.",
""
]
] |
new_dataset
| 0.991884 |
1505.06895
|
Sarah Meiklejohn
|
George Danezis and Sarah Meiklejohn
|
Centrally Banked Cryptocurrencies
|
15 pages, 4 figures, 2 tables in Proceedings of NDSS 2016
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current cryptocurrencies, starting with Bitcoin, build a decentralized
blockchain-based transaction ledger, maintained through proofs-of-work that
also generate a monetary supply. Such decentralization has benefits, such as
independence from national political control, but also significant limitations
in terms of scalability and computational cost. We introduce RSCoin, a
cryptocurrency framework in which central banks maintain complete control over
the monetary supply, but rely on a distributed set of authorities, or
mintettes, to prevent double-spending. While monetary policy is centralized,
RSCoin still provides strong transparency and auditability guarantees. We
demonstrate, both theoretically and experimentally, the benefits of a modest
degree of centralization, such as the elimination of wasteful hashing and a
scalable system for avoiding double-spending attacks.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2015 10:54:10 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Dec 2015 09:58:47 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Danezis",
"George",
""
],
[
"Meiklejohn",
"Sarah",
""
]
] |
new_dataset
| 0.997918 |
1508.00479
|
Shuning Wang
|
Shuning Wang
|
Simple relay channel
|
This paper has been withdrawn by the author due to an error
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1987, Cover proposed an interesting problem in the simple relay channel as
shown in figure 1.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2015 04:21:55 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Dec 2015 01:37:32 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Dec 2015 16:39:05 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Wang",
"Shuning",
""
]
] |
new_dataset
| 0.993977 |
1512.05325
|
Antti P\"oll\"anen
|
Antti P\"oll\"anen
|
Locally Repairable Codes and Matroid Theory
|
Bachelor thesis, Aalto University School of Science, 2015. Instructor
Ph.D. Thomas Westerb\"ack, supervisor Prof. Camilla Hollanti. This thesis
builds on the article arXiv:1501.00153. Main results: The class of optimal
matroids with ceil(k/r)=2 is extended. An improved lower bound for d_max is
presented. This bound is proven to be tight for a certain important class of
matroids
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locally repairable codes (LRCs) are error correcting codes used in
distributed data storage. A traditional approach is to look for codes which
simultaneously maximize error tolerance and minimize storage space consumption.
However, this tends to yield codes for which error correction requires an
unrealistic amount of communication between storage nodes. LRCs solve this
problem by allowing errors to be corrected locally.
This thesis reviews previous results on the subject presented in [1]. These
include that every almost affine LRC induces a matroid such that the essential
properties of the code are determined by the matroid. Also, the generalized
Singleton bound for LRCs can be extended to matroids as well. Then, matroid
theory can be used to find classes of matroids that either achieve the bound,
meaning they are optimal in a certain sense, or at least come close to the
bound. This thesis presents an improvement to the results of [1] in both of
these cases.
[1] T. Westerb\"ack, R. Freij, T. Ernvall and C. Hollanti, "On the
Combinatorics of Locally Repairable Codes via Matroid Theory", arXiv:1501.00153
[cs.IT], 2014.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 20:46:26 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Pöllänen",
"Antti",
""
]
] |
new_dataset
| 0.999836 |
1512.05949
|
Tim Jungnickel
|
Tim Jungnickel and Tobias Herb
|
TP1-valid Transformation Functions for Operations on ordered n-ary Trees
|
Extension/Report for the work "Simultaneous Editing of JSON Objects
via Operational Transformation" in ACM SAC '16
| null |
10.1145/2851613.2852003
| null |
cs.LO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Collaborative work on shared documents was revolutionized by web services
like Google Docs or Etherpad. Multiple users can work on the same document in a
comfortable and distributed way. For the synchronization of the changes a
replication system named Operational Transformation is used. Such a system
consists of a control algorithm and a transformation function. In essence, a
transformation function solves the conflicts that arise when multiple users
change the document at the same time. In this work we investigate on the
correctness of such transformation functions. We introduce transformation
functions n-ary trees that we designed especially for the purpose of
synchronization changes on JSON objects. We provide a detailed proof of the
necessary property: the Transformation Property 1.
|
[
{
"version": "v1",
"created": "Fri, 18 Dec 2015 13:41:10 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Jungnickel",
"Tim",
""
],
[
"Herb",
"Tobias",
""
]
] |
new_dataset
| 0.992842 |
1512.05979
|
Jaganadh Gopinadhan
|
Anshul Bansal, Susheel Kaushik Rompikuntla, Jaganadh Gopinadhan,
Amanpreet Kaur, Zahoor Ahamed Kazi
|
Energy Consumption Forecasting for Smart Meters
|
Presented at BAI Conference 2015 at IIM Bangalore, India
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Earth, water, air, food, shelter and energy are essential factors required
for human being to survive on the planet. Among this energy plays a key role in
our day to day living including giving lighting, cooling and heating of
shelter, preparation of food. Due to this interdependency, energy, specifically
electricity, production and distribution became a high tech industry. Unlike
other industries, the key differentiator of electricity industry is the product
itself. It can be produced but cannot be stored for future; production and
consumption happen almost in near real-time. This particular peculiarity of the
industry is the key driver for Machine Learning and Data Science based
innovations in this industry. There is always a gap between the demand and
supply in the electricity market across the globe. To fill the gap and improve
the service efficiency through providing necessary supply to the market,
commercial as well as federal electricity companies employ forecasting
techniques to predict the future demand and try to meet the demand and provide
curtailment guidelines to optimise the electricity consumption/demand. In this
paper the authors examine the application of Machine Learning algorithms,
specifically Boosted Decision Tree Regression, to the modelling and forecasting
of energy consumption for smart meters. The data used for this exercise is
obtained from DECC data website. Along with this data, the methodology has been
tested in Smart Meter data obtained from EMA Singapore. This paper focuses on
feature engineering for time series forecasting using regression algorithms and
deriving a methodology to create personalised electricity plans offers for
household users based on usage history.
|
[
{
"version": "v1",
"created": "Fri, 18 Dec 2015 14:59:26 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Bansal",
"Anshul",
""
],
[
"Rompikuntla",
"Susheel Kaushik",
""
],
[
"Gopinadhan",
"Jaganadh",
""
],
[
"Kaur",
"Amanpreet",
""
],
[
"Kazi",
"Zahoor Ahamed",
""
]
] |
new_dataset
| 0.987029 |
1512.06021
|
Jia Wang
|
Jia Wang, Kevin Chen-Chuan Chang, Hari Sundaram
|
Network Cartography: Seeing the Forest and the Trees
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-world networks are often complex and large with millions of nodes,
posing a great challenge for analysts to quickly see the big picture for more
productive subsequent analysis. We aim at facilitating exploration of
node-attributed networks by creating representations with conciseness,
expressiveness, interpretability, and multi-resolution views. We develop such a
representation as a {\it map} --- among the first to explore principled network
cartography for general networks. In parallel with common maps, ours has
landmarks, which aggregate nodes homogeneous in their traits and interactions
with nodes elsewhere, and roads, which represent the interactions between the
landmarks. We capture such homogeneity by the similar roles the nodes played.
Next, to concretely model the landmarks, we propose a probabilistic generative
model of networks with roles as latent factors. Furthermore, to enable
interactive zooming, we formulate novel model-based constrained optimization.
Then, we design efficient linear-time algorithms for the optimizations.
Experiments using real-world and synthetic networks show that our method
produces more expressive maps than existing methods, with up to 10 times
improvement in network reconstruction quality. We also show that our method
extracts landmarks with more homogeneous nodes, with up to 90\% improvement in
the average attribute/link entropy among the nodes over each landmark.
Sense-making of a real-world network using a map computed by our method
qualitatively verify the effectiveness of our method.
|
[
{
"version": "v1",
"created": "Fri, 18 Dec 2015 16:36:19 GMT"
}
] | 2015-12-21T00:00:00 |
[
[
"Wang",
"Jia",
""
],
[
"Chang",
"Kevin Chen-Chuan",
""
],
[
"Sundaram",
"Hari",
""
]
] |
new_dataset
| 0.985852 |
1511.07889
|
Nicholas Leonard
|
Nicholas L\'eonard, Sagar Waghmare, Yang Wang, Jin-Hwa Kim
|
rnn : Recurrent Library for Torch
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rnn package provides components for implementing a wide range of
Recurrent Neural Networks. It is built withing the framework of the Torch
distribution for use with the nn package. The components have evolved from 3
iterations, each adding to the flexibility and capability of the package. All
component modules inherit either the AbstractRecurrent or AbstractSequencer
classes. Strong unit testing, continued backwards compatibility and access to
supporting material are the principles followed during its development. The
package is compared against existing implementations of two published papers.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 21:18:33 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Dec 2015 16:30:06 GMT"
}
] | 2015-12-18T00:00:00 |
[
[
"Léonard",
"Nicholas",
""
],
[
"Waghmare",
"Sagar",
""
],
[
"Wang",
"Yang",
""
],
[
"Kim",
"Jin-Hwa",
""
]
] |
new_dataset
| 0.995328 |
1512.05550
|
Kiran Garimella
|
Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis,
Michael Mathioudakis
|
Exploring Controversy in Twitter
|
Accepted as demo at CSCW 2016
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Among the topics discussed on social media, some spark more heated debate
than others. For example, experience suggests that major political events, such
as a vote for healthcare law in the US, would spark more debate between
opposing sides than other events, such as a concert of a popular music band.
Exploring the topics of discussion on Twitter and understanding which ones are
controversial is extremely useful for a variety of purposes, such as for
journalists to understand what issues divide the public, or for social
scientists to understand how controversy is manifested in social interactions.
The system we present processes the daily trending topics discussed on the
platform, and assigns to each topic a controversy score, which is computed
based on the interactions among Twitter users, and a visualization of these
interactions, which provides an intuitive visual cue regarding the controversy
of the topic. The system also allows users to explore the messages (tweets)
associated with each topic, and sort and explore the topics by different
criteria (e.g., by controversy score, time, or related keywords).
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2015 12:05:34 GMT"
}
] | 2015-12-18T00:00:00 |
[
[
"Garimella",
"Kiran",
""
],
[
"Morales",
"Gianmarco De Francisci",
""
],
[
"Gionis",
"Aristides",
""
],
[
"Mathioudakis",
"Michael",
""
]
] |
new_dataset
| 0.972028 |
1511.01804
|
Shuaiqi Hu
|
Shuaiqi Hu, Ke Li, Xudong Bao
|
Wood Species Recognition Based on SIFT Keypoint Histogram
|
CISP 2015
| null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Traditionally, only experts who are equipped with professional knowledge and
rich experience are able to recognize different species of wood. Applying image
processing techniques for wood species recognition can not only reduce the
expense to train qualified identifiers, but also increase the recognition
accuracy. In this paper, a wood species recognition technique base on Scale
Invariant Feature Transformation (SIFT) keypoint histogram is proposed. We use
first the SIFT algorithm to extract keypoints from wood cross section images,
and then k-means and k-means++ algorithms are used for clustering. Using the
clustering results, an SIFT keypoints histogram is calculated for each wood
image. Furthermore, several classification models, including Artificial Neural
Networks (ANN), Support Vector Machine (SVM) and K-Nearest Neighbor (KNN) are
used to verify the performance of the method. Finally, through comparing with
other prevalent wood recognition methods such as GLCM and LBP, results show
that our scheme achieves higher accuracy.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2015 16:33:54 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Dec 2015 10:17:38 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Dec 2015 09:35:18 GMT"
},
{
"version": "v4",
"created": "Wed, 16 Dec 2015 03:49:07 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Hu",
"Shuaiqi",
""
],
[
"Li",
"Ke",
""
],
[
"Bao",
"Xudong",
""
]
] |
new_dataset
| 0.997759 |
1512.00818
|
Mohamed Elhoseiny Mohamed Elhoseiny
|
Mohamed Elhoseiny, Jingen Liu, Hui Cheng, Harpreet Sawhney, Ahmed
Elgammal
|
Zero-Shot Event Detection by Multimodal Distributional Semantic
Embedding of Videos
|
To appear in AAAI 2016
| null | null | null |
cs.CV cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new zero-shot Event Detection method by Multi-modal
Distributional Semantic embedding of videos. Our model embeds object and action
concepts as well as other available modalities from videos into a
distributional semantic space. To our knowledge, this is the first Zero-Shot
event detection model that is built on top of distributional semantics and
extends it in the following directions: (a) semantic embedding of multimodal
information in videos (with focus on the visual modalities), (b) automatically
determining relevance of concepts/attributes to a free text query, which could
be useful for other applications, and (c) retrieving videos by free text event
query (e.g., "changing a vehicle tire") based on their content. We embed videos
into a distributional semantic space and then measure the similarity between
videos and the event query in a free text form. We validated our method on the
large TRECVID MED (Multimedia Event Detection) challenge. Using only the event
title as a query, our method outperformed the state-of-the-art that uses big
descriptions from 12.6% to 13.5% with MAP metric and 0.73 to 0.83 with ROC-AUC
metric. It is also an order of magnitude faster.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 19:34:00 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Dec 2015 00:58:49 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Elhoseiny",
"Mohamed",
""
],
[
"Liu",
"Jingen",
""
],
[
"Cheng",
"Hui",
""
],
[
"Sawhney",
"Harpreet",
""
],
[
"Elgammal",
"Ahmed",
""
]
] |
new_dataset
| 0.977311 |
1512.04975
|
Makan Zamanipour
|
Makan Zamanipour and Mohammadali Mohammadi
|
MIMO CDMA-based Optical SATCOMs: A New Solution
|
IEEE PCITC 2015 (15-17 Oct, India)
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new scheme for MIMO CDMA-based optical satellite communications (OSATCOMs)
is presented. Three independent problems are described for up-link and down-
link in terms of two distinguished optimization problems. At first, in up-link,
Pulse-width optimization is proposed to reduce dispersions over fibers as the
terrestrial part. This is performed for return-to-zero (RZ) modulation that is
supposed to be used as an example in here. This is carried out by solving the
first optimization problem, while minimizing the probability of overlapping for
the Gaussian pulses that are used to produce RZ. Some constraints are assumed
such as a threshold for the peak-to-average power ratio (PAPR). In down-link,
the second and the third problems are discussed as follows, jointly as a
closed-form solution. Solving the second optimization problem, an objective
function is obtained, namely the MIMO CDMA-based satellite weight-matrix as a
conventional adaptive beam-former. The Satellite link is stablished over flat
un-correlated Nakagami-m/Suzuki fading channels as the second problem. On the
other hand, the mentioned optimization problem is robustly solved as the third
important problem, while considering inter-cell interferences in the multi-cell
scenario. Robust solution is performed due to the partial knowledge of each
cell from the others in which the link capacity is maximized. Analytical
results are conducted to investigate the merit of system.
|
[
{
"version": "v1",
"created": "Sun, 22 Nov 2015 11:13:09 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Zamanipour",
"Makan",
""
],
[
"Mohammadi",
"Mohammadali",
""
]
] |
new_dataset
| 0.999602 |
1512.05027
|
Lei Song
|
Yuan Feng and Lei Song and Lijun Zhang
|
Distribution-based Bisimulation and Bisimulation Metric in Probabilistic
Automata
|
27 pages, 8 figures. arXiv admin note: substantial text overlap with
arXiv:1311.3396
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Probabilistic automata were introduced by Rabin in 1963 as language
acceptors. Two automata are equivalent if and only if they accept each word
with the same probability. On the other side, in the process algebra community,
probabilistic automata were re-proposed by Segala in 1995 which are more
general than Rabin's automata. Bisimulations have been proposed for Segala's
automata to characterize the equivalence between them. So far the two notions
of equivalences and their characteristics have been studied mostly
independently. In this paper, we consider Segala's automata, and propose a
novel notion of distribution-based bisimulation by joining the existing
equivalence and bisimilarities. We demonstrate the utility of our definition by
studying distribution-based bisimulation metrics, which gives rise to a robust
notion of equivalence for Rabin's automata. We compare our notions of
bisimulation to some existing distribution-based bisimulations and discuss
their compositionality and relations to trace equivalence. Finally, we show the
decidability and complexity of all relations.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 02:07:46 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Feng",
"Yuan",
""
],
[
"Song",
"Lei",
""
],
[
"Zhang",
"Lijun",
""
]
] |
new_dataset
| 0.955541 |
1512.05135
|
Byunghan Lee
|
Byunghan Lee, Taehoon Lee, Byunggook Na, Sungroh Yoon
|
DNA-Level Splice Junction Prediction using Deep Recurrent Neural
Networks
| null | null | null | null |
cs.LG q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A eukaryotic gene consists of multiple exons (protein coding regions) and
introns (non-coding regions), and a splice junction refers to the boundary
between a pair of exon and intron. Precise identification of spice junctions on
a gene is important for deciphering its primary structure, function, and
interaction. Experimental techniques for determining exon/intron boundaries
include RNA-seq, which is often accompanied by computational approaches.
Canonical splicing signals are known, but computational junction prediction
still remains challenging because of a large number of false positives and
other complications. In this paper, we exploit deep recurrent neural networks
(RNNs) to model DNA sequences and to detect splice junctions thereon. We test
various RNN units and architectures including long short-term memory units,
gated recurrent units, and recently proposed iRNN for in-depth design space
exploration. According to our experimental results, the proposed approach
significantly outperforms not only conventional machine learning-based methods
but also a recent state-of-the-art deep belief network-based technique in terms
of prediction accuracy.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 11:41:00 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Lee",
"Byunghan",
""
],
[
"Lee",
"Taehoon",
""
],
[
"Na",
"Byunggook",
""
],
[
"Yoon",
"Sungroh",
""
]
] |
new_dataset
| 0.996541 |
1512.05245
|
Fergal Byrne
|
Fergal Byrne
|
Symphony from Synapses: Neocortex as a Universal Dynamical Systems
Modeller using Hierarchical Temporal Memory
| null | null | null | null |
cs.NE cs.AI q-bio.NC
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Reverse engineering the brain is proving difficult, perhaps impossible. While
many believe that this is just a matter of time and effort, a different
approach might help. Here, we describe a very simple idea which explains the
power of the brain as well as its structure, exploiting complex dynamics rather
than abstracting it away. Just as a Turing Machine is a Universal Digital
Computer operating in a world of symbols, we propose that the brain is a
Universal Dynamical Systems Modeller, evolved bottom-up (itself using nested
networks of interconnected, self-organised dynamical systems) to prosper in a
world of dynamical systems.
Recent progress in Applied Mathematics has produced startling evidence of
what happens when abstract Dynamical Systems interact. Key latent information
describing system A can be extracted by system B from very simple signals, and
signals can be used by one system to control and manipulate others. Using these
facts, we show how a region of the neocortex uses its dynamics to intrinsically
"compute" about the external and internal world.
Building on an existing "static" model of cortical computation (Hawkins'
Hierarchical Temporal Memory - HTM), we describe how a region of neocortex can
be viewed as a network of components which together form a Dynamical Systems
modelling module, connected via sensory and motor pathways to the external
world, and forming part of a larger dynamical network in the brain.
Empirical modelling and simulations of Dynamical HTM are possible with simple
extensions and combinations of currently existing open source software. We list
a number of relevant projects.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 16:58:06 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Byrne",
"Fergal",
""
]
] |
new_dataset
| 0.981596 |
1512.05281
|
Stefano Salsano
|
Stefano Salsano, Luca Veltri, Luca Davoli, Pier Luigi Ventre, Giuseppe
Siracusano
|
PMSR - Poor Man's Segment Routing, a minimalistic approach to Segment
Routing and a Traffic Engineering use case
|
September 2015 - Paper accepted to the Mini-conference track of NOMS
2016
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current specification of the Segment Routing (SR) architecture requires
enhancements to the intra-domain routing protocols (e.g. OSPF and IS-IS) so
that the nodes can advertise the Segment Identifiers (SIDs). We propose a
simpler solution called PMSR (Poor Man's Segment Routing), that does not
require any enhancement to routing protocol. We compare the procedures of PMSR
with traditional SR, showing that PMSR can reduce the operation and management
complexity. We analyze the set of use cases in the current SR drafts and we
claim that PMSR can support the large majority of them. Thanks to the drastic
simplification of the Control Plane, we have been able to develop an Open
Source prototype of PMSR. In the second part of the paper, we consider a
Traffic Engineering use case, starting from a traditional flow assignment
optimization problem which allocates hop-by-hop paths to flows. We propose a SR
path assignment algorithm and prove that it is optimal with respect to the
number of segments allocated to a flow.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2015 18:57:56 GMT"
}
] | 2015-12-17T00:00:00 |
[
[
"Salsano",
"Stefano",
""
],
[
"Veltri",
"Luca",
""
],
[
"Davoli",
"Luca",
""
],
[
"Ventre",
"Pier Luigi",
""
],
[
"Siracusano",
"Giuseppe",
""
]
] |
new_dataset
| 0.999768 |
1412.0781
|
Zhizhen Zhao
|
Zhizhen Zhao, Yoel Shkolnisky, and Amit Singer
|
Fast Steerable Principal Component Analysis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryo-electron microscopy nowadays often requires the analysis of hundreds of
thousands of 2D images as large as a few hundred pixels in each direction. Here
we introduce an algorithm that efficiently and accurately performs principal
component analysis (PCA) for a large set of two-dimensional images, and, for
each image, the set of its uniform rotations in the plane and their
reflections. For a dataset consisting of $n$ images of size $L \times L$
pixels, the computational complexity of our algorithm is $O(nL^3 + L^4)$, while
existing algorithms take $O(nL^4)$. The new algorithm computes the expansion
coefficients of the images in a Fourier-Bessel basis efficiently using the
non-uniform fast Fourier transform. We compare the accuracy and efficiency of
the new algorithm with traditional PCA and existing algorithms for steerable
PCA.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 04:24:03 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Dec 2014 18:21:40 GMT"
},
{
"version": "v3",
"created": "Sat, 16 May 2015 02:06:04 GMT"
},
{
"version": "v4",
"created": "Fri, 23 Oct 2015 02:14:53 GMT"
},
{
"version": "v5",
"created": "Tue, 15 Dec 2015 19:26:37 GMT"
}
] | 2015-12-16T00:00:00 |
[
[
"Zhao",
"Zhizhen",
""
],
[
"Shkolnisky",
"Yoel",
""
],
[
"Singer",
"Amit",
""
]
] |
new_dataset
| 0.999737 |
1512.04310
|
Kareem Darwish
|
Kareem Darwish and Walid Magdy
|
Attitudes towards Refugees in Light of the Paris Attacks
|
3 pages, 1 table, and 2 figures
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Paris attacks prompted a massive response on social media including
Twitter. This paper explores the immediate response of English speakers on
Twitter towards Middle Eastern refugees in Europe. We show that antagonism
towards refugees is mostly coming from the United States and is mostly
partisan.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 13:43:30 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Dec 2015 05:52:13 GMT"
}
] | 2015-12-16T00:00:00 |
[
[
"Darwish",
"Kareem",
""
],
[
"Magdy",
"Walid",
""
]
] |
new_dataset
| 0.997577 |
1512.04828
|
Ivan De Oliveira Nunes
|
Ivan Oliveira Nunes, Pedro O. S. Vaz de Melo, Antonio A. F. Loureiro
|
Group Mobility: Detection, Tracking and Characterization
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the era of mobile computing, understanding human mobility patterns is
crucial in order to better design protocols and applications. Many studies
focus on different aspects of human mobility such as people's points of
interests, routes, traffic, individual mobility patterns, among others. In this
work, we propose to look at human mobility through a social perspective, i.e.,
analyze the impact of social groups in mobility patterns. We use the MIT
Reality Mining proximity trace to detect, track and investigate group's
evolution throughout time. Our results show that group meetings happen in a
periodical fashion and present daily and weekly periodicity. We analyze how
groups' dynamics change over day hours and find that group meetings lasting
longer are those with less changes in members composition and with members
having stronger social bonds with each other. Our findings can be used to
propose meeting prediction algorithms, opportunistic routing and information
diffusion protocols, taking advantage of those revealed properties.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2015 15:52:21 GMT"
}
] | 2015-12-16T00:00:00 |
[
[
"Nunes",
"Ivan Oliveira",
""
],
[
"de Melo",
"Pedro O. S. Vaz",
""
],
[
"Loureiro",
"Antonio A. F.",
""
]
] |
new_dataset
| 0.974277 |
1512.04866
|
Michael Bekos
|
Michael A. Bekos, Michael Kaufmann and Robert Krug
|
On the Total Number of Bends for Planar Octilinear Drawings
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An octilinear drawing of a planar graph is one in which each edge is drawn as
a sequence of horizontal, vertical and diagonal at 45 degrees line-segments.
For such drawings to be readable, special care is needed in order to keep the
number of bends small. As the problem of finding planar octilinear drawings of
minimum number of bends is NP-hard, in this paper we focus on upper and lower
bounds. From a recent result of Keszegh et al. on the slope number of planar
graphs, we can derive an upper bound of 4n-10 bends for 8-planar graphs with n
vertices. We considerably improve this general bound and corresponding previous
ones for triconnected 4-, 5- and 6-planar graphs. We also derive non-trivial
lower bounds for these three classes of graphs by a technique inspired by the
network flow formulation of Tamassia.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2015 17:23:50 GMT"
}
] | 2015-12-16T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Krug",
"Robert",
""
]
] |
new_dataset
| 0.99414 |
1512.04912
|
Farshad Kooti
|
Farshad Kooti, Kristina Lerman, Luca Maria Aiello, Mihajlo Grbovic,
Nemanja Djuric, Vladan Radosavljevic
|
Portrait of an Online Shopper: Understanding and Predicting Consumer
Behavior
|
10 pages, 11 figures, Proceedings of the 9th ACM International
Conference on Web Search and Data Mining (WSDM 2016), San Fransisco, USA
|
Proceedings of the 9th ACM International Conference on Web Search
and Data Mining (WSDM 2016), San Fransisco, USA,
| null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consumer spending accounts for a large fraction of the US economic activity.
Increasingly, consumer activity is moving to the web, where digital traces of
shopping and purchases provide valuable data about consumer behavior. We
analyze these data extracted from emails and combine them with demographic
information to characterize, model, and predict consumer behavior. Breaking
down purchasing by age and gender, we find that the amount of money spent on
online purchases grows sharply with age, peaking in late 30s. Men are more
frequent online purchasers and spend more money when compared to women. Linking
online shopping to income, we find that shoppers from more affluent areas
purchase more expensive items and buy them more frequently, resulting in
significantly more money spent on online purchases. We also look at dynamics of
purchasing behavior and observe daily and weekly cycles in purchasing behavior,
similarly to other online activities.
More specifically, we observe temporal patterns in purchasing behavior
suggesting shoppers have finite budgets: the more expensive an item, the longer
the shopper waits since the last purchase to buy it. We also observe that
shoppers who email each other purchase more similar items than socially
unconnected shoppers, and this effect is particularly evident among women.
Finally, we build a model to predict when shoppers will make a purchase and how
much will spend on it. We find that temporal features improve prediction
accuracy over competitive baselines. A better understanding of consumer
behavior can help improve marketing efforts and make online shopping more
pleasant and efficient.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2015 20:03:25 GMT"
}
] | 2015-12-16T00:00:00 |
[
[
"Kooti",
"Farshad",
""
],
[
"Lerman",
"Kristina",
""
],
[
"Aiello",
"Luca Maria",
""
],
[
"Grbovic",
"Mihajlo",
""
],
[
"Djuric",
"Nemanja",
""
],
[
"Radosavljevic",
"Vladan",
""
]
] |
new_dataset
| 0.966291 |
1510.01431
|
Alexander Mathews
|
Alexander Mathews, Lexing Xie, Xuming He
|
SentiCap: Generating Image Descriptions with Sentiments
| null | null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent progress on image recognition and language modeling is making
automatic description of image content a reality. However, stylized,
non-factual aspects of the written description are missing from the current
systems. One such style is descriptions with emotions, which is commonplace in
everyday communication, and influences decision-making and interpersonal
relationships. We design a system to describe an image with emotions, and
present a model that automatically generates captions with positive or negative
sentiments. We propose a novel switching recurrent neural network with
word-level regularization, which is able to produce emotional image captions
using only 2000+ training sentences containing sentiments. We evaluate the
captions with different automatic and crowd-sourcing metrics. Our model
compares favourably in common quality metrics for image captioning. In 84.6% of
cases the generated positive captions were judged as being at least as
descriptive as the factual captions. Of these positive captions 88% were
confirmed by the crowd-sourced workers as having the appropriate sentiment.
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 04:57:47 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Dec 2015 23:03:23 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Mathews",
"Alexander",
""
],
[
"Xie",
"Lexing",
""
],
[
"He",
"Xuming",
""
]
] |
new_dataset
| 0.998629 |
1512.03280
|
Youssef Gahi Dr
|
Youssef Gahi, Mouhcine Guennoun, Zouhair Guennoun, Khalil El-Khatib
|
An Encrypted Trust-Based Routing Protocol
| null | null |
10.1109/ICOS.2012.6417643
| null |
cs.CR
|
http://creativecommons.org/licenses/by/4.0/
|
The interest in trust-based routing protocols has grown with the advancements
achieved in ad-hoc wireless networks.However, regardless of the many security
approaches and trust metrics available, trust-based routing still faces some
security challenges, especially with respect to privacy. In this paper, we
propose a novel trust-based routing protocol based on a fully homomorphic
encryption scheme. The new protocol allows nodes, which collaborate in a
dynamic environment, to evaluate their knowledge on the trustworthiness of
specific routes and securely share this knowledge.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 15:09:57 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Gahi",
"Youssef",
""
],
[
"Guennoun",
"Mouhcine",
""
],
[
"Guennoun",
"Zouhair",
""
],
[
"El-Khatib",
"Khalil",
""
]
] |
new_dataset
| 0.995739 |
1512.03878
|
Naqueeb Warsi
|
Naqueeb Ahmad Warsi, Justin Coon
|
Coding for classical-quantum channels with rate limited side information
at the encoder: An information-spectrum approach
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the hybrid classical-quantum version of the channel coding problem
for the famous Gel'fand-Pinsker channel. In the classical setting for this
channel the conditional distribution of the channel output given the channel
input is a function of a random parameter called the channel state. We study
this problem when a rate limited version of the channel state is available at
the encoder for the classical-quantum Gel'fand-Pinsker channel. We establish
the capacity region for this problem in the information-spectrum setting. The
capacity region is quantified in terms of spectral-sup classical mutual
information rate and spectral-inf quantum mutual information rate.
|
[
{
"version": "v1",
"created": "Sat, 12 Dec 2015 06:02:08 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Warsi",
"Naqueeb Ahmad",
""
],
[
"Coon",
"Justin",
""
]
] |
new_dataset
| 0.98234 |
1512.03911
|
Andre Sobers
|
Andre Sobers
|
BYOD and the Mobile Enterprise - Organisational challenges and solutions
to adopt BYOD
|
5 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bring Your Own Device, also known under the term BOYD refers to the trend in
employees bringing their personal mobile devices into organisations to use as a
primary device for their daily work activities. With the rapid development in
computing technology in smartphones and tablet computers and innovations in
mobile software and applications, mobile devices are becoming ever more
powerful tools for consumers to access information. Consumers are becoming more
inseparable from their personal mobile devices and development in mobile
technologies within the consumer space has led to the significance of
Consumerization. Enterprises everywhere want to introduce BYOD strategies to
improve mobility and productivity of their employees. However making the
necessary organizational changes to adopt BYOD may require a shift away from
centralized systems towards more open enterprise systems and this change can
present challenges to enterprises in particular over security, control,
technology and policy to the traditional IT model within organisations. This
paper explores some of the present challenges and solutions in relation to
mobile security, technology and policy that enterprise systems within
organisations can encounter. This paper also reviews real-life studies where
such changes were made in organisations aiming to implement BYOD. This paper
proposes a mobile enterprise model that aims to address security concerns and
the challenges of technology and policy change. This paper ends with looking
ahead to the future of mobile enterprise systems.
|
[
{
"version": "v1",
"created": "Sat, 12 Dec 2015 13:19:23 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Sobers",
"Andre",
""
]
] |
new_dataset
| 0.98537 |
1512.04380
|
Dimitrios Zorbas
|
Dimitrios Zorbas and Tahiry Razafindralambo
|
Modeling the power consumption of a Wifibot and studying the role of
communication cost in operation time
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile robots are becoming part of our every day living at home, work or
entertainment. Due to their limited power capabilities, the development of new
energy consumption models can lead to energy conservation and energy efficient
designs. In this paper, we carry out a number of experiments and we focus on
the motors power consumption of a specific robot called Wifibot. Based on the
experimentation results, we build models for different speed and acceleration
levels. We compare the motors power consumption to other robot running modes.
We, also, create a simple robot network scenario and we investigate whether
forwarding data through a closer node could lead to longer operation times. We
assess the effect energy capacity, traveling distance and data rate on the
operation time.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 16:07:32 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Zorbas",
"Dimitrios",
""
],
[
"Razafindralambo",
"Tahiry",
""
]
] |
new_dataset
| 0.974811 |
1512.04386
|
Anuj Tawari
|
Meena Mahajan and Anuj Tawari
|
Read-once polynomials: How many summands suffice?
|
16 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1)
over $+, \times$ where each variable labels at most one leaf. Every multilinear
polynomial can be expressed as the sum of ROFs. In this work, we prove, for
certain multilinear polynomials, a tight lower bound on the number of summands
in such an expression.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 16:16:44 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Mahajan",
"Meena",
""
],
[
"Tawari",
"Anuj",
""
]
] |
new_dataset
| 0.983531 |
1512.04469
|
Martin Thoma
|
Martin Thoma
|
\"Uber die Klassifizierung von Knoten in dynamischen Netzwerken mit
Inhalt
|
in German. This term paper was handed in on 17.01.2014
| null | null | null |
cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
This paper explains the DYCOS-Algorithm as it was introduced in by Aggarwal
and Li in 2011. It operates on graphs whichs nodes are partially labeled and
automatically adds missing labels to nodes. To do so, the DYCOS algorithm makes
use of the structure of the graph as well as content which is assigned to the
node. Aggarwal and Li measured in an experimental analysis that DYCOS adds the
missing labels to a Graph with 19396 nodes of which 14814 are labeled and
another Graph with 806635 nodes of which 18999 are labeld on one core of an
Intel Xeon 2.5 GHz CPU with 32 G RAM within less than a minute. Additionally,
extensions of the DYCOS algorithm are proposed.
-----
In dieser Arbeit wird der DYCOS-Algorithmus, wie er 2011 von Aggarwal und Li
vorgestellt wurde, erkl\"art. Er arbeitet auf Graphen, deren Knoten teilweise
mit Beschriftungen versehen sind und erg\"anzt automatisch Beschriftungen f\"ur
Knoten, die bisher noch keine Beschriftung haben. Dieser Vorgang wird
"Klassifizierung" genannt. Dazu verwendet er die Struktur des Graphen sowie
textuelle Informationen, die den Knoten zugeordnet sind. Die von Aggarwal und
Li beschriebene experimentelle Analyse ergab, dass er auch auf dynamischen
Graphen mit 19396 bzw. 806635 Knoten, von denen nur 14814 bzw. 18999
beschriftet waren, innerhalb von weniger als einer Minute auf einem Kern einer
Intel Xeon 2.5 GHz CPU mit 32 G RAM ausgef\"uhrt werden kann. Zus\"atzlich wird
die Ver\"offentlichung von Aggarwal und Li kritisch er\"ortert und und es
werden m\"ogliche Erweiterungen des DYCOS-Algorithmus vorgeschlagen.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 13:28:11 GMT"
}
] | 2015-12-15T00:00:00 |
[
[
"Thoma",
"Martin",
""
]
] |
new_dataset
| 0.998592 |
1405.6741
|
Mahboobeh Houshmand
|
Mahboobeh Houshmand, Morteza Saheb Zamani, Mehdi Sedighi, Mona
Arabzadeh
|
Decomposition of Diagonal Hermitian Quantum Gates Using
Multiple-Controlled Pauli Z Gates
|
To Appear in ACM Journal on Emerging Technologies in Computing
Systems
|
ACM Journal of Emerging Technologies in Computing Systems (JETC),
Vol. 11, No. 3, Article 28, 2014
| null | null |
cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum logic decomposition refers to decomposing a given quantum gate to a
set of physically implementable gates. An approach has been presented to
decompose arbitrary diagonal quantum gates to a set of multiplexed-rotation
gates around z axis. In this paper, a special class of diagonal quantum gates,
namely diagonal Hermitian quantum gates, is considered and a new perspective to
the decomposition problem with respect to decomposing these gates is presented.
It is first shown that these gates can be decomposed to a set that solely
consists of multiple-controlled Z gates. Then a binary representation for the
diagonal Hermitian gates is introduced. It is shown that the binary
representations of multiple-controlled Z gates form a basis for the vector
space that is produced by the binary representations of all diagonal Hermitian
quantum gates. Moreover, the problem of decomposing a given diagonal Hermitian
gate is mapped to the problem of writing its binary representation in the
specific basis mentioned above. Moreover, CZ gate is suggested to be the
two-qubit gate in the decomposition library, instead of previously used CNOT
gate. Experimental results show that the proposed approach can lead to circuits
with lower costs in comparison with the previous ones.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2014 20:21:12 GMT"
}
] | 2015-12-14T00:00:00 |
[
[
"Houshmand",
"Mahboobeh",
""
],
[
"Zamani",
"Morteza Saheb",
""
],
[
"Sedighi",
"Mehdi",
""
],
[
"Arabzadeh",
"Mona",
""
]
] |
new_dataset
| 0.971325 |
1411.7715
|
Artem Rozantsev Mr.
|
Artem Rozantsev, Vincent Lepetit, Pascal Fua
|
Flying Objects Detection from a Single Moving Camera
| null | null |
10.1109/CVPR.2015.7299040
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an approach to detect flying objects such as UAVs and aircrafts
when they occupy a small portion of the field of view, possibly moving against
complex backgrounds, and are filmed by a camera that itself moves.
Solving such a difficult problem requires combining both appearance and
motion cues. To this end we propose a regression-based approach to motion
stabilization of local image patches that allows us to achieve effective
classification on spatio-temporal image cubes and outperform state-of-the-art
techniques.
As the problem is relatively new, we collected two challenging datasets for
UAVs and Aircrafts, which can be used as benchmarks for flying objects
detection and vision-guided collision avoidance.
|
[
{
"version": "v1",
"created": "Thu, 27 Nov 2014 22:39:50 GMT"
}
] | 2015-12-14T00:00:00 |
[
[
"Rozantsev",
"Artem",
""
],
[
"Lepetit",
"Vincent",
""
],
[
"Fua",
"Pascal",
""
]
] |
new_dataset
| 0.99831 |
1512.03501
|
Marian-Andrei Rizoiu
|
Marian-Andrei Rizoiu, Julien Velcin, St\'ephane Bonnevay, St\'ephane
Lallich
|
ClusPath: A Temporal-driven Clustering to Infer Typical Evolution Paths
| null | null |
10.1007/s10618-015-0445-7
| null |
cs.DB cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose ClusPath, a novel algorithm for detecting general evolution
tendencies in a population of entities. We show how abstract notions, such as
the Swedish socio-economical model (in a political dataset) or the companies
fiscal optimization (in an economical dataset) can be inferred from low-level
descriptive features. Such high-level regularities in the evolution of entities
are detected by combining spatial and temporal features into a spatio-temporal
dissimilarity measure and using semi-supervised clustering techniques. The
relations between the evolution phases are modeled using a graph structure,
inferred simultaneously with the partition, by using a "slow changing world"
assumption. The idea is to ensure a smooth passage for entities along their
evolution paths, which catches the long-term trends in the dataset.
Additionally, we also provide a method, based on an evolutionary algorithm, to
tune the parameters of ClusPath to new, unseen datasets. This method assesses
the fitness of a solution using four opposed quality measures and proposes a
balanced compromise.
|
[
{
"version": "v1",
"created": "Fri, 11 Dec 2015 01:32:20 GMT"
}
] | 2015-12-14T00:00:00 |
[
[
"Rizoiu",
"Marian-Andrei",
""
],
[
"Velcin",
"Julien",
""
],
[
"Bonnevay",
"Stéphane",
""
],
[
"Lallich",
"Stéphane",
""
]
] |
new_dataset
| 0.972575 |
1512.03576
|
Boris Bellalta Dr.
|
Albert Bel, Toni Adame, Boris Bellalta
|
An Energy Consumption Model for IEEE 802.11ah WLANs
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the main challenges when designing a new self-powered wireless sensor
network (WSN) technology is the vast operational dependence on its scarce
energy resources. Therefore, a thorough identification and characterisation of
the main energy consumption processes may lay the foundation for developing
further mechanisms aimed to make a more efficient use of devices' batteries.
This paper provides an energy consumption model for IEEE 802.11ah WLANs
operating in power saving mode, which are expected to become one of the
technology drivers in the development of the Internet of Things (IoT) in the
next years. Given the network characteristics, the presented analytical model
is able to provide an estimation of the average energy consumed by a station as
well as to predict its battery lifetime. Once the model has been validated, we
use it to obtain the optimal IEEE 802.11ah power saving parameters in several
IoT key scenarios, validating that the parameters provided by the IEEE 802.11ah
Task Group are already a very good choice.
|
[
{
"version": "v1",
"created": "Fri, 11 Dec 2015 10:26:01 GMT"
}
] | 2015-12-14T00:00:00 |
[
[
"Bel",
"Albert",
""
],
[
"Adame",
"Toni",
""
],
[
"Bellalta",
"Boris",
""
]
] |
new_dataset
| 0.985692 |
1106.3632
|
Ashwin Ganesan
|
Ashwin Ganesan
|
Minimal resolving sets for the hypercube
| null |
Graph Theory Notes of New York, vol. LXVII, pp. 50-53, November
2014
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a given undirected graph $G$, an \emph{ordered} subset $S =
{s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if
the vertices of the graph are distinguishable by their vector of distances to
the vertices in $S$. While a superset of any resolving set is always a
resolving set, a proper subset of a resolving set is not necessarily a
resolving set, and we are interested in determining resolving sets that are
minimal or that are minimum (of minimal cardinality). Let $Q^n$ denote the
$n$-dimensional hypercube with vertex set ${0,1}^n$. In Erd\"os and Renyi
(Erdos & Renyi, 1963) it was shown that a particular set of $n$ vertices forms
a resolving set for the hypercube. The main purpose of this note is to prove
that a proper subset of that set of size $n-1$ is also a resolving set for the
hypercube for all $n \ge 5$ and that this proper subset is a minimal resolving
set.
|
[
{
"version": "v1",
"created": "Sat, 18 Jun 2011 10:14:14 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Aug 2011 13:33:52 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Jan 2012 19:50:29 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Ganesan",
"Ashwin",
""
]
] |
new_dataset
| 0.988486 |
1407.6639
|
Torsten Timm
|
Torsten Timm
|
How the Voynich Manuscript was created
|
96 pages, 17 figures, revised version
| null | null | null |
cs.CR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Voynich manuscript is a medieval book written in an unknown script. This
paper studies the relation between similarly spelled words in the Voynich
manuscript. By means of a detailed analysis of similar spelled words it was
possible to reveal the text generation method used for the Voynich manuscript.
|
[
{
"version": "v1",
"created": "Thu, 24 Jul 2014 16:26:45 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Sep 2014 17:20:37 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Dec 2015 23:38:21 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Timm",
"Torsten",
""
]
] |
new_dataset
| 0.999357 |
1504.04797
|
Songze Li
|
Songze Li, David T.H. Kao, A. Salman Avestimehr
|
Rover-to-Orbiter Communication in Mars: Taking Advantage of the Varying
Topology
|
13 pages, 6 figures. Accepted by IEEE Transactions on Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the communication problem from rovers on Mars'
surface to Mars-orbiting satellites. We first justify that, to a good extent,
the rover-to-orbiter communication problem can be modelled as communication
over a $2 \times 2$ X-channel with the network topology varying over time. For
such a fading X-channel where transmitters are only aware of the time-varying
topology but not the time-varying channel state (i.e., no CSIT), we propose
coding strategies that code across topologies, and develop upper bounds on the
sum degrees-of-freedom (DoF) that is shown to be tight under certain pattern of
the topology variation. Furthermore we demonstrate that the proposed scheme
approximately achieves the ergodic sum-capacity of the network. Using the
proposed coding scheme, we numerically evaluate the ergodic rate gain over a
time-division-multiple-access (TDMA) scheme for Rayleigh and Rice fading
channels. We also numerically demonstrate that with practical orbital
parameters, a 9.6% DoF gain, as well as more than 11.6% throughput gain can be
achieved for a rover-to-orbiter communication network.
|
[
{
"version": "v1",
"created": "Sun, 19 Apr 2015 05:48:04 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Sep 2015 23:35:21 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Dec 2015 20:06:43 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Li",
"Songze",
""
],
[
"Kao",
"David T. H.",
""
],
[
"Avestimehr",
"A. Salman",
""
]
] |
new_dataset
| 0.986463 |
1504.06917
|
Rajan Gill
|
Rajan Gill, Dana Kuli\'c, Christopher Nielsen
|
Spline Path Following for Redundant Mechanical Systems
|
Submitted to IEEE TRO (under review)
|
Robotics, IEEE Transactions on (Volume:31 , Issue: 6 ) 02 December
2015
|
10.1109/TRO.2015.2489502
| null |
cs.RO cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Path following controllers make the output of a control system approach and
traverse a pre-specified path with no apriori time parametrization. In this
paper we present a method for path following control design applicable to
framed curves generated by splines in the workspace of kinematically redundant
mechanical systems. The class of admissible paths includes self-intersecting
curves. Kinematic redundancies are resolved by designing controllers that solve
a suitably defined constrained quadratic optimization problem. By employing
partial feedback linearization, the proposed path following controllers have a
clear physical meaning. The approach is experimentally verified on a
4-degree-of-freedom (4-DOF) manipulator with a combination of revolute and
linear actuated links and significant model uncertainty.
|
[
{
"version": "v1",
"created": "Mon, 27 Apr 2015 03:21:57 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Gill",
"Rajan",
""
],
[
"Kulić",
"Dana",
""
],
[
"Nielsen",
"Christopher",
""
]
] |
new_dataset
| 0.965425 |
1511.06504
|
Jianhui Zhang Dr
|
Jianhui Zhang, Mengmeng Wang, Zhi Li
|
Stochastic Duty Cycling for Heterogenous Energy Harvesting Networks
|
Publised on 34th IEEE-International Performance Computing and
Communications Conference (IPCCC 2015)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, there have been several kinds of energy harvesting networks
containing some tiny devices, such as ambient backscatter, ring and renewable
sensor networks. During energy harvesting, such networks suffer from the energy
heterogeneity, dynamics and prediction hardness because the access to natural
resources is often spatiotemporal different and timely changing among the
devices. Meanwhile, the charging efficiency is quite low especially when the
power of the harvested energy is weak. It results in the energy waste to store
the harvested energy indirectly. These features bring challenging and
interesting issues on efficient allocation of the harvested energy. This paper
studies the \emph{stochastic duty cycling} by considering these features with
the objective characterized by maximizing the common active time. We consider
two cases: offline and online stochastic duty cycling. For the offline case, we
design an optimal solution: offline duty cycling algorithm. For the online
case, we design an online duty cycling algorithm, which achieves the
approximation ratio with at least $1-e^{-\gamma^2}$, where $\gamma$ is the
probability able to harvest energy. We also evaluate our algorithms with the
experiment on a real energy harvesting network. The experiment results show
that the performance of the online algorithm can be very close to the offline
algorithm.
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2015 06:15:30 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Dec 2015 15:07:24 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Zhang",
"Jianhui",
""
],
[
"Wang",
"Mengmeng",
""
],
[
"Li",
"Zhi",
""
]
] |
new_dataset
| 0.956161 |
1512.01882
|
Dong Wang
|
Dong Wang and Xuewei Zhang
|
THCHS-30 : A Free Chinese Speech Corpus
| null | null | null | null |
cs.CL cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Speech data is crucially important for speech recognition research. There are
quite some speech databases that can be purchased at prices that are reasonable
for most research institutes. However, for young people who just start research
activities or those who just gain initial interest in this direction, the cost
for data is still an annoying barrier. We support the `free data' movement in
speech recognition: research institutes (particularly supported by public
funds) publish their data freely so that new researchers can obtain sufficient
data to kick of their career. In this paper, we follow this trend and release a
free Chinese speech database THCHS-30 that can be used to build a full- edged
Chinese speech recognition system. We report the baseline system established
with this database, including the performance under highly noisy conditions.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 02:07:21 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Dec 2015 13:35:33 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Wang",
"Dong",
""
],
[
"Zhang",
"Xuewei",
""
]
] |
new_dataset
| 0.994415 |
1512.03201
|
Olivier Sigaud
|
Olivier Sigaud and Cl\'ement Masson and David Filliat and Freek Stulp
|
Gated networks: an inventory
|
Unpublished manuscript, 17 pages
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gated networks are networks that contain gating connections, in which the
outputs of at least two neurons are multiplied. Initially, gated networks were
used to learn relationships between two input sources, such as pixels from two
images. More recently, they have been applied to learning activity recognition
or multi-modal representations. The aims of this paper are threefold: 1) to
explain the basic computations in gated networks to the non-expert, while
adopting a standpoint that insists on their symmetric nature. 2) to serve as a
quick reference guide to the recent literature, by providing an inventory of
applications of these networks, as well as recent extensions to the basic
architecture. 3) to suggest future research directions and applications.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 10:31:13 GMT"
}
] | 2015-12-11T00:00:00 |
[
[
"Sigaud",
"Olivier",
""
],
[
"Masson",
"Clément",
""
],
[
"Filliat",
"David",
""
],
[
"Stulp",
"Freek",
""
]
] |
new_dataset
| 0.983789 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.