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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1403.3969
|
Bernhard von Stengel
|
Rahul Savani, Bernhard von Stengel
|
Game Theory Explorer - Software for the Applied Game Theorist
| null |
Computational Management Science 12:1, 5-33 (2015)
|
10.1007/s10287-014-0206-x
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the "Game Theory Explorer" software tool to create and
analyze games as models of strategic interaction. A game in extensive or
strategic form is created and nicely displayed with a graphical user interface
in a web browser. State-of-the-art algorithms then compute all Nash equilibria
of the game after a mouseclick. In tutorial fashion, we present how the program
is used, and the ideas behind its main algorithms. We report on experiences
with the architecture of the software and its development as an open-source
project.
|
[
{
"version": "v1",
"created": "Sun, 16 Mar 2014 22:28:32 GMT"
}
] | 2015-01-07T00:00:00 |
[
[
"Savani",
"Rahul",
""
],
[
"von Stengel",
"Bernhard",
""
]
] |
new_dataset
| 0.964161 |
1501.01039
|
Jack Peterson
|
Joseph Krug and Jack Peterson
|
Sidecoin: a snapshot mechanism for bootstrapping a blockchain
|
3 pages
| null |
10.13140/2.1.4577.1841
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sidecoin is a mechanism that allows a snapshot to be taken of Bitcoin's
blockchain. We compile a list of Bitcoin's unspent transaction outputs, then
use these outputs and their corresponding balances to bootstrap a new
blockchain. This allows the preservation of Bitcoin's economic state in the
context of a new blockchain, which may provide new features and technical
innovations.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2015 23:48:06 GMT"
}
] | 2015-01-07T00:00:00 |
[
[
"Krug",
"Joseph",
""
],
[
"Peterson",
"Jack",
""
]
] |
new_dataset
| 0.995092 |
1501.01075
|
Omar Abuzaghleh
|
Omar Abuzaghleh, Miad Faezipour and Buket D. Barkana
|
Skincure: An Innovative Smart Phone-Based Application To Assist In
Melanoma Early Detection And Prevention
|
appears in Signal & Image Processing : An International Journal
(SIPIJ) Vol.5, No.6, December 2014
| null |
10.5121/sipij.2014.5601
| null |
cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Melanoma spreads through metastasis, and therefore it has been proven to be
very fatal. Statistical evidence has revealed that the majority of deaths
resulting from skin cancer are as a result of melanoma. Further investigations
have shown that the survival rates in patients depend on the stage of the
infection; early detection and intervention of melanoma implicates higher
chances of cure. Clinical diagnosis and prognosis of melanoma is challenging
since the processes are prone to misdiagnosis and inaccuracies due to doctors
subjectivity. This paper proposes an innovative and fully functional
smart-phone based application to assist in melanoma early detection and
prevention. The application has two major components; the first component is a
real-time alert to help users prevent skin burn caused by sunlight; a novel
equation to compute the time for skin to burn is thereby introduced. The second
component is an automated image analysis module which contains image
acquisition, hair detection and exclusion, lesion segmentation, feature
extraction, and classification. The proposed system exploits PH2 Dermoscopy
image database from Pedro Hispano Hospital for development and testing
purposes. The image database contains a total of 200 dermoscopy images of
lesions, including normal, atypical, and melanoma cases. The experimental
results show that the proposed system is efficient, achieving classification of
the normal, atypical and melanoma images with accuracy of 96.3%, 95.7% and
97.5%, respectively.
|
[
{
"version": "v1",
"created": "Tue, 6 Jan 2015 04:19:55 GMT"
}
] | 2015-01-07T00:00:00 |
[
[
"Abuzaghleh",
"Omar",
""
],
[
"Faezipour",
"Miad",
""
],
[
"Barkana",
"Buket D.",
""
]
] |
new_dataset
| 0.997625 |
1501.01083
|
Mohana S H
|
S.H. Mohana, C.J. Prabhakar
|
Stem-Calyx Recognition of an Apple using Shape Descriptors
|
15 pages, 10 figures and 2 tables in Signal & Image Processing : An
International Journal (SIPIJ) Vol.5, No.6, December 2014
| null |
10.5121/sipij.2014.5602
| null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents a novel method to recognize stem - calyx of an apple
using shape descriptors. The main drawback of existing apple grading techniques
is that stem - calyx part of an apple is treated as defects, this leads to poor
grading of apples. In order to overcome this drawback, we proposed an approach
to recognize stem-calyx and differentiated from true defects based on shape
features. Our method comprises of steps such as segmentation of apple using
grow-cut method, candidate objects such as stem-calyx and small defects are
detected using multi-threshold segmentation. The shape features are extracted
from detected objects using Multifractal, Fourier and Radon descriptor and
finally stem-calyx regions are recognized and differentiated from true defects
using SVM classifier. The proposed algorithm is evaluated using experiments
conducted on apple image dataset and results exhibit considerable improvement
in recognition of stem-calyx region compared to other techniques.
|
[
{
"version": "v1",
"created": "Tue, 6 Jan 2015 05:51:23 GMT"
}
] | 2015-01-07T00:00:00 |
[
[
"Mohana",
"S. H.",
""
],
[
"Prabhakar",
"C. J.",
""
]
] |
new_dataset
| 0.998627 |
1501.01109
|
Md. Abdullah- Al-Mashud Mashud
|
M.A.A. Mashud, M. R. Hossain, Mustari Zaman and M.A. Razzaque
|
PC Guided Automatic Vehicle System
|
10 pages, International Journal on Cybernetics & Informatics
(IJCI);2014
| null |
10.5121/ijci.2014.3601
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main objective of this paper is to design and develop an automatic
vehicle, fully controlled by a computer system. The vehicle designed in the
present work can move in a pre-determined path and work automatically without
the need of any human operator and it also controlled by human operator. Such a
vehicle is capable of performing wide variety of difficult tasks in space
research, domestic, scientific and industrial fields. For this purpose, an IBM
compatible PC with Pentium microprocessor has been used which performed the
function of the system controller. Its parallel printer port has been used as
data communication port to interface the vehicle. A suitable software program
has been developed for the system controller to send commands to the vehicle.
|
[
{
"version": "v1",
"created": "Tue, 6 Jan 2015 08:27:46 GMT"
}
] | 2015-01-07T00:00:00 |
[
[
"Mashud",
"M. A. A.",
""
],
[
"Hossain",
"M. R.",
""
],
[
"Zaman",
"Mustari",
""
],
[
"Razzaque",
"M. A.",
""
]
] |
new_dataset
| 0.986432 |
1402.1732
|
Christian Franck
|
Christian Franck
|
Dining Cryptographers with 0.924 Verifiable Collision Resolution
|
11 pages, 3 figures
|
Annales UMCS, Informatica. Volume 14, Issue 1, Pages 49-59, ISSN
(Online) 2083-3628, October 2014
|
10.2478/umcsinfo-2014-0007
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dining cryptographers protocol implements a multiple access channel in
which senders and recipients are anonymous. A problem is that a malicious
participant can disrupt communication by deliberately creating collisions. We
propose a computationally secure dining cryptographers protocol with collision
resolution that achieves a maximum stable throughput of 0.924 messages per
round and which allows to easily detect disruptors.
|
[
{
"version": "v1",
"created": "Fri, 7 Feb 2014 18:53:40 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Jun 2014 15:27:13 GMT"
},
{
"version": "v3",
"created": "Sat, 3 Jan 2015 21:06:50 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Franck",
"Christian",
""
]
] |
new_dataset
| 0.973038 |
1402.2269
|
Christian Franck
|
Christian Franck, Jeroen van de Graaf
|
Dining Cryptographers are Practical
|
12 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dining cryptographers protocol provides information-theoretically secure
sender and recipient untraceability. However, the protocol is considered to be
impractical because a malicious participant may disrupt the communication. We
propose an implementation which provides information-theoretical security for
senders and recipients, and in which a disruptor with limited computational
capabilities can easily be detected.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 20:57:37 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jun 2014 18:08:59 GMT"
},
{
"version": "v3",
"created": "Sat, 3 Jan 2015 21:41:00 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Franck",
"Christian",
""
],
[
"van de Graaf",
"Jeroen",
""
]
] |
new_dataset
| 0.958484 |
1410.4145
|
Shadman Sakib
|
Shadman Sakib, Anik Chowdhury, Shekh Tanvir Ahamed and Syed Imam Hasan
|
Maze solving Algorithm for line following robot and derivation of linear
path distance from nonlinear path
|
Published in the Proceedings of 16th International Conference on
Computer and Information Technology, Khulna, Bangladesh
| null |
10.1109/ICCITechn.2014.6997314
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have discussed a unique general algorithm for exploring and
solving any kind of line maze with another simple one for simple mazes without
loops or loops having highest two branches none of which are inward. For the
general algorithm, we need a method to map the whole maze, which is required if
the maze is complex. The proposed maze mapping system is based on coordinate
system and after mapping the whole maze as a graph in standard 'Adjacency-list
representation' method, shortest path and shortest time path was extracted
using Dijkstra's algorithm. In order to find the coordinates of the turning
points and junctions, linear distance between the points are needed, for which
wheel encoder was used. However, due to non-linear movement of robot, the
directly measured distance from the encoder has some error and to remove this
error an idea is built up which ended by deriving equations that gives us
almost exact linear distance between two points from the reading of wheel
encoder of the robot moving in a non-linear path.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 17:30:56 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Jan 2015 09:58:31 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Sakib",
"Shadman",
""
],
[
"Chowdhury",
"Anik",
""
],
[
"Ahamed",
"Shekh Tanvir",
""
],
[
"Hasan",
"Syed Imam",
""
]
] |
new_dataset
| 0.991165 |
1411.6574
|
David Pastor-Escuredo
|
David Pastor-Escuredo, Alfredo Morales-Guzm\'an, Yolanda
Torres-Fern\'andez, Jean-Martin Bauer, Amit Wadhwa, Carlos Castro-Correa,
Liudmyla Romanoff, Jong Gun Lee, Alex Rutherford, Vanessa Frias-Martinez,
Nuria Oliver, Enrique Frias-Martinez, Miguel Luengo-Oroz
|
Flooding through the lens of mobile phone activity
|
Submitted to IEEE Global Humanitarian Technologies Conference (GHTC)
2014
|
IEEE Global Humanitarian Technology Conference (GHTC), 2014 IEEE
(pp. 279-286)
|
10.1109/GHTC.2014.6970293
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Natural disasters affect hundreds of millions of people worldwide every year.
Emergency response efforts depend upon the availability of timely information,
such as information concerning the movements of affected populations. The
analysis of aggregated and anonymized Call Detail Records (CDR) captured from
the mobile phone infrastructure provides new possibilities to characterize
human behavior during critical events. In this work, we investigate the
viability of using CDR data combined with other sources of information to
characterize the floods that occurred in Tabasco, Mexico in 2009. An impact map
has been reconstructed using Landsat-7 images to identify the floods. Within
this frame, the underlying communication activity signals in the CDR data have
been analyzed and compared against rainfall levels extracted from data of the
NASA-TRMM project. The variations in the number of active phones connected to
each cell tower reveal abnormal activity patterns in the most affected
locations during and after the floods that could be used as signatures of the
floods - both in terms of infrastructure impact assessment and population
information awareness. The representativeness of the analysis has been assessed
using census data and civil protection records. While a more extensive
validation is required, these early results suggest high potential in using
cell tower activity information to improve early warning and emergency
management mechanisms.
|
[
{
"version": "v1",
"created": "Mon, 24 Nov 2014 19:01:39 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Pastor-Escuredo",
"David",
""
],
[
"Morales-Guzmán",
"Alfredo",
""
],
[
"Torres-Fernández",
"Yolanda",
""
],
[
"Bauer",
"Jean-Martin",
""
],
[
"Wadhwa",
"Amit",
""
],
[
"Castro-Correa",
"Carlos",
""
],
[
"Romanoff",
"Liudmyla",
""
],
[
"Lee",
"Jong Gun",
""
],
[
"Rutherford",
"Alex",
""
],
[
"Frias-Martinez",
"Vanessa",
""
],
[
"Oliver",
"Nuria",
""
],
[
"Frias-Martinez",
"Enrique",
""
],
[
"Luengo-Oroz",
"Miguel",
""
]
] |
new_dataset
| 0.973394 |
1412.5512
|
Tara Brough
|
Tara Brough, Laura Ciobanu and Murray Elder
|
Permutations of context-free and indexed languages
|
13 pages, 5 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the cyclic closure of a language, and its generalisation to the
operators $C^k$ introduced by Brandst\"adt. We prove that the cyclic closure of
an indexed language is indexed, and that if $L$ is a context-free language then
$C^k(L)$ is indexed.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2014 18:32:05 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Jan 2015 23:27:18 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Brough",
"Tara",
""
],
[
"Ciobanu",
"Laura",
""
],
[
"Elder",
"Murray",
""
]
] |
new_dataset
| 0.977561 |
1501.00512
|
Massimiliano Dal Mas
|
Massimiliano Dal Mas
|
Function of Forgetfulness for the Tedium of Oblivion on Liquidity of
Ontology Matching
|
4 pages, 1 figure; for details see: http://www.maxdalmas.com
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The shallow and fragile knowledge on the Web does not examine in depth the
things: it behaves lightly. The conditions created by the Web makes our
attention labile and especially fickle, it's unable to concentrate for long as
we are trained to "surf" without going though never in depth. The Web also
brings with it the added advantage of a nearly availability infinite knowledge
but leads to a loss of the ability to retain and evaluate that knowledge within
us increasing forgetfulness of knowledge. In this paper we show how the
"function of forgetfulness" appears linked to tedium and oblivion of knowledge
through the liquidity of ontology matching.
|
[
{
"version": "v1",
"created": "Fri, 2 Jan 2015 23:19:01 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Mas",
"Massimiliano Dal",
""
]
] |
new_dataset
| 0.969715 |
1501.00549
|
David Pastor-Escuredo
|
David Pastor-Escuredo, Thierry Savy and Miguel A. Luengo-Oroz
|
Can Fires, Night Lights, and Mobile Phones reveal behavioral
fingerprints useful for Development?
|
Published in D4D Challenge. NetMob, May 1-3, 2013, MIT
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fires, lights at night and mobile phone activity have been separately used as
proxy indicators of human activity with high potential for measuring human
development. In this preliminary report, we develop some tools and
methodologies to identify and visualize relations among remote sensing datasets
containing fires and night lights information with mobile phone activity in
Cote D'Ivoire from December 2011 to April 2012.
|
[
{
"version": "v1",
"created": "Sat, 3 Jan 2015 09:28:20 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Pastor-Escuredo",
"David",
""
],
[
"Savy",
"Thierry",
""
],
[
"Luengo-Oroz",
"Miguel A.",
""
]
] |
new_dataset
| 0.997617 |
1501.00802
|
Prateek Dewan
|
Prateek Dewan and Ponnurangam Kumaraguru
|
Detecting Malicious Content on Facebook
|
9 figures, 7 tables
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online Social Networks (OSNs) witness a rise in user activity whenever an
event takes place. Malicious entities exploit this spur in user-engagement
levels to spread malicious content that compromises system reputation and
degrades user experience. It also generates revenue from advertisements,
clicks, etc. for the malicious entities. Facebook, the world's biggest social
network, is no exception and has recently been reported to face much abuse
through scams and other type of malicious content, especially during news
making events. Recent studies have reported that spammers earn $200 million
just by posting malicious links on Facebook. In this paper, we characterize
malicious content posted on Facebook during 17 events, and discover that
existing efforts to counter malicious content by Facebook are not able to stop
all malicious content from entering the social graph. Our findings revealed
that malicious entities tend to post content through web and third party
applications while legitimate entities prefer mobile platforms to post content.
In addition, we discovered a substantial amount of malicious content generated
by Facebook pages. Through our observations, we propose an extensive feature
set based on entity profile, textual content, metadata, and URL features to
identify malicious content on Facebook in real time and at zero-hour. This
feature set was used to train multiple machine learning models and achieved an
accuracy of 86.9%. The intent is to catch malicious content that is currently
evading Facebook's detection techniques. Our machine learning model was able to
detect more than double the number of malicious posts as compared to existing
malicious content detection techniques. Finally, we built a real world solution
in the form of a REST based API and a browser plug-in to identify malicious
Facebook posts in real time.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2015 09:55:37 GMT"
}
] | 2015-01-06T00:00:00 |
[
[
"Dewan",
"Prateek",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.994557 |
1401.2248
|
Willi-Hans Steeb WHS
|
Yorick Hardy and Willi-Hans Steeb
|
Boolean Functions, Quantum Gates, Hamilton Operators, Spin Systems and
Computer Algebra
|
title extended, construction of spin system added
| null | null | null |
cs.MS quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the construction of quantum gates (unitary operators) from
boolean functions and give a number of applications. Both non-reversible and
reversible boolean functions are considered. The construction of the Hamilton
operator for a quantum gate is also described with the Hamilton operator
expressed as spin system. Computer algebra implementations are provided.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 08:12:46 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Feb 2014 15:45:36 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Nov 2014 08:10:07 GMT"
},
{
"version": "v4",
"created": "Fri, 2 Jan 2015 11:10:05 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Hardy",
"Yorick",
""
],
[
"Steeb",
"Willi-Hans",
""
]
] |
new_dataset
| 0.998933 |
1402.6771
|
Gao Jian
|
Jian Gao, Yun Gao, Fang-Wei Fu
|
On Linear Codes over $\mathbb{Z}_4+v\mathbb{Z}_4$
|
25 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where
$v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams
identity for the Gray weight enumerator is given. Self-dual codes, construction
of Euclidean isodual codes, unimodular complex lattices, MDS codes and MGDS
codes over $\mathbb{Z}_4+v\mathbb{Z}_4$ are studied. Cyclic codes and quadratic
residue codes are also considered. Finally, some examples for illustrating the
main work are given.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 02:46:46 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Dec 2014 10:05:51 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Gao",
"Jian",
""
],
[
"Gao",
"Yun",
""
],
[
"Fu",
"Fang-Wei",
""
]
] |
new_dataset
| 0.999355 |
1405.3347
|
Gao Jian
|
Jian Gao, XianFang Wang, Fang-Wei Fu
|
Self-dual codes and quadratic residue codes over the ring
$\mathbb{Z}_9+u\mathbb{Z}_9$
|
12 pages. arXiv admin note: substantial text overlap with
arXiv:1402.6771
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new definitions of the Gray weight and the Gray
map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some
results on self-dual codes over this ring are investigated. Further, the
structural properties of quadratic residue codes are also considered. Two
self-dual codes with parameters $[22,11,5]$ and $[24,12,9]$ over $\mathbb{Z}_9$
are obtained.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 02:13:27 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Nov 2014 08:05:59 GMT"
},
{
"version": "v3",
"created": "Wed, 31 Dec 2014 10:00:56 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Gao",
"Jian",
""
],
[
"Wang",
"XianFang",
""
],
[
"Fu",
"Fang-Wei",
""
]
] |
new_dataset
| 0.971253 |
1405.6790
|
Kyatsandra Nagananda
|
K. G. Nagananda, Shalinee Kishore and Rick S. Blum
|
A PMU Scheduling Scheme for Transmission of Synchrophasor Data in
Electric Power Systems
|
9 pages, 6 figures; an extra figure included in the published
version. appears in IEEE Transactions on Smart Grid, Special Issue on Cyber
Physical Systems and Security for Smart Grid, 2015
| null |
10.1109/TSG.2014.2388238
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the proposition to install a large number of phasor measurement units
(PMUs) in the future power grid, it is essential to provide robust
communications infrastructure for phasor data across the network. We make
progress in this direction by devising a simple time division multiplexing
scheme for transmitting phasor data from the PMUs to a central server: Time is
divided into frames and the PMUs take turns to transmit to the control center
within the time frame. The main contribution of this work is a scheduling
policy based on which PMU transmissions are ordered during a time frame.
The scheduling scheme is independent of the approach taken to solve the PMU
placement problem, and unlike strategies devised for conventional
communications, it is intended for the power network since it is fully governed
by the measure of electrical connectedness between buses in the grid. To
quantify the performance of the scheduling scheme, we couple it with a fault
detection algorithm used to detect changes in the susceptance parameters in the
grid. Results demonstrate that scheduling the PMU transmissions leads to an
improved performance of the fault detection scheme compared to PMUs
transmitting at random.
|
[
{
"version": "v1",
"created": "Tue, 27 May 2014 05:29:49 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Dec 2014 15:52:15 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Nagananda",
"K. G.",
""
],
[
"Kishore",
"Shalinee",
""
],
[
"Blum",
"Rick S.",
""
]
] |
new_dataset
| 0.99905 |
1412.8246
|
Shihyen Chen
|
Shihyen Chen, Zhuozhi Wang, Kaizhong Zhang
|
Pattern Matching and Local Alignment for RNA Structures
|
7 pages. V2: changed first names initials to full names in metadata.
V3: added info of conference proceedings, updated email address
|
Proceedings of the 2002 International Conference on Mathematics
and Engineering Techniques in Medicine and Biological Sciences (METMBS),
55-61, 2002
| null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The primary structure of a ribonucleic acid (RNA) molecule can be represented
as a sequence of nucleotides (bases) over the alphabet {A, C, G, U}. The
secondary or tertiary structure of an RNA is a set of base pairs which form
bonds between A-U and G-C. For secondary structures, these bonds have been
traditionally assumed to be one-to-one and non-crossing. This paper considers
pattern matching as well as local alignment between two RNA structures. For
pattern matching, we present two algorithms, one for obtaining an exact match,
the other for approximate match. We then present an algorithm for RNA local
structural alignment.
|
[
{
"version": "v1",
"created": "Mon, 29 Dec 2014 02:23:39 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Dec 2014 06:40:16 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Jan 2015 06:59:26 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Chen",
"Shihyen",
""
],
[
"Wang",
"Zhuozhi",
""
],
[
"Zhang",
"Kaizhong",
""
]
] |
new_dataset
| 0.986596 |
1501.00311
|
Jun Ping Ng
|
Jun-Ping Ng and Min-Yen Kan
|
QANUS: An Open-source Question-Answering Platform
|
6 pages, 3 figures, demo paper describing QANUS
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we motivate the need for a publicly available, generic
software framework for question-answering (QA) systems. We present an
open-source QA framework QANUS which researchers can leverage on to build new
QA systems easily and rapidly. The framework implements much of the code that
will otherwise have been repeated across different QA systems. To demonstrate
the utility and practicality of the framework, we further present a fully
functioning factoid QA system QA-SYS built on top of QANUS.
|
[
{
"version": "v1",
"created": "Thu, 1 Jan 2015 20:51:25 GMT"
}
] | 2015-01-05T00:00:00 |
[
[
"Ng",
"Jun-Ping",
""
],
[
"Kan",
"Min-Yen",
""
]
] |
new_dataset
| 0.990366 |
1412.8544
|
EPTCS
|
Sander Uijlen (Radboud Universiteit), Bas Westerbaan (Radboud
Universiteit)
|
A Kochen-Specker system has at least 22 vectors (extended abstract)
|
In Proceedings QPL 2014, arXiv:1412.8102
|
EPTCS 172, 2014, pp. 154-164
|
10.4204/EPTCS.172.11
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At the heart of the Conway-Kochen Free Will theorem and Kochen and Specker's
argument against non-contextual hidden variable theories is the existence of a
Kochen-Specker (KS) system: a set of points on the sphere that has no
0,1-coloring such that at most one of two orthogonal points are colored 1 and
of three pairwise orthogonal points exactly one is colored 1. In public
lectures, Conway encouraged the search for small KS systems. At the time of
writing, the smallest known KS system has 31 vectors. Arends, Ouaknine and
Wampler have shown that a KS system has at least 18 vectors, by reducing the
problem to the existence of graphs with a topological embeddability and
non-colorability property. The bottleneck in their search proved to be the
sheer number of graphs on more than 17 vertices and deciding embeddability.
Continuing their effort, we prove a restriction on the class of graphs we
need to consider and develop a more practical decision procedure for
embeddability to improve the lower bound to 22.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 03:01:38 GMT"
}
] | 2015-01-03T00:00:00 |
[
[
"Uijlen",
"Sander",
"",
"Radboud Universiteit"
],
[
"Westerbaan",
"Bas",
"",
"Radboud\n Universiteit"
]
] |
new_dataset
| 0.984654 |
1406.2150
|
Kyungchun Lee Prof.
|
Fathurrahman Hilman, Jong-Hyen Baek, Eun-Kyung Chae, and KyungchunLee
|
ML Detection for MIMO Systems under Channel Estimation Errors
|
This paper has been withdrawn by the author due to the erroneous
simulation results of Figs.1-7
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless communication systems, the use of multiple antennas at both the
transmitter and receiver is a widely known method for improving both
reliability and data rates, as it increases the former through transmit or
receive diversity and the latter by spatial multiplexing. In order to detect
signals, channel state information (CSI) is typically required at the receiver;
however, the estimation of CSI is not perfect in practical systems, which
causes performance degradation. In this paper, we propose a novel maximum
likelihood (ML) scheme that is robust to channel information errors. By
assuming a bound on the total power of channel estimation errors, we apply an
optimization method to estimate the instantaneous covariance of channel
estimation errors in order to minimize the ML cost function. To reduce
computational complexity, we also propose an iterative sphere decoding scheme
based on the proposed ML detection method. Simulation results show that the
proposed algorithm provides a performance gain in terms of error probability
relative to existing algorithms.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 12:08:21 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Dec 2014 05:36:42 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Hilman",
"Fathurrahman",
""
],
[
"Baek",
"Jong-Hyen",
""
],
[
"Chae",
"Eun-Kyung",
""
],
[
"KyungchunLee",
"",
""
]
] |
new_dataset
| 0.99662 |
1412.8542
|
EPTCS
|
Kohei Kishida (University of Oxford)
|
Stochastic Relational Presheaves and Dynamic Logic for Contextuality
|
In Proceedings QPL 2014, arXiv:1412.8102
|
EPTCS 172, 2014, pp. 115-132
|
10.4204/EPTCS.172.9
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Presheaf models provide a formulation of labelled transition systems that is
useful for, among other things, modelling concurrent computation. This paper
aims to extend such models further to represent stochastic dynamics such as
shown in quantum systems. After reviewing what presheaf models represent and
what certain operations on them mean in terms of notions such as internal and
external choices, composition of systems, and so on, I will show how to extend
those models and ideas by combining them with ideas from other
category-theoretic approaches to relational models and to stochastic processes.
It turns out that my extension yields a transitional formulation of
sheaf-theoretic structures that Abramsky and Brandenburger proposed to
characterize non-locality and contextuality. An alternative characterization of
contextuality will then be given in terms of a dynamic modal logic of the
models I put forward.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 03:01:14 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Kishida",
"Kohei",
"",
"University of Oxford"
]
] |
new_dataset
| 0.976477 |
1412.8543
|
EPTCS
|
Robin Adams (Radboud University Nijmegen)
|
QPEL: Quantum Program and Effect Language
|
In Proceedings QPL 2014, arXiv:1412.8102
|
EPTCS 172, 2014, pp. 133-153
|
10.4204/EPTCS.172.10
| null |
cs.LO cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the syntax and rules of deduction of QPEL (Quantum Program and
Effect Language), a language for describing both quantum programs, and
properties of quantum programs - effects on the appropriate Hilbert space. We
show how semantics may be given in terms of state-and-effect triangles, a
categorical setting that allows semantics in terms of Hilbert spaces,
C*-algebras, and other categories. We prove soundness and completeness results
that show the derivable judgements are exactly those provable in all
state-and-effect triangles.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 03:01:23 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Adams",
"Robin",
"",
"Radboud University Nijmegen"
]
] |
new_dataset
| 0.997948 |
1412.8545
|
EPTCS
|
Kenta Cho (Radboud University Nijmegen)
|
Semantics for a Quantum Programming Language by Operator Algebras
|
In Proceedings QPL 2014, arXiv:1412.8102
|
EPTCS 172, 2014, pp. 165-190
|
10.4204/EPTCS.172.12
| null |
cs.LO math.OA quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel semantics for a quantum programming language by
operator algebras, which are known to give a formulation for quantum theory
that is alternative to the one by Hilbert spaces. We show that the opposite
category of the category of W*-algebras and normal completely positive
subunital maps is an elementary quantum flow chart category in the sense of
Selinger. As a consequence, it gives a denotational semantics for Selinger's
first-order functional quantum programming language QPL. The use of operator
algebras allows us to accommodate infinite structures and to handle classical
and quantum computations in a unified way.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 03:01:51 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Cho",
"Kenta",
"",
"Radboud University Nijmegen"
]
] |
new_dataset
| 0.993366 |
1412.8561
|
Nidhi Lal
|
Nidhi Kumari Lal, Ashutosh Kumar Singh
|
Modified Design of Microstrip Patch Antenna for WiMAX Communication
System
| null | null |
10.9781/ijimai.2014.315
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new design for U-shaped microstrip patch antenna is
proposed, which can be used in WiMAX communication systems. The aim of this
paper is to optimize the performance of microstrip patch antenna. Nowadays,
WiMAX communication applications are widely using U-shaped microstrip patch
antenna and it has become very popular. Our proposed antenna design uses 4-4.5
GHZ frequency band and it is working at narrowband within this band. RT/DUROID
5880 material is used for creating the substrate of the microstrip antenna.
This modified design of the microstrip patch antenna gives high performance in
terms of gain and return loss.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 04:20:31 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Lal",
"Nidhi Kumari",
""
],
[
"Singh",
"Ashutosh Kumar",
""
]
] |
new_dataset
| 0.998695 |
1412.8639
|
Kyle Pullicino
|
Kyle Pullicino
|
Jif: Language-based Information-flow Security in Java
| null | null | null | null |
cs.PL cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this report, we examine Jif, a Java extension which augments the language
with features related to security. Jif adds support for security labels to
Java's type system such that the developer can specify confidentiality and
integrity policies to the various variables used in their program. We list the
main features of Jif and discuss the information flow problem that Jif helps to
solve. We see how the information flow problem occurs in real-world systems by
looking at two examples: Civitas, a ballot/voting system where voters do not
necessarily trust voting agents, and SIF, a web application container
implemented using Jif. Finally, we implement a small program that simulates
information flow in a booking system containing sensitive data and discuss the
usefulness of Jif based on this program.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 14:23:13 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Pullicino",
"Kyle",
""
]
] |
new_dataset
| 0.990372 |
1412.8700
|
Rustam Tagiew
|
Rustam Tagiew
|
Bewelcome.org -- a non-profit democratic hospex service set up for
growth
|
5 pages, 8 figures, 1 table
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an extensive data-based analysis of the non-profit
democratic hospitality exchange service bewelcome.org. We hereby pursuit the
goal of determining the factors influencing its growth. It also provides
general insights on internet-based hospitality exchange services. The other
investigated services are hospitalityclub.org and couchsurfing.org. Communities
using the three services are interconnected -- comparing their data provides
additional information.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2014 17:46:06 GMT"
}
] | 2014-12-31T00:00:00 |
[
[
"Tagiew",
"Rustam",
""
]
] |
new_dataset
| 0.999478 |
1104.0961
|
Lionel Levine
|
Lionel Levine, Katherine E. Stange
|
How to make the most of a shared meal: plan the last bite first
|
AMS Latex, 20 pages, 5 figures (1 colour figure); v2 adds references,
v3 incorporates referees' comments. To appear in American Math. Monthly
|
American Mathematical Monthly, 119-7 (2012), 550-565
|
10.4169/amer.math.monthly.119.07.550
| null |
cs.GT math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If you are sharing a meal with a companion, how best to make sure you get
your favourite mouthfuls? Ethiopian Dinner is a game in which two players take
turns eating morsels from a common plate. Each morsel comes with a pair of
utility values measuring its tastiness to the two players. Kohler and
Chandrasekaharan discovered a good strategy -- a subgame perfect equilibrium,
to be exact -- for this game. We give a new visual proof of their result. The
players arrive at the equilibrium by figuring out their last move first and
working backward. We conclude that it's never too early to start thinking about
dessert.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 20:56:17 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Apr 2011 19:10:57 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Sep 2011 21:09:31 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Levine",
"Lionel",
""
],
[
"Stange",
"Katherine E.",
""
]
] |
new_dataset
| 0.95493 |
1301.0541
|
Bartosz Walczak
|
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
|
Coloring triangle-free rectangle overlap graphs with $O(\log\log n)$
colors
|
Minor revision
|
Discrete Comput.Geom. 53 (2015) 199-220
|
10.1007/s00454-014-9640-3
| null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, it was proved that triangle-free intersection graphs of $n$ line
segments in the plane can have chromatic number as large as $\Theta(\log\log
n)$. Essentially the same construction produces $\Theta(\log\log n)$-chromatic
triangle-free intersection graphs of a variety of other geometric
shapes---those belonging to any class of compact arc-connected sets in
$\mathbb{R}^2$ closed under horizontal scaling, vertical scaling, and
translation, except for axis-parallel rectangles. We show that this
construction is asymptotically optimal for intersection graphs of boundaries of
axis-parallel rectangles, which can be alternatively described as overlap
graphs of axis-parallel rectangles. That is, we prove that triangle-free
rectangle overlap graphs have chromatic number $O(\log\log n)$, improving on
the previous bound of $O(\log n)$. To this end, we exploit a relationship
between off-line coloring of rectangle overlap graphs and on-line coloring of
interval overlap graphs. Our coloring method decomposes the graph into a
bounded number of subgraphs with a tree-like structure that "encodes"
strategies of the adversary in the on-line coloring problem. Then, these
subgraphs are colored with $O(\log\log n)$ colors using a combination of
techniques from on-line algorithms (first-fit) and data structure design
(heavy-light decomposition).
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2013 20:24:33 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Dec 2013 20:57:27 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Mar 2014 22:25:35 GMT"
},
{
"version": "v4",
"created": "Fri, 26 Dec 2014 13:09:43 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Krawczyk",
"Tomasz",
""
],
[
"Pawlik",
"Arkadiusz",
""
],
[
"Walczak",
"Bartosz",
""
]
] |
new_dataset
| 0.994513 |
1307.3075
|
Anurag
|
Anurag, Gurmohan Singh, V. Sulochana
|
Low Power Dual Edge-Triggered Static D Flip-Flop
|
Dual-Edge Triggered, Flip-Flop, High Speed, Low Power, Static D
Flip-Flop
|
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.4, No.3, June 2013
|
10.5121/vlsic.2013.4303
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper enumerates new architecture of low power dual-edge triggered
Flip-Flop (DETFF) designed at 180nm CMOS technology. In DETFF same data
throughput can be achieved with half of the clock frequency as compared to
single edge triggered Flip-Flop (SETFF). In this paper conventional and
proposed DETFF are presented and compared at same simulation conditions. The
post layout experimental results comparison shows that the average power
dissipation is improved by 48.17%, 41.29% and 36.84% when compared with SCDFF,
DEPFF and SEDNIFF respectively and improvement in PDP is 42.44%, 33.88% and
24.69% as compared to SCDFF, DEPFF and SEDNIFF respectively. Therefore the
proposed DETFF design is suitable for low power and small area applications.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 11:53:40 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Dec 2014 10:19:59 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Anurag",
"",
""
],
[
"Singh",
"Gurmohan",
""
],
[
"Sulochana",
"V.",
""
]
] |
new_dataset
| 0.965412 |
1309.4112
|
Laszlo Kish
|
L.B. Kish, C.G. Granqvist
|
On the security of the Kirchhoff-law-Johnson-noise (KLJN) communicator
|
4 pages
|
Quantum Information Processing, Volume 13, (2014), pp 2213-2219
|
10.1007/s11128-014-0729-7
| null |
cs.CR cs.ET
|
http://creativecommons.org/licenses/by/3.0/
|
A simple and general proof is given for the information theoretic
(unconditional) security of the Kirchhoff-law-Johnson-noise (KLJN) key exchange
system under practical conditions. The unconditional security for ideal
circumstances, which is based on the Second Law of Thermodynamics, is found to
prevail even under slightly non-ideal conditions. This security level is
guaranteed by the continuity of functions describing classical physical linear,
as well as stable non-linear, systems. Even without privacy amplification,
Eve's probability for successful bit-guessing is found to converge towards 0.5
- i.e., the perfect security level - when ideal conditions are approached.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 20:49:16 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Kish",
"L. B.",
""
],
[
"Granqvist",
"C. G.",
""
]
] |
new_dataset
| 0.990784 |
1403.6676
|
Christian Decker
|
Christian Decker and Roger Wattenhofer
|
Bitcoin Transaction Malleability and MtGox
| null | null |
10.1007/978-3-319-11212-1_18
| null |
cs.CR cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Bitcoin, transaction malleability describes the fact that the signatures
that prove the ownership of bitcoins being transferred in a transaction do not
provide any integrity guarantee for the signatures themselves. This allows an
attacker to mount a malleability attack in which it intercepts, modifies, and
rebroadcasts a transaction, causing the transaction issuer to believe that the
original transaction was not confirmed. In February 2014 MtGox, once the
largest Bitcoin exchange, closed and filed for bankruptcy claiming that
attackers used malleability attacks to drain its accounts. In this work we use
traces of the Bitcoin network for over a year preceding the filing to show
that, while the problem is real, there was no widespread use of malleability
attacks before the closure of MtGox.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2014 14:01:13 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Decker",
"Christian",
""
],
[
"Wattenhofer",
"Roger",
""
]
] |
new_dataset
| 0.998928 |
1410.2176
|
Andrej Gajduk
|
Andrej Gajduk, Mirko Todorovski, Juergen Kurths, and Ljupco Kocarev
|
Improving power grid transient stability by plug-in electric vehicles
|
15 pages, 4 figures, submitted to New Journal of Physics
| null |
10.1088/1367-2630/16/11/115011
| null |
cs.SY math.OC nlin.AO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Plug-in electric vehicles (PEVs) can serve in discharge mode as distributed
energy and power resources operating as vehicle-to-grid (V2G) devices and in
charge mode as loads or grid-to-vehicle (G2V) devices. It has been documented
that PEVs serving as V2G systems can offer possible backup for renewable power
sources, can provide reactive power support, active power regulation, load
balancing, peak load shaving,% and current harmonic filtering, can provide
ancillary services as frequency control and spinning reserves, can improve grid
efficiency, stability, reliability, and generation dispatch, can reduce utility
operating costs and can generate revenue. Here we show that PEVs can even
improve power grid transient stability, that is, stability when the power grid
is subjected to large disturbances, including bus faults, generator and branch
tripping, and sudden large load changes. A control strategy that regulates the
power output of a fleet of PEVs based on the speed of generator turbines is
proposed and tested on the New England 10-unit 39-bus power system. By
regulating the power output of the PEVs we show that (1) speed and voltage
fluctuations resulting from large disturbances can be significantly reduced up
to 5 times, and (2) the critical clearing time can be extended by 20-40%.
Overall, the PEVs control strategy makes the power grid more robust.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 15:03:19 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Gajduk",
"Andrej",
""
],
[
"Todorovski",
"Mirko",
""
],
[
"Kurths",
"Juergen",
""
],
[
"Kocarev",
"Ljupco",
""
]
] |
new_dataset
| 0.993562 |
1412.7772
|
Rodrigo de Lamare
|
K. Zu and R. C. de Lamare
|
Coordinate Tomlinson-Harashima Precoding Design for Overloaded
Multi-user MIMO Systems
|
3 figures, 6 pages, ISWCS 2014. arXiv admin note: text overlap with
arXiv:1401.4753
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tomlinson-Harashima precoding (THP) is a nonlinear processing technique
employed at the transmit side to implement the concept of dirty paper coding
(DPC). The perform of THP, however, is restricted by the dimensionality
constraint that the number of transmit antennas has to be greater or equal to
the total number of receive antennas. In this paper, we propose an iterative
coordinate THP algorithm for the scenarios in which the total number of receive
antennas is larger than the number of transmit antennas. The proposed algorithm
is implemented on two types of THP structures, the decentralized THP (dTHP)
with diagonal weighted filters at the receivers of the users, and the
centralized THP (cTHP) with diagonal weighted filter at the transmitter.
Simulation results show that a much better bit error rate (BER) and sum-rate
performances can be achieved by the proposed iterative coordinate THP compared
to the previous linear art.
|
[
{
"version": "v1",
"created": "Thu, 25 Dec 2014 00:56:53 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Zu",
"K.",
""
],
[
"de Lamare",
"R. C.",
""
]
] |
new_dataset
| 0.998315 |
1412.7849
|
Odemir Bruno PhD
|
Jo\~ao Batista Florindo, N\'ubia Rosa da Silva, Liliane Maria
Romualdo, Fernanda de F\'atima da Silva, Pedro Henrique de Cerqueira Luz,
Valdo Rodrigues Herling, Odemir Martinez Bruno
|
Brachiaria species identification using imaging techniques based on
fractal descriptors
|
7 pages, 5 figures
|
Computers and Electronics in Agriculture, V 103, Pages 48-54, 2014
|
10.1016/j.compag.2014.02.005
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of a rapid and accurate method in diagnosis and classification of
species and/or cultivars of forage has practical relevance, scientific and
trade in various areas of study. Thus, leaf samples of fodder plant species
\textit{Brachiaria} were previously identified, collected and scanned to be
treated by means of artificial vision to make the database and be used in
subsequent classifications. Forage crops used were: \textit{Brachiaria
decumbens} cv. IPEAN; \textit{Brachiaria ruziziensis} Germain \& Evrard;
\textit{Brachiaria Brizantha} (Hochst. ex. A. Rich.) Stapf; \textit{Brachiaria
arrecta} (Hack.) Stent. and \textit{Brachiaria spp}. The images were analyzed
by the fractal descriptors method, where a set of measures are obtained from
the values of the fractal dimension at different scales. Therefore such values
are used as inputs for a state-of-the-art classifier, the Support Vector
Machine, which finally discriminates the images according to the respective
species.
|
[
{
"version": "v1",
"created": "Thu, 25 Dec 2014 18:23:10 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Florindo",
"João Batista",
""
],
[
"da Silva",
"Núbia Rosa",
""
],
[
"Romualdo",
"Liliane Maria",
""
],
[
"da Silva",
"Fernanda de Fátima",
""
],
[
"Luz",
"Pedro Henrique de Cerqueira",
""
],
[
"Herling",
"Valdo Rodrigues",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] |
new_dataset
| 0.997836 |
1412.7851
|
Odemir Bruno PhD
|
Jo\~ao Batista Florindo and Odemir Martinez Bruno
|
Fractal descriptors based on the probability dimension: a texture
analysis and classification approach
|
7 pages, 6 figures. arXiv admin note: text overlap with
arXiv:1205.2821
|
Pattern Recognition Letters, Volume 42, Pages 107-114, 2014
|
10.1016/j.patrec.2014.01.009
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a novel technique for obtaining descriptors of
gray-level texture images. The descriptors are provided by applying a
multiscale transform to the fractal dimension of the image estimated through
the probability (Voss) method. The effectiveness of the descriptors is verified
in a classification task using benchmark over texture datasets. The results
obtained demonstrate the efficiency of the proposed method as a tool for the
description and discrimination of texture images.
|
[
{
"version": "v1",
"created": "Thu, 25 Dec 2014 18:50:31 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Florindo",
"João Batista",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] |
new_dataset
| 0.999471 |
1412.7856
|
Odemir Bruno PhD
|
\'Alvaro Gomez Z., Jo\~ao B. Florindo, Odemir M. Bruno
|
Gabor wavelets combined with volumetric fractal dimension applied to
texture analysis
|
11 pages, 2 figures
|
Pattern Recognition Letters, V. 36, Pages 135-143, 2014
|
10.1016/j.patrec.2013.09.023
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Texture analysis and classification remain as one of the biggest challenges
for the field of computer vision and pattern recognition. On this matter, Gabor
wavelets has proven to be a useful technique to characterize distinctive
texture patterns. However, most of the approaches used to extract descriptors
of the Gabor magnitude space usually fail in representing adequately the
richness of detail present into a unique feature vector. In this paper, we
propose a new method to enhance the Gabor wavelets process extracting a fractal
signature of the magnitude spaces. Each signature is reduced using a canonical
analysis function and concatenated to form the final feature vector.
Experiments were conducted on several texture image databases to prove the
power and effectiveness of the proposed method. Results obtained shown that
this method outperforms other early proposed method, creating a more reliable
technique for texture feature extraction.
|
[
{
"version": "v1",
"created": "Thu, 25 Dec 2014 19:38:11 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Z.",
"Álvaro Gomez",
""
],
[
"Florindo",
"João B.",
""
],
[
"Bruno",
"Odemir M.",
""
]
] |
new_dataset
| 0.98209 |
1412.7912
|
Lily Minear
|
Lily Minear, Eric Zhang
|
Impact of Energy Consumption on Multipath TCP Enabled Mobiles
|
4 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple accesses are common for most mobile devices today. This
technological advance opens up a new design space for improving the
communication performance of mobile devices. Multipath TCP is a TCP extension
that enables using multiple network paths between two end systems for a single
TCP connection, increasing performance and reliability. Meanwhile, when
operating multiple active interfaces, multipath-TCP also consumes substantial
more power and drains out bettery faster than using one interface. Thus,
enabling Multipath TCP on mobile devices brings in new challenges. In this
paper, we theoretically analyze the underlying design choices given by the
Multipath TCP. In particular, we theoretically formulate the rela- tion between
performance (throughput) and energy consumption for Multipath TCP. We find that
sometime the throughput and energy consumption can be concurrently improved.
|
[
{
"version": "v1",
"created": "Fri, 26 Dec 2014 07:50:15 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Minear",
"Lily",
""
],
[
"Zhang",
"Eric",
""
]
] |
new_dataset
| 0.955541 |
1412.7932
|
Raunaq Vohra
|
Kratarth Goel, Raunaq Vohra, Anant Kamath, and Veeky Baths
|
Home Automation Using SSVEP & Eye-Blink Detection Based Brain-Computer
Interface
|
2 pages, 1 table, published at IEEE SMC 2014
| null |
10.1109/SMC.2014.6974563
| null |
cs.HC cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel brain computer interface based home
automation system using two responses - Steady State Visually Evoked Potential
(SSVEP) and the eye-blink artifact, which is augmented by a Bluetooth based
indoor localization system, to greatly increase the number of controllable
devices. The hardware implementation of this system to control a table lamp and
table fan using brain signals has also been discussed and state-of-the-art
results have been achieved.
|
[
{
"version": "v1",
"created": "Fri, 26 Dec 2014 12:50:07 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Goel",
"Kratarth",
""
],
[
"Vohra",
"Raunaq",
""
],
[
"Kamath",
"Anant",
""
],
[
"Baths",
"Veeky",
""
]
] |
new_dataset
| 0.99546 |
1412.7935
|
Christian Decker
|
Christian Decker and Jochen Seidel and Roger Wattenhofer
|
Bitcoin Meets Strong Consistency
| null | null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Bitcoin system only provides eventual consistency. For everyday life, the
time to confirm a Bitcoin transaction is prohibitively slow. In this paper we
propose a new system, built on the Bitcoin blockchain, which enables strong
consistency. Our system, PeerCensus, acts as a certification authority, manages
peer identities in a peer-to-peer network, and ultimately enhances Bitcoin and
similar systems with strong consistency. Our extensive analysis shows that
PeerCensus is in a secure state with high probability. We also show how
Discoin, a Bitcoin variant that decouples block creation and transaction
confirmation, can be built on top of PeerCensus, enabling real-time payments.
Unlike Bitcoin, once transactions in Discoin are committed, they stay
committed.
|
[
{
"version": "v1",
"created": "Fri, 26 Dec 2014 12:58:13 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Decker",
"Christian",
""
],
[
"Seidel",
"Jochen",
""
],
[
"Wattenhofer",
"Roger",
""
]
] |
new_dataset
| 0.99968 |
1412.7965
|
Martin Homola
|
Diego Calvanese, \.Ismail \.Ilkan Ceylan, Marco Montali, and Ario
Santoso
|
Adding Context to Knowledge and Action Bases
|
ARCOE-Logic 2014 Workshop Notes, pp. 25-36
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knowledge and Action Bases (KABs) have been recently proposed as a formal
framework to capture the dynamics of systems which manipulate Description Logic
(DL) Knowledge Bases (KBs) through action execution. In this work, we enrich
the KAB setting with contextual information, making use of different context
dimensions. On the one hand, context is determined by the environment using
context-changing actions that make use of the current state of the KB and the
current context. On the other hand, it affects the set of TBox assertions that
are relevant at each time point, and that have to be considered when processing
queries posed over the KAB. Here we extend to our enriched setting the results
on verification of rich temporal properties expressed in mu-calculus, which had
been established for standard KABs. Specifically, we show that under a
run-boundedness condition, verification stays decidable.
|
[
{
"version": "v1",
"created": "Fri, 26 Dec 2014 18:14:20 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Calvanese",
"Diego",
""
],
[
"Ceylan",
"İsmail İlkan",
""
],
[
"Montali",
"Marco",
""
],
[
"Santoso",
"Ario",
""
]
] |
new_dataset
| 0.994827 |
1412.8010
|
Xuan-Son Vu
|
Xuan-Son Vu and Seong-Bae Park
|
Construction of Vietnamese SentiWordNet by using Vietnamese Dictionary
|
accepted on April-9th-2014, best paper award
|
The 40th Conference of the Korea Information Processing Society,
pp. 745-748, April 2014, South Korea
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SentiWordNet is an important lexical resource supporting sentiment analysis
in opinion mining applications. In this paper, we propose a novel approach to
construct a Vietnamese SentiWordNet (VSWN). SentiWordNet is typically generated
from WordNet in which each synset has numerical scores to indicate its opinion
polarities. Many previous studies obtained these scores by applying a machine
learning method to WordNet. However, Vietnamese WordNet is not available
unfortunately by the time of this paper. Therefore, we propose a method to
construct VSWN from a Vietnamese dictionary, not from WordNet. We show the
effectiveness of the proposed method by generating a VSWN with 39,561 synsets
automatically. The method is experimentally tested with 266 synsets with aspect
of positivity and negativity. It attains a competitive result compared with
English SentiWordNet that is 0.066 and 0.052 differences for positivity and
negativity sets respectively.
|
[
{
"version": "v1",
"created": "Sat, 27 Dec 2014 01:54:15 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Vu",
"Xuan-Son",
""
],
[
"Park",
"Seong-Bae",
""
]
] |
new_dataset
| 0.990537 |
1412.8018
|
Usman Khan
|
Sam Safavi and Usman A. Khan
|
Asymptotic stability of stochastic LTV systems with applications to
distributed dynamic fusion
|
submitted for journal publication
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate asymptotic stability of linear time-varying
systems with (sub-) stochastic system matrices. Motivated by distributed
dynamic fusion over networks of mobile agents, we impose some mild regularity
conditions on the elements of time-varying system matrices. We provide
sufficient conditions under which the asymptotic stability of the LTV system
can be guaranteed. By introducing the notion of slices, as non-overlapping
partitions of the sequence of systems matrices, we obtain stability conditions
in terms of the slice lengths and some network parameters. In addition, we
apply the LTV stability results to the distributed leader-follower algorithm,
and show the corresponding convergence and steady-state. An illustrative
example is also included to validate the effectiveness of our approach.
|
[
{
"version": "v1",
"created": "Sat, 27 Dec 2014 05:46:37 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Safavi",
"Sam",
""
],
[
"Khan",
"Usman A.",
""
]
] |
new_dataset
| 0.962945 |
1412.8395
|
Cristina Flaut
|
A. Borumand Saeid, H. Fatemidokht, C. Flaut and M. Kuchaki Rafsanjani
|
On Codes based on BCK-algebras
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present some new connections between BCK- algebras and
binary block codes.
|
[
{
"version": "v1",
"created": "Mon, 29 Dec 2014 17:11:06 GMT"
}
] | 2014-12-30T00:00:00 |
[
[
"Saeid",
"A. Borumand",
""
],
[
"Fatemidokht",
"H.",
""
],
[
"Flaut",
"C.",
""
],
[
"Rafsanjani",
"M. Kuchaki",
""
]
] |
new_dataset
| 0.999627 |
1412.7626
|
Ibrahim Abdelaziz
|
Ibrahim Abdelaziz, Sherif Abdou
|
AltecOnDB: A Large-Vocabulary Arabic Online Handwriting Recognition
Database
|
The preprint is in submission
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabic is a semitic language characterized by a complex and rich morphology.
The exceptional degree of ambiguity in the writing system, the rich morphology,
and the highly complex word formation process of roots and patterns all
contribute to making computational approaches to Arabic very challenging. As a
result, a practical handwriting recognition system should support large
vocabulary to provide a high coverage and use the context information for
disambiguation. Several research efforts have been devoted for building online
Arabic handwriting recognition systems. Most of these methods are either using
their small private test data sets or a standard database with limited lexicon
and coverage. A large scale handwriting database is an essential resource that
can advance the research of online handwriting recognition. Currently, there is
no online Arabic handwriting database with large lexicon, high coverage, large
number of writers and training/testing data.
In this paper, we introduce AltecOnDB, a large scale online Arabic
handwriting database. AltecOnDB has 98% coverage of all the possible PAWS of
the Arabic language. The collected samples are complete sentences that include
digits and punctuation marks. The collected data is available on sentence, word
and character levels, hence, high-level linguistic models can be used for
performance improvements. Data is collected from more than 1000 writers with
different backgrounds, genders and ages. Annotation and verification tools are
developed to facilitate the annotation and verification phases. We built an
elementary recognition system to test our database and show the existing
difficulties when handling a large vocabulary and dealing with large amounts of
styles variations in the collected data.
|
[
{
"version": "v1",
"created": "Wed, 24 Dec 2014 08:58:10 GMT"
}
] | 2014-12-25T00:00:00 |
[
[
"Abdelaziz",
"Ibrahim",
""
],
[
"Abdou",
"Sherif",
""
]
] |
new_dataset
| 0.999848 |
1412.7677
|
Roshan Ragel
|
C.B Bulumulla and R. G. Ragel
|
LineCAPTCHA Mobile: A User Friendly Replacement for Unfriendly Reverse
Turing Tests for Mobile Devices (ICIAfS14)
|
The 7th International Conference on Information and Automation for
Sustainability (ICIAfS) 2014
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As smart phones and tablets are becoming ubiquitous and taking over as the
primary choice for accessing the Internet worldwide, ensuring a secure gateway
to the servers serving such devices become essential. CAPTCHAs play an
important role in identifying human users in internet to prevent unauthorized
bot attacks. Even though there are numerous CAPTCHA alternatives available
today, there are certain drawbacks attached with each alternative, making them
harder to find a general solution for the necessity of a CAPTCHA mechanism.
With the advancing technology and expertise in areas such as AI, cryptography
and image processing, it has come to a stage where the chase between making and
breaking CAPTCHAs are even now. This has led the humans with a hard time
deciphering the CAPTCHA mechanisms. In this paper, we adapt a novel CAPTCHA
mechanism named as LineCAPTCHA to mobile devices. LineCAPTCHA is a new reverse
Turing test based on drawing on top of Bezier curves within noisy backgrounds.
The major objective of this paper is to report the implementation and
evaluation of LineCAPTCHA on a mobile platform. At the same time we impose
certain security standards and security aspects for establishing LineCAPTCHAs
which are obtained through extensive measures. Independency from factors such
as the fluency in English language, age and easily understandable nature of it
inclines the usability of LineCAPTCHA. We believe that such independency will
favour the main target of LineCAPTCHA, user friendliness and usability.
|
[
{
"version": "v1",
"created": "Wed, 24 Dec 2014 14:49:14 GMT"
}
] | 2014-12-25T00:00:00 |
[
[
"Bulumulla",
"C. B",
""
],
[
"Ragel",
"R. G.",
""
]
] |
new_dataset
| 0.999454 |
1412.7680
|
Roshan Ragel
|
G. I. Gunarathna, M. A. P. Chamikara and R. G. Ragel
|
A Fuzzy Based Model to Identify Printed Sinhala Characters (ICIAfS14)
|
The 7th International Conference on Information and Automation for
Sustainability (ICIAfS) 2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Character recognition techniques for printed documents are widely used for
English language. However, the systems that are implemented to recognize Asian
languages struggle to increase the accuracy of recognition. Among other Asian
languages (such as Arabic, Tamil, Chinese), Sinhala characters are unique,
mainly because they are round in shape. This unique feature makes it a
challenge to extend the prevailing techniques to improve recognition of Sinhala
characters. Therefore, a little attention has been given to improve the
accuracy of Sinhala character recognition. A novel method, which makes use of
this unique feature, could be advantageous over other methods. This paper
describes the use of a fuzzy inference system to recognize Sinhala characters.
Feature extraction is mainly focused on distance and intersection measurements
in different directions from the center of the letter making use of the round
shape of characters. The results showed an overall accuracy of 90.7% for 140
instances of letters tested, much better than similar systems.
|
[
{
"version": "v1",
"created": "Wed, 24 Dec 2014 14:56:54 GMT"
}
] | 2014-12-25T00:00:00 |
[
[
"Gunarathna",
"G. I.",
""
],
[
"Chamikara",
"M. A. P.",
""
],
[
"Ragel",
"R. G.",
""
]
] |
new_dataset
| 0.973108 |
1412.7250
|
Deepan Palguna
|
Deepan Palguna, David J. Love, Ilya Pollak
|
Secondary Spectrum Auctions for Markets with Communication Constraints
|
37 pages
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Auctions have been proposed as a way to provide economic incentives for
primary users to dynamically allocate unused spectrum to other users in need of
it. Previously proposed schemes do not take into account the fact that the
power constraints of users might prevent them from transmitting their bid
prices to the auctioneer with high precision and that transmitted bid prices
must travel through a noisy channel. These schemes also have very high
overheads which cannot be accommodated in wireless standards. We propose
auction schemes where a central clearing authority auctions spectrum to users
who bid for it, while taking into account quantization of prices, overheads in
bid revelation, and noise in the channel explicitly. Our schemes are closely
related to channel output feedback problems and, specifically, to the technique
of posterior matching. We consider several scenarios where the objective of the
clearing authority is to award spectrum to the bidders who value spectrum the
most. We prove theoretically that this objective is asymptotically attained by
our scheme when the bidders are non-strategic with constant bids. We propose
separate schemes to make strategic users reveal their private values
truthfully, to auction multiple sub-channels among strategic users, and to
track slowly time-varying bid prices. Our simulations illustrate the optimality
of our schemes for constant bid prices, and also demonstrate the effectiveness
of our tracking algorithm for slowly time-varying bids.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2014 04:35:23 GMT"
}
] | 2014-12-24T00:00:00 |
[
[
"Palguna",
"Deepan",
""
],
[
"Love",
"David J.",
""
],
[
"Pollak",
"Ilya",
""
]
] |
new_dataset
| 0.978593 |
1412.7364
|
David Gleich
|
David F. Gleich and Ananth Grama and Yao Zhu
|
Erasure coding for fault oblivious linear system solvers
| null | null | null | null |
cs.NA cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dealing with hardware and software faults is an important problem as parallel
and distributed systems scale to millions of processing cores and wide area
networks. Traditional methods for dealing with faults include
checkpoint-restart, active replicas, and deterministic replay. Each of these
techniques has associated resource overheads and constraints. In this paper, we
propose an alternate approach to dealing with faults, based on input
augmentation. This approach, which is an algorithmic analog of erasure coded
storage, applies a minimally modified algorithm on the augmented input to
produce an augmented output. The execution of such an algorithm proceeds
completely oblivious to faults in the system. In the event of one or more
faults, the real solution is recovered using a rapid reconstruction method from
the augmented output. We demonstrate this approach on the problem of solving
sparse linear systems using a conjugate gradient solver. We present input
augmentation and output recovery techniques. Through detailed experiments, we
show that our approach can be made oblivious to a large number of faults with
low computational overhead. Specifically, we demonstrate cases where a single
fault can be corrected with less than 10% overhead in time, and even in extreme
cases (fault rates of 20%), our approach is able to compute a solution with
reasonable overhead. These results represent a significant improvement over the
state of the art.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2014 14:04:34 GMT"
}
] | 2014-12-24T00:00:00 |
[
[
"Gleich",
"David F.",
""
],
[
"Grama",
"Ananth",
""
],
[
"Zhu",
"Yao",
""
]
] |
new_dataset
| 0.9659 |
cs/0504097
|
Amit K Awasthi
|
Amit K Awasthi and Sunder Lal
|
ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear
Pairings
|
Published with ePrint Archive
| null |
10.13140/2.1.2549.1529
| null |
cs.CR
| null |
In 2001, Rivest et al. firstly introduced the concept of ring signatures. A
ring signature is a simplified group signature without any manager. It protects
the anonymity of a signer. The first scheme proposed by Rivest et al. was based
on RSA cryptosystem and certificate based public key setting. The first ring
signature scheme based on DLP was proposed by Abe, Ohkubo, and Suzuki. Their
scheme is also based on the general certificate-based public key setting too.
In 2002, Zhang and Kim proposed a new ID-based ring signature scheme using
pairings. Later Lin and Wu proposed a more efficient ID-based ring signature
scheme. Both these schemes have some inconsistency in computational aspect.
In this paper we propose a new ID-based ring signature scheme and a proxy
ring signature scheme. Both the schemes are more efficient than existing one.
These schemes also take care of the inconsistencies in above two schemes.
|
[
{
"version": "v1",
"created": "Sat, 23 Apr 2005 23:24:31 GMT"
}
] | 2014-12-24T00:00:00 |
[
[
"Awasthi",
"Amit K",
""
],
[
"Lal",
"Sunder",
""
]
] |
new_dataset
| 0.998212 |
1405.0055
|
Abuzer Yakaryilmaz
|
Arseny M. Shur and Abuzer Yakaryilmaz
|
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States
|
A new version with new results. Previous version: Arseny M. Shur,
Abuzer Yakaryilmaz: Quantum, Stochastic, and Pseudo Stochastic Languages with
Few States. UCNC 2014: 327-339
| null | null | null |
cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic languages are the languages recognized by probabilistic finite
automata (PFAs) with cutpoint over the field of real numbers. More general
computational models over the same field such as generalized finite automata
(GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin
proved the set of stochastic languages to be uncountable presenting a single
2-state PFA over the binary alphabet recognizing uncountably many languages
depending on the cutpoint. In this paper, we show the same result for unary
stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary
QFA, and a family of 3-state unary PFAs recognizing uncountably many languages;
all these numbers of states are optimal. After this, we completely characterize
the class of languages recognized by 1-state GFAs, which is the only nontrivial
class of languages recognized by 1-state automata. Finally, we consider the
variations of PFAs, QFAs, and GFAs based on the notion of inclusive/exclusive
cutpoint, and present some results on their expressive power.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 23:29:33 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Dec 2014 11:32:09 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Shur",
"Arseny M.",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.997131 |
1410.6142
|
Mark Riedl
|
Mark O. Riedl
|
The Lovelace 2.0 Test of Artificial Creativity and Intelligence
|
2 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Observing that the creation of certain types of artistic artifacts
necessitate intelligence, we present the Lovelace 2.0 Test of creativity as an
alternative to the Turing Test as a means of determining whether an agent is
intelligent. The Lovelace 2.0 Test builds off prior tests of creativity and
additionally provides a means of directly comparing the relative intelligence
of different agents.
|
[
{
"version": "v1",
"created": "Wed, 22 Oct 2014 18:59:31 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Oct 2014 15:09:53 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Dec 2014 03:24:06 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Riedl",
"Mark O.",
""
]
] |
new_dataset
| 0.978833 |
1412.6593
|
Jianjun Yang
|
Yin Wang, Jianjun Yang, Ju Shen, Juan Guo, Kun Hua
|
Compression of Video Tracking and Bandwidth Balancing Routing in
Wireless Multimedia Sensor Networks
|
6 pages, 4 figures
| null | null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been a tremendous growth in multimedia applications over wireless
networks. Wireless Multimedia Sensor Networks(WMSNs) have become the premier
choice in many research communities and industry. Many state-of-art
applications, such as surveillance, traffic monitoring, and remote heath care
are essentially video tracking and transmission in WMSNs. The transmission
speed is constrained by big size of video data and fixed bandwidth allocation
in constant routing path. In this paper, we present a CamShift based algorithm
to compress the tracking of videos. Then we propose a bandwidth balancing
strategy in which each sensor node is able to dynamically select the node for
next hop with the highest potential bandwidth capacity to resume communication.
Key to the strategy is that each node merely maintains two parameters that
contains its historical bandwidth varying trend and then predicts its near
future bandwidth capacity. Then forwarding node selects the next hop with the
highest potential bandwidth capacity. Simulations demonstrate that our approach
significantly increases the data received by sink node and decreases the delay
on video transmission in Wireless Multimedia Sensor Network environment.
|
[
{
"version": "v1",
"created": "Sat, 20 Dec 2014 03:57:47 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Wang",
"Yin",
""
],
[
"Yang",
"Jianjun",
""
],
[
"Shen",
"Ju",
""
],
[
"Guo",
"Juan",
""
],
[
"Hua",
"Kun",
""
]
] |
new_dataset
| 0.995142 |
1412.6767
|
Marina Maslennikova
|
Marina Maslennikova, Emanuele Rodaro
|
Representation of (Left) Ideal Regular Languages by Synchronizing
Automata
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We follow language theoretic approach to synchronizing automata and
\v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a
precise lower bound for the reset complexity of a principal ideal languages.
Also we show a strict connection between principal left ideals and
synchronizing automata. We characterize regular languages whose minimal
deterministic finite automaton is synchronizing and possesses a reset word
belonging to the recognized language.
|
[
{
"version": "v1",
"created": "Sun, 21 Dec 2014 11:56:11 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Maslennikova",
"Marina",
""
],
[
"Rodaro",
"Emanuele",
""
]
] |
new_dataset
| 0.960203 |
1412.6843
|
Xingqin Lin
|
Xingqin Lin and Jeffrey G. Andrews
|
Connectivity of Millimeter Wave Networks with Multi-hop Relaying
|
10 pages; 3 figures; submitted to IEEE Wireless Communications
Letters
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel stochastic geometry approach to the connectivity
of milimeter wave (mmWave) networks with multi-hop relaying. The random
positions and shapes of obstacles in the radio environment are modeled as a
Boolean model, whose germs are distributed according to a Poisson point process
and grains are random rectangles. The derived analytical results shed light on
how the connectivity of mmWave networks depends on key system parameters such
as the density and size of obstacles as well as relaying route window -- the
range of distances in which routing relays are selected. We find that multi-hop
relaying can greatly improve the connectivity versus single hop mmWave
transmission. We show that to obtain near-optimal connectivity the relaying
route window should be about the size of the obstacles.
|
[
{
"version": "v1",
"created": "Sun, 21 Dec 2014 23:07:46 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Lin",
"Xingqin",
""
],
[
"Andrews",
"Jeffrey G.",
""
]
] |
new_dataset
| 0.994578 |
1412.6892
|
Jian Sun
|
Jian Sun and Tianqi Wu and Xianfeng Gu and Feng Luo
|
Discrete Conformal Deformation: Algorithm and Experiments
|
34 pages, 22 figures
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a definition of discrete conformality for
triangulated surfaces with flat cone metrics and describe an algorithm for
solving the problem of prescribing curvature, that is to deform the metric
discrete conformally so that the curvature of the resulting metric coincides
with the prescribed curvature. We explicitly construct a discrete conformal map
between the input triangulated surface and the deformed triangulated surface.
Our algorithm can handle the surface with any topology with or without
boundary, and can find a deformed metric for any prescribed curvature
satisfying the Gauss-Bonnet formula. In addition, we present the numerical
examples to show the convergence of our discrete conformality and to
demonstrate the efficiency and the robustness of our algorithm.
|
[
{
"version": "v1",
"created": "Mon, 22 Dec 2014 07:38:26 GMT"
}
] | 2014-12-23T00:00:00 |
[
[
"Sun",
"Jian",
""
],
[
"Wu",
"Tianqi",
""
],
[
"Gu",
"Xianfeng",
""
],
[
"Luo",
"Feng",
""
]
] |
new_dataset
| 0.96739 |
1412.5830
|
Crist\'obal Camarero
|
Crist\'obal Camarero and Carmen Mart\'inez and Ram\'on Beivide
|
Identifying Codes of Degree 4 Cayley Graphs over Abelian Groups
| null | null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a wide family of identifying codes over regular Cayley graphs
of degree four which are built over finite Abelian groups is presented. Some of
the codes in this construction are also perfect. The graphs considered include
some well-known graphs such as tori, twisted tori and Kronecker products of two
cycles. Therefore, the codes can be used for identification in these graphs.
Finally, an example of how these codes can be applied for adaptive
identification over these graphs is presented.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2014 12:07:20 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Camarero",
"Cristóbal",
""
],
[
"Martínez",
"Carmen",
""
],
[
"Beivide",
"Ramón",
""
]
] |
new_dataset
| 0.997834 |
1412.6151
|
Lucas Leao
|
Lucas Le\~ao, David Bianchini and Omar Branquinho
|
FLBRA: Fuzzy Logic Based Routing Algorithm for Indoor Wireless Sensor
Networks
|
12 pages
|
International Journal of Computer Science & Information Technology
(IJCSIT) Vol 6, No 5, October 2014
|
10.5121/ijcsit.2014.6507
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Considering the context of building management systems with wireless sensor
networks monitoring environmental features, this paper presents a proposal of a
Fuzzy Logic Based Routing Algorithm (FLBRA) to determine the cost of each link
and the identification of the best routes for packet forwarding. We describe
the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation
of the RSSI and Packet Error Rate - PER) for the cost definition of each path,
the sequence of identifying best routes and the results obtained in simulation.
As expected in this proposal, the simulation results showed an increase in the
packet delivery rate compared to RSSI-based forward protocol (RBF).
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2014 17:51:05 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Leão",
"Lucas",
""
],
[
"Bianchini",
"David",
""
],
[
"Branquinho",
"Omar",
""
]
] |
new_dataset
| 0.998871 |
1412.6291
|
Maciej Wielgus
|
Maciek Wielgus
|
Perona-Malik equation and its numerical properties
|
My bachelor thesis, Faculty of Mathematics, Informatics and
Mechanics, University of Warsaw, 2010
| null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work concerns the Perona-Malik equation, which plays essential role in
image processing. The first part gives a survey of results on existance,
uniqueness and stability of solutions, the second part introduces
discretisations of equation and deals with an analysis of discrete problem. In
the last part I present some numerical results, in particular with algorithms
applied to real images.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 11:17:38 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Wielgus",
"Maciek",
""
]
] |
new_dataset
| 0.998941 |
1412.6306
|
Lidia Dobrescu
|
Adrian-Ioan Lita, Ioan Plotog, Lidia Dobrescu
|
Multiprocessor System Dedicated to Multi-Rotor Mini-UAV Capable of 3D
flying
|
International Conference of Scientific Paper AFASES 2014 Brasov,
22-24 May 2014
| null | null | null |
cs.CE
|
http://creativecommons.org/licenses/by/3.0/
|
The paper describes an electronic multiprocessor system that assures
functionality of a miniature UAV capable of 3D flying. The apparatus consists
of six independently controlled brushless DC motors, each having a propeller
attached to it. Since the brushless motor requires complex algorithms in order
to achieve maximum torque, efficiency and response time a DSP must be used. All
the motors are then controlled by a main microprocessor which is capable of
reading sensors (Inertial Measurement Unit (IMU)-orientation and GPS),
receiving input commands (remote controller or trajectory plan) and sending
independent commands to each of the six motors. The apparatus contains a total
of eight microcontrollers: the main unit, the IMU mathematical processor and
one microcontroller for each of the six brushless DC motors. Applications for
such an apparatus could include not only military, but also search-and-rescue,
geodetics, aerial photography and aerial assistance.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 11:53:38 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Lita",
"Adrian-Ioan",
""
],
[
"Plotog",
"Ioan",
""
],
[
"Dobrescu",
"Lidia",
""
]
] |
new_dataset
| 0.99731 |
1412.6378
|
Pierre de Buyl
|
Bastian Venthur, Benjamin Blankertz
|
Wyrm, A Pythonic Toolbox for Brain-Computer Interfacing
|
Part of the Proceedings of the 7th European Conference on Python in
Science (EuroSciPy 2014), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2014-04
|
cs.HC
|
http://creativecommons.org/licenses/by/3.0/
|
A Brain-Computer Interface (BCI) is a system that measures central nervous
system activity and translates the recorded data into an output suitable for a
computer to use as an input signal. Such a BCI system consists of three parts,
the signal acquisition, the signal processing and the feedback/stimulus
presentation. In this paper we present Wyrm, a signal processing toolbox for
BCI in Python. Wyrm is applicable to a broad range of neuroscientific problems
and capable for running online experiments in real time and off-line data
analysis and visualisation.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 15:34:01 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Venthur",
"Bastian",
""
],
[
"Blankertz",
"Benjamin",
""
]
] |
new_dataset
| 0.999779 |
1412.6383
|
Pierre de Buyl
|
Christophe Pouzat, Georgios Is. Detorakis
|
SPySort: Neuronal Spike Sorting with Python
|
Part of the Proceedings of the 7th European Conference on Python in
Science (EuroSciPy 2014), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2014-05
|
cs.CE q-bio.NC
|
http://creativecommons.org/licenses/by/3.0/
|
Extracellular recordings with multi-electrode arrays is one of the basic
tools of contemporary neuroscience. These recordings are mostly used to monitor
the activities, understood as sequences of emitted action potentials, of many
individual neurons. But the raw data produced by extracellular recordings are
most commonly a mixture of activities from several neurons. In order to get the
activities of the individual contributing neurons, a pre-processing step called
spike sorting is required. We present here a pure Python implementation of a
well tested spike sorting procedure. The latter was designed in a modular way
in order to favour a smooth transition from an interactive sorting, for
instance with IPython, to an automatic one. Surprisingly enough - or sadly
enough, depending on one's view point -, recoding our now 15 years old
procedure into Python was the occasion of major methodological improvements.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 15:40:00 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Pouzat",
"Christophe",
""
],
[
"Detorakis",
"Georgios Is.",
""
]
] |
new_dataset
| 0.999245 |
1412.6391
|
Pierre de Buyl
|
Davide Monari, Francesco Cenni, Erwin Aertbeli\"en, Kaat Desloovere
|
Py3DFreeHandUS: a library for voxel-array reconstruction using
Ultrasonography and attitude sensors
|
Part of the Proceedings of the 7th European Conference on Python in
Science (EuroSciPy 2014), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2014-07
|
cs.CV cs.CE
|
http://creativecommons.org/licenses/by/3.0/
|
In medical imaging, there is a growing interest to provide real-time images
with good quality for large anatomical structures. To cope with this issue, we
developed a library that allows to replace, for some specific clinical
applications, more robust systems such as Computer Tomography (CT) and Magnetic
Resonance Imaging (MRI). Our python library Py3DFreeHandUS is a package for
processing data acquired simultaneously by ultra-sonographic systems (US) and
marker-based optoelectronic systems. In particular, US data enables to
visualize subcutaneous body structures, whereas the optoelectronic system is
able to collect the 3D position in space for reflective objects, that are
called markers. By combining these two measurement devices, it is possible to
reconstruct the real 3D morphology of body structures such as muscles, for
relevant clinical implications. In the present research work, the different
steps which allow to obtain a relevant 3D data set as well as the procedures
for calibrating the systems and for determining the quality of the
reconstruction.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 15:47:47 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Monari",
"Davide",
""
],
[
"Cenni",
"Francesco",
""
],
[
"Aertbeliën",
"Erwin",
""
],
[
"Desloovere",
"Kaat",
""
]
] |
new_dataset
| 0.999539 |
1412.6395
|
Pierre de Buyl
|
Esteban Fuentes, Hector E. Martinez
|
SClib, a hack for straightforward embedded C functions in Python
|
Part of the Proceedings of the 7th European Conference on Python in
Science (EuroSciPy 2014), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2014-08
|
cs.MS physics.comp-ph
|
http://creativecommons.org/licenses/by/3.0/
|
We present SClib, a simple hack that allows easy and straightforward
evaluation of C functions within Python code, boosting flexibility for better
trade-off between computation power and feature availability, such as
visualization and existing computation routines in SciPy. We also present two
cases were SClib has been used. In the first set of applications we use SClib
to write a port to Python of a Schr\"odinger equation solver that has been
extensively used the literature, the resulting script presents a speed-up of
about 150x with respect to the original one. A review of the situations where
the speeded-up script has been used is presented. We also describe the solution
to the related problem of solving a set of coupled Schr\"odinger-like equations
where SClib is used to implement the speed-critical parts of the code. We argue
that when using SClib within IPython we can use NumPy and Matplotlib for the
manipulation and visualization of the solutions in an interactive environment
with no performance compromise. The second case is an engineering application.
We use SClib to evaluate the control and system derivatives in a feedback
control loop for electrical motors. With this and the integration routines
available in SciPy, we can run simulations of the control loop a la Simulink.
The use of C code not only boosts the speed of the simulations, but also
enables to test the exact same code that we use in the test rig to get
experimental results. Again, integration with IPython gives us the flexibility
to analyze and visualize the data.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 15:51:21 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Fuentes",
"Esteban",
""
],
[
"Martinez",
"Hector E.",
""
]
] |
new_dataset
| 0.999627 |
1412.6396
|
Till Tantau
|
Till Tantau
|
Existential Second-Order Logic Over Graphs: A Complete
Complexity-Theoretic Classification
|
Technical report version of a STACS 2015 paper
| null | null | null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Descriptive complexity theory aims at inferring a problem's computational
complexity from the syntactic complexity of its description. A cornerstone of
this theory is Fagin's Theorem, by which a graph property is expressible in
existential second-order logic (ESO logic) if, and only if, it is in NP. A
natural question, from the theory's point of view, is which syntactic fragments
of ESO logic also still characterize NP. Research on this question has
culminated in a dichotomy result by Gottlob, Kolatis, and Schwentick: for each
possible quantifier prefix of an ESO formula, the resulting prefix class either
contains an NP-complete problem or is contained in P. However, the exact
complexity of the prefix classes inside P remained elusive. In the present
paper, we clear up the picture by showing that for each prefix class of ESO
logic, its reduction closure under first-order reductions is either FO, L, NL,
or NP. For undirected, self-loop-free graphs two containment results are
especially challenging to prove: containment in L for the prefix $\exists R_1
\cdots \exists R_n \forall x \exists y$ and containment in FO for the prefix
$\exists M \forall x \exists y$ for monadic $M$. The complex argument by
Gottlob, Kolatis, and Schwentick concerning polynomial time needs to be
carefully reexamined and either combined with the logspace version of
Courcelle's Theorem or directly improved to first-order computations. A
different challenge is posed by formulas with the prefix $\exists M \forall
x\forall y$: We show that they express special constraint satisfaction problems
that lie in L.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 15:51:33 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Tantau",
"Till",
""
]
] |
new_dataset
| 0.996177 |
1412.6402
|
Pierre de Buyl
|
Rebecca R. Murphy, Sophie E. Jackson, David Klenerman
|
pyFRET: A Python Library for Single Molecule Fluorescence Data Analysis
|
Part of the Proceedings of the 7th European Conference on Python in
Science (EuroSciPy 2014), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2014-10
|
cs.CE physics.bio-ph q-bio.BM
|
http://creativecommons.org/licenses/by/3.0/
|
Single molecule F\"orster resonance energy transfer (smFRET) is a powerful
experimental technique for studying the properties of individual biological
molecules in solution. However, as adoption of smFRET techniques becomes more
widespread, the lack of available software, whether open source or commercial,
for data analysis, is becoming a significant issue. Here, we present pyFRET, an
open source Python package for the analysis of data from single-molecule
fluorescence experiments from freely diffusing biomolecules. The package
provides methods for the complete analysis of a smFRET dataset, from burst
selection and denoising, through data visualisation and model fitting. We
provide support for both continuous excitation and alternating laser excitation
(ALEX) data analysis. pyFRET is available as a package downloadable from the
Python Package Index (PyPI) under the open source three-clause BSD licence,
together with links to extensive documentation and tutorials, including example
usage and test data. Additional documentation including tutorials is hosted
independently on ReadTheDocs. The code is available from the free hosting site
Bitbucket. Through distribution of this software, we hope to lower the barrier
for the adoption of smFRET experiments by other research groups and we
encourage others to contribute modules for specific analysis needs.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 16:00:31 GMT"
}
] | 2014-12-22T00:00:00 |
[
[
"Murphy",
"Rebecca R.",
""
],
[
"Jackson",
"Sophie E.",
""
],
[
"Klenerman",
"David",
""
]
] |
new_dataset
| 0.999114 |
1412.5490
|
Ashirbani Saha
|
Ashirbani Saha, Q. M. Jonathan Wu
|
High Frequency Content based Stimulus for Perceptual Sharpness
Assessment in Natural Images
|
13 pages, 6 figures, 3 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A blind approach to evaluate the perceptual sharpness present in a natural
image is proposed. Though the literature demonstrates a set of variegated
visual cues to detect or evaluate the absence or presence of sharpness, we
emphasize in the current work that high frequency content and local standard
deviation can form strong features to compute perceived sharpness in any
natural image, and can be considered an able alternative for the existing cues.
Unsharp areas in a natural image happen to exhibit uniform intensity or lack of
sharp changes between regions. Sharp region transitions in an image are caused
by the presence of spatial high frequency content. Therefore, in the proposed
approach, we hypothesize that using the high frequency content as the principal
stimulus, the perceived sharpness can be quantified in an image. When an image
is convolved with a high pass filter, higher values at any pixel location
signify the presence of high frequency content at those locations. Considering
these values as the stimulus, the exponent of the stimulus is weighted by local
standard deviation to impart the contribution of the local contrast within the
formation of the sharpness map. The sharpness map highlights the relatively
sharper regions in the image and is used to calculate the perceived sharpness
score of the image. The advantages of the proposed method lie in its use of
simple visual cues of high frequency content and local contrast to arrive at
the perceptual score, and requiring no training with the images. The promise of
the proposed method is demonstrated by its ability to compute perceived
sharpness for within image and across image sharpness changes and for blind
evaluation of perceptual degradation resulting due to presence of blur.
Experiments conducted on several databases demonstrate improved performance of
the proposed method over that of the state-of-the-art techniques.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2014 17:28:53 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Dec 2014 02:57:51 GMT"
}
] | 2014-12-19T00:00:00 |
[
[
"Saha",
"Ashirbani",
""
],
[
"Wu",
"Q. M. Jonathan",
""
]
] |
new_dataset
| 0.997101 |
1412.5697
|
Zahed Rahmati
|
Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
|
Kinetic $k$-Semi-Yao Graph and its Applications
|
arXiv admin note: text overlap with arXiv:1307.2700, arXiv:1406.5554
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new proximity graph, called the $k$-Semi-Yao graph
($k$-SYG), on a set $P$ of points in $\mathbb{R}^d$, which is a supergraph of
the $k$-nearest neighbor graph ($k$-NNG) of $P$. We provide a kinetic data
structure (KDS) to maintain the $k$-SYG on moving points, where the trajectory
of each point is a polynomial function whose degree is bounded by some
constant. Our technique gives the first KDS for the theta graph (\ie, $1$-SYG)
in $\mathbb{R}^d$. It generalizes and improves on previous work on maintaining
the theta graph in $\mathbb{R}^2$.
As an application, we use the kinetic $k$-SYG to provide the first KDS for
maintenance of all the $k$-nearest neighbors in $\mathbb{R}^d$, for any $k\geq
1$. Previous works considered the $k=1$ case only. Our KDS for all the
$1$-nearest neighbors is deterministic. The best previous KDS for all the
$1$-nearest neighbors in $ \mathbb{R}^d$ is randomized. Our structure and
analysis are simpler and improve on this work for the $k=1$ case. We also
provide a KDS for all the $(1+\epsilon)$-nearest neighbors, which in fact gives
better performance than previous KDS's for maintenance of all the exact
$1$-nearest neighbors.
As another application, we present the first KDS for answering reverse
$k$-nearest neighbor queries on moving points in $ \mathbb{R}^d$, for any
$k\geq 1$.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2014 01:34:32 GMT"
}
] | 2014-12-19T00:00:00 |
[
[
"Rahmati",
"Zahed",
""
],
[
"Abam",
"Mohammad Ali",
""
],
[
"King",
"Valerie",
""
],
[
"Whitesides",
"Sue",
""
]
] |
new_dataset
| 0.998699 |
1412.5847
|
Nicola Caon
|
Antonio Dorta, Nicola Caon, Jorge Andres Perez Prieto
|
ConGUSTo: (HT)Condor Graphical Unified Supervising Tool
|
8 pages, 10 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
HTCondor is a distributed job scheduler developed by the University of
Wisconsin-Madison, which allows users to run their applications in other users'
machines when they are not being used, thus providing a considerably increase
in the overall computational power and a more efficient use of the computing
resources. Our institution has been successfully using HTCondor for more than
ten years, and HTCondor is nowadays the most used Supercomputing resource we
have. Although HTCondor provides a wide range of tools and options for its
management and administration, there are currently no tools that can show
detailed usage information and statistics in a clear, easy to interpret,
interactive set of graphics displays. For this reason, we have developed
ConGUSTo, a web-based tool that allows to collect HTCondor usage and statistics
data in an easy way, and present them using a variety of tabular and graphics
charts.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2014 13:17:41 GMT"
}
] | 2014-12-19T00:00:00 |
[
[
"Dorta",
"Antonio",
""
],
[
"Caon",
"Nicola",
""
],
[
"Prieto",
"Jorge Andres Perez",
""
]
] |
new_dataset
| 0.999172 |
1412.6061
|
Gundram Leifert
|
Gundram Leifert, Roger Labahn, Tobias Strau{\ss} (University of
Rostock - CITlab)
|
CITlab ARGUS for Arabic Handwriting
|
http://www.nist.gov/itl/iad/mig/upload/OpenHaRT2013_SysDesc_CITLAB.pdf
| null | null | null |
cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the recent years it turned out that multidimensional recurrent neural
networks (MDRNN) perform very well for offline handwriting recognition tasks
like the OpenHaRT 2013 evaluation DIR. With suitable writing preprocessing and
dictionary lookup, our ARGUS software completed this task with an error rate of
26.27% in its primary setup.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2014 06:55:28 GMT"
}
] | 2014-12-19T00:00:00 |
[
[
"Leifert",
"Gundram",
"",
"University of\n Rostock - CITlab"
],
[
"Labahn",
"Roger",
"",
"University of\n Rostock - CITlab"
],
[
"Strauß",
"Tobias",
"",
"University of\n Rostock - CITlab"
]
] |
new_dataset
| 0.989986 |
1402.2415
|
Pradeep Singla
|
Pradeep Singla, Devraj Gautam
|
Reversible Squaring Circuit For Low Power Digital Signal Processing
|
This paper has been withdrawn by the author due to a crucial sign
error in design fig. 3(b)
|
International Journal of Electronics, Computer & Communication
Technology, Volume 4, Issue- 2, Jan-2014
| null | null |
cs.AR
|
http://creativecommons.org/licenses/by/3.0/
|
With the high demand of low power digital systems, energy dissipation in the
digital system is one of the limiting factors. Reversible logic is one of the
alternate to reduce heat/energy dissipation in the digital circuits and have a
very significant importance in bioinformatics, optical information processing,
CMOS design etc. In this paper the authors propose the design of new 2- bit
binary Squaring circuit used in most of the digital signal processing hardware
using Feynman & MUX gate. The proposed squaring circuit having less garbage
outputs, constant inputs, Quantum cost and Total logical calculation i.e. less
delay as compared to the traditional method of squaring operation by reversible
multiplier. The simulating results and quantized results are also shown in the
paper which shows the greatest improvement in the design against the previous
methodology.
|
[
{
"version": "v1",
"created": "Tue, 11 Feb 2014 10:01:15 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Dec 2014 03:35:20 GMT"
}
] | 2014-12-18T00:00:00 |
[
[
"Singla",
"Pradeep",
""
],
[
"Gautam",
"Devraj",
""
]
] |
new_dataset
| 0.998252 |
1412.4999
|
Medhat H. M. Elsayed Mr.
|
Medhat H. M. Elsayed, Amr A. El-Sherif, and Amr Mohamed
|
DDSAT: Distributed Dynamic Spectrum Access Protocol Implementation Using
GNURadio and USRP
|
6 pages, 9 figures, conference paper
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frequency spectrum is one of the valuable resources in wireless
communications. Using cognitive radio, spectrum efficiency will increase by
making use of the spectrum holes. Dynamic Spectrum Access techniques allows
secondary users to transmit on an empty channel not used by a primary user for
a given time. In this paper, a Distributed Dynamic Spectrum Access based TDMA
protocol (DDSAT) is designed and implemented on USRP. The proposed protocol
performs two main functions: Spectrum Sensing, and Spectrum Management.
Spectrum Sensing is performed to find spectrum holes in a co-operative manner
using the contributing secondary users. Spectrum Management works
distributively on the secondary users to allocate the spectrum holes in a
fairly and efficient utilization. The DDSAT protocol is implemented using
Software Defined Radio (SDR) and Universal Software Radio Peripheral (USRP).
Evaluation and performance tests are conducted to show throughput and fairness
of the system.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2014 13:56:38 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Dec 2014 06:08:34 GMT"
}
] | 2014-12-18T00:00:00 |
[
[
"Elsayed",
"Medhat H. M.",
""
],
[
"El-Sherif",
"Amr A.",
""
],
[
"Mohamed",
"Amr",
""
]
] |
new_dataset
| 0.999214 |
1412.5231
|
Rodrigo de Lamare
|
Y. Cai, R. C. de Lamare, L.L. Yang and M. Zhao
|
Robust MMSE Precoding for Multiuser MIMO Relay Systems using Switched
Relaying and Side Information
|
7 figures, 11 pages
|
IEEE Transactions on Vehicular Technology, 2014
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study proposes a novel precoding scheme for multiuser multiple-input
multiple-output (MIMO) relay systems in the presence of imperfect channel state
information (CSI). The base station (BS) and the MIMO relay station (RS) are
both equipped with the same codebook of unitary matrices. According to each
element of the codebook, we create a latent precoding matrix pair, namely a BS
precoding matrix and an RS precoding matrix. The RS precoding matrix is formed
by multiplying the appropriate unitary matrix from the codebook by a power
scaling factor. Based on the given CSI and a block of transmit symbols, the
optimum precoding matrix pair, within the class of all possible latent
precoding matrix pairs derived from the various unitary matrices, is selected
by a suitable selection mechanism for transmission, which is designed to
minimize the squared Euclidean distance between the pre-estimated received
vector and the true transmit symbol vector. We develop a minimum mean square
error (MMSE) design algorithm for the construction of the latent precoding
matrix pairs. In the proposed scheme, rather than sending the complete
processing matrix, only the index of the unitary matrix and its power scaling
factor are sent by the BS to the RS. This significantly reduces the overhead.
Simulation results show that compared to other recently reported precoding
algorithms the proposed precoding scheme is capable of providing improved
robustness against the effects of CSI estimation errors and multiuser
interference.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2014 00:25:12 GMT"
}
] | 2014-12-18T00:00:00 |
[
[
"Cai",
"Y.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Yang",
"L. L.",
""
],
[
"Zhao",
"M.",
""
]
] |
new_dataset
| 0.999252 |
1412.5517
|
Engelbert Mephu Nguifo
|
Jocelyn De Goer De Herve, Myoung-Ah Kang, Xavier Bailly, Engelbert
Mephu Nguifo
|
A perceptual hash function to store and retrieve large scale DNA
sequences
| null | null | null | null |
cs.CE q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a novel approach for storing and retrieving massive DNA
sequences.. The method is based on a perceptual hash function, commonly used to
determine the similarity between digital images, that we adapted for DNA
sequences. Perceptual hash function presented here is based on a Discrete
Cosine Transform Sign Only (DCT-SO). Each nucleotide is encoded as a fixed gray
level intensity pixel and the hash is calculated from its significant frequency
characteristics. This results to a drastic data reduction between the sequence
and the perceptual hash. Unlike cryptographic hash functions, perceptual hashes
are not affected by "avalanche effect" and thus can be compared. The similarity
distance between two hashes is estimated with the Hamming Distance, which is
used to retrieve DNA sequences. Experiments that we conducted show that our
approach is relevant for storing massive DNA sequences, and retrieving them.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2014 18:47:57 GMT"
}
] | 2014-12-18T00:00:00 |
[
[
"De Herve",
"Jocelyn De Goer",
""
],
[
"Kang",
"Myoung-Ah",
""
],
[
"Bailly",
"Xavier",
""
],
[
"Nguifo",
"Engelbert Mephu",
""
]
] |
new_dataset
| 0.99666 |
1402.5051
|
Eran Iceland
|
Eran Iceland and Alex Samorodnitsky
|
On Coset Leader Graphs of LDPC Codes
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our main technical result is that, in the coset leader graph of a linear
binary code of block length n, the metric balls spanned by constant-weight
vectors grow exponentially slower than those in $\{0,1\}^n$.
Following the approach of Friedman and Tillich (2006), we use this fact to
improve on the first linear programming bound on the rate of LDPC codes, as the
function of their minimal distance. This improvement, combined with the
techniques of Ben-Haim and Lytsin (2006), improves the rate vs distance bounds
for LDPC codes in a significant sub-range of relative distances.
|
[
{
"version": "v1",
"created": "Thu, 20 Feb 2014 15:49:49 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Dec 2014 19:04:49 GMT"
}
] | 2014-12-17T00:00:00 |
[
[
"Iceland",
"Eran",
""
],
[
"Samorodnitsky",
"Alex",
""
]
] |
new_dataset
| 0.999692 |
1411.4044
|
Todor Ivanov
|
Todor Ivanov, Raik Niemann, Sead Izberovic, Marten Rosselli, Karsten
Tolle, Roberto V. Zicari
|
Benchmarking DataStax Enterprise/Cassandra with HiBench
|
arXiv admin note: substantial text overlap with arXiv:1411.3811
| null | null |
Technical Report No. 2014-2
|
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report evaluates the new analytical capabilities of DataStax Enterprise
(DSE) [1] through the use of standard Hadoop workloads. In particular, we run
experiments with CPU and I/O bound micro-benchmarks as well as OLAP-style
analytical query workloads. The performed tests should show that DSE is capable
of successfully executing Hadoop applications without the need to adapt them
for the underlying Cassandra distributed storage system [2]. Due to the
Cassandra File System (CFS) [3], which supports the Hadoop Distributed File
System API, Hadoop stack applications should seamlessly run in DSE. The report
is structured as follows: Section 2 provides a brief description of the
technologies involved in our study. An overview of our used hardware and
software components of the experimental environment is given in Section 3. Our
benchmark methodology is defined in Section 4. The performed experiments
together with the evaluation of the results are presented in Section 5.
Finally, Section 6 concludes with lessons learned.
|
[
{
"version": "v1",
"created": "Fri, 14 Nov 2014 07:17:54 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Dec 2014 14:34:47 GMT"
}
] | 2014-12-17T00:00:00 |
[
[
"Ivanov",
"Todor",
""
],
[
"Niemann",
"Raik",
""
],
[
"Izberovic",
"Sead",
""
],
[
"Rosselli",
"Marten",
""
],
[
"Tolle",
"Karsten",
""
],
[
"Zicari",
"Roberto V.",
""
]
] |
new_dataset
| 0.98404 |
1412.4878
|
EPTCS
|
Marco T. Moraz\'an (Seton Hall University), Rosario Antunez (City
College of New York)
|
Functional Automata - Formal Languages for Computer Science Students
|
In Proceedings TFPIE 2014, arXiv:1412.4738
|
EPTCS 170, 2014, pp. 19-32
|
10.4204/EPTCS.170.2
| null |
cs.FL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An introductory formal languages course exposes advanced undergraduate and
early graduate students to automata theory, grammars, constructive proofs,
computability, and decidability. Programming students find these topics to be
challenging or, in many cases, overwhelming and on the fringe of Computer
Science. The existence of this perception is not completely absurd since
students are asked to design and prove correct machines and grammars without
being able to experiment nor get immediate feedback, which is essential in a
learning context. This article puts forth the thesis that the theory of
computation ought to be taught using tools for actually building computations.
It describes the implementation and the classroom use of a library, FSM,
designed to provide students with the opportunity to experiment and test their
designs using state machines, grammars, and regular expressions. Students are
able to perform random testing before proceeding with a formal proof of
correctness. That is, students can test their designs much like they do in a
programming course. In addition, the library easily allows students to
implement the algorithms they develop as part of the constructive proofs they
write. Providing students with this ability ought to be a new trend in the
formal languages classroom.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2014 05:13:41 GMT"
}
] | 2014-12-17T00:00:00 |
[
[
"Morazán",
"Marco T.",
"",
"Seton Hall University"
],
[
"Antunez",
"Rosario",
"",
"City\n College of New York"
]
] |
new_dataset
| 0.99935 |
1412.4881
|
EPTCS
|
Victor Winter (University of Nebraska at Omaha, USA)
|
Bricklayer: An Authentic Introduction to the Functional Programming
Language SML
|
In Proceedings TFPIE 2014, arXiv:1412.4738
|
EPTCS 170, 2014, pp. 33-49
|
10.4204/EPTCS.170.3
| null |
cs.CY cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Functional programming languages are seen by many as instrumental to
effectively utilizing the computational power of multi-core platforms. As a
result, there is growing interest to introduce functional programming and
functional thinking as early as possible within the computer science
curriculum. Bricklayer is an API, written in SML, that provides a set of
abstractions for creating LEGO artifacts which can be viewed using LEGO Digital
Designer. The goal of Bricklayer is to create a problem space (i.e., a set of
LEGO artifacts) that is accessible and engaging to programmers (especially
novice programmers) while providing an authentic introduction to the functional
programming language SML.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2014 05:14:31 GMT"
}
] | 2014-12-17T00:00:00 |
[
[
"Winter",
"Victor",
"",
"University of Nebraska at Omaha, USA"
]
] |
new_dataset
| 0.999714 |
1411.7282
|
Bo Yuan
|
Bo Yuan and Keshab K. Parhi
|
Successive Cancellation List Polar Decoder using Log-likelihood Ratios
|
accepted by 2014 Asilomar Conference on Signals, Systems, and
Computers
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Successive cancellation list (SCL) decoding algorithm is a powerful method
that can help polar codes achieve excellent error-correcting performance.
However, the current SCL algorithm and decoders are based on likelihood or
log-likelihood forms, which render high hardware complexity. In this paper, we
propose a log-likelihood-ratio (LLR)-based SCL (LLR-SCL) decoding algorithm,
which only needs half the computation and storage complexity than the
conventional one. Then, based on the proposed algorithm, we develop
low-complexity VLSI architectures for LLR-SCL decoders. Analysis results show
that the proposed LLR-SCL decoder achieves 50% reduction in hardware and 98%
improvement in hardware efficiency.
|
[
{
"version": "v1",
"created": "Wed, 26 Nov 2014 16:16:25 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Dec 2014 04:24:15 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Yuan",
"Bo",
""
],
[
"Parhi",
"Keshab K.",
""
]
] |
new_dataset
| 0.971807 |
1412.4130
|
Christopher Blake
|
Christopher Blake and Frank R. Kschischang
|
Energy Consumption of VLSI Decoders
|
Submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thompson's model of VLSI computation relates the energy of a computation to
the product of the circuit area and the number of clock cycles needed to carry
out the computation. It is shown that for any family of circuits implemented
according to this model, using any algorithm that performs decoding of a
codeword passed through a binary erasure channel, as the block length
approaches infinity either (a) the probability of block error is asymptotically
lower bounded by 1/2 or (b) the energy of the computation scales at least as
Omega(n(log n)^(1/2)), and so the energy of successful decoding, per decoded
bit, must scale at least as Omega((log n)^(1/2)). This implies that the average
energy per decoded bit must approach infinity for any sequence of codes that
approaches capacity. The analysis techniques used are then extended to the case
of serial computation, showing that if a circuit is restricted to serial
computation, then as block length approaches infinity, either the block error
probability is lower bounded by 1/2 or the energy scales at least as fast as
Omega(n log(n)). In a very general case that allows for the number of output
pins to vary with block length, it is shown that the average energy per decoded
bit must scale as Omega(n(log n)^(1/5)). A simple example is provided of a
class of circuits performing low-density parity-check decoding whose energy
complexity scales as O(n^2 log log n).
|
[
{
"version": "v1",
"created": "Fri, 12 Dec 2014 21:07:15 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Blake",
"Christopher",
""
],
[
"Kschischang",
"Frank R.",
""
]
] |
new_dataset
| 0.952235 |
1412.4168
|
Mo Zhao
|
Mo Zhao and Robert H. Blick
|
In-vivo Network of Sensors and Actuators
|
16 pages, 16 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An advanced system of sensors/actuators should allow the direct feedback of a
sensed signal into an actuation, e.g., an action potential propagation through
an axon or a special cell activity might be sensed and suppressed by an
actuator through voltage stimulation or chemical delivery. Such a complex
procedure of sensing and stimulation calls for direct communication among these
sensors and actuators. In addition, minimizing the sensor/actuator to the size
of a biological cell can enable the cell-level automatic therapy. For this
objective, we propose such an approach to form a peer-to-peer network of
\emph{in vivo} sensors/actuators (S/As) that can be deployed with or even
inside biological cells. The S/As can communicate with each other via
electromagnetic waves of optical frequencies. In comparison with the comparable
techniques including the radio-frequency identification (RFID) and the wireless
sensor network (WSN), this technique is well adapted for the cell-level
sensing-actuating tasks considering the requirements on size, actuation speed,
signal-collision avoidance, etc.
|
[
{
"version": "v1",
"created": "Sat, 13 Dec 2014 00:08:22 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Zhao",
"Mo",
""
],
[
"Blick",
"Robert H.",
""
]
] |
new_dataset
| 0.972718 |
1412.4224
|
Jiguang He
|
Jiguang He, Taejoon Kim, Hadi Ghauch, Kunpeng Liu, Guangjian Wang
|
Millimeter Wave MIMO Channel Tracking Systems
|
6 pages, 3 figures, conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider channel/subspace tracking systems for temporally correlated
millimeter wave (e.g., E-band) multiple-input multiple-output (MIMO) channels.
Our focus is given to the tracking algorithm in the non-line-of-sight (NLoS)
environment, where the transmitter and the receiver are equipped with hybrid
analog/digital precoder and combiner, respectively. In the absence of
straightforward time-correlated channel model in the millimeter wave MIMO
literature, we present a temporal MIMO channel evolution model for NLoS
millimeter wave scenarios. Considering that conventional MIMO channel tracking
algorithms in microwave bands are not directly applicable, we propose a new
channel tracking technique based on sequentially updating the precoder and
combiner. Numerical results demonstrate the superior channel tracking ability
of the proposed technique over independent sounding approach in the presented
channel model and the spatial channel model (SCM) adopted in 3GPP
specification.
|
[
{
"version": "v1",
"created": "Sat, 13 Dec 2014 11:40:40 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"He",
"Jiguang",
""
],
[
"Kim",
"Taejoon",
""
],
[
"Ghauch",
"Hadi",
""
],
[
"Liu",
"Kunpeng",
""
],
[
"Wang",
"Guangjian",
""
]
] |
new_dataset
| 0.979812 |
1412.4321
|
Mostafa Zaman Chowdhury
|
Mostafa Zaman Chowdhury, Nirzhar Saha, Sung Hun Chae, and Yeong Min
Jang
|
Handover Call Admission Control for Mobile Femtocells with Free-Space
Optical and Macrocellular Backbone Networks
| null |
Journal of Advanced Smart Convergence Vol.1 No.1 1-10 (2012)
|
10.7236/JASC2012.1.1.1
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The deployment of mobile femtocellular networks can enhance the service
quality for the users inside the vehicles. The deployment of mobile femtocells
generates a lot of handover calls. Also, numbers of group handover scenarios
are found in mobile femtocellular network deployment. The ability to seamlessly
switch between the femtocells and the macrocell networks is a key concern for
femtocell network deployment. However, until now there is no effective and
complete handover scheme for the mobile femtocell network deployment. Also
handover between the backhaul networks is a major concern for the mobile
femtocellular network deployment. In this paper, we propose handover control
between the access networks for the individual handover cases. Call flows for
the handover between the backhaul networks of the macrocell-to-macrocell case
are proposed in this paper. We also propose the link switching for the FSO
based backhaul networks. The proposed resource allocation scheme ensures the
negligible handover call dropping probability as well as higher bandwidth
utilization.
|
[
{
"version": "v1",
"created": "Sun, 14 Dec 2014 06:17:55 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Chowdhury",
"Mostafa Zaman",
""
],
[
"Saha",
"Nirzhar",
""
],
[
"Chae",
"Sung Hun",
""
],
[
"Jang",
"Yeong Min",
""
]
] |
new_dataset
| 0.994215 |
1412.4395
|
Rachel Gauci
|
Rachel Gauci
|
Dafny: Statically Verifying Functional Correctness
|
12 pages, 1 figure
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents the Dafny language and verifier, with a focus on
describing the main features of the language, including pre- and
postconditions, assertions, loop invariants, termination metrics, quantifiers,
predicates and frames. Examples of Dafny code are provided to illustrate the
use of each feature, and an overview of how Dafny translates programming code
into a mathematical proof of functional verification is presented. The report
also includes references to useful resources on Dafny, with mentions of related
works in the domain of specification languages.
|
[
{
"version": "v1",
"created": "Sun, 14 Dec 2014 19:04:47 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Gauci",
"Rachel",
""
]
] |
new_dataset
| 0.994702 |
1412.4406
|
Lidia Dobrescu
|
Lidia Dobrescu
|
Domotic Embedded System
| null | null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
This paper presents an original domotic embedded system for room temperature
monitoring. The OpenRemote is the main software interface between the user and
the system, but other software components and communication protocols are used,
such as 1-Wire protocol for temperature monitoring devices, RS-232 for the
central PC unit and OWFS software for remote control using Android mobile
devices. The system architecture consists in hardware and software components
to remote control a room temperature parameter for energy efficiency
increasing.
|
[
{
"version": "v1",
"created": "Sun, 14 Dec 2014 20:52:32 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Dobrescu",
"Lidia",
""
]
] |
new_dataset
| 0.999373 |
1412.4444
|
Oliver Kosut
|
Oliver Kosut and Lalitha Sankar
|
Asymptotics and Non-asymptotics for Universal Fixed-to-Variable Source
Coding
|
32 pages, 1 figure. Submitted to IEEE Transactions on Information
Theory, Dec. 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Universal fixed-to-variable lossless source coding for memoryless sources is
studied in the finite blocklength and higher-order asymptotics regimes. Optimal
third-order coding rates are derived for general fixed-to-variable codes and
for prefix codes. It is shown that the non-prefix Type Size code, in which
codeword lengths are chosen in ascending order of type class size, achieves the
optimal third-order rate and outperforms classical Two-Stage codes. Converse
results are proved making use of a result on the distribution of the empirical
entropy and Laplace's approximation. Finally, the fixed-to-variable coding
problem without a prefix constraint is shown to be essentially the same as the
universal guessing problem.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2014 01:43:36 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Kosut",
"Oliver",
""
],
[
"Sankar",
"Lalitha",
""
]
] |
new_dataset
| 0.999079 |
1412.4638
|
Magnus Skjegstad
|
Magnus Skjegstad, Anil Madhavapeddy, Jon Crowcroft
|
Kadupul: Livin' on the Edge with Virtual Currencies and Time-Locked
Puzzles
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Devices connected to the Internet today have a wide range of local
communication channels available, such as wireless Wifi, Bluetooth or NFC, as
well as wired backhaul. In densely populated areas it is possible to create
heterogeneous, multihop communication paths using a combination of these
technologies, and often transmit data with lower latency than via a wired
Internet connection. However, the potential for sharing meshed wireless radios
in this way has never been realised due to the lack of economic incentives to
do so on the part of individual nodes.
In this paper, we explore how virtual currencies such as Bitcoin might be
used to provide an end-to-end incentive scheme to convince forwarding nodes
that it is profitable to send packets on via the lowest latency mechanism
available. Clients inject a small amount of money to transmit a datagram, and
forwarding engines compete to solve a time-locked puzzle that can be claimed by
the node that delivers the result in the lowest latency. This approach
naturally extends congestion control techniques to a surge pricing model when
available bandwidth is low. We conclude by discussing several latency-sensitive
applications that would benefit for this, such as video streaming and local
augmented reality systems.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2014 15:31:05 GMT"
}
] | 2014-12-16T00:00:00 |
[
[
"Skjegstad",
"Magnus",
""
],
[
"Madhavapeddy",
"Anil",
""
],
[
"Crowcroft",
"Jon",
""
]
] |
new_dataset
| 0.999577 |
1412.3906
|
Christian Plessl
|
Marvin Damschen and Christian Plessl
|
Easy-to-Use On-the-Fly Binary Program Acceleration on Many-Cores
|
Part of ADAPT Workshop proceedings, 2015 (arXiv:1412.2347)
| null | null |
ADAPT/2015/05
|
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces Binary Acceleration At Runtime (BAAR), an easy-to-use
on-the-fly binary acceleration mechanism which aims to tackle the problem of
enabling existent software to automatically utilize accelerators at runtime.
BAAR is based on the LLVM Compiler Infrastructure and has a client-server
architecture. The client runs the program to be accelerated in an environment
which allows program analysis and profiling. Program parts which are identified
as suitable for the available accelerator are exported and sent to the server.
The server optimizes these program parts for the accelerator and provides RPC
execution for the client. The client transforms its program to utilize
accelerated execution on the server for offloaded program parts.
We evaluate our work with a proof-of-concept implementation of BAAR that uses
an Intel Xeon Phi 5110P as the acceleration target and performs automatic
offloading, parallelization and vectorization of suitable program parts. The
practicality of BAAR for real-world examples is shown based on a study of
stencil codes. Our results show a speedup of up to 4x without any
developer-provided hints and 5.77x with hints over the same code compiled with
the Intel Compiler at optimization level O2 and running on an Intel Xeon
E5-2670 machine. Based on our insights gained during implementation and
evaluation we outline future directions of research, e.g., offloading more
fine-granular program parts than functions, a more sophisticated communication
mechanism or introducing on-stack-replacement.
|
[
{
"version": "v1",
"created": "Fri, 12 Dec 2014 07:44:52 GMT"
}
] | 2014-12-15T00:00:00 |
[
[
"Damschen",
"Marvin",
""
],
[
"Plessl",
"Christian",
""
]
] |
new_dataset
| 0.988403 |
1412.3751
|
Rama Krishna Bandi
|
Rama Krishna Bandi, Maheshanand Bhaintwal
|
Negacyclic codes over Z4+uZ4
|
18 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study negacyclic codes of odd length and of length $2^k$
over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We give the complete
structure of negacyclic codes for both the cases. We have obtained a minimal
spanning set for negacyclic codes of odd lengths over $R$. A necessary and
sufficient condition for negacyclic codes of odd lengths to be free is
presented. We have determined the cardinality of negacyclic codes in each case.
We have obtained the structure of the duals of negacyclic codes of length $2^k$
over $R$ and also characterized self-dual negacyclic codes of length $2^k$ over
$R$.
|
[
{
"version": "v1",
"created": "Thu, 11 Dec 2014 18:28:49 GMT"
}
] | 2014-12-12T00:00:00 |
[
[
"Bandi",
"Rama Krishna",
""
],
[
"Bhaintwal",
"Maheshanand",
""
]
] |
new_dataset
| 0.999821 |
1412.3233
|
Christian Mayr
|
Christian Mayr, Johannes Partzsch, Marko Noack, Stefan H\"anzsche,
Stefan Scholze, Sebastian H\"oppner, Georg Ellguth, Rene Sch\"uffny
|
A Biological-Realtime Neuromorphic System in 28 nm CMOS using
Low-Leakage Switched Capacitor Circuits
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A switched-capacitor (SC) neuromorphic system for closed-loop neural coupling
in 28 nm CMOS is presented, occupying 600 um by 600 um. It offers 128 input
channels (i.e. presynaptic terminals), 8192 synapses and 64 output channels
(i.e. neurons). Biologically realistic neuron and synapse dynam- ics are
achieved via a faithful translation of the behavioural equations to SC
circuits. As leakage currents significantly affect circuit behaviour at this
technology node, dedicated compensation techniques are employed to achieve
biological-realtime operation, with faithful reproduction of time constants of
several 100 ms at room temperature. Power draw of the overall system is 1.9 mW.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2014 09:13:29 GMT"
}
] | 2014-12-11T00:00:00 |
[
[
"Mayr",
"Christian",
""
],
[
"Partzsch",
"Johannes",
""
],
[
"Noack",
"Marko",
""
],
[
"Hänzsche",
"Stefan",
""
],
[
"Scholze",
"Stefan",
""
],
[
"Höppner",
"Sebastian",
""
],
[
"Ellguth",
"Georg",
""
],
[
"Schüffny",
"Rene",
""
]
] |
new_dataset
| 0.991122 |
1307.2584
|
Emil Bj\"ornson
|
Emil Bj\"ornson, Jakob Hoydis, Marios Kountouris, M\'erouane Debbah
|
Massive MIMO Systems with Non-Ideal Hardware: Energy Efficiency,
Estimation, and Capacity Limits
|
To appear in IEEE Transactions on Information Theory, 28 pages, 15
figures. The results can be reproduced using the following Matlab code:
https://github.com/emilbjornson/massive-MIMO-hardware-impairments
|
IEEE Transactions on Information Theory, vol. 60, no. 11, pp.
7112-7139, November 2014
|
10.1109/TIT.2014.2354403
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of large-scale antenna arrays can bring substantial improvements in
energy and/or spectral efficiency to wireless systems due to the greatly
improved spatial resolution and array gain. Recent works in the field of
massive multiple-input multiple-output (MIMO) show that the user channels
decorrelate when the number of antennas at the base stations (BSs) increases,
thus strong signal gains are achievable with little inter-user interference.
Since these results rely on asymptotics, it is important to investigate whether
the conventional system models are reasonable in this asymptotic regime. This
paper considers a new system model that incorporates general transceiver
hardware impairments at both the BSs (equipped with large antenna arrays) and
the single-antenna user equipments (UEs). As opposed to the conventional case
of ideal hardware, we show that hardware impairments create finite ceilings on
the channel estimation accuracy and on the downlink/uplink capacity of each UE.
Surprisingly, the capacity is mainly limited by the hardware at the UE, while
the impact of impairments in the large-scale arrays vanishes asymptotically and
inter-user interference (in particular, pilot contamination) becomes
negligible. Furthermore, we prove that the huge degrees of freedom offered by
massive MIMO can be used to reduce the transmit power and/or to tolerate larger
hardware impairments, which allows for the use of inexpensive and
energy-efficient antenna elements.
|
[
{
"version": "v1",
"created": "Tue, 9 Jul 2013 20:05:59 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Jan 2014 13:16:35 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Sep 2014 19:05:06 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Björnson",
"Emil",
""
],
[
"Hoydis",
"Jakob",
""
],
[
"Kountouris",
"Marios",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.997825 |
1401.6030
|
Sergey Sysoev
|
Sergey Sysoev
|
The Effective Solving of the Tasks from NP by a Quantum Computer
|
The paper is submitted to the IEEE Transactions on Information Theory
journal
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The new model of quantum computation is proposed, for which an effective
algorithm of solving any task in NP is described. The work is based and
inspired be the Grover's algorithm for solving NP-tasks with quadratic speedup
compared to the classical computation model. The provided model and algorithm
exhibit the exponential speedup over that described by Grover.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 16:10:16 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Dec 2014 14:35:41 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Sysoev",
"Sergey",
""
]
] |
new_dataset
| 0.975254 |
1410.8635
|
Xiao Lu
|
Xiao Lu, Dusit Niyato, Ping Wang, Dong In Kim, and Zhu Han
|
Wireless Charger Networking for Mobile Devices: Fundamentals, Standards,
and Applications
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless charging is a technique of transmitting power through an air gap to
an electrical device for the purpose of energy replenishment. Recently, the
wireless charging technology has been significantly advanced in terms of
efficiency and functionality. This article first presents an overview and
fundamentals of wireless charging. We then provide the review of standards,
i.e., Qi and Alliance for Wireless Power (A4WP), and highlight on their
communication protocols. Next, we propose a novel concept of wireless charger
networking which allows chargers to be connected to facilitate information
collection and control. We demonstrate the application of the wireless charger
network in user-charger assignment, which clearly shows the benefit in terms of
reduced cost for users to identify the best chargers to replenish energy for
their mobile devices.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2014 04:41:57 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Dec 2014 05:46:50 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Lu",
"Xiao",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Wang",
"Ping",
""
],
[
"Kim",
"Dong In",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.999041 |
1411.1822
|
Manish Gupta
|
Manoj K. Raut and Manish K. Gupta
|
On Octonary Codes and their Covering Radii
|
16 pages, some errors fixed
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces new reduction and torsion codes for an octonary code
and determines their basic properties. These could be useful for the
classification of self-orthogonal and self dual codes over $\mathbb{Z}_8$. We
also focus our attention on covering radius problem of octonary codes. In
particular, we determine lower and upper bounds of the covering radius of
several classes of Repetition codes, Simplex codes of Type $\alpha$ and Type
$\beta$ and their duals, MacDonald codes, and Reed-Muller codes over
$\mathbb{Z}_8$.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 04:34:59 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Nov 2014 05:47:18 GMT"
},
{
"version": "v3",
"created": "Tue, 9 Dec 2014 07:17:35 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Raut",
"Manoj K.",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.999827 |
1412.2416
|
Johannes Stegmann Dr.
|
Johannes Stegmann
|
Paradigm shifts. Part II. Reverse Transcriptase. Analysis of reference
stability and word frequencies
|
10 pages, 7 tables, 1 figure, corrections
| null | null | null |
cs.DL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The reverse transcription paradigm shift in RNA tumor virus research marked
by the discovery of the reverse transcriptase in 1970 was traced using
co-citation and title word frequency analysis. It is shown that this event is
associated with a break in citation patterns and the occurrence of previously
unknown technical terms.
|
[
{
"version": "v1",
"created": "Sun, 7 Dec 2014 23:51:35 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Dec 2014 17:22:04 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Stegmann",
"Johannes",
""
]
] |
new_dataset
| 0.983399 |
1412.2821
|
Xiu-Li Wang
|
Xiuli Wang
|
Zipf's Law and the Frequency of Characters or Words of Oracles
| null | null | null | null |
cs.CL math.ST stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The article discusses the frequency of characters of Oracle,concluding that
the frequency and the rank of a word or character is fit to Zipf-Mandelboit Law
or Zipf's law with three parameters,and figuring out the parameters based on
the frequency,and pointing out that what some researchers of Oracle call the
assembling on the two ends is just a description by their impression about the
Oracle data.
|
[
{
"version": "v1",
"created": "Tue, 9 Dec 2014 00:39:16 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Wang",
"Xiuli",
""
]
] |
new_dataset
| 0.988415 |
1412.2908
|
Yassine Sadqi
|
Yassine Sadqi, Ahmed Asimi and Younes Asimi
|
A Cryptographic Mutual Authentication Scheme for Web Applications
|
15 pages, 2 figures,International Journal
|
International Journal of Network Security & Its Applications
(IJNSA) Vol.6, No.6, November 2014
|
10.5121/ijnsa.2014.6601
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The majority of current web authentication is built on username/password.
Unfortunately, password replacement offers more security, but it is difficult
to use and expensive to deploy. In this paper, we propose a new mutual
authentication scheme called StrongAuth which preserves most password
authentication advantages and simultaneously improves security using
cryptographic primitives. Our scheme not only offers webmasters a clear
framework which to build secure user authentication, but it also provides
almost the same conventional user experience. Security analysis shows that the
proposed scheme fulfills the required user authentication security benefits,
and can resist various possible attacks.
|
[
{
"version": "v1",
"created": "Tue, 9 Dec 2014 10:50:51 GMT"
}
] | 2014-12-10T00:00:00 |
[
[
"Sadqi",
"Yassine",
""
],
[
"Asimi",
"Ahmed",
""
],
[
"Asimi",
"Younes",
""
]
] |
new_dataset
| 0.999168 |
1412.0321
|
Jiajun Liu
|
Jiajun Liu, Kun Zhao, Philipp Sommer, Shuo Shang, Brano Kusy, Raja
Jurdak
|
Bounded Quadrant System: Error-bounded Trajectory Compression on the Go
|
International Conference on Data Engineering (ICDE) 2015, 12 pages
| null | null | null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long-term location tracking, where trajectory compression is commonly used,
has gained high interest for many applications in transport, ecology, and
wearable computing. However, state-of-the-art compression methods involve high
space-time complexity or achieve unsatisfactory compression rate, leading to
rapid exhaustion of memory, computation, storage and energy resources. We
propose a novel online algorithm for error-bounded trajectory compression
called the Bounded Quadrant System (BQS), which compresses trajectories with
extremely small costs in space and time using convex-hulls. In this algorithm,
we build a virtual coordinate system centered at a start point, and establish a
rectangular bounding box as well as two bounding lines in each of its
quadrants. In each quadrant, the points to be assessed are bounded by the
convex-hull formed by the box and lines. Various compression error-bounds are
therefore derived to quickly draw compression decisions without expensive error
computations. In addition, we also propose a light version of the BQS version
that achieves $\mathcal{O}(1)$ complexity in both time and space for processing
each point to suit the most constrained computation environments. Furthermore,
we briefly demonstrate how this algorithm can be naturally extended to the 3-D
case.
Using empirical GPS traces from flying foxes, cars and simulation, we
demonstrate the effectiveness of our algorithm in significantly reducing the
time and space complexity of trajectory compression, while greatly improving
the compression rates of the state-of-the-art algorithms (up to 47%). We then
show that with this algorithm, the operational time of the target
resource-constrained hardware platform can be prolonged by up to 41%.
|
[
{
"version": "v1",
"created": "Mon, 1 Dec 2014 01:14:42 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Dec 2014 14:49:37 GMT"
}
] | 2014-12-09T00:00:00 |
[
[
"Liu",
"Jiajun",
""
],
[
"Zhao",
"Kun",
""
],
[
"Sommer",
"Philipp",
""
],
[
"Shang",
"Shuo",
""
],
[
"Kusy",
"Brano",
""
],
[
"Jurdak",
"Raja",
""
]
] |
new_dataset
| 0.983368 |
1412.2158
|
Natarajan Meghanathan
|
Natarajan Meghanathan and Gordon Skelton
|
A Two-layer Architecture of Mobile Sinks and Static Sensors
|
11 pages, 1 figure
|
Proceedings of the 15th International Conference on Advanced
Computing and Communication, pp. 249-254, Guwahathi, India, December 2007
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a two-layer mobile sink and static sensor network (MSSSN)
architecture for large scale wireless sensor networks. The top layer is a
mobile ad hoc network of resource-rich sink nodes while the bottom layer is a
network of static resource-constrained sensor nodes. The MSSSN architecture can
be implemented at a lower cost with the currently available IEEE 802.11 devices
that only use a single halfduplex transceiver. Each sink node is assigned a
particular region to monitor and collect data. A sink node moves to the
vicinity of the sensor nodes (within a few hops) to collect data. The collected
data is exchanged with peer mobile sinks. Thus, the MSSSN architecture provides
scalability, extends sensor lifetime by letting them operate with limited
transmission range and provides connectivity between isolated regions of sensor
nodes. In order to provide fault tolerance, more than one mobile sink could be
collecting data from a given region or a mobile sink could collect data from
more than one region. In the later half of the paper, we discuss several open
research issues that need to be addressed while implementing the MSSSN
architecture.
|
[
{
"version": "v1",
"created": "Fri, 5 Dec 2014 21:48:12 GMT"
}
] | 2014-12-09T00:00:00 |
[
[
"Meghanathan",
"Natarajan",
""
],
[
"Skelton",
"Gordon",
""
]
] |
new_dataset
| 0.999141 |
1412.2257
|
Florian Schmidt
|
Florian Schmidt, Matteo Ceriotti, Niklas Hauser, Klaus Wehrle
|
HotBox: Testing Temperature Effects in Sensor Networks
|
18 pages, 6 figures, published as technical report of the Department
of Computer Science of RWTH Aachen University
| null | null |
AIB-2014-14
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-power wireless networks, especially in outside deployments, are exposed
to a wide range of temperatures. The detrimental effect of high temperatures on
communication quality is well known. To investigate these influences under
controlled conditions, we present HotBox, a solution with the following
properties: (1) It allows exposition of sensor motes to a wide range of
temperatures with a high degree of accuracy. (2) It supports specifying exact
spatial orientation of motes which, if not ensured, interferes with repeatable
experiment setups. (3) It is reasonably easy to assemble by following the
information (code, PCB schematics, hardware list and crafting instructions)
available online, facilitating further use of the platforms by other
researchers. After presenting HotBox, we will show its performance and prove
its feasibility as evaluation platform by conducting several experiments. These
experiments additionally provide further insight into the influence of
temperature effects on communication performance in low-power wireless
networks.
|
[
{
"version": "v1",
"created": "Sat, 6 Dec 2014 16:44:19 GMT"
}
] | 2014-12-09T00:00:00 |
[
[
"Schmidt",
"Florian",
""
],
[
"Ceriotti",
"Matteo",
""
],
[
"Hauser",
"Niklas",
""
],
[
"Wehrle",
"Klaus",
""
]
] |
new_dataset
| 0.992438 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.