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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1510.07864
|
Thomas Marcel Ender
|
Thomas Marcel Ender, Patrick Vananti
|
Dignit\'e - DIGital Network Information & Traces Extraction
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web-based criminality like counterfeiting uses web applications which are
hosted on web servers. Those servers contain a lot of information which can be
used to identify the owner and other connected persons like hosters, shipping
partners, money mules and more. These pieces of information reveal insights on
the owner or provider of a fraud website, thus we can call them traces. These
traces can then be used by the police, law enforcement authorities or the legal
representatives of the victim. In our project 2 we had identified a vast range
of possible traces. We had also considered their information content and
existing limitations. During our Bachelor thesis, we have selected several
traces and started the implementation of the API with its underlying library.
After the successful implementation of the selected traces, we have created a
graphical user interface to allow the use of our solution without using a
command-line interface. To do so, we have learned to use the Scala Programming
Language and its integration with Java code. The graphical user interface of
our example application is built using Scala Swing, the Scala adoption of the
Swing Framework. The test cases are defined using ScalaTest with FlatSpec and
Matchers and executed using the JUnit Runner.
|
[
{
"version": "v1",
"created": "Tue, 27 Oct 2015 11:15:48 GMT"
}
] | 2015-10-28T00:00:00 |
[
[
"Ender",
"Thomas Marcel",
""
],
[
"Vananti",
"Patrick",
""
]
] |
new_dataset
| 0.999256 |
1503.06264
|
Tao Zhao
|
Tao Zhao, Liumeng Wang, Xi Zheng, Sheng Zhou, Zhisheng Niu
|
HyCell: Enabling GREEN Base Station Operations in Software-Defined Radio
Access Networks
|
6 pages, 4 figures, accepted by IEEE ICC 2015 Workshop on Next
Generation Green ICT
| null |
10.1109/ICCW.2015.7247614
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The radio access networks (RANs) need to support massive and diverse data
traffic with limited spectrum and energy. To cope with this challenge,
software-defined radio access network (SDRAN) architectures have been proposed
to renovate the RANs. However, current researches lack the design and
evaluation of network protocols. In this paper, we address this problem by
presenting the protocol design and evaluation of hyper-cellular networks
(HyCell), an SDRAN framework making base station (BS) operations globally
resource-optimized and energy-efficient (GREEN). Specifically, we first propose
a separation scheme to realize the decoupled air interface in HyCell. Then we
design a BS dispatching protocol which determines and assigns the optimal BS
for serving mobile users, and a BS sleeping protocol to improve the network
energy efficiency. Finally, we evaluate the proposed design in our HyCell
testbed. Our evaluation validates the feasibility of the proposed separation
scheme, demonstrates the effectiveness of BS dispatching, and shows great
potential in energy saving through BS sleeping control.
|
[
{
"version": "v1",
"created": "Sat, 21 Mar 2015 05:09:39 GMT"
}
] | 2015-10-27T00:00:00 |
[
[
"Zhao",
"Tao",
""
],
[
"Wang",
"Liumeng",
""
],
[
"Zheng",
"Xi",
""
],
[
"Zhou",
"Sheng",
""
],
[
"Niu",
"Zhisheng",
""
]
] |
new_dataset
| 0.996937 |
1510.07247
|
Samuel Bucheli
|
Samuel Bucheli
|
Some Notes on Temporal Justification Logic
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Justification logics are modal-like logics with the additional capability of
recording the reason, or justification, for modalities in syntactic structures,
called justification terms. Justification logics can be seen as explicit
counterparts to modal logic. The behavior and interaction of agents in
distributed system is often modeled using logics of knowledge and time. In this
paper, we sketch some preliminary ideas on how the modal knowledge part of such
logics of knowledge and time could be replaced with an appropriate
justification logic.
|
[
{
"version": "v1",
"created": "Sun, 25 Oct 2015 13:52:36 GMT"
}
] | 2015-10-27T00:00:00 |
[
[
"Bucheli",
"Samuel",
""
]
] |
new_dataset
| 0.994038 |
1510.07510
|
Chenrong Xiong
|
Chenrong Xiong, Jun Lin, and Zhiyuan Yan
|
A multi-mode area-efficient SCL polar decoder
|
13 pages, 9 figures, submitted to TVLSI
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are of great interest since they are the first provably
capacity-achieving forward error correction codes. To improve throughput and to
reduce decoding latency of polar decoders, maximum likelihood (ML) decoding
units are used by successive cancellation list (SCL) decoders as well as
successive cancellation (SC) decoders. This paper proposes an approximate ML
(AML) decoding unit for SCL decoders first. In particular, we investigate the
distribution of frozen bits of polar codes designed for both the binary erasure
and additive white Gaussian noise channels, and take advantage of the
distribution to reduce the complexity of the AML decoding unit, improving the
area efficiency of SCL decoders. Furthermore, a multi-mode SCL decoder with
variable list sizes and parallelism is proposed. If high throughput or small
latency is required, the decoder decodes multiple received codewords in
parallel with a small list size. However, if error performance is of higher
priority, the multi-mode decoder switches to a serial mode with a bigger list
size. Therefore, the multi-mode SCL decoder provides a flexible tradeoff
between latency, throughput and error performance, and adapts to different
throughput and latency requirements at the expense of small overhead. Hardware
implementation and synthesis results show that our polar decoders not only have
a better area efficiency but also easily adapt to different communication
channels and applications.
|
[
{
"version": "v1",
"created": "Mon, 26 Oct 2015 15:22:19 GMT"
}
] | 2015-10-27T00:00:00 |
[
[
"Xiong",
"Chenrong",
""
],
[
"Lin",
"Jun",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.992464 |
1510.07595
|
Steven Lessard
|
Steven Lessard, Jonathan Bruce, Erik Jung, Mircea Teodorescu, Vytas
SunSpiral, and Adrian Agogino
|
A light-weight, multi-axis compliant tensegrity joint
|
Initial submission
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a light-weight, multi- axis compliant tenegrity
joint that is biologically inspired by the human elbow. This tensegrity elbow
actuates by shortening and lengthening cable in a method inspired by muscular
actuation in a person. Unlike many series elastic actuators, this joint is
structurally compliant not just along each axis of rotation, but along other
axes as well. Compliant robotic joints are indispensable in unpredictable
environments, including ones where the robot must interface with a person. The
joint also addresses the need for functional redundancy and flexibility, traits
which are required for many applications that investigate the use of
biologically accurate robotic models.
|
[
{
"version": "v1",
"created": "Mon, 26 Oct 2015 18:57:10 GMT"
}
] | 2015-10-27T00:00:00 |
[
[
"Lessard",
"Steven",
""
],
[
"Bruce",
"Jonathan",
""
],
[
"Jung",
"Erik",
""
],
[
"Teodorescu",
"Mircea",
""
],
[
"SunSpiral",
"Vytas",
""
],
[
"Agogino",
"Adrian",
""
]
] |
new_dataset
| 0.997653 |
1510.06535
|
Uri Zwick
|
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
|
Hollow Heaps
|
27 pages, 7 figures, preliminary version appeared in ICALP 2015
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the hollow heap, a very simple data structure with the same
amortized efficiency as the classical Fibonacci heap. All heap operations
except delete and delete-min take $O(1)$ time, worst case as well as amortized;
delete and delete-min take $O(\log n)$ amortized time on a heap of $n$ items.
Hollow heaps are by far the simplest structure to achieve this. Hollow heaps
combine two novel ideas: the use of lazy deletion and re-insertion to do
decrease-key operations, and the use of a dag (directed acyclic graph) instead
of a tree or set of trees to represent a heap. Lazy deletion produces hollow
nodes (nodes without items), giving the data structure its name.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2015 09:09:11 GMT"
}
] | 2015-10-23T00:00:00 |
[
[
"Hansen",
"Thomas Dueholm",
""
],
[
"Kaplan",
"Haim",
""
],
[
"Tarjan",
"Robert E.",
""
],
[
"Zwick",
"Uri",
""
]
] |
new_dataset
| 0.954249 |
1510.06541
|
Yueling Che
|
Yueling Che, Jie Xu, Lingjie Duan, and Rui Zhang
|
Multi-antenna Wireless Powered Communication with Co-channel Energy and
Information Transfer
|
IEEE Communications Letters. Accepted. 9 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter studies a multi-antenna wireless powered communication (WPC)
system with co-channel energy and information transfer, where a wireless device
(WD), powered up by wireless energy transfer (WET) from an energy transmitter
(ET), communicates to an information receiver (IR) over the same frequency
band. We maximize the achievable data rate from the WD to the IR by jointly
optimizing the energy beamforming at the ET and the information beamforming at
the WD, subject to their individual transmit power constraints. We obtain the
optimal solution to this problem in closed-form, where the optimal energy
beamforming at the ET achieves a best energy/interference tradeoff between
maximizing the energy transfer efficiency to the WD and minimizing the
co-channel interference to the IR. Numerical results show that our proposed
optimal co-channel design is superior to other reference schemes.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2015 09:20:46 GMT"
}
] | 2015-10-23T00:00:00 |
[
[
"Che",
"Yueling",
""
],
[
"Xu",
"Jie",
""
],
[
"Duan",
"Lingjie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.992186 |
1510.06074
|
Pedro Otao Pereira
|
Pedro O.Pereira and Dimos V. Dimarogonas
|
Bounded Control for Double Integrator in Quadrotor Dynamics
|
Companion article submitted to ECC 2016
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct a trajectory tracking controller for a quadrotor system by
finding a coordinate change which transforms the quadrotor's vector field into
that of a thrust propelled system. In a thrust propelled system, the goal is to
stabilize its position around the origin, while the system is actuated by a one
dimensional acceleration/thrust along a direction vector, by a time-varying
gravity, and by the angular acceleration of the direction vector. For this
system, a solution has been proposed in a companion article, submitted to ECC
2016, based on the implicit knowledge of a bounded controller for a double
integrator system, and on the implicit knowledge of a Lyapunov function that
guarantees the origin is asymptotically stable for the double integrator
controlled by the bounded controller. We present two alternative bounded
controllers for a double integrator system, and corresponding Lyapunov
functions.
|
[
{
"version": "v1",
"created": "Tue, 20 Oct 2015 22:02:47 GMT"
}
] | 2015-10-22T00:00:00 |
[
[
"Pereira",
"Pedro O.",
""
],
[
"Dimarogonas",
"Dimos V.",
""
]
] |
new_dataset
| 0.987133 |
1510.06359
|
Tadilo E Bogale
|
Tadilo Endeshaw Bogale and Long Bao Le
|
Massive MIMO and Millimeter Wave for 5G Wireless HetNet: Potentials and
Challenges
|
IEEE Vehicular Technology Magazine (To appear)
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There have been active research activities worldwide in developing the
next-generation 5G wireless network. The 5G network is expected to support
significantly large amount of mobile data traffic and huge number of wireless
connections, achieve better cost- and energy-efficiency as well as quality of
service (QoS) in terms of communication delay, reliability and security. To
this end, the 5G wireless network should exploit potential gains in different
network dimensions including super dense and heterogeneous deployment of cells
and massive antenna arrays (i.e., massive multiple input multiple output (MIMO)
technologies) and utilization of higher frequencies, in particular millimeter
wave (mmWave) frequencies. This article discusses potentials and challenges of
the 5G heterogeneous wireless network (HetNet) which incorporates massive MIMO
and mmWave technologies. We will first provide the typical requirements of the
5G wireless network. Then, the significance of massive MIMO and mmWave in
engineering the future 5G HetNet is discussed in detail. Potential challenges
associated with the design of such 5G HetNet are discussed. Finally, we provide
some case studies, which illustrate the potential benefits of the considered
technologies.
|
[
{
"version": "v1",
"created": "Wed, 21 Oct 2015 18:34:40 GMT"
}
] | 2015-10-22T00:00:00 |
[
[
"Bogale",
"Tadilo Endeshaw",
""
],
[
"Le",
"Long Bao",
""
]
] |
new_dataset
| 0.994267 |
1405.7178
|
Katsutoshi Yoshida
|
Katsutoshi Yoshida, Shigeki Matsumoto and Yoichi Matsue
|
Artificial Wrestling: A Dynamical Formulation of Autonomous Agents
Fighting in a Coupled Inverted Pendula Framework
|
The 12th International Conference on Motion and Vibration Control
(MOVIC 2014), August 3-7, 2014, Sapporo, Japan. This article was selected as
an article of Mechanical Engineering Journal after minor revisions; the final
version is available at http://dx.doi.org/10.1299/mej.14-00518
| null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop autonomous agents fighting with each other, inspired by human
wrestling. For this purpose, we propose a coupled inverted pendula (CIP)
framework in which: 1) tips of two inverted pendulums are linked by a
connection rod, 2) each pendulum is primarily stabilized by a PD-controller, 3)
and is additionally equipped with an intelligent controller. Based on this
framework, we dynamically formulate an intelligent controller designed to store
dynamical correspondence from initial states to final states of the CIP model,
to receive state vectors of the model, and to output impulsive control forces
to produce desired final states of the model. Developing a quantized and
reduced order design of this controller, we have a practical control procedure
based on an off-line learning method. We then conduct numerical simulations to
investigate individual performance of the intelligent controller, showing that
the performance can be improved by adding a delay element into the intelligent
controller. The result shows that the performance depends not only on
quantization resolutions of learning data but also on delay time of the delay
element. Finally, we install the intelligent controllers into both pendulums in
the proposed framework to demonstrate autonomous competitive behavior between
inverted pendulums.
|
[
{
"version": "v1",
"created": "Wed, 28 May 2014 10:06:17 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Jun 2014 23:53:00 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Oct 2015 03:41:35 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Yoshida",
"Katsutoshi",
""
],
[
"Matsumoto",
"Shigeki",
""
],
[
"Matsue",
"Yoichi",
""
]
] |
new_dataset
| 0.996957 |
1510.05700
|
Fl\'avio Souza
|
Fl\'avio Souza and Diego de Las Casas and Vin\'icius Flores and SunBum
Youn and Meeyoung Cha and Daniele Quercia and Virg\'ilio Almeida
|
Dawn of the Selfie Era: The Whos, Wheres, and Hows of Selfies on
Instagram
|
ACM Conference on Online Social Networks 2015, Stanford University,
California, USA
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online interactions are increasingly involving images, especially those
containing human faces, which are naturally attention grabbing and more
effective at conveying feelings than text. To understand this new convention of
digital culture, we study the collective behavior of sharing selfies on
Instagram and present how people appear in selfies and which patterns emerge
from such interactions. Analysis of millions of photos shows that the amount of
selfies has increased by 900 times from 2012 to 2014. Selfies are an effective
medium to grab attention; they generate on average 1.1--3.2 times more likes
and comments than other types of content on Instagram. Compared to other
content, interactions involving selfies exhibit variations in homophily scores
(in terms of age and gender) that suggest they are becoming more widespread.
Their style also varies by cultural boundaries in that the average age and
majority gender seen in selfies differ from one country to another. We provide
explanations of such country-wise variations based on cultural and
socioeconomic contexts.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 21:47:16 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Souza",
"Flávio",
""
],
[
"Casas",
"Diego de Las",
""
],
[
"Flores",
"Vinícius",
""
],
[
"Youn",
"SunBum",
""
],
[
"Cha",
"Meeyoung",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Almeida",
"Virgílio",
""
]
] |
new_dataset
| 0.998175 |
1510.05705
|
Ella Gale
|
Ella Gale
|
Single Memristor Logic Gates: From NOT to a Full Adder
| null | null | null | null |
cs.ET cond-mat.mes-hall cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memristors have been suggested as a novel route to neuromorphic computing
based on the similarity between them and neurons (specifically synapses and ion
pumps). The d.c. action of the memristor is a current spike which imparts a
short-term memory to the device. Here it is demonstrated that this short-term
memory works exactly like habituation (e.g. in \emph{Aplysia}). We elucidate
the physical rules, based on energy conservation, governing the interaction of
these current spikes: summation, `bounce-back', directionality and `diminishing
returns'. Using these rules, we introduce 4 different logical systems to
implement sequential logic in the memristor and demonstrate how sequential
logic works by instantiating a NOT gate, an AND gate, an XOR gate and a Full
Adder with a single memristor. The Full Adder makes use of the memristor's
short-term memory to add together three binary values and outputs the sum, the
carry digit and even the order they were input in. A memristor full adder also
outputs the arithmetical sum of bits, allowing for a logically (but not
physically) reversible system. Essentially, we can replace an input/output port
with an extra time-step, allowing a single memristor to do a hither-to
unexpectedly large amount of computation. This makes up for the memristor's
slow operation speed and may relate to how neurons do a similarly-large
computation with such slow operations speeds. We propose that using spiking
logic, either in gates or as neuron-analogues, with plastic rewritable
connections between them, would allow the building of a neuromorphic computer.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 22:20:42 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Gale",
"Ella",
""
]
] |
new_dataset
| 0.990188 |
1510.05828
|
Prateek Dewan
|
Prateek Dewan and Ponnurangam Kumaraguru
|
Hiding in Plain Sight: The Anatomy of Malicious Facebook Pages
|
11 pages, 9 figures, 6 tables
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facebook is the world's largest Online Social Network, having more than 1
billion users. Like most other social networks, Facebook is home to various
categories of hostile entities who abuse the platform by posting malicious
content. In this paper, we identify and characterize Facebook pages that engage
in spreading URLs pointing to malicious domains. We used the Web of Trust API
to determine domain reputations of URLs published by pages, and identified 627
pages publishing untrustworthy information, misleading content, adult and child
unsafe content, scams, etc. which are deemed as "Page Spam" by Facebook, and do
not comply with Facebook's community standards. Our findings revealed dominant
presence of politically polarized entities engaging in spreading content from
untrustworthy web domains. Anger and religion were the most prominent topics in
the textual content published by these pages. We found that at least 8% of all
malicious pages were dedicated to promote a single malicious domain. Studying
the temporal posting activity of pages revealed that malicious pages were more
active than benign pages. We further identified collusive behavior within a set
of malicious pages spreading adult and pornographic content. We believe our
findings will enable technologists to devise efficient automated solutions to
identify and curb the spread of malicious content through such pages. To the
best of our knowledge, this is the first attempt in literature, focused
exclusively on characterizing malicious Facebook pages.
|
[
{
"version": "v1",
"created": "Tue, 20 Oct 2015 10:42:48 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Dewan",
"Prateek",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.998268 |
1510.05891
|
Muhammad Jawaherul Alam
|
Md. Jawaherul Alam, Franz J. Brandenburg and Stephen G. Kobourov
|
On the Book Thickness of 1-Planar Graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a book embedding of a graph G, the vertices of G are placed in order along
a straight-line called spine of the book, and the edges of G are drawn on a set
of half-planes, called the pages of the book, such that two edges drawn on a
page do not cross each other. The minimum number of pages in which a graph can
be embedded is called the book-thickness or the page-number of the graph. It is
known that every planar graph has a book embedding on at most four pages. Here
we investigate the book-embeddings of 1-planar graphs. A graph is 1-planar if
it can be drawn in the plane such that each edge is crossed at most once. We
prove that every 1-planar graph has a book embedding on at most 16 pages and
every 3-connected 1-planar graph has a book embedding on at most 12 pages. The
drawings can be computed in linear time from any given 1-planar embedding of
the graph.
|
[
{
"version": "v1",
"created": "Tue, 20 Oct 2015 13:40:33 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Brandenburg",
"Franz J.",
""
],
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.991739 |
1510.05938
|
Antonis Gotsis
|
Antonis G. Gotsis, Stelios Stefanatos, Angeliki Alexiou
|
Ultra Dense Networks: The New Wireless Frontier for Enabling 5G Access
|
to appear in IEEE Vehicular Technology Magazine
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The extreme traffic load that future wireless networks are expected to
accommodate requires a re-thinking of the system design. Initial estimations
indicate that, different from the evolutionary path of previous cellular
generations that was based on spectral efficiency improvements, the most
substantial amount of future system performance gains will be obtained by means
of network infrastructure densification. By increasing the density of
operator-deployed infrastructure elements, along with incorporation of
user-deployed access nodes and mobile user devices acting as "infrastructure
prosumers", it is expected that having one or more access nodes exclusively
dedicated to each user will become feasible, introducing the ultra dense
network (UDN) paradigm. Although it is clear that UDNs are able to take
advantage of the significant benefits provided by proximal transmissions and
increased spatial reuse of system resources, at the same time, large node
density and irregular deployment introduce new challenges, mainly due to the
interference environment characteristics that are vastly different from
previous cellular deployments. This article attempts to provide insights on
fundamental issues related to UDN deployment, such as determining the
infrastructure density required to support given traffic load requirements and
the benefits of network-wise coordination, demonstrating the potential of UDNs
for 5G wireless networks.
|
[
{
"version": "v1",
"created": "Tue, 20 Oct 2015 15:50:39 GMT"
}
] | 2015-10-21T00:00:00 |
[
[
"Gotsis",
"Antonis G.",
""
],
[
"Stefanatos",
"Stelios",
""
],
[
"Alexiou",
"Angeliki",
""
]
] |
new_dataset
| 0.972644 |
1410.4688
|
Ibrahim Abdelaziz
|
Ibrahim Abdelaziz and Sherif Abdou and Hassanin Al-Barhamtoshy
|
Large Vocabulary Arabic Online Handwriting Recognition System
|
Preprint submitted to Pattern Analysis and Applications Journal
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabic handwriting is a consonantal and cursive writing. The analysis of
Arabic script is further complicated due to obligatory dots/strokes that are
placed above or below most letters and usually written delayed in order. Due to
ambiguities and diversities of writing styles, recognition systems are
generally based on a set of possible words called lexicon. When the lexicon is
small, recognition accuracy is more important as the recognition time is
minimal. On the other hand, recognition speed as well as the accuracy are both
critical when handling large lexicons. Arabic is rich in morphology and syntax
which makes its lexicon large. Therefore, a practical online handwriting
recognition system should be able to handle a large lexicon with reasonable
performance in terms of both accuracy and time. In this paper, we introduce a
fully-fledged Hidden Markov Model (HMM) based system for Arabic online
handwriting recognition that provides solutions for most of the difficulties
inherent in recognizing the Arabic script. A new preprocessing technique for
handling the delayed strokes is introduced. We use advanced modeling techniques
for building our recognition system from the training data to provide more
detailed representation for the differences between the writing units, minimize
the variances between writers in the training data and have a better
representation for the features space. System results are enhanced using an
additional post-processing step with a higher order language model and
cross-word HMM models. The system performance is evaluated using two different
databases covering small and large lexicons. Our system outperforms the
state-of-art systems for the small lexicon database. Furthermore, it shows
promising results (accuracy and time) when supporting large lexicon with the
possibility for adapting the models for specific writers to get even better
results.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 11:09:35 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Nov 2014 14:31:48 GMT"
},
{
"version": "v3",
"created": "Sat, 17 Oct 2015 09:47:28 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Abdelaziz",
"Ibrahim",
""
],
[
"Abdou",
"Sherif",
""
],
[
"Al-Barhamtoshy",
"Hassanin",
""
]
] |
new_dataset
| 0.999625 |
1505.00487
|
Subhashini Venugopalan
|
Subhashini Venugopalan, Marcus Rohrbach, Jeff Donahue, Raymond Mooney,
Trevor Darrell, Kate Saenko
|
Sequence to Sequence -- Video to Text
|
ICCV 2015 camera-ready. Includes code, project page and LSMDC
challenge results
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-world videos often have complex dynamics; and methods for generating
open-domain video descriptions should be sensitive to temporal structure and
allow both input (sequence of frames) and output (sequence of words) of
variable length. To approach this problem, we propose a novel end-to-end
sequence-to-sequence model to generate captions for videos. For this we exploit
recurrent neural networks, specifically LSTMs, which have demonstrated
state-of-the-art performance in image caption generation. Our LSTM model is
trained on video-sentence pairs and learns to associate a sequence of video
frames to a sequence of words in order to generate a description of the event
in the video clip. Our model naturally is able to learn the temporal structure
of the sequence of frames as well as the sequence model of the generated
sentences, i.e. a language model. We evaluate several variants of our model
that exploit different visual features on a standard set of YouTube videos and
two movie description datasets (M-VAD and MPII-MD).
|
[
{
"version": "v1",
"created": "Sun, 3 May 2015 22:32:00 GMT"
},
{
"version": "v2",
"created": "Tue, 12 May 2015 16:08:57 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Oct 2015 18:01:06 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Venugopalan",
"Subhashini",
""
],
[
"Rohrbach",
"Marcus",
""
],
[
"Donahue",
"Jeff",
""
],
[
"Mooney",
"Raymond",
""
],
[
"Darrell",
"Trevor",
""
],
[
"Saenko",
"Kate",
""
]
] |
new_dataset
| 0.96183 |
1505.06605
|
Ravi Kiran Sarvadevabhatla
|
Ravi Kiran Sarvadevabhatla, R. Venkatesh Babu
|
Expresso : A user-friendly GUI for Designing, Training and Exploring
Convolutional Neural Networks
|
Project page : http://val.serc.iisc.ernet.in/expresso/
| null | null | null |
cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With a view to provide a user-friendly interface for designing, training and
developing deep learning frameworks, we have developed Expresso, a GUI tool
written in Python. Expresso is built atop Caffe, the open-source, prize-winning
framework popularly used to develop Convolutional Neural Networks. Expresso
provides a convenient wizard-like graphical interface which guides the user
through various common scenarios -- data import, construction and training of
deep networks, performing various experiments, analyzing and visualizing the
results of these experiments. The multi-threaded nature of Expresso enables
concurrent execution and notification of events related to the aforementioned
scenarios. The GUI sub-components and inter-component interfaces in Expresso
have been designed with extensibility in mind. We believe Expresso's
flexibility and ease of use will come in handy to researchers, newcomers and
seasoned alike, in their explorations related to deep learning.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2015 12:12:30 GMT"
},
{
"version": "v2",
"created": "Sun, 18 Oct 2015 07:06:35 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Sarvadevabhatla",
"Ravi Kiran",
""
],
[
"Babu",
"R. Venkatesh",
""
]
] |
new_dataset
| 0.982893 |
1506.06830
|
Zhengchun Zhou
|
Zhengchun Zhou and Nian Li and Cuiling Fan and Tor Helleseth
|
Linear Codes with Two or Three Weights From Quadratic Bent Functions
|
arXiv admin note: text overlap with arXiv:1503.06512 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with few weights have applications in secrete sharing,
authentication codes, association schemes, and strongly regular graphs. In this
paper, several classes of $p$-ary linear codes with two or three weights are
constructed from quadratic Bent functions over the finite field $\gf_p$, where
$p$ is an odd prime. They include some earlier linear codes as special cases.
The weight distributions of these linear codes are also determined.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 00:17:57 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Oct 2015 23:26:37 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Zhou",
"Zhengchun",
""
],
[
"Li",
"Nian",
""
],
[
"Fan",
"Cuiling",
""
],
[
"Helleseth",
"Tor",
""
]
] |
new_dataset
| 0.999642 |
1507.07629
|
Garrick Orchard
|
Garrick Orchard and Ajinkya Jayawant and Gregory Cohen and Nitish
Thakor
|
Converting Static Image Datasets to Spiking Neuromorphic Datasets Using
Saccades
|
10 pages, 6 figures in Frontiers in Neuromorphic Engineering, special
topic on Benchmarks and Challenges for Neuromorphic Engineering, 2015 (under
review)
| null | null | null |
cs.DB q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creating datasets for Neuromorphic Vision is a challenging task. A lack of
available recordings from Neuromorphic Vision sensors means that data must
typically be recorded specifically for dataset creation rather than collecting
and labelling existing data. The task is further complicated by a desire to
simultaneously provide traditional frame-based recordings to allow for direct
comparison with traditional Computer Vision algorithms. Here we propose a
method for converting existing Computer Vision static image datasets into
Neuromorphic Vision datasets using an actuated pan-tilt camera platform. Moving
the sensor rather than the scene or image is a more biologically realistic
approach to sensing and eliminates timing artifacts introduced by monitor
updates when simulating motion on a computer monitor. We present conversion of
two popular image datasets (MNIST and Caltech101) which have played important
roles in the development of Computer Vision, and we provide performance metrics
on these datasets using spike-based recognition algorithms. This work
contributes datasets for future use in the field, as well as results from
spike-based algorithms against which future works can compare. Furthermore, by
converting datasets already popular in Computer Vision, we enable more direct
comparison with frame-based approaches.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 03:23:25 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Orchard",
"Garrick",
""
],
[
"Jayawant",
"Ajinkya",
""
],
[
"Cohen",
"Gregory",
""
],
[
"Thakor",
"Nitish",
""
]
] |
new_dataset
| 0.99467 |
1510.05028
|
Won So
|
Peter Shah and Won So
|
Lamassu: Storage-Efficient Host-Side Encryption
|
13 pages, 11 figures, 2015 USENIX Annual Technical Conference (USENIX
ATC 15)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many storage customers are adopting encryption solutions to protect critical
data. Most existing encryption solutions sit in, or near, the application that
is the source of critical data, upstream of the primary storage system. Placing
encryption near the source ensures that data remains encrypted throughout the
storage stack, making it easier to use untrusted storage, such as public
clouds.
Unfortunately, such a strategy also prevents downstream storage systems from
applying content-based features, such as deduplication, to the data. In this
paper, we present Lamassu, an encryption solution that uses block-oriented,
host-based, convergent encryption to secure data, while preserving
storage-based data deduplication. Unlike past convergent encryption systems,
which typically store encryption metadata in a dedicated store, our system
transparently inserts its metadata into each file's data stream. This allows us
to add Lamassu to an application stack without modifying either the client
application or the storage controller.
In this paper, we lay out the architecture and security model used in our
system, and present a new model for maintaining metadata consistency and data
integrity in a convergent encryption environment. We also evaluate its storage
efficiency and I/O performance by using a variety of microbenchmarks, showing
that Lamassu provides excellent storage efficiency, while achieving I/O
throughput on par with similar conventional encryption systems.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2015 21:26:49 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Shah",
"Peter",
""
],
[
"So",
"Won",
""
]
] |
new_dataset
| 0.984061 |
1510.05041
|
Linnan Wang
|
Linnan Wang, Wei Wu, Jianxiong Xiao, Yi Yang
|
BLASX: A High Performance Level-3 BLAS Library for Heterogeneous
Multi-GPU Computing
|
under review for IPDPS 2016
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Basic Linear Algebra Subprograms (BLAS) are a set of low level linear algebra
kernels widely adopted by applications involved with the deep learning and
scientific computing. The massive and economic computing power brought forth by
the emerging GPU architectures drives interest in implementation of
compute-intensive level 3 BLAS on multi-GPU systems. In this paper, we
investigate existing multi-GPU level 3 BLAS and present that 1) issues, such as
the improper load balancing, inefficient communication, insufficient GPU stream
level concurrency and data caching, impede current implementations from fully
harnessing heterogeneous computing resources; 2) and the inter-GPU
Peer-to-Peer(P2P) communication remains unexplored. We then present BLASX: a
highly optimized multi-GPU level-3 BLAS. We adopt the concepts of
algorithms-by-tiles treating a matrix tile as the basic data unit and
operations on tiles as the basic task. Tasks are guided with a dynamic
asynchronous runtime, which is cache and locality aware. The communication cost
under BLASX becomes trivial as it perfectly overlaps communication and
computation across multiple streams during asynchronous task progression. It
also takes the current tile cache scheme one step further by proposing an
innovative 2-level hierarchical tile cache, taking advantage of inter-GPU P2P
communication. As a result, linear speedup is observable with BLASX under
multi-GPU configurations; and the extensive benchmarks demonstrate that BLASX
consistently outperforms the related leading industrial and academic projects
such as cuBLAS-XT, SuperMatrix, MAGMA and PaRSEC.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2015 22:34:24 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Wang",
"Linnan",
""
],
[
"Wu",
"Wei",
""
],
[
"Xiao",
"Jianxiong",
""
],
[
"Yang",
"Yi",
""
]
] |
new_dataset
| 0.992876 |
1510.05075
|
Huseyin Birkan Yilmaz
|
Nariman Farsad and H. Birkan Yilmaz and Chan-Byoung Chae and Andrea
Goldsmith
|
Energy Model for Vesicle-Based Active Transport Molecular Communication
| null | null | null | null |
cs.ET cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In active transport molecular communication (ATMC), information particles are
actively transported from a transmitter to a receiver using special proteins.
Prior work has demonstrated that ATMC can be an attractive and viable solution
for on-chip applications. The energy consumption of an ATMC system plays a
central role in its design and engineering. In this work, an energy model is
presented for ATMC and the model is used to provide guidelines for designing
energy efficient systems. The channel capacity per unit energy is analyzed and
maximized. It is shown that based on the size of the symbol set and the symbol
duration, there is a vesicle size that maximizes rate per unit energy. It is
also demonstrated that maximizing rate per unit energy yields very different
system parameters compared to maximizing the rate only.
|
[
{
"version": "v1",
"created": "Sat, 17 Oct 2015 06:02:18 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Farsad",
"Nariman",
""
],
[
"Yilmaz",
"H. Birkan",
""
],
[
"Chae",
"Chan-Byoung",
""
],
[
"Goldsmith",
"Andrea",
""
]
] |
new_dataset
| 0.99124 |
1510.05129
|
Henk Moed
|
Henk F. Moed and Gali Halevi
|
On full text download and citation distributions in scientific-scholarly
journals
|
Author copy of an article accepted for publication in JASIST, posted
on 17 Oct 2015
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A statistical analysis of full text downloads of articles in Elseviers
ScienceDirect covering all disciplines reveals large differences in download
frequencies, their skewness, and their correlation with Scopus-based citation
counts, between disciplines, journals, and document types. Download counts tend
to be two orders of magnitude higher and less skewedly distributed than
citations. A mathematical model based on the sum of two exponentials does not
adequately capture monthly download counts. The degree of correlation at the
article level within a journal is similar to that at the journal level in the
discipline covered by that journal, suggesting that the differences between
journals are to a large extent discipline specific. Despite the fact that in
all study journals download and citation counts per article positively
correlate, little overlap may exist between the set of articles appearing in
the top of the citation distribution and that with the most frequently
downloaded ones. Usage and citation leaks, bulk downloading, differences
between reader and author populations in a subject field, the type of document
or its content, differences in obsolescence patterns between downloads and
citations, different functions of reading and citing in the research process,
all provide possible explanations of differences between download and citation
distributions.
|
[
{
"version": "v1",
"created": "Sat, 17 Oct 2015 14:16:31 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Moed",
"Henk F.",
""
],
[
"Halevi",
"Gali",
""
]
] |
new_dataset
| 0.99417 |
1510.05205
|
An Liu Dr
|
An Liu and Vincent Lau
|
Asymptotic Scaling Laws of Wireless Adhoc Network with Physical Layer
Caching
|
15 pages, 12 figures, accepted by IEEE Transactions on Wireless
Communications
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a physical layer (PHY) caching scheme for wireless adhoc networks.
The PHY caching exploits cache-assisted multihop gain and cache-induced
dual-layer CoMP gain, which substantially improves the throughput of wireless
adhoc networks. In particular, the PHY caching scheme contains a novel PHY
transmission mode called the cache-induced dual-layer CoMP which can support
homogeneous opportunistic CoMP in the wireless adhoc network. Compared with
traditional per-node throughput scaling results of
\Theta\left(1/\sqrt{N}\right), we can achieve O(1) per node throughput for a
cached wireless adhoc network with N nodes. Moreover, we analyze the throughput
of the PHY caching scheme for regular wireless adhoc networks and study the
impact of various system parameters on the PHY caching gain.
|
[
{
"version": "v1",
"created": "Sun, 18 Oct 2015 07:39:49 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Liu",
"An",
""
],
[
"Lau",
"Vincent",
""
]
] |
new_dataset
| 0.996641 |
1510.05405
|
Mira Sarkis
|
Mira Sarkis (LTCI), Cyril Concolato (LTCI), Jean-Claude Dufourd (LTCI)
|
The Virtual Splitter: Refactoring Web Applications for the Multiscreen
Environment
| null |
DocEng'14: ACM Symposium on Document Engineering, ACM, 2014,
pp.Pages139-142 \<10.1145/2644866.2644893\>
|
10.1145/2644866.2644893
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creating web applications for the multiscreen environment is still a
challenge. One approach is to transform existing single-screen applications but
this has not been done yet automatically or generically. This paper proposes a
refactor-ing system. It consists of a generic and extensible mapping phase that
automatically analyzes the application content based on a semantic or a visual
criterion determined by the author or the user, and prepares it for the
splitting process. The system then splits the application and as a result
delivers two instrumented applications ready for distribution across devices.
During runtime, the system uses a mirroring phase to maintain the functionality
of the distributed application and to support a dynamic splitting process.
Developed as a Chrome extension, our approach is validated on several web
applications, including a YouTube page and a video application from Mozilla.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 09:40:17 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Sarkis",
"Mira",
"",
"LTCI"
],
[
"Concolato",
"Cyril",
"",
"LTCI"
],
[
"Dufourd",
"Jean-Claude",
"",
"LTCI"
]
] |
new_dataset
| 0.955864 |
1510.05546
|
Bei Wang
|
Bei Wang and Stephane Ethier and William Tang and Khaled Ibrahim and
Kamesh Madduri and Samuel Williams and Leonid Oliker
|
Modern Gyrokinetic Particle-In-Cell Simulation of Fusion Plasmas on Top
Supercomputers
|
submitted to International Journal of High Performance Computing
Applications
| null | null | null |
cs.DC physics.comp-ph physics.plasm-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Gyrokinetic Toroidal Code at Princeton (GTC-P) is a highly scalable and
portable particle-in-cell (PIC) code. It solves the 5D Vlasov-Poisson equation
featuring efficient utilization of modern parallel computer architectures at
the petascale and beyond. Motivated by the goal of developing a modern code
capable of dealing with the physics challenge of increasing problem size with
sufficient resolution, new thread-level optimizations have been introduced as
well as a key additional domain decomposition. GTC-P's multiple levels of
parallelism, including inter-node 2D domain decomposition and particle
decomposition, as well as intra-node shared memory partition and vectorization
have enabled pushing the scalability of the PIC method to extreme computational
scales. In this paper, we describe the methods developed to build a highly
parallelized PIC code across a broad range of supercomputer designs. This
particularly includes implementations on heterogeneous systems using NVIDIA GPU
accelerators and Intel Xeon Phi (MIC) co-processors and performance comparisons
with state-of-the-art homogeneous HPC systems such as Blue Gene/Q. New
discovery science capabilities in the magnetic fusion energy application domain
are enabled, including investigations of Ion-Temperature-Gradient (ITG) driven
turbulence simulations with unprecedented spatial resolution and long temporal
duration. Performance studies with realistic fusion experimental parameters are
carried out on multiple supercomputing systems spanning a wide range of cache
capacities, cache-sharing configurations, memory bandwidth, interconnects and
network topologies. These performance comparisons using a realistic
discovery-science-capable domain application code provide valuable insights on
optimization techniques across one of the broadest sets of current high-end
computing platforms worldwide.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 15:55:00 GMT"
}
] | 2015-10-20T00:00:00 |
[
[
"Wang",
"Bei",
""
],
[
"Ethier",
"Stephane",
""
],
[
"Tang",
"William",
""
],
[
"Ibrahim",
"Khaled",
""
],
[
"Madduri",
"Kamesh",
""
],
[
"Williams",
"Samuel",
""
],
[
"Oliker",
"Leonid",
""
]
] |
new_dataset
| 0.99771 |
1407.6126
|
Georg Nawratil
|
Georg Nawratil and Josef Schicho
|
Self-motions of pentapods with linear platform
|
28 pages, 5 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a full classification of all pentapods with linear platform
possessing a self-motion beside the trivial rotation about the platform. Recent
research necessitates a contemporary and accurate re-examination of old results
on this topic given by Darboux, Mannheim, Duporcq and Bricard, which also takes
the coincidence of platform anchor points into account. For our study we use
bond theory with respect to a novel kinematic mapping for pentapods with linear
platform, beside the method of singular-invariant leg-rearrangements. Based on
our results we design pentapods with linear platform, which have a simplified
direct kinematics concerning their number of (real) solutions.
|
[
{
"version": "v1",
"created": "Wed, 23 Jul 2014 08:09:06 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Apr 2015 07:19:49 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Sep 2015 09:40:04 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Oct 2015 10:56:54 GMT"
}
] | 2015-10-19T00:00:00 |
[
[
"Nawratil",
"Georg",
""
],
[
"Schicho",
"Josef",
""
]
] |
new_dataset
| 0.957245 |
1510.04880
|
Vishal Midya
|
Anirban Patranabis, Kaushik Banerjee, Vishal Midya, Sneha Chakraborty,
Shankha Sanyal, Archi Banerjee, Ranjan Sengupta and Dipak Ghosh
|
Harmonic and Timbre Analysis of Tabla Strokes
|
14 pages
| null | null | null |
cs.SD physics.class-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indian twin drums mainly bayan and dayan (tabla) are the most important
percussion instruments in India popularly used for keeping rhythm. It is a twin
percussion/drum instrument of which the right hand drum is called dayan and the
left hand drum is called bayan. Tabla strokes are commonly called as `bol',
constitutes a series of syllables. In this study we have studied the timbre
characteristics of nine strokes from each of five different tablas. Timbre
parameters were calculated from LTAS of each stroke signals. Study of timbre
characteristics is one of the most important deterministic approach for
analyzing tabla and its stroke characteristics. Statistical correlations among
timbre parameters were measured and also through factor analysis we get to know
about the parameters of timbre analysis which are closely related. Tabla
strokes have unique harmonic and timbral characteristics at mid frequency range
and have no uniqueness at low frequency ranges.
|
[
{
"version": "v1",
"created": "Thu, 15 Oct 2015 18:42:04 GMT"
}
] | 2015-10-19T00:00:00 |
[
[
"Patranabis",
"Anirban",
""
],
[
"Banerjee",
"Kaushik",
""
],
[
"Midya",
"Vishal",
""
],
[
"Chakraborty",
"Sneha",
""
],
[
"Sanyal",
"Shankha",
""
],
[
"Banerjee",
"Archi",
""
],
[
"Sengupta",
"Ranjan",
""
],
[
"Ghosh",
"Dipak",
""
]
] |
new_dataset
| 0.993812 |
1510.04929
|
Z\'ador D\'aniel Kelemen
|
Z\'ador D\'aniel Kelemen, Bal\'azs T\'odor, S\'andor Hodosi, \'Akos
Somfai
|
Refactoring Technical Support to Reduce Interrupts of Developers
|
9 pages. arXiv admin note: substantial text overlap with
arXiv:1503.05533
|
EuroAsiaSPI 2015, Ankara, Turkey
| null | null |
cs.SI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper an analysis of a technical support data with the goal of
identifying process improvement actions for reducing interrupts is presented. A
technical support chat is established and used to provide internal developer
support to other development teams which use the software code developed by a
core team. The paper shows how data analysis of a 6 months support time helped
to identify gaps and action items for improving the technical support process
to minimize interrupts from other developer teams. The paper also shows effects
(advantages and drawbacks) of refactor actions taken based on this analysis.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2015 16:19:05 GMT"
}
] | 2015-10-19T00:00:00 |
[
[
"Kelemen",
"Zádor Dániel",
""
],
[
"Tódor",
"Balázs",
""
],
[
"Hodosi",
"Sándor",
""
],
[
"Somfai",
"Ákos",
""
]
] |
new_dataset
| 0.990522 |
1510.04951
|
Dmitry Namiot
|
Dmitry Namiot, Manfred Sneps-Sneppe
|
The Physical Web in Smart Cities
| null | null | null | null |
cs.NI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we discuss the physical web projects based on network
proximity for Smart Cities. In general, the Physical Web is an approach for
connecting any physical object to the web. With this approach, we can navigate
and control physical objects in the world surrounding mobile devices.
Alternatively, we can execute services on mobile devices, depending on the
surrounding physical objects. Technically, there are different ways to
enumerate physical objects. In this paper, we will target the models based on
the wireless proximity.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2015 17:07:37 GMT"
}
] | 2015-10-19T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
]
] |
new_dataset
| 0.999627 |
1502.06648
|
Marcus Rohrbach
|
Marcus Rohrbach and Anna Rohrbach and Michaela Regneri and Sikandar
Amin and Mykhaylo Andriluka and Manfred Pinkal and Bernt Schiele
|
Recognizing Fine-Grained and Composite Activities using Hand-Centric
Features and Script Data
|
in International Journal of Computer Vision (IJCV) 2015
| null |
10.1007/s11263-015-0851-8
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Activity recognition has shown impressive progress in recent years. However,
the challenges of detecting fine-grained activities and understanding how they
are combined into composite activities have been largely overlooked. In this
work we approach both tasks and present a dataset which provides detailed
annotations to address them. The first challenge is to detect fine-grained
activities, which are defined by low inter-class variability and are typically
characterized by fine-grained body motions. We explore how human pose and hands
can help to approach this challenge by comparing two pose-based and two
hand-centric features with state-of-the-art holistic features. To attack the
second challenge, recognizing composite activities, we leverage the fact that
these activities are compositional and that the essential components of the
activities can be obtained from textual descriptions or scripts. We show the
benefits of our hand-centric approach for fine-grained activity classification
and detection. For composite activity recognition we find that decomposition
into attributes allows sharing information across composites and is essential
to attack this hard task. Using script data we can recognize novel composites
without having training data for them.
|
[
{
"version": "v1",
"created": "Mon, 23 Feb 2015 22:48:17 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Oct 2015 16:02:19 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Rohrbach",
"Marcus",
""
],
[
"Rohrbach",
"Anna",
""
],
[
"Regneri",
"Michaela",
""
],
[
"Amin",
"Sikandar",
""
],
[
"Andriluka",
"Mykhaylo",
""
],
[
"Pinkal",
"Manfred",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.9982 |
1509.00154
|
Jalil Rasekhi
|
Jalil Rasekhi
|
Tumor Motion Tracking in Liver Ultrasound Images Using Mean Shift and
Active Contour
|
This paper has been withdrawn by the author due to a crucial sign
error in equation 5,6
| null | null | null |
cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new method for motion tracking of tumors in liver
ultrasound image sequences. Our algorithm has two main steps. In the first
step, we apply mean shift algorithm with multiple features to estimate the
center of the target in each frame. Target in the first frame is defined using
an ellipse. Edge, texture, and intensity features are extracted from the first
frame, and then mean shift algorithm is applied to each feature separately to
find the center of ellipse related to that feature in the next frame. The
center of ellipse will be the weighted average of these centers. By using mean
shift actually we estimate the target movement between two consecutive frames.
Once the correct ellipsoid in each frame is known, in the second step we apply
the Dynamic Directional Gradient Vector Flow (DDGVF) version of active contour
models, in order to find the correct boundary of tumors. We sample a few points
on the boundary of active contour then translate those points based on the
translation of the center of ellipsoid in two consecutive frames to determine
the target movement. We use these translated sample points as an initial guess
for active contour in the next frame. Our experimental results show that, the
suggested method provides a reliable performance for liver tumor tracking in
ultrasound image sequences.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2015 06:21:44 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Sep 2015 11:22:42 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Sep 2015 21:09:05 GMT"
},
{
"version": "v4",
"created": "Wed, 14 Oct 2015 23:15:38 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Rasekhi",
"Jalil",
""
]
] |
new_dataset
| 0.982411 |
1510.02818
|
Wolfgang John
|
Rebecca Steinert, Wolfgang John, Pontus Sk\"oldstr\"om, Bertrand
Pechenot, Andr\'as Guly\'as, Istv\'an Pelle, Tam\'as L\'evai, Felici\'an
N\'emeth, Juhoon Kim, Catalin Meirosu, Xuejun Cai, Chunyan Fu, Kostas
Pentikousis, Sachin Sharma, Ioanna Papafili, Guido Marchetto, Riccardo Sisto,
Fulvio Risso, Per Kreuger, Jan Ekman, Shaoteng Liu, Antonio Manzalini, Apoorv
Shukla, Stefan Schmid
|
Service Provider DevOps network capabilities and tools
|
This is the public deliverable D4.2 of the EU FP7 UNIFY project
(ICT-619609) - "Proposal for SP-DevOps network capabilities and tools".
Original Deliverable published at
https://www.fp7-unify.eu/files/fp7-unify-eu-docs/UNIFY-WP4-D4.2%20Proposal%20for%20SP-DevOps%20network%20capabilities%20and%20tools.pdf
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report provides an understanding of how the UNIFY Service Provider
(SP)-DevOps concept can be applied and integrated with a combined cloud and
transport network NFV architecture. Specifically, the report contains technical
descriptions of a set of novel SP-DevOps tools and support functions that
facilitate observability, troubleshooting, verification, and VNF development
processes. The tools and support functions are described in detail together
with their architectural mapping, giving a wider understanding of the SP-DevOps
concept as a whole, and how SP-DevOps tools can be used for supporting
orchestration and programmability in the UNIFY NFV framework. The concept is
further exemplified in a case study for deployment and scaling of an Elastic
Firewall.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 20:32:52 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Oct 2015 14:59:35 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Steinert",
"Rebecca",
""
],
[
"John",
"Wolfgang",
""
],
[
"Sköldström",
"Pontus",
""
],
[
"Pechenot",
"Bertrand",
""
],
[
"Gulyás",
"András",
""
],
[
"Pelle",
"István",
""
],
[
"Lévai",
"Tamás",
""
],
[
"Németh",
"Felicián",
""
],
[
"Kim",
"Juhoon",
""
],
[
"Meirosu",
"Catalin",
""
],
[
"Cai",
"Xuejun",
""
],
[
"Fu",
"Chunyan",
""
],
[
"Pentikousis",
"Kostas",
""
],
[
"Sharma",
"Sachin",
""
],
[
"Papafili",
"Ioanna",
""
],
[
"Marchetto",
"Guido",
""
],
[
"Sisto",
"Riccardo",
""
],
[
"Risso",
"Fulvio",
""
],
[
"Kreuger",
"Per",
""
],
[
"Ekman",
"Jan",
""
],
[
"Liu",
"Shaoteng",
""
],
[
"Manzalini",
"Antonio",
""
],
[
"Shukla",
"Apoorv",
""
],
[
"Schmid",
"Stefan",
""
]
] |
new_dataset
| 0.998118 |
1510.04336
|
Avinash Malik
|
Avinash Malik, Partha S Roop, Sidharta Andalam, Eugene Yip, and Mark
Trew
|
A synchronous rendering of hybrid systems for designing Plant-on-a-Chip
(PoC)
|
18 pages
| null | null | null |
cs.FL cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hybrid systems are discrete controllers that are used for controlling a
physical process (plant) exhibiting continuous dynamics. A hybrid automata (HA)
is a well known and widely used formal model for the specification of such
systems. While many methods exist for simulating hybrid automata, there are no
known approaches for the automatic code generation from HA that are semantic
preserving. If this were feasible, it would enable the design of a
plant-on-a-chip (PoC) system that could be used for the emulation of the plant
to validate discrete controllers. Such an approach would need to be
mathematically sound and should not rely on numerical solvers. We propose a
method of PoC design for plant emulation, not possible before. The approach
restricts input/output (I/O) HA models using a set of criteria for
well-formedness which are statically verified. Following verification, we use
an abstraction based on a synchronous approach to facilitate code generation.
This is feasible through a sound transformation to synchronous HA. We compare
our method (the developed tool called Piha) to the widely used Simulink R
simulation framework and show that our method is superior in both execution
time and code size. Our approach to the PoC problem paves the way for the
emulation of physical plants in diverse domains such as robotics, automation,
medical devices, and intelligent transportation systems.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 22:24:00 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Malik",
"Avinash",
""
],
[
"Roop",
"Partha S",
""
],
[
"Andalam",
"Sidharta",
""
],
[
"Yip",
"Eugene",
""
],
[
"Trew",
"Mark",
""
]
] |
new_dataset
| 0.96062 |
1510.04489
|
H\"useyin Af\c{s}er
|
H\"useyin Af\c{s}er and Hakan Deli\c{c}
|
Polar Codes With Higher-Order Memory
|
15 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the design of a set of code sequences $ \{ {\mathscr
C}_{n}^{(m)} : n\geq 1, m \geq 1 \}$, with memory order $m$ and code-length
$N=O(\phi^n)$, where $ \phi \in (1,2]$ is the largest real root of the
polynomial equation $F(m,\rho)=\rho^m-\rho^{m-1}-1$ and $\phi$ is decreasing in
$m$. $\{ {\mathscr C}_{n}^{(m)}\}$ is based on the channel polarization idea,
where $ \{ {\mathscr C}_{n}^{(1)} \}$ coincides with the polar codes presented
by Ar\i kan and can be encoded and decoded with complexity $O(N \log N)$. $ \{
{\mathscr C}_{n}^{(m)} \}$ achieves the symmetric capacity, $I(W)$, of an
arbitrary binary-input, discrete-output memoryless channel, $W$, for any fixed
$m$ and its encoding and decoding complexities decrease with growing $m$. We
obtain an achievable bound on the probability of block-decoding error, $P_e$,
of $\{ {\mathscr C}_{n}^{(m)} \}$ and showed that $P_e = O (2^{-N^\beta} )$ is
achievable for $\beta < \frac{\phi-1}{1+m(\phi-1)}$.
|
[
{
"version": "v1",
"created": "Thu, 15 Oct 2015 12:09:11 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Afşer",
"Hüseyin",
""
],
[
"Deliç",
"Hakan",
""
]
] |
new_dataset
| 0.998712 |
1510.04686
|
Daniel Lemus
|
Robert Andrawis, Jose David Bermeo, James Charles, Jianbin Fang, Jim
Fonseca, Yu He, Gerhard Klimeck, Zhengping Jiang, Tillmann Kubis, Daniel
Mejia, Daniel Lemus, Michael Povolotskyi, Santiago Alonso Perez Rubiano,
Prasad Sarangapani, Lang Zeng
|
NEMO5: Achieving High-end Internode Communication for Performance
Projection Beyond Moore's Law
| null | null | null | null |
cs.DC physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electronic performance predictions of modern nanotransistors require
nonequilibrium Green's functions including incoherent scattering on phonons as
well as inclusion of random alloy disorder and surface roughness effects. The
solution of all these effects is numerically extremely expensive and has to be
done on the world's largest supercomputers due to the large memory requirement
and the high performance demands on the communication network between the
compute nodes. In this work, it is shown that NEMO5 covers all required
physical effects and their combination. Furthermore, it is also shown that
NEMO5's implementation of the algorithm scales very well up to about 178176CPUs
with a sustained performance of about 857 TFLOPS. Therefore, NEMO5 is ready to
simulate future nanotransistors.
|
[
{
"version": "v1",
"created": "Thu, 15 Oct 2015 19:56:55 GMT"
}
] | 2015-10-16T00:00:00 |
[
[
"Andrawis",
"Robert",
""
],
[
"Bermeo",
"Jose David",
""
],
[
"Charles",
"James",
""
],
[
"Fang",
"Jianbin",
""
],
[
"Fonseca",
"Jim",
""
],
[
"He",
"Yu",
""
],
[
"Klimeck",
"Gerhard",
""
],
[
"Jiang",
"Zhengping",
""
],
[
"Kubis",
"Tillmann",
""
],
[
"Mejia",
"Daniel",
""
],
[
"Lemus",
"Daniel",
""
],
[
"Povolotskyi",
"Michael",
""
],
[
"Rubiano",
"Santiago Alonso Perez",
""
],
[
"Sarangapani",
"Prasad",
""
],
[
"Zeng",
"Lang",
""
]
] |
new_dataset
| 0.965405 |
1504.03923
|
Sangxia Huang
|
Sangxia Huang
|
$2^{(\log N)^{1/10-o(1)}}$ Hardness for Hypergraph Coloring
|
The main theorem of Section 4 in the previous version contains a bug,
replaced with a new construction. This gives a weaker hardness of
2^{(logn)^{1/10}} than the 2^{(logn)^{1/4}} in the previous version
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs
with $2^{(\log N)^{1/10-o(1)}}$ colors, where $N$ is the number of vertices.
There has been much focus on hardness of hypergraph coloring recently.
Guruswami, H{\aa}stad, Harsha, Srinivasan and Varma showed that it is
quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with
$2^{2^{\Omega(\sqrt{\log\log N})}}$ colors. Their result is obtained by
composing standard Label Cover with an inner-verifier based on Low Degree Long
Code, using Reed-Muller code testing results by Dinur and Guruswami. Using a
different approach, Khot and Saket constructed a new variant of Label Cover,
and composed it with Quadratic Code to show quasi-NP-hardness of coloring
2-colorable 12-uniform hypergraphs with $2^{(\log N)^c}$ colors, for some $c$
around 1/20. Their construction of Label Cover is based on a new notion of
superposition complexity for CSP instances. The composition with inner-verifier
was subsequently improved by Varma, giving the same hardness result for
8-uniform hypergraphs.
Our construction uses both Quadratic Code and Low Degree Long Code, and
builds upon the work by Khot and Saket. We present a different approach to
construct CSP instances with superposition hardness by observing that when the
number of assignments is odd, satisfying a constraint in superposition is the
same as "odd-covering" the constraint. We employ Low Degree Long Code in order
to keep the construction efficient. In the analysis, we also adapt and
generalize one of the key theorems by Dinur and Guruswami in the context of
analyzing probabilistically checkable proof systems.
|
[
{
"version": "v1",
"created": "Wed, 15 Apr 2015 14:12:58 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Sep 2015 20:19:00 GMT"
},
{
"version": "v3",
"created": "Wed, 14 Oct 2015 07:42:35 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Huang",
"Sangxia",
""
]
] |
new_dataset
| 0.99358 |
1510.04026
|
Huandong Wang
|
Huandong Wang, Fengli Xu, Yong Li, Pengyu Zhang, Depeng Jin
|
Understanding Mobile Traffic Patterns of Large Scale Cellular Towers in
Urban Environment
|
To appear at IMC 2015
| null |
10.1145/2815675.2815680
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Understanding mobile traffic patterns of large scale cellular towers in urban
environment is extremely valuable for Internet service providers, mobile users,
and government managers of modern metropolis. This paper aims at extracting and
modeling the traffic patterns of large scale towers deployed in a metropolitan
city. To achieve this goal, we need to address several challenges, including
lack of appropriate tools for processing large scale traffic measurement data,
unknown traffic patterns, as well as handling complicated factors of urban
ecology and human behaviors that affect traffic patterns. Our core contribution
is a powerful model which combines three dimensional information (time,
locations of towers, and traffic frequency spectrum) to extract and model the
traffic patterns of thousands of cellular towers. Our empirical analysis
reveals the following important observations. First, only five basic
time-domain traffic patterns exist among the 9,600 cellular towers. Second,
each of the extracted traffic pattern maps to one type of geographical
locations related to urban ecology, including residential area, business
district, transport, entertainment, and comprehensive area. Third, our
frequency-domain traffic spectrum analysis suggests that the traffic of any
tower among the 9,600 can be constructed using a linear combination of four
primary components corresponding to human activity behaviors. We believe that
the proposed traffic patterns extraction and modeling methodology, combined
with the empirical analysis on the mobile traffic, pave the way toward a deep
understanding of the traffic patterns of large scale cellular towers in modern
metropolis.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 10:01:07 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Wang",
"Huandong",
""
],
[
"Xu",
"Fengli",
""
],
[
"Li",
"Yong",
""
],
[
"Zhang",
"Pengyu",
""
],
[
"Jin",
"Depeng",
""
]
] |
new_dataset
| 0.987383 |
1510.04029
|
Nadine Kroher
|
Nadine Kroher, Jos\'e-Miguel D\'iaz-B\'a\~nez, Joaquin Mora, Emilia
G\'omez
|
Corpus COFLA: A research corpus for the Computational study of Flamenco
Music
|
24 pages, submitted to the ACM Journal of Computing and Cultural
Heritage
| null | null | null |
cs.SD cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Flamenco is a music tradition from Southern Spain which attracts a growing
community of enthusiasts around the world. Its unique melodic and rhythmic
elements, the typically spontaneous and improvised interpretation and its
diversity regarding styles make this still largely undocumented art form a
particularly interesting material for musicological studies. In prior works it
has already been demonstrated that research on computational analysis of
flamenco music, despite it being a relatively new field, can provide powerful
tools for the discovery and diffusion of this genre. In this paper we present
corpusCOFLA, a data framework for the development of such computational tools.
The proposed collection of audio recordings and meta-data serves as a pool for
creating annotated subsets which can be used in development and evaluation of
algorithms for specific music information retrieval tasks. First, we describe
the design criteria for the corpus creation and then provide various examples
of subsets drawn from the corpus. We showcase possible research applications in
the context of computational study of flamenco music and give perspectives
regarding further development of the corpus.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 10:14:29 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Kroher",
"Nadine",
""
],
[
"Díaz-Báñez",
"José-Miguel",
""
],
[
"Mora",
"Joaquin",
""
],
[
"Gómez",
"Emilia",
""
]
] |
new_dataset
| 0.999662 |
1510.04074
|
Marian George
|
Marian George, Dejan Mircic, G\'abor S\"or\"os, Christian
Floerkemeier, Friedemann Mattern
|
Fine-Grained Product Class Recognition for Assisted Shopping
|
Accepted at ICCV Workshop on Assistive Computer Vision and Robotics
(ICCV-ACVR) 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assistive solutions for a better shopping experience can improve the quality
of life of people, in particular also of visually impaired shoppers. We present
a system that visually recognizes the fine-grained product classes of items on
a shopping list, in shelves images taken with a smartphone in a grocery store.
Our system consists of three components: (a) We automatically recognize useful
text on product packaging, e.g., product name and brand, and build a mapping of
words to product classes based on the large-scale GroceryProducts dataset. When
the user populates the shopping list, we automatically infer the product class
of each entered word. (b) We perform fine-grained product class recognition
when the user is facing a shelf. We discover discriminative patches on product
packaging to differentiate between visually similar product classes and to
increase the robustness against continuous changes in product design. (c) We
continuously improve the recognition accuracy through active learning. Our
experiments show the robustness of the proposed method against cross-domain
challenges, and the scalability to an increasing number of products with
minimal re-training.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 13:07:05 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"George",
"Marian",
""
],
[
"Mircic",
"Dejan",
""
],
[
"Sörös",
"Gábor",
""
],
[
"Floerkemeier",
"Christian",
""
],
[
"Mattern",
"Friedemann",
""
]
] |
new_dataset
| 0.997426 |
1510.04122
|
Mikhail Tsitsvero
|
Sergio Barbarossa and Mikhail Tsitsvero
|
Eigenfunctions of Underspread Linear Communication Systems
|
13 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we show that the eigenfunctions can be found exactly for
systems whose delay-Doppler spread function is concentrated along a straight
line and they can be found in approximate sense for systems having a spread
function maximally concentrated in regions of the Doppler-delay plane whose
area is smaller than one. The interesting results are that: i) the
instantaneous frequency of the eigenfunctions is dictated by the contour level
of the time-varying transfer function; ii) the eigenvalues are restricted
between the minimum and maximum value of the system time-varying transfer
function, but not all values are possible, as the system exhibits an inherent
quantization.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 14:42:00 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Barbarossa",
"Sergio",
""
],
[
"Tsitsvero",
"Mikhail",
""
]
] |
new_dataset
| 0.972772 |
1510.04240
|
Dongsoo Har
|
Dongsoo Har
|
Dementia assistive system as a dense network
| null | null | null | null |
cs.CY cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As elderly population increases, portion of dementia patients becomes larger.
Thus social cost of caring dementia patients has been a major concern to many
nations. This article introduces a dementia assistive system operated by
various sensors and devices installed in body area and activity area of
patients. Since this system is served based on a network which includes a
number of nodes, it requires techniques to reduce the network performance
degradation caused by densely composed sensors and devices. This article
introduces existing protocols for communications of sensors and devices at both
low rate and high rate transmission.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 19:05:18 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Har",
"Dongsoo",
""
]
] |
new_dataset
| 0.992586 |
1510.04241
|
Naveen Kadayinti
|
Naveen Kadayinti and Maryam Shojaei Baghini and Dinesh K. Sharma
|
A Clock Synchronizer for Repeaterless Low Swing On-Chip Links
|
11 pages, 25 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A clock synchronizing circuit for repeaterless low swing interconnects is
presented in this paper. The circuit uses a delay locked loop (DLL) to generate
multiple phases of the clock, of which the one closest to the center of the eye
is picked by a phase detector loop. The picked phase is then further fine tuned
by an analog voltage controlled delay to position the sampling clock at the
center of the eye. A clock domain transfer circuit then transfers the sampled
data to the receiver clock domain with a maximum latency of three clock cycles.
The proposed synchronizer has been designed and fabricated in 130 nm UMC MM
CMOS technology. The circuit consumes 1.4 mW from a 1.2 V supply at a data rate
of 1.3 Gbps. Further, the proposed synchronizer has been designed and simulated
in TSMC 65 nm CMOS technology. Post layout simulations show that the
synchronizer consumes 1.5 mW from a 1 V supply, at a data rate of 4 Gbps in
this technology.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2015 19:09:21 GMT"
}
] | 2015-10-15T00:00:00 |
[
[
"Kadayinti",
"Naveen",
""
],
[
"Baghini",
"Maryam Shojaei",
""
],
[
"Sharma",
"Dinesh K.",
""
]
] |
new_dataset
| 0.999675 |
1410.6685
|
Christopher M. Poskitt
|
Alexey Kolesnichenko, Christopher M. Poskitt, Sebastian Nanz, Bertrand
Meyer
|
Contract-Based General-Purpose GPU Programming
| null |
Proc. International Conference on Generative Programming: Concepts
and Experiences (GPCE 2015), pages 75-84. ACM, 2015
|
10.1145/2814204.2814216
| null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using GPUs as general-purpose processors has revolutionized parallel
computing by offering, for a large and growing set of algorithms, massive
data-parallelization on desktop machines. An obstacle to widespread adoption,
however, is the difficulty of programming them and the low-level control of the
hardware required to achieve good performance. This paper suggests a
programming library, SafeGPU, that aims at striking a balance between
programmer productivity and performance, by making GPU data-parallel operations
accessible from within a classical object-oriented programming language. The
solution is integrated with the design-by-contract approach, which increases
confidence in functional program correctness by embedding executable program
specifications into the program text. We show that our library leads to modular
and maintainable code that is accessible to GPGPU non-experts, while providing
performance that is comparable with hand-written CUDA code. Furthermore,
runtime contract checking turns out to be feasible, as the contracts can be
executed on the GPU.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 14:03:04 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Mar 2015 12:36:46 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Jun 2015 17:42:43 GMT"
},
{
"version": "v4",
"created": "Fri, 21 Aug 2015 16:15:39 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Kolesnichenko",
"Alexey",
""
],
[
"Poskitt",
"Christopher M.",
""
],
[
"Nanz",
"Sebastian",
""
],
[
"Meyer",
"Bertrand",
""
]
] |
new_dataset
| 0.999534 |
1503.01034
|
Vladimir Zamdzhiev
|
Aleks Kissinger and Vladimir Zamdzhiev
|
Quantomatic: A Proof Assistant for Diagrammatic Reasoning
|
International Conference on Automated Deduction, CADE 2015 (CADE-25).
The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-21401-6_22
| null |
10.1007/978-3-319-21401-6_22
| null |
cs.LO cs.MS math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monoidal algebraic structures consist of operations that can have multiple
outputs as well as multiple inputs, which have applications in many areas
including categorical algebra, programming language semantics, representation
theory, algebraic quantum information, and quantum groups. String diagrams
provide a convenient graphical syntax for reasoning formally about such
structures, while avoiding many of the technical challenges of a term-based
approach. Quantomatic is a tool that supports the (semi-)automatic construction
of equational proofs using string diagrams. We briefly outline the theoretical
basis of Quantomatic's rewriting engine, then give an overview of the core
features and architecture and give a simple example project that computes
normal forms for commutative bialgebras.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 18:20:39 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 15:30:29 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Kissinger",
"Aleks",
""
],
[
"Zamdzhiev",
"Vladimir",
""
]
] |
new_dataset
| 0.984977 |
1504.02716
|
Vladimir Zamdzhiev
|
Aleks Kissinger, Vladimir Zamdzhiev
|
Equational reasoning with context-free families of string diagrams
|
International Conference on Graph Transformation, ICGT 2015. The
final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-21145-9_9
| null |
10.1007/978-3-319-21145-9_9
| null |
cs.LO cs.FL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
String diagrams provide an intuitive language for expressing networks of
interacting processes graphically. A discrete representation of string
diagrams, called string graphs, allows for mechanised equational reasoning by
double-pushout rewriting. However, one often wishes to express not just single
equations, but entire families of equations between diagrams of arbitrary size.
To do this we define a class of context-free grammars, called B-ESG grammars,
that are suitable for defining entire families of string graphs, and crucially,
of string graph rewrite rules. We show that the language-membership and
match-enumeration problems are decidable for these grammars, and hence that
there is an algorithm for rewriting string graphs according to B-ESG rewrite
patterns. We also show that it is possible to reason at the level of grammars
by providing a simple method for transforming a grammar by string graph
rewriting, and showing admissibility of the induced B-ESG rewrite pattern.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2015 15:36:13 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 14:35:06 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Kissinger",
"Aleks",
""
],
[
"Zamdzhiev",
"Vladimir",
""
]
] |
new_dataset
| 0.996772 |
1510.02856
|
Jos Wetzels
|
Jos Wetzels, Wouter Bokslag
|
Sponges and Engines: An introduction to Keccak and Keyak
|
30 pages Revision: corrected minor terminology error
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In this document we present an introductory overview of the algorithms and
design components underlying the Keccac cryptographic primitive and the Keyak
encryption scheme for authenticated (session-supporting) encryption. This
document aims to familiarize readers with the basic principles of authenticated
encryption, the Sponge and Duplex constructions (full-state, keyed as well as
regular versions), the permutation functions underlying Keccak and Keyak as
well as Keyak v2's Motorist mode of operation.
|
[
{
"version": "v1",
"created": "Sat, 10 Oct 2015 00:19:29 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 02:17:02 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Wetzels",
"Jos",
""
],
[
"Bokslag",
"Wouter",
""
]
] |
new_dataset
| 0.990325 |
1510.03247
|
Jason Dou
|
Lucy Chenyun Wu, Jason Xiaotian Dou, Danny Sleator, Alan Frieze, David
Miller
|
Impartial Redistricting: A Markov Chain Approach
|
about authorship naming problem, will fix soon
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The gerrymandering problem is a worldwide problem which sets great threat to
democracy and justice in district based elections. Thanks to partisan
redistricting commissions, district boundaries are often manipulated to benefit
incumbents. Since an independent commission is hard to come by, the possibility
of impartially generating districts with a computer is explored in this thesis.
We have developed an algorithm to randomly produce legal redistricting schemes
for Pennsylvania.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 12:11:51 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 12:26:31 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Wu",
"Lucy Chenyun",
""
],
[
"Dou",
"Jason Xiaotian",
""
],
[
"Sleator",
"Danny",
""
],
[
"Frieze",
"Alan",
""
],
[
"Miller",
"David",
""
]
] |
new_dataset
| 0.995575 |
1510.03510
|
Sarah Johnson
|
Sarah J. Johnson, Vikram A. Chandrasetty and Andrew M. Lance
|
Repeat-Accumulate Codes for Reconciliation in Continuous Variable
Quantum Key Distribution
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the design of low-complexity error correction codes
for the verification step in continuous variable quantum key distribution
(CVQKD) systems. We design new coding schemes based on quasi-cyclic
repeat-accumulate codes which demonstrate good performances for CVQKD
reconciliation.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2015 02:35:56 GMT"
}
] | 2015-10-14T00:00:00 |
[
[
"Johnson",
"Sarah J.",
""
],
[
"Chandrasetty",
"Vikram A.",
""
],
[
"Lance",
"Andrew M.",
""
]
] |
new_dataset
| 0.981809 |
1510.02828
|
Mauricio Toro
|
Mauricio Toro and Camilo Rueda and Carlos Ag\'on and G\'erard Assayag
|
Gelisp: A Library to Represent Musical CSPs and Search Strategies
|
7 pages, 2 figures, not published
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present Gelisp, a new library to represent musical
Constraint Satisfaction Problems and search strategies intuitively. Gelisp has
two interfaces, a command-line one for Common Lisp and a graphical one for
OpenMusic. Using Gelisp, we solved a problem of automatic music generation
proposed by composer Michael Jarrell and we found solutions for the
All-interval series.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 21:32:13 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Toro",
"Mauricio",
""
],
[
"Rueda",
"Camilo",
""
],
[
"Agón",
"Carlos",
""
],
[
"Assayag",
"Gérard",
""
]
] |
new_dataset
| 0.998872 |
1510.02840
|
Mauricio Toro
|
Mauricio Toro
|
Concurrent Constraint Machine Improvisation: Models and Implementation
|
8 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine improvisation creates music either by explicit coding of rules or by
applying machine learning methods. We deal with the latter case. An
improvisation system capable of real-time must execute two process
concurrently: one to apply machine learning methods to musical sequences in
order to capture prominent musical features, and one to produce musical
sequences stylistically consistent with the learned material. As an example,
the Concurrent Constraint Factor Oracle Model for Music Improvisation (ccfomi),
based upon Non-deterministic Timed Concurrent Constraint (ntcc) calculus, uses
the Factor Oracle to store the learned sequences.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 22:22:01 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Toro",
"Mauricio",
""
]
] |
new_dataset
| 0.990992 |
1510.02983
|
Becky Passonneau
|
Boyi Xie and Rebecca J. Passonneau
|
OmniGraph: Rich Representation and Graph Kernel Learning
| null | null | null | null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OmniGraph, a novel representation to support a range of NLP classification
tasks, integrates lexical items, syntactic dependencies and frame semantic
parses into graphs. Feature engineering is folded into the learning through
convolution graph kernel learning to explore different extents of the graph. A
high-dimensional space of features includes individual nodes as well as complex
subgraphs. In experiments on a text-forecasting problem that predicts stock
price change from news for company mentions, OmniGraph beats several benchmarks
based on bag-of-words, syntactic dependencies, and semantic trees. The highly
expressive features OmniGraph discovers provide insights into the semantics
across distinct market sectors. To demonstrate the method's generality, we also
report its high performance results on a fine-grained sentiment corpus.
|
[
{
"version": "v1",
"created": "Sat, 10 Oct 2015 21:22:00 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Xie",
"Boyi",
""
],
[
"Passonneau",
"Rebecca J.",
""
]
] |
new_dataset
| 0.978304 |
1510.03023
|
Dani Lischinski
|
Haisen Zhao, Lin Lu, Yuan Wei, Dani Lischinski, Andrei Sharf, Daniel
Cohen-Or, Baoquan Chen
|
Printed Perforated Lampshades for Continuous Projective Images
|
10 pages
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a technique for designing 3D-printed perforated lampshades, which
project continuous grayscale images onto the surrounding walls. Given the
geometry of the lampshade and a target grayscale image, our method computes a
distribution of tiny holes over the shell, such that the combined footprints of
the light emanating through the holes form the target image on a nearby diffuse
surface. Our objective is to approximate the continuous tones and the spatial
detail of the target image, to the extent possible within the constraints of
the fabrication process.
To ensure structural integrity, there are lower bounds on the thickness of
the shell, the radii of the holes, and the minimal distances between adjacent
holes. Thus, the holes are realized as thin tubes distributed over the
lampshade surface. The amount of light passing through a single tube may be
controlled by the tube's radius and by its direction (tilt angle). The core of
our technique thus consists of determining a suitable configuration of the
tubes: their distribution across the relevant portion of the lampshade, as well
as the parameters (radius, tilt angle) of each tube. This is achieved by
computing a capacity-constrained Voronoi tessellation over a suitably defined
density function, and embedding a tube inside the maximal inscribed circle of
each tessellation cell. The density function for a particular target image is
derived from a series of simulated images, each corresponding to a different
uniform density tube pattern on the lampshade.
|
[
{
"version": "v1",
"created": "Sun, 11 Oct 2015 08:13:38 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Zhao",
"Haisen",
""
],
[
"Lu",
"Lin",
""
],
[
"Wei",
"Yuan",
""
],
[
"Lischinski",
"Dani",
""
],
[
"Sharf",
"Andrei",
""
],
[
"Cohen-Or",
"Daniel",
""
],
[
"Chen",
"Baoquan",
""
]
] |
new_dataset
| 0.9982 |
1510.03191
|
Nikola Zlatanov
|
Nikola Zlatanov and Vahid Jamali and Robert Schober
|
On the Capacity of the Two-Hop Half-Duplex Relay Channel
|
Proc. of the IEEE Global Telecomm. Conf. (Globecom), San Diego, Dec.
2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although extensively investigated, the capacity of the two-hop half-duplex
(HD) relay channel is not fully understood. In particular, a capacity
expression which can be evaluated straightforwardly is not available and an
explicit coding scheme which achieves the capacity is not known either. In this
paper, we derive a new expression for the capacity of the two-hop HD relay
channel based on a simplified converse. Compared to previous results, this
capacity expression can be easily evaluated. Moreover, we propose an explicit
coding scheme which achieves the capacity. To achieve the capacity, the relay
does not only send information to the destination by transmitting
information-carrying symbols but also with the zero symbols resulting from the
relay's silence during reception. As examples, we compute the capacities of the
two-hop HD relay channel for the cases when the source-relay and
relay-destination links are both binary-symmetric channels (BSCs) and additive
white Gaussian noise (AWGN) channels, respectively, and numerically compare the
capacities with the rates achieved by conventional relaying where the relay
receives and transmits in a codeword-by-codeword fashion and switches between
reception and transmission in a strictly alternating manner. Our numerical
results show that the capacities of the two-hop HD relay channel for BSC and
AWGN links are significantly larger than the rates achieved with conventional
relaying.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 09:17:08 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Zlatanov",
"Nikola",
""
],
[
"Jamali",
"Vahid",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.99315 |
1510.03231
|
Olena Prianychnykova
|
Igor Potapov, Olena Prianychnykova, Sergey Verlan
|
On insertion-deletion systems over relational words
|
24 pages, 8 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new notion of a relational word as a finite totally ordered
set of positions endowed with three binary relations that describe which
positions are labeled by equal data, by unequal data and those having an
undefined relation between their labels. We define the operations of insertion
and deletion on relational words generalizing corresponding operations on
strings. We prove that the transitive and reflexive closure of these operations
has a decidable membership problem for the case of short insertion-deletion
rules (of size two/three and three/two). At the same time, we show that in the
general case such systems can produce a coding of any recursively enumerable
language leading to undecidabilty of reachability questions.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 11:14:51 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Potapov",
"Igor",
""
],
[
"Prianychnykova",
"Olena",
""
],
[
"Verlan",
"Sergey",
""
]
] |
new_dataset
| 0.99071 |
1510.03250
|
Dan Adam
|
Yael Petrank, Nahum Smirin, Yossi Tsadok, Zvi Friedman, Peter
Lysiansky, Dan Adam
|
Using Anatomical Markers for Left Ventricular Segmentation of Long Axis
Ultrasound Images
|
11 pages, 17 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Left ventricular segmentation is essential for measuring left ventricular
function indices. Segmentation of one or several images requires an initial
guess of the contour. It is hypothesized here that creating an initial guess by
first detecting anatomical markers, would lead to correct detection of the
endocardium. The first step of the algorithm presented here includes automatic
detection of the mitral valve. Next, the apex is detected in the same frame.
The valve is then tracked throughout the cardiac cycle. Contours passing from
the apex to each valve corner are then found using a dynamic programming
algorithm. The resulting contour is used as an input to an active contour
algorithm. The algorithm was tested on 21 long axis ultrasound clips and showed
good agreement with manually traced contours. Thus, this study demonstrates
that detection of anatomic markers leads to a reliable initial guess of the
left ventricle border.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 12:20:23 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Petrank",
"Yael",
""
],
[
"Smirin",
"Nahum",
""
],
[
"Tsadok",
"Yossi",
""
],
[
"Friedman",
"Zvi",
""
],
[
"Lysiansky",
"Peter",
""
],
[
"Adam",
"Dan",
""
]
] |
new_dataset
| 0.995975 |
1510.03253
|
Elmar Rueckert
|
Elmar Rueckert, Rudolf Lioutikov, Roberto Calandra, Marius Schmidt,
Philipp Beckerle and Jan Peters
|
Low-cost Sensor Glove with Force Feedback for Learning from
Demonstrations using Probabilistic Trajectory Representations
|
3 pages, 3 figures. Workshop paper of the International Conference on
Robotics and Automation (ICRA 2015)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensor gloves are popular input devices for a large variety of applications
including health monitoring, control of music instruments, learning sign
language, dexterous computer interfaces, and tele-operating robot hands. Many
commercial products as well as low-cost open source projects have been
developed. We discuss here how low-cost (approx. 250 EUROs) sensor gloves with
force feedback can be build, provide an open source software interface for
Matlab and present first results in learning object manipulation skills through
imitation learning on the humanoid robot iCub.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 12:37:57 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Rueckert",
"Elmar",
""
],
[
"Lioutikov",
"Rudolf",
""
],
[
"Calandra",
"Roberto",
""
],
[
"Schmidt",
"Marius",
""
],
[
"Beckerle",
"Philipp",
""
],
[
"Peters",
"Jan",
""
]
] |
new_dataset
| 0.996456 |
1510.03277
|
Xiaoping Li
|
Xiaoping Li, Xiang-Gen Xia, Wenjie Wang, Wei Wang
|
A Robust Generalized Chinese Remainder Theorem for Two Integers
|
36 pages
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/publicdomain/zero/1.0/
|
A generalized Chinese remainder theorem (CRT) for multiple integers from
residue sets has been studied recently, where the correspondence between the
remainders and the integers in each residue set modulo several moduli is not
known. A robust CRT has also been proposed lately for robustly reconstruct a
single integer from its erroneous remainders. In this paper, we consider the
reconstruction problem of two integers from their residue sets, where the
remainders are not only out of order but also may have errors. We prove that
two integers can be robustly reconstructed if their remainder errors are less
than $M/8$, where $M$ is the greatest common divisor (gcd) of all the moduli.
We also propose an efficient reconstruction algorithm. Finally, we present some
simulations to verify the efficiency of the proposed algorithm. The study is
motivated and has applications in the determination of multiple frequencies
from multiple undersampled waveforms.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 03:43:49 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Li",
"Xiaoping",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Wang",
"Wenjie",
""
],
[
"Wang",
"Wei",
""
]
] |
new_dataset
| 0.998399 |
1510.03370
|
Scott Garrabrant
|
Scott Garrabrant, Siddharth Bhaskar, Abram Demski, Joanna Garrabrant,
George Koleszarik, Evan Lloyd
|
Asymptotic Logical Uncertainty and The Benford Test
| null | null | null |
2015--11
|
cs.LG cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an algorithm A which assigns probabilities to logical sentences. For
any simple infinite sequence of sentences whose truth-values appear
indistinguishable from a biased coin that outputs "true" with probability p, we
have that the sequence of probabilities that A assigns to these sentences
converges to p.
|
[
{
"version": "v1",
"created": "Mon, 12 Oct 2015 17:14:44 GMT"
}
] | 2015-10-13T00:00:00 |
[
[
"Garrabrant",
"Scott",
""
],
[
"Bhaskar",
"Siddharth",
""
],
[
"Demski",
"Abram",
""
],
[
"Garrabrant",
"Joanna",
""
],
[
"Koleszarik",
"George",
""
],
[
"Lloyd",
"Evan",
""
]
] |
new_dataset
| 0.992058 |
1510.02484
|
Muhammad Jawaherul Alam
|
Md. Jawaherul Alam, Michael Kaufmann, and Stephen G. Kobourov
|
On Contact Graphs with Cubes and Proportional Boxes
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study two variants of the problem of contact representation of planar
graphs with axis-aligned boxes. In a cube-contact representation we realize
each vertex with a cube, while in a proportional box-contact representation
each vertex is an axis-aligned box with a prespecified volume. We present
algorithms for constructing cube-contact representation and proportional
box-contact representation for several classes of planar graphs.
|
[
{
"version": "v1",
"created": "Thu, 8 Oct 2015 20:06:34 GMT"
}
] | 2015-10-12T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.999292 |
1510.02552
|
Haryono Haryono
|
Haryono Haryono
|
Multitasking Programming of OBDH Satellite Based On PC-104
|
8 pages
|
International Journal of advanced studies in Computer Science and
Engineering IJASCSE Volume 4, Issue 8, 2015
| null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On Board Data Handling (OBDH) has functions to monitor, control, acquire,
analyze, take a decision, and execute the command. OBDH should organize the
task between sub system. OBDH like a heart which has a vital function. Because
the function is seriously important therefore designing and implementing the
OBDH should be carefully, in order to have a good reliability. Many OBDHs have
been made to support the satellite mission using primitive programming. In
handling the data from various input, OBDH should always be available to all
sub systems, when the tasks are many, it is not easy to program using primitive
programming. Sometimes the data become corrupt because the data which come to
the OBDH is in the same time. Therefore it is required to have a way to handle
the data safely and also easy in programming perspective. In this research,
OBDH is programmed using multi tasking programming perspective has been
created. The Operating System (OS) has been implemented so that can run the
tasks simultaneously. The OS is prepared by configuring the Linux Kernel for
the specific processor, creating Root File System (RFS), installing the
BusyBox. In order to do the above method, preparing the environment in our
machine has been done, they are installing the Cross Tool Chain, U-Boot,
GNU-Linux Kernel Source etc. After that, programming using c code with
multitasking programming can be implemented. By using above method, it is found
that programming is easier and the corruption data because of reentrancy can be
minimized. Keywords- Operating System, PC-104, Kernel, C Programming
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 02:58:40 GMT"
}
] | 2015-10-12T00:00:00 |
[
[
"Haryono",
"Haryono",
""
]
] |
new_dataset
| 0.977112 |
1510.02588
|
Nima Beygi
|
Nima Beygi, Maani Beigy, Mehdi Siahi
|
Design of Fuzzy self-tuning PID controller for pitch control system of
aircraft autopilot
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A variety of control systems have been proposed for aircraft autopilot
systems. Traditional approaches such as proportional controller and
conventional PID (CPID) controller are widely used. PID controller has a good
static performance especially for linear and time-invariant systems, but a weak
dynamic performance and discouraging function on nonlinear, time-varying, and
uncertain systems. Fuzzy control theory can improve dynamic response in various
conditions of system performance. This paper designs fuzzy self-tuning PID
(FSPID) controller to improve disadvantages of conventional PID in aircraft
autopilots. We apply proposed controller to pitch angle of aircraft then the
abilities of proposed controller will be compared to the conventional PID and
proportional controller. Inner feedback loop acts as oscillation damper in
traditional schemes, but here is removed to compare the capabilities of Fuzzy
self-tuning PID, conventional PID, and proportional controller. Based on the
simulations, both of Conventional and Fuzzy self-tuning PID controllers can
properly damp oscillations in lack of the inner feedback loop, but proportional
controller cannot do. Then short-period approximation is assumed to assess the
function of FSPID and CPID controllers in confront with abrupt and continuous
disturbances, in addition to inappropriate tuning of parameters. Simulation
results of short-period approximation show a better anti-disturbance function
for Fuzzy self-tuning PID compare to the conventional type. Fuzzy self-tuning
PID can tune the PID parameters for achieving the optimal response in view of
speed, overshoot, and steady-state error in conditions of inappropriate tuning
of PID parameters, based on the results of simulation in short-period
approximation, the proposed controller can adaptively improve the system
response by on-line setting of PID parameters.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 08:06:08 GMT"
}
] | 2015-10-12T00:00:00 |
[
[
"Beygi",
"Nima",
""
],
[
"Beigy",
"Maani",
""
],
[
"Siahi",
"Mehdi",
""
]
] |
new_dataset
| 0.96344 |
1510.02710
|
Daisuke Iwai
|
Kosuke Sato, Daisuke Iwai, Sei Ikeda, Noriko Takemura
|
Procams-Based Cybernetics
|
2 pages, 2 figures, IEEE VR 2015 Lab/Project presentation
| null | null | null |
cs.CV cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Procams-based cybernetics is a unique, emerging research field, which aims at
enhancing and supporting our activities by naturally connecting human and
computers/machines as a cooperative integrated system via projector-camera
systems (procams). It rests on various research domains such as
virtual/augmented reality, computer vision, computer graphics, projection
display, human computer interface, human robot interaction and so on. This
laboratory presentation provides a brief history including recent achievements
of our procams-based cybernetics project.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 15:47:00 GMT"
}
] | 2015-10-12T00:00:00 |
[
[
"Sato",
"Kosuke",
""
],
[
"Iwai",
"Daisuke",
""
],
[
"Ikeda",
"Sei",
""
],
[
"Takemura",
"Noriko",
""
]
] |
new_dataset
| 0.997912 |
1410.0589
|
Mateus de Oliveira Oliveira
|
Mateus de Oliveira Oliveira
|
An Algorithmic Metatheorem for Directed Treewidth
|
41 pages, 6 figures, Accepted to Discrete Applied Mathematics
| null | null | null |
cs.DS cs.CC cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of directed treewidth was introduced by Johnson, Robertson,
Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as
a first step towards an algorithmic metatheory for digraphs. They showed that
some NP-complete properties such as Hamiltonicity can be decided in polynomial
time on digraphs of constant directed treewidth. Nevertheless, despite more
than one decade of intensive research, the list of hard combinatorial problems
that are known to be solvable in polynomial time when restricted to digraphs of
constant directed treewidth has remained scarce. In this work we enrich this
list by providing for the first time an algorithmic metatheorem connecting the
monadic second order logic of graphs to directed treewidth. We show that most
of the known positive algorithmic results for digraphs of constant directed
treewidth can be reformulated in terms of our metatheorem. Additionally, we
show how to use our metatheorem to provide polynomial time algorithms for two
classes of combinatorial problems that have not yet been studied in the context
of directed width measures. More precisely, for each fixed $k,w \in
\mathbb{N}$, we show how to count in polynomial time on digraphs of directed
treewidth $w$, the number of minimum spanning strong subgraphs that are the
union of $k$ directed paths, and the number of maximal subgraphs that are the
union of $k$ directed paths and satisfy a given minor closed property. To prove
our metatheorem we devise two technical tools which we believe to be of
independent interest. First, we introduce the notion of tree-zig-zag number of
a digraph, a new directed width measure that is at most a constant times
directed treewidth. Second, we introduce the notion of $z$-saturated tree slice
language, a new formalism for the specification and manipulation of infinite
sets of digraphs.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 15:27:00 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2015 07:16:23 GMT"
}
] | 2015-10-09T00:00:00 |
[
[
"Oliveira",
"Mateus de Oliveira",
""
]
] |
new_dataset
| 0.99759 |
1510.01288
|
Erik Str\"om
|
Erik G. Str\"om, Petar Popovski, Joachim Sachs
|
5G Ultra-Reliable Vehicular Communication
|
Fixed typos. Last paragraph of Sec. 3 modified to stress
applicability to V2X comm. Submitted to IEEE Communications Magazine, July
2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Applications enabled by Cooperative Intelligent Transport Systems (C-ITS)
represent a major step towards making the road transport system safer and more
efficient (green), and thus suited for a sustainable future. Wireless
communication between vehicles and road infrastructure is an enabler for
high-performance C-ITS applications. State-of-the-art communication systems for
supporting low-latency C-ITS applications are based on IEEE 802.11 medium
access control (MAC) and physical (PHY) layers. In this paper, we argue that a
well-designed 5G system can complement or even replace these systems. We will
review the C-ITS application requirements and explain how these are well
aligned with the foreseen generic 5G service of ultra-reliable machine-type
communication (uMTC). Key technology components suitable for constructing the
uMTC service are identified: reliable service composition (RSC) and
device-to-device (D2D) links for all-to-all broadcast communication,
operational at high mobility and with varying degree of network assistance.
Important problems for future studies, including radio-resource management,
medium access control, and physical layer challenges, are discussed.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2015 19:17:08 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Oct 2015 18:05:34 GMT"
}
] | 2015-10-09T00:00:00 |
[
[
"Ström",
"Erik G.",
""
],
[
"Popovski",
"Petar",
""
],
[
"Sachs",
"Joachim",
""
]
] |
new_dataset
| 0.997137 |
1510.02342
|
Stella Lee Miss
|
Stella Lee, Martin Walda, Delimpasi Vasiliki
|
Born In Bradford Mobile Application
|
4 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Born In Bradford mobile application is an Android mobile application and
a working prototype that enables interaction with a sample cohort of the Born
in Bradford study. It provides an interface and visualization for several
surveys participated in by mothers and their children. This data is stored in
the Born In Bradford database. A subset of this data is provided for mothers
and children. The mobile application provides a way to engage the mothers and
promote their consistency in participating in subsequent surveys. It has been
designed to allow selected mothers to participate in the visualization of their
babies data. Samsung mobile phones have been provided with the application
loaded on the phone to limit and control its use and access to data. Mothers
login to interact with the data. This includes the ability to compare children
data through infographics and graphs and comparing their children data with the
average child. This comparison is done at different stages of the children ages
as provided in the dataset.
|
[
{
"version": "v1",
"created": "Thu, 8 Oct 2015 14:42:42 GMT"
}
] | 2015-10-09T00:00:00 |
[
[
"Lee",
"Stella",
""
],
[
"Walda",
"Martin",
""
],
[
"Vasiliki",
"Delimpasi",
""
]
] |
new_dataset
| 0.999203 |
1303.3934
|
Feng Tan
|
Feng Tan and Jean-Jacques Slotine
|
A Quorum Sensing Inspired Algorithm for Dynamic Clustering
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quorum sensing is a decentralized biological process, through which a
community of cells with no global awareness coordinate their functional
behaviors based solely on cell-medium interactions and local decisions. This
paper draws inspirations from quorum sensing and colony competition to derive a
new algorithm for data clustering. The algorithm treats each data as a single
cell, and uses knowledge of local connectivity to cluster cells into multiple
colonies simultaneously. It simulates auto-inducers secretion in quorum sensing
to tune the influence radius for each cell. At the same time, sparsely
distributed core cells spread their influences to form colonies, and
interactions between colonies eventually determine each cell's identity. The
algorithm has the flexibility to analyze not only static but also time-varying
data, which surpasses the capacity of many existing algorithms. Its stability
and convergence properties are established. The algorithm is tested on several
applications, including both synthetic and real benchmarks data sets, alleles
clustering, community detection, image segmentation. In particular, the
algorithm's distinctive capability to deal with time-varying data allows us to
experiment it on novel applications such as robotic swarms grouping and
switching model identification. We believe that the algorithm's promising
performance would stimulate many more exciting applications.
|
[
{
"version": "v1",
"created": "Sat, 16 Mar 2013 00:49:56 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Oct 2015 21:12:52 GMT"
}
] | 2015-10-08T00:00:00 |
[
[
"Tan",
"Feng",
""
],
[
"Slotine",
"Jean-Jacques",
""
]
] |
new_dataset
| 0.989278 |
1507.08355
|
Hao Chen
|
Xianmang He, Liqing Xu and Hao Chen
|
New $q$-ary Quantum MDS Codes with Distances Bigger than $\frac{q}{2}$
|
19 pages, submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constructions of quantum MDS codes have been studied by many authors. We
refer to the table in page 1482 of [3] for known constructions. However there
are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum
distances $d>\frac{q}{2}$ for sparse lengths $n>q+1$. In the case
$n=\frac{q^2-1}{m}$ where $m|q+1$ or $m|q-1$ there are complete results. In the
case $n=\frac{q^2-1}{m}$ where $m|q^2-1$ is not a factor of $q-1$ or $q+1$,
there is no $q$-ary quantum MDS code with $d> \frac{q}{2}$ has been
constructed. In this paper we propose a direct approch to construct Hermitian
self-orthogonal codes over ${\bf F}_{q^2}$. Thus we give some new $q$-ary
quantum codes in this case. Moreover we present many new $q$-ary quantum MDS
codes with lengths of the form $\frac{w(q^2-1)}{u}$ and minimum distances $d >
\frac{q}{2}$.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 01:06:42 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Oct 2015 11:28:24 GMT"
}
] | 2015-10-08T00:00:00 |
[
[
"He",
"Xianmang",
""
],
[
"Xu",
"Liqing",
""
],
[
"Chen",
"Hao",
""
]
] |
new_dataset
| 0.998794 |
1509.02796
|
Johannes K\"oster
|
Johannes K\"oster
|
Rust-Bio - a fast and safe bioinformatics library
| null | null |
10.1093/bioinformatics/btv573
| null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Rust-Bio, the first general purpose bioinformatics library for the
innovative Rust programming language. Rust-Bio leverages the unique combination
of speed, memory safety and high-level syntax offered by Rust to provide a fast
and safe set of bioinformatics algorithms and data structures with a focus on
sequence analysis.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2015 14:53:02 GMT"
}
] | 2015-10-08T00:00:00 |
[
[
"Köster",
"Johannes",
""
]
] |
new_dataset
| 0.998056 |
1510.01823
|
Pei-Chuan Tsai
|
Pei-Chuan Tsai, Chih-Ming Chen, Ying-ping Chen
|
Multiple Configurations LT Codes
|
11 pages, 8 figures, 3 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new scheme of LT codes, named multiple
configurations. In multiple configurations LT codes (MC-LT codes), multiple
sets of output symbols are simultaneously provided to receivers for recovering
the source data. Each receiver, without the need to send information back to
the sender, is capable of receiving the output symbols generated by some
configuration chosen according to its own decoding phase. Aiming at the
broadcasting scenarios without feedback channels, the proposed MC-LT codes are
shown to outperform the optimal pure LT codes at the cost of encoding and
transmitting units. In this paper, the inspiration of MC-LT codes is presented,
how MC-LT codes work is described by giving examples, in which the optimal pure
LT codes are outperformed, and a practical design of MC-LT codes, which is
analytically proved to have at least the same performance bound as the pure LT
codes, is proposed. The results of numerical simulation experiments demonstrate
that the proposed practical design of MC-LT codes can deliver better
performance than the LT codes in comparison. In summary, this paper creates new
potential research directions for LT codes, and MC-LT codes are a promising
variant of LT codes, especially for broadcasting scenarios.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2015 04:53:59 GMT"
}
] | 2015-10-08T00:00:00 |
[
[
"Tsai",
"Pei-Chuan",
""
],
[
"Chen",
"Chih-Ming",
""
],
[
"Chen",
"Ying-ping",
""
]
] |
new_dataset
| 0.997615 |
1510.02055
|
Akshaya Mishra Dr
|
Justin A. Eichel, Akshaya Mishra, Nicholas Miller, Nicholas Jankovic,
Mohan A. Thomas, Tyler Abbott, Douglas Swanson, Joel Keller
|
Diverse Large-Scale ITS Dataset Created from Continuous Learning for
Real-Time Vehicle Detection
|
13 pages, 11 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In traffic engineering, vehicle detectors are trained on limited datasets
resulting in poor accuracy when deployed in real world applications. Annotating
large-scale high quality datasets is challenging. Typically, these datasets
have limited diversity; they do not reflect the real-world operating
environment. There is a need for a large-scale, cloud based positive and
negative mining (PNM) process and a large-scale learning and evaluation system
for the application of traffic event detection. The proposed positive and
negative mining process addresses the quality of crowd sourced ground truth
data through machine learning review and human feedback mechanisms. The
proposed learning and evaluation system uses a distributed cloud computing
framework to handle data-scaling issues associated with large numbers of
samples and a high-dimensional feature space. The system is trained using
AdaBoost on $1,000,000$ Haar-like features extracted from $70,000$ annotated
video frames. The trained real-time vehicle detector achieves an accuracy of at
least $95\%$ for $1/2$ and about $78\%$ for $19/20$ of the time when tested on
approximately $7,500,000$ video frames. At the end of 2015, the dataset is
expect to have over one billion annotated video frames.
|
[
{
"version": "v1",
"created": "Wed, 7 Oct 2015 18:34:36 GMT"
}
] | 2015-10-08T00:00:00 |
[
[
"Eichel",
"Justin A.",
""
],
[
"Mishra",
"Akshaya",
""
],
[
"Miller",
"Nicholas",
""
],
[
"Jankovic",
"Nicholas",
""
],
[
"Thomas",
"Mohan A.",
""
],
[
"Abbott",
"Tyler",
""
],
[
"Swanson",
"Douglas",
""
],
[
"Keller",
"Joel",
""
]
] |
new_dataset
| 0.979823 |
1310.1197
|
Vincent Tan
|
Jonathan Scarlett and Vincent Y. F. Tan
|
Second-Order Asymptotics for the Gaussian MAC with Degraded Message Sets
|
27 pages, 5 figures, IEEE Transactions on Information Theory, 2015
| null |
10.1109/TIT.2015.2487340
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the second-order asymptotics of the Gaussian
multiple-access channel with degraded message sets. For a fixed average error
probability $\varepsilon \in (0,1)$ and an arbitrary point on the boundary of
the capacity region, we characterize the speed of convergence of rate pairs
that converge to that boundary point for codes that have asymptotic error
probability no larger than $\varepsilon$. As a stepping stone to this local
notion of second-order asymptotics, we study a global notion, and establish
relationships between the two. We provide a numerical example to illustrate how
the angle of approach to a boundary point affects the second-order coding rate.
This is the first conclusive characterization of the second-order asymptotics
of a network information theory problem in which the capacity region is not a
polygon.
|
[
{
"version": "v1",
"created": "Fri, 4 Oct 2013 08:20:07 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Oct 2013 12:56:40 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Oct 2015 12:02:55 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Scarlett",
"Jonathan",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.982634 |
1411.3506
|
Alireza Mesri
|
Alireza Mesri, Mahmoud Mahdipour Pirbazari, Khayrollah Hadidi, and
Abdollah Khoei
|
High gain two-stage amplifier with positive capacitive feedback
compensation
|
26 pages, 12 figures, 7 tables Accepted for publication in IET
Circuits, Devices and Systems
|
Circuits, Devices & Systems, IET (Volume:9 , Issue: 3 ), 2015
|
10.1049/iet-cds.2014.0139
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel topology for a high gain two-stage amplifier is proposed. The
proposed circuit is designed in a way that the non-dominant pole is at output
of the first stage. A positive capacitive feedback (PCF) around the second
stage introduces a left half plane (LHP) zero which cancels the phase shift
introduced by the non-dominant pole, considerably. The dominant pole is at the
output node which means that increasing the load capacitance has minimal effect
on stability. Moreover, a simple and effective method is proposed to enhance
slew rate. Simulation shows that slew rate is improved by a factor of 2.44
using the proposed method. The proposed amplifier is designed in a 0.18um CMOS
process. It consumes 0.86mW power from a 1.8V power supply and occupies
3038.5um2 of chip area. The DC gain is 82.7dB and gain bandwidth (GBW) is 88.9
MHz when driving a 5pF capacitive load. Also low frequency CMRR and PSRR+ are
127dB and 83.2dB, respectively. They are 24.8dB and 24.2dB at GBW frequency,
which are relatively high and are other important properties of the proposed
amplifier. Moreover, Simulations show convenient performance of the circuit in
process corners and also presence of mismatch.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2014 11:31:03 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Mesri",
"Alireza",
""
],
[
"Pirbazari",
"Mahmoud Mahdipour",
""
],
[
"Hadidi",
"Khayrollah",
""
],
[
"Khoei",
"Abdollah",
""
]
] |
new_dataset
| 0.984008 |
1510.01537
|
Pablo Rauzy
|
Lionel Rivi\`ere, Zakaria Najm, Pablo Rauzy, Jean-Luc Danger, Julien
Bringer, Laurent Sauvage
|
High Precision Fault Injections on the Instruction Cache of ARMv7-M
Architectures
|
HOST 2015: IEEE International Symposium on Hardware-Oriented Security
and Trust, May 2015, Washington, United States
| null |
10.1109/HST.2015.7140238
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hardware and software of secured embedded systems are prone to physical
attacks. In particular, fault injection attacks revealed vulnerabilities on the
data and the control flow allowing an attacker to break cryptographic or
secured algorithms implementations. While many research studies concentrated on
successful attacks on the data flow, only a few targets the instruction flow.
In this paper, we focus on electromagnetic fault injection (EMFI) on the
control flow, especially on the instruction cache. We target the very
widespread (smartphones, tablets, settop-boxes, health-industry monitors and
sensors, etc.) ARMv7-M architecture. We describe a practical EMFI platform and
present a methodology providing high control level and high reproducibility
over fault injections. Indeed, we observe that a precise fault model occurs in
up to 96% of the cases. We then characterize and exhibit this practical fault
model on the cache that is not yet considered in the literature. We
comprehensively describe its effects and show how it can be used to reproduce
well known fault attacks. Finally, we describe how it can benefits attackers to
mount new powerful attacks or simplify existing ones.
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 11:46:42 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Rivière",
"Lionel",
""
],
[
"Najm",
"Zakaria",
""
],
[
"Rauzy",
"Pablo",
""
],
[
"Danger",
"Jean-Luc",
""
],
[
"Bringer",
"Julien",
""
],
[
"Sauvage",
"Laurent",
""
]
] |
new_dataset
| 0.964253 |
1510.01554
|
Markus Bajones
|
Markus Bajones, Daniel Wolf, Johann Prankl, Markus Vincze
|
Where to look first? Behaviour control for fetch-and-carry missions of
service robots
|
Part of the Austrian Robotics Workshop 2014 proceedings
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the behaviour control of a service robot for intelligent
object search in a domestic environment. A major challenge in service robotics
is to enable fetch-and-carry missions that are satisfying for the user in terms
of efficiency and human-oriented perception. The proposed behaviour controller
provides an informed intelligent search based on a semantic segmentation
framework for indoor scenes and integrates it with object recognition and
grasping. Instead of manually annotating search positions in the environment,
the framework automatically suggests likely locations to search for an object
based on contextual information, e.g. next to tables and shelves. In a
preliminary set of experiments we demonstrate that this behaviour control is as
efficient as using manually annotated locations. Moreover, we argue that our
approach will reduce the intensity of labour associated with programming
fetch-and-carry tasks for service robots and that it will be perceived as more
human-oriented.
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 12:43:52 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Bajones",
"Markus",
""
],
[
"Wolf",
"Daniel",
""
],
[
"Prankl",
"Johann",
""
],
[
"Vincze",
"Markus",
""
]
] |
new_dataset
| 0.991293 |
1510.01557
|
Amer Mouawad
|
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
|
Simultaneous Feedback Vertex Set: A Parameterized Perspective
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a family of graphs $\mathcal{F}$, a graph $G$, and a positive integer
$k$, the $\mathcal{F}$-Deletion problem asks whether we can delete at most $k$
vertices from $G$ to obtain a graph in $\mathcal{F}$. $\mathcal{F}$-Deletion
generalizes many classical graph problems such as Vertex Cover, Feedback Vertex
Set, and Odd Cycle Transversal. A graph $G = (V, \cup_{i=1}^{\alpha} E_{i})$,
where the edge set of $G$ is partitioned into $\alpha$ color classes, is called
an $\alpha$-edge-colored graph. A natural extension of the
$\mathcal{F}$-Deletion problem to edge-colored graphs is the
$\alpha$-Simultaneous $\mathcal{F}$-Deletion problem. In the latter problem, we
are given an $\alpha$-edge-colored graph $G$ and the goal is to find a set $S$
of at most $k$ vertices such that each graph $G_i \setminus S$, where $G_i =
(V, E_i)$ and $1 \leq i \leq \alpha$, is in $\mathcal{F}$. In this work, we
study $\alpha$-Simultaneous $\mathcal{F}$-Deletion for $\mathcal{F}$ being the
family of forests. In other words, we focus on the $\alpha$-Simultaneous
Feedback Vertex Set ($\alpha$-SimFVS) problem. Algorithmically, we show that,
like its classical counterpart, $\alpha$-SimFVS parameterized by $k$ is
fixed-parameter tractable (FPT) and admits a polynomial kernel, for any fixed
constant $\alpha$. In particular, we give an algorithm running in $2^{O(\alpha
k)}n^{O(1)}$ time and a kernel with $O(\alpha k^{3(\alpha + 1)})$ vertices. The
running time of our algorithm implies that $\alpha$-SimFVS is FPT even when
$\alpha \in o(\log n)$. We complement this positive result by showing that for
$\alpha \in O(\log n)$, where $n$ is the number of vertices in the input graph,
$\alpha$-SimFVS becomes W[1]-hard. Our positive results answer one of the open
problems posed by Cai and Ye (MFCS 2014).
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 12:49:14 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Agrawal",
"Akanksha",
""
],
[
"Lokshtanov",
"Daniel",
""
],
[
"Mouawad",
"Amer E.",
""
],
[
"Saurabh",
"Saket",
""
]
] |
new_dataset
| 0.996782 |
1510.01574
|
Gabriele Fici
|
Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot,
Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza
|
Splicing Systems from Past to Future: Old and New Challenges
|
Appeared in: Discrete Mathematics and Computer Science. Papers in
Memoriam Alexandru Mateescu (1952-2005). The Publishing House of the Romanian
Academy, 2014. arXiv admin note: text overlap with arXiv:1112.4897 by other
authors
| null | null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A splicing system is a formal model of a recombinant behaviour of sets of
double stranded DNA molecules when acted on by restriction enzymes and ligase.
In this survey we will concentrate on a specific behaviour of a type of
splicing systems, introduced by P\u{a}un and subsequently developed by many
researchers in both linear and circular case of splicing definition. In
particular, we will present recent results on this topic and how they stimulate
new challenging investigations.
|
[
{
"version": "v1",
"created": "Tue, 6 Oct 2015 13:49:45 GMT"
}
] | 2015-10-07T00:00:00 |
[
[
"Boasson",
"Luc",
""
],
[
"Bonizzoni",
"Paola",
""
],
[
"De Felice",
"Clelia",
""
],
[
"Fagnot",
"Isabelle",
""
],
[
"Fici",
"Gabriele",
""
],
[
"Zaccagnino",
"Rocco",
""
],
[
"Zizza",
"Rosalba",
""
]
] |
new_dataset
| 0.974776 |
1101.2245
|
Michael Goodrich
|
Michael T. Goodrich and Michael Mitzenmacher
|
Invertible Bloom Lookup Tables
|
contains 4 figures, showing experimental performance
| null | null | null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a version of the Bloom filter data structure that supports not
only the insertion, deletion, and lookup of key-value pairs, but also allows a
complete listing of its contents with high probability, as long the number of
key-value pairs is below a designed threshold. Our structure allows the number
of key-value pairs to greatly exceed this threshold during normal operation.
Exceeding the threshold simply temporarily prevents content listing and reduces
the probability of a successful lookup. If later entries are deleted to return
the structure below the threshold, everything again functions appropriately. We
also show that simple variations of our structure are robust to certain
standard errors, such as the deletion of a key without a corresponding
insertion or the insertion of two distinct values for a key. The properties of
our structure make it suitable for several applications, including database and
networking applications that we highlight.
|
[
{
"version": "v1",
"created": "Wed, 12 Jan 2011 00:30:10 GMT"
},
{
"version": "v2",
"created": "Tue, 3 May 2011 23:29:38 GMT"
},
{
"version": "v3",
"created": "Sun, 4 Oct 2015 00:10:28 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Goodrich",
"Michael T.",
""
],
[
"Mitzenmacher",
"Michael",
""
]
] |
new_dataset
| 0.964541 |
1411.3962
|
David Darais
|
David Darais, Matthew Might, David Van Horn
|
Galois Transformers and Modular Abstract Interpreters
|
OOPSLA '15, October 25-30, 2015, Pittsburgh, PA, USA
| null |
10.1145/2814270.2814308
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design and implementation of static analyzers has become increasingly
systematic. Yet for a given language or analysis feature, it often requires
tedious and error prone work to implement an analyzer and prove it sound. In
short, static analysis features and their proofs of soundness do not compose
well, causing a dearth of reuse in both implementation and metatheory.
We solve the problem of systematically constructing static analyzers by
introducing Galois transformers: monad transformers that transport Galois
connection properties. In concert with a monadic interpreter, we define a
library of monad transformers that implement building blocks for classic
analysis parameters like context, path, and heap (in)sensitivity. Moreover,
these can be composed together independent of the language being analyzed.
Significantly, a Galois transformer can be proved sound once and for all,
making it a reusable analysis component. As new analysis features and
abstractions are developed and mixed in, soundness proofs need not be
reconstructed, as the composition of a monad transformer stack is sound by
virtue of its constituents. Galois transformers provide a viable foundation for
reusable and composable metatheory for program analysis.
Finally, these Galois transformers shift the level of abstraction in analysis
design and implementation to a level where non-specialists have the ability to
synthesize sound analyzers over a number of parameters.
|
[
{
"version": "v1",
"created": "Fri, 14 Nov 2014 16:33:11 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 21:05:45 GMT"
},
{
"version": "v3",
"created": "Sun, 23 Aug 2015 17:04:07 GMT"
},
{
"version": "v4",
"created": "Wed, 26 Aug 2015 05:57:29 GMT"
},
{
"version": "v5",
"created": "Mon, 5 Oct 2015 13:04:01 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Darais",
"David",
""
],
[
"Might",
"Matthew",
""
],
[
"Van Horn",
"David",
""
]
] |
new_dataset
| 0.997407 |
1502.07545
|
Feng Pan Dr
|
Feng Pan
|
SAT problem and statistical distance
|
15 pages. arXiv admin note: text overlap with arXiv:quant-ph/0311110
by other authors without attribution
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper with two equivalent representations of the information
contained by a SAT formula, the reason why string generated by succinct SAT
formula can be greatly compressed is firstly presented based on Kolmogorov
complexity theory. Then what strings can be greatly compressed were classified
and discussed. In this way we discovered the SAT problem was composed of a
basic distinguish problem: distinguish two different distributions induced
under the computer with certain SAT formula ensemble. We then tried to map this
problem into quantum mechanics, or the quantum version basic distinguish
problem: this time two different distributions are induced under quantum
mechanics. Based on the equivalence of statistical distance between probability
space and Hilbert space, in the same time this distance is invariant under all
unitary transformations. The quantum version basic problem cannot be
efficiently solved by any quantum computer. In the worst case, any quantum
computer must perform exponential times measurement in order to solve it. In
the end we proposed the main theorem : The statistical distance in program
space and probability space are identical. We tried to prove it using the
relationship of Kolmogorov complexity and entropy. It showed there is no
difference to solve the basic problem in SAT formula space or probability
space. In the worst case, exponential trials must be performed to solve it.
NP!=P.
|
[
{
"version": "v1",
"created": "Thu, 26 Feb 2015 13:28:06 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 01:38:04 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Sep 2015 00:22:04 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Pan",
"Feng",
""
]
] |
new_dataset
| 0.97495 |
1510.00726
|
Yoav Goldberg
|
Yoav Goldberg
|
A Primer on Neural Network Models for Natural Language Processing
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past few years, neural networks have re-emerged as powerful
machine-learning models, yielding state-of-the-art results in fields such as
image recognition and speech processing. More recently, neural network models
started to be applied also to textual natural language signals, again with very
promising results. This tutorial surveys neural network models from the
perspective of natural language processing research, in an attempt to bring
natural-language researchers up to speed with the neural techniques. The
tutorial covers input encoding for natural language tasks, feed-forward
networks, convolutional networks, recurrent networks and recursive networks, as
well as the computation graph abstraction for automatic gradient computation.
|
[
{
"version": "v1",
"created": "Fri, 2 Oct 2015 20:17:33 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Goldberg",
"Yoav",
""
]
] |
new_dataset
| 0.969061 |
1510.00745
|
Eric Orenstein
|
Eric C. Orenstein, Oscar Beijbom, Emily E. Peacock and Heidi M. Sosik
|
WHOI-Plankton- A Large Scale Fine Grained Visual Recognition Benchmark
Dataset for Plankton Classification
|
2 pages, 1 figure, presented at the Third Workshop on Fine-Grained
Visual Categorization at CVPR 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Planktonic organisms are of fundamental importance to marine ecosystems: they
form the basis of the food web, provide the link between the atmosphere and the
deep ocean, and influence global-scale biogeochemical cycles. Scientists are
increasingly using imaging-based technologies to study these creatures in their
natural habit. Images from such systems provide an unique opportunity to model
and understand plankton ecosystems, but the collected datasets can be enormous.
The Imaging FlowCytobot (IFCB) at Woods Hole Oceanographic Institution, for
example, is an \emph{in situ} system that has been continuously imaging
plankton since 2006. To date, it has generated more than 700 million samples.
Manual classification of such a vast image collection is impractical due to the
size of the data set. In addition, the annotation task is challenging due to
the large space of relevant classes, intra-class variability, and inter-class
similarity. Methods for automated classification exist, but the accuracy is
often below that of human experts. Here we introduce WHOI-Plankton: a large
scale, fine-grained visual recognition dataset for plankton classification,
which comprises over 3.4 million expert-labeled images across 70 classes. The
labeled image set is complied from over 8 years of near continuous data
collection with the IFCB at the Martha's Vineyard Coastal Observatory (MVCO).
We discuss relevant metrics for evaluation of classification performance and
provide results for a traditional method based on hand-engineered features and
two methods based on convolutional neural networks.
|
[
{
"version": "v1",
"created": "Fri, 2 Oct 2015 22:06:52 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Orenstein",
"Eric C.",
""
],
[
"Beijbom",
"Oscar",
""
],
[
"Peacock",
"Emily E.",
""
],
[
"Sosik",
"Heidi M.",
""
]
] |
new_dataset
| 0.999844 |
1510.00759
|
Afshin Rahimi
|
Afshin Rahimi, Moharram Eslami, Bahram Vazirnezhad
|
It is not all downhill from here: Syllable Contact Law in Persian
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Syllable contact pairs crosslinguistically tend to have a falling sonority
slope a constraint which is called the Syllable Contact Law SCL In this study
the phonotactics of syllable contacts in 4202 CVCCVC words of Persian lexicon
is investigated The consonants of Persian were divided into five sonority
categories and the frequency of all possible sonority slopes is computed both
in lexicon type frequency and in corpus token frequency Since an unmarked
phonological structure has been shown to diachronically become more frequent we
expect to see the same pattern for syllable contact pairs with falling sonority
slope The correlation of sonority categories of the two consonants in a
syllable contact pair is measured using Pointwise Mutual Information
|
[
{
"version": "v1",
"created": "Sat, 3 Oct 2015 00:08:18 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Rahimi",
"Afshin",
""
],
[
"Eslami",
"Moharram",
""
],
[
"Vazirnezhad",
"Bahram",
""
]
] |
new_dataset
| 0.999215 |
1510.01008
|
Hiram H. L\'opez
|
Javier de la Cruz, Elisa Gorla, Hiram H. Lopez, Alberto Ravagnani
|
Rank distribution of Delsarte codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In analogy with the Singleton defect for classical codes, we propose a
definition of rank defect for Delsarte rank-metric codes. We characterize codes
whose rank defect and dual rank defect are both zero, and prove that the rank
distribution of such codes is determined by their parameters. This extends a
result by Delsarte on the rank distribution of MRD codes. In the general case
of codes of positive defect, we show that the rank distribution is determined
by the parameters of the code, together the number of codewords of small rank.
Moreover, we prove that if the rank defect of a code and its dual are both one,
and the dimension satisfies a divisibility condition, then the number of
minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we
discuss how our results specialize to Gabidulin codes.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2015 00:50:09 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"de la Cruz",
"Javier",
""
],
[
"Gorla",
"Elisa",
""
],
[
"Lopez",
"Hiram H.",
""
],
[
"Ravagnani",
"Alberto",
""
]
] |
new_dataset
| 0.998299 |
1510.01022
|
Tongjiang Yan
|
Tongjiang Yan, Yanyan Liu, Yuhua Sun
|
Cyclic Codes from Two-Prime Generalized Cyclotomic Sequences of Order 6
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes have wide applications in data storage systems and communication
systems. Employing two-prime Whiteman generalized cyclotomic sequences of order
6, we construct several classes of cyclic codes over the finite field GF}(q)
and give their generator polynomials. And we also calculate the minimum
distance of some cyclic codes and give lower bounds of the minimum distance for
some other cyclic codes.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2015 04:03:03 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Yan",
"Tongjiang",
""
],
[
"Liu",
"Yanyan",
""
],
[
"Sun",
"Yuhua",
""
]
] |
new_dataset
| 0.999873 |
1510.01140
|
Hokky Situngkir
|
Hokky Situngkir
|
Deconstructing Bataknese Gorga Computationally
|
10 pages, 4 figures
|
BFI Working Paper Series, WP072012, 2012
| null | null |
cs.CG cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The carved and painted decorations in traditional Batak houses and buildings,
gorga, are the source of their exoticism. There are no identical patterns of
the ornaments within Batak houses and the drawings are closely related to the
way ancient Batak capture the dynamicity of the growing 'tree of life', one of
central things within their cosmology and mythology. The survey of ornaments of
Batak houses and buildings in Northern Sumatera Indonesia has made us possible
to observe the complex pattern. The fractal dimensions of the geometrical
shapes in gorga are calculated and they are conjectured into 1.5-1.6, between
the dimensional of a line and a plane. The way gorga is drawn is captured by
using some modification to the turtle geometry of L-System model, a popular
model to model the dynamics of growing plants. The result is a proposal to see
Bataknese gorga as one of traditional heritage that may enrich the studies to
the generative art.
|
[
{
"version": "v1",
"created": "Mon, 24 Aug 2015 07:37:22 GMT"
}
] | 2015-10-06T00:00:00 |
[
[
"Situngkir",
"Hokky",
""
]
] |
new_dataset
| 0.96843 |
1503.02504
|
Vasileios Iliopoulos DR
|
Vasileios Iliopoulos
|
The Quicksort algorithm and related topics
|
PhD thesis. Reference [23] was missing in first version. It now reads
correctly in page 142, Section 5.6
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sorting algorithms have attracted a great deal of attention and study, as
they have numerous applications to Mathematics, Computer Science and related
fields. In this thesis, we first deal with the mathematical analysis of the
Quicksort algorithm and its variants. Specifically, we study the time
complexity of the algorithm and we provide a complete demonstration of the
variance of the number of comparisons required, a known result but one whose
detailed proof is not easy to read out of the literature. We also examine
variants of Quicksort, where multiple pivots are chosen for the partitioning of
the array.
The rest of this work is dedicated to the analysis of finding the true order
by further pairwise comparisons when a partial order compatible with the true
order is given in advance. We discuss a number of cases where the partially
ordered sets arise at random. To this end, we employ results from Graph and
Information Theory. Finally, we obtain an alternative bound on the number of
linear extensions when the partially ordered set arises from a random graph,
and discuss the possible application of Shellsort in merging chains.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2015 15:04:30 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 23:14:27 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Oct 2015 12:47:21 GMT"
},
{
"version": "v4",
"created": "Fri, 2 Oct 2015 12:51:33 GMT"
}
] | 2015-10-05T00:00:00 |
[
[
"Iliopoulos",
"Vasileios",
""
]
] |
new_dataset
| 0.98564 |
1503.05456
|
Luca Giuzzi DPhil
|
Ilaria Cardinali, Luca Giuzzi
|
Minimum distance of Symplectic Grassmann codes
|
Revised contents and biblography
|
Linear Algebra and its Applications 488: 124-134 (2016)
|
10.1016/j.laa.2015.09.031
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Symplectic Grassmann codes as projective codes defined by
symplectic Grassmannians, in analogy with the orthogonal Grassmann codes
introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special
class of Symplectic Grassmann codes. We describe the weight enumerator of the
Lagrangian--Grassmannian codes of rank $2$ and $3$ and we determine the minimum
distance of the line Symplectic Grassmann codes.
|
[
{
"version": "v1",
"created": "Tue, 17 Mar 2015 10:01:08 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Mar 2015 14:02:44 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Sep 2015 14:12:24 GMT"
}
] | 2015-10-05T00:00:00 |
[
[
"Cardinali",
"Ilaria",
""
],
[
"Giuzzi",
"Luca",
""
]
] |
new_dataset
| 0.999135 |
1507.08906
|
Laszlo Kish
|
Laszlo B. Kish, Claes G. Granqvist, Sunil P. Khatri, Ferdinand Peper
|
Zero and negative energy dissipation at information-theoretic erasure
|
accepted for publication and is in press at the Journal of
Computational Electronics
|
Journal of Computational Electronics 14 (2015) 1-5
|
10.1007/s10825-015-0754-5
| null |
cs.ET
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce information-theoretic erasure based on Shannon's binary channel
formula. It is pointed out that this type of erasure is a natural
energy-dissipation-free way in which information is lost in
double-potential-well memories, and it may be the reason why the brain can
forget things effortlessly. We also demonstrate a new non-volatile,
charge-based memory scheme wherein the erasure can be associated with even
negative energy dissipation; this implies that the memory's environment is
cooled during information erasure and contradicts Landauer's principle of
erasure dissipation. On the other hand, writing new information into the memory
always requires positive energy dissipation in our schemes. Finally, we show a
simple system where even a classical erasure process yields negative energy
dissipation of arbitrarily large energy.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 13:38:27 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Sep 2015 15:08:28 GMT"
}
] | 2015-10-05T00:00:00 |
[
[
"Kish",
"Laszlo B.",
""
],
[
"Granqvist",
"Claes G.",
""
],
[
"Khatri",
"Sunil P.",
""
],
[
"Peper",
"Ferdinand",
""
]
] |
new_dataset
| 0.992805 |
1510.00651
|
Mark Scanlon
|
Jason Farina, M-Tahar Kechadi and Mark Scanlon
|
Project Maelstrom: Forensic Analysis of the BitTorrent-Powered Browser
| null |
Journal of Digital Forensics, Security and Law (Proc. of 10th
International Conference on Systematic Approaches to Digital Forensic
Engineering, SADFE 2015)
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In April 2015, BitTorrent Inc. released their distributed peer-to-peer
powered browser, Project Maelstrom, into public beta. The browser facilitates a
new alternative website distribution paradigm to the traditional HTTP-based,
client-server model. This decentralised web is powered by each of the visitors
accessing each Maelstrom hosted website. Each user shares their copy of the
website's source code and multimedia content with new visitors. As a result, a
Maelstrom hosted website cannot be taken offline by law enforcement or any
other parties. Due to this open distribution model, a number of interesting
censorship, security and privacy considerations are raised. This paper explores
the application, its protocol, sharing Maelstrom content and its new visitor
powered "web-hosting" paradigm.
|
[
{
"version": "v1",
"created": "Fri, 2 Oct 2015 17:25:27 GMT"
}
] | 2015-10-05T00:00:00 |
[
[
"Farina",
"Jason",
""
],
[
"Kechadi",
"M-Tahar",
""
],
[
"Scanlon",
"Mark",
""
]
] |
new_dataset
| 0.998378 |
1510.00684
|
Martin Pergel
|
Martin Pergel
|
A Note on Graphs with 2 Bends
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show NP-completeness for the recognition problem of 2-line-bend graphs.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 17:55:32 GMT"
}
] | 2015-10-05T00:00:00 |
[
[
"Pergel",
"Martin",
""
]
] |
new_dataset
| 0.979873 |
1509.04172
|
Hossein Shokri Ghadikolaei
|
Hossein Shokri-Ghadikolaei and Carlo Fischione
|
Millimeter Wave Ad Hoc Networks: Noise-limited or Interference-limited?
|
accepted in IEEE GLOBECOM'15
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In millimeter wave (mmWave) communication systems, narrow beam operations
overcome severe channel attenuations, reduce multiuser interference, and thus
introduce the new concept of noise-limited mmWave wireless networks. The regime
of the network, whether noise-limited or interference-limited, heavily reflects
on the medium access control (MAC) layer throughput and on proper resource
allocation and interference management strategies. Yet, alternating presence of
these regimes and, more importantly, their dependence on the mmWave design
parameters are ignored in the current approaches to mmWave MAC layer design,
with the potential disastrous consequences on the throughput/delay performance.
In this paper, tractable closed-form expressions for collision probability and
MAC layer throughput of mmWave networks, operating under slotted ALOHA and
TDMA, are derived. The new analysis reveals that mmWave networks may exhibit a
non-negligible transitional behavior from a noise-limited regime to an
interference-limited regime, depending on the density of the transmitters,
density and size of obstacles, transmission probability, beamwidth, and
transmit power. It is concluded that a new framework of adaptive hybrid
resource allocation procedure, containing a proactive contention-based phase
followed by a reactive contention-free one with dynamic phase durations, is
necessary to cope with such transitional behavior.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2015 15:57:00 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Oct 2015 16:53:05 GMT"
}
] | 2015-10-02T00:00:00 |
[
[
"Shokri-Ghadikolaei",
"Hossein",
""
],
[
"Fischione",
"Carlo",
""
]
] |
new_dataset
| 0.997824 |
1510.00116
|
Smruti Ranjan Sarangi
|
Seep Goel, Pooja Aggarwal, Smruti R. Sarangi
|
A Wait-Free Stack
|
21 pages, 5 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe a novel algorithm to create a con- current
wait-free stack. To the best of our knowledge, this is the first wait-free
algorithm for a general purpose stack. In the past, researchers have proposed
restricted wait-free implementations of stacks, lock-free implementations, and
efficient universal constructions that can support wait-free stacks. The crux
of our wait-free implementation is a fast pop operation that does not modify
the stack top; instead, it walks down the stack till it finds a node that is
unmarked. It marks it but does not delete it. Subsequently, it is lazily
deleted by a cleanup operation. This operation keeps the size of the stack in
check by not allowing the size of the stack to increase beyond a factor of W as
compared to the actual size. All our operations are wait-free and linearizable.
|
[
{
"version": "v1",
"created": "Thu, 1 Oct 2015 06:14:42 GMT"
}
] | 2015-10-02T00:00:00 |
[
[
"Goel",
"Seep",
""
],
[
"Aggarwal",
"Pooja",
""
],
[
"Sarangi",
"Smruti R.",
""
]
] |
new_dataset
| 0.989673 |
1510.00322
|
Oya Rieger
|
Oya Y. Rieger
|
Sustainability: Scholarly Repository as an Enterprise
| null |
ASIS&T Bulletin, October/November 2012, Volume 39, Number 1
| null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The expanding need for an open information sharing infrastructure to promote
scholarly communication led to the pioneering establishment of arXiv.org, now
maintained by the Cornell University Library. To be sustainable, the repository
requires careful, long term planning for services, management and funding. The
library is developing a sustainability model for arXiv.org, based on voluntary
contributions and the ongoing participation and support of 200 libraries and
research laboratories around the world. The sustainability initiative is based
on a membership model and builds on arXiv's technical, service, financial and
policy infrastructure. Five principles for sustainability drive development,
starting with deep integration into the scholarly community. Also key are a
clearly defined mandate and governance structure, a stable yet innovative
technology platform, systematic creation of content policies and strong
business planning strategies. Repositories like arXiv must consider usability
and life cycle alongside values and trends in scholarly communication. To
endure, they must also support and enhance their service by securing and
managing resources and demonstrating responsible stewardship.
|
[
{
"version": "v1",
"created": "Thu, 1 Oct 2015 17:25:25 GMT"
}
] | 2015-10-02T00:00:00 |
[
[
"Rieger",
"Oya Y.",
""
]
] |
new_dataset
| 0.992086 |
1405.1499
|
Abdul Quamar
|
Abdul Quamar and Amol Deshpande and Jimmy Lin
|
NScale: Neighborhood-centric Large-Scale Graph Analytics in the Cloud
|
26 pages, 15 figures, 5 tables
| null | null | null |
cs.DB cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is an increasing interest in executing complex analyses over large
graphs, many of which require processing a large number of multi-hop
neighborhoods or subgraphs. Examples include ego network analysis, motif
counting, personalized recommendations, and others. These tasks are not well
served by existing vertex-centric graph processing frameworks, where user
programs are only able to directly access the state of a single vertex. This
paper introduces NSCALE, a novel end-to-end graph processing framework that
enables the distributed execution of complex subgraph-centric analytics over
large-scale graphs in the cloud. NSCALE enables users to write programs at the
level of subgraphs rather than at the level of vertices. Unlike most previous
graph processing frameworks, which apply the user program to the entire graph,
NSCALE allows users to declaratively specify subgraphs of interest. Our
framework includes a novel graph extraction and packing (GEP) module that
utilizes a cost-based optimizer to partition and pack the subgraphs of interest
into memory on as few machines as possible. The distributed execution engine
then takes over and runs the user program in parallel, while respecting the
scope of the various subgraphs. Our experimental results show
orders-of-magnitude improvements in performance and drastic reductions in the
cost of analytics compared to vertex-centric approaches.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2014 03:41:53 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Nov 2014 20:17:45 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Sep 2015 12:44:58 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Quamar",
"Abdul",
""
],
[
"Deshpande",
"Amol",
""
],
[
"Lin",
"Jimmy",
""
]
] |
new_dataset
| 0.998758 |
1509.08955
|
Kensworth Subratie
|
Kensworth Subratie, Saumitra Aditya, Renato Figueiredo, Cayelan C.
Carey and Paul Hanson
|
GRAPLEr: A Distributed Collaborative Environment for Lake Ecosystem
Modeling that Integrates Overlay Networks, High-throughput Computing, and Web
Services
|
8 pages, 7 figures. PRAGMA29
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The GLEON Research And PRAGMA Lake Expedition -- GRAPLE -- is a collaborative
effort between computer science and lake ecology researchers. It aims to
improve our understanding and predictive capacity of the threats to the water
quality of our freshwater resources, including climate change. This paper
presents GRAPLEr, a distributed computing system used to address the modeling
needs of GRAPLE researchers. GRAPLEr integrates and applies overlay virtual
network, high-throughput computing, and Web service technologies in a novel
way. First, its user-level IP-over-P2P (IPOP) overlay network allows compute
and storage resources distributed across independently-administered
institutions (including private and public clouds) to be aggregated into a
common virtual network, despite the presence of firewalls and network address
translators. Second, resources aggregated by the IPOP virtual network run
unmodified high-throughput computing middleware (HTCondor) to enable large
numbers of model simulations to be executed concurrently across the distributed
computing resources. Third, a Web service interface allows end users to submit
job requests to the system using client libraries that integrate with the R
statistical computing environment. The paper presents the GRAPLEr architecture,
describes its implementation and reports on its performance for batches of
General Lake Model (GLM) simulations across three cloud infrastructures
(University of Florida, CloudLab, and Microsoft Azure).
|
[
{
"version": "v1",
"created": "Tue, 29 Sep 2015 21:17:56 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Subratie",
"Kensworth",
""
],
[
"Aditya",
"Saumitra",
""
],
[
"Figueiredo",
"Renato",
""
],
[
"Carey",
"Cayelan C.",
""
],
[
"Hanson",
"Paul",
""
]
] |
new_dataset
| 0.998098 |
1509.09057
|
Murad Kablan
|
Murad Kablan, Carlee Joe-Won, Sangtae Ha, Hani Jamjoom, Eric Keller
|
The Cloud Needs a Reputation System
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's cloud apps are built from many diverse services that are managed by
different parties. At the same time, these parties, which consume and/or
provide services, continue to rely on arcane static security and entitlements
models. In this paper, we introduce Seit, an inter-tenant framework that
manages the interactions between cloud services. Seit is a software-defined
reputation-based framework. It consists of two primary components: (1) a set of
integration and query interfaces that can be easily integrated into cloud and
service providers' management stacks, and (2) a controller that maintains
reputation information using a mechanism that is adaptive to the highly dynamic
environment of the cloud. We have fully implemented Seit, and integrated it
into an SDN controller, a load balancer, a cloud service broker, an intrusion
detection system, and a monitoring framework. We evaluate the efficacy of Seit
using both an analytical model and a Mininet-based emulated environment. Our
analytical model validate the isolation and stability properties of Seit. Using
our emulated environment, we show that Seit can provide improved security by
isolating malicious tenants, reduced costs by adapting the infrastructure
without compromising security, and increased revenues for high quality service
providers by enabling reputation to impact discovery.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 08:13:35 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Kablan",
"Murad",
""
],
[
"Joe-Won",
"Carlee",
""
],
[
"Ha",
"Sangtae",
""
],
[
"Jamjoom",
"Hani",
""
],
[
"Keller",
"Eric",
""
]
] |
new_dataset
| 0.950735 |
1509.09089
|
Yanwei Pang
|
Yanwei Pang, Li Ye, Xuelong Li, and Jing Pan
|
Moving Object Detection in Video Using Saliency Map and Subspace
Learning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Moving object detection is a key to intelligent video analysis. On the one
hand, what moves is not only interesting objects but also noise and cluttered
background. On the other hand, moving objects without rich texture are prone
not to be detected. So there are undesirable false alarms and missed alarms in
many algorithms of moving object detection. To reduce the false alarms and
missed alarms, in this paper, we propose to incorporate a saliency map into an
incremental subspace analysis framework where the saliency map makes estimated
background has less chance than foreground (i.e., moving objects) to contain
salient objects. The proposed objective function systematically takes account
into the properties of sparsity, low-rank, connectivity, and saliency. An
alternative minimization algorithm is proposed to seek the optimal solutions.
Experimental results on the Perception Test Images Sequences demonstrate that
the proposed method is effective in reducing false alarms and missed alarms.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 09:13:20 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Pang",
"Yanwei",
""
],
[
"Ye",
"Li",
""
],
[
"Li",
"Xuelong",
""
],
[
"Pan",
"Jing",
""
]
] |
new_dataset
| 0.978144 |
1509.09092
|
David Monniaux
|
David Monniaux (VERIMAG - IMAG), Laure Gonnord (LIP)
|
An encoding of array verification problems into array-free Horn clauses
| null | null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatically verifying safety properties of programs is hard, and it is even
harder if the program acts upon arrays or other forms of maps. Many approaches
exist for verifying programs operating upon Boolean and integer values (e.g.
abstract interpretation, counterexample-guided abstraction refinement using
interpolants), but transposing them to array properties has been fraught with
difficulties.In contrast to most preceding approaches, we do not introduce a
new abstract domain or a new interpolation procedure for arrays. Instead, we
generate an abstraction as a scalar problem and feed it to a preexisting
solver, with tunable precision.Our transformed problem is expressed using Horn
clauses, a common format with clear and unambiguous logical semantics for
verification problems. An important characteristic of our encoding is that it
creates a nonlinear Horn problem, with tree unfoldings, even though following
"flatly" the control-graph structure ordinarily yields a linear Horn problem,
with linear unfoldings. That is, our encoding cannot be expressed by an
encoding into another control-flow graph problem, and truly leverages the
capacity of the Horn clause format.We illustrate our approach with a completely
automated proof of the functional correctness of selection sort.
|
[
{
"version": "v1",
"created": "Wed, 30 Sep 2015 09:29:09 GMT"
}
] | 2015-10-01T00:00:00 |
[
[
"Monniaux",
"David",
"",
"VERIMAG - IMAG"
],
[
"Gonnord",
"Laure",
"",
"LIP"
]
] |
new_dataset
| 0.97966 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.