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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1603.02764
|
Qiaoni Han
|
Bo Yang, Jingwei Li, Qiaoni Han, Tian He, Cailian Chen, Xinping Guan
|
Distributed Control for Charging Multiple Electric Vehicles with
Overload Limitation
|
30 pages, 13 figures
| null |
10.1109/TPDS.2016.2533614
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Severe pollution induced by traditional fossil fuels arouses great attention
on the usage of plug-in electric vehicles (PEVs) and renewable energy. However,
large-scale penetration of PEVs combined with other kinds of appliances tends
to cause excessive or even disastrous burden on the power grid, especially
during peak hours. This paper focuses on the scheduling of PEVs charging
process among different charging stations and each station can be supplied by
both renewable energy generators and a distribution network. The distribution
network also powers some uncontrollable loads. In order to minimize the on-grid
energy cost with local renewable energy and non-ideal storage while avoiding
the overload risk of the distribution network, an online algorithm consisting
of scheduling the charging of PEVs and energy management of charging stations
is developed based on Lyapunov optimization and Lagrange dual decomposition
techniques. The algorithm can satisfy the random charging requests from PEVs
with provable performance. Simulation results with real data demonstrate that
the proposed algorithm can decrease the time-average cost of stations while
avoiding overload in the distribution network in the presence of random
uncontrollable loads.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2016 02:16:32 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Yang",
"Bo",
""
],
[
"Li",
"Jingwei",
""
],
[
"Han",
"Qiaoni",
""
],
[
"He",
"Tian",
""
],
[
"Chen",
"Cailian",
""
],
[
"Guan",
"Xinping",
""
]
] |
new_dataset
| 0.997278 |
1603.02767
|
Abedelaziz Mohaisen
|
Jeffrey Spaulding and Shambhu Upadhyaya and Aziz Mohaisen
|
The Landscape of Domain Name Typosquatting: Techniques and
Countermeasures
|
6 pages, 1 table, 0 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With more than 294 million registered domain names as of late 2015, the
domain name ecosystem has evolved to become a cornerstone for the operation of
the Internet. Domain names today serve everyone, from individuals for their
online presence to big brands for their business operations. Such ecosystem
that facilitated legitimate business and personal uses has also fostered
"creative" cases of misuse, including phishing, spam, hit and traffic stealing,
online scams, among others. As a first step towards this misuse, the
registration of a legitimately-looking domain is often required. For that,
domain typosquatting provides a great avenue to cybercriminals to conduct their
crimes.
In this paper, we review the landscape of domain name typosquatting,
highlighting models and advanced techniques for typosquatted domain names
generation, models for their monetization, and the existing literature on
countermeasures. We further highlight potential fruitful directions on
technical countermeasures that are lacking in the literature.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2016 02:43:54 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Spaulding",
"Jeffrey",
""
],
[
"Upadhyaya",
"Shambhu",
""
],
[
"Mohaisen",
"Aziz",
""
]
] |
new_dataset
| 0.992927 |
1602.01509
|
Tom Luan
|
Tom H. Luan, Longxiang Gao, Zhi Li, Yang Xiang, Guiyi We, Limin Sun
|
A View of Fog Computing from Networking Perspective
|
The manuscript is an update version of arXiv:1502.01815 and has
substantial text overlap with arXiv:1502.01815. It is therefore requested to
be withdrawn to avoid duplication
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With smart devices, particular smartphones, becoming our everyday companions,
the ubiquitous mobile Internet and computing applications pervade people's
daily lives. With the surge demand on high-quality mobile services at anywhere,
how to address the ubiquitous user demand and accommodate the explosive growth
of mobile traffics is the key issue of the next generation mobile networks. The
Fog computing is a promising solution towards this goal. Fog computing extends
cloud computing by providing virtualized resources and engaged location-based
services to the edge of the mobile networks so as to better serve mobile
traffics. Therefore, Fog computing is a lubricant of the combination of cloud
computing and mobile applications. In this article, we outline the main
features of Fog computing and describe its concept, architecture and design
goals. Lastly, we discuss some of the future research issues from the
networking perspective.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 23:49:56 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Feb 2016 23:08:20 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Mar 2016 01:08:43 GMT"
}
] | 2016-03-09T00:00:00 |
[
[
"Luan",
"Tom H.",
""
],
[
"Gao",
"Longxiang",
""
],
[
"Li",
"Zhi",
""
],
[
"Xiang",
"Yang",
""
],
[
"We",
"Guiyi",
""
],
[
"Sun",
"Limin",
""
]
] |
new_dataset
| 0.965048 |
1603.02262
|
Maria Csernoch
|
Maria Csernoch, Piroska Bir\'o
|
Problem Solving in Sprego
|
13 Pages, 8 Tables, 2 Figures. Proc. 16th EuSpRIG Conf. "Spreadsheet
Risk Management" (2015) pp1-13 ISBN: 978-1-905404-52-0
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sprego is a programming tool for novice and end-user programmers within
graphical spreadsheet environments. The main idea of Sprego is to use as few
general purpose functions as possible, and based on these functions we create
multilevel formulas to solve real world programmable spreadsheet problems.
Beyond providing the framework for the theoretic background and the tools which
support Sprego, in order to demonstrate the power which lies within it, we
present a converted authentic table and, based on this table, data retrieval
tasks, their algorithms, and coding in full details.
|
[
{
"version": "v1",
"created": "Sat, 5 Mar 2016 23:27:48 GMT"
}
] | 2016-03-09T00:00:00 |
[
[
"Csernoch",
"Maria",
""
],
[
"Biró",
"Piroska",
""
]
] |
new_dataset
| 0.998884 |
1603.02297
|
Paul Springer
|
Paul Springer and Jeff R. Hammond and Paolo Bientinesi
|
TTC: A high-performance Compiler for Tensor Transpositions
| null | null | null | null |
cs.MS cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present TTC, an open-source parallel compiler for multidimensional tensor
transpositions. In order to generate high-performance C++ code, TTC explores a
number of optimizations, including software prefetching, blocking,
loop-reordering, and explicit vectorization. To evaluate the performance of
multidimensional transpositions across a range of possible use-cases, we also
release a benchmark covering arbitrary transpositions of up to six dimensions.
Performance results show that the routines generated by TTC achieve close to
peak memory bandwidth on both the Intel Haswell and the AMD Steamroller
architectures, and yield significant performance gains over modern compilers.
By implementing a set of pruning heuristics, TTC allows users to limit the
number of potential solutions; this option is especially useful when dealing
with high-dimensional tensors, as the search space might become prohibitively
large. Experiments indicate that when only 100 potential solutions are
considered, the resulting performance is about 99% of that achieved with
exhaustive search.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 21:13:00 GMT"
}
] | 2016-03-09T00:00:00 |
[
[
"Springer",
"Paul",
""
],
[
"Hammond",
"Jeff R.",
""
],
[
"Bientinesi",
"Paolo",
""
]
] |
new_dataset
| 0.996669 |
1603.02365
|
Rui Deng
|
Rui Deng, Liping Li, Yanjun Hu
|
On the Polar Code Encoding in Fading Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Besides the determined construction of polar codes in BEC channels, different
construction techniques have been proposed for AWGN channels. The current
state-of-the-art algorithm starts with a design-SNR (or an operating SNR) and
then processing is carried out to approximate each individual bit channel.
However, as found in this paper, for fading channels, an operating SNR can not
be directly used in approximating the bit channels. To achieve a better BER
performance, the input SNR for the polar code construction in fadding channels
is derived. A selection of the design-SNR for both the AWGN and the fading
channels from an information theoretical point of view is studied. Also
presented in this paper is the study of sacrificing a small data rate to gain
orders of magnitude increase in the BER performance.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2016 03:04:38 GMT"
}
] | 2016-03-09T00:00:00 |
[
[
"Deng",
"Rui",
""
],
[
"Li",
"Liping",
""
],
[
"Hu",
"Yanjun",
""
]
] |
new_dataset
| 0.998907 |
1603.02467
|
Marc Hellmuth
|
Marc Hellmuth, Peter F. Stadler and Nicolas Wieseke
|
The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics,
2-structures and Tree-representable Systems of Binary Relations
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The concepts of orthology, paralogy, and xenology play a key role in
molecular evolution. Orthology and paralogy distinguish whether a pair of genes
originated by speciation or duplication. The corresponding binary relations on
a set of genes form complementary cographs. Allowing more than two types of
ancestral event types leads to symmetric symbolic ultrametrics. Horizontal gene
transfer, which leads to xenologous gene pairs, however, is inherent asymmetric
since one offspring copy "jumps" into another genome, while the other continues
to be inherited vertically. We therefore explore here the mathematical
structure of the non-symmetric generalization of symbolic ultrametrics. Our
main results tie non-symmetric ultrametrics together with di-cographs (the
directed generalization of cographs), so-called uniformly non-prime
2-structures, and hierarchical structures on the set of strong modules. This
yields a characterization of relation structures that can be explained in terms
of trees and types of ancestral events. This framework accommodates a
horizontal-transfer relation in terms of an ancestral event and thus, is
slightly different from the the most commonly used definition of xenology.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2016 10:33:24 GMT"
}
] | 2016-03-09T00:00:00 |
[
[
"Hellmuth",
"Marc",
""
],
[
"Stadler",
"Peter F.",
""
],
[
"Wieseke",
"Nicolas",
""
]
] |
new_dataset
| 0.998996 |
1405.0521
|
Sina Lashgari
|
Sina Lashgari, Amir Salman Avestimehr
|
Blind MIMOME Wiretap Channel with Delayed CSIT
|
This work has been presented in part at the IEEE International
Symposium on Information Theory 2014 and IEEE Globecom 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the Gaussian MIMOME wiretap channel where a transmitter wishes to
communicate a confidential message to a legitimate receiver in the presence of
eavesdroppers, while the eavesdroppers should not be able to decode the
confidential message. Each node in the network is equipped with arbitrary
number of antennas. Furthermore, channels are time varying, and there is no
channel state information available at the transmitter (CSIT) with respect to
eavesdroppers' channels; and transmitter only has access to delayed CSIT of the
channel to the legitimate receiver. The secure degrees of freedom (SDoF) for
such network has only been characterized for special cases, and is unknown in
general. We completely characterize the SDoF of this network for all antenna
configurations. In particular, we strictly improve the state-of-the-art
achievable scheme for this network by proposing more efficient artificial noise
alignment at the receivers. Furthermore, we develop a tight upper bound by
utilizing 4 important inequalities that provide lower bounds on the received
signal dimensions at receivers which supply delayed CSIT or no CSIT, or at a
collection of receivers where some supply no CSIT. These inequalities together
allow for analysis of signal dimensions in networks with asymmetric CSIT; and
as a result, we present a converse proof that leads to characterization of SDoF
for all possible antenna configurations.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2014 21:46:39 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Mar 2016 18:28:45 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Lashgari",
"Sina",
""
],
[
"Avestimehr",
"Amir Salman",
""
]
] |
new_dataset
| 0.996527 |
1411.0281
|
Remi Chou
|
Remi A. Chou and Matthieu R. Bloch
|
Polar Coding for the Broadcast Channel with Confidential Messages: A
Random Binning Analogy
|
20 pages, two-column, 6 figures, accepted to IEEE Transactions on
Information Theory; parts of the results were presented at the 2015 IEEE
Information Theory Workshop; minor change in title
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a low-complexity polar coding scheme for the discrete memoryless
broadcast channel with confidential messages under strong secrecy and
randomness constraints. Our scheme extends previous work by using an optimal
rate of uniform randomness in the stochastic encoder, and avoiding assumptions
regarding the symmetry or degraded nature of the channels. The price paid for
these extensions is that the encoder and decoders are required to share a
secret seed of negligible size and to increase the block length through
chaining. We also highlight a close conceptual connection between the proposed
polar coding scheme and a random binning proof of the secrecy capacity region.
|
[
{
"version": "v1",
"created": "Sun, 2 Nov 2014 17:19:12 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Mar 2016 04:08:11 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Chou",
"Remi A.",
""
],
[
"Bloch",
"Matthieu R.",
""
]
] |
new_dataset
| 0.98198 |
1507.06056
|
Subir Ghosh
|
Subir Kumar Ghosh and Sudebkumar Prasant Pal
|
A National Effort for Motivating Indian Students and Teachers towards
Algorithmic Research
| null | null | null | null |
cs.CY cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During 2008-2015, twenty-two introductory workshops on graph and geometric
algorithms were organized for teachers and students (undergraduate,
post-graduate and doctoral) of engineering colleges and universities at
different states and union territories of India. The lectures were meant to
provide exposure to the field of graph and geometric algorithms and to motivate
the participants towards research. Fifty-eight professors from TIFR, IITs,
IISc, IMSc, CMI, ISI Kolkata, and other institutes and universities delivered
invited lectures on different topics in the design and analysis of algorithms,
discrete applied mathematics, computer graphics, computer vision, and robotics.
The first four workshops were funded by TIFR, BRNS and IIT Kharagpur, and the
remaining workshops were funded by the NBHM. In this paper, we present the
salient features of these workshops, and state our observations on the national
impact of these workshops.
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2015 04:49:01 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jul 2015 12:49:37 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Mar 2016 02:18:34 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Ghosh",
"Subir Kumar",
""
],
[
"Pal",
"Sudebkumar Prasant",
""
]
] |
new_dataset
| 0.999112 |
1508.01843
|
Eric Clark Mr.
|
Eric M. Clark, Chris A. Jones, Jake Ryland Williams, Allison N. Kurti,
Michell Craig Nortotsky, Christopher M. Danforth, and Peter Sheridan Dodds
|
Vaporous Marketing: Uncovering Pervasive Electronic Cigarette
Advertisements on Twitter
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: Twitter has become the "wild-west" of marketing and promotional
strategies for advertisement agencies. Electronic cigarettes have been heavily
marketed across Twitter feeds, offering discounts, "kid-friendly" flavors,
algorithmically generated false testimonials, and free samples. Methods:All
electronic cigarette keyword related tweets from a 10% sample of Twitter
spanning January 2012 through December 2014 (approximately 850,000 total
tweets) were identified and categorized as Automated or Organic by combining a
keyword classification and a machine trained Human Detection algorithm. A
sentiment analysis using Hedonometrics was performed on Organic tweets to
quantify the change in consumer sentiments over time. Commercialized tweets
were topically categorized with key phrasal pattern matching. Results:The
overwhelming majority (80%) of tweets were classified as automated or
promotional in nature. The majority of these tweets were coded as
commercialized (83.65% in 2013), up to 33% of which offered discounts or free
samples and appeared on over a billion twitter feeds as impressions. The
positivity of Organic (human) classified tweets has decreased over time (5.84
in 2013 to 5.77 in 2014) due to a relative increase in the negative words
ban,tobacco,doesn't,drug,against,poison,tax and a relative decrease in the
positive words like haha,good,cool. Automated tweets are more positive than
organic (6.17 versus 5.84) due to a relative increase in the marketing words
best,win,buy,sale,health,discount and a relative decrease in negative words
like bad, hate, stupid, don't. Conclusions:Due to the youth presence on Twitter
and the clinical uncertainty of the long term health complications of
electronic cigarette consumption, the protection of public health warrants
scrutiny and potential regulation of social media marketing.
|
[
{
"version": "v1",
"created": "Sat, 8 Aug 2015 00:09:02 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Mar 2016 19:01:49 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Clark",
"Eric M.",
""
],
[
"Jones",
"Chris A.",
""
],
[
"Williams",
"Jake Ryland",
""
],
[
"Kurti",
"Allison N.",
""
],
[
"Nortotsky",
"Michell Craig",
""
],
[
"Danforth",
"Christopher M.",
""
],
[
"Dodds",
"Peter Sheridan",
""
]
] |
new_dataset
| 0.997278 |
1509.03611
|
Ella Rabinovich
|
Ella Rabinovich, Shuly Wintner, Ofek Luis Lewinsohn
|
A Parallel Corpus of Translationese
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a set of bilingual English--French and English--German parallel
corpora in which the direction of translation is accurately and reliably
annotated. The corpora are diverse, consisting of parliamentary proceedings,
literary works, transcriptions of TED talks and political commentary. They will
be instrumental for research of translationese and its applications to (human
and machine) translation; specifically, they can be used for the task of
translationese identification, a research direction that enjoys a growing
interest in recent years. To validate the quality and reliability of the
corpora, we replicated previous results of supervised and unsupervised
identification of translationese, and further extended the experiments to
additional datasets and languages.
|
[
{
"version": "v1",
"created": "Fri, 11 Sep 2015 19:07:49 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Mar 2016 13:41:11 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Rabinovich",
"Ella",
""
],
[
"Wintner",
"Shuly",
""
],
[
"Lewinsohn",
"Ofek Luis",
""
]
] |
new_dataset
| 0.998672 |
1509.06503
|
Catalin Hritcu
|
Arthur Azevedo de Amorim, Nathan Collins, Andr\'e DeHon, Delphine
Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack,
Andrew Tolmach
|
A Verified Information-Flow Architecture
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SAFE is a clean-slate design for a highly secure computer system, with
pervasive mechanisms for tracking and limiting information flows. At the lowest
level, the SAFE hardware supports fine-grained programmable tags, with
efficient and flexible propagation and combination of tags as instructions are
executed. The operating system virtualizes these generic facilities to present
an information-flow abstract machine that allows user programs to label
sensitive data with rich confidentiality policies. We present a formal,
machine-checked model of the key hardware and software mechanisms used to
dynamically control information flow in SAFE and an end-to-end proof of
noninterference for this model.
We use a refinement proof methodology to propagate the noninterference
property of the abstract machine down to the concrete machine level. We use an
intermediate layer in the refinement chain that factors out the details of the
information-flow control policy and devise a code generator for compiling such
information-flow policies into low-level monitor code. Finally, we verify the
correctness of this generator using a dedicated Hoare logic that abstracts from
low-level machine instructions into a reusable set of verified structured code
generators.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2015 08:38:20 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Mar 2016 10:36:23 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"de Amorim",
"Arthur Azevedo",
""
],
[
"Collins",
"Nathan",
""
],
[
"DeHon",
"André",
""
],
[
"Demange",
"Delphine",
""
],
[
"Hritcu",
"Catalin",
""
],
[
"Pichardie",
"David",
""
],
[
"Pierce",
"Benjamin C.",
""
],
[
"Pollack",
"Randy",
""
],
[
"Tolmach",
"Andrew",
""
]
] |
new_dataset
| 0.998961 |
1603.01651
|
Yao Wang
|
Yao Wang and Mahesh K. Varanasi
|
Degrees of Freedom of the MIMO 2x2 Interference Network with General
Message Sets
|
submitted to T-IT on Mar 4th, 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish the DoF region for the MIMO 2x2 interference network with a
general message set, consisting of nine messages, one for each pair of a subset
of transmitters at which that message is known and a subset of receivers where
that message is desired. An outer bound on the general nine-message network is
obtained and then it is shown to be tight, establishing the DoF region for the
most general antenna setting wherein all four nodes have an arbitrary number of
antennas each. The DoF-optimal scheme is applicable to the MIMO 2x2 network
with constant channel coefficients, and hence, a fortiori, to time/frequency
varying channel scenarios. In particular, a linear precoding scheme is proposed
that can achieve all the DoF tuples in the DoF region. In it, the precise roles
played by transmit zero-forcing, interference alignment, random beamforming,
symbol extensions and asymmetric complex signaling are delineated. For
instance, we identify a class of antenna settings in which ACS is required to
achieve the fractional-valued corner points. Evidently, the DoF regions of all
previously unknown cases of the 2x2 interference network with a subset of the
nine-messages are established as special cases of the general result of this
paper. In particular, the DoF region of the well-known four-message (and even
three-message) MIMO X channel is established. This problem had remained open
despite previous studies which had found inner and outer bounds that were not
tight in general. Hence, the DoF regions of all special cases obtained from the
general DoF region of the nine-message 2x2 interference network of this work
that include at least three of the four X channel messages are new, among many
others. Our work sheds light on how the same physical 2x2 network could be used
by a suitable choice of message sets to take most advantage of the channel
resource in a flexible and efficient manner.
|
[
{
"version": "v1",
"created": "Fri, 4 Mar 2016 22:58:36 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Wang",
"Yao",
""
],
[
"Varanasi",
"Mahesh K.",
""
]
] |
new_dataset
| 0.980664 |
1603.01807
|
Bader AlBdaiwi
|
Bader F. AlBdaiwi
|
On the Number of Cycles in a Graph
|
Accepted for publication in Mathematica Slovaca
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a sizable literature on investigating the minimum and maximum
numbers of cycles in a class of graphs. However, the answer is known only for
special classes. This paper presents a result on the smallest number of cycles
in hamiltonian 3-connected cubic graphs. Further, it describes a proof
technique that could improve an upper bound of the largest number of cycles in
a hamiltonian graph.
|
[
{
"version": "v1",
"created": "Sun, 6 Mar 2016 09:41:17 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"AlBdaiwi",
"Bader F.",
""
]
] |
new_dataset
| 0.964309 |
1603.01842
|
James Peters Ph.D.
|
Enoch A-iyeh, James F. Peters
|
Proximal groupoid patterns In digital images
|
9 pages, 6 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The focus of this article is on the detection and classification of patterns
based on groupoids. The approach hinges on descriptive proximity of points in a
set based on the neighborliness property. This approach lends support to image
analysis and understanding and in studying nearness of image segments. A
practical application of the approach is in terms of the analysis of natural
images for pattern identification and classification.
|
[
{
"version": "v1",
"created": "Sun, 6 Mar 2016 16:39:34 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"A-iyeh",
"Enoch",
""
],
[
"Peters",
"James F.",
""
]
] |
new_dataset
| 0.988995 |
1603.01921
|
Mehrnaz Afshang
|
Mehrnaz Afshang and Harpreet S. Dhillon
|
Optimal Geographic Caching in Finite Wireless Networks
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cache-enabled device-to-device (D2D) networks turn memory of the devices at
the network edge, such as smart phones and tablets, into bandwidth by enabling
asynchronous content sharing directly between proximate devices. Limited
storage capacity of the mobile devices necessitates the determination of
optimal set of contents to be cached on each device. In order to study the
problem of optimal cache placement, we model the locations of devices in a
finite region (e.g., coffee shop, sports bar, library) as a uniform binomial
point process (BPP). For this setup, we first develop a generic framework to
analyze the coverage probability of the target receiver (target-Rx) when the
requested content is available at the $k^{th}$ closest device to it. Using this
coverage probability result, we evaluate optimal caching probability of the
popular content to maximize the total hit probability. Our analysis concretely
demonstrates that optimal caching probability strongly depends on the number of
simultaneously active devices in the network.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 02:48:57 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Afshang",
"Mehrnaz",
""
],
[
"Dhillon",
"Harpreet S.",
""
]
] |
new_dataset
| 0.997002 |
1603.01929
|
Junting Ye
|
Junting Ye, Santhosh Kumar, Leman Akoglu
|
Temporal Opinion Spam Detection by Multivariate Indicative Signals
|
10 pages, 29 figures
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online consumer reviews reflect the testimonials of real people, unlike
advertisements. As such, they have critical impact on potential consumers, and
indirectly on businesses. According to a Harvard study (Luca 2011), +1 rise in
star-rating increases revenue by 5-9%. Problematically, such financial
incentives have created a market for spammers to fabricate reviews, to unjustly
promote or demote businesses, activities known as opinion spam (Jindal and Liu
2008). A vast majority of existing work on this problem have formulations based
on static review data, with respective techniques operating in an offline
fashion. Spam campaigns, however, are intended to make most impact during their
course. Abnormal events triggered by spammers' activities could be masked in
the load of future events, which static analysis would fail to identify. In
this work, we approach the opinion spam problem with a temporal formulation.
Specifically, we monitor a list of carefully selected indicative signals of
opinion spam over time and design efficient techniques to both detect and
characterize abnormal events in real-time. Experiments on datasets from two
different review sites show that our approach is fast, effective, and practical
to be deployed in real-world systems.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 04:18:06 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Ye",
"Junting",
""
],
[
"Kumar",
"Santhosh",
""
],
[
"Akoglu",
"Leman",
""
]
] |
new_dataset
| 0.986214 |
1603.01973
|
Jisun An
|
Jisun An, Ingmar Weber
|
#greysanatomy vs. #yankees: Demographics and Hashtag Use on Twitter
|
This is a preprint of an article appearing at ICWSM 2016
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Demographics, in particular, gender, age, and race, are a key predictor of
human behavior. Despite the significant effect that demographics plays, most
scientific studies using online social media do not consider this factor,
mainly due to the lack of such information. In this work, we use
state-of-the-art face analysis software to infer gender, age, and race from
profile images of 350K Twitter users from New York. For the period from
November 1, 2014 to October 31, 2015, we study which hashtags are used by
different demographic groups. Though we find considerable overlap for the most
popular hashtags, there are also many group-specific hashtags.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 08:35:52 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"An",
"Jisun",
""
],
[
"Weber",
"Ingmar",
""
]
] |
new_dataset
| 0.985244 |
1603.02253
|
Wenbin Li
|
Wenbin Li and Yang Chen and JeeHang Lee and Gang Ren and Darren Cosker
|
Blur Robust Optical Flow using Motion Channel
|
Preprint of our paper accepted by Neurocomputing
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is hard to estimate optical flow given a realworld video sequence with
camera shake and other motion blur. In this paper, we first investigate the
blur parameterization for video footage using near linear motion elements. we
then combine a commercial 3D pose sensor with an RGB camera, in order to film
video footage of interest together with the camera motion. We illustrates that
this additional camera motion/trajectory channel can be embedded into a hybrid
framework by interleaving an iterative blind deconvolution and warping based
optical flow scheme. Our method yields improved accuracy within three other
state-of-the-art baselines given our proposed ground truth blurry sequences;
and several other realworld sequences filmed by our imaging system.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 20:53:20 GMT"
}
] | 2016-03-08T00:00:00 |
[
[
"Li",
"Wenbin",
""
],
[
"Chen",
"Yang",
""
],
[
"Lee",
"JeeHang",
""
],
[
"Ren",
"Gang",
""
],
[
"Cosker",
"Darren",
""
]
] |
new_dataset
| 0.972735 |
1602.08325
|
Ahmad Hassanat
|
Ahmad B. A. Hassanat, Mahmoud B. Alhasanat, Mohammad Ali Abbadi, Eman
Btoush, Mouhammd Al-Awadi, Ahmad S. Tarawneh
|
Victory Sign Biometric for Terrorists Identification
|
7 pages, 5 figures, 4 tables, 26 references
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Covering the face and all body parts, sometimes the only evidence to identify
a person is their hand geometry, and not the whole hand- only two fingers (the
index and the middle fingers) while showing the victory sign, as seen in many
terrorists videos. This paper investigates for the first time a new way to
identify persons, particularly (terrorists) from their victory sign. We have
created a new database in this regard using a mobile phone camera, imaging the
victory signs of 50 different persons over two sessions. Simple measurements
for the fingers, in addition to the Hu Moments for the areas of the fingers
were used to extract the geometric features of the shown part of the hand shown
after segmentation. The experimental results using the KNN classifier were
encouraging for most of the recorded persons; with about 40% to 93% total
identification accuracy, depending on the features, distance metric and K used.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 13:57:40 GMT"
}
] | 2016-03-07T00:00:00 |
[
[
"Hassanat",
"Ahmad B. A.",
""
],
[
"Alhasanat",
"Mahmoud B.",
""
],
[
"Abbadi",
"Mohammad Ali",
""
],
[
"Btoush",
"Eman",
""
],
[
"Al-Awadi",
"Mouhammd",
""
],
[
"Tarawneh",
"Ahmad S.",
""
]
] |
new_dataset
| 0.990273 |
1603.01324
|
Brayden Hollis
|
Brayden Hollis, Stacy Patterson, Jeff Trinkle
|
Compressed Sensing for Tactile Skins
|
8 pages, 4 figures, submitted to ICRA16
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Whole body tactile perception via tactile skins offers large benefits for
robots in unstructured environments. To fully realize this benefit, tactile
systems must support real-time data acquisition over a massive number of
tactile sensor elements. We present a novel approach for scalable tactile data
acquisition using compressed sensing. We first demonstrate that the tactile
data is amenable to compressed sensing techniques. We then develop a solution
for fast data sampling, compression, and reconstruction that is suited for
tactile system hardware and has potential for reducing the wiring complexity.
Finally, we evaluate the performance of our technique on simulated tactile
sensor networks. Our evaluations show that compressed sensing, with a
compression ratio of 3 to 1, can achieve higher signal acquisition accuracy
than full data acquisition of noisy sensor data.
|
[
{
"version": "v1",
"created": "Fri, 4 Mar 2016 01:30:52 GMT"
}
] | 2016-03-07T00:00:00 |
[
[
"Hollis",
"Brayden",
""
],
[
"Patterson",
"Stacy",
""
],
[
"Trinkle",
"Jeff",
""
]
] |
new_dataset
| 0.992364 |
1603.01412
|
Brijesh Dongol
|
Brijesh Dongol and Lindsay Groves
|
Contextual trace refinement for concurrent objects: Safety and progress
| null | null | null | null |
cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Correctness of concurrent objects is defined in terms of safety properties
such as linearizability, sequential consistency, and quiescent consistency, and
progress properties such as wait-, lock-, and obstruction-freedom. These
properties, however, only refer to the behaviours of the object in isolation,
which does not tell us what guarantees these correctness conditions on
concurrent objects provide to their client programs. This paper investigates
the links between safety and progress properties of concurrent objects and a
form of trace refinement for client programs, called contextual trace
refinement. In particular, we show that linearizability together with a minimal
notion of progress are sufficient properties of concurrent objects to ensure
contextual trace refinement, but sequential consistency and quiescent
consistency are both too weak. Our reasoning is carried out in the action
systems framework with procedure calls, which we extend to cope with non-atomic
operations.
|
[
{
"version": "v1",
"created": "Fri, 4 Mar 2016 10:20:23 GMT"
}
] | 2016-03-07T00:00:00 |
[
[
"Dongol",
"Brijesh",
""
],
[
"Groves",
"Lindsay",
""
]
] |
new_dataset
| 0.991622 |
1208.3942
|
Heiko Vogler
|
Manfred Droste, Heiko Vogler
|
The Chomsky-Sch\"utzenberger Theorem for Quantitative Context-Free
Languages
|
This new version combines a conference and a journal paper of the
authors on the same topic, see references [15,16], and supplements them by a
few additional examples and more detailed proofs. It also corrects a mistake
in Theorem 7.7 of the first arxiv version (the property sequential was
missing)
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Weighted automata model quantitative aspects of systems like the consumption
of resources during executions. Traditionally, the weights are assumed to form
the algebraic structure of a semiring, but recently also other weight
computations like average have been considered. Here, we investigate
quantitative context-free languages over very general weight structures
incorporating all semirings, average computations, lattices, and more. In our
main result, we derive the fundamental Chomsky-Sch\"utzenberger theorem for
such quantitative context-free languages, showing that each arises as the image
of a Dyck language and a regular language under a suitable morphism. Moreover,
we show that quantitative context-free language are expressively equivalent to
a model of weighted pushdown automata. This generalizes results previously
known only for semirings. We also investigate when quantitative context-free
languages assume only finitely many values.
|
[
{
"version": "v1",
"created": "Mon, 20 Aug 2012 08:47:56 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Mar 2016 13:05:06 GMT"
}
] | 2016-03-04T00:00:00 |
[
[
"Droste",
"Manfred",
""
],
[
"Vogler",
"Heiko",
""
]
] |
new_dataset
| 0.999589 |
1601.05962
|
Samuele Giraudo
|
Samuele Giraudo and St\'ephane Vialette
|
Unshuffling Permutations
|
13 pages
|
Latin American Theoretical Informatics Symposium, LNCS 9644,
509--521, 2016
| null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A permutation is said to be a square if it can be obtained by shuffling two
order-isomorphic patterns. The definition is intended to be the natural
counterpart to the ordinary shuffle of words and languages. In this paper, we
tackle the problem of recognizing square permutations from both the point of
view of algebra and algorithms. On the one hand, we present some algebraic and
combinatorial properties of the shuffle product of permutations. We follow an
unusual line consisting in defining the shuffle of permutations by means of an
unshuffling operator, known as a coproduct. This strategy allows to obtain easy
proofs for algebraic and combinatorial properties of our shuffle product. We
besides exhibit a bijection between square $(213,231)$-avoiding permutations
and square binary words. On the other hand, by using a pattern avoidance
criterion on oriented perfect matchings, we prove that recognizing square
permutations is $\mathbf{NP}$-complete.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 11:24:54 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Mar 2016 09:12:02 GMT"
}
] | 2016-03-04T00:00:00 |
[
[
"Giraudo",
"Samuele",
""
],
[
"Vialette",
"Stéphane",
""
]
] |
new_dataset
| 0.990591 |
1603.00928
|
Stefano Leucci
|
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
|
Trainyard is NP-Hard
| null | null | null | null |
cs.CC
|
http://creativecommons.org/licenses/by/4.0/
|
Recently, due to the widespread diffusion of smart-phones, mobile puzzle
games have experienced a huge increase in their popularity. A successful puzzle
has to be both captivating and challenging, and it has been suggested that this
features are somehow related to their computational complexity \cite{Eppstein}.
Indeed, many puzzle games --such as Mah-Jongg, Sokoban, Candy Crush, and 2048,
to name a few-- are known to be NP-hard \cite{CondonFLS97,
culberson1999sokoban, GualaLN14, Mehta14a}. In this paper we consider
Trainyard: a popular mobile puzzle game whose goal is to get colored trains
from their initial stations to suitable destination stations. We prove that the
problem of determining whether there exists a solution to a given Trainyard
level is NP-hard. We also \href{http://trainyard.isnphard.com}{provide} an
implementation of our hardness reduction.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 23:32:33 GMT"
}
] | 2016-03-04T00:00:00 |
[
[
"Almanza",
"Matteo",
""
],
[
"Leucci",
"Stefano",
""
],
[
"Panconesi",
"Alessandro",
""
]
] |
new_dataset
| 0.998291 |
1603.00975
|
EPTCS
|
Mauricio Ayala-Rinc\'on (Universidade de Bras\'ilia)
|
Formalising Confluence in PVS
|
In Proceedings DCM 2015, arXiv:1603.00536
|
EPTCS 204, 2016, pp. 11-17
|
10.4204/EPTCS.204.2
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Confluence is a critical property of computational systems which is related
with determinism and non ambiguity and thus with other relevant computational
attributes of functional specifications and rewriting system as termination and
completion. Several criteria have been explored that guarantee confluence and
their formalisations provide further interesting information. This work
discusses topics and presents personal positions and views related with the
formalisation of confluence properties in the Prototype Verification System PVS
developed at our research group.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2016 05:33:28 GMT"
}
] | 2016-03-04T00:00:00 |
[
[
"Ayala-Rincón",
"Mauricio",
"",
"Universidade de Brasília"
]
] |
new_dataset
| 0.977964 |
1603.00980
|
Kanji Tanaka
|
Tanaka Kanji
|
Local Map Descriptor for Compressive Change Retrieval
|
8 pages, 7 figures, Draft of a paper submitted to an International
Conference
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Change detection, i.e., anomaly detection from local maps built by a mobile
robot at multiple different times, is a challenging problem to solve in
practice. Most previous work either cannot be applied to scenarios where the
size of the map collection is large, or simply assumed that the robot
self-location is globally known. In this paper, we tackle the problem of
simultaneous self-localization and change detection, by reformulating the
problem as a map retrieval problem, and propose a local map descriptor with a
compressed bag-of-words (BoW) structure as a scalable solution. We make the
following contributions. (1) To enable a direct comparison of the spatial
layout of visual features between different local maps, the origin of the local
map coordinate (termed "viewpoint") is planned by scene parsing and determined
by our "viewpoint planner" to be invariant against small variations in
self-location and changes, aiming at providing similar viewpoints for similar
scenes (i.e., the relevant map pair). (2) We extend the BoW model to enable the
use of not only the appearance (e.g., polestar) but also the spatial layout
(e.g., spatial pyramid) of visual features with respect to the planned
viewpoint. The key observation is that the planned viewpoint (i.e., the origin
of local map coordinate) acts as a pseudo viewpoint that is usually required by
spatial BoW (e.g., SPM) and also by anomaly detection (e.g., NN-d, LOF). (3)
Experimental results on a challenging "loop-closing" scenario show that the
proposed method outperforms previous BoW methods in self-localization, and
furthermore, that the use of both appearance and pose information in change
detection produces better results than the use of either information alone.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2016 05:35:39 GMT"
}
] | 2016-03-04T00:00:00 |
[
[
"Kanji",
"Tanaka",
""
]
] |
new_dataset
| 0.995516 |
1401.3556
|
Sergiy Vorobyov A.
|
Alex E. Geyer, Reza Nikjah, Sergiy A. Vorobyov, and Norman C. Beaulieu
|
Equivalent Codes, Optimality, and Performance Analysis of OSTBC:
Textbook Study
|
33 pages, 12 figures, 5 tables, full size journal paper, Finished in
Oct. 2009, Unpublished
|
IEEE Trans. Communications, vol. 63, no. 8, pp. 2912-2923, Aug.
2015
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An equivalent model for a multi-input multi-output (MIMO) communication
system with orthogonal space-time block codes (OSTBCs) is proposed based on a
newly revealed connection between OSTBCs and Euclidean codes. Examples of
distance spectra, signal constellations, and signal coordinate diagrams of
Euclidean codes equivalent to simplest OSTBCs are given. A new asymptotic upper
bound for the symbol error rate (SER) of OSTBCs, based on the distance spectra
of the introduced equivalent Euclidean codes is derived, and new general design
criteria for signal constellations of the optimal OSTBC are proposed. Some
bounds relating distance properties, dimensionality, and cardinality of OSTBCs
with constituent signals of equal energy are given, and new optimal signal
constellations with cardinalities M = 8 and M = 16 for Alamouti's code are
designed. Using the new model for MIMO communication systems with OSTBCs, a
general methodology for performance analysis of OSTBCs is developed. As an
example of the application of this methodology, an exact evaluation of the SER
of any OSTBC is given. Namely, a new expression for the SER of Alamouti's OSTBC
with binary phase shift keying (BPSK) signals is derived.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 12:07:56 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Geyer",
"Alex E.",
""
],
[
"Nikjah",
"Reza",
""
],
[
"Vorobyov",
"Sergiy A.",
""
],
[
"Beaulieu",
"Norman C.",
""
]
] |
new_dataset
| 0.969453 |
1508.01722
|
Jun-Cheng Chen
|
Jun-Cheng Chen and Vishal M. Patel and Rama Chellappa
|
Unconstrained Face Verification using Deep CNN Features
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present an algorithm for unconstrained face verification
based on deep convolutional features and evaluate it on the newly released
IARPA Janus Benchmark A (IJB-A) dataset. The IJB-A dataset includes real-world
unconstrained faces from 500 subjects with full pose and illumination
variations which are much harder than the traditional Labeled Face in the Wild
(LFW) and Youtube Face (YTF) datasets. The deep convolutional neural network
(DCNN) is trained using the CASIA-WebFace dataset. Extensive experiments on the
IJB-A dataset are provided.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 15:21:19 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Mar 2016 19:41:42 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Chen",
"Jun-Cheng",
""
],
[
"Patel",
"Vishal M.",
""
],
[
"Chellappa",
"Rama",
""
]
] |
new_dataset
| 0.959839 |
1603.00532
|
Soroush Ghorashi
|
Soroush Ghorashi, Carlos Jensen
|
Jimbo: A Collaborative IDE with Live Preview
|
4 pages
| null |
10.1145/2897586.2897613
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Team collaboration plays a key role in the success of any multi-user
activity. Software engineering is a highly collaborative activity, where
multiple developers and designers work together to solve a common problem.
Meaningful and effective designer-developer collaboration improves the user
experience, which can improve the chances of success for the project. Learning
to program is another activity that can be implemented in a more collaborative
way, students can learn in an active style by working with others. The growth
of online classes, from small structured seminars to massive open online
courses (MOOCs), and the isolation and impoverished learning experience some
students report in these, points to an urgent need for tools that support
remote pair programming in a distributed educational setting. In this paper, we
describe Jimbo, a collaborative integrated development environment (IDE) that
we believe is beneficial and effective in both aforementioned activities. Jimbo
integrates many features that support better collaboration and communication
between designers and developers, to bridge communication gaps and develop
mutual understanding. These novel features can improve today's CS education by
bringing students closer to each other and their instructors as well as
training them to collaborate which is consistent with current practices in
software engineering.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 00:34:34 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Ghorashi",
"Soroush",
""
],
[
"Jensen",
"Carlos",
""
]
] |
new_dataset
| 0.999402 |
1603.00588
|
Shin-Ming Cheng
|
Pin-Yu Chen and Ching-Chao Lin and Shin-Ming Cheng and Hsu-Chun Hsiao
and Chun-Ying Huang
|
Decapitation via Digital Epidemics: A Bio-Inspired Transmissive Attack
|
To appear in June 2016 IEEE Communications Magazine, feature topic on
"Bio-inspired Cyber Security for Communications and Networking"
| null | null | null |
cs.CR cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The evolution of communication technology and the proliferation of electronic
devices have rendered adversaries powerful means for targeted attacks via all
sorts of accessible resources. In particular, owing to the intrinsic
interdependency and ubiquitous connectivity of modern communication systems,
adversaries can devise malware that propagates through intermediate hosts to
approach the target, which we refer to as transmissive attacks. Inspired by
biology, the transmission pattern of such an attack in the digital space much
resembles the spread of an epidemic in real life. This paper elaborates
transmissive attacks, summarizes the utility of epidemic models in
communication systems, and draws connections between transmissive attacks and
epidemic models. Simulations, experiments, and ongoing research challenges on
transmissive attacks are also addressed.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 06:16:51 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Chen",
"Pin-Yu",
""
],
[
"Lin",
"Ching-Chao",
""
],
[
"Cheng",
"Shin-Ming",
""
],
[
"Hsiao",
"Hsu-Chun",
""
],
[
"Huang",
"Chun-Ying",
""
]
] |
new_dataset
| 0.952643 |
1603.00619
|
Sayan Mitra
|
Yixiao Lin, Sayan Mitra and Shuting Li
|
Porting Code Across Simple Mobile Robots
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The StarL programming framework aims to simplify development of distributed
robotic applications by providing easy-to-use language constructs for
communication and control. It has been used to develop applications such as
formation control, distributed tracking, and collaborative search. In this
paper, we present a complete redesign of the StarL language and its runtime
system which enables us to achieve portability of robot programs across
platforms. Thus, the same application program, say, for distributed tracking,
can now be compiled and deployed on multiple, heterogeneous robotic platforms.
Towards portability, this we first define the semantics of StarL programs in a
way that is largely platform independent, except for a few key
platform-dependent parameters that capture the worst-case execution and sensing
delays and resolution of sensors. Next, we present a design of the StarL
runtime system, including a robot controller, that meets the above semantics.
The controller consists of a platform-independent path planner implemented
using RRTs and a platform-dependent way-point tracker that is implemented using
the control commands available for the platform. We demonstrate portability of
StarL applications using simulation results for two different robotic
platforms, and several applications.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 08:48:15 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Lin",
"Yixiao",
""
],
[
"Mitra",
"Sayan",
""
],
[
"Li",
"Shuting",
""
]
] |
new_dataset
| 0.967493 |
1603.00646
|
Yelena Mejova
|
Jisun An, Haewoon Kwak, Yelena Mejova, Sonia Alonso Saenz De Oger,
Braulio Gomez Fortes
|
Are you Charlie or Ahmed? Cultural pluralism in Charlie Hebdo response
on Twitter
|
International AAAI Conference on Web and Social Media (ICWSM), 2016
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the response to the Charlie Hebdo shootings of January 7, 2015 on
Twitter across the globe. We ask whether the stances on the issue of freedom of
speech can be modeled using established sociological theories, including
Huntington's culturalist Clash of Civilizations, and those taking into
consideration social context, including Density and Interdependence theories.
We find support for Huntington's culturalist explanation, in that the
established traditions and norms of one's "civilization" predetermine some of
one's opinion. However, at an individual level, we also find social context to
play a significant role, with non-Arabs living in Arab countries using
#JeSuisAhmed ("I am Ahmed") five times more often when they are embedded in a
mixed Arab/non-Arab (mention) network. Among Arabs living in the West, we find
a great variety of responses, not altogether associated with the size of their
expatriate community, suggesting other variables to be at play.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 10:38:11 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"An",
"Jisun",
""
],
[
"Kwak",
"Haewoon",
""
],
[
"Mejova",
"Yelena",
""
],
[
"De Oger",
"Sonia Alonso Saenz",
""
],
[
"Fortes",
"Braulio Gomez",
""
]
] |
new_dataset
| 0.951924 |
1603.00747
|
Donghyuk Lee
|
Yoongu Kim, Ross Daly, Jeremie Kim, Chris Fallin, Ji Hye Lee, Donghyuk
Lee, Chris Wilkerson, Konrad Lai, Onur Mutlu
|
RowHammer: Reliability Analysis and Security Implications
|
This is the summary of the paper titled "Flipping Bits in Memory
Without Accessing Them: An Experimental Study of DRAM Disturbance Errors"
which appeared in ISCA in June 2014
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As process technology scales down to smaller dimensions, DRAM chips become
more vulnerable to disturbance, a phenomenon in which different DRAM cells
interfere with each other's operation. For the first time in academic
literature, our ISCA paper exposes the existence of disturbance errors in
commodity DRAM chips that are sold and used today. We show that repeatedly
reading from the same address could corrupt data in nearby addresses. More
specifically: When a DRAM row is opened (i.e., activated) and closed (i.e.,
precharged) repeatedly (i.e., hammered), it can induce disturbance errors in
adjacent DRAM rows. This failure mode is popularly called RowHammer. We tested
129 DRAM modules manufactured within the past six years (2008-2014) and found
110 of them to exhibit RowHammer disturbance errors, the earliest of which
dates back to 2010. In particular, all modules from the past two years
(2012-2013) were vulnerable, which implies that the errors are a recent
phenomenon affecting more advanced generations of process technology.
Importantly, disturbance errors pose an easily-exploitable security threat
since they are a breach of memory protection, wherein accesses to one page
(mapped to one row) modifies the data stored in another page (mapped to an
adjacent row).
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2016 17:19:04 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Kim",
"Yoongu",
""
],
[
"Daly",
"Ross",
""
],
[
"Kim",
"Jeremie",
""
],
[
"Fallin",
"Chris",
""
],
[
"Lee",
"Ji Hye",
""
],
[
"Lee",
"Donghyuk",
""
],
[
"Wilkerson",
"Chris",
""
],
[
"Lai",
"Konrad",
""
],
[
"Mutlu",
"Onur",
""
]
] |
new_dataset
| 0.999225 |
1603.00762
|
Patrick Sol\'e
|
Adel Alahmadi, Funda \"Ozdemir, Patrick Sol\'e
|
On self-dual double circulant codes
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self-dual double circulant codes of odd dimension are shown to be dihedral in
even characteristic and consta-dihedral in odd characteristic. Exact counting
formulae are derived for them and used to show they contain families of codes
with relative distance satisfying a modified Gilbert-Varshamov bound.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 15:50:41 GMT"
}
] | 2016-03-03T00:00:00 |
[
[
"Alahmadi",
"Adel",
""
],
[
"Özdemir",
"Funda",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.999295 |
1406.4710
|
Christian Retor\'e
|
Christian Retor\'e
|
Typed Hilbert Epsilon Operators and the Semantics of Determiner Phrases
(Invited Lecture)
| null | null |
10.1007/978-3-662-44121-3_2
| null |
cs.CL cs.AI cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The semantics of determiner phrases, be they definite de- scriptions,
indefinite descriptions or quantified noun phrases, is often as- sumed to be a
fully solved question: common nouns are properties, and determiners are
generalised quantifiers that apply to two predicates: the property
corresponding to the common noun and the one corresponding to the verb phrase.
We first present a criticism of this standard view. Firstly, the semantics of
determiners does not follow the syntactical structure of the sentence. Secondly
the standard interpretation of the indefinite article cannot ac- count for
nominal sentences. Thirdly, the standard view misses the linguis- tic asymmetry
between the two properties of a generalised quantifier. In the sequel, we
propose a treatment of determiners and quantifiers as Hilbert terms in a richly
typed system that we initially developed for lexical semantics, using a many
sorted logic for semantical representations. We present this semantical
framework called the Montagovian generative lexicon and show how these terms
better match the syntactical structure and avoid the aforementioned problems of
the standard approach. Hilbert terms rather differ from choice functions in
that there is one polymorphic operator and not one operator per formula. They
also open an intriguing connection between the logic for meaning assembly, the
typed lambda calculus handling compositionality and the many-sorted logic for
semantical representations. Furthermore epsilon terms naturally introduce
type-judgements and confirm the claim that type judgment are a form of
presupposition.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2014 13:32:55 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Retoré",
"Christian",
""
]
] |
new_dataset
| 0.99926 |
1510.05452
|
Sylvain Sen\'e
|
Aurore Alcolei, K\'evin Perrot and Sylvain Sen\'e
|
On the flora of asynchronous locally non-monotonic Boolean automata
networks
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Boolean automata networks (BANs) are a well established model for biological
regulation systems such as neural networks or genetic networks. Studies on the
dynamics of BANs, whether it is synchronous or asynchronous, have mainly
focused on monotonic networks, where fundamental questions on the links
relating their static and dynamical properties have been raised and addressed.
This paper explores analogous questions on asynchronous non-monotonic networks,
xor-BANs, that are BANs where all the local transition functions are
xor-functions. Using algorithmic tools, we give a general characterisation of
the asynchronous transition graphs for most of the cactus xor-BANs and strongly
connected xor-BANs. As an illustration of the results, we provide a complete
description of the asynchronous dynamics of two particular classes of xor-BAN,
namely xor-Flowers and xor-Cycle Chains. This work also leads to new
bisimulation equivalences specific to xor-BANs.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 12:58:41 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Oct 2015 07:14:47 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Mar 2016 15:18:44 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Alcolei",
"Aurore",
""
],
[
"Perrot",
"Kévin",
""
],
[
"Sené",
"Sylvain",
""
]
] |
new_dataset
| 0.992849 |
1602.08127
|
Xiping Fu
|
Xiping Fu, Brendan McCane, Steven Mills, Michael Albert and Lech
Szymanski
|
Auto-JacoBin: Auto-encoder Jacobian Binary Hashing
|
Submitting to journal (TPAMI). 17 pages, 11 figures. The Matlab codes
for AutoJacoBin and NOKMeans are available:
https://bitbucket.org/fxpfxp/autojacobin
https://bitbucket.org/fxpfxp/nokmeans The SIFT10M dataset is available at:
http://archive.ics.uci.edu/ml/datasets/SIFT10M
| null | null | null |
cs.CV cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
Binary codes can be used to speed up nearest neighbor search tasks in large
scale data sets as they are efficient for both storage and retrieval. In this
paper, we propose a robust auto-encoder model that preserves the geometric
relationships of high-dimensional data sets in Hamming space. This is done by
considering a noise-removing function in a region surrounding the manifold
where the training data points lie. This function is defined with the property
that it projects the data points near the manifold into the manifold wisely,
and we approximate this function by its first order approximation. Experimental
results show that the proposed method achieves better than state-of-the-art
results on three large scale high dimensional data sets.
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2016 21:47:16 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Mar 2016 06:22:28 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Fu",
"Xiping",
""
],
[
"McCane",
"Brendan",
""
],
[
"Mills",
"Steven",
""
],
[
"Albert",
"Michael",
""
],
[
"Szymanski",
"Lech",
""
]
] |
new_dataset
| 0.995148 |
1602.08987
|
Tam Nguyen
|
Tam Nguyen and Emanuele Garone
|
Proof of Control of a UAV and a UGV Cooperating to Manipulate an Object
|
8 pages, 5 figures, American Control Conference (ACC) 2016
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on the control of a system composed of an Unmanned Aerial
Vehicle (UAV) and an Unmanned Ground Vehicle (UGV) which cooperate to
manipulate an object. The two units are subject to actuator saturations and
cooperate to move the object to a desired pose, characterized by its position
and inclination. The paper proposes a control strategy where the ground vehicle
is tasked to deploy the object to a certain position, whereas the aerial
vehicle adjusts its inclination. The ground vehicle is governed by a saturated
proportional-derivative control law. The aerial vehicle is regulated by means
of a cascade control specifically designed for this problem that is able to
exploit the mechanical interconnection. The stability of the overall system is
proved through Input-to-State Stability and Small Gain theorem arguments. To
solve the problem of constraints satisfaction, a nonlinear Reference Governor
scheme is implemented. Numerical simulations are provided to demonstrate the
effectiveness of the proposed method.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 14:45:32 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Mar 2016 09:31:13 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Nguyen",
"Tam",
""
],
[
"Garone",
"Emanuele",
""
]
] |
new_dataset
| 0.996964 |
1603.00060
|
Adrian Dumitrescu
|
Kevin Balas, Adrian Dumitrescu, and Csaba D. T\'oth
|
Anchored Rectangle and Square Packings
|
33 pages, 20 figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For points $p_1,\ldots , p_n$ in the unit square $[0,1]^2$, an \emph{anchored
rectangle packing} consists of interior-disjoint axis-aligned empty rectangles
$r_1,\ldots , r_n\subseteq [0,1]^2$ such that point $p_i$ is a corner of the
rectangle $r_i$ (that is, $r_i$ is \emph{anchored} at $p_i$) for $i=1,\ldots,
n$. We show that for every set of $n$ points in $[0,1]^2$, there is an anchored
rectangle packing of area at least $7/12-O(1/n)$, and for every $n\in
\mathbf{N}$, there are point sets for which the area of every anchored
rectangle packing is at most $2/3$. The maximum area of an anchored
\emph{square} packing is always at least $5/32$ and sometimes at most $7/27$.
The above constructive lower bounds immediately yield constant-factor
approximations, of $7/12 -\varepsilon$ for rectangles and $5/32$ for squares,
for computing anchored packings of maximum area in $O(n\log n)$ time. We prove
that a simple greedy strategy achieves a $9/47$-approximation for anchored
square packings, and $1/3$ for lower-left anchored square packings. Reductions
to maximum weight independent set (MWIS) yield a QPTAS and a PTAS for anchored
rectangle and square packings in $n^{O(1/\varepsilon)}$ and $\exp({\rm
poly}(\log (n/\varepsilon)))$ time, respectively.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 21:44:01 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Balas",
"Kevin",
""
],
[
"Dumitrescu",
"Adrian",
""
],
[
"Tóth",
"Csaba D.",
""
]
] |
new_dataset
| 0.996234 |
1603.00091
|
Dimitri Van Assche
|
Toon Calders, Dimitri Van Assche
|
PROMETHEE is Not Quadratic: An O(qn log(n)) Algorithm
|
16 pages, 2 figures
| null | null | null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is generally believed that the preference ranking method PROMETHEE has a
quadratic time complexity. In this paper, however, we present an exact
algorithm that computes PROMETHEE's net flow scores in time O(qn log(n)), where
q represents the number of criteria and n the number of alternatives. The
method is based on first sorting the alternatives after which the unicriterion
flow scores of all alternatives can be computed in one scan over the sorted
list of alternatives while maintaining a sliding window. This method works with
the linear and level criterion preference functions. The algorithm we present
is exact and, due to the sub-quadratic time complexity, vastly extends the
applicability of the PROMETHEE method. Experiments show that with the new
algorithm, PROMETHEE can scale up to millions of tuples.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 23:25:51 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Calders",
"Toon",
""
],
[
"Van Assche",
"Dimitri",
""
]
] |
new_dataset
| 0.985926 |
1603.00100
|
Masahiro Kaminaga
|
Masahiro Kaminaga, Hideki Yoshikawa, Arimitsu Shikoda, Toshinori
Suzuki
|
Crashing Modulus Attack on Modular Squaring for Rabin Cryptosystem
|
18 pages, 2 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Rabin cryptosystem has been proposed protect the unique ID (UID) in
radio-frequency identification tags. The Rabin cryptosystem is a type of
lightweight public key system that is theoretetically quite secure; however it
is vulnerable to several side-channel attacks. In this paper, a crashing
modulus attack is presented as a new fault attack on modular squaring during
Rabin encryption. This attack requires only one fault in the public key if its
perturbed public key can be factored. Our simulation results indicate that the
attack is more than 50\% successful with several faults in practical time. A
complicated situation arises when reconstrucing the message, including the UID,
from ciphertext, i.e., the message and the perturbed public key are not
relatively prime. We present a complete and mathematically rigorous message
reconstruction algorithm for such a case. Moreover, we propose an exact formula
to obtain a number of candidate messages. We show that the number is not
generally equal to a power of two.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 00:00:54 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Kaminaga",
"Masahiro",
""
],
[
"Yoshikawa",
"Hideki",
""
],
[
"Shikoda",
"Arimitsu",
""
],
[
"Suzuki",
"Toshinori",
""
]
] |
new_dataset
| 0.999646 |
1603.00154
|
Ping Hu
|
Ping Hu, Chi Wan Sung, and Terence H. Chan
|
Broadcast Repair for Wireless Distributed Storage Systems
|
6 pages, 4 figures, in Proc. International Conference on Information,
Communications and Signal Processing (ICICS), Singapore, Dec. 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless distributed storage systems, storage nodes are connected by
wireless channels, which are broadcast in nature. This paper exploits this
unique feature to design an efficient repair mechanism, called broadcast
repair, for wireless distributed storage systems with multiple-node failures.
Since wireless channels are typically bandwidth limited, we advocate a new
measure on repair performance called repair-transmission bandwidth, which
measures the average number of packets transmitted by helper nodes per failed
node. The fundamental tradeoff between storage amount and repair-transmission
bandwidth is obtained. It is shown that broadcast repair outperforms
cooperative repair, which is the basic repair method for wired distributed
storage systems with multiple-node failures, in terms of storage efficiency and
repair-transmission bandwidth, thus yielding a better tradeoff curve.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 05:58:32 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Hu",
"Ping",
""
],
[
"Sung",
"Chi Wan",
""
],
[
"Chan",
"Terence H.",
""
]
] |
new_dataset
| 0.999271 |
1603.00302
|
Zhiguo Ding
|
Z. Ding and L. Dai and H. V. Poor
|
MIMO-NOMA Design for Small Packet Transmission in the Internet of Things
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A feature of the Internet of Things (IoT) is that some users in the system
need to be served quickly for small packet transmission. To address this
requirement, a new multiple-input multiple-output non-orthogonal multiple
access (MIMO-NOMA) scheme is designed in this paper, where one user is served
with its quality of service (QoS) requirement strictly met, and the other user
is served opportunistically by using the NOMA concept. The novelty of this new
scheme is that it confronts the challenge that most existing MIMO-NOMA schemes
rely on the assumption that users' channel conditions are different, a strong
assumption which may not be valid in practice. The developed precoding and
detection strategies can effectively create a significant difference between
the users' effective channel gains, and therefore the potential of NOMA can be
realized even if the users' original channel conditions are similar. Analytical
and numerical results are provided to demonstrate the performance of the
proposed MIMO-NOMA scheme.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 15:00:49 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Ding",
"Z.",
""
],
[
"Dai",
"L.",
""
],
[
"Poor",
"H. V.",
""
]
] |
new_dataset
| 0.996908 |
1603.00406
|
Abhishek Sinha
|
Abhishek Sinha, Pradeepkumar Mani, Jie Liu, Ashley Flavel, Dave Maltz
|
Distributed Load Management Algorithms in Anycast-based CDNs
|
Submitted to the journal : Computer Networks. Part of the paper
appeared in the 53rd Annual Allerton Conference on Communication, Control and
Computing 2015. arXiv admin note: substantial text overlap with
arXiv:1509.08194
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anycast is an internet addressing protocol where multiple hosts share the
same IP-address. A popular architecture for modern Content Distribution
Networks (CDNs) for geo-replicated services consists of multiple layers of
proxy nodes for service and co-located DNS-servers for load-balancing among
different proxies. Both the proxies and the DNS-servers use anycast addressing,
which offers simplicity of design and high availability of service at the cost
of partial loss of routing control. Due to the very nature of anycast,
redirection actions by a DNS-server also affects loads at nearby proxies in the
network. This makes the problem of optimal distributed load management highly
challenging. In this paper, we propose and evaluate an analytical framework to
formulate and solve the load-management problem in this context. We consider
two distinct algorithms. In the first half of the paper, we pose the
load-management problem as a convex optimization problem. Following a
Kelly-type dual decomposition technique, we propose a fully-distributed
load-management algorithm by introducing FastControl packets. This algorithm
utilizes the underlying anycast mechanism itself to enable effective
coordination among the nodes, thus obviating the need for any external control
channel. In the second half of the paper, we consider an alternative greedy
load-management heuristic, currently in production in a major commercial CDN.
We study its dynamical characteristics and analytically identify its
operational and stability properties. Finally, we critically evaluate both the
algorithms and explore their optimality-vs-complexity trade-off using
trace-driven simulations.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 19:05:47 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Sinha",
"Abhishek",
""
],
[
"Mani",
"Pradeepkumar",
""
],
[
"Liu",
"Jie",
""
],
[
"Flavel",
"Ashley",
""
],
[
"Maltz",
"Dave",
""
]
] |
new_dataset
| 0.99872 |
1603.00431
|
Amirali Sanatinia
|
Amirali Sanatinia, Guevara Noubir
|
On GitHub's Programming Languages
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GitHub is the most widely used social, distributed version control system. It
has around 10 million registered users and hosts over 16 million public
repositories. Its user base is also very active as GitHub ranks in the top 100
Alexa most popular websites. In this study, we collect GitHub's state in its
entirety. Doing so, allows us to study new aspects of the ecosystem. Although
GitHub is the home to millions of users and repositories, the analysis of
users' activity time-series reveals that only around 10% of them can be
considered active. The collected dataset allows us to investigate the
popularity of programming languages and existence of pattens in the relations
between users, repositories, and programming languages.
By, applying a k-means clustering method to the users-repositories commits
matrix, we find that two clear clusters of programming languages separate from
the remaining. One cluster forms for "web programming" languages (Java Script,
Ruby, PHP, CSS), and a second for "system oriented programming" languages (C,
C++, Python). Further classification, allow us to build a phylogenetic tree of
the use of programming languages in GitHub. Additionally, we study the main and
the auxiliary programming languages of the top 1000 repositories in more
detail. We provide a ranking of these auxiliary programming languages using
various metrics, such as percentage of lines of code, and PageRank.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2016 20:03:44 GMT"
}
] | 2016-03-02T00:00:00 |
[
[
"Sanatinia",
"Amirali",
""
],
[
"Noubir",
"Guevara",
""
]
] |
new_dataset
| 0.999512 |
1505.05576
|
Shudi Yang
|
Shudi Yang and Zheng-An Yao
|
The Complete Weight Enumerator of Several Cyclic Codes
|
18 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes have attracted a lot of research interest for decades. In this
paper, for an odd prime $p$, we propose a general strategy to compute the
complete weight enumerator of cyclic codes via the value distribution of the
corresponding exponential sums. As applications of this general strategy, we
determine the complete weight enumerator of several $p$-ary cyclic codes and
give some examples to illustrate our results.
|
[
{
"version": "v1",
"created": "Thu, 21 May 2015 01:23:49 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Sep 2015 09:03:05 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Feb 2016 00:50:13 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Yang",
"Shudi",
""
],
[
"Yao",
"Zheng-An",
""
]
] |
new_dataset
| 0.999074 |
1511.02793
|
Elman Mansimov
|
Elman Mansimov, Emilio Parisotto, Jimmy Lei Ba, Ruslan Salakhutdinov
|
Generating Images from Captions with Attention
|
Published as a conference paper at ICLR 2016
| null | null | null |
cs.LG cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the recent progress in generative models, we introduce a model
that generates images from natural language descriptions. The proposed model
iteratively draws patches on a canvas, while attending to the relevant words in
the description. After training on Microsoft COCO, we compare our model with
several baseline generative models on image generation and retrieval tasks. We
demonstrate that our model produces higher quality samples than other
approaches and generates images with novel scene compositions corresponding to
previously unseen captions in the dataset.
|
[
{
"version": "v1",
"created": "Mon, 9 Nov 2015 18:18:53 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Feb 2016 17:56:29 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Mansimov",
"Elman",
""
],
[
"Parisotto",
"Emilio",
""
],
[
"Ba",
"Jimmy Lei",
""
],
[
"Salakhutdinov",
"Ruslan",
""
]
] |
new_dataset
| 0.990447 |
1602.02445
|
Armin Wei{\ss}
|
Armin Wei{\ss}
|
A Logspace Solution to the Word and Conjugacy problem of Generalized
Baumslag-Solitar Groups
| null | null | null | null |
cs.CC cs.DM math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as
examples for finitely presented non-Hopfian two-generator groups. Since then,
they served as examples for a wide range of purposes. As Baumslag-Solitar
groups are HNN extensions, there is a natural generalization in terms of graph
of groups.
Concerning algorithmic aspects of generalized Baumslag-Solitar groups,
several decidability results are known. Indeed, a straightforward application
of standard algorithms leads to a polynomial time solution of the word problem
(the question whether some word over the generators represents the identity of
the group). The conjugacy problem (the question whether two given words
represent conjugate group elements) is more complicated; still decidability has
been established by Anshel and Stebe for ordinary Baumslag-Solitar groups and
for generalized Baumslag-Solitar groups independently by Lockhart and Beeker.
However, up to now no precise complexity estimates have been given.
In this work, we give a LOGSPACE algorithm for both problems. More precisely,
we describe a uniform TC^0 many-one reduction of the word problem to the word
problem of the free group. Then we refine the known techniques for the
conjugacy problem and show that it can be solved in LOGSPACE. Moreover, for
ordinary Baumslag-Solitar groups also conjugacy is AC^0-Turing-reducible to the
word problem of the free group.
Finally, we consider uniform versions (where also the graph of groups is part
of the input) of both word and conjugacy problem: while the word problem still
is solvable in LOGSPACE, the conjugacy problem becomes EXPSPACE-complete.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 01:07:24 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Feb 2016 02:43:38 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Weiß",
"Armin",
""
]
] |
new_dataset
| 0.994062 |
1602.08668
|
Jean-Marc Valin
|
Jean-Marc Valin
|
Speex: A Free Codec For Free Speech
|
Presented at linux.conf.au 2006, Dunedin. 8 pages
| null | null | null |
cs.SD
|
http://creativecommons.org/licenses/by/4.0/
|
The Speex project has been started in 2002 to address the need for a free,
open-source speech codec. Speex is based on the Code Excited Linear Prediction
(CELP) algorithm and, unlike the previously existing Vorbis codec, is optimised
for transmitting speech for low latency communication over an unreliable packet
network. This paper presents an overview of Speex, the technology involved in
it and how it can be used in applications. The most recent developments in
Speex, such as the fixed-point port, acoustic echo cancellation and noise
suppression are also addressed.
|
[
{
"version": "v1",
"created": "Sun, 28 Feb 2016 04:38:33 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Valin",
"Jean-Marc",
""
]
] |
new_dataset
| 0.999312 |
1602.08791
|
Vijay Gadepally
|
Vijay Gadepally, Jennie Duggan, Aaron Elmore, Jeremy Kepner, Samuel
Madden, Tim Mattson, Michael Stonebraker
|
The BigDAWG Architecture
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BigDAWG is a polystore system designed to work on complex problems that
naturally span across different processing or storage engines. BigDAWG provides
an architecture that supports diverse database systems working with different
data models, support for the competing notions of location transparency and
semantic completeness via islands of information and a middleware that provides
a uniform multi-island interface. In this article, we describe the current
architecture of BigDAWG, its application on the MIMIC II medical dataset, and
our plans for the mechanics of cross-system queries. During the presentation,
we will also deliver a brief demonstration of the current version of BigDAWG.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 00:49:11 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Gadepally",
"Vijay",
""
],
[
"Duggan",
"Jennie",
""
],
[
"Elmore",
"Aaron",
""
],
[
"Kepner",
"Jeremy",
""
],
[
"Madden",
"Samuel",
""
],
[
"Mattson",
"Tim",
""
],
[
"Stonebraker",
"Michael",
""
]
] |
new_dataset
| 0.999675 |
1602.08855
|
Corneliu Florea
|
Corneliu Florea, Razvan Condorovici, Constantin Vertan, Raluca Boia,
Laura Florea, Ruxandra Vranceanu
|
Pandora: Description of a Painting Database for Art Movement Recognition
with Baselines and Perspectives
|
11 pages, 1 figure, 6 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To facilitate computer analysis of visual art, in the form of paintings, we
introduce Pandora (Paintings Dataset for Recognizing the Art movement)
database, a collection of digitized paintings labelled with respect to the
artistic movement. Noting that the set of databases available as benchmarks for
evaluation is highly reduced and most existing ones are limited in variability
and number of images, we propose a novel large scale dataset of digital
paintings. The database consists of more than 7700 images from 12 art
movements. Each genre is illustrated by a number of images varying from 250 to
nearly 1000. We investigate how local and global features and classification
systems are able to recognize the art movement. Our experimental results
suggest that accurate recognition is achievable by a combination of various
categories.To facilitate computer analysis of visual art, in the form of
paintings, we introduce Pandora (Paintings Dataset for Recognizing the Art
movement) database, a collection of digitized paintings labelled with respect
to the artistic movement. Noting that the set of databases available as
benchmarks for evaluation is highly reduced and most existing ones are limited
in variability and number of images, we propose a novel large scale dataset of
digital paintings. The database consists of more than 7700 images from 12 art
movements. Each genre is illustrated by a number of images varying from 250 to
nearly 1000. We investigate how local and global features and classification
systems are able to recognize the art movement. Our experimental results
suggest that accurate recognition is achievable by a combination of various
categories.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 08:24:01 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Florea",
"Corneliu",
""
],
[
"Condorovici",
"Razvan",
""
],
[
"Vertan",
"Constantin",
""
],
[
"Boia",
"Raluca",
""
],
[
"Florea",
"Laura",
""
],
[
"Vranceanu",
"Ruxandra",
""
]
] |
new_dataset
| 0.999832 |
1602.09067
|
Michael Madaio
|
Michael Madaio, Shang-Tse Chen, Oliver L. Haimson, Wenwen Zhang, Xiang
Cheng, Matthew Hinds-Aldrich, Duen Horng Chau, Bistra Dilkina
|
Firebird: Predicting Fire Risk and Prioritizing Fire Inspections in
Atlanta
|
10 pages, 4 figures, submitted to KDD 2016
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Atlanta Fire Rescue Department (AFRD), like many municipal fire
departments, actively works to reduce fire risk by inspecting commercial
properties for potential hazards and fire code violations. However, AFRD's fire
inspection practices relied on tradition and intuition, with no existing
data-driven process for prioritizing fire inspections or identifying new
properties requiring inspection. In collaboration with AFRD, we developed the
Firebird framework to help municipal fire departments identify and prioritize
commercial property fire inspections, using machine learning, geocoding, and
information visualization. Firebird computes fire risk scores for over 5,000
buildings in the city, with true positive rates of up to 71% in predicting
fires. It has identified 6,096 new potential commercial properties to inspect,
based on AFRD's criteria for inspection. Furthermore, through an interactive
map, Firebird integrates and visualizes fire incidents, property information
and risk scores to help AFRD make informed decisions about fire inspections.
Firebird has already begun to make positive impact at both local and national
levels. It is improving AFRD's inspection processes and Atlanta residents'
safety, and was highlighted by National Fire Protection Association (NFPA) as a
best practice for using data to inform fire inspections.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 17:48:41 GMT"
}
] | 2016-03-01T00:00:00 |
[
[
"Madaio",
"Michael",
""
],
[
"Chen",
"Shang-Tse",
""
],
[
"Haimson",
"Oliver L.",
""
],
[
"Zhang",
"Wenwen",
""
],
[
"Cheng",
"Xiang",
""
],
[
"Hinds-Aldrich",
"Matthew",
""
],
[
"Chau",
"Duen Horng",
""
],
[
"Dilkina",
"Bistra",
""
]
] |
new_dataset
| 0.997969 |
1305.7383
|
Antonio Villani
|
Roberto Di Pietro, Flavio Lombardi, Antonio Villani
|
CUDA Leaks: Information Leakage in GPU Architectures
| null | null |
10.1145/2801153
| null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graphics Processing Units (GPUs) are deployed on most present server,
desktop, and even mobile platforms. Nowadays, a growing number of applications
leverage the high parallelism offered by this architecture to speed-up general
purpose computation. This phenomenon is called GPGPU computing (General Purpose
GPU computing). The aim of this work is to discover and highlight security
issues related to CUDA, the most widespread platform for GPGPU computing. In
particular, we provide details and proofs-of-concept about a novel set of
vulnerabilities CUDA architectures are subject to, that could be exploited to
cause severe information leak. Following (detailed) intuitions rooted on sound
engineering security, we performed several experiments targeting the last two
generations of CUDA devices: Fermi and Kepler. We discovered that these two
families do suffer from information leakage vulnerabilities. In particular,
some vulnerabilities are shared between the two architectures, while others are
idiosyncratic of the Kepler architecture. As a case study, we report the impact
of one of these vulnerabilities on a GPU implementation of the AES encryption
algorithm. We also suggest software patches and alternative approaches to
tackle the presented vulnerabilities. To the best of our knowledge this is the
first work showing that information leakage in CUDA is possible using just
standard CUDA instructions. We expect our work to pave the way for further
research in the field.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 12:57:56 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Jul 2013 14:55:46 GMT"
}
] | 2016-02-29T00:00:00 |
[
[
"Di Pietro",
"Roberto",
""
],
[
"Lombardi",
"Flavio",
""
],
[
"Villani",
"Antonio",
""
]
] |
new_dataset
| 0.977783 |
1602.07235
|
Manuel Wettstein
|
Manuel Wettstein
|
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers
|
Added affiliation. Fixed typos
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The d-dimensional Catalan numbers form a well-known sequence of numbers which
count balanced bracket expressions over an alphabet of size d. In this paper,
we introduce and study what we call d-dimensional prime Catalan numbers, a
sequence of numbers which count only a very specific subset of indecomposable
balanced bracket expressions.
We further introduce the notion of a trapezoidal diagram of a crossing-free
geometric graph, such as a triangulation or a crossing-free perfect matching.
In essence, such a diagram is obtained by augmenting the geometric graph in
question with its trapezoidal decomposition, and then forgetting about the
precise coordinates of individual vertices while preserving the vertical
visibility relations between vertices and segments. We note that trapezoidal
diagrams of triangulations are closely related to abstract upward
triangulations.
We study the numbers of such diagrams in the cases of (i) perfect matchings
and (ii) triangulations. We give bijective proofs which establish relations
with 3-dimensional (prime) Catalan numbers. This allows us to determine the
corresponding exponential growth rates exactly as (i) 5.196^n and (ii) 23.459^n
(bases are rounded to 3 decimal places).
Finally, we give lower bounds for the maximum number of embeddings of a
trapezoidal diagram on any given point set.
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2016 17:02:53 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Feb 2016 12:02:35 GMT"
}
] | 2016-02-29T00:00:00 |
[
[
"Wettstein",
"Manuel",
""
]
] |
new_dataset
| 0.998736 |
1602.08141
|
Thomas Castelli
|
Thomas Castelli, Aidean Sharghi, Don Harper, Alain Tremeau and Mubarak
Shah
|
Autonomous navigation for low-altitude UAVs in urban areas
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, consumer Unmanned Aerial Vehicles have become very popular,
everyone can buy and fly a drone without previous experience, which raises
concern in regards to regulations and public safety. In this paper, we present
a novel approach towards enabling safe operation of such vehicles in urban
areas. Our method uses geodetically accurate dataset images with Geographical
Information System (GIS) data of road networks and buildings provided by Google
Maps, to compute a weighted A* shortest path from start to end locations of a
mission. Weights represent the potential risk of injuries for individuals in
all categories of land-use, i.e. flying over buildings is considered safer than
above roads. We enable safe UAV operation in regards to 1- land-use by
computing a static global path dependent on environmental structures, and 2-
avoiding flying over moving objects such as cars and pedestrians by dynamically
optimizing the path locally during the flight. As all input sources are first
geo-registered, pixels and GPS coordinates are equivalent, it therefore allows
us to generate an automated and user-friendly mission with GPS waypoints
readable by consumer drones' autopilots. We simulated 54 missions and show
significant improvement in maximizing UAV's standoff distance to moving objects
with a quantified safety parameter over 40 times better than the naive straight
line navigation.
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2016 22:43:14 GMT"
}
] | 2016-02-29T00:00:00 |
[
[
"Castelli",
"Thomas",
""
],
[
"Sharghi",
"Aidean",
""
],
[
"Harper",
"Don",
""
],
[
"Tremeau",
"Alain",
""
],
[
"Shah",
"Mubarak",
""
]
] |
new_dataset
| 0.997194 |
1506.07577
|
Gilbert Bernstein
|
Gilbert Louis Bernstein, Chinmayee Shah, Crystal Lemire, Zachary
DeVito, Matthew Fisher, Philip Levis, Pat Hanrahan
|
Ebb: A DSL for Physical Simulation on CPUs and GPUs
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing programming environments for physical simulation is challenging
because simulations rely on diverse algorithms and geometric domains. These
challenges are compounded when we try to run efficiently on heterogeneous
parallel architectures. We present Ebb, a domain-specific language (DSL) for
simulation, that runs efficiently on both CPUs and GPUs. Unlike previous DSLs,
Ebb uses a three-layer architecture to separate (1) simulation code, (2)
definition of data structures for geometric domains, and (3) runtimes
supporting parallel architectures. Different geometric domains are implemented
as libraries that use a common, unified, relational data model. By structuring
the simulation framework in this way, programmers implementing simulations can
focus on the physics and algorithms for each simulation without worrying about
their implementation on parallel computers. Because the geometric domain
libraries are all implemented using a common runtime based on relations, new
geometric domains can be added as needed, without specifying the details of
memory management, mapping to different parallel architectures, or having to
expand the runtime's interface.
We evaluate Ebb by comparing it to several widely used simulations,
demonstrating comparable performance to hand-written GPU code where available,
and surpassing existing CPU performance optimizations by up to 9$\times$ when
no GPU code exists.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 22:32:41 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Jan 2016 02:25:31 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Feb 2016 23:42:30 GMT"
}
] | 2016-02-26T00:00:00 |
[
[
"Bernstein",
"Gilbert Louis",
""
],
[
"Shah",
"Chinmayee",
""
],
[
"Lemire",
"Crystal",
""
],
[
"DeVito",
"Zachary",
""
],
[
"Fisher",
"Matthew",
""
],
[
"Levis",
"Philip",
""
],
[
"Hanrahan",
"Pat",
""
]
] |
new_dataset
| 0.999231 |
1602.00377
|
Farhad Akhoundi
|
Farhad Akhoundi, Mohammad Vahid Jamali, Navid Banihassan, Hamzeh
Beyranvand, Amir Minoofar, Jawad A. Salehi
|
Cellular Underwater Wireless Optical CDMA Network: Potentials and
Challenges
|
11 pages, 10 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Underwater wireless optical communications is an emerging solution to the
expanding demand for broadband links in oceans and seas. In this paper, a
cellular underwater wireless optical code division multiple-access (UW-OCDMA)
network is proposed to provide broadband links for commercial and military
applications. The optical orthogonal codes (OOC) are employed as signature
codes of underwater mobile users. Fundamental key aspects of the network such
as its backhaul architecture, its potential applications and its design
challenges are presented. In particular, the proposed network is used as
infrastructure of centralized, decentralized and relay-assisted underwater
sensor networks for high-speed real-time monitoring. Furthermore, a promising
underwater localization and positioning scheme based on this cellular network
is presented. Finally, probable design challenges such as cell edge coverage,
blockage avoidance, power control and increasing the network capacity are
addressed.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2016 03:26:32 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Feb 2016 02:35:28 GMT"
}
] | 2016-02-26T00:00:00 |
[
[
"Akhoundi",
"Farhad",
""
],
[
"Jamali",
"Mohammad Vahid",
""
],
[
"Banihassan",
"Navid",
""
],
[
"Beyranvand",
"Hamzeh",
""
],
[
"Minoofar",
"Amir",
""
],
[
"Salehi",
"Jawad A.",
""
]
] |
new_dataset
| 0.998293 |
1602.06977
|
Ethan Fast
|
Ethan Fast, William McGrath, Pranav Rajpurkar, Michael Bernstein
|
Augur: Mining Human Behaviors from Fiction to Power Interactive Systems
|
CHI: ACM Conference on Human Factors in Computing Systems 2016
| null |
10.1145/2858036.2858528
| null |
cs.HC cs.AI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From smart homes that prepare coffee when we wake, to phones that know not to
interrupt us during important conversations, our collective visions of HCI
imagine a future in which computers understand a broad range of human
behaviors. Today our systems fall short of these visions, however, because this
range of behaviors is too large for designers or programmers to capture
manually. In this paper, we instead demonstrate it is possible to mine a broad
knowledge base of human behavior by analyzing more than one billion words of
modern fiction. Our resulting knowledge base, Augur, trains vector models that
can predict many thousands of user activities from surrounding objects in
modern contexts: for example, whether a user may be eating food, meeting with a
friend, or taking a selfie. Augur uses these predictions to identify actions
that people commonly take on objects in the world and estimate a user's future
activities given their current situation. We demonstrate Augur-powered,
activity-based systems such as a phone that silences itself when the odds of
you answering it are low, and a dynamic music player that adjusts to your
present activity. A field deployment of an Augur-powered wearable camera
resulted in 96% recall and 71% precision on its unsupervised predictions of
common daily activities. A second evaluation where human judges rated the
system's predictions over a broad set of input images found that 94% were rated
sensible.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 21:44:05 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Feb 2016 20:54:28 GMT"
}
] | 2016-02-26T00:00:00 |
[
[
"Fast",
"Ethan",
""
],
[
"McGrath",
"William",
""
],
[
"Rajpurkar",
"Pranav",
""
],
[
"Bernstein",
"Michael",
""
]
] |
new_dataset
| 0.98893 |
1602.07736
|
Yiming Wan
|
Yiming Wan, Tamas Keviczky, Michel Verhaegen
|
Robust Air Data Sensor Fault Diagnosis With Enhanced Fault Sensitivity
Using Moving Horizon Estimation
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates robust fault diagnosis of multiple air data sensor
faults in the presence of winds. The trade-off between robustness to winds and
sensitivity to faults is challenging due to simultaneous influence of winds and
latent faults on monitored sensors. Different from conventional residual
generators that do not consider any constraints, we propose a constrained
residual generator using moving horizon estimation. The main contribution is
improved fault sensitivity by exploiting known bounds on winds in residual
generation. By analyzing the Karush-Kuhn-Tucker conditions of the formulated
moving horizon estimation problem, it is shown that this improvement is
attributed to active inequality constraints caused by faults. When the
weighting matrices in the moving horizon estimation problem are tuned to
increase robustness to winds, its fault sensitivity does not simply decrease as
one would expect in conventional unconstrained residual generators. Instead,
its fault sensitivity increases when the fault is large enough to activate some
inequality constraints. This fault sensitivity improvement is not restricted to
this particular application, but can be achieved by any general moving horizon
estimation based residual generator. A high-fidelity Airbus simulator is used
to illustrate the advantage of our proposed approach in terms of fault
sensitivity.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 22:27:53 GMT"
}
] | 2016-02-26T00:00:00 |
[
[
"Wan",
"Yiming",
""
],
[
"Keviczky",
"Tamas",
""
],
[
"Verhaegen",
"Michel",
""
]
] |
new_dataset
| 0.995347 |
1602.07767
|
Eric Hamke
|
Eric E. Hamke, Ramiro Jordan, Manel Ramon-Martinez
|
Breath Activity Detection Algorithm
| null | null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report describes the use of a support vector machines with a novel
kernel, to determine the breathing rate and inhalation duration of a fire
fighter wearing a Self-Contained Breathing Apparatus. With this information, an
incident commander can monitor the firemen in his command for exhaustion and
ensure timely rotation of personnel to ensure overall fire fighter safety
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2016 01:41:34 GMT"
}
] | 2016-02-26T00:00:00 |
[
[
"Hamke",
"Eric E.",
""
],
[
"Jordan",
"Ramiro",
""
],
[
"Ramon-Martinez",
"Manel",
""
]
] |
new_dataset
| 0.977877 |
1305.4508
|
Abidin Kaya
|
Abidin Kaya, Bahattin Yildiz, \.Irfan Siap
|
Quadratic Residue Codes over F_p+vF_p and their Gray Images
|
research article, under review since November 2012
|
Journal of Pure and Applied Algebra Volume 218 Issue 11 2014
|
10.1016/j.jpaa.2014.03.002
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper quadratic residue codes over the ring Fp + vFp are introduced
in terms of their idempotent generators. The structure of these codes is
studied and it is observed that these codes share similar properties with
quadratic residue codes over finite fields. For the case p = 2, Euclidean and
Hermitian self-dual families of codes as extended quadratic residue codes are
considered and two optimal Hermitian self-dual codes are obtained as examples.
Moreover, a substantial number of good p-ary codes are obtained as images of
quadratic residue codes over Fp +vFp in the cases where p is an odd prime.
These results are presented in tables.
|
[
{
"version": "v1",
"created": "Mon, 20 May 2013 12:00:40 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Kaya",
"Abidin",
""
],
[
"Yildiz",
"Bahattin",
""
],
[
"Siap",
"İrfan",
""
]
] |
new_dataset
| 0.998725 |
1308.0580
|
Abidin Kaya
|
Abidin Kaya, Bahattin Yildiz, and Irfan Siap
|
New extremal binary self-dual codes of length 68 from quadratic residue
codes over f_2+uf_2+u^2f_2
|
Under review
|
Finite Fileds and Their Applications Volume 29 2014
|
10.1016/j.ffa.2014.04.009
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 =
u are considered. A duality and distance preserving Gray map from F2 + uF2 +
u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic
bordered double circulant constructions and their extensions self- dual codes
of different lengths are obtained. As Gray images of these codes and their
extensions, a substantial number of new extremal self-dual binary codes are
found. More precisely, thirty two new extremal binary self-dual codes of length
68, 363 Type I codes of parameters [72; 36; 12], a Type II [72; 36; 12] code
and a Type II [96; 48; 16] code with new weight enumerators are obtained
through these constructions. The results are tabulated.
|
[
{
"version": "v1",
"created": "Fri, 2 Aug 2013 18:56:23 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Dec 2013 13:16:10 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Kaya",
"Abidin",
""
],
[
"Yildiz",
"Bahattin",
""
],
[
"Siap",
"Irfan",
""
]
] |
new_dataset
| 0.989192 |
1511.00849
|
Sebastian van de Hoef
|
Sebastian van de Hoef, Karl H. Johansson, Dimos V. Dimarogonas
|
Computing Feasible Vehicle Platooning Opportunities for Transport
Assignments
|
6 pages, 2 figures, to appear in CTS 2016, 14-th IFAC Symposium on
Control in Transportation Systems
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicle platooning facilitates the partial automation of vehicles and can
significantly reduce fuel consumption. Mobile communication infrastructure
makes it possible to dynamically coordinate the formation of platoons en route.
We consider a centralized system that provides trucks with routes and speed
profiles allowing them to dynamically form platoons during their journeys. For
this to work, all possible pairs of vehicles that can platoon based on their
location, destination, and other constraints have to be identified. The
presented approach scales well to large vehicle fleets and realistic road
networks by extracting features from the transport assignments of the vehicles
and rules out a majority of possible pairs based on these features only. Merely
a small number of remaining pairs are considered in depth by a complete and
computationally expensive algorithm. This algorithm conclusively decides if
platooning is possible for a pair based on the complete data associated with
the two vehicles. We derive appropriate features for the problem and
demonstrate the effectiveness of the approach in a simulation example.
|
[
{
"version": "v1",
"created": "Tue, 3 Nov 2015 10:37:49 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Feb 2016 09:13:32 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"van de Hoef",
"Sebastian",
""
],
[
"Johansson",
"Karl H.",
""
],
[
"Dimarogonas",
"Dimos V.",
""
]
] |
new_dataset
| 0.986995 |
1511.07345
|
Shu Sun Ms.
|
Shu Sun, George R. MacCartney Jr., Theodore S. Rappaport
|
Millimeter-Wave Distance-Dependent Large-Scale Propagation Measurements
and Path Loss Models for Outdoor and Indoor 5G Systems
|
in the 10th European Conference on Antennas and Propagation, Davos,
Switzerland, April 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents millimeter-wave propagation measurements for urban
micro-cellular and indoor office scenarios at 28 GHz and 73 GHz, and
investigates the corresponding path loss using five types of path loss models,
the singlefrequency floating-intercept (FI) model, single-frequency closein
(CI) free space reference distance model, multi-frequency alpha-beta-gamma
(ABG) model, multi-frequency CI model, and multi-frequency CI model with a
frequency-weighted path loss exponent (CIF), in both line-of-sight and
non-line-of-sight environments. Results show that the CI and CIF models provide
good estimation and exhibit stable behavior over frequencies and distances,
with a solid physical basis and less computational complexity when compared
with the FI and ABG models. Furthermore, path loss in outdoor scenarios shows
little dependence on frequency beyond the first meter of free space
propagation, whereas path loss tends to increase with frequency in addition to
the increased free space path loss in indoor environments. Therefore, the CI
model is suitable for outdoor environments over multiple frequencies, while the
CIF model is more appropriate for indoor modeling. This work shows that both
the CI and CIF models use fewer parameters and offer more convenient closedform
expressions suitable for analysis, without compromising model accuracy when
compared to current 3GPP and WINNER path loss models.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 18:14:07 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Nov 2015 20:57:44 GMT"
},
{
"version": "v3",
"created": "Sun, 31 Jan 2016 21:49:07 GMT"
},
{
"version": "v4",
"created": "Wed, 24 Feb 2016 00:31:44 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Sun",
"Shu",
""
],
[
"MacCartney",
"George R.",
"Jr."
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.998189 |
1601.06923
|
Nevin L. Zhang
|
Chen Fu, Nevin L. Zhang, Bao Xin Chen, Zhou Rong Chen, Xiang Lan Jin,
Rong Juan Guo, Zhi Gang Chen, Yun Ling Zhang
|
Identification and classification of TCM syndrome types among patients
with vascular mild cognitive impairment using latent tree analysis
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objective: To treat patients with vascular mild cognitive impairment (VMCI)
using TCM, it is necessary to classify the patients into TCM syndrome types and
to apply different treatments to different types. We investigate how to
properly carry out the classification using a novel data-driven method known as
latent tree analysis.
Method: A cross-sectional survey on VMCI was carried out in several regions
in northern China from 2008 to 2011, which resulted in a data set that involves
803 patients and 93 symptoms. Latent tree analysis was performed on the data to
reveal symptom co-occurrence patterns, and the patients were partitioned into
clusters in multiple ways based on the patterns. The patient clusters were
matched up with syndrome types, and population statistics of the clusters are
used to quantify the syndrome types and to establish classification rules.
Results: Eight syndrome types are identified: Qi Deficiency, Qi Stagnation,
Blood Deficiency, Blood Stasis, Phlegm-Dampness, Fire-Heat, Yang Deficiency,
and Yin Deficiency. The prevalence and symptom occurrence characteristics of
each syndrome type are determined. Quantitative classification rules are
established for determining whether a patient belongs to each of the syndrome
types.
Conclusions: A solution for the TCM syndrome classification problem
associated with VMCI is established based on the latent tree analysis of
unlabeled symptom survey data. The results can be used as a reference in clinic
practice to improve the quality of syndrome differentiation and to reduce
diagnosis variances across physicians. They can also be used for patient
selection in research projects aimed at finding biomarkers for the syndrome
types and in randomized control trials aimed at determining the efficacy of TCM
treatments of VMCI.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2016 08:34:56 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Feb 2016 16:04:24 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Fu",
"Chen",
""
],
[
"Zhang",
"Nevin L.",
""
],
[
"Chen",
"Bao Xin",
""
],
[
"Chen",
"Zhou Rong",
""
],
[
"Jin",
"Xiang Lan",
""
],
[
"Guo",
"Rong Juan",
""
],
[
"Chen",
"Zhi Gang",
""
],
[
"Zhang",
"Yun Ling",
""
]
] |
new_dataset
| 0.970952 |
1602.07340
|
Krispin Davies
|
Krispin Davies, Alejandro Ramirez-Serrano
|
A Reconfigurable USAR Robot Designed for Traversing Complex 3D Terrain
| null |
Proceedings of 22nd Canadian Congress of Applied Mechanics
(CANCAM2009), vol. 1, pp. 209-210
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of robotics in Urban Search and Rescue (USAR) is growing steadily
from their initial inception during the 2001 World Trade Centre incident.
Despite years of progress, the core design of robots currently in use for USAR
purposes has deviated little, favoring software and control development and
optimization of the basic robot template to improve performance instead.
Presented here is a novel design description of the Cricket, an advanced robot
with a broader range of physical capabilities than traditional USAR robots. By
incorporating the tracked structure of earlier robots, appreciated for energy
efficiency and robustness, into a multi-limbed walking design, the Cricket
enables the use of advanced locomotion techniques. The ability to climb over
obstacles many times the height of the robot, ascend vertical shafts without
the assistance of a tether, and traverse rough and near vertical terrain
improves the Cricket's capability to successfully locate victims in confined
spaces.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 06:16:41 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Davies",
"Krispin",
""
],
[
"Ramirez-Serrano",
"Alejandro",
""
]
] |
new_dataset
| 0.999861 |
1602.07383
|
Weiguang Ding
|
Weiguang Ding, Graham Taylor
|
Automatic Moth Detection from Trap Images for Pest Management
|
Preprints accepted by Computers and electronics in agriculture
| null | null | null |
cs.CV cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monitoring the number of insect pests is a crucial component in
pheromone-based pest management systems. In this paper, we propose an automatic
detection pipeline based on deep learning for identifying and counting pests in
images taken inside field traps. Applied to a commercial codling moth dataset,
our method shows promising performance both qualitatively and quantitatively.
Compared to previous attempts at pest detection, our approach uses no
pest-specific engineering which enables it to adapt to other species and
environments with minimal human effort. It is amenable to implementation on
parallel hardware and therefore capable of deployment in settings where
real-time performance is required.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 03:35:42 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Ding",
"Weiguang",
""
],
[
"Taylor",
"Graham",
""
]
] |
new_dataset
| 0.951072 |
1602.07407
|
Fatemeh Keshavarz-Kohjerdi
|
Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri
|
Hamiltonian Paths in C-shaped Grid Graphs
|
28 pages, 31 figures, and 20 references
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the Hamiltonian path problem in C-shaped grid graphs, and present
the necessary and sufficient conditions for the existence of a Hamiltonian path
between two given vertices in these graphs. We also give a linear-time
algorithm for finding a Hamiltonian path between two given vertices of a
C-shaped grid graph, if it exists.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 06:05:53 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Keshavarz-Kohjerdi",
"Fatemeh",
""
],
[
"Bagheri",
"Alireza",
""
]
] |
new_dataset
| 0.992908 |
1602.07504
|
Petr Golovach
|
Petr A. Golovach, Pinar Heggernes and Dieter Kratsch
|
Enumeration and Maximum Number of Minimal Connected Vertex Covers in
Graphs
| null | null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Connected Vertex Cover is one of the classical problems of computer science,
already mentioned in the monograph of Garey and Johnson. Although the
optimization and decision variants of finding connected vertex covers of
minimum size or weight are well studied, surprisingly there is no work on the
enumeration or maximum number of minimal connected vertex covers of a graph. In
this paper we show that the maximum number of minimal connected vertex covers
of a graph is at most 1.8668^n, and these can be enumerated in time
O(1.8668^n). For graphs of chordality at most 5, we are able to give a better
upper bound, and for chordal graphs and distance-hereditary graphs we are able
to give tight bounds on the maximum number of minimal connected vertex covers.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 13:50:01 GMT"
}
] | 2016-02-25T00:00:00 |
[
[
"Golovach",
"Petr A.",
""
],
[
"Heggernes",
"Pinar",
""
],
[
"Kratsch",
"Dieter",
""
]
] |
new_dataset
| 0.998965 |
1501.05387
|
Yangzihao Wang
|
Yangzihao Wang, Andrew Davidson, Yuechao Pan, Yuduo Wu, Andy Riffel,
and John D. Owens
|
Gunrock: A High-Performance Graph Processing Library on the GPU
|
14 pages, accepted by PPoPP'16 (removed the text repetition in the
previous version v5)
| null |
10.1145/2851141.2851145
| null |
cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
For large-scale graph analytics on the GPU, the irregularity of data access
and control flow, and the complexity of programming GPUs have been two
significant challenges for developing a programmable high-performance graph
library. "Gunrock", our graph-processing system designed specifically for the
GPU, uses a high-level, bulk-synchronous, data-centric abstraction focused on
operations on a vertex or edge frontier. Gunrock achieves a balance between
performance and expressiveness by coupling high performance GPU computing
primitives and optimization strategies with a high-level programming model that
allows programmers to quickly develop new graph primitives with small code size
and minimal GPU programming knowledge. We evaluate Gunrock on five key graph
primitives and show that Gunrock has on average at least an order of magnitude
speedup over Boost and PowerGraph, comparable performance to the fastest GPU
hardwired primitives, and better performance than any other GPU high-level
graph library.
|
[
{
"version": "v1",
"created": "Thu, 22 Jan 2015 04:21:53 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 21:10:00 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Sep 2015 08:11:02 GMT"
},
{
"version": "v4",
"created": "Wed, 14 Oct 2015 03:50:54 GMT"
},
{
"version": "v5",
"created": "Sat, 23 Jan 2016 01:34:16 GMT"
},
{
"version": "v6",
"created": "Mon, 22 Feb 2016 22:40:09 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Wang",
"Yangzihao",
""
],
[
"Davidson",
"Andrew",
""
],
[
"Pan",
"Yuechao",
""
],
[
"Wu",
"Yuduo",
""
],
[
"Riffel",
"Andy",
""
],
[
"Owens",
"John D.",
""
]
] |
new_dataset
| 0.973912 |
1507.01628
|
Abidin Kaya
|
Abidin Kaya, Bahattin Yildiz and Abdullah Pa\c{s}a
|
New extremal binary self-dual codes from a modified four circulant
construction
|
7 tables
|
Discrete Mathematics Vol 338 Issue 3 2016
|
10.1016/j.disc.2015.09.010
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a modified four circulant construction for self-dual
codes and a bordered version of the construction using the properties of
\lambda-circulant and \lambda-reverse circulant matrices. By using the
constructions on $F_2$, we obtain new binary codes of lengths 64 and 68. We
also apply the constructions to the ring $R_2$ and considering the $F_2$ and
$R_1$-extensions, we obtain new singly-even extremal binary self-dual codes of
lengths 66 and 68. More precisely, we find 3 new codes of length 64, 15 new
codes of length 66 and 22 new codes of length 68. These codes all have weight
enumerators with parameters that were not known to exist in the literature.
|
[
{
"version": "v1",
"created": "Mon, 6 Jul 2015 21:34:56 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Kaya",
"Abidin",
""
],
[
"Yildiz",
"Bahattin",
""
],
[
"Paşa",
"Abdullah",
""
]
] |
new_dataset
| 0.967388 |
1511.00394
|
Francis Bach
|
Francis Bach (LIENS, SIERRA)
|
Submodular Functions: from Discrete to Continous Domains
| null | null | null | null |
cs.LG math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Submodular set-functions have many applications in combinatorial
optimization, as they can be minimized and approximately maximized in
polynomial time. A key element in many of the algorithms and analyses is the
possibility of extending the submodular set-function to a convex function,
which opens up tools from convex optimization. Submodularity goes beyond
set-functions and has naturally been considered for problems with multiple
labels or for functions defined on continuous domains, where it corresponds
essentially to cross second-derivatives being nonpositive. In this paper, we
show that most results relating submodularity and convexity for set-functions
can be extended to all submodular functions. In particular, (a) we naturally
define a continuous extension in a set of probability measures, (b) show that
the extension is convex if and only if the original function is submodular, (c)
prove that the problem of minimizing a submodular function is equivalent to a
typically non-smooth convex optimization problem, and (d) propose another
convex optimization problem with better computational properties (e.g., a
smooth dual problem). Most of these extensions from the set-function situation
are obtained by drawing links with the theory of multi-marginal optimal
transport, which provides also a new interpretation of existing results for
set-functions. We then provide practical algorithms to minimize generic
submodular functions on discrete domains, with associated convergence rates.
|
[
{
"version": "v1",
"created": "Mon, 2 Nov 2015 06:33:59 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Feb 2016 19:46:11 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Bach",
"Francis",
"",
"LIENS, SIERRA"
]
] |
new_dataset
| 0.992993 |
1601.08049
|
Juan Gorraiz
|
Juan Gorraiz, Martin Wieland and Christian Gumpenberger
|
Individual Bibliometric Assessment @ University of Vienna: From Numbers
to Multidimensional Profiles
|
Preprint
| null |
10.5281/zenodo.45402
| null |
cs.DL
|
http://creativecommons.org/licenses/by/4.0/
|
This paper shows how bibliometric assessment can be implemented at individual
level. This has been successfully done at the University of Vienna carried out
by the Bibliometrics and Publication Strategies Department of the Vienna
University Library. According to the department's philosophy, bibliometrics is
not only a helpful evaluation instrument in order to complement the peer review
system. It is also meant as a compass for researchers in the "publish or
perish" dilemma in order to increase general visibility and to optimize
publication strategies. The individual assessment comprises of an interview
with the researcher under evaluation, the elaboration of a bibliometric report
of the researcher's publication output, the discussion and validation of the
obtained results with the researcher under evaluation as well as further
optional analyses. The produced bibliometric reports are provided to the
researchers themselves and inform them about the quantitative aspects of their
research output. They also serve as a basis for further discussion concerning
their publication strategies. These reports are eventually intended for
informed peer review practices, and are therefore forwarded to the quality
assurance and the rector's office and finally sent to the peers. The most
important feature of the generated bibliometric report is its multidimensional
and individual character. It relies on a variety of basic indicators and
further control parameters in order to foster comprehensibility. Researchers,
administrative staff and peers alike have confirmed the usefulness of this
bibliometric approach. An increasing demand is noticeable. In total, 33
bibliometric reports have been delivered so far. Moreover, similar reports have
also been produced for the bibliometric assessment of two faculties with great
success.
|
[
{
"version": "v1",
"created": "Fri, 29 Jan 2016 10:54:56 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Feb 2016 12:45:12 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Gorraiz",
"Juan",
""
],
[
"Wieland",
"Martin",
""
],
[
"Gumpenberger",
"Christian",
""
]
] |
new_dataset
| 0.987347 |
1602.06979
|
Ethan Fast
|
Ethan Fast, Binbin Chen, Michael Bernstein
|
Empath: Understanding Topic Signals in Large-Scale Text
|
CHI: ACM Conference on Human Factors in Computing Systems 2016
| null |
10.1145/2858036.2858535
| null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human language is colored by a broad range of topics, but existing text
analysis tools only focus on a small number of them. We present Empath, a tool
that can generate and validate new lexical categories on demand from a small
set of seed terms (like "bleed" and "punch" to generate the category violence).
Empath draws connotations between words and phrases by deep learning a neural
embedding across more than 1.8 billion words of modern fiction. Given a small
set of seed words that characterize a category, Empath uses its neural
embedding to discover new related terms, then validates the category with a
crowd-powered filter. Empath also analyzes text across 200 built-in,
pre-validated categories we have generated from common topics in our web
dataset, like neglect, government, and social media. We show that Empath's
data-driven, human validated categories are highly correlated (r=0.906) with
similar categories in LIWC.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 21:47:43 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Fast",
"Ethan",
""
],
[
"Chen",
"Binbin",
""
],
[
"Bernstein",
"Michael",
""
]
] |
new_dataset
| 0.999688 |
1602.07165
|
Jeroen Keiren
|
Jeroen J.A. Keiren, Peter Fontana, Rance Cleaveland
|
Corrections to A Menagerie of Timed Automata
|
9 pages, corrects a technical error in the ACM Computing Surveys
paper mentioned in the title, that can be found at
http://dx.doi.org/10.1145/2518102
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This note corrects a technical error in the ACM Computing Surveys paper
mentioned in the title. The flaw involved constructions for showing that timed
automata with urgent locations have the same expressiveness as timed automata
that allow false location invariants. Corrected con- structions are presented
in this note, and the affected results are reproved.
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2016 14:25:41 GMT"
}
] | 2016-02-24T00:00:00 |
[
[
"Keiren",
"Jeroen J. A.",
""
],
[
"Fontana",
"Peter",
""
],
[
"Cleaveland",
"Rance",
""
]
] |
new_dataset
| 0.982616 |
1311.5904
|
J. C. D\'iaz-V\'elez
|
M. G. Aartsen, R. Abbasi, M. Ackermann, J. Adams, J. A. Aguilar, M.
Ahlers, D. Altmann, C. Arguelles, J. Auffenberg, X. Bai, M. Baker, S. W.
Barwick, V. Baum, R. Bay, J. J. Beatty, J. Becker Tjus, K.-H. Becker, S.
BenZvi, P. Berghaus, D. Berley, E. Bernardini, A. Bernhard, D. Z. Besson, G.
Binder, D. Bindig, M. Bissok, E. Blaufuss, J. Blumenthal, D. J. Boersma, C.
Bohm, D. Bose, S. B\"oser, O. Botner, L. Brayeur, H.-P. Bretz, A. M. Brown,
R. Bruijn, J. Casey, M. Casier, D. Chirkin, A. Christov, B. Christy, K.
Clark, L. Classen, F. Clevermann, S. Coenders, S. Cohen, D. F. Cowen, A. H.
Cruz Silva, M. Danninger, J. Daughhetee, J. C. Davis, M. Day, C. De Clercq,
S. De Ridder, P. Desiati, K. D. de Vries, M. de With, T. DeYoung, J. C.
D\'iaz-V\'elez, M. Dunkman, R. Eagan, B. Eberhardt, B. Eichmann, J. Eisch, S.
Euler, P. A. Evenson, O. Fadiran, A. R. Fazely, A. Fedynitch, J. Feintzeig,
T. Feusels, K. Filimonov, C. Finley, T. Fischer-Wasels, S. Flis, A.
Franckowiak, K. Frantzen, T. Fuchs, T. K. Gaisser, J. Gallagher, L. Gerhardt,
L. Gladstone, T. Gl\"usenkamp, A. Goldschmidt, G. Golup, J. G. Gonzalez, J.
A. Goodman, D. G\'ora, D. T. Grandmont, D. Grant, P. Gretskov, J. C. Groh, A.
Gro{\ss}, C. Ha, A. Haj Ismail, P. Hallen, A. Hallgren, F. Halzen, K. Hanson,
D. Hebecker, D. Heereman, D. Heinen, K. Helbing, R. Hellauer, S. Hickford, G.
C. Hill, K. D. Hoffman, R. Hoffmann, A. Homeier, K. Hoshina, F. Huang, W.
Huelsnitz, P. O. Hulth, K. Hultqvist, S. Hussain, A. Ishihara, E. Jacobi, J.
Jacobsen, K. Jagielski, G. S. Japaridze, K. Jero, O. Jlelati, B. Kaminsky, A.
Kappes, T. Karg, A. Karle, M. Kauer, J. L. Kelley, J. Kiryluk, J. Kl\"as, S.
R. Klein, J.-H. K\"ohne, G. Kohnen, H. Kolanoski, L. K\"opke, C. Kopper, S.
Kopper, D. J. Koskinen, M. Kowalski, M. Krasberg, A. Kriesten, K. Krings, G.
Kroll, J. Kunnen, N. Kurahashi, T. Kuwabara, M. Labare, H. Landsman, M. J.
Larson, M. Lesiak-Bzdak, M. Leuermann, J. Leute, J. L\"unemann, O. Mac\'ias,
J. Madsen, G. Maggi, R. Maruyama, K. Mase, H. S. Matis, F. McNally, K.
Meagher, M. Merck, G. Merino, T. Meures, S. Miarecki, E. Middell, N. Milke,
J. Miller, L. Mohrmann, T. Montaruli, R. Morse, R. Nahnhauer, U. Naumann, H.
Niederhausen, S. C. Nowicki, D. R. Nygren, A. Obertacke, S. Odrowski, A.
Olivas, A. Omairat, A. O'Murchadha, L. Paul, J. A. Pepper, C. P\'erez de los
Heros, C. Pfendner, D. Pieloth, E. Pinat, J. Posselt, P. B. Price, G. T.
Przybylski, M. Quinnan, L. R \"adel, I. Rae, M. Rameez, K. Rawlins, P. Redl,
R. Reimann, E. Resconi, W. Rhode, M. Ribordy, M. Richman, B. Riedel, J. P.
Rodrigues, C. Rott, T. Ruhe, B. Ruzybayev, D. Ryckbosch, S. M. Saba, H.-G.
Sander, M. Santander, S. Sarkar, K. Schatto, F. Scheriau, T. Schmidt, M.
Schmitz, S. Schoenen, S. Sch\"oneberg, A. Sch\"onwald, A. Schukraft, L.
Schulte, D. Schultz, O. Schulz, D. Seckel, Y. Sestayo, S. Seunarine, R.
Shanidze, C. Sheremata, M. W. E. Smith, D. Soldin, G. M. Spiczak, C.
Spiering, M. Stamatikos, T. Stanev, N. A. Stanisha, A. Stasik, T.
Stezelberger, R. G. Stokstad, A. St\"o{\ss}l, E. A. Strahler, R. Str\"om, N.
L. Strotjohann, G. W. Sullivan, H. Taavola, I. Taboada, A. Tamburro, A. Tepe,
S. Ter-Antonyan, G. Te\v{s}i\'c, S. Tilav, P. A. Toale, M. N. Tobin, S.
Toscano, M. Tselengidou, E. Unger, M. Usner, S. Vallecorsa, N. van
Eijndhoven, A. Van Overloop, J. van Santen, M. Vehring, M. Voge, M. Vraeghe,
C. Walck, T. Waldenmaier, M. Wallraff, Ch. Weaver, M. Wellons, C. Wendt, S.
Westerhoff, N. Whitehorn, K. Wiebe, C. H. Wiebusch, D. R. Williams, H.
Wissing, M. Wolf, T. R. Wood, K. Woschnagg, D. L. Xu, X. W. Xu, J. P. Yanez,
G. Yodh, S. Yoshida, P. Zarzhitsky, J. Ziemann, S. Zierke, M. Zoll
|
The IceProd Framework: Distributed Data Processing for the IceCube
Neutrino Observatory
| null |
Journal of Parallel & Distributed Computing 75:198,2015
|
10.1016/j.jpdc.2014.08.001
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IceCube is a one-gigaton instrument located at the geographic South Pole,
designed to detect cosmic neutrinos, iden- tify the particle nature of dark
matter, and study high-energy neutrinos themselves. Simulation of the IceCube
detector and processing of data require a significant amount of computational
resources. IceProd is a distributed management system based on Python, XML-RPC
and GridFTP. It is driven by a central database in order to coordinate and
admin- ister production of simulations and processing of data produced by the
IceCube detector. IceProd runs as a separate layer on top of other middleware
and can take advantage of a variety of computing resources, including grids and
batch systems such as CREAM, Condor, and PBS. This is accomplished by a set of
dedicated daemons that process job submission in a coordinated fashion through
the use of middleware plugins that serve to abstract the details of job
submission and job management from the framework.
|
[
{
"version": "v1",
"created": "Fri, 22 Nov 2013 21:16:58 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jul 2014 22:31:16 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Aug 2014 21:31:55 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Aartsen",
"M. G.",
""
],
[
"Abbasi",
"R.",
""
],
[
"Ackermann",
"M.",
""
],
[
"Adams",
"J.",
""
],
[
"Aguilar",
"J. A.",
""
],
[
"Ahlers",
"M.",
""
],
[
"Altmann",
"D.",
""
],
[
"Arguelles",
"C.",
""
],
[
"Auffenberg",
"J.",
""
],
[
"Bai",
"X.",
""
],
[
"Baker",
"M.",
""
],
[
"Barwick",
"S. W.",
""
],
[
"Baum",
"V.",
""
],
[
"Bay",
"R.",
""
],
[
"Beatty",
"J. J.",
""
],
[
"Tjus",
"J. Becker",
""
],
[
"Becker",
"K. -H.",
""
],
[
"BenZvi",
"S.",
""
],
[
"Berghaus",
"P.",
""
],
[
"Berley",
"D.",
""
],
[
"Bernardini",
"E.",
""
],
[
"Bernhard",
"A.",
""
],
[
"Besson",
"D. Z.",
""
],
[
"Binder",
"G.",
""
],
[
"Bindig",
"D.",
""
],
[
"Bissok",
"M.",
""
],
[
"Blaufuss",
"E.",
""
],
[
"Blumenthal",
"J.",
""
],
[
"Boersma",
"D. J.",
""
],
[
"Bohm",
"C.",
""
],
[
"Bose",
"D.",
""
],
[
"Böser",
"S.",
""
],
[
"Botner",
"O.",
""
],
[
"Brayeur",
"L.",
""
],
[
"Bretz",
"H. -P.",
""
],
[
"Brown",
"A. M.",
""
],
[
"Bruijn",
"R.",
""
],
[
"Casey",
"J.",
""
],
[
"Casier",
"M.",
""
],
[
"Chirkin",
"D.",
""
],
[
"Christov",
"A.",
""
],
[
"Christy",
"B.",
""
],
[
"Clark",
"K.",
""
],
[
"Classen",
"L.",
""
],
[
"Clevermann",
"F.",
""
],
[
"Coenders",
"S.",
""
],
[
"Cohen",
"S.",
""
],
[
"Cowen",
"D. F.",
""
],
[
"Silva",
"A. H. Cruz",
""
],
[
"Danninger",
"M.",
""
],
[
"Daughhetee",
"J.",
""
],
[
"Davis",
"J. C.",
""
],
[
"Day",
"M.",
""
],
[
"De Clercq",
"C.",
""
],
[
"De Ridder",
"S.",
""
],
[
"Desiati",
"P.",
""
],
[
"de Vries",
"K. D.",
""
],
[
"de With",
"M.",
""
],
[
"DeYoung",
"T.",
""
],
[
"Díaz-Vélez",
"J. C.",
""
],
[
"Dunkman",
"M.",
""
],
[
"Eagan",
"R.",
""
],
[
"Eberhardt",
"B.",
""
],
[
"Eichmann",
"B.",
""
],
[
"Eisch",
"J.",
""
],
[
"Euler",
"S.",
""
],
[
"Evenson",
"P. A.",
""
],
[
"Fadiran",
"O.",
""
],
[
"Fazely",
"A. R.",
""
],
[
"Fedynitch",
"A.",
""
],
[
"Feintzeig",
"J.",
""
],
[
"Feusels",
"T.",
""
],
[
"Filimonov",
"K.",
""
],
[
"Finley",
"C.",
""
],
[
"Fischer-Wasels",
"T.",
""
],
[
"Flis",
"S.",
""
],
[
"Franckowiak",
"A.",
""
],
[
"Frantzen",
"K.",
""
],
[
"Fuchs",
"T.",
""
],
[
"Gaisser",
"T. K.",
""
],
[
"Gallagher",
"J.",
""
],
[
"Gerhardt",
"L.",
""
],
[
"Gladstone",
"L.",
""
],
[
"Glüsenkamp",
"T.",
""
],
[
"Goldschmidt",
"A.",
""
],
[
"Golup",
"G.",
""
],
[
"Gonzalez",
"J. G.",
""
],
[
"Goodman",
"J. A.",
""
],
[
"Góra",
"D.",
""
],
[
"Grandmont",
"D. T.",
""
],
[
"Grant",
"D.",
""
],
[
"Gretskov",
"P.",
""
],
[
"Groh",
"J. C.",
""
],
[
"Groß",
"A.",
""
],
[
"Ha",
"C.",
""
],
[
"Ismail",
"A. Haj",
""
],
[
"Hallen",
"P.",
""
],
[
"Hallgren",
"A.",
""
],
[
"Halzen",
"F.",
""
],
[
"Hanson",
"K.",
""
],
[
"Hebecker",
"D.",
""
],
[
"Heereman",
"D.",
""
],
[
"Heinen",
"D.",
""
],
[
"Helbing",
"K.",
""
],
[
"Hellauer",
"R.",
""
],
[
"Hickford",
"S.",
""
],
[
"Hill",
"G. C.",
""
],
[
"Hoffman",
"K. D.",
""
],
[
"Hoffmann",
"R.",
""
],
[
"Homeier",
"A.",
""
],
[
"Hoshina",
"K.",
""
],
[
"Huang",
"F.",
""
],
[
"Huelsnitz",
"W.",
""
],
[
"Hulth",
"P. O.",
""
],
[
"Hultqvist",
"K.",
""
],
[
"Hussain",
"S.",
""
],
[
"Ishihara",
"A.",
""
],
[
"Jacobi",
"E.",
""
],
[
"Jacobsen",
"J.",
""
],
[
"Jagielski",
"K.",
""
],
[
"Japaridze",
"G. S.",
""
],
[
"Jero",
"K.",
""
],
[
"Jlelati",
"O.",
""
],
[
"Kaminsky",
"B.",
""
],
[
"Kappes",
"A.",
""
],
[
"Karg",
"T.",
""
],
[
"Karle",
"A.",
""
],
[
"Kauer",
"M.",
""
],
[
"Kelley",
"J. L.",
""
],
[
"Kiryluk",
"J.",
""
],
[
"Kläs",
"J.",
""
],
[
"Klein",
"S. R.",
""
],
[
"Köhne",
"J. -H.",
""
],
[
"Kohnen",
"G.",
""
],
[
"Kolanoski",
"H.",
""
],
[
"Köpke",
"L.",
""
],
[
"Kopper",
"C.",
""
],
[
"Kopper",
"S.",
""
],
[
"Koskinen",
"D. J.",
""
],
[
"Kowalski",
"M.",
""
],
[
"Krasberg",
"M.",
""
],
[
"Kriesten",
"A.",
""
],
[
"Krings",
"K.",
""
],
[
"Kroll",
"G.",
""
],
[
"Kunnen",
"J.",
""
],
[
"Kurahashi",
"N.",
""
],
[
"Kuwabara",
"T.",
""
],
[
"Labare",
"M.",
""
],
[
"Landsman",
"H.",
""
],
[
"Larson",
"M. J.",
""
],
[
"Lesiak-Bzdak",
"M.",
""
],
[
"Leuermann",
"M.",
""
],
[
"Leute",
"J.",
""
],
[
"Lünemann",
"J.",
""
],
[
"Macías",
"O.",
""
],
[
"Madsen",
"J.",
""
],
[
"Maggi",
"G.",
""
],
[
"Maruyama",
"R.",
""
],
[
"Mase",
"K.",
""
],
[
"Matis",
"H. S.",
""
],
[
"McNally",
"F.",
""
],
[
"Meagher",
"K.",
""
],
[
"Merck",
"M.",
""
],
[
"Merino",
"G.",
""
],
[
"Meures",
"T.",
""
],
[
"Miarecki",
"S.",
""
],
[
"Middell",
"E.",
""
],
[
"Milke",
"N.",
""
],
[
"Miller",
"J.",
""
],
[
"Mohrmann",
"L.",
""
],
[
"Montaruli",
"T.",
""
],
[
"Morse",
"R.",
""
],
[
"Nahnhauer",
"R.",
""
],
[
"Naumann",
"U.",
""
],
[
"Niederhausen",
"H.",
""
],
[
"Nowicki",
"S. C.",
""
],
[
"Nygren",
"D. R.",
""
],
[
"Obertacke",
"A.",
""
],
[
"Odrowski",
"S.",
""
],
[
"Olivas",
"A.",
""
],
[
"Omairat",
"A.",
""
],
[
"O'Murchadha",
"A.",
""
],
[
"Paul",
"L.",
""
],
[
"Pepper",
"J. A.",
""
],
[
"Heros",
"C. Pérez de los",
""
],
[
"Pfendner",
"C.",
""
],
[
"Pieloth",
"D.",
""
],
[
"Pinat",
"E.",
""
],
[
"Posselt",
"J.",
""
],
[
"Price",
"P. B.",
""
],
[
"Przybylski",
"G. T.",
""
],
[
"Quinnan",
"M.",
""
],
[
"ädel",
"L. R",
""
],
[
"Rae",
"I.",
""
],
[
"Rameez",
"M.",
""
],
[
"Rawlins",
"K.",
""
],
[
"Redl",
"P.",
""
],
[
"Reimann",
"R.",
""
],
[
"Resconi",
"E.",
""
],
[
"Rhode",
"W.",
""
],
[
"Ribordy",
"M.",
""
],
[
"Richman",
"M.",
""
],
[
"Riedel",
"B.",
""
],
[
"Rodrigues",
"J. P.",
""
],
[
"Rott",
"C.",
""
],
[
"Ruhe",
"T.",
""
],
[
"Ruzybayev",
"B.",
""
],
[
"Ryckbosch",
"D.",
""
],
[
"Saba",
"S. M.",
""
],
[
"Sander",
"H. -G.",
""
],
[
"Santander",
"M.",
""
],
[
"Sarkar",
"S.",
""
],
[
"Schatto",
"K.",
""
],
[
"Scheriau",
"F.",
""
],
[
"Schmidt",
"T.",
""
],
[
"Schmitz",
"M.",
""
],
[
"Schoenen",
"S.",
""
],
[
"Schöneberg",
"S.",
""
],
[
"Schönwald",
"A.",
""
],
[
"Schukraft",
"A.",
""
],
[
"Schulte",
"L.",
""
],
[
"Schultz",
"D.",
""
],
[
"Schulz",
"O.",
""
],
[
"Seckel",
"D.",
""
],
[
"Sestayo",
"Y.",
""
],
[
"Seunarine",
"S.",
""
],
[
"Shanidze",
"R.",
""
],
[
"Sheremata",
"C.",
""
],
[
"Smith",
"M. W. E.",
""
],
[
"Soldin",
"D.",
""
],
[
"Spiczak",
"G. M.",
""
],
[
"Spiering",
"C.",
""
],
[
"Stamatikos",
"M.",
""
],
[
"Stanev",
"T.",
""
],
[
"Stanisha",
"N. A.",
""
],
[
"Stasik",
"A.",
""
],
[
"Stezelberger",
"T.",
""
],
[
"Stokstad",
"R. G.",
""
],
[
"Stößl",
"A.",
""
],
[
"Strahler",
"E. A.",
""
],
[
"Ström",
"R.",
""
],
[
"Strotjohann",
"N. L.",
""
],
[
"Sullivan",
"G. W.",
""
],
[
"Taavola",
"H.",
""
],
[
"Taboada",
"I.",
""
],
[
"Tamburro",
"A.",
""
],
[
"Tepe",
"A.",
""
],
[
"Ter-Antonyan",
"S.",
""
],
[
"Tešić",
"G.",
""
],
[
"Tilav",
"S.",
""
],
[
"Toale",
"P. A.",
""
],
[
"Tobin",
"M. N.",
""
],
[
"Toscano",
"S.",
""
],
[
"Tselengidou",
"M.",
""
],
[
"Unger",
"E.",
""
],
[
"Usner",
"M.",
""
],
[
"Vallecorsa",
"S.",
""
],
[
"van Eijndhoven",
"N.",
""
],
[
"Van Overloop",
"A.",
""
],
[
"van Santen",
"J.",
""
],
[
"Vehring",
"M.",
""
],
[
"Voge",
"M.",
""
],
[
"Vraeghe",
"M.",
""
],
[
"Walck",
"C.",
""
],
[
"Waldenmaier",
"T.",
""
],
[
"Wallraff",
"M.",
""
],
[
"Weaver",
"Ch.",
""
],
[
"Wellons",
"M.",
""
],
[
"Wendt",
"C.",
""
],
[
"Westerhoff",
"S.",
""
],
[
"Whitehorn",
"N.",
""
],
[
"Wiebe",
"K.",
""
],
[
"Wiebusch",
"C. H.",
""
],
[
"Williams",
"D. R.",
""
],
[
"Wissing",
"H.",
""
],
[
"Wolf",
"M.",
""
],
[
"Wood",
"T. R.",
""
],
[
"Woschnagg",
"K.",
""
],
[
"Xu",
"D. L.",
""
],
[
"Xu",
"X. W.",
""
],
[
"Yanez",
"J. P.",
""
],
[
"Yodh",
"G.",
""
],
[
"Yoshida",
"S.",
""
],
[
"Zarzhitsky",
"P.",
""
],
[
"Ziemann",
"J.",
""
],
[
"Zierke",
"S.",
""
],
[
"Zoll",
"M.",
""
]
] |
new_dataset
| 0.950839 |
1312.4511
|
Abisheva Adiya
|
Adiya Abisheva, Venkata Rama Kiran Garimella, David Garcia and Ingmar
Weber
|
Who Watches (and Shares) What on YouTube? And When? Using Twitter to
Understand YouTube Viewership
|
12 pages, 8 figures and 10 tables
|
Proceedings of the 7th International ACM Conference on Web Science
and Data Mining, pp.593-602 (2014)
|
10.1145/2556195.2566588
|
Report-no: ETH-2013-YouTube-Twitter-ETH-QCRI
|
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We combine user-centric Twitter data with video-centric YouTube data to
analyze who watches and shares what on YouTube. Combination of two data sets,
with 87k Twitter users, 5.6mln YouTube videos and 15mln video sharing events,
allows rich analysis going beyond what could be obtained with either of the two
data sets individually. For Twitter, we generate user features relating to
activity, interests and demographics. For YouTube, we obtain video features for
topic, popularity and polarization. These two feature sets are combined through
sharing events for YouTube URLs on Twitter. This combination is done both in a
user-, a video- and a sharing-event-centric manner. For the user-centric
analysis, we show how Twitter user features correlate both with YouTube
features and with sharing-related features. As two examples, we show urban
users are quicker to share than rural users and for some notions of "influence"
influential users on Twitter share videos with a higher number of views. For
the video-centric analysis, we find a superlinear relation between initial
Twitter shares and the final amounts of views, showing the correlated behavior
of Twitter. On user impact, we find the total amount of followers of users that
shared the video in the first week does not affect its final popularity.
However, aggregated user retweet rates serve as a better predictor for YouTube
video popularity. For the sharing-centric analysis, we reveal existence of
correlated behavior concerning the time between video creation and sharing
within certain timescales, showing the time onset for a coherent response, and
the time limit after which collective responses are extremely unlikely. We show
that response times depend on video category, revealing that Twitter sharing of
a video is highly dependent on its content. To the best of our knowledge this
is the first large-scale study combining YouTube and Twitter data.
|
[
{
"version": "v1",
"created": "Mon, 16 Dec 2013 20:35:09 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Feb 2016 16:45:21 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Abisheva",
"Adiya",
""
],
[
"Garimella",
"Venkata Rama Kiran",
""
],
[
"Garcia",
"David",
""
],
[
"Weber",
"Ingmar",
""
]
] |
new_dataset
| 0.95196 |
1508.07845
|
Peng Peng
|
Peng Peng, Lei Zou, Lei Chen, Dongyan Zhao
|
Query Workload-based RDF Graph Fragmentation and Allocation
|
13 pages
| null | null | null |
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the volume of the RDF data becomes increasingly large, it is essential for
us to design a distributed database system to manage it. For distributed RDF
data design, it is quite common to partition the RDF data into some parts,
called fragments, which are then distributed. Thus, the distribution design
consists of two steps: fragmentation and allocation. In this paper, we propose
a method to explore the intrinsic similarities among the structures of queries
in a workload for fragmentation and allocation, which aims to reduce the number
of crossing matches and the communication cost during SPARQL query processing.
Specifically, we mine and select some frequent access patterns to reflect the
characteristics of the workload. Here, although we prove that selecting the
optimal set of frequent access patterns is NP-hard, we propose a heuristic
algorithm which guarantees both the data integrity and the approximation ratio.
Based on the selected frequent access patterns, we propose two fragmentation
strategies, vertical and horizontal fragmentation strategies, to divide RDF
graphs while meeting different kinds of query processing objectives. Vertical
fragmentation is for better throughput and horizontal fragmentation is for
better performance. After fragmentation, we discuss how to allocate these
fragments to various sites. Finally, we discuss how to process a query based on
the results of fragmentation and allocation. Extensive experiments confirm the
superior performance of our proposed solutions.
|
[
{
"version": "v1",
"created": "Mon, 31 Aug 2015 14:23:38 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Sep 2015 02:29:51 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Dec 2015 16:10:04 GMT"
},
{
"version": "v4",
"created": "Sat, 20 Feb 2016 08:16:59 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Peng",
"Peng",
""
],
[
"Zou",
"Lei",
""
],
[
"Chen",
"Lei",
""
],
[
"Zhao",
"Dongyan",
""
]
] |
new_dataset
| 0.985019 |
1509.01277
|
Colin Rennie
|
Colin Rennie, Rahul Shome, Kostas E. Bekris, Alberto F. De Souza
|
A Dataset for Improved RGBD-based Object Detection and Pose Estimation
for Warehouse Pick-and-Place
|
To appear in RA-L
| null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important logistics application of robotics involves manipulators that
pick-and-place objects placed in warehouse shelves. A critical aspect of this
task corre- sponds to detecting the pose of a known object in the shelf using
visual data. Solving this problem can be assisted by the use of an RGB-D
sensor, which also provides depth information beyond visual data. Nevertheless,
it remains a challenging problem since multiple issues need to be addressed,
such as low illumination inside shelves, clutter, texture-less and reflective
objects as well as the limitations of depth sensors. This paper provides a new
rich data set for advancing the state-of-the-art in RGBD- based 3D object pose
estimation, which is focused on the challenges that arise when solving
warehouse pick- and-place tasks. The publicly available data set includes
thousands of images and corresponding ground truth data for the objects used
during the first Amazon Picking Challenge at different poses and clutter
conditions. Each image is accompanied with ground truth information to assist
in the evaluation of algorithms for object detection. To show the utility of
the data set, a recent algorithm for RGBD-based pose estimation is evaluated in
this paper. Based on the measured performance of the algorithm on the data set,
various modifications and improvements are applied to increase the accuracy of
detection. These steps can be easily applied to a variety of different
methodologies for object pose detection and improve performance in the domain
of warehouse pick-and-place.
|
[
{
"version": "v1",
"created": "Thu, 3 Sep 2015 20:53:06 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Feb 2016 20:05:18 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Rennie",
"Colin",
""
],
[
"Shome",
"Rahul",
""
],
[
"Bekris",
"Kostas E.",
""
],
[
"De Souza",
"Alberto F.",
""
]
] |
new_dataset
| 0.99833 |
1510.02658
|
J. Andres Montoya
|
Carolina Mejia, J. Andres Montoya
|
The almost-entropic regions are not semialgebraic
|
9 pages The paper has been withdrawn by the authors due to a flaw in
the proof of the main result
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the almost-entropic region of order four is not semialgebraic,
we get as a corollary the well-known Theorem of Matus, which asserts that this
region is not polyhedral
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 12:58:49 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Oct 2015 14:24:20 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Feb 2016 13:22:08 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Mejia",
"Carolina",
""
],
[
"Montoya",
"J. Andres",
""
]
] |
new_dataset
| 0.993879 |
1511.07057
|
George MacCartney Jr
|
George R. MacCartney Jr., Sija Deng, and Theodore S. Rappaport
|
Indoor Office Plan Environment and Layout-Based MmWave Path Loss Models
for 28 GHz and 73 GHz
|
To be published in 2016 IEEE 83rd Vehicular Technology Conference
Spring (VTC 2016-Spring), Nanjing, China, May 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents large-scale path loss models based on extensive
ultra-wideband millimeter-wave propagation measurements performed at 28 GHz and
73 GHz in three typical indoor office layouts -- namely: corridor, open-plan,
and closed-plan. A previous study combined all indoor layouts together, while
this study separates them for site-specific indoor large-scale path loss model
analysis. Measurements were conducted using a 400 megachips-per-second
broadband sliding correlator channel sounder with 800 MHz first null-to-null RF
bandwidth for 48 transmitter-receiver location combinations with distances
ranging 3.9 m to 45.9 m for both co- and cross-polarized antenna configurations
in line-of-sight and non-line-of-sight environments. Omnidirectional path loss
values were synthesized from over 14,000 directional power delay profiles and
were used to generate single-frequency and multi-frequency path loss models for
combined, co-, and cross-polarized antennas. Large-scale path loss models that
include a cross-polarization discrimination factor are provided for
cross-polarized antenna measurements. The results show the value of using the
close-in free space reference distance single and multi-frequency path loss
models, as they offer simplicity (less parameters) in path loss calculation and
prediction, without sacrificing accuracy. Moreover, the current 3GPP
floating-intercept path loss model only requires a simple and subtle
modification to convert to the close-in free space reference distance models.
|
[
{
"version": "v1",
"created": "Sun, 22 Nov 2015 19:34:55 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Feb 2016 15:02:19 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"MacCartney",
"George R.",
"Jr."
],
[
"Deng",
"Sija",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.997929 |
1512.07831
|
Jiezhong Qiu
|
Jiezhong Qiu, Yixuan Li, Jie Tang, Zheng Lu, Hao Ye, Bo Chen, Qiang
Yang and John Hopcroft
|
The Lifecycle and Cascade of WeChat Social Messaging Groups
|
10 pages, 8 figures, to appear in proceedings of the 25th
International World Wide Web Conference (WWW 2016)
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social instant messaging services are emerging as a transformative form with
which people connect, communicate with friends in their daily life - they
catalyze the formation of social groups, and they bring people stronger sense
of community and connection. However, research community still knows little
about the formation and evolution of groups in the context of social messaging
- their lifecycles, the change in their underlying structures over time, and
the diffusion processes by which they develop new members. In this paper, we
analyze the daily usage logs from WeChat group messaging platform - the largest
standalone messaging communication service in China - with the goal of
understanding the processes by which social messaging groups come together,
grow new members, and evolve over time. Specifically, we discover a strong
dichotomy among groups in terms of their lifecycle, and develop a separability
model by taking into account a broad range of group-level features, showing
that long-term and short-term groups are inherently distinct. We also found
that the lifecycle of messaging groups is largely dependent on their social
roles and functions in users' daily social experiences and specific purposes.
Given the strong separability between the long-term and short-term groups, we
further address the problem concerning the early prediction of successful
communities. In addition to modeling the growth and evolution from group-level
perspective, we investigate the individual-level attributes of group members
and study the diffusion process by which groups gain new members. By
considering members' historical engagement behavior as well as the local social
network structure that they embedded in, we develop a membership cascade model
and demonstrate the effectiveness by achieving AUC of 95.31% in predicting
inviter, and an AUC of 98.66% in predicting invitee.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 14:57:37 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Feb 2016 14:46:39 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Qiu",
"Jiezhong",
""
],
[
"Li",
"Yixuan",
""
],
[
"Tang",
"Jie",
""
],
[
"Lu",
"Zheng",
""
],
[
"Ye",
"Hao",
""
],
[
"Chen",
"Bo",
""
],
[
"Yang",
"Qiang",
""
],
[
"Hopcroft",
"John",
""
]
] |
new_dataset
| 0.99629 |
1602.02343
|
Carlos Torres
|
Carlos Torres, Victor Fragoso, Scott D. Hammond, Jeffrey C. Fried, and
B.S. Manjunath
|
Eye-CU: Sleep Pose Classification for Healthcare using Multimodal
Multiview Data
|
Ten-page manuscript including references and ten figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Manual analysis of body poses of bed-ridden patients requires staff to
continuously track and record patient poses. Two limitations in the
dissemination of pose-related therapies are scarce human resources and
unreliable automated systems. This work addresses these issues by introducing a
new method and a new system for robust automated classification of sleep poses
in an Intensive Care Unit (ICU) environment. The new method,
coupled-constrained Least-Squares (cc-LS), uses multimodal and multiview (MM)
data and finds the set of modality trust values that minimizes the difference
between expected and estimated labels. The new system, Eye-CU, is an affordable
multi-sensor modular system for unobtrusive data collection and analysis in
healthcare. Experimental results indicate that the performance of cc-LS matches
the performance of existing methods in ideal scenarios. This method outperforms
the latest techniques in challenging scenarios by 13% for those with poor
illumination and by 70% for those with both poor illumination and occlusions.
Results also show that a reduced Eye-CU configuration can classify poses
without pressure information with only a slight drop in its performance.
|
[
{
"version": "v1",
"created": "Sun, 7 Feb 2016 06:33:08 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Feb 2016 06:15:37 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Torres",
"Carlos",
""
],
[
"Fragoso",
"Victor",
""
],
[
"Hammond",
"Scott D.",
""
],
[
"Fried",
"Jeffrey C.",
""
],
[
"Manjunath",
"B. S.",
""
]
] |
new_dataset
| 0.958689 |
1602.04693
|
Shahid Alam
|
Shahid Alam, Zhengyang Qu, Ryan Riley, Yan Chen, Vaibhav Rastogi
|
DroidNative: Semantic-Based Detection of Android Native Code Malware
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
According to the Symantec and F-Secure threat reports, mobile malware
development in 2013 and 2014 has continued to focus almost exclusively ~99% on
the Android platform. Malware writers are applying stealthy mutations
(obfuscations) to create malware variants, thwarting detection by signature
based detectors. In addition, the plethora of more sophisticated detectors
making use of static analysis techniques to detect such variants operate only
at the bytecode level, meaning that malware embedded in native code goes
undetected. A recent study shows that 86% of the most popular Android
applications contain native code, making this a plausible threat. This paper
proposes DroidNative, an Android malware detector that uses specific control
flow patterns to reduce the effect of obfuscations, provides automation and
platform independence, and as far as we know is the first system that operates
at the Android native code level, allowing it to detect malware embedded in
both native code and bytecode. When tested with traditional malware variants it
achieves a detection rate (DR) of 99.48%, compared to academic and commercial
tools' DRs that range from 8.33% -- 93.22%. When tested with a dataset of 2240
samples DroidNative achieves a DR of 99.16%, a false positive rate of 0.4% and
an average detection time of 26.87 sec/sample.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 14:26:20 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Feb 2016 07:37:51 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Alam",
"Shahid",
""
],
[
"Qu",
"Zhengyang",
""
],
[
"Riley",
"Ryan",
""
],
[
"Chen",
"Yan",
""
],
[
"Rastogi",
"Vaibhav",
""
]
] |
new_dataset
| 0.999549 |
1602.06462
|
Toby Walsh
|
Toby Walsh
|
The Singularity May Never Be Near
|
Under review
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is both much optimism and pessimism around artificial intelligence (AI)
today. The optimists are investing millions of dollars, and even in some cases
billions of dollars into AI. The pessimists, on the other hand, predict that AI
will end many things: jobs, warfare, and even the human race. Both the
optimists and the pessimists often appeal to the idea of a technological
singularity, a point in time where machine intelligence starts to run away, and
a new, more intelligent species starts to inhabit the earth. If the optimists
are right, this will be a moment that fundamentally changes our economy and our
society. If the pessimists are right, this will be a moment that also
fundamentally changes our economy and our society. It is therefore very
worthwhile spending some time deciding if either of them might be right.
|
[
{
"version": "v1",
"created": "Sat, 20 Feb 2016 21:09:07 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Walsh",
"Toby",
""
]
] |
new_dataset
| 0.987812 |
1602.06683
|
Yann Busnel
|
Yann Busnel and Ilir Gashi
|
EDCC 2015 - Fast Abstracts & Student Forum Proceedings
|
The Tenth European Dependable Computing Conference - EDCC 2015 -
Paris, France, September 7-11, 2015
| null | null | null |
cs.DC cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Fast Abstracts are short presentations of work in progress or opinion pieces
and aim to serve as a rapid and flexible mechanism to (i) Report on current
work that may or may not be complete; (ii) Introduce new ideas to the
community; (iii) State positions on controversial issues or open problems.
On the other hand, the goal of the Student Forum is to encourage students to
attend EDCC and present their work, exchange ideas with researchers and
practitioners, and get early feedback on their research efforts.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 08:45:20 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Busnel",
"Yann",
""
],
[
"Gashi",
"Ilir",
""
]
] |
new_dataset
| 0.999297 |
1602.06823
|
Manuel Mazzara
|
Alexander Tchitchigin, Larisa Safina, Manuel Mazzara, Mohamed Elwakil,
Fabrizio Montesi and Victor Rivera
|
Refinement types in Jolie
| null | null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Jolie is the first language for microservices and it is currently dynamically
type checked. This paper considers the opportunity to integrate dynamic and
static type checking with the introduction of refinement types, verified via
SMT solver. The integration of the two aspects allows a scenario where the
static verification of internal services and the dynamic verification of
(potentially malicious) external services cooperates in order to reduce testing
effort and enhancing security.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 15:40:04 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Tchitchigin",
"Alexander",
""
],
[
"Safina",
"Larisa",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Elwakil",
"Mohamed",
""
],
[
"Montesi",
"Fabrizio",
""
],
[
"Rivera",
"Victor",
""
]
] |
new_dataset
| 0.97189 |
1602.06871
|
Leon Abdillah
|
Intan Okta Sari, Leon Andretti Abdillah, Kiky Rizky Nova Wardhani
|
Application Location Based Service (LBS) Location Search Palembang
Nature-Based Android
|
The 5th International Conference on Information Technology and
Engineering Application (ICIBA2016), Paper presented at the The 5th
ICIBA2016, Bina Darma University, Palembang
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the development of information systems to make the operating system more
diverse mobile devices, the emergence of the Android operating system that is
open allows users to search for and acquire various information easily and
quickly. Application Search Nature Places is an application that can help bring
information on nearby Places Nature is all around. Can be used in the Android
Operating System and Global Positioning System (GPS). To be able to use this
application, users must be connected to the Internet because it requires data
taken from Google Maps. The main facilities contained in this application is a
feature that makes it Map and Route users in finding the intended location.
With the LBS application is expected to provide information that is accurate,
clear and precise to determine location points Nature Palembang, and can
facilitate local and foreign tourists and the public, especially the city of
Palembang.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2016 08:30:18 GMT"
}
] | 2016-02-23T00:00:00 |
[
[
"Sari",
"Intan Okta",
""
],
[
"Abdillah",
"Leon Andretti",
""
],
[
"Wardhani",
"Kiky Rizky Nova",
""
]
] |
new_dataset
| 0.995763 |
1501.03988
|
Ilkka T\"orm\"a
|
Ville Salo, Ilkka T\"orm\"a
|
A One-Dimensional Physically Universal Cellular Automaton
|
17 pages, 6 figures. Corrected an error in a figure
| null | null | null |
cs.FL math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical universality of a cellular automaton was defined by Janzing in 2010
as the ability to implement an arbitrary transformation of spatial patterns. In
2014, Schaeffer gave a construction of a two-dimensional physically universal
cellular automaton. We construct a one-dimensional version of the automaton.
|
[
{
"version": "v1",
"created": "Fri, 16 Jan 2015 14:31:18 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Jan 2015 15:47:46 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Salo",
"Ville",
""
],
[
"Törmä",
"Ilkka",
""
]
] |
new_dataset
| 0.975874 |
1503.01386
|
G\"unter Rote
|
P\'eter Hajnal, Alexander Igamberdiev, G\"unter Rote, Andr\'e Schulz
|
Saturated simple and 2-simple topological graphs with few edges
|
18 pages, 22 figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple topological graph is a topological graph in which any two edges have
at most one common point, which is either their common endpoint or a proper
crossing. More generally, in a k-simple topological graph, every pair of edges
has at most k common points of this kind. We construct saturated simple and
2-simple graphs with few edges. These are k-simple graphs in which no further
edge can be added. We improve the previous upper bounds of Kyn\v{c}l, Pach,
Radoi\v{c}i\'c, and T\'oth and show that there are saturated simple graphs on n
vertices with only 7n edges and saturated 2-simple graphs on n vertices with
14.5n edges. As a consequence, 14.5n edges is also a new upper bound for
k-simple graphs (considering all values of k). We also construct saturated
simple and 2-simple graphs that have some vertices with low degree.
|
[
{
"version": "v1",
"created": "Wed, 4 Mar 2015 16:58:34 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Mar 2015 20:41:08 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Hajnal",
"Péter",
""
],
[
"Igamberdiev",
"Alexander",
""
],
[
"Rote",
"Günter",
""
],
[
"Schulz",
"André",
""
]
] |
new_dataset
| 0.996556 |
1506.05865
|
Baotian Hu
|
Baotian Hu, Qingcai Chen, Fangze Zhu
|
LCSTS: A Large Scale Chinese Short Text Summarization Dataset
|
Recently, we received feedbacks from Yuya Taguchi from NAIST in Japan
and Qian Chen from USTC of China, that the results in the EMNLP2015 version
seem to be underrated. So we carefully checked our results and find out that
we made a mistake while using the standard ROUGE. Then we re-evaluate all
methods in the paper and get corrected results listed in Table 2 of this
version
| null | null | null |
cs.CL cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic text summarization is widely regarded as the highly difficult
problem, partially because of the lack of large text summarization data set.
Due to the great challenge of constructing the large scale summaries for full
text, in this paper, we introduce a large corpus of Chinese short text
summarization dataset constructed from the Chinese microblogging website Sina
Weibo, which is released to the public
{http://icrc.hitsz.edu.cn/Article/show/139.html}. This corpus consists of over
2 million real Chinese short texts with short summaries given by the author of
each text. We also manually tagged the relevance of 10,666 short summaries with
their corresponding short texts. Based on the corpus, we introduce recurrent
neural network for the summary generation and achieve promising results, which
not only shows the usefulness of the proposed corpus for short text
summarization research, but also provides a baseline for further research on
this topic.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 02:40:42 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Jun 2015 14:33:39 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Aug 2015 02:43:38 GMT"
},
{
"version": "v4",
"created": "Fri, 19 Feb 2016 16:35:35 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Hu",
"Baotian",
""
],
[
"Chen",
"Qingcai",
""
],
[
"Zhu",
"Fangze",
""
]
] |
new_dataset
| 0.999793 |
1511.06830
|
Xuan Dong
|
Xuan Dong, Boyan Bonev, Weixin Li, Weichao Qiu, Xianjie Chen, Alan
Yuille
|
Ground-truth dataset and baseline evaluations for image base-detail
separation algorithms
|
This paper has been withdrawn by the author due to some un-proper
examples
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Base-detail separation is a fundamental computer vision problem consisting of
modeling a smooth base layer with the coarse structures, and a detail layer
containing the texture-like structures. One of the challenges of estimating the
base is to preserve sharp boundaries between objects or parts to avoid halo
artifacts. Many methods have been proposed to address this problem, but there
is no ground-truth dataset of real images for quantitative evaluation. We
proposed a procedure to construct such a dataset, and provide two datasets:
Pascal Base-Detail and Fashionista Base-Detail, containing 1000 and 250 images,
respectively. Our assumption is that the base is piecewise smooth and we label
the appearance of each piece by a polynomial model. The pieces are objects and
parts of objects, obtained from human annotations. Finally, we proposed a way
to evaluate methods with our base-detail ground-truth and we compared the
performances of seven state-of-the-art algorithms.
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2015 04:04:39 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Feb 2016 22:59:13 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Dong",
"Xuan",
""
],
[
"Bonev",
"Boyan",
""
],
[
"Li",
"Weixin",
""
],
[
"Qiu",
"Weichao",
""
],
[
"Chen",
"Xianjie",
""
],
[
"Yuille",
"Alan",
""
]
] |
new_dataset
| 0.998113 |
1602.03031
|
Can Alkan
|
Atalay M. Ileri, Halil I. Ozercan, Alper Gundogdu, Ahmet K. Senol, M.
Yusuf Ozkaya, Can Alkan
|
Coinami: A Cryptocurrency with DNA Sequence Alignment as Proof-of-work
| null | null | null | null |
cs.CE cs.CR q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rate of growth of the amount of data generated using the high throughput
sequencing (HTS) platforms now exceeds the growth stipulated by Moore's Law.
The HTS data is expected to surpass those of other "big data" domains such as
astronomy, before the year 2025. In addition to sequencing genomes for research
purposes, genome and exome sequencing in clinical settings will be a routine
part of health care. The analysis of such large amounts of data, however, is
not without computational challenges. This burden is even more increased due to
the periodic updates to reference genomes, which typically require re-analysis
of existing data. Here we propose Coin-Application Mediator Interface (Coinami)
to distribute the workload for mapping reads to reference genomes using a
volunteer grid computer approach similar to Berkeley Open Infrastructure for
Network Computing (BOINC). However, since HTS read mapping requires substantial
computational resources and fast analysis turnout is desired, Coinami uses the
HTS read mapping as proof-of-work to generate valid blocks to main its own
cryptocurrency system, which may help motivate volunteers to dedicate more
resources. The Coinami protocol includes mechanisms to ensure that jobs
performed by volunteers are correct, and provides genomic data privacy. The
prototype implementation of Coinami is available at http://coinami.github.io/.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2016 15:23:38 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Feb 2016 11:19:35 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Ileri",
"Atalay M.",
""
],
[
"Ozercan",
"Halil I.",
""
],
[
"Gundogdu",
"Alper",
""
],
[
"Senol",
"Ahmet K.",
""
],
[
"Ozkaya",
"M. Yusuf",
""
],
[
"Alkan",
"Can",
""
]
] |
new_dataset
| 0.999392 |
1602.05990
|
Pedro Miraldo
|
Jo\~ao R. Cardoso, Pedro Miraldo, and Helder Araujo
|
Pl\"ucker Correction Problem: Analysis and Improvements in Efficiency
| null | null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A given six dimensional vector represents a 3D straight line in Plucker
coordinates if its coordinates satisfy the Klein quadric constraint. In many
problems aiming to find the Plucker coordinates of lines, noise in the data
and other type of errors contribute for obtaining 6D vectors that do not
correspond to lines, because of that constraint. A common procedure to overcome
this drawback is to find the Plucker coordinates of the lines that are closest
to those vectors. This is known as the Plucker correction problem. In this
article we propose a simple, closed-form, and global solution for this problem.
When compared with the state-of-the-art method, one can conclude that our
algorithm is easier and requires much less operations than previous techniques
(it does not require Singular Value Decomposition techniques).
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2016 22:22:18 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Cardoso",
"João R.",
""
],
[
"Miraldo",
"Pedro",
""
],
[
"Araujo",
"Helder",
""
]
] |
new_dataset
| 0.982615 |
1602.06012
|
Kyle Burke
|
Kyle Burke, Bob Hearn
|
PSPACE-Complete Two-Color Placement Games
|
16 Pages, 16 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that three placement games, Col, NoGo, and Fjords, are
PSPACE-complete on planar graphs. The hardness of Col and Fjords is shown via a
reduction from Bounded 2-Player Constraint Logic and NoGo is shown to be hard
directly from Col.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2016 00:51:06 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Burke",
"Kyle",
""
],
[
"Hearn",
"Bob",
""
]
] |
new_dataset
| 0.999272 |
1602.06045
|
Anirudh Sivaraman Kaushalram
|
Anirudh Sivaraman, Suvinay Subramanian, Anurag Agrawal, Sharad Chole,
Shang-Tse Chuang, Tom Edsall, Mohammad Alizadeh, Sachin Katti, Nick McKeown,
Hari Balakrishnan
|
Programmable Packet Scheduling
|
14 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Switches today provide a small set of scheduling algorithms. While we can
tweak scheduling parameters, we cannot modify algorithmic logic, or add a
completely new algorithm, after the switch has been designed. This paper
presents a design for a programmable packet scheduler, which allows scheduling
algorithms---potentially algorithms that are unknown today---to be programmed
into a switch without requiring hardware redesign.
Our design builds on the observation that scheduling algorithms make two
decisions: in what order to schedule packets and when to schedule them.
Further, in many scheduling algorithms these decisions can be made when packets
are enqueued. We leverage this observation to build a programmable scheduler
using a single abstraction: the push-in first-out queue (PIFO), a priority
queue that maintains the scheduling order and time for such algorithms.
We show that a programmable scheduler using PIFOs lets us program a wide
variety of scheduling algorithms. We present a detailed hardware design for
this scheduler for a 64-port 10 Gbit/s shared-memory switch with <4% chip area
overhead on a 16-nm standard-cell library. Our design lets us program many
sophisticated algorithms, such as a 5-level hierarchical scheduler with
programmable scheduling algorithms at each level.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2016 04:55:00 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Sivaraman",
"Anirudh",
""
],
[
"Subramanian",
"Suvinay",
""
],
[
"Agrawal",
"Anurag",
""
],
[
"Chole",
"Sharad",
""
],
[
"Chuang",
"Shang-Tse",
""
],
[
"Edsall",
"Tom",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"Katti",
"Sachin",
""
],
[
"McKeown",
"Nick",
""
],
[
"Balakrishnan",
"Hari",
""
]
] |
new_dataset
| 0.999706 |
1602.06070
|
Raghavendra Singh
|
Raghavendra Singh
|
Vertex-disjoint Cycle Cover for graph signal processing
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Eigenvectors of the Laplacian of a cycle graph exhibit the sinusoidal
characteristics of the standard DFT basis, and signals defined on such graphs
are amenable to linear shift invariant (LSI) operations. In this paper we
propose to reduce a generic graph to its vertex-disjoint cycle cover, i.e., a
set of subgraphs that are cycles, that together contain all vertices of the
graph, and no two subgraphs have any vertices in common. Additionally if the
weight of an edge in the graph is a function of the variation in the signals on
its vertices, then maximally smooth cycles can be found, such that the
resulting DFT does not have high frequency components. We show that an image
graph can be reduced to such low-frequency cycles, and use that to propose a
simple image denoising algorithm.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2016 07:39:05 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Singh",
"Raghavendra",
""
]
] |
new_dataset
| 0.996846 |
1602.06149
|
Simone Bianco
|
Simone Bianco
|
Large age-gap face verification by feature injection in deep networks
|
Submitted
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new method for face verification across large age
gaps and also a dataset containing variations of age in the wild, the Large
Age-Gap (LAG) dataset, with images ranging from child/young to adult/old. The
proposed method exploits a deep convolutional neural network (DCNN) pre-trained
for the face recognition task on a large dataset and then fine-tuned for the
large age-gap face verification task. Finetuning is performed in a Siamese
architecture using a contrastive loss function. A feature injection layer is
introduced to boost verification accuracy, showing the ability of the DCNN to
learn a similarity metric leveraging external features. Experimental results on
the LAG dataset show that our method is able to outperform the face
verification solutions in the state of the art considered.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2016 13:39:22 GMT"
}
] | 2016-02-22T00:00:00 |
[
[
"Bianco",
"Simone",
""
]
] |
new_dataset
| 0.995372 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.