id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1603.09598
|
Sabri Pllana
|
Sabri Pllana, Florian Huber, Zdenek Hrdlicka, Christos Mettouris, Asja
Veber, Zs\'ofia Ocsovszky, Chris Gary, Eleni Boulomyti, Phil Smith
|
SciChallenge: Using Student-Generated Content and Contests to Enhance
the Interest for Science Education and Careers
|
New Perspectives in Science Education, 5th Edition, 17 - 18 March
2016, Florence, Italy
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Science education will play a vital role in shaping the present and future of
modern societies. Thus, Europe needs all its talents to increase creativity and
competitiveness. Young boys and girls especially have to be engaged to pursue
careers in Science, Technology, Engineering and Mathematics (STEM). However,
statistics still show that enrolment rates in STEM-based degree programs are
decreasing. This will lead to a workforce problem in the industrial sector as
well as in research and development, especially in many of the new member
countries. This paper highlights a recently funded EU-research project
SciChallenge (www.scichallenge.eu), which focuses on the development of novel
concepts to get young people excited about science education. It uses a
contest-based approach towards self-produced digital education materials from
young people for young people. In cooperation with partner schools, teachers,
and other youth-oriented institutions, the contest participants (individuals or
groups) between the ages of 10 and 20 years generate creative digital materials
(videos, slides, or infographics). The participants upload their content in
social media channels and the submissions are aggregated on the SciChallenge
Web Platform. The winners receive prizes funded by science-oriented industry
and other stakeholders. Intelligent cross-sectoral positioning of various
awareness modules on the SciChallenge Open Information Hub is expected to
increase awareness on science careers. Through a strong involvement of related
organizations and industries, we expect to open new opportunities for young
people in regards to internships or taster days in STEM disciplines.
Additionally, aggregated information on science events (such as, slams, nights,
festivals) is shared. With this multi-level approach, SciChallenge may boost
the attractiveness of science education and careers among young people.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 14:06:54 GMT"
}
] | 2016-04-01T00:00:00 |
[
[
"Pllana",
"Sabri",
""
],
[
"Huber",
"Florian",
""
],
[
"Hrdlicka",
"Zdenek",
""
],
[
"Mettouris",
"Christos",
""
],
[
"Veber",
"Asja",
""
],
[
"Ocsovszky",
"Zsófia",
""
],
[
"Gary",
"Chris",
""
],
[
"Boulomyti",
"Eleni",
""
],
[
"Smith",
"Phil",
""
]
] |
new_dataset
| 0.978274 |
1406.0416
|
Anya Johnson
|
Anya Elaine Johnson, Eli Strauss, Rodney Pickett, Christoph Adami, Ian
Dworkin, and Heather J. Goldsby
|
More Bang For Your Buck: Quorum-Sensing Capabilities Improve the
Efficacy of Suicidal Altruism
|
8 pages, 8 figures, ALIFE '14 conference
|
ALIFE 14: The Fourteenth Conference on the Synthesis and
Simulation of Living Systems. (2014) Vol. 14
| null | null |
cs.NE cs.CE q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Within the context of evolution, an altruistic act that benefits the
receiving individual at the expense of the acting individual is a puzzling
phenomenon. An extreme form of altruism can be found in colicinogenic E. coli.
These suicidal altruists explode, releasing colicins that kill unrelated
individuals, which are not colicin resistant. By committing suicide, the
altruist makes it more likely that its kin will have less competition. The
benefits of this strategy rely on the number of competitors and kin nearby. If
the organism explodes at an inopportune time, the suicidal act may not harm any
competitors. Communication could enable organisms to act altruistically when
environmental conditions suggest that that strategy would be most beneficial.
Quorum sensing is a form of communication in which bacteria produce a protein
and gauge the amount of that protein around them. Quorum sensing is one means
by which bacteria sense the biotic factors around them and determine when to
produce products, such as antibiotics, that influence competition. Suicidal
altruists could use quorum sensing to determine when exploding is most
beneficial, but it is challenging to study the selective forces at work in
microbes. To address these challenges, we use digital evolution (a form of
experimental evolution that uses self-replicating computer programs as
organisms) to investigate the effects of enabling altruistic organisms to
communicate via quorum sensing. We found that quorum-sensing altruists killed a
greater number of competitors per explosion, winning competitions against
non-communicative altruists. These findings indicate that quorum sensing could
increase the beneficial effect of altruism and the suite of conditions under
which it will evolve.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2014 15:41:44 GMT"
}
] | 2016-03-31T00:00:00 |
[
[
"Johnson",
"Anya Elaine",
""
],
[
"Strauss",
"Eli",
""
],
[
"Pickett",
"Rodney",
""
],
[
"Adami",
"Christoph",
""
],
[
"Dworkin",
"Ian",
""
],
[
"Goldsby",
"Heather J.",
""
]
] |
new_dataset
| 0.985648 |
1603.07899
|
Konrad Siek
|
Jan Baranowski, Pawe{\l} Kobyli\'nski, Konrad Siek, Pawe{\l} T.
Wojciechowski
|
Helenos: A Realistic Benchmark for Distributed Transactional Memory
| null | null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transactional Memory (TM) is an approach to concurrency control that aims to
make writing parallel programs both effective and simple. The approach is
started in non-distributed multiprocessor systems, but is gaining popularity in
distributed systems to synchronize tasks at large scales. Efficiency and
scalability are often the key issues in TM research, so performance benchmarks
are an important part of it. However, while standard TM benchmarks like the
STAMP suite and STMBench7 are available and widely accepted, they do not
translate well into distributed systems. Hence, the set of benchmarks usable
with distributed TM systems is very limited, and must be padded with
microbenchmarks, whose simplicity and artificial nature often makes them
uninformative or misleading. Therefore, this paper introduces Helenos, a
realistic, complex, and comprehensive distributed TM benchmark based on the
problem of the Facebook inbox, an application of the Cassandra distributed
store.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 13:14:23 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Mar 2016 12:00:49 GMT"
}
] | 2016-03-31T00:00:00 |
[
[
"Baranowski",
"Jan",
""
],
[
"Kobyliński",
"Paweł",
""
],
[
"Siek",
"Konrad",
""
],
[
"Wojciechowski",
"Paweł T.",
""
]
] |
new_dataset
| 0.999554 |
1603.09164
|
Swati Agarwal
|
Swati Agarwal, Ashish Sureka
|
Spider and the Flies : Focused Crawling on Tumblr to Detect Hate
Promoting Communities
|
8 Pages, 7 Figures including 9 images, 2 Tables, 3 Algorithms,
Extended version of our work Agarwal et. al., Micropost 2015
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tumblr is one of the largest and most popular microblogging website on the
Internet. Studies shows that due to high reachability among viewers, low
publication barriers and social networking connectivity, microblogging websites
are being misused as a platform to post hateful speech and recruiting new
members by existing extremist groups. Manual identification of such posts and
communities is overwhelmingly impractical due to large amount of posts and
blogs being published every day. We propose a topic based web crawler primarily
consisting of multiple phases: training a text classifier model consisting
examples of only hate promoting users, extracting posts of an unknown tumblr
micro-blogger, classifying hate promoting bloggers based on their activity
feeds, crawling through the external links to other bloggers and performing a
social network analysis on connected extremist bloggers. To investigate the
effectiveness of our approach, we conduct experiments on large real world
dataset. Experimental results reveals that the proposed approach is an
effective method and has an F-score of 0.80. We apply social network analysis
based techniques and identify influential and core bloggers in a community.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 13:00:15 GMT"
}
] | 2016-03-31T00:00:00 |
[
[
"Agarwal",
"Swati",
""
],
[
"Sureka",
"Ashish",
""
]
] |
new_dataset
| 0.981966 |
1603.09188
|
Spandana Gella
|
Spandana Gella, Mirella Lapata, Frank Keller
|
Unsupervised Visual Sense Disambiguation for Verbs using Multimodal
Embeddings
|
11 pages, NAACL-HLT 2016
| null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new task, visual sense disambiguation for verbs: given an
image and a verb, assign the correct sense of the verb, i.e., the one that
describes the action depicted in the image. Just as textual word sense
disambiguation is useful for a wide range of NLP tasks, visual sense
disambiguation can be useful for multimodal tasks such as image retrieval,
image description, and text illustration. We introduce VerSe, a new dataset
that augments existing multimodal datasets (COCO and TUHOI) with sense labels.
We propose an unsupervised algorithm based on Lesk which performs visual sense
disambiguation using textual, visual, or multimodal embeddings. We find that
textual embeddings perform well when gold-standard textual annotations (object
labels and image descriptions) are available, while multimodal embeddings
perform well on unannotated images. We also verify our findings by using the
textual and multimodal embeddings as features in a supervised setting and
analyse the performance of visual sense disambiguation task. VerSe is made
publicly available and can be downloaded at:
https://github.com/spandanagella/verse.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 13:43:38 GMT"
}
] | 2016-03-31T00:00:00 |
[
[
"Gella",
"Spandana",
""
],
[
"Lapata",
"Mirella",
""
],
[
"Keller",
"Frank",
""
]
] |
new_dataset
| 0.999287 |
1506.01342
|
Aruni RoyChowdhury
|
Aruni RoyChowdhury, Tsung-Yu Lin, Subhransu Maji, Erik Learned-Miller
|
One-to-many face recognition with bilinear CNNs
|
Published version at WACV 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent explosive growth in convolutional neural network (CNN) research
has produced a variety of new architectures for deep learning. One intriguing
new architecture is the bilinear CNN (B-CNN), which has shown dramatic
performance gains on certain fine-grained recognition problems [15]. We apply
this new CNN to the challenging new face recognition benchmark, the IARPA Janus
Benchmark A (IJB-A) [12]. It features faces from a large number of identities
in challenging real-world conditions. Because the face images were not
identified automatically using a computerized face detection system, it does
not have the bias inherent in such a database. We demonstrate the performance
of the B-CNN model beginning from an AlexNet-style network pre-trained on
ImageNet. We then show results for fine-tuning using a moderate-sized and
public external database, FaceScrub [17]. We also present results with
additional fine-tuning on the limited training data provided by the protocol.
In each case, the fine-tuned bilinear model shows substantial improvements over
the standard CNN. Finally, we demonstrate how a standard CNN pre-trained on a
large face database, the recently released VGG-Face model [20], can be
converted into a B-CNN without any additional feature training. This B-CNN
improves upon the CNN performance on the IJB-A benchmark, achieving 89.5%
rank-1 recall.
|
[
{
"version": "v1",
"created": "Wed, 3 Jun 2015 18:34:41 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jun 2015 00:41:33 GMT"
},
{
"version": "v3",
"created": "Fri, 5 Jun 2015 21:27:50 GMT"
},
{
"version": "v4",
"created": "Wed, 23 Sep 2015 20:05:39 GMT"
},
{
"version": "v5",
"created": "Mon, 28 Mar 2016 21:32:33 GMT"
}
] | 2016-03-30T00:00:00 |
[
[
"RoyChowdhury",
"Aruni",
""
],
[
"Lin",
"Tsung-Yu",
""
],
[
"Maji",
"Subhransu",
""
],
[
"Learned-Miller",
"Erik",
""
]
] |
new_dataset
| 0.997255 |
1602.08238
|
Atsushi Iwasaki
|
Atsushi Iwasaki, Ken Umeno
|
Three Theorems on odd degree Chebyshev polynomials and more generalized
permutation polynomials over a ring of module $2^w$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Odd degree Chebyshev polynomials over a ring of modulo $2^w$ have two kinds
of period. One is an "orbital period". Odd degree Chebyshev polynomials are
bijection over the ring. Therefore, when an odd degree Chebyshev polynomial
iterate affecting a factor of the ring, we can observe an orbit over the ring.
The "orbital period" is a period of the orbit. The other is a "degree period".
It is observed when changing the degree of Chebyshev polynomials with a fixed
argument of polynomials. Both kinds of period have not been completely studied.
In this paper, we clarify completely both of them. The knowledge about them
enables us to efficiently solve degree decision problem of Chebyshev polynomial
over the ring, and so a key-exchange protocol with Chebyshev polynomial over
the ring is not secure. In addition, we generalize the discussion and show that
a key-exchange protocol with more generalized permutation polynomials which
belong to a certain class is not secure.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 08:45:09 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Mar 2016 05:51:53 GMT"
}
] | 2016-03-30T00:00:00 |
[
[
"Iwasaki",
"Atsushi",
""
],
[
"Umeno",
"Ken",
""
]
] |
new_dataset
| 0.996138 |
1603.08868
|
Sowmya Vajjala
|
Ildik\'o Pil\'an, Sowmya Vajjala and Elena Volodina
|
A Readable Read: Automatic Assessment of Language Learning Materials
based on Linguistic Complexity
|
Presented at CICLING 2015 and won the best poster award (16th
International Conference on Intelligent Text Processing and Computational
Linguistics). To appear in International Journal of Computational Linguistics
and Applications (IJLCA), 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Corpora and web texts can become a rich language learning resource if we have
a means of assessing whether they are linguistically appropriate for learners
at a given proficiency level. In this paper, we aim at addressing this issue by
presenting the first approach for predicting linguistic complexity for Swedish
second language learning material on a 5-point scale. After showing that the
traditional Swedish readability measure, L\"asbarhetsindex (LIX), is not
suitable for this task, we propose a supervised machine learning model, based
on a range of linguistic features, that can reliably classify texts according
to their difficulty level. Our model obtained an accuracy of 81.3% and an
F-score of 0.8, which is comparable to the state of the art in English and is
considerably higher than previously reported results for other languages. We
further studied the utility of our features with single sentences instead of
full texts since sentences are a common linguistic unit in language learning
exercises. We trained a separate model on sentence-level data with five
classes, which yielded 63.4% accuracy. Although this is lower than the document
level performance, we achieved an adjacent accuracy of 92%. Furthermore, we
found that using a combination of different features, compared to using lexical
features alone, resulted in 7% improvement in classification accuracy at the
sentence level, whereas at the document level, lexical features were more
dominant. Our models are intended for use in a freely accessible web-based
language learning platform for the automatic generation of exercises.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2016 18:12:28 GMT"
}
] | 2016-03-30T00:00:00 |
[
[
"Pilán",
"Ildikó",
""
],
[
"Vajjala",
"Sowmya",
""
],
[
"Volodina",
"Elena",
""
]
] |
new_dataset
| 0.994657 |
1510.06578
|
Vasileios Kapinas
|
Dimitrios S. Karas, Alexandros-Apostolos A. Boulogeorgos, Sotirios K.
Mihos, Vasileios M. Kapinas, and George K. Karagiannidis
|
Securing the MIMO Wiretap Channel with Polar Codes and Encryption
|
This paper has been withdrawn by the authors due to unrealistic
system model assumptions and other gaps in the theoretical reasoning of the
achieved security
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes have been proven to be capacity achieving for any binary-input
discrete memoryless channel, while at the same time they can reassure secure
and reliable transmission over the single-input single-output wireless channel.
However, the use of polar codes to secure multiple-antenna transmission and
reception has not yet been reported in the open literature. In this paper, we
assume a multiple-input multiple-output wiretap channel, where the legitimate
receiver and the eavesdropper are equipped with the same number of antennas. We
introduce a protocol that exploits the properties of both physical and media
access control layer security by employing polar coding and encryption
techniques in a hybrid manner in order to guarantee secure transmission. A
novel security technique is also proposed, where a cryptographic key is
generated based on the information transmitted and renewed every transmission
block without the need for a separate key exchange method. Finally, to
illustrate the effectiveness of the proposed protocol, we prove the weak and
strong security conditions, and we provide a practical method to achieve
computational security for the cases where these conditions cannot be
established.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2015 11:18:02 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Mar 2016 16:58:13 GMT"
}
] | 2016-03-29T00:00:00 |
[
[
"Karas",
"Dimitrios S.",
""
],
[
"Boulogeorgos",
"Alexandros-Apostolos A.",
""
],
[
"Mihos",
"Sotirios K.",
""
],
[
"Kapinas",
"Vasileios M.",
""
],
[
"Karagiannidis",
"George K.",
""
]
] |
new_dataset
| 0.99955 |
1512.01980
|
Akashdeep Bhardwaj
|
Akashdeep Bhardwaj, G.V.B. Subrahmanyam, Vinay Avasthi, Hanumat Sastry
|
Ransomware: A Rising Threat of new age Digital Extortion
|
This paper has been withdrawn by the author due to a crucial sign
error in the findings and paper
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article attempts to discover the surreptitious features of ransomware
and to address it in information systems security research. It intends to
elicit attention with regard to ransomware, a newly emerged cyber threat using
such encryption technology as RSA, and to help both academic researchers and IT
practitioners understand the technological characteristics of ransomware, along
with its severity analysis. As ransomware infections continue to rise and
attacks employing refined algorithm become increasingly sophisticated, data
protection faces serious challenges. The article discusses future trends and
research directions related to ransomware, and provides prevention strategies
for SMEs.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 11:06:17 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Mar 2016 05:39:39 GMT"
}
] | 2016-03-29T00:00:00 |
[
[
"Bhardwaj",
"Akashdeep",
""
],
[
"Subrahmanyam",
"G. V. B.",
""
],
[
"Avasthi",
"Vinay",
""
],
[
"Sastry",
"Hanumat",
""
]
] |
new_dataset
| 0.999324 |
1603.08019
|
Raj Jain
|
Arjan Durresi, Sastri Kota, Mukul Goyal, Raj Jain, Venkata Bharani
|
Achieving QoS for TCP Traffic in Satellite Networks with Differentiated
Services
| null |
Space Communications, Volume 17, Number 1-3, 2001, pp. 125-136
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Satellite networks play an indispensable role in providing global Internet
access and electronic connectivity. To achieve such a global communications,
provisioning of quality of service (QoS) within the advanced satellite systems
is the main requirement. One of the key mechanisms of implementing the quality
of service is traffic management. Traffic management becomes a crucial factor
in the case of satellite network because of the limited availability of their
resources. Currently, Internet Protocol (IP) only has minimal traffic
management capabilities and provides best effort services. In this paper, we
present broadband satellite network QoS model and simulated performance
results. In particular, we discuss the TCP flow aggregates performance for
their good behavior in the presence of competing UDP flow aggregates in the
same assured forwarding. We identify several factors that affect the
performance in the mixed environments and quantify their effects using a full
factorial design of experiment methodology.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 20:16:23 GMT"
}
] | 2016-03-29T00:00:00 |
[
[
"Durresi",
"Arjan",
""
],
[
"Kota",
"Sastri",
""
],
[
"Goyal",
"Mukul",
""
],
[
"Jain",
"Raj",
""
],
[
"Bharani",
"Venkata",
""
]
] |
new_dataset
| 0.990312 |
1603.08020
|
Raj Jain
|
Sastri Kota, Mukul Goyal, Rohit Goyal and Raj Jain
|
Multimedia Satellite Networks and TCP/IP Traffic Transport
| null |
International Journal of Computers and Applications, Vol. 23, No.
2, 2001, pp. 115-128
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To meet an increasing demand for multimedia services and electronic
connectivity across the world, satellite networks will play an indispensable
role in the deployment of global networks. The new services gaining momentum
include mobile services, private intranets and high data rate internet access
carried over integrated satellite-fiber networks. Several performance issues
need to be addressed before a transport layer protocol, like TCP can
satisfactorily work over satellite ATM for large delay-bandwidth networks. In
this paper, we review the proposed satellite systems and discuss challenges
such as, traffic management and QoS requirements for broadband satellite ATM
networks. The performance results of TCP enhancements for Unspecified Bit Rate
over ATM (ATM-UBR+) for large bandwidth-delay environments with various end
system policies and drop policies for several buffer sizes are presented.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 20:22:52 GMT"
}
] | 2016-03-29T00:00:00 |
[
[
"Kota",
"Sastri",
""
],
[
"Goyal",
"Mukul",
""
],
[
"Goyal",
"Rohit",
""
],
[
"Jain",
"Raj",
""
]
] |
new_dataset
| 0.999471 |
1603.08026
|
Raj Jain
|
Jianli Pan, Shan Zhi Chen, Raj Jain, Subharthi Paul
|
Energy Sensing and Monitoring Framework with an Integrated Communication
Backbone in the Energy Efficient Intelligent Buildings
| null |
Applied Mechanics and Materials (Volumes 303 - 306), pp.
1460-1464, February, 2013
|
10.4028/www.scientific.net/AMM.303-306.1460
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building environments are significant sources of global energy consumption.
To create energy efficient buildings, the first step is to sense and monitor
all the energy-consuming appliances in the buildings and record all the energy
consumption information. After that, appropriate energy saving policies can be
decided and the instructions can be sent to the control devices to apply the
energy saving adjustments. To do that, in-building two-way communication
networks are needed to connect all the sensors to collect information as well
as to send control instructions. However, most of the current devices are
provided by separate manufacturers and with separate network infrastructures
and so there is not much integration and interaction among different
subsystems. In this paper, we envision a new energy sensing and monitoring
framework with integrated communication backbone in the intelligent building
environments. Specifically, through comprehensive comparisons and
investigations, we study different candidate communicating media and protocols
like wireline, wireless, and power-line communications technologies that
potentially can be used in the intelligent buildings to realize the goals of
coordination, integration, and energy efficiency. Also, we propose an extension
"smart box" for integration of the devices before the maturity of the
standardization process. Cloud computing and smart phone technologies are also
introduced to realize the goals of improving energy efficiency and promote
global sustainability.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 20:41:09 GMT"
}
] | 2016-03-29T00:00:00 |
[
[
"Pan",
"Jianli",
""
],
[
"Chen",
"Shan Zhi",
""
],
[
"Jain",
"Raj",
""
],
[
"Paul",
"Subharthi",
""
]
] |
new_dataset
| 0.989335 |
1505.01197
|
Georgia Gkioxari
|
Georgia Gkioxari, Ross Girshick, Jitendra Malik
|
Contextual Action Recognition with R*CNN
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are multiple cues in an image which reveal what action a person is
performing. For example, a jogger has a pose that is characteristic for
jogging, but the scene (e.g. road, trail) and the presence of other joggers can
be an additional source of information. In this work, we exploit the simple
observation that actions are accompanied by contextual cues to build a strong
action recognition system. We adapt RCNN to use more than one region for
classification while still maintaining the ability to localize the action. We
call our system R*CNN. The action-specific models and the feature maps are
trained jointly, allowing for action specific representations to emerge. R*CNN
achieves 90.2% mean AP on the PASAL VOC Action dataset, outperforming all other
approaches in the field by a significant margin. Last, we show that R*CNN is
not limited to action recognition. In particular, R*CNN can also be used to
tackle fine-grained tasks such as attribute classification. We validate this
claim by reporting state-of-the-art performance on the Berkeley Attributes of
People dataset.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 21:56:10 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Sep 2015 20:29:26 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Mar 2016 01:06:01 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Gkioxari",
"Georgia",
""
],
[
"Girshick",
"Ross",
""
],
[
"Malik",
"Jitendra",
""
]
] |
new_dataset
| 0.998703 |
1506.06275
|
Konrad Siek
|
Konrad Siek and Pawe{\l} T. Wojciechowski
|
Last-use Opacity: A Strong Safety Property for Transactional Memory with
Early Release Support
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transaction Memory (TM) is a concurrency control abstraction that allows the
programmer to specify blocks of code to be executed atomically as transactions.
However, since transactional code can contain just about any operation
attention must be paid to the state of shared variables at any given time.
E.g., contrary to a database transaction, if a TM transaction reads a stale
value it may execute dangerous operations, like attempt to divide by zero,
access an illegal memory address, or enter an infinite loop. Thus
serializability is insufficient, and stronger safety properties are required in
TM, which regulate what values can be read, even by transactions that abort.
Hence, a number of TM safety properties were developed, including opacity, and
TMS1 and TMS2. However, such strong properties preclude using early release as
a technique for optimizing TM, because they virtually forbid reading from live
transactions. On the other hand, properties that do allow early release are
either not strong enough to prevent any of the problems mentioned above
(recoverability), or add additional conditions on transactions with early
release that limit their applicability (elastic opacity, live opacity, virtual
world consistency). This paper introduces last-use opacity, a new TM safety
property that is meant to be a compromise between strong properties like
opacity and serializability. The property eliminates all but a small class of
inconsistent views and poses no stringent conditions on transactions. For
illustration, we present a last-use opaque TM algorithm and show that it
satisfies the new safety property.
|
[
{
"version": "v1",
"created": "Sat, 20 Jun 2015 18:09:09 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Jun 2015 09:13:28 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Mar 2016 13:18:39 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Siek",
"Konrad",
""
],
[
"Wojciechowski",
"Paweł T.",
""
]
] |
new_dataset
| 0.957429 |
1603.07737
|
Michael Hoffmann
|
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters,
Csaba D. T\'oth
|
The Planar Tree Packing Theorem
|
Full version of our SoCG 2016 paper
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Packing graphs is a combinatorial problem where several given graphs are
being mapped into a common host graph such that every edge is used at most
once. In the planar tree packing problem we are given two trees T1 and T2 on n
vertices and have to find a planar graph on n vertices that is the
edge-disjoint union of T1 and T2. A clear exception that must be made is the
star which cannot be packed together with any other tree. But according to a
conjecture of Garc\'ia et al. from 1997 this is the only exception, and all
other pairs of trees admit a planar packing. Previous results addressed various
special cases, such as a tree and a spider tree, a tree and a caterpillar, two
trees of diameter four, two isomorphic trees, and trees of maximum degree
three. Here we settle the conjecture in the affirmative and prove its general
form, thus making it the planar tree packing theorem. The proof is constructive
and provides a polynomial time algorithm to obtain a packing for two given
nonstar trees.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 20:08:38 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Geyer",
"Markus",
""
],
[
"Hoffmann",
"Michael",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kusters",
"Vincent",
""
],
[
"Tóth",
"Csaba D.",
""
]
] |
new_dataset
| 0.995412 |
1603.07813
|
Rossano Schifanella
|
Luca Maria Aiello, Rossano Schifanella, Daniele Quercia, Francesco
Aletta
|
Chatty Maps: Constructing sound maps of urban areas from social media
data
|
28 pages, 18 figures, final version published in Royal Society Open
Science journal, Royal Society Open Science (published in 23rd March 2016)
| null | null | null |
cs.SI cs.CY cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Urban sound has a huge influence over how we perceive places. Yet, city
planning is concerned mainly with noise, simply because annoying sounds come to
the attention of city officials in the form of complaints, while general urban
sounds do not come to the attention as they cannot be easily captured at city
scale. To capture both unpleasant and pleasant sounds, we applied a new
methodology that relies on tagging information of geo-referenced pictures to
the cities of London and Barcelona. To begin with, we compiled the first urban
sound dictionary and compared it to the one produced by collating insights from
the literature: ours was experimentally more valid (if correlated with official
noise pollution levels) and offered a wider geographic coverage. From picture
tags, we then studied the relationship between soundscapes and emotions. We
learned that streets with music sounds were associated with strong emotions of
joy or sadness, while those with human sounds were associated with joy or
surprise. Finally, we studied the relationship between soundscapes and people's
perceptions and, in so doing, we were able to map which areas are chaotic,
monotonous, calm, and exciting.Those insights promise to inform the creation of
restorative experiences in our increasingly urbanized world.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 03:33:46 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Aiello",
"Luca Maria",
""
],
[
"Schifanella",
"Rossano",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Aletta",
"Francesco",
""
]
] |
new_dataset
| 0.999108 |
1603.07881
|
Janosch D\"ocker
|
Andreas Darmann, Janosch D\"ocker
|
Monotone 3-Sat-4 is NP-complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean
formulae in conjunctive normal form. In this variant, each clause contains
exactly three literals---either all or none of them are positive, i.e., no
clause contains both a positive and a negative literal---and every variable
appears at most four times in the formula. Moreover, every clause consists of
three distinct literals. We show that Monotone 3-Sat-4 is NP-complete.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 11:13:56 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Darmann",
"Andreas",
""
],
[
"Döcker",
"Janosch",
""
]
] |
new_dataset
| 0.997396 |
1603.07933
|
Kiran Garimella
|
Kiran Garimella, Ingmar Weber, Munmun De Choudhury
|
Quote RTs on Twitter: Usage of the New Feature for Political Discourse
|
Accepted as short paper at ACM WebScience 2016
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media platforms provide several social interactional features. Due to
the large scale reach of social media, these interactional features help enable
various types of political discourse. Constructive and diversified discourse is
important for sustaining healthy communities and reducing the impact of echo
chambers. In this paper, we empirically examine the role of a newly introduced
Twitter feature, 'quote retweets' (or 'quote RTs') in political discourse,
specifically whether it has led to improved, civil, and balanced exchange.
Quote RTs allow users to quote the tweet they retweet, while adding a short
comment. Our analysis using content, network and crowd labeled data indicates
that the feature has increased political discourse and its diffusion, compared
to existing features. We discuss the implications of our findings in
understanding and reducing online polarization.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 15:22:12 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Garimella",
"Kiran",
""
],
[
"Weber",
"Ingmar",
""
],
[
"De Choudhury",
"Munmun",
""
]
] |
new_dataset
| 0.969737 |
1603.07964
|
P Balasubramanian
|
P Balasubramanian, N E Mastorakis
|
Power, Delay and Area Comparisons of Majority Voters relevant to TMR
Architectures
|
in the Book, Recent Advances in Circuits, Systems, Signal Processing
and Communications, Included in ISI/SCI Web of Science and Web of Knowledge,
Proceedings of 10th International Conference on Circuits, Systems, Signal and
Telecommunications, pp. 110-117, 2016, Barcelona, Spain
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
N-modular redundancy (NMR) is commonly used to enhance the fault tolerance of
a circuit/system, when subject to a fault-inducing environment such as in space
or military systems, where upsets due to radiation phenomena, temperature
and/or other environmental conditions are anticipated. Triple Modular
Redundancy (TMR), which is a 3-tuple version of NMR, is widely preferred for
mission-control space, military, and aerospace, and safety-critical nuclear,
power, medical, and industrial control and automation systems. The TMR scheme
involves the two-times duplication of a simplex system hardware, with a
majority voter ensuring correctness provided at least two out of three copies
of the hardware remain operational. Thus the majority voter plays a pivotal
role in ensuring the correct operation of the TMR scheme. In this paper, a
number of standard-cell based majority voter designs relevant to TMR
architectures are presented, and their power, delay and area parameters are
estimated based on physical realization using a 32/28nm CMOS process.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 17:14:55 GMT"
}
] | 2016-03-28T00:00:00 |
[
[
"Balasubramanian",
"P",
""
],
[
"Mastorakis",
"N E",
""
]
] |
new_dataset
| 0.960957 |
1309.1841
|
Nicolas Trotignon
|
Pierre Aboulker, Marko Radovanovi\'c, Nicolas Trotignon, Kristina
Vu\v{s}kovi\'c
|
Graphs that do not contain a cycle with a node that has at least two
neighbors on it
| null |
P. Aboulker, M. Radovanovic, N. Trotignon and K. Vuskovic. Graphs
that do not contain a cycle with a node that has at least two neighbors on
it. SIAM Journal on Discrete Mathematics, 26(4):1510-1531, 2012
|
10.1137/11084933X
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We recall several known results about minimally 2-connected graphs, and show
that they all follow from a decomposition theorem. Starting from an analogy
with critically 2-connected graphs, we give structural characterizations of the
classes of graphs that do not contain as a subgraph and as an induced subgraph,
a cycle with a node that has at least two neighbors on the cycle. From these
characterizations we get polynomial time recognition algorithms for these
classes, as well as polynomial time algorithms for vertex-coloring and
edge-coloring.
|
[
{
"version": "v1",
"created": "Sat, 7 Sep 2013 08:32:13 GMT"
}
] | 2016-03-27T00:00:00 |
[
[
"Aboulker",
"Pierre",
""
],
[
"Radovanović",
"Marko",
""
],
[
"Trotignon",
"Nicolas",
""
],
[
"Vušković",
"Kristina",
""
]
] |
new_dataset
| 0.999121 |
1503.06333
|
Zohaib Awan
|
Zohaib Hassan Awan, Abdellatif Zaidi, and Aydin Sezgin
|
On SDoF of Multi-Receiver Wiretap Channel With Alternating CSIT
|
To Appear in IEEE Transactions on Information Forensics and Security
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of secure transmission over a Gaussian multi-input
single-output (MISO) two receiver channel with an external eavesdropper, under
the assumption that the state of the channel which is available to each
receiver is conveyed either perfectly ($P$) or with delay ($D$) to the
transmitter. Denoting by $S_1$, $S_2$, and $S_3$ the channel state information
at the transmitter (CSIT) of user 1, user 2, and eavesdropper, respectively,
the overall CSIT can then alternate between eight possible states, i.e.,
$(S_1,S_2,S_3) \in \{P,D\}^3$. We denote by $\lambda_{S_1 S_2 S_3}$ the
fraction of time during which the state $S_1S_2S_3$ occurs. Under these
assumptions, we first consider the Gaussian MISO wiretap channel and
characterize the secure degrees of freedom (SDoF). Next, we consider the
general multi-receiver setup and characterize the SDoF region of fixed hybrid
states $PPD$, $PDP$, and $DDP$. We then focus our attention on the symmetric
case in which $\lambda_{PDD}=\lambda_{DPD}$. For this case, we establish bounds
on SDoF region. The analysis reveals that alternating CSIT allows synergistic
gains in terms of SDoF; and shows that, by opposition to encoding separately
over different states, joint encoding across the states enables strictly better
secure rates. Furthermore, we specialize our results for the two receivers
channel with an external eavesdropper to the two-user broadcast channel. We
show that, the synergistic gains in terms of SDoF by alternating CSIT is not
restricted to multi-receiver wiretap channels; and, can also be harnessed under
broadcast setting.
|
[
{
"version": "v1",
"created": "Sat, 21 Mar 2015 17:53:29 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Oct 2015 14:34:28 GMT"
},
{
"version": "v3",
"created": "Thu, 24 Mar 2016 13:34:56 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Awan",
"Zohaib Hassan",
""
],
[
"Zaidi",
"Abdellatif",
""
],
[
"Sezgin",
"Aydin",
""
]
] |
new_dataset
| 0.994209 |
1603.07475
|
Youngjin Yoon
|
Youngjin Yoon, Gyeongmin Choe, Namil Kim, Joon-Young Lee, In So Kweon
|
Fine-scale Surface Normal Estimation using a Single NIR Image
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present surface normal estimation using a single near infrared (NIR)
image. We are focusing on fine-scale surface geometry captured with an
uncalibrated light source. To tackle this ill-posed problem, we adopt a
generative adversarial network which is effective in recovering a sharp output,
which is also essential for fine-scale surface normal estimation. We
incorporate angular error and integrability constraint into the objective
function of the network to make estimated normals physically meaningful. We
train and validate our network on a recent NIR dataset, and also evaluate the
generality of our trained model by using new external datasets which are
captured with a different camera under different environment.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 08:43:14 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Yoon",
"Youngjin",
""
],
[
"Choe",
"Gyeongmin",
""
],
[
"Kim",
"Namil",
""
],
[
"Lee",
"Joon-Young",
""
],
[
"Kweon",
"In So",
""
]
] |
new_dataset
| 0.966008 |
1603.07541
|
Tao Li
|
Tao Li, Xiaodong Wang, Pingyi Fan and Taneli Riihonen
|
Position-aided Large-scale MIMO Channel Estimation for High-Speed
Railway Communication Systems
|
30 pages, 8 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider channel estimation for high-speed railway communication systems,
where both the transmitter and the receiver are equipped with large-scale
antenna arrays. It is known that the throughput of conventional training
schemes monotonically decreases with the mobility. Assuming that the moving
terminal employs a large linear antenna array, this paper proposes a
position-aided channel estimation scheme whereby only a portion of the transmit
antennas send pilot symbols and the full channel matrix can be well estimated
by using these pilots together with the antenna position information based on
the joint spatial-temporal correlation. The relationship between mobility and
throughput/DoF is established. Furthermore, the optimal selections of transmit
power and time interval partition between the training and data phases as well
as the antenna size are presented accordingly. Both analytical and simulation
results show that the system throughput with the position-aided channel
estimator does not deteriorate appreciably as the mobility increases, which is
sharply in contrast with the conventional one.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 12:05:38 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Li",
"Tao",
""
],
[
"Wang",
"Xiaodong",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Riihonen",
"Taneli",
""
]
] |
new_dataset
| 0.982937 |
1603.07625
|
Mike Wu
|
Stephen Yu, Mike Wu
|
Position and Vector Detection of Blind Spot motion with the Horn-Schunck
Optical Flow
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proposed method uses live image footage which, based on calculations of
pixel motion, decides whether or not an object is in the blind-spot. If found,
the driver is notified by a sensory light or noise built into the vehicle's
CPU. The new technology incorporates optical vectors and flow fields rather
than expensive radar-waves, creating cheaper detection systems that retain the
needed accuracy while adapting to the current processor speeds.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 15:28:26 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Yu",
"Stephen",
""
],
[
"Wu",
"Mike",
""
]
] |
new_dataset
| 0.993812 |
1603.07631
|
Martin Monperrus
|
Thomas Durieux and Youssef Hamadi and Martin Monperrus
|
BanditRepair: Speculative Exploration of Runtime Patches
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose, BanditRepair, a system that systematically explores and assesses
a set of possible runtime patches. The system is grounded on so-called bandit
algorithms, that are online machine learning algorithms, designed for
constantly balancing exploitation and exploration. BanditRepair's runtime
patches are based on modifying the execution state for repairing null
dereferences. BanditRepair constantly trades the ratio of automatically handled
failures for searching for new runtime patches and vice versa. We evaluate the
system with 16 null dereference field bugs, where BanditRepair identifies a
total of 8460 different runtime patches, which are composed of 1 up to 8
decisions (execution modifications) taken in a row. We are the first to finely
characterize the search space and the outcomes of runtime repair based on
execution modification.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 15:44:17 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Durieux",
"Thomas",
""
],
[
"Hamadi",
"Youssef",
""
],
[
"Monperrus",
"Martin",
""
]
] |
new_dataset
| 0.9558 |
1603.07653
|
Sayed Pouria Talebi
|
Sayed Pouria Talebi and Professor Danilo P. Mandic
|
A Quaternion Frequency and Phasor Estimator for Three-Phase Power
Distribution Networks
| null | null | null | null |
cs.SY stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the first time quaternions have been used for real-time frequency
estimation, where the multi-dimensional nature of quaternions allows for the
full characterization of three-phase power systems. This is achieved through
the use of quaternions to provide a unified framework for incorporating voltage
measurements from all the phases of a three-phase system and then employing the
recently introduced HR-calculus to derive a state space estimator based on the
quaternion extended Kalman filter (QEKF). The components of the state space
vector are designed such that they can be deployed for adaptive estimation of
the system phasors. Finally, the proposed algorithm is validated through
simulations using both synthetic and real-world data, which indicate that the
developed quaternion frequency estimator can outperform its complex-valued
counterparts.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2016 20:18:32 GMT"
}
] | 2016-03-25T00:00:00 |
[
[
"Talebi",
"Sayed Pouria",
""
],
[
"Mandic",
"Professor Danilo P.",
""
]
] |
new_dataset
| 0.998355 |
1512.02505
|
Michael Bekos
|
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann and Vincenzo
Roselli
|
Vertex-Coloring with Star-Defects
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Defective coloring is a variant of traditional vertex-coloring, according to
which adjacent vertices are allowed to have the same color, as long as the
monochromatic components induced by the corresponding edges have a certain
structure. Due to its important applications, as for example in the
bipartisation of graphs, this type of coloring has been extensively studied,
mainly with respect to the size, degree, and acyclicity of the monochromatic
components.
In this paper we focus on defective colorings in which the monochromatic
components are acyclic and have small diameter, namely, they form stars. For
outerplanar graphs, we give a linear-time algorithm to decide if such a
defective coloring exists with two colors and, in the positive case, to
construct one. Also, we prove that an outerpath (i.e., an outerplanar graph
whose weak-dual is a path) always admits such a two-coloring. Finally, we
present NP-completeness results for non-planar and planar graphs of bounded
degree for the cases of two and three colors.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 15:21:20 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Mar 2016 12:58:40 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Angelini",
"Patrizio",
""
],
[
"Bekos",
"Michael A.",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Roselli",
"Vincenzo",
""
]
] |
new_dataset
| 0.999691 |
1603.07007
|
Cunsheng Ding
|
Cunsheng Ding, Cuiling Fan, Zhengchun Zhou
|
The Dimension and Minimum Distance of Two Classes of Primitive BCH Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reed-Solomon codes, a type of BCH codes, are widely employed in communication
systems, storage devices and consumer electronics. This fact demonstrates the
importance of BCH codes -- a family of cyclic codes -- in practice. In theory,
BCH codes are among the best cyclic codes in terms of their error-correcting
capability. A subclass of BCH codes are the narrow-sense primitive BCH codes.
However, the dimension and minimum distance of these codes are not known in
general. The objective of this paper is to determine the dimension and minimum
distances of two classes of narrow-sense primitive BCH codes with design
distances $\delta=(q-1)q^{m-1}-1-q^{\lfloor (m-1)/2\rfloor}$ and
$\delta=(q-1)q^{m-1}-1-q^{\lfloor (m+1)/2\rfloor}$. The weight distributions of
some of these BCH codes are also reported. As will be seen, the two classes of
BCH codes are sometimes optimal and sometimes among the best linear codes
known.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 22:06:30 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Fan",
"Cuiling",
""
],
[
"Zhou",
"Zhengchun",
""
]
] |
new_dataset
| 0.999564 |
1603.07010
|
Amin Sakzad
|
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, and Amin Sakzad
|
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices
|
Submitted for possible publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LDPC lattices were the first family of lattices that equipped with iterative
decoding algorithms under which they perform very well in high dimensions. In
this paper, we introduce quasi cyclic low density parity check (QC-LDPC)
lattices as a special case of LDPC lattices with one binary QC-LDPC code as
their underlying code. These lattices are obtained from Construction A of
lattices providing us to encode them efficiently using shift registers. To
benefit from an encoder with linear complexity in dimension of the lattice, we
obtain the generator matrix of these lattices in "quasi cyclic" form. We
provide a low-complexity decoding algorithm of QC-LDPC lattices based on sum
product algorithm. To design lattice codes, QC-LDPC lattices are combined with
nested lattice shaping that uses the Voronoi region of a sublattice for code
shaping. The shaping gain and shaping loss of our lattice codes with dimensions
$40$, $50$ and $60$ using an optimal quantizer, are presented. Consequently, we
establish a family of lattice codes that perform practically close to the
sphere bound.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 22:13:27 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Khodaiemehr",
"Hassan",
""
],
[
"Sadeghi",
"Mohammad-Reza",
""
],
[
"Sakzad",
"Amin",
""
]
] |
new_dataset
| 0.975352 |
1603.07031
|
Kenza Hamidouche
|
Kenza Hamidouche and Walid Saad and M\'erouane Debbah and H. Vincent
Poor
|
Mean-Field Games for Distributed Caching in Ultra-Dense Small Cell
Networks
|
Accepted for publication at American Control Conference 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the problem of distributed caching in dense wireless small
cell networks (SCNs) is studied using mean field games (MFGs). In the
considered SCN, small base stations (SBSs) are equipped with data storage units
and cooperate to serve users' requests either from files cached in the storage
or directly from the capacity-limited backhaul. The aim of the SBSs is to
define a caching policy that reduces the load on the capacity-limited backhaul
links. This cache control problem is formulated as a stochastic differential
game (SDG). In this game, each SBS takes into consideration the storage state
of the other SBSs to decide on the fraction of content it should cache. To
solve this problem, the formulated SDG is reduced to an MFG by considering an
ultra-dense network of SBSs in which the existence and uniqueness of the
mean-field equilibrium is shown to be guaranteed. Simulation results show that
this framework allows an efficient use of the available storage space at the
SBSs while properly tracking the files' popularity. The results also show that,
compared to a baseline model in which SBSs are not aware of the instantaneous
system state, the proposed framework increases the number of served files from
the SBSs by more than 69%.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 23:46:25 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Hamidouche",
"Kenza",
""
],
[
"Saad",
"Walid",
""
],
[
"Debbah",
"Mérouane",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.997404 |
1603.07077
|
Sandor P. Fekete
|
S\'andor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann,
Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne
Schmidt, Christiane Schmidt, and Julian Troegel
|
Computing Nonsimple Polygons of Minimum Perimeter
|
24 pages, 21 figures, 1 table; full version of extended abstract that
is to appear in SEA 2016
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide exact and approximation methods for solving a geometric relaxation
of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction:
for a given set of vertices in the plane, the problem Minimum Perimeter Polygon
(MPP) asks for a (not necessarily simply connected) polygon with shortest
possible boundary length. Even though the closely related problem of finding a
minimum cycle cover is polynomially solvable by matching techniques, we prove
how the topological structure of a polygon leads to NP-hardness of the MPP. On
the positive side, we show how to achieve a constant-factor approximation.
When trying to solve MPP instances to provable optimality by means of integer
programming, an additional difficulty compared to the TSP is the fact that only
a subset of subtour constraints is valid, depending not on combinatorics, but
on geometry. We overcome this difficulty by establishing and exploiting
additional geometric properties. This allows us to reliably solve a wide range
of benchmark instances with up to 600 vertices within reasonable time on a
standard machine. We also show that using a natural geometry-based
sparsification yields results that are on average within 0.5% of the optimum.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 06:25:07 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Fekete",
"Sándor P.",
""
],
[
"Haas",
"Andreas",
""
],
[
"Hemmer",
"Michael",
""
],
[
"Hoffmann",
"Michael",
""
],
[
"Kostitsyna",
"Irina",
""
],
[
"Krupke",
"Dominik",
""
],
[
"Maurer",
"Florian",
""
],
[
"Mitchell",
"Joseph S. B.",
""
],
[
"Schmidt",
"Arne",
""
],
[
"Schmidt",
"Christiane",
""
],
[
"Troegel",
"Julian",
""
]
] |
new_dataset
| 0.996027 |
1603.07292
|
Shayak Sen
|
Aleksandar Chakarov, Aditya Nori, Sriram Rajamani, Shayak Sen, and
Deepak Vijaykeerthy
|
Debugging Machine Learning Tasks
| null | null | null | null |
cs.LG cs.AI cs.PL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unlike traditional programs (such as operating systems or word processors)
which have large amounts of code, machine learning tasks use programs with
relatively small amounts of code (written in machine learning libraries), but
voluminous amounts of data. Just like developers of traditional programs debug
errors in their code, developers of machine learning tasks debug and fix errors
in their data. However, algorithms and tools for debugging and fixing errors in
data are less common, when compared to their counterparts for detecting and
fixing errors in code. In this paper, we consider classification tasks where
errors in training data lead to misclassifications in test points, and propose
an automated method to find the root causes of such misclassifications. Our
root cause analysis is based on Pearl's theory of causation, and uses Pearl's
PS (Probability of Sufficiency) as a scoring metric. Our implementation, Psi,
encodes the computation of PS as a probabilistic program, and uses recent work
on probabilistic programs and transformations on probabilistic programs (along
with gray-box models of machine learning algorithms) to efficiently compute PS.
Psi is able to identify root causes of data errors in interesting data sets.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 18:30:37 GMT"
}
] | 2016-03-24T00:00:00 |
[
[
"Chakarov",
"Aleksandar",
""
],
[
"Nori",
"Aditya",
""
],
[
"Rajamani",
"Sriram",
""
],
[
"Sen",
"Shayak",
""
],
[
"Vijaykeerthy",
"Deepak",
""
]
] |
new_dataset
| 0.951245 |
1601.00455
|
Andrew Adamatzky
|
Ramon Alonso-Sanz and Andrew Adamatzky
|
Actin automata with memory
|
Accepted for publication in "International Journal of Bifurcation and
Chaos"
| null |
10.1142/S021812741650019X
| null |
cs.ET nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Actin is a globular protein which forms long polar filaments in eukaryotic.
The actin filaments play roles of cytoskeleton, motility units , information
processing and learning. We model actin filament as a double chain of finite
state machines, nodes, which take states `0' and `1'. The states are
abstractions of absence and presence of a sub-threshold charge on an actin
units corresponding to the nodes. All nodes update their state in parallel in
discrete time. A node updates its current state depending on states of two
closest neighbours in the node chain and two closest neighbours in the
complementary chain. Previous models of actin automata considered momentary
state transitions of nodes. We enrich the actin automata model by assuming that
states of nodes depends not only on the current states of neighbouring node but
also on their past states. Thus, we assess the effect of memory of past states
on the dynamics of acting automata. We demonstrate in computational experiments
that memory slows down propagation of perturbations, decrease entropy of
space-time patterns generated, transforms travelling localisations to
stationary oscillators, and stationary oscillations to still patterns.
|
[
{
"version": "v1",
"created": "Mon, 4 Jan 2016 11:24:53 GMT"
}
] | 2016-03-23T00:00:00 |
[
[
"Alonso-Sanz",
"Ramon",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999812 |
1603.06675
|
Swaroop Ghosh
|
Nitin Rathi, Helia Naeimi and Swaroop Ghosh
|
Side Channel Attacks on STTRAM and Low-Overhead Countermeasures
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spin Transfer Torque RAM (STTRAM) is a promising candidate for Last Level
Cache (LLC) due to high endurance, high density and low leakage. One of the
major disadvantages of STTRAM is high write latency and write current.
Additionally, the latency and current depends on the polarity of the data being
written. These features introduce major security vulnerabilities and expose the
cache memory to side channel attacks. In this paper we propose a novel side
channel attack model where the adversary can monitor the supply current of the
memory array to partially identify the sensitive cache data that is being read
or written. We propose several low cost solutions such as short retention
STTRAM, 1-bit parity, multi-bit random write and constant current write driver
to mitigate the attack. 1-bit parity reduces the number of distinct write
current states by 30% for 32-bit word and the current signature is further
obfuscated by multi-bit random writes. The constant current write makes it more
challenging for the attacker to extract the entire word using a single supply
current signature.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 04:44:49 GMT"
}
] | 2016-03-23T00:00:00 |
[
[
"Rathi",
"Nitin",
""
],
[
"Naeimi",
"Helia",
""
],
[
"Ghosh",
"Swaroop",
""
]
] |
new_dataset
| 0.950745 |
1603.06678
|
Masaki Satoh
|
Masaki Satoh
|
Stitching Stabilizer: Two-frame-stitching Video Stabilization for
Embedded Systems
|
17 pages. For a supplemental video, see
https://www.youtube.com/watch?v=LmyPXfGZRb0
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In conventional electronic video stabilization, the stabilized frame is
obtained by cropping the input frame to cancel camera shake. While a small
cropping size results in strong stabilization, it does not provide us
satisfactory results from the viewpoint of image quality, because it narrows
the angle of view. By fusing several frames, we can effectively expand the area
of input frames, and achieve strong stabilization even with a large cropping
size. Several methods for doing so have been studied. However, their
computational costs are too high for embedded systems such as smartphones.
We propose a simple, yet surprisingly effective algorithm, called the
stitching stabilizer. It stitches only two frames together with a minimal
computational cost. It can achieve real-time processes in embedded systems, for
Full HD and 30 FPS videos. To clearly show the effect, we apply it to
hyperlapse. Using several clips, we show it produces more strongly stabilized
and natural results than the existing solutions from Microsoft and Instagram.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 05:42:31 GMT"
}
] | 2016-03-23T00:00:00 |
[
[
"Satoh",
"Masaki",
""
]
] |
new_dataset
| 0.977895 |
1603.06780
|
Haishan Wu
|
Jingbo Zhou, Hongbin Pei and Haishan Wu
|
Early Warning of Human Crowds Based on Query Data from Baidu Map:
Analysis Based on Shanghai Stampede
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Without sufficient preparation and on-site management, the mass scale
unexpected huge human crowd is a serious threat to public safety. A recent
impressive tragedy is the 2014 Shanghai Stampede, where 36 people were killed
and 49 were injured in celebration of the New Year's Eve on December 31th 2014
in the Shanghai Bund. Due to the innately stochastic and complicated individual
movement, it is not easy to predict collective gatherings, which potentially
leads to crowd events. In this paper, with leveraging the big data generated on
Baidu map, we propose a novel approach to early warning such potential crowd
disasters, which has profound public benefits. An insightful observation is
that, with the prevalence and convenience of mobile map service, users usually
search on the Baidu map to plan a routine. Therefore, aggregating users' query
data on Baidu map can obtain priori and indication information for estimating
future human population in a specific area ahead of time. Our careful analysis
and deep investigation on the Baidu map data on various events also
demonstrates a strong correlation pattern between the number of map query and
the number of positioning users in an area. Based on such observation, we
propose a decision method utilizing query data on Baidu map to invoke warnings
for potential crowd events about 1-3 hours in advance. Then we also construct a
machine learning model with heterogeneous data (such as query data and mobile
positioning data) to quantitatively measure the risk of the potential crowd
disasters. We evaluate the effectiveness of our methods on the data of Baidu
map.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 13:26:58 GMT"
}
] | 2016-03-23T00:00:00 |
[
[
"Zhou",
"Jingbo",
""
],
[
"Pei",
"Hongbin",
""
],
[
"Wu",
"Haishan",
""
]
] |
new_dataset
| 0.978226 |
1411.6763
|
Peng Peng
|
Peng Peng, Lei Zou, M. Tamer \"Ozsu, Lei Chen, Dongyan Zhao
|
Processing SPARQL Queries Over Distributed RDF Graphs
|
30 pages
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose techniques for processing SPARQL queries over a large RDF graph in
a distributed environment. We adopt a "partial evaluation and assembly"
framework. Answering a SPARQL query Q is equivalent to finding subgraph matches
of the query graph Q over RDF graph G. Based on properties of subgraph matching
over a distributed graph, we introduce local partial match as partial answers
in each fragment of RDF graph G. For assembly, we propose two methods:
centralized and distributed assembly. We analyze our algorithms from both
theoretically and experimentally. Extensive experiments over both real and
benchmark RDF repositories of billions of triples confirm that our method is
superior to the state-of-the-art methods in both the system's performance and
scalability.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 08:36:58 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 07:20:19 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Feb 2016 03:00:53 GMT"
},
{
"version": "v4",
"created": "Mon, 21 Mar 2016 13:58:00 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Peng",
"Peng",
""
],
[
"Zou",
"Lei",
""
],
[
"Özsu",
"M. Tamer",
""
],
[
"Chen",
"Lei",
""
],
[
"Zhao",
"Dongyan",
""
]
] |
new_dataset
| 0.957934 |
1509.05936
|
Yoshua Bengio
|
Yoshua Bengio, Thomas Mesnard, Asja Fischer, Saizheng Zhang and Yuhuai
Wu
|
STDP as presynaptic activity times rate of change of postsynaptic
activity
| null | null | null | null |
cs.NE cs.LG q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a weight update formula that is expressed only in terms of
firing rates and their derivatives and that results in changes consistent with
those associated with spike-timing dependent plasticity (STDP) rules and
biological observations, even though the explicit timing of spikes is not
needed. The new rule changes a synaptic weight in proportion to the product of
the presynaptic firing rate and the temporal rate of change of activity on the
postsynaptic side. These quantities are interesting for studying theoretical
explanation for synaptic changes from a machine learning perspective. In
particular, if neural dynamics moved neural activity towards reducing some
objective function, then this STDP rule would correspond to stochastic gradient
descent on that objective function.
|
[
{
"version": "v1",
"created": "Sat, 19 Sep 2015 21:05:18 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Mar 2016 10:54:18 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Bengio",
"Yoshua",
""
],
[
"Mesnard",
"Thomas",
""
],
[
"Fischer",
"Asja",
""
],
[
"Zhang",
"Saizheng",
""
],
[
"Wu",
"Yuhuai",
""
]
] |
new_dataset
| 0.985064 |
1602.01205
|
Tariq Ahmad Mir
|
Tariq Ahmad Mir
|
Citations to articles citing Benford's law: a Benford analysis
|
12 pages, 2 figure, 7 tables, 37 references
| null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The occurrence of first significant digits of numbers in large data is often
governed by a logarithmically decreasing distribution called Benford's law
(BL), reported first by S. Newcomb (SN) and many decades later independently by
F. Benford (FB). Due to its counter-intuitiveness the law was ignored for
decades as a mere curious observation. However, an indication of its remarkable
resurgence is the huge swell in the number of citations received by the papers
of SN/FB. The law has come a long way, from obscurity to now being a regular
subject of books, peer reviewed papers, patents, blogs and news. Here, we use
Google Scholar (GS) to collect the data on the number of citations received by
the articles citing the original paper of SN/FB and then investigate whether
the leading digits of this citations data are distributed according to the law
they discovered. We find that the citations data of literature on BL is in
remarkable agreement with the predictions of the law.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 06:48:33 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Mar 2016 06:55:41 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Mir",
"Tariq Ahmad",
""
]
] |
new_dataset
| 0.993224 |
1602.05342
|
Ayumi Igarashi
|
Ayumi Igarashi and Edith Elkind
|
Hedonic Games with Graph-restricted Communication
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study hedonic coalition formation games in which cooperation among the
players is restricted by a graph structure: a subset of players can form a
coalition if and only if they are connected in the given graph. We investigate
the complexity of finding stable outcomes in such games, for several notions of
stability. In particular, we provide an efficient algorithm that finds an
individually stable partition for an arbitrary hedonic game on an acyclic
graph. We also introduce a new stability concept -in-neighbor stability- which
is tailored for our setting. We show that the problem of finding an in-neighbor
stable outcome admits a polynomial-time algorithm if the underlying graph is a
path, but is NP-hard for arbitrary trees even for additively separable hedonic
games; for symmetric additively separable games we obtain a PLS-hardness
result.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2016 09:18:30 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Mar 2016 10:02:45 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Igarashi",
"Ayumi",
""
],
[
"Elkind",
"Edith",
""
]
] |
new_dataset
| 0.999497 |
1603.00644
|
Ya Meng
|
Ya Meng, Liping Li, Yanjun Hu
|
A Novel Interleaving Scheme for Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It's known that the bit errors of polar codes with successive cancellation
(SC) decoding are coupled. We call the coupled information bits the correlated
bits. In this paper, concatenation schemes are studied for polar codes (as
inner codes) and LDPC codes (as outer codes). In a conventional concatenation
scheme, to achieve a better BER performance, one can divide all $N_l$ bits in a
LDPC block into $N_l$ polar blocks to completely de-correlate the possible
coupled errors. In this paper, we propose a novel interleaving scheme between a
LDPC code and a polar code which breaks the correlation of the errors among the
correlated bits. This interleaving scheme still keeps the simple SC decoding of
polar codes while achieves a comparable BER performance at a much smaller delay
compared with a $N_l$-block delay scheme.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 10:14:08 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Mar 2016 08:16:31 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Meng",
"Ya",
""
],
[
"Li",
"Liping",
""
],
[
"Hu",
"Yanjun",
""
]
] |
new_dataset
| 0.99815 |
1603.05073
|
Ognjen Arandjelovi\'c PhD
|
Warren Rieutort-Louis, Ognjen Arandjelovic
|
Descriptor transition tables for object retrieval using unconstrained
cluttered video acquired using a consumer level handheld mobile device
|
2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual recognition and vision based retrieval of objects from large databases
are tasks with a wide spectrum of potential applications. In this paper we
propose a novel recognition method from video sequences suitable for retrieval
from databases acquired in highly unconstrained conditions e.g. using a mobile
consumer-level device such as a phone. On the lowest level, we represent each
sequence as a 3D mesh of densely packed local appearance descriptors. While
image plane geometry is captured implicitly by a large overlap of neighbouring
regions from which the descriptors are extracted, 3D information is extracted
by means of a descriptor transition table, learnt from a single sequence for
each known gallery object. These allow us to connect local descriptors along
the 3rd dimension (which corresponds to viewpoint changes), thus resulting in a
set of variable length Markov chains for each video. The matching of two sets
of such chains is formulated as a statistical hypothesis test, whereby a subset
of each is chosen to maximize the likelihood that the corresponding video
sequences show the same object. The effectiveness of the proposed algorithm is
empirically evaluated on the Amsterdam Library of Object Images and a new
highly challenging video data set acquired using a mobile phone. On both data
sets our method is shown to be successful in recognition in the presence of
background clutter and large viewpoint changes.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2016 12:57:10 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Mar 2016 12:02:40 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Rieutort-Louis",
"Warren",
""
],
[
"Arandjelovic",
"Ognjen",
""
]
] |
new_dataset
| 0.999103 |
1603.06044
|
Maziar Mirzazad Barijough
|
J.J. Garcia-Luna-Aceves, Maziar Mirzazad-Barijough
|
A Light-Weight Forwarding Plane for Content-Centric Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present CCN-DART, a more efficient forwarding approach for content-centric
networking (CCN) than named data networking (NDN) that substitutes Pending
Interest Tables (PIT) with Data Answer Routing Tables (DART) and uses a novel
approach to eliminate forwarding loops. The forwarding state required at each
router using CCN-DART consists of segments of the routes between consumers and
content providers that traverse a content router, rather than the Interests
that the router forwards towards content providers. Accordingly, the size of a
DART is proportional to the number of routes used by Interests traversing a
router, rather than the number of Interests traversing a router. We show that
CCN-DART avoids forwarding loops by comparing distances to name prefixes
reported by neighbors, even when routing loops exist. Results of simulation
experiments comparing CCN-DART with NDN using the ndnSIM simulation tool show
that CCN-DART incurs 10 to 20 times less storage overhead.
|
[
{
"version": "v1",
"created": "Sat, 19 Mar 2016 04:03:01 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Garcia-Luna-Aceves",
"J. J.",
""
],
[
"Mirzazad-Barijough",
"Maziar",
""
]
] |
new_dataset
| 0.978402 |
1603.06286
|
Xu Chen
|
Xu Chen, Dongning Guo
|
A Generalized LDPC Framework for Robust and Sublinear Compressive
Sensing
|
accepted to ICASSP 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compressive sensing aims to recover a high-dimensional sparse signal from a
relatively small number of measurements. In this paper, a novel design of the
measurement matrix is proposed. The design is inspired by the construction of
generalized low-density parity-check codes, where the capacity-achieving
point-to-point codes serve as subcodes to robustly estimate the signal support.
In the case that each entry of the $n$-dimensional $k$-sparse signal lies in a
known discrete alphabet, the proposed scheme requires only $O(k \log n)$
measurements and arithmetic operations. In the case of arbitrary, possibly
continuous alphabet, an error propagation graph is proposed to characterize the
residual estimation error. With $O(k \log^2 n)$ measurements and computational
complexity, the reconstruction error can be made arbitrarily small with high
probability.
|
[
{
"version": "v1",
"created": "Sun, 20 Mar 2016 22:53:23 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Chen",
"Xu",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.981345 |
1603.06317
|
Jia Pan
|
Hao Zhang, Pinxin Long, Dandan Zhou, Zhongfeng Qian, Zheng Wang,
Weiwei Wan, Dinesh Manocha, Chonhyon Park, Tommy Hu, Chao Cao, Yibo Chen,
Marco Chow, Jia Pan
|
DoraPicker: An Autonomous Picking System for General Objects
|
10 pages, 10 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robots that autonomously manipulate objects within warehouses have the
potential to shorten the package delivery time and improve the efficiency of
the e-commerce industry. In this paper, we present a robotic system that is
capable of both picking and placing general objects in warehouse scenarios.
Given a target object, the robot autonomously detects it from a shelf or a
table and estimates its full 6D pose. With this pose information, the robot
picks the object using its gripper, and then places it into a container or at a
specified location. We describe our pick-and-place system in detail while
highlighting our design principles for the warehouse settings, including the
perception method that leverages knowledge about its workspace, three grippers
designed to handle a large variety of different objects in terms of shape,
weight and material, and grasp planning in cluttered scenarios. We also present
extensive experiments to evaluate the performance of our picking system and
demonstrate that the robot is competent to accomplish various tasks in
warehouse settings, such as picking a target item from a tight space, grasping
different objects from the shelf, and performing pick-and-place tasks on the
table.
|
[
{
"version": "v1",
"created": "Mon, 21 Mar 2016 03:32:04 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Zhang",
"Hao",
""
],
[
"Long",
"Pinxin",
""
],
[
"Zhou",
"Dandan",
""
],
[
"Qian",
"Zhongfeng",
""
],
[
"Wang",
"Zheng",
""
],
[
"Wan",
"Weiwei",
""
],
[
"Manocha",
"Dinesh",
""
],
[
"Park",
"Chonhyon",
""
],
[
"Hu",
"Tommy",
""
],
[
"Cao",
"Chao",
""
],
[
"Chen",
"Yibo",
""
],
[
"Chow",
"Marco",
""
],
[
"Pan",
"Jia",
""
]
] |
new_dataset
| 0.997185 |
1603.06351
|
Chong Qin
|
Chong Qin, Yi Gong, and Zhi Quan
|
A Diplexer-Based Receiver for Simultaneous Wireless Information and
Power Transfer
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simultaneous wireless information and power transfer (SWIPT) is an appealing
research area because both information and energy can be delivered to wireless
devices simultaneously. In this paper, we propose a diplexer-based receiver
architecture that can utilizes both the doubling frequency and baseband signals
after the mixer. The baseband signals are used for information decoding and the
doubling frequency signals are converted to direct current for energy
harvesting. We analyze the signal in the receiver and find that the power of
the energy harvested is equal to that of information decoded. Therefore, the
diplexer can be used as a power splitter with a power splitting factor of 0.5.
Specifically, we consider a multiuser multi-input single-output (MISO) system,
in which each user is equipped with the newly proposed receiver. The problem is
formulated as an optimization problem that minimizes the total transmitted
power subject to some constraints on each user's quality of service and energy
harvesting demand. We show that the problem thus formulated is a non-convex
quadratically constrained quadratic program (QCQP), which can be solved by
semi-definite relaxation.
|
[
{
"version": "v1",
"created": "Mon, 21 Mar 2016 08:24:34 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Qin",
"Chong",
""
],
[
"Gong",
"Yi",
""
],
[
"Quan",
"Zhi",
""
]
] |
new_dataset
| 0.997723 |
1603.06390
|
Andras Gabor Kupcsik
|
Andras Kupcsik and David Hsu and Wee Sun Lee
|
Learning Dynamic Robot-to-Human Object Handover from Human Feedback
|
Appears in the Proceedings of the International Symposium on Robotics
Research (ISRR) 2015
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object handover is a basic, but essential capability for robots interacting
with humans in many applications, e.g., caring for the elderly and assisting
workers in manufacturing workshops. It appears deceptively simple, as humans
perform object handover almost flawlessly. The success of humans, however,
belies the complexity of object handover as collaborative physical interaction
between two agents with limited communication. This paper presents a learning
algorithm for dynamic object handover, for example, when a robot hands over
water bottles to marathon runners passing by the water station. We formulate
the problem as contextual policy search, in which the robot learns object
handover by interacting with the human. A key challenge here is to learn the
latent reward of the handover task under noisy human feedback. Preliminary
experiments show that the robot learns to hand over a water bottle naturally
and that it adapts to the dynamics of human motion. One challenge for the
future is to combine the model-free learning algorithm with a model-based
planning approach and enable the robot to adapt over human preferences and
object characteristics, such as shape, weight, and surface texture.
|
[
{
"version": "v1",
"created": "Mon, 21 Mar 2016 11:30:04 GMT"
}
] | 2016-03-22T00:00:00 |
[
[
"Kupcsik",
"Andras",
""
],
[
"Hsu",
"David",
""
],
[
"Lee",
"Wee Sun",
""
]
] |
new_dataset
| 0.966763 |
1603.00797
|
Niall Twomey
|
Niall Twomey, Tom Diethe, Meelis Kull, Hao Song, Massimo Camplani,
Sion Hannuna, Xenofon Fafoutis, Ni Zhu, Pete Woznowski, Peter Flach, and Ian
Craddock
|
The SPHERE Challenge: Activity Recognition with Multimodal Sensor Data
|
Paper describing dataset. 11 pages; 4 figures
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper outlines the Sensor Platform for HEalthcare in Residential
Environment (SPHERE) project and details the SPHERE challenge that will take
place in conjunction with European Conference on Machine Learning and
Principles and Practice of Knowledge Discovery (ECML-PKDD) between March and
July 2016. The SPHERE challenge is an activity recognition competition where
predictions are made from video, accelerometer and environmental sensors.
Monetary prizes will be awarded to the top three entrants, with Euro 1,000
being awarded to the winner, Euro 600 being awarded to the first runner up, and
Euro 400 being awarded to the second runner up.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 17:14:43 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Mar 2016 17:00:16 GMT"
},
{
"version": "v3",
"created": "Thu, 17 Mar 2016 22:17:51 GMT"
}
] | 2016-03-21T00:00:00 |
[
[
"Twomey",
"Niall",
""
],
[
"Diethe",
"Tom",
""
],
[
"Kull",
"Meelis",
""
],
[
"Song",
"Hao",
""
],
[
"Camplani",
"Massimo",
""
],
[
"Hannuna",
"Sion",
""
],
[
"Fafoutis",
"Xenofon",
""
],
[
"Zhu",
"Ni",
""
],
[
"Woznowski",
"Pete",
""
],
[
"Flach",
"Peter",
""
],
[
"Craddock",
"Ian",
""
]
] |
new_dataset
| 0.974774 |
1603.05701
|
Xueqing Huang
|
Xueqing Huang and Nirwan Ansari
|
Content Caching and Distribution in Smart Grid Enabled Wireless Networks
|
Submitted to IEEE IoT Journal SI on Multimedia Communications
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To facilitate wireless transmission of multimedia content to mobile users, we
propose a content caching and distribution framework for smart grid enabled
OFDM networks, where each popular multimedia file is coded and distributively
stored in multiple energy harvesting enabled serving nodes (SNs), and the green
energy distributively harvested by SNs can be shared with each other through
the smart grid. The distributive caching, green energy sharing and the on-grid
energy backup have improved the reliability and performance of the wireless
multimedia downloading process. To minimize the total on-grid power consumption
of the whole network, while guaranteeing that each user can retrieve the whole
content, the user association scheme is jointly designed with consideration of
resource allocation, including subchannel assignment, power allocation and
power flow among nodes, where the user association scheme decides which SN
serves which user. First, the optimal power allocated to each subchannel and
the power flows among nodes are derived analytically. Then, the user
association problem is decoupled from the subchannel assignment problem, and
the proposed user association scheme has leveraged the multicasting nature of
the content download process. To decide which subchannel is assigned to which
node, the number of subchannels assigned to each node is first determined,
according to the green energy generating rate and the associated traffic
offload, and then the corresponding subchannels are selected from the total
assigned system spectrum. Simulation results demonstrate that bringing content,
green energy and serving node closer to the end user can notably reduce the
on-grid energy consumption.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 21:52:06 GMT"
}
] | 2016-03-21T00:00:00 |
[
[
"Huang",
"Xueqing",
""
],
[
"Ansari",
"Nirwan",
""
]
] |
new_dataset
| 0.997191 |
1603.05894
|
Hojjat Mostafanasab
|
Hojjat Mostafanasab and Ahmad Yousefian Darani
|
On cyclic DNA codes over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
|
12 pages. arXiv admin note: text overlap with arXiv:1508.02015 by
other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the present paper we study the structure of cyclic DNA codes of even
lenght over the ring $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ where
$u^3=0$. We investigate two presentations of cyclic codes of even lenght over
$\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ satisfying the reverse constraint
and reverse-complement constraint.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2016 15:34:49 GMT"
}
] | 2016-03-21T00:00:00 |
[
[
"Mostafanasab",
"Hojjat",
""
],
[
"Darani",
"Ahmad Yousefian",
""
]
] |
new_dataset
| 0.989848 |
1603.05942
|
Michele Coscia
|
Michele Coscia, Frank Neffke and Eduardo Lora
|
Report on the Poblacion Flotante of Bogota (D.C.)
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this document we describe the size of the Poblacion Flotante of Bogota
(D.C.). The Poblacion Flotante is composed by people who live outside Bogota
(D.C.), but who rely on the city for performing their job. We estimate the
Poblacion Flotante impact relying on a new data source provided by
telecommunications operators in Colombia, which enables us to estimate how many
people commute daily from every municipality of Colombia to a specific area of
Bogota (D.C.). We estimate that the size of the Poblacion Flotante could
represent a 5.4% increase of Bogota (D.C.)'s population. During weekdays, the
commuters tend to visit the city center more.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2016 18:00:16 GMT"
}
] | 2016-03-21T00:00:00 |
[
[
"Coscia",
"Michele",
""
],
[
"Neffke",
"Frank",
""
],
[
"Lora",
"Eduardo",
""
]
] |
new_dataset
| 0.999232 |
1603.05945
|
Nick Brettell
|
\'Edouard Bonnet and Nick Brettell and O-joung Kwon and D\'aniel Marx
|
Parameterized vertex deletion problems for hereditary graph classes with
a block property
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a class of graphs $\mathcal{P}$, the Bounded $\mathcal{P}$-Block Vertex
Deletion problem asks, given a graph $G$ on $n$ vertices and positive integers
$k$ and $d$, whether there is a set $S$ of at most $k$ vertices such that each
block of $G-S$ has at most $d$ vertices and is in $\mathcal{P}$. We show that
when $\mathcal{P}$ satisfies a natural hereditary property and is recognizable
in polynomial time, Bounded $\mathcal{P}$-Block Vertex Deletion can be solved
in time $2^{O(k \log d)}n^{O(1)}$. When $\mathcal{P}$ contains all split
graphs, we show that this running time is essentially optimal unless the
Exponential Time Hypothesis fails. On the other hand, if $\mathcal{P}$ consists
of only complete graphs, or only cycle graphs and $K_2$, then Bounded
$\mathcal{P}$-Block Vertex Deletion admits a $c^{k}n^{O(1)}$-time algorithm for
some constant $c$ independent of $d$. We also show that Bounded
$\mathcal{P}$-Block Vertex Deletion admits a kernel with $O(k^2 d^7)$ vertices.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2016 18:02:04 GMT"
}
] | 2016-03-21T00:00:00 |
[
[
"Bonnet",
"Édouard",
""
],
[
"Brettell",
"Nick",
""
],
[
"Kwon",
"O-joung",
""
],
[
"Marx",
"Dániel",
""
]
] |
new_dataset
| 0.959064 |
1603.05399
|
Somayeh Salimi
|
Somayeh Salimi, Matthieu Bloch, Frederic Gabry, Mikael Skoglund, Panos
Papadimitratos
|
Strong Secrecy in Pairwise Key Agreement over a Generalized Multiple
Access Channel
|
45 pages, 11 figures, Submitted to the IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the problem of pairwise key agreement without public
communication between three users connected through a generalized multiple
access channel (MAC). While two users control the channel inputs, all three
users observe noisy outputs from the channel and each pair of users wishes to
agree on a secret key hidden from the remaining user. We first develop a
"pre-generated" key-agreement scheme based on secrecy codes for the generalized
MAC, in which the channel is only used to distribute pre-generated secret keys.
We then extend this scheme to include an additional layer of rate-limited
secret-key generation by treating the observed channel outputs as induced
sources. We characterize inner and outer bounds on the strong secret-key
capacity region for both schemes. For a special case of the "pre-generated"
scheme, we obtain an exact characterization. We also illustrate with some
binary examples that exploiting the generalized nature of the generalized MAC
may lead to significantly larger key-agreement rates.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 09:24:10 GMT"
}
] | 2016-03-18T00:00:00 |
[
[
"Salimi",
"Somayeh",
""
],
[
"Bloch",
"Matthieu",
""
],
[
"Gabry",
"Frederic",
""
],
[
"Skoglund",
"Mikael",
""
],
[
"Papadimitratos",
"Panos",
""
]
] |
new_dataset
| 0.988395 |
1603.05462
|
Aanjhan Ranganathan
|
Aanjhan Ranganathan, Hildur \'Olafsd\'ottir, Srdjan Capkun
|
SPREE: Spoofing Resistant GPS Receiver
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Global Positioning System (GPS) is used ubiquitously in a wide variety of
applications ranging from navigation and tracking to modern smart grids and
communication networks. However, it has been demonstrated that modern GPS
receivers are vulnerable to signal spoofing attacks. For example, today it is
possible to change the course of a ship or force a drone to land in an hostile
area by simply spoofing GPS signals. Several countermeasures have been proposed
in the past to detect GPS spoofing attacks. These countermeasures offer
protection only against naive attackers. They are incapable of detecting strong
attackers such as those capable of seamlessly taking over a GPS receiver, which
is currently receiving legitimate satellite signals, and spoofing them to an
arbitrary location. Also, there is no hardware platform that can be used to
compare and evaluate the effectiveness of existing countermeasures in
real-world scenarios. In this work, we present SPREE, which is, to the best of
our knowledge, the first GPS receiver capable of detecting all spoofing attacks
described in literature. Our novel spoofing detection technique called
auxiliary peak tracking enables detection of even a strong attacker capable of
executing the seamless takeover attack. We implement and evaluate our receiver
against three different sets of GPS signal traces and show that SPREE
constrains even a strong attacker (capable of seamless takeover attack) from
spoofing the receiver to a location not more than 1 km away from its true
location. This is a significant improvement over modern GPS receivers that can
be spoofed to any arbitrary location. Finally, we release our implementation
and datasets to the community for further research and development.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 13:00:41 GMT"
}
] | 2016-03-18T00:00:00 |
[
[
"Ranganathan",
"Aanjhan",
""
],
[
"Ólafsdóttir",
"Hildur",
""
],
[
"Capkun",
"Srdjan",
""
]
] |
new_dataset
| 0.999345 |
1603.05599
|
E.-F. Markus Henke
|
E.-F. Markus Henke, Samuel Schlatter, Iain A. Anderson
|
A Soft Electronics-Free robot
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Biomimetic entirely soft robots with animal-like behavior and integrated
artificial nervous systems will open up totally new perspectives and
applications. However, until now all presented studies on soft robots were
limited to partly soft designs, since all designs at least needed conventional,
stiff, electronics, to sense, process signals and activate actuators. We
present the first soft robot with integrated artificial nervous system entirely
made of dielectric elastomers - and without any conventional stiff electronic
parts. Supplied with only one external DC voltage, the robot autonomously
generates all signals necessary to drive its actuators, and translates an
in-plane electromechanical oscillation into a crawling locomotion movement.
Thereby, all functional parts are made of polymer materials and carbon. Besides
the basic design of the world's first entirely soft robot we present prospects
to control general behavior of such robots.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2016 05:03:20 GMT"
}
] | 2016-03-18T00:00:00 |
[
[
"Henke",
"E. -F. Markus",
""
],
[
"Schlatter",
"Samuel",
""
],
[
"Anderson",
"Iain A.",
""
]
] |
new_dataset
| 0.999539 |
1603.05625
|
Andreas Krebs
|
Andreas Krebs, Kamal Lodaya, Paritosh Pandya, Howard Straubing
|
Two-variable Logic with a Between Predicate
| null | null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We study an extension of FO^2[<], first-order logic interpreted in finite
words, in which formulas are restricted to use only two variables. We adjoin to
this language two-variable atomic formulas that say, `the letter a appears
between positions x and y'. This is, in a sense, the simplest property that is
not expressible using only two variables.
We present several logics, both first-order and temporal, that have the same
expressive power, and find matching lower and upper bounds for the complexity
of satisfiability for each of these formulations. We also give an effective
necessary condition, in terms of the syntactic monoid of a regular language,
for a property to be expressible in this logic. We show that this condition is
also sufficient for words over a two-letter alphabet. This algebraic analysis
allows us us to prove, among other things, that our new logic has strictly less
expressive power than full first-order logic FO[<].
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 19:17:10 GMT"
}
] | 2016-03-18T00:00:00 |
[
[
"Krebs",
"Andreas",
""
],
[
"Lodaya",
"Kamal",
""
],
[
"Pandya",
"Paritosh",
""
],
[
"Straubing",
"Howard",
""
]
] |
new_dataset
| 0.986557 |
0710.2156
|
Daniel Lemire
|
Kamel Aouiche, Daniel Lemire and Robert Godin
|
Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and
Experimental Evaluation
|
Software at https://github.com/lemire/OLAPTagCloud
| null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Increasingly, business projects are ephemeral. New Business Intelligence
tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds
are a popular community-driven visualization technique. Hence, we investigate
tag-cloud views with support for OLAP operations such as roll-ups, slices,
dices, clustering, and drill-downs. As a case study, we implemented an
application where users can upload data and immediately navigate through its ad
hoc dimensions. To support social networking, views can be easily shared and
embedded in other Web sites. Algorithmically, our tag-cloud views are
approximate range top-k queries over spontaneous data cubes. We present
experimental evidence that iceberg cuboids provide adequate online
approximations. We benchmark several browser-oblivious tag-cloud layout
optimizations.
|
[
{
"version": "v1",
"created": "Thu, 11 Oct 2007 19:48:10 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jan 2008 21:23:11 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Mar 2016 21:52:12 GMT"
}
] | 2016-03-17T00:00:00 |
[
[
"Aouiche",
"Kamel",
""
],
[
"Lemire",
"Daniel",
""
],
[
"Godin",
"Robert",
""
]
] |
new_dataset
| 0.966743 |
1503.03394
|
Michael Kiermaier
|
Michael Kiermaier, Alfred Wassermann and Johannes Zwanzger
|
New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a
better-than-linear Gray image
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using integer linear programming and table-lookups we prove that there is no
binary linear $[1988, 12, 992]$ code. As a by-product, the non-existence of
binary linear codes with the parameters $[324, 10, 160]$, $[356, 10, 176]$,
$[772,11,384]$, and $[836,11,416]$ is shown.
Our work is motivated by the recent construction of the extended dualized
Kerdock code $\hat{\mathcal{K}}^*_{6}$, which is a $\mathbb{Z}_4$-linear code
having a non-linear binary Gray image with the parameters $(1988,2^{12},992)$.
By our result, the code $\hat{\mathcal{K}}^*_{6}$ can be added to the small
list of $\mathbb{Z}_4$-codes for which it is known that the Gray image is
better than any binary linear code.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 14:59:56 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Mar 2016 10:47:02 GMT"
}
] | 2016-03-17T00:00:00 |
[
[
"Kiermaier",
"Michael",
""
],
[
"Wassermann",
"Alfred",
""
],
[
"Zwanzger",
"Johannes",
""
]
] |
new_dataset
| 0.987364 |
1603.05047
|
Jakob Gruber
|
Jakob Gruber, Jesper Larsson Tr\"aff, Martin Wimmer
|
Benchmarking Concurrent Priority Queues: Performance of k-LSM and
Related Data Structures
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A number of concurrent, relaxed priority queues have recently been proposed
and implemented. Results are commonly reported for a throughput benchmark that
uses a uniform distribution of keys drawn from a large integer range, and
mostly for single systems. We have conducted more extensive benchmarking of
three recent, relaxed priority queues on four different types of systems with
different key ranges and distributions. While we can show superior throughput
and scalability for our own k-LSM priority queue for the uniform key
distribution, the picture changes drastically for other distributions, both
with respect to achieved throughput and relative merit of the priority queues.
The throughput benchmark alone is thus not sufficient to characterize the
performance of concurrent priority queues. Our benchmark code and k-LSM
priority queue are publicly available to foster future comparison.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2016 11:46:06 GMT"
}
] | 2016-03-17T00:00:00 |
[
[
"Gruber",
"Jakob",
""
],
[
"Träff",
"Jesper Larsson",
""
],
[
"Wimmer",
"Martin",
""
]
] |
new_dataset
| 0.955791 |
1603.05063
|
Buket \"Ozkaya
|
Jean-Claude Belfiore, Cem G\"uneri and Buket \"Ozkaya
|
Quasi-cyclic subcodes of cyclic codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We completely characterize possible indices of quasi-cyclic subcodes in a
cyclic code for a very broad class of cyclic codes. We present enumeration
results for quasi-cyclic subcodes of a fixed index and show that the problem of
enumeration is equivalent to enumeration of certain vector subspaces in finite
fields. In particular, we present enumeration results for quasi-cyclic subcodes
of the simplex code and duals of certain BCH codes. Our results are based on
the trace representation of cyclic codes.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2016 12:33:01 GMT"
}
] | 2016-03-17T00:00:00 |
[
[
"Belfiore",
"Jean-Claude",
""
],
[
"Güneri",
"Cem",
""
],
[
"Özkaya",
"Buket",
""
]
] |
new_dataset
| 0.99831 |
1408.5781
|
Nathanael Perraudin N. P.
|
Nathana\"el Perraudin, Johan Paratte, David Shuman, Lionel Martin,
Vassilis Kalofolias, Pierre Vandergheynst, David K. Hammond
|
GSPBOX: A toolbox for signal processing on graphs
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document introduces the Graph Signal Processing Toolbox (GSPBox) a
framework that can be used to tackle graph related problems with a signal
processing approach. It explains the structure and the organization of this
software. It also contains a general description of the important modules.
|
[
{
"version": "v1",
"created": "Mon, 25 Aug 2014 14:54:50 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Mar 2016 09:55:55 GMT"
}
] | 2016-03-16T00:00:00 |
[
[
"Perraudin",
"Nathanaël",
""
],
[
"Paratte",
"Johan",
""
],
[
"Shuman",
"David",
""
],
[
"Martin",
"Lionel",
""
],
[
"Kalofolias",
"Vassilis",
""
],
[
"Vandergheynst",
"Pierre",
""
],
[
"Hammond",
"David K.",
""
]
] |
new_dataset
| 0.991967 |
1510.08485
|
Wenhao Wang
|
Wenhao Wang, Zhi Sun, Kui Ren, Bocheng Zhu, Sixu Piao
|
Wireless Physical-Layer Identification: Modeling and Validation
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wireless physical-layer identification (WPLI) techniques utilize the
unique features of the physical waveforms of wireless signals to identify and
classify authorized devices. As the inherent physical layer features are
difficult to forge, WPLI is deemed as a promising technique for wireless
security solutions. However, as of today it still remains unclear whether
existing WPLI techniques can be applied under real-world requirements and
constraints. In this paper, through both theoretical modeling and experiment
validation, the reliability and differentiability of WPLI techniques are
rigorously evaluated, especially under the constraints of state-of-art wireless
devices, real operation environments, as well as wireless protocols and
regulations. Specifically, a theoretical model is first established to
systematically describe the complete procedure of WPLI. More importantly, the
proposed model is then implemented to thoroughly characterize various WPLI
techniques that utilize the spectrum features coming from the non-linear
RF-front-end, under the influences from different transmitters, receivers, and
wireless channels. Subsequently, the limitations of existing WPLI techniques
are revealed and evaluated in details using both the developed theoretical
model and in-lab experiments. The real-world requirements and constraints are
characterized along each step in WPLI, including i) the signal processing at
the transmitter (device to be identified), ii) the various physical layer
features that originate from circuits, antenna, and environments, iii) the
signal propagation in various wireless channels, iv) the signal reception and
processing at the receiver (the identifier), and v) the fingerprint extraction
and classification at the receiver.
|
[
{
"version": "v1",
"created": "Wed, 28 Oct 2015 20:59:48 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Mar 2016 21:37:04 GMT"
}
] | 2016-03-16T00:00:00 |
[
[
"Wang",
"Wenhao",
""
],
[
"Sun",
"Zhi",
""
],
[
"Ren",
"Kui",
""
],
[
"Zhu",
"Bocheng",
""
],
[
"Piao",
"Sixu",
""
]
] |
new_dataset
| 0.997056 |
1512.07780
|
Ruben Verborgh
|
Ruben Verborgh, D\"orthe Arndt, Sofie Van Hoecke, Jos De Roo, Giovanni
Mels, Thomas Steiner, Joaquim Gabarro
|
The Pragmatic Proof: Hypermedia API Composition and Execution
|
Under consideration in Theory and Practice of Logic Programming
(TPLP)
| null |
10.1017/S1471068416000016
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine clients are increasingly making use of the Web to perform tasks.
While Web services traditionally mimic remote procedure calling interfaces, a
new generation of so-called hypermedia APIs works through hyperlinks and forms,
in a way similar to how people browse the Web. This means that existing
composition techniques, which determine a procedural plan upfront, are not
sufficient to consume hypermedia APIs, which need to be navigated at runtime.
Clients instead need a more dynamic plan that allows them to follow hyperlinks
and use forms with a preset goal. Therefore, in this article, we show how
compositions of hypermedia APIs can be created by generic Semantic Web
reasoners. This is achieved through the generation of a proof based on semantic
descriptions of the APIs' functionality. To pragmatically verify the
applicability of compositions, we introduce the notion of pre-execution and
post-execution proofs. The runtime interaction between a client and a server is
guided by proofs but driven by hypermedia, allowing the client to react to the
application's actual state indicated by the server's response. We describe how
to generate compositions from descriptions, discuss a computer-assisted process
to generate descriptions, and verify reasoner performance on various
composition tasks using a benchmark suite. The experimental results lead to the
conclusion that proof-based consumption of hypermedia APIs is a feasible
strategy at Web scale.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 10:30:25 GMT"
}
] | 2016-03-16T00:00:00 |
[
[
"Verborgh",
"Ruben",
""
],
[
"Arndt",
"Dörthe",
""
],
[
"Van Hoecke",
"Sofie",
""
],
[
"De Roo",
"Jos",
""
],
[
"Mels",
"Giovanni",
""
],
[
"Steiner",
"Thomas",
""
],
[
"Gabarro",
"Joaquim",
""
]
] |
new_dataset
| 0.996309 |
1603.01684
|
Chenxing Xia
|
Hanling Zhang and Chenxing Xia
|
Saliency Detection combining Multi-layer Integration algorithm with
background prior and energy function
|
25 pages, 8 figures. arXiv admin note: text overlap with
arXiv:1505.07192 by other authors
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an improved mechanism for saliency detection.
Firstly,based on a neoteric background prior selecting four corners of an image
as background,we use color and spatial contrast with each superpixel to obtain
a salinecy map(CBP). Inspired by reverse-measurement methods to improve the
accuracy of measurement in Engineering,we employ the Objectness labels as
foreground prior based on part of information of CBP to construct a
map(OFP).Further,an original energy function is applied to optimize both of
them respectively and a single-layer saliency map(SLP)is formed by merging the
above twos.Finally,to deal with the scale problem,we obtain our multi-layer
map(MLP) by presenting an integration algorithm to take advantage of multiple
saliency maps. Quantitative and qualitative experiments on three datasets
demonstrate that our method performs favorably against the state-of-the-art
algorithm.
|
[
{
"version": "v1",
"created": "Sat, 5 Mar 2016 06:12:44 GMT"
}
] | 2016-03-16T00:00:00 |
[
[
"Zhang",
"Hanling",
""
],
[
"Xia",
"Chenxing",
""
]
] |
new_dataset
| 0.95397 |
1509.08037
|
Takahiro Kawabe
|
Takahiro Kawabe, Taiki Fukiage, Masataka Sawayama, Shin'ya Nishida
|
Deformation Lamps: A Projection Technique to Make a Static Object
Dynamic
|
21 pages, 8 figures
|
ACM Transactions on Applied Perception 13, 2, Article 10, 2016
|
10.1145/2874358
| null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Light projection is a powerful technique to edit appearances of objects in
the real world. Based on pixel-wise modification of light transport, previous
techniques have successfully modified static surface properties such as surface
color, dynamic range, gloss and shading. Here, we propose an alternative light
projection technique that adds a variety of illusory, yet realistic distortions
to a wide range of static 2D and 3D projection targets. The key idea of our
technique, named Deformation Lamps, is to project only dynamic luminance
information, which effectively activates the motion (and shape) processing in
the visual system, while preserving the color and texture of the original
object. Although the projected dynamic luminance information is spatially
inconsistent with the color and texture of the target object, the observer's
brain automatically com- bines these sensory signals in such a way as to
correct the inconsistency across visual attributes. We conducted a
psychophysical experiment to investigate the characteristics of the
inconsistency correction, and found that the correction was dependent
critically on the retinal magnitude of inconsistency. Another experiment showed
that perceived magnitude of image deformation by our techniques was
underestimated. The results ruled out the possibility that the effect by our
technique stemmed simply from the physical change of object appearance by light
projection. Finally, we discuss how our techniques can make the observers
perceive a vivid and natural movement, deformation, or oscillation of a variety
of static objects, including drawn pictures, printed photographs, sculptures
with 3D shading, objects with natural textures including human bodies.
|
[
{
"version": "v1",
"created": "Sun, 27 Sep 2015 00:07:07 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Kawabe",
"Takahiro",
""
],
[
"Fukiage",
"Taiki",
""
],
[
"Sawayama",
"Masataka",
""
],
[
"Nishida",
"Shin'ya",
""
]
] |
new_dataset
| 0.96193 |
1512.07305
|
Sri Raj Paul
|
Sri Raj Paul, Karthik Murthy, Kuldeep S. Meel, John Mellor-Crummey
|
Distributed Phasers
|
2 page extended abstract presented at The International Conference on
Parallel Architectures and Compilation Techniques (PACT) 2015
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A phaser is an expressive synchronization construct that unifies collective
and point-to-point coordination with dynamic task parallelism. Each task can
participate in a phaser as a signaler, a waiter, or both. The participants in a
phaser may change over time as dynamic tasks are added and deleted. In this
poster, we present a highly concurrent and scalable design of phasers for a
distributed memory environment that is suitable for use with asynchronous
partitioned global address space programming models. Our design for a
distributed phaser employs a pair of skip lists augmented with the ability to
collect and propagate synchronization signals. To enable a high degree of
concurrency, addition and deletion of participant tasks are performed in two
phases: a "fast single-link-modify" step followed by multiple hand-overhand
"lazy multi-link-modify" steps. We show that the cost of synchronization and
structural operations on a distributed phaser scales logarithmically, even in
the presence of concurrent structural modifications. To verify the correctness
of our design for distributed phasers, we employ the SPIN model checker. To
address this issue of state space explosion, we describe how we decompose the
state space to separately verify correct handling for different kinds of
messages, which enables complete model checking of our phaser design.
|
[
{
"version": "v1",
"created": "Tue, 22 Dec 2015 23:55:38 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Mar 2016 22:39:14 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Paul",
"Sri Raj",
""
],
[
"Murthy",
"Karthik",
""
],
[
"Meel",
"Kuldeep S.",
""
],
[
"Mellor-Crummey",
"John",
""
]
] |
new_dataset
| 0.999576 |
1602.03648
|
Erik G. Larsson
|
Erik G. Larsson and H. Vincent Poor
|
Joint Beamforming and Broadcasting in Massive MIMO
|
with minor correction
|
IEEE Trans. Wireless Communications, 2016
|
10.1109/TWC.2016.2515598
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The downlink of a massive MIMO system is considered for the case in which the
base station must concurrently serve two categories of terminals: one group to
which imperfect instantaneous channel state information (CSI) is available, and
one group to which no CSI is available. Motivating applications include
broadcasting of public channels and control information in wireless networks.
A new technique is developed and analyzed: joint beamforming and broadcasting
(JBB), by which the base station beamforms to the group of terminals to which
CSI is available, and broadcasts to the other group of terminals, to which no
CSI is available. The broadcast information does not interfere with the
beamforming as it is placed in the nullspace of the channel matrix collectively
seen by the terminals targeted by the beamforming. JBB is compared to
orthogonal access (OA), by which the base station partitions the time-frequency
resources into two disjunct parts, one for each group of terminals.
It is shown that JBB can substantially outperform OA in terms of required
total radiated power for given rate targets.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 09:27:47 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Mar 2016 16:19:00 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Larsson",
"Erik G.",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.999039 |
1602.04211
|
Andr\'e Mantas
|
Andr\'e Mantas and Fernando M. V. Ramos
|
Consistent and fault-tolerant SDN with unmodified switches
|
2 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a reliable SDN environment, different controllers coordinate different
switches and backup controllers can be set in place to tolerate faults. This
approach increases the challenge to maintain a consistent network view. If this
global view is not consistent with the actual network state, applications will
operate on a stale state and potentially lead to incorrect behavior.
Faced with this problem, we propose a fault-tolerant SDN controller that is
able to maintain a consistent network view by using transactional semantics on
both control and data plane state. Different from previous proposals, our
solution does not require changes to OpenFlow or to switches, increasing the
chances of quicker adoption.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 10:56:56 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Mar 2016 17:14:50 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Mantas",
"André",
""
],
[
"Ramos",
"Fernando M. V.",
""
]
] |
new_dataset
| 0.998815 |
1602.06924
|
Regivaldo Costa
|
Regivaldo Costa and Fernando M. V. Ramos
|
An SDN-based approach to enhance BGP security
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
BGP is vulnerable to a series of attacks. Many solutions have been proposed
in the past two decades, but the most effective remain largely undeployed. This
is due to three fundamental reasons: the solutions are too computationally
expensive for current routers, they require changes to BGP, and/or they do not
give the right incentives to promote deployment.
In this abstract we propose a Software-Defined Networking (SDN) architecture
to secure BGP routing. Our solution, BGPSecX, targets an IXP and it includes
techniques to allow different IXPs to collaborate. With SDN we remove the
computational burden from routers and do not make changes to BGP. Targeting
IXPs and promoting inter-IXP collaboration enables the creation of incentives
to foster adoption of BGP security services.
|
[
{
"version": "v1",
"created": "Sun, 7 Feb 2016 20:34:21 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Mar 2016 19:57:18 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Costa",
"Regivaldo",
""
],
[
"Ramos",
"Fernando M. V.",
""
]
] |
new_dataset
| 0.965204 |
1603.02504
|
Saeed Akhoondian Amiri
|
Saeed Akhoondian Amiri, Ken-Ichi Kawarabayashi, Stephan Kreutzer, Paul
Wollan
|
The Erdos-Posa Property for Directed Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A classical result by Erdos and Posa states that there is a function $f:
{\mathbb N} \rightarrow {\mathbb N}$ such that for every $k$, every graph $G$
contains $k$ pairwise vertex disjoint cycles or a set $T$ of at most $f(k)$
vertices such that $G-T$ is acyclic. The generalisation of this result to
directed graphs is known as Younger's conjecture and was proved by Reed,
Robertson, Seymour and Thomas in 1996. This so-called Erdos-Posa-property can
naturally be generalised to arbitrary graphs and digraphs. Robertson and
Seymour proved that a graph $H$ has the Erdos-Posa-property if, and only if,
$H$ is planar. In this paper we study the corresponding problem for digraphs.
We obtain a complete characterisation of the class of strongly connected
digraphs which have the Erdos-Posa-property (both for topological and butterfly
minors). We also generalise this result to classes of digraphs which are not
strongly connected. In particular, we study the class of vertex-cyclic digraphs
(digraphs without trivial strong components). For this natural class of
digraphs we obtain a nearly complete characterisation of the digraphs within
this class with the Erdos-Posa-property. In particular we give positive and
algorithmic examples of digraphs with the Erdos-Posa-property by using directed
tree decompositions in a novel way.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2016 12:48:38 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 13:23:10 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Mar 2016 09:04:42 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Amiri",
"Saeed Akhoondian",
""
],
[
"Kawarabayashi",
"Ken-Ichi",
""
],
[
"Kreutzer",
"Stephan",
""
],
[
"Wollan",
"Paul",
""
]
] |
new_dataset
| 0.984482 |
1603.03185
|
Ouais Alsharif
|
Ian McGraw, Rohit Prabhavalkar, Raziel Alvarez, Montse Gonzalez
Arenas, Kanishka Rao, David Rybach, Ouais Alsharif, Hasim Sak, Alexander
Gruenstein, Francoise Beaufays, Carolina Parada
|
Personalized Speech recognition on mobile devices
| null | null | null | null |
cs.CL cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a large vocabulary speech recognition system that is accurate,
has low latency, and yet has a small enough memory and computational footprint
to run faster than real-time on a Nexus 5 Android smartphone. We employ a
quantized Long Short-Term Memory (LSTM) acoustic model trained with
connectionist temporal classification (CTC) to directly predict phoneme
targets, and further reduce its memory footprint using an SVD-based compression
scheme. Additionally, we minimize our memory footprint by using a single
language model for both dictation and voice command domains, constructed using
Bayesian interpolation. Finally, in order to properly handle device-specific
information, such as proper names and other context-dependent information, we
inject vocabulary items into the decoder graph and bias the language model
on-the-fly. Our system achieves 13.5% word error rate on an open-ended
dictation task, running with a median speed that is seven times faster than
real-time.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 08:51:51 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 22:25:39 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"McGraw",
"Ian",
""
],
[
"Prabhavalkar",
"Rohit",
""
],
[
"Alvarez",
"Raziel",
""
],
[
"Arenas",
"Montse Gonzalez",
""
],
[
"Rao",
"Kanishka",
""
],
[
"Rybach",
"David",
""
],
[
"Alsharif",
"Ouais",
""
],
[
"Sak",
"Hasim",
""
],
[
"Gruenstein",
"Alexander",
""
],
[
"Beaufays",
"Francoise",
""
],
[
"Parada",
"Carolina",
""
]
] |
new_dataset
| 0.950866 |
1603.03856
|
Mo'taz Al-Hami
|
Kristiyan Georgiev, Motaz Al-Hami, Rolf Lakaemper
|
Real-time 3D scene description using Spheres, Cones and Cylinders
|
8 Pages, 16th International Conference on Advanced Robotics (ICAR
2013). Montevideo, Uruguay, November 2013
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper describes a novel real-time algorithm for finding 3D geometric
primitives (cylinders, cones and spheres) from 3D range data. In its core, it
performs a fast model fitting with a model update in constant time (O(1)) for
each new data point added to the model. We use a three stage approach.The first
step inspects 1.5D sub spaces, to find ellipses. The next stage uses these
ellipses as input by examining their neighborhood structure to form sets of
candidates for the 3D geometric primitives. Finally, candidate ellipses are
fitted to the geometric primitives. The complexity for point processing is
O(n); additional time of lower order is needed for working on significantly
smaller amount of mid-level objects. This allows the approach to process 30
frames per second on Kinect depth data, which suggests this approach as a
pre-processing step for 3D real-time higher level tasks in robotics, like
tracking or feature based mapping.
|
[
{
"version": "v1",
"created": "Sat, 12 Mar 2016 04:03:46 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Georgiev",
"Kristiyan",
""
],
[
"Al-Hami",
"Motaz",
""
],
[
"Lakaemper",
"Rolf",
""
]
] |
new_dataset
| 0.958028 |
1603.03921
|
Huseyin Birkan Yilmaz
|
Bon-Hong Koo, Changmin Lee, H. Birkan Yilmaz, Nariman Farsad, Andrew
Eckford, Chan-Byoung Chae
|
Molecular MIMO: From Theory to Prototype
| null |
IEEE Journal on Selected Areas in Communications, vol. 34, no. 3,
pp. 600-614, March 2016
|
10.1109/JSAC.2016.2525538
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In diffusion-based molecular communication, information transport is governed
by diffusion through a fluid medium. The achievable data rates for these
channels are very low compared to the radio-based communication system, since
diffusion can be a slow process. To improve the data rate, a novel
multiple-input multiple-output (MIMO) design for molecular communication is
proposed that utilizes multiple molecular emitters at the transmitter and
multiple molecular detectors at the receiver (in RF communication these all
correspond to antennas). Using particle-based simulators, the channel's impulse
response is obtained and mathematically modeled. These models are then used to
determine inter-link interference (ILI) and inter-symbol interference (ISI). It
is assumed that when the receiver has incomplete information regarding the
system and the channel state, low complexity symbol detection methods are
preferred since the receiver is small and simple. Thus four detection
algorithms are proposed---adaptive thresholding, practical zero forcing with
channel models excluding/including the ILI and ISI, and Genie-aided zero
forcing. The proposed algorithms are evaluated extensively using numerical and
analytical evaluations.
|
[
{
"version": "v1",
"created": "Sat, 12 Mar 2016 14:36:30 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Koo",
"Bon-Hong",
""
],
[
"Lee",
"Changmin",
""
],
[
"Yilmaz",
"H. Birkan",
""
],
[
"Farsad",
"Nariman",
""
],
[
"Eckford",
"Andrew",
""
],
[
"Chae",
"Chan-Byoung",
""
]
] |
new_dataset
| 0.999441 |
1603.04000
|
Shumeet Baluja
|
Shumeet Baluja
|
Learning Typographic Style
| null | null | null | null |
cs.CV cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Typography is a ubiquitous art form that affects our understanding,
perception, and trust in what we read. Thousands of different font-faces have
been created with enormous variations in the characters. In this paper, we
learn the style of a font by analyzing a small subset of only four letters.
From these four letters, we learn two tasks. The first is a discrimination
task: given the four letters and a new candidate letter, does the new letter
belong to the same font? Second, given the four basis letters, can we generate
all of the other letters with the same characteristics as those in the basis
set? We use deep neural networks to address both tasks, quantitatively and
qualitatively measure the results in a variety of novel manners, and present a
thorough investigation of the weaknesses and strengths of the approach.
|
[
{
"version": "v1",
"created": "Sun, 13 Mar 2016 05:44:57 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Baluja",
"Shumeet",
""
]
] |
new_dataset
| 0.991611 |
1603.04012
|
Jacopo Staiano
|
Marco De Nadai, Jacopo Staiano, Roberto Larcher, Nicu Sebe, Daniele
Quercia, Bruno Lepri
|
The Death and Life of Great Italian Cities: A Mobile Phone Data
Perspective
|
In Proceedings of the 26th International ACM Conference on World Wide
Web (WWW), 2016
| null |
10.1145/2872427.2883084
| null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Death and Life of Great American Cities was written in 1961 and is now
one of the most influential book in city planning. In it, Jane Jacobs proposed
four conditions that promote life in a city. However, these conditions have not
been empirically tested until recently. This is mainly because it is hard to
collect data about "city life". The city of Seoul recently collected pedestrian
activity through surveys at an unprecedented scale, with an effort spanning
more than a decade, allowing researchers to conduct the first study
successfully testing Jacobs's conditions. In this paper, we identify a valuable
alternative to the lengthy and costly collection of activity survey data:
mobile phone data. We extract human activity from such data, collect land use
and socio-demographic information from the Italian Census and Open Street Map,
and test the four conditions in six Italian cities. Although these cities are
very different from the places for which Jacobs's conditions were spelled out
(i.e., great American cities) and from the places in which they were recently
tested (i.e., the Asian city of Seoul), we find those conditions to be indeed
associated with urban life in Italy as well. Our methodology promises to have a
great impact on urban studies, not least because, if replicated, it will make
it possible to test Jacobs's theories at scale.
|
[
{
"version": "v1",
"created": "Sun, 13 Mar 2016 09:32:00 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"De Nadai",
"Marco",
""
],
[
"Staiano",
"Jacopo",
""
],
[
"Larcher",
"Roberto",
""
],
[
"Sebe",
"Nicu",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Lepri",
"Bruno",
""
]
] |
new_dataset
| 0.999027 |
1603.04031
|
Dmitry Namiot
|
Dmitry Namiot, Manfred Sneps-Sneppe
|
On Physical Web Browser
|
for FRUCT conference. arXiv admin note: text overlap with
arXiv:1506.02263
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the Physical Web Browser project for web
applications depending on the environment. At this moment, many of users all
over the world visit websites using their mobile devices only. Any mobile
device (e.g., smartphone) has sensors to capture the environmental information.
This information (context) could be analyzed and used within the web
applications. There are, at least, two models for using this information.
Firstly, we can use context information for data gathering requests in a web
application. In this case, the output depends on the context. It is the
classical model for context-aware data retrieval. In the second model, we can
use context-aware data for improving user experience (for changing and tuning
user interfaces). In other words, we present a way for the adaptation of web
applications depending on the environment.
|
[
{
"version": "v1",
"created": "Sun, 13 Mar 2016 14:29:53 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
]
] |
new_dataset
| 0.995786 |
1603.04055
|
Sukhamoy Pattanayak
|
Sukhamoy Pattanayak, Abhay Kumar Singh
|
Construction of cyclic DNA codes over the Ring $\Z_4[u]/\langle u^2-1
\rangle $ Based on the deletion distance
|
15 pages, 3 tables. arXiv admin note: substantial text overlap with
arXiv:1508.02015, arXiv:1511.03937
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we develop the theory for constructing DNA cyclic codes of odd
length over $R=\Z_4[u]/\langle u^2-1 \rangle$ based on the deletion distance.
Firstly, we relate DNA pairs with a special 16 elements of ring $R$. Cyclic
codes of odd length over $R$ satisfy the reverse constraint and the
reverse-complement constraint are discussed in this paper. We also study the
$GC$-content of these codes and their deletion distance. The paper concludes
with some examples of cyclic DNA codes with $GC$-content and their respective
deletion distance.
|
[
{
"version": "v1",
"created": "Sun, 13 Mar 2016 18:00:34 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Pattanayak",
"Sukhamoy",
""
],
[
"Singh",
"Abhay Kumar",
""
]
] |
new_dataset
| 0.997802 |
1603.04234
|
Arnaud Labourel
|
Julian Anaya (DII), J\'er\'emie Chalopin (LIF), Jurek Czyzowicz (DII),
Arnaud Labourel (LBI2M), Andrzej Pelc (DII), Yann Vax\`es (LIF)
|
Convergecast and Broadcast by Power-Aware Mobile Agents
| null | null |
10.1007/s00453-014-9939-8
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set of identical, mobile agents is deployed in a weighted network. Each
agent has a battery -- a power source allowing it to move along network edges.
An agent uses its battery proportionally to the distance traveled. We consider
two tasks : convergecast, in which at the beginning, each agent has some
initial piece of information, and information of all agents has to be collected
by some agent; and broadcast in which information of one specified agent has to
be made available to all other agents. In both tasks, the agents exchange the
currently possessed information when they meet. The objective of this paper is
to investigate what is the minimal value of power, initially available to all
agents, so that convergecast or broadcast can be achieved. We study this
question in the centralized and the distributed settings. In the centralized
setting, there is a central monitor that schedules the moves of all agents. In
the distributed setting every agent has to perform an algorithm being unaware
of the network. In the centralized setting, we give a linear-time algorithm to
compute the optimal battery power and the strategy using it, both for
convergecast and for broadcast, when agents are on the line. We also show that
finding the optimal battery power for convergecast or for broadcast is NP-hard
for the class of trees. On the other hand, we give a polynomial algorithm that
finds a 2-approximation for convergecast and a 4-approximation for broadcast,
for arbitrary graphs. In the distributed setting, we give a 2-competitive
algorithm for convergecast in trees and a 4-competitive algorithm for broadcast
in trees. The competitive ratio of 2 is proved to be the best for the problem
of convergecast, even if we only consider line networks. Indeed, we show that
there is no (2 -- $\epsilon$)-competitive algorithm for convergecast or for
broadcast in the class of lines, for any $\epsilon$ \textgreater{} 0.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 12:23:10 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Anaya",
"Julian",
"",
"DII"
],
[
"Chalopin",
"Jérémie",
"",
"LIF"
],
[
"Czyzowicz",
"Jurek",
"",
"DII"
],
[
"Labourel",
"Arnaud",
"",
"LBI2M"
],
[
"Pelc",
"Andrzej",
"",
"DII"
],
[
"Vaxès",
"Yann",
"",
"LIF"
]
] |
new_dataset
| 0.989443 |
1603.04387
|
Hyeontaek Lim
|
Hyeontaek Lim, Vyas Sekar, Yoshihisa Abe, David G. Andersen
|
NetMemex: Providing Full-Fidelity Traffic Archival
|
A reformatted version of the ACM SIGCOMM 2013 submission
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NetMemex explores efficient network traffic archival without any loss of
information. Unlike NetFlow-like aggregation, NetMemex allows retrieving the
entire packet data including full payload, which makes it useful in forensic
analysis, networked and distributed system research, and network
administration. Different from packet trace dumps, NetMemex performs
sophisticated data compression for small storage space use and optimizes the
data layout for fast query processing. NetMemex takes advantage of high-speed
random access of flash drives and inexpensive storage space of hard disk
drives. These efforts lead to a cost-effective yet high-performance full
traffic archival system. We demonstrate that NetMemex can record full-fidelity
traffic at near-Gbps rates using a single commodity machine, handling common
queries at up to 90.1 K queries/second, at a low storage cost comparable to
conventional hard disk-only traffic archival solutions.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 18:49:53 GMT"
}
] | 2016-03-15T00:00:00 |
[
[
"Lim",
"Hyeontaek",
""
],
[
"Sekar",
"Vyas",
""
],
[
"Abe",
"Yoshihisa",
""
],
[
"Andersen",
"David G.",
""
]
] |
new_dataset
| 0.994616 |
1503.06854
|
Emil Bj\"ornson
|
Emil Bj\"ornson, Erik G. Larsson, Thomas L. Marzetta
|
Massive MIMO: Ten Myths and One Critical Question
|
To appear in IEEE Communications Magazine, 10 pages, 6 figures
|
IEEE Communications Magazine, vol. 54, no. 2, pp. 114-123,
February 2016
|
10.1109/MCOM.2016.7402270
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless communications is one of the most successful technologies in modern
years, given that an exponential growth rate in wireless traffic has been
sustained for over a century (known as Cooper's law). This trend will certainly
continue driven by new innovative applications; for example, augmented reality
and internet-of-things.
Massive MIMO (multiple-input multiple-output) has been identified as a key
technology to handle orders of magnitude more data traffic. Despite the
attention it is receiving from the communication community, we have personally
witnessed that Massive MIMO is subject to several widespread misunderstandings,
as epitomized by following (fictional) abstract:
"The Massive MIMO technology uses a nearly infinite number of high-quality
antennas at the base stations. By having at least an order of magnitude more
antennas than active terminals, one can exploit asymptotic behaviors that some
special kinds of wireless channels have. This technology looks great at first
sight, but unfortunately the signal processing complexity is off the charts and
the antenna arrays would be so huge that it can only be implemented in
millimeter wave bands."
The statements above are, in fact, completely false. In this overview
article, we identify ten myths and explain why they are not true. We also ask a
question that is critical for the practical adoption of the technology and
which will require intense future research activities to answer properly. We
provide references to key technical papers that support our claims, while a
further list of related overview and technical papers can be found at the
Massive MIMO Info Point: http://massivemimo.eu
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 21:57:46 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Aug 2015 20:11:12 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Björnson",
"Emil",
""
],
[
"Larsson",
"Erik G.",
""
],
[
"Marzetta",
"Thomas L.",
""
]
] |
new_dataset
| 0.999575 |
1507.04094
|
Changsheng You
|
Changsheng You, Kaibin Huang and Hyukjin Chae
|
Energy Efficient Mobile Cloud Computing Powered by Wireless Energy
Transfer (extended version)
|
double column
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Achieving long battery lives or even self sustainability has been a long
standing challenge for designing mobile devices. This paper presents a novel
solution that seamlessly integrates two technologies, mobile cloud computing
and microwave power transfer (MPT), to enable computation in passive
low-complexity devices such as sensors and wearable computing devices.
Specifically, considering a single-user system, a base station (BS) either
transfers power to or offloads computation from a mobile to the cloud; the
mobile uses harvested energy to compute given data either locally or by
offloading. A framework for energy efficient computing is proposed that
comprises a set of policies for controlling CPU cycles for the mode of local
computing, time division between MPT and offloading for the other mode of
offloading, and mode selection. Given the CPU-cycle statistics information and
channel state information (CSI), the policies aim at maximizing the probability
of successfully computing given data, called computing probability, under the
energy harvesting and deadline constraints. The policy optimization is
translated into the equivalent problems of minimizing the mobile energy
consumption for local computing and maximizing the mobile energy savings for
offloading which are solved using convex optimization theory. The structures of
the resultant policies are characterized in closed form. Furthermore, given
non-causal CSI, the said analytical framework is further developed to support
computation load allocation over multiple channel realizations, which further
increases computing probability. Last, simulation demonstrates the feasibility
of wirelessly powered mobile cloud computing and the gain of its optimal
control.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 06:15:27 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 08:23:04 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"You",
"Changsheng",
""
],
[
"Huang",
"Kaibin",
""
],
[
"Chae",
"Hyukjin",
""
]
] |
new_dataset
| 0.984381 |
1509.03604
|
Kathryn Huff
|
Kathryn D. Huff, Matthew J. Gidden, Robert W. Carlsen, Robert R.
Flanagan, Meghan B. McGarry, Arrielle C. Opotowsky, Erich A. Schneider,
Anthony M. Scopatz, Paul P.H. Wilson
|
Fundamental concepts in the Cyclus nuclear fuel cycle simulation
framework
| null |
Advances in Engineering Software, Volume 94, April 2016, Pages
46-59
|
10.1016/j.advengsoft.2016.01.014
| null |
cs.SE cs.CE cs.MA cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As nuclear power expands, technical, economic, political, and environmental
analyses of nuclear fuel cycles by simulators increase in importance. To date,
however, current tools are often fleet-based rather than discrete and
restrictively licensed rather than open source. Each of these choices presents
a challenge to modeling fidelity, generality, efficiency, robustness, and
scientific transparency. The Cyclus nuclear fuel cycle simulator framework and
its modeling ecosystem incorporate modern insights from simulation science and
software architecture to solve these problems so that challenges in nuclear
fuel cycle analysis can be better addressed. A summary of the Cyclus fuel cycle
simulator framework and its modeling ecosystem are presented. Additionally, the
implementation of each is discussed in the context of motivating challenges in
nuclear fuel cycle simulation. Finally, the current capabilities of Cyclus are
demonstrated for both open and closed fuel cycles.
|
[
{
"version": "v1",
"created": "Fri, 11 Sep 2015 18:39:59 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 16:05:10 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Huff",
"Kathryn D.",
""
],
[
"Gidden",
"Matthew J.",
""
],
[
"Carlsen",
"Robert W.",
""
],
[
"Flanagan",
"Robert R.",
""
],
[
"McGarry",
"Meghan B.",
""
],
[
"Opotowsky",
"Arrielle C.",
""
],
[
"Schneider",
"Erich A.",
""
],
[
"Scopatz",
"Anthony M.",
""
],
[
"Wilson",
"Paul P. H.",
""
]
] |
new_dataset
| 0.996633 |
1603.03482
|
Nathan Egge
|
Nathan E. Egge and Jean-Marc Valin
|
Predicting Chroma from Luma with Frequency Domain Intra Prediction
|
10 pages, 7 figures
|
Proceedings of SPIE 9410, Visual Information Processing and
Communication VI, 941009 (March 4, 2015)
|
10.1117/12.2080837
| null |
cs.MM cs.GR
|
http://creativecommons.org/licenses/by/4.0/
|
This paper describes a technique for performing intra prediction of the
chroma planes based on the reconstructed luma plane in the frequency domain.
This prediction exploits the fact that while RGB to YUV color conversion has
the property that it decorrelates the color planes globally across an image,
there is still some correlation locally at the block level. Previous proposals
compute a linear model of the spatial relationship between the luma plane (Y)
and the two chroma planes (U and V). In codecs that use lapped transforms this
is not possible since transform support extends across the block boundaries and
thus neighboring blocks are unavailable during intra-prediction. We design a
frequency domain intra predictor for chroma that exploits the same local
correlation with lower complexity than the spatial predictor and which works
with lapped transforms. We then describe a low-complexity algorithm that
directly uses luma coefficients as a chroma predictor based on gain-shape
quantization and band partitioning. An experiment is performed that compares
these two techniques inside the experimental Daala video codec and shows the
lower complexity algorithm to be a better chroma predictor.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 22:55:36 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Egge",
"Nathan E.",
""
],
[
"Valin",
"Jean-Marc",
""
]
] |
new_dataset
| 0.967055 |
1603.03495
|
Pengfei Lu
|
Pengfei Lu, Zhenqiang Wu
|
Continuous Molecular Communication in one dimensional situation
|
4pages, 6figures, this paper is acccepted by ISEEE 2016
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Molecular Communication as the most potential methods to solve the
communication in nano scale, for it's derived from nature, and it becomes more
and more prevalent. Though molecular communication happens in three dimensional
situation, there are also some situation that are in the one dimensional
situation, especially when considering the transmitters and the receivers are
in extremely short distance or in long slim pipe. In this paper, we introduce
the one dimensional situation, and studied how the continuous information
molecules transmitted in this situation, also introduced how to encode and
decode the information molecules, and based on the molecular communication
model, we studied some metrics of it, such as the distance between transmitter
and receiver, the emitting frequency of transmitter. Through the research we
know that the distance and frequency are important metrics to the successful
communication, which can direct us how to place the nano transmitters and
receivers in the future nano network environment.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 00:40:01 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Lu",
"Pengfei",
""
],
[
"Wu",
"Zhenqiang",
""
]
] |
new_dataset
| 0.967462 |
1603.03520
|
Odessa Consorte
|
Odessa D. Consorte, Lilibeth D. Valdez
|
On Euclidean and Hermitian Self-Dual Cyclic Codes over
$\mathbb{F}_{2^r}$
| null | null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic and self-dual codes are important classes of codes in coding theory.
Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that
Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and
only if $n$ is even and $q=2^r$, where $r$ is any positive integer. For $n$ and
$q$ even, there always exists an $[n, \frac{n}{2}]$ self-dual cyclic code with
generator polynomial $x^{\frac{n}{2}}+1$ called the \textit{trivial self-dual
cyclic code}. In this paper we prove the existence of nontrivial self-dual
cyclic codes of length $n=2^\nu \cdot \bar{n}$, where $\bar{n}$ is odd, over
$\mathbb{F}_{2^r}$ in terms of the existence of a nontrivial splitting $(Z,
X_0, X_1)$ of $\mathbb{Z}_{\bar{n}}$ by $\mu_{-1}$, where $Z, X_0,X_1$ are
unions of $2^r$-cyclotomic cosets mod $\bar{n}.$ We also express the formula
for the number of cyclic self-dual codes over $\mathbb{F}_{2^r}$ for each $n$
and $r$ in terms of the number of $2^r$-cyclotomic cosets in $X_0$ (or in
$X_1$).
We also look at Hermitian self-dual cyclic codes and show properties which
are analogous to those of Euclidean self-dual cyclic codes. That is, the
existence of nontrivial Hermitian self-dual codes over $\mathbb{F}_{2^{2
\ell}}$ based on the existence of a nontrivial splitting $(Z, X_0, X_1)$ of
$\mathbb{Z}_{\bar{n}}$ by $\mu_{-2^\ell}$, where $Z, X_0,X_1$ are unions of
$2^{2 \ell}$-cyclotomic cosets mod $\bar{n}.$ We also determine the lengths at
which nontrivial Hermitian self-dual cyclic codes exist and the formula for the
number of Hermitian self-dual cyclic codes for each $n$.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 05:04:14 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Consorte",
"Odessa D.",
""
],
[
"Valdez",
"Lilibeth D.",
""
]
] |
new_dataset
| 0.999073 |
1603.03536
|
Mohammad Abdollahi Azgomi
|
Elaheh Ghassabani and Mohammad Abdollahi Azgomi
|
DSCMC: Distributed Stateless Code Model Checker
| null |
Trustworthy Computing Laboratory, School of Computer Engineering,
Iran University of Science and Technology, Tehran, Iran, 2014
| null |
Technical Report No. TWcL-TR-1403
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stateless code model checking is an effective verification technique, which
is more applicable than stateful model checking to the software world. Existing
stateless model checkers support the verification of neither LTL formulae nor
the information flow security properties. This paper proposes a distributed
stateless code model checker (DSCMC) designed based on the Actor model, and has
the capability of verifying code written in different programming languages.
This tool is implemented using Erlang, which is an actor-based programming
language. DSCMC is able to detect deadlocks, livelocks, and data races
automatically. In addition, the tool can verify information flow security and
the properties specified in LTL. Thanks to its actor-based architecture, DSCMC
provides a wide range of capabilities. The parallel architecture of the tool
exploiting the rich concurrency model of Erlang is suited to the time-intensive
process of stateless code model checking.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 06:49:43 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Ghassabani",
"Elaheh",
""
],
[
"Azgomi",
"Mohammad Abdollahi",
""
]
] |
new_dataset
| 0.995777 |
1603.03541
|
Chenxia Wu
|
Chenxia Wu, Jiemi Zhang, Ozan Sener, Bart Selman, Silvio Savarese,
Ashutosh Saxena
|
Watch-n-Patch: Unsupervised Learning of Actions and Relations
|
arXiv admin note: text overlap with arXiv:1512.04208
| null | null | null |
cs.CV cs.LG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a large variation in the activities that humans perform in their
everyday lives. We consider modeling these composite human activities which
comprises multiple basic level actions in a completely unsupervised setting.
Our model learns high-level co-occurrence and temporal relations between the
actions. We consider the video as a sequence of short-term action clips, which
contains human-words and object-words. An activity is about a set of
action-topics and object-topics indicating which actions are present and which
objects are interacting with. We then propose a new probabilistic model
relating the words and the topics. It allows us to model long-range action
relations that commonly exist in the composite activities, which is challenging
in previous works. We apply our model to the unsupervised action segmentation
and clustering, and to a novel application that detects forgotten actions,
which we call action patching. For evaluation, we contribute a new challenging
RGB-D activity video dataset recorded by the new Kinect v2, which contains
several human daily activities as compositions of multiple actions interacting
with different objects. Moreover, we develop a robotic system that watches
people and reminds people by applying our action patching algorithm. Our
robotic setup can be easily deployed on any assistive robot.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 07:13:59 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Wu",
"Chenxia",
""
],
[
"Zhang",
"Jiemi",
""
],
[
"Sener",
"Ozan",
""
],
[
"Selman",
"Bart",
""
],
[
"Savarese",
"Silvio",
""
],
[
"Saxena",
"Ashutosh",
""
]
] |
new_dataset
| 0.998999 |
1603.03725
|
Navid Tadayon
|
Navid Tadayon and Sonia Aissa
|
A Multi-Channel Spectrum Sensing Fusion Mechanism for Cognitive Radio
Networks: Design and Application to IEEE 802.22 WRANs
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IEEE 802.22 is a new cognitive radio standard that is aimed at extending
wireless outreach to rural areas. Known as wireless regional area networks, and
designed based on the not-to-interfere spectrum sharing model, WRANs are
channelized and centrally-controlled networks working on the under-utilized
UHF/VHF TV bands to establish communication with remote users, so-called
customer premises equipment (CPEs). Despite the importance of reliable and
interference-free operation in these frequencies, spectrum sensing fusion
mechanisms suggested in IEEE 802.22 are rudimentary and fail to satisfy the
stringent mandated sensing requirements. Other deep-rooted shortcomings are
performance non-uniformity over different signal-to-noise-ratio regimes,
unbalanced performance, instability and lack of flexibility. Inspired by these
observations, in this paper we propose a distributed spectrum sensing technique
for WRANs, named multi-channel learning-based distributed sensing fusion
mechanism (MC-LDS). MC-LDS is demonstrated to be self-trained, stable and to
compensate for fault reports through its inherent reward-penalty approach.
Moreover, MC-LDS exhibits a better uniform performance in all traffic regimes,
is fair (reduces the false-alarm/misdetection gap), adjustable (works with
several degrees of freedom) and bandwidth efficient (opens transmission
opportunities for more CPEs). Simulation results and comparisons unanimously
corroborate that MC-LDS outperforms IEEE 802.22 recommended algorithms, i.e.,
the AND, OR and VOTING rules.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2016 19:09:56 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Tadayon",
"Navid",
""
],
[
"Aissa",
"Sonia",
""
]
] |
new_dataset
| 0.981124 |
1603.03729
|
Vasile Patrascu
|
Vasile Patrascu
|
Penta and Hexa Valued Representation of Neutrosophic Information
| null | null |
10.13140/RG.2.1.2667.1762
|
IT.1.3.2016
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Starting from the primary representation of neutrosophic information, namely
the degree of truth, degree of indeterminacy and degree of falsity, we define a
nuanced representation in a penta valued fuzzy space, described by the index of
truth, index of falsity, index of ignorance, index of contradiction and index
of hesitation. Also, it was constructed an associated penta valued logic and
then using this logic, it was defined for the proposed penta valued structure
the following operators: union, intersection, negation, complement and dual.
Then, the penta valued representation is extended to a hexa valued one, adding
the sixth component, namely the index of ambiguity.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 04:18:38 GMT"
}
] | 2016-03-14T00:00:00 |
[
[
"Patrascu",
"Vasile",
""
]
] |
new_dataset
| 0.989425 |
1411.0735
|
Himanshu Tyagi
|
Masahito Hayashi and Himanshu Tyagi and Shun Watanabe
|
Secret Key Agreement: General Capacity and Second-Order Asymptotics
| null | null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We revisit the problem of secret key agreement using interactive public
communication for two parties and propose a new secret key agreement protocol.
The protocol attains the secret key capacity for general observations and
attains the second-order asymptotic term in the maximum length of a secret key
for independent and identically distributed observations. In contrast to the
previously suggested secret key agreement protocols, the proposed protocol uses
interactive communication. In fact, the standard one-way communication protocol
used prior to this work fails to attain the asymptotic results above. Our
converse proofs rely on a recently established upper bound for secret key
lengths. Both our lower and upper bounds are derived in a single-shot setup and
the asymptotic results are obtained as corollaries.
|
[
{
"version": "v1",
"created": "Mon, 3 Nov 2014 23:28:56 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Apr 2015 09:01:46 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Mar 2016 08:38:45 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Hayashi",
"Masahito",
""
],
[
"Tyagi",
"Himanshu",
""
],
[
"Watanabe",
"Shun",
""
]
] |
new_dataset
| 0.965079 |
1603.03097
|
Yu Wang
|
Yu Wang, Yuncheng Li, Jiebo Luo
|
Deciphering the 2016 U.S. Presidential Campaign in the Twitter Sphere: A
Comparison of the Trumpists and Clintonists
|
4 pages, to appear in the 10th International AAAI Conference on Web
and Social Media
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study follower demographics of Donald Trump and Hillary
Clinton, the two leading candidates in the 2016 U.S. presidential race. We
build a unique dataset US2016, which includes the number of followers for each
candidate from September 17, 2015 to December 22, 2015. US2016 also includes
the geographical location of these followers, the number of their own followers
and, very importantly, the profile image of each follower. We use individuals'
number of followers and profile images to analyze four dimensions of follower
demographics: social status, gender, race and age. Our study shows that in
terms of social influence, the Trumpists are more polarized than the
Clintonists: they tend to have either a lot of influence or little influence.
We also find that compared with the Clintonists, the Trumpists are more likely
to be either very young or very old. Our study finds no gender affinity effect
for Clinton in the Twitter sphere, but we do find that the Clintonists are more
racially diverse.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2016 23:36:26 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Wang",
"Yu",
""
],
[
"Li",
"Yuncheng",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.999118 |
1603.03129
|
Jean-Marc Valin
|
Thomas J. Daede, Nathan E. Egge, Jean-Marc Valin, Guillaume Martres,
Timothy B. Terriberry
|
Daala: A Perceptually-Driven Next Generation Video Codec
|
10 pages
| null | null | null |
cs.MM
|
http://creativecommons.org/licenses/by/4.0/
|
The Daala project is a royalty-free video codec that attempts to compete with
the best patent-encumbered codecs. Part of our strategy is to replace core
tools of traditional video codecs with alternative approaches, many of them
designed to take perceptual aspects into account, rather than optimizing for
simple metrics like PSNR. This paper documents some of our experiences with
these tools, which ones worked and which did not, and what we've learned from
them. The result is a codec which compares favorably with HEVC on still images,
and is on a path to do so for video as well.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 02:40:05 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Daede",
"Thomas J.",
""
],
[
"Egge",
"Nathan E.",
""
],
[
"Valin",
"Jean-Marc",
""
],
[
"Martres",
"Guillaume",
""
],
[
"Terriberry",
"Timothy B.",
""
]
] |
new_dataset
| 0.99834 |
1603.03152
|
B.Sundar Rajan
|
Anjana A. Mahesh and B. Sundar Rajan
|
Noisy Index Coding with PSK and QAM
|
A longer version of both our earlier arXiv submissions:
arXiv:1509.05874 [cs.IT] and arXiv:1510.08803 [cs.IT] along with some
additional results
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Noisy index coding problems over AWGN channel are considered. For a given
index coding problem and a chosen scalar linear index code of length $N$, we
propose to transmit the $N$ index coded bits as a single signal from a $2^N$-
PSK constellation. By transmitting the index coded bits in this way, there is
an $N/2$ - fold reduction in the bandwidth consumed. Also, receivers with side
information satisfying certain conditions get coding gain relative to a
receiver with no side information. This coding gain is due to proper
utilization of their side information and hence is called "PSK side information
coding gain (PSK-SICG)". A necessary and sufficient condition for a receiver to
get PSK-SICG is presented. An algorithm to map the index coded bits to PSK
signal set such that the PSK-SICG obtained is maximized for the receiver with
maximum side information is given. We go on to show that instead of
transmitting the $N$ index coded bits as a signal from $2^N$- PSK, we can as
well transmit them as a signal from $2^N$- QAM and all the results including
the necessary and sufficient condition to get coding gain holds. We prove that
sending the index coded bits as a QAM signal is better than sending them as a
PSK signal when the receivers see an effective signal set of eight points or
more.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 05:26:19 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Mahesh",
"Anjana A.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.995755 |
1603.03181
|
Nabil Hossain
|
Nabil Hossain, Tianran Hu, Roghayeh Feizi, Ann Marie White, Jiebo Luo
and Henry Kautz
|
Inferring Fine-grained Details on User Activities and Home Location from
Social Media: Detecting Drinking-While-Tweeting Patterns in Communities
|
12 pages, 7 figures, 4-page poster version accepted at ICWSM 2016,
alcohol dataset and keywords available in:
cs.rochester.edu/u/nhossain/icwsm-16-data.zip
| null | null | null |
cs.AI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nearly all previous work on geo-locating latent states and activities from
social media confounds general discussions about activities, self-reports of
users participating in those activities at times in the past or future, and
self-reports made at the immediate time and place the activity occurs.
Activities, such as alcohol consumption, may occur at different places and
types of places, and it is important not only to detect the local regions where
these activities occur, but also to analyze the degree of participation in them
by local residents. In this paper, we develop new machine learning based
methods for fine-grained localization of activities and home locations from
Twitter data. We apply these methods to discover and compare alcohol
consumption patterns in a large urban area, New York City, and a more suburban
and rural area, Monroe County. We find positive correlations between the rate
of alcohol consumption reported among a community's Twitter users and the
density of alcohol outlets, demonstrating that the degree of correlation varies
significantly between urban and suburban areas. While our experiments are
focused on alcohol use, our methods for locating homes and distinguishing
temporally-specific self-reports are applicable to a broad range of behaviors
and latent states.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 08:32:34 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Hossain",
"Nabil",
""
],
[
"Hu",
"Tianran",
""
],
[
"Feizi",
"Roghayeh",
""
],
[
"White",
"Ann Marie",
""
],
[
"Luo",
"Jiebo",
""
],
[
"Kautz",
"Henry",
""
]
] |
new_dataset
| 0.998131 |
1603.03357
|
Quentin Bodinier
|
Malek Naoues, Quentin Bodinier, Jacques Palicot
|
Cognitive Green Radio for Energy-Aware Communications
|
5 pages, URSI Scientific Days 2016
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 5G networks, the number of connected devices, data rate and data volume
per area, as well as the variety of QoS requirements, will attain unprecedented
scales. The achievement of these goals will rely on new technologies and
disruptive changes in network architecture and node design. Energy efficiency
is believed to play a key role in complementing the 5G technologies and
optimizing their deployment, dynamic configuration and management [1]. Within
the framework of green communications and networks, especially for
next-generation green cellular radio access networks, the GREAT (Green
Cognitive Radio for Energy-Aware wireless communication Technologies evolution)
initiative, a CominLabs Excellence Center (Laboratoire d'Excellence) and
Universit\'e Europ\'eenne de Bretagne (UEB)project, has mainly addressed the
fundamental issues of energy efficiency from various perspectives and angles,
leveraging on cognitive techniques, at networking level as well as at
thephysical layer level.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 18:07:40 GMT"
}
] | 2016-03-11T00:00:00 |
[
[
"Naoues",
"Malek",
""
],
[
"Bodinier",
"Quentin",
""
],
[
"Palicot",
"Jacques",
""
]
] |
new_dataset
| 0.976172 |
1506.07196
|
Itzhak Tamo
|
Itzhak Tamo and Alexander Barg and Alexey Frolov
|
Bounds on the Parameters of Locally Recoverable Codes
|
To appear in IEEE Transaction on Information Theory. A part of the
results of this paper were presented at the 2014 IEEE International Symposium
on Information Theory, July 2014, Honululu
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A locally recoverable code (LRC code) is a code over a finite alphabet such
that every symbol in the encoding is a function of a small number of other
symbols that form a recovering set. In this paper we derive new finite-length
and asymptotic bounds on the parameters of LRC codes. For LRC codes with a
single recovering set for every coordinate, we derive an asymptotic
Gilbert-Varshamov type bound for LRC codes and find the maximum attainable
relative distance of asymptotically good LRC codes. Similar results are
established for LRC codes with two disjoint recovering sets for every
coordinate. For the case of multiple recovering sets we derive a lower bound on
the parameters using expander graph arguments. Finally, we also derive
finite-length upper bounds on the rate and distance of LRC codes with multiple
recovering sets.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 20:42:27 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Mar 2016 20:31:36 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
],
[
"Frolov",
"Alexey",
""
]
] |
new_dataset
| 0.962798 |
1511.02300
|
Shuran Song
|
Shuran Song, Jianxiong Xiao
|
Deep Sliding Shapes for Amodal 3D Object Detection in RGB-D Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We focus on the task of amodal 3D object detection in RGB-D images, which
aims to produce a 3D bounding box of an object in metric form at its full
extent. We introduce Deep Sliding Shapes, a 3D ConvNet formulation that takes a
3D volumetric scene from a RGB-D image as input and outputs 3D object bounding
boxes. In our approach, we propose the first 3D Region Proposal Network (RPN)
to learn objectness from geometric shapes and the first joint Object
Recognition Network (ORN) to extract geometric features in 3D and color
features in 2D. In particular, we handle objects of various sizes by training
an amodal RPN at two different scales and an ORN to regress 3D bounding boxes.
Experiments show that our algorithm outperforms the state-of-the-art by 13.8 in
mAP and is 200x faster than the original Sliding Shapes. All source code and
pre-trained models will be available at GitHub.
|
[
{
"version": "v1",
"created": "Sat, 7 Nov 2015 04:34:18 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Mar 2016 19:21:23 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Song",
"Shuran",
""
],
[
"Xiao",
"Jianxiong",
""
]
] |
new_dataset
| 0.995755 |
1603.00930
|
Adam Summerville
|
Adam Summerville and Michael Mateas
|
Super Mario as a String: Platformer Level Generation Via LSTMs
| null | null | null | null |
cs.NE cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The procedural generation of video game levels has existed for at least 30
years, but only recently have machine learning approaches been used to generate
levels without specifying the rules for generation. A number of these have
looked at platformer levels as a sequence of characters and performed
generation using Markov chains. In this paper we examine the use of Long
Short-Term Memory recurrent neural networks (LSTMs) for the purpose of
generating levels trained from a corpus of Super Mario Brothers levels. We
analyze a number of different data representations and how the generated levels
fit into the space of human authored Super Mario Brothers levels.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 23:44:03 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Mar 2016 21:26:58 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Summerville",
"Adam",
""
],
[
"Mateas",
"Michael",
""
]
] |
new_dataset
| 0.970969 |
1603.02701
|
Marco Mezzavilla Dr
|
Menglei Zhang, Marco Mezzavilla, Russell Ford, Sundeep Rangan,
Shivendra Panwar, Evangelos Mellios, Di Kong, Andrew Nix, Michele Zorzi
|
Transport Layer Performance in 5G mmWave Cellular
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter wave (mmWave) bands are likely to play a significant role in
next generation cellular systems due to the possibility of very high throughput
thanks to the availability of massive bandwidth and high-dimensional antennas.
Especially in Non-Line-of-Sight conditions, significant variations in the
received RF power can occur as a result of the scattering from nearby building
and terrain surfaces. Scattering objects come and go as the user moves through
the local environment. At the higher end of the mmWave band, rough surface
scatter generates cluster-based small-scale fading, where signal levels can
vary by more than 20 dB over just a few wavelengths. This high level of channel
variability may present significant challenges for congestion control. Using
our recently developed end-to-end mmWave ns3-based framework, this paper
presents the first performance evaluation of TCP congestion control in
next-generation mmWave networks. Importantly, the framework can incorporate
detailed models of the mmWave channel, beam- forming and tracking algorithms,
and builds on statistical channel models derived from real measurements in New
York City, as well as detailed ray traces.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2016 21:08:23 GMT"
}
] | 2016-03-10T00:00:00 |
[
[
"Zhang",
"Menglei",
""
],
[
"Mezzavilla",
"Marco",
""
],
[
"Ford",
"Russell",
""
],
[
"Rangan",
"Sundeep",
""
],
[
"Panwar",
"Shivendra",
""
],
[
"Mellios",
"Evangelos",
""
],
[
"Kong",
"Di",
""
],
[
"Nix",
"Andrew",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.997114 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.