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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1607.03739
|
Sunny Daniels
|
Sunny Daniels
|
Generating Cycloidal Gears for 3D Printing
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(Shortened version of abstract in article itself)
This article describes an algorithm for producing, for any desired resolution
and any desired numbers of wheel and pinion teeth, polygonal approximations to
the shapes of a pair of cycloidal gears that mesh correctly. An Octave
implementation of the algorithm, mostly written in 2014, is included. The
Octave implementation contains a (crude, but evidently adequate, at least for
reasonable numbers of wheel and pinion teeth) solution of the problem of
iteratively finding the generating wheel angle corresponding to the tips of the
tooth addenda.
However, this Octave implementation does not contain a good solution to the
problem of automatically determining the generating wheel angles required to
produce a polygon which approximates the curved addenda to a resolution
specified by the user. A proposed better solution to this problem, involving a
priority queue, is discussed.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 08:56:46 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Daniels",
"Sunny",
""
]
] |
new_dataset
| 0.999718 |
1607.03830
|
Jian Du
|
Jian Du and Yik-Chung Wu
|
Distributed Clock Skew and Offset Estimation in Wireless Sensor
Networks: Asynchronous Algorithm and Convergence Analysis
| null | null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a fully distributed algorithm for joint clock skew
and offset estimation in wireless sensor networks based on belief propagation.
In the proposed algorithm, each node can estimate its clock skew and offset in
a completely distributed and asynchronous way: some nodes may update their
estimates more frequently than others using outdated message from neighboring
nodes. In addition, the proposed algorithm is robust to random packet loss.
Such algorithm does not require any centralized information processing or
coordination, and is scalable with network size. The proposed algorithm
represents a unified framework that encompasses both classes of synchronous and
asynchronous algorithms for network-wide clock synchronization. It is shown
analytically that the proposed asynchronous algorithm converges to the optimal
estimates with estimation mean-square-error at each node approaching the
centralized Cram\'er-Rao bound under any network topology. Simulation results
further show that {the convergence speed is faster than that corresponding to a
synchronous algorithm}.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 15:38:22 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Du",
"Jian",
""
],
[
"Wu",
"Yik-Chung",
""
]
] |
new_dataset
| 0.996695 |
1607.03105
|
Mario Mastriani
|
Mario Mastriani
|
Systholic Boolean Orthonormalizer Network in Wavelet Domain for SAR
Image Despeckling
|
11 pages, 9 figures, 1 table. arXiv admin note: text overlap with
arXiv:1405.0632
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a novel method for removing speckle (in wavelet domain) of
unknown variance from SAR images. The me-thod is based on the following
procedure: We apply 1) Bidimentional Discrete Wavelet Transform (DWT-2D) to the
speckled image, 2) scaling and rounding to the coefficients of the highest
subbands (to obtain integer and positive coefficients), 3) bit-slicing to the
new highest subbands (to obtain bit-planes), 4) then we apply the Systholic
Boolean Orthonormalizer Network (SBON) to the input bit-plane set and we obtain
two orthonormal output bit-plane sets (in a Boolean sense), we project a set on
the other one, by means of an AND operation, and then, 5) we apply
re-assembling, and, 6) re-sca-ling. Finally, 7) we apply Inverse DWT-2D and
reconstruct a SAR image from the modified wavelet coefficients. Despeckling
results compare favorably to the most of methods in use at the moment.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 16:08:25 GMT"
}
] | 2016-07-13T00:00:00 |
[
[
"Mastriani",
"Mario",
""
]
] |
new_dataset
| 0.989873 |
1607.03254
|
Piotr Gawlowicz
|
Piotr Gaw{\l}owicz, Sven Zehl, Anatolij Zubow and Adam Wolisz
|
NxWLAN: Neighborhood eXtensible WLAN
|
Technical report, Telecommunication Networks Group, Technische
Universitaet Berlin
| null | null |
TKN-16-002
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increased usage of IEEE 802.11 Wireless LAN (WLAN) in residential
environments by unexperienced users leads to dense, unplanned and chaotic
residential WLAN deployments. Often WLAN Access Points (APs) are deployed
unprofitable in terms of radio coverage and interference conditions. In many
cases the usage of the neighbor's AP would be beneficial as it would provide
better radio coverage in some parts of the residential user's apartment.
Moreover, the network performance can be dramatically improved by balancing the
network load over spatially co-located APs.
We address this problem by presenting Neighborhood extensible WLAN (NxWLAN)
which enables the secure extension of user's home WLANs through usage of
neighboring APs in residential environments with zero configuration efforts and
without revealing WPA2 encryption keys to untrusted neighbor APs. NxWLAN makes
use of virtualization techniques utilizing neighboring AP by deploying
on-demand a Wireless Termination Point (WTP) on the neighboring AP and by
tunneling encrypted 802.11 traffic to the Virtual Access Point (VAP) residing
on the home AP. This allows the client devices to always authenticate against
the home AP using the WPA2-PSK passphrase already stored in the device without
any additional registration process.
We implemented NxWLAN prototypically using off-the-shelf hardware and open
source software. As the OpenFlow is not suited for forwarding native 802.11
frames, we built software switch using P4 language. The performance evaluation
in a small 802.11 indoor testbed showed the feasibility of our approach. NxWLAN
is provided to the community as open source.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 08:15:05 GMT"
}
] | 2016-07-13T00:00:00 |
[
[
"Gawłowicz",
"Piotr",
""
],
[
"Zehl",
"Sven",
""
],
[
"Zubow",
"Anatolij",
""
],
[
"Wolisz",
"Adam",
""
]
] |
new_dataset
| 0.988867 |
1607.03292
|
Keren Zhou
|
Keren Zhou, Guangming Tan, Wei Zhou
|
Quadboost: A Scalable Concurrent Quadtree
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building concurrent spatial trees is more complicated than binary search
trees since a space hierarchy should be preserved during modifications. We
present a non-blocking quadtree-quadboost-that supports concurrent insert,
remove, move, and contain operations. To increase its concurrency, we propose a
decoupling approach that separates physical adjustment from logical removal
within the remove operation. In addition, we design a continuous find mechanism
to reduce its search cost. The move operation combines the searches for
different keys together and modifies different positions with atomicity. The
experimental results show that quadboost scales well on a multi-core system
with 32 hardware threads. More than that, it outperforms existing concurrent
trees in retrieving two-dimensional keys with up to 109% improvement when the
number of threads is large. The move operation proved to perform better than
the best-known algorithm, with up to 47%.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 10:05:56 GMT"
}
] | 2016-07-13T00:00:00 |
[
[
"Zhou",
"Keren",
""
],
[
"Tan",
"Guangming",
""
],
[
"Zhou",
"Wei",
""
]
] |
new_dataset
| 0.992504 |
1607.03320
|
Taha Yasseri
|
Jennie Zhang and Taha Yasseri
|
What Happens After You Both Swipe Right: A Statistical Description of
Mobile Dating Communications
|
Under Review, 22 pages, 8 tables, 8 figures
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile dating applications (MDAs) have skyrocketed in popularity in the last
few years, with popular MDA Tinder alone matching 26 million pairs of users per
day. In addition to becoming an influential part of modern dating culture, MDAs
facilitate a unique form of mediated communication: dyadic mobile text messages
between pairs of users who are not already acquainted. Furthermore, mobile
dating has paved the way for analysis of these digital interactions via massive
sets of data generated by the instant matching and messaging functions of its
many platforms at an unprecedented scale. This paper looks at one of these sets
of data: metadata of approximately two million conversations, containing 19
million messages, exchanged between 400,000 heterosexual users on an MDA.
Through computational analysis methods, this study offers the very first large
scale quantitative depiction of mobile dating as a whole. We report on
differences in how heterosexual male and female users communicate with each
other on MDAs, differences in behaviors of dyads of varying degrees of social
separation, and factors leading to "success"-operationalized by the exchange of
phone numbers between a match. For instance, we report that men initiate 79% of
conversations--and while about half of the initial messages are responded to,
conversations initiated by men are more likely to be reciprocated. We also
report that the length of conversations, the waiting times, and the length of
messages have fat-tailed distributions. That said, the majority of reciprocated
conversations lead to a phone number exchange within the first 20 messages.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 12:04:27 GMT"
}
] | 2016-07-13T00:00:00 |
[
[
"Zhang",
"Jennie",
""
],
[
"Yasseri",
"Taha",
""
]
] |
new_dataset
| 0.997891 |
1404.5584
|
Arne Reimers
|
Arne C. Reimers, Leen Stougie
|
Polynomial time vertex enumeration of convex polytopes of bounded
branch-width
|
15 pages
| null | null | null |
cs.CG cs.CC math.CO q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the last years the vertex enumeration problem of polyhedra has seen a
revival in the study of metabolic networks, which increased the demand for
efficient vertex enumeration algorithms for high-dimensional polyhedra given by
inequalities. It is a famous and long standing open question in polyhedral
theory and computational geometry whether the vertices of a polytope (bounded
polyhedron), described by a set of linear constraints, can be enumerated in
total polynomial time. In this paper we apply the concept of
branch-decomposition to the vertex enumeration problem of polyhedra $P = \{x :
Ax = b, x \geq 0\}$. For this purpose, we introduce the concept of $k$-module
and show how it relates to the separators of the linear matroid generated by
the columns of $A$. We then use this to present a total polynomial time
algorithm for polytopes $P$ for which the branch-width of the linear matroid
generated by $A$ is bounded by a constant $k$.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 18:25:14 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Jul 2016 18:19:26 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Reimers",
"Arne C.",
""
],
[
"Stougie",
"Leen",
""
]
] |
new_dataset
| 0.995722 |
1504.00353
|
Pascal Giard
|
Pascal Giard, Gabi Sarkis, Camille Leroux, Claude Thibeault, and
Warren J. Gross
|
Low-Latency Software Polar Decoders
|
13 pages, 9 figures, to appear in Springer's Journal of Signal
Processing Systems
| null |
10.1007/s11265-016-1157-y
| null |
cs.IT cs.PF math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a new class of capacity-achieving error-correcting codes with
low encoding and decoding complexity. Their low-complexity decoding algorithms
rendering them attractive for use in software-defined radio applications where
computational resources are limited. In this work, we present low-latency
software polar decoders that exploit modern processor capabilities. We show how
adapting the algorithm at various levels can lead to significant improvements
in latency and throughput, yielding polar decoders that are suitable for
high-performance software-defined radio applications on modern desktop
processors and embedded-platform processors. These proposed decoders have an
order of magnitude lower latency and memory footprint compared to
state-of-the-art decoders, while maintaining comparable throughput. In
addition, we present strategies and results for implementing polar decoders on
graphical processing units. Finally, we show that the energy efficiency of the
proposed decoders is comparable to state-of-the-art software polar decoders.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 19:55:06 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2016 07:54:29 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Giard",
"Pascal",
""
],
[
"Sarkis",
"Gabi",
""
],
[
"Leroux",
"Camille",
""
],
[
"Thibeault",
"Claude",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.992909 |
1504.01355
|
Serhii Dyshko
|
Serhii Dyshko
|
MacWilliams Extension Theorem for MDS additive codes
|
6 pages
| null |
10.1007/s10623-016-0247-y
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MacWilliams Extension Theorem states that each linear isometry of a
linear code extends to a monomial map. Unlike the linear codes, in general,
additive codes do not have the extension property. In this paper, an analogue
of the extension theorem for additive codes in the case of additive MDS codes
is proved. More precisely, it is shown that for almost all additive MDS codes
their additive isometries extend to isometries of the ambient space.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 18:27:03 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Dyshko",
"Serhii",
""
]
] |
new_dataset
| 0.998657 |
1601.06684
|
Shaoshi Yang Dr.
|
Shaoshi Yang, Cheng Zhou, Tiejun Lv, Lajos Hanzo
|
Large-Scale MIMO is Capable of Eliminating Power-Thirsty Channel Coding
for Wireless Transmission of HEVC/H.265 Video
|
7 pages, 4 figures, 1 table, accepted to appear on IEEE Wireless
Communications, Jan. 2016
|
IEEE Wireless Communications, vol. 23, no. 3, pp. 57-63, June 2016
|
10.1109/MWC.2016.7498075
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A wireless video transmission architecture relying on the emerging
large-scale multiple-input--multiple-output (LS-MIMO) technique is proposed.
Upon using the most advanced High Efficiency Video Coding (HEVC) (also known as
H.265), we demonstrate that the proposed architecture invoking the
low-complexity linear zero-forcing (ZF) detector and dispensing with any
channel coding is capable of significantly outperforming the conventional
small-scale MIMO based architecture, even if the latter employs the
high-complexity optimal maximum-likelihood (ML) detector and a rate-$1/3$
recursive systematic convolutional (RSC) channel codec. Specifically, compared
to the conventional small-scale MIMO system, the effective system throughput of
the proposed LS-MIMO based scheme is increased by a factor of up to three and
the quality of reconstructed video quantified in terms of the peak
signal-to-noise ratio (PSNR) is improved by about $22.5\, \text{dB}$ at a
channel-SNR of $E_b/N_0 \approx 6\,\text{dB}$ for delay-tolerant video-file
delivery applications, and about $20\,\text{dB}$ for lip-synchronized real-time
interactive video applications. Alternatively, viewing the attainable
improvement from a power-saving perspective, a channel-SNR gain as high as
$\Delta_{E_b/N_0}\approx 5\,\text{dB}$ is observed at a PSNR of $36\,
\text{dB}$ for the scenario of delay-tolerant video applications and again, an
even higher gain is achieved in the real-time video application scenario.
Therefore, we envisage that LS-MIMO aided wireless multimedia communications is
capable of dispensing with power-thirsty channel codec altogether!
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 17:21:27 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2016 14:51:22 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Yang",
"Shaoshi",
""
],
[
"Zhou",
"Cheng",
""
],
[
"Lv",
"Tiejun",
""
],
[
"Hanzo",
"Lajos",
""
]
] |
new_dataset
| 0.994917 |
1607.00148
|
Pankaj Malhotra Mr.
|
Pankaj Malhotra, Anusha Ramakrishnan, Gaurangi Anand, Lovekesh Vig,
Puneet Agarwal, Gautam Shroff
|
LSTM-based Encoder-Decoder for Multi-sensor Anomaly Detection
|
Accepted at ICML 2016 Anomaly Detection Workshop, New York, NY, USA,
2016. Reference update in this version (v2)
| null | null | null |
cs.AI cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mechanical devices such as engines, vehicles, aircrafts, etc., are typically
instrumented with numerous sensors to capture the behavior and health of the
machine. However, there are often external factors or variables which are not
captured by sensors leading to time-series which are inherently unpredictable.
For instance, manual controls and/or unmonitored environmental conditions or
load may lead to inherently unpredictable time-series. Detecting anomalies in
such scenarios becomes challenging using standard approaches based on
mathematical models that rely on stationarity, or prediction models that
utilize prediction errors to detect anomalies. We propose a Long Short Term
Memory Networks based Encoder-Decoder scheme for Anomaly Detection (EncDec-AD)
that learns to reconstruct 'normal' time-series behavior, and thereafter uses
reconstruction error to detect anomalies. We experiment with three publicly
available quasi predictable time-series datasets: power demand, space shuttle,
and ECG, and two real-world engine datasets with both predictive and
unpredictable behavior. We show that EncDec-AD is robust and can detect
anomalies from predictable, unpredictable, periodic, aperiodic, and
quasi-periodic time-series. Further, we show that EncDec-AD is able to detect
anomalies from short time-series (length as small as 30) as well as long
time-series (length as large as 500).
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 08:25:48 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2016 09:33:48 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Malhotra",
"Pankaj",
""
],
[
"Ramakrishnan",
"Anusha",
""
],
[
"Anand",
"Gaurangi",
""
],
[
"Vig",
"Lovekesh",
""
],
[
"Agarwal",
"Puneet",
""
],
[
"Shroff",
"Gautam",
""
]
] |
new_dataset
| 0.9965 |
1607.02677
|
Jin Li
|
Minghui Yang, Jin Li, Keqin Feng
|
Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels
Meeting the Plotkin-like Bound
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The symbol-pair codes over finite fields have been raised for symbol-pair
read channels and motivated by application of high-density data storage
technologies [1, 2]. Their generalization is the code for b-symbol read
channels (b > 2). Many MDS codes for b-symbol read channels have been
constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11]
for b > 2). In this paper we show the Plotkin-like bound and present a
construction on irreducible cyclic codes and constacyclic codes meeting the
Plotkin-like bound.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 02:06:42 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Yang",
"Minghui",
""
],
[
"Li",
"Jin",
""
],
[
"Feng",
"Keqin",
""
]
] |
new_dataset
| 0.999588 |
1607.02766
|
Mohammad Mozaffari
|
Mohammad Mozaffari, Walid Saad, Mehdi Bennis, and Merouane Debbah
|
Mobile Internet of Things: Can UAVs Provide an Energy-Efficient Mobile
Architecture?
|
Accepted in IEEE Global Communications Conference (GLOBECOM), 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the optimal trajectory and deployment of multiple unmanned
aerial vehicles (UAVs), used as aerial base stations to collect data from
ground Internet of Things (IoT) devices, is investigated. In particular, to
enable reliable uplink communications for IoT devices with a minimum energy
consumption, a new approach for optimal mobility of the UAVs is proposed.
First, given a fixed ground IoT network, the total transmit power of the
devices is minimized by properly clustering the IoT devices with each cluster
being served by one UAV. Next, to maintain energy-efficient communications in
time-varying mobile IoT networks, the optimal trajectories of the UAVs are
determined by exploiting the framework of optimal transport theory. Simulation
results show that by using the proposed approach, the total transmit power of
IoT devices for reliable uplink communications can be reduced by 56% compared
to the fixed Voronoi deployment method. Moreover, our results yield the optimal
paths that will be used by UAVs to serve the mobile IoT devices with a minimum
energy consumption.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 17:27:19 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Mozaffari",
"Mohammad",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Debbah",
"Merouane",
""
]
] |
new_dataset
| 0.951448 |
1607.02789
|
John Wieting
|
John Wieting, Mohit Bansal, Kevin Gimpel, Karen Livescu
|
Charagram: Embedding Words and Sentences via Character n-grams
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Charagram embeddings, a simple approach for learning
character-based compositional models to embed textual sequences. A word or
sentence is represented using a character n-gram count vector, followed by a
single nonlinear transformation to yield a low-dimensional embedding. We use
three tasks for evaluation: word similarity, sentence similarity, and
part-of-speech tagging. We demonstrate that Charagram embeddings outperform
more complex architectures based on character-level recurrent and convolutional
neural networks, achieving new state-of-the-art performance on several
similarity tasks.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 21:59:19 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Wieting",
"John",
""
],
[
"Bansal",
"Mohit",
""
],
[
"Gimpel",
"Kevin",
""
],
[
"Livescu",
"Karen",
""
]
] |
new_dataset
| 0.994929 |
1607.02791
|
Matilde Marcolli
|
Kevin Shu, Sharjeel Aziz, Vy-Luan Huynh, David Warrick, Matilde
Marcolli
|
Syntactic Phylogenetic Trees
|
21 pages, LaTeX, jpg figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we identify several serious problems that arise in the use of
syntactic data from the SSWL database for the purpose of computational
phylogenetic reconstruction. We show that the most naive approach fails to
produce reliable linguistic phylogenetic trees. We identify some of the sources
of the observed problems and we discuss how they may be, at least partly,
corrected by using additional information, such as prior subdivision into
language families and subfamilies, and a better use of the information about
ancient languages. We also describe how the use of phylogenetic algebraic
geometry can help in estimating to what extent the probability distribution at
the leaves of the phylogenetic tree obtained from the SSWL data can be
considered reliable, by testing it on phylogenetic trees established by other
forms of linguistic analysis. In simple examples, we find that, after
restricting to smaller language subfamilies and considering only those SSWL
parameters that are fully mapped for the whole subfamily, the SSWL data match
extremely well reliable phylogenetic trees, according to the evaluation of
phylogenetic invariants. This is a promising sign for the use of SSWL data for
linguistic phylogenetics.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 22:25:43 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Shu",
"Kevin",
""
],
[
"Aziz",
"Sharjeel",
""
],
[
"Huynh",
"Vy-Luan",
""
],
[
"Warrick",
"David",
""
],
[
"Marcolli",
"Matilde",
""
]
] |
new_dataset
| 0.990868 |
1607.02805
|
Joshua Joy
|
Joshua Joy, Ciaran McGoldrick, Mario Gerla
|
Mobile Privacy-Preserving Crowdsourced Data Collection in the Smart City
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart cities rely on dynamic and real-time data to enable smart urban
applications such as intelligent transport and epidemics detection. However,
the streaming of big data from IoT devices, especially from mobile platforms
like pedestrians and cars, raises significant privacy concerns.
Future autonomous vehicles will generate, collect and consume significant
volumes of data to be utilized in delivering safe and efficient transportation
solutions. The sensed data will, inherently, contain personally identifiable
and attributable information - both external (other vehicles, environmental)
and internal (driver, passengers, devices).
The autonomous vehicles are connected to the infrastructure cloud (e.g.,
Amazon), the edge cloud, and also the mobile cloud (vehicle to vehicle).
Clearly these different entities must co-operate and interoperate in a timely
fashion when routing and transferring the highly dynamic data. In order to
maximise the availability and utility of the sensed data, stakeholders must
have confidence that the data they transmit, receive, aggregate and reason on
is appropriately secured and protected throughout. There are many different
metaphors for providing end-to-end security for data exchanges, but they
commonly require a management and control sidechannel.
This work proposes a scalable smart city privacy-preserving architecture
named Authorized Analytics that enables each node (e.g. vehicle) to divulge
(contextually) local privatised data. Authorized Analytics is shown to scale
gracefully to IoT scope deployments.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 01:59:37 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Joy",
"Joshua",
""
],
[
"McGoldrick",
"Ciaran",
""
],
[
"Gerla",
"Mario",
""
]
] |
new_dataset
| 0.969049 |
1607.02902
|
Yewen Pu
|
Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama, Regina Barzilay
|
sk_p: a neural program corrector for MOOCs
| null | null | null | null |
cs.PL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel technique for automatic program correction in MOOCs,
capable of fixing both syntactic and semantic errors without manual, problem
specific correction strategies. Given an incorrect student program, it
generates candidate programs from a distribution of likely corrections, and
checks each candidate for correctness against a test suite.
The key observation is that in MOOCs many programs share similar code
fragments, and the seq2seq neural network model, used in the natural-language
processing task of machine translation, can be modified and trained to recover
these fragments.
Experiment shows our scheme can correct 29% of all incorrect submissions and
out-performs state of the art approach which requires manual, problem specific
correction strategies.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 11:08:00 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Pu",
"Yewen",
""
],
[
"Narasimhan",
"Karthik",
""
],
[
"Solar-Lezama",
"Armando",
""
],
[
"Barzilay",
"Regina",
""
]
] |
new_dataset
| 0.995122 |
1607.02911
|
Genevieve Simonet
|
Anne Berry and Genevi\`eve Simonet
|
Computing the atom graph of a graph and the union join graph of a
hypergraph
|
Submitted in Algorithms on July 11, 2016
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The atom graph of a graph is the graph whose vertices are the atoms obtained
by clique minimal separator decomposition of this graph, and whose edges are
the edges of all possible atom trees of this graph. We provide two efficient
algorithms for computing this atom graph, with a complexity in $O(min(n^\alpha
\log n, nm, n(n+\overline{m}))$ time, which is no more than the complexity of
computing the atoms in the general case. %\par We extend our results to
$\alpha$-acyclic hypergraphs. We introduce the notion of union join graph,
which is the union of all possible join trees; we apply our algorithms for atom
graphs to efficiently compute union join graphs.
Keywords: clique separator decomposition, atom tree, atom graph, clique tree,
clique graph, $\alpha$-acyclic hypergraph.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 12:00:41 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"Berry",
"Anne",
""
],
[
"Simonet",
"Geneviève",
""
]
] |
new_dataset
| 0.983236 |
1607.03021
|
Sikha O K
|
Sikha O K, Sachin Kumar S, K P Soman
|
Salient Region Detection and Segmentation in Images using Dynamic Mode
Decomposition
|
8 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual Saliency is the capability of vision system to select distinctive
parts of scene and reduce the amount of visual data that need to be processed.
The presentpaper introduces (1) a novel approach to detect salient regions by
considering color and luminance based saliency scores using Dynamic Mode
Decomposition (DMD), (2) a new interpretation to use DMD approach in static
image processing. This approach integrates two data analysis methods: (1)
Fourier Transform, (2) Principle Component Analysis.The key idea of our work is
to create a color based saliency map. This is based on the observation
thatsalient part of an image usually have distinct colors compared to the
remaining portion of the image. We have exploited the power of different color
spaces to model the complex and nonlinear behavior of human visual system to
generate a color based saliency map. To further improve the effect of final
saliency map, weutilized luminance information exploiting the fact that human
eye is more sensitive towards brightness than color.The experimental results
shows that our method based on DMD theory is effective in comparison with
previous state-of-art saliency estimation approaches. The approach presented in
this paperis evaluated using ROC curve, F-measure rate, Precision-Recall rate,
AUC score etc.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 16:30:06 GMT"
}
] | 2016-07-12T00:00:00 |
[
[
"K",
"Sikha O",
""
],
[
"S",
"Sachin Kumar",
""
],
[
"Soman",
"K P",
""
]
] |
new_dataset
| 0.99243 |
1501.06323
|
Hiroshi Nishiyama
|
Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima,
Masafumi Yamashita
|
The Parity Hamiltonian Cycle Problem
|
29 pages, 16 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper
investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a
closed walk which visits every vertex an odd number of times, where we remark
that the walk may use an edge more than once. First, we give a complete
characterization of the graphs which have PHCs, and give a linear time
algorithm to find a PHC, in which every edge appears at most four times, in
fact. In contrast, we show that finding a PHC is NP-hard if a closed walk is
allowed to use each edge at most z times for each z=1,2,3 (PHCz for short),
even when a given graph is two-edge connected. We then further investigate the
PHC3 problem, and show that the problem is in P when an input graph is
four-edge connected. Finally, we are concerned with three (or two)-edge
connected graphs, and show that the PHC3 is in P for any C_>=5-free or P6-free
graphs. Note that the Hamiltonian cycle problem is known to be NP-hard for
those graph classes.
|
[
{
"version": "v1",
"created": "Mon, 26 Jan 2015 10:49:26 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jul 2016 03:42:57 GMT"
}
] | 2016-07-11T00:00:00 |
[
[
"Nishiyama",
"Hiroshi",
""
],
[
"Kobayashi",
"Yusuke",
""
],
[
"Yamauchi",
"Yukiko",
""
],
[
"Kijima",
"Shuji",
""
],
[
"Yamashita",
"Masafumi",
""
]
] |
new_dataset
| 0.978294 |
1602.04881
|
Giovanni Viglietta
|
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi
Yamashita
|
Universal Systems of Oblivious Mobile Robots
|
17 pages, 4 figures
| null | null | null |
cs.DC cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An oblivious mobile robot is a stateless computational entity located in a
spatial universe, capable of moving in that universe. When activated, the robot
observes the universe and the location of the other robots, chooses a
destination, and moves there. The computation of the destination is made by
executing an algorithm, the same for all robots, whose sole input is the
current observation. No memory of all these actions is retained after the move.
When the universe is a graph, distributed computations by oblivious mobile
robots have been intensively studied focusing on the conditions for feasibility
of basic problems (e.g., gathering, exploration) in specific classes of graphs
under different schedulers. In this paper, we embark on a different, more
general, type of investigation.
With their movements from vertices to neighboring vertices, the robots make
the system transition from one configuration to another. Viewing this
transition as the computation of an abstract function, we ask which functions
are computed by which systems. Our main interest is on identifying sets of
systems that are "universal", in the sense that they can collectively compute
all finite functions. We are able to identify several such classes of fully
synchronous systems. In particular, among other results, we prove the
universality of the set of all graphs with at least one robot, of any set of
graphs with at least two robots whose quotient graphs contain arbitrarily long
paths, and of any set of graphs with at least three robots and arbitrarily
large finite girths.
We then focus on the minimum size that a network must have for the robots to
be able to compute all functions on a given finite set. We are able to
approximate the minimum size of such a network up to a factor that tends to 2
as $n$ goes to infinity.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2016 01:28:03 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Feb 2016 16:56:04 GMT"
},
{
"version": "v3",
"created": "Wed, 4 May 2016 11:37:53 GMT"
},
{
"version": "v4",
"created": "Fri, 8 Jul 2016 18:46:17 GMT"
}
] | 2016-07-11T00:00:00 |
[
[
"Flocchini",
"Paola",
""
],
[
"Santoro",
"Nicola",
""
],
[
"Viglietta",
"Giovanni",
""
],
[
"Yamashita",
"Masafumi",
""
]
] |
new_dataset
| 0.99744 |
1607.02179
|
Nikolaos Pappas
|
Ioannis Avgouleas and Nikolaos Pappas and Di Yuan and Vangelis
Angelakis
|
Probabilistic Cooperation of a Full-Duplex Relay in Random Access
Networks
|
Submitted for journal publication
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we analyze the probabilistic cooperation of a full-duplex relay
in a multiuser random-access network. The relay is equipped with on/off modes
for the receiver and the transmitter independently. These modes are modeled as
probabilities by which the receiver and the transmitter are activated. We
provide analytical expressions for the performance of the relay queue, such as
arrival and service rates, stability conditions, and the average queue size. We
optimize the relay's operation setup to maximize the network-wide throughput
while, simultaneously, we keep the relay's queue stable and minimize the
consumed energy. Furthermore, we study the effect of the SINR threshold and the
self-interference (SI) coefficient on the per-user and network-wide throughput.
For low SINR threshold, we show under which circumstances it is beneficial to
switch off the relay completely, or switch off the relay's receiver only.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 21:49:59 GMT"
}
] | 2016-07-11T00:00:00 |
[
[
"Avgouleas",
"Ioannis",
""
],
[
"Pappas",
"Nikolaos",
""
],
[
"Yuan",
"Di",
""
],
[
"Angelakis",
"Vangelis",
""
]
] |
new_dataset
| 0.982026 |
1412.7595
|
Lei Zhang
|
Lei Zhang, Feng Wang and Jiangchuan Liu
|
Mobile Instant Video Clip Sharing: Modeling and Enhancing View
Experience
| null | null | null |
SFU-CMPT TR 2014-34-1
|
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid development of wireless networking and mobile devices, anytime
and anywhere data access becomes readily available nowadays. Given the
crowdsourced content capturing and sharing, the preferred content length
becomes shorter and shorter, even for such multimedia data as video. A
representative is Twitter's Vine service, which, mainly targeting mobile users,
enables them to create ultra-short video clips and instantly post and share
with their followers. In this paper, we present an initial study on this new
generation of instant video clip sharing service enabled by mobile platforms
and explore the potentials towards its further enhancement. We closely
investigate its unique mobile interface, revealing the key differences between
Vine-enabled anytime anywhere data access patterns and that of traditional
counterparts. We then examine the scheduling policy to maximize the user
watching experience as well as the efficiency on the monetary and energy costs.
We show that the generic scheduling problem involves two subproblems, namely,
pre-fetching scheduling and watch-time download scheduling, and develop
effective solutions towards both of them. The superiority of our solution is
demonstrated by extensive trace-driven simulations. To the best of our
knowledge, this is the first work on modeling and optimizing the instant video
clip sharing on mobile devices.
|
[
{
"version": "v1",
"created": "Wed, 24 Dec 2014 03:44:21 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Apr 2015 21:04:29 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Jul 2016 05:08:12 GMT"
}
] | 2016-07-08T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Wang",
"Feng",
""
],
[
"Liu",
"Jiangchuan",
""
]
] |
new_dataset
| 0.9975 |
1606.04672
|
Lars Roemheld
|
Allen Huang, Lars Roemheld
|
Constitutional Precedent of Amicus Briefs
|
Stanford University "Law, Order, and Algorithms" Final Project
| null | null | null |
cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate shared language between U.S. Supreme Court majority opinions
and interest groups' corresponding amicus briefs. Specifically, we evaluate
whether language that originated in an amicus brief acquired legal precedent
status by being cited in the Court's opinion. Using plagiarism detection
software, automated querying of a large legal database, and manual analysis, we
establish seven instances where interest group amici were able to formulate
constitutional case law, setting binding legal precedent. We discuss several
such instances for their implications in the Supreme Court's creation of case
law.
|
[
{
"version": "v1",
"created": "Wed, 15 Jun 2016 08:21:29 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jul 2016 10:20:35 GMT"
}
] | 2016-07-08T00:00:00 |
[
[
"Huang",
"Allen",
""
],
[
"Roemheld",
"Lars",
""
]
] |
new_dataset
| 0.997186 |
1607.01887
|
Liqi Wang
|
Shixin Zhu, Zhonghua Sun, Liqi Wang
|
The symbol-pair distance distribution of repeated-root cyclic codes over
$\mathbb{F}_{p^m}$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symbol-pair codes are proposed to protect against pair errors in symbol-pair
read channels. One of the most important task in symbol-pair coding theory is
to determine the minimum pair-distance of symbol-pair codes. In this paper, we
investigate the symbol-pair distances of cyclic codes of length $p^e$ over
$\mathbb{F}_{p^m}$. The exact symbol-pair distances of all cyclic codes of such
length are determined.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 06:59:14 GMT"
}
] | 2016-07-08T00:00:00 |
[
[
"Zhu",
"Shixin",
""
],
[
"Sun",
"Zhonghua",
""
],
[
"Wang",
"Liqi",
""
]
] |
new_dataset
| 0.998241 |
1607.01952
|
Gareth Tyson
|
Gareth Tyson, Vasile C. Perta, Hamed Haddadi, Michael C. Seto
|
A First Look at User Activity on Tinder
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile dating apps have become a popular means to meet potential partners.
Although several exist, one recent addition stands out amongst all others.
Tinder presents its users with pictures of people geographically nearby, whom
they can either like or dislike based on first impressions. If two users like
each other, they are allowed to initiate a conversation via the chat feature.
In this paper we use a set of curated profiles to explore the behaviour of men
and women in Tinder. We reveal differences between the way men and women
interact with the app, highlighting the strategies employed. Women attain large
numbers of matches rapidly, whilst men only slowly accumulate matches. To
expand on our findings, we collect survey data to understand user intentions on
Tinder. Most notably, our results indicate that a little effort in grooming
profiles, especially for male users, goes a long way in attracting attention.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 10:30:13 GMT"
}
] | 2016-07-08T00:00:00 |
[
[
"Tyson",
"Gareth",
""
],
[
"Perta",
"Vasile C.",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Seto",
"Michael C.",
""
]
] |
new_dataset
| 0.99686 |
1607.02045
|
Yuanhuizi Xu
|
Yuanhuizi Xu, Kwan-Wu Chin, Sieteng Soh
|
A Novel Distributed Pseudo TDMA Channel Access Protocol for
Multi-Transmit-Receive Wireless Mesh Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Mesh Networks (WMNs) technology has been used in recent years for
broadband access in both cities and rural areas. A key development is to equip
routers with multiple directional antennas so that these routers can transmit
to, or receive from multiple neighbors simultaneously. The
Multi-Transmit-Receive (MTR) feature can boost network capacity significantly
if suitable scheduling policy is applied. In this paper, we propose a
distributed link scheduler called PCP-TDMA that fully utilizes the MTR
capability. In particular, it activates every link at least once within the
shortest period of time. We evaluated the performance of PCP-TDMA in various
network topologies, and compared it against a centralized algorithm called
ALGO-2, and two distributed approaches: JazzyMAC and ROMA. The results show
that PCP-TDMA achieves similar performance with the centralized algorithm in
all scenarios, and outperforms the distributed approaches significantly.
Specifically, in a fully connected network, the resulting superframe length of
PCP-TDMA is less than 1/3 and 1/2 of JazzyMAC and ROMA, respectively.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 15:23:19 GMT"
}
] | 2016-07-08T00:00:00 |
[
[
"Xu",
"Yuanhuizi",
""
],
[
"Chin",
"Kwan-Wu",
""
],
[
"Soh",
"Sieteng",
""
]
] |
new_dataset
| 0.998955 |
1607.01537
|
Han Cai
|
Han Cai, Minquan Cheng, Cuiling Fan, and Xiaohu Tang
|
Optimal Locally Repairable Systematic Codes Based on Packings
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locally repairable codes are desirable for distributed storage systems to
improve the repair efficiency. In this paper, we first build a bridge between
locally repairable code and packing. As an application of this bridge, some
optimal locally repairable codes can be obtained by packings, which gives
optimal locally repairable codes with flexible parameters.
|
[
{
"version": "v1",
"created": "Wed, 6 Jul 2016 09:35:56 GMT"
}
] | 2016-07-07T00:00:00 |
[
[
"Cai",
"Han",
""
],
[
"Cheng",
"Minquan",
""
],
[
"Fan",
"Cuiling",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.987939 |
1607.01577
|
Le Dong
|
Le Dong, Ling He, Gaipeng Kong, Qianni Zhang, Xiaochun Cao, and Ebroul
Izquierdo
|
CUNet: A Compact Unsupervised Network for Image Classification
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a compact network called CUNet (compact
unsupervised network) to counter the image classification challenge. Different
from the traditional convolutional neural networks learning filters by the
time-consuming stochastic gradient descent, CUNet learns the filter bank from
diverse image patches with the simple K-means, which significantly avoids the
requirement of scarce labeled training images, reduces the training
consumption, and maintains the high discriminative ability. Besides, we propose
a new pooling method named weighted pooling considering the different weight
values of adjacent neurons, which helps to improve the robustness to small
image distortions. In the output layer, CUNet integrates the feature maps
gained in the last hidden layer, and straightforwardly computes histograms in
non-overlapped blocks. To reduce feature redundancy, we implement the
max-pooling operation on adjacent blocks to select the most competitive
features. Comprehensive experiments are conducted to demonstrate the
state-of-the-art classification performances with CUNet on CIFAR-10, STL-10,
MNIST and Caltech101 benchmark datasets.
|
[
{
"version": "v1",
"created": "Wed, 6 Jul 2016 11:56:52 GMT"
}
] | 2016-07-07T00:00:00 |
[
[
"Dong",
"Le",
""
],
[
"He",
"Ling",
""
],
[
"Kong",
"Gaipeng",
""
],
[
"Zhang",
"Qianni",
""
],
[
"Cao",
"Xiaochun",
""
],
[
"Izquierdo",
"Ebroul",
""
]
] |
new_dataset
| 0.985912 |
1607.01752
|
Pavel Kucherbaev
|
Pavel Kucherbaev, Azad Abad, Stefano Tranquillini, Florian Daniel,
Maurizio Marchese, Fabio Casati
|
CrowdCafe - Mobile Crowdsourcing Platform
|
Was published before as a part of the phd thesis by Pavel Kucherbaev
http://eprints-phd.biblio.unitn.it/1716/
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a mobile crowdsourcing platform CrowdCafe, where
people can perform microtasks using their smartphones while they ride a bus,
travel by train, stand in a queue or wait for an appointment. These microtasks
are executed in exchange for rewards provided by local stores, such as coffee,
desserts and bus tickets. We present the concept, the implementation and the
evaluation by conducting a study with 52 participants, having 1108 tasks
completed.
|
[
{
"version": "v1",
"created": "Wed, 6 Jul 2016 19:26:20 GMT"
}
] | 2016-07-07T00:00:00 |
[
[
"Kucherbaev",
"Pavel",
""
],
[
"Abad",
"Azad",
""
],
[
"Tranquillini",
"Stefano",
""
],
[
"Daniel",
"Florian",
""
],
[
"Marchese",
"Maurizio",
""
],
[
"Casati",
"Fabio",
""
]
] |
new_dataset
| 0.998274 |
1508.07136
|
Robert Stewart
|
Robert Stewart, Deepayan Bhowmik, Greg Michaelson, Andrew Wallace
|
RIPL: An Efficient Image Processing DSL for FPGAs
|
Presented at Second International Workshop on FPGAs for Software
Programmers (FSP 2015) (arXiv:1508.06320)
|
J. Funct. Prog. 17 (2007) 428-429
|
10.1017/S0956796807006296
|
FSP/2015/16
|
cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Field programmable gate arrays (FPGAs) can accelerate image processing by
exploiting fine-grained parallelism opportunities in image operations. FPGA
language designs are often subsets or extensions of existing languages, though
these typically lack suitable hardware computation models so compiling them to
FPGAs leads to inefficient designs. Moreover, these languages lack image
processing domain specificity. Our solution is RIPL, an image processing domain
specific language (DSL) for FPGAs. It has algorithmic skeletons to express
image processing, and these are exploited to generate deep pipelines of highly
concurrent and memory-efficient image processing components.
|
[
{
"version": "v1",
"created": "Fri, 28 Aug 2015 09:08:49 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Stewart",
"Robert",
""
],
[
"Bhowmik",
"Deepayan",
""
],
[
"Michaelson",
"Greg",
""
],
[
"Wallace",
"Andrew",
""
]
] |
new_dataset
| 0.990099 |
1601.07333
|
Tal Mizrahi
|
Tal Mizrahi, Yoram Moses
|
OneClock to Rule Them All: Using Time in Networked Applications
|
This technical report is an extended version of "OneClock to Rule
Them All: Using Time in Networked Applications", which was accepted to
IEEE/IFIP NOMS 2016
|
NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management
Symposium, Istanbul, Turkey, 2016, pp. 679-685
|
10.1109/NOMS.2016.7502876
| null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces OneClock, a generic approach for using time in
networked applications. OneClock provides two basic time-triggered primitives:
the ability to schedule an operation at a remote host or device, and the
ability to receive feedback about the time at which an event occurred or an
operation was executed at a remote host or device. We introduce a novel
prediction-based scheduling approach that uses timing information collected at
runtime to accurately schedule future operations.
Our work includes an extension to the Network Configuration protocol
(NETCONF), which enables OneClock in real-life systems. This extension has been
published as an Internet Engineering Task Force (IETF) RFC, and a prototype of
our NETCONF time extension is publicly available as open source.
Experimental evaluation shows that our prediction-based approach allows
accurate scheduling in diverse and heterogeneous environments, with various
hardware capabilities and workloads. OneClock is a generic approach that can be
applied to any managed device: sensors, actuators, Internet of Things (IoT)
devices, routers, or toasters.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2016 11:57:19 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Mizrahi",
"Tal",
""
],
[
"Moses",
"Yoram",
""
]
] |
new_dataset
| 0.982031 |
1605.01846
|
Pieter Van Hertum
|
Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker
|
The KB paradigm and its application to interactive configuration
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null |
10.1017/S1471068416000156
| null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The knowledge base paradigm aims to express domain knowledge in a rich formal
language, and to use this domain knowledge as a knowledge base to solve various
problems and tasks that arise in the domain by applying multiple forms of
inference. As such, the paradigm applies a strict separation of concerns
between information and problem solving. In this paper, we analyze the
principles and feasibility of the knowledge base paradigm in the context of an
important class of applications: interactive configuration problems. In
interactive configuration problems, a configuration of interrelated objects
under constraints is searched, where the system assists the user in reaching an
intended configuration. It is widely recognized in industry that good software
solutions for these problems are very difficult to develop. We investigate such
problems from the perspective of the KB paradigm. We show that multiple
functionalities in this domain can be achieved by applying different forms of
logical inferences on a formal specification of the configuration domain. We
report on a proof of concept of this approach in a real-life application with a
banking company. To appear in Theory and Practice of Logic Programming (TPLP).
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 07:39:19 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Van Hertum",
"Pieter",
""
],
[
"Dasseville",
"Ingmar",
""
],
[
"Janssens",
"Gerda",
""
],
[
"Denecker",
"Marc",
""
]
] |
new_dataset
| 0.952101 |
1607.01076
|
Amol Patwardhan
|
Amol Patwardhan, Gerald Knapp
|
Aggressive actions and anger detection from multiple modalities using
Kinect
|
11 pages, 2 figures, 5 tables, in peer review with ACM TIST, Key
words: Aggression, multimodal anger recognition, Kinect
| null | null | null |
cs.HC cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prison facilities, mental correctional institutions, sports bars and places
of public protest are prone to sudden violence and conflicts. Surveillance
systems play an important role in mitigation of hostile behavior and
improvement of security by detecting such provocative and aggressive
activities. This research proposed using automatic aggressive behavior and
anger detection to improve the effectiveness of the surveillance systems. An
emotion and aggression aware component will make the surveillance system highly
responsive and capable of alerting the security guards in real time. This
research proposed facial expression, head, hand and body movement and speech
tracking for detecting anger and aggressive actions. Recognition was achieved
using support vector machines and rule based features. The multimodal affect
recognition precision rate for anger improved by 15.2% and recall rate improved
by 11.7% when behavioral rule based features were used in aggressive action
detection.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 00:04:45 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Patwardhan",
"Amol",
""
],
[
"Knapp",
"Gerald",
""
]
] |
new_dataset
| 0.995677 |
1607.01091
|
Hongwu Liu
|
Hongwu Liu and Kyung Sup Kwak
|
Amplify-and-Forward Full-Duplex Relay with Power Splitting-Based SWIPT
|
4 pages, submit to a conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a virtual harvest-transmit model and a
harvest-transmit-store model for amplify-and-forward full-duplex relay (FDR)
networks with power splitting-based simultaneous wireless information and power
transfer. The relay node employs a battery group consisting of two rechargeable
batteries. By switching periodically between two batteries for charging and
discharging in two consecutive time slots of each transmission block, all the
harvested energy in each block has been applied for full duplex transmission in
the virtual harvest-transmit model. By employing energy scheduling, the relay
node switches among the harvesting, relaying, harvesting-relaying, and idle
behaviors at a block level, so that a part of the harvested energy in a block
can be scheduled for future usage in the harvest-transmit-store model. A greedy
switching policy is designed to implement the harvest-transmit-store model,
where the FDR node transmits when its residual energy ensures decoding at the
destination. Numerical results verify the outage performance of the proposed
schemes.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 02:18:32 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Liu",
"Hongwu",
""
],
[
"Kwak",
"Kyung Sup",
""
]
] |
new_dataset
| 0.999504 |
1607.01162
|
Yixin Cao
|
Yuping Ke and Yixin Cao and Xiating Ouyang and Jianxin Wang
|
Unit Interval Vertex Deletion: Fewer Vertices are Relevant
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The unit interval vertex deletion problem asks for a set of at most $k$
vertices whose deletion from an $n$-vertex graph makes it a unit interval
graph. We develop an $O(k^4)$-vertex kernel for the problem, significantly
improving the $O(k^{53})$-vertex kernel of Fomin, Saurabh, and Villanger
[ESA'12; SIAM J. Discrete Math 27(2013)]. We introduce a novel way of
organizing cliques of a unit interval graph. Our constructive proof for the
correctness of our algorithm, using interval models, greatly simplifies the
destructive proofs, based on forbidden induced subgraphs, for similar problems
in literature.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 09:18:40 GMT"
}
] | 2016-07-06T00:00:00 |
[
[
"Ke",
"Yuping",
""
],
[
"Cao",
"Yixin",
""
],
[
"Ouyang",
"Xiating",
""
],
[
"Wang",
"Jianxin",
""
]
] |
new_dataset
| 0.999669 |
1403.4910
|
Vini Kanvar
|
Vini Kanvar and Uday P. Khedker
|
Heap Abstractions for Static Analysis
|
49 pages, 20 figures
|
ACM Computing Surveys, June 2016, Volume 49, Issue 2, Article 29
(http://dl.acm.org/citation.cfm?id=2931098)
|
10.1145/2931098
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Heap data is potentially unbounded and seemingly arbitrary. As a consequence,
unlike stack and static memory, heap memory cannot be abstracted directly in
terms of a fixed set of source variable names appearing in the program being
analysed. This makes it an interesting topic of study and there is an abundance
of literature employing heap abstractions. Although most studies have addressed
similar concerns, their formulations and formalisms often seem dissimilar and
some times even unrelated. Thus, the insights gained in one description of heap
abstraction may not directly carry over to some other description. This survey
is a result of our quest for a unifying theme in the existing descriptions of
heap abstractions. In particular, our interest lies in the abstractions and not
in the algorithms that construct them.
In our search of a unified theme, we view a heap abstraction as consisting of
two features: a heap model to represent the heap memory and a summarization
technique for bounding the heap representation. We classify the models as
storeless, store based, and hybrid. We describe various summarization
techniques based on k-limiting, allocation sites, patterns, variables, other
generic instrumentation predicates, and higher-order logics. This approach
allows us to compare the insights of a large number of seemingly dissimilar
heap abstractions and also paves way for creating new abstractions by
mix-and-match of models and summarization techniques.
|
[
{
"version": "v1",
"created": "Wed, 19 Mar 2014 18:59:56 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Mar 2014 08:32:37 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Apr 2014 19:38:45 GMT"
},
{
"version": "v4",
"created": "Sun, 2 Nov 2014 16:57:45 GMT"
},
{
"version": "v5",
"created": "Wed, 13 May 2015 17:55:53 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Kanvar",
"Vini",
""
],
[
"Khedker",
"Uday P.",
""
]
] |
new_dataset
| 0.985236 |
1511.08435
|
Jingge Zhu
|
Jingge Zhu, Michael Gastpar
|
Typical sumsets of linear codes
|
32 pages, 5 figures
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given two identical linear codes $\mathcal C$ over $\mathbb F_q$ of length
$n$, we independently pick one codeword from each codebook uniformly at random.
A $\textit{sumset}$ is formed by adding these two codewords entry-wise as
integer vectors and a sumset is called $\textit{typical}$, if the sum falls
inside this set with high probability. We ask the question: how large is the
typical sumset for most codes? In this paper we characterize the asymptotic
size of such typical sumset. We show that when the rate $R$ of the linear code
is below a certain threshold $D$, the typical sumset size is roughly $|\mathcal
C|^2=2^{2nR}$ for most codes while when $R$ is above this threshold, most codes
have a typical sumset whose size is roughly $|\mathcal C|\cdot
2^{nD}=2^{n(R+D)}$ due to the linear structure of the codes. The threshold $D$
depends solely on the alphabet size $q$ and takes value in $[1/2, \log
\sqrt{e})$. More generally, we completely characterize the asymptotic size of
typical sumsets of two nested linear codes $\mathcal C_1, \mathcal C_2$ with
different rates. As an application of the result, we study the communication
problem where the integer sum of two codewords is to be decoded through a
general two-user multiple-access channel.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2015 16:01:19 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Mar 2016 15:13:10 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Jul 2016 12:17:01 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Zhu",
"Jingge",
""
],
[
"Gastpar",
"Michael",
""
]
] |
new_dataset
| 0.990274 |
1605.04797
|
Qingnan Zhou
|
Qingnan Zhou, Alec Jacobson
|
Thingi10K: A Dataset of 10,000 3D-Printing Models
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Empirically validating new 3D-printing related algorithms and implementations
requires testing data representative of inputs encountered \emph{in the wild}.
An ideal benchmarking dataset should not only draw from the same distribution
of shapes people print in terms of class (e.g., toys, mechanisms, jewelry),
representation type (e.g., triangle soup meshes) and complexity (e.g., number
of facets), but should also capture problems and artifacts endemic to 3D
printing models (e.g., self-intersections, non-manifoldness). We observe that
the contextual and geometric characteristics of 3D printing models differ
significantly from those used for computer graphics applications, not to
mention standard models (e.g., Stanford bunny, Armadillo, Fertility). We
present a new dataset of 10,000 models collected from an online 3D printing
model-sharing database. Via analysis of both geometric (e.g., triangle aspect
ratios, manifoldness) and contextual (e.g., licenses, tags, classes)
characteristics, we demonstrate that this dataset represents a more concise
summary of real-world models used for 3D printing compared to existing
datasets. To facilitate future research endeavors, we also present an online
query interface to select subsets of the dataset according to project-specific
characteristics. The complete dataset and per-model statistical data are freely
available to the public.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2016 15:09:19 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Jul 2016 03:15:10 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Zhou",
"Qingnan",
""
],
[
"Jacobson",
"Alec",
""
]
] |
new_dataset
| 0.999641 |
1606.02792
|
John See
|
Sze-Teng Liong, John See, Raphael Chung-Wei Phan, Yee-Hui Oh, Anh Cat
Le Ngo, KokSheik Wong, Su-Wei Tan
|
Spontaneous Subtle Expression Detection and Recognition based on Facial
Strain
|
21 pages (including references), single column format, accepted to
Signal Processing: Image Communication journal
|
Signal Proc. Image Comm. 47 (2016) 170-182
|
10.1016/j.image.2016.06.004
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optical strain is an extension of optical flow that is capable of quantifying
subtle changes on faces and representing the minute facial motion intensities
at the pixel level. This is computationally essential for the relatively new
field of spontaneous micro-expression, where subtle expressions can be
technically challenging to pinpoint. In this paper, we present a novel method
for detecting and recognizing micro-expressions by utilizing facial optical
strain magnitudes to construct optical strain features and optical strain
weighted features. The two sets of features are then concatenated to form the
resultant feature histogram. Experiments were performed on the CASME II and
SMIC databases. We demonstrate on both databases, the usefulness of optical
strain information and more importantly, that our best approaches are able to
outperform the original baseline results for both detection and recognition
tasks. A comparison of the proposed method with other existing spatio-temporal
feature extraction approaches is also presented.
|
[
{
"version": "v1",
"created": "Thu, 9 Jun 2016 00:47:30 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Liong",
"Sze-Teng",
""
],
[
"See",
"John",
""
],
[
"Phan",
"Raphael Chung-Wei",
""
],
[
"Oh",
"Yee-Hui",
""
],
[
"Ngo",
"Anh Cat Le",
""
],
[
"Wong",
"KokSheik",
""
],
[
"Tan",
"Su-Wei",
""
]
] |
new_dataset
| 0.993619 |
1606.07487
|
Santiago Ontanon
|
Adam James Summerville, Sam Snodgrass, Michael Mateas, Santiago
Onta\~n\'on
|
The VGLC: The Video Game Level Corpus
|
To appear in proceedings of the 7th Workshop on Procedural Content
Generation
| null | null | null |
cs.HC cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Levels are a key component of many different video games, and a large body of
work has been produced on how to procedurally generate game levels. Recently,
Machine Learning techniques have been applied to video game level generation
towards the purpose of automatically generating levels that have the properties
of the training corpus. Towards that end we have made available a corpora of
video game levels in an easy to parse format ideal for different machine
learning and other game AI research purposes.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 21:36:36 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Jul 2016 20:04:55 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Summerville",
"Adam James",
""
],
[
"Snodgrass",
"Sam",
""
],
[
"Mateas",
"Michael",
""
],
[
"Ontañón",
"Santiago",
""
]
] |
new_dataset
| 0.999294 |
1606.08998
|
Ernest C. H. Cheung
|
Ernest Cheung, Tsan Kwong Wong, Aniket Bera, Xiaogang Wang, and Dinesh
Manocha
|
LCrowdV: Generating Labeled Videos for Simulation-based Crowd Behavior
Learning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel procedural framework to generate an arbitrary number of
labeled crowd videos (LCrowdV). The resulting crowd video datasets are used to
design accurate algorithms or training models for crowded scene understanding.
Our overall approach is composed of two components: a procedural simulation
framework for generating crowd movements and behaviors, and a procedural
rendering framework to generate different videos or images. Each video or image
is automatically labeled based on the environment, number of pedestrians,
density, behavior, flow, lighting conditions, viewpoint, noise, etc.
Furthermore, we can increase the realism by combining synthetically-generated
behaviors with real-world background videos. We demonstrate the benefits of
LCrowdV over prior lableled crowd datasets by improving the accuracy of
pedestrian detection and crowd behavior classification algorithms. LCrowdV
would be released on the WWW.
|
[
{
"version": "v1",
"created": "Wed, 29 Jun 2016 08:30:44 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Jul 2016 05:33:48 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Cheung",
"Ernest",
""
],
[
"Wong",
"Tsan Kwong",
""
],
[
"Bera",
"Aniket",
""
],
[
"Wang",
"Xiaogang",
""
],
[
"Manocha",
"Dinesh",
""
]
] |
new_dataset
| 0.999762 |
1607.00139
|
Mike Thelwall Prof
|
Mike Thelwall
|
TensiStrength: Stress and relaxation magnitude detection for social
media texts
|
Thelwall, M. (in press). TensiStrength: Stress and relaxation
magnitude detection for social media texts. Information Processing &
Management
| null |
10.1016/j.ipm.2016.06.009
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer systems need to be able to react to stress in order to perform
optimally on some tasks. This article describes TensiStrength, a system to
detect the strength of stress and relaxation expressed in social media text
messages. TensiStrength uses a lexical approach and a set of rules to detect
direct and indirect expressions of stress or relaxation, particularly in the
context of transportation. It is slightly more effective than a comparable
sentiment analysis program, although their similar performances occur despite
differences on almost half of the tweets gathered. The effectiveness of
TensiStrength depends on the nature of the tweets classified, with tweets that
are rich in stress-related terms being particularly problematic. Although
generic machine learning methods can give better performance than TensiStrength
overall, they exploit topic-related terms in a way that may be undesirable in
practical applications and that may not work as well in more focused contexts.
In conclusion, TensiStrength and generic machine learning approaches work well
enough to be practical choices for intelligent applications that need to take
advantage of stress information, and the decision about which to use depends on
the nature of the texts analysed and the purpose of the task.
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 07:50:02 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Jul 2016 13:44:49 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Thelwall",
"Mike",
""
]
] |
new_dataset
| 0.999013 |
1607.00497
|
Wonsuk Choi
|
Wonsuk Choi, Hyo Jin Jo, Samuel Woo, Ji Young Chun, Jooyoung Park, and
Dong Hoon Lee
|
Identifying ECUs Using Inimitable Characteristics of Signals in
Controller Area Networks
|
12 pages, 6 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last several decades, the automotive industry has come to incorporate
the latest Information and Communications (ICT) technology, increasingly
replacing mechanical components of vehicles with electronic components. These
electronic control units (ECUs) communicate with each other in an in-vehicle
network that makes the vehicle both safer and easier to drive. Controller Area
Networks (CANs) are the current standard for such high quality in-vehicle
communication. Unfortunately, however, CANs do not currently offer protection
against security attacks. In particular, they do not allow for message
authentication and hence are open to attacks that replay ECU messages for
malicious purposes. Applying the classic cryptographic method of message
authentication code (MAC) is not feasible since the CAN data frame is not long
enough to include a sufficiently long MAC to provide effective authentication.
In this paper, we propose a novel identification method, which works in the
physical layer of an in-vehicle CAN network. Our method identifies ECUs using
inimitable characteristics of signals enabling detection of a compromised or
alien ECU being used in a replay attack. Unlike previous attempts to address
security issues in the in-vehicle CAN network, our method works by simply
adding a monitoring unit to the existing network, making it deployable in
current systems and compliant with required CAN standards. Our experimental
results show that the bit string and classification algorithm that we utilized
yielded more accurate identification of compromised ECUs than any other method
proposed to date. The false positive rate is more than 2 times lower than the
method proposed by P.-S. Murvay et al. This paper is also the first to identify
potential attack models that systems should be able to detect.
|
[
{
"version": "v1",
"created": "Sat, 2 Jul 2016 12:13:49 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Choi",
"Wonsuk",
""
],
[
"Jo",
"Hyo Jin",
""
],
[
"Woo",
"Samuel",
""
],
[
"Chun",
"Ji Young",
""
],
[
"Park",
"Jooyoung",
""
],
[
"Lee",
"Dong Hoon",
""
]
] |
new_dataset
| 0.963775 |
1607.00554
|
Mikhail Volkov
|
Evgenija Bondar and Mikhail Volkov
|
Completely Reachable Automata
|
23 pages, 12 figures. This is an expanded version of the conference
paper published in C. Campeanu et al. (eds.), Descriptional Complexity of
Formal Systems. DCFS 2016 [Lect. Notes Comp. Sci. 9777], Springer-Verlag,
Berlin-Heidelberg-N.Y., 2016, 1-17
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a few results and several open problems concerning complete
deterministic finite automata in which every non-empty subset of the state set
occurs as the image of the whole state set under the action of a suitable input
word.
|
[
{
"version": "v1",
"created": "Sat, 2 Jul 2016 19:50:20 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Bondar",
"Evgenija",
""
],
[
"Volkov",
"Mikhail",
""
]
] |
new_dataset
| 0.999111 |
1607.00604
|
Timotheos Aslanidis
|
Timotheos Aslanidis and Leonidas Tsepenekas
|
Message Routing in Wireless and Mobile Networks using TDMA Technology
|
13 pages, 8 figures, 1 table, International Journal of Wireless &
Mobile Networks (IJWMN), vol. 8, No. 3, June 2016
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an era where communication has a most important role in modern societies,
designing efficient algorithms for data transmission is of the outmost
importance. TDMA is a technology used in many communication systems such as
satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data
in such systems we need to cluster them in packages. To achieve a faster
transmission we are allowed to preempt the transmission of any packet in order
to resume at a later time. Preemption can be used to reduce idleness of some
stations. Such preemptions though come with a reconfiguration cost in order to
setup for the next transmission. In this paper we propose two algorithms which
yield improved transmission scheduling. These two algorithms we call MGA and
IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to
conclude that MGA will be a very helpful tool in constructing an improved
schedule for packet routing using preemtion with a setup cost, we compare its
results to two other efficient algorithms designed by researchers in the past:
A-PBS(d+1) and GWA. To establish the efficiency of IMGA we ran experiments in
comparison to MGA as well as A-PBS(d+1) and GWA. IMGA has proven to produce the
most efficient schedule on all counts.
|
[
{
"version": "v1",
"created": "Sun, 3 Jul 2016 07:14:29 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Aslanidis",
"Timotheos",
""
],
[
"Tsepenekas",
"Leonidas",
""
]
] |
new_dataset
| 0.999737 |
1607.00644
|
Ahmad Masoud Dr
|
Ahmad A. Masoud
|
Nearest Neighbor-based Rendezvous for Sparsely Connected Mobile Agents
| null |
ASME. J. Dyn. Sys., Meas., Control. 2015;137(12):121002-121002-18
|
10.1115/1.4031248
| null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a convergent, nearest-neighbor, control protocol is suggested
for agents with nontrivial dynamics. The protocol guarantees convergence to a
common point in space even if each agent is restricted to communicate with a
single nearest neighbor. The neighbor, however, is required to lie outside an
arbitrarily small priority zone surrounding the agent. The control protocol
consists of two layers interconnected in a provably-correct manner. The first
layer provides the guidance signal to a rendezvous point assuming that the
agents have first order dynamics. The other layer converts in a decentralized
manner the guidance signal to a control signal that suits realistic agents such
as UGVs, UAVs and holonomic agents with second order dynamics.
|
[
{
"version": "v1",
"created": "Sun, 3 Jul 2016 14:09:50 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Masoud",
"Ahmad A.",
""
]
] |
new_dataset
| 0.995651 |
1607.00765
|
Kaveh Hassani
|
Kaveh Hassani and Won-Sook Lee
|
Multi-Objective Design of State Feedback Controllers Using Reinforced
Quantum-Behaved Particle Swarm Optimization
| null |
Applied Soft Computing, 41, pp. 66-76, 2016
|
10.1016/j.asoc.2015.12.024
| null |
cs.NE cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel and generic multi-objective design paradigm is
proposed which utilizes quantum-behaved PSO(QPSO) for deciding the optimal
configuration of the LQR controller for a given problem considering a set of
competing objectives. There are three main contributions introduced in this
paper as follows. (1) The standard QPSO algorithm is reinforced with an
informed initialization scheme based on the simulated annealing algorithm and
Gaussian neighborhood selection mechanism. (2) It is also augmented with a
local search strategy which integrates the advantages of memetic algorithm into
conventional QPSO. (3) An aggregated dynamic weighting criterion is introduced
that dynamically combines the soft and hard constraints with control objectives
to provide the designer with a set of Pareto optimal solutions and lets her to
decide the target solution based on practical preferences. The proposed method
is compared against a gradient-based method, seven meta-heuristics, and the
trial-and-error method on two control benchmarks using sensitivity analysis and
full factorial parameter selection and the results are validated using
one-tailed T-test. The experimental results suggest that the proposed method
outperforms opponent methods in terms of controller effort, measures associated
with transient response and criteria related to steady-state.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 08:24:42 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Hassani",
"Kaveh",
""
],
[
"Lee",
"Won-Sook",
""
]
] |
new_dataset
| 0.98456 |
1607.00811
|
Kumar Sankar Ray
|
Debayan Ganguly, Kumar Sankar Ray
|
2-tape 1-way Quantum Finite State Automata
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
1-way quantum finite state automata are reversible in nature, which greatly
reduces its accepting property. In fact, the set of languages accepted by 1-way
quantum finite automata is a proper subset of regular languages. We introduce
2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified
version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper,
we replace the single tape of 1-way 2-head quantum finite state automaton with
two tapes. The content of the second tape is determined using a relation
defined on input alphabet. The main claims of this paper are as follows: (1)We
establish that 2-tape 1-way quantum finite state automaton(2T1QFA(2)) can
accept all regular languages (2)A language which cannot be accepted by any
multi-head deterministic finite automaton can be accepted by 2-tape 1-way
quantum finite state automaton(2T1QFA(2)) .(3) Exploiting the superposition
property of quantum automata we show that 2-tape 1-way quantum finite state
automaton(2T1QFA(2)) can accept the language L=ww.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 10:30:01 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Ganguly",
"Debayan",
""
],
[
"Ray",
"Kumar Sankar",
""
]
] |
new_dataset
| 0.999498 |
1607.00825
|
Stefan Richthofer
|
Stefan Richthofer
|
Garbage Collection in JyNI - How to bridge Mark/Sweep and Reference
Counting GC
| null | null | null |
euroscipy-proceedings2015-01
|
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Jython is a Java-based Python implementation and the most seamless way to
integrate Python and Java. It achieves high efficiency by compiling Python code
to Java bytecode and thus letting Java's JIT optimize it - an approach that
enables Python code to call Java functions or to subclass Java classes. It
enables Python code to leverage Java's multithreading features and utilizes
Java's built-in garbage collection (GC). However, it currently does not support
CPython's C-API and thus does not support native extensions like NumPy and
SciPy. Since most scientific code depends on such extensions, it is not
runnable with Jython. Jython Native Interface (JyNI) is a compatibility layer
that aims to provide CPython's native C extension API on top of Jython. JyNI is
implemented using the Java Native Interface (JNI) and its native part is
designed to be binary compatible with existing extension builds [...].
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 19:11:01 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Richthofer",
"Stefan",
""
]
] |
new_dataset
| 0.990224 |
1607.00859
|
Sepideh Alassi
|
Sepideh Alassi, Bertram Winter
|
PyCells for an Open Semiconductor Industry
| null | null | null |
euroscipy-proceedings2015-01
|
cs.OH
|
http://creativecommons.org/licenses/by/4.0/
|
In the modern semiconductor industry, automatic generation of parameterized
and recurring layout structures plays an important role and should be present
as a feature in Electronic Design Automation (EDA)-tools. Currently these
layout generators are developed with a proprietary programming language and can
be used with a specific EDA-tool. Therefore, the semiconductor companies find
the development of the layout generators that can be used in all state of the
art EDA-tools which support OpenAccess database appealing. The goal of this
project is to develop computationally efficient layout generators with Python
(PyCells), for ams AG technologies, that possess all the features of
comprehensive layout generators.
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 19:13:10 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Alassi",
"Sepideh",
""
],
[
"Winter",
"Bertram",
""
]
] |
new_dataset
| 0.970202 |
1607.00888
|
Alexander Semenov
|
Ilya Otpuschennikov, Alexander Semenov, Irina Gribanova, Oleg Zaikin,
Stepan Kochemazov
|
Encoding Cryptographic Functions to SAT Using Transalg System
|
Short variant of this paper was accepted to ECAI2016 conference
| null | null | null |
cs.AI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose the technology for constructing propositional
encodings of discrete functions. It is aimed at solving inversion problems of
considered functions using state-of-the-art SAT solvers. We implemented this
technology in the form of the software system called Transalg, and used it to
construct SAT encodings for a number of cryptanalysis problems. By applying SAT
solvers to these encodings we managed to invert several cryptographic
functions. In particular, we used the SAT encodings produced by Transalg to
construct the family of two-block MD5 collisions in which the first 10 bytes
are zeros. Also we used Transalg encoding for the widely known A5/1 keystream
generator to solve several dozen of its cryptanalysis instances in a
distributed computing environment. In the paper we compare in detail the
functionality of Transalg with that of similar software systems.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 13:57:35 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Otpuschennikov",
"Ilya",
""
],
[
"Semenov",
"Alexander",
""
],
[
"Gribanova",
"Irina",
""
],
[
"Zaikin",
"Oleg",
""
],
[
"Kochemazov",
"Stepan",
""
]
] |
new_dataset
| 0.996821 |
1607.00974
|
Georg B\"ocherer
|
Georg B\"ocherer
|
Lecture Notes on Channel Coding
|
5 chapters, 68 homework problems
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These lecture notes on channel coding were developed for a one-semester
course for graduate students of electrical engineering. Chapter 1 reviews the
basic problem of channel coding. Chapters 2-5 are on linear block codes, cyclic
codes, Reed-Solomon codes, and BCH codes, respectively. The notes are
self-contained and were written with the intent to derive the presented results
with mathematical rigor. The notes contain in total 68 homework problems, of
which 20% require computer programming.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 17:50:37 GMT"
}
] | 2016-07-05T00:00:00 |
[
[
"Böcherer",
"Georg",
""
]
] |
new_dataset
| 0.999811 |
1501.05475
|
Benjamin L\'ev\^eque
|
Daniel Gon\c{c}alves, Kolja Knauer, Benjamin L\'ev\^eque
|
On the structure of Schnyder woods on orientable surfaces
| null | null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple generalization of Schnyder woods from the plane to maps
on orientable surfaces of higher genus. This is done in the language of angle
labelings. Generalizing results of De Fraysseix and Ossona de Mendez, and
Felsner, we establish a correspondence between these labelings and orientations
and characterize the set of orientations of a map that correspond to such a
Schnyder labeling. Furthermore, we study the set of these orientations of a
given map and provide a natural partition into distributive lattices depending
on the surface homology. This generalizes earlier results of Felsner and Ossona
de Mendez. In the toroidal case, a new proof for the existence of Schnyder
woods is derived from this approach.
|
[
{
"version": "v1",
"created": "Thu, 22 Jan 2015 12:21:23 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jul 2016 08:30:01 GMT"
}
] | 2016-07-04T00:00:00 |
[
[
"Gonçalves",
"Daniel",
""
],
[
"Knauer",
"Kolja",
""
],
[
"Lévêque",
"Benjamin",
""
]
] |
new_dataset
| 0.984417 |
1602.06915
|
Jeffrey Shallit
|
Guilhem Gamard, Gwena\"el Richomme, Jeffrey Shallit, Taylor J. Smith
|
Periodicity in Rectangular Arrays
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss several two-dimensional generalizations of the familiar
Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of
primitive array (as one that cannot be expressed as the repetition of smaller
arrays). We count the number of m x n arrays that are primitive. Finally, we
show that one can test primitivity and compute the primitive root of an array
in linear time.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 19:54:33 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jul 2016 09:30:56 GMT"
}
] | 2016-07-04T00:00:00 |
[
[
"Gamard",
"Guilhem",
""
],
[
"Richomme",
"Gwenaël",
""
],
[
"Shallit",
"Jeffrey",
""
],
[
"Smith",
"Taylor J.",
""
]
] |
new_dataset
| 0.990308 |
1607.00234
|
Florentin Smarandache
|
Florentin Smarandache
|
Neutrosophic Overset, Neutrosophic Underset, and Neutrosophic Offset.
Similarly for Neutrosophic Over-/Under-/Off- Logic, Probability, and
Statistics
|
170 pages
|
Pons Editions, Bruxelles, 2016
| null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neutrosophic Over-/Under-/Off-Set and -Logic were defined by the author in
1995 and published for the first time in 2007. We extended the neutrosophic set
respectively to Neutrosophic Overset {when some neutrosophic component is over
1}, Neutrosophic Underset {when some neutrosophic component is below 0}, and to
Neutrosophic Offset {when some neutrosophic components are off the interval [0,
1], i.e. some neutrosophic component over 1 and other neutrosophic component
below 0}. This is no surprise with respect to the classical fuzzy set/logic,
intuitionistic fuzzy set/logic, or classical/imprecise probability, where the
values are not allowed outside the interval [0, 1], since our real-world has
numerous examples and applications of over-/under-/off-neutrosophic components.
For example, person working overtime deserves a membership degree over 1, while
a person producing more damage than benefit to a company deserves a membership
below 0. Then, similarly, the Neutrosophic Logic/Measure/Probability/Statistics
etc. were extended to respectively Neutrosophic Over-/Under-/Off-Logic,
-Measure, -Probability, -Statistics etc. [Smarandache, 2007].
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2016 02:17:59 GMT"
}
] | 2016-07-04T00:00:00 |
[
[
"Smarandache",
"Florentin",
""
]
] |
new_dataset
| 0.999835 |
1607.00298
|
Christoph Lenzen
|
Christoph Lenzen and Roger Wattenhofer
|
CLEX: Yet Another Supercomputer Architecture?
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the CLEX supercomputer topology and routing scheme. We prove that
CLEX can utilize a constant fraction of the total bandwidth for point-to-point
communication, at delays proportional to the sum of the number of intermediate
hops and the maximum physical distance between any two nodes. Moreover, %
applying an asymmetric bandwidth assignment to the links, all-to-all
communication can be realized $(1+o(1))$-optimally both with regard to
bandwidth and delays. This is achieved at node degrees of $n^{\varepsilon}$,
for an arbitrary small constant $\varepsilon\in (0,1]$. In contrast, these
results are impossible in any network featuring constant or polylogarithmic
node degrees. Through simulation, we assess the benefits of an implementation
of the proposed communication strategy. Our results indicate that, for a
million processors, CLEX can increase bandwidth utilization and reduce average
routing path length by at least factors $10$ respectively $5$ in comparison to
a torus network. Furthermore, the CLEX communication scheme features several
other properties, such as deadlock-freedom, inherent fault-tolerance, and
canonical partition into smaller subsystems.
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 15:58:51 GMT"
}
] | 2016-07-04T00:00:00 |
[
[
"Lenzen",
"Christoph",
""
],
[
"Wattenhofer",
"Roger",
""
]
] |
new_dataset
| 0.996346 |
1511.08066
|
Andreas Brandstadt
|
Andreas Brandstadt and Raffaele Mosca
|
Maximum Weight Independent Sets for ($P_7$,Triangle)-Free Graphs in
Polynomial Time
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs
with vertex weights asks for a set of pairwise nonadjacent vertices of maximum
weight sum. MWIS is one of the most investigated and most important algorithmic
graph problems; it is well known to be NP-complete, and it remains NP-complete
even under various strong restrictions such as for triangle-free graphs. Its
complexity was an open problem for $P_k$-free graphs, $k \ge 5$. Recently,
Lokshtanov, Vatshelle, and Villanger proved that MWIS can be solved in
polynomial time for $P_5$-free graphs, and Lokshtanov, Pilipczuk, and van
Leeuwen proved that MWIS can be solved in quasi-polynomial time for $P_6$-free
graphs. It still remains an open problem whether MWIS can be solved in
polynomial time for $P_k$-free graphs, $k \geq 6$ or in quasi-polynomial time
for $P_k$-free graphs, $k \geq 7$. Some characterizations of $P_k$-free graphs
and some progress are known in the literature but so far did not solve the
problem. In this paper, we show that MWIS can be solved in polynomial time for
($P_7$,triangle)-free graphs. This extends the corresponding result for
($P_6$,triangle)-free graphs and may provide some progress in the study of MWIS
for $P_7$-free graphs.
|
[
{
"version": "v1",
"created": "Wed, 25 Nov 2015 14:08:30 GMT"
},
{
"version": "v2",
"created": "Fri, 13 May 2016 14:08:14 GMT"
},
{
"version": "v3",
"created": "Thu, 30 Jun 2016 07:42:23 GMT"
}
] | 2016-07-01T00:00:00 |
[
[
"Brandstadt",
"Andreas",
""
],
[
"Mosca",
"Raffaele",
""
]
] |
new_dataset
| 0.982834 |
1606.09521
|
Rafael Pe\~naloza
|
Rafael Pe\~naloza, Nico Potyka
|
Probabilistic Reasoning in the Description Logic ALCP with the Principle
of Maximum Entropy (Full Version)
|
Full version of paper accepted at the Tenth International Conference
on Scalable Uncertainty Management (SUM 2016)
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A central question for knowledge representation is how to encode and handle
uncertain knowledge adequately. We introduce the probabilistic description
logic ALCP that is designed for representing context-dependent knowledge, where
the actual context taking place is uncertain. ALCP allows the expression of
logical dependencies on the domain and probabilistic dependencies on the
possible contexts. In order to draw probabilistic conclusions, we employ the
principle of maximum entropy. We provide reasoning algorithms for this logic,
and show that it satisfies several desirable properties of probabilistic
logics.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2016 14:49:01 GMT"
}
] | 2016-07-01T00:00:00 |
[
[
"Peñaloza",
"Rafael",
""
],
[
"Potyka",
"Nico",
""
]
] |
new_dataset
| 0.955916 |
1606.09540
|
Nobuyuki Umetani Dr
|
Nobuyuki Umetani, Ryan Schmidt
|
SurfCuit: Surface Mounted Circuits on 3D Prints
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present, SurfCuit, a novel approach to design and construction of electric
circuits on the surface of 3D prints. Our surface mounting technique allows
durable construction of circuits on the surface of 3D prints. SurfCuit does not
require tedious circuit casing design or expensive set-ups, thus we can
expedite the process of circuit construction for 3D models. Our technique
allows the user to construct complex circuits for consumer-level desktop fused
decomposition modeling (FDM) 3D printers. The key idea behind our technique is
that FDM plastic forms a strong bond with metal when it is melted. This
observation enables construction of a robust circuit traces using copper tape
and soldering. We also present an interactive tool to design such circuits on
arbitrary 3D geometry. We demonstrate the effectiveness of our approach through
various actual construction examples.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2016 15:37:53 GMT"
}
] | 2016-07-01T00:00:00 |
[
[
"Umetani",
"Nobuyuki",
""
],
[
"Schmidt",
"Ryan",
""
]
] |
new_dataset
| 0.999835 |
1606.09605
|
Joshua Joy
|
Joshua Joy, Minh Le, Mario Gerla
|
LocationSafe: Granular Location Privacy for IoT Devices
|
arXiv admin note: text overlap with arXiv:1604.04892
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, mobile data owners lack consent and control over the release and
utilization of their location data. Third party applications continuously
process and access location data without data owners granular control and
without knowledge of how location data is being used. The proliferation of IoT
devices will lead to larger scale abuses of trust.
In this paper we present the first design and implementation of a privacy
module built into the GPSD daemon. The GPSD daemon is a low-level GPS interface
that runs on GPS enabled devices. The integration of the privacy module ensures
that data owners have granular control over the release of their GPS location.
We describe the design of our privacy module and then evaluate the performance
of private GPS release and demonstrate that strong privacy guarantees can be
built into the GPSD daemon itself with minimal to no overhead.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2016 18:28:43 GMT"
}
] | 2016-07-01T00:00:00 |
[
[
"Joy",
"Joshua",
""
],
[
"Le",
"Minh",
""
],
[
"Gerla",
"Mario",
""
]
] |
new_dataset
| 0.998991 |
1602.03956
|
Daniel Filipe Farinha
|
Daniel Filipe G. Farinha
|
Grokya: a Privacy-Friendly Framework for Ubiquitous Computing
|
Master thesis
| null |
10.13140/RG.2.1.2452.3281
| null |
cs.CY cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
In a world where for-profit enterprises are increasingly looking to maximize
profits by engaging in privacy invading consumer-profiling techniques, the rise
of ubiquitous computing and the Internet of Things (IoT) poses a major problem.
If not acted upon quickly, the combination of Big Data with IoT will explode
into a dystopian world that even George Orwell could not have predicted. The
proposed project aims to fill a gap that no other solution is addressing, which
is to reach a win-win scenario that works for both the enterprises and the
consumers. It aims to do this by creating the building blocks for a consumer
owned infrastructure that can provide both privacy for the user, and still
enable the enterprises to achieve their high-level goals.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 03:18:47 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jun 2016 07:19:01 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Farinha",
"Daniel Filipe G.",
""
]
] |
new_dataset
| 0.999369 |
1604.07193
|
Wanderson Ten\'orio
|
Carlos Munuera, Wanderson Ten\'orio, Fernando Torres
|
Quantum error-correcting codes from Algebraic Geometry codes of Castle
type
|
18 pages. Final version
| null |
10.1007/s11128-016-1378-9
| null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study Algebraic Geometry codes producing quantum error-correcting codes by
the CSS construction. We pay particular attention to the family of Castle
codes. We show that many of the examples known in the literature in fact belong
to this family of codes. We systematize these constructions by showing the
common theory that underlies all of them.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 10:08:03 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jun 2016 15:18:50 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Jun 2016 12:58:16 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Munuera",
"Carlos",
""
],
[
"Tenório",
"Wanderson",
""
],
[
"Torres",
"Fernando",
""
]
] |
new_dataset
| 0.99882 |
1606.08955
|
Vinay Bettadapura
|
Vinay Bettadapura, Caroline Pantofaru, Irfan Essa
|
Leveraging Contextual Cues for Generating Basketball Highlights
|
Proceedings of ACM Multimedia 2016
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The massive growth of sports videos has resulted in a need for automatic
generation of sports highlights that are comparable in quality to the
hand-edited highlights produced by broadcasters such as ESPN. Unlike previous
works that mostly use audio-visual cues derived from the video, we propose an
approach that additionally leverages contextual cues derived from the
environment that the game is being played in. The contextual cues provide
information about the excitement levels in the game, which can be ranked and
selected to automatically produce high-quality basketball highlights. We
introduce a new dataset of 25 NCAA games along with their play-by-play stats
and the ground-truth excitement data for each basket. We explore the
informativeness of five different cues derived from the video and from the
environment through user studies. Our experiments show that for our study
participants, the highlights produced by our system are comparable to the ones
produced by ESPN for the same games.
|
[
{
"version": "v1",
"created": "Wed, 29 Jun 2016 05:04:27 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Bettadapura",
"Vinay",
""
],
[
"Pantofaru",
"Caroline",
""
],
[
"Essa",
"Irfan",
""
]
] |
new_dataset
| 0.999257 |
1606.09106
|
Yun Gao
|
Yun Gao and Tingting Wu and Fang-Wei Fu
|
A new trace bilinear form on cyclic $\mathbb{F}_q$-linear
$\mathbb{F}_{q^t}$-codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathbb{F}_q$ be a finite field of cardinality $q$, where $q$ is a power
of a prime number $p$, $t\geq 2$ an even number satisfying $t \not\equiv 1
\;(\bmod \;p)$ and $\mathbb{F}_{q^t}$ an extension field of $\mathbb{F}_q$ with
degree $t$. First, a new trace bilinear form on $\mathbb{F}_{{q^t}}^n$ which is
called $\Delta$-bilinear form is given, where $n$ is a positive integer coprime
to $q$. Then according to this new trace bilinear form, bases and enumeration
of cyclic $\Delta$-self-orthogonal and cyclic $\Delta$-self-dual
$\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes are investigated when $t=2$.
Furthermore, some good $\mathbb{F}_q$-linear $\mathbb{F}_{q^2}$-codes are
obtained.
|
[
{
"version": "v1",
"created": "Wed, 29 Jun 2016 14:04:30 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Gao",
"Yun",
""
],
[
"Wu",
"Tingting",
""
],
[
"Fu",
"Fang-Wei",
""
]
] |
new_dataset
| 0.998938 |
1606.09188
|
David Wood
|
David R. Wood
|
Three dimensional graph drawing with fixed vertices and one bend per
edge
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that for every graph $G$, given fixed locations for the vertices of
$G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with
one bend per edge. The best previous bound was three bends per edge.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2016 06:27:24 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Wood",
"David R.",
""
]
] |
new_dataset
| 0.995299 |
1606.09205
|
Henrik I Christensen
|
Henrik I Christensen, Allison Okamura, Maja Mataric, Vijay Kumar, Greg
Hager, and Howie Choset
|
Next Generation Robotics
|
A Computing Community Consortium (CCC) white paper, 22 pages
| null | null | null |
cs.CY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The National Robotics Initiative (NRI) was launched 2011 and is about to
celebrate its 5 year anniversary. In parallel with the NRI, the robotics
community, with support from the Computing Community Consortium, engaged in a
series of road mapping exercises. The first version of the roadmap appeared in
September 2009; a second updated version appeared in 2013. While not directly
aligned with the NRI, these road-mapping documents have provided both a useful
charting of the robotics research space, as well as a metric by which to
measure progress. This report sets forth a perspective of progress in robotics
over the past five years, and provides a set of recommendations for the future.
The NRI has in its formulation a strong emphasis on co-robot, i.e., robots that
work directly with people. An obvious question is if this should continue to be
the focus going forward? To try to assess what are the main trends, what has
happened the last 5 years and what may be promising directions for the future a
small CCC sponsored study was launched to have two workshops, one in Washington
DC (March 5th, 2016) and another in San Francisco, CA (March 11th, 2016). In
this report we brief summarize some of the main discussions and observations
from those workshops. We will present a variety of background information in
Section 2, and outline various issues related to progress over the last 5 years
in Section 3. In Section 4 we will outline a number of opportunities for moving
forward. Finally, we will summarize the main points in Section 5.
|
[
{
"version": "v1",
"created": "Wed, 29 Jun 2016 18:06:53 GMT"
}
] | 2016-06-30T00:00:00 |
[
[
"Christensen",
"Henrik I",
""
],
[
"Okamura",
"Allison",
""
],
[
"Mataric",
"Maja",
""
],
[
"Kumar",
"Vijay",
""
],
[
"Hager",
"Greg",
""
],
[
"Choset",
"Howie",
""
]
] |
new_dataset
| 0.992561 |
1510.00627
|
Setareh Maghsudi
|
Setareh Maghsudi and Ekram Hossain
|
Multi-armed Bandits with Application to 5G Small Cells
|
10 pages
| null |
10.1109/MWC.2016.7498076
| null |
cs.LG cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the pervasive demand for mobile services, next generation wireless
networks are expected to be able to deliver high date rates while wireless
resources become more and more scarce. This requires the next generation
wireless networks to move towards new networking paradigms that are able to
efficiently support resource-demanding applications such as personalized mobile
services. Examples of such paradigms foreseen for the emerging fifth generation
(5G) cellular networks include very densely deployed small cells and
device-to-device communications. For 5G networks, it will be imperative to
search for spectrum and energy-efficient solutions to the resource allocation
problems that i) are amenable to distributed implementation, ii) are capable of
dealing with uncertainty and lack of information, and iii) can cope with users'
selfishness. The core objective of this article is to investigate and to
establish the potential of multi-armed bandit (MAB) framework to address this
challenge. In particular, we provide a brief tutorial on bandit problems,
including different variations and solution approaches. Furthermore, we discuss
recent applications as well as future research directions. In addition, we
provide a detailed example of using an MAB model for energy-efficient small
cell planning in 5G networks.
|
[
{
"version": "v1",
"created": "Fri, 2 Oct 2015 15:49:59 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Maghsudi",
"Setareh",
""
],
[
"Hossain",
"Ekram",
""
]
] |
new_dataset
| 0.99809 |
1602.07424
|
Matteo Riondato
|
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
|
TRI\`EST: Counting Local and Global Triangles in Fully-dynamic Streams
with Fixed Memory Size
|
49 pages, 7 figures, extended version of the paper appeared at ACM
KDD'16
| null | null | null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present TRI\`EST, a suite of one-pass streaming algorithms to compute
unbiased, low-variance, high-quality approximations of the global and local
(i.e., incident to each vertex) number of triangles in a fully-dynamic graph
represented as an adversarial stream of edge insertions and deletions. Our
algorithms use reservoir sampling and its variants to exploit the
user-specified memory space at all times. This is in contrast with previous
approaches which use hard-to-choose parameters (e.g., a fixed sampling
probability) and offer no guarantees on the amount of memory they will use. We
show a full analysis of the variance of the estimations and novel concentration
bounds for these quantities. Our experimental results on very large graphs show
that TRI\`EST outperforms state-of-the-art approaches in accuracy and exhibits
a small update time.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2016 07:39:27 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jun 2016 18:51:06 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"De Stefani",
"Lorenzo",
""
],
[
"Epasto",
"Alessandro",
""
],
[
"Riondato",
"Matteo",
""
],
[
"Upfal",
"Eli",
""
]
] |
new_dataset
| 0.966967 |
1603.00960
|
Jan Egger
|
Jan Egger, Christopher Nimsky
|
Cellular Automata Segmentation of the Boundary between the Compacta of
Vertebral Bodies and Surrounding Structures
|
6 pages, 5 figures, 1 table, 42 references
|
SPIE Medical Imaging Conference 2016, Paper 9787-52
|
10.1117/12.2209039
| null |
cs.CV cs.CG cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the aging population, spinal diseases get more and more common
nowadays; e.g., lifetime risk of osteoporotic fracture is 40% for white women
and 13% for white men in the United States. Thus the numbers of surgical spinal
procedures are also increasing with the aging population and precise diagnosis
plays a vital role in reducing complication and recurrence of symptoms. Spinal
imaging of vertebral column is a tedious process subjected to interpretation
errors. In this contribution, we aim to reduce time and error for vertebral
interpretation by applying and studying the GrowCut-algorithm for boundary
segmentation between vertebral body compacta and surrounding structures.
GrowCut is a competitive region growing algorithm using cellular automata. For
our study, vertebral T2-weighted Magnetic Resonance Imaging (MRI) scans were
first manually outlined by neurosurgeons. Then, the vertebral bodies were
segmented in the medical images by a GrowCut-trained physician using the
semi-automated GrowCut-algorithm. Afterwards, results of both segmentation
processes were compared using the Dice Similarity Coefficient (DSC) and the
Hausdorff Distance (HD) which yielded to a DSC of 82.99+/-5.03% and a HD of
18.91+/-7.2 voxel, respectively. In addition, the times have been measured
during the manual and the GrowCut segmentations, showing that a
GrowCut-segmentation - with an average time of less than six minutes
(5.77+/-0.73) - is significantly shorter than a pure manual outlining.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2016 03:35:07 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Nimsky",
"Christopher",
""
]
] |
new_dataset
| 0.956229 |
1606.08536
|
Nicholas Hopper
|
Max Schuchard and Nicholas Hopper
|
E-Embargoes: Discouraging the Deployment of Traffic Manipulating Boxes
With Economic Incentives
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An increasing number of systems have been proposed or deployed to the transit
core of the Internet with the goal of observing and manipulating traffic in
flight, systems we term Traffic Manipulating Boxes. Examples of these include:
decoy routing systems, surveillance infrastructure like the NSA's alleged
QUANTUM project, and traffic shaping middleboxes. In this work, we examine a
new approach that a routing capable adversary might take to resisting these
systems: the use of economic pressure to incentivize ISPs to remove them.
Rather than directly attacking the availability of these systems, our attack
inflicts economic losses, in the form of reduced transit revenue, on ISPs that
deploy them, while at the same time incentivizing ISPs that do not.
We alter and expand upon previous routing around decoys attack of Schuchard
et al., by adjusting the priority given to avoiding TMBs. This reduces or
eliminates the key costs faced by routing capable adversary while maintaining
the effectiveness of the attack. Additionally, we show that since the flow of
traffic on the Internet is directly related to the flow of cash between ISPs, a
routing capable adversary is actually a powerful economic adversary. Our
findings show that by preferentially using routes which are free of TMBs, some
routing capable adversaries can inflict in excess of a billion dollars in
annual revenue losses.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2016 02:00:50 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Schuchard",
"Max",
""
],
[
"Hopper",
"Nicholas",
""
]
] |
new_dataset
| 0.983457 |
1606.08545
|
Saurabha Tavildar
|
Saurabha R. Tavildar
|
A H-ARQ scheme for polar codes
|
5 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of supporting H-ARQ with polar codes. For supporting
H-ARQ, we propose to create redundancy versions based on different, but
equivalent, subsets of a polar code. The equivalent subsets are created from an
initial subset of a polar code using an inherent symmetry in polar code
construction. A greedy construction is used to create the initial subset of a
polar code. We demonstrate performance of proposed constructions via
simulations for binary input AWGN channel. We demonstrate that a (4096, 1024)
polar code can be divided into two disjoint (2048, 1024) subset polar codes,
which when decoded individually are within 0.2 dB (at $1 \%$ BLER) of a (2048,
1024) polar code, and achieve performance of a (4096, 1024) polar code when
decoded jointly.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2016 03:25:58 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Tavildar",
"Saurabha R.",
""
]
] |
new_dataset
| 0.999046 |
1606.08708
|
Chelsea Battell
|
Chelsea Battell
|
Domain Specific Language for Modular Knitting Pattern Definitions: Purl
|
124 pages, undergraduate project
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purl is a language to be used for modular definition and verification of
knitting patterns. The syntax is similar to the standard knitting pattern
notation provided by the Craft Yarn Council. Purl provides constructs not
available in the standard notation to allow reuse of segments of patterns. This
report describes the basics of knitting and hand-knitting patterns. A knitting
pattern language more terse than the standard notation is presented with the
implementation of a compiler to this standard.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2016 14:15:34 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Battell",
"Chelsea",
""
]
] |
new_dataset
| 0.960567 |
1606.08741
|
Bharadwaj Satchidanandan
|
Bharadwaj Satchidanandan, and P. R. Kumar
|
Dynamic Watermarking: Active Defense of Networked Cyber-Physical Systems
| null | null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The coming decades may see the large scale deployment of networked
cyber-physical systems to address global needs in areas such as energy, water,
healthcare, and transportation. However, as recent events have shown, such
systems are vulnerable to cyber attacks. Being safety critical, their
disruption or misbehavior can cause economic losses or injuries and loss of
life. It is therefore important to secure such networked cyber-physical systems
against attacks. In the absence of credible security guarantees, there will be
resistance to the proliferation of cyber-physical systems, which are much
needed to meet global needs in critical infrastructures and services.
This paper addresses the problem of secure control of networked
cyber-physical systems. This problem is different from the problem of securing
the communication network, since cyber-physical systems at their very essence
need sensors and actuators that interface with the physical plant, and
malicious agents may tamper with sensors or actuators, as recent attacks have
shown.
We consider physical plants that are being controlled by multiple actuators
and sensors communicating over a network, where some sensors could be
"malicious," meaning that they may not report the measurements that they
observe. We address a general technique by which the actuators can detect the
actions of malicious sensors in the system, and disable closed-loop control
based on their information. This technique, called "watermarking," employs the
technique of actuators injecting private excitation into the system which will
reveal malicious tampering with signals. We show how such an active defense can
be used to secure networked systems of sensors and actuators.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2016 06:06:07 GMT"
}
] | 2016-06-29T00:00:00 |
[
[
"Satchidanandan",
"Bharadwaj",
""
],
[
"Kumar",
"P. R.",
""
]
] |
new_dataset
| 0.989339 |
1202.4160
|
Frank Gurski
|
Frank Gurski, Patrick Gwydion Poullie
|
Interval Routing Schemes for Circular-Arc Graphs
|
17 pages, to appear in "International Journal of Foundations of
Computer Science"
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interval routing is a space efficient method to realize a distributed routing
function. In this paper we show that every circular-arc graph allows a shortest
path strict 2-interval routing scheme, i.e., by introducing a global order on
the vertices and assigning at most two (strict) intervals in this order to the
ends of every edge allows to depict a routing function that implies exclusively
shortest paths. Since circular-arc graphs do not allow shortest path 1-interval
routing schemes in general, the result implies that the class of circular-arc
graphs has strict compactness 2, which was a hitherto open question.
Additionally, we show that the constructed 2-interval routing scheme is a
1-interval routing scheme with at most one additional interval assigned at each
vertex and we an outline algorithm to calculate the routing scheme for
circular-arc graphs in O(n^2) time, where n is the number of vertices.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2012 15:33:15 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Nov 2014 15:15:18 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Mar 2016 12:10:05 GMT"
},
{
"version": "v4",
"created": "Mon, 27 Jun 2016 08:28:03 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Gurski",
"Frank",
""
],
[
"Poullie",
"Patrick Gwydion",
""
]
] |
new_dataset
| 0.998083 |
1606.07803
|
Leon Abdillah
|
Febri Valentina, Leon Andretti Abdillah, Nurul Adha Oktarini Saputri
|
Penerapan E-Service Berbasis Android pada Divisi Pelayanan Perbaikan
Komputer CV Ria Kencana Ungu (RKU)
|
6 pages, Paper presented at the SHaP-SITI2016, Palembang (2016)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Archival information systems in government agency is one of the most used
applications for daily acitivities. One feature in application management
information document is searching. This feature serves to search for documents
from a collection of available information based on keywords entered by the
user. But some researches on a search engine (searching) concluded that the
average user error in the search is quite high due to several factors.
Therefore, we need a development on this feature as search suggestion. This
study discusses the application of the method of approximate string matching
algorithm using levenshtein distance. Levensthein distance algorithm is capable
of calculating the minimum distance conversion of a string into another string
to the optimum. Archiving information system using Levensthein Algorithm String
is an application that will be built to address these problems, this
application will help, especially in the administration to enter or save a
document, locate and make a report that will be seen by government agencies.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2016 01:31:50 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Valentina",
"Febri",
""
],
[
"Abdillah",
"Leon Andretti",
""
],
[
"Saputri",
"Nurul Adha Oktarini",
""
]
] |
new_dataset
| 0.980626 |
1606.07852
|
Jing Pu
|
Jing Pu, Sameh Galal, Xuan Yang, Ofer Shacham, Mark Horowitz
|
FPMax: a 106GFLOPS/W at 217GFLOPS/mm2 Single-Precision FPU, and a
43.7GFLOPS/W at 74.6GFLOPS/mm2 Double-Precision FPU, in 28nm UTBB FDSOI
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
FPMax implements four FPUs optimized for latency or throughput workloads in
two precisions, fabricated in 28nm UTBB FDSOI. Each unit's parameters, e.g
pipeline stages, booth encoding etc., were optimized to yield 1.42ns latency at
110GLOPS/W (SP) and 1.39ns latency at 36GFLOPS/W (DP). At 100% activity,
body-bias control improves the energy efficiency by about 20%; at 10% activity
this saving is almost 2x.
Keywords: FPU, energy efficiency, hardware generator, SOI
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2016 23:20:50 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Pu",
"Jing",
""
],
[
"Galal",
"Sameh",
""
],
[
"Yang",
"Xuan",
""
],
[
"Shacham",
"Ofer",
""
],
[
"Horowitz",
"Mark",
""
]
] |
new_dataset
| 0.997328 |
1606.07863
|
Sam Chiu-wai Wong
|
Yajun Wang and Sam Chiu-wai Wong
|
Matroid Online Bipartite Matching and Vertex Cover
|
19 pages, to appear in EC'16
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Adwords and Online Bipartite Matching problems have enjoyed a renewed
attention over the past decade due to their connection to Internet advertising.
Our community has contributed, among other things, new models (notably
stochastic) and extensions to the classical formulations to address the issues
that arise from practical needs. In this paper, we propose a new generalization
based on matroids and show that many of the previous results extend to this
more general setting. Because of the rich structures and expressive power of
matroids, our new setting is potentially of interest both in theory and in
practice.
In the classical version of the problem, the offline side of a bipartite
graph is known initially while vertices from the online side arrive one at a
time along with their incident edges. The objective is to maintain a decent
approximate matching from which no edge can be removed. Our generalization,
called Matroid Online Bipartite Matching, additionally requires that the set of
matched offline vertices be independent in a given matroid. In particular, the
case of partition matroids corresponds to the natural scenario where each
advertiser manages multiple ads with a fixed total budget.
Our algorithms attain the same performance as the classical version of the
problems considered, which are often provably the best possible. We present
$1-1/e$-competitive algorithms for Matroid Online Bipartite Matching under the
small bid assumption, as well as a $1-1/e$-competitive algorithm for Matroid
Online Bipartite Matching in the random arrival model. A key technical
ingredient of our results is a carefully designed primal-dual waterfilling
procedure that accommodates for matroid constraints. This is inspired by the
extension of our recent charging scheme for Online Bipartite Vertex Cover.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2016 01:21:35 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Wang",
"Yajun",
""
],
[
"Wong",
"Sam Chiu-wai",
""
]
] |
new_dataset
| 0.999229 |
1606.07932
|
Charith Perera
|
Luiz Nunes, Julio Estrella, Luis Nakamura, Rafael de Libardi, Carlos
Ferreira, Liuri Jorge, Charith Perera, Stephan Reiff-Marganiec
|
A Distributed Sensor Data Search Platform for Internet of Things
Environments
|
International Journal of Services Computing (ISSN 2330-4472) Vol. 4,
No.1, January - March, 2016
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, the number of devices has grown increasingly and it is hoped that,
between 2015 and 2016, 20 billion devices will be connected to the Internet and
this market will move around 91.5 billion dollars. The Internet of Things (IoT)
is composed of small sensors and actuators embedded in objects with Internet
access and will play a key role in solving many challenges faced in today's
society. However, the real capacity of IoT concepts is constrained as the
current sensor networks usually do not exchange information with other sources.
In this paper, we propose the Visual Search for Internet of Things (ViSIoT)
platform to help technical and non-technical users to discover and use sensors
as a service for different application purposes. As a proof of concept, a real
case study is used to generate weather condition reports to support rheumatism
patients. This case study was executed in a working prototype and a performance
evaluation is presented.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2016 17:09:01 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Nunes",
"Luiz",
""
],
[
"Estrella",
"Julio",
""
],
[
"Nakamura",
"Luis",
""
],
[
"de Libardi",
"Rafael",
""
],
[
"Ferreira",
"Carlos",
""
],
[
"Jorge",
"Liuri",
""
],
[
"Perera",
"Charith",
""
],
[
"Reiff-Marganiec",
"Stephan",
""
]
] |
new_dataset
| 0.979614 |
1606.07991
|
Amol Patwardhan
|
Amol Patwardhan, Rahul Patwardhan and Sumalini Vartak
|
Self-Contained Cross-Cutting Pipeline Software Architecture
|
(Peer reviewed and Accepted paper)4 pages, 2 figures, 2 tables, 3
charts. Key Words: Continuous deployment, Agile development, Unit testable
code, roll back, layered architecture, n-tier architecture, International
Research Journal of Engineering and Technology (IRJET), vol 3, no 5, June
2016
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Layered software architecture contains several intra-layer and inter-layer
dependencies. Each layer depends on shared components making it difficult to
release a code change, bug fix or feature without exhaustive testing and having
to build the entire software code base. This paper proposed self-contained,
cross-cutting pipeline architecture (SCPA) that is independent of existing
layers. We chose 2 open source projects and 3 internal intern projects that
used n-tier architecture and applied the SCPA to release subsequent feature
additions and any bug fixes. The SCPA decreased the release time by 42.99%. The
lines of delivered code (LOC), increased by 22.58%. The number of defects found
in existing functionality decreased by 85.54%. The SCPA also provided ability
to roll back or switch off the new feature quickly. SCPA proved a suitable
architecture for agile software development and continuous deployment.
|
[
{
"version": "v1",
"created": "Sun, 26 Jun 2016 03:23:02 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Patwardhan",
"Amol",
""
],
[
"Patwardhan",
"Rahul",
""
],
[
"Vartak",
"Sumalini",
""
]
] |
new_dataset
| 0.998033 |
1606.08253
|
Petros Elia
|
Jingjing Zhang and Petros Elia
|
Wireless Coded Caching: A Topological Perspective
|
7 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore the performance of coded caching in a SISO BC setting where some
users have higher link capacities than others. Focusing on a binary and fixed
topological model where strong links have a fixed normalized capacity 1, and
where weak links have reduced normalized capacity $\tau<1$, we identify --- as
a function of the cache size and $\tau$ --- the optimal throughput performance,
within a factor of at most 8. The transmission scheme that achieves this
performance, employs a simple form of interference enhancement, and exploits
the property that weak links attenuate interference, thus allowing for
multicasting rates to remain high even when involving weak users. This approach
ameliorates the negative effects of uneven topology in multicasting, now
allowing all users to achieve the optimal performance associated to $\tau=1$,
even if $\tau$ is approximately as low as $\tau\geq 1-(1-w)^g$ where $g$ is the
coded-caching gain, and where $w$ is the fraction of users that are weak. This
leads to the interesting conclusion that for coded multicasting, the weak users
need not bring down the performance of all users, but on the contrary to a
certain extent, the strong users can lift the performance of the weak users
without any penalties on their own performance. Furthermore for smaller ranges
of $\tau$, we also see that achieving the near-optimal performance comes with
the advantage that the strong users do not suffer any additional delays
compared to the case where $\tau = 1$.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2016 13:03:17 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Zhang",
"Jingjing",
""
],
[
"Elia",
"Petros",
""
]
] |
new_dataset
| 0.998079 |
1606.08270
|
Naomi Saphra
|
Naomi Saphra and Adam Lopez
|
Evaluating Informal-Domain Word Representations With UrbanDictionary
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Existing corpora for intrinsic evaluation are not targeted towards tasks in
informal domains such as Twitter or news comment forums. We want to test
whether a representation of informal words fulfills the promise of eliding
explicit text normalization as a preprocessing step. One possible evaluation
metric for such domains is the proximity of spelling variants. We propose how
such a metric might be computed and how a spelling variant dataset can be
collected using UrbanDictionary.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2016 13:39:54 GMT"
}
] | 2016-06-28T00:00:00 |
[
[
"Saphra",
"Naomi",
""
],
[
"Lopez",
"Adam",
""
]
] |
new_dataset
| 0.992229 |
1601.04848
|
Quirin Scheitle
|
Quirin Scheitle, Matthias Wachs, Johannes Zirngibl, Georg Carle
|
Analyzing Locality of Mobile Messaging Traffic using the MATAdOR
Framework
|
To appear at Passive and Active Measurements Conference 2016
| null |
10.1007/978-3-319-30505-9_15
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile messaging services have gained a large share in global
telecommunications. Unlike conventional services like phone calls, text
messages or email, they do not feature a standardized environment enabling a
federated and potentially local service architecture. We present an extensive
and large-scale analysis of communication patterns for four popular mobile
messaging services between 28 countries and analyze the locality of
communication and the resulting impact on user privacy. We show that server
architectures for mobile messaging services are highly centralized in single
countries. This forces messages to drastically deviate from a direct
communication path, enabling hosting and transfer countries to potentially
intercept and censor traffic. To conduct this work, we developed a measurement
framework to analyze traffic of such mobile messaging services. It allows to
conduct automated experiments with mobile messaging applications, is
transparent to those applications and does not require any modifications to the
applications.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2016 09:59:43 GMT"
}
] | 2016-06-27T00:00:00 |
[
[
"Scheitle",
"Quirin",
""
],
[
"Wachs",
"Matthias",
""
],
[
"Zirngibl",
"Johannes",
""
],
[
"Carle",
"Georg",
""
]
] |
new_dataset
| 0.998368 |
1606.07496
|
Roberto Camacho Barranco
|
Roberto Camacho Barranco (1), Laura M. Rodriguez (1), Rebecca Urbina
(1), and M. Shahriar Hossain (1) ((1) The University of Texas at El Paso)
|
Is a Picture Worth Ten Thousand Words in a Review Dataset?
|
10 pages, 11 figures, "for associated results, see
http://http://auto-captioning.herokuapp.com/" "submitted to DLRS 2016
workshop"
| null | null | null |
cs.CV cs.CL cs.IR cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While textual reviews have become prominent in many recommendation-based
systems, automated frameworks to provide relevant visual cues against text
reviews where pictures are not available is a new form of task confronted by
data mining and machine learning researchers. Suggestions of pictures that are
relevant to the content of a review could significantly benefit the users by
increasing the effectiveness of a review. We propose a deep learning-based
framework to automatically: (1) tag the images available in a review dataset,
(2) generate a caption for each image that does not have one, and (3) enhance
each review by recommending relevant images that might not be uploaded by the
corresponding reviewer. We evaluate the proposed framework using the Yelp
Challenge Dataset. While a subset of the images in this particular dataset are
correctly captioned, the majority of the pictures do not have any associated
text. Moreover, there is no mapping between reviews and images. Each image has
a corresponding business-tag where the picture was taken, though. The overall
data setting and unavailability of crucial pieces required for a mapping make
the problem of recommending images for reviews a major challenge. Qualitative
and quantitative evaluations indicate that our proposed framework provides high
quality enhancements through automatic captioning, tagging, and recommendation
for mapping reviews and images.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 22:04:08 GMT"
}
] | 2016-06-27T00:00:00 |
[
[
"Barranco",
"Roberto Camacho",
"",
"The University of Texas at El Paso"
],
[
"Rodriguez",
"Laura M.",
"",
"The University of Texas at El Paso"
],
[
"Urbina",
"Rebecca",
"",
"The University of Texas at El Paso"
],
[
"Hossain",
"M. Shahriar",
"",
"The University of Texas at El Paso"
]
] |
new_dataset
| 0.996627 |
1606.07550
|
Rok Sosic
|
Jure Leskovec and Rok Sosic
|
SNAP: A General Purpose Network Analysis and Graph Mining Library
| null | null | null | null |
cs.SI cs.DB physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large networks are becoming a widely used abstraction for studying complex
systems in a broad set of disciplines, ranging from social network analysis to
molecular biology and neuroscience. Despite an increasing need to analyze and
manipulate large networks, only a limited number of tools are available for
this task.
Here, we describe Stanford Network Analysis Platform (SNAP), a
general-purpose, high-performance system that provides easy to use, high-level
operations for analysis and manipulation of large networks. We present SNAP
functionality, describe its implementational details, and give performance
benchmarks. SNAP has been developed for single big-memory machines and it
balances the trade-off between maximum performance, compact in-memory graph
representation, and the ability to handle dynamic graphs where nodes and edges
are being added or removed over time. SNAP can process massive networks with
hundreds of millions of nodes and billions of edges. SNAP offers over 140
different graph algorithms that can efficiently manipulate large graphs,
calculate structural properties, generate regular and random graphs, and handle
attributes and meta-data on nodes and edges. Besides being able to handle large
graphs, an additional strength of SNAP is that networks and their attributes
are fully dynamic, they can be modified during the computation at low cost.
SNAP is provided as an open source library in C++ as well as a module in
Python.
We also describe the Stanford Large Network Dataset, a set of social and
information real-world networks and datasets, which we make publicly available.
The collection is a complementary resource to our SNAP software and is widely
used for development and benchmarking of graph analytics algorithms.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2016 03:17:12 GMT"
}
] | 2016-06-27T00:00:00 |
[
[
"Leskovec",
"Jure",
""
],
[
"Sosic",
"Rok",
""
]
] |
new_dataset
| 0.98759 |
1004.3236
|
Giorgi Japaridze
|
Giorgi Japaridze
|
Introduction to clarithmetic II
| null |
Information and Computation 247 (2016), pp.290-312
|
10.1016/j.ic.2016.02.002
| null |
cs.LO cs.CC math.LO math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The earlier paper "Introduction to clarithmetic I" constructed an axiomatic
system of arithmetic based on computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and
extensional completeness with respect to polynomial time computability. The
present paper elaborates three additional sound and complete systems in the
same style and sense: one for polynomial space computability, one for
elementary recursive time (and/or space) computability, and one for primitive
recursive time (and/or space) computability.
|
[
{
"version": "v1",
"created": "Mon, 19 Apr 2010 15:56:39 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jul 2011 13:55:07 GMT"
},
{
"version": "v3",
"created": "Sun, 24 Jul 2011 11:53:58 GMT"
},
{
"version": "v4",
"created": "Tue, 23 Aug 2011 12:13:36 GMT"
},
{
"version": "v5",
"created": "Thu, 2 Aug 2012 12:00:28 GMT"
},
{
"version": "v6",
"created": "Wed, 24 Apr 2013 03:18:35 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Japaridze",
"Giorgi",
""
]
] |
new_dataset
| 0.987433 |
1502.02711
|
Michael Kiermaier
|
Javier de la Cruz, Michael Kiermaier, Alfred Wassermann and Wolfgang
Willems
|
Algebraic structures of MRD Codes
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on results in finite geometry we prove the existence of MRD codes in
(F_q)_(n,n) with minimum distance n which are essentially different from
Gabidulin codes. The construction results from algebraic structures which are
closely related to those of finite fields. Some of the results may be known to
experts, but to our knowledge have never been pointed out explicitly in the
literature.
|
[
{
"version": "v1",
"created": "Fri, 16 Jan 2015 16:15:46 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jun 2016 11:15:16 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"de la Cruz",
"Javier",
""
],
[
"Kiermaier",
"Michael",
""
],
[
"Wassermann",
"Alfred",
""
],
[
"Willems",
"Wolfgang",
""
]
] |
new_dataset
| 0.998137 |
1503.04673
|
Yuriy Pershin
|
Y. V. Pershin, L. K. Castelano, F. Hartmann, V. Lopez-Richard and M.
Di Ventra
|
A Memcomputing Pascaline
| null |
IEEE Trans. Circ. Syst. II 63, 558 (2016)
|
10.1109/TCSII.2016.2530378
| null |
cs.ET cond-mat.mes-hall cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The original Pascaline was a mechanical calculator able to sum and subtract
integers. It encodes information in the angles of mechanical wheels and through
a set of gears, and aided by gravity, could perform the calculations. Here, we
show that such a concept can be realized in electronics using memory elements
such as memristive systems. By using memristive emulators we have demonstrated
experimentally the memcomputing version of the mechanical Pascaline, capable of
processing and storing the numerical results in the multiple levels of each
memristive element. Our result is the first experimental demonstration of
multidigit arithmetics with multi-level memory devices that further emphasizes
the versatility and potential of memristive systems for future
massively-parallel high-density computing architectures.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2015 14:47:05 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Pershin",
"Y. V.",
""
],
[
"Castelano",
"L. K.",
""
],
[
"Hartmann",
"F.",
""
],
[
"Lopez-Richard",
"V.",
""
],
[
"Di Ventra",
"M.",
""
]
] |
new_dataset
| 0.998822 |
1606.07154
|
Mihajlo Grbovic
|
Mihajlo Grbovic, Vladan Radosavljevic, Nemanja Djuric, Narayan
Bhamidipati, Jaikit Savla, Varun Bhagwan, Doug Sharp
|
E-commerce in Your Inbox: Product Recommendations at Scale
|
10 pages, 12 figures, Proceedings of the 21th ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining (KDD 2015),
Sydney, Australia
|
Proceedings of the 21th ACM SIGKDD International Conference on
Knowledge Discovery and Data Mining (KDD 2015), Sydney, Australia
|
10.1145/2783258.2788627.
| null |
cs.AI cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years online advertising has become increasingly ubiquitous and
effective. Advertisements shown to visitors fund sites and apps that publish
digital content, manage social networks, and operate e-mail services. Given
such large variety of internet resources, determining an appropriate type of
advertising for a given platform has become critical to financial success.
Native advertisements, namely ads that are similar in look and feel to content,
have had great success in news and social feeds. However, to date there has not
been a winning formula for ads in e-mail clients. In this paper we describe a
system that leverages user purchase history determined from e-mail receipts to
deliver highly personalized product ads to Yahoo Mail users. We propose to use
a novel neural language-based algorithm specifically tailored for delivering
effective product recommendations, which was evaluated against baselines that
included showing popular products and products predicted based on
co-occurrence. We conducted rigorous offline testing using a large-scale
product purchase data set, covering purchases of more than 29 million users
from 172 e-commerce websites. Ads in the form of product recommendations were
successfully tested on online traffic, where we observed a steady 9% lift in
click-through rates over other ad formats in mail, as well as comparable lift
in conversion rates. Following successful tests, the system was launched into
production during the holiday season of 2014.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 01:20:59 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Grbovic",
"Mihajlo",
""
],
[
"Radosavljevic",
"Vladan",
""
],
[
"Djuric",
"Nemanja",
""
],
[
"Bhamidipati",
"Narayan",
""
],
[
"Savla",
"Jaikit",
""
],
[
"Bhagwan",
"Varun",
""
],
[
"Sharp",
"Doug",
""
]
] |
new_dataset
| 0.99975 |
1606.07161
|
Hongxi Tong
|
Hongxi Tong and Xiaoqing Wang
|
New MDS Euclidean and Hermitian self-dual codes over finite fields
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we construct MDS Euclidean self-dual codes which are extended
cyclic duadic codes.
And we obtain many new MDS Euclidean self-dual codes. We also construct MDS
Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic
codes. And we give some results on Hermitian self-dual codes, which are the
extended cyclic duadic codes.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 02:01:18 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Tong",
"Hongxi",
""
],
[
"Wang",
"Xiaoqing",
""
]
] |
new_dataset
| 0.997591 |
1606.07176
|
Jiaxin Yang
|
Jiaxin Yang and Qiang Li and Benoit Champagne and Yulong Zou and Lajos
Hanzo
|
Secure MIMO Relaying Network: An Artificial Noise Aided Robust Design
Approach
|
13 pages, 6 figures, one table and one supplementary document
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Owing to the vulnerability of relay-assisted and device-to-device (D2D)
communications, improving wireless security from a physical layer signal
processing perspective is attracting increasing interest. Hence we address the
problem of secure transmission in a relay-assisted network, where a pair of
legitimate user equipments (UEs) communicate with the aid of a multiple-input
multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves).
Assuming imperfect knowledge of the eves' channels, we jointly optimize the
power of the source UE, the amplify-and-forward (AF) relaying matrix and the
covariance of the artificial noise (AN) transmitted by the relay, in order to
maximize the received signal-to-interference-plus-noise ratio (SINR) at the
destination, while imposing a set of robust secrecy constraints. To tackle the
resultant nonconvex optimization problem, a globally optimal solution based on
a bi-level optimization framework is proposed, but with high complexity. Then a
low-complexity sub-optimal method relying on a new penalized
difference-of-convex (DC) algorithmic framework is proposed, which is
specifically designed for non-convex semidefinite programs (SDPs). We show how
this penalized DC framework can be invoked for solving our robust secure
relaying problem with proven convergence. Our extensive simulation results show
that both proposed solutions are capable of ensuring the secrecy of the
relay-aided transmission and significantly improve the robustness towards the
eves' channel uncertainties as compared to the non-robust counterparts. It is
also demonstrated the penalized DC-based method advocated yields a performance
close to the globally optimal solution.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 04:04:57 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Yang",
"Jiaxin",
""
],
[
"Li",
"Qiang",
""
],
[
"Champagne",
"Benoit",
""
],
[
"Zou",
"Yulong",
""
],
[
"Hanzo",
"Lajos",
""
]
] |
new_dataset
| 0.995178 |
1606.07208
|
John Augustine
|
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya
Higashikawa, Naoki Katoh, Prashanth Srikanthan
|
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities
|
24 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Dynamic Graph Network is a graph in which each edge has an associated
travel time and a capacity (width) that limits the number of items that can
travel in parallel along that edge. Each vertex in this dynamic graph network
begins with the number of items that must be evacuated into designated sink
vertices. A $k$-sink evacuation protocol finds the location of $k$ sinks and
associated evacuation movement protocol that allows evacuating all the items to
a sink in minimum time. The associated evacuation movement must impose a
confluent flow, i.e, all items passing through a particular vertex exit that
vertex using the same edge. In this paper we address the $k$-sink evacuation
problem on a dynamic path network. We provide solutions that run in $O(n \log
n)$ time for $k=1$ and $O(k n \log^2 n)$ for $k >1$ and work for arbitrary edge
capacities.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 07:13:55 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Arumugam",
"Guru Prakash",
""
],
[
"Augustine",
"John",
""
],
[
"Golin",
"Mordecai J.",
""
],
[
"Higashikawa",
"Yuya",
""
],
[
"Katoh",
"Naoki",
""
],
[
"Srikanthan",
"Prashanth",
""
]
] |
new_dataset
| 0.993379 |
1606.07324
|
Aniello Raffaele Patrone
|
Aniello Raffaele Patrone and Christian Valuch and Ulrich Ansorge and
Otmar Scherzer
|
Dynamical optical flow of saliency maps for predicting visual attention
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency maps are used to understand human attention and visual fixation.
However, while very well established for static images, there is no general
agreement on how to compute a saliency map of dynamic scenes. In this paper we
propose a mathematically rigorous approach to this prob- lem, including static
saliency maps of each video frame for the calculation of the optical flow.
Taking into account static saliency maps for calculating the optical flow
allows for overcoming the aperture problem. Our ap- proach is able to explain
human fixation behavior in situations which pose challenges to standard
approaches, such as when a fixated object disappears behind an occlusion and
reappears after several frames. In addition, we quantitatively compare our
model against alternative solutions using a large eye tracking data set.
Together, our results suggest that assessing optical flow information across a
series of saliency maps gives a highly accurate and useful account of human
overt attention in dynamic scenes.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 14:29:43 GMT"
}
] | 2016-06-24T00:00:00 |
[
[
"Patrone",
"Aniello Raffaele",
""
],
[
"Valuch",
"Christian",
""
],
[
"Ansorge",
"Ulrich",
""
],
[
"Scherzer",
"Otmar",
""
]
] |
new_dataset
| 0.995584 |
1604.05814
|
Wei Zhan
|
Jian Li, Wei Zhan
|
Almost All Even Yao-Yao Graphs Are Spanners
|
12 pages, 6 figures
| null | null | null |
cs.DS cs.CG
|
http://creativecommons.org/licenses/by/4.0/
|
It is an open problem whether Yao-Yao graphs $\mathsf{YY}_k$ (also known as
sparse-Yao graphs) are all spanners when the integer parameter $k$ is large
enough. In this paper we show that, for any integer $k\geq 42$, the Yao-Yao
graph $\mathsf{YY}_{2k}$ is a $t_k$-spanner, with stretch factor
$t_k=6.03+O(k^{-1})$ when $k$ tends to infinity. Our result generalizes the
best known result which asserts that all $\mathsf{YY}_{6k}$ are spanners for
$k$ large enough [Bauer and Damian, SODA'13]. Our proof is also somewhat
simpler.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 04:39:18 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jun 2016 04:28:09 GMT"
}
] | 2016-06-23T00:00:00 |
[
[
"Li",
"Jian",
""
],
[
"Zhan",
"Wei",
""
]
] |
new_dataset
| 0.999129 |
1604.06274
|
Tianyi Luo
|
Qixin Wang, Tianyi Luo, Dong Wang, Chao Xing
|
Chinese Song Iambics Generation with Neural Attention-based Model
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Learning and generating Chinese poems is a charming yet challenging task.
Traditional approaches involve various language modeling and machine
translation techniques, however, they perform not as well when generating poems
with complex pattern constraints, for example Song iambics, a famous type of
poems that involve variable-length sentences and strict rhythmic patterns. This
paper applies the attention-based sequence-to-sequence model to generate
Chinese Song iambics. Specifically, we encode the cue sentences by a
bi-directional Long-Short Term Memory (LSTM) model and then predict the entire
iambic with the information provided by the encoder, in the form of an
attention-based LSTM that can regularize the generation process by the fine
structure of the input cues. Several techniques are investigated to improve the
model, including global context integration, hybrid style training, character
vector initialization and adaptation. Both the automatic and subjective
evaluation results show that our model indeed can learn the complex structural
and rhythmic patterns of Song iambics, and the generation is rather successful.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2016 12:25:04 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jun 2016 20:21:32 GMT"
}
] | 2016-06-23T00:00:00 |
[
[
"Wang",
"Qixin",
""
],
[
"Luo",
"Tianyi",
""
],
[
"Wang",
"Dong",
""
],
[
"Xing",
"Chao",
""
]
] |
new_dataset
| 0.982532 |
1606.06061
|
Heiga Zen
|
Heiga Zen and Yannis Agiomyrgiannakis and Niels Egberts and Fergus
Henderson and Przemys{\l}aw Szczepaniak
|
Fast, Compact, and High Quality LSTM-RNN Based Statistical Parametric
Speech Synthesizers for Mobile Devices
|
13 pages, 3 figures, Interspeech 2016 (accepted)
| null | null | null |
cs.SD cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Acoustic models based on long short-term memory recurrent neural networks
(LSTM-RNNs) were applied to statistical parametric speech synthesis (SPSS) and
showed significant improvements in naturalness and latency over those based on
hidden Markov models (HMMs). This paper describes further optimizations of
LSTM-RNN-based SPSS for deployment on mobile devices; weight quantization,
multi-frame inference, and robust inference using an {\epsilon}-contaminated
Gaussian loss function. Experimental results in subjective listening tests show
that these optimizations can make LSTM-RNN-based SPSS comparable to HMM-based
SPSS in runtime speed while maintaining naturalness. Evaluations between
LSTM-RNN- based SPSS and HMM-driven unit selection speech synthesis are also
presented.
|
[
{
"version": "v1",
"created": "Mon, 20 Jun 2016 10:54:51 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jun 2016 15:11:30 GMT"
}
] | 2016-06-23T00:00:00 |
[
[
"Zen",
"Heiga",
""
],
[
"Agiomyrgiannakis",
"Yannis",
""
],
[
"Egberts",
"Niels",
""
],
[
"Henderson",
"Fergus",
""
],
[
"Szczepaniak",
"Przemysław",
""
]
] |
new_dataset
| 0.970164 |
1606.06840
|
Corneliu Florea
|
Oana Miu, Adrian Zamfir and Corneliu Florea
|
Person Identification Based on Hand Tremor Characteristics
|
10 pages, 4 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A plethora of biometric measures have been proposed in the past. In this
paper we introduce a new potential biometric measure: the human tremor. We
present a new method for identifying the user of a handheld device using
characteristics of the hand tremor measured with a smartphone built-in inertial
sensors (accelerometers and gyroscopes). The main challenge of the proposed
method is related to the fact that human normal tremor is very subtle while we
aim to address real-life scenarios. To properly address the issue, we have
relied on weighted Fourier linear combiner for retrieving only the tremor data
from the hand movement and random forest for actual recognition. We have
evaluated our method on a database with 10 000 samples from 17 persons reaching
an accuracy of 76%.
|
[
{
"version": "v1",
"created": "Wed, 22 Jun 2016 07:50:05 GMT"
}
] | 2016-06-23T00:00:00 |
[
[
"Miu",
"Oana",
""
],
[
"Zamfir",
"Adrian",
""
],
[
"Florea",
"Corneliu",
""
]
] |
new_dataset
| 0.99368 |
1511.01558
|
Yevgeniy Kovchegov
|
Yevgeniy Kovchegov and Ilya Zaliapin
|
Horton Law in Self-Similar Trees
| null | null |
10.1142/S0218348X16500171
| null |
cs.DM math.CO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self-similarity of random trees is related to the operation of pruning.
Pruning $R$ cuts the leaves and their parental edges and removes the resulting
chains of degree-two nodes from a finite tree. A Horton-Strahler order of a
vertex $v$ and its parental edge is defined as the minimal number of prunings
necessary to eliminate the subtree rooted at $v$. A branch is a group of
neighboring vertices and edges of the same order. The Horton numbers $N_k[K]$
and $N_{ij}[K]$ are defined as the expected number of branches of order $k$,
and the expected number of order-$i$ branches that merged order-$j$ branches,
$j>i$, respectively, in a finite tree of order $K$. The Tokunaga coefficients
are defined as $T_{ij}[K]=N_{ij}[K]/N_j[K]$. The pruning decreases the orders
of tree vertices by unity. A rooted full binary tree is said to be
mean-self-similar if its Tokunaga coefficients are invariant with respect to
pruning: $T_k:=T_{i,i+k}[K]$. We show that for self-similar trees, the
condition $\limsup(T_k)^{1/k}<\infty$ is necessary and sufficient for the
existence of the strong Horton law: $N_k[K]/N_1[K] \rightarrow R^{1-k}$, as $K
\rightarrow \infty$ for some $R>0$ and every $k\geq 1$. This work is a step
toward providing rigorous foundations for the Horton law that, being
omnipresent in natural branching systems, has escaped so far a formal
explanation.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2015 00:13:50 GMT"
}
] | 2016-06-22T00:00:00 |
[
[
"Kovchegov",
"Yevgeniy",
""
],
[
"Zaliapin",
"Ilya",
""
]
] |
new_dataset
| 0.995398 |
1601.05104
|
Ryan Womack
|
Ryan P. Womack
|
ARL Libraries and Research: Correlates of Grant Funding
|
revised June 2016 version of original January 2016 submission.
Revision contains no substantive changes, made exclusively to correct typos
detected in the original manuscript
| null |
10.1016/j.acalib.2016.06.006
| null |
cs.DL stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While providing the resources and tools that make advanced research possible
is a primary mission of academic libraries at large research universities, many
other elements also contribute to the success of the research enterprise, such
as institutional funding, staffing, labs, and equipment. This study focuses on
U.S. members of the ARL, the Association for Research Libraries. Research
success is measured by the total grant funding received by the University,
creating an ordered set of categories. Combining data from the NSF National
Center for Science and Engineering Statistics, ARL Statistics, and IPEDS, the
primary explanatory factors for research success are examined. Using linear
regression, logistic regression, and the cumulative logit model, the
best-fitting models generated by ARL data, NSF data, and the combined data set
for both nominal and per capita funding are compared. These models produce the
most relevant explanatory variables for research funding, which do not include
library-related variables in most cases.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 05:17:51 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jun 2016 04:13:36 GMT"
}
] | 2016-06-22T00:00:00 |
[
[
"Womack",
"Ryan P.",
""
]
] |
new_dataset
| 0.997178 |
1605.06409
|
Kaiming He
|
Jifeng Dai, Yi Li, Kaiming He, Jian Sun
|
R-FCN: Object Detection via Region-based Fully Convolutional Networks
|
Tech report
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present region-based, fully convolutional networks for accurate and
efficient object detection. In contrast to previous region-based detectors such
as Fast/Faster R-CNN that apply a costly per-region subnetwork hundreds of
times, our region-based detector is fully convolutional with almost all
computation shared on the entire image. To achieve this goal, we propose
position-sensitive score maps to address a dilemma between
translation-invariance in image classification and translation-variance in
object detection. Our method can thus naturally adopt fully convolutional image
classifier backbones, such as the latest Residual Networks (ResNets), for
object detection. We show competitive results on the PASCAL VOC datasets (e.g.,
83.6% mAP on the 2007 set) with the 101-layer ResNet. Meanwhile, our result is
achieved at a test-time speed of 170ms per image, 2.5-20x faster than the
Faster R-CNN counterpart. Code is made publicly available at:
https://github.com/daijifeng001/r-fcn
|
[
{
"version": "v1",
"created": "Fri, 20 May 2016 15:50:11 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jun 2016 15:28:57 GMT"
}
] | 2016-06-22T00:00:00 |
[
[
"Dai",
"Jifeng",
""
],
[
"Li",
"Yi",
""
],
[
"He",
"Kaiming",
""
],
[
"Sun",
"Jian",
""
]
] |
new_dataset
| 0.986548 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.