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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1604.04146
|
Xin-She Yang
|
E. Osaba, Xin-She Yang, F. Diaz, E. Onieva, A. D. Masegosa, A.
Perallos
|
A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem
Modelling a Newspaper Distribution System with Recycling Policy
|
7 tables and 4 figures
| null |
10.1007/s00500-016-2114-1
| null |
cs.NE cs.AI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A real-world newspaper distribution problem with recycling policy is tackled
in this work. In order to meet all the complex restrictions contained in such a
problem, it has been modeled as a rich vehicle routing problem, which can be
more specifically considered as an asymmetric and clustered vehicle routing
problem with simultaneous pickup and deliveries, variable costs and forbidden
paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the
literature. For this reason, a benchmark composed by 15 instances has been also
proposed. In the design of this benchmark, real geographical positions have
been used, located in the province of Bizkaia, Spain. For the proper treatment
of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed.
This application is the first application of the firefly algorithm to any rich
vehicle routing problem. To prove that the proposed DFA is a promising
technique, its performance has been compared with two other well-known
techniques: an evolutionary algorithm and an evolutionary simulated annealing.
Our results have shown that the DFA has outperformed these two classic
meta-heuristics.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2016 13:25:42 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Osaba",
"E.",
""
],
[
"Yang",
"Xin-She",
""
],
[
"Diaz",
"F.",
""
],
[
"Onieva",
"E.",
""
],
[
"Masegosa",
"A. D.",
""
],
[
"Perallos",
"A.",
""
]
] |
new_dataset
| 0.998811 |
1604.04205
|
James Ross
|
James A. Ross, David A. Richie
|
Implementing OpenSHMEM for the Adapteva Epiphany RISC Array Processor
|
4 pages, 1 figure, accepted to ICCS'16 ALCHEMY workshop
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The energy-efficient Adapteva Epiphany architecture exhibits massive
many-core scalability in a physically compact 2D array of RISC cores with a
fast network-on-chip (NoC). With fully divergent cores capable of MIMD
execution, the physical topology and memory-mapped capabilities of the core and
network translate well to partitioned global address space (PGAS) parallel
programming models. Following an investigation into the use of two-sided
communication using threaded MPI, one-sided communication using SHMEM is being
explored. Here we present work in progress on the development of an OpenSHMEM
1.2 implementation for the Epiphany architecture.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2016 16:20:55 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Ross",
"James A.",
""
],
[
"Richie",
"David A.",
""
]
] |
new_dataset
| 0.970642 |
1604.04217
|
Ioannis Lamprou
|
Ioannis Lamprou, Russell Martin, Sven Schewe
|
Fast Two-Robot Disk Evacuation with Wireless Communication
|
18 pages, 10 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the fast evacuation problem, we study the path planning problem for two
robots who want to minimize the worst-case evacuation time on the unit disk.
The robots are initially placed at the center of the disk. In order to
evacuate, they need to reach an unknown point, the exit, on the boundary of the
disk. Once one of the robots finds the exit, it will instantaneously notify the
other agent, who will make a beeline to it.
The problem has been studied for robots with the same speed~\cite{s1}. We
study a more general case where one robot has speed $1$ and the other has speed
$s \geq 1$. We provide optimal evacuation strategies in the case that $s \geq
c_{2.75} \approx 2.75$ by showing matching upper and lower bounds on the
worst-case evacuation time. For $1\leq s < c_{2.75}$, we show (non-matching)
upper and lower bounds on the evacuation time with a ratio less than $1.22$.
Moreover, we demonstrate that a generalization of the two-robot search strategy
from~\cite{s1} is outperformed by our proposed strategies for any $s \geq
c_{1.71} \approx 1.71$.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2016 16:58:07 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Lamprou",
"Ioannis",
""
],
[
"Martin",
"Russell",
""
],
[
"Schewe",
"Sven",
""
]
] |
new_dataset
| 0.996773 |
1506.08726
|
Swen Jacobs
|
Swen Jacobs, Roderick Bloem, Romain Brenguier, R\"udiger Ehlers,
Timotheus Hell, Robert K\"onighofer, Guillermo A. P\'erez, Jean-Fran\c{c}ois
Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam
Walker
|
The First Reactive Synthesis Competition (SYNTCOMP 2014)
|
24 pages, published in STTT
|
International Journal on Software Tools for Technology Transfer,
Online First, 2016, pp 1-24
|
10.1007/s10009-016-0416-3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the reactive synthesis competition (SYNTCOMP), a long-term
effort intended to stimulate and guide advances in the design and application
of synthesis procedures for reactive systems. The first iteration of SYNTCOMP
is based on the controller synthesis problem for finite-state systems and
safety specifications. We provide an overview of this problem and existing
approaches to solve it, and report on the design and results of the first
SYNTCOMP. This includes the definition of the benchmark format, the collection
of benchmarks, the rules of the competition, and the five synthesis tools that
participated. We present and analyze the results of the competition and draw
conclusions on the state of the art. Finally, we give an outlook on future
directions of SYNTCOMP.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 16:45:03 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Feb 2016 13:55:42 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Apr 2016 07:34:07 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Jacobs",
"Swen",
""
],
[
"Bloem",
"Roderick",
""
],
[
"Brenguier",
"Romain",
""
],
[
"Ehlers",
"Rüdiger",
""
],
[
"Hell",
"Timotheus",
""
],
[
"Könighofer",
"Robert",
""
],
[
"Pérez",
"Guillermo A.",
""
],
[
"Raskin",
"Jean-François",
""
],
[
"Ryzhyk",
"Leonid",
""
],
[
"Sankur",
"Ocan",
""
],
[
"Seidl",
"Martina",
""
],
[
"Tentrup",
"Leander",
""
],
[
"Walker",
"Adam",
""
]
] |
new_dataset
| 0.999616 |
1604.03570
|
Weiqun Zhang
|
Weiqun Zhang and Ann Almgren and Marcus Day and Tan Nguyen and John
Shalf and Didem Unat
|
BoxLib with Tiling: An AMR Software Framework
|
Accepted for publication in SIAM J. on Scientific Computing
| null | null | null |
cs.MS physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a block-structured adaptive mesh refinement (AMR)
software framework that incorporates tiling, a well-known loop transformation.
Because the multiscale, multiphysics codes built in BoxLib are designed to
solve complex systems at high resolution, performance on current and next
generation architectures is essential. With the expectation of many more cores
per node on next generation architectures, the ability to effectively utilize
threads within a node is essential, and the current model for parallelization
will not be sufficient. We describe a new version of BoxLib in which the tiling
constructs are embedded so that BoxLib-based applications can easily realize
expected performance gains without extra effort on the part of the application
developer. We also discuss a path forward to enable future versions of BoxLib
to take advantage of NUMA-aware optimizations using the TiDA portable library.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 20:13:04 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Zhang",
"Weiqun",
""
],
[
"Almgren",
"Ann",
""
],
[
"Day",
"Marcus",
""
],
[
"Nguyen",
"Tan",
""
],
[
"Shalf",
"John",
""
],
[
"Unat",
"Didem",
""
]
] |
new_dataset
| 0.980637 |
1604.03607
|
Dylan Hutchison
|
Dylan Hutchison, Bill Howe, Dan Suciu
|
Lara: A Key-Value Algebra underlying Arrays and Relations
|
Working draft
| null | null | null |
cs.DB cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data processing systems roughly group into families such as relational,
array, graph, and key-value. Many data processing tasks exceed the capabilities
of any one family, require data stored across families, or run faster when
partitioned onto multiple families. Discovering ways to execute computation
among multiple available systems, let alone discovering an optimal execution
plan, is challenging given semantic differences between disparate families of
systems. In this paper we introduce a new algebra, Lara, which underlies and
unifies algebras representing the families above in order to facilitate
translation between systems. We describe the operations and objects of
Lara---union, join, and ext on associative tables---and show her properties and
equivalences to other algebras. Multi-system optimization has a bright future,
in which we proffer Lara for the role of universal connector.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 22:22:16 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Hutchison",
"Dylan",
""
],
[
"Howe",
"Bill",
""
],
[
"Suciu",
"Dan",
""
]
] |
new_dataset
| 0.990208 |
1604.03612
|
Mostafa El-Khamy
|
Mostafa El-Khamy, Hsien-Ping Lin, and Jungwon Lee
|
Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding
|
Accepted at Electronics Letters
| null |
10.1049/el.2016.0837
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are considered the latest major breakthrough in coding theory.
Polar codes were introduced by Ar{\i}kan in 2008. In this letter, we show that
the binary polar codes are the same as the optimized codes for bitwise
multistage decoding (OCBM), which have been discovered before by Stolte in
2002. The equivalence between the techniques used for the constructions and
decodings of both codes is established.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 23:05:23 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"El-Khamy",
"Mostafa",
""
],
[
"Lin",
"Hsien-Ping",
""
],
[
"Lee",
"Jungwon",
""
]
] |
new_dataset
| 0.999017 |
1604.03626
|
Norah Abokhodair
|
Norah Abokhodair, Sarah Vieweg
|
Privacy & Social Media in the Context of the Arab Gulf
|
12 pages, 1 figure
| null |
10.1145/2901790.2901873
| null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theories of privacy and how it relates to the use of Information
Communication Technology (ICT) have been a topic of research for decades.
However, little attention has been paid to the perception of privacy from the
perspective of technology users in the Middle East. In this paper, we delve
into interpretations of privacy from the approach of Arab Gulf citizens. We
consider how privacy is practiced and understood in technology-mediated
environments among this population, paying particular attention to the role of
Islam and cultural traditions in constructing norms around privacy. We then
offer culturally sensitive design principles and suggestions for future
research that incorporates previously unexplored characteristics of privacy,
which play a role in how users navigate social media.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 01:00:13 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Abokhodair",
"Norah",
""
],
[
"Vieweg",
"Sarah",
""
]
] |
new_dataset
| 0.989338 |
1604.03641
|
Brianna Ren
|
Brianna M. Ren, Jeffrey S. Foster
|
Just-in-Time Static Type Checking for Dynamic Languages
|
19 pages, 6 figures, 2 tables, 1 appendix, This is a preprint of a
paper to appear in Programming Language Design and Implementation (PLDI 2016)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic languages such as Ruby, Python, and JavaScript have many compelling
benefits, but the lack of static types means subtle errors can remain latent in
code for a long time. While many researchers have developed various systems to
bring some of the benefits of static types to dynamic languages, prior
approaches have trouble dealing with metaprogramming, which generates code as
the program executes. In this paper, we propose Hummingbird, a new system that
uses a novel technique, just-in-time static type checking, to type check Ruby
code even in the presence of metaprogramming. In Hummingbird, method type
signatures are gathered dynamically at run-time, as those methods are created.
When a method is called, Hummingbird statically type checks the method body
against current type signatures. Thus, Hummingbird provides thorough static
checks on a per-method basis, while also allowing arbitrarily complex
metaprogramming. For performance, Hummingbird memoizes the static type checking
pass, invalidating cached checks only if necessary. We formalize Hummingbird
using a core, Ruby-like language and prove it sound. To evaluate Hummingbird,
we applied it to six apps, including three that use Ruby on Rails, a powerful
framework that relies heavily on metaprogramming. We found that all apps
typecheck successfully using Hummingbird, and that Hummingbird's performance
overhead is reasonable. We applied Hummingbird to earlier versions of one Rails
app and found several type errors that had been introduced and then fixed.
Lastly, we demonstrate using Hummingbird in Rails development mode to typecheck
an app as live updates are applied to it.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 03:04:17 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Ren",
"Brianna M.",
""
],
[
"Foster",
"Jeffrey S.",
""
]
] |
new_dataset
| 0.998552 |
1604.03774
|
Hualu Liu
|
Xiusheng Liu and Hualu Liu
|
Matrix-Product Complementary dual Codes
|
17pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear complementary dual codes (LCD) are linear codes satisfying $C\cap
C^{\perp}=\{0\}$. Under suitable conditions, matrix-product codes that are
complementary dual codes are characterized. We construct LCD codes using
quasi-orthogonal matrices. Some asymptotic results are derived.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 13:55:40 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Liu",
"Xiusheng",
""
],
[
"Liu",
"Hualu",
""
]
] |
new_dataset
| 0.999686 |
1604.03829
|
Tarun Choubisa
|
Raviteja Upadrashta, Tarun Choubisa, A. Praneeth, Tony G., Aswath V.
S., P. Vijay Kumar, Sripad Kowshik, Hari Prasad Gokul R, T. V. Prabhakar
|
Animation and Chirplet-Based Development of a PIR Sensor Array for
Intruder Classification in an Outdoor Environment
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the development of a passive infra-red sensor tower
platform along with a classification algorithm to distinguish between human
intrusion, animal intrusion and clutter arising from wind-blown vegetative
movement in an outdoor environment. The research was aimed at exploring the
potential use of wireless sensor networks as an early-warning system to help
mitigate human-wildlife conflicts occurring at the edge of a forest. There are
three important features to the development. Firstly, the sensor platform
employs multiple sensors arranged in the form of a two-dimensional array to
give it a key spatial-resolution capability that aids in classification.
Secondly, given the challenges of collecting data involving animal intrusion,
an Animation-based Simulation tool for Passive Infra-Red sEnsor (ASPIRE) was
developed that simulates signals corresponding to human and animal intrusion
and some limited models of vegetative clutter. This speeded up the process of
algorithm development by allowing us to test different hypotheses in a
time-efficient manner. Finally, a chirplet-based model for intruder signal was
developed that significantly helped boost classification accuracy despite
drawing data from a smaller number of sensors. An SVM-based classifier was used
which made use of chirplet, energy and signal cross-correlation-based features.
The average accuracy obtained for intruder detection and classification on
real-world and simulated data sets was in excess of 97%.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 15:26:32 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Upadrashta",
"Raviteja",
""
],
[
"Choubisa",
"Tarun",
""
],
[
"Praneeth",
"A.",
""
],
[
"G.",
"Tony",
""
],
[
"S.",
"Aswath V.",
""
],
[
"Kumar",
"P. Vijay",
""
],
[
"Kowshik",
"Sripad",
""
],
[
"R",
"Hari Prasad Gokul",
""
],
[
"Prabhakar",
"T. V.",
""
]
] |
new_dataset
| 0.962812 |
1604.03848
|
Apala Ray
|
Apala Ray and Johan Akerberg and Mats Bjorkman and Mikael Gidlund
|
Employee Trust Based Industrial Device Deployment and Initial Key
Establishment
|
Page 21-44, International Journal of Network Security & Its
Applications (IJNSA) Vol.8, No.1, January 2016
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An efficient key management system is required to support cryptography. Most
key management systems use either pre-installed shared keys or install initial
security parameters using out-of-band channels. These methods create an
additional burden for engineers who manage the devices in industrial plants.
Hence, device deployment in industrial plants becomes a challenging task in
order to achieve security. In this work, we present a device deployment
framework that can support key management using the existing trust towards
employees in a plant. This approach reduces the access to initial security
parameters by employees, rather it helps to bind the trust of the employee with
device commissioning. Thus, this approach presents a unique solution to the
device deployment problem. Further, through a proof-of-concept implementation
and security analysis using the AVISPA tool, we present that our framework is
feasible to implement and satisfies our security objectives.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 16:03:09 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Ray",
"Apala",
""
],
[
"Akerberg",
"Johan",
""
],
[
"Bjorkman",
"Mats",
""
],
[
"Gidlund",
"Mikael",
""
]
] |
new_dataset
| 0.997528 |
1604.03871
|
Maria Potop-Butucaru
|
Silvia Bonomi (DIAG), Antonella Del Pozzo (NPA, DIAG), Maria
Potop-Butucaru (NPA), S\'ebastien Tixeuil (NPA)
|
Approximate Agreement under Mobile Byzantine Faults
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we address Approximate Agreement problem in the Mobile
Byzantine faults model. Our contribution is threefold. First, we propose the
the first mapping from the existing variants of Mobile Byzantine models to the
Mixed-Mode faults model.This mapping further help us to prove the correctness
of class MSR (Mean-Subsequence-Reduce) Approximate Agreement algorithms in the
Mobile Byzantine fault model, and is of independent interest. Secondly, we
prove lower bounds for solving Approximate Agreement under all existing Mobile
Byzantine faults models. Interestingly, these lower bounds are different from
the static bounds. Finally, we propose matching upper bounds. Our paper is the
first to link the Mobile Byzantine Faults models and the Mixed-Mode Faults
models, and we advocate that a similar approach can be adopted in order to
prove the correctness of other classical distributed building blocks (e.g.
agreement, clock synchronization, interactive consistency etc) under Mobile
Byzantine Faults model.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 14:50:55 GMT"
}
] | 2016-04-14T00:00:00 |
[
[
"Bonomi",
"Silvia",
"",
"DIAG"
],
[
"Del Pozzo",
"Antonella",
"",
"NPA, DIAG"
],
[
"Potop-Butucaru",
"Maria",
"",
"NPA"
],
[
"Tixeuil",
"Sébastien",
"",
"NPA"
]
] |
new_dataset
| 0.999575 |
1507.02558
|
Ilaria Gori
|
Ilaria Gori, J. K. Aggarwal, Larry Matthies, Michael S. Ryoo
|
Multi-Type Activity Recognition in Robot-Centric Scenarios
| null |
IEEE Robotics and Automation Letters (RA-L), 1(1):593-600, 2016
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Activity recognition is very useful in scenarios where robots interact with,
monitor or assist humans. In the past years many types of activities -- single
actions, two persons interactions or ego-centric activities, to name a few --
have been analyzed. Whereas traditional methods treat such types of activities
separately, an autonomous robot should be able to detect and recognize multiple
types of activities to effectively fulfill its tasks. We propose a method that
is intrinsically able to detect and recognize activities of different types
that happen in sequence or concurrently. We present a new unified descriptor,
called Relation History Image (RHI), which can be extracted from all the
activity types we are interested in. We then formulate an optimization
procedure to detect and recognize activities of different types. We apply our
approach to a new dataset recorded from a robot-centric perspective and
systematically evaluate its quality compared to multiple baselines. Finally, we
show the efficacy of the RHI descriptor on publicly available datasets
performing extensive comparisons.
|
[
{
"version": "v1",
"created": "Thu, 9 Jul 2015 15:33:40 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2016 01:33:06 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Gori",
"Ilaria",
""
],
[
"Aggarwal",
"J. K.",
""
],
[
"Matthies",
"Larry",
""
],
[
"Ryoo",
"Michael S.",
""
]
] |
new_dataset
| 0.979715 |
1511.06062
|
Yang Gao
|
Yang Gao, Oscar Beijbom, Ning Zhang, Trevor Darrell
|
Compact Bilinear Pooling
|
Camera ready version for CVPR
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bilinear models has been shown to achieve impressive performance on a wide
range of visual tasks, such as semantic segmentation, fine grained recognition
and face recognition. However, bilinear features are high dimensional,
typically on the order of hundreds of thousands to a few million, which makes
them impractical for subsequent analysis. We propose two compact bilinear
representations with the same discriminative power as the full bilinear
representation but with only a few thousand dimensions. Our compact
representations allow back-propagation of classification errors enabling an
end-to-end optimization of the visual recognition system. The compact bilinear
representations are derived through a novel kernelized analysis of bilinear
pooling which provide insights into the discriminative power of bilinear
pooling, and a platform for further research in compact pooling methods.
Experimentation illustrate the utility of the proposed representations for
image classification and few-shot learning across several datasets.
|
[
{
"version": "v1",
"created": "Thu, 19 Nov 2015 05:34:35 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2016 01:59:15 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Gao",
"Yang",
""
],
[
"Beijbom",
"Oscar",
""
],
[
"Zhang",
"Ning",
""
],
[
"Darrell",
"Trevor",
""
]
] |
new_dataset
| 0.997666 |
1512.06927
|
Jian Jin
|
Jian Jin
|
A C++ library for Multimodal Deep Learning
|
27 pages
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MDL, Multimodal Deep Learning Library, is a deep learning framework that
supports multiple models, and this document explains its philosophy and
functionality. MDL runs on Linux, Mac, and Unix platforms. It depends on
OpenCV.
|
[
{
"version": "v1",
"created": "Tue, 22 Dec 2015 01:27:23 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Dec 2015 20:00:20 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Dec 2015 13:39:52 GMT"
},
{
"version": "v4",
"created": "Tue, 12 Apr 2016 17:34:29 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Jin",
"Jian",
""
]
] |
new_dataset
| 0.998132 |
1603.08949
|
Cl\'audio Vasconcelos
|
Cl\'audio Vasconcelos and Ant\'onio Ravara
|
The While language
|
15 pages, 21 figures
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents a formalisation of a simple imperative programming
language. The objective is to study and develop "hands-on" a formal
specifcation of a programming language, namely its syntax, operational
semantics and type system. To have an executable version of the language, we
implemented in Racket its operational semantics and type system.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2016 20:30:27 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2016 10:49:48 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Vasconcelos",
"Cláudio",
""
],
[
"Ravara",
"António",
""
]
] |
new_dataset
| 0.997978 |
1604.02748
|
Yuncheng Li
|
Yuncheng Li, Yale Song, Liangliang Cao, Joel Tetreault, Larry
Goldberg, Alejandro Jaimes, Jiebo Luo
|
TGIF: A New Dataset and Benchmark on Animated GIF Description
|
CVPR 2016 Camera Ready
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the recent popularity of animated GIFs on social media, there is need
for ways to index them with rich metadata. To advance research on animated GIF
understanding, we collected a new dataset, Tumblr GIF (TGIF), with 100K
animated GIFs from Tumblr and 120K natural language descriptions obtained via
crowdsourcing. The motivation for this work is to develop a testbed for image
sequence description systems, where the task is to generate natural language
descriptions for animated GIFs or video clips. To ensure a high quality
dataset, we developed a series of novel quality controls to validate free-form
text input from crowdworkers. We show that there is unambiguous association
between visual content and natural language descriptions in our dataset, making
it an ideal benchmark for the visual content captioning task. We perform
extensive statistical analyses to compare our dataset to existing image and
video description datasets. Next, we provide baseline results on the animated
GIF description task, using three representative techniques: nearest neighbor,
statistical machine translation, and recurrent neural networks. Finally, we
show that models fine-tuned from our animated GIF description dataset can be
helpful for automatic movie description.
|
[
{
"version": "v1",
"created": "Sun, 10 Apr 2016 22:15:14 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2016 01:47:19 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Li",
"Yuncheng",
""
],
[
"Song",
"Yale",
""
],
[
"Cao",
"Liangliang",
""
],
[
"Tetreault",
"Joel",
""
],
[
"Goldberg",
"Larry",
""
],
[
"Jaimes",
"Alejandro",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.99987 |
1604.03217
|
Sabrina Nefti
|
Sabrina Nefti, Maamar Sedrati
|
PSNR and Jitter Analysis of Routing Protocols for Video Streaming in
Sparse MANET Networks, using NS2 and the Evalvid Framework
|
International Journal of Computer Science and Information Security,
published in Vol. 14 No. 3 MARCH 2016 International Journal of Computer
Science and Information Security
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advances in multimedia and ad-hoc networking have urged a wealth of research
in multimedia delivery over ad-hoc networks. This comes as no surprise, as
those networks are versatile and beneficial to a plethora of applications where
the use of fully wired network has proved intricate if not impossible, such as
prompt formation of networks during conferences, disaster relief in case of
flood and earthquake, and also in war activities. It this paper, we aim to
investigate the combined impact of network sparsity and network node density on
the Peak Signal Noise to Ratio (PSNR) and jitter performance of proactive and
reactive routing protocols in ad-hoc networks. We also shed light onto the
combined effect of mobility and sparsity on the performance of these protocols.
We validate our results through the use of an integrated Simulator-Evaluator
environment consisting of the Network Simulator NS2, and the Video Evaluation
Framework Evalvid.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 09:07:01 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Nefti",
"Sabrina",
""
],
[
"Sedrati",
"Maamar",
""
]
] |
new_dataset
| 0.971552 |
1604.03234
|
Jia Yu
|
Jia Yu, Mohamed Sarwat
|
Hippo: A Fast, yet Scalable, Database Indexing Approach
|
12 pages, 10 figures, conference
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Even though existing database indexes (e.g., B+-Tree) speed up the query
execution, they suffer from two main drawbacks: (1) A database index usually
yields 5% to 15% additional storage overhead which results in non-ignorable
dollar cost in big data scenarios especially when deployed on modern storage
devices like Solid State Disk (SSD) or Non-Volatile Memory (NVM). (2)
Maintaining a database index incurs high latency because the DBMS has to find
and update those index pages affected by the underlying table changes. This
paper proposes Hippo a fast, yet scalable, database indexing approach. Hippo
only stores the pointers of disk pages along with light weight histogram-based
summaries. The proposed structure significantly shrinks index storage and
maintenance overhead without compromising much on query execution performance.
Experiments, based on real Hippo implementation inside PostgreSQL 9.5, using
the TPC-H benchmark show that Hippo achieves up to two orders of magnitude less
storage space and up to three orders of magnitude less maintenance overhead
than traditional database indexes, i.e., B+-Tree. Furthermore, the experiments
also show that Hippo achieves comparable query execution performance to that of
the B+-Tree for various selectivity factors.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 03:41:17 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Yu",
"Jia",
""
],
[
"Sarwat",
"Mohamed",
""
]
] |
new_dataset
| 0.997507 |
1604.03356
|
Francois Taiani
|
Hicham Lakhlef (ASAP), Michel Raynal (ASAP), Fran\c{c}ois Ta\"iani
(ASAP)
|
Vertex Coloring with Communication and Local Memory Constraints in
Synchronous Broadcast Networks
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vertex coloring problem has received a lot of attention in the context of
synchronous round-based systems where, at each round, a process can send a
message to all its neighbors, and receive a message from each of them. Hence,
this communication model is particularly suited to point-to-point communication
channels. Several vertex coloring algorithms suited to these systems have been
proposed. They differ mainly in the number of rounds they require and the
number of colors they use. This paper considers a broadcast/receive
communication model in which message collisions and message conflicts can occur
(a collision occurs when, during the same round, messages are sent to the same
process by too many neighbors; a conflict occurs when a process and one of its
neighbors broadcast during the same round). This communication model is suited
to systems where processes share communication bandwidths. More precisely,the
paper considers the case where, during a round, a process may either broadcast
a message to its neighbors or receive a message from at most $m$ of them. This
captures communication-related constraints or a local memory constraint stating
that, whatever the number of neighbors of a process, its local memory allows it
to receive and store at most $m$ messages during each round. The paper defines
first the corresponding generic vertex multi-coloring problem (a vertex can
have several colors). It focuses then on tree networks, for which it presents a
lower bound on the number of colors $K$ that are necessary (namely,
$K=\lceil\frac{\Delta}{m}\rceil+1$, where $\Delta$ is the maximal degree of the
communication graph), and an ssociated coloring algorithm, which is optimal
with respect to $K$.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 11:56:07 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Lakhlef",
"Hicham",
"",
"ASAP"
],
[
"Raynal",
"Michel",
"",
"ASAP"
],
[
"Taïani",
"François",
"",
"ASAP"
]
] |
new_dataset
| 0.995366 |
1604.03424
|
Belkacem Bekhiti
|
Belkacem Bekhiti, Abdelhakim Dahimene, Bachir Nail and Kamel Hariche
|
2-DOF block pole placement control application to: have-dash-II missile
|
submit 19 pages 1 figure 5 tables, Journal Indexing team, AIRCC 2016
| null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a multivariable servomechanism design, it is required that the output
vector tracks a certain reference vector while satisfying some desired
transient specifications, for this purpose a 2DOF control law consisting of
state feedback gain and feedforward scaling gain is proposed. The control law
is designed using block pole placement technique by assigning a set of desired
Block poles in different canonical forms. The resulting control is simulated
for linearized model of the HAVE DASH II BTT missile, numerical results are
analyzed and compared in terms of transient response, gain magnitude,
performance robustness, stability robustness and tracking. The suitable
structure for this case study is then selected.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 17:25:26 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Bekhiti",
"Belkacem",
""
],
[
"Dahimene",
"Abdelhakim",
""
],
[
"Nail",
"Bachir",
""
],
[
"Hariche",
"Kamel",
""
]
] |
new_dataset
| 0.996605 |
1604.03427
|
Danica Greetham
|
Nathaniel Charlton, Colin Singleton, Danica Vukadinovi\'c Greetham
|
In the mood: the dynamics of collective sentiments on Twitter
| null | null | null | null |
cs.SI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the relationship between the sentiment levels of Twitter users and
the evolving network structure that the users created by @-mentioning each
other. We use a large dataset of tweets to which we apply three sentiment
scoring algorithms, including the open source SentiStrength program.
Specifically we make three contributions. Firstly we find that people who have
potentially the largest communication reach (according to a dynamic centrality
measure) use sentiment differently than the average user: for example they use
positive sentiment more often and negative sentiment less often. Secondly we
find that when we follow structurally stable Twitter communities over a period
of months, their sentiment levels are also stable, and sudden changes in
community sentiment from one day to the next can in most cases be traced to
external events affecting the community. Thirdly, based on our findings, we
create and calibrate a simple agent-based model that is capable of reproducing
measures of emotive response comparable to those obtained from our empirical
dataset.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 16:24:22 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Charlton",
"Nathaniel",
""
],
[
"Singleton",
"Colin",
""
],
[
"Greetham",
"Danica Vukadinović",
""
]
] |
new_dataset
| 0.965716 |
1604.03470
|
Nikolas Herbst
|
Nikolas Herbst, Rouven Krebs, Giorgos Oikonomou, George Kousiouris,
Athanasia Evangelinou, Alexandru Iosup, and Samuel Kounev
|
Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics
|
SPEC Research Group - Cloud Working Group, Standard Performance
Evaluation Corporation (SPEC)
| null | null |
Technical Report SPEC-RG-2016-01
|
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the past decade, cloud computing has emerged from a pursuit for a
service-driven information and communication technology (ICT), into a
signifcant fraction of the ICT market. Responding to the growth of the market,
many alternative cloud services and their underlying systems are currently
vying for the attention of cloud users and providers. Thus, benchmarking them
is needed, to enable cloud users to make an informed choice, and to enable
system DevOps to tune, design, and evaluate their systems. This requires
focusing on old and new system properties, possibly leading to the re-design of
classic benchmarking metrics, such as expressing performance as throughput and
latency (response time), and the design of new, cloud-specififc metrics.
Addressing this requirement, in this work we focus on four system properties:
(i) elasticity of the cloud service, to accommodate large variations in the
amount of service requested, (ii) performance isolation between the tenants of
shared cloud systems, (iii) availability of cloud services and systems, and the
(iv) operational risk of running a production system in a cloud
environment.Focusing on key metrics, for each of these properties we review the
state-of-the-art, then select or propose new metrics together with measurement
approaches. We see the presented metrics as a foundation towards upcoming,
industry-standard, cloud benchmarks.
Keywords: Cloud Computing; Metrics; Measurement; Benchmarking; Elasticity;
Isolation; Performance; Service Level Objective; Availability; Operational
Risk.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 16:23:15 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Herbst",
"Nikolas",
""
],
[
"Krebs",
"Rouven",
""
],
[
"Oikonomou",
"Giorgos",
""
],
[
"Kousiouris",
"George",
""
],
[
"Evangelinou",
"Athanasia",
""
],
[
"Iosup",
"Alexandru",
""
],
[
"Kounev",
"Samuel",
""
]
] |
new_dataset
| 0.994122 |
1604.03508
|
Andrew Eckford
|
Peter J. Thomas and Andrew W. Eckford
|
Shannon Capacity of Signal Transduction for Multiple Independent
Receptors
|
Accepted for presentation at the 2016 IEEE International Symposium on
Information Theory (ISIT)
| null | null | null |
cs.IT math.IT q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic adenosine monophosphate (cAMP) is considered a model system for signal
transduction, the mechanism by which cells exchange chemical messages. Our
previous work calculated the Shannon capacity of a single cAMP receptor;
however, a typical cell may have thousands of receptors operating in parallel.
In this paper, we calculate the capacity of a cAMP signal transduction system
with an arbitrary number of independent, indistinguishable receptors. By
leveraging prior results on feedback capacity for a single receptor, we show
(somewhat unexpectedly) that the capacity is achieved by an IID input
distribution, and that the capacity for n receptors is n times the capacity for
a single receptor.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 18:33:40 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Thomas",
"Peter J.",
""
],
[
"Eckford",
"Andrew W.",
""
]
] |
new_dataset
| 0.994482 |
1604.03544
|
Michael B. Cohen
|
Michael B. Cohen
|
Ramanujan Graphs in Polynomial Time
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent work by Marcus, Spielman and Srivastava proves the existence of
bipartite Ramanujan (multi)graphs of all degrees and all sizes. However, that
paper did not provide a polynomial time algorithm to actually compute such
graphs. Here, we provide a polynomial time algorithm to compute certain
expected characteristic polynomials related to this construction. This leads to
a deterministic polynomial time algorithm to compute bipartite Ramanujan
(multi)graphs of all degrees and all sizes.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 19:59:18 GMT"
}
] | 2016-04-13T00:00:00 |
[
[
"Cohen",
"Michael B.",
""
]
] |
new_dataset
| 0.999125 |
1109.3524
|
L. A. Barba
|
Simon K Layton and Anush Krishnan and Lorena A. Barba
|
cuIBM -- A GPU-accelerated Immersed Boundary Method
|
Extended paper post-conference, presented at the 23rd International
Conference on Parallel Computational Fluid Dynamics (http://www.parcfd.org),
ParCFD 2011, Barcelona (unpublished)
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A projection-based immersed boundary method is dominated by sparse linear
algebra routines. Using the open-source Cusp library, we observe a speedup
(with respect to a single CPU core) which reflects the constraints of a
bandwidth-dominated problem on the GPU. Nevertheless, GPUs offer the capacity
to solve large problems on commodity hardware. This work includes validation
and a convergence study of the GPU-accelerated IBM, and various optimizations.
|
[
{
"version": "v1",
"created": "Fri, 16 Sep 2011 04:02:15 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Apr 2016 00:39:08 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Layton",
"Simon K",
""
],
[
"Krishnan",
"Anush",
""
],
[
"Barba",
"Lorena A.",
""
]
] |
new_dataset
| 0.998103 |
1402.6407
|
Daniel Lemire
|
Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
|
Better bitmap performance with Roaring bitmaps
| null |
Software: Practice and Experience Volume 46, Issue 5, pages
709-719, May 2016
|
10.1002/spe.2325
| null |
cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Bitmap indexes are commonly used in databases and search engines. By
exploiting bit-level parallelism, they can significantly accelerate queries.
However, they can use much memory, and thus we might prefer compressed bitmap
indexes. Following Oracle's lead, bitmaps are often compressed using run-length
encoding (RLE). Building on prior work, we introduce the Roaring compressed
bitmap format: it uses packed arrays for compression instead of RLE. We compare
it to two high-performance RLE-based bitmap encoding techniques: WAH (Word
Aligned Hybrid compression scheme) and Concise (Compressed `n' Composable
Integer Set). On synthetic and real data, we find that Roaring bitmaps (1)
often compress significantly better (e.g., 2 times) and (2) are faster than the
compressed alternatives (up to 900 times faster for intersections). Our results
challenge the view that RLE-based bitmap compression is best.
|
[
{
"version": "v1",
"created": "Wed, 26 Feb 2014 04:38:22 GMT"
},
{
"version": "v10",
"created": "Tue, 15 Mar 2016 19:31:53 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Feb 2014 23:34:18 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Mar 2014 22:45:23 GMT"
},
{
"version": "v4",
"created": "Fri, 6 Jun 2014 17:55:23 GMT"
},
{
"version": "v5",
"created": "Wed, 19 Nov 2014 18:25:55 GMT"
},
{
"version": "v6",
"created": "Tue, 2 Dec 2014 19:17:31 GMT"
},
{
"version": "v7",
"created": "Wed, 3 Dec 2014 15:36:12 GMT"
},
{
"version": "v8",
"created": "Wed, 11 Mar 2015 17:50:04 GMT"
},
{
"version": "v9",
"created": "Sat, 28 Mar 2015 14:45:00 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Chambi",
"Samy",
""
],
[
"Lemire",
"Daniel",
""
],
[
"Kaser",
"Owen",
""
],
[
"Godin",
"Robert",
""
]
] |
new_dataset
| 0.992096 |
1511.04164
|
Ronghang Hu
|
Ronghang Hu, Huazhe Xu, Marcus Rohrbach, Jiashi Feng, Kate Saenko,
Trevor Darrell
|
Natural Language Object Retrieval
|
Proceedings of the IEEE Conference on Computer Vision and Pattern
Recognition, 2016
| null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the task of natural language object retrieval, to
localize a target object within a given image based on a natural language query
of the object. Natural language object retrieval differs from text-based image
retrieval task as it involves spatial information about objects within the
scene and global scene context. To address this issue, we propose a novel
Spatial Context Recurrent ConvNet (SCRC) model as scoring function on candidate
boxes for object retrieval, integrating spatial configurations and global
scene-level contextual information into the network. Our model processes query
text, local image descriptors, spatial configurations and global context
features through a recurrent network, outputs the probability of the query text
conditioned on each candidate box as a score for the box, and can transfer
visual-linguistic knowledge from image captioning domain to our task.
Experimental results demonstrate that our method effectively utilizes both
local and global information, outperforming previous baseline methods
significantly on different datasets and scenarios, and can exploit large scale
vision and language datasets for knowledge transfer.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 05:53:37 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 20:12:44 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Apr 2016 03:36:58 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Hu",
"Ronghang",
""
],
[
"Xu",
"Huazhe",
""
],
[
"Rohrbach",
"Marcus",
""
],
[
"Feng",
"Jiashi",
""
],
[
"Saenko",
"Kate",
""
],
[
"Darrell",
"Trevor",
""
]
] |
new_dataset
| 0.992486 |
1512.01815
|
Lior Wolf
|
David Gadot, Lior Wolf
|
PatchBatch: a Batch Augmented Loss for Optical Flow
|
CVPR 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new pipeline for optical flow computation, based on Deep
Learning techniques. We suggest using a Siamese CNN to independently, and in
parallel, compute the descriptors of both images. The learned descriptors are
then compared efficiently using the L2 norm and do not require network
processing of patch pairs. The success of the method is based on an innovative
loss function that computes higher moments of the loss distributions for each
training batch. Combined with an Approximate Nearest Neighbor patch matching
method and a flow interpolation technique, state of the art performance is
obtained on the most challenging and competitive optical flow benchmarks.
|
[
{
"version": "v1",
"created": "Sun, 6 Dec 2015 18:30:28 GMT"
},
{
"version": "v2",
"created": "Sun, 10 Apr 2016 14:17:18 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Gadot",
"David",
""
],
[
"Wolf",
"Lior",
""
]
] |
new_dataset
| 0.972599 |
1604.02480
|
Panagiotis Vekris
|
Panagiotis Vekris, Benjamin Cosman, Ranjit Jhala
|
Refinement Types for TypeScript
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Refined TypeScript (RSC), a lightweight refinement type system for
TypeScript, that enables static verification of higher-order, imperative
programs. We develop a formal core of RSC that delineates the interaction
between refinement types and mutability. Next, we extend the core to account
for the imperative and dynamic features of TypeScript. Finally, we evaluate RSC
on a set of real world benchmarks, including parts of the Octane benchmarks,
D3, Transducers, and the TypeScript compiler.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 20:50:15 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Vekris",
"Panagiotis",
""
],
[
"Cosman",
"Benjamin",
""
],
[
"Jhala",
"Ranjit",
""
]
] |
new_dataset
| 0.997414 |
1604.02511
|
Liangtian Wan
|
Liangtian Wan and Guangjie Han and Jinfang Jiang and Lei Shu
|
Optimal Design of Compact Receive Array in Industrial Wireless Sensor
Networks
|
5 page, 8 figures, accepted by VTC Spring 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the development of wireless communication, industrial wireless sensor
networks (IWSNs) plays an important role in monitoring and control systems. In
this paper, we extend the application of IWSNs into High Frequency Surface-Wave
Radar (HFSWR) system. The traditional antenna is replaced by mobile IWSNs. In
combination of the application precondition of super-directivity in HF band and
circular topology of IWSNs, a super-directivity synthesis method is presented
for designing super-directivity array. In this method, the dominance of
external noise is ensured by constraining the Ratio of External to Internal
Noise (REIN) of the array, and the desired side lobe level is achieved by
implementing linear constraint. By using this method, the highest directivity
will be achieved in certain conditions. Using the designed super directive
circular array as sub-arrays, the compact receive antenna array is constructed,
the purpose of miniaturization is achieved. Simulation verifies that the
proposed method is correct and effective, the validity of the proposed method
has been proved.
|
[
{
"version": "v1",
"created": "Sat, 9 Apr 2016 02:12:10 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Wan",
"Liangtian",
""
],
[
"Han",
"Guangjie",
""
],
[
"Jiang",
"Jinfang",
""
],
[
"Shu",
"Lei",
""
]
] |
new_dataset
| 0.994696 |
1604.02518
|
Kaifeng Han
|
Kaifeng Han and Kaibin Huang
|
Wirelessly Powered Backscatter Communication Networks: Modeling,
Coverage and Capacity
|
7 pages, 7 figures, submitted to IEEE GLOBECOM 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Future Internet-of-Things (IoT) will connect billions of small computing
devices embedded in the environment and support their device-to-device (D2D)
communication. Powering this massive number of embedded devices is a key
challenge of designing IoT since batteries increase the devices' form factors
and their recharging/replacement is difficult. To tackle this challenge, we
propose a novel network architecture that integrates wireless power transfer
and backscatter communication, called wirelessly powered backscatter
communication (WP-BC) networks. In this architecture, power beacons (PBs) are
deployed for wirelessly powering devices; their ad-hoc communication relies on
backscattering and modulating incident continuous waves from PBs, which
consumes orders-of-magnitude less power than traditional radios. Thereby, the
dense deployment of low-complexity PBs with high transmission power can power a
large-scale IoT. In this paper, a WP-BC network is modeled as a random Poisson
cluster process in the horizontal plane where PBs are Poisson distributed and
active ad-hoc pairs of backscatter communication nodes with fixed separation
distances form random clusters centered at PBs. Furthermore, by harvesting
energy from and backscattering radio frequency (RF) waves transmitted by PBs,
the transmission power of each node depends on the distance from the associated
PB. Applying stochastic geometry, the network coverage probability and
transmission capacity are derived and optimized as functions of the backscatter
duty cycle and reflection coefficient as well as the PB density. The effects of
the parameters on network performance are characterized.
|
[
{
"version": "v1",
"created": "Sat, 9 Apr 2016 03:48:02 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Han",
"Kaifeng",
""
],
[
"Huang",
"Kaibin",
""
]
] |
new_dataset
| 0.950893 |
1604.02605
|
Mohammed El-Kebir
|
Mohammed El-Kebir and Gryte Satas and Layla Oesper and Benjamin J.
Raphael
|
Multi-State Perfect Phylogeny Mixture Deconvolution and Applications to
Cancer Sequencing
|
RECOMB 2016
| null | null | null |
cs.DS q-bio.GN q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The reconstruction of phylogenetic trees from mixed populations has become
important in the study of cancer evolution, as sequencing is often performed on
bulk tumor tissue containing mixed populations of cells. Recent work has shown
how to reconstruct a perfect phylogeny tree from samples that contain mixtures
of two-state characters, where each character/locus is either mutated or not.
However, most cancers contain more complex mutations, such as copy-number
aberrations, that exhibit more than two states. We formulate the Multi-State
Perfect Phylogeny Mixture Deconvolution Problem of reconstructing a multi-state
perfect phylogeny tree given mixtures of the leaves of the tree. We
characterize the solutions of this problem as a restricted class of spanning
trees in a graph constructed from the input data, and prove that the problem is
NP-complete. We derive an algorithm to enumerate such trees in the important
special case of cladisitic characters, where the ordering of the states of each
character is given. We apply our algorithm to simulated data and to two cancer
datasets. On simulated data, we find that for a small number of samples, the
Multi-State Perfect Phylogeny Mixture Deconvolution Problem often has many
solutions, but that this ambiguity declines quickly as the number of samples
increases. On real data, we recover copy-neutral loss of heterozygosity,
single-copy amplification and single-copy deletion events, as well as their
interactions with single-nucleotide variants.
|
[
{
"version": "v1",
"created": "Sat, 9 Apr 2016 20:00:07 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"El-Kebir",
"Mohammed",
""
],
[
"Satas",
"Gryte",
""
],
[
"Oesper",
"Layla",
""
],
[
"Raphael",
"Benjamin J.",
""
]
] |
new_dataset
| 0.991035 |
1604.02660
|
Xiaohu Ge
|
Xiaohu Ge, Hui Cheng, Guoqiang Mao, Yang Yang, Song Tu
|
Vehicular Communications for 5G Cooperative Small Cell Networks
|
13 pages, 11 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cooperative transmission is an effective approach for vehicular
communications to improve the wireless transmission capacity and reliability in
the fifth generation (5G) small cell networks. Based on distances between the
vehicle and cooperative small cell BSs, the cooperative probability and the
coverage probability have been derived for 5G cooperative small cell networks
where small cell base stations (BSs) follow Poisson point process
distributions. Furthermore, the vehicular handoff rate and the vehicular
overhead ratio have been proposed to evaluate the vehicular mobility
performance in 5G cooperative small cell networks. To balance the vehicular
communication capacity and the vehicular handoff ratio, an optimal vehicular
overhead ratio can be achieved by adjusting the cooperative threshold of 5G
cooperative small cell networks.
|
[
{
"version": "v1",
"created": "Sun, 10 Apr 2016 09:51:18 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Ge",
"Xiaohu",
""
],
[
"Cheng",
"Hui",
""
],
[
"Mao",
"Guoqiang",
""
],
[
"Yang",
"Yang",
""
],
[
"Tu",
"Song",
""
]
] |
new_dataset
| 0.989242 |
1604.02723
|
Deborah Cohen
|
Shahar Stein, Or Yair, Deborah Cohen and Yonina C. Eldar
|
CaSCADE: Compressed Carrier and DOA Estimation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing and direction of arrival (DOA) estimation have been
thoroughly investigated, both separately and as a joint task. Estimating the
support of a set of signals and their DOAs is crucial to many signal processing
applications, such as Cognitive Radio (CR). A challenging scenario, faced by
CRs, is that of multiband signals, composed of several narrowband transmissions
spread over a wide spectrum each with unknown carrier frequencies and DOAs. The
Nyquist rate of such signals is high and constitutes a bottleneck both in the
analog and digital domains. To alleviate the sampling rate issue, several
sub-Nyquist sampling methods, such as multicoset sampling or the modulated
wideband converter (MWC), have been proposed in the context of spectrum
sensing. In this work, we first suggest an alternative sub-Nyquist sampling and
signal reconstruction method to the MWC, based on a uniform linear array (ULA).
We then extend our approach to joint spectrum sensing and DOA estimation and
propose the CompreSsed CArrier and DOA Estimation (CaSCADE) system, composed of
an L-shaped array with two ULAs. In both cases, we derive perfect recovery
conditions of the signal parameters (carrier frequencies and DOAs if relevant)
and the signal itself and provide two reconstruction algorithms, one based on
the ESPRIT method and the second on compressed sensing techniques. Both our
joint carriers and DOAs recovery algorithms overcome the well-known pairing
issue between the two parameters. Simulations demonstrate that our alternative
spectrum sensing system outperforms the MWC in terms of recovery error and
design complexity and show joint carrier frequencies and DOAs from our CaSCADE
system's sub-Nyquist samples.
|
[
{
"version": "v1",
"created": "Sun, 10 Apr 2016 18:54:56 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Stein",
"Shahar",
""
],
[
"Yair",
"Or",
""
],
[
"Cohen",
"Deborah",
""
],
[
"Eldar",
"Yonina C.",
""
]
] |
new_dataset
| 0.970524 |
1604.02801
|
Ruizhe Wang
|
Ruizhe Wang, Lingyu Wei, Etienne Vouga, Qixing Huang, Duygu Ceylan,
Gerard Medioni and Hao Li
|
Capturing Dynamic Textured Surfaces of Moving Targets
|
22 pages, 12 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an end-to-end system for reconstructing complete watertight and
textured models of moving subjects such as clothed humans and animals, using
only three or four handheld sensors. The heart of our framework is a new
pairwise registration algorithm that minimizes, using a particle swarm
strategy, an alignment error metric based on mutual visibility and occlusion.
We show that this algorithm reliably registers partial scans with as little as
15% overlap without requiring any initial correspondences, and outperforms
alternative global registration algorithms. This registration algorithm allows
us to reconstruct moving subjects from free-viewpoint video produced by
consumer-grade sensors, without extensive sensor calibration, constrained
capture volume, expensive arrays of cameras, or templates of the subject
geometry.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 06:03:09 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Wang",
"Ruizhe",
""
],
[
"Wei",
"Lingyu",
""
],
[
"Vouga",
"Etienne",
""
],
[
"Huang",
"Qixing",
""
],
[
"Ceylan",
"Duygu",
""
],
[
"Medioni",
"Gerard",
""
],
[
"Li",
"Hao",
""
]
] |
new_dataset
| 0.972704 |
1604.02808
|
Amir Shahroudy
|
Amir Shahroudy, Jun Liu, Tian-Tsong Ng, Gang Wang
|
NTU RGB+D: A Large Scale Dataset for 3D Human Activity Analysis
|
10 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent approaches in depth-based human activity analysis achieved outstanding
performance and proved the effectiveness of 3D representation for
classification of action classes. Currently available depth-based and
RGB+D-based action recognition benchmarks have a number of limitations,
including the lack of training samples, distinct class labels, camera views and
variety of subjects. In this paper we introduce a large-scale dataset for RGB+D
human action recognition with more than 56 thousand video samples and 4 million
frames, collected from 40 distinct subjects. Our dataset contains 60 different
action classes including daily, mutual, and health-related actions. In
addition, we propose a new recurrent neural network structure to model the
long-term temporal correlation of the features for each body part, and utilize
them for better action classification. Experimental results show the advantages
of applying deep learning methods over state-of-the-art hand-crafted features
on the suggested cross-subject and cross-view evaluation criteria for our
dataset. The introduction of this large scale dataset will enable the community
to apply, develop and adapt various data-hungry learning techniques for the
task of depth-based and RGB+D-based human activity analysis.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 06:44:53 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Shahroudy",
"Amir",
""
],
[
"Liu",
"Jun",
""
],
[
"Ng",
"Tian-Tsong",
""
],
[
"Wang",
"Gang",
""
]
] |
new_dataset
| 0.999819 |
1604.02847
|
Costin Raiciu
|
Radu Stoenescu, Matei Popovici, Lorina Negreanu and Costin Raiciu
|
SymNet: scalable symbolic execution for modern networks
|
13 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present SymNet, a network static analysis tool based on symbolic
execution. SymNet quickly analyzes networks by injecting symbolic packets and
tracing their path through the network. Our key novelty is SEFL, a language we
designed for network processing that is symbolic-execution friendly.
SymNet is easy to use: we have developed parsers that automatically generate
SEFL models from router and switch tables, firewall configurations and
arbitrary Click modular router configurations. Most of our models are exact and
have optimal branching factor. Finally, we built a testing tool that checks
SEFL models conform to the real implementation. SymNet can check networks
containing routers with hundreds of thousands of prefixes and NATs in seconds,
while ensuring packet header memory-safety and capturing network functionality
such as dynamic tunneling, stateful processing and encryption. We used SymNet
to debug middlebox interactions documented in the literature, to check our
department's network and the Stanford backbone network. Results show that
symbolic execution is fast and more accurate than existing static analysis
tools.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 09:08:24 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Stoenescu",
"Radu",
""
],
[
"Popovici",
"Matei",
""
],
[
"Negreanu",
"Lorina",
""
],
[
"Raiciu",
"Costin",
""
]
] |
new_dataset
| 0.992736 |
1604.02852
|
Rongpeng Li
|
Rongpeng Li, Yan Chen, Geoffrey Ye Li, Guangyi Liu
|
Full-Duplex Cellular Networks: It Works!
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Full-duplex (FD) communications with bidirectional transmitting and receiving
at the same time and frequency radio resource have long been deemed a promising
way to boost spectrum efficiency, but hindered by the techniques for
self-interference cancellation (SIC). Recent breakthroughs in analog and
digital signal processing yield the feasibility of beyond $100$ dB SIC
capability and make it possible for FD communications to demonstrate nearly
doubled spectrum efficiency for point-to-point links. Now it is time to shift
at least partial of our focus to full duplex networking, such as in cellular
networks, since it is not straightforward but demanding novel and more
complicated interference management techniques. Before putting FD networking
into practice, we need to understand that what scenarios FD communications
should be applied in under the current technology maturity, how bad the
performance will be if we do nothing to deal with the newly introduced
interference, and most importantly, how much improvement could be achieved
after applying advanced solutions. This article will shed light on these
questions.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 09:21:10 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Li",
"Rongpeng",
""
],
[
"Chen",
"Yan",
""
],
[
"Li",
"Geoffrey Ye",
""
],
[
"Liu",
"Guangyi",
""
]
] |
new_dataset
| 0.985973 |
1604.02934
|
Racha El-Hajj
|
Racha El-Hajj (UL, Heudiasyc, Labex MS2T), Duc-Cuong Dang (Heudiasyc,
Labex MS2T, UON), Aziz Moukrim (Labex MS2T, Heudiasyc)
|
Solving the Team Orienteering Problem with Cutting Planes
| null |
Computers and Operations Research, Elsevier, 2016, pp.27
|
10.1016/j.cor.2016.04.008
| null |
cs.RO cs.DS math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle
Routing Problem (VRP). The aim is to select customers and at the same time
organize the visits for a vehicle fleet so as to maximize the collected profits
and subject to a travel time restriction on each vehicle. In this paper, we
investigate the effective use of a linear formulation with polynomial number of
variables to solve TOP. Cutting planes are the core components of our solving
algorithm. It is first used to solve smaller and intermediate models of the
original problem by considering fewer vehicles. Useful information are then
retrieved to solve larger models, and eventually reaching the original problem.
Relatively new and dedicated methods for TOP, such as identification of
irrelevant arcs and mandatory customers, clique and independent-set cuts based
on the incompatibilities, and profit/customer restriction on subsets of
vehicles, are introduced. We evaluated our algorithm on the standard benchmark
of TOP. The results show that the algorithm is competitive and is able to prove
the optimality for 12 instances previously unsolved.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 13:08:48 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"El-Hajj",
"Racha",
"",
"UL, Heudiasyc, Labex MS2T"
],
[
"Dang",
"Duc-Cuong",
"",
"Heudiasyc,\n Labex MS2T, UON"
],
[
"Moukrim",
"Aziz",
"",
"Labex MS2T, Heudiasyc"
]
] |
new_dataset
| 0.990035 |
1604.02949
|
Marin\^es Guerreiro
|
J. J. Bernal, M. Guerreiro, J. J. Sim\'on
|
Ds-bounds for cyclic codes: new bounds for abelian codes
|
Submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we develop a technique to extend any bound for cyclic codes
constructed from its defining sets (ds-bounds) to abelian (or multivariate)
codes. We use this technique to improve the searching of new bounds for abelian
codes.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 13:40:24 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Bernal",
"J. J.",
""
],
[
"Guerreiro",
"M.",
""
],
[
"Simón",
"J. J.",
""
]
] |
new_dataset
| 0.997842 |
1604.02967
|
Chunlei Li
|
Yongbo Xia and Chunlei Li
|
Three-Weight Ternary Linear Codes from a Family of Monomials
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on a generic construction, two classes of ternary three-weight linear
codes are obtained from a family of power functions, including some APN power
functions. The weight distributions of these linear codes are determined
through studying the properties of some exponential sum related to the proposed
power functions.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 14:10:17 GMT"
}
] | 2016-04-12T00:00:00 |
[
[
"Xia",
"Yongbo",
""
],
[
"Li",
"Chunlei",
""
]
] |
new_dataset
| 0.998878 |
1404.0298
|
Shaofeng Zou
|
Shaofeng Zou, Yingbin Liang, H. Vincent Poor
|
A Kernel-Based Nonparametric Test for Anomaly Detection over Line
Networks
|
This paper has been withdrawn because we have submitted a complete
version. The complete version is arXiv:1604.01351
| null | null | null |
cs.IT math.IT stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The nonparametric problem of detecting existence of an anomalous interval
over a one dimensional line network is studied. Nodes corresponding to an
anomalous interval (if exists) receive samples generated by a distribution q,
which is different from the distribution p that generates samples for other
nodes. If anomalous interval does not exist, then all nodes receive samples
generated by p. It is assumed that the distributions p and q are arbitrary, and
are unknown. In order to detect whether an anomalous interval exists, a test is
built based on mean embeddings of distributions into a reproducing kernel
Hilbert space (RKHS) and the metric of maximummean discrepancy (MMD). It is
shown that as the network size n goes to infinity, if the minimum length of
candidate anomalous intervals is larger than a threshold which has the order
O(log n), the proposed test is asymptotically successful, i.e., the probability
of detection error approaches zero asymptotically. An efficient algorithm to
perform the test with substantial computational complexity reduction is
proposed, and is shown to be asymptotically successful if the condition on the
minimum length of candidate anomalous interval is satisfied. Numerical results
are provided, which are consistent with the theoretical results.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 16:12:51 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 20:28:29 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Zou",
"Shaofeng",
""
],
[
"Liang",
"Yingbin",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.9668 |
1501.00166
|
Yaser Sadra
|
Sodeif Ahadpour, Yaser Sadra
|
Chaotic trigonometric Haar wavelet with focus on image encryption
|
Accepted in Journal of Discrete Mathematical Sciences and
Cryptography, 10pages, 9 figures,2 table
| null | null | null |
cs.CR nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, after reviewing the main points of Haar wavelet transform and
chaotic trigonometric maps, we introduce a new perspective of Haar wavelet
transform. The essential idea of the paper is given linearity properties of the
scaling function of the Haar wavelet. With regard to applications of Haar
wavelet transform in image processing, we introduce chaotic trigonometric Haar
wavelet transform to encrypt the plain images. In addition, the encrypted
images based on a proposed algorithm were made. To evaluate the security of the
encrypted images, the key space analysis, the correlation coefficient analysis
and differential attack were performed. Here, the chaotic trigonometric Haar
wavelet transform tries to improve the problem of failure of encryption such as
small key space and level of security.
|
[
{
"version": "v1",
"created": "Wed, 31 Dec 2014 16:28:28 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Jul 2015 06:46:29 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Apr 2016 05:12:25 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Ahadpour",
"Sodeif",
""
],
[
"Sadra",
"Yaser",
""
]
] |
new_dataset
| 0.99292 |
1501.06479
|
Prasant Misra
|
Sabarish Sridhar, Prasant Misra, Gurinder Singh Gill, Jay Warrior
|
CheepSync: A Time Synchronization Service for Resource Constrained
Bluetooth Low Energy Advertisers
| null |
IEEE Communications Magazine, vol. 54, no. 1, pp. 136-143, January
2016
|
10.1109/MCOM.2016.7378439
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Clock synchronization is highly desirable in distributed systems, including
many applications in the Internet of Things and Humans (IoTH). It improves the
efficiency, modularity and scalability of the system, and optimizes use of
event triggers. For IoTH, Bluetooth Low Energy (BLE) - a subset of the recent
Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for
sensor data collection with ubiquitous units (e.g., smartphones and tablets)
carried by humans. This fundamental design paradigm of BLE is enabled by a
range of broadcast advertising modes. While its operational benefits are
numerous, the lack of a common time reference in the broadcast mode of BLE has
been a fundamental limitation. This paper presents and describes CheepSync: a
time synchronization service for BLE advertisers, especially tailored for
applications requiring high time precision on resource constrained BLE
platforms. Designed on top of the existing Bluetooth v4.0 standard, the
CheepSync framework utilizes low-level timestamping and comprehensive error
compensation mechanisms for overcoming uncertainties in message transmission,
clock drift and other system specific constraints. CheepSync was implemented on
custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial
off-the-shelf Android ported smartphones (as passive listeners). We demonstrate
the efficacy of CheepSync by numerous empirical evaluations in a variety of
experimental setups, and show that its average (single-hop) time
synchronization accuracy is in the 10us range.
|
[
{
"version": "v1",
"created": "Mon, 26 Jan 2015 16:52:40 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Apr 2016 10:15:18 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Sridhar",
"Sabarish",
""
],
[
"Misra",
"Prasant",
""
],
[
"Gill",
"Gurinder Singh",
""
],
[
"Warrior",
"Jay",
""
]
] |
new_dataset
| 0.998785 |
1506.05217
|
Mohsin Junaid
|
Mohsin Junaid, Donggang Liu and David Kung
|
Dexteroid: Detecting Malicious Behaviors in Android Apps Using
Reverse-Engineered Life Cycle Models
| null |
Computers & Security, Volume 59,Pages 92-117, ISSN 0167-4048, June
2016
|
10.1016/j.cose.2016.01.008
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The amount of Android malware has increased greatly during the last few
years. Static analysis is widely used in detecting such malware by analyzing
the code without execution. The effectiveness of current tools relies on the
app model as well as the malware detection algorithm which analyzes the app
model. If the model and/or the algorithm is inadequate, then sophisticated
attacks that are triggered by specific sequences of events will not be
detected.
This paper presents a static analysis framework called Dexteroid, which uses
reverse-engineered life cycle models to accurately capture the behaviors of
Android components. Dexteroid systematically derives event sequences from the
models, and uses them to detect attacks launched by specific ordering of
events. A prototype implementation of Dexteroid detects two types of attacks:
(1) leakage of private information, and (2) sending SMS to premium-rate
numbers. A series of experiments are conducted on 1526 Google Play apps, 1259
Genome Malware apps, and a suite of benchmark apps called DroidBench and the
results are compared with a state-of-the-art static analysis tool called
FlowDroid. The evaluation results show that the proposed framework is effective
and efficient in terms of precision, recall, and execution time.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2015 06:38:37 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Apr 2016 19:38:43 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Junaid",
"Mohsin",
""
],
[
"Liu",
"Donggang",
""
],
[
"Kung",
"David",
""
]
] |
new_dataset
| 0.999442 |
1604.02005
|
Yaohua Xie
|
Yaohua Xie, Danli Wang, Li Hao
|
MPP3D: Multi-Precision Pointing using the 3rd Dimension
|
10 pages, 16 figures, 2 tables
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distant pointing is still not efficient, accurate or flexible enough for many
applications, although many researchers have focused on it. To improve upon
distant pointing, we propose MPP3D, which is especially suitable for
high-resolution displays. MPP3D uses two dimensions of hand positioning to move
a pointer, and it also uses the third dimension to adjust the precision of the
movement. Based on the idea of MPP3D, we propose four techniques which combine
two ways of mapping and two techniques for precision adjustment. We further
provide three types of mapping scheme and visual feedback for each technique.
The potential of the proposed techniques was investigated through
experimentation. The results show that these techniques were competent for
usual computer operations with a cursor, and the adjustment for pointing
precision was beneficial for both pointing efficiency and accuracy.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 14:06:18 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Apr 2016 05:16:05 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Xie",
"Yaohua",
""
],
[
"Wang",
"Danli",
""
],
[
"Hao",
"Li",
""
]
] |
new_dataset
| 0.997334 |
1604.02253
|
Erlend Magnus Viggen
|
Tor Arne Reinen, Arne Lie, Finn Tore Knudsen
|
SensIs - Underwater acoustic network for ice-monitoring
|
10 pages, 5 figures, 2 tables; part of the Proceedings of the 39th
Scandinavian Symposium on Physical Acoustics (arXiv:1604.01763)
| null | null | null |
cs.NI physics.ao-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Routing for low latency underwater acoustic network-communication is
investigated. The application is monitoring of ice-threats to offshore
operations in the Arctic - to provide warnings that enable operators to react
to such threats. The scenario produces relatively high traffic load, and the
network should favour low delay and adequate reliability rather than energy
usage minimization. The ICRP (Information-Carrying based Routing Protocol),
originally proposed by Wei Liang et al. in 2007, is chosen as basis. ICRP
obtains unicast routing paths by sending data payload as broadcast packets when
no route information is available. Thus, data can be delivered without the cost
of reactive signalling latency. In this paper we explore the capabilities of a
slightly enhanced/adapted ICRP, tailored to the ice monitoring application. By
simulations and experiments at sea it is demonstrated that the protocol
performs well and can manage the applications high traffic load - this provided
that the point-to-point links provide sufficient bit rates and capacity
headroom.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 07:25:47 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Reinen",
"Tor Arne",
""
],
[
"Lie",
"Arne",
""
],
[
"Knudsen",
"Finn Tore",
""
]
] |
new_dataset
| 0.9977 |
1604.02380
|
Mahdi Jafari Siavoshani
|
Mahdi Jafari Siavoshani, Shaunak Mishra, Christina Fragouli, Suhas N.
Diggavi
|
Group secret key agreement over state-dependent wireless broadcast
channels
|
27 pages, 6 figures, submitted for publication
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a group of $m$ trusted and authenticated nodes that aim to create
a shared secret key $K$ over a wireless channel in the presence of an
eavesdropper Eve. We assume that there exists a state dependent wireless
broadcast channel from one of the honest nodes to the rest of them including
Eve. All of the trusted nodes can also discuss over a cost-free, noiseless and
unlimited rate public channel which is also overheard by Eve. For this setup,
we develop an information-theoretically secure secret key agreement protocol.
We show the optimality of this protocol for "linear deterministic" wireless
broadcast channels. This model generalizes the packet erasure model studied in
literature for wireless broadcast channels. For "state-dependent Gaussian"
wireless broadcast channels, we propose an achievability scheme based on a
multi-layer wiretap code. Finding the best achievable secret key generation
rate leads to solving a non-convex power allocation problem. We show that using
a dynamic programming algorithm, one can obtain the best power allocation for
this problem. Moreover, we prove the optimality of the proposed achievability
scheme for the regime of high-SNR and large-dynamic range over the channel
states in the (generalized) degrees of freedom sense.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 15:41:10 GMT"
}
] | 2016-04-11T00:00:00 |
[
[
"Siavoshani",
"Mahdi Jafari",
""
],
[
"Mishra",
"Shaunak",
""
],
[
"Fragouli",
"Christina",
""
],
[
"Diggavi",
"Suhas N.",
""
]
] |
new_dataset
| 0.983367 |
1601.06468
|
Lakshmi Natarajan Dr
|
Lakshmi Natarajan and Yi Hong and Emanuele Viterbo
|
New Error Correcting Codes for Informed Receivers
|
Accepted for publication in 2016 IEEE International Symposium on
Information Theory (ISIT), Barcelona. Keywords: Cyclic codes, index coding,
informed receivers, maximum distance separable codes, side information
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct error correcting codes for jointly transmitting a finite set of
independent messages to an 'informed receiver' which has prior knowledge of the
values of some subset of the messages as side information. The transmitter is
oblivious to the message subset already known to the receiver and performs
encoding in such a way that any possible side information can be used
efficiently at the decoder. We construct and identify several families of
algebraic error correcting codes for this problem using cyclic and maximum
distance separable (MDS) codes. The proposed codes are of short block length,
many of them provide optimum or near-optimum error correction capabilities and
guarantee larger minimum distances than known codes of similar parameters for
informed receivers. The constructed codes are also useful as error correcting
codes for index coding when the transmitter does not know the side information
available at the receivers.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 02:44:09 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 10:11:55 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Natarajan",
"Lakshmi",
""
],
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.998222 |
1602.06627
|
Chengyu Lin
|
Chengyu Lin, Shengyu Zhang
|
Sensitivity Conjecture and Log-rank Conjecture for functions with small
alternating numbers
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Sensitivity Conjecture and the Log-rank Conjecture are among the most
important and challenging problems in concrete complexity. Incidentally, the
Sensitivity Conjecture is known to hold for monotone functions, and so is the
Log-rank Conjecture for $f(x \wedge y)$ and $f(x\oplus y)$ with monotone
functions $f$, where $\wedge$ and $\oplus$ are bit-wise AND and XOR,
respectively. In this paper, we extend these results to functions $f$ which
alternate values for a relatively small number of times on any monotone path
from $0^n$ to $1^n$. These deepen our understandings of the two conjectures,
and contribute to the recent line of research on functions with small
alternating numbers.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 02:14:26 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 06:12:25 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Lin",
"Chengyu",
""
],
[
"Zhang",
"Shengyu",
""
]
] |
new_dataset
| 0.970683 |
1604.01685
|
Marius Cordts
|
Marius Cordts, Mohamed Omran, Sebastian Ramos, Timo Rehfeld, Markus
Enzweiler, Rodrigo Benenson, Uwe Franke, Stefan Roth, Bernt Schiele
|
The Cityscapes Dataset for Semantic Urban Scene Understanding
|
Includes supplemental material
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual understanding of complex urban street scenes is an enabling factor for
a wide range of applications. Object detection has benefited enormously from
large-scale datasets, especially in the context of deep learning. For semantic
urban scene understanding, however, no current dataset adequately captures the
complexity of real-world urban scenes.
To address this, we introduce Cityscapes, a benchmark suite and large-scale
dataset to train and test approaches for pixel-level and instance-level
semantic labeling. Cityscapes is comprised of a large, diverse set of stereo
video sequences recorded in streets from 50 different cities. 5000 of these
images have high quality pixel-level annotations; 20000 additional images have
coarse annotations to enable methods that leverage large volumes of
weakly-labeled data. Crucially, our effort exceeds previous attempts in terms
of dataset size, annotation richness, scene variability, and complexity. Our
accompanying empirical study provides an in-depth analysis of the dataset
characteristics, as well as a performance evaluation of several
state-of-the-art approaches based on our benchmark.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 16:34:33 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 15:39:22 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Cordts",
"Marius",
""
],
[
"Omran",
"Mohamed",
""
],
[
"Ramos",
"Sebastian",
""
],
[
"Rehfeld",
"Timo",
""
],
[
"Enzweiler",
"Markus",
""
],
[
"Benenson",
"Rodrigo",
""
],
[
"Franke",
"Uwe",
""
],
[
"Roth",
"Stefan",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.999882 |
1604.01787
|
Yanwei Cui
|
Yanwei Cui, Laetitia Chapel, S\'ebastien Lef\`evre
|
A Subpath Kernel for Learning Hierarchical Image Representations
|
10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China,
May 13-15, 2015. Proceedings
| null |
10.1007/978-3-319-18224-7_4
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tree kernels have demonstrated their ability to deal with hierarchical data,
as the intrinsic tree structure often plays a discriminative role. While such
kernels have been successfully applied to various domains such as nature
language processing and bioinformatics, they mostly concentrate on ordered
trees and whose nodes are described by symbolic data. Meanwhile, hierarchical
representations have gained increasing interest to describe image content. This
is particularly true in remote sensing, where such representations allow for
revealing different objects of interest at various scales through a tree
structure. However, the induced trees are unordered and the nodes are equipped
with numerical features. In this paper, we propose a new structured kernel for
hierarchical image representations which is built on the concept of subpath
kernel. Experimental results on both artificial and remote sensing datasets
show that the proposed kernel manages to deal with the hierarchical nature of
the data, leading to better classification rates.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 20:04:17 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Cui",
"Yanwei",
""
],
[
"Chapel",
"Laetitia",
""
],
[
"Lefèvre",
"Sébastien",
""
]
] |
new_dataset
| 0.988268 |
1604.01891
|
Xiaohang Ren
|
Xiaohang Ren, Kai Chen and Jun Sun
|
A CNN Based Scene Chinese Text Recognition Algorithm With Synthetic Data
Engine
|
2 pages, DAS 2016 short paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scene text recognition plays an important role in many computer vision
applications. The small size of available public available scene text datasets
is the main challenge when training a text recognition CNN model. In this
paper, we propose a CNN based Chinese text recognition algorithm. To enlarge
the dataset for training the CNN model, we design a synthetic data engine for
Chinese scene character generation, which generates representative character
images according to the fonts use frequency of Chinese texts. As the Chinese
text is more complex, the English text recognition CNN architecture is modified
for Chinese text. To ensure the small size nature character dataset and the
large size artificial character dataset are comparable in training, the CNN
model are trained progressively. The proposed Chinese text recognition
algorithm is evaluated with two Chinese text datasets. The algorithm achieves
better recognize accuracy compared to the baseline methods.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 07:08:25 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Ren",
"Xiaohang",
""
],
[
"Chen",
"Kai",
""
],
[
"Sun",
"Jun",
""
]
] |
new_dataset
| 0.999525 |
1604.02028
|
Ann Drobnis
|
Klara Nahrstedt, Daniel Lopresti, Ben Zorn, Ann W. Drobnis, Beth
Mynatt, Shwetak Patel, and Helen V. Wright
|
Smart Communities Internet of Things
|
A Computing Community Consortium (CCC) white paper, 9 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's cities face many challenges due to population growth, aging
population, pedestrian and vehicular traffic congestion, water usage increase,
increased electricity demands, crumbling physical infrastructure of buildings,
roads, water sewage, power grid, and declining health care services. Moreover,
major trends indicate the global urbanization of society, and the associated
pressures it brings, will continue to accelerate. One of the approaches to
assist in solving some of the challenges is to deploy extensive IT technology.
It has been recognized that cyber-technology plays a key role in improving
quality of people's lives, strengthening business and helping government
agencies serve citizens better. In this white paper, we discuss the benefits
and challenges of cyber-technologies within "Smart Cities", especially the IoT
(Internet of Things) for smart communities, which means considering the
benefits and challenges of IoT cyber-technologies on smart cities physical
infrastructures and their human stakeholders. To point out the IoT challenges,
we will first present the framework within which IoT lives, and then proceed
with the challenges, conclusions and recommendations.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 15:04:58 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Nahrstedt",
"Klara",
""
],
[
"Lopresti",
"Daniel",
""
],
[
"Zorn",
"Ben",
""
],
[
"Drobnis",
"Ann W.",
""
],
[
"Mynatt",
"Beth",
""
],
[
"Patel",
"Shwetak",
""
],
[
"Wright",
"Helen V.",
""
]
] |
new_dataset
| 0.991283 |
1604.02128
|
Vivek Kumar
|
Vivek Kumar, Sandeep Sharma
|
Cryptompress: A Symmetric Cryptography algorithm to deny Bruteforce
Attack
|
Submitted for publication in IEEE Transaction on IT
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Cryptompress, a new 128-bit (initial) private-key cryptography algorithm is
proposed. It uses a block size of at least 30 bits and increments prior key
size to additional 32 bits on each unsuccessful attempt of any means, including
bruteforcing, further changing a specific portion of the cyphertext using the
reformed Feistel network. Encryption process results from a proposed
compression sequence developed using lookup table and shift operations followed
by key generation. Eventually, four matrixes named add-sub matrix, reduced
matrix, sequence matrix and term matrix are obtained which ultimately forms a
cyphertext.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 19:31:53 GMT"
}
] | 2016-04-08T00:00:00 |
[
[
"Kumar",
"Vivek",
""
],
[
"Sharma",
"Sandeep",
""
]
] |
new_dataset
| 0.999804 |
1402.1530
|
Marco Compagnoni
|
Marco Compagnoni, Roberto Notari
|
TDOA--based localization in two dimensions: the bifurcation curve
|
11 pages, 3 figures, to appear in Fundamenta Informaticae
|
Fundamenta Informaticae XXI (2014) 1001-1012
|
10.3233/FI-2014-1118
| null |
cs.SD gr-qc math.AC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we complete the study of the geometry of the TDOA map that
encodes the noiseless model for the localization of a source from the range
differences between three receivers in a plane, by computing the Cartesian
equation of the bifurcation curve in terms of the positions of the receivers.
From that equation, we can compute its real asymptotic lines. The present
manuscript completes the analysis of [Inverse Problems, Vol. 30, Number 3,
Pages 035004]. Our result is useful to check if a source belongs or is closed
to the bifurcation curve, where the localization in a noisy scenario is
ambiguous.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 23:43:28 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Compagnoni",
"Marco",
""
],
[
"Notari",
"Roberto",
""
]
] |
new_dataset
| 0.997891 |
1506.02465
|
Marius Lindauer
|
Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri
Malitsky, Alexandre Frechette, Holger Hoos, Frank Hutter, Kevin Leyton-Brown,
Kevin Tierney, Joaquin Vanschoren
|
ASlib: A Benchmark Library for Algorithm Selection
|
Accepted to be published in Artificial Intelligence Journal
| null | null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The task of algorithm selection involves choosing an algorithm from a set of
algorithms on a per-instance basis in order to exploit the varying performance
of algorithms over a set of instances. The algorithm selection problem is
attracting increasing attention from researchers and practitioners in AI. Years
of fruitful applications in a number of domains have resulted in a large amount
of data, but the community lacks a standard format or repository for this data.
This situation makes it difficult to share and compare different approaches
effectively, as is done in other, more established fields. It also
unnecessarily hinders new researchers who want to work in this area. To address
this problem, we introduce a standardized format for representing algorithm
selection scenarios and a repository that contains a growing number of data
sets from the literature. Our format has been designed to be able to express a
wide variety of different scenarios. Demonstrating the breadth and power of our
platform, we describe a set of example experiments that build and evaluate
algorithm selection models through a common interface. The results display the
potential of algorithm selection to achieve significant performance
improvements across a broad range of problems and algorithms.
|
[
{
"version": "v1",
"created": "Mon, 8 Jun 2015 12:35:04 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Feb 2016 14:38:52 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Apr 2016 13:20:23 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Bischl",
"Bernd",
""
],
[
"Kerschke",
"Pascal",
""
],
[
"Kotthoff",
"Lars",
""
],
[
"Lindauer",
"Marius",
""
],
[
"Malitsky",
"Yuri",
""
],
[
"Frechette",
"Alexandre",
""
],
[
"Hoos",
"Holger",
""
],
[
"Hutter",
"Frank",
""
],
[
"Leyton-Brown",
"Kevin",
""
],
[
"Tierney",
"Kevin",
""
],
[
"Vanschoren",
"Joaquin",
""
]
] |
new_dataset
| 0.985403 |
1506.08248
|
Arvind Merwaday
|
Arvind Merwaday, Ismail Guvenc
|
Handover Count Based Velocity Estimation and Mobility State Detection in
Dense HetNets
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless cellular networks with densely deployed base stations, knowing
the velocities of mobile devices is a key to avoid call drops and improve the
quality of service to the user equipments (UEs). A simple and efficient way to
estimate a UE's velocity is by counting the number of handovers made by the UE
during a predefined time window. Indeed, handover-count based mobility state
detection has been standardized since Long Term Evolution (LTE) Release-8
specifications. The increasing density of small cells in wireless networks can
help in accurate estimation of velocity and mobility state of a UE. In this
paper, we model densely deployed small cells using stochastic geometry, and
then analyze the statistics of the number of handovers as a function of UE
velocity, small-cell density, and handover count measurement time window. Using
these statistics, we derive approximations to the Cramer-Rao lower bound (CRLB)
for the velocity estimate of a UE. Also, we determine a minimum variance
unbiased (MVU) velocity estimator whose variance tightly matches with the CRLB.
Using this velocity estimator, we formulate the problem of detecting the
mobility state of a UE as low, medium, or high-mobility, as in LTE
specifications. Subsequently, we derive the probability of correctly detecting
the mobility state of a UE. Finally, we evaluate the accuracy of the velocity
estimator under more realistic scenarios such as clustered deployment of small
cells, random way point (RWP) mobility model for UEs, and variable UE velocity.
Our analysis shows that the accuracy of velocity estimation and mobility state
detection increases with increasing small cell density and with increasing
handover count measurement time window.
|
[
{
"version": "v1",
"created": "Sat, 27 Jun 2015 01:20:40 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Sep 2015 02:38:49 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Apr 2016 23:03:32 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Merwaday",
"Arvind",
""
],
[
"Guvenc",
"Ismail",
""
]
] |
new_dataset
| 0.97758 |
1603.06830
|
Ajay Sharma Dr.
|
Sonam Chauhan and Ajay Sharma
|
Fuzzy Commitment Scheme based on Reed Solomon Codes
|
This paper requires a lot of improvements
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional commitment scheme requires both commitment string and a
valid key for the sender to verify his commitment. Differ from the conventional
commitment scheme; fuzzy commitment scheme accepts the key that is similar to
the original key. The new opening key, not identical to the original key,
differs from the initial key in some suitable metrics. The fuzziness in the
fuzzy commitment scheme tolerate small amount of corruptions. The fuzzy
commitment scheme based on the cryptographic hash functions suffers security
imperfections. Thus, this paper combines the fuzzy commitment scheme with the
Reed Solomon error correction codes, which are capable of correcting certain
number of errors. As a result, Reed Solomon code proves better alternative for
fuzzy commitment scheme than hash functions, as the Reed Solomon codes are more
secure than the hashing techniques. Moreover, the Fuzzy Commitment Scheme based
on Reed Solomon codes provides security at two levels that making it suitable
for securing data. This paper explore the efficiency of executing fuzzy
commitment scheme in conjunction with Reed Solomon code as a novel better
alternative to the conventional commitment scheme.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 15:30:24 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2016 17:08:01 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Chauhan",
"Sonam",
""
],
[
"Sharma",
"Ajay",
""
]
] |
new_dataset
| 0.995254 |
1603.09446
|
Wei Shen
|
Wei Shen, Kai Zhao, Yuan Jiang, Yan Wang, Zhijiang Zhang, Xiang Bai
|
Object Skeleton Extraction in Natural Images by Fusing Scale-associated
Deep Side Outputs
|
Accepted by CVPR2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object skeleton is a useful cue for object detection, complementary to the
object contour, as it provides a structural representation to describe the
relationship among object parts. While object skeleton extraction in natural
images is a very challenging problem, as it requires the extractor to be able
to capture both local and global image context to determine the intrinsic scale
of each skeleton pixel. Existing methods rely on per-pixel based multi-scale
feature computation, which results in difficult modeling and high time
consumption. In this paper, we present a fully convolutional network with
multiple scale-associated side outputs to address this problem. By observing
the relationship between the receptive field sizes of the sequential stages in
the network and the skeleton scales they can capture, we introduce a
scale-associated side output to each stage. We impose supervision to different
stages by guiding the scale-associated side outputs toward groundtruth
skeletons of different scales. The responses of the multiple scale-associated
side outputs are then fused in a scale-specific way to localize skeleton pixels
with multiple scales effectively. Our method achieves promising results on two
skeleton extraction datasets, and significantly outperforms other competitors.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 03:21:33 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2016 05:51:33 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Shen",
"Wei",
""
],
[
"Zhao",
"Kai",
""
],
[
"Jiang",
"Yuan",
""
],
[
"Wang",
"Yan",
""
],
[
"Zhang",
"Zhijiang",
""
],
[
"Bai",
"Xiang",
""
]
] |
new_dataset
| 0.965279 |
1604.01303
|
Liang Wang
|
Liang Wang, Mario Almeida, Jeremy Blackburn, Jon Crowcroft
|
C3PO: Computation Congestion Control (PrOactive) - an algorithm for
dynamic diffusion of ephemeral in-network services
| null | null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is an obvious trend that more and more data and computation are
migrating into networks nowadays. Combining mature virtualization technologies
with service-centric net- working, we are entering into an era where countless
services reside in an ISP network to provide low-latency access. Such services
are often computation intensive and are dynamically created and destroyed on
demands everywhere in the network to perform various tasks. Consequently, these
ephemeral in-network services introduce a new type of congestion in the network
which we refer to as "computation congestion". The service load need to be
effectively distributed on different nodes in order to maintain the
funtionality and responsiveness of the network, which calls for a new design
rather than reusing the centralised scheduler designed for cloud-based
services. In this paper, we study both passive and proactive control
strategies, based on the proactive control we further propose a fully
distributed solution which is low complexity, adaptive, and responsive to
network dynamics.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2016 15:38:51 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2016 09:07:04 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Wang",
"Liang",
""
],
[
"Almeida",
"Mario",
""
],
[
"Blackburn",
"Jeremy",
""
],
[
"Crowcroft",
"Jon",
""
]
] |
new_dataset
| 0.988028 |
1604.01434
|
Sergey Loyka
|
Sergey Loyka, Charalambos D. Charalambous
|
A General Formula for Compound Channel Capacity
|
accepted by IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A general formula for the capacity of arbitrary compound channels with the
receiver channel state information is obtained using the information density
approach. No assumptions of ergodicity, stationarity or information stability
are made and the channel state set is arbitrary. A direct (constructive) proof
is given. To prove achievability, we generalize Feinstein Lemma to the compound
channel setting, and to prove converse, we generalize Verdu-Han Lemma to the
same compound setting. A notion of a uniform compound channel is introduced and
the general formula is shown to reduce to the familiar $\sup-\inf$ expression
for such channels. As a by-product, the arbitrary varying channel capacity is
established under maximum error probability and deterministic coding.
Conditions are established under which the worst-case and compound channel
capacities are equal so that the full channel state information at the
transmitter brings in no advantage.
The compound inf-information rate plays a prominent role in the general
formula. Its properties are studied and a link between information-unstable and
information-stable regimes of a compound channel is established. The results
are extended to include $\varepsilon$-capacity of compound channels. Sufficient
and necessary conditions for the strong converse to hold are given.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2016 21:43:25 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Loyka",
"Sergey",
""
],
[
"Charalambous",
"Charalambos D.",
""
]
] |
new_dataset
| 0.999245 |
1604.01537
|
Xiaoyuan Yi
|
Xiaoyuan Yi, Ruoyu Li, Maosong Sun
|
Generating Chinese Classical Poems with RNN Encoder-Decoder
|
12 pages, 8 figures, 4 tables
| null | null | null |
cs.CL cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We take the generation of Chinese classical poem lines as a
sequence-to-sequence learning problem, and build a novel system based on the
RNN Encoder-Decoder structure to generate quatrains (Jueju in Chinese), with a
topic word as input. Our system can jointly learn semantic meaning within a
single line, semantic relevance among lines in a poem, and the use of
structural, rhythmical and tonal patterns, without utilizing any constraint
templates. Experimental results show that our system outperforms other
competitive systems. We also find that the attention mechanism can capture the
word associations in Chinese classical poetry and inverting target lines in
training can improve performance.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 08:26:31 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Yi",
"Xiaoyuan",
""
],
[
"Li",
"Ruoyu",
""
],
[
"Sun",
"Maosong",
""
]
] |
new_dataset
| 0.995867 |
1604.01574
|
Ramanathan Subramanian
|
Syed Omer Gilani, Ramanathan Subramanian, Yan Yan, David Melcher, Nicu
Sebe, Stefan Winkler
|
PET: An Eye-tracking Dataset for Animal-centric PASCAL Object Classes
|
Int'l Conference on Multimedia and Expo 2015
| null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We present the Pascal animal classes Eye Tracking database. Our database
comprises eye movement recordings compiled from forty users for the bird, cat,
cow, dog, horse and sheep {trainval} sets from the VOC 2012 image set.
Different from recent eye-tracking databases such as
\cite{kiwon_cvpr13_gaze,PapadopoulosCKF14}, a salient aspect of PET is that it
contains eye movements recorded for both the free-viewing and visual search
task conditions. While some differences in terms of overall gaze behavior and
scanning patterns are observed between the two conditions, a very similar
number of fixations are observed on target objects for both conditions. As a
utility application, we show how feature pooling around fixated locations
enables enhanced (animal) object classification accuracy.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 11:15:35 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Gilani",
"Syed Omer",
""
],
[
"Subramanian",
"Ramanathan",
""
],
[
"Yan",
"Yan",
""
],
[
"Melcher",
"David",
""
],
[
"Sebe",
"Nicu",
""
],
[
"Winkler",
"Stefan",
""
]
] |
new_dataset
| 0.999717 |
1604.01594
|
Alberto Pittolo
|
Alberto Pittolo and Andrea M. Tonello
|
A Synthetic MIMO PLC Channel Model
|
This work has been presented at the 2016 IEEE 20th International
Symposium on Power Line Communications and its Applications (ISPLC) --
Bottrop, Germany, 20-23 March 2016, in the recent results session. The paper
consists of 4 pages, 2 figures, 1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The huge and increasing demand of data connectivity motivates the development
of new and effective power line communication (PLC) channel models, which are
able to faithfully describe a real communication scenario. This is of
fundamental importance since a good model represents a quick evaluation tool
for new standards or devices, allowing a considerable saving in time and costs.
The aim of this paper is to discuss a novel top-down MIMO PLC synthetic channel
model, able to numerically emulate a real PLC environment. First, the most
common channel modeling strategies are briefly described, highlighting
strengths and weaknesses. Afterwards, the basic model approach is described
considering the SISO scenario. The implementation strategy is then extended to
the MIMO case. The validity of the proposed model is proved making a comparison
between the simulated channels and channels obtained with measurements in terms
of both performance and statistical metrics. The focus is on the broadband
frequency spectrum.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 12:47:17 GMT"
}
] | 2016-04-07T00:00:00 |
[
[
"Pittolo",
"Alberto",
""
],
[
"Tonello",
"Andrea M.",
""
]
] |
new_dataset
| 0.995184 |
1511.04594
|
Daniel Gruss
|
Daniel Gruss, Cl\'ementine Maurice, Klaus Wagner, Stefan Mangard
|
Flush+Flush: A Fast and Stealthy Cache Attack
|
This paper has been accepted at the 13th Conference on Detection of
Intrusions and Malware & Vulnerability Assessment (DIMVA) 2016. The final
publication is available at link.springer.com
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research on cache attacks has shown that CPU caches leak significant
information. Proposed detection mechanisms assume that all cache attacks cause
more cache hits and cache misses than benign applications and use hardware
performance counters for detection.
In this article, we show that this assumption does not hold by developing a
novel attack technique: the Flush+Flush attack. The Flush+Flush attack only
relies on the execution time of the flush instruction, which depends on whether
data is cached or not. Flush+Flush does not make any memory accesses, contrary
to any other cache attack. Thus, it causes no cache misses at all and the
number of cache hits is reduced to a minimum due to the constant cache flushes.
Therefore, Flush+Flush attacks are stealthy, i.e., the spy process cannot be
detected based on cache hits and misses, or state-of-the-art detection
mechanisms. The Flush+Flush attack runs in a higher frequency and thus is
faster than any existing cache attack. With 496 KB/s in a cross-core covert
channel it is 6.7 times faster than any previously published cache covert
channel.
|
[
{
"version": "v1",
"created": "Sat, 14 Nov 2015 18:40:20 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Apr 2016 11:32:03 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Apr 2016 09:23:47 GMT"
}
] | 2016-04-06T00:00:00 |
[
[
"Gruss",
"Daniel",
""
],
[
"Maurice",
"Clémentine",
""
],
[
"Wagner",
"Klaus",
""
],
[
"Mangard",
"Stefan",
""
]
] |
new_dataset
| 0.99819 |
1603.08079
|
Andrei Barbu
|
Yevgeni Berzak and Andrei Barbu and Daniel Harari and Boris Katz and
Shimon Ullman
|
Do You See What I Mean? Visual Resolution of Linguistic Ambiguities
|
EMNLP 2015
|
Conference on Empirical Methods in Natural Language Processing
(EMNLP), 2015, pages 1477--1487
| null | null |
cs.CV cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Understanding language goes hand in hand with the ability to integrate
complex contextual information obtained via perception. In this work, we
present a novel task for grounded language understanding: disambiguating a
sentence given a visual scene which depicts one of the possible interpretations
of that sentence. To this end, we introduce a new multimodal corpus containing
ambiguous sentences, representing a wide range of syntactic, semantic and
discourse ambiguities, coupled with videos that visualize the different
interpretations for each sentence. We address this task by extending a vision
model which determines if a sentence is depicted by a video. We demonstrate how
such a model can be adjusted to recognize different interpretations of the same
underlying sentence, allowing to disambiguate sentences in a unified fashion
across the different ambiguity types.
|
[
{
"version": "v1",
"created": "Sat, 26 Mar 2016 06:49:33 GMT"
}
] | 2016-04-06T00:00:00 |
[
[
"Berzak",
"Yevgeni",
""
],
[
"Barbu",
"Andrei",
""
],
[
"Harari",
"Daniel",
""
],
[
"Katz",
"Boris",
""
],
[
"Ullman",
"Shimon",
""
]
] |
new_dataset
| 0.968319 |
1604.01162
|
Vishal P Venkata
|
Vishal P Venkata and Natarajan V
|
Control System Design for Tricopter using Filters and PID controller
|
5 pages, 9 figures, 3 tables
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this paper is to present the control system design of
Tricopter. We have presented the implementation of control system in software
in this paper. Tricopter's control system mainly consists of two parts
Complimentary filter and PID block. The angles along X, Y and Z axis are taken
from the complementary filter which acts as a feedback block. We have used the
combination of gyroscope and accelerometer for finding the angle. We have also
shown the role of the complimentary filter in finding out the angle along X, Y,
and Z axis instead of using gyroscope and accelerometer directly. The second
main part is the PID Controller which calculates the error in angle along X, Y
and Z axis and produces an output signal which reduces error. We have shown the
importance of the constant parameters of PID Controller. The results of this
paper are tested on an actual Tricopter and also plotted in the form of graph
using Matlab and Processing software.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2016 07:36:31 GMT"
}
] | 2016-04-06T00:00:00 |
[
[
"Venkata",
"Vishal P",
""
],
[
"V",
"Natarajan",
""
]
] |
new_dataset
| 0.996368 |
1604.01235
|
Vijay Krishna Menon Mr
|
Vijay Krishna Menon, S. Rajendran, M. Anand Kumar, K.P. Soman
|
A new TAG Formalism for Tamil and Parser Analytics
|
International Symposium for Dravidian Languages (iDravidian),
co-located with ICON2014, Goa University, Dec 2014
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tree adjoining grammar (TAG) is specifically suited for morph rich and
agglutinated languages like Tamil due to its psycho linguistic features and
parse time dependency and morph resolution. Though TAG and LTAG formalisms have
been known for about 3 decades, efforts on designing TAG Syntax for Tamil have
not been entirely successful due to the complexity of its specification and the
rich morphology of Tamil language. In this paper we present a minimalistic TAG
for Tamil without much morphological considerations and also introduce a parser
implementation with some obvious variations from the XTAG system
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2016 12:42:31 GMT"
}
] | 2016-04-06T00:00:00 |
[
[
"Menon",
"Vijay Krishna",
""
],
[
"Rajendran",
"S.",
""
],
[
"Kumar",
"M. Anand",
""
],
[
"Soman",
"K. P.",
""
]
] |
new_dataset
| 0.99898 |
1604.01376
|
Valentina Zantedeschi
|
Valentina Zantedeschi, R\'emi Emonet, Marc Sebban
|
Lipschitz Continuity of Mahalanobis Distances and Bilinear Forms
| null | null | null | null |
cs.NA cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many theoretical results in the machine learning domain stand only for
functions that are Lipschitz continuous. Lipschitz continuity is a strong form
of continuity that linearly bounds the variations of a function. In this paper,
we derive tight Lipschitz constants for two families of metrics: Mahalanobis
distances and bounded-space bilinear forms. To our knowledge, this is the first
time the Mahalanobis distance is formally proved to be Lipschitz continuous and
that such tight Lipschitz constants are derived.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2016 12:39:26 GMT"
}
] | 2016-04-06T00:00:00 |
[
[
"Zantedeschi",
"Valentina",
""
],
[
"Emonet",
"Rémi",
""
],
[
"Sebban",
"Marc",
""
]
] |
new_dataset
| 0.995727 |
1512.00103
|
Daniel Gillick
|
Dan Gillick, Cliff Brunk, Oriol Vinyals, Amarnag Subramanya
|
Multilingual Language Processing From Bytes
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an LSTM-based model which we call Byte-to-Span (BTS) that reads
text as bytes and outputs span annotations of the form [start, length, label]
where start positions, lengths, and labels are separate entries in our
vocabulary. Because we operate directly on unicode bytes rather than
language-specific words or characters, we can analyze text in many languages
with a single model. Due to the small vocabulary size, these multilingual
models are very compact, but produce results similar to or better than the
state-of- the-art in Part-of-Speech tagging and Named Entity Recognition that
use only the provided training datasets (no external data sources). Our models
are learning "from scratch" in that they do not rely on any elements of the
standard pipeline in Natural Language Processing (including tokenization), and
thus can run in standalone fashion on raw text.
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2015 00:23:44 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Apr 2016 16:26:23 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Gillick",
"Dan",
""
],
[
"Brunk",
"Cliff",
""
],
[
"Vinyals",
"Oriol",
""
],
[
"Subramanya",
"Amarnag",
""
]
] |
new_dataset
| 0.999458 |
1602.04701
|
Henk Moed
|
Henk F. Moed
|
Iran's scientific dominance and the emergence of South-East Asian
countries as scientific collaborators in the Persian Gulf Region
|
Version 31 March 2016 accepted for publication in Scientometrics
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A longitudinal bibliometric analysis of publications indexed in Thomson
Reuters' Incites and Elsevier's Scopus, and published from Persian Gulf States
and neighbouring Middle East countries, shows clear effects of major political
events during the past 35 years. Predictions made in 2006 by the US diplomat
Richard N. Haass on political changes in the Middle East have come true in the
Gulf States' national scientific research systems, to the extent that Iran has
become in 2015 by far the leading country in the Persian Gulf, and South-East
Asian countries including China, Malaysia and South Korea have become major
scientific collaborators, displacing the USA and other large Western countries.
But collaborations patterns among Persian Gulf States show no apparent
relationship with differences in Islam denominations.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 15:04:32 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Apr 2016 08:42:48 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Moed",
"Henk F.",
""
]
] |
new_dataset
| 0.994014 |
1602.06690
|
Rajai Nasser
|
Rajai Nasser
|
Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error
Capacity and Performance Trade-offs
|
Accepted to ISIT2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the performance of generalized polar (GP) codes when they are used
for coding schemes involving erasure. GP codes are a family of codes which
contains, among others, the standard polar codes of Ar{\i}kan and Reed-Muller
codes. We derive a closed formula for the zero-undetected-error capacity
$I_0^{GP}(W)$ of GP codes for a given binary memoryless symmetric (BMS) channel
$W$ under the low complexity successive cancellation decoder with erasure. We
show that for every $R<I_0^{GP}(W)$, there exists a generalized polar code of
blocklength $N$ and of rate at least $R$ where the undetected-error probability
is zero and the erasure probability is less than
$2^{-N^{\frac{1}{2}-\epsilon}}$. On the other hand, for any GP code of rate
$I_0^{GP}(W)<R<I(W)$ and blocklength $N$, the undetected error probability
cannot be made less than $2^{-N^{\frac{1}{2}+\epsilon}}$ unless the erasure
probability is close to $1$.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 09:07:32 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Mar 2016 10:55:34 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Apr 2016 16:44:35 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Nasser",
"Rajai",
""
]
] |
new_dataset
| 0.999695 |
1604.00449
|
Christopher B. Choy
|
Christopher B. Choy, Danfei Xu, JunYoung Gwak, Kevin Chen, Silvio
Savarese
|
3D-R2N2: A Unified Approach for Single and Multi-view 3D Object
Reconstruction
|
Appendix can be found at
http://cvgl.stanford.edu/papers/choy_16_appendix.pdf
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by the recent success of methods that employ shape priors to achieve
robust 3D reconstructions, we propose a novel recurrent neural network
architecture that we call the 3D Recurrent Reconstruction Neural Network
(3D-R2N2). The network learns a mapping from images of objects to their
underlying 3D shapes from a large collection of synthetic data. Our network
takes in one or more images of an object instance from arbitrary viewpoints and
outputs a reconstruction of the object in the form of a 3D occupancy grid.
Unlike most of the previous works, our network does not require any image
annotations or object class labels for training or testing. Our extensive
experimental analysis shows that our reconstruction framework i) outperforms
the state-of-the-art methods for single view reconstruction, and ii) enables
the 3D reconstruction of objects in situations when traditional SFM/SLAM
methods fail (because of lack of texture and/or wide baseline).
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2016 01:28:27 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Choy",
"Christopher B.",
""
],
[
"Xu",
"Danfei",
""
],
[
"Gwak",
"JunYoung",
""
],
[
"Chen",
"Kevin",
""
],
[
"Savarese",
"Silvio",
""
]
] |
new_dataset
| 0.971604 |
1604.00493
|
Minati Mishra Dr.
|
Sanjeeb Kumar Behera, Minati Mishra
|
Steganography -- A Game of Hide and Seek in Information Communication
|
5 pages, 4 figures, National Conference on Recent Innovations in
Engineering and Management Sciences (RIEMS-2016)
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the growth of communication over computer networks, how to maintain the
confidentiality and security of transmitted information have become some of the
important issues. In order to transfer data securely to the destination without
unwanted disclosure or damage, nature inspired hide and seek tricks such as,
cryptography and Steganography are heavily in use. Just like the Chameleon and
many other bio-species those change their body color and hide themselves in the
background in order to protect them from external attacks, Cryptography and
Steganography are techniques those are used to encrypt and hide the secret data
inside other media to ensure data security. This paper discusses the concept of
a simple spatial domain LSB Steganography that encrypts the secrets using
Fibonacci- Lucas transformation, before hiding, for better security.
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2016 12:21:52 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Behera",
"Sanjeeb Kumar",
""
],
[
"Mishra",
"Minati",
""
]
] |
new_dataset
| 0.998591 |
1604.00498
|
Sruti Gan Chaudhuri
|
Subhash Bhagat, Sruti Gan Chaudhuri and Krishnendu Mukhopadhyaya
|
A Get-Together for Deaf and Dumb Robots in Three dimensional Space
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a strategy for a group of deaf and dumb robots, carrying
clocks from different countries, to meet at a geographical location which is
not fixed in advanced. The robots act independently. They can observe others,
compute some locations and walk towards those locations. They can only get a
snapshot of the locations of other robots but can not detect whether they are
static or in motion. The robots are forgetful; once they have completed their
motion they forget their previous locations and observations. Again they decide
new destinations to move to. Eventually all the robots compute the same
destination and meet there. There exists no global positioning system. As they
stand, they agree on up and down directions. However, as they do not have any
compass, the other directions are not agreed upon. They also do not agree on
the clockwise direction. For determining a strategy, we imagine the robots to
be points on a three dimensional plane where all the robots are mutually
visible to each other always. The strategy we propose has to be obeyed by all
the robots independently with respect to their own clock and compass. Initially
the robots start from distinct locations. Some dead robots may be present in
the system or some may die any time before or after the get together. However,
the live robots are not aware of the presence of these dead robots.
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2016 13:08:42 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Bhagat",
"Subhash",
""
],
[
"Chaudhuri",
"Sruti Gan",
""
],
[
"Mukhopadhyaya",
"Krishnendu",
""
]
] |
new_dataset
| 0.951425 |
1604.00557
|
Mukhtiar Ali Unar
|
Muhammad Saleh Shah, Asim Imdad Wagan, Mukhtiar Ali Unar
|
SAM: Support Vector Machine Based Active Queue Management
|
8 pages, Mehran University Research Journal of Engineering and
Technology, Vol 33, No.1, January 2014
| null | null | null |
cs.NI cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
Recent years have seen an increasing interest in the design of AQM (Active
Queue Management) controllers. The purpose of these controllers is to manage
the network congestion under varying loads, link delays and bandwidth. In this
paper, a new AQM controller is proposed which is trained by using the SVM
(Support Vector Machine) with the RBF (Radial Basis Function) kernal. The
proposed controller is called the support vector based AQM (SAM) controller.
The performance of the proposed controller has been compared with three
conventional AQM controllers, namely the Random Early Detection, Blue and
Proportional Plus Integral Controller. The preliminary simulation studies show
that the performance of the proposed controller is comparable to the
conventional controllers. However, the proposed controller is more efficient in
controlling the queue size than the conventional controllers.
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2016 20:47:51 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Shah",
"Muhammad Saleh",
""
],
[
"Wagan",
"Asim Imdad",
""
],
[
"Unar",
"Mukhtiar Ali",
""
]
] |
new_dataset
| 0.999233 |
1604.00606
|
Yuzhuo Ren
|
Yuzhuo Ren, Chen Chen, Shangwen Li, and C.-C. Jay Kuo
|
GAL: A Global-Attributes Assisted Labeling System for Outdoor Scenes
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An approach that extracts global attributes from outdoor images to facilitate
geometric layout labeling is investigated in this work. The proposed
Global-attributes Assisted Labeling (GAL) system exploits both local features
and global attributes. First, by following a classical method, we use local
features to provide initial labels for all super-pixels. Then, we develop a set
of techniques to extract global attributes from 2D outdoor images. They include
sky lines, ground lines, vanishing lines, etc. Finally, we propose the GAL
system that integrates global attributes in the conditional random field (CRF)
framework to improve initial labels so as to offer a more robust labeling
result. The performance of the proposed GAL system is demonstrated and
benchmarked with several state-of-the-art algorithms against a popular outdoor
scene layout dataset.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 07:36:50 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Ren",
"Yuzhuo",
""
],
[
"Chen",
"Chen",
""
],
[
"Li",
"Shangwen",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] |
new_dataset
| 0.998525 |
1604.00700
|
Rayan Saab
|
Rayan Saab, Rongrong Wang, and Ozgur Yilmaz
|
From compressed sensing to compressed bit-streams: practical encoders,
tractable decoders
|
32 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compressed sensing is now established as an effective method for dimension
reduction when the underlying signals are sparse or compressible with respect
to some suitable basis or frame. One important, yet under-addressed problem
regarding the compressive acquisition of analog signals is how to perform
quantization. This is directly related to the important issues of how
"compressed" compressed sensing is (in terms of the total number of bits one
ends up using after acquiring the signal) and ultimately whether compressed
sensing can be used to obtain compressed representations of suitable signals.
Building on our recent work, we propose a concrete and practicable method for
performing "analog-to-information conversion". Following a compressive signal
acquisition stage, the proposed method consists of a quantization stage, based
on $\Sigma\Delta$ (sigma-delta) quantization, and a subsequent encoding
(compression) stage that fits within the framework of compressed sensing
seamlessly. We prove that, using this method, we can convert analog compressive
samples to compressed digital bitstreams and decode using tractable algorithms
based on convex optimization. We prove that the proposed AIC provides a nearly
optimal encoding of sparse and compressible signals. Finally, we present
numerical experiments illustrating the effectiveness of the proposed
analog-to-information converter.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 23:13:02 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Saab",
"Rayan",
""
],
[
"Wang",
"Rongrong",
""
],
[
"Yilmaz",
"Ozgur",
""
]
] |
new_dataset
| 0.984877 |
1604.00799
|
Alessandro Artale
|
Alessandro Artale and Enrico Franconi
|
Extending DLR with Labelled Tuples, Projections, Functional Dependencies
and Objectification (full version)
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an extension of the n-ary description logic DLR to deal with
attribute-labelled tuples (generalising the positional notation), with
arbitrary projections of relations (inclusion dependencies), generic functional
dependencies and with global and local objectification (reifying relations or
their projections). We show how a simple syntactic condition on the appearance
of projections and functional dependencies in a knowledge base makes the
language decidable without increasing the computational complexity of the basic
DLR language.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2016 10:11:52 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Artale",
"Alessandro",
""
],
[
"Franconi",
"Enrico",
""
]
] |
new_dataset
| 0.958061 |
1604.00895
|
Shuda Li
|
Shuda Li, Ankur Handa, Yang Zhang, Andrew Calway
|
HDRFusion: HDR SLAM using a low-cost auto-exposure RGB-D sensor
|
14 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a new method for comparing frame appearance in a frame-to-model
3-D mapping and tracking system using an low dynamic range (LDR) RGB-D camera
which is robust to brightness changes caused by auto exposure. It is based on a
normalised radiance measure which is invariant to exposure changes and not only
robustifies the tracking under changing lighting conditions, but also enables
the following exposure compensation perform accurately to allow online building
of high dynamic range (HDR) maps. The latter facilitates the frame-to-model
tracking to minimise drift as well as better capturing light variation within
the scene. Results from experiments with synthetic and real data demonstrate
that the method provides both improved tracking and maps with far greater
dynamic range of luminosity.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2016 15:05:27 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Li",
"Shuda",
""
],
[
"Handa",
"Ankur",
""
],
[
"Zhang",
"Yang",
""
],
[
"Calway",
"Andrew",
""
]
] |
new_dataset
| 0.997978 |
1604.00990
|
Hatem Alismail
|
Hatem Alismail, Brett Browning, Simon Lucey
|
Direct Visual Odometry using Bit-Planes
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Feature descriptors, such as SIFT and ORB, are well-known for their
robustness to illumination changes, which has made them popular for
feature-based VSLAM\@. However, in degraded imaging conditions such as low
light, low texture, blur and specular reflections, feature extraction is often
unreliable. In contrast, direct VSLAM methods which estimate the camera pose by
minimizing the photometric error using raw pixel intensities are often more
robust to low textured environments and blur. Nonetheless, at the core of
direct VSLAM is the reliance on a consistent photometric appearance across
images, otherwise known as the brightness constancy assumption. Unfortunately,
brightness constancy seldom holds in real world applications.
In this work, we overcome brightness constancy by incorporating feature
descriptors into a direct visual odometry framework. This combination results
in an efficient algorithm that combines the strength of both feature-based
algorithms and direct methods. Namely, we achieve robustness to arbitrary
photometric variations while operating in low-textured and poorly lit
environments. Our approach utilizes an efficient binary descriptor, which we
call Bit-Planes, and show how it can be used in the gradient-based optimization
required by direct methods. Moreover, we show that the squared Euclidean
distance between Bit-Planes is equivalent to the Hamming distance. Hence, the
descriptor may be used in least squares optimization without sacrificing its
photometric invariance. Finally, we present empirical results that demonstrate
the robustness of the approach in poorly lit underground environments.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2016 19:02:45 GMT"
}
] | 2016-04-05T00:00:00 |
[
[
"Alismail",
"Hatem",
""
],
[
"Browning",
"Brett",
""
],
[
"Lucey",
"Simon",
""
]
] |
new_dataset
| 0.997484 |
1410.3322
|
Paul Emmerich
|
Paul Emmerich, Sebastian Gallenm\"uller, Daniel Raumer, Florian
Wohlfart, Georg Carle
|
MoonGen: A Scriptable High-Speed Packet Generator
|
Published at IMC 2015
| null |
10.1145/2815675.2815692
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MoonGen, a flexible high-speed packet generator. It can saturate
10 GbE links with minimum sized packets using only a single CPU core by running
on top of the packet processing framework DPDK. Linear multi-core scaling
allows for even higher rates: We have tested MoonGen with up to 178.5 Mpps at
120 Gbit/s. We move the whole packet generation logic into user-controlled Lua
scripts to achieve the highest possible flexibility. In addition, we utilize
hardware features of Intel NICs that have not been used for packet generators
previously. A key feature is the measurement of latency with sub-microsecond
precision and accuracy by using hardware timestamping capabilities of modern
commodity NICs. We address timing issues with software-based packet generators
and apply methods to mitigate them with both hardware support on commodity NICs
and with a novel method to control the inter-packet gap in software. Features
that were previously only possible with hardware-based solutions are now
provided by MoonGen on commodity hardware. MoonGen is available as free
software under the MIT license at https://github.com/emmericp/MoonGen
|
[
{
"version": "v1",
"created": "Mon, 13 Oct 2014 14:19:18 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Oct 2014 08:29:00 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Apr 2015 20:41:52 GMT"
},
{
"version": "v4",
"created": "Thu, 31 Mar 2016 21:31:38 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Emmerich",
"Paul",
""
],
[
"Gallenmüller",
"Sebastian",
""
],
[
"Raumer",
"Daniel",
""
],
[
"Wohlfart",
"Florian",
""
],
[
"Carle",
"Georg",
""
]
] |
new_dataset
| 0.999544 |
1511.02301
|
Jason Weston
|
Felix Hill, Antoine Bordes, Sumit Chopra, Jason Weston
|
The Goldilocks Principle: Reading Children's Books with Explicit Memory
Representations
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new test of how well language models capture meaning in
children's books. Unlike standard language modelling benchmarks, it
distinguishes the task of predicting syntactic function words from that of
predicting lower-frequency words, which carry greater semantic content. We
compare a range of state-of-the-art models, each with a different way of
encoding what has been previously read. We show that models which store
explicit representations of long-term contexts outperform state-of-the-art
neural language models at predicting semantic content words, although this
advantage is not observed for syntactic function words. Interestingly, we find
that the amount of text encoded in a single memory representation is highly
influential to the performance: there is a sweet-spot, not too big and not too
small, between single words and full sentences that allows the most meaningful
information in a text to be effectively retained and recalled. Further, the
attention over such window-based memories can be trained effectively through
self-supervision. We then assess the generality of this principle by applying
it to the CNN QA benchmark, which involves identifying named entities in
paraphrased summaries of news articles, and achieve state-of-the-art
performance.
|
[
{
"version": "v1",
"created": "Sat, 7 Nov 2015 04:36:20 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Dec 2015 23:21:58 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Jan 2016 21:10:21 GMT"
},
{
"version": "v4",
"created": "Fri, 1 Apr 2016 05:31:33 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Hill",
"Felix",
""
],
[
"Bordes",
"Antoine",
""
],
[
"Chopra",
"Sumit",
""
],
[
"Weston",
"Jason",
""
]
] |
new_dataset
| 0.995293 |
1603.09439
|
Phuc Nguyen X
|
Phuc Xuan Nguyen, Gregory Rogez, Charless Fowlkes, Deva Ramanan
|
The Open World of Micro-Videos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Micro-videos are six-second videos popular on social media networks with
several unique properties. Firstly, because of the authoring process, they
contain significantly more diversity and narrative structure than existing
collections of video "snippets". Secondly, because they are often captured by
hand-held mobile cameras, they contain specialized viewpoints including
third-person, egocentric, and self-facing views seldom seen in traditional
produced video. Thirdly, due to to their continuous production and publication
on social networks, aggregate micro-video content contains interesting
open-world dynamics that reflects the temporal evolution of tag topics. These
aspects make micro-videos an appealing well of visual data for developing
large-scale models for video understanding. We analyze a novel dataset of
micro-videos labeled with 58 thousand tags. To analyze this data, we introduce
viewpoint-specific and temporally-evolving models for video understanding,
defined over state-of-the-art motion and deep visual features. We conclude that
our dataset opens up new research opportunities for large-scale video analysis,
novel viewpoints, and open-world dynamics.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 02:19:53 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Apr 2016 01:53:32 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Nguyen",
"Phuc Xuan",
""
],
[
"Rogez",
"Gregory",
""
],
[
"Fowlkes",
"Charless",
""
],
[
"Ramanan",
"Deva",
""
]
] |
new_dataset
| 0.967066 |
1604.00025
|
Serguei Mokhov
|
Serguei A. Mokhov and Lee Wei Huynh and Jian Li and Farid Rassai
|
A Java Data Security Framework (JDSF) and its Case Studies
|
a 2007 project report; parts appeared in various conferences;
includes index
| null |
10.1109/NTMS.2009.5384673 10.1007/978-90-481-3662-9_77
10.1007/978-90-481-3662-9_73
| null |
cs.CR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design of something we call Confidentiality, Integrity and
Authentication Sub-Frameworks, which are a part of a more general Java Data
Security Framework (JDSF) designed to support various aspects related to data
security (confidentiality, origin authentication, integrity, and SQL
randomization). The JDSF was originally designed in 2007 for use in the two
use-cases, MARF and HSQLDB, to allow a plug-in-like implementation of and
verification of various security aspects and their generalization. The JDSF
project explores secure data storage related issues from the point of view of
data security in the two projects. A variety of common security aspects and
tasks were considered in order to extract a spectrum of possible parameters
these aspects require for the design an extensible frameworked API and its
implementation. A particular challenge being tackled is an aggregation of
diverse approaches and algorithms into a common set of Java APIs to cover all
or at least most common aspects, and, at the same time keeping the framework as
simple as possible. As a part of the framework, we provide the mentioned
sub-frameworks' APIs to allow for the common algorithm implementations of the
confidentiality, integrity, and authentication aspects for MARF's and HSQLDB's
database(s). At the same time we perform a detailed overview of the related
work and literature on data and database security that we considered as a
possible input to design the JDSF.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 20:00:53 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Mokhov",
"Serguei A.",
""
],
[
"Huynh",
"Lee Wei",
""
],
[
"Li",
"Jian",
""
],
[
"Rassai",
"Farid",
""
]
] |
new_dataset
| 0.99959 |
1604.00033
|
Sathappan Muthiah
|
Sathappan Muthiah, Patrick Butler, Rupinder Paul Khandpur, Parang
Saraf, Nathan Self, Alla Rozovskaya, Liang Zhao, Jose Cadena, Chang-Tien Lu,
Anil Vullikanti, Achla Marathe, Kristen Summers, Graham Katz, Andy Doyle,
Jaime Arredondo, Dipak K. Gupta, David Mares, Naren Ramakrishnan
|
EMBERS at 4 years: Experiences operating an Open Source Indicators
Forecasting System
|
Submitted to a conference
| null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EMBERS is an anticipatory intelligence system forecasting population-level
events in multiple countries of Latin America. A deployed system from 2012,
EMBERS has been generating alerts 24x7 by ingesting a broad range of data
sources including news, blogs, tweets, machine coded events, currency rates,
and food prices. In this paper, we describe our experiences operating EMBERS
continuously for nearly 4 years, with specific attention to the discoveries it
has enabled, correct as well as missed forecasts, and lessons learnt from
participating in a forecasting tournament including our perspectives on the
limits of forecasting and ethical considerations.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 20:06:40 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Muthiah",
"Sathappan",
""
],
[
"Butler",
"Patrick",
""
],
[
"Khandpur",
"Rupinder Paul",
""
],
[
"Saraf",
"Parang",
""
],
[
"Self",
"Nathan",
""
],
[
"Rozovskaya",
"Alla",
""
],
[
"Zhao",
"Liang",
""
],
[
"Cadena",
"Jose",
""
],
[
"Lu",
"Chang-Tien",
""
],
[
"Vullikanti",
"Anil",
""
],
[
"Marathe",
"Achla",
""
],
[
"Summers",
"Kristen",
""
],
[
"Katz",
"Graham",
""
],
[
"Doyle",
"Andy",
""
],
[
"Arredondo",
"Jaime",
""
],
[
"Gupta",
"Dipak K.",
""
],
[
"Mares",
"David",
""
],
[
"Ramakrishnan",
"Naren",
""
]
] |
new_dataset
| 0.995017 |
1604.00061
|
Sina Parhizi
|
Sina Parhizi, Amin Khodaei and Shaghayegh Bahramirad
|
Distribution Market Clearing and Settlement
|
2016 IEEE Power & Energy Society General Meeting
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are various undergoing efforts by system operators to set up an
electricity market at the distribution level to enable a rapid and widespread
deployment of distributed energy resources (DERs) and microgrids. This paper
follows the previous work of the authors in implementing the distribution
market operator (DMO) concept, and focuses on investigating the clearing and
settlement processes performed by the DMO. The DMO clears the market to assign
the awarded power from the wholesale market to customers within its service
territory based on their associated demand bids. The DMO accordingly settles
the market to identify the distribution locational marginal prices (DLMPs) and
calculate payments from each customer and the total payment to the system
operator. Numerical simulations exhibit the merits and effectiveness of the
proposed DMO clearing and settlement processes.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 21:41:52 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Parhizi",
"Sina",
""
],
[
"Khodaei",
"Amin",
""
],
[
"Bahramirad",
"Shaghayegh",
""
]
] |
new_dataset
| 0.981435 |
1604.00300
|
Benjamin Negrevergne
|
R\'emi Coletta and Benjamin Negrevergne
|
A SAT model to mine flexible sequences in transactional datasets
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional pattern mining algorithms generally suffer from a lack of
flexibility. In this paper, we propose a SAT formulation of the problem to
successfully mine frequent flexible sequences occurring in transactional
datasets. Our SAT-based approach can easily be extended with extra constraints
to address a broad range of pattern mining applications. To demonstrate this
claim, we formulate and add several constraints, such as gap and span
constraints, to our model in order to extract more specific patterns. We also
use interactive solving to perform important derived tasks, such as closed
pattern mining or maximal pattern mining. Finally, we prove the practical
feasibility of our SAT model by running experiments on two real datasets.
|
[
{
"version": "v1",
"created": "Fri, 1 Apr 2016 15:49:51 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Coletta",
"Rémi",
""
],
[
"Negrevergne",
"Benjamin",
""
]
] |
new_dataset
| 0.954905 |
1604.00320
|
Giuseppe Petracca
|
Giuseppe Petracca, Yuqiong Sun, Ahmad Atamli and Trent Jaeger
|
AuDroid: Preventing Attacks on Audio Channels in Mobile Devices
|
2015 Annual Computer Security Applications Conference
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice control is a popular way to operate mobile devices, enabling users to
communicate requests to their devices. However, adversaries can leverage voice
control to trick mobile devices into executing commands to leak secrets or to
modify critical information. Contemporary mobile operating systems fail to
prevent such attacks because they do not control access to the speaker at all
and fail to control when untrusted apps may use the microphone, enabling
authorized apps to create exploitable communication channels. In this paper, we
propose a security mechanism that tracks the creation of audio communication
channels explicitly and controls the information flows over these channels to
prevent several types of attacks.We design and implement AuDroid, an extension
to the SELinux reference monitor integrated into the Android operating system
for enforcing lattice security policies over the dynamically changing use of
system audio resources. To enhance flexibility, when information flow errors
are detected, the device owner, system apps and services are given the
opportunity to resolve information flow errors using known methods, enabling
AuDroid to run many configurations safely. We evaluate our approach on 17
widely-used apps that make extensive use of the microphone and speaker, finding
that AuDroid prevents six types of attack scenarios on audio channels while
permitting all 17 apps to run effectively. AuDroid shows that it is possible to
prevent attacks using audio channels without compromising functionality or
introducing significant performance overhead.
|
[
{
"version": "v1",
"created": "Fri, 1 Apr 2016 16:32:47 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Petracca",
"Giuseppe",
""
],
[
"Sun",
"Yuqiong",
""
],
[
"Atamli",
"Ahmad",
""
],
[
"Jaeger",
"Trent",
""
]
] |
new_dataset
| 0.999066 |
1604.00360
|
Walter Hehl
|
Walter Hehl
|
A General World Model with Poiesis: Poppers Three Worlds updated with
Software
|
9 pages. 1 Figure of a world model with physics, software and Geist,
Book published 2016 (in German) by Springer, Heidelberg, with the general
fundamentals of Software for philosophy
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the famous Three Worlds of Karl Popper as template, the paper rigorously
introduces the concept of software to define the counterpart of the physical
subworld. Digesting the scientific-technical view of biology and neurology on a
high level, results in an updated Three Worlds scheme consistent with an
information technical view. Chance and mathematics complete the world model.
Some simple examples illustrate the move from Poppers view of the world with
physics, psyche and World 3, to a new extended model with physics, extended
software (which we call Poiesis), and Geist (the notion which embodies spirit,
mind and soul).
|
[
{
"version": "v1",
"created": "Fri, 1 Apr 2016 19:07:40 GMT"
}
] | 2016-04-04T00:00:00 |
[
[
"Hehl",
"Walter",
""
]
] |
new_dataset
| 0.950076 |
1102.3882
|
Claudio Fontanari
|
Claudio Fontanari, Valentina Pulice, Anna Rimoldi, Massimiliano Sala
|
On weakly APN functions and 4-bit S-Boxes
| null |
Finite Fields and their Applications, 2012, vol. 18, p. 522-528
| null | null |
cs.CR math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
S-Boxes are important security components of block ciphers. We provide
theoretical results on necessary or sufficient criteria for an (invertible)
4-bit S-Box to be weakly APN. Thanks to a classification of 4-bit invertible
S-Boxes achieved independently by De Canni\'ere and Leander-Poschmann, we can
strengthen our results with a computer-aided proof.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 15:26:48 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Mar 2011 23:34:00 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Aug 2011 14:42:16 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Fontanari",
"Claudio",
""
],
[
"Pulice",
"Valentina",
""
],
[
"Rimoldi",
"Anna",
""
],
[
"Sala",
"Massimiliano",
""
]
] |
new_dataset
| 0.997071 |
1412.4234
|
Riccardo Longo
|
Riccardo Longo, Chiara Marcolla, Massimiliano Sala
|
Key-Policy Multi-Authority Attribute-Based Encryption
|
12 pages
|
Algebraic Informatics, Springer LNCS, 2015, vol. 9270, p. 152-164
|
10.1007/978-3-319-23021-4_14
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bilinear groups are often used to create Attribute-Based Encryption (ABE)
algorithms. In particular, they have been used to create an ABE system with
multi authorities, but limited to the ciphertext-policy instance. Here, for the
first time, we propose a multi-authority key-policy ABE system. In our
proposal, the authorities may be set up in any moment and without any
coordination. A party can simply act as an ABE authority by creating its own
public parameters and issuing private keys to the users. A user can thus
encrypt data choosing both a set of attributes and a set of trusted
authorities, maintaining full control unless all his chosen authorities collude
against him. We prove our system secure under the bilinear Diffie-Hellman
assumption.
|
[
{
"version": "v1",
"created": "Sat, 13 Dec 2014 13:05:53 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Feb 2016 11:17:25 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Longo",
"Riccardo",
""
],
[
"Marcolla",
"Chiara",
""
],
[
"Sala",
"Massimiliano",
""
]
] |
new_dataset
| 0.998939 |
1508.02851
|
Hrant Khachatrian
|
Hrant Khachatrian, Tigran Mamikonyan
|
On interval edge-colorings of bipartite graphs of small order
|
Accepted for the CSIT 2015 conference
| null |
10.1109/CSITechnol.2015.7358253
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An edge-coloring of a graph $G$ with colors $1,\ldots,t$ is an interval
$t$-coloring if all colors are used, and the colors of edges incident to each
vertex of $G$ are distinct and form an interval of integers. A graph $G$ is
interval colorable if it has an interval $t$-coloring for some positive integer
$t$. The problem of deciding whether a bipartite graph is interval colorable is
NP-complete. The smallest known examples of interval non-colorable bipartite
graphs have $19$ vertices. On the other hand it is known that the bipartite
graphs on at most $14$ vertices are interval colorable. In this work we observe
that several classes of bipartite graphs of small order have an interval
coloring. In particular, we show that all bipartite graphs on $15$ vertices are
interval colorable.
|
[
{
"version": "v1",
"created": "Wed, 12 Aug 2015 08:48:24 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Khachatrian",
"Hrant",
""
],
[
"Mamikonyan",
"Tigran",
""
]
] |
new_dataset
| 0.997902 |
1603.09420
|
Jianxin Wu
|
Guo-Bing Zhou and Jianxin Wu and Chen-Lin Zhang and Zhi-Hua Zhou
|
Minimal Gated Unit for Recurrent Neural Networks
| null | null | null | null |
cs.NE cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently recurrent neural networks (RNN) has been very successful in handling
sequence data. However, understanding RNN and finding the best practices for
RNN is a difficult task, partly because there are many competing and complex
hidden units (such as LSTM and GRU). We propose a gated unit for RNN, named as
Minimal Gated Unit (MGU), since it only contains one gate, which is a minimal
design among all gated hidden units. The design of MGU benefits from evaluation
results on LSTM and GRU in the literature. Experiments on various sequence data
show that MGU has comparable accuracy with GRU, but has a simpler structure,
fewer parameters, and faster training. Hence, MGU is suitable in RNN's
applications. Its simple architecture also means that it is easier to evaluate
and tune, and in principle it is easier to study MGU's properties theoretically
and empirically.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 00:01:10 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Zhou",
"Guo-Bing",
""
],
[
"Wu",
"Jianxin",
""
],
[
"Zhang",
"Chen-Lin",
""
],
[
"Zhou",
"Zhi-Hua",
""
]
] |
new_dataset
| 0.982681 |
1603.09520
|
Karel B\v{r}inda
|
Petr \v{C}ervenka, Karel B\v{r}inda, Michaela Hanouskov\'a, Petr
Hofman, Radek Seifert
|
Blind Friendly Maps: Tactile Maps for the Blind as a Part of the Public
Map Portal (Mapy.cz)
| null | null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blind people can now use maps located at Mapy.cz, thanks to the long-standing
joint efforts of the ELSA Center at the Czech Technical University in Prague,
the Teiresias Center at Masaryk University, and the company Seznam.cz.
Conventional map underlays are automatically adjusted so that they could be
read through touch after being printed on microcapsule paper, which opens a
whole new perspective in the use of tactile maps. Users may select an area of
their choice in the Czech Republic (only within its boundaries, for the time
being) and also the production of tactile maps, including the preparation of
the map underlays, takes no more than several minutes.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 10:44:01 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Červenka",
"Petr",
""
],
[
"Břinda",
"Karel",
""
],
[
"Hanousková",
"Michaela",
""
],
[
"Hofman",
"Petr",
""
],
[
"Seifert",
"Radek",
""
]
] |
new_dataset
| 0.997826 |
1603.09570
|
Dibyayan Chakraborty
|
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
|
On local structures of cubicity 2 graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A 2-stab unit interval graph (2SUIG) is an axes-parallel unit square
intersection graph where the unit squares intersect either of the two fixed
lines parallel to the $X$-axis, distance $1 + \epsilon$ ($0 < \epsilon < 1$)
apart. This family of graphs allow us to study local structures of unit square
intersection graphs, that is, graphs with cubicity 2. The complexity of
determining whether a tree has cubicity 2 is unknown while the graph
recognition problem for unit square intersection graph is known to be NP-hard.
We present a polynomial time algorithm for recognizing trees that admit a 2SUIG
representation.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 13:07:25 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Bhore",
"Sujoy Kumar",
""
],
[
"Chakraborty",
"Dibyayan",
""
],
[
"Das",
"Sandip",
""
],
[
"Sen",
"Sagnik",
""
]
] |
new_dataset
| 0.999335 |
1603.09578
|
Prateek Kapadia
|
Prateek Kapadia
|
Wireless Coverage Area Computation and Optimization
|
Ph.D Thesis, Department of Computer Science and Engineering, IIT
Bombay
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A wireless network's design must include the optimization of the area of
coverage of its wireless transmitters - mobile and base stations in cellular
networks, wireless access points in WLANs, or nodes on a transmit schedule in a
wireless ad-hoc network. Typically, the coverage optimization for the common
channels is solved by spatial multiplexing, i.e. keeping the access networks
far apart. However, with increasing densities of wireless network deployments
(including the Internet-of-Things) and paucity of spectrum, and new
developments like whitespace devices and self-organizing, cognitive networks,
there is a need to manage interference and optimize coverage by efficient
algorithms that correctly set the transmit powers to ensure that transmissions
only use the power necessary.
In this work we study methods for computing and optimizing
interference-limited coverage maps of a set of transmitters. We progress
successively through increasingly realistic network scenarios. We begin with a
disk model with a fixed set of transmitters and present an optimal algorithm
for computing the coverage map. We then enhance the model to include updates to
the network, in the form of addition or deletion of one transmitter. In this
dynamic setting, we present an optimal algorithm to maintain updates to the
coverage map. We then move to a more realistic interference model - the SINR
model. For the SINR model we first show geometric bases for coverage maps. We
then present a method to approximate the measure of the coverage area. Finally,
we present an algorithm that uses this measure to optimize the coverage area
with minimum total transmit power.
|
[
{
"version": "v1",
"created": "Fri, 14 Aug 2015 13:47:33 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Kapadia",
"Prateek",
""
]
] |
new_dataset
| 0.980877 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.