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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1707.03753
|
Valdis Vitolins
|
Valdis Vitolins
|
Modernized Latvian Ergonomic Keyboard
|
7 pages, 7 figures, presented in conference of Latvian Ergonomic
Society on 2011
| null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
Increasingly more people use computers and create content using keyboards
(even with leading edge touch-screen technology). As in the most part of the
world, in Latvia also conventional "Qwerty" keyboard is used. Though for
Latvian it is much worse than for English, especially due to enormous load to
little fingers. It causes repetitive strain injuries and affects productivity
of workers with extensive keyboard usage, especially for data input operators,
call centers, inquiry office workers, etc. Improving computer keyboard layout
decrease stress to hands and fingers thus minimizing exhaustion and injuries.
With analysis of English and Latvian public domain novels and modern texts,
letter appearance an sequence distribution for Latvian language was found.
Qualities of alternative layouts for English (Dvorak, Colemak, Hallinstad) were
investigated and open source carpalx simulation tool was adjusted according to
the findings. Then carpalx was used to check more than 25 million keyboard
layouts, measuring finger/hand effort, stroke typing convenience etc., to find
the best one. It was proved that existing "\v{S}usildatec" (classic Latvian
Ergonomic standard) keyboard is only slightly better than "Qwerty" for Latvian,
though it is much worse for English. After computer simulation, several best
layouts were tried practically for more than 6 months and most convenient one
was promoted as a new "Latvian Modern" keyboard. Its typing effort is less than
for "\v{S}usildatec", load is distributed according to finger strength, and
typing strokes are alternating better between hands and fingers. Comparing to
"Qwerty" keyboard new layout is better not only for Latvian but for English
also. Keyboard drivers are developed for Microsoft Windows and Linux operating
systems and are freely available in the web under permissive license.
|
[
{
"version": "v1",
"created": "Wed, 5 Jul 2017 13:51:33 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Vitolins",
"Valdis",
""
]
] |
new_dataset
| 0.999626 |
1707.03778
|
Amira Ghenai
|
Amira Ghenai, Yelena Mejova
|
Catching Zika Fever: Application of Crowdsourcing and Machine Learning
for Tracking Health Misinformation on Twitter
|
11 pages, 7 figures, short version to be published in the Fifth IEEE
International Conference on Healthcare Informatics (ICHI 2017)
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In February 2016, World Health Organization declared the Zika outbreak a
Public Health Emergency of International Concern. With developing evidence it
can cause birth defects, and the Summer Olympics coming up in the worst
affected country, Brazil, the virus caught fire on social media. In this work,
use Zika as a case study in building a tool for tracking the misinformation
around health concerns on Twitter. We collect more than 13 million tweets --
spanning the initial reports in February 2016 and the Summer Olympics --
regarding the Zika outbreak and track rumors outlined by the World Health
Organization and Snopes fact checking website. The tool pipeline, which
incorporates health professionals, crowdsourcing, and machine learning, allows
us to capture health-related rumors around the world, as well as clarification
campaigns by reputable health organizations. In the case of Zika, we discover
an extremely bursty behavior of rumor-related topics, and show that, once the
questionable topic is detected, it is possible to identify rumor-bearing tweets
using automated techniques. Thus, we illustrate insights the proposed tools
provide into potentially harmful information on social media, allowing public
health researchers and practitioners to respond with a targeted and timely
action.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 15:55:20 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Ghenai",
"Amira",
""
],
[
"Mejova",
"Yelena",
""
]
] |
new_dataset
| 0.989097 |
1408.5681
|
Louay Bazzi
|
Louay Bazzi
|
Weight distribution of cosets of small codes with good dual properties
| null |
IEEE Transactions on Information Theory. Volume: 61, Issue: 12,
Dec. 2015
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The bilateral minimum distance of a binary linear code is the maximum $d$
such that all nonzero codewords have weights between $d$ and $n-d$. Let
$Q\subset \{0,1\}^n$ be a binary linear code whose dual has bilateral minimum
distance at least $d$, where $d$ is odd. Roughly speaking, we show that the
average $L_\infty$-distance -- and consequently the $L_1$-distance -- between
the weight distribution of a random cosets of $Q$ and the binomial distribution
decays quickly as the bilateral minimum distance $d$ of the dual of $Q$
increases. For $d = \Theta(1)$, it decays like $n^{-\Theta(d)}$. On the other
$d=\Theta(n)$ extreme, it decays like and $e^{-\Theta(d)}$. It follows that,
almost all cosets of $Q$ have weight distributions very close to the to the
binomial distribution. In particular, we establish the following bounds. If the
dual of $Q$ has bilateral minimum distance at least $d=2t+1$, where $t\geq 1$
is an integer, then the average $L_\infty$-distance is at most
$\min\{\left(e\ln{\frac{n}{2t}}\right)^{t}\left(\frac{2t}{n}\right)^{\frac{t}{2}
}, \sqrt{2} e^{-\frac{t}{10}}\}$. For the average $L_1$-distance, we conclude
the bound $\min\{(2t+1)\left(e\ln{\frac{n}{2t}}\right)^{t}
\left(\frac{2t}{n}\right)^{\frac{t}{2}-1},\sqrt{2}(n+1)e^{-\frac{t}{10}}\}$,
which gives nontrivial results for $t\geq 3$. We given applications to the
weight distribution of cosets of extended Hadamard codes and extended dual BCH
codes. Our argument is based on Fourier analysis, linear programming, and
polynomial approximation techniques.
|
[
{
"version": "v1",
"created": "Mon, 25 Aug 2014 08:38:44 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jan 2015 09:58:24 GMT"
},
{
"version": "v3",
"created": "Sun, 16 Aug 2015 02:11:56 GMT"
},
{
"version": "v4",
"created": "Mon, 10 Jul 2017 20:22:23 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Bazzi",
"Louay",
""
]
] |
new_dataset
| 0.961346 |
1705.08506
|
Attila Kertesz-Farkas
|
Roman Chereshnev, Attila Kertesz-Farkas
|
HuGaDB: Human Gait Database for Activity Recognition from Wearable
Inertial Sensor Networks
|
4 Figures, 3 tables
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a human gait data collection for analysis and activity
recognition consisting of continues recordings of combined activities, such as
walking, running, taking stairs up and down, sitting down, and so on; and the
data recorded are segmented and annotated. Data were collected from a body
sensor network consisting of six wearable inertial sensors (accelerometer and
gyroscope) located on the right and left thighs, shins, and feet. Additionally,
two electromyography sensors were used on the quadriceps (front thigh) to
measure muscle activity. This database can be used not only for activity
recognition but also for studying how activities are performed and how the
parts of the legs move relative to each other. Therefore, the data can be used
(a) to perform health-care-related studies, such as in walking rehabilitation
or Parkinson's disease recognition, (b) in virtual reality and gaming for
simulating humanoid motion, or (c) for humanoid robotics to model humanoid
walking. This dataset is the first of its kind which provides data about human
gait in great detail. The database is available free of charge
https://github.com/romanchereshnev/HuGaDB.
|
[
{
"version": "v1",
"created": "Wed, 10 May 2017 13:36:38 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Jul 2017 14:25:43 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Chereshnev",
"Roman",
""
],
[
"Kertesz-Farkas",
"Attila",
""
]
] |
new_dataset
| 0.999426 |
1706.06291
|
Denis Parra
|
Gabriel Sepulveda, Vicente Dominguez and Denis Parra
|
pyRecLab: A Software Library for Quick Prototyping of Recommender
Systems
|
2 pages, poster submited to RecSys 2017 conference
| null | null | null |
cs.SE cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces pyRecLab, a software library written in C++ with Python
bindings which allows to quickly train, test and develop recommender systems.
Although there are several software libraries for this purpose, only a few let
developers to get quickly started with the most traditional methods, permitting
them to try different parameters and approach several tasks without a
significant loss of performance. Among the few libraries that have all these
features, they are available in languages such as Java, Scala or C#, what is a
disadvantage for less experienced programmers more used to the popular Python
programming language. In this article we introduce details of pyRecLab, showing
as well performance analysis in terms of error metrics (MAE and RMSE) and
train/test time. We benchmark it against the popular Java-based library LibRec,
showing similar results. We expect programmers with little experience and
people interested in quickly prototyping recommender systems to be benefited
from pyRecLab.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 07:21:59 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Jul 2017 16:07:20 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Sepulveda",
"Gabriel",
""
],
[
"Dominguez",
"Vicente",
""
],
[
"Parra",
"Denis",
""
]
] |
new_dataset
| 0.999425 |
1707.02999
|
Constantinos Psomas
|
Constantinos Psomas, Ioannis Krikidis
|
Backscatter Communications for Wireless Powered Sensor Networks with
Collision Resolution
|
IEEE Wireless Communications Letters (accepted for publication)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless powered backscatter communications is an attractive technology for
next-generation low-powered sensor networks such as the Internet of Things.
However, backscattering suffers from collisions due to multiple simultaneous
transmissions and a dyadic backscatter channel, which greatly attenuate the
received signal at the reader. This letter deals with backscatter
communications in sensor networks from a large-scale point-of-view and
considers various collision resolution techniques: directional antennas,
ultra-narrow band transmissions and successive interference cancellation. We
derive analytical expressions for the decoding probability and our results show
the significant gains, which can be achieved from the aforementioned
techniques.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 18:07:15 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Psomas",
"Constantinos",
""
],
[
"Krikidis",
"Ioannis",
""
]
] |
new_dataset
| 0.999552 |
1707.03004
|
Amir Mohammad Esmaieeli Sikaroudi
|
Amir Mohammad Esmaieeli Sikaroudi, Sasan Ghaffari, Ali Yousefi, Hassan
Sadeghi Naeini
|
Foot anthropometry device and single object image thresholding
| null |
Signal & Image Processing : An International Journal (SIPIJ)
Vol.8, No.3, June 2017
|
10.5121/sipij.2017.8301
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a device, algorithm and graphical user interface to
obtain anthropometric measurements of foot. Presented device facilitates
obtaining scale of image and image processing by taking one image from side
foot and underfoot simultaneously. Introduced image processing algorithm
minimizes a noise criterion, which is suitable for object detection in single
object images and outperforms famous image thresholding methods when lighting
condition is poor. Performance of image-based method is compared to manual
method. Image-based measurements of underfoot in average was 4mm less than
actual measures. Mean absolute error of underfoot length was 1.6mm, however
length obtained from side foot had 4.4mm mean absolute error. Furthermore,
based on t-test and f-test results, no significant difference between manual
and image-based anthropometry observed. In order to maintain anthropometry
process performance in different situations user interface designed for
handling changes in light conditions and altering speed of the algorithm.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 18:21:03 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Sikaroudi",
"Amir Mohammad Esmaieeli",
""
],
[
"Ghaffari",
"Sasan",
""
],
[
"Yousefi",
"Ali",
""
],
[
"Naeini",
"Hassan Sadeghi",
""
]
] |
new_dataset
| 0.998705 |
1707.03067
|
Mingda Zhang
|
Zaeem Hussain, Mingda Zhang, Xiaozhong Zhang, Keren Ye, Christopher
Thomas, Zuha Agha, Nathan Ong, Adriana Kovashka
|
Automatic Understanding of Image and Video Advertisements
|
To appear in CVPR 2017; data available on
http://cs.pitt.edu/~kovashka/ads
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is more to images than their objective physical content: for example,
advertisements are created to persuade a viewer to take a certain action. We
propose the novel problem of automatic advertisement understanding. To enable
research on this problem, we create two datasets: an image dataset of 64,832
image ads, and a video dataset of 3,477 ads. Our data contains rich annotations
encompassing the topic and sentiment of the ads, questions and answers
describing what actions the viewer is prompted to take and the reasoning that
the ad presents to persuade the viewer ("What should I do according to this ad,
and why should I do it?"), and symbolic references ads make (e.g. a dove
symbolizes peace). We also analyze the most common persuasive strategies ads
use, and the capabilities that computer vision systems should have to
understand these strategies. We present baseline classification results for
several prediction tasks, including automatically answering questions about the
messages of the ads.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 21:25:44 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Hussain",
"Zaeem",
""
],
[
"Zhang",
"Mingda",
""
],
[
"Zhang",
"Xiaozhong",
""
],
[
"Ye",
"Keren",
""
],
[
"Thomas",
"Christopher",
""
],
[
"Agha",
"Zuha",
""
],
[
"Ong",
"Nathan",
""
],
[
"Kovashka",
"Adriana",
""
]
] |
new_dataset
| 0.991152 |
1707.03148
|
Seema Hegde B
|
Seema B Hegde, Sathish Babu, Pallapa Venkatram
|
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents
Approach
|
21 pages, 16 figures, International Journal of Ad hoc, Sensor &
Ubiquitous Computing
| null |
10.5121/ijasuc.2017.8301
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Manets Dynamics and Robustness are the key features of the nodes and are
governed by several routing protocols such as AODV, DSR and so on. However in
the network the growing resource demand leads to resource scarcity. The Node
Mobility often leads to the link breakages and high routing overhead decreasing
the stability and reliability of the network connectivity. In this context, the
paper proposes a novel opportunistic AODV routing scheme which implements a
cognitive agent based intelligent technique to set up a stable connectivity
over the Manet. The Scheme computes the routing metric (rf) based on the
collaboration sensitivity levels of the nodes obtained based through the
knowledge based decision. This Routing Metric is subsequently used to set up
the stable path for network connectivity. Thus minimizes the route overhead and
increases the stability of the path. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing protocol and validated.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2017 06:55:48 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Hegde",
"Seema B",
""
],
[
"Babu",
"Sathish",
""
],
[
"Venkatram",
"Pallapa",
""
]
] |
new_dataset
| 0.999405 |
1707.03214
|
Cristina Fern\'andez-C\'ordoba
|
J. Borges, S. T. Dougherty, C. Fern\'andez-C\'ordoba, R. Ten-Valls
|
Binary Images of Z2Z4-Additive Cyclic Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Z2Z4-additive code C is called cyclic if the set of coordinates can be
partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates,
such that any cyclic shift of the coordinates of both subsets leaves the code
invariant. We study the binary images of Z2Z4-additive cyclic codes. We
determine all Z2Z4-additive cyclic codes with odd beta whose Gray images are
linear binary codes.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2017 10:56:45 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Borges",
"J.",
""
],
[
"Dougherty",
"S. T.",
""
],
[
"Fernández-Córdoba",
"C.",
""
],
[
"Ten-Valls",
"R.",
""
]
] |
new_dataset
| 0.999421 |
1707.03233
|
Nikos Fotiou
|
Nikos Fotiou, Hasan Islam, Dmitrij Lagutin, Teemu Hakala, George C.
Polyzos
|
CoAP over ICN
|
Proc. of the 8th IFIP International Conference on New Technologies,
Mobility and Security (NTMS), Larnaca, Cyprus, November, 2016
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Constrained Application Protocol (CoAP) is a specialized Web transfer
protocol for resource-oriented applications intended to run on constrained
devices, typically part of the Internet of Things. In this paper we leverage
Information-Centric Networking (ICN), deployed within the domain of a network
provider that interconnects, in addition to other terminals, CoAP endpoints in
order to provide enhanced CoAP services. We present various CoAP-specific
communication scenarios and discuss how ICN can provide benefits to both
network providers and CoAP applications, even though the latter are not aware
of the existence of ICN. In particular, the use of ICN results in smaller state
management complexity at CoAP endpoints, simpler implementation at CoAP
endpoints, and less communication overhead in the network.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2017 11:54:05 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Fotiou",
"Nikos",
""
],
[
"Islam",
"Hasan",
""
],
[
"Lagutin",
"Dmitrij",
""
],
[
"Hakala",
"Teemu",
""
],
[
"Polyzos",
"George C.",
""
]
] |
new_dataset
| 0.977081 |
1707.03297
|
Mouhamed Abdulla Ph.D.
|
Mouhamed Abdulla and Henk Wymeersch
|
Fine-Grained vs. Average Reliability for V2V Communications around
Intersections
|
5 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:1706.10011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intersections are critical areas of the transportation infrastructure
associated with 47% of all road accidents. Vehicle-to-vehicle (V2V)
communication has the potential of preventing up to 35% of such serious road
collisions. In fact, under the 5G/LTE Rel.15+ standardization, V2V is a
critical use-case not only for the purpose of enhancing road safety, but also
for enabling traffic efficiency in modern smart cities. Under this anticipated
5G definition, high reliability of 0.99999 is expected for semi-autonomous
vehicles (i.e., driver-in-the-loop). As a consequence, there is a need to
assess the reliability, especially for accident-prone areas, such as
intersections. We unpack traditional average V2V reliability in order to
quantify its related fine-grained V2V reliability. Contrary to existing work on
infinitely large roads, when we consider finite road segments of significance
to practical real-world deployment, fine-grained reliability exhibits bimodal
behavior. Performance for a certain vehicular traffic scenario is either very
reliable or extremely unreliable, but nowhere in relative proximity to the
average performance.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 13:56:06 GMT"
}
] | 2017-07-12T00:00:00 |
[
[
"Abdulla",
"Mouhamed",
""
],
[
"Wymeersch",
"Henk",
""
]
] |
new_dataset
| 0.998528 |
1610.03727
|
Jonatan Krolikowski
|
Jonatan Krolikowski, Anastasios Giovanidis and Marco Di Renzo
|
Fair distributed user-traffic association in cache equipped cellular
networks
|
6 pages, double column, 4 figures
| null |
10.23919/WIOPT.2017.7959862
| null |
cs.NI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching of popular content on wireless nodes is recently proposed as a means
to reduce congestion in the backbone of cellular networks and to improve
Quality of Service. From a network point of view, the goal is to offload as
many users as possible from the backbone network to the wireless caches while
at the same time offering good service to cache-unrelated users. Aggressive
offloading can lead to an unbalanced user association. Some wireless nodes can
be overloaded by cache-related traffic while the resources of others remain
underused. Given a fixed content placement, this work proposes an efficient
distributed algorithm to control and balance the association of cache-related
traffic among cellular cache memories. The algorithm allows the network to
achieve the globally optimal solution and can be executed on base stations
using a limited amount of information exchange between them. It is based on a
novel algorithm we call Bucket-filling. The solution limits the cache-users per
node by balancing the total load among the nodes in a fair way. The improvement
compared to common user assignment policies is highlighted for single- as well
as for multi-tier random networks.
|
[
{
"version": "v1",
"created": "Wed, 12 Oct 2016 14:31:27 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Oct 2016 10:27:43 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Feb 2017 18:33:40 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Krolikowski",
"Jonatan",
""
],
[
"Giovanidis",
"Anastasios",
""
],
[
"Di Renzo",
"Marco",
""
]
] |
new_dataset
| 0.99769 |
1610.07198
|
Pierre Ganty
|
Pierre Ganty and Boris K\"opf and Pedro Valero
|
A Language-theoretic View on Network Protocols
|
21 pages
| null | null | null |
cs.FL cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Input validation is the first line of defense against malformed or malicious
inputs. It is therefore critical that the validator (which is often part of the
parser) is free of bugs.
To build dependable input validators, we propose using parser generators for
context-free languages. In the context of network protocols, various works have
pointed at context-free languages as falling short to specify precisely or
concisely common idioms found in protocols. We review those assessments and
perform a rigorous, language-theoretic analysis of several common protocol
idioms. We then demonstrate the practical value of our findings by developing a
modular, robust, and efficient input validator for HTTP relying on context-free
grammars and regular expressions.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2016 16:29:30 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Jul 2017 14:37:17 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Ganty",
"Pierre",
""
],
[
"Köpf",
"Boris",
""
],
[
"Valero",
"Pedro",
""
]
] |
new_dataset
| 0.993627 |
1701.06678
|
Achilleas Anastasopoulos
|
Achilleas Anastasopoulos and Jui Wu
|
Variable-length codes for channels with memory and feedback:
error-exponent upper bounds
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The reliability function of memoryless channels with noiseless feedback and
variable-length coding has been found to be a linear function of the average
rate in the classic work of Burnashev. In this work we consider unifilar
channels with noiseless feedback and study upper bounds for the channel
reliability function with variable length codes. In unifilar channels the
channel state is known to the transmitter but is unknown to the receiver. We
generalize Burnashev's analysis and derive a similar expression which is linear
in average rate and depends on the channel capacity, as well as an additional
parameter which relates to a sequential binary hypothesis testing problem over
this channel. This parameter is evaluated by setting up an appropriate Markov
decision process (MDP). Furthermore, an upper bound for this parameter is
derived using a simplified MDP. Numerical evaluation of the parameter for
several binary input/state/output unifilar channels hints at the optimal
transmission strategies. Such strategies are studied in a companion paper to
provide lower (achievable) bounds on the channel reliability function.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 23:35:16 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Feb 2017 23:41:06 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Feb 2017 00:29:01 GMT"
},
{
"version": "v4",
"created": "Sun, 9 Jul 2017 16:04:40 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Anastasopoulos",
"Achilleas",
""
],
[
"Wu",
"Jui",
""
]
] |
new_dataset
| 0.990243 |
1703.00849
|
Anastasios Giovanidis
|
Luis David Alvarez Corrales, Anastasios Giovanidis, Philippe Martins,
Laurent Decreusefond
|
Wireless Node Cooperation with Resource Availability Constraints
|
submitted, 12 pages, double-column, 7 figures, 8 sub-figures in total
| null |
10.23919/WIOPT.2017.7959946
| null |
cs.NI cs.IT cs.PF math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Base station cooperation is a promising scheme to improve network performance
for next generation cellular networks. Up to this point research has focused on
station grouping criteria based solely on geographic proximity. However, for
the cooperation to be meaningful, each station participating in a group should
have sufficient available resources to share with others. In this work we
consider an alternative grouping criterion based on a distance that considers
both geographic proximity and available resources of the stations. When the
network is modelled by a Poisson Point Process, we derive analytical formulas
on the proportion of cooperative pairs or single stations, and the expected sum
interference from each of the groups. The results illustrate that cooperation
gains strongly depend on the distribution of available resources over the
network.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 16:29:46 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Corrales",
"Luis David Alvarez",
""
],
[
"Giovanidis",
"Anastasios",
""
],
[
"Martins",
"Philippe",
""
],
[
"Decreusefond",
"Laurent",
""
]
] |
new_dataset
| 0.984517 |
1704.08614
|
Michael Wilber
|
Michael J. Wilber, Chen Fang, Hailin Jin, Aaron Hertzmann, John
Collomosse, Serge Belongie
|
BAM! The Behance Artistic Media Dataset for Recognition Beyond
Photography
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer vision systems are designed to work well within the context of
everyday photography. However, artists often render the world around them in
ways that do not resemble photographs. Artwork produced by people is not
constrained to mimic the physical world, making it more challenging for
machines to recognize.
This work is a step toward teaching machines how to categorize images in ways
that are valuable to humans. First, we collect a large-scale dataset of
contemporary artwork from Behance, a website containing millions of portfolios
from professional and commercial artists. We annotate Behance imagery with rich
attribute labels for content, emotions, and artistic media. Furthermore, we
carry out baseline experiments to show the value of this dataset for artistic
style prediction, for improving the generality of existing object classifiers,
and for the study of visual domain adaptation. We believe our Behance Artistic
Media dataset will be a good starting point for researchers wishing to study
artistic imagery and relevant problems.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 15:05:30 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Jul 2017 02:48:53 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Wilber",
"Michael J.",
""
],
[
"Fang",
"Chen",
""
],
[
"Jin",
"Hailin",
""
],
[
"Hertzmann",
"Aaron",
""
],
[
"Collomosse",
"John",
""
],
[
"Belongie",
"Serge",
""
]
] |
new_dataset
| 0.999783 |
1706.05461
|
Jie Lin
|
Zhe Wang, Kingsley Kuan, Mathieu Ravaut, Gaurav Manek, Sibo Song, Yuan
Fang, Seokhwan Kim, Nancy Chen, Luis Fernando D'Haro, Luu Anh Tuan, Hongyuan
Zhu, Zeng Zeng, Ngai Man Cheung, Georgios Piliouras, Jie Lin, Vijay
Chandrasekhar
|
Truly Multi-modal YouTube-8M Video Classification with Video, Audio, and
Text
|
8 pages, Accepted to CVPR'17 Workshop on YouTube-8M Large-Scale Video
Understanding
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
The YouTube-8M video classification challenge requires teams to classify 0.7
million videos into one or more of 4,716 classes. In this Kaggle competition,
we placed in the top 3% out of 650 participants using released video and audio
features. Beyond that, we extend the original competition by including text
information in the classification, making this a truly multi-modal approach
with vision, audio and text. The newly introduced text data is termed as
YouTube-8M-Text. We present a classification framework for the joint use of
text, visual and audio features, and conduct an extensive set of experiments to
quantify the benefit that this additional mode brings. The inclusion of text
yields state-of-the-art results, e.g. 86.7% GAP on the YouTube-8M-Text
validation dataset.
|
[
{
"version": "v1",
"created": "Sat, 17 Jun 2017 00:39:04 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jun 2017 02:06:33 GMT"
},
{
"version": "v3",
"created": "Mon, 10 Jul 2017 00:44:45 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Wang",
"Zhe",
""
],
[
"Kuan",
"Kingsley",
""
],
[
"Ravaut",
"Mathieu",
""
],
[
"Manek",
"Gaurav",
""
],
[
"Song",
"Sibo",
""
],
[
"Fang",
"Yuan",
""
],
[
"Kim",
"Seokhwan",
""
],
[
"Chen",
"Nancy",
""
],
[
"D'Haro",
"Luis Fernando",
""
],
[
"Tuan",
"Luu Anh",
""
],
[
"Zhu",
"Hongyuan",
""
],
[
"Zeng",
"Zeng",
""
],
[
"Cheung",
"Ngai Man",
""
],
[
"Piliouras",
"Georgios",
""
],
[
"Lin",
"Jie",
""
],
[
"Chandrasekhar",
"Vijay",
""
]
] |
new_dataset
| 0.983728 |
1707.02398
|
Stefano Rini
|
Stefano Rini and Shlomo Shamai (Shitz)
|
On the Capacity of the Carbon Copy onto Dirty Paper Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on
dirty paper" channel in which the channel output is obtained as the sum of the
channel input, white Gaussian noise and a Gaussian state sequence randomly
selected among a set possible realizations. The transmitter has non-causal
knowledge of the set of possible state sequences but does not know which
sequence is selected to produce the channel output. We study the capacity of
the CCDP channel for two scenarios: (i) the state sequences are independent and
identically distributed, and (ii) the state sequences are scaled versions of
the same sequence. In the first scenario, we show that a combination of
superposition coding, time-sharing and Gel'fand-Pinsker binning is sufficient
to approach the capacity to within three bits per channel use for any number of
possible state realizations. In the second scenario, we derive capacity to
within four bits-per-channel-use for the case of two possible state sequences.
This result is extended to the CCDP channel with any number of possible state
sequences under certain conditions on the scaling parameters which we denote as
"strong fading" regime. We conclude by providing some remarks on the capacity
of the CCDP channel in which the state sequences have any jointly Gaussian
distribution.
|
[
{
"version": "v1",
"created": "Sat, 8 Jul 2017 05:41:32 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Rini",
"Stefano",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.97839 |
1707.02560
|
Ruifeng Duan
|
Riku J\"antti, Roberto Di Candia, Ruifeng Duan, and Kalle Ruttik
|
Multiantenna Quantum Backscatter Communications
|
6 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum illumination (QI) is a revolutionary photonic quantum sensing
paradigm that enhances the sensitivity of photodetection in noisy and lossy
environments. The QI concept has been recently used to propose a quantum
backscatter communication (QBC), with the aim of increasing the receiver
sensitivity beyond the limits of its classical counterpart. One of the
practical challenges in microwave QI is the slow rate at which the entangled
microwave modes can be generated. Here, we propose to mitigate this problem by
using a multiple-input multiple-output antenna system to synthetically increase
the number of efficiently-distinguishable modes in the QBC context.
|
[
{
"version": "v1",
"created": "Sun, 9 Jul 2017 11:00:06 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Jäntti",
"Riku",
""
],
[
"Di Candia",
"Roberto",
""
],
[
"Duan",
"Ruifeng",
""
],
[
"Ruttik",
"Kalle",
""
]
] |
new_dataset
| 0.990635 |
1707.02605
|
Fulvio Mastrogiovanni
|
Divya Shah, Ernesto Denicia, Tiago Pimentel, Barbara Bruno, Fulvio
Mastrogiovanni
|
Detection of bimanual gestures everywhere: why it matters, what we need
and what is missing
|
Submitted to Robotics and Autonomous Systems (Elsevier)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bimanual gestures are of the utmost importance for the study of motor
coordination in humans and in everyday activities. A reliable detection of
bimanual gestures in unconstrained environments is fundamental for their
clinical study and to assess common activities of daily living. This paper
investigates techniques for a reliable, unconstrained detection and
classification of bimanual gestures. It assumes the availability of inertial
data originating from the two hands/arms, builds upon a previously developed
technique for gesture modelling based on Gaussian Mixture Modelling (GMM) and
Gaussian Mixture Regression (GMR), and compares different modelling and
classification techniques, which are based on a number of assumptions inspired
by literature about how bimanual gestures are represented and modelled in the
brain. Experiments show results related to 5 everyday bimanual activities,
which have been selected on the basis of three main parameters: (not)
constraining the two hands by a physical tool, (not) requiring a specific
sequence of single-hand gestures, being recursive (or not). In the best
performing combination of modeling approach and classification technique, five
out of five activities are recognized up to an accuracy of 97%, a precision of
82% and a level of recall of 100%.
|
[
{
"version": "v1",
"created": "Sun, 9 Jul 2017 17:30:35 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Shah",
"Divya",
""
],
[
"Denicia",
"Ernesto",
""
],
[
"Pimentel",
"Tiago",
""
],
[
"Bruno",
"Barbara",
""
],
[
"Mastrogiovanni",
"Fulvio",
""
]
] |
new_dataset
| 0.969984 |
1707.02833
|
Jorge Mendes
|
Jorge Mendes and Jo\~ao Saraiva
|
Tabula: A Language to Model Spreadsheet Tables
|
In Proceedings of the 4th Workshop on Software Engineering Methods in
Spreadsheets
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spreadsheets provide a flexible and easy to use software development
environment, but that leads to error proneness. Work has been done to prevent
errors in spreadsheets, including using models to specify distinct parts of a
spreadsheet as it is done with model-driven software development. Previous
model languages for spreadsheets offer a limited expressiveness, and cannot
model several features present in most real world spreadsheets.
In this paper, the modeling language Tabula is introduced. It extends
previous spreadsheet models with features like type constraints and nested
classes with repetitions. Tabula is not only more expressive than other models
but it can also be extended with more features. Moreover, Tabula includes a
bidirectional transformation engine that guarantees synchronization after an
update either in the model or spreadsheet.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 13:08:29 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Mendes",
"Jorge",
""
],
[
"Saraiva",
"João",
""
]
] |
new_dataset
| 0.983461 |
1707.02849
|
Fabio Salassa
|
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent
T'kindt
|
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and
hamiltonian paths
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In shop scheduling, several applications exist where it is required that some
components perform consecutively. We refer to no-idle schedules if machines are
required to operate with no inserted idle time and no-wait schedules if tasks
cannot wait between the end of an operation and the start of the following one.
We consider here no-idle/no-wait shop scheduling problems with makespan as
performance measure and determine related complexity results. We first analyze
the two-machine no-idle/no-wait flow shop problem and show that it is
equivalent to a special version of the game of dominoes which is polynomially
solvable by tackling an Eulerian path problem on a directed graph. We present
for this problem an O(n) exact algorithm. As a byproduct we show that the
Hamiltonian Path problem on a digraph G(V,A) with a special structure (where
every pair of vertices i,j either has all successors in common or has no common
successors) reduces to the two-machine no-idle/no-wait flow shop problem.
Correspondingly, we provide a new polynomially solvable special case of the
Hamiltonian Path problem. Then, we show that also the corresponding $m$-machine
no-idle no-wait flow shop problem is polynomially solvable and provide an O(mn
log n) exact algorithm. Finally we prove that the 2-machine no-idle/no-wait job
shop problem and the 2-machine no-idle/no-wait open shop problem are NP-Hard in
the strong sense.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 13:34:07 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Billaut",
"Jean-Charles",
""
],
[
"Della Croce",
"Federico",
""
],
[
"Salassa",
"Fabio",
""
],
[
"T'kindt",
"Vincent",
""
]
] |
new_dataset
| 0.992783 |
1707.02915
|
Shuai Wang Dr.
|
Song Min Kim, Shigemi Ishida, Shuai Wang, and Tian He
|
Free Side-channel Cross-technology Communication in Wireless Networks
|
To Appear in IEEE/ACM Transactions on Networking
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Enabling direct communication between wireless technologies immediately
brings significant benefits including, but not limited to, cross-technology
interference mitigation and context-aware smart operation. To explore the
opportunities, we propose FreeBee -- a novel cross-technology communication
technique for direct unicast as well as cross-technology/channel broadcast
among three popular technologies of WiFi, ZigBee, and Bluetooth. The key
concept of FreeBee is to modulate symbol messages by shifting the timings of
periodic beacon frames already mandatory for diverse wireless standards. This
keeps our design generically applicable across technologies and avoids
additional bandwidth consumption (i.e., does not incur extra traffic), allowing
continuous broadcast to safely reach mobile and/or duty-cycled devices. A new
\emph{interval multiplexing} technique is proposed to enable concurrent
bro\-adcasts from multiple senders or boost the transmission rate of a single
sender. Theoretical and experimental exploration reveals that FreeBee offers a
reliable symbol delivery under a second and supports mobility of 30mph and low
duty-cycle operations of under 5%.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 15:50:41 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Kim",
"Song Min",
""
],
[
"Ishida",
"Shigemi",
""
],
[
"Wang",
"Shuai",
""
],
[
"He",
"Tian",
""
]
] |
new_dataset
| 0.998637 |
1707.02953
|
Debajyoti Mondal
|
Debajyoti Mondal
|
On String Contact Representations in 3D
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An axis-aligned string is a simple polygonal path, where each line segment is
parallel to an axis in $\mathbb{R}^3$. Given a graph $G$, a string contact
representation $\Psi$ of $G$ maps the vertices of $G$ to interior disjoint
axis-aligned strings, where no three strings meet at a point, and two strings
share a common point if and only if their corresponding vertices are adjacent
in $G$. The complexity of $\Psi$ is the minimum integer $r$ such that every
string in $\Psi$ is a $B_r$-string, i.e., a string with at most $r$ bends.
While a result of Duncan et al. implies that every graph $G$ with maximum
degree 4 has a string contact representation using $B_4$-strings, we examine
constraints on $G$ that allow string contact representations with complexity 3,
2 or 1. We prove that if $G$ is Hamiltonian and triangle-free, then $G$ admits
a contact representation where all the strings but one are $B_3$-strings. If
$G$ is 3-regular and bipartite, then $G$ admits a contact representation with
string complexity 2, and if we further restrict $G$ to be Hamiltonian, then $G$
has a contact representation, where all the strings but one are $B_1$-strings
(i.e., $L$-shapes). Finally, we prove some complementary lower bounds on the
complexity of string contact representations.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 17:15:42 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Mondal",
"Debajyoti",
""
]
] |
new_dataset
| 0.9991 |
1707.02961
|
Frank Staals
|
Lars Arge, Frank Staals
|
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an efficient dynamic data structure that supports geodesic nearest
neighbor queries for a set of point sites $S$ in a static simple polygon $P$.
Our data structure allows us to insert a new site in $S$, delete a site from
$S$, and ask for the site in $S$ closest to an arbitrary query point $q \in P$.
All distances are measured using the geodesic distance, that is, the length of
the shortest path that is completely contained in $P$. Our data structure
supports queries in $O(\sqrt{n}\log n\log^2 m)$ time, where $n$ is the number
of sites currently in $S$, and $m$ is the number of vertices of $P$, and
updates in $O(\sqrt{n}\log^3 m)$ time. The space usage is $O(n\log m + m)$. If
only insertions are allowed, we can support queries in worst-case $O(\log^2
n\log^2 m)$ time, while allowing for $O(\log n\log^3 m)$ amortized time
insertions. We can achieve the same running times in case there are both
insertions and deletions, but the order of these operations is known in
advance.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 17:43:35 GMT"
}
] | 2017-07-11T00:00:00 |
[
[
"Arge",
"Lars",
""
],
[
"Staals",
"Frank",
""
]
] |
new_dataset
| 0.991018 |
1704.02161
|
Abhijit Guha Roy
|
Abhijit Guha Roy, Sailesh Conjeti, Sri Phani Krishna Karri, Debdoot
Sheet, Amin Katouzian, Christian Wachinger, Nassir Navab
|
ReLayNet: Retinal Layer and Fluid Segmentation of Macular Optical
Coherence Tomography using Fully Convolutional Network
|
Accepted for Publication at Biomedical Optics Express
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optical coherence tomography (OCT) is used for non-invasive diagnosis of
diabetic macular edema assessing the retinal layers. In this paper, we propose
a new fully convolutional deep architecture, termed ReLayNet, for end-to-end
segmentation of retinal layers and fluid masses in eye OCT scans. ReLayNet uses
a contracting path of convolutional blocks (encoders) to learn a hierarchy of
contextual features, followed by an expansive path of convolutional blocks
(decoders) for semantic segmentation. ReLayNet is trained to optimize a joint
loss function comprising of weighted logistic regression and Dice overlap loss.
The framework is validated on a publicly available benchmark dataset with
comparisons against five state-of-the-art segmentation methods including two
deep learning based approaches to substantiate its effectiveness.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 09:50:05 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Jul 2017 10:14:41 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Roy",
"Abhijit Guha",
""
],
[
"Conjeti",
"Sailesh",
""
],
[
"Karri",
"Sri Phani Krishna",
""
],
[
"Sheet",
"Debdoot",
""
],
[
"Katouzian",
"Amin",
""
],
[
"Wachinger",
"Christian",
""
],
[
"Navab",
"Nassir",
""
]
] |
new_dataset
| 0.993957 |
1707.01873
|
Christian Cachin
|
Christian Cachin, Marko Vukoli\'c
|
Blockchain Consensus Protocols in the Wild
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A blockchain is a distributed ledger for recording transactions, maintained
by many nodes without central authority through a distributed cryptographic
protocol. All nodes validate the information to be appended to the blockchain,
and a consensus protocol ensures that the nodes agree on a unique order in
which entries are appended. Consensus protocols for tolerating Byzantine faults
have received renewed attention because they also address blockchain systems.
This work discusses the process of assessing and gaining confidence in the
resilience of a consensus protocols exposed to faults and adversarial nodes. We
advocate to follow the established practice in cryptography and computer
security, relying on public reviews, detailed models, and formal proofs; the
designers of several practical systems appear to be unaware of this. Moreover,
we review the consensus protocols in some prominent permissioned blockchain
platforms with respect to their fault models and resilience against attacks.
The protocol comparison covers Hyperledger Fabric, Tendermint, Symbiont,
R3~Corda, Iroha, Kadena, Chain, Quorum, MultiChain, Sawtooth Lake, Ripple,
Stellar, and IOTA.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 17:21:03 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Jul 2017 05:46:05 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Cachin",
"Christian",
""
],
[
"Vukolić",
"Marko",
""
]
] |
new_dataset
| 0.997259 |
1707.01996
|
Ping Hu
|
Ping Hu, Chi Wan Sung, Terence H. Chan
|
Capacity of Wireless Distributed Storage Systems with Broadcast Repair
|
28 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless distributed storage systems, storage nodes are connected by
wireless channels, which are broadcast in nature. This paper exploits this
unique feature to design an efficient repair mechanism, called broadcast
repair, for wireless distributed storage systems in the presence of
multiple-node failures. Due to the broadcast nature of wireless transmission,
we advocate a new measure on repair performance called repair-transmission
bandwidth. In contrast to repair bandwidth, which measures the average number
of packets downloaded by a newcomer to replace a failed node,
repair-transmission bandwidth measures the average number of packets
transmitted by helper nodes per failed node. A fundamental study on the storage
capacity of wireless distributed storage systems with broadcast repair is
conducted by modeling the storage system as a multicast network and analyzing
the minimum cut of the corresponding information flow graph. The fundamental
tradeoff between storage efficiency and repair-transmission bandwidth is also
obtained for functional repair. The performance of broadcast repair is compared
both analytically and numerically with that of cooperative repair, the basic
repair method for wired distributed storage systems with multiple-node
failures. While cooperative repair is based on the idea of allowing newcomers
to exchange packets, broadcast repair is based on the idea of allowing a helper
to broadcast packets to all newcomers simultaneously. We show that broadcast
repair outperforms cooperative repair, offering a better tradeoff between
storage efficiency and repair-transmission bandwidth.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 23:56:59 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Hu",
"Ping",
""
],
[
"Sung",
"Chi Wan",
""
],
[
"Chan",
"Terence H.",
""
]
] |
new_dataset
| 0.999599 |
1707.02000
|
Kamesh Madduri
|
Humayun Kabir, Kamesh Madduri
|
Shared-memory Graph Truss Decomposition
|
10 pages, conference submission
| null | null | null |
cs.DC cs.DS cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PKT, a new shared-memory parallel algorithm and OpenMP
implementation for the truss decomposition of large sparse graphs. A k-truss is
a dense subgraph definition that can be considered a relaxation of a clique.
Truss decomposition refers to a partitioning of all the edges in the graph
based on their k-truss membership. The truss decomposition of a graph has many
applications. We show that our new approach PKT consistently outperforms other
truss decomposition approaches for a collection of large sparse graphs and on a
24-core shared-memory server. PKT is based on a recently proposed algorithm for
k-core decomposition.
|
[
{
"version": "v1",
"created": "Fri, 7 Jul 2017 00:09:09 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Kabir",
"Humayun",
""
],
[
"Madduri",
"Kamesh",
""
]
] |
new_dataset
| 0.982565 |
1707.02058
|
Hugo Gimbert
|
Nathalie Bertrand (IRSN), Miheer Dewaskar, Blaise Genest (SUMO), Hugo
Gimbert (LaBRI)
|
Controlling a Population
| null | null | null | null |
cs.FL cs.GT cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new setting where a population of agents, each modelled by a
finite-state system, are controlled uniformly: the controller applies the same
action to every agent. The framework is largely inspired by the control of a
biological system, namely a population of yeasts, where the controller may only
change the environment common to all cells. We study a synchronisation problem
for such populations: no matter how individual agents react to the actions of
the controller , the controller aims at driving all agents synchronously to a
target state. The agents are naturally represented by a non-deterministic
finite state automaton (NFA), the same for every agent, and the whole system is
encoded as a 2-player game. The first player (Controller) chooses actions, and
the second player (Agents) resolves non-determinism for each agent. The game
with m agents is called the m-population game. This gives rise to a
parameterized control problem (where control refers to 2 player games), namely
the population control problem: can Controller control the m-population game
for all $m $\in$ N$ whatever Agents does? In this paper, we prove that the
population control problem is decidable, and it is a EXPTIME-complete problem.
As far as we know, this is one of the first results on parameterized control.
Our algorithm, not based on cutoff techniques, produces winning strategies
which are symbolic, that is, they do not need to count precisely how the
population is spread between states. We also show that if there is no winning
strategy, then there is a population size M such that Controller wins the
m-population game if and only if $m $\le$ M$. Surprisingly, M can be doubly
exponential in the number of states of the NFA, with tight upper and lower
bounds.
|
[
{
"version": "v1",
"created": "Fri, 7 Jul 2017 07:11:06 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Bertrand",
"Nathalie",
"",
"IRSN"
],
[
"Dewaskar",
"Miheer",
"",
"SUMO"
],
[
"Genest",
"Blaise",
"",
"SUMO"
],
[
"Gimbert",
"Hugo",
"",
"LaBRI"
]
] |
new_dataset
| 0.967879 |
1707.02275
|
Antonio Valerio Miceli Barone
|
Antonio Valerio Miceli Barone and Rico Sennrich
|
A parallel corpus of Python functions and documentation strings for
automated code documentation and code generation
|
5 pages, 1 figure, 3 tables
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automated documentation of programming source code and automated code
generation from natural language are challenging tasks of both practical and
scientific interest. Progress in these areas has been limited by the low
availability of parallel corpora of code and natural language descriptions,
which tend to be small and constrained to specific domains.
In this work we introduce a large and diverse parallel corpus of a hundred
thousands Python functions with their documentation strings ("docstrings")
generated by scraping open source repositories on GitHub. We describe baseline
results for the code documentation and code generation tasks obtained by neural
machine translation. We also experiment with data augmentation techniques to
further increase the amount of training data.
We release our datasets and processing scripts in order to stimulate research
in these areas.
|
[
{
"version": "v1",
"created": "Fri, 7 Jul 2017 17:15:27 GMT"
}
] | 2017-07-10T00:00:00 |
[
[
"Barone",
"Antonio Valerio Miceli",
""
],
[
"Sennrich",
"Rico",
""
]
] |
new_dataset
| 0.999567 |
1504.03048
|
Shudi Yang
|
Shudi Yang, Zheng-An Yao, Chang-An Zhao
|
The weight distributions of two classes of p ary cyclic codes with few
weights
|
20 pages
| null |
10.1016/j.ffa.2016.11.004
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes have attracted a lot of research interest for decades as they
have efficient encoding and decoding algorithms.
In this paper, for an odd prime $p$, the weight distributions of two classes
of $p$-ary cyclic codes are completely determined. We show that both codes have
at most five nonzero weights.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2015 02:16:35 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Yang",
"Shudi",
""
],
[
"Yao",
"Zheng-An",
""
],
[
"Zhao",
"Chang-An",
""
]
] |
new_dataset
| 0.95661 |
1509.01371
|
Shudi Yang
|
Shudi Yang and Zheng-An Yao
|
Complete Weight Enumerators of a Family of Three-Weight Linear Codes
|
13 pages. arXiv admin note: text overlap with arXiv:1505.06326
|
Des. Codes Cryptogr. 82: 663 (2017)
|
10.1007/s10623-016-0191-x
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes have been an interesting topic in both theory and practice for
many years. In this paper, for an odd prime $p$, we present the explicit
complete weight enumerator of a family of $p$-ary linear codes constructed with
defining set. The weight enumerator is an mmediate result of the complete
weight enumerator, which shows that the codes proposed in this paper are
three-weight linear codes. Additionally, all nonzero codewords are minimal and
thus they are suitable for secret sharing.
|
[
{
"version": "v1",
"created": "Fri, 4 Sep 2015 08:49:27 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Dec 2015 14:18:55 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Yang",
"Shudi",
""
],
[
"Yao",
"Zheng-An",
""
]
] |
new_dataset
| 0.999027 |
1511.00796
|
Aradhana Nayak
|
Aradhana Nayak and Ravi Banavar
|
Almost-globally stable tracking for on compact Riemannian manifolds
|
6 pages, to appear in ECC 2016
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we propose a control law for almost-global asymptotic
tracking (AGAT) of a smooth reference trajectory for a fully actuated simple
mechanical system (SMS) evolving on a Riemannian manifold which can be embedded
in a Euclidean space. The existing results on tracking for an SMS are either
local, or almost-global, only in the case the manifold is a Lie group. In the
latter case, the notion of a configuration error is naturally defined by the
group operation and facilitates a global analysis. However, such a notion is
not intrinsic to a Riemannian manifold. In this paper, we define a
configuration error followed by error dynamics on a Riemannian manifold, and
then prove AGAT. The results are demonstrated for a spherical pendulum which is
an SMS on $S^2$ and for a particle moving on a Lissajous curve in
$\mathbb{R}^3$.
|
[
{
"version": "v1",
"created": "Tue, 3 Nov 2015 07:24:17 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2016 14:44:09 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Apr 2016 10:27:04 GMT"
},
{
"version": "v4",
"created": "Sat, 25 Jun 2016 20:48:53 GMT"
},
{
"version": "v5",
"created": "Fri, 24 Mar 2017 06:00:10 GMT"
},
{
"version": "v6",
"created": "Wed, 5 Jul 2017 19:19:20 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Nayak",
"Aradhana",
""
],
[
"Banavar",
"Ravi",
""
]
] |
new_dataset
| 0.972809 |
1605.00887
|
Thibaut Verron
|
Bernard Bonnard (IMB, McTAO), Jean-Charles Faug\`ere (PolSys), Alain
Jacquemard (IMB, PolSys), Mohab Safey El Din (PolSys), Thibaut Verron
(PolSys)
|
Determinantal sets, singularities and application to optimal control in
medical imagery
| null |
International symposium on symbolic and algebraic computations,
Waterloo, Canada. ACM, pp.103-110 (2016)
|
10.1145/2930889.2930916
| null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Control theory has recently been involved in the field of nuclear magnetic
resonance imagery. The goal is to control the magnetic field optimally in order
to improve the contrast between two biological matters on the pictures.
Geometric optimal control leads us here to analyze mero-morphic vector fields
depending upon physical parameters , and having their singularities defined by
a deter-minantal variety. The involved matrix has polynomial entries with
respect to both the state variables and the parameters. Taking into account the
physical constraints of the problem, one needs to classify, with respect to the
parameters, the number of real singularities lying in some prescribed
semi-algebraic set. We develop a dedicated algorithm for real root
classification of the singularities of the rank defects of a polynomial matrix,
cut with a given semi-algebraic set. The algorithm works under some genericity
assumptions which are easy to check. These assumptions are not so restrictive
and are satisfied in the aforementioned application. As more general strategies
for real root classification do, our algorithm needs to compute the critical
loci of some maps, intersections with the boundary of the semi-algebraic
domain, etc. In order to compute these objects, the determinantal structure is
exploited through a stratifi-cation by the rank of the polynomial matrix. This
speeds up the computations by a factor 100. Furthermore, our implementation is
able to solve the application in medical imagery, which was out of reach of
more general algorithms for real root classification. For instance,
computational results show that the contrast problem where one of the matters
is water is partitioned into three distinct classes.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 13:05:59 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Jul 2017 09:10:06 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Bonnard",
"Bernard",
"",
"IMB, McTAO"
],
[
"Faugère",
"Jean-Charles",
"",
"PolSys"
],
[
"Jacquemard",
"Alain",
"",
"IMB, PolSys"
],
[
"Din",
"Mohab Safey El",
"",
"PolSys"
],
[
"Verron",
"Thibaut",
"",
"PolSys"
]
] |
new_dataset
| 0.989411 |
1706.10011
|
Mouhamed Abdulla Ph.D.
|
Mouhamed Abdulla and Henk Wymeersch
|
Fine-Grained Reliability for V2V Communications around Suburban and
Urban Intersections
|
27 pages, 6 figures, submitted to IEEE Transactions on Wireless
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Safe transportation is a key use-case of the 5G/LTE Rel.15+ communications,
where an end-to-end reliability of 0.99999 is expected for a vehicle-to-vehicle
(V2V) transmission distance of 100-200 m. Since communications reliability is
related to road-safety, it is crucial to verify the fulfillment of the
performance, especially for accident-prone areas such as intersections. We
derive closed-form expressions for the V2V transmission reliability near
suburban corners and urban intersections over finite interference regions. The
analysis is based on plausible street configurations, traffic scenarios, and
empirically-supported channel propagation. We show the means by which the
performance metric can serve as a preliminary design tool to meet a target
reliability. We then apply meta distribution concepts to provide a careful
dissection of V2V communications reliability. Contrary to existing work on
infinite roads, when we consider finite road segments for practical deployment,
fine-grained reliability per realization exhibits bimodal behavior. Either
performance for a certain vehicular traffic scenario is very reliable or
extremely unreliable, but nowhere in relatively proximity to the average
performance. In other words, standard SINR-based average performance metrics
are analytically accurate but can be insufficient from a practical viewpoint.
Investigating other safety-critical point process networks at the meta
distribution-level may reveal similar discrepancies.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 04:04:05 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Jul 2017 21:02:40 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Abdulla",
"Mouhamed",
""
],
[
"Wymeersch",
"Henk",
""
]
] |
new_dataset
| 0.99985 |
1707.01591
|
Arya Farahi
|
Alex Chojnacki, Chengyu Dai, Arya Farahi, Guangsha Shi, Jared Webb,
Daniel T. Zhang, Jacob Abernethy, Eric Schwartz
|
A Data Science Approach to Understanding Residential Water Contamination
in Flint
|
Applied Data Science track paper at KDD 2017. For associated
promotional video, see https://www.youtube.com/watch?v=0g66ImaV8Ag
| null |
10.1145/3097983.3098078
| null |
cs.LG stat.AP stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When the residents of Flint learned that lead had contaminated their water
system, the local government made water-testing kits available to them free of
charge. The city government published the results of these tests, creating a
valuable dataset that is key to understanding the causes and extent of the lead
contamination event in Flint. This is the nation's largest dataset on lead in a
municipal water system.
In this paper, we predict the lead contamination for each household's water
supply, and we study several related aspects of Flint's water troubles, many of
which generalize well beyond this one city. For example, we show that elevated
lead risks can be (weakly) predicted from observable home attributes. Then we
explore the factors associated with elevated lead. These risk assessments were
developed in part via a crowd sourced prediction challenge at the University of
Michigan. To inform Flint residents of these assessments, they have been
incorporated into a web and mobile application funded by \texttt{Google.org}.
We also explore questions of self-selection in the residential testing program,
examining which factors are linked to when and how frequently residents
voluntarily sample their water.
|
[
{
"version": "v1",
"created": "Wed, 5 Jul 2017 22:12:14 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Chojnacki",
"Alex",
""
],
[
"Dai",
"Chengyu",
""
],
[
"Farahi",
"Arya",
""
],
[
"Shi",
"Guangsha",
""
],
[
"Webb",
"Jared",
""
],
[
"Zhang",
"Daniel T.",
""
],
[
"Abernethy",
"Jacob",
""
],
[
"Schwartz",
"Eric",
""
]
] |
new_dataset
| 0.996889 |
1707.01609
|
Rahmat Widia Sembiring
|
Amin Subandi, Rini Meiyanti, Cut Lika Mestika Sandy, Rahmat Widia
Sembiring
|
Three-Pass Protocol Implementation in Vigenere Cipher Classic
Cryptography Algorithm with Keystream Generator Modification
|
2nd International Conference of Computer, Environment, Social
Science, Health Science, Agriculture & Technology (ICEST) 2017
| null |
10.25046/aj020501
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vigenere Cipher is one of the classic cryptographic algorithms and included
into symmetric key cryptography algorithm, where to encryption and decryption
process use the same key. Vigenere Cipher has the disadvantage that if key
length is not equal to the length of the plaintext, then the key will be
repeated until equal to the plaintext length, it course allows cryptanalysts to
make the process of cryptanalysis. And weaknesses of the symmetric key
cryptographic algorithm is the safety of key distribution factor, if the key is
known by others, then the function of cryptography itself become useless. Based
on two such weaknesses, in this study, we modify the key on Vigenere Cipher, so
when the key length smaller than the length of plaintext entered, the key will
be generated by a process, so the next key character will be different from the
previous key character. In This study also applied the technique of Three-pass
protocol, a technique which message sender does not need to send the key,
because each using its own key for the message encryption and decryption
process, so the security of a message would be more difficult to solved.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 01:35:03 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Subandi",
"Amin",
""
],
[
"Meiyanti",
"Rini",
""
],
[
"Sandy",
"Cut Lika Mestika",
""
],
[
"Sembiring",
"Rahmat Widia",
""
]
] |
new_dataset
| 0.975369 |
1707.01642
|
Ruggero Micheletto
|
Ruggero Micheletto and Ahyi Kim
|
An HTM based cortical algorithm for detection of seismic waves
|
7 pages, 4 figures and one table. 7 Citations
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognizing seismic waves immediately is very important for the realization
of efficient disaster prevention. Generally these systems consist of a network
of seismic detectors that send real time data to a central server. The server
elaborates the data and attempts to recognize the first signs of an earthquake.
The current problem with this approach is that it is subject to false alarms. A
critical trade-off exists between sensitivity of the system and error rate. To
overcame this problems, an artificial neural network based intelligent learning
systems can be used. However, conventional supervised ANN systems are difficult
to train, CPU intensive and prone to false alarms. To surpass these problems,
here we attempt to use a next-generation unsupervised cortical algorithm HTM.
This novel approach does not learn particular waveforms, but adapts to
continuously fed data reaching the ability to discriminate between normality
(seismic sensor background noise in no-earthquake conditions) and anomaly
(sensor response to a jitter or an earthquake). Main goal of this study is test
the ability of the HTM algorithm to be used to signal earthquakes automatically
in a feasible disaster prevention system. We describe the methodology used and
give the first qualitative assessments of the recognition ability of the
system. Our preliminary results show that the cortical algorithm used is very
robust to noise and that can successfully recognize synthetic earthquake-like
signals efficiently and reliably.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 05:24:12 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Micheletto",
"Ruggero",
""
],
[
"Kim",
"Ahyi",
""
]
] |
new_dataset
| 0.952956 |
1707.01653
|
Eugene Cherny
|
Gleb Rogozinsky, Mihail Chesnokov and Eugene Cherny
|
pch2csd: an application for converting Nord Modular G2 patches into
Csound code
|
7 pages, 4 figures, for associated source code, see
https://github.com/gleb812/pch2csd/
|
Proc. 14th Sound and Music Computing Conf. (SMC 2017) (2017)
415-421
| null | null |
cs.SD
|
http://creativecommons.org/licenses/by/4.0/
|
The paper presents the pch2csd project, focused on converting patches of
popular Clavia Nord Modular G2 synthesizer into code of Csound language. Now
discontinued, Nord Modular G2 left a lot of interesting patches for sound
synthesis and algorithmic composition. To give this heritage a new life, we
created our project with the hope for being able to simulate the original sound
and behavior of Nord Modular.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 06:40:19 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Rogozinsky",
"Gleb",
""
],
[
"Chesnokov",
"Mihail",
""
],
[
"Cherny",
"Eugene",
""
]
] |
new_dataset
| 0.997609 |
1707.01766
|
Thomas Studer
|
Kai Br\"unnler, Dandolo Flumini, Thomas Studer
|
A Logic of Blockchain Updates
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blockchains are distributed data structures that are used to achieve
consensus in systems for cryptocurrencies (like Bitcoin) or smart contracts
(like Ethereum). Although blockchains gained a lot of popularity recently,
there is no logic-based model for blockchains available. We introduce BCL, a
dynamic logic to reason about blockchain updates, and show that BCL is sound
and complete with respect to a simple blockchain model.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 13:03:04 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Brünnler",
"Kai",
""
],
[
"Flumini",
"Dandolo",
""
],
[
"Studer",
"Thomas",
""
]
] |
new_dataset
| 0.999037 |
1707.01788
|
Alexandre Cherpillod
|
Alexandre Cherpillod, Stefano Mintchev, Dario Floreano
|
Embodied Flight with a Drone
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most human-robot interfaces, such as joysticks and keyboards, require
training and constant cognitive effort and provide a limited degree of
awareness of the robots state and its environment. Embodied interactions,
instead of interfaces, could bridge the gap between humans and robots, allowing
humans to naturally perceive and act through a distal robotic body.
Establishing an embodied interaction and mapping human movements and a
non-anthropomorphic robot is particularly challenging. In this paper, we
describe a natural and immersive embodied interaction that allows users to
control and experience drone flight with their own bodies. The setup uses a
commercial flight simulator that tracks hand movements and provides haptic and
visual feedback. The paper discusses how to integrate the simulator with a real
drone, how to map body movement with drone motion, and how the resulting
embodied interaction provides a more natural and immersive flight experience to
unskilled users with respect to a conventional RC remote controller.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 13:45:40 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Cherpillod",
"Alexandre",
""
],
[
"Mintchev",
"Stefano",
""
],
[
"Floreano",
"Dario",
""
]
] |
new_dataset
| 0.999032 |
1707.01836
|
Awni Hannun
|
Pranav Rajpurkar, Awni Y. Hannun, Masoumeh Haghpanahi, Codie Bourn and
Andrew Y. Ng
|
Cardiologist-Level Arrhythmia Detection with Convolutional Neural
Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop an algorithm which exceeds the performance of board certified
cardiologists in detecting a wide range of heart arrhythmias from
electrocardiograms recorded with a single-lead wearable monitor. We build a
dataset with more than 500 times the number of unique patients than previously
studied corpora. On this dataset, we train a 34-layer convolutional neural
network which maps a sequence of ECG samples to a sequence of rhythm classes.
Committees of board-certified cardiologists annotate a gold standard test set
on which we compare the performance of our model to that of 6 other individual
cardiologists. We exceed the average cardiologist performance in both recall
(sensitivity) and precision (positive predictive value).
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 15:42:46 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Rajpurkar",
"Pranav",
""
],
[
"Hannun",
"Awni Y.",
""
],
[
"Haghpanahi",
"Masoumeh",
""
],
[
"Bourn",
"Codie",
""
],
[
"Ng",
"Andrew Y.",
""
]
] |
new_dataset
| 0.999185 |
1707.01848
|
Wieslaw Kopec
|
Wies{\l}aw Kope\'c, Katarzyna Abramczuk, Bart{\l}omiej Balcerzak,
Marta Ju\'zwin Katarzyna Gniadzik, Grzegorz Kowalik, Rados{\l}aw Nielek
|
A Location-Based Game for Two Generations: Teaching Mobile Technology to
the Elderly with the Support of Young Volunteers
|
The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-49655-9_12
| null |
10.1007/978-3-319-49655-9_12
| null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a cooperative location-based game for the elderly with
the use of tablets equipped with mobile application. The game was designed to
tackle at once several crucial topics related to the issue of aging, namely the
social inclusion, education in the field of modern technology, motivation for
learning as well as physical activity. Mixed-aged teams consisting of two
players: a junior and a senior took part in the game. The preliminary results
suggest that the game can successfully address a number of issues including
improving the elderly technical skills, increasing the elderly physical
activity as well as positive intergenerational interaction. The paper describes
the game setup in details and presents some initial data gathered during the
gameplay.
|
[
{
"version": "v1",
"created": "Thu, 6 Jul 2017 16:07:00 GMT"
}
] | 2017-07-07T00:00:00 |
[
[
"Kopeć",
"Wiesław",
""
],
[
"Abramczuk",
"Katarzyna",
""
],
[
"Balcerzak",
"Bartłomiej",
""
],
[
"Gniadzik",
"Marta Juźwin Katarzyna",
""
],
[
"Kowalik",
"Grzegorz",
""
],
[
"Nielek",
"Radosław",
""
]
] |
new_dataset
| 0.999631 |
1502.03143
|
Berk Calli
|
Berk Calli, Aaron Walsman, Arjun Singh, Siddhartha Srinivasa, Pieter
Abbeel and Aaron M. Dollar
|
Benchmarking in Manipulation Research: The YCB Object and Model Set and
Benchmarking Protocols
|
Submitted to Robotics and Automation Magazine (RAM) Special Issue on
Replicable and Measurable Robotics Research. 35 Pages
|
IEEE Robotics & Automation Magazine, 22 (2015) 36 - 52
|
10.1109/MRA.2015.2448951
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the Yale-CMU-Berkeley (YCB) Object and Model set,
intended to be used to facilitate benchmarking in robotic manipulation,
prosthetic design and rehabilitation research. The objects in the set are
designed to cover a wide range of aspects of the manipulation problem; it
includes objects of daily life with different shapes, sizes, textures, weight
and rigidity, as well as some widely used manipulation tests. The associated
database provides high-resolution RGBD scans, physical properties, and
geometric models of the objects for easy incorporation into manipulation and
planning software platforms. In addition to describing the objects and models
in the set along with how they were chosen and derived, we provide a framework
and a number of example task protocols, laying out how the set can be used to
quantitatively evaluate a range of manipulation approaches including planning,
learning, mechanical design, control, and many others. A comprehensive
literature survey on existing benchmarks and object datasets is also presented
and their scope and limitations are discussed. The set will be freely
distributed to research groups worldwide at a series of tutorials at robotics
conferences, and will be otherwise available at a reasonable purchase cost. It
is our hope that the ready availability of this set along with the ground laid
in terms of protocol templates will enable the community of manipulation
researchers to more easily compare approaches as well as continually evolve
benchmarking tests as the field matures.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 22:46:01 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Calli",
"Berk",
""
],
[
"Walsman",
"Aaron",
""
],
[
"Singh",
"Arjun",
""
],
[
"Srinivasa",
"Siddhartha",
""
],
[
"Abbeel",
"Pieter",
""
],
[
"Dollar",
"Aaron M.",
""
]
] |
new_dataset
| 0.999177 |
1503.02295
|
Emmanuel Osegi
|
N.E. Osegi, P. Enyindah
|
GOptimaEmbed: A SmartSMS-SQLDatabaseManagementSystem for Low-Cost
Microcontrollers
|
To be published
|
African Journal of Computing & ICT, 8(2)
| null | null |
cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The era of the Internet of things, machine-to-machine and human to machine
computing has heralded the development of a modern-day smart industry in which
humanoids can co-operate,co-exist and interact seamlessly.Currently, there are
many projects in this area of smart communication and thus giving rise to an
industry electrified by smart things.In this paper we present a novel smart
database management system (dbms),GOptimaEmbed, for intelligent querying of
databases in device constrained embedded systems. The system uses genetic
algorithms as main search engine and simplifies the query process using stored
in-memory model based on an invented device dependent
Short-messaging-Structured Query Language SMS SQL schema translator. In
addition, querying is done over the air using integrated GSM module in the
smart space. The system has been applied to querying a plant database and
results were quite satisfactory.
Keywords. GOptimaEmbed,smart dbms, genetic algorithms, SMS SQL
|
[
{
"version": "v1",
"created": "Sun, 8 Mar 2015 16:46:03 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Mar 2015 21:41:29 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Osegi",
"N. E.",
""
],
[
"Enyindah",
"P.",
""
]
] |
new_dataset
| 0.998259 |
1611.06307
|
Shubham Pachori
|
Shubham Pachori
|
Multi-Scale Saliency Detection using Dictionary Learning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency detection has drawn a lot of attention of researchers in various
fields over the past several years. Saliency is the perceptual quality that
makes an object, person to draw the attention of humans at the very sight.
Salient object detection in an image has been used centrally in many
computational photography and computer vision applications like video
compression, object recognition and classification, object segmentation,
adaptive content delivery, motion detection, content aware resizing, camouflage
images and change blindness images to name a few. We propose a method to detect
saliency in the objects using multimodal dictionary learning which has been
recently used in classification and image fusion. The multimodal dictionary
that we are learning is task driven which gives improved performance over its
counterpart (the one which is not task specific).
|
[
{
"version": "v1",
"created": "Sat, 19 Nov 2016 05:27:12 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Jul 2017 18:56:37 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Jul 2017 03:46:15 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Pachori",
"Shubham",
""
]
] |
new_dataset
| 0.999656 |
1612.02314
|
Martin Pielot
|
Martin Pielot and Luz Rello
|
Productive, Anxious, Lonely - 24 Hours Without Push Notifications
| null | null |
10.1145/3098279.3098526
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report from the Do Not Disturb Challenge where 30 volunteers disabled
notification alerts for 24 hours across all devices. The effect of the absence
of notifications on the participants was isolated through an experimental study
design: we compared self-reported feedback from the day without notifications
against a baseline day. The evidence indicates that notifications have locked
us in a dilemma: without notifications, participants felt less distracted and
more productive. But, they also felt no longer able to be as responsive as
expected, which made some participants anxious. And, they felt less connected
with one's social group. In contrast to previous reports, about two third of
the participants expressed the intention to change how they manage
notifications. Two years later, half of the participants are still following
through with their plans.
|
[
{
"version": "v1",
"created": "Wed, 7 Dec 2016 16:23:33 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jul 2017 05:40:59 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Jul 2017 07:19:27 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Pielot",
"Martin",
""
],
[
"Rello",
"Luz",
""
]
] |
new_dataset
| 0.980989 |
1707.01123
|
Ali Parsai
|
Ali Parsai, Alessandro Murgia, Serge Demeyer
|
LittleDarwin: a Feature-Rich and Extensible Mutation Testing Framework
for Large and Complex Java Systems
|
Pre-proceedings of the 7th IPM International Conference on
Fundamentals of Software Engineering
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mutation testing is a well-studied method for increasing the quality of a
test suite. We designed LittleDarwin as a mutation testing framework able to
cope with large and complex Java software systems, while still being easily
extensible with new experimental components. LittleDarwin addresses two
existing problems in the domain of mutation testing: having a tool able to work
within an industrial setting, and yet, be open to extension for cutting edge
techniques provided by academia. LittleDarwin already offers higher-order
mutation, null type mutants, mutant sampling, manual mutation, and mutant
subsumption analysis. There is no tool today available with all these features
that is able to work with typical industrial software systems.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 18:12:57 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Parsai",
"Ali",
""
],
[
"Murgia",
"Alessandro",
""
],
[
"Demeyer",
"Serge",
""
]
] |
new_dataset
| 0.999086 |
1707.01184
|
Souvick Ghosh
|
Souvick Ghosh, Satanu Ghosh, and Dipankar Das
|
Sentiment Identification in Code-Mixed Social Media Text
| null | null | null | null |
cs.CL cs.AI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sentiment analysis is the Natural Language Processing (NLP) task dealing with
the detection and classification of sentiments in texts. While some tasks deal
with identifying the presence of sentiment in the text (Subjectivity analysis),
other tasks aim at determining the polarity of the text categorizing them as
positive, negative and neutral. Whenever there is a presence of sentiment in
the text, it has a source (people, group of people or any entity) and the
sentiment is directed towards some entity, object, event or person. Sentiment
analysis tasks aim to determine the subject, the target and the polarity or
valence of the sentiment. In our work, we try to automatically extract
sentiment (positive or negative) from Facebook posts using a machine learning
approach.While some works have been done in code-mixed social media data and in
sentiment analysis separately, our work is the first attempt (as of now) which
aims at performing sentiment analysis of code-mixed social media text. We have
used extensive pre-processing to remove noise from raw text. Multilayer
Perceptron model has been used to determine the polarity of the sentiment. We
have also developed the corpus for this task by manually labeling Facebook
posts with their associated sentiments.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 23:29:44 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Ghosh",
"Souvick",
""
],
[
"Ghosh",
"Satanu",
""
],
[
"Das",
"Dipankar",
""
]
] |
new_dataset
| 0.987988 |
1707.01271
|
Bernard Parisse
|
Bernard Parisse
|
Compiling LATEX to computer algebra-enabled HTML5
|
The interactive HTML5/MathML version of the document is available at
https://www-fourier.ujf-grenoble.fr/~parisse/giac/castex.htmlThe LaTeX source
will not compile properly to PDF without installing the software described in
the document
| null | null | null |
cs.SC cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document explains how to create or modify an existing LATEX document
with commands enabling computations in the HTML5 output: when the reader opens
the HTML5 output, he can run a computation in his browser, or modify the
command to be executed and run it. This is done by combining different
softwares: hevea for compilation to HTML5, giac.js for the CAS computing kernel
(itself compiled from the C++ Giac library with emscripten), and a modified
version of itex2MML for fast and nice rendering in MathML in browsers that
support MathML.
|
[
{
"version": "v1",
"created": "Wed, 5 Jul 2017 09:24:46 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Parisse",
"Bernard",
""
]
] |
new_dataset
| 0.977926 |
1707.01330
|
Mojtaba Masoudi
|
Mojtaba Masoudi, Hamidreza Pourreza, Mahdi Saadatmand Tarzjan, Fateme
Shafiee Zargar, Masoud Pezeshki Rad, Noushin Eftekhari
|
A dataset for Computer-Aided Detection of Pulmonary Embolism in CTA
images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Todays, researchers in the field of Pulmonary Embolism (PE) analysis need to
use a publicly available dataset to assess and compare their methods. Different
systems have been designed for the detection of pulmonary embolism (PE), but
none of them have used any public datasets. All papers have used their own
private dataset. In order to fill this gap, we have collected 5160 slices of
computed tomography angiography (CTA) images acquired from 20 patients, and
after labeling the image by experts in this field, we provided a reliable
dataset which is now publicly available. In some situation, PE detection can be
difficult, for example when it occurs in the peripheral branches or when
patients have pulmonary diseases (such as parenchymal disease). Therefore, the
efficiency of CAD systems highly depends on the dataset. In the given dataset,
66% of PE are located in peripheral branches, and different pulmonary diseases
are also included.
|
[
{
"version": "v1",
"created": "Wed, 5 Jul 2017 11:35:27 GMT"
}
] | 2017-07-06T00:00:00 |
[
[
"Masoudi",
"Mojtaba",
""
],
[
"Pourreza",
"Hamidreza",
""
],
[
"Tarzjan",
"Mahdi Saadatmand",
""
],
[
"Zargar",
"Fateme Shafiee",
""
],
[
"Rad",
"Masoud Pezeshki",
""
],
[
"Eftekhari",
"Noushin",
""
]
] |
new_dataset
| 0.999871 |
1309.7720
|
Ken-ichiro Ishikawa
|
Ken-ichiro Ishikawa
|
ASURA: Scalable and Uniform Data Distribution Algorithm for Storage
Clusters
|
14 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale storage cluster systems need to manage a vast amount of data
locations. A naive data locations management maintains pairs of data ID and
nodes storing the data in tables. However, it is not practical when the number
of pairs is too large. To solve this problem, management using data
distribution algorithms, rather than management using tables, has been proposed
in recent research. It can distribute data by determining the node for storing
the data based on the datum ID. Such data distribution algorithms require the
ability to handle the addition or removal of nodes, short calculation time and
uniform data distribution in the capacity of each node. This paper proposes a
data distribution algorithm called ASURA (Advanced Scalable and Uniform storage
by Random number Algorithm) that satisfies these requirements. It achieves
following four characteristics: 1) minimum data movement to maintain data
distribution according to node capacity when nodes are added or removed, even
if data are replicated, 2) roughly sub-micro-seconds calculation time, 3) much
lower than 1% maximum variability between nodes in data distribution, and 4)
data distribution according to the capacity of each node. The evaluation
results show that ASURA is qualitatively and quantitatively competitive against
major data distribution algorithms such as Consistent Hashing, Weighted
Rendezvous Hashing and Random Slicing. The comparison results show benefits of
each algorithm; they show that ASURA has advantage in large scale-out storage
clusters.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 04:48:11 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jul 2017 10:41:49 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Ishikawa",
"Ken-ichiro",
""
]
] |
new_dataset
| 0.998765 |
1608.05550
|
Yuto Nakashima
|
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo
Bannai and Masayuki Takeda
|
Shortest unique palindromic substring queries in optimal time
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A palindrome is a string that reads the same forward and backward. A
palindromic substring $P$ of a string $S$ is called a shortest unique
palindromic substring ($\mathit{SUPS}$) for an interval $[x, y]$ in $S$, if $P$
occurs exactly once in $S$, this occurrence of $P$ contains interval $[x, y]$,
and every palindromic substring of $S$ which contains interval $[x, y]$ and is
shorter than $P$ occurs at least twice in $S$. The $\mathit{SUPS}$ problem is,
given a string $S$, to preprocess $S$ so that for any subsequent query interval
$[x, y]$ all the $\mathit{SUPS}\mbox{s}$ for interval $[x, y]$ can be answered
quickly. We present an optimal solution to this problem. Namely, we show how to
preprocess a given string $S$ of length $n$ in $O(n)$ time and space so that
all $\mathit{SUPS}\mbox{s}$ for any subsequent query interval can be answered
in $O(k+1)$ time, where $k$ is the number of outputs.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 09:35:52 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jul 2017 10:23:59 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Nakashima",
"Yuto",
""
],
[
"Inoue",
"Hiroe",
""
],
[
"Mieno",
"Takuya",
""
],
[
"Inenaga",
"Shunsuke",
""
],
[
"Bannai",
"Hideo",
""
],
[
"Takeda",
"Masayuki",
""
]
] |
new_dataset
| 0.963163 |
1611.03012
|
Yuan-Hsun Lo
|
Yijin Zhang, Yuan-Hsun Lo, Kenneth W. Shum, Wing Shing Wong
|
New CRT sequence sets for a collision channel without feedback
|
21 pages, 1 figure, 4 tables
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Protocol sequences are binary and periodic sequences used for deterministic
multiple access in a collision channel without feedback. In this paper, we
focus on user-irrepressible (UI) protocol sequences that can guarantee a
positive individual throughput per sequence period with probability one for a
slot-synchronous channel, regardless of the delay offsets among the users. As
the sequence period has a fundamental impact on the worst-case channel access
delay, a common objective of designing UI sequences is to make the sequence
period as short as possible. Consider a communication channel that is shared by
$M$ active users, and assume that each protocol sequence has a constant Hamming
weight $w$. To attain a better delay performance than previously known UI
sequences, this paper presents a CRTm construction of UI sequences with
$w=M+1$, which is a variation of the previously known CRT construction. For all
non-prime $M\geq 8$, our construction produces the shortest known sequence
period and the shortest known worst-case delay of UI sequences. Numerical
results show that the new construction enjoys a better average delay
performance than the optimal random access scheme and other constructions with
the same sequence period, in a variety of traffic conditions. In addition, we
derive an asymptotic lower bound on the minimum sequence period for $w=M+1$ if
the sequence structure satisfies some technical conditions, called
equi-difference, and prove the tightness of this lower bound by using the CRTm
construction.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 17:04:43 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Mar 2017 18:09:15 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Jul 2017 07:10:05 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Zhang",
"Yijin",
""
],
[
"Lo",
"Yuan-Hsun",
""
],
[
"Shum",
"Kenneth W.",
""
],
[
"Wong",
"Wing Shing",
""
]
] |
new_dataset
| 0.996497 |
1611.05479
|
Anish Simhal
|
Anish K. Simhal, Cecilia Aguerrebere, Forrest Collman, Joshua T.
Vogelstein, Kristina D. Micheva, Richard J. Weinberg, Stephen J. Smith,
Guillermo Sapiro
|
Probabilistic Fluorescence-Based Synapse Detection
|
Current awaiting peer review
| null |
10.1371/journal.pcbi.1005493
| null |
cs.CV q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brain function results from communication between neurons connected by
complex synaptic networks. Synapses are themselves highly complex and diverse
signaling machines, containing protein products of hundreds of different genes,
some in hundreds of copies, arranged in precise lattice at each individual
synapse. Synapses are fundamental not only to synaptic network function but
also to network development, adaptation, and memory. In addition, abnormalities
of synapse numbers or molecular components are implicated in most mental and
neurological disorders. Despite their obvious importance, mammalian synapse
populations have so far resisted detailed quantitative study. In human brains
and most animal nervous systems, synapses are very small and very densely
packed: there are approximately 1 billion synapses per cubic millimeter of
human cortex. This volumetric density poses very substantial challenges to
proteometric analysis at the critical level of the individual synapse. The
present work describes new probabilistic image analysis methods for
single-synapse analysis of synapse populations in both animal and human brains.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2016 22:01:31 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Simhal",
"Anish K.",
""
],
[
"Aguerrebere",
"Cecilia",
""
],
[
"Collman",
"Forrest",
""
],
[
"Vogelstein",
"Joshua T.",
""
],
[
"Micheva",
"Kristina D.",
""
],
[
"Weinberg",
"Richard J.",
""
],
[
"Smith",
"Stephen J.",
""
],
[
"Sapiro",
"Guillermo",
""
]
] |
new_dataset
| 0.999202 |
1701.07579
|
Vitaly Skachek
|
Eldho K. Thomas and Vitaly Skachek
|
Explicit Constructions and Bounds for Batch Codes with Restricted Size
of Reconstruction Sets
|
To appear in 5ICMCTA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear batch codes and codes for private information retrieval (PIR) with a
query size $t$ and a restricted size $r$ of the reconstruction sets are
studied. New bounds on the parameters of such codes are derived for small
values of $t$ or of $r$ by providing corresponding constructions. By building
on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is
derived for batch codes and PIR codes.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 05:16:28 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jul 2017 14:07:13 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Thomas",
"Eldho K.",
""
],
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.99882 |
1704.02939
|
Nikola Yolov
|
Nikola Yolov
|
Minor-matching hypertree width
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new width measure for a tree decomposition,
minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs,
such that bounding the width guarantees that set of maximal independent sets
has a polynomially-sized restriction to each decomposition bag. The relaxed
conditions of the decomposition allow a much wider class of graphs and
hypergraphs of bounded width compared to other tree decompositions. We show
that, for fixed $k$, there are $2^{(1 - \frac1k + o(1)){n \choose 2}}$
$n$-vertex graphs of minor-matching hypertree width at most $k$. A number of
problems including Maximum Independence Set, $k$-Colouring, and Homomorphism of
uniform hypergraphs permit polynomial-time solutions for hypergraphs with
bounded minor-matching hypertree width and bounded rank. We show that for any
given $k$ and any graph $G$, it is possible to construct a decomposition of
minor-matching hypertree width at most $O(k^3)$, or to prove that
$\mu\text{-}tw(G) > k$ in time $n^{O(k^3)}$. This is done by presenting a
general algorithm for approximating the hypertree width of well-behaved
measures, and reducing $\mu\text{-}tw$ to such measure. The result relating the
restriction of the maximal independent sets to a set $S$ with the set of
induced matchings intersecting $S$ in graphs, and minor matchings intersecting
$S$ in hypergraphs, might be of independent interest.
|
[
{
"version": "v1",
"created": "Mon, 10 Apr 2017 16:25:55 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jul 2017 16:29:51 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Yolov",
"Nikola",
""
]
] |
new_dataset
| 0.981751 |
1704.08778
|
Ayan Chaudhury
|
Ayan Chaudhury and John L. Barron
|
Partially Occluded Leaf Recognition via Subgraph Matching and Energy
Optimization
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an approach to match partially occluded plant leaves with
databases of full plant leaves. Although contour based 2D shape matching has
been studied extensively in the last couple of decades, matching occluded
leaves with full leaf databases is an open and little worked on problem.
Classifying occluded plant leaves is even more challenging than full leaf
matching because of large variations and complexity of leaf structures.
Matching an occluded contour with all the full contours in a database is an
NP-hard problem [Su et al. ICCV2015], so our algorithm is necessarily
suboptimal.
|
[
{
"version": "v1",
"created": "Fri, 28 Apr 2017 00:15:49 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Jul 2017 20:04:12 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Chaudhury",
"Ayan",
""
],
[
"Barron",
"John L.",
""
]
] |
new_dataset
| 0.986562 |
1707.00735
|
Monirosharieh Vameghestahbanati
|
Monirosharieh Vameghestahbanati, Ian Marsland, Ramy H. Gohary, and
Halim Yanikomeroglu
|
Polar Codes for SCMA Systems
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we design and compare multilevel polar coding (MLPC) and
bit-interleaved polar coded modulation (BIPCM) for uplink sparse code multiple
access (SCMA) systems that operate over fast and block fading channels. Both
successive cancellation (SC) and successive cancellation list (SCL) decoding
algorithms are considered. Simulation results show that, with either decoder,
BIPCM performs better than its MLPC counterpart. Also, both BIPCM and MLPC
exhibit a performance advantage over LTE turbo-coded and WiMAX LDPC SCMA
systems when the SCL technique is used for decoding.
|
[
{
"version": "v1",
"created": "Mon, 3 Jul 2017 19:21:37 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Vameghestahbanati",
"Monirosharieh",
""
],
[
"Marsland",
"Ian",
""
],
[
"Gohary",
"Ramy H.",
""
],
[
"Yanikomeroglu",
"Halim",
""
]
] |
new_dataset
| 0.998426 |
1707.00790
|
Hamid Mirzaei Buini
|
Hamid Mirzaei, Mona Fathollahi, Tony Givargis
|
OPEB: Open Physical Environment Benchmark for Artificial Intelligence
|
Accepted in 3rd IEEE International Forum on Research and Technologies
for Society and Industry 2017
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Artificial Intelligence methods to solve continuous- control tasks have made
significant progress in recent years. However, these algorithms have important
limitations and still need significant improvement to be used in industry and
real- world applications. This means that this area is still in an active
research phase. To involve a large number of research groups, standard
benchmarks are needed to evaluate and compare proposed algorithms. In this
paper, we propose a physical environment benchmark framework to facilitate
collaborative research in this area by enabling different research groups to
integrate their designed benchmarks in a unified cloud-based repository and
also share their actual implemented benchmarks via the cloud. We demonstrate
the proposed framework using an actual implementation of the classical
mountain-car example and present the results obtained using a Reinforcement
Learning algorithm.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 00:42:57 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Mirzaei",
"Hamid",
""
],
[
"Fathollahi",
"Mona",
""
],
[
"Givargis",
"Tony",
""
]
] |
new_dataset
| 0.999666 |
1707.00836
|
Kyungmin Kim
|
Kyung-Min Kim, Min-Oh Heo, Seong-Ho Choi, and Byoung-Tak Zhang
|
DeepStory: Video Story QA by Deep Embedded Memory Networks
|
7 pages, accepted for IJCAI 2017
| null | null | null |
cs.CV cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Question-answering (QA) on video contents is a significant challenge for
achieving human-level intelligence as it involves both vision and language in
real-world settings. Here we demonstrate the possibility of an AI agent
performing video story QA by learning from a large amount of cartoon videos. We
develop a video-story learning model, i.e. Deep Embedded Memory Networks
(DEMN), to reconstruct stories from a joint scene-dialogue video stream using a
latent embedding space of observed data. The video stories are stored in a
long-term memory component. For a given question, an LSTM-based attention model
uses the long-term memory to recall the best question-story-answer triplet by
focusing on specific words containing key information. We trained the DEMN on a
novel QA dataset of children's cartoon video series, Pororo. The dataset
contains 16,066 scene-dialogue pairs of 20.5-hour videos, 27,328 fine-grained
sentences for scene description, and 8,913 story-related QA pairs. Our
experimental results show that the DEMN outperforms other QA models. This is
mainly due to 1) the reconstruction of video stories in a scene-dialogue
combined form that utilize the latent embedding and 2) attention. DEMN also
achieved state-of-the-art results on the MovieQA benchmark.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 07:42:05 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Kim",
"Kyung-Min",
""
],
[
"Heo",
"Min-Oh",
""
],
[
"Choi",
"Seong-Ho",
""
],
[
"Zhang",
"Byoung-Tak",
""
]
] |
new_dataset
| 0.995779 |
1707.00971
|
Camila Ara\'ujo
|
Camila Souza Araujo, Gabriel Magno, Wagner Meira Jr, Virgilio Almeida,
Pedro Hartung and Danilo Doneda
|
Characterizing videos, audience and advertising in Youtube channels for
kids
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online video services, messaging systems, games and social media services are
tremendously popular among young people and children in many countries. Most of
the digital services offered on the internet are advertising funded, which
makes advertising ubiquitous in children's everyday life. To understand the
impact of advertising-based digital services on children, we study the
collective behavior of users of YouTube for kids channels and present the
demographics of a large number of users. We collected data from 12,848 videos
from 17 channels in US and UK and 24 channels in Brazil. The channels in
English have been viewed more than 37 billion times. We also collected more
than 14 million comments made by users. Based on a combination of text-analysis
and face recognition tools, we show the presence of racial and gender biases in
our large sample of users. We also identify children actively using YouTube,
although the minimum age for using the service is 13 years in most countries.
We provide comparisons of user behavior among the three countries, which
represent large user populations in the global North and the global South.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 13:31:03 GMT"
}
] | 2017-07-05T00:00:00 |
[
[
"Araujo",
"Camila Souza",
""
],
[
"Magno",
"Gabriel",
""
],
[
"Meira",
"Wagner",
"Jr"
],
[
"Almeida",
"Virgilio",
""
],
[
"Hartung",
"Pedro",
""
],
[
"Doneda",
"Danilo",
""
]
] |
new_dataset
| 0.994577 |
1507.06768
|
Daniel Graziotin
|
Ilona Kuzmickaja, Xiaofeng Wang, Daniel Graziotin, Gabriella Dodero,
Pekka Abrahamsson
|
In Need of Creative Mobile Service Ideas? Forget Adults and Ask Young
Children
|
48 pagers, 3 figures. Accepted for publication at SAGE Open
|
SAGE Open Vol 5, Issue 3, 2015
|
10.1177/2158244015601719
| null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well acknowledged that innovation is a key success factor in mobile
service domain. Having creative ideas is the first critical step in the
innovation process. Many studies suggest that customers are a valuable source
of creative ideas. However, the literature also shows that adults may be
constrained by existing technology frames, which are known to hinder
creativity. Instead young children (aged 7-12) are considered digital natives
yet are free from existing technology frames. This led us to study them as a
potential source for creative mobile service ideas. A set of 41,000 mobile
ideas obtained from a research project in 2006 granted us a unique opportunity
to study the mobile service ideas from young children. We randomly selected two
samples of ideas (N=400 each), one contained the ideas from young children, the
other from adults (aged 17-50). These ideas were evaluated by several
evaluators using an existing creativity framework. The results show that the
mobile service ideas from the young children are significantly more original,
transformational, implementable, and relevant than those from the adults.
Therefore, this study shows that young children are better sources of novel and
quality ideas than adults in the mobile services domain. This study bears
significant contributions to the creativity and innovation research. It also
indicates a new and valuable source for the companies that seek for creative
ideas for innovative products and services.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 07:45:00 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Kuzmickaja",
"Ilona",
""
],
[
"Wang",
"Xiaofeng",
""
],
[
"Graziotin",
"Daniel",
""
],
[
"Dodero",
"Gabriella",
""
],
[
"Abrahamsson",
"Pekka",
""
]
] |
new_dataset
| 0.978232 |
1703.04993
|
Daniel Graziotin
|
Daniel Graziotin, Fabian Fagerholm, Xiaofeng Wang, Pekka Abrahamsson
|
On the Unhappiness of Software Developers
|
11 pages, 1 figure. Final version. Accepted for presentation at the
21st International Conference on Evaluation and Assessment in Software
Engineering (EASE'17)
|
In Proceedings of the 21st International Conference on Evaluation
and Assessment in Software Engineering (EASE'17), 2017. ACM, New York, NY,
USA, 324-333
|
10.1145/3084226.3084242
| null |
cs.SE cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The happy-productive worker thesis states that happy workers are more
productive. Recent research in software engineering supports the thesis, and
the ideal of flourishing happiness among software developers is often expressed
among industry practitioners. However, the literature suggests that a
cost-effective way to foster happiness and productivity among workers could be
to limit unhappiness. Psychological disorders such as job burnout and anxiety
could also be reduced by limiting the negative experiences of software
developers. Simultaneously, a baseline assessment of (un)happiness and
knowledge about how developers experience it are missing. In this paper, we
broaden the understanding of unhappiness among software developers in terms of
(1) the software developer population distribution of (un)happiness, and (2)
the causes of unhappiness while developing software. We conducted a large-scale
quantitative and qualitative survey, incorporating a psychometrically validated
instrument for measuring (un)happiness, with 2220 developers, yielding a rich
and balanced sample of 1318 complete responses. Our results indicate that
software developers are a slightly happy population, but the need for limiting
the unhappiness of developers remains. We also identified 219 factors
representing causes of unhappiness while developing software. Our results,
which are available as open data, can act as guidelines for practitioners in
management positions and developers in general for fostering happiness on the
job. We suggest considering happiness in future studies of both human and
technical aspects in software engineering.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 08:07:39 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 09:27:02 GMT"
},
{
"version": "v3",
"created": "Wed, 10 May 2017 11:45:16 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Graziotin",
"Daniel",
""
],
[
"Fagerholm",
"Fabian",
""
],
[
"Wang",
"Xiaofeng",
""
],
[
"Abrahamsson",
"Pekka",
""
]
] |
new_dataset
| 0.985732 |
1703.08018
|
Manuel Lafond
|
Manuel Lafond
|
On strongly chordal graphs that are not leaf powers
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A common task in phylogenetics is to find an evolutionary tree representing
proximity relationships between species. This motivates the notion of leaf
powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V
and a threshold k such that uv is an edge if and only if the distance between u
and v in T is at most k. Characterizing leaf powers is a challenging open
problem, along with determining the complexity of their recognition. This is in
part due to the fact that few graphs are known to not be leaf powers, as such
graphs are difficult to construct. Recently, Nevries and Rosenke asked if leaf
powers could be characterized by strong chordality and a finite set of
forbidden subgraphs.
In this paper, we provide a negative answer to this question, by exhibiting
an infinite family \G of (minimal) strongly chordal graphs that are not leaf
powers. During the process, we establish a connection between leaf powers,
alternating cycles and quartet compatibility. We also show that deciding if a
chordal graph is \G-free is NP-complete, which may provide insight on the
complexity of the leaf power recognition problem.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 11:43:26 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 20:49:32 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Jul 2017 20:07:04 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Lafond",
"Manuel",
""
]
] |
new_dataset
| 0.993464 |
1707.00067
|
Viren Jain
|
Viren Jain
|
Adversarial Image Alignment and Interpolation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Volumetric (3d) images are acquired for many scientific and biomedical
purposes using imaging methods such as serial section microscopy, CT scans, and
MRI. A frequent step in the analysis and reconstruction of such data is the
alignment and registration of images that were acquired in succession along a
spatial or temporal dimension. For example, in serial section electron
microscopy, individual 2d sections are imaged via electron microscopy and then
must be aligned to one another in order to produce a coherent 3d volume. State
of the art approaches find image correspondences derived from patch matching
and invariant feature detectors, and then solve optimization problems that
rigidly or elastically deform series of images into an aligned volume. Here we
show how fully convolutional neural networks trained with an adversarial loss
function can be used for two tasks: (1) synthesis of missing or damaged image
data from adjacent sections, and (2) fine-scale alignment of block-face
electron microscopy data. Finally, we show how these two capabilities can be
combined in order to produce artificial isotropic volumes from anisotropic
image volumes using a super-resolution adversarial alignment and interpolation
approach.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 23:59:27 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Jain",
"Viren",
""
]
] |
new_dataset
| 0.999622 |
1707.00101
|
Lukas Fleischer
|
Volker Diekert and Lukas Fleischer
|
Church-Rosser Systems, Codes with Bounded Synchronization Delay and
Local Rees Extensions
|
Extended abstract of an invited talk given at WORDS 2017
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
What is the common link, if there is any, between Church-Rosser systems,
prefix codes with bounded synchronization delay, and local Rees extensions? The
first obvious answer is that each of these notions relates to topics of
interest for WORDS: Church-Rosser systems are certain rewriting systems over
words, codes are given by sets of words which form a basis of a free submonoid
in the free monoid of all words (over a given alphabet) and local Rees
extensions provide structural insight into regular languages over words. So, it
seems to be a legitimate title for an extended abstract presented at the
conference WORDS 2017. However, this work is more ambitious, it outlines some
less obvious but much more interesting link between these topics. This link is
based on a structure theory of finite monoids with varieties of groups and the
concept of local divisors playing a prominent role. Parts of this work appeared
in a similar form in conference proceedings where proofs and further material
can be found.
|
[
{
"version": "v1",
"created": "Sat, 1 Jul 2017 06:40:37 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Diekert",
"Volker",
""
],
[
"Fleischer",
"Lukas",
""
]
] |
new_dataset
| 0.998856 |
1707.00153
|
Minjia Shi
|
Minjia Shi, Yan Liu, Randriam Hugues, Lin Sok, Patrick Sole
|
Trace codes over $\Z_4$ and Boolean function
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct trace codes over $\Z_4$ by using Boolean functions and skew
sets, respectively. Their Lee weight distribution is studied by using a Galois
ring version of the Walsh-Hadamard transform and exponential sums. We obtain a
new family of optimal two-weight codes over $\Z_4.$
|
[
{
"version": "v1",
"created": "Sat, 1 Jul 2017 12:52:29 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Liu",
"Yan",
""
],
[
"Hugues",
"Randriam",
""
],
[
"Sok",
"Lin",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.998257 |
1707.00338
|
Luciana Foss
|
Leila Ribeiro, Luciana Foss, Simone Andr\'e da Costa Cavalheiro
|
Entendendo o Pensamento Computacional
|
18 pages, in Portuguese
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this article is to clarify the meaning of Computational Thinking.
We differentiate logical from computational reasoning and discuss the
importance of Computational Thinking in solving problems. The three pillars of
Computational Thinking - Abstraction, Automation and Analysis - are outlined,
highlighting the role of each one in developing the skills needed for the
problem-solving process.
-----
O objetivo deste artigo \'e esclarecer o significado de Pensamento
Computacional. Diferencia-se o racioc\'inio l\'ogico do computacional e
discute-se a import\^ancia do Pensamento Computacional na resolu\c{c}\~ao de
problemas. Os tr\^es pilares do Pensamento Computacional - Abstra\c{c}\~ao,
Automa\c{c}\~ao e An\'alise - s\~ao delineados, destacando-se o papel de cada
um deles no desenvolvimento das habilidades necess\'arias para o processo de
solu\c{c}\~ao de problemas.
|
[
{
"version": "v1",
"created": "Sun, 2 Jul 2017 19:38:55 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Ribeiro",
"Leila",
""
],
[
"Foss",
"Luciana",
""
],
[
"Cavalheiro",
"Simone André da Costa",
""
]
] |
new_dataset
| 0.977381 |
1707.00373
|
Zhiguo Fu
|
Zhiguo Fu
|
On Blockwise Symmetric Matchgate Signatures and Higher Domain \#CSP
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any $n\geq 3$ and $ q\geq 3$, we prove that the {\sc Equality} function
$(=_n)$ on $n$ variables over a domain of size $q$ cannot be realized by
matchgates under holographic transformations. This is a consequence of our
theorem on the structure of blockwise symmetric matchgate signatures. %due to
the rank of the matrix form of the blockwise symmetric standard signatures,
%where $(=_n)$ is an equality signature on domain $\{0, 1, \cdots, q-1\}$. This
has the implication that the standard holographic algorithms based on
matchgates, a methodology known to be universal for \#CSP over the Boolean
domain, cannot produce P-time algorithms for planar \#CSP over any higher
domain $q\geq 3$.
|
[
{
"version": "v1",
"created": "Mon, 3 Jul 2017 00:20:17 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Fu",
"Zhiguo",
""
]
] |
new_dataset
| 0.966195 |
1707.00519
|
Fan Liu
|
Fan Liu, Christos Masouros, Ang Li, Huafei Sun, Lajos Hanzo
|
MU-MIMO Communications with MIMO Radar: From Co-existence to Joint
Transmission
|
15 pages, 15 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessible
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Beamforming techniques are proposed for a joint multi-input-multi-output
(MIMO) radar-communication (RadCom) system, where a single device acts both as
a radar and a communication base station (BS) by simultaneously communicating
with downlink users and detecting radar targets. Two operational options are
considered, where we first split the antennas into two groups, one for radar
and the other for communication. Under this deployment, the radar signal is
designed to fall into the null-space of the downlink channel. The communication
beamformer is optimized such that the beampattern obtained matches the radar's
beampattern while satisfying the communication performance requirements. To
reduce the optimizations' constraints, we consider a second operational option,
where all the antennas transmit a joint waveform that is shared by both radar
and communications. In this case, we formulate an appropriate probing
beampattern, while guaranteeing the performance of the downlink communications.
By incorporating the SINR constraints into objective functions as penalty
terms, we further simplify the original beamforming designs to weighted
optimizations, and solve them by efficient manifold algorithms. Numerical
results show that the shared deployment outperforms the separated case
significantly, and the proposed weighted optimizations achieve a similar
performance to the original optimizations, despite their significantly lower
computational complexity.
|
[
{
"version": "v1",
"created": "Mon, 3 Jul 2017 13:02:38 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Liu",
"Fan",
""
],
[
"Masouros",
"Christos",
""
],
[
"Li",
"Ang",
""
],
[
"Sun",
"Huafei",
""
],
[
"Hanzo",
"Lajos",
""
]
] |
new_dataset
| 0.999763 |
1707.00627
|
Kenneth Young
|
Kenny Young and Ryan B. Hayward
|
A Reverse Hex Solver
|
Presented at Computers and Games 2016 Leiden, International
Conference on Computers and Games. Springer International Publishing, 2016
| null | null | null |
cs.AI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Solrex,an automated solver for the game of Reverse Hex.Reverse
Hex, also known as Rex, or Misere Hex, is the variant of the game of Hex in
which the player who joins her two sides loses the game. Solrex performs a
mini-max search of the state space using Scalable Parallel Depth First Proof
Number Search, enhanced by the pruning of inferior moves and the early
detection of certain winning strategies. Solrex is implemented on the same code
base as the Hex program Solver, and can solve arbitrary positions on board
sizes up to 6x6, with the hardest position taking less than four hours on four
threads.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 17:51:08 GMT"
}
] | 2017-07-04T00:00:00 |
[
[
"Young",
"Kenny",
""
],
[
"Hayward",
"Ryan B.",
""
]
] |
new_dataset
| 0.999341 |
1412.2352
|
S\'andor Kolumb\'an
|
S\'andor Kolumb\'an and Istv\'an Vajk and Johan Schoukens
|
Perturbed Datasets Methods for Hypothesis Testing and Structure of
Corresponding Confidence Sets
| null |
Automatica, vol. 51, pages 326 - 331 (2015)
|
10.1016/j.automatica.2014.10.083
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hypothesis testing methods that do not rely on exact distribution assumptions
have been emerging lately. The method of sign-perturbed sums (SPS) is capable
of characterizing confidence regions with exact confidence levels for linear
regression and linear dynamical systems parameter estimation problems if the
noise distribution is symmetric. This paper describes a general family of
hypothesis testing methods that have an exact user chosen confidence level
based on finite sample count and without relying on an assumed noise
distribution. It is shown that the SPS method belongs to this family and we
provide another hypothesis test for the case where the symmetry assumption is
replaced with exchangeability. In the case of linear regression problems it is
shown that the confidence regions are connected, bounded and possibly
non-convex sets in both cases. To highlight the importance of understanding the
structure of confidence regions corresponding to such hypothesis tests it is
shown that confidence sets for linear dynamical systems parameter estimates
generated using the SPS method can have non-connected parts, which have far
reaching consequences.
|
[
{
"version": "v1",
"created": "Sun, 7 Dec 2014 13:37:19 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Kolumbán",
"Sándor",
""
],
[
"Vajk",
"István",
""
],
[
"Schoukens",
"Johan",
""
]
] |
new_dataset
| 0.998981 |
1505.07395
|
Marko Horvat
|
Marko Horvat, Dujo Duvnjak, Davor Jug
|
GWAT: The Geneva Affective Picture Database WordNet Annotation Tool
|
5 pages, 3 figures. In the Proceedings of 38th International
Convention on Information and Communication Technology, Electronics and
Microelectronics MIPRO 2015 (pp. 1403-1407)
| null | null | null |
cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Geneva Affective Picture Database WordNet Annotation Tool (GWAT) is a
user-friendly web application for manual annotation of pictures in Geneva
Affective Picture Database (GAPED) with WordNet. The annotation tool has an
intuitive interface which can be efficiently used with very little technical
training. A single picture may be labeled with many synsets allowing experts to
describe semantics with different levels of detail. Noun, verb, adjective and
adverb synsets can be keyword-searched and attached to a specific GAPED picture
with their unique identification numbers. Changes are saved automatically in
the tool's relational database. The attached synsets can be reviewed, changed
or deleted later. Additionally, GAPED pictures may be browsed in the tool's
user interface using simple commands where previously attached WordNet synsets
are displayed alongside the pictures. Stored annotations can be exported from
the tool's database to different data formats and used in 3rd party
applications if needed. Since GAPED does not define keywords of individual
pictures but only a general category of picture groups, GWAT represents a
significant improvement towards development of comprehensive picture semantics.
The tool was developed with open technologies WordNet API, Apache, PHP5 and
MySQL. It is freely available for scientific and non-commercial use.
|
[
{
"version": "v1",
"created": "Wed, 27 May 2015 16:27:23 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Jun 2017 14:07:05 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Horvat",
"Marko",
""
],
[
"Duvnjak",
"Dujo",
""
],
[
"Jug",
"Davor",
""
]
] |
new_dataset
| 0.989128 |
1706.09579
|
Yingying Jiang
|
Yingying Jiang, Xiangyu Zhu, Xiaobing Wang, Shuli Yang, Wei Li, Hua
Wang, Pei Fu and Zhenbo Luo
|
R2CNN: Rotational Region CNN for Orientation Robust Scene Text Detection
|
8 pages, 6 figures, 3 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel method called Rotational Region CNN (R2CNN)
for detecting arbitrary-oriented texts in natural scene images. The framework
is based on Faster R-CNN [1] architecture. First, we use the Region Proposal
Network (RPN) to generate axis-aligned bounding boxes that enclose the texts
with different orientations. Second, for each axis-aligned text box proposed by
RPN, we extract its pooled features with different pooled sizes and the
concatenated features are used to simultaneously predict the text/non-text
score, axis-aligned box and inclined minimum area box. At last, we use an
inclined non-maximum suppression to get the detection results. Our approach
achieves competitive results on text detection benchmarks: ICDAR 2015 and ICDAR
2013.
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 05:00:38 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Jun 2017 13:01:52 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Jiang",
"Yingying",
""
],
[
"Zhu",
"Xiangyu",
""
],
[
"Wang",
"Xiaobing",
""
],
[
"Yang",
"Shuli",
""
],
[
"Li",
"Wei",
""
],
[
"Wang",
"Hua",
""
],
[
"Fu",
"Pei",
""
],
[
"Luo",
"Zhenbo",
""
]
] |
new_dataset
| 0.990758 |
1706.09927
|
Cedomir Stefanovic
|
Federico Clazzer, Enrico Paolini, Iacopo Mambelli, Cedomir Stefanovic
|
Irregular Repetition Slotted ALOHA over the Rayleigh Block Fading
Channel with Capture
|
Presented at ICC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Random access protocols relying on the transmission of packet replicas in
multiple slots and exploiting interference cancellation at the receiver have
been shown to achieve per- formance competitive with that of orthogonal
schemes. So far the optimization of the repetition degree profile, defining the
probability for a user to transmit a given number of replicas, has mainly been
performed targeting the collision channel model. In this paper the analysis is
extended to a block fading channel model, also assuming capture effect at the
receiver. Density evolution equations are developed for the new setting and,
based on them, some repetition degree profiles are optimized and analyzed via
Monte Carlo simulation in a finite frame length setting. The derived
distributions are shown to achieve throughputs largely exceeding 1
[packet/slot].
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 19:05:01 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Clazzer",
"Federico",
""
],
[
"Paolini",
"Enrico",
""
],
[
"Mambelli",
"Iacopo",
""
],
[
"Stefanovic",
"Cedomir",
""
]
] |
new_dataset
| 0.995101 |
1706.10046
|
Mikhail Rudoy
|
Erik D. Demaine, Mikhail Rudoy
|
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin
Polygonal Grid Graphs
|
25 pages, 21 figures
| null | null | null |
cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2007, Arkin et al. initiated a systematic study of the complexity of the
Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs,
restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs.
They solved many combinations of these problems, proving them either
polynomially solvable or NP-complete, but left three combinations open. In this
paper, we prove two of these unsolved combinations to be NP-complete:
Hamiltonicity of Square Polygonal Grid Graphs and Hamiltonicity of Hexagonal
Thin Grid Graphs. We also consider a new restriction, where the grid graph is
both thin and polygonal, and prove that Hamiltonicity then becomes polynomially
solvable for square, triangular, and hexagonal grid graphs.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 07:37:53 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Rudoy",
"Mikhail",
""
]
] |
new_dataset
| 0.9911 |
1706.10220
|
Amit Kumar Sikder
|
Amit Kumar Sikder, Hidayet Aksu, A. Selcuk Uluagac
|
6thSense: A Context-aware Sensor-based Attack Detector for Smart Devices
|
18 pages, Cyber-security, smart devices, sensors, sensor-based
threats, 26th USENIX Security Symposium
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensors (e.g., light, gyroscope, accelerotmeter) and sensing enabled
applications on a smart device make the applications more user-friendly and
efficient. However, the current permission-based sensor management systems of
smart devices only focus on certain sensors and any App can get access to other
sensors by just accessing the generic sensor API. In this way, attackers can
exploit these sensors in numerous ways: they can extract or leak users'
sensitive information, transfer malware, or record or steal sensitive
information from other nearby devices. In this paper, we propose 6thSense, a
context-aware intrusion detection system which enhances the security of smart
devices by observing changes in sensor data for different tasks of users and
creating a contextual model to distinguish benign and malicious behavior of
sensors. 6thSense utilizes three different Machine Learning-based detection
mechanisms (i.e., Markov Chain, Naive Bayes, and LMT) to detect malicious
behavior associated with sensors. We implemented 6thSense on a sensor-rich
Android smart device (i.e., smartphone) and collected data from typical daily
activities of 50 real users. Furthermore, we evaluated the performance of
6thSense against three sensor-based threats: (1) a malicious App that can be
triggered via a sensor (e.g., light), (2) a malicious App that can leak
information via a sensor, and (3) a malicious App that can steal data using
sensors. Our extensive evaluations show that the 6thSense framework is an
effective and practical approach to defeat growing sensor-based threats with an
accuracy above 96% without compromising the normal functionality of the device.
Moreover, our framework costs minimal overhead.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 14:40:08 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Sikder",
"Amit Kumar",
""
],
[
"Aksu",
"Hidayet",
""
],
[
"Uluagac",
"A. Selcuk",
""
]
] |
new_dataset
| 0.999649 |
1706.10223
|
Bart{\l}omiej Balcerzak
|
Bart{\l}omiej Balcerzak, Wies{\l}aw Kope\'c, Rados{\l}aw Nielek,
Sebastian Kruk, Kamil Warpechowski, Mateusz Wasik and Marek W\k{e}grzyn
|
Press F1 for help: participatory design for dealing with on-line and
real life security of older adults
| null | null | null | null |
cs.SI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the report on the design and development of a
platform for the inter-generational exchange of favors. This platform was
designed using participatory design approach during a 24-hour hackathon by a
team consisting of younger programmers and older adults. The findings of this
report show that inter-generational cooperation in which the older adults serve
as representatives of the end user, not only improves the design and
development of the application, but also provides an effective method for
designing and applying solutions aimed at improving the security of older
adults while using online and mobile tools.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 14:42:01 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Balcerzak",
"Bartłomiej",
""
],
[
"Kopeć",
"Wiesław",
""
],
[
"Nielek",
"Radosław",
""
],
[
"Kruk",
"Sebastian",
""
],
[
"Warpechowski",
"Kamil",
""
],
[
"Wasik",
"Mateusz",
""
],
[
"Węgrzyn",
"Marek",
""
]
] |
new_dataset
| 0.997726 |
1706.10290
|
Mohammad Hosseini
|
Mohammad Hosseini, Richard B. Berlin Jr., Lui Sha
|
Physiology-Aware Rural Ambulance Routing
|
6 pages, The Fifth IEEE International Conference on Healthcare
Informatics (ICHI 2017), Park City, Utah, 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In emergency patient transport from rural medical facility to center tertiary
hospital, real-time monitoring of the patient in the ambulance by a physician
expert at the tertiary center is crucial. While telemetry healthcare services
using mobile networks may enable remote real-time monitoring of transported
patients, physiologic measures and tracking are at least as important and
requires the existence of high-fidelity communication coverage. However, the
wireless networks along the roads especially in rural areas can range from 4G
to low-speed 2G, some parts with communication breakage. From a patient care
perspective, transport during critical illness can make route selection patient
state dependent. Prompt decisions with the relative advantage of a longer more
secure bandwidth route versus a shorter, more rapid transport route but with
less secure bandwidth must be made. The trade-off between route selection and
the quality of wireless communication is an important optimization problem
which unfortunately has remained unaddressed by prior work.
In this paper, we propose a novel physiology-aware route scheduling approach
for emergency ambulance transport of rural patients with acute, high risk
diseases in need of continuous remote monitoring. We mathematically model the
problem into an NP-hard graph theory problem, and approximate a solution based
on a trade-off between communication coverage and shortest path. We profile
communication along two major routes in a large rural hospital settings in
Illinois, and use the traces to manifest the concept. Further, we design our
algorithms and run preliminary experiments for scalability analysis. We believe
that our scheduling techniques can become a compelling aid that enables an
always-connected remote monitoring system in emergency patient transfer
scenarios aimed to prevent morbidity and mortality with early diagnosis
treatment.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 17:45:11 GMT"
}
] | 2017-07-03T00:00:00 |
[
[
"Hosseini",
"Mohammad",
""
],
[
"Berlin",
"Richard B.",
"Jr."
],
[
"Sha",
"Lui",
""
]
] |
new_dataset
| 0.985255 |
1407.2343
|
Kunal Narayan Chaudhury
|
S. Ghosh and K. N. Chaudhury
|
Fast Separable Non-Local Means
| null |
SPIE Journal of Electronic Imaging, vol. 25, no. 2, pp. 023026
(2016)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple and fast algorithm called PatchLift for computing
distances between patches (contiguous block of samples) extracted from a given
one-dimensional signal. PatchLift is based on the observation that the patch
distances can be efficiently computed from a matrix that is derived from the
one-dimensional signal using lifting; importantly, the number of operations
required to compute the patch distances using this approach does not scale with
the patch length. We next demonstrate how PatchLift can be used for patch-based
denoising of images corrupted with Gaussian noise. In particular, we propose a
separable formulation of the classical Non-Local Means (NLM) algorithm that can
be implemented using PatchLift. We demonstrate that the PatchLift-based
implementation of separable NLM is few orders faster than standard NLM, and is
competitive with existing fast implementations of NLM. Moreover, its denoising
performance is shown to be consistently superior to that of NLM and some of its
variants, both in terms of PSNR/SSIM and visual quality.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 03:15:37 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2017 06:35:50 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Ghosh",
"S.",
""
],
[
"Chaudhury",
"K. N.",
""
]
] |
new_dataset
| 0.997391 |
1701.08547
|
Robert Lim
|
Robert V. Lim, Boyana Norris, Allen D. Malony
|
Autotuning GPU Kernels via Static and Predictive Analysis
| null | null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optimizing the performance of GPU kernels is challenging for both human
programmers and code generators. For example, CUDA programmers must set thread
and block parameters for a kernel, but might not have the intuition to make a
good choice. Similarly, compilers can generate working code, but may miss
tuning opportunities by not targeting GPU models or performing code
transformations. Although empirical autotuning addresses some of these
challenges, it requires extensive experimentation and search for optimal code
variants. This research presents an approach for tuning CUDA kernels based on
static analysis that considers fine-grained code structure and the specific GPU
architecture features. Notably, our approach does not require any program runs
in order to discover near-optimal parameter settings. We demonstrate the
applicability of our approach in enabling code autotuners such as Orio to
produce competitive code variants comparable with empirical-based methods,
without the high cost of experiments.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 11:23:42 GMT"
},
{
"version": "v2",
"created": "Thu, 11 May 2017 22:27:32 GMT"
},
{
"version": "v3",
"created": "Thu, 29 Jun 2017 11:25:02 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Lim",
"Robert V.",
""
],
[
"Norris",
"Boyana",
""
],
[
"Malony",
"Allen D.",
""
]
] |
new_dataset
| 0.968318 |
1704.03603
|
Chengwen Xing
|
Yujie Lin, Shuai Wang, Xiangyuan Bu, Chengwen Xing, Jianping An
|
NOMA based Calibration for Large-Scale Spaceborne Antenna Arrays
|
30 Pages, 8 Figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the parallel calibration for transmitting phased arrays, the calibration
receiver must separate the signals belonging to different antenna elements to
avoid mutual interference. Existing algorithms encode different antenna
elements' radiation with orthogonal signature codes, but these algorithms are
far from desired for large-scale spaceborne antenna arrays. Considering the
strictly limited resources on satellites, to improve hardware efficiency of
large-scale spaceborne antenna arrays, in this work inspired by the idea of
non-orthogonal multiple access (NOMA) we design a series of non-orthogonal
signature codes for different antenna elements by Cyclically Shifting an
m-Sequence (CSmS) with different offsets named as CSmS-NOMA signaling. This
design can strike an elegant balance between the performance and complexity and
is very suitable for large-scale spaceborne antenna arrays. It is shown that no
matter how many antenna elements there are to be calibrated simultaneously,
CSmS-NOMA signaling needs only one calibrating waveform generator and one
matched filter. Hence it is much more efficient than the existing fully
orthogonal schemes. In order to evaluate the achievable calibration accuracy, a
unified theoretical framework is developed based on which the relationship
between calibration accuracy and signal to noise ratio (SNR) has been clearly
revealed. Furthermore, a hardware experiment platform is also built to assess
the theoretical work. For all the considered scenarios, it can be concluded
that the theoretical, simulated and experimental results coincide with each
other perfectly.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 02:48:17 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2017 02:34:15 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Lin",
"Yujie",
""
],
[
"Wang",
"Shuai",
""
],
[
"Bu",
"Xiangyuan",
""
],
[
"Xing",
"Chengwen",
""
],
[
"An",
"Jianping",
""
]
] |
new_dataset
| 0.985456 |
1705.03634
|
Shirui Li
|
Shirui Li, Alper Yilmaz, Changlin Xiao, Hua Li
|
4d isip: 4d implicit surface interest point detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new method to detect 4D spatiotemporal interest
points though an implicit surface, we refer to as the 4D-ISIP. We use a 3D
volume which has a truncated signed distance function(TSDF) for every voxel to
represent our 3D object model. The TSDF represents the distance between the
spatial points and object surface points which is an implicit surface
representation. Our novelty is to detect the points where the local
neighborhood has significant variations along both spatial and temporal
directions. We established a system to acquire 3D human motion dataset using
only one Kinect. Experimental results show that our method can detect 4D-ISIP
for different human actions.
|
[
{
"version": "v1",
"created": "Wed, 10 May 2017 07:12:31 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Jun 2017 07:18:54 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Li",
"Shirui",
""
],
[
"Yilmaz",
"Alper",
""
],
[
"Xiao",
"Changlin",
""
],
[
"Li",
"Hua",
""
]
] |
new_dataset
| 0.986703 |
1706.05432
|
Malte M\"oser
|
Arvind Narayanan and Malte M\"oser
|
Obfuscation in Bitcoin: Techniques and Politics
| null | null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the cryptographic currency Bitcoin, all transactions are recorded in the
blockchain - a public, global, and immutable ledger. Because transactions are
public, Bitcoin and its users employ obfuscation to maintain a degree of
financial privacy. Critically, and in contrast to typical uses of obfuscation,
in Bitcoin obfuscation is not aimed against the system designer but is instead
enabled by design. We map sixteen proposed privacy-preserving techniques for
Bitcoin on an obfuscation-vs.-cryptography axis, and find that those that are
used in practice tend toward obfuscation. We argue that this has led to a
balance between privacy and regulatory acceptance.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 21:15:46 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2017 15:03:16 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Narayanan",
"Arvind",
""
],
[
"Möser",
"Malte",
""
]
] |
new_dataset
| 0.999122 |
1706.06775
|
Junya Honda
|
Junya Honda and Hirosuke Yamamoto
|
Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric
Channel Coding
|
Full version of the paper to appear in 2017 IEEE International
Symposium on Information Theory (ISIT2017)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In communication through asymmetric channels the capacity-achieving input
distribution is not uniform in general. Homophonic coding is a framework to
invertibly convert a (usually uniform) message into a sequence with some target
distribution, and is a promising candidate to generate codewords with the
nonuniform target distribution for asymmetric channels. In particular, a
Variable-to-Fixed length (VF) homophonic code can be used as a suitable
component for channel codes to avoid decoding error propagation. However, the
existing VF homophonic code requires the knowledge of the maximum relative gap
of probabilities between two adjacent sequences beforehand, which is an
unrealistic assumption for long block codes. In this paper we propose a new VF
homophonic code without such a requirement by allowing one-symbol decoding
delay. We evaluate this code theoretically and experimentally to verify its
asymptotic optimality.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 07:58:21 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2017 11:00:29 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Honda",
"Junya",
""
],
[
"Yamamoto",
"Hirosuke",
""
]
] |
new_dataset
| 0.983819 |
1706.09088
|
Dorien Herremans
|
Dorien Herremans, Ching-Hua Chuan
|
Modeling Musical Context with Word2vec
|
Proceedings of the First International Conference on Deep Learning
and Music, Anchorage, US, May, 2017 (arXiv:1706.08675v1 [cs.NE])
|
Proceedings of the First International Workshop on Deep Learning
and Music joint with IJCNN. Anchorage, US. 1(1). pp 11-18 (2017)
| null |
DLM/2017/1
|
cs.SD cs.IR cs.MM cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a semantic vector space model for capturing complex polyphonic
musical context. A word2vec model based on a skip-gram representation with
negative sampling was used to model slices of music from a dataset of
Beethoven's piano sonatas. A visualization of the reduced vector space using
t-distributed stochastic neighbor embedding shows that the resulting embedded
vector space captures tonal relationships, even without any explicit
information about the musical contents of the slices. Secondly, an excerpt of
the Moonlight Sonata from Beethoven was altered by replacing slices based on
context similarity. The resulting music shows that the selected slice based on
similar word2vec context also has a relatively short tonal distance from the
original slice.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 00:46:50 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jun 2017 02:33:06 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Herremans",
"Dorien",
""
],
[
"Chuan",
"Ching-Hua",
""
]
] |
new_dataset
| 0.999235 |
1706.09485
|
Dixin Luo
|
Dixin Luo and Kelly Lyons
|
CASCONet: A Conference dataset
|
5 pages
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knowledge mobilization and translation describes the process of moving
knowledge from research and development (R&D) labs into environments where it
can be put to use. There is increasing interest in understanding mechanisms for
knowledge mobilization, specifically with respect to academia and industry
collaborations. These mechanisms include funding programs, research centers,
and conferences, among others. In this paper, we focus on one specific
knowledge mobilization mechanism, the CASCON conference, the annual conference
of the IBM Centre for Advanced Studies (CAS). The mandate of CAS when it was
established in 1990 was to foster collaborative work between the IBM Toronto
Lab and university researchers from around the world. The first CAS Conference
(CASCON) was held one year after CAS was formed in 1991. The focus of this
annual conference was, and continues to be, bringing together academic
researchers, industry practitioners, and technology users in a forum for
sharing ideas and showcasing the results of the CAS collaborative work. We
collected data about CASCON for the past 25 years including information about
papers, technology showcase demos, workshops, and keynote presentations. The
resulting dataset, called "CASCONet" is available for analysis and integration
with related datasets. Using CASCONet, we analyzed interactions between R&D
topics and changes in those topics over time. Results of our analysis show how
the domain of knowledge being mobilized through CAS had evolved over time. By
making CASCONet available to others, we hope that the data can be used in
additional ways to understand knowledge mobilization and translation in this
unique context.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 21:02:11 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Luo",
"Dixin",
""
],
[
"Lyons",
"Kelly",
""
]
] |
new_dataset
| 0.999759 |
1706.09558
|
Patrick Hutchings
|
P. Hutchings
|
Talking Drums: Generating drum grooves with neural networks
|
Proceedings of the First International Conference on Deep Learning
and Music, Anchorage, US, May, 2017 (arXiv:1706.08675v1 [cs.NE])
|
Proceedings of the First International Workshop on Deep Learning
and Music joint with IJCNN. Anchorage, US. 1(1). pp 43-47 (2017)
| null |
DLM/2017/3
|
cs.SD cs.MM cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Presented is a method of generating a full drum kit part for a provided
kick-drum sequence. A sequence to sequence neural network model used in natural
language translation was adopted to encode multiple musical styles and an
online survey was developed to test different techniques for sampling the
output of the softmax function. The strongest results were found using a
sampling technique that drew from the three most probable outputs at each
subdivision of the drum pattern but the consistency of output was found to be
heavily dependent on style.
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 03:03:35 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Hutchings",
"P.",
""
]
] |
new_dataset
| 0.970469 |
1706.09624
|
Panagiotis Diamantoulakis
|
Panagiotis D. Diamantoulakis and George K. Karagiannidis
|
Simultaneous Lightwave Information and Power Transfer (SLIPT) for Indoor
IoT Applications
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the concept of Simultaneous Lightwave Information and Power
Transfer (SLIPT) for indoor Internet-of-Things (IoT) applications.
Specifically, we propose novel and fundamental SLIPT strategies, which can be
implemented through Visible Light or Infrared communication systems, equipped
with a simple solar panel-based receiver. These strategies are performed at the
transmitter or at the receiver, or at both sides, named Adjusting transmission,
Adjusting reception and Coordinated adjustment of transmission and reception,
correspondingly. Furthermore, we deal with the fundamental trade-off between
harvested energy and quality-of-service (QoS), by maximizing the harvested
energy, while achieving the required user's QoS. To this end, two optimization
problems are formulated and optimally solved. Computer simulations validate the
optimum solutions and reveal that the proposed strategies considerably increase
the harvested energy, compared to SLIPT with fixed policies.
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 08:32:01 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Diamantoulakis",
"Panagiotis D.",
""
],
[
"Karagiannidis",
"George K.",
""
]
] |
new_dataset
| 0.992735 |
1706.09724
|
Damien Chablat
|
Damien Chablat (IRCCyN), Luc Baron (EPM), Ranjan Jha (EPM)
|
Kinematics and workspace analysis of a 3ppps parallel robot with
u-shaped base
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the kinematic analysis of the 3-PPPS parallel robot with
an equilateral mobile platform and a U-shape base. The proposed design and
appropriate selection of parameters allow to formulate simpler direct and
inverse kinematics for the manipulator under study. The parallel singularities
associated with the manipulator depend only on the orientation of the
end-effector, and thus depend only on the orientation of the end effector. The
quaternion parameters are used to represent the aspects, i.e. the singularity
free regions of the workspace. A cylindrical algebraic decomposition is used to
characterize the workspace and joint space with a low number of cells. The
dis-criminant variety is obtained to describe the boundaries of each cell. With
these simplifications, the 3-PPPS parallel robot with proposed design can be
claimed as the simplest 6 DOF robot, which further makes it useful for the
industrial applications.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 07:43:55 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Baron",
"Luc",
"",
"EPM"
],
[
"Jha",
"Ranjan",
"",
"EPM"
]
] |
new_dataset
| 0.966933 |
1706.09764
|
Melissa Duarte
|
Paul Ferrand and Melissa Duarte
|
Multi-tap Digital Canceller for Full-Duplex Applications
|
SPAWC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We identify phase noise as a bottleneck for the performance of digital
self-interference cancellers that utilize a single auxiliary
receiver---single-tap digital cancellers---and operate in multipath propagation
environments. Our analysis demonstrates that the degradation due to phase noise
is caused by a mismatch between the analog delay of the auxiliary receiver and
the different delays of the multipath components of the self-interference
signal. We propose a novel multi-tap digital self-interference canceller
architecture that is based on multiple auxiliary receivers and a customized
Normalized-Least-Mean-Squared (NLMS) filtering for self-interference
regeneration. Our simulation results demonstrate that our proposed architecture
is more robust to phase noise impairments and can in some cases achieve 10~dB
larger self-interference cancellation than the single-tap architecture.
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 14:03:31 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Ferrand",
"Paul",
""
],
[
"Duarte",
"Melissa",
""
]
] |
new_dataset
| 0.97941 |
1706.09817
|
Aleksandar Mastilovic
|
Aleksandar Mastilovic, Dejan Vukobratovic, Dusan Jakovetic, Dragana
Bajovic
|
Cooperative Slotted ALOHA for Massive M2M Random Access Using
Directional Antennas
|
IEEE ICC 2017, Workshop on Integrating Communications, Control, and
Computing Technologies for Smart Grid (ICT4SG) Pages = 6; Figures = 6
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC)
decoding have received significant attention lately due to their ability to
dramatically increase the throughput of traditional SA. Motivated by increased
density of cellular radio access networks due to the introduction of small
cells, and dramatic increase of user density in Machine-to-Machine (M2M)
communications, SA algorithms with SIC operating cooperatively in multi base
station (BS) scenario are recently considered. In this paper, we generalize our
previous work on Slotted ALOHA with multiple-BS (SA-MBS) by considering users
that use directional antennas. In particular, we focus on a simple randomized
beamforming strategy where, for every packet transmission, a user orients its
main beam in a randomly selected direction. We are interested in the total
achievable system throughput for two decoding scenarios: i) non-cooperative
scenario in which traditional SA operates at each BS independently, and ii)
cooperative SA-MBS in which centralized SIC-based decoding is applied over all
received user signals. For both scenarios, we provide upper system throughput
limits and compare them against the simulation results. Finally, we discuss the
system performance as a function of simple directional antenna model parameters
applied in this paper.
|
[
{
"version": "v1",
"created": "Thu, 29 Jun 2017 15:48:04 GMT"
}
] | 2017-06-30T00:00:00 |
[
[
"Mastilovic",
"Aleksandar",
""
],
[
"Vukobratovic",
"Dejan",
""
],
[
"Jakovetic",
"Dusan",
""
],
[
"Bajovic",
"Dragana",
""
]
] |
new_dataset
| 0.986808 |
1408.2955
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
A Hoare-like logic of asserted single-pass instruction sequences
|
22 pages, the preliminaries have textual overlaps with the
preliminaries in arXiv:1402.4950 [cs.LO] and earlier papers; introduction and
conclusions rewritten, explanatory remarks added; introduction partly
rewritten; 24 pages, clarifying examples added
|
Scientific Annals of Computer Science, 26(2):125--156 (2016)
|
10.7561/SACS.2016.2.125
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a formal system for proving the partial correctness of a
single-pass instruction sequence as considered in program algebra by
decomposition into proofs of the partial correctness of segments of the
single-pass instruction sequence concerned. The system is similar to Hoare
logics, but takes into account that, by the presence of jump instructions,
segments of single-pass instruction sequences may have multiple entry points
and multiple exit points. It is intended to support a sound general
understanding of the issues with Hoare-like logics for low-level programming
languages.
|
[
{
"version": "v1",
"created": "Wed, 13 Aug 2014 09:41:13 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Dec 2015 14:09:34 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Jul 2016 11:54:17 GMT"
},
{
"version": "v4",
"created": "Wed, 3 May 2017 11:53:03 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.9996 |
1702.06764
|
Pepe Vila
|
Pepe Vila and Boris K\"opf
|
Loophole: Timing Attacks on Shared Event Loops in Chrome
|
Original publication in the Proceedings of the 26th Annual USENIX
Security Symposium (USENIX Security 2017).
https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/vila
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event-driven programming (EDP) is the prevalent paradigm for graphical user
interfaces, web clients, and it is rapidly gaining importance for server-side
and network programming. Central components of EDP are {\em event loops}, which
act as FIFO queues that are used by processes to store and dispatch messages
received from other processes.
In this paper we demonstrate that shared event loops are vulnerable to
side-channel attacks, where a spy process monitors the loop usage pattern of
other processes by enqueueing events and measuring the time it takes for them
to be dispatched. Specifically, we exhibit attacks against the two central
event loops in Google's Chrome web browser: that of the I/O thread of the host
process, which multiplexes all network events and user actions, and that of the
main thread of the renderer processes, which handles rendering and Javascript
tasks.
For each of these loops, we show how the usage pattern can be monitored with
high resolution and low overhead, and how this can be abused for malicious
purposes, such as web page identification, user behavior detection, and covert
communication.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 11:55:01 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Jun 2017 15:10:50 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Vila",
"Pepe",
""
],
[
"Köpf",
"Boris",
""
]
] |
new_dataset
| 0.998848 |
1706.04188
|
Paul Ginsparg
|
P. Ginsparg
|
Preprint D\'ej\`a Vu: an FAQ
|
14 pages. v2: minor clarifications
| null |
10.15252/embj.201695531
| null |
cs.DL physics.soc-ph q-bio.OT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I give a brief overview of arXiv history, and describe the current state of
arXiv practice, both technical and sociological. This commentary originally
appeared in the EMBO Journal, 19 Oct 2016. It was intended as an update on
comments from the late 1990s regarding use of preprints by biologists (or lack
thereof), but may be of interest to practitioners of other disciplines. It is
based largely on a keynote presentation I gave to the ASAPbio inaugural meeting
in Feb 2016, and responds as well to some follow-up questions.
|
[
{
"version": "v1",
"created": "Tue, 13 Jun 2017 22:18:05 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Jun 2017 03:29:22 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Ginsparg",
"P.",
""
]
] |
new_dataset
| 0.998809 |
1706.08870
|
Yixin Luo
|
Yixin Luo, Saugata Ghose, Tianshi Li, Sriram Govindan, Bikash Sharma,
Bryan Kelly, Amirali Boroumand, Onur Mutlu
|
Using ECC DRAM to Adaptively Increase Memory Capacity
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern DRAM modules are often equipped with hardware error correction
capabilities, especially for DRAM deployed in large-scale data centers, as
process technology scaling has increased the susceptibility of these devices to
errors. To provide fast error detection and correction, error-correcting codes
(ECC) are placed on an additional DRAM chip in a DRAM module. This additional
chip expands the raw capacity of a DRAM module by 12.5%, but the applications
are unable to use any of this extra capacity, as it is used exclusively to
provide reliability for all data. In reality, there are a number of
applications that do not need such strong reliability for all their data
regions (e.g., some user batch jobs executing on a public cloud), and can
instead benefit from using additional DRAM capacity to store extra data. Our
goal in this work is to provide the additional capacity within an ECC DRAM
module to applications when they do not need the high reliability of error
correction.
In this paper, we propose Capacity- and Reliability-Adaptive Memory (CREAM),
a hardware mechanism that adapts error correcting DRAM modules to offer
multiple levels of error protection, and provides the capacity saved from using
weaker protection to applications. For regions of memory that do not require
strong error correction, we either provide no ECC protection or provide error
detection using multibit parity. We evaluate several layouts for arranging the
data within ECC DRAM in these reduced-protection modes, taking into account the
various trade-offs exposed from exploiting the extra chip. Our experiments show
that the increased capacity provided by CREAM improves performance by 23.0% for
a memory caching workload, and by 37.3% for a commercial web search workload
executing production query traces. In addition, CREAM can increase bank-level
parallelism within DRAM, offering further performance improvements.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 14:13:20 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Jun 2017 05:31:13 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Luo",
"Yixin",
""
],
[
"Ghose",
"Saugata",
""
],
[
"Li",
"Tianshi",
""
],
[
"Govindan",
"Sriram",
""
],
[
"Sharma",
"Bikash",
""
],
[
"Kelly",
"Bryan",
""
],
[
"Boroumand",
"Amirali",
""
],
[
"Mutlu",
"Onur",
""
]
] |
new_dataset
| 0.985757 |
1706.09043
|
Daniel Paulusma
|
Dani\"el Paulusma and Christophe Picouleau and Bernard Ries
|
Critical Vertices and Edges in $H$-free Graphs
| null | null | null | null |
cs.CC cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A vertex or edge in a graph is critical if its deletion reduces the chromatic
number of the graph by 1. We consider the problems of deciding whether a graph
has a critical vertex or edge, respectively. We give a complexity dichotomy for
both problems restricted to $H$-free graphs, that is, graphs with no induced
subgraph isomorphic to $H$. Moreover, we show that an edge is critical if and
only if its contraction reduces the chromatic number by 1. Hence, we also
obtain a complexity dichotomy for the problem of deciding if a graph has an
edge whose contraction reduces the chromatic number by 1.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 20:58:26 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Paulusma",
"Daniël",
""
],
[
"Picouleau",
"Christophe",
""
],
[
"Ries",
"Bernard",
""
]
] |
new_dataset
| 0.987228 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.