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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1509.09138
|
Manish Kumar
|
Manish Kumar, Shubham Kaul
|
Technical Report on Intruder Detection and Alert System
|
Submitted to CII Innovation 2015, India and NI Engineering Impact
Awards 2015, India. arXiv admin note: text overlap with arXiv:1508.03479
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a smart trespasser detection and alert system which aims
to increase the amount of security as well as the likelihood of positively
identifying or stopping trespassers and intruders as compared to other commonly
deployed home security system. Using multiple sensors, this system can gauge
the extent of danger exhibited by a person or animal in or around the home
premises, and can forward certain critical information regarding the same to
home owners as well as other specified persons such as relevant security
authorities.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 12:00:23 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Kumar",
"Manish",
""
],
[
"Kaul",
"Shubham",
""
]
] |
new_dataset
| 0.99277 |
1509.09187
|
Xiuyuan Cheng
|
Xiuyuan Cheng, Xu Chen, Stephane Mallat
|
Deep Haar Scattering Networks
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An orthogonal Haar scattering transform is a deep network, computed with a
hierarchy of additions, subtractions and absolute values, over pairs of
coefficients. It provides a simple mathematical model for unsupervised deep
network learning. It implements non-linear contractions, which are optimized
for classification, with an unsupervised pair matching algorithm, of polynomial
complexity. A structured Haar scattering over graph data computes permutation
invariant representations of groups of connected points in the graph. If the
graph connectivity is unknown, unsupervised Haar pair learning can provide a
consistent estimation of connected dyadic groups of points. Classification
results are given on image data bases, defined on regular grids or graphs, with
a connectivity which may be known or unknown.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 14:20:29 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Cheng",
"Xiuyuan",
""
],
[
"Chen",
"Xu",
""
],
[
"Mallat",
"Stephane",
""
]
] |
new_dataset
| 0.970662 |
1509.09211
|
Jarek Duda dr
|
Jarek Duda
|
Normalized rotation shape descriptors and lossy compression of molecular
shape
|
10 pages, 10 figures
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a common need to search of molecular databases for compounds
resembling some shape, what suggests having similar biological activity while
searching for new drugs. The large size of the databases requires fast methods
for such initial screening, for example based on feature vectors constructed to
fulfill the requirement that similar molecules should correspond to close
vectors. Ultrafast Shape Recognition (USR) is a popular approach of this type.
It uses vectors of 12 real number as 3 first moments of distances from 4
emphasized points. These coordinates might contain unnecessary correlations and
does not allow to reconstruct the approximated shape. In contrast, spherical
harmonic (SH) decomposition uses orthogonal coordinates, suggesting their
independence and so lager informational content of the feature vector. There is
usually considered rotationally invariant SH descriptors, what means discarding
of some essential information.
This article discusses framework for descriptors with normalized rotation,
for example by using principal component analysis (PCA-SH). As one of the most
interesting are ligands which have to slide into a protein, we will introduce
descriptors optimized for such flat elongated shapes. Bent deformed cylinder
(BDC) describes the molecule as a cylinder which was first bent, then deformed
such that its cross-sections became ellipses of evolving shape. Legendre
polynomials are used to describe the central axis of such bent cylinder.
Additional polynomials are used to define evolution of such elliptic
cross-section along the main axis. There will be also discussed bent
cylindrical harmonics (BCH), which uses cross-sections described by cylindrical
harmonics instead of ellipses. All these normalized rotation descriptors allow
to reconstruct (decode) the approximated representation of the shape, hence can
be also used for lossy compression purposes.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 15:11:33 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Duda",
"Jarek",
""
]
] |
new_dataset
| 0.977573 |
1408.5069
|
Amitabha Bagchi
|
Amitabha Bagchi, Cristina Pinotti, Sainyam Galhotra, Tarun Mangla
|
Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks
|
To appear in ACM Transactions on Sensor Networks. Brief version
appeared in Proc. of ACM MSWIM 2013
|
ACM T Sensor Network 11(2):36, (February 2015)
|
10.1145/2663353
| null |
cs.NI math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the condition on transmission radius needed to achieve
connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First,
we settle a conjecture of Das et. al. (2012) and prove that the connectivity
condition on Random Geometric Graphs (RGG), given by Gupta and Kumar (1989),
can be used to derive a weak sufficient condition to achieve connectivity in
DC-WSN. To find a stronger result, we define a new vertex-based random
connection model which is of independent interest. Following a proof technique
of Penrose (1991) we prove that when the density of the nodes approaches
infinity then a finite component of size greater than 1 exists with probability
0 in this model. We use this result to obtain an optimal condition on node
transmission radius which is both necessary and sufficient to achieve
connectivity and is hence optimal. The optimality of such a radius is also
tested via simulation for two specific duty-cycle schemes, called the
contiguous and the random selection duty-cycle scheme. Finally, we design a
minimum-radius duty-cycling scheme that achieves connectivity with a
transmission radius arbitrarily close to the one required in Random Geometric
Graphs. The overhead in this case is that we have to spend some time computing
the schedule.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 17:03:53 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Aug 2014 13:13:44 GMT"
}
] | 2015-09-30T00:00:00 |
[
[
"Bagchi",
"Amitabha",
""
],
[
"Pinotti",
"Cristina",
""
],
[
"Galhotra",
"Sainyam",
""
],
[
"Mangla",
"Tarun",
""
]
] |
new_dataset
| 0.988312 |
1504.06247
|
Tiben Che
|
Tiben Che, Jingwei Xu and Gwan Choi
|
TC: Throughput Centric Successive Cancellation Decoder Hardware
Implementation for Polar Codes
|
submitted to ICASSP 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a hardware architecture of fast simplified successive
cancellation (fast-SSC) algorithm for polar codes, which significantly reduces
the decoding latency and dramatically increases the throughput.
Algorithmically, fast-SSC algorithm suffers from the fact that its decoder
scheduling and the consequent architecture depends on the code rate; this is a
challenge for rate-compatible system. However, by exploiting the
homogeneousness between the decoding processes of fast constituent polar codes
and regular polar codes, the presented design is compatible with any rate. The
scheduling plan and the intendedly designed process core are also described.
Results show that, compared with the state-of-art decoder, proposed design can
achieve at least 60% latency reduction for the codes with length N = 1024. By
using Nangate FreePDK 45nm process, proposed design can reach throughput up to
5.81 Gbps and 2.01 Gbps for (1024, 870) and (1024, 512) polar code,
respectively.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2015 16:37:23 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Sep 2015 20:02:37 GMT"
}
] | 2015-09-30T00:00:00 |
[
[
"Che",
"Tiben",
""
],
[
"Xu",
"Jingwei",
""
],
[
"Choi",
"Gwan",
""
]
] |
new_dataset
| 0.999383 |
1509.04221
|
Sarika Kushwaha
|
Pramod Kumar Kewat, Sarika Kushwaha
|
Cyclic codes over the ring $\mathbb{F}_p[u,v,w]/\langle u^2, v^2, w^2,
uv-vu, vw-wv, uw-wu \rangle$
|
Rewriting of Section 4. arXiv admin note: substantial text overlap
with arXiv:1508.07034, arXiv:1405.5981
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate cyclic codes over the ring $
\mathbb{F}_p[u,v,w]\langle u^2,$ $v^2, w^2$, $uv-vu, vw-wv, uw-wu \rangle$,
where $p$ is a prime number. Which is a part of family of Frobenius rings. We
find a unique set of generators for these codes and characterize the free
cyclic codes. We also study the rank and the Hamming distance of these codes.
We also constructs some good $p-ary$ codes as the Gray images of these cyclic
codes.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 17:45:02 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Sep 2015 13:39:45 GMT"
}
] | 2015-09-30T00:00:00 |
[
[
"Kewat",
"Pramod Kumar",
""
],
[
"Kushwaha",
"Sarika",
""
]
] |
new_dataset
| 0.999477 |
1509.08388
|
Chawanat Nakasan
|
Chawanat Nakasan, Kohei Ichikawa, Hajimu Iida, Putchong Uthayopas
|
A Simple Multipath OpenFlow Controller using topology-based algorithm
for Multipath TCP
|
8 pages, submitted for PRAGMA-ICDS 2015
| null |
10.6084/m9.figshare.1558361
| null |
cs.NI
|
http://creativecommons.org/licenses/by/4.0/
|
Multipath TCP, or MPTCP, is a widely-researched mechanism that allows a
single application-level connection to be split to more than one TCP stream,
and consequently more than one network interface, as opposed to the traditional
TCP/IP model. Being a transport layer protocol, MPTCP can easily interact
between the application using it and the network supporting it. However, MPTCP
does not have control of its own route. Default IP routing behavior generally
takes all traffic through the shortest or best-metric path. However, this
behavior may actually cause paths to collide with each other, creating
contention for bandwidth in a number of edges. This can result in a bottleneck
which limits the throughput of the network. Therefore, a multipath routing
mechanism is necessary to ensure smooth operation of MPTCP. We created smoc, a
Simple Multipath OpenFlow Controller, that uses only topology information of
the network to avoid collision where possible. Evaluation of smoc in a virtual
local-area and a physical wide-area SDNs showed favorable results as smoc
provided better performance than simple or spanning-tree routing mechanisms.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2015 16:49:30 GMT"
}
] | 2015-09-30T00:00:00 |
[
[
"Nakasan",
"Chawanat",
""
],
[
"Ichikawa",
"Kohei",
""
],
[
"Iida",
"Hajimu",
""
],
[
"Uthayopas",
"Putchong",
""
]
] |
new_dataset
| 0.998908 |
1509.08647
|
Eduardo M. Pereira
|
Eduardo M. Pereira, Jaime S. Cardoso, Ricardo Morla
|
Long-Range Trajectories from Global and Local Motion Representations
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion is a fundamental cue for scene analysis and human activity understan-
ding in videos. It can be encoded in trajectories for tracking objects and for
action recognition, or in form of flow to address behaviour analysis in crowded
scenes. Each approach can only be applied on limited scenarios. We propose a
motion-based system that represents the spatial and temporal features of the
flow in terms of long-range trajectories. The novelty resides on the system
formulation, its generic approach to handle scene variability and motion
variations, motion integration from local and global representations, and the
resulting long-range trajectories that overcome trajectory-based approach
problems. We report the results and conclusions that state its pertinence on
different scenarios, comparing and correlating the extracted trajectories of
individual pedestrians, manually annotated. We also propose an evaluation
framework and stress the diverse system characteristics that can be used for
human activity tasks, namely on motion segmentation.
|
[
{
"version": "v1",
"created": "Tue, 29 Sep 2015 09:02:57 GMT"
}
] | 2015-09-30T00:00:00 |
[
[
"Pereira",
"Eduardo M.",
""
],
[
"Cardoso",
"Jaime S.",
""
],
[
"Morla",
"Ricardo",
""
]
] |
new_dataset
| 0.987615 |
1401.3682
|
Minglai Cai
|
Holger Boche, Minglai Cai, and Christian Deppe
|
Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional
Relaying Channel
| null |
Quantum Information Processing: Volume 14, Issue 10 (2015), Page
3879-3897
|
10.1007/s11128-015-1065-2
| null |
cs.IT math.IT math.QA quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
We study a three-node quantum network which enables bidirectional
communication between two nodes with a half-duplex relay node. A
decode-and-forward protocol is used to perform the communication in two phases.
In the first phase, the messages of two nodes are transmitted to the relay
node. In the second phase, the relay node broadcasts a re-encoded composition
to the two nodes. We determine the capacity region of the broadcast phase.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 17:29:23 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jan 2014 10:27:07 GMT"
},
{
"version": "v3",
"created": "Mon, 27 Jul 2015 13:02:18 GMT"
},
{
"version": "v4",
"created": "Mon, 28 Sep 2015 15:23:00 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Boche",
"Holger",
""
],
[
"Cai",
"Minglai",
""
],
[
"Deppe",
"Christian",
""
]
] |
new_dataset
| 0.999307 |
1412.3480
|
M. H. van Emden
|
M.H. van Emden
|
Logic programming beyond Prolog
|
19 pages, 5 figures
| null | null |
DCS-355-IR
|
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A logic program is an executable specification. For example, merge sort in
pure Prolog is a logical formula, yet shows creditable performance on long
linked lists. But such executable specifications are a compromise: the logic is
distorted by algorithmic considerations, yet only indirectly executable via an
abstract machine. This paper introduces relational programming, a method that
solves the difficulty with logic programming by a separation of concerns. It
requires three texts: (1) the axioms, a logical formula that specifies the
problem and is not compromised by algorithmic considerations, (2) the theorem,
a logical formula that expresses the idea of the algorithm and follows from the
axioms, and (3) the code, a transcription of the theorem to a procedural
language. Correctness of the code relies on the logical relationship of the
theorem with the axioms and relies on an accurate transcription of the theorem
to the procedural language. Sorting is an example where relational programming
has the advantage of a higher degree of abstractness: the data to be sorted can
be any data type in C++ (the procedural language we use in our examples) that
satisfies the axioms of linear order, while the pure-Prolog version is limited
to data structures in the form of linked cells. We show another advantage of
relational programs: they have a model-theoretic and fixpoint semantics
equivalent to each other and analogous to those of pure Prolog programs.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2014 21:45:04 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Dec 2014 04:27:31 GMT"
},
{
"version": "v3",
"created": "Sat, 26 Sep 2015 01:43:26 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"van Emden",
"M. H.",
""
]
] |
new_dataset
| 0.990067 |
1412.7415
|
Jestin Joy
|
Jestin Joy, Kannan Balakrishnan
|
A prototype Malayalam to Sign Language Automatic Translator
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
Sign language, which is a medium of communication for deaf people, uses
manual communication and body language to convey meaning, as opposed to using
sound. This paper presents a prototype Malayalam text to sign language
translation system. The proposed system takes Malayalam text as input and
generates corresponding Sign Language. Output animation is rendered using a
computer generated model. This system will help to disseminate information to
the deaf people in public utility places like railways, banks, hospitals etc.
This will also act as an educational tool in learning Sign Language.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2014 15:51:41 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Sep 2015 04:52:42 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Joy",
"Jestin",
""
],
[
"Balakrishnan",
"Kannan",
""
]
] |
new_dataset
| 0.999837 |
1505.00880
|
Hang Su
|
Hang Su, Subhransu Maji, Evangelos Kalogerakis, Erik Learned-Miller
|
Multi-view Convolutional Neural Networks for 3D Shape Recognition
|
v1: Initial version. v2: An updated ModelNet40 training/test split is
used; results with low-rank Mahalanobis metric learning are added. v3 (ICCV
2015): A second camera setup without the upright orientation assumption is
added; some accuracy and mAP numbers are changed slightly because a small
issue in mesh rendering related to specularities is fixed
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A longstanding question in computer vision concerns the representation of 3D
shapes for recognition: should 3D shapes be represented with descriptors
operating on their native 3D formats, such as voxel grid or polygon mesh, or
can they be effectively represented with view-based descriptors? We address
this question in the context of learning to recognize 3D shapes from a
collection of their rendered views on 2D images. We first present a standard
CNN architecture trained to recognize the shapes' rendered views independently
of each other, and show that a 3D shape can be recognized even from a single
view at an accuracy far higher than using state-of-the-art 3D shape
descriptors. Recognition rates further increase when multiple views of the
shapes are provided. In addition, we present a novel CNN architecture that
combines information from multiple views of a 3D shape into a single and
compact shape descriptor offering even better recognition performance. The same
architecture can be applied to accurately recognize human hand-drawn sketches
of shapes. We conclude that a collection of 2D views can be highly informative
for 3D shape recognition and is amenable to emerging CNN architectures and
their derivatives.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 04:51:19 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jun 2015 18:16:01 GMT"
},
{
"version": "v3",
"created": "Sun, 27 Sep 2015 20:42:16 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Su",
"Hang",
""
],
[
"Maji",
"Subhransu",
""
],
[
"Kalogerakis",
"Evangelos",
""
],
[
"Learned-Miller",
"Erik",
""
]
] |
new_dataset
| 0.998868 |
1509.02010
|
Alex Olieman
|
Alex Olieman, Jaap Kamps, and Rosa Merino Claros
|
LocLinkVis: A Geographic Information Retrieval-Based System for
Large-Scale Exploratory Search
|
SEM'15
|
Proc. Posters and Demos Track of 11th Int. Conf. on Semantic
Systems (2015) 30-33
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present LocLinkVis (Locate-Link-Visualize); a system which
supports exploratory information access to a document collection based on
geo-referencing and visualization. It uses a gazetteer which contains
representations of places ranging from countries to buildings, and that is used
to recognize toponyms, disambiguate them into places, and to visualize the
resulting spatial footprints.
|
[
{
"version": "v1",
"created": "Mon, 7 Sep 2015 12:36:19 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Sep 2015 15:16:54 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Olieman",
"Alex",
""
],
[
"Kamps",
"Jaap",
""
],
[
"Claros",
"Rosa Merino",
""
]
] |
new_dataset
| 0.999761 |
1509.08071
|
Hsin-Mu Tsai
|
Hao-Min Lin and Hsin-Mu Tsai and Mate Boban
|
Scooter-to-X Communications: Antenna Placement, Human Body Shadowing,
and Channel Modeling
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In countries such as Taiwan, with a high percentage of scooters,
scooter-related accidents are responsible for most injuries and deaths of all
traffic accidents. One viable approach to reduce the number of accidents is to
utilize short-range wireless communications between the scooter and other
vehicles. This would help neighboring vehicles to detect the scooter and
vice-versa, thus reducing the probability of a collision. In this paper, we
perform extensive measurements to characterize communication links between a
scooter and other vehicles. Our results suggest that, when the line-of-sight
propagation path is blocked by the body of the scooter driver (and possibly
also a passenger), shadowing of the human body results in significant signal
attenuation, ranging from 9 to 18 dB on average, presenting challenging channel
characteristics unique to scooters. In addition, we perform simulations, which
show that it is imperative to incorporate the body shadowing effect to obtain
realistic simulation results. We also develop a model to determine whether
human body shadowing is in effect, given the relative positions of the
transmitter and the receiver.
|
[
{
"version": "v1",
"created": "Sun, 27 Sep 2015 09:02:41 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Lin",
"Hao-Min",
""
],
[
"Tsai",
"Hsin-Mu",
""
],
[
"Boban",
"Mate",
""
]
] |
new_dataset
| 0.996894 |
1509.08194
|
Abhishek Sinha
|
Abhishek Sinha, Pradeepkumar Mani, Jie Liu, Ashley Flavel and David A.
Maltz
|
Distributed Load Management in Anycast-based CDNs
|
To appear in Allerton, 2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anycast is an internet addressing protocol where multiple hosts share the
same IP-address. A popular architecture for modern Content Distribution
Networks (CDNs) for geo-replicated HTTP-services consists of multiple layers of
proxy nodes for service and co-located DNS-servers for load-balancing on
different proxies. Both the proxies and the DNS-servers use anycast addressing,
which offers simplicity of design and high availability of service at the cost
of partial loss of routing control. Due to the very nature of anycast,
load-management decisions by a co-located DNS-server also affects loads at
nearby proxies in the network. This makes the problem of distributed load
management highly challenging. In this paper, we propose an analytical
framework to formulate and solve the load-management problem in this context.
We consider two distinct algorithms. In the first half of the paper, we pose
the load-management problem as a convex optimization problem. Following a dual
decomposition technique, we propose a fully-distributed load management
algorithm by introducing FastControl packets. This algorithm utilizes the
underlying anycast mechanism itself to enable effective coordination among the
nodes, thus obviating the need for any external control channel. In the second
half of the paper, we consider an alternative greedy load-management heuristic,
currently in production in a major commercial CDN. We study its dynamical
characteristics and analytically identify its operational and stability
properties. Finally, we critically evaluate both the algorithms and explore
their optimality-vs-complexity trade-off using trace-driven simulations.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2015 04:47:05 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Sinha",
"Abhishek",
""
],
[
"Mani",
"Pradeepkumar",
""
],
[
"Liu",
"Jie",
""
],
[
"Flavel",
"Ashley",
""
],
[
"Maltz",
"David A.",
""
]
] |
new_dataset
| 0.999118 |
1509.08215
|
Hosny Abbas
|
Hosny Abbas, Samir Shaheen, Mohammed Amin
|
Adaptive Agent-Based SCADA System
|
10
|
Int'l Journal of Computing, Communications & Instrumentation Engg.
(IJCCIE) Vol. 2, Issue 1 (2015) ISSN 2349-1469 EISSN 2349-1477
| null | null |
cs.SY cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern supervisory control and data acquisition (SCADA) systems comprise
variety of industrial equipment such as physical control processes, logical
control systems, communication networks, computers, and communication
protocols. They are concerned with control and supervision of production
control processes. Modern SCADA networks contain highly distributed
information, control, and location. Moreover, they contain large number of
heterogeneous components situated in highly changing and uncertain
environments. As a result, engineering modern SCADA is a challenging issue and
conventional engineering approaches are no longer suitable for them because of
their increasing complexity and highly distribution. In this research,
Multi-Agent Systems (MAS) are used to enable building adaptive agent-based
SCADA system by modeling system components as agents in the micro level and as
organizations or societies of agents in the macro level. A prototype has been
implemented and evaluated within a simulation environment for demonstrating the
adaptive behavior of the system-to-be, which results in continuous improvement
of system performance.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2015 07:05:12 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Abbas",
"Hosny",
""
],
[
"Shaheen",
"Samir",
""
],
[
"Amin",
"Mohammed",
""
]
] |
new_dataset
| 0.979126 |
1509.08257
|
Tingshao Zhu
|
Zhen Li, Jianjun Xu, Tingshao Zhu
|
Recognition of Brain Waves of Left and Right Hand Movement Imagery with
Portable Electroencephalographs
|
13 pages,4 figures,4 tables. arXiv admin note: substantial text
overlap with arXiv:1509.07642
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the development of the modern society, mind control applied to both the
recovery of disabled individuals and auxiliary control of normal people has
obtained great attention in numerous researches. In our research, we attempt to
recognize the brain waves of left and right hand movement imagery with portable
electroencephalographs. Considering the inconvenience of wearing traditional
multiple-electrode electroencephalographs, we choose Muse to collect data which
is a portable headband launched lately with a number of useful functions and
channels and it is much easier for the public to use. Additionally, previous
researches generally focused on discrimination of EEG of left and right hand
movement imagery by using data from C3 and C4 electrodes which locate on the
top of the head. However, we choose the gamma wave channels of F7 and F8 and
obtain data when subjects imagine their left or right hand to move with their
eyeballs rotated in the corresponding direction. With the help of the Common
Space Pattern algorithm to extract features of brain waves between left and
right hand movement imagery, we make use of the Support Vector Machine to
classify different brain waves. Traditionally, the accuracy rate of
classification was approximately 90% using the EEG data from C3 and C4
electrode poles; however, the accuracy rate reaches 95.1% by using the gamma
wave data from F7 and F8 in our experiment. Finally, we design a plane program
in Python where a plane can be controlled to go left or right when users
imagine their left or right hand to move. 8 subjects are tested and all of them
can control the plane flexibly which reveals that our model can be applied to
control hardware which is useful for disabled individuals and normal people.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2015 09:58:55 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Li",
"Zhen",
""
],
[
"Xu",
"Jianjun",
""
],
[
"Zhu",
"Tingshao",
""
]
] |
new_dataset
| 0.998026 |
1509.08439
|
Sanath Narayan
|
Sanath Narayan, Kalpathi R. Ramakrishnan
|
Hyper-Fisher Vectors for Action Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel encoding scheme combining Fisher vector and
bag-of-words encodings has been proposed for recognizing action in videos. The
proposed Hyper-Fisher vector encoding is sum of local Fisher vectors which are
computed based on the traditional Bag-of-Words (BoW) encoding. Thus, the
proposed encoding is simple and yet an effective representation over the
traditional Fisher Vector encoding. By extensive evaluation on challenging
action recognition datasets, viz., Youtube, Olympic Sports, UCF50 and HMDB51,
we show that the proposed Hyper-Fisher Vector encoding improves the recognition
performance by around 2-3% compared to the improved Fisher Vector encoding. We
also perform experiments to show that the performance of the Hyper-Fisher
Vector is robust to the dictionary size of the BoW encoding.
|
[
{
"version": "v1",
"created": "Mon, 28 Sep 2015 19:25:34 GMT"
}
] | 2015-09-29T00:00:00 |
[
[
"Narayan",
"Sanath",
""
],
[
"Ramakrishnan",
"Kalpathi R.",
""
]
] |
new_dataset
| 0.991431 |
1010.5624
|
Aline Parreau
|
Louis Esperet (G-SCOP), Sylvain Gravier (IF), Mickael Montassier
(LaBRI), Pascal Ochem (LRI), Aline Parreau (IF)
|
Locally identifying coloring of graphs
|
21 pages
|
Electron. J. Combin. 19(2) (2012), #P40
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of locally identifying coloring of a graph. A proper
vertex-coloring c of a graph G is said to be locally identifying, if for any
adjacent vertices u and v with distinct closed neighborhood, the sets of colors
that appear in the closed neighborhood of u and v are distinct. Let
$\chi_{lid}(G)$ be the minimum number of colors used in a locally identifying
vertex-coloring of G. In this paper, we give several bounds on $\chi_{lid}$ for
different families of graphs (planar graphs, some subclasses of perfect graphs,
graphs with bounded maximum degree) and prove that deciding whether
$\chi_{lid}(G)=3$ for a subcubic bipartite graph $G$ with large girth is an
NP-complete problem.
|
[
{
"version": "v1",
"created": "Wed, 27 Oct 2010 09:34:56 GMT"
},
{
"version": "v2",
"created": "Sat, 5 May 2012 05:31:30 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Esperet",
"Louis",
"",
"G-SCOP"
],
[
"Gravier",
"Sylvain",
"",
"IF"
],
[
"Montassier",
"Mickael",
"",
"LaBRI"
],
[
"Ochem",
"Pascal",
"",
"LRI"
],
[
"Parreau",
"Aline",
"",
"IF"
]
] |
new_dataset
| 0.959585 |
1509.07326
|
Pascal Potvin
|
Pascal Potvin, Mario Bonja, Gordon Bailey, Pierre Busnel
|
An IMS DSL Developed at Ericsson
|
19 pages, 2 figures, 1 table, oral presentation at SDL 2013:
Model-Driven Dependability Engineering conference
|
SDL 2013: Model-Driven Dependability Engineering Volume 7916 of
the series Lecture Notes in Computer Science pp 144-162
|
10.1007/978-3-642-38911-5
| null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present how we created a Domain Specific Language (DSL)
dedicated to IP Multimedia Subsystem (IMS) at Ericsson. First, we introduce IMS
and how developers are burdened by its complexity when integrating it in their
application. Then we describe the principles we followed to create our new IMS
DSL from its core in the Scala language to its syntax. We then present how we
integrated it in two existing projects and show how it can save time for
developers and how readable the syntax of the IMS DSL is.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 11:46:20 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Potvin",
"Pascal",
""
],
[
"Bonja",
"Mario",
""
],
[
"Bailey",
"Gordon",
""
],
[
"Busnel",
"Pierre",
""
]
] |
new_dataset
| 0.991673 |
1509.07600
|
Yuya Higashikawa
|
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, and
Shun Saburi
|
Minimax Regret 1-Median Problem in Dynamic Path Networks
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the minimax regret 1-median problem in dynamic path
networks. In our model, we are given a dynamic path network consisting of an
undirected path with positive edge lengths, uniform positive edge capacity, and
nonnegative vertex supplies. Here, each vertex supply is unknown but only an
interval of supply is known. A particular assignment of supply to each vertex
is called a scenario. Given a scenario s and a sink location x in a dynamic
path network, let us consider the evacuation time to x of a unit supply given
on a vertex by s. The cost of x under s is defined as the sum of evacuation
times to x for all supplies given by s, and the median under s is defined as a
sink location which minimizes this cost. The regret for x under s is defined as
the cost of x under s minus the cost of the median under s. Then, the problem
is to find a sink location such that the maximum regret for all possible
scenarios is minimized. We propose an O(n^3) time algorithm for the minimax
regret 1-median problem in dynamic path networks with uniform capacity, where n
is the number of vertices in the network.
|
[
{
"version": "v1",
"created": "Fri, 25 Sep 2015 06:46:36 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Higashikawa",
"Yuya",
""
],
[
"Cheng",
"Siu-Wing",
""
],
[
"Kameda",
"Tsunehiko",
""
],
[
"Katoh",
"Naoki",
""
],
[
"Saburi",
"Shun",
""
]
] |
new_dataset
| 0.997701 |
1509.07741
|
Manuel Bl\'azquez-Ochando
|
Manuel Bl\'azquez Ochando
|
A vulnerability in Google AdSense: Automatic extraction of links to ads
|
8 figures
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On the basis of the XSS (Cross Site Scripting) and Web Crawler techniques it
is possible to go through the barriers of the Google Adsense advertising system
by obtaining the validated links of the ads published on a website. Such method
involves obtaining the source code built for the Google java applet for
publishing and handling ads and for the final link retrieval. Once the links of
the ads have been obtained, you can use the user sessions visiting other
websites to load such links, in the background, by a simple re-direction,
through a hidden iframe, so that the IP addresses clicking are different in
each case.
|
[
{
"version": "v1",
"created": "Fri, 25 Sep 2015 14:48:43 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Ochando",
"Manuel Blázquez",
""
]
] |
new_dataset
| 0.998639 |
1509.07821
|
Robert Escriva
|
Robert Escriva, Emin G\"un Sirer
|
The Design and Implementation of the Wave Transactional Filesystem
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the Wave Transactional Filesystem (WTF), a novel,
transactional, POSIX-compatible filesystem based on a new file slicing API that
enables efficient file transformations. WTF provides transactional access to a
distributed filesystem, eliminating the possibility of inconsistencies across
multiple files. Further, the file slicing API enables applications to construct
files from the contents of other files without having to rewrite or relocate
data. Combined, these enable a new class of high-performance applications.
Experiments show that WTF can qualitatively outperform the industry-standard
HDFS distributed filesystem, up to a factor of four in a sorting benchmark, by
reducing I/O costs. Microbenchmarks indicate that the new features of WTF
impose only a modest overhead on top of the POSIX-compatible API.
|
[
{
"version": "v1",
"created": "Fri, 25 Sep 2015 18:19:53 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Escriva",
"Robert",
""
],
[
"Sirer",
"Emin Gün",
""
]
] |
new_dataset
| 0.956605 |
1509.07857
|
Boris Pritychenko
|
B. Pritychenko
|
Fractional Authorship in Nuclear Physics
|
8 pages, 4 Figures
| null | null |
Brookhaven National Laboratory Report BNL-108445-2015-JA
|
cs.DL nucl-th physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large, multi-institutional groups or collaborations of scientists are engaged
in nuclear physics research projects, and the number of research facilities is
dwindling. These collaborations have their own authorship rules, and they
produce a large number of highly-cited papers. Multiple authorship of nuclear
physics publications creates a problem with the assessment of an individual
author's productivity relative to his/her colleagues and renders ineffective a
performance metrics solely based on annual publication and citation counts.
Many institutions are increasingly relying on the total number of first-author
papers; however, this approach becomes counterproductive for large research
collaborations with an alphabetical order of authors. A concept of fractional
authorship (the claiming of credit for authorship by more than one individual)
helps to clarify this issue by providing a more complete picture of research
activities. In the present work, nuclear physics fractional and total
authorships have been investigated using nuclear data mining techniques.
Historic total and fractional authorship averages have been extracted from the
Nuclear Science References (NSR) database, and the current range of fractional
contributions has been deduced. The results of this study and their
implications are discussed and conclusions presented.
|
[
{
"version": "v1",
"created": "Fri, 25 Sep 2015 19:51:35 GMT"
}
] | 2015-09-28T00:00:00 |
[
[
"Pritychenko",
"B.",
""
]
] |
new_dataset
| 0.981762 |
1301.0975
|
Yan-yu Zhang
|
Yan-Yu Zhang, Hong-Yi Yu, Yi-Jun Zhu and Jin-Long Wang
|
Multiple layer Phase Shift Linear Space-time Block Code for High-speed
Visible Light Communications
|
This paper has been withdrawn by the author due to a crucial error in
the performance analysis
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, we consider intensity modulation/direct detection (IM/DD)
channel in the visible light communication (VLC) systems with multiple
transmitter phosphor-based white light emitting diodes (LED) and single
receiver avalanche photo diode (APD). We proposed a Multiple Layer Phase Shift
Linear Space-time Block Code (MLPS-LSTBC). We show that our proposed code for
VLC has the following main features: (a) The symbol transmission rate is
$N/(N+M-1)$, where $N$ is the number of transmitter LED and $M$ denotes the
number of shift intervals contained by a single codeword per layer; (b)
zero-forcing receiver can transform the virtual MIMO matrix channel into
parallel sub-channels even without channel state information at the receiver
side (CSIR); (c) Our MLPS-LSTBC can asymptotically enhance the spectral
efficiency by $\min (M\text{,}N)$, which is attractive for LED-based VLC with
limited electrical modulation bandwidth. By simulations, we achieve the record
data rate of 1.5 Gb/s with the bit error rate performance below the FEC limit
of $2\times10^{-3}$ via multiple 100-MBaud transmission of OOK signal.
|
[
{
"version": "v1",
"created": "Sun, 6 Jan 2013 04:54:06 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2015 18:45:08 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Zhang",
"Yan-Yu",
""
],
[
"Yu",
"Hong-Yi",
""
],
[
"Zhu",
"Yi-Jun",
""
],
[
"Wang",
"Jin-Long",
""
]
] |
new_dataset
| 0.992413 |
1501.04504
|
Xiangyao Yu
|
Xiangyao Yu, Srinivas Devadas
|
TARDIS: Timestamp based Coherence Algorithm for Distributed Shared
Memory
|
16 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new memory coherence protocol, Tardis, is proposed. Tardis uses timestamp
counters representing logical time as well as physical time to order memory
operations and enforce sequential consistency in any type of shared memory
system. Tardis is unique in that as compared to the widely-adopted directory
coherence protocol, and its variants, it completely avoids multicasting and
only requires O(log N) storage per cache block for an N-core system rather than
O(N) sharer information. Tardis is simpler and easier to reason about, yet
achieves similar performance to directory protocols on a wide range of
benchmarks run on 16, 64 and 256 cores.
|
[
{
"version": "v1",
"created": "Mon, 19 Jan 2015 14:38:00 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Sep 2015 22:04:50 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Yu",
"Xiangyao",
""
],
[
"Devadas",
"Srinivas",
""
]
] |
new_dataset
| 0.996114 |
1505.07237
|
Gabriele Nebe
|
Gabriele Nebe and Wolfgang Willems
|
On self-dual MRD codes
|
Improved exposition according to the referees' comments
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We determine the automorphism group of Gabidulin codes of full length and
characterise when these codes are equivalent to self-dual codes.
|
[
{
"version": "v1",
"created": "Wed, 27 May 2015 09:38:04 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2015 09:19:36 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Nebe",
"Gabriele",
""
],
[
"Willems",
"Wolfgang",
""
]
] |
new_dataset
| 0.997905 |
1506.08959
|
Linjie Yang
|
Linjie Yang, Ping Luo, Chen Change Loy, Xiaoou Tang
|
A Large-Scale Car Dataset for Fine-Grained Categorization and
Verification
|
An extension to our conference paper in CVPR 2015
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Updated on 24/09/2015: This update provides preliminary experiment results
for fine-grained classification on the surveillance data of CompCars. The
train/test splits are provided in the updated dataset. See details in Section
6.
|
[
{
"version": "v1",
"created": "Tue, 30 Jun 2015 06:47:50 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2015 09:04:24 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Yang",
"Linjie",
""
],
[
"Luo",
"Ping",
""
],
[
"Loy",
"Chen Change",
""
],
[
"Tang",
"Xiaoou",
""
]
] |
new_dataset
| 0.999885 |
1509.07204
|
EPTCS
|
Lauri Hella (University of Tampere), Johanna Stumpf (TU Darmstadt)
|
The expressive power of modal logic with inclusion atoms
|
In Proceedings GandALF 2015, arXiv:1509.06858
|
EPTCS 193, 2015, pp. 129-143
|
10.4204/EPTCS.193.10
| null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modal inclusion logic is the extension of basic modal logic with inclusion
atoms, and its semantics is defined on Kripke models with teams. A team of a
Kripke model is just a subset of its domain. In this paper we give a complete
characterisation for the expressive power of modal inclusion logic: a class of
Kripke models with teams is definable in modal inclusion logic if and only if
it is closed under k-bisimulation for some integer k, it is closed under
unions, and it has the empty team property. We also prove that the same
expressive power can be obtained by adding a single unary nonemptiness operator
to modal logic. Furthermore, we establish an exponential lower bound for the
size of the translation from modal inclusion logic to modal logic with the
nonemptiness operator.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 01:53:29 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Hella",
"Lauri",
"",
"University of Tampere"
],
[
"Stumpf",
"Johanna",
"",
"TU Darmstadt"
]
] |
new_dataset
| 0.989681 |
1509.07345
|
Olivier Beaude
|
Olivier Beaude and Cheng Wan and Samson Lasaulce
|
Composite charging games in networks of electric vehicles
|
8 pages, 6 figures, keywords: EV charging - Electricity Distribution
Networks - Composite game - Composite Equilibrium
| null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important scenario for smart grids which encompass distributed electrical
networks is given by the simultaneous presence of aggregators and individual
consumers. In this work, an aggregator is seen as an entity (a coalition) which
is able to manage jointly the energy demand of a large group of consumers or
users. More precisely, the demand consists in charging an electrical vehicle
(EV) battery. The way the EVs user charge their batteries matters since it
strongly impacts the network, especially the distribution network costs (e.g.,
in terms of Joule losses or transformer ageing). Since the charging policy is
chosen by the users or the aggregators, the charging problem is naturally
distributed. It turns out that one of the tools suited to tackle this
heterogenous scenario has been introduced only recently namely, through the
notion of composite games. This paper exploits for the first time in the
literature of smart grids the notion of composite game and equilibrium. By
assuming a rectangular charging profile for an EV, a composite equilibrium
analysis is conducted, followed by a detailed analysis of a case study which
assumes three possible charging periods or time-slots. Both the provided
analytical and numerical results allow one to better understand the
relationship between the size (which is a measure) of the coalition and the
network sum-cost. In particular, a social dilemma, a situation where everybody
prefers unilaterally defecting to cooperating, while the consequence is the
worst for all, is exhibited.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 12:40:48 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Beaude",
"Olivier",
""
],
[
"Wan",
"Cheng",
""
],
[
"Lasaulce",
"Samson",
""
]
] |
new_dataset
| 0.987052 |
1509.07349
|
Olivier Beaude
|
Olivier Beaude and Samson Lasaulce and Martin Hennebel
|
Charging Games in Networks of Electrical Vehicles
|
8 pages, 4 figures, keywords: Charging games - electrical vehicle -
distribution networks - potential games - Nash equilibrium - price of anarchy
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a static non-cooperative game formulation of the problem of
distributed charging in electrical vehicle (EV) networks is proposed. This
formulation allows one to model the interaction between several EV which are
connected to a common residential distribution transformer. Each EV aims at
choosing the time at which it starts charging its battery in order to minimize
an individual cost which is mainly related to the total power delivered by the
transformer, the location of the time interval over which the charging
operation is performed, and the charging duration needed for the considered EV
to have its battery fully recharged. As individual cost functions are assumed
to be memoryless, it is possible to show that the game of interest is always an
ordinal potential game. More precisely, both an atomic and nonatomic versions
of the charging game are considered. In both cases, equilibrium analysis is
conducted. In particular, important issues such as equilibrium uniqueness and
efficiency are tackled. Interestingly, both analytical and numerical results
show that the efficiency loss due to decentralization (e.g., when cost
functions such as distribution network Joule losses or life of residential
distribution transformers when no thermal inertia is assumed) induced by
charging is small and the corresponding "efficiency", a notion close to the
Price of Anarchy, tends to one when the number of EV increases.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 13:03:28 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Beaude",
"Olivier",
""
],
[
"Lasaulce",
"Samson",
""
],
[
"Hennebel",
"Martin",
""
]
] |
new_dataset
| 0.997802 |
1509.07470
|
Yan-yu Zhang
|
Yan-Yu Zhang, Hong-Yi Yu, Jian-Kang Zhang, Yi-Jun Zhu, Jin-Long Wang
and Tao Wang
|
Space Codes for MIMO Optical Wireless Communications: Error Performance
Criterion and Code Construction
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider a multiple-input-multiple-output optical wireless
communication (MIMO-OWC) system in the presence of log-normal fading. In this
scenario, a general criterion for the design of full-diversity space code
(FDSC) with the maximum likelihood (ML) detector is developed. This criterion
reveals that in a high signal-to-noise ratio (SNR) regime, MIMO-OWC offers both
large-scale diversity gain, governing the exponential decaying of the error
curve, and small-scale diversity gain, producing traditional power-law
decaying. Particularly for a two by two MIMO-OWC system with unipolar pulse
amplitude modulation (PAM), a closed-form solution to the design problem of a
linear FDSC optimizing both diversity gains is attained by taking advantage of
the available properties on the successive terms of Farey sequences in number
theory as well as by developing new properties on the disjoint intervals formed
by the Farey sequence terms to attack the continuous and discrete variables
mixed max-min design problem. In fact, this specific design not only proves
that a repetition code (RC) is the optimal linear FDSC optimizing both the
diversity gains, but also uncovers a significant difference between MIMO radio
frequency (RF) communications and MIMO-OWC that space dimension alone is
sufficient for a full large-scale diversity achievement. Computer simulations
demonstrate that FDSC substantially outperforms uncoded spatial multiplexing
with the same total optical power and spectral efficiency, and the latter
provides only the small-scale diversity gain.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 18:42:14 GMT"
}
] | 2015-09-25T00:00:00 |
[
[
"Zhang",
"Yan-Yu",
""
],
[
"Yu",
"Hong-Yi",
""
],
[
"Zhang",
"Jian-Kang",
""
],
[
"Zhu",
"Yi-Jun",
""
],
[
"Wang",
"Jin-Long",
""
],
[
"Wang",
"Tao",
""
]
] |
new_dataset
| 0.992837 |
0905.0440
|
Willie Harrison
|
Willie K Harrison and Steven W. McLaughlin
|
Tandem Coding and Cryptography on Wiretap Channels: EXIT Chart Analysis
|
11 pages, 5 figures, accepted at 2009 IEEE International Symposium on
Information Theory (ISIT 2009)
| null |
10.1109/ISIT.2009.5205606
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional cryptography assumes an eavesdropper receives an error-free copy
of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at
the physical layer both the intended receiver and the passive eavesdropper
inevitably receive an error-prone version of the transmitted message which must
be corrected prior to decryption. This paper considers the implications of
using both channel and cryptographic codes under the wiretap channel model in a
way that enhances the \emph{information-theoretic} security for the friendly
parties by keeping the information transfer to the eavesdropper small. We
consider a secret-key cryptographic system with a linear feedback shift
register (LFSR)-based keystream generator and observe the mutual information
between an LFSR-generated sequence and the received noise-corrupted ciphertext
sequence under a known-plaintext scenario. The effectiveness of a noniterative
fast correlation attack, which reduces the search time in a brute-force attack,
is shown to be correlated with this mutual information. For an iterative fast
correlation attack on this cryptographic system, it is shown that an EXIT chart
and mutual information are very good predictors of decoding success and failure
by a passive eavesdropper.
|
[
{
"version": "v1",
"created": "Mon, 4 May 2009 17:54:18 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Harrison",
"Willie K",
""
],
[
"McLaughlin",
"Steven W.",
""
]
] |
new_dataset
| 0.994277 |
1508.05497
|
S. Akshay
|
Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S.
Akshay
|
Skolem Functions for Factored Formulas
|
Full version of FMCAD 2015 conference publication
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a propositional formula F(x,y), a Skolem function for x is a function
\Psi(y), such that substituting \Psi(y) for x in F gives a formula semantically
equivalent to \exists F. Automatically generating Skolem functions is of
significant interest in several applications including certified QBF solving,
finding strategies of players in games, synthesising circuits and bit-vector
programs from specifications, disjunctive decomposition of sequential circuits
etc. In many such applications, F is given as a conjunction of factors, each of
which depends on a small subset of variables. Existing algorithms for Skolem
function generation ignore any such factored form and treat F as a monolithic
function. This presents scalability hurdles in medium to large problem
instances. In this paper, we argue that exploiting the factored form of F can
give significant performance improvements in practice when computing Skolem
functions. We present a new CEGAR style algorithm for generating Skolem
functions from factored propositional formulas. In contrast to earlier work,
our algorithm neither requires a proof of QBF satisfiability nor uses
composition of monolithic conjunctions of factors. We show experimentally that
our algorithm generates smaller Skolem functions and outperforms
state-of-the-art approaches on several large benchmarks.
|
[
{
"version": "v1",
"created": "Sat, 22 Aug 2015 11:23:27 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Sep 2015 18:41:26 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"John",
"Ajith K.",
""
],
[
"Shah",
"Shetal",
""
],
[
"Chakraborty",
"Supratik",
""
],
[
"Trivedi",
"Ashutosh",
""
],
[
"Akshay",
"S.",
""
]
] |
new_dataset
| 0.994937 |
1509.00025
|
Markus Vogt
|
Markus Vogt, Gerald Hempel, Jeronimo Castrillon, Christian Hochberger
|
GCC-Plugin for Automated Accelerator Generation and Integration on
Hybrid FPGA-SoCs
|
Presented at Second International Workshop on FPGAs for Software
Programmers (FSP 2015) (arXiv:1508.06320)
| null | null |
FSP/2015/17
|
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, architectures combining a reconfigurable fabric and a
general purpose processor on a single chip became increasingly popular. Such
hybrid architectures allow extending embedded software with application
specific hardware accelerators to improve performance and/or energy efficiency.
Aiding system designers and programmers at handling the complexity of the
required process of hardware/software (HW/SW) partitioning is an important
issue. Current methods are often restricted, either to bare-metal systems, to
subsets of mainstream programming languages, or require special coding
guidelines, e.g., via annotations. These restrictions still represent a high
entry barrier for the wider community of programmers that new hybrid
architectures are intended for. In this paper we revisit HW/SW partitioning and
present a seamless programming flow for unrestricted, legacy C code. It
consists of a retargetable GCC plugin that automatically identifies code
sections for hardware acceleration and generates code accordingly. The proposed
workflow was evaluated on the Xilinx Zynq platform using unmodified code from
an embedded benchmark suite.
|
[
{
"version": "v1",
"created": "Fri, 28 Aug 2015 09:15:49 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Sep 2015 11:35:57 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Vogt",
"Markus",
""
],
[
"Hempel",
"Gerald",
""
],
[
"Castrillon",
"Jeronimo",
""
],
[
"Hochberger",
"Christian",
""
]
] |
new_dataset
| 0.989389 |
1509.06774
|
Zhihan Lv
|
Zhihan Lv
|
Preprint: Bringing immersive enjoyment to hyperbaric oxygen chamber
users using virtual reality glasses
|
This is the preprint version of our paper on REHAB2015
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the preprint version of our paper on REHAB2015. This paper proposed a
novel immersive entertainment system for the users of hyperbaric oxygen therapy
chamber. The system is a hybrid of hardware and software, the scheme is
described in this paper. The hardware is combined by a HMD (i.e. virtual
reality glasses shell), a smartphone and a waterproof bag. The software is able
to transfer the stereoscopic images of the 3D game to the screen of the
smartphone synchronously. The comparison and selection of the hardware are
discussed according to the practical running scene of the clinical hyperbaric
oxygen treatment. Finally, a preliminary guideline for designing this kind of
system is raised accordingly.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2015 20:35:54 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Lv",
"Zhihan",
""
]
] |
new_dataset
| 0.964499 |
1509.06813
|
Kim-Kwang Raymond Choo
|
Junghyun Nam and Kim-Kwang Raymond Choo and Sangchul Han and Moonseong
Kim and Juryon Paik and Dongho Won
|
Efficient and Anonymous Two-Factor User Authentication in Wireless
Sensor Networks: Achieving User Anonymity with Lightweight Sensor Computation
| null |
PLoS ONE 10(4): e0116709, 2015
|
10.1371/journal.pone.0116709
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A smart-card-based user authentication scheme for wireless sensor networks
(hereafter referred to as a SCA-WSN scheme) is designed to ensure that only
users who possess both a smart card and the corresponding password are allowed
to gain access to sensor data and their transmissions. Despite many research
efforts in recent years, it remains a challenging task to design an efficient
SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN
schemes use only lightweight cryptographic techniques (rather than public-key
cryptographic techniques) for the sake of efficiency, and have been
demonstrated to suffer from the inability to provide user anonymity. Some
schemes employ elliptic curve cryptography for better security but require
sensors with strict resource constraints to perform computationally expensive
scalar-point multiplications; despite the increased computational requirements,
these schemes do not provide user anonymity. In this paper, we present a new
SCA-WSN scheme that not only achieves user anonymity but also is efficient in
terms of the computation loads for sensors. Our scheme employs elliptic curve
cryptography but restricts its use only to anonymous user-to-gateway
authentication, thereby allowing sensors to perform only lightweight
cryptographic operations. Our scheme also enjoys provable security in a formal
model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000)
model to capture the user anonymity property and various SCA-WSN specific
attacks (e.g., stolen smart card attacks, node capture attacks, privileged
insider attacks, and stolen verifier attacks).
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 00:08:31 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Nam",
"Junghyun",
""
],
[
"Choo",
"Kim-Kwang Raymond",
""
],
[
"Han",
"Sangchul",
""
],
[
"Kim",
"Moonseong",
""
],
[
"Paik",
"Juryon",
""
],
[
"Won",
"Dongho",
""
]
] |
new_dataset
| 0.981968 |
1509.06874
|
Dmitry Namiot
|
Dmitry Namiot
|
Twitter as a Transport Layer Platform
|
submitted to Fruct conference
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet messengers and social networks have become an integral part of
modern digital life. We have in mind not only the interaction between
individual users but also a variety of applications that exist in these
applications. Typically, applications for social networks use the universal
login system and rely on data from social networks. Also, such applications are
likely to get more traction when they are inside of the big social network like
Facebook. At the same time, less attention is paid to communication
capabilities of social networks. In this paper, we target Twitter as a
messaging system at the first hand. We describe the way information systems can
use Twitter as a transport layer for own services. Our work introduces a
programmable service called 411 for Twitter, which supports user-defined and
application-specific commands through tweets.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 08:13:30 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
]
] |
new_dataset
| 0.986781 |
1509.06889
|
Jia Liu
|
Jia Liu, Min Sheng, Yang Xu, Hongguang Sun, Xijun Wang and Xiaohong
Jiang
|
Throughput capacity of two-hop relay MANETs under finite buffers
| null | null |
10.1109/PIMRC.2014.7136358
| null |
cs.PF cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the seminal work of Grossglauser and Tse [1], the two-hop relay
algorithm and its variants have been attractive for mobile ad hoc networks
(MANETs) due to their simplicity and efficiency. However, most literature
assumed an infinite buffer size for each node, which is obviously not
applicable to a realistic MANET. In this paper, we focus on the exact
throughput capacity study of two-hop relay MANETs under the practical finite
relay buffer scenario. The arrival process and departure process of the relay
queue are fully characterized, and an ergodic Markov chain-based framework is
also provided. With this framework, we obtain the limiting distribution of the
relay queue and derive the throughput capacity under any relay buffer size.
Extensive simulation results are provided to validate our theoretical framework
and explore the relationship among the throughput capacity, the relay buffer
size and the number of nodes.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 08:57:32 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Liu",
"Jia",
""
],
[
"Sheng",
"Min",
""
],
[
"Xu",
"Yang",
""
],
[
"Sun",
"Hongguang",
""
],
[
"Wang",
"Xijun",
""
],
[
"Jiang",
"Xiaohong",
""
]
] |
new_dataset
| 0.972035 |
1509.06921
|
Jia Liu
|
Jia Liu, Yang Xu and Xiaohong Jiang
|
End-to-end delay in two hop relay MANETs with limited buffer
| null | null |
10.1109/CANDAR.2014.13
| null |
cs.PF cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite lots of literature has been dedicated to researching the delay
performance in two-hop relay (2HR) mobile ad hoc networks (MANETs), however,
they usually assume the buffer size of each node is infinite, so these studies
are not applicable to and thus may not reflect the real delay performance of a
practical MANET with limited buffer. To address this issue, in this paper we
explore the packet end-to-end delay in a 2HR MANET, where each node is equipped
with a bounded and shared relay-buffer for storing and forwarding packets of
all other flows. The transmission range of each node can be adjusted and a
group-based scheduling scheme is adopted to avoid interference between
simultaneous transmissions, meanwhile a handshake mechanism is added to the 2HR
routing algorithm to avoid packet loss. With the help of Markov Chain Theory
and Queuing Theory, we develop a new framework to fully characterize the packet
delivery processes, and obtain the relay-buffer blocking probability (RBP)
under any given exogenous packet input rate. Based on the RBP, we can compute
the packet queuing delay in its source node and delivery delay respectively,
and further derive the end-to-end delay in such a MANET with limited buffer.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 11:05:34 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Liu",
"Jia",
""
],
[
"Xu",
"Yang",
""
],
[
"Jiang",
"Xiaohong",
""
]
] |
new_dataset
| 0.999392 |
1509.06937
|
Tobias Kuhn
|
Kurt Winkler and Tobias Kuhn
|
Fully automatic multi-language translation with a catalogue of phrases -
successful employment for the Swiss avalanche bulletin
|
Extended version of a previous workshop paper (arXiv:1405.6103),
accepted for the journal Language Resources and Evaluation, Springer
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Swiss avalanche bulletin is produced twice a day in four languages. Due
to the lack of time available for manual translation, a fully automated
translation system is employed, based on a catalogue of predefined phrases and
predetermined rules of how these phrases can be combined to produce sentences.
Because this catalogue of phrases is limited to a small sublanguage, the system
is able to automatically translate such sentences from German into the target
languages French, Italian and English without subsequent proofreading or
correction. Having been operational for two winter seasons, we assess here the
quality of the produced texts based on two different surveys where participants
rated texts from real avalanche bulletins from both origins, the catalogue of
phrases versus manually written and translated texts. With a mean recognition
rate of 55%, users can hardly distinguish between thetwo types of texts, and
give very similar ratings with respect to their language quality. Overall, the
output from the catalogue system can be considered virtually equivalent to a
text written by avalanche forecasters and then manually translated by
professional translators. Furthermore, forecasters declared that all relevant
situations were captured by the system with sufficient accuracy. Forecaster's
working load did not change with the introduction of the catalogue: the extra
time to find matching sentences is compensated by the fact that they no longer
need to double-check manually translated texts. The reduction of daily
translation costs is expected to offset the initial development costs within a
few years.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 12:09:07 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Winkler",
"Kurt",
""
],
[
"Kuhn",
"Tobias",
""
]
] |
new_dataset
| 0.952373 |
1509.06948
|
Konrad Kulakowski
|
Konrad Ku{\l}akowski
|
Dynamic concurrent van Emde Boas array
|
18 pages, 4 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing popularity of shared-memory multiprocessor machines has caused
significant changes in the design of concurrent software. In this approach, the
concurrently running threads communicate and synchronize with each other
through data structures in shared memory. Hence, the efficiency of these
structures is essential for the performance of concurrent applications. The
need to find new concurrent data structures prompted the author some time ago
to propose the cvEB array modeled on the van Emde Boas Tree structure as a
dynamic set alternative. This paper describes an improved version of that
structure - the dcvEB array (Dynamic Concurrent van Emde Boas Array). One of
the improvements involves memory usage optimization. This enhancement required
the design of a tree which grows and shrinks at both: the top (root) and the
bottom (leaves) level. Another enhancement concerns the successor (and
predecessor) search strategy. The tests performed seem to confirm the high
performance of the dcvEB array. They are especially visible when the range of
keys is significantly larger than the number of elements in the collection.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 12:53:59 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Kułakowski",
"Konrad",
""
]
] |
new_dataset
| 0.994183 |
1509.07075
|
Siddhant Ahuja
|
Siddhant Ahuja, Peter Iles, Steven L. Waslander
|
3D Scan Registration using Curvelet Features in Planetary Environments
|
27 pages in Journal of Field Robotics, 2015
| null |
10.1002/rob.21616
| null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Topographic mapping in planetary environments relies on accurate 3D scan
registration methods. However, most global registration algorithms relying on
features such as FPFH and Harris-3D show poor alignment accuracy in these
settings due to the poor structure of the Mars-like terrain and variable
resolution, occluded, sparse range data that is hard to register without some
a-priori knowledge of the environment. In this paper, we propose an alternative
approach to 3D scan registration using the curvelet transform that performs
multi-resolution geometric analysis to obtain a set of coefficients indexed by
scale (coarsest to finest), angle and spatial position. Features are detected
in the curvelet domain to take advantage of the directional selectivity of the
transform. A descriptor is computed for each feature by calculating the 3D
spatial histogram of the image gradients, and nearest neighbor based matching
is used to calculate the feature correspondences. Correspondence rejection
using Random Sample Consensus identifies inliers, and a locally optimal
Singular Value Decomposition-based estimation of the rigid-body transformation
aligns the laser scans given the re-projected correspondences in the metric
space. Experimental results on a publicly available data-set of planetary
analogue indoor facility, as well as simulated and real-world scans from Neptec
Design Group's IVIGMS 3D laser rangefinder at the outdoor CSA Mars yard
demonstrates improved performance over existing methods in the challenging
sparse Mars-like terrain.
|
[
{
"version": "v1",
"created": "Wed, 23 Sep 2015 17:51:03 GMT"
}
] | 2015-09-24T00:00:00 |
[
[
"Ahuja",
"Siddhant",
""
],
[
"Iles",
"Peter",
""
],
[
"Waslander",
"Steven L.",
""
]
] |
new_dataset
| 0.996155 |
1506.00950
|
Zoltan Gingl
|
Gergely Vadai, Robert Mingesz and Zoltan Gingl
|
Generalized Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchange
system using arbitrary resistors
| null |
Scientific Reports 5, 13653 (2015)
|
10.1038/srep13653
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchange system has been
introduced as a simple, very low cost and efficient classical physical
alternative to quantum key distribution systems. The ideal system uses only a
few electronic components - identical resistor pairs, switches and
interconnecting wires - to guarantee perfectly protected data transmission. We
show that a generalized KLJN system can provide unconditional security even if
it is used with significantly less limitations. The more universal conditions
ease practical realizations considerably and support more robust protection
against attacks. Our theoretical results are confirmed by numerical
simulations.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2015 16:34:36 GMT"
}
] | 2015-09-23T00:00:00 |
[
[
"Vadai",
"Gergely",
""
],
[
"Mingesz",
"Robert",
""
],
[
"Gingl",
"Zoltan",
""
]
] |
new_dataset
| 0.994477 |
1506.08259
|
Afshin Rahimi
|
Afshin Rahimi, Trevor Cohn, and Timothy Baldwin
|
Twitter User Geolocation Using a Unified Text and Network Prediction
Model
|
To appear in ACL 2015, Proceedings of the 53rd Annual Meeting of the
Association for Computational Linguistics (ACL 2015)
| null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a label propagation approach to geolocation prediction based on
Modified Adsorption, with two enhancements:(1) the removal of "celebrity" nodes
to increase location homophily and boost tractability, and (2) he incorporation
of text-based geolocation priors for test users. Experiments over three Twitter
benchmark datasets achieve state-of-the-art results, and demonstrate the
effectiveness of the enhancements.
|
[
{
"version": "v1",
"created": "Sat, 27 Jun 2015 04:51:18 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2015 00:43:39 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Sep 2015 01:14:20 GMT"
}
] | 2015-09-23T00:00:00 |
[
[
"Rahimi",
"Afshin",
""
],
[
"Cohn",
"Trevor",
""
],
[
"Baldwin",
"Timothy",
""
]
] |
new_dataset
| 0.99157 |
1509.06524
|
Maurizio Naldi
|
Maurizio Naldi, Giuseppe D'Acquisto
|
Option contracts for a privacy-aware market
| null | null | null | null |
cs.CR q-fin.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppliers (including companies and individual prosumers) may wish to protect
their private information when selling items they have in stock. A market is
envisaged where private information can be protected through the use of
differential privacy and option contracts, while privacy-aware suppliers
deliver their stock at a reduced price. In such a marketplace a broker acts as
intermediary between privacy-aware suppliers and end customers, providing the
extra items possibly needed to fully meet the customers' demand, while end
customers book the items they need through an option contract. All stakeholders
may benefit from such a marketplace. A formula is provided for the option
price, and a budget equation is set for the mechanism to be profitable for the
broker/producer.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2015 09:34:39 GMT"
}
] | 2015-09-23T00:00:00 |
[
[
"Naldi",
"Maurizio",
""
],
[
"D'Acquisto",
"Giuseppe",
""
]
] |
new_dataset
| 0.998604 |
1404.5501
|
Min Ye
|
Min Ye, Alexander Barg
|
Polar Codes for Distributed Hierarchical Source Coding
|
14 pages
|
Advances in Mathematics of Communication, 9, no.1, 2015, 87-103
|
10.3934/amc.2015.9.87
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that polar codes can be used to achieve the rate-distortion functions
in the problem of hierarchical source coding also known as the successive
refinement problem. We also analyze the distributed version of this problem,
constructing a polar coding scheme that achieves the rate distortion functions
for successive refinement with side information.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 14:00:54 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Ye",
"Min",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.999507 |
1404.6822
|
Steve Schneider
|
Chris Culnane, Peter Y. A. Ryan, Steve Schneider, Vanessa Teague
|
vVote: a Verifiable Voting System
|
Previously titled "Draft Technical Report for VEC vVote System"
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Pret a Voter cryptographic voting system was designed to be flexible and
to offer voters a familiar and easy voting experience. In this paper we present
a case study of our efforts to adapt Pret a Voter to the idiosyncrasies of
elections in the Australian state of Victoria. This technical report includes
general background, user experience and details of the cryptographic protocols
and human processes. We explain the problems, present solutions, then analyse
their security properties and explain how they tie in to other design
decisions. We hope this will be an interesting case study on the application of
end-to-end verifiable voting protocols to real elections.
A preliminary version of this paper appeared as the 10th February 2014
version of "Draft Technical Report for VEC vVote System".
The team involved in developing the vVote design described in this report
were: Craig Burton, Chris Culnane, James Heather, Rui Joaquim, Peter Y. A.
Ryan, Steve Schneider and Vanessa Teague.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 20:28:25 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Jun 2014 23:06:15 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Sep 2014 11:30:23 GMT"
},
{
"version": "v4",
"created": "Sun, 20 Sep 2015 22:18:07 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Culnane",
"Chris",
""
],
[
"Ryan",
"Peter Y. A.",
""
],
[
"Schneider",
"Steve",
""
],
[
"Teague",
"Vanessa",
""
]
] |
new_dataset
| 0.989772 |
1409.8563
|
Daniel Ruprecht
|
Andrea Arteaga, Daniel Ruprecht, Rolf Krause
|
A stencil-based implementation of Parareal in the C++ domain specific
embedded language STELLA
| null |
Applied Mathematics and Computation 267, pp. 727-741, 2015
|
10.1016/j.amc.2014.12.055
| null |
cs.DC math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In view of the rapid rise of the number of cores in modern supercomputers,
time-parallel methods that introduce concurrency along the temporal axis are
becoming increasingly popular. For the solution of time-dependent partial
differential equations, these methods can add another direction for concurrency
on top of spatial parallelization. The paper presents an implementation of the
time-parallel Parareal method in a C++ domain specific language for stencil
computations (STELLA). STELLA provides both an OpenMP and a CUDA backend for a
shared memory parallelization, using the CPU or GPU inside a node for the
spatial stencils. Here, we intertwine this node-wise spatial parallelism with
the time-parallel Parareal. This is done by adding an MPI-based implementation
of Parareal, which allows us to parallelize in time across nodes. The
performance of Parareal with both backends is analyzed in terms of speedup,
parallel efficiency and energy-to-solution for an advection-diffusion problem
with a time-dependent diffusion coefficient.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2014 14:34:13 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Dec 2014 12:55:41 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Arteaga",
"Andrea",
""
],
[
"Ruprecht",
"Daniel",
""
],
[
"Krause",
"Rolf",
""
]
] |
new_dataset
| 0.987 |
1502.01188
|
Jimmy Nielsen
|
Jimmy J. Nielsen, Germ\'an C. Madue\~no, Nuno K. Pratas, Ren\'e B.
S{\o}rensen, \v{C}edomir Stefanovi\'c, Petar Popovski
|
What Can Wireless Cellular Technologies Do about the Upcoming Smart
Metering Traffic?
|
Submitted; change: corrected location of eSM box in Fig. 1; May 22,
2015: Major revision after review; v4: revised, accepted for publication
| null |
10.1109/MCOM.2015.7263371
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of smart electricity meters with cellular radio interface
puts an additional load on the wireless cellular networks. Currently, these
meters are designed for low duty cycle billing and occasional system check,
which generates a low-rate sporadic traffic. As the number of distributed
energy resources increases, the household power will become more variable and
thus unpredictable from the viewpoint of the Distribution System Operator
(DSO). It is therefore expected, in the near future, to have an increased
number of Wide Area Measurement System (WAMS) devices with Phasor Measurement
Unit (PMU)-like capabilities in the distribution grid, thus allowing the
utilities to monitor the low voltage grid quality while providing information
required for tighter grid control. From a communication standpoint, the traffic
profile will change drastically towards higher data volumes and higher rates
per device. In this paper, we characterize the current traffic generated by
smart electricity meters and supplement it with the potential traffic
requirements brought by introducing enhanced Smart Meters, i.e., meters with
PMU-like capabilities. Our study shows how GSM/GPRS and LTE cellular system
performance behaves with the current and next generation smart meters traffic,
where it is clearly seen that the PMU data will seriously challenge these
wireless systems. We conclude by highlighting the possible solutions for
upgrading the cellular standards, in order to cope with the upcoming smart
metering traffic.
|
[
{
"version": "v1",
"created": "Wed, 4 Feb 2015 13:21:06 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Feb 2015 14:41:46 GMT"
},
{
"version": "v3",
"created": "Fri, 22 May 2015 08:21:29 GMT"
},
{
"version": "v4",
"created": "Wed, 1 Jul 2015 12:43:50 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Nielsen",
"Jimmy J.",
""
],
[
"Madueño",
"Germán C.",
""
],
[
"Pratas",
"Nuno K.",
""
],
[
"Sørensen",
"René B.",
""
],
[
"Stefanović",
"Čedomir",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.99641 |
1504.02789
|
Ashesh Jain
|
Ashesh Jain, Hema S. Koppula, Bharad Raghavan, Shane Soh, Ashutosh
Saxena
|
Car that Knows Before You Do: Anticipating Maneuvers via Learning
Temporal Driving Models
|
ICCV 2015, http://brain4cars.com
| null | null | null |
cs.CV
|
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 anticipate driving maneuvers a few seconds before they occur.
For this purpose we equip a car with cameras and a computing device to capture
the driving context from both inside and outside of the car. We propose an
Autoregressive Input-Output HMM to model the contextual information alongwith
the maneuvers. We evaluate our approach on 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 with over 80\% F1-score in real-time.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2015 20:52:40 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Sep 2015 05:30:47 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Jain",
"Ashesh",
""
],
[
"Koppula",
"Hema S.",
""
],
[
"Raghavan",
"Bharad",
""
],
[
"Soh",
"Shane",
""
],
[
"Saxena",
"Ashutosh",
""
]
] |
new_dataset
| 0.989776 |
1504.04319
|
John Baillieul
|
John Baillieul, Bowen Zhang, Shuai Wang
|
The Kirchhoff-Braess Paradox and Its Implications for Smart Microgrids
|
11 pages, 7 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Well known in the theory of network flows, Braess paradox states that in a
congested network, it may happen that adding a new path between destinations
can increase the level of congestion. In transportation networks the phenomenon
results from the decisions of network participants who selfishly seek to
optimize their own performance metrics. In an electric power distribution
network, an analogous increase in congestion can arise as a consequence
Kirchhoff's laws. Even for the simplest linear network of resistors and voltage
sources, the sudden appearance of congestion due to an additional conductive
line is a nonlinear phenomenon that results in a discontinuous change in the
network state. It is argued that the phenomenon can occur in almost any grid in
which they are loops, and with the increasing penetration of small-scale
distributed generation it suggests challenges ahead in the operation of
microgrids.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 17:44:26 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Sep 2015 14:53:21 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Baillieul",
"John",
""
],
[
"Zhang",
"Bowen",
""
],
[
"Wang",
"Shuai",
""
]
] |
new_dataset
| 0.962424 |
1509.03870
|
Mortaza Doulaty
|
Raymond W. M. Ng, Mortaza Doulaty, Rama Doddipatla, Wilker Aziz,
Kashif Shah, Oscar Saz, Madina Hasan, Ghada AlHarbi, Lucia Specia, Thomas
Hain
|
The USFD Spoken Language Translation System for IWSLT 2014
| null |
Proc. of 11th International Workshop on Spoken Language
Translation (SLT 2014) 86-91, Lake Tahoe, USA, December 4th and 5th, 2014
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The University of Sheffield (USFD) participated in the International Workshop
for Spoken Language Translation (IWSLT) in 2014. In this paper, we will
introduce the USFD SLT system for IWSLT. Automatic speech recognition (ASR) is
achieved by two multi-pass deep neural network systems with adaptation and
rescoring techniques. Machine translation (MT) is achieved by a phrase-based
system. The USFD primary system incorporates state-of-the-art ASR and MT
techniques and gives a BLEU score of 23.45 and 14.75 on the English-to-French
and English-to-German speech-to-text translation task with the IWSLT 2014 data.
The USFD contrastive systems explore the integration of ASR and MT by using a
quality estimation system to rescore the ASR outputs, optimising towards better
translation. This gives a further 0.54 and 0.26 BLEU improvement respectively
on the IWSLT 2012 and 2014 evaluation data.
|
[
{
"version": "v1",
"created": "Sun, 13 Sep 2015 16:58:41 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Ng",
"Raymond W. M.",
""
],
[
"Doulaty",
"Mortaza",
""
],
[
"Doddipatla",
"Rama",
""
],
[
"Aziz",
"Wilker",
""
],
[
"Shah",
"Kashif",
""
],
[
"Saz",
"Oscar",
""
],
[
"Hasan",
"Madina",
""
],
[
"AlHarbi",
"Ghada",
""
],
[
"Specia",
"Lucia",
""
],
[
"Hain",
"Thomas",
""
]
] |
new_dataset
| 0.971385 |
1509.05807
|
Vincent Vajnovszki
|
Sergey Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent
Vajnovszki
|
Gray coding planar maps
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea of (combinatorial) Gray codes is to list objects in question in such
a way that two successive objects differ in some pre-specified small way. In
this paper, we utilize beta-description trees to cyclicly Gray code three
classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic
planar maps, and cubic non-separable planar maps.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 21:50:18 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Avgustinovich",
"Sergey",
""
],
[
"Kitaev",
"Sergey",
""
],
[
"Potapov",
"Vladimir N.",
""
],
[
"Vajnovszki",
"Vincent",
""
]
] |
new_dataset
| 0.986234 |
1509.05897
|
Xu Yang
|
Xu Yang
|
Face Photo Sketch Synthesis via Larger Patch and Multiresolution Spline
| null | null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Face photo sketch synthesis has got some researchers' attention in recent
years because of its potential applications in digital entertainment and law
enforcement. Some patches based methods have been proposed to solve this
problem. These methods usually focus more on how to get a sketch patch for a
given photo patch than how to blend these generated patches. However, without
appropriately blending method, some jagged parts and mottled points will appear
in the entire face sketch. In order to get a smoother sketch, we propose a new
method to reduce such jagged parts and mottled points. In our system, we resort
to an existed method, which is Markov Random Fields (MRF), to train a crude
face sketch firstly. Then this crude sketch face sketch will be divided into
some larger patches again and retrained by Non-Negative Matrix Factorization
(NMF). At last, we use Multiresolution Spline and a blend trick named
full-coverage trick to blend these retrained patches. The experiment results
show that compared with some previous method, we can get a smoother face
sketch.
|
[
{
"version": "v1",
"created": "Sat, 19 Sep 2015 14:20:50 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Yang",
"Xu",
""
]
] |
new_dataset
| 0.99248 |
1509.05935
|
Shang-Tse Chen
|
Paras Jain, Shang-Tse Chen, Mozhgan Azimpourkivi, Duen Horng Chau,
Bogdan Carbunar
|
Spotting Suspicious Reviews via (Quasi-)clique Extraction
|
Appeared in IEEE Symposium on Security and Privacy 2015
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How to tell if a review is real or fake? What does the underworld of
fraudulent reviewing look like? Detecting suspicious reviews has become a major
issue for many online services. We propose the use of a clique-finding approach
to discover well-organized suspicious reviewers. From a Yelp dataset with over
one million reviews, we construct multiple Reviewer Similarity graphs to link
users that have unusually similar behavior: two reviewers are connected in the
graph if they have reviewed the same set of venues within a few days. From
these graphs, our algorithms extracted many large cliques and quasi-cliques,
the largest one containing a striking 11 users who coordinated their review
activities in identical ways. Among the detected cliques, a large portion
contain Yelp Scouts who are paid by Yelp to review venues in new areas. Our
work sheds light on their little-known operation.
|
[
{
"version": "v1",
"created": "Sat, 19 Sep 2015 21:01:38 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Jain",
"Paras",
""
],
[
"Chen",
"Shang-Tse",
""
],
[
"Azimpourkivi",
"Mozhgan",
""
],
[
"Chau",
"Duen Horng",
""
],
[
"Carbunar",
"Bogdan",
""
]
] |
new_dataset
| 0.968545 |
1509.06019
|
Abraham Kabore Wendyida
|
Abraham Kabore, Vahid Meghdadi, Jean-Pierre Cances
|
LT Codes Combined with Network Coding for Multihop Powerline Smart Grid
Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a novel approach for combining Luby Transform (LT) codes
and Network Coding (NC) in the context of PowerLine Communications (PLC) smart
grid networks. Multihop transmissions of LT-encoded data on PLC networks are
considered and algorithms to combine data at relay nodes are proposed. Without
the need to decode and then re-encode the total received data stream, the relay
nodes can forward the received data stream while adding at the same time their
own data. Simulation results are provided confirming the good performance of
the proposed algorithms.
|
[
{
"version": "v1",
"created": "Sun, 20 Sep 2015 14:15:25 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Kabore",
"Abraham",
""
],
[
"Meghdadi",
"Vahid",
""
],
[
"Cances",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.981475 |
1509.06080
|
EPTCS
|
Alessandro Coglio
|
Second-Order Functions and Theorems in ACL2
|
In Proceedings ACL2 2015, arXiv:1509.05526
|
EPTCS 192, 2015, pp. 17-33
|
10.4204/EPTCS.192.3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SOFT ('Second-Order Functions and Theorems') is a tool to mimic second-order
functions and theorems in the first-order logic of ACL2. Second-order functions
are mimicked by first-order functions that reference explicitly designated
uninterpreted functions that mimic function variables. First-order theorems
over these second-order functions mimic second-order theorems universally
quantified over function variables. Instances of second-order functions and
theorems are systematically generated by replacing function variables with
functions. SOFT can be used to carry out program refinement inside ACL2, by
constructing a sequence of increasingly stronger second-order predicates over
one or more target functions: the sequence starts with a predicate that
specifies requirements for the target functions, and ends with a predicate that
provides executable definitions for the target functions.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 00:34:48 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Coglio",
"Alessandro",
""
]
] |
new_dataset
| 0.989663 |
1509.06081
|
EPTCS
|
John Cowles (University of Wyoming), Ruben Gamboa (University of
Wyoming)
|
Perfect Numbers in ACL2
|
In Proceedings ACL2 2015, arXiv:1509.05526
|
EPTCS 192, 2015, pp. 53-59
|
10.4204/EPTCS.192.5
| null |
cs.LO math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A perfect number is a positive integer n such that n equals the sum of all
positive integer divisors of n that are less than n. That is, although n is a
divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but
12 < 1 + 2 + 3 + 4 + 6 is not perfect. An ACL2 theory of perfect numbers is
developed and used to prove, in ACL2(r), this bit of mathematical folklore:
Even if there are infinitely many perfect numbers the series of the reciprocals
of all perfect numbers converges.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 00:35:06 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Cowles",
"John",
"",
"University of Wyoming"
],
[
"Gamboa",
"Ruben",
"",
"University of\n Wyoming"
]
] |
new_dataset
| 0.998917 |
1509.06109
|
Dustin Freeman
|
Dustin Freeman, Ricardo Jota, Daniel Vogel, Daniel Wigdor, Ravin
Balakrishnan
|
A Dataset of Naturally Occurring, Whole-Body Background Activity to
Reduce Gesture Conflicts
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In real settings, natural body movements can be erroneously recognized by
whole-body input systems as explicit input actions. We call body activity not
intended as input actions "background activity." We argue that understanding
background activity is crucial to the success of always-available whole-body
input in the real world. To operationalize this argument, we contribute a
reusable study methodology and software tools to generate standardized
background activity datasets composed of data from multiple Kinect cameras, a
Vicon tracker, and two high-definition video cameras. Using our methodology, we
create an example background activity dataset for a television-oriented living
room setting. We use this dataset to demonstrate how it can be used to redesign
a gestural interaction vocabulary to minimize conflicts with the real world.
The software tools and initial living room dataset are publicly available
(http://www.dgp.toronto.edu/~dustin/backgroundactivity/).
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 04:40:31 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Freeman",
"Dustin",
""
],
[
"Jota",
"Ricardo",
""
],
[
"Vogel",
"Daniel",
""
],
[
"Wigdor",
"Daniel",
""
],
[
"Balakrishnan",
"Ravin",
""
]
] |
new_dataset
| 0.999698 |
1509.06110
|
Jianqing Zhang Master
|
Yang Yi, Zhou Geng, Zhang Jianqing, Cheng Siyuan, Fu Mengyin
|
Design, Modeling and Control of A Novel Amphibious Robot with
Dual-swing-legs Propulsion Mechanism
|
8 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a novel amphibious robot, which adopts a dual-swing-legs
propulsion mechanism, proposing a new locomotion mode. The robot is called
FroBot, since its structure and locomotion are similar to frogs. Our
inspiration comes from the frog scooter and breaststroke. Based on its swing
leg mechanism, an unusual universal wheel structure is used to generate
propulsion on land, while a pair of flexible caudal fins functions like the
foot flippers of a frog to generate similar propulsion underwater. On the basis
of the prototype design and the dynamic model of the robot, some locomotion
control simulations and experiments were conducted for the purpose of adjusting
the parameters that affect the propulsion of the robot. Finally, a series of
underwater experiments were performed to verify the design feasibility of
FroBot and the rationality of the control algorithm.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 04:44:26 GMT"
}
] | 2015-09-22T00:00:00 |
[
[
"Yi",
"Yang",
""
],
[
"Geng",
"Zhou",
""
],
[
"Jianqing",
"Zhang",
""
],
[
"Siyuan",
"Cheng",
""
],
[
"Mengyin",
"Fu",
""
]
] |
new_dataset
| 0.973446 |
1311.6331
|
Colm \'O D\'unlaing
|
Colm \'O D\'unlaing
|
Compact families of Jordan curves and convex hulls in three dimensions
|
49 pages, 20 figures
| null | null |
TCDMATH 13-15
|
cs.CG math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that for certain families of semi-algebraic convex bodies in 3
dimensions, the convex hull of $n$ disjoint bodies has $O(n\lambda_s(n))$
features, where $s$ is a constant depending on the family: $\lambda_s(n)$ is
the maximum length of order-$s$ Davenport-Schinzel sequences with $n$ letters.
The argument is based on an apparently new idea of `compact families' of convex
bodies or discs, and of `crossing content' of disc intersections.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 15:20:34 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Nov 2013 17:39:13 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Sep 2015 09:13:49 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Dúnlaing",
"Colm Ó",
""
]
] |
new_dataset
| 0.99581 |
1504.04859
|
\"Ozlem Salehi
|
\"Ozlem Salehi, A.C. Cem Say
|
Homing Vector Automata
|
NCMA'15
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce homing vector automata, which are finite automata augmented by a
vector that is multiplied at each step by a matrix determined by the current
transition, and have to return the vector to its original setting in order to
accept the input. The computational power of the deterministic,
nondeterministic and blind versions of these real-time machines are examined
and compared to various related types of automata. A generalized version of the
Stern-Brocot encoding method, suitable for representing strings on arbitrary
alphabets, is also developed.
|
[
{
"version": "v1",
"created": "Sun, 19 Apr 2015 17:04:31 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Sep 2015 09:41:08 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Salehi",
"Özlem",
""
],
[
"Say",
"A. C. Cem",
""
]
] |
new_dataset
| 0.995226 |
1507.08467
|
David Sousa-Rodrigues
|
Cristian Jimenez-Romero and David Sousa-Rodrigues and Jeffrey H.
Johnson and Vitorino Ramos
|
A Model for Foraging Ants, Controlled by Spiking Neural Networks and
Double Pheromones
|
This work has been accepted for presentation at the UK Workshop on
Computational Intelligence --- University of Exeter, September 2015
http://www.ukci2015.ex.ac.uk/
| null | null | null |
cs.NE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A model of an Ant System where ants are controlled by a spiking neural
circuit and a second order pheromone mechanism in a foraging task is presented.
A neural circuit is trained for individual ants and subsequently the ants are
exposed to a virtual environment where a swarm of ants performed a resource
foraging task. The model comprises an associative and unsupervised learning
strategy for the neural circuit of the ant. The neural circuit adapts to the
environment by means of classical conditioning. The initially unknown
environment includes different types of stimuli representing food and obstacles
which, when they come in direct contact with the ant, elicit a reflex response
in the motor neural system of the ant: moving towards or away from the source
of the stimulus. The ants are released on a landscape with multiple food
sources where one ant alone would have difficulty harvesting the landscape to
maximum efficiency. The introduction of a double pheromone mechanism yields
better results than traditional ant colony optimization strategies. Traditional
ant systems include mainly a positive reinforcement pheromone. This approach
uses a second pheromone that acts as a marker for forbidden paths (negative
feedback). This blockade is not permanent and is controlled by the evaporation
rate of the pheromones. The combined action of both pheromones acts as a
collective stigmergic memory of the swarm, which reduces the search space of
the problem. This paper explores how the adaptation and learning abilities
observed in biologically inspired cognitive architectures is synergistically
enhanced by swarm optimization strategies. The model portraits two forms of
artificial intelligent behaviour: at the individual level the spiking neural
network is the main controller and at the collective level the pheromone
distribution is a map towards the solution emerged by the colony.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 11:57:54 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Aug 2015 09:25:03 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Sep 2015 14:17:39 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Jimenez-Romero",
"Cristian",
""
],
[
"Sousa-Rodrigues",
"David",
""
],
[
"Johnson",
"Jeffrey H.",
""
],
[
"Ramos",
"Vitorino",
""
]
] |
new_dataset
| 0.950606 |
1508.02052
|
Farooq Khan
|
Farooq Khan
|
Coreless 5G Mobile Network
|
7 pages, 5 Figures, 1 Table
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Todays mobile networks contain an increasing variety of proprietary hardware
stifling innovation and leading to longer time-to-market for introduction of
new services. We propose to replace the mobile core network nodes and
interfaces with an Open Source SW implementation running on general purpose
commodity hardware. The proposed open source approach referred to as coreless
mobile network is expected to reduce cost, increase flexibility, improve
innovation speed and accelerate time-to-market for introduction of new features
and functionalities. A common Open Source SW framework will also enable
automatic discovery and selection, seamless data mobility as well as unified
charging and billing across cellular, WiFi, UAV and satellite access networks.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 17:38:06 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Sep 2015 14:58:59 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Khan",
"Farooq",
""
]
] |
new_dataset
| 0.998543 |
1509.02200
|
Mojtaba Vaezi
|
Mojtaba Vaezi and H. Vincent Poor
|
The Capacity Region of the One-Sided Gaussian Interference Channel
|
This paper has been withdrawn due to a flaw in the proof of the outer
bound
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity region of the one-sided Gaussian interference channel is
established in the weak interference regime. To characterize this region, a new
representation of the Han-Kobayashi inner bound for the one-sided Gaussian
interference channel is first given. Next, a new outer bound on the capacity
region of this channel is introduced which is tight in the weak interference
regime. This is the first capacity region for any variant of the interference
channel in the weak interference regime.
|
[
{
"version": "v1",
"created": "Mon, 7 Sep 2015 21:27:47 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Sep 2015 15:24:46 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Vaezi",
"Mojtaba",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.997762 |
1509.04207
|
Lse Lse
|
Mart\'in Dias (RMOD), Guillermo Polito (RMOD), Damien Cassou (RMOD),
St\'ephane Ducasse (RMOD)
|
DeltaImpactFinder: Assessing Semantic Merge Conflicts with Dependency
Analysis
|
International Workshop on Smalltalk Technologies 2015, Jul 2015,
Brescia, Italy
| null |
10.1145/2811237.2811299
| null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In software development, version control systems (VCS) provide branching and
merging support tools. Such tools are popular among developers to concurrently
change a code-base in separate lines and reconcile their changes automatically
afterwards. However, two changes that are correct independently can introduce
bugs when merged together. We call semantic merge conflicts this kind of bugs.
Change impact analysis (CIA) aims at estimating the effects of a change in a
codebase. In this paper, we propose to detect semantic merge conflicts using
CIA. On a merge, DELTAIMPACTFINDER analyzes and compares the impact of a change
in its origin and destination branches. We call the difference between these
two impacts the delta-impact. If the delta-impact is empty, then there is no
indicator of a semantic merge conflict and the merge can continue
automatically. Otherwise, the delta-impact contains what are the sources of
possible conflicts.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 17:10:45 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Dias",
"Martín",
"",
"RMOD"
],
[
"Polito",
"Guillermo",
"",
"RMOD"
],
[
"Cassou",
"Damien",
"",
"RMOD"
],
[
"Ducasse",
"Stéphane",
"",
"RMOD"
]
] |
new_dataset
| 0.979993 |
1509.05421
|
Jason Koh
|
Jason Koh, Bharathan Balaji, Rajesh Gupta, and Yuvraj Agarwal
|
HVACMeter: Apportionment of HVAC Power to Thermal Zones and Air Handler
Units
| null | null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Heating, Ventilation and Air Conditioning (HVAC) systems consume almost half
of the total energy use of commercial buildings. To optimize HVAC energy usage,
it is important to understand the energy consumption of individual HVAC
components at fine granularities. However, buildings typically only have
aggregate building level power and thermal meters. We present HVACMeter, a
system which leverages existing sensors in commercial HVAC systems to estimate
the energy consumed by individual components of the HVAC system, as well by
each thermal zone in buildings. HVACMeter can be generalized to any HVAC system
as it uses the basic understanding of HVAC operation, heat transfer equations,
and historical sensor data to estimate energy. We deploy HVACMeter to three
buildings on our campus, to identify the set of sensors that are important for
accurately disaggregating energy use at the level of each Air Handler Unit and
each thermal zone within these buildings. HVACMeter power estimations have on
an average 44.5 % less RMSE than that of mean power estimates. Furthermore, we
highlight the usefulness of HVACMeter energy estimation model for a building
fault detection application by quantifying the amount of energy that can be
saved by fixing particular faults.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 20:17:56 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Koh",
"Jason",
""
],
[
"Balaji",
"Bharathan",
""
],
[
"Gupta",
"Rajesh",
""
],
[
"Agarwal",
"Yuvraj",
""
]
] |
new_dataset
| 0.996753 |
1509.05452
|
Anant Baijal
|
Anant Baijal, Julia Kim, Carmen Branje, Frank Russo, Deborah I. Fels
|
Composing vibrotactile music: A multisensory experience with the
Emoti-chair
|
IEEE HAPTICS Symposium 2012
| null |
10.1109/HAPTIC.2012.6183839
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Emoti-Chair is a novel technology to enhance entertainment through
vibrotactile stimulation. We assessed the experience of this technology in two
workshops. In the first workshop, deaf film-makers experimented with creating
vibetracks for a movie clip using a professional movie editing software. In the
second workshop, trained opera singers sang and felt their voice through the
Emoti-Chair. Participants in both workshops generally found the overall
experience to be exciting and they were motivated to use the Chair for upcoming
projects.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 21:52:12 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Baijal",
"Anant",
""
],
[
"Kim",
"Julia",
""
],
[
"Branje",
"Carmen",
""
],
[
"Russo",
"Frank",
""
],
[
"Fels",
"Deborah I.",
""
]
] |
new_dataset
| 0.999645 |
1509.05505
|
Abhinav Jauhri
|
Abhinav Jauhri, Martin Griss, Hakan Erdogmus
|
Small Polygon Compression For Integer Coordinates
|
Publised at 3rd Conference on Weather Warnings and Communication 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe several polygon compression techniques to enable efficient
transmission of polygons representing geographical targets. The main
application is to embed compressed polygons to emergency alert messages that
have strict length restrictions, as in the case of Wireless Emergency Alert
messages. We are able to compress polygons to between 9.7% and 23.6% of
original length, depending on characteristics of the specific polygons,
reducing original polygon lengths from 43-331 characters to 8-55 characters.
The best techniques apply several heuristics to perform initial compression,
and then other algorithmic techniques, including higher base encoding. Further,
these methods are respectful of computation and storage constraints typical of
cell phones. Two of the best techniques include a \enquote{bignum} quadratic
combination of integer coordinates and a variable length encoding, which takes
advantage of a strongly skewed polygon coordinate distribution. Both techniques
applied to one of two \enquote{delta} representations of polygons are on
average able to reduce the size of polygons by some 80%. A repeated substring
dictionary can provide further compression, and a merger of these techniques
into a \enquote{polyalgorithm} can also provide additional improvements.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 04:49:55 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Jauhri",
"Abhinav",
""
],
[
"Griss",
"Martin",
""
],
[
"Erdogmus",
"Hakan",
""
]
] |
new_dataset
| 0.99941 |
1509.05526
|
EPTCS
|
Matt Kaufmann, David L. Rager
|
Proceedings Thirteenth International Workshop on the ACL2 Theorem Prover
and Its Applications
|
Celebrating the 25th anniversary of ACL2
|
EPTCS 192, 2015
|
10.4204/EPTCS.192
| null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Thirteenth International Workshop
on the ACL2 Theorem Prover and Its Applications, ACL2 2015, a two-day workshop
held in Austin, Texas, USA, on October 1-2, 2015. ACL2 workshops occur at
approximately 18-month intervals and provide a major technical forum for
researchers to present and discuss improvements and extensions to the theorem
prover, comparisons of ACL2 with other systems, and applications of ACL2 in
formal verification.
ACL2 is a state-of-the-art automated reasoning system that has been
successfully applied in academia, government, and industry for specification
and verification of computing systems and in teaching computer science courses.
In 2005, Boyer, Kaufmann, and Moore were awarded the 2005 ACM Software System
Award for their work on ACL2 and the other theorem provers in the Boyer-Moore
family.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 07:40:46 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Kaufmann",
"Matt",
""
],
[
"Rager",
"David L.",
""
]
] |
new_dataset
| 0.998695 |
1509.05589
|
Lorenzo Saino
|
Ioannis Psaras, Konstantinos V. Katsaros, Lorenzo Saino and George
Pavlou
|
LIRA: A Location Independent Routing Layer based on Source-Provided
Ephemeral Names
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We identify the obstacles hindering the deployment of Information Centric
Networking (ICN) and the shift from the current IP architecture. In particular,
we argue that scalability of name resolution and the lack of control of content
access from content providers are two important barriers that keep ICN away
from deployment. We design solutions to incentivise ICN deployment and present
a new network architecture that incorporates an extra layer in the protocol
stack (the Location Independent Routing Layer, LIRA) to integrate
location-independent content delivery. According to our design, content names
need not (and should not) be permanent, but rather should be ephemeral.
Resolution of non-permanent names requires the involvement of content
providers, enabling desirable features such as request logging and cache
purging, while avoiding the need for the deployment of a new name resolution
infrastructure. Our results show that with half of the network's nodes
operating under the LIRA framework, we can get the full gain of the ICN mode of
operation.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 11:12:58 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Psaras",
"Ioannis",
""
],
[
"Katsaros",
"Konstantinos V.",
""
],
[
"Saino",
"Lorenzo",
""
],
[
"Pavlou",
"George",
""
]
] |
new_dataset
| 0.999522 |
1509.05736
|
Issa Atoum
|
Issa Atoum, Chih How Bong, Narayanan Kulathuramaiyer
|
Building a Pilot Software Quality-in-Use Benchmark Dataset
|
6 pages,3 figures, conference Proceedings of 9th International
Conference on IT in Asia CITA (2015)
| null | null | null |
cs.SE cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prepared domain specific datasets plays an important role to supervised
learning approaches. In this article a new sentence dataset for software
quality-in-use is proposed. Three experts were chosen to annotate the data
using a proposed annotation scheme. Then the data were reconciled in a (no
match eliminate) process to reduce bias. The Kappa, k statistics revealed an
acceptable level of agreement; moderate to substantial agreement between the
experts. The built data can be used to evaluate software quality-in-use models
in sentiment analysis models. Moreover, the annotation scheme can be used to
extend the current dataset.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 18:19:48 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Atoum",
"Issa",
""
],
[
"Bong",
"Chih How",
""
],
[
"Kulathuramaiyer",
"Narayanan",
""
]
] |
new_dataset
| 0.987992 |
1509.05739
|
Matthew Thill
|
Matthew Thill and Babak Hassibi
|
Low-Coherence Frames from Group Fourier Matrices
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many problems in areas such as compressive sensing and coding theory seek to
design a set of equal-norm vectors with large angular separation. This idea is
essentially equivalent to constructing a frame with low coherence. The elements
of such frames can in turn be used to build high-performance spherical codes,
quantum measurement operators, and compressive sensing measurement matrices, to
name a few applications.
In this work, we allude to the group-frame construction first described by
Slepian and further explored in the works of Vale and Waldron. We present a
method for selecting representations of a finite group to construct a group
frame that achieves low coherence. Our technique produces a tight frame with a
small number of distinct inner product values between the frame elements, in a
sense approximating a Grassmanian frame. We identify special cases in which our
construction yields some previously-known frames with optimal coherence meeting
the Welch lower bound, and other cases in which the entries of our frame
vectors come from small alphabets. In particular, we apply our technique to the
problem choosing a subset of rows of a Hadamard matrix so that the resulting
columns form a low-coherence frame. Finally, we give an explicit calculation of
the average coherence of our frames, and find regimes in which they satisfy the
Strong Coherence Property described by Mixon, Bajwa, and Calderbank.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2015 18:25:39 GMT"
}
] | 2015-09-21T00:00:00 |
[
[
"Thill",
"Matthew",
""
],
[
"Hassibi",
"Babak",
""
]
] |
new_dataset
| 0.996645 |
1411.2852
|
Junaid Qadir
|
Aqsa Malik, Junaid Qadir, Basharat Ahmad, Kok-Lim Alvin Yau, Ubaid
Ullah
|
QoS in IEEE 802.11-based Wireless Networks: A Contemporary Survey
| null | null |
10.1016/j.jnca.2015.04.016
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Apart from mobile cellular networks, IEEE 802.11-based wireless local area
networks (WLANs) represent the most widely deployed wireless networking
technology. With the migration of critical applications onto data networks, and
the emergence of multimedia applications such as digital audio/video and
multimedia games, the success of IEEE 802.11 depends critically on its ability
to provide quality of service (QoS). A lot of research has focused on equipping
IEEE 802.11 WLANs with features to support QoS. In this survey, we provide an
overview of these techniques. We discuss the QoS features incorporated by the
IEEE 802.11 standard at both physical (PHY) and media access control (MAC)
layers, as well as other higher-layer proposals. We also focus on how the new
architectural developments of software-defined networking (SDN) and cloud
networking can be used to facilitate QoS provisioning in IEEE 802.11-based
networks. We conclude this paper by identifying some open research issues for
future consideration.
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2014 15:29:28 GMT"
}
] | 2015-09-18T00:00:00 |
[
[
"Malik",
"Aqsa",
""
],
[
"Qadir",
"Junaid",
""
],
[
"Ahmad",
"Basharat",
""
],
[
"Yau",
"Kok-Lim Alvin",
""
],
[
"Ullah",
"Ubaid",
""
]
] |
new_dataset
| 0.998204 |
1509.05054
|
Paul Irofti
|
Paul Irofti and Bogdan Dumitrescu
|
Overcomplete Dictionary Learning with Jacobi Atom Updates
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dictionary learning for sparse representations is traditionally approached
with sequential atom updates, in which an optimized atom is used immediately
for the optimization of the next atoms. We propose instead a Jacobi version, in
which groups of atoms are updated independently, in parallel. Extensive
numerical evidence for sparse image representation shows that the parallel
algorithms, especially when all atoms are updated simultaneously, give better
dictionaries than their sequential counterparts.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2015 20:23:06 GMT"
}
] | 2015-09-18T00:00:00 |
[
[
"Irofti",
"Paul",
""
],
[
"Dumitrescu",
"Bogdan",
""
]
] |
new_dataset
| 0.965144 |
1509.05265
|
Farshad Ghassemi Toosi
|
Farshad Ghassemi Toosi and Nikola S. Nikolov
|
Sync-and-Burst: Force-Directed Graph Drawing with Uniform Force
Magnitudes
|
12 pages
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a force-directed algorithm, called Sync-and-Burst, which falls
into the category of classical force-directed graph drawing algorithms. A
distinct feature in Sync-and-Burst is the use of simplified forces of
attraction and repulsion whose magnitude does not depend on the distance
between vertices. Instead, magnitudes are uniform throughout the graph at each
iteration and monotonically increase as the number of iterations grows. The
Sync-and-Burst layouts are always circular in shape with relatively even
distribution of vertices throughout the drawing area. We demonstrate that
aesthetically pleasing layouts are achieved in O(n) iterations.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 14:07:47 GMT"
}
] | 2015-09-18T00:00:00 |
[
[
"Toosi",
"Farshad Ghassemi",
""
],
[
"Nikolov",
"Nikola S.",
""
]
] |
new_dataset
| 0.981231 |
1509.05330
|
Harry Boyer
|
Ali Hamada Fakra (PIMENT), Fr\'ed\'eric Miranville (PIMENT), Dimitri
Bigot (PIMENT), Harry Boyer (PIMENT)
|
Elements of Validation of Artificial Lighting through the Software
CODYRUN: Application to a Test Case of the International Commission on
Illumination (CIE)
|
IASTED Power and Energy Systems 2010, Sep 2010, Gaborone, Botswana.
2010
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CODYRUN is a software for computational aeraulic and thermal simulation in
buildings developed by the Laboratory of Building Physics and Systems
(L.P.B.S). Numerical simulation codes of artificial lighting have been
introduced to extend the tool capacity. These calculation codes are able to
predict the amount of light received by any point of a given working plane and
from one or more sources installed on the ceiling of the room. The model used
for these calculations is original and semi-detailed (simplified). The test
case references of the task-3 TC-33 International Commission on Illumination
(CIE) were applied to the software to ensure reliability to properly handle
this photometric aspect. This allowed having a precise idea about the
reliability of the results of numerical simulations.
|
[
{
"version": "v1",
"created": "Tue, 15 Sep 2015 09:32:17 GMT"
}
] | 2015-09-18T00:00:00 |
[
[
"Fakra",
"Ali Hamada",
"",
"PIMENT"
],
[
"Miranville",
"Frédéric",
"",
"PIMENT"
],
[
"Bigot",
"Dimitri",
"",
"PIMENT"
],
[
"Boyer",
"Harry",
"",
"PIMENT"
]
] |
new_dataset
| 0.983641 |
1509.05351
|
Hojjat Mostafanasab
|
Hojjat Mostafanasab
|
Triple cyclic codes over $\mathbb{Z}_2$
|
15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear
code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of
lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be
partitioned into three parts that any cyclic shift of the coordinates of the
parts leaves invariant the code. These codes can be considered as
$\mathbb{Z}_2[x]$-submodules of $\frac{\mathbb{Z}_2[x]}{\langle
x^r-1\rangle}\times\frac{\mathbb{Z}_2[x]}{\langle
x^s-1\rangle}\times\frac{\mathbb{Z}_2[x]}{\langle x^t-1\rangle}$. We give the
minimal generating sets of this kind of codes. Also, we determine the
relationship between the generators of triple cyclic codes and their duals.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 18:09:40 GMT"
}
] | 2015-09-18T00:00:00 |
[
[
"Mostafanasab",
"Hojjat",
""
]
] |
new_dataset
| 0.998827 |
1502.06195
|
Sebastian Morr
|
Alon Baram, Efi Fogel, Michael Hemmer, Dan Halperin, Sebastian Morr
|
Exact Minkowski Sums of Polygons With Holes
|
13 pages, 7 figures. Submitted to ESA 2015
| null |
10.1007/978-3-662-48350-3_7
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an efficient algorithm that computes the Minkowski sum of two
polygons, which may have holes. The new algorithm is based on the convolution
approach. Its efficiency stems in part from a property for Minkowski sums of
polygons with holes, which in fact holds in any dimension: Given two polygons
with holes, for each input polygon we can fill up the holes that are relatively
small compared to the other polygon. Specifically, we can always fill up all
the holes of at least one polygon, transforming it into a simple polygon, and
still obtain exactly the same Minkowski sum. Obliterating holes in the input
summands speeds up the computation of Minkowski sums.
We introduce a robust implementation of the new algorithm, which follows the
Exact Geometric Computation paradigm and thus guarantees exact results. We also
present an empirical comparison of the performance of Minkowski sum
construction of various input examples, where we show that the implementation
of the new algorithm exhibits better performance than several other
implementations in many cases. In particular, we compared the implementation of
the new algorithm, an implementation of the standard convolution algorithm, and
an implementation of the decomposition approach using various convex
decomposition methods, including two new methods that handle polygons with
holes - one is based on vertical decomposition and the other is based on
triangulation.
The software has been developed as an extension of the "2D Minkowski Sums"
package of CGAL (Computational Geometry Algorithms Library). Additional
information and supplementary material is available at our project page
http://acg.cs.tau.ac.il/projects/rc
|
[
{
"version": "v1",
"created": "Sun, 22 Feb 2015 09:03:07 GMT"
},
{
"version": "v2",
"created": "Sat, 21 Mar 2015 08:23:50 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Apr 2015 08:49:45 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Baram",
"Alon",
""
],
[
"Fogel",
"Efi",
""
],
[
"Hemmer",
"Michael",
""
],
[
"Halperin",
"Dan",
""
],
[
"Morr",
"Sebastian",
""
]
] |
new_dataset
| 0.953905 |
1509.04745
|
Muxi Yan
|
Muxi Yan, Jasson Casey, Prithviraj Shome, Alex Sprintson and Andrew
Sutton
|
{\AE}therFlow: Principled Wireless Support in SDN
|
This paper is to appear in the CoolSDN Workshop of ICNP 2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software Defined Networking (SDN) drastically changes the meaning and process
of designing, building, testing, and operating networks. The current support
for wireless net- working in SDN technologies has lagged behind its development
and deployment for wired networks. The purpose of this work is to bring
principled support for wireless access networks so that they can receive the
same level of programmability as wireline interfaces. Specifically we aim to
integrate wireless protocols into the general SDN framework by proposing a new
set of abstractions in wireless devices and the interfaces to manipulate them.
We validate our approach by implementing our design as an extension of an
existing OpenFlow data plane and deploying it in an IEEE 802.11 access point.
We demonstrate the viability of software-defined wireless access networks by
developing and testing a wireless handoff application. The results of the
exper- iment show that our framework is capable of providing new capabilities
in an efficient manner.
|
[
{
"version": "v1",
"created": "Tue, 15 Sep 2015 21:31:49 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Yan",
"Muxi",
""
],
[
"Casey",
"Jasson",
""
],
[
"Shome",
"Prithviraj",
""
],
[
"Sprintson",
"Alex",
""
],
[
"Sutton",
"Andrew",
""
]
] |
new_dataset
| 0.99711 |
1509.04751
|
Cheng-I Wang
|
Tammuz Dubnov and Cheng-i Wang
|
Free-body Gesture Tracking and Augmented Reality Improvisation for Floor
and Aerial Dance
|
8 pages. Technical paper
| null | null | null |
cs.MM cs.CV cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes an updated interactive performance system for floor and
Aerial Dance that controls visual and sonic aspects of the presentation via a
depth sensing camera (MS Kinect). In order to detect, measure and track free
movement in space, 3 degree of freedom (3-DOF) tracking in space (on the ground
and in the air) is performed using IR markers with a method for multi target
tracking capabilities added and described in detail. An improved gesture
tracking and recognition system, called Action Graph (AG), is described in the
paper. Action Graph uses an efficient incremental construction from a single
long sequence of movement features and automatically captures repeated
sub-segments in the movement from start to finish with no manual interaction
needed with other advanced capabilities discussed as well. By using the new
model for the gesture we can unify an entire choreography piece by dynamically
tracking and recognizing gestures and sub-portions of the piece. This gives the
performer the freedom to improvise based on a set of recorded gestures/portions
of the choreography and have the system dynamically respond in relation to the
performer within a set of related rehearsed actions, an ability that has not
been seen in any other system to date.
|
[
{
"version": "v1",
"created": "Tue, 15 Sep 2015 21:54:21 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Dubnov",
"Tammuz",
""
],
[
"Wang",
"Cheng-i",
""
]
] |
new_dataset
| 0.97511 |
1509.04806
|
Francisco Su\'arez-Ruiz
|
Francisco Su\'arez-Ruiz and Quang-Cuong Pham
|
A Framework for Fine Robotic Assembly
|
8 pages, 7 figures, 2 tables
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fine robotic assembly, in which the parts to be assembled are small and
fragile and lie in an unstructured environment, is still out of reach of
today's industrial robots. The main difficulties arise in the precise
localization of the parts in an unstructured environment and the control of
contact interactions. Our contribution in this paper is twofold. First, we
propose a taxonomy of the manipulation primitives that are specifically
involved in fine assembly. Such a taxonomy is crucial for designing a scalable
robotic system (both hardware and software) given the complexity of real-world
assembly tasks. Second, we present a hardware and software architecture where
we have addressed, in an integrated way, a number of issues arising in fine
assembly, such as workspace optimization, external wrench compensation,
position-based force control, etc. Finally, we show the above taxonomy and
architecture in action on a highly dexterous task -- bimanual pin insertion --
which is one of the key steps in our long term project, the autonomous assembly
of an IKEA chair.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2015 03:55:33 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Suárez-Ruiz",
"Francisco",
""
],
[
"Pham",
"Quang-Cuong",
""
]
] |
new_dataset
| 0.993492 |
1509.04811
|
Tadele Damessie T
|
Tadele Tedla
|
amLite: Amharic Transliteration Using Key Map Dictionary
|
6 pages
| null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
amLite is a framework developed to map ASCII transliterated Amharic texts
back to the original Amharic letter texts. The aim of such a framework is to
make existing Amharic linguistic data consistent and interoperable among
researchers. For achieving the objective, a key map dictionary is constructed
using the possible ASCII combinations actively in use for transliterating
Amharic letters; and a mapping of the combinations to the corresponding Amharic
letters is done. The mapping is then used to replace the Amharic linguistic
text back to form the original Amharic letters text. The framework indicated
97.7, 99.7 and 98.4 percentage accuracy on converting the three sample random
test data. It is; however, possible to improve the accuracy of the framework by
adding an exception to the implementation of the algorithm, or by preprocessing
the input text prior to conversion. This paper outlined the rationales behind
the need for developing the framework and the processes undertaken in the
development.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2015 05:00:59 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Tedla",
"Tadele",
""
]
] |
new_dataset
| 0.999241 |
1509.04956
|
J. Miguel Diaz-Banez
|
Francisco G\'omez, Joaqu\'in Mora, Emilia G\'omez, Jos\'e Miguel
D\'iaz-B\'a\~nez
|
Melodic Contour and Mid-Level Global Features Applied to the Analysis of
Flamenco Cantes
| null | null | null | null |
cs.SD cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work focuses on the topic of melodic characterization and similarity in
a specific musical repertoire: a cappella flamenco singing, more specifically
in debla and martinete styles. We propose the combination of manual and
automatic description. First, we use a state-of-the-art automatic transcription
method to account for general melodic similarity from music recordings. Second,
we define a specific set of representative mid-level melodic features, which
are manually labeled by flamenco experts. Both approaches are then contrasted
and combined into a global similarity measure. This similarity measure is
assessed by inspecting the clusters obtained through phylogenetic algorithms
algorithms and by relating similarity to categorization in terms of style.
Finally, we discuss the advantage of combining automatic and expert annotations
as well as the need to include repertoire-specific descriptions for meaningful
melodic characterization in traditional music collections.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2015 15:56:22 GMT"
}
] | 2015-09-17T00:00:00 |
[
[
"Gómez",
"Francisco",
""
],
[
"Mora",
"Joaquín",
""
],
[
"Gómez",
"Emilia",
""
],
[
"Díaz-Báñez",
"José Miguel",
""
]
] |
new_dataset
| 0.997774 |
1507.00576
|
Jeffrey Pawlick
|
Jeffrey Pawlick, Sadegh Farhang, and Quanyan Zhu
|
Flip the Cloud: Cyber-Physical Signaling Games in the Presence of
Advanced Persistent Threats
|
To be presented at the 2015 Conference on Decision and Game Theory
for Security (GameSec 2015)
| null |
10.13140/RG.2.1.3128.9446
| null |
cs.CR cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Access to the cloud has the potential to provide scalable and cost effective
enhancements of physical devices through the use of advanced computational
processes run on apparently limitless cyber infrastructure. On the other hand,
cyber-physical systems and cloud-controlled devices are subject to numerous
design challenges; among them is that of security. In particular, recent
advances in adversary technology pose Advanced Persistent Threats (APTs) which
may stealthily and completely compromise a cyber system. In this paper, we
design a framework for the security of cloud-based systems that specifies when
a device should trust commands from the cloud which may be compromised. This
interaction can be considered as a game between three players: a cloud
defender/administrator, an attacker, and a device. We use traditional signaling
games to model the interaction between the cloud and the device, and we use the
recently proposed FlipIt game to model the struggle between the defender and
attacker for control of the cloud. Because attacks upon the cloud can occur
without knowledge of the defender, we assume that strategies in both games are
picked according to prior commitment. This framework requires a new equilibrium
concept, which we call Gestalt Equilibrium, a fixed-point that expresses the
interdependence of the signaling and FlipIt games. We present the solution to
this fixed-point problem under certain parameter cases, and illustrate an
example application of cloud control of an unmanned vehicle. Our results
contribute to the growing understanding of cloud-controlled systems.
|
[
{
"version": "v1",
"created": "Thu, 2 Jul 2015 13:41:17 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Sep 2015 20:10:13 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Pawlick",
"Jeffrey",
""
],
[
"Farhang",
"Sadegh",
""
],
[
"Zhu",
"Quanyan",
""
]
] |
new_dataset
| 0.989362 |
1508.02063
|
Farooq Khan
|
Farooq Khan
|
Multi-Comm-Core Architecture for Terabit/s Wireless
|
arXiv admin note: text overlap with arXiv:1508.02383
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless communications along with the Internet has been the most
transformative technology in the past 50 years. We expect that wireless data
growth driven by new mobile applications, need to connect all humankind (not
just 1/3) as well as Billions of things to the Internet will require Terabit/s
shared links for ground based local area and wide area wireless access, for
wireless backhaul as well as access via unmanned aerial vehicles (UAVs) and
satellites. We present a new scalable radio architecture that we refer to
multi-comm-core (MCC) to enable low-cost ultra-high speed wireless
communications using both traditional and millimeter wave spectrum.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 18:17:48 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Sep 2015 19:54:07 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Khan",
"Farooq",
""
]
] |
new_dataset
| 0.999496 |
1509.03934
|
Sam Maloney
|
Sam Maloney
|
Dpush: A scalable decentralized spam resistant unsolicited messaging
protocol
|
Newest paper/design; signature was moved inside encrypted data for
anonymity of sender to non recipients, grammar improvements
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Herein this paper is presented a novel invention - called Dpush - that
enables truly scalable spam resistant uncensorable automatically encrypted and
inherently authenticated messaging; thus restoring our ability to exert our
right to private communication, and thus a step forward in restoring an
uncorrupted democracy. Using a novel combination of a distributed hash table[1]
(DHT) and a proof of work[2] (POW), combined in a way that can only be called a
synergy, the emergent property of a scalable and spam resistant unsolicited
messaging protocol elegantly emerges. Notable is that the receiver does not
need to be online at the time the message is sent. This invention is already
implemented and operating within the package that is called MORPHiS - which is
a Sybil[3] resistant enhanced Kademlia[1] DHT implementation combined with an
already functioning implementation of Dpush, as well as a polished HTTP Dmail
interface to send and receive such messages today. MORPHiS is available for
free (GPLv2) at the https://morph.is website.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 02:56:52 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Sep 2015 07:44:01 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Maloney",
"Sam",
""
]
] |
new_dataset
| 0.987619 |
1509.04268
|
Kota Naga Srinivasarao Batta
|
Batta Kota Naga Srinivasarao and Indrajit Chakrabarti
|
High Speed VLSI Architecture for 3-D Discrete Wavelet Transform
|
Submitting to IET CDS. arXiv admin note: substantial text overlap
with arXiv:1509.03836
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a memory efficient, high throughput parallel lifting
based running three dimensional discrete wavelet transform (3-D DWT)
architecture. 3-D DWT is constructed by combining the two spatial and four
temporal processors. Spatial processor (SP) apply the two dimensional DWT on a
frame, using lifting based 9/7 filter bank through the row rocessor (RP) in row
direction and then apply in the colum direction through column processor (CP).
To reduce the temporal memory and the latency, the temporal processor (TP) has
been designed with lifting based 1-D Haar wavelet filter. The proposed
architecture replaced the multiplications by pipeline shift-add operations to
reduce the CPD. Two spatial processors works simultaneously on two adjacent
frames and provide 2-D DWT coefficients as inputs to the temporal processors.
TPs apply the one dimensional DWT in temporal direction and provide eight 3-D
DWT coefficients per clock (throughput). Higher throughput reduces the
computing cycles per frame and enable the lower power consumption.
Implementation results shows that the proposed architecture has the advantage
in reduced memory, low power consumption, low latency, and high throughput over
the existing designs. The RTL of the proposed architecture is described using
verilog and synthesized using 90-nm technology CMOS standard cell library and
results show that it consumes 43.42 mW power and occupies an area equivalent to
231.45 K equivalent gate at frequency of 200 MHz. The proposed architecture has
also been synthesised for the Xilinx zynq 7020 series field programmable gate
array (FPGA).
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 03:46:00 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Srinivasarao",
"Batta Kota Naga",
""
],
[
"Chakrabarti",
"Indrajit",
""
]
] |
new_dataset
| 0.970478 |
1509.04335
|
Hyeji Kim
|
Hyeji Kim and Abbas El Gamal
|
Capacity Theorems for Broadcast Channels with Two Channel State
Components Known at the Receivers
|
18 pages, 6 figures, submitted to IEEE Transactions on Information
Theory. arXiv admin note: text overlap with arXiv:1401.6738
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish the capacity region of several classes of broadcast channels
with random state in which the channel to each user is selected from two
possible channel state components and the state is known only at the receivers.
When the channel components are deterministic, we show that the capacity region
is achieved via Marton coding. This channel model does not belong to any class
of broadcast channels for which the capacity region was previously known and is
useful in studying wireless communication channels when the fading state is
known only at the receivers. We then establish the capacity region when the
channel components are ordered, e.g., degraded. In particular we show that the
capacity region for the broadcast channel with degraded Gaussian vector channel
components is attained via Gaussian input distribution. Finally, we extend the
results on ordered channels to two broadcast channel examples with more than
two channel components, but show that these extensions do not hold in general.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 21:29:08 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Kim",
"Hyeji",
""
],
[
"Gamal",
"Abbas El",
""
]
] |
new_dataset
| 0.985895 |
1509.04636
|
Mehul S Raval
|
Dhruv Gupta, Gunvantsinh Gohil, Mehul S. Raval
|
Driver Friendly Headlight Controller for Driving in Developing Countries
| null | null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In developing countries, night driving is extremely unsafe mainly due to; 1).
Poorly followed traffic rules and 2) bad road conditions. The number of
accidents is increasing at a frightening pace, necessitating the development of
a low cost automatic headlight control system to ensure safety. In most
accident cases, fatal collisions take place due to glare generated by excessive
headlight intensity (high beam) of the oncoming vehicle. In this paper, a user
friendly controller for headlight intensity control for driving on highway at
night has been proposed. Aim is to design simple and affordable system that can
alleviate effect of blind spot due to high glare on the vehicle windscreen.
Controller is based on Fuzzy inference system (FIS) and used incoming light
intensity as criteria. Also, relative distance and speed is derived using
incoming intensity of the oncoming vehicles. The system is designed considering
human tolerance levels of light intensity as the boundary values. The system
controls headlight beam voltage such that; a) intensity is maintained in human
visual comfort zone and b) blind spot is avoided. The super user feature
incorporated in the intensity controller offers personalized preferences to the
driver. Due to the use of the single parameter (intensity) for control, system
can be implemented using simplified hardware.
|
[
{
"version": "v1",
"created": "Tue, 15 Sep 2015 16:53:33 GMT"
}
] | 2015-09-16T00:00:00 |
[
[
"Gupta",
"Dhruv",
""
],
[
"Gohil",
"Gunvantsinh",
""
],
[
"Raval",
"Mehul S.",
""
]
] |
new_dataset
| 0.99946 |
1211.5787
|
Amos Korman
|
Ofer Feinerman and Amos Korman and Shay Kutten and Yoav Rodeh
|
Fast Rendezvous on a Cycle by Agents with Different Speeds
| null | null | null | null |
cs.DC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The difference between the speed of the actions of different processes is
typically considered as an obstacle that makes the achievement of cooperative
goals more difficult. In this work, we aim to highlight potential benefits of
such asynchrony phenomena to tasks involving symmetry breaking. Specifically,
in this paper, identical (except for their speeds) mobile agents are placed at
arbitrary locations on a cycle of length $n$ and use their speed difference in
order to rendezvous fast. We normalize the speed of the slower agent to be 1,
and fix the speed of the faster agent to be some $c>1$. (An agent does not know
whether it is the slower agent or the faster one.) The straightforward
distributed-race DR algorithm is the one in which both agents simply start
walking until rendezvous is achieved. It is easy to show that, in the worst
case, the rendezvous time of DR is $n/(c-1)$. Note that in the interesting
case, where $c$ is very close to 1 this bound becomes huge. Our first result is
a lower bound showing that, up to a multiplicative factor of 2, this bound is
unavoidable, even in a model that allows agents to leave arbitrary marks, even
assuming sense of direction, and even assuming $n$ and $c$ are known to agents.
That is, we show that under such assumptions, the rendezvous time of any
algorithm is at least $\frac{n}{2(c-1)}$ if $c\leq 3$ and slightly larger if
$c>3$. We then construct an algorithm that precisely matches the lower bound
for the case $c\leq 2$, and almost matches it when $c>2$. Moreover, our
algorithm performs under weaker assumptions than those stated above, as it does
not assume sense of direction, and it allows agents to leave only a single mark
(a pebble) and only at the place where they start the execution. Finally, we
investigate the setting in which no marks can be used at all, and show tight
bounds for $c\leq 2$, and almost tight bounds for $c>2$.
|
[
{
"version": "v1",
"created": "Sun, 25 Nov 2012 17:49:28 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Sep 2015 16:35:47 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Feinerman",
"Ofer",
""
],
[
"Korman",
"Amos",
""
],
[
"Kutten",
"Shay",
""
],
[
"Rodeh",
"Yoav",
""
]
] |
new_dataset
| 0.976292 |
1410.5414
|
Vasileios Kapinas
|
Panagiotis G. Tsalaportas, Vasileios M. Kapinas, George K.
Karagiannidis
|
Solar Lab Notebook (SLN): An Ultra-Portable Web-Based System for
Heliophysics and High-Security Labs
|
10 pages, 7 figures, 1 table. Final content
|
IEEE Journal of Selected Topics in Applied Earth Observations and
Remote Sensing, vol. 8, no. 8, pp. 4141-4150, August 2015
|
10.1109/JSTARS.2015.2444332
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the Solar Lab Notebook (SLN), an electronic lab
notebook for improving the process of recording and sharing solar related
digital information in an organized manner. SLN is a pure web-based application
(available online: http://umbra.nascom.nasa.gov/sln) that runs client-side
only, employing a clean and very friendly graphical user interface design, and
thus providing a true cross-platform user experience. Furthermore, SLN
leverages unique technologies offered by modern web browsers, such as the
FileReader API, the Blob interface and Local Storage mechanism; it is coded
entirely using HTML5, CSS3, and JavaScript, and powered by the extremely well
documented XML file format. For high-security labs, it can be utilized as an
ultra-portable and secure digital notebook solution, since it is functionally
self-contained, and does not require any server-side process running on either
the local or a remote system. Finally, the W3C XML Schema language is used to
define a list of rules, namely a data standard, that an SLN file must conform
to in order to be valid. In this way, developers are able to implement their
own validation functions in their projects, or use one of the freely available
tools to check if a data file is properly structured. Similarly, scientific
groups at different labs can easily share information, being confident about
the integrity of the exchanged data.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 22:58:18 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Nov 2014 00:50:19 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Mar 2015 02:54:15 GMT"
},
{
"version": "v4",
"created": "Sat, 6 Jun 2015 01:32:00 GMT"
},
{
"version": "v5",
"created": "Fri, 19 Jun 2015 18:10:43 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Tsalaportas",
"Panagiotis G.",
""
],
[
"Kapinas",
"Vasileios M.",
""
],
[
"Karagiannidis",
"George K.",
""
]
] |
new_dataset
| 0.988031 |
1509.01549
|
Matthew Lai
|
Matthew Lai
|
Giraffe: Using Deep Reinforcement Learning to Play Chess
|
MSc Dissertation
| null | null | null |
cs.AI cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents Giraffe, a chess engine that uses self-play to discover
all its domain-specific knowledge, with minimal hand-crafted knowledge given by
the programmer. Unlike previous attempts using machine learning only to perform
parameter-tuning on hand-crafted evaluation functions, Giraffe's learning
system also performs automatic feature extraction and pattern recognition. The
trained evaluation function performs comparably to the evaluation functions of
state-of-the-art chess engines - all of which containing thousands of lines of
carefully hand-crafted pattern recognizers, tuned over many years by both
computer chess experts and human chess masters. Giraffe is the most successful
attempt thus far at using end-to-end machine learning to play chess.
|
[
{
"version": "v1",
"created": "Fri, 4 Sep 2015 18:21:52 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Sep 2015 15:42:35 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Lai",
"Matthew",
""
]
] |
new_dataset
| 0.998218 |
1509.03677
|
Maziar Izadi
|
Sasi Prabhakaran Viswanathan, Amit Kumar Sanyal, Maziar Izadi
|
Mechatronics Architecture of Smartphone-Based Spacecraft ADCS using
VSCMG Actuators
| null | null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hardware and software architecture of a novel spacecraft Attitude
Determination and Control System (ADCS) based on smartphones using Variable
Speed Control Moment Gyroscope (VSCMG) as actuator is proposed here. A
spacecraft ground simulator testbed for Hardware-in-the-loop (HIL) attitude
estimation and control with VSCMG is also described. The sensor breakouts with
independent micro-controller units are used in the conventional ADCS units,
which are replaced by a single integrated off-the-shelf smartphone. On-board
sensing, data acquisition, data uplink/downlink, state estimation and real-time
feedback control objectives can be performed using this novel spacecraft ADCS.
The attitude control and attitude determination (estimation) schemes have
appeared in prior publications, but are presented in brief here. Experimental
results from running the attitude estimation (filtering) scheme with the
"onboard" sensors of the smartphone in the HIL simulator are given. These
results, obtained in the Spacecraft Guidance, Navigation and Control Laboratory
at NMSU, demonstrate the excellent performance of this estimation scheme with
the noisy raw data from the smartphone sensors.
|
[
{
"version": "v1",
"created": "Fri, 11 Sep 2015 21:58:31 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Viswanathan",
"Sasi Prabhakaran",
""
],
[
"Sanyal",
"Amit Kumar",
""
],
[
"Izadi",
"Maziar",
""
]
] |
new_dataset
| 0.999119 |
1509.03700
|
Peter Kovesi
|
Peter Kovesi
|
Good Colour Maps: How to Design Them
|
42 pages, 25 figures
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many colour maps provided by vendors have highly uneven perceptual contrast
over their range. It is not uncommon for colour maps to have perceptual flat
spots that can hide a feature as large as one tenth of the total data range.
Colour maps may also have perceptual discontinuities that induce the appearance
of false features. Previous work in the design of perceptually uniform colour
maps has mostly failed to recognise that CIELAB space is only designed to be
perceptually uniform at very low spatial frequencies. The most important factor
in designing a colour map is to ensure that the magnitude of the incremental
change in perceptual lightness of the colours is uniform. The specific
requirements for linear, diverging, rainbow and cyclic colour maps are
developed in detail. To support this work two test images for evaluating colour
maps are presented. The use of colour maps in combination with relief shading
is considered and the conditions under which colour can enhance or disrupt
relief shading are identified. Finally, a set of new basis colours for the
construction of ternary images are presented. Unlike the RGB primaries these
basis colours produce images whereby the salience of structures are consistent
irrespective of the assignment of basis colours to data channels.
|
[
{
"version": "v1",
"created": "Sat, 12 Sep 2015 03:35:20 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Kovesi",
"Peter",
""
]
] |
new_dataset
| 0.965522 |
1509.03721
|
Mohsen Ghasempour
|
Mohsen Ghasempour, Jim Garside, Aamer Jaleel and Mikel Luj\'an
|
DReAM: Dynamic Re-arrangement of Address Mapping to Improve the
Performance of DRAMs
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The initial location of data in DRAMs is determined and controlled by the
'address-mapping' and even modern memory controllers use a fixed and
run-time-agnostic address mapping. On the other hand, the memory access pattern
seen at the memory interface level will dynamically change at run-time. This
dynamic nature of memory access pattern and the fixed behavior of address
mapping process in DRAM controllers, implied by using a fixed address mapping
scheme, means that DRAM performance cannot be exploited efficiently. DReAM is a
novel hardware technique that can detect a workload-specific address mapping at
run-time based on the application access pattern which improves the performance
of DRAMs. The experimental results show that DReAM outperforms the best
evaluated address mapping on average by 9%, for mapping-sensitive workloads, by
2% for mapping-insensitive workloads, and up to 28% across all the workloads.
DReAM can be seen as an insurance policy capable of detecting which scenarios
are not well served by the predefined address mapping.
|
[
{
"version": "v1",
"created": "Sat, 12 Sep 2015 08:02:39 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Ghasempour",
"Mohsen",
""
],
[
"Garside",
"Jim",
""
],
[
"Jaleel",
"Aamer",
""
],
[
"Luján",
"Mikel",
""
]
] |
new_dataset
| 0.970686 |
1509.03843
|
Derrick Newton Dr
|
Derrick Newton
|
Attack on a classical analogue of the Dunjko, Wallden, Kent and
Andersson quantum digital signature protocol
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A quantum digital signature (QDS) protocol is investigated in respect of an
attacker who can impersonate other communicating principals in the style of
Lowe's attack on the Needham-Schroeder public-key authentication protocol. A
man-in-the-middle attack is identified in respect of a classical variant of the
protocol and it is suggested that a similar attack would be effective against
the QDS protocol. The attack has been confirmed through initial protocol
modelling using a automated theorem prover, ProVerif.
|
[
{
"version": "v1",
"created": "Sun, 13 Sep 2015 12:57:25 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Newton",
"Derrick",
""
]
] |
new_dataset
| 0.984325 |
1509.04219
|
Afroze Ibrahim Baqapuri
|
Afroze Ibrahim Baqapuri
|
Twitter Sentiment Analysis
|
Bachelors Thesis Report
| null | null | null |
cs.CL cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This project addresses the problem of sentiment analysis in twitter; that is
classifying tweets according to the sentiment expressed in them: positive,
negative or neutral. Twitter is an online micro-blogging and social-networking
platform which allows users to write short status updates of maximum length 140
characters. It is a rapidly expanding service with over 200 million registered
users - out of which 100 million are active users and half of them log on
twitter on a daily basis - generating nearly 250 million tweets per day. Due to
this large amount of usage we hope to achieve a reflection of public sentiment
by analysing the sentiments expressed in the tweets. Analysing the public
sentiment is important for many applications such as firms trying to find out
the response of their products in the market, predicting political elections
and predicting socioeconomic phenomena like stock exchange. The aim of this
project is to develop a functional classifier for accurate and automatic
sentiment classification of an unknown tweet stream.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 17:39:37 GMT"
}
] | 2015-09-15T00:00:00 |
[
[
"Baqapuri",
"Afroze Ibrahim",
""
]
] |
new_dataset
| 0.958865 |
1412.7148
|
Tarmo Uustalu
|
Thosten Altenkirch (University of Nottingham), James Chapman
(Institute of Cybernetics), Tarmo Uustalu (Institute of Cybernetics)
|
Monads need not be endofunctors
| null |
Logical Methods in Computer Science, Volume 11, Issue 1 (March 6,
2015) lmcs:928
|
10.2168/LMCS-11(1:3)2015
| null |
cs.PL cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a generalization of monads, called relative monads, allowing for
underlying functors between different categories. Examples include
finite-dimensional vector spaces, untyped and typed lambda-calculus syntax and
indexed containers. We show that the Kleisli and Eilenberg-Moore constructions
carry over to relative monads and are related to relative adjunctions. Under
reasonable assumptions, relative monads are monoids in the functor category
concerned and extend to monads, giving rise to a coreflection between relative
monads and monads. Arrows are also an instance of relative monads.
|
[
{
"version": "v1",
"created": "Mon, 22 Dec 2014 20:53:17 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Mar 2015 21:10:14 GMT"
}
] | 2015-09-14T00:00:00 |
[
[
"Altenkirch",
"Thosten",
"",
"University of Nottingham"
],
[
"Chapman",
"James",
"",
"Institute of Cybernetics"
],
[
"Uustalu",
"Tarmo",
"",
"Institute of Cybernetics"
]
] |
new_dataset
| 0.956011 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.