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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1306.1286
|
Aditya Kanade
|
Shalini Kaleeswaran, Varun Tulsian, Aditya Kanade, Alessandro Orso
|
MintHint: Automated Synthesis of Repair Hints
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Being able to automatically repair programs is an extremely challenging task.
In this paper, we present MintHint, a novel technique for program repair that
is a departure from most of today's approaches. Instead of trying to fully
automate program repair, which is often an unachievable goal, MintHint performs
statistical correlation analysis to identify expressions that are likely to
occur in the repaired code and generates, using pattern-matching based
synthesis, repair hints from these expressions. Intuitively, these hints
suggest how to rectify a faulty statement and help developers find a complete,
actual repair. MintHint can address a variety of common faults, including
incorrect, spurious, and missing expressions.
We present a user study that shows that developers' productivity can improve
manyfold with the use of repair hints generated by MintHint -- compared to
having only traditional fault localization information. We also apply MintHint
to several faults of a widely used Unix utility program to further assess the
effectiveness of the approach. Our results show that MintHint performs well
even in situations where (1) the repair space searched does not contain the
exact repair, and (2) the operational specification obtained from the test
cases for repair is incomplete or even imprecise.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 02:20:54 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Sep 2013 07:08:40 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Kaleeswaran",
"Shalini",
""
],
[
"Tulsian",
"Varun",
""
],
[
"Kanade",
"Aditya",
""
],
[
"Orso",
"Alessandro",
""
]
] |
new_dataset
| 0.98412 |
1308.2428
|
Stevan Harnad
|
Olivier Picard, M\'elanie Lord, Alexandre Blondin-Mass\'e, Odile
Marcotte, Marcos Lopes and Stevan Harnad
|
Hidden Structure and Function in the Lexicon
|
11 pages, 5 figures, 2 tables
|
NLPCS 2013: 10th International Workshop on Natural Language
Processing and Cognitive Science, Marseille, France 15-16 October 2013
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How many words are needed to define all the words in a dictionary?
Graph-theoretic analysis reveals that about 10% of a dictionary is a unique
Kernel of words that define one another and all the rest, but this is not the
smallest such subset. The Kernel consists of one huge strongly connected
component (SCC), about half its size, the Core, surrounded by many small SCCs,
the Satellites. Core words can define one another but not the rest of the
dictionary. The Kernel also contains many overlapping Minimal Grounding Sets
(MGSs), each about the same size as the Core, each part-Core, part-Satellite.
MGS words can define all the rest of the dictionary. They are learned earlier,
more concrete and more frequent than the rest of the dictionary. Satellite
words, not correlated with age or frequency, are less concrete (more abstract)
words that are also needed for full lexical power.
|
[
{
"version": "v1",
"created": "Sun, 11 Aug 2013 20:50:27 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Sep 2013 12:06:55 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Picard",
"Olivier",
""
],
[
"Lord",
"Mélanie",
""
],
[
"Blondin-Massé",
"Alexandre",
""
],
[
"Marcotte",
"Odile",
""
],
[
"Lopes",
"Marcos",
""
],
[
"Harnad",
"Stevan",
""
]
] |
new_dataset
| 0.992205 |
1309.1783
|
Markus Blatt
|
Makus Blatt
|
DUNE as an Example of Sustainable Open Source Scientific Software
Development
| null | null | null | null |
cs.MS cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper we describe how DUNE, an open source scientific software
framework, is developed. Having a sustainable software framework for the
solution of partial differential equations is the main driver of DUNE's
development. We take a look how DUNE strives to stay sustainable software.
|
[
{
"version": "v1",
"created": "Fri, 6 Sep 2013 21:55:23 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Sep 2013 19:56:50 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Blatt",
"Makus",
""
]
] |
new_dataset
| 0.983666 |
1309.1812
|
Frank L\"offler
|
Frank L\"offler, Steven R. Brandt, Gabrielle Allen and Erik Schnetter
|
Cactus: Issues for Sustainable Simulation Software
|
submitted to the Workshop on Sustainable Software for Science:
Practice and Experiences 2013
| null | null | null |
cs.CE cs.MS cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
The Cactus Framework is an open-source, modular, portable programming
environment for the collaborative development and deployment of scientific
applications using high-performance computing. Its roots reach back to 1996 at
the National Center for Supercomputer Applications and the Albert Einstein
Institute in Germany, where its development jumpstarted. Since then, the Cactus
framework has witnessed major changes in hardware infrastructure as well as its
own community. This paper describes its endurance through these past changes
and, drawing upon lessons from its past, also discusses future
|
[
{
"version": "v1",
"created": "Sat, 7 Sep 2013 03:18:51 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Sep 2013 01:33:06 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Löffler",
"Frank",
""
],
[
"Brandt",
"Steven R.",
""
],
[
"Allen",
"Gabrielle",
""
],
[
"Schnetter",
"Erik",
""
]
] |
new_dataset
| 0.950339 |
1309.3917
|
Gaetan Marceau
|
Ga\'etan Marceau (INRIA Saclay - Ile de France, LRI), Pierre
Sav\'eant, Marc Schoenauer (INRIA Saclay - Ile de France, LRI)
|
Strategic Planning in Air Traffic Control as a Multi-objective
Stochastic Optimization Problem
|
ATM Seminar 2013 (2013)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the objective of handling the airspace sector congestion subject to
continuously growing air traffic, we suggest to create a collaborative working
plan during the strategic phase of air traffic control. The plan obtained via a
new decision support tool presented in this article consists in a schedule for
controllers, which specifies time of overflight on the different waypoints of
the flight plans. In order to do it, we believe that the decision-support tool
shall model directly the uncertainty at a trajectory level in order to
propagate the uncertainty to the sector level. Then, the probability of
congestion for any sector in the airspace can be computed. Since air traffic
regulations and sector congestion are antagonist, we designed and implemented a
multi-objective optimization algorithm for determining the best trade-off
between these two criteria. The solution comes up as a set of alternatives for
the multi-sector planner where the severity of the congestion cost is
adjustable. In this paper, the Non-dominated Sorting Genetic Algorithm
(NSGA-II) was used to solve an artificial benchmark problem involving 24
aircraft and 11 sectors, and is able to provide a good approximation of the
Pareto front.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 11:52:07 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Marceau",
"Gaétan",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Savéant",
"Pierre",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Schoenauer",
"Marc",
"",
"INRIA Saclay - Ile de France, LRI"
]
] |
new_dataset
| 0.988957 |
1309.4016
|
Yasmin AlNoamany
|
Yasmin AlNoamany, Ahmed AlSum, Michele C. Weigle, and Michael L.
Nelson
|
Who and What Links to the Internet Archive
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet Archive's (IA) Wayback Machine is the largest and oldest public
web archive and has become a significant repository of our recent history and
cultural heritage. Despite its importance, there has been little research about
how it is discovered and used. Based on web access logs, we analyze what users
are looking for, why they come to IA, where they come from, and how pages link
to IA. We find that users request English pages the most, followed by the
European languages. Most human users come to web archives because they do not
find the requested pages on the live web. About 65% of the requested archived
pages no longer exist on the live web. We find that more than 82% of human
sessions connect to the Wayback Machine via referrals from other web sites,
while only 15% of robots have referrers. Most of the links (86%) from websites
are to individual archived pages at specific points in time, and of those 83%
no longer exist on the live web.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 16:01:37 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"AlNoamany",
"Yasmin",
""
],
[
"AlSum",
"Ahmed",
""
],
[
"Weigle",
"Michele C.",
""
],
[
"Nelson",
"Michael L.",
""
]
] |
new_dataset
| 0.996388 |
1309.4067
|
Dima Kagan
|
Dima Kagan, Michael Fire, Aviad Elyashar, and Yuval Elovici
|
Facebook Applications' Installation and Removal: A Temporal Analysis
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facebook applications are one of the reasons for Facebook attractiveness.
Unfortunately, numerous users are not aware of the fact that many malicious
Facebook applications exist. To educate users, to raise users' awareness and to
improve Facebook users' security and privacy, we developed a Firefox add-on
that alerts users to the number of installed applications on their Facebook
profiles. In this study, we present the temporal analysis of the Facebook
applications' installation and removal dataset collected by our add-on. This
dataset consists of information from 2,945 users, collected during a period of
over a year. We used linear regression to analyze our dataset and discovered
the linear connection between the average percentage change of newly installed
Facebook applications and the number of days passed since the user initially
installed our add-on. Additionally, we found out that users who used our
Firefox add-on become more aware of their security and privacy installing on
average fewer new applications. Finally, we discovered that on average 86.4% of
Facebook users install an additional application every 4.2 days.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 18:56:45 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Kagan",
"Dima",
""
],
[
"Fire",
"Michael",
""
],
[
"Elyashar",
"Aviad",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.999593 |
1309.3307
|
Fatemeh Hamidi-Sepehr
|
Fatemeh Hamidi-Sepehr, Henry D. Pfister, Jean-Francois Chamberland
|
Delay-Sensitive Communication over Fading Channel: Queueing Behavior and
Code Parameter Selection
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article examines the queueing performance of communication systems that
transmit encoded data over unreliable channels. A fading formulation suitable
for wireless environments is considered where errors are caused by a discrete
channel with correlated behavior over time. Random codes and BCH codes are
employed as means to study the relationship between code-rate selection and the
queueing performance of point-to-point data links. For carefully selected
channel models and arrival processes, a tractable Markov structure composed of
queue length and channel state is identified. This facilitates the analysis of
the stationary behavior of the system, leading to evaluation criteria such as
bounds on the probability of the queue exceeding a threshold. Specifically,
this article focuses on system models with scalable arrival profiles, which are
based on Poisson processes, and finite-state channels with memory. These
assumptions permit the rigorous comparison of system performance for codes with
arbitrary block lengths and code rates. Based on the resulting
characterizations, it is possible to select the best code parameters for
delay-sensitive applications over various channels. The methodology introduced
herein offers a new perspective on the joint queueing-coding analysis of
finitestate channels with memory, and it is supported by numerical simulations.
|
[
{
"version": "v1",
"created": "Thu, 12 Sep 2013 21:14:18 GMT"
}
] | 2013-09-16T00:00:00 |
[
[
"Hamidi-Sepehr",
"Fatemeh",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Chamberland",
"Jean-Francois",
""
]
] |
new_dataset
| 0.983474 |
1212.4968
|
Adrian Ispas
|
Adrian Ispas, Xitao Gong, Christian Schneider, Gerd Ascheid, Reiner
Thom\"a
|
Dual-Polarized Ricean MIMO Channels: Modeling and Performance Assessment
|
submitted to the IEEE Transactions on Communications
| null |
10.1109/TCOMM.2013.082813.120976
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless communication systems, dual-polarized (DP) instead of
single-polarized (SP) multiple-input multiple-output (MIMO) transmission is
used to improve the spectral efficiency under certain conditions on the channel
and the signal-to-noise ratio (SNR). In order to identify these conditions, we
first propose a novel channel model for DP mobile Ricean MIMO channels for
which statistical channel parameters are readily obtained from a moment-based
channel decomposition. Second, we derive an approximation of the mutual
information (MI), which can be expressed as a function of those statistical
channel parameters. Based on this approximation, we characterize the required
SNR for a DP MIMO system to outperform an SP MIMO system in terms of the MI.
Finally, we apply our results to channel measurements at 2.53 GHz. We find
that, using the proposed channel decomposition and the approximation of the MI,
we are able to reproduce the (practically relevant) SNR values above which DP
MIMO systems outperform SP MIMO systems.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 10:33:58 GMT"
}
] | 2013-09-13T00:00:00 |
[
[
"Ispas",
"Adrian",
""
],
[
"Gong",
"Xitao",
""
],
[
"Schneider",
"Christian",
""
],
[
"Ascheid",
"Gerd",
""
],
[
"Thomä",
"Reiner",
""
]
] |
new_dataset
| 0.981719 |
1309.3173
|
Congzhe Cao
|
Congzhe Cao, Zesong Fei, Jinhong Yuan, Jingming Kuang
|
Low Complexity List Successive Cancellation Decoding of Polar Codes
|
5 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a low complexity list successive cancellation (LCLSC) decoding
algorithm to reduce complexity of traditional list successive cancellation
(LSC) decoding of polar codes while trying to maintain the LSC decoding
performance at the same time. By defining two thresholds, namely "likelihood
ratio (LR) threshold" and "Bhattacharyya parameter threshold", we classify the
reliability of each received information bit and the quality of each bit
channel. Based on this classification, we implement successive cancellation
(SC) decoding instead of LSC decoding when the information bits from "bad"
subchannels are received reliably and further attempt to skip LSC decoding for
the rest information bits in order to achieve a lower complexity compared to
full LSC decoding. Simulation results show that the complexity of LCLSC
decoding is much lower than LSC decoding and can be close to that of SC
decoding, especially in low code rate regions.
|
[
{
"version": "v1",
"created": "Thu, 12 Sep 2013 14:38:40 GMT"
}
] | 2013-09-13T00:00:00 |
[
[
"Cao",
"Congzhe",
""
],
[
"Fei",
"Zesong",
""
],
[
"Yuan",
"Jinhong",
""
],
[
"Kuang",
"Jingming",
""
]
] |
new_dataset
| 0.967377 |
1309.3195
|
Congzhe Cao
|
Zesong Fei, Congzhe Cao, Ming Xiao, Iqbal Hussain and Jingming Kuang
|
Improved LT Codes in Low Overhead Regions for Binary Erasure Channels
|
8 pages, 8 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study improved degree distribution for Luby Transform (LT) codes which
exhibits improved bit error rate performance particularly in low overhead
regions. We construct the degree distribution by modifying Robust Soliton
distribution. The performance of our proposed LT codes is evaluated and
compared to the conventional LT codes via And-Or tree analysis. Then we propose
a transmission scheme based on the proposed degree distribution to improve its
frame error rate in full recovery regions. Furthermore, the improved degree
distribution is applied to distributed multi-source relay networks and unequal
error protection. It is shown that our schemes achieve better performance and
reduced complexity especially in low overhead regions, compared with
conventional schemes.
|
[
{
"version": "v1",
"created": "Thu, 12 Sep 2013 15:28:27 GMT"
}
] | 2013-09-13T00:00:00 |
[
[
"Fei",
"Zesong",
""
],
[
"Cao",
"Congzhe",
""
],
[
"Xiao",
"Ming",
""
],
[
"Hussain",
"Iqbal",
""
],
[
"Kuang",
"Jingming",
""
]
] |
new_dataset
| 0.984068 |
1309.1805
|
Lynn Zentner
|
Lynn Zentner, Michael Zentner, Victoria Farnsworth, Michael McLennan,
Krishna Madhavan, and Gerhard Klimeck
|
nanoHUB.org: Experiences and Challenges in Software Sustainability for a
Large Scientific Community
|
4 pages, 1 figure, this version contains minor revisions to correct
an acronym, update a quotation, improve grammar, and add a reference
| null | null | null |
cs.SE cs.CE cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
Managing and growing a successful cyberinfrastructure such as nanoHUB.org
presents a variety of opportunities and challenges, particularly in regard to
software. This position paper details a number of those issues and how we have
approached them.
|
[
{
"version": "v1",
"created": "Sat, 7 Sep 2013 02:17:57 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Sep 2013 17:18:17 GMT"
}
] | 2013-09-12T00:00:00 |
[
[
"Zentner",
"Lynn",
""
],
[
"Zentner",
"Michael",
""
],
[
"Farnsworth",
"Victoria",
""
],
[
"McLennan",
"Michael",
""
],
[
"Madhavan",
"Krishna",
""
],
[
"Klimeck",
"Gerhard",
""
]
] |
new_dataset
| 0.959291 |
1309.2679
|
Eduardo Graells-Garrido
|
Eduardo Graells-Garrido and Ricardo Baeza-Yates
|
Caracterizando la Web Chilena
|
In Spanish. Published in "Revista Bits de Ciencia" vol. 2, 2009.
Department of Computer Science, University of Chile. Available in
http://www.dcc.uchile.cl/revista
| null | null | null |
cs.SI
|
http://creativecommons.org/licenses/by/3.0/
|
This article presents a characterization of the web space from Chile in 2007.
The characterization shows distributions of sites and domains, analysis of
document content and server configuration. In addition, the network structure
of the chilean Web is analyzed, determining components based on hyperlink
structure at the document and site levels.
Original Abstract: En este art\'iculo se muestra una caracterizaci\'on del
espacio web de Chile para el a\~no 2007. Se muestran distribuciones de sitios y
dominios, caracterizaci\'on del contenido en base a tipos de documento, asi
como configuraci\'on de los servidores. Se estudia la estructura de la red
creada mediante hiperv\'inculos en los documentos y c\'omo las diferentes
componentes de esta estructura var\'ian cuando los hiperv\'inculos son
agregados a nivel de sitios.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 21:47:56 GMT"
}
] | 2013-09-12T00:00:00 |
[
[
"Graells-Garrido",
"Eduardo",
""
],
[
"Baeza-Yates",
"Ricardo",
""
]
] |
new_dataset
| 0.99907 |
1309.2687
|
Han Su
|
Han Su
|
CrowdPlanner: A Crowd-Based Route Recommendation System
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CrowdPlanner -- a novel crowd-based route recommendation system has been
developed, which requests human workers to evaluate candidates routes
recommended by different sources and methods, and determine the best route
based on the feedbacks of these workers. Our system addresses two critical
issues in its core components: a) task generation component generates a series
of informative and concise questions with optimized ordering for a given
candidate route set so that workers feel comfortable and easy to answer; and b)
worker selection component utilizes a set of selection criteria and an
efficient algorithm to find the most eligible workers to answer the questions
with high accuracy.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 23:06:57 GMT"
}
] | 2013-09-12T00:00:00 |
[
[
"Su",
"Han",
""
]
] |
new_dataset
| 0.990254 |
1309.2693
|
Victor Pillac
|
Victor Pillac and Pascal Van Henetenryck and Caroline Even
|
A Conflict-Based Path-Generation Heuristic for Evacuation Planning
|
Technical report
| null | null |
NICTA VRL-7393
|
cs.AI math.OC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Evacuation planning and scheduling is a critical aspect of disaster
management and national security applications. This paper proposes a
conflict-based path-generation approach for evacuation planning. Its key idea
is to generate evacuation routes lazily for evacuated areas and to optimize the
evacuation over these routes in a master problem. Each new path is generated to
remedy conflicts in the evacuation and adds new columns and a new row in the
master problem. The algorithm is applied to massive flood scenarios in the
Hawkesbury-Nepean river (West Sydney, Australia) which require evacuating in
the order of 70,000 persons. The proposed approach reduces the number of
variables from 4,500,000 in a Mixed Integer Programming (MIP) formulation to
30,000 in the case study. With this approach, realistic evacuations scenarios
can be solved near-optimally in real time, supporting both evacuation planning
in strategic, tactical, and operational environments.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 23:42:57 GMT"
}
] | 2013-09-12T00:00:00 |
[
[
"Pillac",
"Victor",
""
],
[
"Van Henetenryck",
"Pascal",
""
],
[
"Even",
"Caroline",
""
]
] |
new_dataset
| 0.998526 |
1309.2842
|
Amelie Stainer
|
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amelie Stainer
|
Emptiness and Universality Problems in Timed Automata with Positive
Frequency
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The languages of infinite timed words accepted by timed automata are
traditionally defined using Buchi-like conditions. These acceptance conditions
focus on the set of locations visited infinitely often along a run, but
completely ignore quantitative timing aspects. In this paper we propose a
natural quantitative semantics for timed automata based on the so-called
frequency, which measures the proportion of time spent in the accepting
locations. We study various properties of timed languages accepted with
positive frequency, and in particular the emptiness and universality problems.
|
[
{
"version": "v1",
"created": "Wed, 11 Sep 2013 14:33:19 GMT"
}
] | 2013-09-12T00:00:00 |
[
[
"Bertrand",
"Nathalie",
""
],
[
"Bouyer",
"Patricia",
""
],
[
"Brihaye",
"Thomas",
""
],
[
"Stainer",
"Amelie",
""
]
] |
new_dataset
| 0.997901 |
1309.1049
|
F\'elix Cuadrado
|
Luis Vaquero, Felix Cuadrado, Dionysios Logothetis and Claudio
Martella
|
xDGP: A Dynamic Graph Processing System with Adaptive Partitioning
|
13 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many real-world systems, such as social networks, rely on mining efficiently
large graphs, with hundreds of millions of vertices and edges. This volume of
information requires partitioning the graph across multiple nodes in a
distributed system. This has a deep effect on performance, as traversing edges
cut between partitions incurs a significant performance penalty due to the cost
of communication. Thus, several systems in the literature have attempted to
improve computational performance by enhancing graph partitioning, but they do
not support another characteristic of real-world graphs: graphs are inherently
dynamic, their topology evolves continuously, and subsequently the optimum
partitioning also changes over time.
In this work, we present the first system that dynamically repartitions
massive graphs to adapt to structural changes. The system optimises graph
partitioning to prevent performance degradation without using data replication.
The system adopts an iterative vertex migration algorithm that relies on local
information only, making complex coordination unnecessary. We show how the
improvement in graph partitioning reduces execution time by over 50%, while
adapting the partitioning to a large number of changes to the graph in three
real-world scenarios.
|
[
{
"version": "v1",
"created": "Wed, 4 Sep 2013 14:36:17 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Sep 2013 09:01:55 GMT"
},
{
"version": "v3",
"created": "Tue, 10 Sep 2013 15:59:50 GMT"
}
] | 2013-09-11T00:00:00 |
[
[
"Vaquero",
"Luis",
""
],
[
"Cuadrado",
"Felix",
""
],
[
"Logothetis",
"Dionysios",
""
],
[
"Martella",
"Claudio",
""
]
] |
new_dataset
| 0.995978 |
1309.2458
|
Karthik Reddy g
|
Karthik Reddy. G (Department of Electronics and Communication
Engineering, G. Pulla Reddy Engineering college, Kurnool, A.P, India)
|
Low power-area designs of 1bit full adder in cadence virtuoso platform
|
10 pages
|
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.4, No.4,page no. 55-64, August 2013
|
10.5121/vlsic.2013.4406
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Power consumption has emerged as a primary design constraint for integrated
circuits (ICs). In the Nano meter technology regime, leakage power has become a
major component of total power. Full adder is the basic functional unit of an
ALU. The power consumption of a processor is lowered by lowering the power
consumption of an ALU, and the power consumption of an ALU can be lowered by
lowering the power consumption of Full adder. So the full adder designs with
low power characteristics are becoming more popular these days. This proposed
work illustrates the design of the low-power less transistor full adder designs
using cadence tool and virtuoso platform, the entire simulations have been done
on 180nm single n-well CMOS bulk technology, in virtuoso platform of cadence
tool with the supply voltage 1.8V and frequency of 100MHz. These circuits
consume less power with maximum (6T design)of 93.1% power saving compare to
conventional 28T design and 80.2% power saving compare to SERF design without
much delay degradation. The proposed circuit exploits the advantage of GDI
technique and pass transistor logic
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 11:19:15 GMT"
}
] | 2013-09-11T00:00:00 |
[
[
"G",
"Karthik Reddy.",
"",
"Department of Electronics and Communication\n Engineering, G. Pulla Reddy Engineering college, Kurnool, A.P, India"
]
] |
new_dataset
| 0.988139 |
1309.2476
|
Rakesh Mohanty
|
Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash, Burle Sharma
|
TRANS outperforms MTF for two special types of request sequences without
locality of reference
|
9 Pages, Proceedings of International Conference on Communication,
Computing and Security (ICCCS)-2012, India.
http://www.sciencedirect.com/science/article/pii/S2212017312006123
|
Procedia Technology, Elsevier, Vol 6, pages 556-563, 2012
| null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various list accessing algorithms have been proposed in the literature and
their performances have been analyzed theoretically and experimentally.
Move-To-Front (MTF) and Transpose (TRANS) are two well known primitive list
accessing algorithms. MTF has been proved to be the best performing online
algorithm till date in the literature for real life inputs and practical
applications with locality of reference. It has been shown that when storage
space is extremely limited and pointers for lists cannot be used, then array
implementation of TRANS gives efficient reorganization. Use of MTF is extensive
in the literature whereas, the use of TRANS is rare. As mentioned as an open
problem in literature, direct bounds on the behavior and performance of various
list accessing algorithms are needed to allow realistic comparisons. Since it
has been shown that no single optimal permutation algorithm exists, it becomes
necessary to characterize the circumstances that indicate the advantage in
using a particular list accessing algorithm. Motivated by above challenging
research issue, in this paper we have made an analytical study for evaluating
the performance of TRANS list accessing algorithm using two special types of
request sequences without locality of reference. We have compared the
performance of TRANS with MTF and observed that TRANS outperforms MTF for these
considered types of request sequences.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 12:24:50 GMT"
}
] | 2013-09-11T00:00:00 |
[
[
"Mohanty",
"Rakesh",
""
],
[
"Patel",
"Sangita",
""
],
[
"Dash",
"Shiba Prasad",
""
],
[
"Sharma",
"Burle",
""
]
] |
new_dataset
| 0.98748 |
1302.0347
|
Roohallah Rastaghi
|
Roohallah Rastaghi
|
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the
Standard Model
|
Submited. arXiv admin note: text overlap with arXiv:1205.5224 by
other authors
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, a few chosen-ciphertext secure (CCA2-secure) variants of the
McEliece public-key encryption (PKE) scheme in the standard model were
introduced. All the proposed schemes are based on encryption repetition
paradigm and use general transformation from CPA-secure scheme to a CCA2-secure
one. Therefore, the resulting encryption scheme needs \textit{separate}
encryption and has \textit{large} key size compared to the original scheme,
which complex public key size problem in the code-based PKE schemes. Thus, the
proposed schemes are not sufficiently efficient to be used in practice.
In this work, we propose an efficient CCA2-secure variant of the McEliece PKE
scheme in the standard model. The main novelty is that, unlike previous
approaches, our approach is a generic conversion and can be applied to
\textit{any} one-way trapdoor function (OW-TDF), the lowest-level security
notion in the context of public-key cryptography, resolving a big fundamental
and central problem that has remained unsolved in the past two decades.
|
[
{
"version": "v1",
"created": "Sat, 2 Feb 2013 05:52:09 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jul 2013 19:39:29 GMT"
},
{
"version": "v3",
"created": "Fri, 30 Aug 2013 17:47:45 GMT"
},
{
"version": "v4",
"created": "Sat, 7 Sep 2013 14:17:58 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Rastaghi",
"Roohallah",
""
]
] |
new_dataset
| 0.994683 |
1305.3941
|
Tony Shaska
|
A. Elezi, T. Shaska
|
Quantum codes from superelliptic curves
|
The article has been posted without journal's permission and must be
withdrawn
|
Albanian J. Math. 5 (2011), no. 4, 175--191
| null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field
$\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can
construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal
under the symplectic product then we can construct a quantum code $Q$, called a
QAG-code. In this paper we study the construction of such codes from curves
with automorphisms and the relation between the automorphism group of the curve
$\X$ and the codes $C$ and $Q$.
|
[
{
"version": "v1",
"created": "Thu, 16 May 2013 21:53:40 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Aug 2013 17:30:19 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Sep 2013 12:22:17 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Elezi",
"A.",
""
],
[
"Shaska",
"T.",
""
]
] |
new_dataset
| 0.988531 |
1309.2057
|
Sapan Naik j
|
Sapan Naik and Nikunj Patel
|
Single image super resolution in spatial and wavelet domain
|
10 pages, 5 figures, 1 table, sample code given
|
The International Journal of Multimedia & Its Applications (IJMA)
Vol.5, No.4, August 2013
|
10.5121/ijma.2013.5402
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently single image super resolution is very important research area to
generate high resolution image from given low resolution image. Algorithms of
single image resolution are mainly based on wavelet domain and spatial domain.
Filters support to model the regularity of natural images is exploited in
wavelet domain while edges of images get sharp during up sampling in spatial
domain. Here single image super resolution algorithm is presented which based
on both spatial and wavelet domain and take the advantage of both. Algorithm is
iterative and use back projection to minimize reconstruction error. Wavelet
based denoising method is also introduced to remove noise.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 07:33:50 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Naik",
"Sapan",
""
],
[
"Patel",
"Nikunj",
""
]
] |
new_dataset
| 0.992387 |
1309.2086
|
Pedro Neto
|
Pedro Neto, Nuno Mendes, Ricardo Ara\'ujo, J. Norberto Pires, A. Paulo
Moreira
|
High-level robot programming based on CAD: dealing with unpredictable
environments
|
Industrial Robot: An International Journal
|
Industrial Robot: An International Journal, Vol. 39 Iss: 3, 2012,
pp.294 - 303
|
10.1108/01439911211217125
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose - The purpose of this paper is to present a CAD-based human-robot
interface that allows non-expert users to teach a robot in a manner similar to
that used by human beings to teach each other.
Design/methodology/approach - Intuitive robot programming is achieved by
using CAD drawings to generate robot programs off-line. Sensory feedback allows
minimization of the effects of uncertainty, providing information to adjust the
robot paths during robot operation.
Findings - It was found that it is possible to generate a robot program from
a common CAD drawing and run it without any major concerns about calibration or
CAD model accuracy.
Research limitations/implications - A limitation of the proposed system has
to do with the fact that it was designed to be used for particular
technological applications.
Practical implications - Since most manufacturing companies have CAD packages
in their facilities today, CAD-based robot programming may be a good option to
program robots without the need for skilled robot programmers.
Originality/value - The paper proposes a new CAD-based robot programming
system. Robot programs are directly generated from a CAD drawing running on a
commonly available 3D CAD package (Autodesk Inventor) and not from a
commercial, computer aided robotics (CAR) software, making it a simple CAD
integrated solution. This is a low-cost and low-setup time system where no
advanced robot programming skills are required to operate it. In summary, robot
programs are generated with a high-level of abstraction from the robot
language.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 09:46:38 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Neto",
"Pedro",
""
],
[
"Mendes",
"Nuno",
""
],
[
"Araújo",
"Ricardo",
""
],
[
"Pires",
"J. Norberto",
""
],
[
"Moreira",
"A. Paulo",
""
]
] |
new_dataset
| 0.986081 |
1309.2090
|
Pedro Neto
|
Pedro Neto, Norberto Pires, Paulo Moreira
|
Accelerometer-based control of an industrial robotic arm
|
The 18th IEEE International Symposium on Robot and Human Interactive
Communication, 2009. RO-MAN 2009. pp. 1192-1197, Toyama, Japan, 2009
| null |
10.1109/ROMAN.2009.5326285
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of industrial robots are still programmed using the typical teaching
process, through the use of the robot teach pendant. In this paper is proposed
an accelerometer-based system to control an industrial robot using two low-cost
and small 3-axis wireless accelerometers. These accelerometers are attached to
the human arms, capturing its behavior (gestures and postures). An Artificial
Neural Network (ANN) trained with a back-propagation algorithm was used to
recognize arm gestures and postures, which then will be used as input in the
control of the robot. The aim is that the robot starts the movement almost at
the same time as the user starts to perform a gesture or posture (low response
time). The results show that the system allows the control of an industrial
robot in an intuitive way. However, the achieved recognition rate of gestures
and postures (92%) should be improved in future, keeping the compromise with
the system response time (160 milliseconds). Finally, the results of some tests
performed with an industrial robot are presented and discussed.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 09:54:08 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Neto",
"Pedro",
""
],
[
"Pires",
"Norberto",
""
],
[
"Moreira",
"Paulo",
""
]
] |
new_dataset
| 0.998861 |
1309.2093
|
Pedro Neto
|
Pedro Neto, Norberto Pires, Paulo Moreira
|
High-level programming and control for industrial robotics: using a
hand-held accelerometer-based input device for gesture and posture
recognition
|
Industrial Robot: An International Journal
|
Industrial Robot: An International Journal, Vol. 37 Iss: 2, 2010,
pp.137 - 147
|
10.1108/01439911011018911
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose - Most industrial robots are still programmed using the typical
teaching process, through the use of the robot teach pendant. This is a tedious
and time-consuming task that requires some technical expertise, and hence new
approaches to robot programming are required. The purpose of this paper is to
present a robotic system that allows users to instruct and program a robot with
a high-level of abstraction from the robot language.
Design/methodology/approach - The paper presents in detail a robotic system
that allows users, especially non-expert programmers, to instruct and program a
robot just showing it what it should do, in an intuitive way. This is done
using the two most natural human interfaces (gestures and speech), a force
control system and several code generation techniques. Special attention will
be given to the recognition of gestures, where the data extracted from a motion
sensor (three-axis accelerometer) embedded in the Wii remote controller was
used to capture human hand behaviours. Gestures (dynamic hand positions) as
well as manual postures (static hand positions) are recognized using a
statistical approach and artificial neural networks.
Practical implications - The key contribution of this paper is that it offers
a practical method to program robots by means of gestures and speech, improving
work efficiency and saving time.
Originality/value - This paper presents an alternative to the typical robot
teaching process, extending the concept of human-robot interaction and
co-worker scenario. Since most companies do not have engineering resources to
make changes or add new functionalities to their robotic manufacturing systems,
this system constitutes a major advantage for small- to medium-sized
enterprises.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 09:58:22 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Neto",
"Pedro",
""
],
[
"Pires",
"Norberto",
""
],
[
"Moreira",
"Paulo",
""
]
] |
new_dataset
| 0.995229 |
1309.2137
|
Mike M\"uller
|
Tero Harju and Mike M\"uller
|
Square-Free Shuffles of Words
| null | null | null | null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$.
It is shown that for each integer $n \geq 3$ there exists a square-free ternary
word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word.
This property is then shown to also hold for infinite words, i.e., there exists
an infinite square-free word $u$ on three letters such that $u$ can be shuffled
with itself to produce an infinite square-free word $w \in u \shuffle u$.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 12:47:07 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Harju",
"Tero",
""
],
[
"Müller",
"Mike",
""
]
] |
new_dataset
| 0.998362 |
1309.2139
|
Yongxin Wang
|
Yongxin Wang, Kumbesan Sandrasegaran, Xinning Zhu, Jingjing Fei,
Xiaoying Kong and Cheng-Chung Lin
|
Frequency and time domain packet scheduling based on channel prediction
with imperfect CQI in LTE
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel-dependent scheduling of transmission of data packets in a wireless
system is based on measurement and feedback of the channel quality. To
alleviate the performance degradation due to simultaneous multiple imperfect
channel quality information (CQI), a simple and efficient packet scheduling
(PS) algorithm is developed in downlink LTE system for real time traffic. A
frequency domain channel predictor based on Kalman filter is first developed to
restore the true CQI from erroneous channel quality feedback. Then, a time
domain grouping technique employing the joint of Proportional Fair (PF) and
Modified Largest Weighted Delay First (M-LWDF) algorithms is used. It was
proved this proposal achieves better performance in terms of system throughput
and packet loss ratio by simulation results.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 12:50:27 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Wang",
"Yongxin",
""
],
[
"Sandrasegaran",
"Kumbesan",
""
],
[
"Zhu",
"Xinning",
""
],
[
"Fei",
"Jingjing",
""
],
[
"Kong",
"Xiaoying",
""
],
[
"Lin",
"Cheng-Chung",
""
]
] |
new_dataset
| 0.960563 |
1309.2250
|
Ram Chandra Chauhan
|
R. C. S. Chauhan, Y. N. Singh, R. Asthana
|
A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar
(Optical) Orthogonal Codes with Same Code-length and Low Weight
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a search algorithm to find multiple sets of one
dimensional unipolar (optical) orthogonal codes characterized by parameters,
binary code sequence of length (n bits) and weight w (number of bit 1s in the
sequence) as well as auto-correlation and cross-correlation constraint
respectively for the codes within a set. For a given code length n and code
weight w all possible difference sets, with auto-correlation constraints lying
from 1 to w-1 can be designed with distinct code serial number. For given
cross-correlation constraint from 1 to w-1 Multiple sets can be searched out of
the codes with auto-correlation constraints less than or equal to given
auto-correlation constraint using proposed algorithm. The searched multiple
sets can be sorted as having number of codes not less than the upper bound of
the sets given by Johnson bound. These one dimensional unipolar orthogonal
codes have their application in incoherent optical code division multiple
access systems.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 18:33:36 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Chauhan",
"R. C. S.",
""
],
[
"Singh",
"Y. N.",
""
],
[
"Asthana",
"R.",
""
]
] |
new_dataset
| 0.99567 |
1309.2254
|
Ram Chandra Chauhan
|
Ram Chandra Singh Chauhan (MIEEE), Yatindra Nath Singh (SMIEEE),
Rachna Asthana (MIEEE)
|
Design of Two Dimensional Unipolar (Optical) Orthogonal Codes Through
One Dimensional Unipolar (Optical) Orthogonal Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an algorithm for construction of multiple sets of two
dimensional (2D) or matrix unipolar (optical) orthogonal codes has been
proposed. Representations of these 2D codes in difference of positions
representation (DoPR) have also been discussed along-with conventional weighted
positions representation (WPR) of the code. This paper also proposes less
complex methods for calculation of auto-correlation as well as
cross-correlation constraints within set of matrix codes. The multiple sets of
matrix codes provide flexibility for selection of optical orthogonal codes set
in wavelength-hopping time-spreading (WHTS) optical code division multiple
access (CDMA) system.
|
[
{
"version": "v1",
"created": "Mon, 9 Sep 2013 18:42:45 GMT"
}
] | 2013-09-10T00:00:00 |
[
[
"Chauhan",
"Ram Chandra Singh",
"",
"MIEEE"
],
[
"Singh",
"Yatindra Nath",
"",
"SMIEEE"
],
[
"Asthana",
"Rachna",
"",
"MIEEE"
]
] |
new_dataset
| 0.991314 |
1304.6316
|
Maurice Margenstern
|
Maurice Margenstern
|
About Strongly Universal Cellular Automata
|
In Proceedings MCU 2013, arXiv:1309.1043
|
EPTCS 128, 2013, pp. 93-125
|
10.4204/EPTCS.128.17
| null |
cs.DM nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we construct a strongly universal cellular automaton on the
line with 11 states and the standard neighbourhood. We embed this construction
into several tilings of the hyperbolic plane and of the hyperbolic 3D space
giving rise to strongly universal cellular automata with 10 states.
|
[
{
"version": "v1",
"created": "Tue, 23 Apr 2013 15:20:11 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Sep 2013 01:33:16 GMT"
}
] | 2013-09-09T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.980942 |
1309.1543
|
Oluwagbenga Ogunduyile O
|
O.A. Randle, O. O. Ogunduyile, T. Zuva, N. A. Fashola
|
A Comparism of the Performance of Supervised and Unsupervised Machine
Learning Techniques in evolving Awale/Mancala/Ayo Game Player
|
10 pages, 2 figures
|
International Journal of Game Theory and Technology (IJGTT),
Vol.1, No.1, June 2013
| null | null |
cs.LG cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Awale games have become widely recognized across the world, for their
innovative strategies and techniques which were used in evolving the agents
(player) and have produced interesting results under various conditions. This
paper will compare the results of the two major machine learning techniques by
reviewing their performance when using minimax, endgame database, a combination
of both techniques or other techniques, and will determine which are the best
techniques.
|
[
{
"version": "v1",
"created": "Fri, 6 Sep 2013 06:06:15 GMT"
}
] | 2013-09-09T00:00:00 |
[
[
"Randle",
"O. A.",
""
],
[
"Ogunduyile",
"O. O.",
""
],
[
"Zuva",
"T.",
""
],
[
"Fashola",
"N. A.",
""
]
] |
new_dataset
| 0.976185 |
1309.1714
|
Jalil Boukhobza
|
Pierre Olivier (Lab-STICC), Jalil Boukhobza (Lab-STICC), Eric Senn
(Lab-STICC)
|
Flashmon V2: Monitoring Raw NAND Flash Memory I/O Requests on Embedded
Linux
|
EWiLi, the Embedded Operating Systems Workshop, Toulouse : France
(2013)
| null | null | null |
cs.OS cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents Flashmon version 2, a tool for monitoring embedded Linux
NAND flash memory I/O requests. It is designed for embedded boards based
devices containing raw flash chips. Flashmon is a kernel module and stands for
"flash monitor". It traces flash I/O by placing kernel probes at the NAND
driver level. It allows tracing at runtime the 3 main flash operations: page
reads / writes and block erasures. Flashmon is (1) generic as it was
successfully tested on the three most widely used flash file systems that are
JFFS2, UBIFS and YAFFS, and several NAND chip models. Moreover, it is (2) non
intrusive, (3) has a controllable memory footprint, and (4) exhibits a low
overhead (<6%) on the traced system. Finally, it is (5) simple to integrate and
used as a standalone module or as a built-in function / module in existing
kernel sources. Monitoring flash memory operations allows a better
understanding of existing flash management systems by studying and analyzing
their behavior. Moreover it is useful in development phase for prototyping and
validating new solutions.
|
[
{
"version": "v1",
"created": "Fri, 6 Sep 2013 18:14:04 GMT"
}
] | 2013-09-09T00:00:00 |
[
[
"Olivier",
"Pierre",
"",
"Lab-STICC"
],
[
"Boukhobza",
"Jalil",
"",
"Lab-STICC"
],
[
"Senn",
"Eric",
"",
"Lab-STICC"
]
] |
new_dataset
| 0.99948 |
1202.2907
|
Yun Song
|
Yun Song, Zhihui Li
|
The weight Enumerator of some irreducible cyclic codes
|
This paper has been withdrawn by the author due to the inaccurate
expression of Lemma 2.5(ii) and Theorem 3.12(i), and the first equation in
(4) is wrong
| null | null | null |
cs.CR cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Irreducible cyclic codes are one of the largest known classes of block codes
which have been investigated for a long time. However, their weight
distributions are known only for a few cases. In this paper, a class of
irreducible cyclic codes are studied and their weight distributions are
determined. Moreover, all codewords of some irreducible cyclic codes are
obtained through programming in order to explain their distributions. The
number of distinct nonzero weights in these codes dealt with in this paper
varies among 1,2,3,6,8.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2012 01:42:20 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Jan 2013 09:26:31 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Sep 2013 03:35:13 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Song",
"Yun",
""
],
[
"Li",
"Zhihui",
""
]
] |
new_dataset
| 0.999412 |
1212.3282
|
EPTCS
|
Niall Murphy (Universidad Polit\'ecnica de Madrid), Damien Woods
(California Institute of Technology)
|
AND and/or OR: Uniform Polynomial-Size Circuits
|
In Proceedings MCU 2013, arXiv:1309.1043
|
EPTCS 128, 2013, pp. 150-166
|
10.4204/EPTCS.128.20
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the complexity of uniform OR circuits and AND circuits of
polynomial-size and depth. As their name suggests, OR circuits have OR gates as
their computation gates, as well as the usual input, output and constant (0/1)
gates. As is the norm for Boolean circuits, our circuits have multiple sink
gates, which implies that an OR circuit computes an OR function on some subset
of its input variables. Determining that subset amounts to solving a number of
reachability questions on a polynomial-size directed graph (which input gates
are connected to the output gate?), taken from a very sparse set of graphs.
However, it is not obvious whether or not this (restricted) reachability
problem can be solved, by say, uniform AC^0 circuits (constant depth,
polynomial-size, AND, OR, NOT gates). This is one reason why characterizing the
power of these simple-looking circuits in terms of uniform classes turns out to
be intriguing. Another is that the model itself seems particularly natural and
worthy of study.
Our goal is the systematic characterization of uniform polynomial-size OR
circuits, and AND circuits, in terms of known uniform machine-based complexity
classes. In particular, we consider the languages reducible to such uniform
families of OR circuits, and AND circuits, under a variety of reduction types.
We give upper and lower bounds on the computational power of these language
classes. We find that these complexity classes are closely related to tallyNL,
the set of unary languages within NL, and to sets reducible to tallyNL.
Specifically, for a variety of types of reductions (many-one, conjunctive truth
table, disjunctive truth table, truth table, Turing) we give characterizations
of languages reducible to OR circuit classes in terms of languages reducible to
tallyNL classes. Then, some of these OR classes are shown to coincide, and some
are proven to be distinct. We give analogous results for AND circuits. Finally,
for many of our OR circuit classes, and analogous AND circuit classes, we prove
whether or not the two classes coincide, although we leave one such inclusion
open.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2012 19:35:12 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Sep 2013 08:08:19 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Murphy",
"Niall",
"",
"Universidad Politécnica de Madrid"
],
[
"Woods",
"Damien",
"",
"California Institute of Technology"
]
] |
new_dataset
| 0.998757 |
1309.1156
|
Suranjan Ganguly
|
Ayan Seal, Suranjan Ganguly, Debotosh Bhattacharjee, Mita Nasipuri,
Dipak kr. Basu
|
Thermal Human face recognition based on Haar wavelet transform and
series matching technique
|
12 pages. arXiv admin note: substantial text overlap with
arXiv:1309.1009
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/publicdomain/
|
Thermal infrared (IR) images represent the heat patterns emitted from hot
object and they do not consider the energies reflected from an object. Objects
living or non-living emit different amounts of IR energy according to their
body temperature and characteristics. Humans are homoeothermic and hence
capable of maintaining constant temperature under different surrounding
temperature. Face recognition from thermal (IR) images should focus on changes
of temperature on facial blood vessels. These temperature changes can be
regarded as texture features of images and wavelet transform is a very good
tool to analyze multi-scale and multi-directional texture. Wavelet transform is
also used for image dimensionality reduction, by removing redundancies and
preserving original features of the image. The sizes of the facial images are
normally large. So, the wavelet transform is used before image similarity is
measured. Therefore this paper describes an efficient approach of human face
recognition based on wavelet transform from thermal IR images. The system
consists of three steps. At the very first step, human thermal IR face image is
preprocessed and the face region is only cropped from the entire image.
Secondly, Haar wavelet is used to extract low frequency band from the cropped
face region. Lastly, the image classification between the training images and
the test images is done, which is based on low-frequency components. The
proposed approach is tested on a number of human thermal infrared face images
created at our own laboratory and Terravic Facial IR Database. Experimental
results indicated that the thermal infra red face images can be recognized by
the proposed system effectively. The maximum success of 95% recognition has
been achieved.
|
[
{
"version": "v1",
"created": "Wed, 4 Sep 2013 13:45:25 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Seal",
"Ayan",
""
],
[
"Ganguly",
"Suranjan",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"Dipak kr.",
""
]
] |
new_dataset
| 0.989855 |
1309.1218
|
Nian Li
|
Nian Li, Chunlei Li, Tor Helleseth, Cunsheng Ding, Xiaohu Tang
|
Optimal Ternary Cyclic Codes with Minimum Distance Four and Five
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are an important subclass of linear codes and have wide
applications in data storage systems, communication systems and consumer
electronics. In this paper, two families of optimal ternary cyclic codes are
presented. The first family of cyclic codes has parameters $[3^m-1, 3^m-1-2m,
4]$ and contains a class of conjectured cyclic codes and several new classes of
optimal cyclic codes. The second family of cyclic codes has parameters $[3^m-1,
3^m-2-2m, 5]$ and contains a number of classes of cyclic codes that are
obtained from perfect nonlinear functions over $\fthreem$, where $m>1$ and is a
positive integer.
|
[
{
"version": "v1",
"created": "Thu, 5 Sep 2013 01:46:46 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Li",
"Nian",
""
],
[
"Li",
"Chunlei",
""
],
[
"Helleseth",
"Tor",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.999766 |
1309.1232
|
Devi Nagaraj Ms
|
A.S.Syed Fiaz, N.Devi and S.Aarthi
|
Bug Tracking and Reporting System
|
4 Pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the world of information. The ever growing field Information
Technology has its many advanced notable features which made it what it was now
today. In this world, the information has to be processed, clearly distributed
and must be efficiently reachable to the end users intended for that. Otherwise
we know it lead to disastrous situations. The other coin of the same phase is
it is absolutely necessary to know any bugs that are hither to faced by the end
users. The project Bug Tracking and Reporting System aims to provide the
solution for that. The Bug Tracker can be made from any two types. The first
one being the system side, the other being the services side. Our project deals
with the second one. The paper is wholly dedicated to tracking the bugs that
are hither by arise. The administrator maintains the master details regarding
to the bugs id, bugs type, bugs description, bugs severity, bugs status, user
details. The administrator too has the authority to update the master details
of severity level, status level, etc, modules of the paper. The administrator
adds the users and assign them responsibility of completing the paper. Finally
on analyzing the paper assigned to the particular user, the administrator can
track the bugs, and it is automatically added to the tables containing the
bugs, by order of severity and status. The administrator can know the
information in tact the various paper s assigned to various users, their bug
tracking status, their description etc in the form of reports from time to
time.
|
[
{
"version": "v1",
"created": "Thu, 5 Sep 2013 04:37:16 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Fiaz",
"A. S. Syed",
""
],
[
"Devi",
"N.",
""
],
[
"Aarthi",
"S.",
""
]
] |
new_dataset
| 0.959354 |
1309.1274
|
EPTCS
|
Dmitry A. Zaitsev (International Humanitarian University, Professor)
|
A Small Universal Petri Net
|
In Proceedings MCU 2013, arXiv:1309.1043. the smallest known
universal Petri net
|
EPTCS 128, 2013, pp. 190-202
|
10.4204/EPTCS.128.22
| null |
cs.FL cs.CC cs.DC cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A universal deterministic inhibitor Petri net with 14 places, 29 transitions
and 138 arcs was constructed via simulation of Neary and Woods' weakly
universal Turing machine with 2 states and 4 symbols; the total time complexity
is exponential in the running time of their weak machine. To simulate the blank
words of the weakly universal Turing machine, a couple of dedicated transitions
insert their codes when reaching edges of the working zone. To complete a chain
of a given Petri net encoding to be executed by the universal Petri net, a
translation of a bi-tag system into a Turing machine was constructed. The
constructed Petri net is universal in the standard sense; a weaker form of
universality for Petri nets was not introduced in this work.
|
[
{
"version": "v1",
"created": "Thu, 5 Sep 2013 08:08:46 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Zaitsev",
"Dmitry A.",
"",
"International Humanitarian University, Professor"
]
] |
new_dataset
| 0.968354 |
1309.1300
|
Kyatsandra Nagananda
|
K. G. Nagananda
|
Electrical Structure-Based PMU Placement in Electric Power Systems
|
8 pages, 10 figures, submitted to IEEE Transactions on Smart Grid,
August 2013
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent work on complex networks compared the topological and electrical
structures of the power grid, taking into account the underlying physical laws
that govern the electrical connectivity between various components in the
network. A distance metric, namely, resistance distance was introduced to
provide a more comprehensive description of interconnections in power systems
compared with the topological structure, which is based only on geographic
connections between network components. Motivated by these studies, in this
paper we revisit the phasor measurement unit (PMU) placement problem by
deriving the connectivity matrix of the network using resistance distances
between buses in the grid, and use it in the integer program formulations for
several standard IEEE bus systems. The main result of this paper is rather
discouraging: more number of PMUs are required, compared with those obtained
using the topological structure, to meet the desired objective of complete
network observability without zero injection measurements. However, in light of
recent advances in the electrical structure of the grid, our study provides a
more realistic perspective of PMU placement in power systems. By further
exploring the connectivity matrix derived using the electrical structure, we
devise a procedure to solve the placement problem without resorting to linear
programming.
|
[
{
"version": "v1",
"created": "Thu, 5 Sep 2013 10:09:18 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Nagananda",
"K. G.",
""
]
] |
new_dataset
| 0.995258 |
1309.1432
|
Zhengjun Cao
|
Zhengjun Cao and Lihua Liu
|
Ordered Probability Mass Function
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that in the four tests Alice's scores are 90, 95, 85, 90, and Bob's
scores are 85, 95, 90, 90. How to evaluate their scores? In this paper, we
introduce the concept of ordered probability mass function which can be used to
find a probability mass function with smaller variance. More interestingly, we
can use it to distinguish sequences of positive numbers statistically.
|
[
{
"version": "v1",
"created": "Sat, 31 Aug 2013 23:19:42 GMT"
}
] | 2013-09-06T00:00:00 |
[
[
"Cao",
"Zhengjun",
""
],
[
"Liu",
"Lihua",
""
]
] |
new_dataset
| 0.980226 |
1309.1026
|
Bin Li
|
Bin Li, Hui Shen, and David Tse
|
Parallel Decoders of Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, we propose parallel SC (Successive Cancellation) decoder and
parallel SC-List decoder for polar codes. The parallel decoder is composed of
M=2^m(m>=1) component decoders working in parallel and each component decoder
decodes a Polar code of a block size of 1/M of the original Polar code.
Therefore the parallel decoder has M times faster decoding speed. Our
simulation results show that the parallel decoder has almost the same
error-rate performance as the conventional non-parallel decoder.
|
[
{
"version": "v1",
"created": "Wed, 4 Sep 2013 13:42:04 GMT"
}
] | 2013-09-05T00:00:00 |
[
[
"Li",
"Bin",
""
],
[
"Shen",
"Hui",
""
],
[
"Tse",
"David",
""
]
] |
new_dataset
| 0.997973 |
1309.0534
|
Raphael kena Poss
|
Raphael 'kena' Poss
|
Machines are benchmarked by code, not algorithms
|
34 pages, 11 figures, 11 listings, 17 tables
| null | null | null |
cs.SE cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article highlights how small modifications to either the source code of
a benchmark program or the compilation options may impact its behavior on a
specific machine. It argues that for evaluating machines, benchmark providers
and users be careful to ensure reproducibility of results based on the machine
code actually running on the hardware and not just source code. The article
uses color to grayscale conversion of digital images as a running example.
|
[
{
"version": "v1",
"created": "Mon, 2 Sep 2013 20:34:09 GMT"
}
] | 2013-09-04T00:00:00 |
[
[
"Poss",
"Raphael 'kena'",
""
]
] |
new_dataset
| 0.985816 |
1201.0749
|
Gary McGuire
|
Gary McGuire, Bastian Tugemann, Gilles Civario
|
There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues
Problem
|
43 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The sudoku minimum number of clues problem is the following question: what is
the smallest number of clues that a sudoku puzzle can have? For several years
it had been conjectured that the answer is 17. We have performed an exhaustive
computer search for 16-clue sudoku puzzles, and did not find any, thus proving
that the answer is indeed 17. In this article we describe our method and the
actual search. As a part of this project we developed a novel way for
enumerating hitting sets. The hitting set problem is computationally hard; it
is one of Karp's 21 classic NP-complete problems. A standard backtracking
algorithm for finding hitting sets would not be fast enough to search for a
16-clue sudoku puzzle exhaustively, even at today's supercomputer speeds. To
make an exhaustive search possible, we designed an algorithm that allowed us to
efficiently enumerate hitting sets of a suitable size.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2012 19:04:10 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Sep 2013 16:43:56 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"McGuire",
"Gary",
""
],
[
"Tugemann",
"Bastian",
""
],
[
"Civario",
"Gilles",
""
]
] |
new_dataset
| 0.956702 |
1304.4383
|
Alireza Karbalay-Ghareh
|
Alireza Karbalay-Ghareh, Masoumeh Nasiri-Kenari, and Mohsen Hejazi
|
Convolutional Network-Coded Cooperation in Multi-Source Networks with a
Multi-Antenna Relay
|
23 pages, 9 figures, 1 table, submitted to IEEE Transactions on
Wireless Communications
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel cooperative transmission scheme called "Convolutional
Network-Coded Cooperation" (CNCC) for a network including N sources, one
M-antenna relay, and one common destination. The source-relay (S-R) channels
are assumed to be Nakagami-m fading, while the source-destination (S-D) and the
relay-destination (R-D) channels are considered Rayleigh fading. The CNCC
scheme exploits the generator matrix of a good (N+M', N, v) systematic
convolutional code, with the free distance of d_free designed over GF(2), as
the network coding matrix which is run by the network's nodes, such that the
systematic symbols are directly transmitted from the sources, and the parity
symbols are sent by the best antenna of the relay. An upper bound on the BER of
the sources, and consequently, the achieved diversity orders are obtained. The
numerical results indicate that the CNCC scheme outperforms the other
cooperative schemes considered, in terms of the diversity order and the network
throughput. The simulation results confirm the accuracy of the theoretical
analysis.
|
[
{
"version": "v1",
"created": "Tue, 16 Apr 2013 09:54:03 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Sep 2013 09:31:33 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Karbalay-Ghareh",
"Alireza",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
],
[
"Hejazi",
"Mohsen",
""
]
] |
new_dataset
| 0.969893 |
1309.0073
|
Cheng Bo
|
Cheng Bo, Lan Zhang, Xiang-Yang Li
|
SilentSense: Silent User Identification via Dynamics of Touch and
Movement Behavioral Biometrics
| null | null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increased popularity of smartphones, various security threats and
privacy leakages targeting them are discovered and investigated. In this work,
we present \ourprotocoltight, a framework to authenticate users silently and
transparently by exploiting dynamics mined from the user touch behavior
biometrics and the micro-movement of the device caused by user's screen-touch
actions. We build a "touch-based biometrics" model of the owner by extracting
some principle features, and then verify whether the current user is the owner
or guest/attacker. When using the smartphone, the unique operating dynamics of
the user is detected and learnt by collecting the sensor data and touch events
silently. When users are mobile, the micro-movement of mobile devices caused by
touch is suppressed by that due to the large scale user-movement which will
render the touch-based biometrics ineffective. To address this, we integrate a
movement-based biometrics for each user with previous touch-based biometrics.
We conduct extensive evaluations of our approaches on the Android smartphone,
we show that the user identification accuracy is over 99%.
|
[
{
"version": "v1",
"created": "Sat, 31 Aug 2013 08:16:53 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Bo",
"Cheng",
""
],
[
"Zhang",
"Lan",
""
],
[
"Li",
"Xiang-Yang",
""
]
] |
new_dataset
| 0.998017 |
1309.0088
|
Seyed Pooya Shariatpanahi Dr.
|
Seyed Pooya Shariatpanahi, Hamed Shah-Mansouri, Babak Hossein Khalaj
|
Caching Gain in Wireless Networks with Fading: A Multi-User Diversity
Perspective
|
6 pages, 4 figures, conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the effect of caching in wireless networks where fading is the
dominant channel effect. First, we propose a one-hop transmission strategy for
cache-enabled wireless networks, which is based on exploiting multi-user
diversity gain. Then, we derive a closed-form result for throughput scaling of
the proposed scheme in large networks, which reveals the inherent trade-off
between cache memory size and network throughput. Our results show that
substantial throughput improvements are achievable in networks with sources
equipped with large cache size. We also verify our analytical result through
simulations.
|
[
{
"version": "v1",
"created": "Sat, 31 Aug 2013 09:43:52 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Shariatpanahi",
"Seyed Pooya",
""
],
[
"Shah-Mansouri",
"Hamed",
""
],
[
"Khalaj",
"Babak Hossein",
""
]
] |
new_dataset
| 0.987086 |
1309.0185
|
Dr. R.V. Krishnaiah
|
S. Sri Gurudatta Yadav and R. V. Krishnaiah
|
Haptic Science and Technology
|
8 Pages
|
International Journal of Computer Engineering and Technology,
August, 2013
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Haptic technology, or haptics, is a tactile feedback technology which takes
advantage of a user's sense of touch by applying forces, vibrations, and/or
motions upon the user. This mechanical stimulation may be used to assist in the
creation of virtual objects (objects existing only in a computer simulation),
for control of such virtual objects, and for the enhancement of the remote
control of machines and devices. It has been described as for the sense of
touch what computer graphics does for vision. Although haptic devices are
capable of measuring bulk or reactive forces that are applied by the user, it
should not be confused with touch or tactile sensors that measure the pressure
or force exerted by the user to the interface.
|
[
{
"version": "v1",
"created": "Sun, 1 Sep 2013 06:02:11 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Yadav",
"S. Sri Gurudatta",
""
],
[
"Krishnaiah",
"R. V.",
""
]
] |
new_dataset
| 0.999452 |
1309.0193
|
Ram Chandra Chauhan
|
Ram Chandra Singh Chauhan, Yatindra Nath Singh, Rachna Asthana
|
Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional
Uni-polar (Optical) Orthogonal Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an algorithm to search a family of multiple sets of
minimum correlated one dimensional uni-polar (optical) orthogonal codes
(1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code
parameters. The cardinality of each set is equal to upper bound. The codes
within a set can be searched for general values of code length, code weight,
auto-correlation constraint and cross-correlation constraint. Each set forms a
maximal clique of the codes within given range of correlation properties .
These one-dimensional uni-polar orthogonal codes can find their application as
signature sequences for spectral spreading purpose in incoherent optical code
division multiple access (CDMA) systems.
|
[
{
"version": "v1",
"created": "Sun, 1 Sep 2013 08:51:57 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Chauhan",
"Ram Chandra Singh",
""
],
[
"Singh",
"Yatindra Nath",
""
],
[
"Asthana",
"Rachna",
""
]
] |
new_dataset
| 0.991575 |
1309.0199
|
Baofeng Wu
|
Baofeng Wu, Dongdai Lin
|
New constructions of quaternary bent functions
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new construction of quaternary bent functions from
quaternary quadratic forms over Galois rings of characteristic 4 is proposed.
Based on this construction, several new classes of quaternary bent functions
are obtained, and as a consequence, several new classes of quadratic binary
bent and semi-bent functions in polynomial forms are derived. This work
generalizes the recent work of N. Li, X. Tang and T. Helleseth.
|
[
{
"version": "v1",
"created": "Sun, 1 Sep 2013 10:17:40 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Wu",
"Baofeng",
""
],
[
"Lin",
"Dongdai",
""
]
] |
new_dataset
| 0.98379 |
1309.0456
|
Jean-Remy Falleri
|
Jean-R\'emy Falleri (LaBRI), C\'edric Teyton (LaBRI), Matthieu
Foucault (LaBRI), Marc Palyart (LaBRI), Flor\'eal Morandat (LaBRI), Xavier
Blanc (LaBRI)
|
The Harmony Platform
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
According to Wikipedia, The Mining Software Repositories (MSR) field analyzes
the rich data available in software repositories, such as version control
repositories, mailing list archives, bug tracking systems, issue tracking
systems, etc. to uncover interesting and actionable information about software
systems, projects and software engineering. The MSR field has received a great
deal of attention and has now its own research conference :
http://www.msrconf.org/. However performing MSR studies is still a technical
challenge. Indeed, data sources (such as version control system or bug tracking
systems) are highly heterogeneous. Moreover performing a study on a lot of data
sources is very expensive in terms of execution time. Surprisingly, there are
not so many tools able to help researchers in their MSR quests. This is why we
created the Harmony platform, as a mean to assist researchers in performing MSR
studies.
|
[
{
"version": "v1",
"created": "Mon, 2 Sep 2013 16:26:41 GMT"
}
] | 2013-09-03T00:00:00 |
[
[
"Falleri",
"Jean-Rémy",
"",
"LaBRI"
],
[
"Teyton",
"Cédric",
"",
"LaBRI"
],
[
"Foucault",
"Matthieu",
"",
"LaBRI"
],
[
"Palyart",
"Marc",
"",
"LaBRI"
],
[
"Morandat",
"Floréal",
"",
"LaBRI"
],
[
"Blanc",
"Xavier",
"",
"LaBRI"
]
] |
new_dataset
| 0.964399 |
1308.6663
|
Chenshu Wu
|
Chenshu Wu, Zheng Yang, Zimu Zhou, Yunhao Liu, Mingyan Liu
|
DorFin: WiFi Fingerprint-based Localization Revisited
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although WiFi fingerprint-based indoor localization is attractive, its
accuracy remains a primary challenge especially in mobile environments.
Existing approaches either appeal to physical layer information or rely on
extra wireless signals for high accuracy. In this paper, we revisit the RSS
fingerprint-based localization scheme and reveal crucial observations that act
as the root causes of localization errors, yet are surprisingly overlooked or
even unseen in previous works. Specifically, we recognize APs' diverse
discrimination for fingerprinting a specific location, observe the RSS
inconsistency caused by signal fluctuations and human body blockages, and
uncover the RSS outdated problem on commodity smartphones. Inspired by these
insights, we devise a discrimination factor to quantify different APs'
discrimination, incorporate robust regression to tolerate outlier measurements,
and reassemble different fingerprints to cope with outdated RSSs. Combining
these techniques in a unified solution, we propose DorFin, a novel scheme of
fingerprint generation, representation, and matching, which yields remarkable
accuracy without incurring extra cost. Extensive experiments demonstrate that
DorFin achieves mean error of 2 meters and more importantly, bounds the 95th
percentile error under 5.5 meters; these are about 56% and 69% lower,
respectively, compared with the state-of-the-art schemes such as Horus and
RADAR.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 07:14:35 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Wu",
"Chenshu",
""
],
[
"Yang",
"Zheng",
""
],
[
"Zhou",
"Zimu",
""
],
[
"Liu",
"Yunhao",
""
],
[
"Liu",
"Mingyan",
""
]
] |
new_dataset
| 0.999255 |
1308.6693
|
Therese Biedl
|
Therese Biedl
|
Transforming planar graph drawings while maintaining height
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are numerous styles of planar graph drawings, notably straight-line
drawings, poly-line drawings, orthogonal graph drawings and visibility
representations. In this note, we show that many of these drawings can be
transformed from one style to another without changing the height of the
drawing. We then give some applications of these transformations.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 09:37:36 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Biedl",
"Therese",
""
]
] |
new_dataset
| 0.99953 |
1308.6697
|
Uwe Aickelin
|
Yihui Liu, Uwe Aickelin
|
Detect adverse drug reactions for drug Atorvastatin
|
Fifth International Symposium on Computational Intelligence and
Design (ISCID), 213-216, 2012. arXiv admin note: substantial text overlap
with arXiv:1308.5144
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Adverse drug reactions (ADRs) are big concern for public health. ADRs are one
of most common causes to withdraw some drugs from markets. Now two major
methods for detecting ADRs are spontaneous reporting system (SRS), and
prescription event monitoring (PEM). The World Health Organization (WHO)
defines a signal in pharmacovigilance as "any reported information on a
possible causal relationship between an adverse event and a drug, the
relationship being unknown or incompletely documented previously". For
spontaneous reporting systems, many machine learning methods are used to detect
ADRs, such as Bayesian confidence propagation neural network (BCPNN), decision
support methods, genetic algorithms, knowledge based approaches, etc. One
limitation is the reporting mechanism to submit ADR reports, which has serious
underreporting and is not able to accurately quantify the corresponding risk.
Another limitation is hard to detect ADRs with small number of occurrences of
each drug-event association in the database. In this paper we propose feature
selection approach to detect ADRs from The Health Improvement Network (THIN)
database. First a feature matrix, which represents the medical events for the
patients before and after taking drugs, is created by linking patients'
prescriptions and corresponding medical events together. Then significant
features are selected based on feature selection methods, comparing the feature
matrix before patients take drugs with one after patients take drugs. Finally
the significant ADRs can be detected from thousands of medical events based on
corresponding features. Experiments are carried out on the drug Atorvastatin.
Good performance is achieved.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 09:55:56 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Liu",
"Yihui",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.997575 |
1308.6705
|
Thomas Holleczek
|
Thomas Holleczek, Liang Yu, Joseph K. Lee, Oliver Senn, Kristian
Kloeckl, Carlo Ratti, Patrick Jaillet
|
Digital breadcrumbs: Detecting urban mobility patterns and transport
mode choices from cellphone networks
| null | null | null | null |
cs.SI physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many modern and growing cities are facing declines in public transport usage,
with few efficient methods to explain why. In this article, we show that urban
mobility patterns and transport mode choices can be derived from cellphone call
detail records coupled with public transport data recorded from smart cards.
Specifically, we present new data mining approaches to determine the spatial
and temporal variability of public and private transportation usage and
transport mode preferences across Singapore. Our results, which were validated
by Singapore's quadriennial Household Interview Travel Survey (HITS), revealed
that there are 3.5 (HITS: 3.5 million) million and 4.3 (HITS: 4.4 million)
million inter-district passengers by public and private transport,
respectively. Along with classifying which transportation connections are weak
or underserved, the analysis shows that the mode share of public transport use
increases from 38 percent in the morning to 44 percent around mid-day and 52
percent in the evening.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 10:47:57 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Holleczek",
"Thomas",
""
],
[
"Yu",
"Liang",
""
],
[
"Lee",
"Joseph K.",
""
],
[
"Senn",
"Oliver",
""
],
[
"Kloeckl",
"Kristian",
""
],
[
"Ratti",
"Carlo",
""
],
[
"Jaillet",
"Patrick",
""
]
] |
new_dataset
| 0.975069 |
1308.6730
|
Pawe{\l} Pszona
|
Michael T. Goodrich and Pawe{\l} Pszona
|
Achieving Good Angular Resolution in 3D Arc Diagrams
|
12 pages, 5 figures; to appear at the 21st International Symposium on
Graph Drawing (GD 2013)
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a three-dimensional analogue to the well-known graph visualization
approach known as arc diagrams. We provide several algorithms that achieve good
angular resolution for 3D arc diagrams, even for cases when the arcs must
project to a given 2D straight-line drawing of the input graph. Our methods
make use of various graph coloring algorithms, including an algorithm for a new
coloring problem, which we call localized edge coloring.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 12:56:55 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Goodrich",
"Michael T.",
""
],
[
"Pszona",
"Paweł",
""
]
] |
new_dataset
| 0.963767 |
1308.6805
|
Dan Ma
|
Jinsong Han, Chen Qian, Dan Ma, Xing Wang, Jizhong Zhao, Pengfeng
Zhang, Wei Xi, Zhiping Jiang
|
Twins:Device-free Object Tracking using Passive Tags
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Without requiring objects to carry any transceiver, device-free based object
tracking provides a promising solution for many localization and tracking
systems to monitor non-cooperative objects such as intruders. However, existing
device-free solutions mainly use sensors and active RFID tags, which are much
more expensive compared to passive tags. In this paper, we propose a novel
motion detection and tracking method using passive RFID tags, named Twins. The
method leverages a newly observed phenomenon called critical state caused by
interference among passive tags. We contribute to both theory and practice of
such phenomenon by presenting a new interference model that perfectly explains
this phenomenon and using extensive experiments to validate it. We design a
practical Twins based intrusion detection scheme and implement a real prototype
with commercial off-the-shelf reader and tags. The results show that Twins is
effective in detecting the moving object, with low location error of 0.75m in
average.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 17:43:20 GMT"
}
] | 2013-09-02T00:00:00 |
[
[
"Han",
"Jinsong",
""
],
[
"Qian",
"Chen",
""
],
[
"Ma",
"Dan",
""
],
[
"Wang",
"Xing",
""
],
[
"Zhao",
"Jizhong",
""
],
[
"Zhang",
"Pengfeng",
""
],
[
"Xi",
"Wei",
""
],
[
"Jiang",
"Zhiping",
""
]
] |
new_dataset
| 0.980068 |
1308.6138
|
Mathieu Bouet
|
K\'evin Phemius, Mathieu Bouet, J\'er\'emie Leguay
|
DISCO: Distributed Multi-domain SDN Controllers
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern multi-domain networks now span over datacenter networks, enterprise
networks, customer sites and mobile entities. Such networks are critical and,
thus, must be resilient, scalable and easily extensible. The emergence of
Software-Defined Networking (SDN) protocols, which enables to decouple the data
plane from the control plane and dynamically program the network, opens up new
ways to architect such networks. In this paper, we propose DISCO, an open and
extensible DIstributed SDN COntrol plane able to cope with the distributed and
heterogeneous nature of modern overlay networks and wide area networks. DISCO
controllers manage their own network domain and communicate with each others to
provide end-to-end network services. This communication is based on a unique
lightweight and highly manageable control channel used by agents to
self-adaptively share aggregated network-wide information. We implemented DISCO
on top of the Floodlight OpenFlow controller and the AMQP protocol. We
demonstrated how DISCO's control plane dynamically adapts to heterogeneous
network topologies while being resilient enough to survive to disruptions and
attacks and providing classic functionalities such as end-point migration and
network-wide traffic engineering. The experimentation results we present are
organized around three use cases: inter-domain topology disruption, end-to-end
priority service request and virtual machine migration.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 12:04:41 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Aug 2013 13:56:15 GMT"
}
] | 2013-08-30T00:00:00 |
[
[
"Phemius",
"Kévin",
""
],
[
"Bouet",
"Mathieu",
""
],
[
"Leguay",
"Jérémie",
""
]
] |
new_dataset
| 0.999018 |
1308.6311
|
Nizar Zaghden
|
Nizar Zaghden, Remy Mullot, Mohamed Adel Alimi
|
Categorizing ancient documents
|
10 pages
|
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 2, No 2, March 2013 ISSN (Print): 1694-0814 | ISSN (Online): 1694-0784
www.IJCSI.org
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The analysis of historical documents is still a topical issue given the
importance of information that can be extracted and also the importance given
by the institutions to preserve their heritage. The main idea in order to
characterize the content of the images of ancient documents after attempting to
clean the image is segmented blocks texts from the same image and tries to find
similar blocks in either the same image or the entire image database. Most
approaches of offline handwriting recognition proceed by segmenting words into
smaller pieces (usually characters) which are recognized separately.
Recognition of a word then requires the recognition of all characters (OCR)
that compose it. Our work focuses mainly on the characterization of classes in
images of old documents. We use Som toolbox for finding classes in documents.
We applied also fractal dimensions and points of interest to categorize and
match ancient documents.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 21:09:35 GMT"
}
] | 2013-08-30T00:00:00 |
[
[
"Zaghden",
"Nizar",
""
],
[
"Mullot",
"Remy",
""
],
[
"Alimi",
"Mohamed Adel",
""
]
] |
new_dataset
| 0.998351 |
1308.6096
|
Clinton Goss Ph.D.
|
Robert B. K. Dewar, Martin Charles Golumbic, and Clinton F. Goss
|
Micro Spitbol
|
Initially published October 1979; Revised August 28, 2013. 8 pages, 3
figures
| null | null | null |
cs.PL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A compact version of MACRO SPITBOL, a compiler/ interpreter for a variant of
SNOBOL4, has been developed for use on microcomputer systems. The techniques
for producing an implementation are largely automatic in order to preserve the
integrity and portability of the SPITBOL system. These techniques are discussed
along with a description of an initial implementation on a 65K byte
minicomputer. An interesting theoretical problem which arises when using
procedures which compact the interpretive object code is also analyzed.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 08:59:41 GMT"
}
] | 2013-08-29T00:00:00 |
[
[
"Dewar",
"Robert B. K.",
""
],
[
"Golumbic",
"Martin Charles",
""
],
[
"Goss",
"Clinton F.",
""
]
] |
new_dataset
| 0.987229 |
1308.6118
|
Sorin Alupoaie
|
Sorin Alupoaie, P\'adraig Cunningham
|
Using tf-idf as an edge weighting scheme in user-object bipartite
networks
| null | null | null | null |
cs.SI cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bipartite user-object networks are becoming increasingly popular in
representing user interaction data in a web or e-commerce environment. They
have certain characteristics and challenges that differentiates them from other
bipartite networks. This paper analyzes the properties of five real world
user-object networks. In all cases we found a heavy tail object degree
distribution with popular objects connecting together a large part of the users
causing significant edge inflation in the projected users network. We propose a
novel edge weighting strategy based on tf-idf and show that the new scheme
improves both the density and the quality of the community structure in the
projections. The improvement is also noticed when comparing to partially random
networks.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 10:25:02 GMT"
}
] | 2013-08-29T00:00:00 |
[
[
"Alupoaie",
"Sorin",
""
],
[
"Cunningham",
"Pádraig",
""
]
] |
new_dataset
| 0.991948 |
1308.6166
|
Dimitrios Thilikos
|
Alexander Grigoriev and Athanassios Koutsonas and Dimitrios M.
Thilikos
|
Bidimensionality of Geometric Intersection Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let B be a finite collection of geometric (not necessarily convex) bodies in
the plane. Clearly, this class of geometric objects naturally generalizes the
class of disks, lines, ellipsoids, and even convex polygons. We consider
geometric intersection graphs GB where each body of the collection B is
represented by a vertex, and two vertices of GB are adjacent if the
intersection of the corresponding bodies is non-empty. For such graph classes
and under natural restrictions on their maximum degree or subgraph exclusion,
we prove that the relation between their treewidth and the maximum size of a
grid minor is linear. These combinatorial results vastly extend the
applicability of all the meta-algorithmic results of the bidimensionality
theory to geometrically defined graph classes.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 14:29:53 GMT"
}
] | 2013-08-29T00:00:00 |
[
[
"Grigoriev",
"Alexander",
""
],
[
"Koutsonas",
"Athanassios",
""
],
[
"Thilikos",
"Dimitrios M.",
""
]
] |
new_dataset
| 0.983197 |
1308.6242
|
Saif Mohammad Dr.
|
Saif M. Mohammad, Svetlana Kiritchenko, and Xiaodan Zhu
|
NRC-Canada: Building the State-of-the-Art in Sentiment Analysis of
Tweets
| null |
In Proceedings of the seventh international workshop on Semantic
Evaluation Exercises (SemEval-2013), June 2013, Atlanta, USA
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe how we created two state-of-the-art SVM
classifiers, one to detect the sentiment of messages such as tweets and SMS
(message-level task) and one to detect the sentiment of a term within a
submissions stood first in both tasks on tweets, obtaining an F-score of 69.02
in the message-level task and 88.93 in the term-level task. We implemented a
variety of surface-form, semantic, and sentiment features. with sentiment-word
hashtags, and one from tweets with emoticons. In the message-level task, the
lexicon-based features provided a gain of 5 F-score points over all others.
Both of our systems can be replicated us available resources.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 18:23:03 GMT"
}
] | 2013-08-29T00:00:00 |
[
[
"Mohammad",
"Saif M.",
""
],
[
"Kiritchenko",
"Svetlana",
""
],
[
"Zhu",
"Xiaodan",
""
]
] |
new_dataset
| 0.972383 |
1308.6250
|
Yongcan Cao
|
Yongcan Cao and Jonathan Muse and David Casbeer and Derek Kingston
|
Circumnavigation of an Unknown Target Using UAVs with Range and Range
Rate Measurements
|
To appear in IEEE Conference on Decision and Control, 2013
| null | null | null |
cs.SY cs.RO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents two control algorithms enabling a UAV to circumnavigate
an unknown target using range and range rate (i.e., the derivative of range)
measurements. Given a prescribed orbit radius, both control algorithms (i) tend
to drive the UAV toward the tangent of prescribed orbit when the UAV is outside
or on the orbit, and (ii) apply zero control input if the UAV is inside the
desired orbit. The algorithms differ in that, the first algorithm is smooth and
unsaturated while the second algorithm is non-smooth and saturated. By
analyzing properties associated with the bearing angle of the UAV relative to
the target and through proper design of Lyapunov functions, it is shown that
both algorithms produce the desired orbit for an arbitrary initial state. Three
examples are provided as a proof of concept.
|
[
{
"version": "v1",
"created": "Wed, 28 Aug 2013 18:59:04 GMT"
}
] | 2013-08-29T00:00:00 |
[
[
"Cao",
"Yongcan",
""
],
[
"Muse",
"Jonathan",
""
],
[
"Casbeer",
"David",
""
],
[
"Kingston",
"Derek",
""
]
] |
new_dataset
| 0.998562 |
1209.3594
|
Vincent Kusters
|
Jean Cardinal, Michael Hoffmann, Vincent Kusters
|
On Universal Point Sets for Planar Graphs
|
Fixed incorrect numbers of universal point sets in the last part
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set P of points in R^2 is n-universal, if every planar graph on n vertices
admits a plane straight-line embedding on P. Answering a question by Kobourov,
we show that there is no n-universal point set of size n, for any n>=15.
Conversely, we use a computer program to show that there exist universal point
sets for all n<=10 and to enumerate all corresponding order types. Finally, we
describe a collection G of 7'393 planar graphs on 35 vertices that do not admit
a simultaneous geometric embedding without mapping, that is, no set of 35
points in the plane supports a plane straight-line embedding of all graphs in
G.
|
[
{
"version": "v1",
"created": "Mon, 17 Sep 2012 08:54:44 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Sep 2012 12:53:16 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Feb 2013 13:02:05 GMT"
},
{
"version": "v4",
"created": "Wed, 10 Apr 2013 15:57:35 GMT"
},
{
"version": "v5",
"created": "Tue, 27 Aug 2013 13:20:33 GMT"
}
] | 2013-08-28T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Hoffmann",
"Michael",
""
],
[
"Kusters",
"Vincent",
""
]
] |
new_dataset
| 0.995021 |
1305.5236
|
Bryan Ford
|
David Isaac Wolinsky, Ewa Syta, and Bryan Ford
|
Hang With Your Buddies to Resist Intersection Attacks
|
15 pages, 8 figures
|
ACM CCS'13, Nov 04-08 2013, Berlin, Germany
|
10.1145/2508859.2516740
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some anonymity schemes might in principle protect users from pervasive
network surveillance - but only if all messages are independent and unlinkable.
Users in practice often need pseudonymity - sending messages intentionally
linkable to each other but not to the sender - but pseudonymity in dynamic
networks exposes users to intersection attacks. We present Buddies, the first
systematic design for intersection attack resistance in practical anonymity
systems. Buddies groups users dynamically into buddy sets, controlling message
transmission to make buddies within a set behaviorally indistinguishable under
traffic analysis. To manage the inevitable tradeoffs between anonymity
guarantees and communication responsiveness, Buddies enables users to select
independent attack mitigation policies for each pseudonym. Using trace-based
simulations and a working prototype, we find that Buddies can guarantee
non-trivial anonymity set sizes in realistic chat/microblogging scenarios, for
both short-lived and long-lived pseudonyms.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 19:12:45 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Aug 2013 14:22:33 GMT"
}
] | 2013-08-28T00:00:00 |
[
[
"Wolinsky",
"David Isaac",
""
],
[
"Syta",
"Ewa",
""
],
[
"Ford",
"Bryan",
""
]
] |
new_dataset
| 0.996445 |
1308.5239
|
Ali Makhdoumi
|
Ali Makhdoumi, Shao-Lun Huang, Muriel Medard, Yury Polyanskiy
|
On Locally Decodable Source Coding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locally decodable channel codes form a special class of error-correcting
codes with the property that the decoder is able to reconstruct any bit of the
input message from querying only a few bits of a noisy codeword. It is well
known that such codes require significantly more redundancy (in particular have
vanishing rate) compared to their non-local counterparts. In this paper, we
define a dual problem, i.e. locally decodable source codes (LDSC). We consider
both almost lossless (block error) and lossy (bit error) cases. In almost
lossless case, we show that optimal compression (to entropy) is possible with
O(log n) queries to compressed string by the decompressor. We also show the
following converse bounds: 1) linear LDSC cannot achieve any rate below one,
with a bounded number of queries, 2) rate of any source coding with linear
decoder (not necessarily local) in one, 3) for 2 queries, any code construction
cannot have a rate below one. In lossy case, we show that any rate above rate
distortion is achievable with a bounded number of queries. We also show that,
rate distortion is achievable with any scaling number of queries. We provide an
achievability bound in the finite block-length regime and compare it with the
existing bounds in succinct data structures literature.
|
[
{
"version": "v1",
"created": "Fri, 23 Aug 2013 20:43:20 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Aug 2013 19:09:35 GMT"
}
] | 2013-08-28T00:00:00 |
[
[
"Makhdoumi",
"Ali",
""
],
[
"Huang",
"Shao-Lun",
""
],
[
"Medard",
"Muriel",
""
],
[
"Polyanskiy",
"Yury",
""
]
] |
new_dataset
| 0.988995 |
1308.5373
|
Cunsheng Ding
|
Cunsheng Ding, Ying Gao, and Zhengchun Zhou
|
Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a subclass of linear codes, cyclic codes have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, five families of
three-weight ternary cyclic codes whose duals have two zeros are presented. The
weight distributions of the five families of cyclic codes are settled. The
duals of two families of the cyclic codes are optimal.
|
[
{
"version": "v1",
"created": "Sun, 25 Aug 2013 03:31:07 GMT"
}
] | 2013-08-27T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Gao",
"Ying",
""
],
[
"Zhou",
"Zhengchun",
""
]
] |
new_dataset
| 0.998886 |
1308.5409
|
Ola Mahmoud
|
Marcelo Fiore and Ola Mahmoud
|
Second-Order Algebraic Theories
| null |
In Lecture Notes in Computer In Proceedings of the 35th
International Symposium on Mathematical Foundations of Computer Science (MFCS
2010), LNCS 6281, pp. 368-380, Springer Verlag, May 2010
| null | null |
cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fiore and Hur recently introduced a conservative extension of universal
algebra and equational logic from first to second order. Second-order universal
algebra and second-order equational logic respectively provide a model theory
and a formal deductive system for languages with variable binding and
parameterised metavariables. This work completes the foundations of the subject
from the viewpoint of categorical algebra. Specifically, the paper introduces
the notion of second-order algebraic theory and develops its basic theory. Two
categorical equivalences are established: at the syntactic level, that of
second-order equational presentations and second-order algebraic theories; at
the semantic level, that of second-order algebras and second-order functorial
models. Our development includes a mathematical definition of syntactic
translation between second-order equational presentations. This gives the first
formalisation of notions such as encodings and transforms in the context of
languages with variable binding.
|
[
{
"version": "v1",
"created": "Sun, 25 Aug 2013 14:23:54 GMT"
}
] | 2013-08-27T00:00:00 |
[
[
"Fiore",
"Marcelo",
""
],
[
"Mahmoud",
"Ola",
""
]
] |
new_dataset
| 0.989234 |
1111.3275
|
Beni Yoshida
|
Beni Yoshida
|
Information storage capacity of discrete spin systems
|
35 pages, 12 figures
|
Annals of Physics 338, 134 (2013)
|
10.1016/j.aop.2013.07.009
|
CTP-4326
|
cs.IT cond-mat.str-el math-ph math.IT math.MP nlin.CG quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Understanding the limits imposed on information storage capacity of physical
systems is a problem of fundamental and practical importance which bridges
physics and information science. There is a well-known upper bound on the
amount of information that can be stored reliably in a given volume of discrete
spin systems which are supported by gapped local Hamiltonians. However, all the
previously known systems were far below this theoretical bound, and it remained
open whether there exists a gapped spin system that saturates this bound. Here,
we present a construction of spin systems which saturate this theoretical limit
asymptotically by borrowing an idea from fractal properties arising in the
Sierpinski triangle. Our construction provides not only the best classical
error-correcting code which is physically realizable as the energy ground space
of gapped frustration-free Hamiltonians, but also a new research avenue for
correlated spin phases with fractal spin configurations.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 16:37:26 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Jan 2012 18:28:26 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Dec 2012 22:57:07 GMT"
}
] | 2013-08-26T00:00:00 |
[
[
"Yoshida",
"Beni",
""
]
] |
new_dataset
| 0.994211 |
1308.5079
|
Franz J. Brandenburg
|
Franz J. Brandenburg
|
1-Visibility Representations of 1-Planar Graphs
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A visibility representation is a classical drawing style of planar graphs. It
displays the vertices of a graph as horizontal vertex-segments, and each edge
is represented by a vertical edge-segment touching the segments of its end
vertices; beyond that segments do not intersect. We generalize visibility to
1-visibility, where each edge- (vertex-) segment crosses at most one vertex-
(edge-) segment. In other words, a vertex is crossed by at most one edge, and
vice-versa. We show that 1-visibility properly extends 1-planarity and develop
a linear time algorithm to compute a 1-visibility representation of an embedded
1-planar graph on O(n^2) area. A graph is 1-planar if it can be drawn in the
plane such that each edge is crossed at most once. Concerning density, both
1-visible and 1-planar graphs of size $n$ have at most 4n-8 edges. However, for
every n >= 7 there are 1-visible graphs with 4n-8 edge which are not 1-planar.
|
[
{
"version": "v1",
"created": "Fri, 23 Aug 2013 09:30:51 GMT"
}
] | 2013-08-26T00:00:00 |
[
[
"Brandenburg",
"Franz J.",
""
]
] |
new_dataset
| 0.994093 |
1308.5158
|
Yuan Zhou
|
Parikshit Gopalan, Salil Vadhan, Yuan Zhou
|
Locally Testable Codes and Cayley Graphs
|
22 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give two new characterizations of ($\F_2$-linear) locally testable
error-correcting codes in terms of Cayley graphs over $\F_2^h$:
\begin{enumerate} \item A locally testable code is equivalent to a Cayley
graph over $\F_2^h$ whose set of generators is significantly larger than $h$
and has no short linear dependencies, but yields a shortest-path metric that
embeds into $\ell_1$ with constant distortion. This extends and gives a
converse to a result of Khot and Naor (2006), which showed that codes with
large dual distance imply Cayley graphs that have no low-distortion embeddings
into $\ell_1$.
\item A locally testable code is equivalent to a Cayley graph over $\F_2^h$
that has significantly more than $h$ eigenvalues near 1, which have no short
linear dependencies among them and which "explain" all of the large
eigenvalues. This extends and gives a converse to a recent construction of
Barak et al. (2012), which showed that locally testable codes imply Cayley
graphs that are small-set expanders but have many large eigenvalues.
\end{enumerate}
|
[
{
"version": "v1",
"created": "Fri, 23 Aug 2013 15:31:57 GMT"
}
] | 2013-08-26T00:00:00 |
[
[
"Gopalan",
"Parikshit",
""
],
[
"Vadhan",
"Salil",
""
],
[
"Zhou",
"Yuan",
""
]
] |
new_dataset
| 0.999759 |
1308.4485
|
Manoj Kumar
|
Neeta Sharma and Manoj Kumar
|
The Wonderful Toy of 20th Century can be a Disaster in 21st
Century:Scenario and Policies Regarding Mobile Waste in India
|
6 pages, 1 figure, 2 tables
|
(IJCSIT) International Journal of Computer Science and Information
Technologies, Vol. 2 (5) , 2011, 2198-2203 ISSN:0975-9646
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The subscribers base of mobile phones is increasing globally with a rapid
rate.The sale of mobile phones has exceeded those of personal computers.India
is the second largest telecommunication network in the world in terms of number
of wireless connections after China.Telecom companies are ready to tap a large
unexplored market in India with lucrative offerings.Smart phones sale are at
its peak.3G technology is also ready to play a lead role in mobile
revolution.Due to the low average life of the mobile phones,lack of awareness
among users and in absence of government policies,mobile waste is accumulating
in vast amount in India.Without a proper system of recycling,the unsafe
disposal is causing a variety of environmental and health problems.This paper
discusses the various issues related to the worldwide growth of mobile
phones,the insecure methods of disposal and the regulations and policies in
India.We intend to put forward some challenges and advices.
|
[
{
"version": "v1",
"created": "Wed, 21 Aug 2013 05:05:42 GMT"
}
] | 2013-08-22T00:00:00 |
[
[
"Sharma",
"Neeta",
""
],
[
"Kumar",
"Manoj",
""
]
] |
new_dataset
| 0.999783 |
1308.4486
|
Manoj Kumar
|
Manoj Kumar and Sheshendra Rathi
|
Services in Android can Share Your Personal Information in Background
|
4 pages, 3 figures
|
(IJCSIT) International Journal of Computer Science and Information
Technologies, Vol. 2 (5) , 2011, 2356-2359 ISSN:0975-9646
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile phones have traveled a very long journey in a very short span of time
since its inception in 1973.This wonderful toy of 20th century has started
playing significant role in daily life.More than 5 billion mobile users are
there around the world and almost 90 percent of the entire earth is under the
mobile coverage now.These days smart phones are equipped with numerous
features,faster processors and high storage capacity.Android is a latest trend
in this series whose popularity is growing by leaps and bounds.Android has a
number of components which helps Application developers to embed distinguish
features in applications.This paper explains how the Service component of
Android can share your personal information to others without users
interaction.
|
[
{
"version": "v1",
"created": "Wed, 21 Aug 2013 05:05:58 GMT"
}
] | 2013-08-22T00:00:00 |
[
[
"Kumar",
"Manoj",
""
],
[
"Rathi",
"Sheshendra",
""
]
] |
new_dataset
| 0.998449 |
1308.4499
|
Maosheng Xiong
|
Jing Xia, Liuquan Wang, Maosheng Xiong
|
On a question of Babadi and Tarokh II
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we continue to study a question proposed by Babadi and Tarokh
\cite{ba2} on the mysterious randomness of Gold sequences. Upon improving their
result, we establish the randomness of product of pseudorandom matrices formed
from two linear block codes with respect to the empirical spectral
distribution, if the dual distance of both codes is at least 5, hence providing
an affirmative answer to the question.
|
[
{
"version": "v1",
"created": "Wed, 21 Aug 2013 07:18:17 GMT"
}
] | 2013-08-22T00:00:00 |
[
[
"Xia",
"Jing",
""
],
[
"Wang",
"Liuquan",
""
],
[
"Xiong",
"Maosheng",
""
]
] |
new_dataset
| 0.970442 |
1308.4672
|
Mrigank Sharad
|
Mrigank Sharad, Deliang Fan and Kaushik Roy
|
Ultra-low Energy, High-Performance Dynamic Resistive Threshold Logic
|
arXiv admin note: text overlap with arXiv:1308.4169
| null | null | null |
cs.ET cond-mat.dis-nn cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose dynamic resistive threshold-logic (DRTL) design based on
non-volatile resistive memory. A threshold logic gate (TLG) performs summation
of multiple inputs multiplied by a fixed set of weights and compares the sum
with a threshold. DRTL employs resistive memory elements to implement the
weights and the thresholds, while a compact dynamic CMOS latch is used for the
comparison operation. The resulting DRTL gate acts as a low-power, configurable
dynamic logic unit and can be used to build fully pipelined, high-performance
programmable computing blocks. Multiple stages in such a DRTL design can be
connected using energy-efficient low swing programmable interconnect networks
based on resistive switches. Owing to memory-based compact logic and
interconnect design and highspeed dynamic-pipelined operation, DRTL can achieve
more than two orders of magnitude improvement in energy-delay product as
compared to look-up table based CMOS FPGA.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 15:29:45 GMT"
}
] | 2013-08-22T00:00:00 |
[
[
"Sharad",
"Mrigank",
""
],
[
"Fan",
"Deliang",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.998593 |
1308.4169
|
Mrigank Sharad
|
Mrigank Sharad, Deliang Fan and Kaushik Roy
|
Ultra-low Energy, High Performance and Programmable Magnetic Threshold
Logic
| null | null | null | null |
cs.ET cond-mat.dis-nn cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose magnetic threshold-logic (MTL) design based on non-volatile
spin-torque switches. A threshold logic gate (TLG) performs summation of
multiple inputs multiplied by a fixed set of weights and compares the sum with
a threshold. MTL employs resistive states of magnetic tunnel junctions as
programmable input weights, while, a low-voltage domain-wall shift based
spin-torque switch is used for thresholding operation. The resulting MTL gate
acts as a low-power, configurable logic unit and can be used to build fully
pipelined, high-performance programmable computing blocks. Multiple stages in
such a MTL design can be connected using energy-efficient ultralow swing
programmable interconnect networks based on resistive switches. Owing to
memory-based compact logic and interconnect design and low-voltage, high-speed
spintorque based threshold operation, MTL can achieve more than two orders of
magnitude improvement in energy-delay product as compared to look-up table
based CMOS FPGA.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 14:29:58 GMT"
}
] | 2013-08-21T00:00:00 |
[
[
"Sharad",
"Mrigank",
""
],
[
"Fan",
"Deliang",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.999532 |
1308.3885
|
Abhijeet Bhorkar
|
Abhijeet Bhorkar, Gautam Bhanage
|
Reliable multicast in large enterprise networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we have presented a complete end-end architecture to employ the
rate-less codes. We have developed a new architecture Rate-less Codes Multicast
(RCNC). This architecture is shown to provide high throughput gains,
reliability and near optimal throughput performance.
|
[
{
"version": "v1",
"created": "Sun, 18 Aug 2013 18:46:21 GMT"
}
] | 2013-08-20T00:00:00 |
[
[
"Bhorkar",
"Abhijeet",
""
],
[
"Bhanage",
"Gautam",
""
]
] |
new_dataset
| 0.978422 |
1308.3924
|
Dmitri Nikonov
|
Yury A. Tyapchenko
|
Analysis and Synthesis of a Subsystem of the Manual Control Loop for
Manned Spacecraft
|
13 pages, 10 figures. Translation from Russian by Dmitri E. Nikonov
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A salient feature of the manned spacecraft is the predominance of discrete
information in the manual control loop of the onboard systems. Specifically,
command-signaling control panels (CSCP) as a subsystem of the manual control
loop are widely used in the Russian manned spacecraft. In this paper CSCP are
classified into four types: a) control panels based on multi-channel control;
b) control panels based on command-information compression; c) control panels
based on command and signaling information compression; d) integrated control
consoles (ICC) based on computer and information technology. It is shown that
ICC underlies modern information display systems (IDS). ICC first appeared in
the Russian manned space program in the IDS of the Soyuz-TMA spacecraft and the
Russian modules of the International Space Station. Results of engineering and
psychological studies of different types of panels are produced.
|
[
{
"version": "v1",
"created": "Mon, 19 Aug 2013 05:13:39 GMT"
}
] | 2013-08-20T00:00:00 |
[
[
"Tyapchenko",
"Yury A.",
""
]
] |
new_dataset
| 0.995539 |
1308.3575
|
Lingfei Jin
|
Lingfei Jin and Chaoping Xing
|
Euclidean and Hermitian Self-orthogonal Algebraic Geometry Codes and
Their Application to Quantum Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the present paper, we show that if the dimension of an arbitrary algebraic
geometry code over a finite field of even characters is slightly less than half
of its length, then it is equivalent to an Euclidean self-orthogonal code.
However, in the literatures, a strong contrition about existence of certain
differential is required to obtain such a result. We also show a similar result
on Hermitian self-orthogonal algebraic geometry codes. As a consequence, we can
apply our result to quantum codes and obtain quantum codes with good asymptotic
bounds.
|
[
{
"version": "v1",
"created": "Fri, 16 Aug 2013 08:14:57 GMT"
}
] | 2013-08-19T00:00:00 |
[
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.998426 |
1308.3578
|
Lingfei Jin
|
Lingfei Jin and Chaoping Xing
|
Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that quantum codes can be constructed through classical
symplectic self-orthogonal codes. In this paper, we give a kind of
Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then
obtain the Gilbert-Varshamov bound for quantum codes. The idea of obtaining the
Gilbert-Varshamov bound for symplectic self-orthogonal codes follows from
counting arguments.
|
[
{
"version": "v1",
"created": "Fri, 16 Aug 2013 08:21:20 GMT"
}
] | 2013-08-19T00:00:00 |
[
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.993134 |
1308.3579
|
Arun Joseph
|
Mohit John and Arun JosephPalai
|
ZigBee Based Wireless Data Acquisition Using LabVIEW for Implementing
Smart Driving Skill Evaluation System
|
19 pages
| null |
10.5121/ijics.2013.3301
| null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Smart Driving Skill Evaluation (SDSE) System presented in this paper
expedite the testing of candidates aspiring for a driving license in a more
efficient and transparent manner, as compared to the present manual testing
procedure existing in most parts of Asia and Pacific region. The manual test
procedure is also subjected to multiple limitations like time consuming, costly
and heavily controlled by the experience of examiner in conducting the test.
This technological solution is developed by customizing 8051 controller based
embedded system and LabVIEW based virtual instrument. The controller module
senses the motion of the test vehicle on the test track referred to as zero rpm
measurement and the LabVIEW based virtual instrument provides a Graphical User
Interface for remote end monitoring of the sensors embedded on the test track.
The proposed technological solution for the automation of existing manual test
process enables the elimination of human intervention and improves the driving
test accuracy while going paperless with Driving Skill Evaluation System. As a
contribution to the society this technological solution can reduce the number
of road accidents because most accidents results from lack of planning,
anticipation and control which are highly dependent on driving skill.
|
[
{
"version": "v1",
"created": "Fri, 16 Aug 2013 08:34:44 GMT"
}
] | 2013-08-19T00:00:00 |
[
[
"John",
"Mohit",
""
],
[
"JosephPalai",
"Arun",
""
]
] |
new_dataset
| 0.999224 |
1308.3243
|
Mohamed Ben Halima
|
M. Ben Halima, H. Karray and A. M. Alimi
|
Arabic Text Recognition in Video Sequences
|
10 pages - International Journal of Computational Linguistics
Research. arXiv admin note: substantial text overlap with arXiv:1211.2150
| null | null | null |
cs.MM cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a robust approach for text extraction and
recognition from Arabic news video sequence. The text included in video
sequences is an important needful for indexing and searching system. However,
this text is difficult to detect and recognize because of the variability of
its size, their low resolution characters and the complexity of the
backgrounds. To solve these problems, we propose a system performing in two
main tasks: extraction and recognition of text. Our system is tested on a
varied database composed of different Arabic news programs and the obtained
results are encouraging and show the merits of our approach.
|
[
{
"version": "v1",
"created": "Wed, 14 Aug 2013 20:15:44 GMT"
}
] | 2013-08-16T00:00:00 |
[
[
"Halima",
"M. Ben",
""
],
[
"Karray",
"H.",
""
],
[
"Alimi",
"A. M.",
""
]
] |
new_dataset
| 0.97057 |
1308.3370
|
Tamara Mchedlidze David
|
Tamara Mchedlidze, Martin N\"ollenburg, Ignaz Rutter
|
Drawing Planar Graphs with a Prescribed Inner Face
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding)
and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we
consider the question whether this drawing can be extended to a planar
straight-line drawing of $G$. We characterize when this is possible in terms of
simple necessary conditions, which we prove to be sufficient. This also leads
to a linear-time testing algorithm. If a drawing extension exists, it can be
computed in the same running time.
|
[
{
"version": "v1",
"created": "Thu, 15 Aug 2013 12:07:03 GMT"
}
] | 2013-08-16T00:00:00 |
[
[
"Mchedlidze",
"Tamara",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Rutter",
"Ignaz",
""
]
] |
new_dataset
| 0.995541 |
1308.3482
|
Girish Sundaram
|
Pinaki Mitra, Rinku Das, Girish Sundaram
|
Privatizing user credential information of Web services in a shared user
environment
|
Selected for proceedings of NETs2012 International Conference on
Internet Studies held in Bangkok, Thailand from August 17-19, 2012
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
User credentials security is one of the most important tasks in Web World.
Most Web sites on the Internet that support user accounts store the users
credentials in a database. Now a days, most of the web browsers offer auto
login feature for the favorite web sites such as yahoo, google, gmail etc.
using these credential information. This facilitates the misuse of user
credentials. Privatizing user credential information of web services in a
shared user environment provides a feature enhancement where the root user will
be able to privatize his stored credentials by enforcing some masking
techniques such that even a user logs on to the system with root user
credentials, he will not be able to access privatized data. In case of web
browsers auto login feature, a root user can disable the feature manually by
deleting entries from web browsers' saved password list. But this involves
spending a considerable amount of time and the biggest problem is that he has
to insert those credentials once again when he next visits these websites. This
application resumes auto login feature whenever root user disable the masked
mode. The application includes two parts: Masked Application Mode and Disabling
the Masked Application Mode. When the system goes for masked application mode,
the other user will not be able to use the credentials of the root user.If the
other user tries to access any of the web pages which have been masked, the
other user will have to authenticate with his own credentials. Disabling the
masked mode requires authentication from the root user. As long as this
credential is not shared, masked mode can be disabled only by the root user.
|
[
{
"version": "v1",
"created": "Thu, 15 Aug 2013 19:28:00 GMT"
}
] | 2013-08-16T00:00:00 |
[
[
"Mitra",
"Pinaki",
""
],
[
"Das",
"Rinku",
""
],
[
"Sundaram",
"Girish",
""
]
] |
new_dataset
| 0.971647 |
1205.0792
|
Boris Leistedt
|
B. Leistedt and J. D. McEwen
|
Exact Wavelets on the Ball
|
13 pages, 10 figures, accepted for publication in IEEE Trans. Sig.
Proc. The code is publicly available from http://www.flaglets.org
|
IEEE Trans. Signal. Process., 60 (2012), 6257-6269
|
10.1109/TSP.2012.2215030
| null |
cs.IT astro-ph.IM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop an exact wavelet transform on the three-dimensional ball (i.e. on
the solid sphere), which we name the flaglet transform. For this purpose we
first construct an exact transform on the radial half-line using damped
Laguerre polynomials and develop a corresponding quadrature rule. Combined with
the spherical harmonic transform, this approach leads to a sampling theorem on
the ball and a novel three-dimensional decomposition which we call the
Fourier-Laguerre transform. We relate this new transform to the well-known
Fourier-Bessel decomposition and show that band-limitedness in the
Fourier-Laguerre basis is a sufficient condition to compute the Fourier-Bessel
decomposition exactly. We then construct the flaglet transform on the ball
through a harmonic tiling, which is exact thanks to the exactness of the
Fourier-Laguerre transform (from which the name flaglets is coined). The
corresponding wavelet kernels are well localised in real and Fourier-Laguerre
spaces and their angular aperture is invariant under radial translation. We
introduce a multiresolution algorithm to perform the flaglet transform rapidly,
while capturing all information at each wavelet scale in the minimal number of
samples on the ball. Our implementation of these new tools achieves
floating-point precision and is made publicly available. We perform numerical
experiments demonstrating the speed and accuracy of these libraries and
illustrate their capabilities on a simple denoising example.
|
[
{
"version": "v1",
"created": "Thu, 3 May 2012 18:58:28 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Nov 2012 21:00:08 GMT"
}
] | 2013-08-15T00:00:00 |
[
[
"Leistedt",
"B.",
""
],
[
"McEwen",
"J. D.",
""
]
] |
new_dataset
| 0.998645 |
1306.6047
|
Alex Rubinsteyn
|
Russell Power and Alex Rubinsteyn
|
How fast can we make interpreted Python?
|
Tech Report
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Python is a popular dynamic language with a large part of its appeal coming
from powerful libraries and extension modules. These augment the language and
make it a productive environment for a wide variety of tasks, ranging from web
development (Django) to numerical analysis (NumPy). Unfortunately, Python's
performance is quite poor when compared to modern implementations of languages
such as Lua and JavaScript.
Why does Python lag so far behind these other languages? As we show, the very
same API and extension libraries that make Python a powerful language also make
it very difficult to efficiently execute. Given that we want to retain access
to the great extension libraries that already exist for Python, how fast can we
make it?
To evaluate this, we designed and implemented Falcon, a high-performance
bytecode interpreter fully compatible with the standard CPython interpreter.
Falcon applies a number of well known optimizations and introduces several new
techniques to speed up execution of Python bytecode. In our evaluation, we
found Falcon an average of 25% faster than the standard Python interpreter on
most benchmarks and in some cases about 2.5X faster.
|
[
{
"version": "v1",
"created": "Tue, 25 Jun 2013 17:57:00 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Aug 2013 20:29:34 GMT"
}
] | 2013-08-15T00:00:00 |
[
[
"Power",
"Russell",
""
],
[
"Rubinsteyn",
"Alex",
""
]
] |
new_dataset
| 0.990404 |
1308.3217
|
Mohammad Noshad
|
Mohammad Noshad and Maite Brandt-Pearce
|
Can Visible Light Communications Provide Gb/s Service?
|
IEEE Communications Magazine
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visible light communications (VLC) that use the infrastructure of the indoor
illumination system have been envisioned as a compact, safe, and green
alternative to WiFi for the downlink of an indoor wireless mobile communication
system. Although the optical spectrum is typically well-suited to high
throughput applications, combining communications with indoor lighting in a
commercially viable system imposes severe limitations both in bandwidth and
received power. Clever techniques are needed to achieve Gb/s transmission, and
to do it in a cost effective manner so as to successfully compete with other
high-capacity alternatives for indoor access, such as millimeter-wave
radio-frequency (RF). This article presents modulation schemes that have the
potential to overcome the many challenges faced by VLC in providing multi Gb/s
indoor wireless connectivity.
|
[
{
"version": "v1",
"created": "Wed, 14 Aug 2013 19:31:41 GMT"
}
] | 2013-08-15T00:00:00 |
[
[
"Noshad",
"Mohammad",
""
],
[
"Brandt-Pearce",
"Maite",
""
]
] |
new_dataset
| 0.996799 |
1308.2762
|
Debajit Sensarma
|
Debajit Sensarma and Koushik Majumder
|
An efficient ant based qos aware intelligent temporally ordered routing
algorithm for manets
|
15 pages, 7 figures, International Journal of Computer Networks &
Communications (IJCNC) Vol.5, No.4, July 2013
| null |
10.5121/ijcnc.2013.5415
| null |
cs.NI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Mobile Ad hoc network (MANET) is a self configurable network connected by
wireless links. This type of network is only suitable for temporary
communication links as it is infrastructure-less and there is no centralised
control. Providing QoS aware routing is a challenging task in this type of
network due to dynamic topology and limited resources. The main purpose of QoS
aware routing is to find a feasible path from source to destination which will
satisfy two or more end to end QoS constrains. Therefore, the task of designing
an efficient routing algorithm which will satisfy all the quality of service
requirements and be robust and adaptive is considered as a highly challenging
problem. In this work we have designed a new efficient and energy aware
multipath routing algorithm based on ACO framework, inspired by the behaviours
of biological ants. Basically by considering QoS constraints and artificial
ants we have designed an intelligent version of classical Temporally Ordered
Routing Algorithm (TORA) which will increase network lifetime and decrease
packet loss and average end to end delay that makes this algorithm suitable for
real time and multimedia applications.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 06:08:01 GMT"
}
] | 2013-08-14T00:00:00 |
[
[
"Sensarma",
"Debajit",
""
],
[
"Majumder",
"Koushik",
""
]
] |
new_dataset
| 0.989689 |
1308.2894
|
Kai Niu
|
Kai Niu, Kai Chen, Jiaru Lin
|
Low-Complexity Sphere Decoding of Polar Codes based on Optimum Path
Metric
|
4 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sphere decoding (SD) of polar codes is an efficient method to achieve the
error performance of maximum likelihood (ML) decoding. But the complexity of
the conventional sphere decoder is still high, where the candidates in a target
sphere are enumerated and the radius is decreased gradually until no available
candidate is in the sphere. In order to reduce the complexity of SD, a stack SD
(SSD) algorithm with an efficient enumeration is proposed in this paper. Based
on a novel path metric, SSD can effectively narrow the search range when
enumerating the candidates within a sphere. The proposed metric follows an
exact ML rule and takes the full usage of the whole received sequence.
Furthermore, another very simple metric is provided as an approximation of the
ML metric in the high signal-to-noise ratio regime. For short polar codes,
simulation results over the additive white Gaussian noise channels show that
the complexity of SSD based on the proposed metrics is up to 100 times lower
than that of the conventional SD.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 15:19:05 GMT"
}
] | 2013-08-14T00:00:00 |
[
[
"Niu",
"Kai",
""
],
[
"Chen",
"Kai",
""
],
[
"Lin",
"Jiaru",
""
]
] |
new_dataset
| 0.99593 |
1308.2920
|
Rahul Kumar
|
Rahul K Dixit, Rahul Johari
|
As-puma ; anycast semantics in parking using metaheuristic approach
| null |
Rahul K Dixit, Research Scholar, USICT, GGSIP University,
Delhi-110078., AMIETE from I.E.T.E,Lodhi Road, Delhi Gate Scholar in 2011 and
2012. Rahul Johari, is working as a Assistant Professor in USICT, GGSIPU
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of vehicle used in the world are increasing day by day resulting
in the obvious problem of parking of these vehicles in residential and
vocational areas. We perceive the problem of vehicles parking in vocational
establishments / malls. Today majority of parking systems are manual parking
systems where in, on the spot, parking of the vehicle is done and a parking
slip is generated and handed over to customer. This is cumbersome technique
wherein various parking attendants in the parking areas manually keeps on
informing the Parking inspector on how many free parking slots available so
that only that many number of parking slips/tickets are generated as the number
of free parking slots. We address the problem of parking in Delay Tolerant
Network (DTN) by proposing metaheuristic driven approach of Ant Colony
optimization (ACO) technique with anycast semantics models . Here we propose
the parking architecture to solve the problem of parking especially in
commercial areas with their design diagrams . In this architecture we apply the
delivery model to deliver the packet correctly to the intended receiver. Using
this we can book various parkings through remote areas so that the customer can
get the information about availability of various parkings inside an area and
the parking fare for each category of the automobile. Using this architecture
the customer can get the prior knowledge about various vacant parking slots
inside a parking area and he can book the corresponding parking from his
location.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 17:15:19 GMT"
}
] | 2013-08-14T00:00:00 |
[
[
"Dixit",
"Rahul K",
""
],
[
"Johari",
"Rahul",
""
]
] |
new_dataset
| 0.980162 |
1211.4907
|
Luis Pedro Coelho
|
Luis Pedro Coelho
|
Mahotas: Open source software for scriptable computer vision
| null |
Journal of Open Research Software 1(1):e3 2013
|
10.5334/jors.ac
| null |
cs.CV cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mahotas is a computer vision library for Python. It contains traditional
image processing functionality such as filtering and morphological operations
as well as more modern computer vision functions for feature computation,
including interest point detection and local descriptors.
The interface is in Python, a dynamic programming language, which is very
appropriate for fast development, but the algorithms are implemented in C++ and
are tuned for speed. The library is designed to fit in with the scientific
software ecosystem in this language and can leverage the existing
infrastructure developed in that language.
Mahotas is released under a liberal open source license (MIT License) and is
available from (http://github.com/luispedro/mahotas) and from the Python
Package Index (http://pypi.python.org/pypi/mahotas).
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2012 00:51:10 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Jan 2013 01:16:00 GMT"
}
] | 2013-08-13T00:00:00 |
[
[
"Coelho",
"Luis Pedro",
""
]
] |
new_dataset
| 0.999675 |
1212.4653
|
Giuliano La Guardia Gadioli
|
Giuliano G. La Guardia
|
Convolutional Codes Derived From Group Character Codes
|
Accepted for publication in Discrete Math
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New families of unit memory as well as multi-memory convolutional codes are
constructed algebraically in this paper. These convolutional codes are derived
from the class of group character codes. The proposed codes have basic
generator matrices, consequently, they are non catastrophic. Additionally, the
new code parameters are better than the ones available in the literature.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2012 13:16:52 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Aug 2013 22:39:52 GMT"
}
] | 2013-08-13T00:00:00 |
[
[
"La Guardia",
"Giuliano G.",
""
]
] |
new_dataset
| 0.999076 |
1308.1166
|
Peter Gloor
|
Tobias Futterer, Peter A. Gloor, Tushar Malhotra, Harrison Mfula,
Karsten Packmohr, Stefan Schultheiss
|
WikiPulse - A News-Portal Based on Wikipedia
|
Presented at COINs13 Conference, Chile, 2013 (arxiv:1308.1028)
| null | null |
coins13/2013/11
|
cs.IR cs.DL cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
More and more user-generated content is complementing conventional
journalism. While we don't think that CNN or New York Times and its
professional journalists will disappear anytime soon, formidable competition is
emerging through humble Wikipedia editors. In earlier work (Becker 2012), we
found that entertainment and sports news appeared on average about two hours
earlier on Wikipedia than on CNN and Reuters online. In this project we build a
news-reader that automatically identifies late-breaking news among the most
recent Wikipedia articles and then displays it on a dedicated Web site.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 03:07:02 GMT"
}
] | 2013-08-13T00:00:00 |
[
[
"Futterer",
"Tobias",
""
],
[
"Gloor",
"Peter A.",
""
],
[
"Malhotra",
"Tushar",
""
],
[
"Mfula",
"Harrison",
""
],
[
"Packmohr",
"Karsten",
""
],
[
"Schultheiss",
"Stefan",
""
]
] |
new_dataset
| 0.999265 |
1308.1214
|
Shariful Alam
|
Sk. Shariful Alam, Lucio Marcenaro and Carlo Regazzoni
|
Opportunistic Spectrum Sensing and Transmissions
| null |
Cognitive Radio and Interference Management: Technology and
Strategy. IGI Global, 2013. 1-28
|
10.4018/978-1-4666-2005-6.ch001
| null |
cs.NI cs.ET
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Nowadays, cognitive radio is one of the most promising paradigms in the arena
of wireless communications, as it aims at the proficient use of radio
resources. Proper utilization of the radio spectrum requires dynamic spectrum
accessing. To this end, spectrum sensing is undoubtedly necessary. In this
chapter, various approaches for dynamic spectrum access scheme are presented,
together with a survey of spectrum sensing methodologies for cognitive radio.
Moreover, the challenges are analyzed that are associated with spectrum sensing
and dynamic spectrum access techniques. Sensing beacon transmitted from
different cognitive terminals creates significant interference to the primary
users if proper precautions have not be not taken into consideration.
Consequently, cognitive radio transmitter power control will be finally
addressed to analyze energy efficiency aspects.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 09:22:30 GMT"
}
] | 2013-08-13T00:00:00 |
[
[
"Alam",
"Sk. Shariful",
""
],
[
"Marcenaro",
"Lucio",
""
],
[
"Regazzoni",
"Carlo",
""
]
] |
new_dataset
| 0.996584 |
1308.2541
|
Rafayel Kamalian
|
R.R. Kamalian
|
Interval colorings of complete bipartite graphs and trees
|
R.R. Kamalian "Interval colorings of complete bipartite graphs and
trees", Preprint of the Computing Centre of the Academy of Sciences of
Armenia, Yerevan, 1989
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A translation from Russian of the work of R.R. Kamalian "Interval colorings
of complete bipartite graphs and trees", Preprint of the Computing Centre of
the Academy of Sciences of Armenia, Yerevan, 1989. (Was published by the
decision of the Academic Council of the Computing Centre of the Academy of
Sciences of Armenian SSR and Yerevan State University from 7.09.1989).
|
[
{
"version": "v1",
"created": "Mon, 12 Aug 2013 12:20:02 GMT"
}
] | 2013-08-13T00:00:00 |
[
[
"Kamalian",
"R. R.",
""
]
] |
new_dataset
| 0.97611 |
1308.1733
|
Muthiah Annamalai
|
Muthiah Annamalai
|
Invitation to Ezhil: A Tamil Programming Language for Early
Computer-Science Education
|
11 pages, 5 insets, 4 figures; accepted to Tamil Internet Conference,
2013, TI-2013, Malaysia
| null | null | null |
cs.CY cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ezhil is a Tamil programming language with support for imperative
programming, with mixed use of Tamil and English identifiers and
function-names. Ezhil programing system is targeted toward the K-12 (junior
high-school) level Tamil speaking students, as an early introduction to
thinking like a computer-scientist. We believe this 'numeracy' knowledge is
easily transferred over from a native language (Tamil) to the pervasive English
language programming systems, in Java, dot-Net, Ruby or Python. Ezhil is an
effort to improve access to computing in the 21st Century.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 01:47:36 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Annamalai",
"Muthiah",
""
]
] |
new_dataset
| 0.999483 |
1308.1986
|
Geoffrey Irving
|
Geoffrey Irving and Forrest Green
|
A deterministic pseudorandom perturbation scheme for arbitrary
polynomial predicates
|
15 pages, 2 figures
| null | null | null |
cs.CG
|
http://creativecommons.org/licenses/by/3.0/
|
We present a symbolic perturbation scheme for arbitrary polynomial geometric
predicates which combines the benefits of Emiris and Canny's simple randomized
linear perturbation scheme with Yap's multiple infinitesimal scheme for general
predicates. Like the randomized scheme, our method accepts black box polynomial
functions as input. For nonmaliciously chosen predicates, our method is as fast
as the linear scheme, scaling reasonably with the degree of the polynomial even
for fully degenerate input. Like Yap's scheme, the computed sign is
deterministic, never requiring an algorithmic restart (assuming a high quality
pseudorandom generator), and works for arbitrary predicates with no knowledge
of their structure. We also apply our technique to exactly or nearly exactly
rounded constructions that work correctly for degenerate input, using
l'Hopital's rule to compute the necessary singular limits. We provide an open
source prototype implementation including example algorithms for Delaunay
triangulation and Boolean operations on polygons and circular arcs in the
plane.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 21:44:36 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Irving",
"Geoffrey",
""
],
[
"Green",
"Forrest",
""
]
] |
new_dataset
| 0.992257 |
1308.2058
|
Blesson Varghese
|
Ishan Patel, Blesson Varghese, Adam Barker
|
RBioCloud: A Light-weight Framework for Bioconductor and R-based Jobs on
the Cloud
|
Webpage: http://www.rbiocloud.com
| null | null | null |
cs.DC cs.CE cs.PF cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale ad hoc analytics of genomic data is popular using the
R-programming language supported by 671 software packages provided by
Bioconductor. More recently, analytical jobs are benefitting from on-demand
computing and storage, their scalability and their low maintenance cost, all of
which are offered by the cloud. While Biologists and Bioinformaticists can take
an analytical job and execute it on their personal workstations, it remains
challenging to seamlessly execute the job on the cloud infrastructure without
extensive knowledge of the cloud dashboard. How analytical jobs can not only
with minimum effort be executed on the cloud, but also how both the resources
and data required by the job can be managed is explored in this paper. An
open-source light-weight framework for executing R-scripts using Bioconductor
packages, referred to as `RBioCloud', is designed and developed. RBioCloud
offers a set of simple command-line tools for managing the cloud resources, the
data and the execution of the job. Three biological test cases validate the
feasibility of RBioCloud. The framework is publicly available from
http://www.rbiocloud.com.
|
[
{
"version": "v1",
"created": "Fri, 9 Aug 2013 09:20:02 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Patel",
"Ishan",
""
],
[
"Varghese",
"Blesson",
""
],
[
"Barker",
"Adam",
""
]
] |
new_dataset
| 0.999213 |
1308.2124
|
Alexander V Terekhov
|
Alexander V. Terekhov and J. Kevin O'Regan
|
Space as an invention of biological organisms
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The question of the nature of space around us has occupied thinkers since the
dawn of humanity, with scientists and philosophers today implicitly assuming
that space is something that exists objectively. Here we show that this does
not have to be the case: the notion of space could emerge when biological
organisms seek an economic representation of their sensorimotor flow. The
emergence of spatial notions does not necessitate the existence of real
physical space, but only requires the presence of sensorimotor invariants
called `compensable' sensory changes. We show mathematically and then in
simulations that na\"ive agents making no assumptions about the existence of
space are able to learn these invariants and to build the abstract notion that
physicists call rigid displacement, which is independent of what is being
displaced. Rigid displacements may underly perception of space as an unchanging
medium within which objects are described by their relative positions. Our
findings suggest that the question of the nature of space, currently exclusive
to philosophy and physics, should also be addressed from the standpoint of
neuroscience and artificial intelligence.
|
[
{
"version": "v1",
"created": "Fri, 9 Aug 2013 13:50:48 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Terekhov",
"Alexander V.",
""
],
[
"O'Regan",
"J. Kevin",
""
]
] |
new_dataset
| 0.963781 |
1308.2166
|
Kanat Tangwongsan
|
Kanat Tangwongsan, A. Pavan, and Srikanta Tirthapura
|
Parallel Triangle Counting in Massive Streaming Graphs
| null | null | null | null |
cs.DB cs.DC cs.DS cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of triangles in a graph is a fundamental metric, used in social
network analysis, link classification and recommendation, and more. Driven by
these applications and the trend that modern graph datasets are both large and
dynamic, we present the design and implementation of a fast and cache-efficient
parallel algorithm for estimating the number of triangles in a massive
undirected graph whose edges arrive as a stream. It brings together the
benefits of streaming algorithms and parallel algorithms. By building on the
streaming algorithms framework, the algorithm has a small memory footprint. By
leveraging the paralell cache-oblivious framework, it makes efficient use of
the memory hierarchy of modern multicore machines without needing to know its
specific parameters. We prove theoretical bounds on accuracy, memory access
cost, and parallel runtime complexity, as well as showing empirically that the
algorithm yields accurate results and substantial speedups compared to an
optimized sequential implementation.
(This is an expanded version of a CIKM'13 paper of the same title.)
|
[
{
"version": "v1",
"created": "Fri, 9 Aug 2013 15:54:22 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Tangwongsan",
"Kanat",
""
],
[
"Pavan",
"A.",
""
],
[
"Tirthapura",
"Srikanta",
""
]
] |
new_dataset
| 0.991279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.