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
1509.03447
Franz J. Brandenburg
Franz J. Brandenburg
On 4-Map Graphs and 1-Planar Graphs and their Recognition Problem
null
null
null
null
cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal 1-planar, respectively, with a polynomial of degree 120, 3, and 5, respectively.
[ { "version": "v1", "created": "Fri, 11 Sep 2015 10:03:35 GMT" } ]
2015-09-14T00:00:00
[ [ "Brandenburg", "Franz J.", "" ] ]
new_dataset
0.999463
1509.03527
Thibault Gauthier
Thibault Gauthier, Cezary Kaliszyk
Sharing HOL4 and HOL Light proof knowledge
null
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
New proof assistant developments often involve concepts similar to already formalized ones. When proving their properties, a human can often take inspiration from the existing formalized proofs available in other provers or libraries. In this paper we propose and evaluate a number of methods, which strengthen proof automation by learning from proof libraries of different provers. Certain conjectures can be proved directly from the dependencies induced by similar proofs in the other library. Even if exact correspondences are not found, learning-reasoning systems can make use of the association between proved theorems and their characteristics to predict the relevant premises. Such external help can be further combined with internal advice. We evaluate the proposed knowledge-sharing methods by reproving the HOL Light and HOL4 standard libraries. The learning-reasoning system HOL(y)Hammer, whose single best strategy could automatically find proofs for 30% of the HOL Light problems, can prove 40% with the knowledge from HOL4.
[ { "version": "v1", "created": "Fri, 11 Sep 2015 14:18:04 GMT" } ]
2015-09-14T00:00:00
[ [ "Gauthier", "Thibault", "" ], [ "Kaliszyk", "Cezary", "" ] ]
new_dataset
0.99501
1509.03550
Michael Kirsche
Vladimir Vesely, Marcel Marek, Tomas Hykel and Ondrej Rysavy
Skip This Paper - RINASim: Your Recursive InterNetwork Architecture Simulator
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015, arXiv:1509.03284, 2015
null
null
OMNET/2015/13
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recursive InterNetwork Architecture is a clean-slate approach to how to deal with the current issues of the Internet based on the traditional TCP/IP networking stack. Instead of using a fixed number of layers with dedicated functionality, RINA proposes a single generic layer with programmable functionality that may be recursively stacked. We introduce a brand new framework for modeling and simulation of RINA that is intended for OMNeT++.
[ { "version": "v1", "created": "Fri, 11 Sep 2015 15:22:41 GMT" } ]
2015-09-14T00:00:00
[ [ "Vesely", "Vladimir", "" ], [ "Marek", "Marcel", "" ], [ "Hykel", "Tomas", "" ], [ "Rysavy", "Ondrej", "" ] ]
new_dataset
0.987372
1509.03573
Michael Kirsche
Mohammadhassan Safavi and Saeed Bastani
Invited Abstract: A Simulation Package for Energy Consumption of Content Delivery Networks (CDNs)
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015, arXiv:1509.03284, 2015
null
null
OMNET/2015/22
cs.PF cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Content Delivery Networks (CDNs) are becoming an integral part of the future generation Internet. Traditionally, these networks have been designed with the goals of traffic offload and the improvement of users' quality of experience (QoE), but the energy consumption is also becoming an indispensable design factor for CDNs to be a sustainable solution. To study and improve the CDN architectures using this new design metric, we are planning to develop a generic and flexible simulation package in OMNet++. This package is aimed to render a holistic view about the CDN energy consumption behaviour by incorporating the state-of-the-art energy consumption models proposed for the individual elements of CDNs (e.g. servers, routers, wired and wireless links, wireless devices, etc.) and for the various Internet contents (web pages, files, streaming video, etc.).
[ { "version": "v1", "created": "Fri, 11 Sep 2015 16:03:55 GMT" } ]
2015-09-14T00:00:00
[ [ "Safavi", "Mohammadhassan", "" ], [ "Bastani", "Saeed", "" ] ]
new_dataset
0.997616
1009.0581
Martin N\"ollenburg
Christian A. Duncan and David Eppstein and Michael T. Goodrich and Stephen G. Kobourov and Martin N\"ollenburg
Drawing Trees with Perfect Angular Resolution and Polynomial Area
30 pages, 17 figures
Discrete Comput. Geom. 49 (2): 157-182, 2013
10.1007/s00454-012-9472-y
null
cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2{\pi}/d(v). We show: 1. Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and polynomial area. 2. There are ordered trees that require exponential area for any crossing-free straight-line drawing having perfect angular resolution. 3. Any ordered tree has a crossing-free Lombardi-style drawing (where each edge is represented by a circular arc) with perfect angular resolution and polynomial area. Thus, our results explore what is achievable with straight-line drawings and what more is achievable with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution.
[ { "version": "v1", "created": "Fri, 3 Sep 2010 04:17:19 GMT" }, { "version": "v2", "created": "Thu, 10 Sep 2015 09:30:59 GMT" } ]
2015-09-11T00:00:00
[ [ "Duncan", "Christian A.", "" ], [ "Eppstein", "David", "" ], [ "Goodrich", "Michael T.", "" ], [ "Kobourov", "Stephen G.", "" ], [ "Nöllenburg", "Martin", "" ] ]
new_dataset
0.984881
1506.07269
David Gil
David Leon Gil
Distribution of elliptic twins over fixed finite fields: Numerical results
null
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We report numerical results, and describe plans for future experiments, related to the number of prime-order curves and "elliptic twin" curves over the primes P-224, P-256, and P-384 standardized by NIST for cryptographic applications. Although these results are not sufficient to confirm the formula of Shparlinski and Sutantyo 2014 over these fields, they strongly suggest (~99% probability) that the NIST curve P-384 was not chosen from a uniform distribution over prime-order curves.
[ { "version": "v1", "created": "Wed, 24 Jun 2015 07:42:44 GMT" }, { "version": "v2", "created": "Thu, 13 Aug 2015 03:40:22 GMT" }, { "version": "v3", "created": "Thu, 10 Sep 2015 01:40:15 GMT" } ]
2015-09-11T00:00:00
[ [ "Gil", "David Leon", "" ] ]
new_dataset
0.990669
1509.02984
Leon Abdillah
Andika, Leon Andretti Abdillah, Muhammad Ariandi
Sistem Informasi Geografis Ruang Terbuka Hijau Kawasan Perkotaan (RTHKP) Palembang
6 pages, Student Colloquium Sistem Informasi & Teknik Informatika (SC-SITI). Andika, et al., "Sistem Informasi Geografis Ruang Terbuka Hijau Kawasan Perkotaan (RTHKP) Palembang," presented at the Student Colloquium Sistem Informasi & Teknik Informatika (SC-SITI) 2015, Palembang, 2015
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Geographic Information System (GIS) is a computer-based system used to store and manipulate geographic information. In this study, GIS is used to obtain information about "open green space of urban areas" (RTHKP). Office of street lighting and Cemetery Palembang is one agency that regulates the green open spaces but not using media such as websites that support the community to get information about the open green space of urban areas in the city of Palembang, so it was apparent from the author will build a system RTKHP with geographic information system development methodology Rational Unified Process (RUP), the programming language PHP and uses a MySQL database. With the GIS open green space of urban areas that will be made later can help facilitate the public to get information related to RTHKP and assist the Department of street lighting and landscaping burial in managing and providing related information RTHKP in Palembang so that delivery of information to be more effective.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 02:03:19 GMT" } ]
2015-09-11T00:00:00
[ [ "Andika", "", "" ], [ "Abdillah", "Leon Andretti", "" ], [ "Ariandi", "Muhammad", "" ] ]
new_dataset
0.968745
1509.02986
Dmitri Strukov B
Gina C. Adam, Brian D. Hoskins, Mirko Prezioso, and Dmitri B. Strukov
Three-Dimensional Stateful Material Implication Logic
24 pages, 13 figures
null
null
null
cs.ET cond-mat.mes-hall
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Monolithic three-dimensional integration of memory and logic circuits could dramatically improve performance and energy efficiency of computing systems. Some conventional and emerging memories are suitable for vertical integration, including highly scalable metal-oxide resistive switching devices (memristors), yet integration of logic circuits proves to be much more challenging. Here we demonstrate memory and logic functionality in a monolithic three-dimensional circuit by adapting recently proposed memristor-based stateful material implication logic. Though such logic has been already implemented with a variety of memory devices, prohibitively large device variability in the most prospective memristor-based circuits has limited experimental demonstrations to simple gates and just a few cycles of operations. By developing a low-temperature, low-variability fabrication process, and modifying the original circuit to increase its robustness to device imperfections, we experimentally show, for the first time, reliable multi-cycle multi-gate material implication logic operation within a three-dimensional stack of monolithically integrated memristors. The direct data manipulation in three dimensions enables extremely compact and high-throughput logic-in-memory computing and, remarkably, presents a viable solution for the Feynman grand challenge of implementing an 8-bit adder at the nanoscale.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 02:17:46 GMT" } ]
2015-09-11T00:00:00
[ [ "Adam", "Gina C.", "" ], [ "Hoskins", "Brian D.", "" ], [ "Prezioso", "Mirko", "" ], [ "Strukov", "Dmitri B.", "" ] ]
new_dataset
0.997554
1509.03067
Michael Kirsche
Jens Dede, Koojana Kuladinithi, Anna F\"orster, Okko Nannen and Sebastian Lehnhoff
OMNeT++ and mosaik: Enabling Simulation of Smart Grid Communications
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/02
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents a preliminary system architecture of integrating OMNeT++ into the mosaik co-simulation framework. This will enable realistic simulation of communication network protocols and services for smart grid scenarios and on the other side, further development of communication protocols for smart grid applications. Thus, by integrating OMNeT++ and mosaik, both communities will be able to leverage each others's sophisticated simulation models and expertise. The main challenges identified are the external management of the OMNeT++ simulation kernel and performance issues when federating various simulators, including OMNeT++ into the mosaik framework. The purpose of this paper is to bring these challenges up and to gather relevant experience and expertise from the OMNeT++ community. We especially encourage collaboration among all OMNeT++ developers and users.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 09:33:17 GMT" } ]
2015-09-11T00:00:00
[ [ "Dede", "Jens", "" ], [ "Kuladinithi", "Koojana", "" ], [ "Förster", "Anna", "" ], [ "Nannen", "Okko", "" ], [ "Lehnhoff", "Sebastian", "" ] ]
new_dataset
0.971782
1509.03103
Michael Kirsche
Atheer Al-Rubaye and Jochen Seitz
Dynamic Index NAT as a Mobility Solution in OMNeT++
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/07
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Mobility in wireless networks causes a major issue from the IP-addressing perspective. When a Mobile Node (MN) moves to another subnet, it will probably get assigned a new IP address. This causes a routing problem since the MN will not be reachable with its previous IP address known to the other communication party. Real time applications might suffer from connection drops, which is recognized as inconvenience in the currently used service, unless some solution is provided. An approach to maintain session continuity while traversing heterogeneous networks of different subnet addresses is proposed. Here, a cross-layer module is implemented in OMNeT++ with NAT functionality to provide a seamless handover. A proof of concept is also shown with analogy to the Mobile IPv6 protocol provided in INET.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 11:24:21 GMT" } ]
2015-09-11T00:00:00
[ [ "Al-Rubaye", "Atheer", "" ], [ "Seitz", "Jochen", "" ] ]
new_dataset
0.998935
1509.03111
Michael Kirsche
Felix Weinrank, Michael T\"uxen and Erwin P. Rathgeb
Integration of RTMFP in the OMNeT++ Simulation Environment
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/10
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces the new Real-Time Media Flow Protocol (RTMFP) simulation model for the INET framework for the OMNeT++ simulation environment. RTMFP is a message orientated protocol with a focus on real time peer-to-peer communication. After Adobe Inc. released the specifications, we were able to implement the protocol in INET and compare its performance to the similar Stream Control Transmission Protocol (SCTP) with a focus on congestion control and flow control mechanisms.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 11:46:12 GMT" } ]
2015-09-11T00:00:00
[ [ "Weinrank", "Felix", "" ], [ "Tüxen", "Michael", "" ], [ "Rathgeb", "Erwin P.", "" ] ]
new_dataset
0.991809
1509.03127
Michael Kirsche
Irene R\"ungeler and Michael T\"uxen
Integration of the Packetdrill Testing Tool in INET
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/05
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Google released in 2013 a script-based tool called packetdrill, which allows to test transport protocols like UDP and TCP on Linux and BSD-based operating systems. The scripts defining a test-case allow to inject packets to the implementation under test, perform operations at the API controlling the transport protocol and verify the sending of packets, all at specified times. This paper describes a port of packetdrill to the INET framework for the OMNeT++ simulation environment providing a simple and powerful method of testing the transport protocols implemented in INET.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 12:45:46 GMT" } ]
2015-09-11T00:00:00
[ [ "Rüngeler", "Irene", "" ], [ "Tüxen", "Michael", "" ] ]
new_dataset
0.998931
1509.03161
Jiri Dokulil
Jiri Dokulil, Siegfried Benkner
OCR extensions - local identifiers, labeled GUIDs, file IO, and data block partitioning
null
null
null
null
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present several proposals for extending the Open Community Runtime (OCR) specification. The extension are identifiers with local validity, which use the concept of futures to provide OCR implementations more optimization opportunities, labeled GUIDs with creator functions, which are based on the local identifiers and allow the developer to create arrays of OCR objects that are safe from race conditions in case of concurrent creation of objects, a simple file IO interface, which builds on top of the existing data block concepts, and finally data block partitioning, which allows better control and flexibility in situations where multiple tasks want to access disjoint parts of a data block.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 14:00:55 GMT" } ]
2015-09-11T00:00:00
[ [ "Dokulil", "Jiri", "" ], [ "Benkner", "Siegfried", "" ] ]
new_dataset
0.990656
1509.03169
Michael Kirsche
Martin Levesque and David Tipper
ptp++: A Precision Time Protocol Simulation Model for OMNeT++ / INET
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/11
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Precise time synchronization is expected to play a key role in emerging distributed and real-time applications such as the smart grid and Internet of Things (IoT) based applications. The Precision Time Protocol (PTP) is currently viewed as one of the main synchronization solutions over a packet-switched network, which supports microsecond synchronization accuracy. In this paper, we present a PTP simulation model for OMNeT++ INET, which allows to investigate the synchronization accuracy under different network configurations and conditions. To show some illustrative simulation results using the developed module, we investigate on the network load fluctuations and their impacts on the PTP performance by considering a network with class-based quality-of-service (QoS) support. The simulation results show that the network load significantly affects the network delay symmetry, and investigate a new technique called class probing to improve the PTP accuracy and mitigate the load fluctuation effects.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 14:21:35 GMT" } ]
2015-09-11T00:00:00
[ [ "Levesque", "Martin", "" ], [ "Tipper", "David", "" ] ]
new_dataset
0.998834
1509.03176
Michael Kirsche
Jeffery Weston and Eric Koski
High Frequency Radio Network Simulation Using OMNeT++
Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche (Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich, Switzerland, September 3-4, 2015
null
null
OMNET/2015/12
cs.NI cs.PF
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Harris Corporation has an interest in making HF radios a suitable medium for wireless information networks using standard Internet protocols. Although HF radio links have many unique characteristics, HF wireless subnets can be subject to many of the same traffic flow characteristics and topologies as existing line-of-sight (LOS) radio networks, giving rise to similar issues (media access, connectivity, routing) which lend themselves to investigation through simulation. Accordingly, we have undertaken to develop efficient, high-fidelity simulations of various aspects of HF radio communications and networking using the OMNeT++ framework. Essential aspects of these simulations include HF channel models simulating relevant channel attributes such as Signal to Noise Ratio, multipath, and Doppler spread; a calibrated physical layer model reproducing the error statistics (including burst error distributions) of the MIL-STD-188-110B/C HF modem waveforms, both narrowband (3 kHz) and wideband (up to 24 kHz) on the simulated HF channels; a model of the NATO STANAG 5066 data link protocol; and integration of these models with the OMNeT++ network simulation framework and its INET library of Internet protocol models. This simulation is used to evaluate the impacts of different STANAG 5066 configuration settings on TCP network performance, and to evaluate strategies for optimizing throughput over HF links using TCP Performance Enhancing Proxy (PEP) techniques.
[ { "version": "v1", "created": "Thu, 10 Sep 2015 14:38:46 GMT" } ]
2015-09-11T00:00:00
[ [ "Weston", "Jeffery", "" ], [ "Koski", "Eric", "" ] ]
new_dataset
0.968918
1007.2016
Joseph O'Rourke
Joseph O'Rourke
On Flat Polyhedra deriving from Alexandrov's Theorem
8 pages, 3 figures, 10 references. This is a revision of the 2010 note, to clarify the meaning of 'n' in the complexity claim. Previously n was the number of vertices of the polygons, but n should be the complexity of the gluing instructions, which could be arbitrarily larger than the number of polygon vertices
null
null
null
cs.CG cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n^3) time for polygons whose gluings are specified by n labels.
[ { "version": "v1", "created": "Tue, 13 Jul 2010 01:05:10 GMT" }, { "version": "v2", "created": "Wed, 9 Sep 2015 18:12:06 GMT" } ]
2015-09-10T00:00:00
[ [ "O'Rourke", "Joseph", "" ] ]
new_dataset
0.993096
1411.5281
Juan Miguel Carrascosa
J. M. Carrascosa, J. Mikians, R. Cuevas, V. Erramilli and N. Laoutaris
I Always Feel Like Somebody's Watching Me. Measuring Online Behavioural Advertising
To appear in ACM CoNEXT 2015, Heidelberg, Germany. Please cite the conference version of this paper
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Online Behavioural targeted Advertising (OBA) has risen in prominence as a method to increase the effectiveness of online advertising. OBA operates by associating tags or labels to users based on their online activity and then using these labels to target them. This rise has been accompanied by privacy concerns from researchers, regulators and the press. In this paper, we present a novel methodology for measuring and understanding OBA in the online advertising market. We rely on training artificial online personas representing behavioural traits like 'cooking', 'movies', 'motor sports', etc. and build a measurement system that is automated, scalable and supports testing of multiple configurations. We observe that OBA is a frequent practice and notice that categories valued more by advertisers are more intensely targeted. In addition, we provide evidences showing that the advertising market targets sensitive topics (e.g, religion or health) despite the existence of regulation that bans such practices. We also compare the volume of OBA advertising for our personas in two different geographical locations (US and Spain) and see little geographic bias in terms of intensity of OBA targeting. Finally, we check for targeting with do-not-track (DNT) enabled and discovered that DNT is not yet enforced in the web.
[ { "version": "v1", "created": "Wed, 19 Nov 2014 16:31:38 GMT" }, { "version": "v2", "created": "Fri, 12 Jun 2015 10:52:50 GMT" }, { "version": "v3", "created": "Wed, 9 Sep 2015 08:29:40 GMT" } ]
2015-09-10T00:00:00
[ [ "Carrascosa", "J. M.", "" ], [ "Mikians", "J.", "" ], [ "Cuevas", "R.", "" ], [ "Erramilli", "V.", "" ], [ "Laoutaris", "N.", "" ] ]
new_dataset
0.95344
1509.02596
Yu Wang
Yu Wang, Jianbo Yuan, Jiebo Luo
To Love or to Loathe: How is the World Reacting to China's Rise?
8 pages, 10 figures, 5 tables, ICDM'15 workshop proceedings
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
China has experienced a spectacular economic growth in recent decades. Its economy grew more than 48 times from 1980 to 2013. How are the other countries reacting to China's rise? Do they see it as an economic opportunity or a security threat? In this paper, we answer this question by analyzing online news reports about China published in Australia, France, Germany, Japan, Russia, South Korea, the UK and the US. More specifically, we first analyze the frequency with which China has appeared in news headlines, which is a measure of China's influence in the world. Second, we build a Naive Bayes classifier to study the evolving nature of the news reports, i.e., whether they are economic or political. We then evaluate the friendliness of the news coverage based on sentiment analysis. Empirical results indicate that there has been increasing news coverage of China in all the countries under study. We also find that the emphasis of the reports is generally shifting towards China's economy. Here Japan and South Korea are exceptions: they are reporting more on Chinese politics. In terms of global sentiment, the picture is quite gloomy. With the exception of Australia and, to some extent, France, all the other countries under examination are becoming less positive towards China.
[ { "version": "v1", "created": "Wed, 9 Sep 2015 01:39:45 GMT" } ]
2015-09-10T00:00:00
[ [ "Wang", "Yu", "" ], [ "Yuan", "Jianbo", "" ], [ "Luo", "Jiebo", "" ] ]
new_dataset
0.999715
1509.02626
Yu-Chih Huang
Yu-Chih Huang
Lattice Index Codes from Algebraic Number Fields
22 pages, 13 figures
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Broadcasting $K$ independent messages to multiple users where each user demands all the messages and has a subset of the messages as side information is studied. Recently, Natarajan, Hong, and Viterbo proposed a novel broadcasting strategy called lattice index coding which uses lattices constructed over some principal ideal domains (PIDs) for transmission and showed that this scheme provides uniform side information gains. In this paper, we generalize this strategy to general rings of algebraic integers of number fields which may not be PIDs. Upper and lower bounds on the side information gains for the proposed scheme constructed over some interesting classes of number fields are provided and are shown to coincide asymptotically in message rates. This generalization substantially enlarges the design space and partially includes the scheme by Natarajan, Hong, and Viterbo as a special case. Perhaps more importantly, in addition to side information gains, the proposed lattice index codes benefit from diversity gains inherent in constellations carved from number fields when used over Rayleigh fading channel. Some interesting examples are also provided for which the proposed scheme allows all the messages to be from the same field.
[ { "version": "v1", "created": "Wed, 9 Sep 2015 03:41:15 GMT" } ]
2015-09-10T00:00:00
[ [ "Huang", "Yu-Chih", "" ] ]
new_dataset
0.994661
1509.02739
Zeon Trevor Fernando
Jaspreet Singh, Zeon Trevor Fernando, Saniya Chawla
LearnWeb-OER: Improving Accessibility of Open Educational Resources
LinkedUp Vici Challenge, International Semantic Web Conference, 2014
null
null
null
cs.HC cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In addition to user-generated content, Open Educational Resources are increasingly made available on the Web by several institutions and organizations with the aim of being re-used. Nevertheless, it is still difficult for users to find appropriate resources for specific learning scenarios among the vast amount offered on the Web. Our goal is to give users the opportunity to search for authentic resources from the Web and reuse them in a learning context. The LearnWeb-OER platform enhances collaborative searching and sharing of educational resources providing specific means and facilities for education. In the following, we provide a description of the functionalities that support users in collaboratively collecting, selecting, annotating and discussing search results and learning resources.
[ { "version": "v1", "created": "Wed, 9 Sep 2015 12:01:39 GMT" } ]
2015-09-10T00:00:00
[ [ "Singh", "Jaspreet", "" ], [ "Fernando", "Zeon Trevor", "" ], [ "Chawla", "Saniya", "" ] ]
new_dataset
0.982999
1406.0492
Jannik Silvanus
Stefan Hougardy and Jannik Silvanus and Jens Vygen
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
null
null
null
null
cs.DS cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a new exact algorithm for the Steiner tree problem in edge-weighted graphs. Our algorithm improves the classical dynamic programming approach by Dreyfus and Wagner. We achieve a significantly better practical performance via pruning and future costs, a generalization of a well-known concept to speed up shortest path computations. Our algorithm matches the best known worst-case run time and has a fast, often superior, practical performance: on some large instances originating from VLSI design, previous best run times are improved upon by orders of magnitudes. We are also able to solve larger instances of the $d$-dimensional rectilinear Steiner tree problem for $d \in \{3, 4, 5\}$, whose Hanan grids contain up to several millions of edges.
[ { "version": "v1", "created": "Mon, 2 Jun 2014 19:46:15 GMT" }, { "version": "v2", "created": "Tue, 3 Jun 2014 12:13:27 GMT" }, { "version": "v3", "created": "Tue, 8 Sep 2015 10:33:03 GMT" } ]
2015-09-09T00:00:00
[ [ "Hougardy", "Stefan", "" ], [ "Silvanus", "Jannik", "" ], [ "Vygen", "Jens", "" ] ]
new_dataset
0.997583
1310.1371
Eldad Afik
Eldad Afik
Robust and highly performant ring detection algorithm for 3d particle tracking using 2d microscope imaging
Software source-code is available at https://github.com/eldad-a/ridge-directed-ring-detector, as well as the linking (tracking) procedure and the natural cubic smoothing splines under particle-tracking & natural-cubic-smoothing-splines, correspondingly. 20 manuscript pages, including 7 SI & 3 references pages, 2 manuscript figures & 3 supporting figures
Sci. Rep. 5, 13584, (2015)
10.1038/srep13584
null
cs.CV cond-mat.soft physics.flu-dyn
http://creativecommons.org/licenses/by/4.0/
Three-dimensional particle tracking is an essential tool in studying dynamics under the microscope, namely, fluid dynamics in microfluidic devices, bacteria taxis, cellular trafficking. The 3d position can be determined using 2d imaging alone by measuring the diffraction rings generated by an out-of-focus fluorescent particle, imaged on a single camera. Here I present a ring detection algorithm exhibiting a high detection rate, which is robust to the challenges arising from ring occlusion, inclusions and overlaps, and allows resolving particles even when near to each other. It is capable of real time analysis thanks to its high performance and low memory footprint. The proposed algorithm, an offspring of the circle Hough transform, addresses the need to efficiently trace the trajectories of many particles concurrently, when their number in not necessarily fixed, by solving a classification problem, and overcomes the challenges of finding local maxima in the complex parameter space which results from ring clusters and noise. Several algorithmic concepts introduced here can be advantageous in other cases, particularly when dealing with noisy and sparse data. The implementation is based on open-source and cross-platform software packages only, making it easy to distribute and modify. It is implemented in a microfluidic experiment allowing real-time multi-particle tracking at 70 Hz, achieving a detection rate which exceeds 94% and only 1% false-detection.
[ { "version": "v1", "created": "Wed, 2 Oct 2013 08:36:32 GMT" }, { "version": "v2", "created": "Thu, 2 Oct 2014 19:34:09 GMT" }, { "version": "v3", "created": "Sun, 6 Sep 2015 12:25:12 GMT" } ]
2015-09-08T00:00:00
[ [ "Afik", "Eldad", "" ] ]
new_dataset
0.964068
1409.1194
Gabriel Nivasch
Sathish Govindarajan and Gabriel Nivasch
A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
10 pages, 1 figure
Discrete Comput. Geom. 54:637-646, 2015
10.1007/s00454-015-9723-9
null
cs.CG cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Let $X$ be a convex curve in the plane (say, the unit circle), and let $\mathcal S$ be a family of planar convex bodies, such that every two of them meet at a point of $X$. Then $\mathcal S$ has a transversal $N\subset\mathbb R^2$ of size at most $1.75\cdot 10^9$. Suppose instead that $\mathcal S$ only satisfies the following "$(p,2)$-condition": Among every $p$ elements of $\mathcal S$ there are two that meet at a common point of $X$. Then $\mathcal S$ has a transversal of size $O(p^8)$. For comparison, the best known bound for the Hadwiger--Debrunner $(p, q)$-problem in the plane, with $q=3$, is $O(p^6)$. Our result generalizes appropriately for $\mathbb R^d$ if $X\subset \mathbb R^d$ is, for example, the moment curve.
[ { "version": "v1", "created": "Wed, 3 Sep 2014 18:48:30 GMT" } ]
2015-09-08T00:00:00
[ [ "Govindarajan", "Sathish", "" ], [ "Nivasch", "Gabriel", "" ] ]
new_dataset
0.988646
1412.6077
Jiawei Li
Jiawei Li, Graham Kendall
On Nash Equilibrium and Evolutionarily Stable States that Are Not Characterised by the Folk Theorem
null
null
10.1371/journal.pone.0136032
null
cs.GT q-bio.PE
http://creativecommons.org/licenses/by/4.0/
In evolutionary game theory, evolutionarily stable states are characterised by the folk theorem because exact solutions to the replicator equation are difficult to obtain. It is generally assumed that the folk theorem, which is the fundamental theory for non-cooperative games, defines all Nash equilibria in infinitely repeated games. Here, we prove that Nash equilibria that are not characterised by the folk theorem do exist. By adopting specific reactive strategies, a group of players can be better off by coordinating their actions in repeated games. We call it a type-k equilibrium when a group of k players coordinate their actions and they have no incentive to deviate from their strategies simultaneously. The existence and stability of the type-k equilibrium in general games is discussed. This study shows that the sets of Nash equilibria and evolutionarily stable states have greater cardinality than classic game theory has predicted in many repeated games.
[ { "version": "v1", "created": "Tue, 2 Dec 2014 14:34:44 GMT" }, { "version": "v2", "created": "Fri, 21 Aug 2015 10:33:17 GMT" }, { "version": "v3", "created": "Mon, 7 Sep 2015 14:30:04 GMT" } ]
2015-09-08T00:00:00
[ [ "Li", "Jiawei", "" ], [ "Kendall", "Graham", "" ] ]
new_dataset
0.988003
1504.06359
Zhihan Lv
Zhihan Lv, Alaa Halawani, Shengzhong Feng, Shafiq ur Rehman, Haibo Li
Preprint Touch-less Interactive Augmented Reality Game on Vision Based Wearable Device
This is the preprint version of our paper on Personal and Ubiquitous Computing
null
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This is the preprint version of our paper on Personal and Ubiquitous Computing. There is an increasing interest in creating pervasive games based on emerging interaction technologies. In order to develop touch-less, interactive and augmented reality games on vision-based wearable device, a touch-less motion interaction technology is designed and evaluated in this work. Users interact with the augmented reality games with dynamic hands/feet gestures in front of the camera, which triggers the interaction event to interact with the virtual object in the scene. Three primitive augmented reality games with eleven dynamic gestures are developed based on the proposed touch-less interaction technology as proof. At last, a comparing evaluation is proposed to demonstrate the social acceptability and usability of the touch-less approach, running on a hybrid wearable framework or with Google Glass, as well as workload assessment, user's emotions and satisfaction.
[ { "version": "v1", "created": "Thu, 23 Apr 2015 22:55:08 GMT" }, { "version": "v2", "created": "Mon, 27 Apr 2015 20:04:13 GMT" }, { "version": "v3", "created": "Wed, 29 Jul 2015 08:27:44 GMT" }, { "version": "v4", "created": "Thu, 13 Aug 2015 20:27:54 GMT" }, { "version": "v5", "created": "Mon, 7 Sep 2015 15:48:19 GMT" } ]
2015-09-08T00:00:00
[ [ "Lv", "Zhihan", "" ], [ "Halawani", "Alaa", "" ], [ "Feng", "Shengzhong", "" ], [ "Rehman", "Shafiq ur", "" ], [ "Li", "Haibo", "" ] ]
new_dataset
0.999473
1505.02108
Ira Kemelmacher-Shlizerman
D. Miller, E. Brossard, S. Seitz, I. Kemelmacher-Shlizerman
MegaFace: A Million Faces for Recognition at Scale
Please see http://megaface.cs.washington.edu/ for code and data
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent face recognition experiments on the LFW benchmark show that face recognition is performing stunningly well, surpassing human recognition rates. In this paper, we study face recognition at scale. Specifically, we have collected from Flickr a \textbf{Million} faces and evaluated state of the art face recognition algorithms on this dataset. We found that the performance of algorithms varies--while all perform great on LFW, once evaluated at scale recognition rates drop drastically for most algorithms. Interestingly, deep learning based approach by \cite{schroff2015facenet} performs much better, but still gets less robust at scale. We consider both verification and identification problems, and evaluate how pose affects recognition at scale. Moreover, we ran an extensive human study on Mechanical Turk to evaluate human recognition at scale, and report results. All the photos are creative commons photos and is released at \small{\url{http://megaface.cs.washington.edu/}} for research and further experiments.
[ { "version": "v1", "created": "Fri, 8 May 2015 17:39:23 GMT" }, { "version": "v2", "created": "Mon, 7 Sep 2015 19:45:47 GMT" } ]
2015-09-08T00:00:00
[ [ "Miller", "D.", "" ], [ "Brossard", "E.", "" ], [ "Seitz", "S.", "" ], [ "Kemelmacher-Shlizerman", "I.", "" ] ]
new_dataset
0.997655
1509.00159
Zhihan Lv
Zhihan Lv and Xiaoming Li
Preprint Virtual Reality Assistant Technology for Learning Primary Geography
This is the preprint version of our paper on ICWL2015
null
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This is the preprint version of our paper on ICWL2015. A virtual reality based enhanced technology for learning primary geography is proposed, which synthesizes several latest information technologies including virtual reality(VR), 3D geographical information system(GIS), 3D visualization and multimodal human-computer-interaction (HCI). The main functions of the proposed system are introduced, i.e. Buffer analysis, Overlay analysis, Space convex hull calculation, Space convex decomposition, 3D topology analysis and 3D space intersection detection. The multimodal technologies are employed in the system to enhance the immersive perception of the users.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 07:03:35 GMT" }, { "version": "v2", "created": "Mon, 7 Sep 2015 15:55:27 GMT" } ]
2015-09-08T00:00:00
[ [ "Lv", "Zhihan", "" ], [ "Li", "Xiaoming", "" ] ]
new_dataset
0.998532
1509.01654
Yuewei Lin
Yuewei Lin, Kareem Ezzeldeen, Youjie Zhou, Xiaochuan Fan, Hongkai Yu, Hui Qian, Song Wang
Co-interest Person Detection from Multiple Wearable Camera Videos
ICCV 2015
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Wearable cameras, such as Google Glass and Go Pro, enable video data collection over larger areas and from different views. In this paper, we tackle a new problem of locating the co-interest person (CIP), i.e., the one who draws attention from most camera wearers, from temporally synchronized videos taken by multiple wearable cameras. Our basic idea is to exploit the motion patterns of people and use them to correlate the persons across different videos, instead of performing appearance-based matching as in traditional video co-segmentation/localization. This way, we can identify CIP even if a group of people with similar appearance are present in the view. More specifically, we detect a set of persons on each frame as the candidates of the CIP and then build a Conditional Random Field (CRF) model to select the one with consistent motion patterns in different videos and high spacial-temporal consistency in each video. We collect three sets of wearable-camera videos for testing the proposed algorithm. All the involved people have similar appearances in the collected videos and the experiments demonstrate the effectiveness of the proposed algorithm.
[ { "version": "v1", "created": "Sat, 5 Sep 2015 01:48:00 GMT" } ]
2015-09-08T00:00:00
[ [ "Lin", "Yuewei", "" ], [ "Ezzeldeen", "Kareem", "" ], [ "Zhou", "Youjie", "" ], [ "Fan", "Xiaochuan", "" ], [ "Yu", "Hongkai", "" ], [ "Qian", "Hui", "" ], [ "Wang", "Song", "" ] ]
new_dataset
0.97987
1509.01693
Mohamed Abuella
Mohamed Abuella and Constantine J. Hatziadoniu (Southern Illinois University)
The Economic Dispatch for Integrated Wind Power Systems Using Particle Swarm Optimization
This paper is a partial work of M.S.Thesis in Electrical and Computer Engineering at Southern Illinois University Carbondale
null
null
null
cs.CE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The economic dispatch of wind power units is quite different from that in conventional thermal units, since the adopted model should take into consideration the intermittency nature of wind speed as well. Therefore, this paper uses a model that takes into account the aforementioned consideration in addition to whether the utility owns wind turbines or not. The economic dispatch is solved by using one of the modern optimization algorithms: the particle swarm optimization algorithm. A 6-bus system is used and it includes wind-powered generators besides to thermal generators. The thorough analysis of the results is also provided.
[ { "version": "v1", "created": "Sat, 5 Sep 2015 11:24:36 GMT" } ]
2015-09-08T00:00:00
[ [ "Abuella", "Mohamed", "", "Southern Illinois\n University" ], [ "Hatziadoniu", "Constantine J.", "", "Southern Illinois\n University" ] ]
new_dataset
0.973776
1509.01756
Xueru Li
Xueru Li, Emil Bj\"ornson, Erik G. Larsson, Shidong Zhou, Jing Wang
A Multi-cell MMSE Detector for Massive MIMO Systems and New Large System Analysis
6 pages, 3 figures, accepted by Globecom 2015
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, a new multi-cell MMSE detector is proposed for massive MIMO systems. Let $K$ and $B$ denote the number of users in each cell and the number of available pilot sequences in the network, respectively, with $B = \beta K$, where $\beta \ge 1 $ is called the pilot reuse factor. The novelty of the multi-cell MMSE detector is that it utilizes all $B$ channel directions that can be estimated locally at a base station, so that intra-cell interference, parts of the inter-cell interference and the noise can all be actively suppressed, while conventional detectors only use the $K$ intra-cell channels. Furthermore, in the large-system limit, a deterministic equivalent expression of the uplink SINR for the proposed multi-cell MMSE is derived. The expression is easy to compute and accounts for power control for the pilot and payload, imperfect channel estimation and arbitrary pilot allocation. Numerical results show that significant sum spectral efficiency gains can be obtained by the multi-cell MMSE over the conventional single-cell MMSE and the recent multi-cell ZF, and the gains become more significant as $\beta$ and/or $K$ increases. Furthermore, the deterministic equivalent is shown to be very accurate even for relatively small system dimensions.
[ { "version": "v1", "created": "Sun, 6 Sep 2015 02:06:27 GMT" } ]
2015-09-08T00:00:00
[ [ "Li", "Xueru", "" ], [ "Björnson", "Emil", "" ], [ "Larsson", "Erik G.", "" ], [ "Zhou", "Shidong", "" ], [ "Wang", "Jing", "" ] ]
new_dataset
0.975675
1509.01858
Preetum Nakkiran
Preetum Nakkiran, K.V. Rashmi, Kannan Ramchandran
Optimal Systematic Distributed Storage Codes with Fast Encoding
16 pages, 4 figures
null
null
null
cs.IT cs.DC cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Erasure codes are being increasingly used in distributed-storage systems in place of data-replication, since they provide the same level of reliability with much lower storage overhead. We consider the problem of constructing explicit erasure codes for distributed storage with the following desirable properties motivated by practice: (i) Maximum-Distance-Separable (MDS): to provide maximal reliability at minimum storage overhead, (ii) Optimal repair-bandwidth: to minimize the amount of data needed to be transferred to repair a failed node from remaining ones, (iii) Flexibility in repair: to allow maximal flexibility in selecting subset of nodes to use for repair, which includes not requiring that all surviving nodes be used for repair, (iv) Systematic Form: to ensure that the original data exists in uncoded form, and (v) Fast encoding: to minimize the cost of generating encoded data (enabled by a sparse generator matrix). This paper presents the first explicit code construction which theoretically guarantees all the five desired properties simultaneously. Our construction builds on a powerful class of codes called Product-Matrix (PM) codes. PM codes satisfy properties (i)-(iii), and either (iv) or (v), but not both simultaneously. Indeed, native PM codes have inherent structure that leads to sparsity, but this structure is destroyed when the codes are made systematic. We first present an analytical framework for understanding the interaction between the design of PM codes and the systematic property. Using this framework, we provide an explicit code construction that simultaneously achieves all the above desired properties. We also present general ways of transforming existing storage and repair optimal codes to enable fast encoding through sparsity. In practice, such sparse codes result in encoding speedup by a factor of about 4 for typical parameters.
[ { "version": "v1", "created": "Sun, 6 Sep 2015 21:43:03 GMT" } ]
2015-09-08T00:00:00
[ [ "Nakkiran", "Preetum", "" ], [ "Rashmi", "K. V.", "" ], [ "Ramchandran", "Kannan", "" ] ]
new_dataset
0.981435
1509.01867
Attila De\'ak
Endre Cs\'oka, Attila De\'ak
A macro placer algorithm for chip design
null
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of wires. We present a heuristic algorithm which utilizes a special data structure for representing two dimensional stepfunctions. This results in fast integral computation and function modification over rectangles. Our heuristics, especially our data structure for two-dimensional functions, may be useful in other applications, as well.
[ { "version": "v1", "created": "Sun, 6 Sep 2015 23:33:23 GMT" } ]
2015-09-08T00:00:00
[ [ "Csóka", "Endre", "" ], [ "Deák", "Attila", "" ] ]
new_dataset
0.989955
1509.01874
Burak Pak
Burak Pak, Johan Verbeke
Geoweb 2.0 for Participatory Urban Design: Affordances and Critical Success Factors
null
International Journal of Architectural Computing 12(3) 283-305 (2014)
null
null
cs.SI cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we discuss the affordances of open-source Geoweb 2.0 platforms to support the participatory design of urban projects in real-world practices.We first introduce the two open-source platforms used in our study for testing purposes. Then, based on evidence from five different field studies we identify five affordances of these platforms: conversations on alternative urban projects, citizen consultation, design empowerment, design studio learning and design research. We elaborate on these in detail and identify a key set of success factors for the facilitation of better practices in the future.
[ { "version": "v1", "created": "Mon, 7 Sep 2015 00:58:45 GMT" } ]
2015-09-08T00:00:00
[ [ "Pak", "Burak", "" ], [ "Verbeke", "Johan", "" ] ]
new_dataset
0.999338
1509.01881
Camila Ferreira Costa
Camila F. Costa, Mario A. Nascimento, Jose A. F. Macedo, Yannis Theodoridis, Nikos Pelekis and Javam Machado
Optimal Time-dependent Sequenced Route Queries in Road Networks
10 pages, 12 figures To be published as a short paper in the 23rd ACM SIGSPATIAL
null
null
null
cs.DB cs.SI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, we find the fastest route between an origin and destination that passes through a sequence of points of interest belonging to each of the specified categories of interest. For instance, considering a city road network at a given departure time, one can find the fastest route between one's work and his/her home, passing through a bank, a supermarket and a restaurant, in this order. The main contribution of our work is the consideration of the time dependency of the network, a realistic characteristic of urban road networks, which has not been considered previously when addressing the optimal sequenced route query. Our approach uses the A* search paradigm that is equipped with an admissible heuristic function, thus guaranteed to yield the optimal solution, along with a pruning scheme for further reducing the search space. In order to compare our proposal we extended a previously proposed solution aimed at non-time dependent sequenced route queries, enabling it to deal with the time-dependency. Our experiments using real and synthetic data sets have shown our proposed solution to be up to two orders of magnitude faster than the temporally extended previous solution.
[ { "version": "v1", "created": "Mon, 7 Sep 2015 01:32:59 GMT" } ]
2015-09-08T00:00:00
[ [ "Costa", "Camila F.", "" ], [ "Nascimento", "Mario A.", "" ], [ "Macedo", "Jose A. F.", "" ], [ "Theodoridis", "Yannis", "" ], [ "Pelekis", "Nikos", "" ], [ "Machado", "Javam", "" ] ]
new_dataset
0.992929
1509.02153
Wei Si
Wei Si, David Starobinski, Moshe Laifenfeld
Hybrid-BCP: A Robust Load Balancing and Routing Protocol for Intra-Car Wired/Wireless Networks
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With the emergence of connected and autonomous vehicles, sensors are increasingly deployed within cars to support new functionalities. Traffic generated by these sensors congest traditional intra-car networks, such as CAN buses. Furthermore, the large amount of wires needed to connect sensors makes it harder to design cars in a modular way. To alleviate these limitations, we propose, simulate, and implement a hybrid wired/wireless architecture, in which each node is connected to either a wired interface or a wireless interface or both. Specifically, we propose a new protocol, called Hybrid-Backpressure Collection Protocol (Hybrid-BCP), to efficiently collect data from sensors in intra-car networks. Hybrid-BCP is backward-compatible with the CAN bus technology, and builds on the BCP protocol, designed for wireless sensor networks. Hybrid-BCP achieves high throughput and shows resilience to dynamic network conditions, including adversarial interferences. Our testbed implementation, based on CAN and ZigBee transceivers, demonstrates the load balancing and routing functionalities of Hybrid-BCP and its resilience to DoS attacks. We further provide simulation results, obtained with the ns-3 simulator and based on real intra-car RSSI traces, that compare between the performance of Hybrid-BCP and a tree-based collection protocol. Notably, the simulations show that Hybrid-BCP can achieve the same performance as the tree-based protocol while reducing the radio transmission power by a factor of 10.
[ { "version": "v1", "created": "Mon, 7 Sep 2015 19:51:06 GMT" } ]
2015-09-08T00:00:00
[ [ "Si", "Wei", "" ], [ "Starobinski", "David", "" ], [ "Laifenfeld", "Moshe", "" ] ]
new_dataset
0.997349
1509.01307
Jing Huang
Jan Gorzny and Jing Huang
End-vertices of LBFS of (AT-free) bigraphs
12 pages, 4 figures
null
null
null
cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Lexicographic Breadth First Search (LBFS) is one of fundamental graph search algorithms that has numerous applications, including recognition of graph classes, computation of graph parameters, and detection of certain graph structures. The well-known result of Rose, Tarjan and Lueker on the end-vertices of LBFS of chordal graphs has tempted researchers to study the end-vertices of LBFS of various classes of graphs, including chordal graphs, split graphs, interval graphs, and asteroidal triple-free (AT-free) graphs. In this paper we study the end-vertices of LBFS of bipartite graphs. We show that deciding whether a vertex of a bipartite graph is the end-vertex of an LBFS is an NP-complete problem. In contrast we characterize the end-vertices of LBFS of AT-free bipartite graphs. Our characterization implies that the problem of deciding whether a vertex of an AT-free bipartite graph is the end-vertex of an LBFS is solvable in polynomial time. Key words: Lexicographic breadth first search, end-vertex, bipartite graphs, AT-free, proper interval bigraph, characterization, algorithm.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 23:16:17 GMT" } ]
2015-09-07T00:00:00
[ [ "Gorzny", "Jan", "" ], [ "Huang", "Jing", "" ] ]
new_dataset
0.999722
1311.2460
Xavier Alameda-Pineda
Xavier Alameda-Pineda and Radu Horaud
Vision-Guided Robot Hearing
26 pages, many figures and tables, journal
International Journal of Robotics Research, 34 (4-5), 437-456, 2015
10.1177/0278364914548050
null
cs.RO cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Natural human-robot interaction in complex and unpredictable environments is one of the main research lines in robotics. In typical real-world scenarios, humans are at some distance from the robot and the acquired signals are strongly impaired by noise, reverberations and other interfering sources. In this context, the detection and localisation of speakers plays a key role since it is the pillar on which several tasks (e.g.: speech recognition and speaker tracking) rely. We address the problem of how to detect and localize people that are both seen and heard by a humanoid robot. We introduce a hybrid deterministic/probabilistic model. Indeed, the deterministic component allows us to map the visual information into the auditory space. By means of the probabilistic component, the visual features guide the grouping of the auditory features in order to form AV objects. The proposed model and the associated algorithm are implemented in real-time (17 FPS) using a stereoscopic camera pair and two microphones embedded into the head of the humanoid robot NAO. We performed experiments on (i) synthetic data, (ii) a publicly available data set and (iii) data acquired using the robot. The results we obtained validate the approach and encourage us to further investigate how vision can help robot hearing.
[ { "version": "v1", "created": "Wed, 6 Nov 2013 12:21:31 GMT" }, { "version": "v2", "created": "Mon, 16 Dec 2013 09:02:05 GMT" } ]
2015-09-04T00:00:00
[ [ "Alameda-Pineda", "Xavier", "" ], [ "Horaud", "Radu", "" ] ]
new_dataset
0.975701
1509.00961
Christohper Pilson
Christopher S. Pilson, James C. McElroy
A Typology of Authentication Systems
8 pages
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Authentication systems are designed to give the right person access to an organization's information system and to restrict it from the wrong person. Such systems are designed by IT professionals to protect an organization's assets (e.g., the organization's network, database, or other information). Too often, such systems are designed around technical specifications without regard for the end user. We argue that doing so may actually compromise a system's security. This paper examines authentication systems from both the point of view of the organization and that of the user.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 07:21:52 GMT" } ]
2015-09-04T00:00:00
[ [ "Pilson", "Christopher S.", "" ], [ "McElroy", "James C.", "" ] ]
new_dataset
0.956345
1509.00962
Chetan Singh Thakur
Runchun Wang, Chetan Singh Thakur, Tara Julia Hamilton, Jonathan Tapson, Andre van Schaik
A compact aVLSI conductance-based silicon neuron
BioCAS-2015
null
null
null
cs.NE
http://creativecommons.org/licenses/by-nc-sa/4.0/
We present an analogue Very Large Scale Integration (aVLSI) implementation that uses first-order lowpass filters to implement a conductance-based silicon neuron for high-speed neuromorphic systems. The aVLSI neuron consists of a soma (cell body) and a single synapse, which is capable of linearly summing both the excitatory and inhibitory postsynaptic potentials (EPSP and IPSP) generated by the spikes arriving from different sources. Rather than biasing the silicon neuron with different parameters for different spiking patterns, as is typically done, we provide digital control signals, generated by an FPGA, to the silicon neuron to obtain different spiking behaviours. The proposed neuron is only ~26.5 um2 in the IBM 130nm process and thus can be integrated at very high density. Circuit simulations show that this neuron can emulate different spiking behaviours observed in biological neurons.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 07:22:38 GMT" } ]
2015-09-04T00:00:00
[ [ "Wang", "Runchun", "" ], [ "Thakur", "Chetan Singh", "" ], [ "Hamilton", "Tara Julia", "" ], [ "Tapson", "Jonathan", "" ], [ "van Schaik", "Andre", "" ] ]
new_dataset
0.999173
1509.00963
Dilek K\"u\c{c}\"uk
Dilek K\"u\c{c}\"uk and Do\u{g}an K\"u\c{c}\"uk
On TimeML-Compliant Temporal Expression Extraction in Turkish
7 pages, 4 tables
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
It is commonly acknowledged that temporal expression extractors are important components of larger natural language processing systems like information retrieval and question answering systems. Extraction and normalization of temporal expressions in Turkish has not been given attention so far except the extraction of some date and time expressions within the course of named entity recognition. As TimeML is the current standard of temporal expression and event annotation in natural language texts, in this paper, we present an analysis of temporal expressions in Turkish based on the related TimeML classification (i.e., date, time, duration, and set expressions). We have created a lexicon for Turkish temporal expressions and devised considerably wide-coverage patterns using the lexical classes as the building blocks. We believe that the proposed patterns, together with convenient normalization rules, can be readily used by prospective temporal expression extraction tools for Turkish.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 07:23:10 GMT" } ]
2015-09-04T00:00:00
[ [ "Küçük", "Dilek", "" ], [ "Küçük", "Doğan", "" ] ]
new_dataset
0.997139
1509.00967
Chetan Singh Thakur
Ying Xu, Chetan Singh Thakur, Tara Julia Hamilton, Jonathan Tapson, Runchun Wang, Andre van Schaik
A Reconfigurable Mixed-signal Implementation of a Neuromorphic ADC
BioCAS-2015
null
null
null
cs.NE
http://creativecommons.org/licenses/by-nc-sa/4.0/
We present a neuromorphic Analogue-to-Digital Converter (ADC), which uses integrate-and-fire (I&F) neurons as the encoders of the analogue signal, with modulated inhibitions to decohere the neuronal spikes trains. The architecture consists of an analogue chip and a control module. The analogue chip comprises two scan chains and a twodimensional integrate-and-fire neuronal array. Individual neurons are accessed via the chains one by one without any encoder decoder or arbiter. The control module is implemented on an FPGA (Field Programmable Gate Array), which sends scan enable signals to the scan chains and controls the inhibition for individual neurons. Since the control module is implemented on an FPGA, it can be easily reconfigured. Additionally, we propose a pulse width modulation methodology for the lateral inhibition, which makes use of different pulse widths indicating different strengths of inhibition for each individual neuron to decohere neuronal spikes. Software simulations in this paper tested the robustness of the proposed ADC architecture to fixed random noise. A circuit simulation using ten neurons shows the performance and the feasibility of the architecture.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 07:51:24 GMT" } ]
2015-09-04T00:00:00
[ [ "Xu", "Ying", "" ], [ "Thakur", "Chetan Singh", "" ], [ "Hamilton", "Tara Julia", "" ], [ "Tapson", "Jonathan", "" ], [ "Wang", "Runchun", "" ], [ "van Schaik", "Andre", "" ] ]
new_dataset
0.999363
1509.01081
Davide Schipani
Reto Schnyder, Juan Antonio Lopez-Ramos, Joachim Rosenthal and Davide Schipani
An Active Attack on a Multiparty Key Exchange Protocol
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The multiparty key exchange introduced in Steiner et al.\@ and presented in more general form by the authors is known to be secure against passive attacks. In this paper, an active attack is presented assuming malicious control of the communications of the last two users for the duration of only the key exchange.
[ { "version": "v1", "created": "Thu, 3 Sep 2015 13:41:23 GMT" } ]
2015-09-04T00:00:00
[ [ "Schnyder", "Reto", "" ], [ "Lopez-Ramos", "Juan Antonio", "" ], [ "Rosenthal", "Joachim", "" ], [ "Schipani", "Davide", "" ] ]
new_dataset
0.956271
1508.07393
Yasmeen Shameem Akhtar
Yasmeen Akhtar and Soumen Maity
Mixed Covering Arrays on 3-Uniform Hypergraphs
null
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their parameters. In this paper, we perform a new generalization of covering arrays called covering arrays on 3-uniform hypergraphs. Let $n, k$ be positive integers with $k\geq 3$. Three vectors $x\in \mathbb Z_{g_1}^n$, $y\in \mathbb Z_{g_2}^n$, $z\in \mathbb Z_{g_3}^n$ are {\it 3-qualitatively independent} if for any triplet $(a, b, c) \in \mathbb Z_{g_1}\,\times\, \mathbb Z_{g_2}\,\times\,\mathbb Z_{g_3}$, there exists an index $ j\in \lbrace 1, 2,...,n \rbrace $ such that $( x(j), y(j), z(j)) = (a, b, c)$. Let $H$ be a 3-uniform hypergraph with $k$ vertices $v_1,v_2,\ldots,v_k$ with respective vertex weights $g_1,g_2,\ldots,g_k$. A mixed covering array on $H$, denoted by $3-CA(n,H, \prod_{i=1}^{k}g_{i})$, is a $k\times n$ array such that row $i$ corresponds to vertex $v_i$, entries in row $i$ are from $Z_{g_i}$; and if $\{v_x,v_y,v_z\}$ is a hyperedge in $H$, then the rows $x,y,z$ are 3-qualitatively independent. The parameter $n$ is called the size of the array. Given a weighted 3-uniform hypergraph $H$, a mixed covering array on $H$ with minimum size is called optimal. We outline necessary background in the theory of hypergraphs that is relevant to the study of covering arrays on hypergraphs. In this article, we introduce five basic hypergraph operations to construct optimal mixed covering arrays on hypergraphs. Using these operations, we provide constructions for optimal mixed covering arrays on $\alpha$-acyclic 3-uniform hypergraphs, conformal 3-uniform hypertrees having a binary tree as host tree, and on some specific 3-uniform cycle hypergraphs.
[ { "version": "v1", "created": "Sat, 29 Aug 2015 03:53:30 GMT" } ]
2015-09-03T00:00:00
[ [ "Akhtar", "Yasmeen", "" ], [ "Maity", "Soumen", "" ] ]
new_dataset
0.994022
1509.00511
Xitong Yang
Xitong Yang, Yuncheng Li, Jiebo Luo
Pinterest Board Recommendation for Twitter Users
null
null
10.1145/2733373.2806375
null
cs.SI cs.MM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Pinboard on Pinterest is an emerging media to engage online social media users, on which users post online images for specific topics. Regardless of its significance, there is little previous work specifically to facilitate information discovery based on pinboards. This paper proposes a novel pinboard recommendation system for Twitter users. In order to associate contents from the two social media platforms, we propose to use MultiLabel classification to map Twitter user followees to pinboard topics and visual diversification to recommend pinboards given user interested topics. A preliminary experiment on a dataset with 2000 users validated our proposed system.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 21:42:27 GMT" } ]
2015-09-03T00:00:00
[ [ "Yang", "Xitong", "" ], [ "Li", "Yuncheng", "" ], [ "Luo", "Jiebo", "" ] ]
new_dataset
0.999615
1509.00670
Derek Doran
Derek Doran, Samir Yelne, Luisa Massari, Maria-Carla Calzarossa, LaTrelle Jackson, Glen Moriarty
Stay Awhile and Listen: User Interactions in a Crowdsourced Platform Offering Emotional Support
null
null
10.1145/2808797.2809311
null
cs.SI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Internet and online-based social systems are rising as the dominant mode of communication in society. However, the public or semi-private environment under which most online communications operate under do not make them suitable channels for speaking with others about personal or emotional problems. This has led to the emergence of online platforms for emotional support offering free, anonymous, and confidential conversations with live listeners. Yet very little is known about the way these platforms are utilized, and if their features and design foster strong user engagement. This paper explores the utilization and the interaction features of hundreds of thousands of users on 7 Cups of Tea, a leading online platform offering online emotional support. It dissects the level of activity of hundreds of thousands of users, the patterns by which they engage in conversation with each other, and uses machine learning methods to find factors promoting engagement. The study may be the first to measure activities and interactions in a large-scale online social system that fosters peer-to-peer emotional support.
[ { "version": "v1", "created": "Wed, 2 Sep 2015 12:50:15 GMT" } ]
2015-09-03T00:00:00
[ [ "Doran", "Derek", "" ], [ "Yelne", "Samir", "" ], [ "Massari", "Luisa", "" ], [ "Calzarossa", "Maria-Carla", "" ], [ "Jackson", "LaTrelle", "" ], [ "Moriarty", "Glen", "" ] ]
new_dataset
0.95511
1509.00684
Giordano Da Lozzo
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis
L-Drawings of Directed Graphs
11 pages, 7 figures
null
null
null
cs.DS cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix representations. In an L-drawing, vertices have exclusive $x$- and $y$-coordinates and edges consist of two segments, one exiting the source vertically and one entering the destination horizontally. We study the problem of computing L-drawings using minimum ink. We prove its NP-completeness and provide a heuristics based on a polynomial-time algorithm that adds a vertex to a drawing using the minimum additional ink. We performed an experimental analysis of the heuristics which confirms its effectiveness.
[ { "version": "v1", "created": "Wed, 2 Sep 2015 13:19:58 GMT" } ]
2015-09-03T00:00:00
[ [ "Angelini", "Patrizio", "" ], [ "Da Lozzo", "Giordano", "" ], [ "Di Bartolomeo", "Marco", "" ], [ "Di Donato", "Valentino", "" ], [ "Patrignani", "Maurizio", "" ], [ "Roselli", "Vincenzo", "" ], [ "Tollis", "Ioannis G.", "" ] ]
new_dataset
0.996856
1509.00818
Michael Bannister
Michael J. Bannister and David A. Brown and David Eppstein
Confluent Orthogonal Drawings of Syntax Diagrams
GD 2015
null
null
null
cs.OH cs.FL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually recursive nondeterministic finite automata and draw by combining elements from the confluent drawing, layered drawing, and smooth orthogonal drawing styles. Within our pipeline we introduce several heuristics that modify the grammar but preserve the language, improving the aesthetics of the final drawing.
[ { "version": "v1", "created": "Wed, 2 Sep 2015 18:54:49 GMT" } ]
2015-09-03T00:00:00
[ [ "Bannister", "Michael J.", "" ], [ "Brown", "David A.", "" ], [ "Eppstein", "David", "" ] ]
new_dataset
0.99903
1509.00083
Samuel Kadoury
Samuel Kadoury, Eugene Vorontsov, An Tang
Metastatic liver tumour segmentation from discriminant Grassmannian manifolds
null
Physics in Medicine and Biology 60 (2015)
10.1088/0031-9155/60/16/6459
null
cs.LG cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The early detection, diagnosis and monitoring of liver cancer progression can be achieved with the precise delineation of metastatic tumours. However, accurate automated segmentation remains challenging due to the presence of noise, inhomogeneity and the high appearance variability of malignant tissue. In this paper, we propose an unsupervised metastatic liver tumour segmentation framework using a machine learning approach based on discriminant Grassmannian manifolds which learns the appearance of tumours with respect to normal tissue. First, the framework learns within-class and between-class similarity distributions from a training set of images to discover the optimal manifold discrimination between normal and pathological tissue in the liver. Second, a conditional optimisation scheme computes nonlocal pairwise as well as pattern-based clique potentials from the manifold subspace to recognise regions with similar labelings and to incorporate global consistency in the segmentation process. The proposed framework was validated on a clinical database of 43 CT images from patients with metastatic liver cancer. Compared to state-of-the-art methods, our method achieves a better performance on two separate datasets of metastatic liver tumours from different clinical sites, yielding an overall mean Dice similarity coefficient of 90.7 +/- 2.4 in over 50 tumours with an average volume of 27.3 mm3.
[ { "version": "v1", "created": "Mon, 31 Aug 2015 21:45:40 GMT" } ]
2015-09-02T00:00:00
[ [ "Kadoury", "Samuel", "" ], [ "Vorontsov", "Eugene", "" ], [ "Tang", "An", "" ] ]
new_dataset
0.987775
1509.00127
Ronald Rivest
Ronald L. Rivest
DiffSum - A Simple Post-Election Risk-Limiting Audit
1 page
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents DiffSum, a simple post-election risk-limiting ballot-polling audit for two-candidate plurality elections. DiffSum sequentially draws ballots (without replacement) until the numbers $a$, $b$, of votes for candidates $A$, $B$ satisfies $a>b$ and $(a-b)^2 > c(a+b)$, where $A$ is the reported winner and $c$ is a suitably chosen constant. Bounds on the error rate (chance of approving an incorrect election outcome) are obtained via simulations. The method is compared with the Bravo method of Lindeman, Stark, and Yates.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 03:29:17 GMT" } ]
2015-09-02T00:00:00
[ [ "Rivest", "Ronald L.", "" ] ]
new_dataset
0.993209
1509.00190
Alex Stolz
Alex Stolz and Martin Hepp
GR2RSS: Publishing Linked Open Commerce Data as RSS and Atom Feeds
Technical report, 5 pages, 2 figures
null
null
TR-2014-1
cs.IR cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The integration of Linked Open Data (LOD) content in Web pages is a challenging and sometimes tedious task for Web developers. At the same moment, most software packages for blogs, content management systems (CMS), and shop applications support the consumption of feed formats, namely RSS and Atom. In this technical report, we demonstrate an on-line tool that fetches e-commerce data from a SPARQL endpoint and syndicates obtained results as RSS or Atom feeds. Our approach combines (1) the popularity and broad tooling support of existing feed formats, (2) the precision of queries against structured data built upon common Web vocabularies like schema.org, GoodRelations, FOAF, VCard, and WGS 84, and (3) the ease of integrating content from a large number of Web sites and other data sources in RDF in general.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 09:25:07 GMT" } ]
2015-09-02T00:00:00
[ [ "Stolz", "Alex", "" ], [ "Hepp", "Martin", "" ] ]
new_dataset
0.99955
1509.00202
Vladimir Savic Dr
Vladimir Savic and Erik G. Larsson
Fingerprinting-Based Positioning in Distributed Massive MIMO Systems
Proc. of IEEE 82nd Vehicular Technology Conference (VTC2015-Fall)
null
null
null
cs.IT cs.LG math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Location awareness in wireless networks may enable many applications such as emergency services, autonomous driving and geographic routing. Although there are many available positioning techniques, none of them is adapted to work with massive multiple-in-multiple-out (MIMO) systems, which represent a leading 5G technology candidate. In this paper, we discuss possible solutions for positioning of mobile stations using a vector of signals at the base station, equipped with many antennas distributed over deployment area. Our main proposal is to use fingerprinting techniques based on a vector of received signal strengths. This kind of methods are able to work in highly-cluttered multipath environments, and require just one base station, in contrast to standard range-based and angle-based techniques. We also provide a solution for fingerprinting-based positioning based on Gaussian process regression, and discuss main applications and challenges.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 09:56:05 GMT" } ]
2015-09-02T00:00:00
[ [ "Savic", "Vladimir", "" ], [ "Larsson", "Erik G.", "" ] ]
new_dataset
0.991899
1509.00334
Vincent Lostanlen
Vincent Lostanlen, St\'ephane Mallat
Transform\'ee en scattering sur la spirale temps-chroma-octave
in French, 4 pages, 3 figures, presented at GRETSI 2015 in Lyon, France
null
null
null
cs.SD
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce a scattering representation for the analysis and classification of sounds. It is locally translation-invariant, stable to deformations in time and frequency, and has the ability to capture harmonic structures. The scattering representation can be interpreted as a convolutional neural network which cascades a wavelet transform in time and along a harmonic spiral. We study its application for the analysis of the deformations of the source-filter model.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 15:04:16 GMT" } ]
2015-09-02T00:00:00
[ [ "Lostanlen", "Vincent", "" ], [ "Mallat", "Stéphane", "" ] ]
new_dataset
0.965006
1509.00335
Thomas Janson
Thomas Janson and Christian Schindelhauer
Receiving Pseudorandom PSK
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Pseudorandom PSK [1] enables parallel communication on the same carrier frequency and at the same time. We propose different signal processing methods to receive data modulated with pseudorandom PSK. This includes correlation with the carrier frequency which can be applied to signals in the kHz to MHz range and signal processing in the intermediate frequency where the correlation with the carrier frequency is performed analogous in the RF front end. We analyze the computation complexity for signal processing with the parameters of symbol length $T$ and number of repetitions of each symbol $K$ with pseudorandom PSK and show that the number of operations for each sampling point is $\Theta\left(K\right)$.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 15:04:56 GMT" } ]
2015-09-02T00:00:00
[ [ "Janson", "Thomas", "" ], [ "Schindelhauer", "Christian", "" ] ]
new_dataset
0.999255
1509.00378
David Naccache
Eric Brier, Jean-S\'ebastien Coron, R\'emi G\'eraud, Diana Maimut, David Naccache
A Number-Theoretic Error-Correcting Code
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we describe a new error-correcting code (ECC) inspired by the Naccache-Stern cryptosystem. While by far less efficient than Turbo codes, the proposed ECC happens to be more efficient than some established ECCs for certain sets of parameters. The new ECC adds an appendix to the message. The appendix is the modular product of small primes representing the message bits. The receiver recomputes the product and detects transmission errors using modular division and lattice reduction.
[ { "version": "v1", "created": "Tue, 1 Sep 2015 16:24:15 GMT" } ]
2015-09-02T00:00:00
[ [ "Brier", "Eric", "" ], [ "Coron", "Jean-Sébastien", "" ], [ "Géraud", "Rémi", "" ], [ "Maimut", "Diana", "" ], [ "Naccache", "David", "" ] ]
new_dataset
0.995497
1403.3455
Lewis Tseng
Lewis Tseng and Nitin Vaidya
Asynchronous Convex Consensus in the Presence of Crash Faults
A version of this work is published in PODC 2014
null
null
null
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper defines a new consensus problem, convex consensus. Similar to vector consensus [13, 20, 19], the input at each process is a d-dimensional vector of reals (or, equivalently, a point in the d-dimensional Euclidean space). However, for convex consensus, the output at each process is a convex polytope contained within the convex hull of the inputs at the fault-free processes. We explore the convex consensus problem under crash faults with incorrect inputs, and present an asynchronous approximate convex consensus algorithm with optimal fault tolerance that reaches consensus on an optimal output polytope. Convex consensus can be used to solve other related problems. For instance, a solution for convex consensus trivially yields a solution for vector consensus. More importantly, convex consensus can potentially be used to solve other more interesting problems, such as convex function optimization [5, 4].
[ { "version": "v1", "created": "Thu, 13 Mar 2014 23:01:39 GMT" }, { "version": "v2", "created": "Mon, 31 Aug 2015 17:27:44 GMT" } ]
2015-09-01T00:00:00
[ [ "Tseng", "Lewis", "" ], [ "Vaidya", "Nitin", "" ] ]
new_dataset
0.995915
1503.03403
Karthik Gopalakrishnan
Dhruv Chand, Karthik Gopalakrishnan, Nisha KK, Mudit Sinha, Shreya Sriram
Bublz! : Playing with Bubbles to Develop Mathematical Thinking
null
null
null
null
cs.HC math.HO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We encounter mathematical problems in various forms in our lives, thus making mathematical thinking an important human ability. In this paper, we present Bublz!, a simple, click-driven game for children to engage in and develop mathematical thinking in an enjoyable manner.
[ { "version": "v1", "created": "Wed, 11 Mar 2015 16:20:51 GMT" }, { "version": "v2", "created": "Sun, 30 Aug 2015 13:28:19 GMT" } ]
2015-09-01T00:00:00
[ [ "Chand", "Dhruv", "" ], [ "Gopalakrishnan", "Karthik", "" ], [ "KK", "Nisha", "" ], [ "Sinha", "Mudit", "" ], [ "Sriram", "Shreya", "" ] ]
new_dataset
0.996981
1506.03186
Mohammad Shihabul Haque
Mohammad Shihabul Haque, Jorgen Peddersen, Sri Parameswaran
CIPARSim: Cache Intersection Property Assisted Rapid Single-pass FIFO Cache Simulation Technique
null
null
10.1109/ICCAD.2011.6105316
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, for the first time, we introduce a cache property called the Intersection Property that helps to reduce singlepass simulation time in a manner similar to inclusion property. An intersection property defines conditions that if met, prove a particular element exists in larger caches, thus avoiding further search time. We have discussed three such intersection properties for caches using the FIFO replacement policy in this paper. A rapid singlepass FIFO cache simulator CIPARSim has also been proposed. CIPARSim is the first singlepass simulator dependent on the FIFO cache properties to reduce simulation time significantly. CIPARSim simulation time was up to 5 times faster compared to the state of the art singlepass FIFO cache simulator for the cache configurations tested. CIPARSim produces the cache hit and miss rates of an application accurately on various cache configurations. During simulation, CIPARSim intersection properties alone predict up to 90% of the total hits, reducing simulationtime immensely
[ { "version": "v1", "created": "Wed, 10 Jun 2015 06:57:55 GMT" }, { "version": "v2", "created": "Mon, 31 Aug 2015 18:21:08 GMT" } ]
2015-09-01T00:00:00
[ [ "Haque", "Mohammad Shihabul", "" ], [ "Peddersen", "Jorgen", "" ], [ "Parameswaran", "Sri", "" ] ]
new_dataset
0.998926
1508.07698
Mostafa El-Khamy
Mostafa El-Khamy, Hsien-Ping Lin, Jungwon Lee, Hessam Mahdavifar, Inyup Kang
Rate-Compatible Polar Codes for Wireless Channels
Accepted for publication at 2015 IEEE Global Communications Conference (Globecom)
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A design of rate-compatible polar codes suitable for HARQ communications is proposed in this paper. An important feature of the proposed design is that the puncturing order is chosen with low complexity on a base code of short length, which is then further polarized to the desired length. A practical rate-matching system that has the flexibility to choose any desired rate through puncturing or repetition while preserving the polarization is suggested. The proposed rate-matching system is combined with channel interleaving and a bit-mapping procedure that preserves the polarization of the rate-compatible polar code family over bit-interleaved coded modulation systems. Simulation results on AWGN and fast fading channels with different modulation orders show the robustness of the proposed rate-compatible polar code in both Chase combining and incremental redundancy HARQ communications.
[ { "version": "v1", "created": "Mon, 31 Aug 2015 06:26:00 GMT" } ]
2015-09-01T00:00:00
[ [ "El-Khamy", "Mostafa", "" ], [ "Lin", "Hsien-Ping", "" ], [ "Lee", "Jungwon", "" ], [ "Mahdavifar", "Hessam", "" ], [ "Kang", "Inyup", "" ] ]
new_dataset
0.989374
1508.07724
Anandi Giridharan
Anandi Giridharan and Pallapa Venkataram
SDL based validation of a node monitoring protocol
16 pages, 24 figures, International Conference of Networks, Communications, Wireless and Mobile 2015
null
null
null
cs.NI cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Mobile ad hoc network is a wireless, self-configured, infrastructureless network of mobile nodes. The nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources, buffer degradation, and intermittent disconnection etc. Node failure and Network fault are need to be monitored continuously by supervising the network status. Node monitoring protocol is crucial, so it is required to test the protocol exhaustively to verify and validate the functionality and accuracy of the designed protocol. This paper presents a validation model for Node Monitoring Protocol using Specification and Description Llanguage (SDL) using both Static Agent (SA) and Mobile Agent (MA). We have verified properties of the Node Monitoring Protocol (NMP) based on the global states with no exits, deadlock states or proper termination states using reachability graph. Message Sequence Chart (MSC) gives an intuitive understanding of the described system behavior with varying node density and complex behavior etc.
[ { "version": "v1", "created": "Mon, 31 Aug 2015 08:57:47 GMT" } ]
2015-09-01T00:00:00
[ [ "Giridharan", "Anandi", "" ], [ "Venkataram", "Pallapa", "" ] ]
new_dataset
0.998979
1508.07921
Fabrizio Frati
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
Simultaneous Embeddings with Few Bends and Crossings
Full version of the paper "Simultaneous Embeddings with Few Bends and Crossings" accepted at GD '15
null
null
null
cs.CG cs.DS math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A simultaneous embedding with fixed edges (SEFE) of two planar graphs $R$ and $B$ is a pair of plane drawings of $R$ and $B$ that coincide when restricted to the common vertices and edges of $R$ and $B$. We show that whenever $R$ and $B$ admit a SEFE, they also admit a SEFE in which every edge is a polygonal curve with few bends and every pair of edges has few crossings. Specifically: (1) if $R$ and $B$ are trees then one bend per edge and four crossings per edge pair suffice (and one bend per edge is sometimes necessary), (2) if $R$ is a planar graph and $B$ is a tree then six bends per edge and eight crossings per edge pair suffice, and (3) if $R$ and $B$ are planar graphs then six bends per edge and sixteen crossings per edge pair suffice. Our results improve on a paper by Grilli et al. (GD'14), which proves that nine bends per edge suffice, and on a paper by Chan et al. (GD'14), which proves that twenty-four crossings per edge pair suffice.
[ { "version": "v1", "created": "Mon, 31 Aug 2015 17:12:21 GMT" } ]
2015-09-01T00:00:00
[ [ "Frati", "Fabrizio", "" ], [ "Hoffmann", "Michael", "" ], [ "Kusters", "Vincent", "" ] ]
new_dataset
0.977855
1508.07953
Lihi Zelnik-Manor
Nir Ben-Zrihem and Lihi Zelnik-Manor
Approximate Nearest Neighbor Fields in Video
A CVPR 2015 oral paper
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce RIANN (Ring Intersection Approximate Nearest Neighbor search), an algorithm for matching patches of a video to a set of reference patches in real-time. For each query, RIANN finds potential matches by intersecting rings around key points in appearance space. Its search complexity is reversely correlated to the amount of temporal change, making it a good fit for videos, where typically most patches change slowly with time. Experiments show that RIANN is up to two orders of magnitude faster than previous ANN methods, and is the only solution that operates in real-time. We further demonstrate how RIANN can be used for real-time video processing and provide examples for a range of real-time video applications, including colorization, denoising, and several artistic effects.
[ { "version": "v1", "created": "Mon, 31 Aug 2015 18:43:31 GMT" } ]
2015-09-01T00:00:00
[ [ "Ben-Zrihem", "Nir", "" ], [ "Zelnik-Manor", "Lihi", "" ] ]
new_dataset
0.998211
1508.07977
Franz Richter-Gottfried
Franz Richter-Gottfried, Alexander Ditter, Dietmar Fey
OpenCL 2.0 for FPGAs using OCLAcc
Presented at Second International Workshop on FPGAs for Software Programmers (FSP 2015) (arXiv:1508.06320)
null
null
FSP/2015/11
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Designing hardware is a time-consuming and complex process. Realization of both, embedded and high-performance applications can benefit from a design process on a higher level of abstraction. This helps to reduce development time and allows to iteratively test and optimize the hardware design during development, as common in software development. We present our tool, OCLAcc, which allows the generation of entire FPGA-based hardware accelerators from OpenCL and discuss the major novelties of OpenCL 2.0 and how they can be realized in hardware using OCLAcc.
[ { "version": "v1", "created": "Fri, 28 Aug 2015 08:28:51 GMT" } ]
2015-09-01T00:00:00
[ [ "Richter-Gottfried", "Franz", "" ], [ "Ditter", "Alexander", "" ], [ "Fey", "Dietmar", "" ] ]
new_dataset
0.99965
1404.7048
Xiaowen Dong
Xiaowen Dong, Dimitrios Mavroeidis, Francesco Calabrese, Pascal Frossard
Multiscale Event Detection in Social Media
null
Data Mining and Knowledge Discovery, vol. 29, no. 5, pp. 1374-1405, September 2015
10.1007/s10618-015-0421-2
null
cs.SI cs.LG physics.soc-ph stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Event detection has been one of the most important research topics in social media analysis. Most of the traditional approaches detect events based on fixed temporal and spatial resolutions, while in reality events of different scales usually occur simultaneously, namely, they span different intervals in time and space. In this paper, we propose a novel approach towards multiscale event detection using social media data, which takes into account different temporal and spatial scales of events in the data. Specifically, we explore the properties of the wavelet transform, which is a well-developed multiscale transform in signal processing, to enable automatic handling of the interaction between temporal and spatial scales. We then propose a novel algorithm to compute a data similarity graph at appropriate scales and detect events of different scales simultaneously by a single graph-based clustering process. Furthermore, we present spatiotemporal statistical analysis of the noisy information present in the data stream, which allows us to define a novel term-filtering procedure for the proposed event detection algorithm and helps us study its behavior using simulated noisy data. Experimental results on both synthetically generated data and real world data collected from Twitter demonstrate the meaningfulness and effectiveness of the proposed approach. Our framework further extends to numerous application domains that involve multiscale and multiresolution data analysis.
[ { "version": "v1", "created": "Fri, 25 Apr 2014 13:28:37 GMT" }, { "version": "v2", "created": "Fri, 6 Feb 2015 00:15:42 GMT" } ]
2015-08-31T00:00:00
[ [ "Dong", "Xiaowen", "" ], [ "Mavroeidis", "Dimitrios", "" ], [ "Calabrese", "Francesco", "" ], [ "Frossard", "Pascal", "" ] ]
new_dataset
0.98779
1503.02603
Mark Shifrin
Mark Shifrin
An asymptotically optimal policy and state-space collapse for the multi-class shared queue
arXiv admin note: text overlap with arXiv:1412.6775
null
null
null
cs.PF math.PR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We consider a multi-class G/G/1 queue with a finite shared buffer. There is task admission and server scheduling control which aims to minimize the cost which consists of holding and rejection components. We construct a policy that is asymptotically optimal in the heavy traffic limit. The policy stems from solution to Harrison-Taksar (HT) free boundary problem and is expressed by a single free boundary point. We show that the HT problem solution translated into the queuelength processes follows a specific {\it triangular} form. This form implies the queuelength control policy which is different from the known $c\mu$ priority rule and has a novel structure. We exemplify that the probabilistic methods we exploit can be successfully applied to solving scheduling and admission problems in cloud computing.
[ { "version": "v1", "created": "Mon, 9 Mar 2015 18:26:55 GMT" }, { "version": "v2", "created": "Thu, 27 Aug 2015 23:44:06 GMT" } ]
2015-08-31T00:00:00
[ [ "Shifrin", "Mark", "" ] ]
new_dataset
0.950359
1508.07053
Kenji Hata
Kenji Hata, Sherman Leung, Ranjay Krishna, Michael S. Bernstein, Li Fei-Fei
SentenceRacer: A Game with a Purpose for Image Sentence Annotation
2 pages, 2 figures, 2 tables, potential CSCW poster submission
null
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recently datasets that contain sentence descriptions of images have enabled models that can automatically generate image captions. However, collecting these datasets are still very expensive. Here, we present SentenceRacer, an online game that gathers and verifies descriptions of images at no cost. Similar to the game hangman, players compete to uncover words in a sentence that ultimately describes an image. SentenceRacer both generates and verifies that the sentences are accurate descriptions. We show that SentenceRacer generates annotations of higher quality than those generated on Amazon Mechanical Turk (AMT).
[ { "version": "v1", "created": "Thu, 27 Aug 2015 23:03:17 GMT" } ]
2015-08-31T00:00:00
[ [ "Hata", "Kenji", "" ], [ "Leung", "Sherman", "" ], [ "Krishna", "Ranjay", "" ], [ "Bernstein", "Michael S.", "" ], [ "Fei-Fei", "Li", "" ] ]
new_dataset
0.99958
1508.07099
Yanping Huang
Francis Iannacci, Yanping Huang
ChirpCast: Data Transmission via Audio
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we present ChirpCast, a system for broadcasting network access keys to laptops ultrasonically. This work explores several modulation techniques for sending and receiving data using sound waves through commodity speakers and built-in laptop microphones. Requiring only that laptop users run a small application, the system successfully provides robust room-specific broadcasting at data rates of 200 bits/second.
[ { "version": "v1", "created": "Fri, 28 Aug 2015 05:41:14 GMT" } ]
2015-08-31T00:00:00
[ [ "Iannacci", "Francis", "" ], [ "Huang", "Yanping", "" ] ]
new_dataset
0.996208
1508.07113
Xiaojing Chen
Shixin Zhu, Xiaojing Chen
Cyclic DNA codes over F2+uF2+vF2+uvF2
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this work, we study the structure of cyclic DNA codes of arbitrary lengths over the ring R=F2+uF2+vF2+uvF2 and establish relations to codes over R1=F2+uF2 by defining a Gray map between R and R1^2 where R1 is the ring with 4 elements. Cyclic codes of arbitrary lengths over R satisfied the reverse constraint and the reverse-complement constraint are studied in this paper. The GC content constraint is considered in the last.
[ { "version": "v1", "created": "Fri, 28 Aug 2015 07:35:12 GMT" } ]
2015-08-31T00:00:00
[ [ "Zhu", "Shixin", "" ], [ "Chen", "Xiaojing", "" ] ]
new_dataset
0.995321
1508.07283
Luiz Capretz Dr.
Faheem Ahmed, Piers Campbell, Azam Beg, Luiz Fernando Capretz
What Soft Skills Software Architect Should Have? A Reflection from Software Industry
International Conference on Computer Communication and Management (ICCCM), Sydney, Australia pp. 565-569, 2011
null
null
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The job of software architect is considered very crucial in the life cycle of the software development because software architecture has a pivotal role in the success and failure of the software project in terms of cost and quality. People have different personality traits, and the way they perceive, plan and execute any assigned task is influenced by it. These personality traits are characterized by soft skills. Most of the time, software development is a team work involving several people executing different tasks. The success and failure stories of software projects revealed the human factor as one of the critical importance. In this work we are presenting an exploratory study about the soft skills requirements for a software architects job. We analyzed 124 advertised jobs in the title of software architect and explore the soft skills requirements. The results of this investigation help in understanding software skills requirement set for a job of software architect and presents the current status of their use in job advertisements.
[ { "version": "v1", "created": "Fri, 28 Aug 2015 17:15:12 GMT" } ]
2015-08-31T00:00:00
[ [ "Ahmed", "Faheem", "" ], [ "Campbell", "Piers", "" ], [ "Beg", "Azam", "" ], [ "Capretz", "Luiz Fernando", "" ] ]
new_dataset
0.966463
1502.04068
Eric Duchene
Eric Duch\^ene, Matthieu Dufour, Silvia Heubach, Urban Larsson
Building Nim
null
null
null
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The game of nim, with its simple rules, its elegant solution and its historical importance is the quintessence of a combinatorial game, which is why it led to so many generalizations and modifications. We present a modification with a new spin: building nim. With given finite numbers of tokens and stacks, this two-player game is played in two stages (thus belonging to the same family of games as e.g. nine-men's morris): first building, where players alternate to put one token on one of the, initially empty, stacks until all tokens have been used. Then, the players play nim. Of course, because the solution for the game of nim is known, the goal of the player who starts nim play is a placement of the tokens so that the Nim-sum of the stack heights at the end of building is different from 0. This game is trivial if the total number of tokens is odd as the Nim-sum could never be 0, or if both the number of tokens and the number of stacks are even, since a simple mimicking strategy results in a Nim-sum of 0 after each of the second player's moves. We present the solution for this game for some non-trivial cases and state a general conjecture.
[ { "version": "v1", "created": "Fri, 13 Feb 2015 17:50:35 GMT" }, { "version": "v2", "created": "Thu, 27 Aug 2015 09:24:35 GMT" } ]
2015-08-28T00:00:00
[ [ "Duchêne", "Eric", "" ], [ "Dufour", "Matthieu", "" ], [ "Heubach", "Silvia", "" ], [ "Larsson", "Urban", "" ] ]
new_dataset
0.997908
1505.03491
Siddhartha Kumar
Siddhartha Kumar and Alexandre Graell i Amat and Iryna Andriyanova and Fredrik Br\"annstr\"om
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
Accepted, will appear in the proceedings of Globecom 2015 (Selected Areas in Communications: Data Storage)
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols. The primary goal of the first class of symbols is to provide good erasure correcting capability, while the second class facilitates node repair, reducing the repair bandwidth and the repair complexity. We compare the proposed codes with other codes proposed in the literature.
[ { "version": "v1", "created": "Wed, 13 May 2015 18:39:42 GMT" }, { "version": "v2", "created": "Thu, 27 Aug 2015 15:39:19 GMT" } ]
2015-08-28T00:00:00
[ [ "Kumar", "Siddhartha", "" ], [ "Amat", "Alexandre Graell i", "" ], [ "Andriyanova", "Iryna", "" ], [ "Brännström", "Fredrik", "" ] ]
new_dataset
0.992693
1508.06731
Othon Michail
Dimitrios Amaxilatis, Marios Logaras, Othon Michail, Paul G. Spirakis
NETCS: A New Simulator of Population Protocols and Network Constructors
null
null
null
null
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Network Constructors are an extension of the standard population protocol model in which finite-state agents interact in pairs under the control of an adversary scheduler. In this work we present NETCS, a simulator designed to evaluate the performance of various network constructors and population protocols under different schedulers and network configurations. Our simulator provides researchers with an intuitive user interface and a quick experimentation environment to evaluate their work. It also harnesses the power of the cloud, as experiments are executed remotely and scheduled through the web interface provided. To prove the validity and quality of our simulator we provide an extensive evaluation of multiple protocols with more than 100000 experiments for different network sizes and configurations that validate the correctness of the theoretical analysis of existing protocols and estimate the real values of the hidden asymptotic coefficients. We also show experimentally (with more than 40000 experiments) that a probabilistic algorithm is capable of counting the actual size of the network in bounded time given a unique leader.
[ { "version": "v1", "created": "Thu, 27 Aug 2015 06:46:02 GMT" } ]
2015-08-28T00:00:00
[ [ "Amaxilatis", "Dimitrios", "" ], [ "Logaras", "Marios", "" ], [ "Michail", "Othon", "" ], [ "Spirakis", "Paul G.", "" ] ]
new_dataset
0.99605
1508.06805
Jeffrey Goeders
Jeffrey Goeders, Steven J. E. Wilton
Allowing Software Developers to Debug HLS Hardware
Presented at Second International Workshop on FPGAs for Software Programmers (FSP 2015) (arXiv:1508.06320)
null
null
FSP/2015/01
cs.SE cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
High-Level Synthesis (HLS) is emerging as a mainstream design methodology, allowing software designers to enjoy the benefits of a hardware implementation. Significant work has led to effective compilers that produce high-quality hardware designs from software specifications. However, in order to fully benefit from the promise of HLS, a complete ecosystem that provides the ability to analyze, debug, and optimize designs is essential. This ecosystem has to be accessible to software designers. This is challenging, since software developers view their designs very differently than how they are physically implemented on-chip. Rather than individual sequential lines of code, the implementation consists of gates operating in parallel across multiple clock cycles. In this paper, we report on our efforts to create an ecosystem that allows software designers to debug HLS-generated circuits in a familiar manner. We have implemented our ideas in a debug framework that will be included in the next release of the popular LegUp high-level synthesis tool.
[ { "version": "v1", "created": "Thu, 27 Aug 2015 11:22:04 GMT" } ]
2015-08-28T00:00:00
[ [ "Goeders", "Jeffrey", "" ], [ "Wilton", "Steven J. E.", "" ] ]
new_dataset
0.999484
1508.06821
Jens Korinth
Jens Korinth, David de la Chevallerie, Andreas Koch
ThreadPoolComposer - An Open-Source FPGA Toolchain for Software Developers
Presented at Second International Workshop on FPGAs for Software Programmers (FSP 2015) (arXiv:1508.06320)
null
null
FSP/2015/04
cs.DC cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This extended abstract presents ThreadPoolComposer, a high-level synthesis-based development framework and meta-toolchain that provides a uniform programming interface for FPGAs portable across multiple platforms.
[ { "version": "v1", "created": "Thu, 27 Aug 2015 12:03:57 GMT" } ]
2015-08-28T00:00:00
[ [ "Korinth", "Jens", "" ], [ "de la Chevallerie", "David", "" ], [ "Koch", "Andreas", "" ] ]
new_dataset
0.998671
1508.06843
Oliver Knodel
Oliver Knodel, Rainer G. Spallek
RC3E: Provision and Management of Reconfigurable Hardware Accelerators in a Cloud Environment
Presented at Second International Workshop on FPGAs for Software Programmers (FSP 2015) (arXiv:1508.06320)
null
null
FSP/2015/09
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Heterogeneous systems consisting of general-purpose processors and different types of hardware accelerators are becoming more and more common in HPC systems. Especially FPGAs provide a promising opportunity to improve both performance and energy efficiency of such systems. Adding FPGAs to clouds or data centers allows easy access to such reconfigurable resources. In this paper we present our cloud service models and cloud hypervisor called RC3E, which integrates virtualized FPGA-based hardware accelerators into a cloud environment. With our hardware and software framework, multiple (virtual) user designs can be executed on a single physical FPGA device. We demonstrate the performance of our approach by implementing up to four virtual user cores on a single device and present future perspectives for FPGAs in cloud-based data environments.
[ { "version": "v1", "created": "Thu, 27 Aug 2015 13:05:24 GMT" } ]
2015-08-28T00:00:00
[ [ "Knodel", "Oliver", "" ], [ "Spallek", "Rainer G.", "" ] ]
new_dataset
0.982358
1508.06853
Daniele Liciotti
Daniele Liciotti, Marco Contigiani, Emanuele Frontoni, Adriano Mancini, Primo Zingaretti, Valerio Placidi
Shopper Analytics: a customer activity recognition system using a distributed RGB-D camera network
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The aim of this paper is to present an integrated system consisted of a RGB-D camera and a software able to monitor shoppers in intelligent retail environments. We propose an innovative low cost smart system that can understand the shoppers' behavior and, in particular, their interactions with the products in the shelves, with the aim to develop an automatic RGB-D technique for video analysis. The system of cameras detects the presence of people and univocally identifies them. Through the depth frames, the system detects the interactions of the shoppers with the products on the shelf and determines if a product is picked up or if the product is taken and then put back and finally, if there is not contact with the products. The system is low cost and easy to install, and experimental results demonstrated that its performances are satisfactory also in real environments.
[ { "version": "v1", "created": "Thu, 27 Aug 2015 13:31:09 GMT" } ]
2015-08-28T00:00:00
[ [ "Liciotti", "Daniele", "" ], [ "Contigiani", "Marco", "" ], [ "Frontoni", "Emanuele", "" ], [ "Mancini", "Adriano", "" ], [ "Zingaretti", "Primo", "" ], [ "Placidi", "Valerio", "" ] ]
new_dataset
0.966359
1508.06329
Agnieszka Lupinska
Agnieszka Lupinska
A Parallel Algorithm to Test Chordality of Graphs
MSc thesis, promoter: dr Maciej \'Slusarek
null
null
null
cs.DC cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a simple parallel algorithm to test chordality of graphs which is based on the parallel Lexicographical Breadth-First Search algorithm. In total, the algorithm takes time O(N ) on N-threads machine and it performs work O(N 2 ) , where N is the number of vertices in a graph. Our implementation of the algorithm uses a GPU environment Nvidia CUDA C. The algorithm is implemented in CUDA 4.2 and it has been tested on Nvidia GeForce GTX 560 Ti of compute capability 2.1. At the end of the thesis we present the results achieved by our implementation and compare them with the results achieved by the sequential algorithm
[ { "version": "v1", "created": "Tue, 25 Aug 2015 23:51:04 GMT" } ]
2015-08-27T00:00:00
[ [ "Lupinska", "Agnieszka", "" ] ]
new_dataset
0.99388
1505.04979
Abbas Syed Mohsin
Syed Mohsin Abbas, YouZhe Fan, Ji Chen and Chi-Ying Tsui
Low Complexity Belief Propagation Polar Code Decoders
6 pages
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compared to BPD. However SCDs suffer from long latency and low throughput due to the serial nature of the successive cancellation algorithm. BPD is parallel in nature and hence is more attractive for high throughput applications. However since it is iterative in nature, the required latency and energy dissipation increases linearly with the number of iterations. In this work, we borrow the idea of SCD and propose a novel scheme based on sub-factor-graph freezing to reduce the average number of computations as well as the average number of iterations required by BPD, which directly translates into lower latency and energy dissipation. Simulation results show that the proposed scheme has no performance degradation and achieves significant reduction in computation complexity over the existing methods.
[ { "version": "v1", "created": "Tue, 19 May 2015 12:58:58 GMT" }, { "version": "v2", "created": "Tue, 25 Aug 2015 17:28:48 GMT" } ]
2015-08-26T00:00:00
[ [ "Abbas", "Syed Mohsin", "" ], [ "Fan", "YouZhe", "" ], [ "Chen", "Ji", "" ], [ "Tsui", "Chi-Ying", "" ] ]
new_dataset
0.980883
1508.03790
Kaisheng Yao
Kaisheng Yao, Trevor Cohn, Katerina Vylomova, Kevin Duh, and Chris Dyer
Depth-Gated LSTM
Content presented in 2015 Jelinek Summer Workshop on Speech and Language Technology on August 14th 2015
null
null
null
cs.NE cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this short note, we present an extension of long short-term memory (LSTM) neural networks to using a depth gate to connect memory cells of adjacent layers. Doing so introduces a linear dependence between lower and upper layer recurrent units. Importantly, the linear dependence is gated through a gating function, which we call depth gate. This gate is a function of the lower layer memory cell, the input to and the past memory cell of this layer. We conducted experiments and verified that this new architecture of LSTMs was able to improve machine translation and language modeling performances.
[ { "version": "v1", "created": "Sun, 16 Aug 2015 04:31:37 GMT" }, { "version": "v2", "created": "Wed, 19 Aug 2015 19:38:58 GMT" }, { "version": "v3", "created": "Thu, 20 Aug 2015 07:13:04 GMT" }, { "version": "v4", "created": "Tue, 25 Aug 2015 04:24:20 GMT" } ]
2015-08-26T00:00:00
[ [ "Yao", "Kaisheng", "" ], [ "Cohn", "Trevor", "" ], [ "Vylomova", "Katerina", "" ], [ "Duh", "Kevin", "" ], [ "Dyer", "Chris", "" ] ]
new_dataset
0.999001
1508.05935
Shengli Zhang
Shengli Zhang, Xiugang Wu, Ayfer Ozgur
STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks
null
null
null
null
cs.NI cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The data center network (DCN), wired or wireless, features large amounts of Many-to-One (M2O) sessions. Each M2O session is currently operated based on Point-to-Point (P2P) communications and Store-and-Forward (SAF) relays, and is generally followed by certain further computation at the destination. %typically a weighted summation of the received digits. Different from this separate P2P/SAF-based-transmission and computation strategy, this paper proposes STAC, a novel physical layer scheme that achieves Simultaneous Transmission and Air Computation in wireless DCNs. In particular, STAC takes advantage of the superposition nature of electromagnetic (EM) waves, and allows multiple transmitters to transmit in the same time slot with appropriately chosen parameters, such that the received superimposed signal can be directly transformed to the needed summation at the receiver. Exploiting the static channel environment and compact space in DCN, we propose an enhanced Software Defined Network (SDN) architecture to enable STAC, where wired connections are established to provide the wireless transceivers external reference signals. Theoretical analysis and simulation show that with STAC used, both the bandwidth and energy efficiencies can be improved severalfold.
[ { "version": "v1", "created": "Mon, 24 Aug 2015 02:31:22 GMT" } ]
2015-08-26T00:00:00
[ [ "Zhang", "Shengli", "" ], [ "Wu", "Xiugang", "" ], [ "Ozgur", "Ayfer", "" ] ]
new_dataset
0.987855
1508.05968
Kaarthik Sundar
Kaarthik Sundar, Saravanan Venkatachalam, Sivakumar Rathinam
Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem
6 pages, 2 figures, submitted to American Control Conference 2016
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We consider a multiple depot, multiple vehicle routing problem with fuel constraints. We are given a set of targets, a set of depots and a set of homogeneous vehicles, one for each depot. The depots are also allowed to act as refueling stations. The vehicles are allowed to refuel at any depot, and our objective is to determine a route for each vehicle with a minimum total cost such that each target is visited at least once by some vehicle, and the vehicles never run out fuel as it traverses its route. We refer this problem as Multiple Depot, Fuel-Constrained, Multiple Vehicle Routing Problem (FCMVRP). This paper presents four new mixed integer linear programming formulations to compute an optimal solution for the problem. Extensive computational results for a large set of instances are also presented.
[ { "version": "v1", "created": "Mon, 24 Aug 2015 20:48:33 GMT" } ]
2015-08-26T00:00:00
[ [ "Sundar", "Kaarthik", "" ], [ "Venkatachalam", "Saravanan", "" ], [ "Rathinam", "Sivakumar", "" ] ]
new_dataset
0.997309
1508.06010
Muhammad Zubair Ahmad
Muhammad Zubair Ahmad, Amir Ali Khan, Sihem Mezghani, Eric Perrin, Kamel Mouhoubi, Jean-Luc Bodnar, Valeriu Vrabie
Wavelet subspace decomposition of thermal infrared images for defect detection in artworks
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Monitoring the health of ancient artworks requires adequate prudence because of the sensitive nature of these materials. Classical techniques for identifying the development of faults rely on acoustic testing. These techniques, being invasive, may result in causing permanent damage to the material, especially if the material is inspected periodically. Non destructive testing has been carried out for different materials since long. In this regard, non-invasive systems were developed based on infrared thermometry principle to identify the faults in artworks. The test artwork is heated and the thermal response of the different layers is captured with the help of a thermal infrared camera. However, prolonged heating risks overheating and thus causing damage to artworks and an alternate approach is to use pseudo-random binary sequence excitations. The faults in the artwork, though, cannot be detected on the captured images, especially if their strength is weak. The weaker faults are either masked by the stronger ones, by the pictorial layer of the artwork or by the non-uniform heating. This work addresses the detection and localization of the faults through a wavelet based subspace decomposition scheme. The proposed scheme, on one hand, allows to remove the background while, on the other hand, removes the undesired high frequency noise. It is shown that the detection parameter is proportional to the diameter and the depth of the fault. A criterion is proposed to select the optimal wavelet basis along with suitable level selection for wavelet decomposition and reconstruction. The proposed approach is tested on a laboratory developed test sample with known fault locations and dimensions as well as real artworks. A comparison with a previously reported method demonstrates the efficacy of the proposed approach for fault detection in artworks.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 02:10:48 GMT" } ]
2015-08-26T00:00:00
[ [ "Ahmad", "Muhammad Zubair", "" ], [ "Khan", "Amir Ali", "" ], [ "Mezghani", "Sihem", "" ], [ "Perrin", "Eric", "" ], [ "Mouhoubi", "Kamel", "" ], [ "Bodnar", "Jean-Luc", "" ], [ "Vrabie", "Valeriu", "" ] ]
new_dataset
0.996221
1508.06056
Tanmay Biswas
Tanmay Biswas, Sudhindu Bikash Mandal, Debasree Saha, Amlan Chakrabarti
A Novel Reconfigurable Hardware Design for Speech Enhancement Based on Multi-Band Spectral Subtraction Involving Magnitude and Phase Components
Yet to be published (manuscript)
null
null
null
cs.SD cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper proposes an efficient reconfigurable hardware design for speech enhancement based on multi band spectral subtraction algorithm and involving both magnitude and phase components. Our proposed design is novel as it estimates environmental noise from speech adaptively utilizing both magnitude and phase components of the speech spectrum. We performed multi-band spectrum subtraction by dividing the noisy speech spectrum into different non-uniform frequency bands having varying signal to noise ratio (SNR) and subtracting the estimated noise from each of these frequency bands. This results to the elimination of noise from both high SNR and low SNR signal components for all the frequency bands. We have coined our proposed speech enhancement technique as Multi Band Magnitude Phase Spectral Subtraction (MBMPSS). The magnitude and phase operations are executed concurrently exploiting the parallel logic blocks of Field Programmable Gate Array (FPGA), thus increasing the throughput of the system to a great extent. We have implemented our design on Spartan6 Lx45 FPGA and presented the implementation result in terms of resource utilization and delay information for the different blocks of our design. To the best of our best knowledge, this is a new type of hardware design for speech enhancement application and also a first of its kind implementation on reconfigurable hardware. We have used benchmark audio data for the evaluation of the proposed hardware and the experimental results show that our hardware shows a better SNR value compared to the existing state of the art research works.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 08:02:38 GMT" } ]
2015-08-26T00:00:00
[ [ "Biswas", "Tanmay", "" ], [ "Mandal", "Sudhindu Bikash", "" ], [ "Saha", "Debasree", "" ], [ "Chakrabarti", "Amlan", "" ] ]
new_dataset
0.998357
1508.06069
Leon Abdillah
Muhammad Ilham Daniel, Leon Andretti Abdillah, Kiky Rizky Nova Wardani
Evaluasi Celah Keamanan Web Server pada LPSE Kota Palembang
6 pages, presented at the Student Colloquium Sistem Informasi & Teknik Informatika (SC-SITI) 2015, Palembang, 2015
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Along the development of information technology systems among the public at large, also develops information systems to facilitate the public to access and search for information in the form of a website. Electronic Procurement Service (LPSE) Palembang is a business unit set up to organize the service system of government procurement of goods or services electronically. And to allow companies or providers that want to follow the procurement of goods or services, LPSE providing a website that can be accessed from anywhere so the company or provider to follow the procurement of goods or services without having to come to the office LPSE. In the management of its website, LPSE Palembang has its own web server so that the need to consider the existing security system on the web server. Web servers often become the target of attacks by an attacker. This study is set to test the security system of the web server to find out if a web server is secure or not of the crime committed by an attacker. This research involves penetration testing with multiple applications. The results show some holes and suggestions.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 08:50:59 GMT" } ]
2015-08-26T00:00:00
[ [ "Daniel", "Muhammad Ilham", "" ], [ "Abdillah", "Leon Andretti", "" ], [ "Wardani", "Kiky Rizky Nova", "" ] ]
new_dataset
0.999676
1508.06119
Mathias Slawik
Mathias Slawik, Beg\"um \.Ilke Zilci, Fabian Knaack and Axel K\"upper
The Open Service Compendium. Business-pertinent Cloud Service Discovery, Assessment, and Selection
14 pages, to be presented at GECON 2015
null
null
null
cs.SE cs.CY cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
When trying to discover, assess, and select cloud services, companies face many challenges, such as fast-moving markets, vast numbers of offerings, and highly ambiguous selection criteria. This publication presents the Open Service Compendium (OSC), an information system which supports businesses in their discovery, assessment and cloud service selection by offering a simple dynamic service description language, business-pertinent vocabularies, as well as matchmaking functionality. It contributes to the state of the art by offering a more practical, mature, simple, and usable approach than related works.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 11:55:04 GMT" } ]
2015-08-26T00:00:00
[ [ "Slawik", "Mathias", "" ], [ "Zilci", "Begüm İlke", "" ], [ "Knaack", "Fabian", "" ], [ "Küpper", "Axel", "" ] ]
new_dataset
0.998758
1508.06121
Vitaly Perevoshchikov
Vitaly Perevoshchikov
Weight Assignment Logic
This is the full version of the paper published at DLT 2015
DLT 2015. LNCS, vol. 9168, pp. 413-425. Springer (2015)
10.1007/978-3-319-21500-6_33
null
cs.FL cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight parameters, e.g., the ratio between rewards and costs. We show that this logic is expressively equivalent to unambiguous weighted B\"uchi automata. We also consider an extension of weight assignment logic which is expressively equivalent to nondeterministic weighted B\"uchi automata.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 11:57:31 GMT" } ]
2015-08-26T00:00:00
[ [ "Perevoshchikov", "Vitaly", "" ] ]
new_dataset
0.960674
1508.06171
Changsoo Je
Changsoo Je and Hyung-Min Park
BREN: Body Reflection Essence-Neuter Model for Separation of Reflection Components
4 pages, 4 figures
Optics Letters, Volume 40, Issue 9, pp. 1940-1943, May 1, 2015
10.1364/OL.40.001940
null
cs.CV cs.GR physics.optics
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We propose a novel reflection color model consisting of body essence and (mixed) neuter, and present an effective method for separating dichromatic reflection components using a single image. Body essence is an entity invariant to interface reflection, and has two degrees of freedom unlike hue and maximum chromaticity. As a result, the proposed method is insensitive to noise and proper for colors around CMY (cyan, magenta, and yellow) as well as RGB (red, green, and blue), contrary to the maximum chromaticity-based methods. Interface reflection is separated by using a Gaussian function, which removes a critical thresholding problem. Furthermore, the method does not require any region segmentation. Experimental results show the efficacy of the proposed model and method.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 14:47:18 GMT" } ]
2015-08-26T00:00:00
[ [ "Je", "Changsoo", "" ], [ "Park", "Hyung-Min", "" ] ]
new_dataset
0.974728
1508.06181
Changsoo Je
Changsoo Je, Min Tang, Youngeun Lee, Minkyoung Lee, Young J. Kim
PolyDepth: Real-time Penetration Depth Computation using Iterative Contact-Space Projection
Presented in ACM SIGGRAPH 2012. 15 pages, 23 figures
ACM Transactions on Graphics (ToG 2012), Volume 31, Issue 1, Article 5, pp. 1-14, January 1, 2012
10.1145/2077341.2077346
null
cs.GR cs.CG cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find an initial collision-free configuration using several methods such as centroid difference, maximally clear configuration, motion coherence, random configuration, and sampling-based search. We project this configuration on to a local contact space using a variant of continuous collision detection algorithm and construct a linear convex cone around the projected configuration. We then formulate a new projection of the in-collision configuration onto the convex cone as a Linear Complementarity Problem (LCP), which we solve using a type of Gauss-Seidel iterative algorithm. We repeat this procedure until a locally optimal PD is obtained. Our algorithm can process complicated models consisting of tens of thousands triangles at interactive rates.
[ { "version": "v1", "created": "Tue, 25 Aug 2015 15:01:47 GMT" } ]
2015-08-26T00:00:00
[ [ "Je", "Changsoo", "" ], [ "Tang", "Min", "" ], [ "Lee", "Youngeun", "" ], [ "Lee", "Minkyoung", "" ], [ "Kim", "Young J.", "" ] ]
new_dataset
0.998894
1508.05648
Tao Han
Nirwan Ansari and Tao Han
FreeNet: Spectrum and Energy Harvesting Wireless Networks
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The dramatic mobile data traffic growth is not only resulting in the spectrum crunch but is also leading to exorbitant energy consumption. It is thus desirable to liberate mobile and wireless networks from the constraint of the spectrum scarcity and to rein in the growing energy consumption. This article introduces FreeNet, figuratively synonymous to "Free Network", which engineers the spectrum and energy harvesting techniques to alleviate the spectrum and energy constraints by sensing and harvesting spare spectrum for data communications and utilizing renewable energy as power supplies, respectively. Hence, FreeNet increases the spectrum and energy efficiency of wireless networks and enhances the network availability. As a result, FreeNet can be deployed to alleviate network congestion in urban areas, provision broadband services in rural areas, and upgrade emergency communication capacity. This article provides a brief analysis of the design of FreeNet that accommodates the dynamics of the spare spectrum and employs renewable energy.
[ { "version": "v1", "created": "Sun, 23 Aug 2015 19:34:35 GMT" } ]
2015-08-25T00:00:00
[ [ "Ansari", "Nirwan", "" ], [ "Han", "Tao", "" ] ]
new_dataset
0.999352
1508.05657
Oliver Knill
Oliver Knill
A Sard theorem for graph theory
30 pages, 8 figures
null
null
null
cs.DM cs.CG math.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple graphs for which every unit sphere is a d-sphere, the zero locus of (f-c) is a (d-1)-graph for all c different from the range of f. If this Sard lemma is inductively applied to an ordered list functions f_1,...,f_k in which the functions are extended on the level surfaces, the set of critical values (c_1,...,c_k) for which F-c=0 is not a (d-k)-graph is a finite set. This discrete Sard result allows to construct explicit graphs triangulating a given algebraic set. We also look at a second setup: for a function F from the vertex set to R^k, we give conditions for which the simultaneous discrete algebraic set { F=c } defined as the set of simplices of dimension in {k, k+1,...,n} on which all f_i change sign, is a (d-k)-graph in the barycentric refinement of G. This maximal rank condition is adapted from the continuum and the graph { F=c } is a (n-k)-graph. While now, the critical values can have positive measure, we are closer to calculus: for k=2 for example, extrema of functions f under a constraint {g=c} happen at points, where the gradients of f and g are parallel D f = L D g, the Lagrange equations on the discrete network. As for an application, we illustrate eigenfunctions of geometric graphs and especially the second eigenvector of 3-spheres, which by Courant-Fiedler has exactly two nodal regions. The separating nodal surface of the second eigenfunction f_2 belonging to the smallest nonzero eigenvalue always appears to be a 2-sphere in experiments if G is a 3-sphere.
[ { "version": "v1", "created": "Sun, 23 Aug 2015 20:36:19 GMT" } ]
2015-08-25T00:00:00
[ [ "Knill", "Oliver", "" ] ]
new_dataset
0.999237
1508.05683
Siqi Liu
Siqi Liu, Sidong Liu, Sonia Pujol, Ron Kikinis, Dagan Feng, Michael Fulham, Weidong Cai
Morphometry-Based Longitudinal Neurodegeneration Simulation with MR Imaging
6 pages, 3 figures, preprint for journal publication
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a longitudinal MR simulation framework which simulates the future neurodegenerative progression by outputting the predicted follow-up MR image and the voxel-based morphometry (VBM) map. This framework expects the patients to have at least 2 historical MR images available. The longitudinal and cross-sectional VBM maps are extracted to measure the affinity between the target subject and the template subjects collected for simulation. Then the follow-up simulation is performed by resampling the latest available target MR image with a weighted sum of non-linear transformations derived from the best-matched templates. The leave-one-out strategy was used to compare different simulation methods. Compared to the state-of-the-art voxel-based method, our proposed morphometry-based simulation achieves better accuracy in most cases.
[ { "version": "v1", "created": "Mon, 24 Aug 2015 01:54:54 GMT" } ]
2015-08-25T00:00:00
[ [ "Liu", "Siqi", "" ], [ "Liu", "Sidong", "" ], [ "Pujol", "Sonia", "" ], [ "Kikinis", "Ron", "" ], [ "Feng", "Dagan", "" ], [ "Fulham", "Michael", "" ], [ "Cai", "Weidong", "" ] ]
new_dataset
0.977933
1508.05784
Patrizio Angelini
Patrizio Angelini and Till Bruckdorfer and Michael Kaufmann and Tamara Mchedlidze
A Universal Point Set for 2-Outerplanar Graphs
23 pages, 11 figures, conference version at GD 2015
null
null
null
cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the existence of a sub-quadratic universal point set for them is one of the most fascinating open problems in Graph Drawing. Motivated by the fact that outerplanarity is a key property for the existence of small universal point sets, we study 2-outerplanar graphs and provide for them a universal point set of size $O(n \log n)$.
[ { "version": "v1", "created": "Mon, 24 Aug 2015 12:36:48 GMT" } ]
2015-08-25T00:00:00
[ [ "Angelini", "Patrizio", "" ], [ "Bruckdorfer", "Till", "" ], [ "Kaufmann", "Michael", "" ], [ "Mchedlidze", "Tamara", "" ] ]
new_dataset
0.973731
1508.05812
Arkaitz Zubiaga
Arkaitz Zubiaga
Euskahaldun: Euskararen Aldeko Martxa Baten Sare Sozialetako Islaren Bilketa eta Analisia
in Basque
null
null
null
cs.SI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This work is motivated by the dearth of research that deals with social media content created from the Basque Country or written in Basque language. While social fingerprints during events have been analysed in numerous other locations and languages, this article aims to fill this gap so as to initiate a much-needed research area within the Basque scientific community. To this end, we describe the methodology we followed to collect tweets posted during the quintessential exhibition race in support of the Basque language. We also present the results of the analysis of these tweets. Our analysis shows that the most eventful moments lead to spikes in tweeting activity, producing more tweets. Furthermore, we emphasize the importance of having an official account for the event in question, which helps improve the visibility of the event in the social network as well as the dissemination of information to the Basque community. Along with the official account, journalists and news organisations play a crucial role in the diffusion of information.
[ { "version": "v1", "created": "Sat, 11 Jul 2015 12:17:08 GMT" } ]
2015-08-25T00:00:00
[ [ "Zubiaga", "Arkaitz", "" ] ]
new_dataset
0.999433
1508.05822
Hardeep
Hardeep, Parminder Singh
Andriod Based Punjabi TTS System
5 pages,3 Figures and 1 Table Published with International Journal of Computer Science Trends and Technology (IJCST)
International Journal of Computer Science Trends and Technology (IJCST) V3(3): Page(233-237) May-Jun 2015. ISSN: 2347-8578
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The usage of mobile phones is nearly 3.5 times more than that of personal computers. Android has the largest share among its counter parts like IOS, Windows and Symbian Android applications have a very few restrictions on them. TTS systems on Android are available for many languages but a very few systems of this type are available for Punjabi language. Our research work had the aim to develop an application that will be able to produce synthetic Punjabi speech. The paper examines the methodology used to develop speech synthesis TTS system for the Punjabi content, which is written in Gurmukhi script. For the development of this system, we use concatenative speech synthesis method with phonemes as the basic units of concatenation. Some challenges like application size, processing time, must be considered, while porting this TTS system to resource-limited devices like mobile phones.
[ { "version": "v1", "created": "Sat, 27 Jun 2015 13:28:18 GMT" } ]
2015-08-25T00:00:00
[ [ "Hardeep", "", "" ], [ "Singh", "Parminder", "" ] ]
new_dataset
0.999565
1508.05326
Samuel Bowman
Samuel R. Bowman, Gabor Angeli, Christopher Potts, and Christopher D. Manning
A large annotated corpus for learning natural language inference
To appear at EMNLP 2015. The data will be posted shortly before the conference (the week of 14 Sep) at http://nlp.stanford.edu/projects/snli/
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Understanding entailment and contradiction is fundamental to understanding natural language, and inference about entailment and contradiction is a valuable testing ground for the development of semantic representations. However, machine learning research in this area has been dramatically limited by the lack of large-scale resources. To address this, we introduce the Stanford Natural Language Inference corpus, a new, freely available collection of labeled sentence pairs, written by humans doing a novel grounded task based on image captioning. At 570K pairs, it is two orders of magnitude larger than all other resources of its type. This increase in scale allows lexicalized classifiers to outperform some sophisticated existing entailment models, and it allows a neural network-based model to perform competitively on natural language inference benchmarks for the first time.
[ { "version": "v1", "created": "Fri, 21 Aug 2015 16:17:01 GMT" } ]
2015-08-24T00:00:00
[ [ "Bowman", "Samuel R.", "" ], [ "Angeli", "Gabor", "" ], [ "Potts", "Christopher", "" ], [ "Manning", "Christopher D.", "" ] ]
new_dataset
0.995122
1508.05344
Hongwei Zhang
Rajit Johri, Jayanthi Rao, Hai Yu, Hongwei Zhang
A Multi-Scale Spatiotemporal Perspective of Connected and Automated Vehicles: Applications and Wireless Networking
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Wireless communication is a basis of the vision of connected and automated vehicles (CAVs). Given the heterogeneity of both wireless communication technologies and CAV applications, one question that is critical to technology road-mapping and policy making is which communication technology is more suitable for a specific CAV application. Focusing on the technical aspect of this question, we present a multi-scale spatiotemporal perspective of wireless communication technologies as well as canonical CAV applications in active safety, fuel economy and emission control, vehicle automation, and vehicular infotainment. Our analysis shows that CAV applications in the regime of small spatiotemporal scale communication requirements are best supported by V2V communications, applications in the regime of large spatiotemporal scale communication requirements are better supported by cellular communications, and applications in the regime of small spatial scale but medium-to-large temporal scale can be supported by both V2V and cellular communications and provide the opportunity of leveraging heterogeneous communication resources.
[ { "version": "v1", "created": "Fri, 21 Aug 2015 18:14:11 GMT" } ]
2015-08-24T00:00:00
[ [ "Johri", "Rajit", "" ], [ "Rao", "Jayanthi", "" ], [ "Yu", "Hai", "" ], [ "Zhang", "Hongwei", "" ] ]
new_dataset
0.996044
1501.06419
Diego Mirandola
Diego Mirandola and Gilles Z\'emor
Critical pairs for the Product Singleton Bound
null
Information Theory, IEEE Transactions on (Volume:61 , Issue: 9 ), 2015
10.1109/TIT.2015.2450207
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We characterize Product-MDS pairs of linear codes, i.e.\ pairs of codes $C,D$ whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions $\dim C, \dim D$. We prove in particular, for $C=D$, that if the square of the code $C$ has minimum distance at least $2$, and $(C,C)$ is a Product-MDS pair, then either $C$ is a generalized Reed-Solomon code, or $C$ is a direct sum of self-dual codes. In passing we establish coding-theory analogues of classical theorems of additive combinatorics.
[ { "version": "v1", "created": "Mon, 26 Jan 2015 14:48:04 GMT" }, { "version": "v2", "created": "Thu, 20 Aug 2015 10:09:01 GMT" } ]
2015-08-21T00:00:00
[ [ "Mirandola", "Diego", "" ], [ "Zémor", "Gilles", "" ] ]
new_dataset
0.971238
1508.04785
KuanTing Chen
KuanTing Chen, Kezhen Chen, Peizhong Cong, Winston H. Hsu, Jiebo Luo
Who are the Devils Wearing Prada in New York City?
null
null
10.1145/2733373.2809930
null
cs.CV cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Fashion is a perpetual topic in human social life, and the mass has the penchant to emulate what large city residents and celebrities wear. Undeniably, New York City is such a bellwether large city with all kinds of fashion leadership. Consequently, to study what the fashion trends are during this year, it is very helpful to learn the fashion trends of New York City. Discovering fashion trends in New York City could boost many applications such as clothing recommendation and advertising. Does the fashion trend in the New York Fashion Show actually influence the clothing styles on the public? To answer this question, we design a novel system that consists of three major components: (1) constructing a large dataset from the New York Fashion Shows and New York street chic in order to understand the likely clothing fashion trends in New York, (2) utilizing a learning-based approach to discover fashion attributes as the representative characteristics of fashion trends, and (3) comparing the analysis results from the New York Fashion Shows and street-chic images to verify whether the fashion shows have actual influence on the people in New York City. Through the preliminary experiments over a large clothing dataset, we demonstrate the effectiveness of our proposed system, and obtain useful insights on fashion trends and fashion influence.
[ { "version": "v1", "created": "Wed, 19 Aug 2015 20:28:31 GMT" } ]
2015-08-21T00:00:00
[ [ "Chen", "KuanTing", "" ], [ "Chen", "Kezhen", "" ], [ "Cong", "Peizhong", "" ], [ "Hsu", "Winston H.", "" ], [ "Luo", "Jiebo", "" ] ]
new_dataset
0.995853
1508.04856
EPTCS
C\'esar Santos (Lasige, Faculty of Sciences, University of Lisbon, Portugal), Francisco Martins (Lasige, Faculty of Sciences, University of Lisbon, Portugal), Vasco Thudichum Vasconcelos (Lasige, Faculty of Sciences, University of Lisbon, Portugal)
Deductive Verification of Parallel Programs Using Why3
In Proceedings ICE 2015, arXiv:1508.04595
EPTCS 189, 2015, pp. 128-142
10.4204/EPTCS.189.11
null
cs.PL cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Message Passing Interface specification (MPI) defines a portable message-passing API used to program parallel computers. MPI programs manifest a number of challenges on what concerns correctness: sent and expected values in communications may not match, resulting in incorrect computations possibly leading to crashes; and programs may deadlock resulting in wasted resources. Existing tools are not completely satisfactory: model-checking does not scale with the number of processes; testing techniques wastes resources and are highly dependent on the quality of the test set. As an alternative, we present a prototype for a type-based approach to programming and verifying MPI like programs against protocols. Protocols are written in a dependent type language designed so as to capture the most common primitives in MPI, incorporating, in addition, a form of primitive recursion and collective choice. Protocols are then translated into Why3, a deductive software verification tool. Source code, in turn, is written in WhyML, the language of the Why3 platform, and checked against the protocol. Programs that pass verification are guaranteed to be communication safe and free from deadlocks. We verified several parallel programs from textbooks using our approach, and report on the outcome.
[ { "version": "v1", "created": "Thu, 20 Aug 2015 01:43:19 GMT" } ]
2015-08-21T00:00:00
[ [ "Santos", "César", "", "Lasige, Faculty of Sciences, University of Lisbon,\n Portugal" ], [ "Martins", "Francisco", "", "Lasige, Faculty of Sciences, University of\n Lisbon, Portugal" ], [ "Vasconcelos", "Vasco Thudichum", "", "Lasige, Faculty of Sciences,\n University of Lisbon, Portugal" ] ]
new_dataset
0.98945
1508.04977
Tobias Kuhn
Tobias Kuhn
nanopub-java: A Java Library for Nanopublications
Proceedings of 5th Workshop on Linked Science 2015
null
null
null
cs.DL
http://creativecommons.org/licenses/by/4.0/
The concept of nanopublications was first proposed about six years ago, but it lacked openly available implementations. The library presented here is the first one that has become an official implementation of the nanopublication community. Its core features are stable, but it also contains unofficial and experimental extensions: for publishing to a decentralized server network, for defining sets of nanopublications with indexes, for informal assertions, and for digitally signing nanopublications. Most of the features of the library can also be accessed via an online validator interface.
[ { "version": "v1", "created": "Thu, 20 Aug 2015 13:32:20 GMT" } ]
2015-08-21T00:00:00
[ [ "Kuhn", "Tobias", "" ] ]
new_dataset
0.997501
1508.05021
Tie (Tony) Luo
Ramgopal Venkat, Thirumoorthy Divagar, Tie Luo, and Hwee Pink Tan
Participatory Sensing for Government-Centric Applications: A Singapore Case Study
null
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Singapore, an urbanized and populated country with high penetration of smartphones, provides an excellent base for citizen-centric participatory sensing applications. Mobile participatory sensing applications offer an efficient means of directing feedback to government agencies for timely identifying and solving problems of citizens' concern. While real deployments of such applications are on an uprising trend in Singapore, there is no concerted effort that studies the {\em user experience} of these applications. To fill this gap, we conduct a market study by analyzing the user reviews on the Google Play and Apple App Store for six major mobile crowdsourcing applications created by Singapore government agencies. This study was carried out for a period of 4 months during which we collected and analyzed 592 customer reviews. This was also supplemented by our personal use of the applications during the same period. This paper presents the methodology and findings of this study, as well as our recommendations of what improvements that these applications could incorporate. We classify user reviews into 8 major concerns, and recommend 9 features to enhance the applications' utility. The recommendations are presented in terms of user interface, incentive, and publicity.
[ { "version": "v1", "created": "Thu, 20 Aug 2015 15:57:01 GMT" } ]
2015-08-21T00:00:00
[ [ "Venkat", "Ramgopal", "" ], [ "Divagar", "Thirumoorthy", "" ], [ "Luo", "Tie", "" ], [ "Tan", "Hwee Pink", "" ] ]
new_dataset
0.973266