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
|
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1209.4187
|
M\'arton Trencs\'eni
|
M\'arton Trencs\'eni, Attila Gazs\'o, Holger Reinhardt
|
PaxosLease: Diskless Paxos for Leases
|
9 pages, 2 figures
| null | null | null |
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes PaxosLease, a distributed algorithm for lease
negotiation. PaxosLease is based on Paxos, but does not require disk writes or
clock synchrony. PaxosLease is used for master lease negotation in the
open-source Keyspace and ScalienDB replicated key-value stores.
|
[
{
"version": "v1",
"created": "Wed, 19 Sep 2012 08:58:52 GMT"
}
] | 2012-09-20T00:00:00 |
[
[
"Trencséni",
"Márton",
""
],
[
"Gazsó",
"Attila",
""
],
[
"Reinhardt",
"Holger",
""
]
] |
new_dataset
| 0.999463 |
1209.3794
|
Moustafa Alzantot
|
Moustafa Alzantot, Moustafa Youssef
|
CrowdInside: Automatic Construction of Indoor Floorplans
| null |
20th ACM SIGSPATIAL International Conference on Advances in
Geographic Information Systems (ACM SIGSPATIAL GIS 2012)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The existence of a worldwide indoor floorplans database can lead to
significant growth in location-based applications, especially for indoor
environments. In this paper, we present CrowdInside: a crowdsourcing-based
system for the automatic construction of buildings floorplans. CrowdInside
leverages the smart phones sensors that are ubiquitously available with humans
who use a building to automatically and transparently construct accurate motion
traces. These accurate traces are generated based on a novel technique for
reducing the errors in the inertial motion traces by using the points of
interest in the indoor environment, such as elevators and stairs, for error
resetting. The collected traces are then processed to detect the overall
floorplan shape as well as higher level semantics such as detecting rooms and
corridors shapes along with a variety of points of interest in the environment.
Implementation of the system in two testbeds, using different Android phones,
shows that CrowdInside can detect the points of interest accurately with 0.2%
false positive rate and 1.3% false negative rate. In addition, the proposed
error resetting technique leads to more than 12 times enhancement in the median
distance error compared to the state-of-the-art. Moreover, the detailed
floorplan can be accurately estimated with a a relatively small number of
traces. This number is amortized over the number of users of the building. We
also discuss possible extensions to CrowdInside for inferring even higher level
semantics about the discovered floorplans.
|
[
{
"version": "v1",
"created": "Mon, 17 Sep 2012 20:41:27 GMT"
}
] | 2012-09-19T00:00:00 |
[
[
"Alzantot",
"Moustafa",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.988387 |
1209.3913
|
M\'arton Trencs\'eni
|
M\'arton Trencs\'eni, Attila Gazs\'o
|
Keyspace: A Consistently Replicated, Highly-Available Key-Value Store
|
9 pages, 4 figures
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the design and architecture of Keyspace, a distributed
key-value store offering strong consistency, fault-tolerance and high
availability. The source code is available under the open-source AGPL license
for Linux, Windows and BSD-like platforms. As of 2012, Keyspace is no longer
undergoing active development.
|
[
{
"version": "v1",
"created": "Tue, 18 Sep 2012 11:35:57 GMT"
}
] | 2012-09-19T00:00:00 |
[
[
"Trencséni",
"Márton",
""
],
[
"Gazsó",
"Attila",
""
]
] |
new_dataset
| 0.999534 |
1209.4056
|
Kashyap Dixit
|
Kashyap Dixit and Madhav Jha and Abhradeep Thakurta
|
Testing Lipschitz Property over Product Distribution and its
Applications to Statistical Data Privacy
|
17 pages
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
In this work, we present a connection between Lipschitz property testing and
a relaxed notion of differential privacy, where we assume that the datasets are
being sampled from a domain according to some distribution defined on it.
Specifically, we show that testing whether an algorithm is private can be
reduced to testing Lipschitz property in the distributional setting.
We also initiate the study of distribution Lipschitz testing. We present an
efficient Lipschitz tester for the hypercube domain when the "distance to
property" is measured with respect to product distribution. Most previous works
in property testing of functions (including prior works on Lipschitz testing)
work with uniform distribution.
|
[
{
"version": "v1",
"created": "Tue, 18 Sep 2012 18:51:17 GMT"
}
] | 2012-09-19T00:00:00 |
[
[
"Dixit",
"Kashyap",
""
],
[
"Jha",
"Madhav",
""
],
[
"Thakurta",
"Abhradeep",
""
]
] |
new_dataset
| 0.995981 |
1209.3433
|
Salah A. Aly
|
Hossam M. Zawbaa, Salah A. Aly, Adnan A. Gutub
|
A Hajj And Umrah Location Classification System For Video Crowded Scenes
|
9 pages, 10 figures, 2 tables, 3 algirthms
| null | null | null |
cs.CV cs.CY cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new automatic system for classifying ritual locations in
diverse Hajj and Umrah video scenes is investigated. This challenging subject
has mostly been ignored in the past due to several problems one of which is the
lack of realistic annotated video datasets. HUER Dataset is defined to model
six different Hajj and Umrah ritual locations[26].
The proposed Hajj and Umrah ritual location classifying system consists of
four main phases: Preprocessing, segmentation, feature extraction, and location
classification phases. The shot boundary detection and background/foregroud
segmentation algorithms are applied to prepare the input video scenes into the
KNN, ANN, and SVM classifiers. The system improves the state of art results on
Hajj and Umrah location classifications, and successfully recognizes the six
Hajj rituals with more than 90% accuracy. The various demonstrated experiments
show the promising results.
|
[
{
"version": "v1",
"created": "Sat, 15 Sep 2012 20:57:51 GMT"
}
] | 2012-09-18T00:00:00 |
[
[
"Zawbaa",
"Hossam M.",
""
],
[
"Aly",
"Salah A.",
""
],
[
"Gutub",
"Adnan A.",
""
]
] |
new_dataset
| 0.997445 |
1209.3460
|
Swadesh Choudhary
|
Swadesh Choudhary, Hrishikesh Sharma, B. S. Adiga and Sachin Patkar
|
Expander-like Codes based on Finite Projective Geometry
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel error correcting code and decoding algorithm which have
construction similar to expander codes. The code is based on a bipartite graph
derived from the subsumption relations of finite projective geometry, and
Reed-Solomon codes as component codes. We use a modified version of well-known
Zemor's decoding algorithm for expander codes, for decoding our codes. By
derivation of geometric bounds rather than eigenvalue bounds, it has been
proved that for practical values of the code rate, the random error correction
capability of our codes is much better than those derived for previously
studied graph codes, including Zemor's bound. MATLAB simulations further reveal
that the average case performance of this code is 10 times better than these
geometric bounds obtained, in almost 99% of the test cases. By exploiting the
symmetry of projective space lattices, we have designed a corresponding decoder
that has optimal throughput. The decoder design has been prototyped on Xilinx
Virtex 5 FPGA. The codes are designed for potential applications in secondary
storage media. As an application, we also discuss usage of these codes to
improve the burst error correction capability of CD-ROM decoder.
|
[
{
"version": "v1",
"created": "Sun, 16 Sep 2012 04:41:22 GMT"
}
] | 2012-09-18T00:00:00 |
[
[
"Choudhary",
"Swadesh",
""
],
[
"Sharma",
"Hrishikesh",
""
],
[
"Adiga",
"B. S.",
""
],
[
"Patkar",
"Sachin",
""
]
] |
new_dataset
| 0.995363 |
1209.3525
|
Elham Javiz
|
Arash Ghorbannia Delavar and Elham Javiz
|
EBCD: a routing algorithm based on bee colony for energy consumption
reduction in wireless relay networks
|
International Journal of Ad hoc, Sensor & Ubiquitous Computing
(IJASUC) Vol.3, No.4, 2012
| null |
10.5121/ijasuc.2012.3401
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the important issues in wireless networks is the Routing problem that
is effective on system performance, in this article the attempt is made to
propose a routing algorithm using the bee colony in order to reduce energy
consumption in wireless relay networks. In EBCD algorithm, through combined of
energy, distance and traffic parameters a routing algorithm for wireless
networks is presented with more efficiency than its predecessor. Applying the
bee colony method would allow the placement of the parameters under
conventional conditions and to get closer to a mechanism with a better
adaptability than that of the existing algorithm. According to the parameters
considered, the proposed algorithm provides a fitness function that can be
applied as a multi-hop. Unlike other algorithms of its kind this can increase
service quality based on environmental conditions through its multiple
services. This new method can store the energy accumulated in the nodes and
reduce the hop restrictions.
|
[
{
"version": "v1",
"created": "Sun, 16 Sep 2012 21:57:47 GMT"
}
] | 2012-09-18T00:00:00 |
[
[
"Delavar",
"Arash Ghorbannia",
""
],
[
"Javiz",
"Elham",
""
]
] |
new_dataset
| 0.999369 |
1209.3549
|
Ashutosh Nayyar
|
Ashutosh Nayyar, Abhishek Gupta, C\'edric Langbort and Tamer Ba\c{s}ar
|
Nash Equilibria for Stochastic Games with Asymmetric Information-Part 1:
Finite Games
| null | null | null | null |
cs.GT cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A model of stochastic games where multiple controllers jointly control the
evolution of the state of a dynamic system but have access to different
information about the state and action processes is considered. The asymmetry
of information among the controllers makes it difficult to compute or
characterize Nash equilibria. Using common information among the controllers,
the game with asymmetric information is shown to be equivalent to another game
with symmetric information. Further, under certain conditions, a Markov state
is identified for the equivalent symmetric information game and its Markov
perfect equilibria are characterized. This characterization provides a backward
induction algorithm to find Nash equilibria of the original game with
asymmetric information in pure or behavioral strategies. Each step of this
algorithm involves finding Bayesian Nash equilibria of a one-stage Bayesian
game. The class of Nash equilibria of the original game that can be
characterized in this backward manner are named common information based Markov
perfect equilibria.
|
[
{
"version": "v1",
"created": "Mon, 17 Sep 2012 04:37:58 GMT"
}
] | 2012-09-18T00:00:00 |
[
[
"Nayyar",
"Ashutosh",
""
],
[
"Gupta",
"Abhishek",
""
],
[
"Langbort",
"Cédric",
""
],
[
"Başar",
"Tamer",
""
]
] |
new_dataset
| 0.998105 |
1209.3644
|
Petrus H Potgieter
|
Petrus H. Potgieter
|
Availability of titles on peer-to-peer file sharing networks
|
8 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
File sharing, typically involving video or audio material in which copyright
may persist and using peer-to-peer (P2P) networks like BitTorrent, has been
reported to make up the bulk of Internet traffic. The free-riding problem
appears in this "digital gift economy" but its users exhibit rational
behaviour, subject to the characteristics of the particular network. The high
demand for the Internet as a delivery channel for entertainment underlines the
importance of understanding the dynamics of this market, especially when
considering possible business models for future pricing or licensing regimes
and for the provisioning of network capacity to support future services. The
availability of specific titles on file sharing networks is the focus of this
paper, with a special emphasis on the P2P protocol BitTorrent. The paper
compares the incentives provided in BitTorrent to those in other file-sharing
communities, including file hosting, and discusses the number of titles
available in the community at any given time, with an emphasis on popular video
items with ambiguous legal status.
|
[
{
"version": "v1",
"created": "Mon, 17 Sep 2012 13:12:04 GMT"
}
] | 2012-09-18T00:00:00 |
[
[
"Potgieter",
"Petrus H.",
""
]
] |
new_dataset
| 0.991509 |
1209.2794
|
Hakik Paci
|
Hakik Paci, Elinda Kajo Mece, Aleksander Xhuvani
|
Protecting oracle pl/sql source code from a dba user
| null |
International Journal of Database Management Systems, 4, (2012)
43-52
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we are presenting a new way to disable DDL statements on some
specific PL/SQL procedures to a dba user in the Oracle database. Nowadays dba
users have access to a lot of data and source code even if they do not have
legal permissions to see or modify them. With this method we can disable the
ability to execute DDL and DML statements on some specific pl/sql procedures
from every Oracle database user even if it has a dba role. Oracle gives to
developer the possibility to wrap the pl/sql procedures, functions and packages
but those wrapped scripts can be unwrapped by using third party tools. The
scripts that we have developed analyzes all database sessions, and if they
detect a DML or a DDL statement from an unauthorized user to procedure,
function or package which should be protected then the execution of the
statement is denied. Furthermore, these scripts do not allow a dba user to drop
or disable the scripts themselves. In other words by managing sessions prior to
the execution of an eventual statement from a dba user, we can prevent the
execution of eventual statements which target our scripts.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 07:07:24 GMT"
}
] | 2012-09-17T00:00:00 |
[
[
"Paci",
"Hakik",
""
],
[
"Mece",
"Elinda Kajo",
""
],
[
"Xhuvani",
"Aleksander",
""
]
] |
new_dataset
| 0.990979 |
1209.3052
|
Samuel King Opoku
|
Samuel King Opoku (Kumasi Polytechnic)
|
A Simultaneous-Movement Mobile Multiplayer Game Design based on Adaptive
Background Partitioning Technique
|
8 pages
|
Cyber Journals: Multidisciplinary Journals in Science and
Technology, JSAT, Vol. 3, No. 4, pg 1-8, 2012
| null | null |
cs.GT cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implementations of mobile games have become prevalent industrial technology
due to the ubiquitous nature of mobile devices. However, simultaneous-movement
multiplayer games, games that a player competes simultaneously with other
players, are usually affected by such parameters as latency, type of game
architecture and type of communication technology. This paper makes a review of
the above parameters, considering the pros and cons of the various techniques
used in addressing each parameter. It then goes ahead to propose an enhanced
mechanism for dealing with packet delays based on partitioning the game
background into grids. The proposed design is implemented and tested using
Bluetooth and Wi-Fi communication technologies. The efficiency and
effectiveness of the design are also analyzed.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 22:12:16 GMT"
}
] | 2012-09-17T00:00:00 |
[
[
"Opoku",
"Samuel King",
"",
"Kumasi Polytechnic"
]
] |
new_dataset
| 0.971175 |
1209.3275
|
Franklin Marquezino
|
A. C. Ribeiro, C. M. H. de Figueiredo, F. L. Marquezino, L. A. B.
Kowada
|
Cayley graphs and analysis of quantum cost for reversible circuit
synthesis
|
IV Workshop-School on Quantum Computation and Information (WECIQ
2012), Fortaleza, Brazil
| null | null | null |
cs.DM quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the theory of Cayley graphs as a framework to analyse gate counts
and quantum costs resulting from reversible circuit synthesis. Several methods
have been proposed in the reversible logic synthesis literature by considering
different libraries whose gates are associated to the generating sets of
certain Cayley graphs. In a Cayley graph, the distance between two vertices
corresponds to the optimal circuit size. The lower bound for the diameter of
Cayley graphs is also a lower bound for the worst case for any algorithm that
uses the corresponding gate library. In this paper, we study two Cayley graphs
on the Symmetric Group $S_{2^n}$: the first, denoted by $I_n$, is defined by a
generating set associated to generalized Toffoli gates; and the second, the
hypercube Cayley graph $H_n$, is defined by a generating set associated to
multiple-control Toffoli gates. Those two Cayley graphs have degree $n2^{n-1}$
and order $2^n!$. Maslov, Dueck and Miller proposed a reversible circuit
synthesis that we model by the Cayley graph $I_n$. We propose a synthesis
algorithm based on the Cayley graph $H_n$ with upper bound of $(n-1)2^{n}+1$
multiple-control Toffoli gates. In addition, the diameter of the Cayley graph
$H_n$ gives a lower bound of $n2^{n-1}$.
|
[
{
"version": "v1",
"created": "Fri, 14 Sep 2012 18:28:05 GMT"
}
] | 2012-09-17T00:00:00 |
[
[
"Ribeiro",
"A. C.",
""
],
[
"de Figueiredo",
"C. M. H.",
""
],
[
"Marquezino",
"F. L.",
""
],
[
"Kowada",
"L. A. B.",
""
]
] |
new_dataset
| 0.999687 |
1209.2531
|
Steven Murdoch
|
Mike Bond, Omar Choudary, Steven J. Murdoch, Sergei Skorobogatov, Ross
Anderson
|
Chip and Skim: cloning EMV cards with the pre-play attack
| null | null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EMV, also known as "Chip and PIN", is the leading system for card payments
worldwide. It is used throughout Europe and much of Asia, and is starting to be
introduced in North America too. Payment cards contain a chip so they can
execute an authentication protocol. This protocol requires point-of-sale (POS)
terminals or ATMs to generate a nonce, called the unpredictable number, for
each transaction to ensure it is fresh. We have discovered that some EMV
implementers have merely used counters, timestamps or home-grown algorithms to
supply this number. This exposes them to a "pre-play" attack which is
indistinguishable from card cloning from the standpoint of the logs available
to the card-issuing bank, and can be carried out even if it is impossible to
clone a card physically (in the sense of extracting the key material and
loading it into another card). Card cloning is the very type of fraud that EMV
was supposed to prevent. We describe how we detected the vulnerability, a
survey methodology we developed to chart the scope of the weakness, evidence
from ATM and terminal experiments in the field, and our implementation of
proof-of-concept attacks. We found flaws in widely-used ATMs from the largest
manufacturers. We can now explain at least some of the increasing number of
frauds in which victims are refused refunds by banks which claim that EMV cards
cannot be cloned and that a customer involved in a dispute must therefore be
mistaken or complicit. Pre-play attacks may also be carried out by malware in
an ATM or POS terminal, or by a man-in-the-middle between the terminal and the
acquirer. We explore the design and implementation mistakes that enabled the
flaw to evade detection until now: shortcomings of the EMV specification, of
the EMV kernel certification process, of implementation testing, formal
analysis, or monitoring customer complaints. Finally we discuss
countermeasures.
|
[
{
"version": "v1",
"created": "Wed, 12 Sep 2012 09:16:13 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Bond",
"Mike",
""
],
[
"Choudary",
"Omar",
""
],
[
"Murdoch",
"Steven J.",
""
],
[
"Skorobogatov",
"Sergei",
""
],
[
"Anderson",
"Ross",
""
]
] |
new_dataset
| 0.998331 |
1209.2806
|
Ichrak Amdouni
|
Ichrak Amdouni (INRIA Rocquencourt), Pascale Minet (INRIA
Rocquencourt)
|
TRASA: TRaffic Aware Slot Assignment Algorithm in Wireless Sensor
Networks
| null |
The 2nd International Conference On Communications and Information
Technology: ICCIT 2012 (2012)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In data gathering applications which is a typical application paradigm in
wireless sensor networks, sensor nodes may have different traffic demands.
Assigning equal channel access to each node may lead to congestion, inefficient
use of the bandwidth and decrease of the application performance. In this
paper, we prove that the time slot assignment problem is NP-complete when p-hop
nodes are not assigned the same slot, with 1 <= p <= h for any strictly
positive integer h. We propose TRASA, a TRaffic Aware time Slot Assignment
algorithm able to allocate slots to sensors proportionally to their demand. We
evaluate the performance of TRASA for different heuristics and prove that it
provides an optimized spatial reuse and a minimized cycle length.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 08:04:17 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Amdouni",
"Ichrak",
"",
"INRIA Rocquencourt"
],
[
"Minet",
"Pascale",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.999393 |
1209.2810
|
Ichrak Amdouni
|
Ichrak Amdouni (INRIA Rocquencourt), Pascale Minet (INRIA
Rocquencourt), C\'edric Adjih (INRIA Rocquencourt)
|
Node Coloring in Wireless Networks: Complexity Results and Grid Coloring
|
arXiv admin note: substantial text overlap with arXiv:1104.1859
|
IFIP Wireless and Mobile Networking Conference WMNC 2011 (2011)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coloring is used in wireless networks to improve communication efficiency,
mainly in terms of bandwidth, energy and possibly end-to-end delays. In this
paper, we define the h-hop node coloring problem, with h any positive integer,
adapted to two types of applications in wireless networks. We specify both
general mode for general applications and strategic mode for data gathering
applications.We prove that the associated decision problem is NP-complete. We
then focus on grid topologies that constitute regular topologies for large or
dense wireless networks. We consider various transmission ranges and identify a
color pattern that can be reproduced to color the whole grid with the optimal
number of colors. We obtain an optimal periodic coloring of the grid for the
considered transmission range. We then present a 3-hop distributed coloring
algorithm, called SERENA. Through simulation results, we highlight the impact
of node priority assignment on the number of colors obtained for any network
and grids in particular. We then compare these optimal results on grids with
those obtained by SERENA and identify directions to improve SERENA.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 08:19:13 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Amdouni",
"Ichrak",
"",
"INRIA Rocquencourt"
],
[
"Minet",
"Pascale",
"",
"INRIA\n Rocquencourt"
],
[
"Adjih",
"Cédric",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.978668 |
1209.2816
|
Padmavathi S
|
S. Padmavathi, B. Priyalakshmi. Dr. K. P. Soman
|
Hirarchical Digital Image Inpainting Using Wavelets
|
8 pages, 9 figures
|
Signal & Image Processing : An International Journal (SIPIJ)
Vol.3, No.4, August 2012
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inpainting is the technique of reconstructing unknown or damaged portions of
an image in a visually plausible way. Inpainting algorithm automatically fills
the damaged region in an image using the information available in undamaged
region. Propagation of structure and texture information becomes a challenge as
the size of damaged area increases. In this paper, a hierarchical inpainting
algorithm using wavelets is proposed. The hierarchical method tries to keep the
mask size smaller while wavelets help in handling the high pass structure
information and low pass texture information separately. The performance of the
proposed algorithm is tested using different factors. The results of our
algorithm are compared with existing methods such as interpolation, diffusion
and exemplar techniques.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 08:40:17 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Padmavathi",
"S.",
""
],
[
"Soman",
"B. Priyalakshmi. Dr. K. P.",
""
]
] |
new_dataset
| 0.964848 |
1209.2848
|
Peter Kling
|
Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn
|
Slow Down & Sleep for Profit in Online Deadline Scheduling
|
An extended abstract of this paper has been accepted for publication
in the proceedings of the 1st Mediterranean Conference on Algorithms
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present and study a new model for energy-aware and profit-oriented
scheduling on a single processor. The processor features dynamic speed scaling
as well as suspension to a sleep mode. Jobs arrive over time, are preemptable,
and have different sizes, values, and deadlines. On the arrival of a new job,
the scheduler may either accept or reject the job. Accepted jobs need a certain
energy investment to be finished in time, while rejected jobs cause costs equal
to their values. Here, power consumption at speed $s$ is given by
$P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over
time. Additionally, the scheduler may decide to suspend the processor to a
sleep mode in which no energy is consumed, though awaking entails fixed
transition costs $\gamma$. The objective is to minimize the total value of
rejected jobs plus the total energy.
Our model combines aspects from advanced energy conservation techniques
(namely speed scaling and sleep states) and profit-oriented scheduling models.
We show that \emph{rejection-oblivious} schedulers (whose rejection decisions
are not based on former decisions) have -- in contrast to the model without
sleep states -- an unbounded competitive ratio w.r.t\text{.} the processor
parameters $\alpha$ and $\beta$. It turns out that the worst-case performance
of such schedulers depends linearly on the jobs' value densities (the ratio
between a job's value and its work). We give an algorithm whose competitiveness
nearly matches this lower bound. If the maximum value density is not too large,
the competitiveness becomes $\alpha^{\alpha}+2e\alpha$. Also, we show that it
suffices to restrict the value density of low-value jobs only. Using a
technique from \cite{Chan:2010} we transfer our results to processors with a
fixed maximum speed.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 10:36:40 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Kling",
"Peter",
""
],
[
"Cord-Landwehr",
"Andreas",
""
],
[
"Mallmann-Trenn",
"Frederik",
""
]
] |
new_dataset
| 0.974057 |
1209.2894
|
Chao Chen
|
Chao Chen, Hongmei Xie, and Baoming Bai
|
Layered Subspace Codes for Network Coding
|
13 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Subspace codes were introduced by K\"otter and Kschischang for error control
in random linear network coding. In this paper, a layered type of subspace
codes is considered, which can be viewed as a superposition of multiple
component subspace codes. Exploiting the layered structure, we develop two
decoding algorithms for these codes. The first algorithm operates by separately
decoding each component code. The second algorithm is similar to the successive
interference cancellation (SIC) algorithm for conventional superposition
coding, and further permits an iterative version. We show that both algorithms
decode not only deterministically up to but also probabilistically beyond the
error-correction capability of the overall code. Finally we present possible
applications of layered subspace codes in several network coding scenarios.
|
[
{
"version": "v1",
"created": "Thu, 13 Sep 2012 13:53:07 GMT"
}
] | 2012-09-14T00:00:00 |
[
[
"Chen",
"Chao",
""
],
[
"Xie",
"Hongmei",
""
],
[
"Bai",
"Baoming",
""
]
] |
new_dataset
| 0.98473 |
1209.2635
|
Luis Sanabria-Russo
|
Luis Sanabria-Russo
|
TCP/IP communication between two USRP-E110
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This short report intends to provide an overview of the procedure and
statistics of establishing a TCP/IP link between two USRP-E110. The testings
are performed using an example GNURadio code and the networking protocol stack
provided by the Linux operating system embedded in the USRP-E110.
|
[
{
"version": "v1",
"created": "Wed, 12 Sep 2012 15:05:57 GMT"
}
] | 2012-09-13T00:00:00 |
[
[
"Sanabria-Russo",
"Luis",
""
]
] |
new_dataset
| 0.995245 |
1209.2641
|
Haibin Wang
|
Haibin Wang
|
C-PASS-PC: A Cloud-driven Prototype of Multi-Center Proactive
Surveillance System for Prostate Cancer
| null |
IJCSIT 2012
| null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently there are many clinical trials using paper case report forms as the
primary data collection tool. Cloud Computing platforms provide big potential
for increasing efficiency through a web-based data collection interface,
especially for large-scale multi-center trials. Traditionally, clinical and
biological data for multi-center trials are stored in one dedicated,
centralized database system running at a data coordinating center (DCC). This
paper presents C-PASS-PC, a cloud-driven prototype of multi-center proactive
surveillance system for prostate cancer. The prototype is developed in PHP,
JQuery and CSS with an Oracle backend in a local Web server and database server
and deployed on Google App Engine (GAE) and Google Cloud SQL-MySQL. The
deploying process is fast and easy to follow. The C-PASS-PC prototype can be
accessed through an SSL-enabled web browser. Our approach proves the concept
that cloud computing platforms such as GAE is a suitable and flexible solution
in the near future for multi-center clinical trials.
|
[
{
"version": "v1",
"created": "Wed, 12 Sep 2012 15:29:12 GMT"
}
] | 2012-09-13T00:00:00 |
[
[
"Wang",
"Haibin",
""
]
] |
new_dataset
| 0.998565 |
1209.2238
|
EPTCS
|
Gordon J. Pace (University of Malta), Fernando Schapachnik
(Universidad de Buenos Aires)
|
Contracts for Interacting Two-Party Systems
|
In Proceedings FLACOS 2012, arXiv:1209.1699
|
EPTCS 94, 2012, pp. 21-30
|
10.4204/EPTCS.94.3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article deals with the interrelation of deontic operators in contracts
-- an aspect often neglected when considering only one of the involved parties.
On top of an automata-based semantics we formalise the onuses that obligations,
permissions and prohibitions on one party impose on the other. Such
formalisation allows for a clean notion of contract strictness and a derived
notion of contract conflict that is enriched with issues arising from party
interdependence.
|
[
{
"version": "v1",
"created": "Tue, 11 Sep 2012 06:32:08 GMT"
}
] | 2012-09-12T00:00:00 |
[
[
"Pace",
"Gordon J.",
"",
"University of Malta"
],
[
"Schapachnik",
"Fernando",
"",
"Universidad de Buenos Aires"
]
] |
new_dataset
| 0.985377 |
1206.1077
|
Boaz Tsaban
|
Matan Banin and Boaz Tsaban
|
The Discrete Logarithm Problem in Bergman's non-representable ring
|
Improved exposition. To appear in the Journal of Mathematical
Cryptology
| null | null | null |
cs.CR math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bergman's Ring $E_p$, parameterized by a prime number $p$, is a ring with
$p^5$ elements that cannot be embedded in a ring of matrices over any
commutative ring. This ring was discovered in 1974. In 2011, Climent, Navarro
and Tortosa described an efficient implementation of $E_p$ using simple modular
arithmetic, and suggested that this ring may be a useful source for intractable
cryptographic problems.
We present a deterministic polynomial time reduction of the Discrete
Logarithm Problem in $E_p$ to the classical Discrete Logarithm Problem in
$\Zp$, the $p$-element field. In particular, the Discrete Logarithm Problem in
$E_p$ can be solved, by conventional computers, in sub-exponential time.
|
[
{
"version": "v1",
"created": "Tue, 5 Jun 2012 21:38:38 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Sep 2012 20:36:01 GMT"
}
] | 2012-09-11T00:00:00 |
[
[
"Banin",
"Matan",
""
],
[
"Tsaban",
"Boaz",
""
]
] |
new_dataset
| 0.990708 |
1209.1682
|
Sovan Samanta
|
Sovan Samanta, Madhumangal Pal
|
Irregular Bipolar Fuzzy Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we define irregular bipolar fuzzy graphs and its various
classifications. Size of regular bipolar fuzzy graphs is derived. The relation
between highly and neighbourly irregular bipolar fuzzy graphs are established.
Some basic theorems related to the stated graphs have also been presented.
|
[
{
"version": "v1",
"created": "Sat, 8 Sep 2012 02:17:46 GMT"
}
] | 2012-09-11T00:00:00 |
[
[
"Samanta",
"Sovan",
""
],
[
"Pal",
"Madhumangal",
""
]
] |
new_dataset
| 0.99539 |
1209.1803
|
Jaydip Sen
|
Jaydip Sen
|
Secure and Privacy-Preserving Authentication Protocols for Wireless Mesh
Networks
|
32 pages, 10 figures. The work is an extended version of the author's
previous works submitted in CoRR: arXiv:1107.5538v1 and arXiv:1102.1226v1
|
Secure and Privacy-Preserving Authentication Protocols for
Wireless Mesh Networks - Book Chapter in Applied Cryptography and Network
Security, Editor: Jaydip Sen, pp. 3 - 34, April 2012, published by INTECH,
Croatia
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh networks (WMNs) have emerged as a promising concept to meet the
challenges in next-generation wireless networks such as providing flexible,
adaptive, and reconfigurable architecture while offering cost-effective
solutions to service providers. As WMNs become an increasingly popular
replacement technology for last-mile connectivity to the home networking,
community and neighborhood networking, it is imperative to design efficient and
secure communication protocols for these networks. However, several
vulnerabilities exist in currently existing protocols for WMNs. These security
loopholes can be exploited by potential attackers to launch attack on WMNs. The
absence of a central point of administration makes securing WMNs even more
challenging. The broadcast nature of transmission and the dependency on the
intermediate nodes for multi-hop communications lead to several security
vulnerabilities in WMNs. The attacks can be external as well as internal in
nature. External attacks are launched by intruders who are not authorized users
of the network. For example, an intruding node may eavesdrop on the packets and
replay those packets at a later point of time to gain access to the network
resources. On the other hand, the internal attacks are launched by the nodes
that are part of the WMN. On example of such attack is an intermediate node
dropping packets which it was supposed to forward. This chapter presents a
comprehensive discussion on the current authentication and privacy protection
schemes for WMN. In addition, it proposes a novel security protocol for node
authentication and message confidentiality and an anonymization scheme for
privacy protection of users in WMNs.
|
[
{
"version": "v1",
"created": "Sun, 9 Sep 2012 14:33:37 GMT"
}
] | 2012-09-11T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.997495 |
0712.3088
|
Zhaohua Luo
|
Zhaohua Luo
|
Clones and Genoids in Lambda Calculus and First Order Logic
| null | null | null | null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A genoid is a category of two objects such that one is the product of itself
with the other. A genoid may be viewed as an abstract substitution algebra. It
is a remarkable fact that such a simple concept can be applied to present a
unified algebraic approach to lambda calculus and first order logic.
|
[
{
"version": "v1",
"created": "Wed, 19 Dec 2007 20:52:48 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Dec 2007 22:00:20 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Sep 2012 19:46:32 GMT"
}
] | 2012-09-10T00:00:00 |
[
[
"Luo",
"Zhaohua",
""
]
] |
new_dataset
| 0.998907 |
1209.1563
|
Nilanjan Dey
|
Sayantan Mukhopadhyay, Shouvik Biswas, Anamitra Bardhan Roy, Nilanjan
Dey
|
Wavelet Based QRS Complex Detection of ECG Signal
|
5 pages, 8 figures, ISSN: 2248-9622
|
Journal of Engineering Research and Applications (IJERA) Vol. 2,
Issue 3, 2012, pp.2361-2365
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Electrocardiogram (ECG) is a sensitive diagnostic tool that is used to
detect various cardiovascular diseases by measuring and recording the
electrical activity of the heart in exquisite detail. A wide range of heart
condition is determined by thorough examination of the features of the ECG
report. Automatic extraction of time plane features is important for
identification of vital cardiac diseases. This paper presents a
multi-resolution wavelet transform based system for detection 'P', 'Q', 'R',
'S', 'T' peaks complex from original ECG signal. 'R-R' time lapse is an
important minutia of the ECG signal that corresponds to the heartbeat of the
concerned person. Abrupt increase in height of the 'R' wave or changes in the
measurement of the 'R-R' denote various anomalies of human heart. Similarly
'P-P', 'Q-Q', 'S-S', 'T-T' also corresponds to different anomalies of heart and
their peak amplitude also envisages other cardiac diseases. In this proposed
method the 'PQRST' peaks are marked and stored over the entire signal and the
time interval between two consecutive 'R' peaks and other peaks interval are
measured to detect anomalies in behavior of heart, if any. The peaks are
achieved by the composition of Daubeheissub bands wavelet of original ECG
signal. The accuracy of the 'PQRST' complex detection and interval measurement
is achieved up to 100% with high exactitude by processing and thresholding the
original ECG signal.
|
[
{
"version": "v1",
"created": "Fri, 7 Sep 2012 15:05:57 GMT"
}
] | 2012-09-10T00:00:00 |
[
[
"Mukhopadhyay",
"Sayantan",
""
],
[
"Biswas",
"Shouvik",
""
],
[
"Roy",
"Anamitra Bardhan",
""
],
[
"Dey",
"Nilanjan",
""
]
] |
new_dataset
| 0.989033 |
1104.0991
|
Jaydip Sen
|
Jaydip Sen
|
An Efficient Algorithm for Detection of Selfish Packet Dropping Nodes in
Wireless Mesh Networks
|
This paper is withdrawn since the results presented in Figure 7 are
not found to be holding good under certain network conditions. We have made a
mathematical analysis of the false alarm rate and are trying to
cross-correlate the simulation results with the mathematical model
|
International Journal of Computer Information Systems and
Industrial Management Applications, Vol 3 (2011), pp. 363 - 370
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a wireless mesh network (WMN), high speed routers equipped with advanced
antennas, communicate with each other in a multi-hop fashion over wireless
channels and form a broadband backhaul. WMNs provide reliable connectivity and
fault-tolerance, as each node is connected to several other nodes. If a node
fails due to hardware problems, its neighbors can find another route. Extra
capacity can be achieved by introducing additional nodes in the network.
However, the throughput of a WMN may be severely degraded due to presence of
some selfish routers that avoid forwarding packets for other nodes even as they
send their own traffic through the network. This paper presents an algorithm
for detection of selfish nodes in a WMN that uses statistical theory of
inference for reliable clustering of the nodes. Simulation results show that
the algorithm has a high detection rate and a low rate of false positives.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2011 02:20:17 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Jun 2012 04:16:03 GMT"
}
] | 2012-09-09T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.982092 |
1209.1246
|
Luis Sanabria-Russo
|
Luis Sanabria-Russo, Jaume Barcelo, Albert Domingo, Boris Bellalta
|
Spectrum Sensing with USRP-E110
|
5th International Workshop on Multiple Access Communications,
11/2012, Dublin, Ireland, (2012)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing is one of the key topics towards the implementation of
future wireless services like SuperWiFi. This new wireless proposal aims at
using the freed spectrum resulting from the analog-to-digital transition of TV
channels for wireless data transmission (UHF TV White Spaces). The benefits
range from better building penetration to longer distances when compared to the
set of IEEE 802.11 standards. Nevertheless, the effective use of the available
spectrum is subject to strict regulation that prohibits unlicensed users to
interfere with incumbents (like wireless microphones). Cognitive Radios (CR)
and dynamic spectrum allocation are suggested to cope with this problem. These
techniques consist on frequency sweeps of the TV-UHF band to detect White
Spaces that could be used for SuperWiFi transmissions. In this paper we develop
and implement algorithms from GNURadio in the Ettus USRP-E110 to build a
standalone White Spaces detector that can be consulted from a centralized
location via IP networks.
|
[
{
"version": "v1",
"created": "Thu, 6 Sep 2012 10:03:59 GMT"
}
] | 2012-09-07T00:00:00 |
[
[
"Sanabria-Russo",
"Luis",
""
],
[
"Barcelo",
"Jaume",
""
],
[
"Domingo",
"Albert",
""
],
[
"Bellalta",
"Boris",
""
]
] |
new_dataset
| 0.999218 |
1209.1300
|
Nisheeth Joshi
|
Nisheeth Joshi, Iti Mathur
|
Input Scheme for Hindi Using Phonetic Mapping
|
Proceedings of National Conference on ICT: Theory, Practice and
Applications. SPSU Press. Organized by Sir Padampat Singhania University,
Udaipur. Sponsored by CSIR, New Delhi. March, 2010
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
Written Communication on Computers requires knowledge of writing text for the
desired language using Computer. Mostly people do not use any other language
besides English. This creates a barrier. To resolve this issue we have
developed a scheme to input text in Hindi using phonetic mapping scheme. Using
this scheme we generate intermediate code strings and match them with
pronunciations of input text. Our system show significant success over other
input systems available.
|
[
{
"version": "v1",
"created": "Sun, 19 Aug 2012 02:38:12 GMT"
}
] | 2012-09-07T00:00:00 |
[
[
"Joshi",
"Nisheeth",
""
],
[
"Mathur",
"Iti",
""
]
] |
new_dataset
| 0.992147 |
1209.1327
|
Philippe Kruchten
|
Philippe Kruchten
|
The frog and the octopus: a conceptual model of software development
| null | null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We propose a conceptual model of software development that encompasses all
approaches: traditional or agile, light and heavy, for large and small
development efforts. The model identifies both the common aspects in all
software development, i.e., elements found in some form or another in each and
every software development project (Intent, Product, People, Work, Time,
Quality, Risk, Cost, Value), as well as the variable part, i.e., the main
factors that cause the very wide variations we can find in the software
development world (Size, Age, Criticality, Architecture stability, Business
model, Governance, Rate of change, Geographic distribution). We show how the
model can be used as an explanatory theory of software development, as a tool
for analysis of practices, techniques, processes, as the basis for curriculum
design or for software process adoption and improvement, and to support
empirical research on software development methods. This model is also proposed
as a way to depolarize the debate on agile methods versus the
rest-of-the-world: a unified model.
|
[
{
"version": "v1",
"created": "Thu, 6 Sep 2012 16:08:34 GMT"
}
] | 2012-09-07T00:00:00 |
[
[
"Kruchten",
"Philippe",
""
]
] |
new_dataset
| 0.960779 |
1209.0967
|
Travis Suel
|
Travis Z. Suel
|
KeyAuth: Bringing Public-key Authentication to the Masses
|
6 pages, 1 figure, 1 table
| null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Passwords are a fragile, inadequate, and insecure tool for authenticating
users, and are especially fraught with problems when used to secure access to
network resources and services. In many cases, passwords provide a false sense
of security. Creating passwords which are both secure (i.e., hard for attackers
to guess) and easy for humans to remember is, at best, a paradoxical task
because these two criteria are diametrically opposed. Fortunately, a far more
secure and user-friendly alternative is available. Public-key cryptography
provides a means of both identifying and authenticating users without the need
for passwords. KeyAuth is a generic and universal implementation of public-key
authentication aimed at supplanting password-based authentication and
significantly improving the security of network accessible resources by
enhancing the usability of frequently used authentication mechanisms. KeyAuth
is an application-, language-, operating system-, and protocol-independent
public-key authentication service.
|
[
{
"version": "v1",
"created": "Wed, 5 Sep 2012 13:29:20 GMT"
}
] | 2012-09-06T00:00:00 |
[
[
"Suel",
"Travis Z.",
""
]
] |
new_dataset
| 0.999508 |
1209.1073
|
Aleksandar Radonjic
|
Aleksandar Radonjic and Vladimir Vujicic
|
Reply to 'Comments on Integer SEC-DED codes for low power
communications'
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is a reply to the comments on 'Integer SEC-DED codes for low power
communications'.
|
[
{
"version": "v1",
"created": "Wed, 5 Sep 2012 18:38:21 GMT"
}
] | 2012-09-06T00:00:00 |
[
[
"Radonjic",
"Aleksandar",
""
],
[
"Vujicic",
"Vladimir",
""
]
] |
new_dataset
| 0.99882 |
1209.1075
|
Maisam Mohammadian
|
Maisam Mohammadian
|
A New Mechanism For Mutual Authentication In SIP
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The greatest threat in the new generation network which is called ngn is
unsafe authentication. Communication between new servers in ngn world is done
based on Session Initiation Protocol. SIP is an application layer control
operating on top of a transport protocol which allows creating modifying and
terminating sessions among more agents. For authentication SIP relies on HTTP
Digest by default the client is authenticated to the SIP proxy server called
one way authentication because in this approach we can authenticate client to
server and the client cant do any authentication in server side. In this paper
we propose a mutual authentication mechanism that is not based on HTTP Digest
and then we implement our method in IMS and start to do authentication client
to server is done in first step and server to client next.
|
[
{
"version": "v1",
"created": "Wed, 5 Sep 2012 18:39:23 GMT"
}
] | 2012-09-06T00:00:00 |
[
[
"Mohammadian",
"Maisam",
""
]
] |
new_dataset
| 0.993378 |
1111.0434
|
Laurent Bulteau
|
Laurent Bulteau, Guillaume Fertin, Irena Rusu
|
Pancake Flipping is Hard
|
Corrected references
| null |
10.1007/978-3-642-32589-2_24
| null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pancake Flipping is the problem of sorting a stack of pancakes of different
sizes (that is, a permutation), when the only allowed operation is to insert a
spatula anywhere in the stack and to flip the pancakes above it (that is, to
perform a prefix reversal). In the burnt variant, one side of each pancake is
marked as burnt, and it is required to finish with all pancakes having the
burnt side down. Computing the optimal scenario for any stack of pancakes and
determining the worst-case stack for any stack size have been challenges over
more than three decades. Beyond being an intriguing combinatorial problem in
itself, it also yields applications, e.g. in parallel computing and
computational biology. In this paper, we show that the Pancake Flipping
problem, in its original (unburnt) variant, is NP-hard, thus answering the
long-standing question of its computational complexity.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 09:30:20 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2011 09:53:22 GMT"
}
] | 2012-09-05T00:00:00 |
[
[
"Bulteau",
"Laurent",
""
],
[
"Fertin",
"Guillaume",
""
],
[
"Rusu",
"Irena",
""
]
] |
new_dataset
| 0.998726 |
1209.0317
|
Guillaume Latu
|
Guillaume Latu (IRFM, INRIA Lorraine / IECN / LSIIT / IRMA), Virginie
Grandgirard (IRFM), J\'er\'emie Abiteboul (IRFM), Morgane Bergot (INRIA
Lorraine / IECN / LSIIT / IRMA), Nicolas Crouseilles (IRMAR), Xavier Garbet
(IRFM), Philippe Ghendrih (IRFM), Michel Mehrenberger (INRIA Lorraine / IECN
/ LSIIT / IRMA), Yanick Sarazin (IRFM), Hocine Sellama (INRIA Lorraine / IECN
/ LSIIT / IRMA), Eric Sonnendr\"ucker (INRIA Lorraine / IECN / LSIIT / IRMA,
IRMA), David Zarzoso (IRFM)
|
Accuracy of unperturbed motion of particles in a gyrokinetic
semi-Lagrangian code
|
No. RR-8054 (2012)
| null | null | null |
cs.NA math.AP math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inaccurate description of the equilibrium can yield to spurious effects in
gyrokinetic turbulence simulations. Also, the Vlasov solver and time
integration schemes impact the conservation of physical quantities, especially
in long-term simulations. Equilibrium and Vlasov solver have to be tuned in
order to preserve constant states (equilibrium) and to provide good
conservation property along time (mass to begin with). Several illustrative
simple test cases are given to show typical spurious effects that one can
observes for poor settings. We explain why Forward Semi-Lagrangian scheme bring
us some benefits. Some toroidal and cylindrical GYSELA runs are shown that use
FSL.
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2012 11:49:21 GMT"
}
] | 2012-09-05T00:00:00 |
[
[
"Latu",
"Guillaume",
"",
"IRFM, INRIA Lorraine / IECN / LSIIT / IRMA"
],
[
"Grandgirard",
"Virginie",
"",
"IRFM"
],
[
"Abiteboul",
"Jérémie",
"",
"IRFM"
],
[
"Bergot",
"Morgane",
"",
"INRIA\n Lorraine / IECN / LSIIT / IRMA"
],
[
"Crouseilles",
"Nicolas",
"",
"IRMAR"
],
[
"Garbet",
"Xavier",
"",
"IRFM"
],
[
"Ghendrih",
"Philippe",
"",
"IRFM"
],
[
"Mehrenberger",
"Michel",
"",
"INRIA Lorraine / IECN\n / LSIIT / IRMA"
],
[
"Sarazin",
"Yanick",
"",
"IRFM"
],
[
"Sellama",
"Hocine",
"",
"INRIA Lorraine / IECN\n / LSIIT / IRMA"
],
[
"Sonnendrücker",
"Eric",
"",
"INRIA Lorraine / IECN / LSIIT / IRMA,\n IRMA"
],
[
"Zarzoso",
"David",
"",
"IRFM"
]
] |
new_dataset
| 0.974734 |
1209.0578
|
Antonio Tapiador
|
Alicia D\'iez, Antonio Tapiador
|
Social Cheesecake: An UX-driven designed interface for managing contacts
|
Preprint of IADIS WWW/Internet 2012
| null | null | null |
cs.HC cs.SI
|
http://creativecommons.org/licenses/by/3.0/
|
Social network management interfaces should consider separation of contexts
and tie strength. This paper shows the design process upon building the Social
Cheesecake, an interface that addresses both issues. Paper and screen
prototyping were used in the design process. Paper prototype interactions
helped to explore the metaphors in the domain, while screen prototype
consolidated the model. The prototype was finally built using HTML5 and
Javascript.
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2012 09:44:07 GMT"
}
] | 2012-09-05T00:00:00 |
[
[
"Díez",
"Alicia",
""
],
[
"Tapiador",
"Antonio",
""
]
] |
new_dataset
| 0.977529 |
1209.0679
|
Lilach Chaitman-Yerushalmi
|
Paz Carmi and Lilach Chaitman-Yerushalmi
|
Minimum Weight Euclidean t-spanner is NP-Hard
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set P of points in the plane, an Euclidean t-spanner for P is a
geometric graph that preserves the Euclidean distances between every pair of
points in P up to a constant factor t. The weight of a geometric graph refers
to the total length of its edges. In this paper we show that the problem of
deciding whether there exists an Euclidean t-spanner, for a given set of points
in the plane, of weight at most w is NP-hard for every real constant t > 1,
both whether planarity of the t-spanner is required or not.
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2012 15:54:01 GMT"
}
] | 2012-09-05T00:00:00 |
[
[
"Carmi",
"Paz",
""
],
[
"Chaitman-Yerushalmi",
"Lilach",
""
]
] |
new_dataset
| 0.989147 |
1209.0715
|
Hongchao Zhou
|
Hongchao Zhou, Po-Ling Loh and Jehoshua Bruck
|
The Synthesis and Analysis of Stochastic Switching Circuits
|
2 columns, 15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic switching circuits are relay circuits that consist of stochastic
switches called pswitches. The study of stochastic switching circuits has
widespread applications in many fields of computer science, neuroscience, and
biochemistry. In this paper, we discuss several properties of stochastic
switching circuits, including robustness, expressibility, and probability
approximation.
First, we study the robustness, namely, the effect caused by introducing an
error of size \epsilon to each pswitch in a stochastic circuit. We analyze two
constructions and prove that simple series-parallel circuits are robust to
small error perturbations, while general series-parallel circuits are not.
Specifically, the total error introduced by perturbations of size less than
\epsilon is bounded by a constant multiple of \epsilon in a simple
series-parallel circuit, independent of the size of the circuit.
Next, we study the expressibility of stochastic switching circuits: Given an
integer q and a pswitch set S=\{\frac{1}{q},\frac{2}{q},...,\frac{q-1}{q}\},
can we synthesize any rational probability with denominator q^n (for arbitrary
n) with a simple series-parallel stochastic switching circuit? We generalize
previous results and prove that when q is a multiple of 2 or 3, the answer is
yes. We also show that when q is a prime number larger than 3, the answer is
no.
Probability approximation is studied for a general case of an arbitrary
pswitch set S=\{s_1,s_2,...,s_{|S|}\}. In this case, we propose an algorithm
based on local optimization to approximate any desired probability. The
analysis reveals that the approximation error of a switching circuit decreases
exponentially with an increasing circuit size.
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2012 17:50:00 GMT"
}
] | 2012-09-05T00:00:00 |
[
[
"Zhou",
"Hongchao",
""
],
[
"Loh",
"Po-Ling",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.992838 |
1112.2468
|
Tao Chen
|
Tao Chen and Min-Yen Kan
|
Creating a Live, Public Short Message Service Corpus: The NUS SMS Corpus
|
It contains 31 pages, 6 figures, and 10 tables. It has been submitted
to Language Resource and Evaluation Journal
|
Language Resources and Evaluation, Aug 2012
|
10.1007/s10579-012-9197-9
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Short Message Service (SMS) messages are largely sent directly from one
person to another from their mobile phones. They represent a means of personal
communication that is an important communicative artifact in our current
digital era. As most existing studies have used private access to SMS corpora,
comparative studies using the same raw SMS data has not been possible up to
now. We describe our efforts to collect a public SMS corpus to address this
problem. We use a battery of methodologies to collect the corpus, paying
particular attention to privacy issues to address contributors' concerns. Our
live project collects new SMS message submissions, checks their quality and
adds the valid messages, releasing the resultant corpus as XML and as SQL
dumps, along with corpus statistics, every month. We opportunistically collect
as much metadata about the messages and their sender as possible, so as to
enable different types of analyses. To date, we have collected about 60,000
messages, focusing on English and Mandarin Chinese.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2011 08:07:49 GMT"
}
] | 2012-09-04T00:00:00 |
[
[
"Chen",
"Tao",
""
],
[
"Kan",
"Min-Yen",
""
]
] |
new_dataset
| 0.999012 |
1208.0296
|
Simina Br\^anzei
|
Simina Br\^anzei, Clara Forero, Kate Larson, and Peter Bro Miltersen
|
Equilibria of Chinese Auctions
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chinese auctions are a combination between a raffle and an auction and are
held in practice at charity events or festivals. In a Chinese auction, multiple
players compete for several items by buying tickets, which can be used to win
the items. In front of each item there is a basket, and the players can bid by
placing tickets in the basket(s) corresponding to the item(s) they are trying
to win. After all the players have placed their tickets, a ticket is drawn at
random from each basket and the item is given to the owner of the winning
ticket. While a player is never guaranteed to win an item, they can improve
their chances of getting it by increasing the number of tickets for that item.
In this paper we investigate the existence of pure Nash equilibria in both
the continuous and discrete settings. When the players have continuous budgets,
we show that a pure Nash equilibrium may not exist for asymmetric games when
some valuations are zero. In that case we prove that the auctioneer can
stabilize the game by placing his own ticket in each basket. On the other hand,
when all the valuations are strictly positive, a pure Nash equilibrium is
guaranteed to exist, and the equilibrium strategies are symmetric when both
valuations and budgets are symmetric. We also study Chinese auctions with
discrete budgets, for which we give both existence results and counterexamples.
While the literature on rent-seeking contests traditionally focuses on
continuous costly tickets, the discrete variant is very natural and more
closely models the version of the auction held in practice.
|
[
{
"version": "v1",
"created": "Wed, 1 Aug 2012 17:40:07 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Sep 2012 16:48:50 GMT"
}
] | 2012-09-04T00:00:00 |
[
[
"Brânzei",
"Simina",
""
],
[
"Forero",
"Clara",
""
],
[
"Larson",
"Kate",
""
],
[
"Miltersen",
"Peter Bro",
""
]
] |
new_dataset
| 0.998625 |
1209.0249
|
Mohammed El-Dosuky
|
M. A. El-Dosuky, M. Z. Rashad, T. T. Hamza, A. H. EL-Bassiouny
|
Robopinion: Opinion Mining Framework Inspired by Autonomous Robot
Navigation
| null | null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data association methods are used by autonomous robots to find matches
between the current landmarks and the new set of observed features. We seek a
framework for opinion mining to benefit from advancements in autonomous robot
navigation in both research and development
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2012 06:00:04 GMT"
}
] | 2012-09-04T00:00:00 |
[
[
"El-Dosuky",
"M. A.",
""
],
[
"Rashad",
"M. Z.",
""
],
[
"Hamza",
"T. T.",
""
],
[
"EL-Bassiouny",
"A. H.",
""
]
] |
new_dataset
| 0.997813 |
1204.3057
|
Hugues Randriam
|
Hugues Randriambololona
|
Asymptotically good binary linear codes with asymptotically good
self-intersection spans
|
18 pages; v2->v3: expanded introduction and bibliography + various
minor changes
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If C is a binary linear code, let C^2 be the linear code spanned by
intersections of pairs of codewords of C. We construct an asymptotically good
family of binary linear codes such that, for C ranging in this family, the C^2
also form an asymptotically good family. For this we use algebraic-geometry
codes, concatenation, and a fair amount of bilinear algebra.
More precisely, the two main ingredients used in our construction are, first,
a description of the symmetric square of an odd degree extension field in terms
only of field operations of small degree, and second, a recent result of
Garcia-Stichtenoth-Bassa-Beelen on the number of points of curves on such an
odd degree extension field.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2012 17:24:00 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Apr 2012 16:25:34 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Aug 2012 17:44:59 GMT"
}
] | 2012-09-03T00:00:00 |
[
[
"Randriambololona",
"Hugues",
""
]
] |
new_dataset
| 0.99962 |
1208.6388
|
Jocelyne Troccaz
|
Jean-Alexandre Long (TIMC), Jacques Tostain, Cecilia Lanchon, Sandrine
Voros (TIMC), Maud Medici, Jean-Luc Descotes, Jocelyne Troccaz (TIMC),
Philippe Cinquin (TIMC), Jean-Jacques Rambeaud, Alexandre Moreau-Gaudry
(TIMC)
|
First Clinical Experience in Urologic Surgery with a Novel Robotic
Lightweight Laparoscope Holder
|
Journal of Endourology and Part B, Videourology (2012) epub ahead of
print
| null |
10.1089/end.2012.0357
| null |
cs.RO physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose: To report the feasibility and the safety of a surgeon-controlled
robotic endoscope holder in laparoscopic surgery. Materials and methods: From
March 2010 to September 2010, 20 patients were enrolled prospectively to
undergo a laparoscopic surgery using an innovative robotic endoscope holder.
Two surgeons performed 6 adrenalectomies, 4 sacrocolpopexies, 5 pyeloplasties,
4 radical prostatectomies and 1 radical nephrectomy. Demographic data, overall
set-up time, operative time, number of assistants needed were reviewed.
Surgeon's satisfaction regarding the ergonomics was assessed using a ten point
scale. Postoperative clinical outcomes were reviewed at day 1 and 1 month
postoperatively. Results: The per-protocol analysis was performed on 17
patients for whom the robot was effectively used for surgery. Median age was 63
years, 10 patients were female (59%). Median BMI was 26.8. Surgical procedures
were completed with the robot in 12 cases (71 %). Median number of surgical
assistant was 0. Overall set-up time with the robot was 19 min, operative time
was 130 min) during which the robot was used 71% of the time. Mean hospital
stay was 6.94 days $\pm$ 2.3. Median score regarding the easiness of use was 7.
Median pain level was 1.5/10 at day 1 and 0 at 1 month postoperatively. Open
conversion was needed in 1 case (6 %) and 4 minor complications occurred in 2
patients (12%). Conclusion: This use of this novel robotic laparoscope holder
is safe, feasible and it provides a good comfort to the surgeon.
|
[
{
"version": "v1",
"created": "Fri, 31 Aug 2012 06:30:43 GMT"
}
] | 2012-09-03T00:00:00 |
[
[
"Long",
"Jean-Alexandre",
"",
"TIMC"
],
[
"Tostain",
"Jacques",
"",
"TIMC"
],
[
"Lanchon",
"Cecilia",
"",
"TIMC"
],
[
"Voros",
"Sandrine",
"",
"TIMC"
],
[
"Medici",
"Maud",
"",
"TIMC"
],
[
"Descotes",
"Jean-Luc",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
],
[
"Cinquin",
"Philippe",
"",
"TIMC"
],
[
"Rambeaud",
"Jean-Jacques",
"",
"TIMC"
],
[
"Moreau-Gaudry",
"Alexandre",
"",
"TIMC"
]
] |
new_dataset
| 0.998883 |
1208.6057
|
An Do
|
Po T. Wang, Christine E. King, Luis A. Chui, An H. Do, Zoran Nenadic
|
Self-paced brain-computer interface control of ambulation in a virtual
reality environment
|
20 pages, 7 figures, link to video supplementary material
(http://youtu.be/GXmovT3BxEo)
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objective: Spinal cord injury (SCI) often leaves affected individuals unable
to ambulate. Electroencephalogramme (EEG) based brain-computer interface (BCI)
controlled lower extremity prostheses may restore intuitive and able-body-like
ambulation after SCI. To test its feasibility, the authors developed and tested
a novel EEG-based, data-driven BCI system for intuitive and self-paced control
of the ambulation of an avatar within a virtual reality environment (VRE).
Approach: Eight able-bodied subjects and one with SCI underwent the following
10-min training session: subjects alternated between idling and walking
kinaesthetic motor imageries (KMI) while their EEG were recorded and analysed
to generate subject-specific decoding models. Subjects then performed a
goal-oriented online task, repeated over 5 sessions, in which they utilised the
KMI to control the linear ambulation of an avatar and make 10 sequential stops
at designated points within the VRE.
Main results: The average offline training performance across subjects was
77.2 +/- 9.5%, ranging from 64.3% (p = 0.00176) to 94.5% (p = 6.26*10^-23),
with chance performance being 50%. The average online performance was 8.4 +/-
1.0 (out of 10) successful stops and 303 +/- 53 sec completion time (perfect =
211 sec). All subjects achieved performances significantly different than those
of random walk (p < 0.05) in 44 of the 45 online sessions.
Significance: By using a data-driven machine learning approach to decode
users' KMI, this BCIVRE system enabled intuitive and purposeful self-paced
control of ambulation after only a 10-minute training. The ability to achieve
such BCI control with minimal training indicates that the implementation of
future BCI-lower extremity prosthesis systems may be feasible.
|
[
{
"version": "v1",
"created": "Thu, 30 Aug 2012 00:58:22 GMT"
}
] | 2012-08-31T00:00:00 |
[
[
"Wang",
"Po T.",
""
],
[
"King",
"Christine E.",
""
],
[
"Chui",
"Luis A.",
""
],
[
"Do",
"An H.",
""
],
[
"Nenadic",
"Zoran",
""
]
] |
new_dataset
| 0.988268 |
1208.6096
|
Nadeem Javaid
|
Nadeem Javaid
|
M-ATTEMPT: A New Energy-Efficient Routing Protocol in Wireless Body Area
Sensor Networks
|
To be Submitted in a Journal
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an energy efficient routing algorithm for heterogeneous
Wireless Body Area Sensor Networks (WBASNs). A prototype is defined for
employing heterogeneous sensors on human body. Direct communication is used for
real-time traffic (critical data) and on-demand data while multi-hop
communication is used for normal data delivery in this proposed routing
algorithm. One of the prime challenges in WBASNs is sensing of heat generated
by implanted sensor nodes. The proposed routing algorithm is thermal-aware
which sense the link Hot-spot and routes the data away from these links.
Continuous mobility of human body causes disconnection between previous
established links. We introduce mobility support and energy-management to
overcome the problem of disconnection due to continuous mobility of human body.
MATLAB simulations of proposed routing algorithm are performed for lifetime and
reliability in comparison with multi-hop communication. The results show that
the proposed routing algorithm has less energy consumption and more reliable as
compared to multi-hop communication.
|
[
{
"version": "v1",
"created": "Thu, 30 Aug 2012 07:36:13 GMT"
}
] | 2012-08-31T00:00:00 |
[
[
"Javaid",
"Nadeem",
""
]
] |
new_dataset
| 0.971226 |
1208.6137
|
Deepak Kumar
|
Deepak Kumar, M N Anil Prasad and A G Ramakrishnan
|
Benchmarking recognition results on word image datasets
|
16 pages, 4 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have benchmarked the maximum obtainable recognition accuracy on various
word image datasets using manual segmentation and a currently available
commercial OCR. We have developed a Matlab program, with graphical user
interface, for semi-automated pixel level segmentation of word images. We
discuss the advantages of pixel level annotation. We have covered five
databases adding up to over 3600 word images. These word images have been
cropped from camera captured scene, born-digital and street view images. We
recognize the segmented word image using the trial version of Nuance Omnipage
OCR. We also discuss, how the degradations introduced during acquisition or
inaccuracies introduced during creation of word images affect the recognition
of the word present in the image. Word images for different kinds of
degradations and correction for slant and curvy nature of words are also
discussed. The word recognition rates obtained on ICDAR 2003, Sign evaluation,
Street view, Born-digital and ICDAR 2011 datasets are 83.9%, 89.3%, 79.6%,
88.5% and 86.7% respectively.
|
[
{
"version": "v1",
"created": "Thu, 30 Aug 2012 11:24:44 GMT"
}
] | 2012-08-31T00:00:00 |
[
[
"Kumar",
"Deepak",
""
],
[
"Prasad",
"M N Anil",
""
],
[
"Ramakrishnan",
"A G",
""
]
] |
new_dataset
| 0.999382 |
1208.6188
|
Dara Shayda
|
Dara O. Shayda
|
G2 Matrix Manifold: A Software Construct
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An ensemble of symbolic, numeric and graphic computations developed to
construct the Octonionic and compact G2 structures in Mathematica 8.0.
Cayley-Dickenson Construction symbolically applied from Reals to Octonions.
Baker- Campbell-Hausdorff formula (BCH) in bracket form verified for Octonions.
Algorithms for both exponentiation and logarithm of Octonions developed.
Exclusive validity of vector Product verified for 0, 1, 3 and 7 dimensions.
Symbolic exponential computations carried out for two distinct g2 basis(s) and
arbitrary precision BCH for G2 was coded. Example and counter-example Maximal
Torus for G2 was uncovered. Densely coiled shapes of actions of G2 rendered.
Kolmogorov Complexity for BCH investigated and upper bounds computed:
Complexity of non-commutative non- associative algebraic expression is at most
the Complexity of corresponding commutative associative algebra plus K(BCH).
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 21:00:07 GMT"
}
] | 2012-08-31T00:00:00 |
[
[
"Shayda",
"Dara O.",
""
]
] |
new_dataset
| 0.977691 |
1208.5915
|
EPTCS
|
G\'erard Boudol (INRIA Sophia Antipolis), Gustavo Petri (Purdue
University), Bernard Serpette (INRIA Sophia Antipolis)
|
Relaxed Operational Semantics of Concurrent Programming Languages
|
In Proceedings EXPRESS/SOS 2012, arXiv:1208.2440
|
EPTCS 89, 2012, pp. 19-33
|
10.4204/EPTCS.89.3
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel, operational framework to formally describe the semantics
of concurrent programs running within the context of a relaxed memory model.
Our framework features a "temporary store" where the memory operations issued
by the threads are recorded, in program order. A memory model then specifies
the conditions under which a pending operation from this sequence is allowed to
be globally performed, possibly out of order. The memory model also involves a
"write grain," accounting for architectures where a thread may read a write
that is not yet globally visible. Our formal model is supported by a software
simulator, allowing us to run litmus tests in our semantics.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 01:51:38 GMT"
}
] | 2012-08-30T00:00:00 |
[
[
"Boudol",
"Gérard",
"",
"INRIA Sophia Antipolis"
],
[
"Petri",
"Gustavo",
"",
"Purdue\n University"
],
[
"Serpette",
"Bernard",
"",
"INRIA Sophia Antipolis"
]
] |
new_dataset
| 0.996005 |
1208.5980
|
Loris D'Antoni
|
Loris D'Antoni
|
In the Maze of Data Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In data languages the positions of strings and trees carry a label from a
finite alphabet and a data value from an infinite alphabet. Extensions of
automata and logics over finite alphabets have been defined to recognize data
languages, both in the string and tree cases. In this paper we describe and
compare the complexity and expressiveness of such models to understand which
ones are better candidates as regular models.
|
[
{
"version": "v1",
"created": "Wed, 29 Aug 2012 18:25:03 GMT"
}
] | 2012-08-30T00:00:00 |
[
[
"D'Antoni",
"Loris",
""
]
] |
new_dataset
| 0.96845 |
1008.4747
|
David Clark
|
Yuichiro Fujiwara, David Clark, Peter Vandendriessche, Maarten De
Boeck, and Vladimir D. Tonchev
|
Entanglement-assisted quantum low-density parity-check codes
|
20 pages, 5 figures. Final version appearing in Physical Review A
|
Phys. Rev. A 82, 042338 (2010)
|
10.1103/PhysRevA.82.042338
| null |
cs.IT math.CO math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper develops a general method for constructing entanglement-assisted
quantum low-density parity-check (LDPC) codes, which is based on combinatorial
design theory. Explicit constructions are given for entanglement-assisted
quantum error-correcting codes (EAQECCs) with many desirable properties. These
properties include the requirement of only one initial entanglement bit, high
error correction performance, high rates, and low decoding complexity. The
proposed method produces infinitely many new codes with a wide variety of
parameters and entanglement requirements. Our framework encompasses various
codes including the previously known entanglement-assisted quantum LDPC codes
having the best error correction performance and many new codes with better
block error rates in simulations over the depolarizing channel. We also
determine important parameters of several well-known classes of quantum and
classical LDPC codes for previously unsettled cases.
|
[
{
"version": "v1",
"created": "Fri, 27 Aug 2010 16:10:08 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Sep 2010 19:19:13 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Sep 2010 22:42:09 GMT"
},
{
"version": "v4",
"created": "Mon, 1 Nov 2010 17:58:58 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"Fujiwara",
"Yuichiro",
""
],
[
"Clark",
"David",
""
],
[
"Vandendriessche",
"Peter",
""
],
[
"De Boeck",
"Maarten",
""
],
[
"Tonchev",
"Vladimir D.",
""
]
] |
new_dataset
| 0.995656 |
1111.3124
|
Akira SaiToh
|
Akira SaiToh
|
A multiprecision matrix calculation library and its extension library
for a matrix-product-state simulation of quantum computing
|
5 pages, 1 figure, technical report (a software overview)
| null | null |
QIT2011-80
|
cs.MS quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A C++ library, named ZKCM, has been developed for the purpose of
multiprecision matrix calculations, which is based on the GNU MP and MPFR
libraries. It is especially convenient for writing programs involving
tensor-product operations, tracing-out operations, and singular-value
decompositions. Its extension library, ZKCM_QC, for simulating quantum
computing has been developed using the time-dependent matrix-product-state
simulation method. This report gives a brief introduction to the libraries with
sample programs.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 07:50:31 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"SaiToh",
"Akira",
""
]
] |
new_dataset
| 0.997013 |
1111.4300
|
Pascal Weil
|
Volker Diekert, Manfred Kufleitner, Pascal Weil (LaBRI)
|
Star-Free Languages are Church-Rosser Congruential
| null |
Theoretical Computer Science 454 (2012) 129-135
|
10.1016/j.tcs.2012.01.028
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The class of Church-Rosser congruential languages has been introduced by
McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser
congruential (belongs to CRCL), if there is a finite, confluent, and
length-reducing semi-Thue system S such that L is a finite union of congruence
classes modulo S. To date, it is still open whether every regular language is
in CRCL. In this paper, we show that every star-free language is in CRCL. In
fact, we prove a stronger statement: For every star-free language L there
exists a finite, confluent, and subword-reducing semi-Thue system S such that
the total number of congruence classes modulo S is finite and such that L is a
union of congruence classes modulo S. The construction turns out to be
effective.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2011 08:37:57 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"Diekert",
"Volker",
"",
"LaBRI"
],
[
"Kufleitner",
"Manfred",
"",
"LaBRI"
],
[
"Weil",
"Pascal",
"",
"LaBRI"
]
] |
new_dataset
| 0.980329 |
1208.5124
|
Do Tuan Van
|
Do Van Tuan, Tran Dang Hien, Pham Van At
|
A Novel Data Hiding Scheme for Binary Images
| null | null | null | null |
cs.CR cs.GR
|
http://creativecommons.org/licenses/publicdomain/
|
This paper presents a new scheme for hiding a secret message in binary
images. Given m*n cover image block, the new scheme can conceal as many as
log(m*n +1) bits of data in block, by changing at most one bit in the block.
The hiding ability of the new scheme is the same as Chang et al.'s scheme and
higher than Tseng et al.'s scheme. Additionally, the security of the new scheme
is higher than the two above schemes.
|
[
{
"version": "v1",
"created": "Sat, 25 Aug 2012 10:45:55 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"Van Tuan",
"Do",
""
],
[
"Hien",
"Tran Dang",
""
],
[
"Van At",
"Pham",
""
]
] |
new_dataset
| 0.975782 |
1208.5268
|
Jouko Vaananen
|
Erich Gr\"adel, Jouko V\"a\"an\"anen
|
Dependence and Independence
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an atomic formula intuitively saying that given variables are
independent from given other variables if a third set of variables is kept
constant. We contrast this with dependence logic. We show that our independence
atom gives rise to a natural logic capable of formalizing basic intuitions
about independence and dependence.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2012 00:12:13 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"Grädel",
"Erich",
""
],
[
"Väänänen",
"Jouko",
""
]
] |
new_dataset
| 0.998745 |
1208.5373
|
Cm Pintea
|
Camelia-M. Pintea, D. Dumitrescu
|
Distributed Pharaoh System for Network Routing
|
4 pages, 4 figures
|
Automat. Comput. Appl. Math. 16(1-2) (2007) 27-34
| null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper it is introduced a biobjective ant algorithm for constructing
low cost routing networks. The new algorithm is called the Distributed Pharaoh
System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh
Ant System (PAS) with an extra-exploration phase and a 'no-entry' condition in
order to improve the solutions for the Low Cost Network Routing problem.
Additionally it is used a cost model for overlay network construction that
includes network traffic demands. The Pharaoh ants (Monomorium pharaonis)
includes negative pheromones with signals concentrated at decision points where
trails fork. The negative pheromones may complement positive pheromone or could
help ants to escape from an unnecessarily long route to food that is being
reinforced by attractive signals. Numerical experiments were made for a random
10-node network. The average node degree of the network tested was 4.0. The
results are encouraging. The algorithm converges to the shortest path while
converging on a low cost overlay routing network topology.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2012 12:35:29 GMT"
}
] | 2012-08-28T00:00:00 |
[
[
"Pintea",
"Camelia-M.",
""
],
[
"Dumitrescu",
"D.",
""
]
] |
new_dataset
| 0.996616 |
0909.2368
|
Nevin Vunka Jungum
|
Kelly D. Lewis andjames E. Lewis
|
Web Single Sign-On Authentication using SAML
|
International Journal of Computer Science Issues (IJCSI), Volume 1,
pp41-48, August 2009
|
K. D. LEWIS andJ. E. LEWIS, " Web Single Sign-On Authentication
using SAML", International Journal of Computer Science Issues (IJCSI), Volume
1, pp41-48, August 2009
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Companies have increasingly turned to application service providers (ASPs) or
Software as a Service (SaaS) vendors to offer specialized web-based services
that will cut costs and provide specific and focused applications to users. The
complexity of designing, installing, configuring, deploying, and supporting the
system with internal resources can be eliminated with this type of methodology,
providing great benefit to organizations. However, these models can present an
authentication problem for corporations with a large number of external service
providers. This paper describes the implementation of Security Assertion Markup
Language (SAML) and its capabilities to provide secure single sign-on (SSO)
solutions for externally hosted applications.
|
[
{
"version": "v1",
"created": "Sat, 12 Sep 2009 21:01:57 GMT"
}
] | 2012-08-27T00:00:00 |
[
[
"Lewis",
"Kelly D. Lewis andjames E.",
""
]
] |
new_dataset
| 0.998833 |
1102.0316
|
G David Forney Jr.
|
G. David Forney, Jr. and Pascal O. Vontobel
|
Partition Functions of Normal Factor Graphs
|
8 pages, 17 figures. To be presented at 2011 Information Theory and
Applications Workshop, La Jolla, CA, February 7, 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most common types of functions in mathematics, physics, and
engineering is a sum of products, sometimes called a partition function. After
"normalization," a sum of products has a natural graphical representation,
called a normal factor graph (NFG), in which vertices represent factors, edges
represent internal variables, and half-edges represent the external variables
of the partition function. In physics, so-called trace diagrams share similar
features. We believe that the conceptual framework of representing sums of
products as partition functions of NFGs is an important and intuitive paradigm
that, surprisingly, does not seem to have been introduced explicitly in the
previous factor graph literature. Of particular interest are NFG modifications
that leave the partition function invariant. A simple subclass of such NFG
modifications offers a unifying view of the Fourier transform, tree-based
reparameterization, loop calculus, and the Legendre transform.
|
[
{
"version": "v1",
"created": "Tue, 1 Feb 2011 22:47:32 GMT"
}
] | 2012-08-27T00:00:00 |
[
[
"Forney,",
"G. David",
"Jr."
],
[
"Vontobel",
"Pascal O.",
""
]
] |
new_dataset
| 0.990021 |
1203.2434
|
Tetiana Yaroshenko
|
Tetiana Yaroshenko
|
Institutional repository `eKMAIR': establishing and populating a
research repository for the National University "Kyiv Mohyla Academy"
|
This paper has been administratively withdrawn because it was
submitted under false pretenses by someone other than Tetiana Yaroshenko and
she did not write any of the text
|
Naukovi zapiski UKMA, vol.12 N.3 p.13-21
| null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
University libraries have an increasingly important role to play in
supporting open access publishing and dissemination of research outputs.1 In
particular, many libraries are playing a leading role in establishing and
managing institutional repositories. Institutional repositories are, most
often, Open Access Initiative (OAI)-compliant databases of a university or
other research institution's intellectual output, most typically research
papers, although many other forms of digital media can also be stored and
disseminated. Their main function is to provide improved access to the full
text of research articles and improve retrieval of relevant research.
The National University "Kyiv Mohyla Academy" is a small-sized institution
with approximately 3,000 students and 500 academic staff. Although it is a
teaching-intensive university, developing research and knowledge-transfer
capacity is a strategic priority and four research institutes have been
established, with further research activity going on in the academic schools
and research centres.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2012 09:29:07 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Aug 2012 15:38:16 GMT"
}
] | 2012-08-27T00:00:00 |
[
[
"Yaroshenko",
"Tetiana",
""
]
] |
new_dataset
| 0.979066 |
1208.4392
|
Hamed Saghaei Mr.
|
Hamed Saghaei
|
A Novel Architecture for Antenna Arrangement in Wireless Cellular CDMA
Systems
|
4 Pages, 4 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wise arrangement of antennas is critical in wireless cellular systems for
both reduction of co-channel interference (CCI) and increase the quality of
service (QoS). In this paper, a novel architecture for antenna arrangement in
CDMA wireless cellular systems is presented. In this architecture that we
called microzone, every cell is divided into three (or more) zones and
information transmission in downlink channel is done by an antenna which is
placed at the outer region of the related zone. Also, the transmitting signal
by the mobile station (MS) in uplink channel is received by all antennas of the
related cell. Analytical calculations of the received signal to noise ratio
(SIR) and outage probability for both microzone and used architectures show
that proposed architecture has better performance in compared with the used
architecture. Also, simulation results confirm lower outage probability in
uplink channel for microzone architecture.
|
[
{
"version": "v1",
"created": "Tue, 21 Aug 2012 21:46:57 GMT"
}
] | 2012-08-23T00:00:00 |
[
[
"Saghaei",
"Hamed",
""
]
] |
new_dataset
| 0.999006 |
1208.4528
|
Mohamed I Shehata
|
E. Ahmed, M. I. Shehata and H. A. A. El-Saka
|
On Dynamical Cournot Game on a Graph
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cournot dynamical game is studied on a graph. The stability of the system is
studied. Prisoner's dilemma game is used to model natural gas transmission.
|
[
{
"version": "v1",
"created": "Fri, 13 Jul 2012 05:40:46 GMT"
}
] | 2012-08-23T00:00:00 |
[
[
"Ahmed",
"E.",
""
],
[
"Shehata",
"M. I.",
""
],
[
"El-Saka",
"H. A. A.",
""
]
] |
new_dataset
| 0.983269 |
1208.4568
|
Stas Verberkt
|
J. Slobbe and S.L.C. Verberkt
|
Hacktivists: Cyberterrorists or Online Activists?
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The last decade, online activism has vastly grown. In the current digital
society, from time to time citizens decide to express their opinion by
attacking large corporations digitally in some way. Where the activists claim
this to be a digital assembly, others see it as criminal offences.
In this paper, we will explore the legal and technical borders of the digital
right to assembly. By doing so, we can gain insight into digital manifestations
and make up the balance on the digital right to assembly. As an additional
contribution, we will discuss how the digital right to assembly could be
granted and which legal and technical requirements should be set for a digital
assembly.
|
[
{
"version": "v1",
"created": "Sun, 22 Jul 2012 11:25:26 GMT"
}
] | 2012-08-23T00:00:00 |
[
[
"Slobbe",
"J.",
""
],
[
"Verberkt",
"S. L. C.",
""
]
] |
new_dataset
| 0.998862 |
1208.4168
|
Avraham Shinnar
|
Avraham Shinnar, David Cunningham, Benjamin Herta, Vijay Saraswat
|
M3R: Increased performance for in-memory Hadoop jobs
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 12, pp.
1736-1747 (2012)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Main Memory Map Reduce (M3R) is a new implementation of the Hadoop Map Reduce
(HMR) API targeted at online analytics on high mean-time-to-failure clusters.
It does not support resilience, and supports only those workloads which can fit
into cluster memory. In return, it can run HMR jobs unchanged -- including jobs
produced by compilers for higher-level languages such as Pig, Jaql, and
SystemML and interactive front-ends like IBM BigSheets -- while providing
significantly better performance than the Hadoop engine on several workloads
(e.g. 45x on some input sizes for sparse matrix vector multiply). M3R also
supports extensions to the HMR API which can enable Map Reduce jobs to run
faster on the M3R engine, while not affecting their performance under the
Hadoop engine.
|
[
{
"version": "v1",
"created": "Tue, 21 Aug 2012 02:53:00 GMT"
}
] | 2012-08-22T00:00:00 |
[
[
"Shinnar",
"Avraham",
""
],
[
"Cunningham",
"David",
""
],
[
"Herta",
"Benjamin",
""
],
[
"Saraswat",
"Vijay",
""
]
] |
new_dataset
| 0.99352 |
1208.4316
|
Sreeraj M
|
Sreeraj.M and Sumam Mary Idicula
|
An Online Character Recognition System to Convert Grantha Script to
Malayalam
|
6 pages, 6 figures
|
International Journal of Advanced Computer Science and
Applications(IJACSA, Volume 3 Issue 7, 2012
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel approach to recognize Grantha, an ancient script
in South India and converting it to Malayalam, a prevalent language in South
India using online character recognition mechanism. The motivation behind this
work owes its credit to (i) developing a mechanism to recognize Grantha script
in this modern world and (ii) affirming the strong connection among Grantha and
Malayalam. A framework for the recognition of Grantha script using online
character recognition is designed and implemented. The features extracted from
the Grantha script comprises mainly of time-domain features based on writing
direction and curvature. The recognized characters are mapped to corresponding
Malayalam characters. The framework was tested on a bed of medium length
manuscripts containing 9-12 sample lines and printed pages of a book titled
Soundarya Lahari writtenin Grantha by Sri Adi Shankara to recognize the words
and sentences. The manuscript recognition rates with the system are for Grantha
as 92.11%, Old Malayalam 90.82% and for new Malayalam script 89.56%. The
recognition rates of pages of the printed book are for Grantha as 96.16%, Old
Malayalam script 95.22% and new Malayalam script as 92.32% respectively. These
results show the efficiency of the developed system.
|
[
{
"version": "v1",
"created": "Tue, 21 Aug 2012 17:40:15 GMT"
}
] | 2012-08-22T00:00:00 |
[
[
"M",
"Sreeraj.",
""
],
[
"Idicula",
"Sumam Mary",
""
]
] |
new_dataset
| 0.998751 |
1206.6281
|
Pallavali Radha Krishna Reddy
|
P. Radha Krishna Reddy, P. Joshna, G. Sireesha, A. Thirupathaiah
|
Data Collection through Vehicular Sensor Networks by using TCDGP
|
Published
|
CSCV01I1001, August 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Now a days Many car manufacturers are planning to install wireless
connectivity equipment in their vehicles to enable communications with
"roadside base station" and also between vehicles, for the purposes of safety,
driving assistance, and entertainment. One distinct feature is that vehicles
are highly mobile, with speed up to 30 m/s, though their mobility patterns are
more predictable than those of nodes in Mobile Ad-hoc Networks (MANET) due to
the constraints imposed by road, speed limits, and commuting habits. Therefore,
these networks require specific solutions and identify a novel research area,
i.e., Vehicular Ad-hoc Networks (VANET). In this paper, we focus on a
particular VSN architecture, where the ad hoc network is operated by a
telecommunication/service provider to combine non-valuable individual sensed
data and extract from them effective feedbacks about the situation of the road
in a geographical area. In operated VSNs, providers tend to reduce the traffic
load on their network, using the free-frequency communication medium (IEEE
802.11p, for example). To do so, we propose TCDGP (Tree Clustered Data
Gathering Protocol), a cross layer protocol based on hierarchical and
geographical data collection, aggregation and dissemination mechanisms. We
analyze the performances of our solution using a simulation environment and
realistic mobility models. We demonstrate the feasibility of such solution and
show that TCDGP offers the operator precious information without overloading
his network.
|
[
{
"version": "v1",
"created": "Wed, 27 Jun 2012 14:43:32 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jun 2012 06:45:32 GMT"
},
{
"version": "v3",
"created": "Fri, 13 Jul 2012 10:50:28 GMT"
},
{
"version": "v4",
"created": "Sun, 19 Aug 2012 14:42:51 GMT"
}
] | 2012-08-21T00:00:00 |
[
[
"Reddy",
"P. Radha Krishna",
""
],
[
"Joshna",
"P.",
""
],
[
"Sireesha",
"G.",
""
],
[
"Thirupathaiah",
"A.",
""
]
] |
new_dataset
| 0.999047 |
1208.3769
|
Mohammad Mamun
|
A.F.M Sultanul Kabir, Md.Razib Hayat Khan, Abul Ahsan Md.Mahmudul
Haque and Mohammad Saiful Islam Mamun
|
WiMAX or Wi-Fi: The Best Suited Candidate Technology for Building
Wireless Access Infrastructure
|
6 pages,2 figures, Conference: ICLAN'2007, IEEE France
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a description of the existing wireless technology Wi-Fi
and WiMAX, and try to compare Wi-Fi (IEEE 802.11) and WiMAX (IEEE 802.16), with
respect to which technology provides a better solution to build a wireless
access infrastructure. Each technology is evaluated based on some key
characteristics. This paper concludes with a statement of, which technology
will be the best and most cost effective solution to end user.
|
[
{
"version": "v1",
"created": "Sat, 18 Aug 2012 17:57:20 GMT"
}
] | 2012-08-21T00:00:00 |
[
[
"Kabir",
"A. F. M Sultanul",
""
],
[
"Khan",
"Md. Razib Hayat",
""
],
[
"Haque",
"Abul Ahsan Md. Mahmudul",
""
],
[
"Mamun",
"Mohammad Saiful Islam",
""
]
] |
new_dataset
| 0.997182 |
1208.3802
|
Nisheeth Joshi
|
Archana Vashisth, Iti Mathur, Nisheeth Joshi
|
OntoAna: Domain Ontology for Human Anatomy
|
Proceedings of 5th CSI National Conference on Education and Research.
Organized by Lingayay University, Faridabad. Sponsored by Computer Society of
India and IEEE Delhi Chapter. Proceedings published by Lingayay University
Press
| null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by/3.0/
|
Today, we can find many search engines which provide us with information
which is more operational in nature. None of the search engines provide domain
specific information. This becomes very troublesome to a novice user who wishes
to have information in a particular domain. In this paper, we have developed an
ontology which can be used by a domain specific search engine. We have
developed an ontology on human anatomy, which captures information regarding
cardiovascular system, digestive system, skeleton and nervous system. This
information can be used by people working in medical and health care domain.
|
[
{
"version": "v1",
"created": "Sun, 19 Aug 2012 02:44:42 GMT"
}
] | 2012-08-21T00:00:00 |
[
[
"Vashisth",
"Archana",
""
],
[
"Mathur",
"Iti",
""
],
[
"Joshi",
"Nisheeth",
""
]
] |
new_dataset
| 0.99937 |
1208.4035
|
Denis Barthou
|
Denis Barthou (LaBRI, INRIA Bordeaux - Sud-Ouest), Gilbert Grosdidier
(LAL), Michael Kruse (LRI), Olivier P\`ene (LPT), Claude Tadonki
|
QIRAL: A High Level Language for Lattice QCD Code Generation
|
ETAPS 2012, Tallin : Estonia (2012)
| null |
10.4204/EPTCS
|
LPT-ORSAY 12-08
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum chromodynamics (QCD) is the theory of subnuclear physics, aiming at
mod- eling the strong nuclear force, which is responsible for the interactions
of nuclear particles. Lattice QCD (LQCD) is the corresponding discrete
formulation, widely used for simula- tions. The computational demand for the
LQCD is tremendous. It has played a role in the history of supercomputers, and
has also helped defining their future. Designing efficient LQCD codes that
scale well on large (probably hybrid) supercomputers requires to express many
levels of parallelism, and then to explore different algorithmic solutions.
While al- gorithmic exploration is the key for efficient parallel codes, the
process is hampered by the necessary coding effort. We present in this paper a
domain-specific language, QIRAL, for a high level expression of parallel
algorithms in LQCD. Parallelism is expressed through the mathematical struc-
ture of the sparse matrices defining the problem. We show that from these
expressions and from algorithmic and preconditioning formulations, a parallel
code can be automatically generated. This separates algorithms and mathematical
formulations for LQCD (that be- long to the field of physics) from the
effective orchestration of parallelism, mainly related to compilation and
optimization for parallel architectures.
|
[
{
"version": "v1",
"created": "Thu, 16 Aug 2012 12:14:39 GMT"
}
] | 2012-08-21T00:00:00 |
[
[
"Barthou",
"Denis",
"",
"LaBRI, INRIA Bordeaux - Sud-Ouest"
],
[
"Grosdidier",
"Gilbert",
"",
"LAL"
],
[
"Kruse",
"Michael",
"",
"LRI"
],
[
"Pène",
"Olivier",
"",
"LPT"
],
[
"Tadonki",
"Claude",
""
]
] |
new_dataset
| 0.999189 |
1208.3295
|
Preetha Theresa Joy
|
Preetha Theresa Joy and K. Poulose Jacob
|
Cache Replacement Policies for Cooperative Caching in Mobile Ad hoc
Networks
|
6 pages, 1 Table; IJCSI International Journal of Computer Science
Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Online): 1694-0814
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperative caching is a technique used in mobile ad hoc networks to improve
the efficiency of information access by reducing the access latency and
bandwidth usage. Cache replacement policy plays a significant role in response
time reduction by selecting suitable subset of items for eviction from the
cache. In this paper we have made a review of the existing cache replacement
algorithms proposed for cooperative caching in ad hoc networks. We made an
attempt to classify existing replacement policies for ad hoc networks based on
the replacement decision taken. In addition, this paper suggests some
alternative techniques for cache replacement. Finally, the paper concludes with
a discussion on future research directions.
|
[
{
"version": "v1",
"created": "Thu, 16 Aug 2012 06:02:06 GMT"
}
] | 2012-08-17T00:00:00 |
[
[
"Joy",
"Preetha Theresa",
""
],
[
"Jacob",
"K. Poulose",
""
]
] |
new_dataset
| 0.986319 |
1208.3056
|
Saygun Onay
|
Saygun Onay
|
Polar Codes for Nonasymmetric Slepian-Wolf Coding
|
4 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A method to construct nonasymmetric distributed source coding (DSC) scheme
using polar codes which can achieve any point on the dominant face of the
Slepian-Wolf (SW) rate region for sources with uniform marginals is considered.
In addition to nonasymmetric case, we also discuss and show explicitly how
asymmetric and single source compression is done using successive cancellation
(SC) polar decoder. We then present simulation results that exhibit the
performance of the considered methods.
|
[
{
"version": "v1",
"created": "Wed, 15 Aug 2012 08:29:29 GMT"
}
] | 2012-08-16T00:00:00 |
[
[
"Onay",
"Saygun",
""
]
] |
new_dataset
| 0.957937 |
1208.3091
|
Bin Li
|
Bin Li, Hui Shen, and David Tse
|
An Adaptive Successive Cancellation List Decoder for Polar Codes with
Cyclic Redundancy Check
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this letter, we propose an adaptive SC (Successive Cancellation)-List
decoder for polar codes with CRC. This adaptive SC-List decoder iteratively
increases the list size until the decoder outputs contain at least one survival
path which can pass CRC. Simulation shows that the adaptive SC-List decoder
provides significant complexity reduction. We also demonstrate that polar code
(2048, 1024) with 24-bit CRC decoded by our proposed adaptive SC-List decoder
with very large list size can achieve a frame error rate FER=0.001 at
Eb/No=1.1dB, which is about 0.2dB from the information theoretic limit at this
block length.
|
[
{
"version": "v1",
"created": "Wed, 15 Aug 2012 11:05:53 GMT"
}
] | 2012-08-16T00:00:00 |
[
[
"Li",
"Bin",
""
],
[
"Shen",
"Hui",
""
],
[
"Tse",
"David",
""
]
] |
new_dataset
| 0.992652 |
1208.3138
|
Saranya Ramamoorthy
|
Ashokkumar Ramalingam, Prabhu Dorairaj and Saranya Ramamoorthy
|
Personal Safety Triggering System on Android Mobile Platform
|
19 pages, International Journal of Network Security & Its
Applications (IJNSA), July 2012
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Introduction of Smart phones redefined the usage of mobile phones in the
communication world. Smart phones are equipped with various sophisticated
features such as Wi-Fi, GPS navigation, high resolution camera, touch screen
with broadband access which helps the mobile phone users to keep in touch with
the modern world. Many of these features are primarily integrated with the
mobile operating system which is out of reach to public, by which the users
can't manipulate those features. Google came up with an innovative operation
system termed as ANDROID, which is open system architecture with customizable
third party development and debugging environment which helps the user's to
manipulate the features and to create their own customizable applications. In
this paper, 'Emergency Based Remote Collateral Tracking System' application
using Google's Android Mobile Platform is addressed. Emergency is divided into
three categories: heart beat based emergency, security threats like personal
safety and road accidents. This application is targeted to a person who is
driving a vehicle. Heart rate monitoring device is integrated with our
application to sense the heart beat of a person driving the vehicle and if
there is any abnormalities in the heart beat, then our application performs a
dual role. One in which, application uses a GPS to track the location
information of the user and send those location information as a message via
SMS, email and post it on Facebook wall Simultaneously, an emergency signal is
sent to Arduino Microcontroller.This application is written in JAVA programming
language which runs on Eclipse Integrated Development Kit.
|
[
{
"version": "v1",
"created": "Fri, 10 Aug 2012 12:33:07 GMT"
}
] | 2012-08-16T00:00:00 |
[
[
"Ramalingam",
"Ashokkumar",
""
],
[
"Dorairaj",
"Prabhu",
""
],
[
"Ramamoorthy",
"Saranya",
""
]
] |
new_dataset
| 0.999126 |
1205.6862
|
Ryan Rogalin
|
Horia Vlad Balan, Ryan Rogalin, Antonios Michaloliakos, Konstantinos
Psounis and Giuseppe Caire
|
AirSync: Enabling Distributed Multiuser MIMO with Full Spatial
Multiplexing
|
Submitted to Transactions on Networking
| null | null |
CENG-TR-2012-1
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The enormous success of advanced wireless devices is pushing the demand for
higher wireless data rates. Denser spectrum reuse through the deployment of
more access points per square mile has the potential to successfully meet the
increasing demand for more bandwidth. In theory, the best approach to density
increase is via distributed multiuser MIMO, where several access points are
connected to a central server and operate as a large distributed multi-antenna
access point, ensuring that all transmitted signal power serves the purpose of
data transmission, rather than creating "interference." In practice, while
enterprise networks offer a natural setup in which distributed MIMO might be
possible, there are serious implementation difficulties, the primary one being
the need to eliminate phase and timing offsets between the jointly coordinated
access points.
In this paper we propose AirSync, a novel scheme which provides not only time
but also phase synchronization, thus enabling distributed MIMO with full
spatial multiplexing gains. AirSync locks the phase of all access points using
a common reference broadcasted over the air in conjunction with a Kalman filter
which closely tracks the phase drift. We have implemented AirSync as a digital
circuit in the FPGA of the WARP radio platform. Our experimental testbed,
comprised of two access points and two clients, shows that AirSync is able to
achieve phase synchronization within a few degrees, and allows the system to
nearly achieve the theoretical optimal multiplexing gain. We also discuss MAC
and higher layer aspects of a practical deployment. To the best of our
knowledge, AirSync offers the first ever realization of the full multiuser MIMO
gain, namely the ability to increase the number of wireless clients linearly
with the number of jointly coordinated access points, without reducing the per
client rate.
|
[
{
"version": "v1",
"created": "Thu, 31 May 2012 00:47:51 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Aug 2012 15:40:53 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Balan",
"Horia Vlad",
""
],
[
"Rogalin",
"Ryan",
""
],
[
"Michaloliakos",
"Antonios",
""
],
[
"Psounis",
"Konstantinos",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.996049 |
1208.2753
|
EPTCS
|
Stephan Mennicke (TU Braunschweig)
|
An Operational Petri Net Semantics for the Join-Calculus
|
In Proceedings EXPRESS/SOS 2012, arXiv:1208.2440
|
EPTCS 89, 2012, pp. 131-147
|
10.4204/EPTCS.89.10
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a concurrent operational Petri net semantics for the
join-calculus, a process calculus for specifying concurrent and distributed
systems. There often is a gap between system specifications and the actual
implementations caused by synchrony assumptions on the specification side and
asynchronously interacting components in implementations. The join-calculus is
promising to reduce this gap by providing an abstract specification language
which is asynchronously distributable. Classical process semantics establish an
implicit order of actually independent actions, by means of an interleaving. So
does the semantics of the join-calculus. To capture such independent actions,
step-based semantics, e.g., as defined on Petri nets, are employed. Our Petri
net semantics for the join-calculus induces step-behavior in a natural way. We
prove our semantics behaviorally equivalent to the original join-calculus
semantics by means of a bisimulation. We discuss how join specific assumptions
influence an existing notion of distributability based on Petri nets.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 01:52:31 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Mennicke",
"Stephan",
"",
"TU Braunschweig"
]
] |
new_dataset
| 0.959606 |
1208.2762
|
EPTCS
|
Michael Vielhaber (Hochschule Bremerhaven, Germany)
|
Computing by Temporal Order: Asynchronous Cellular Automata
|
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498
|
EPTCS 90, 2012, pp. 166-176
|
10.4204/EPTCS.90.14
| null |
cs.FL cs.CC cs.DM nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our concern is the behaviour of the elementary cellular automata with state
set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under
all possible update rules (asynchronicity).
Over the torus Z/nZ (n<= 11),we will see that the ECA with Wolfram rule 57
maps any v in F_2^n to any w in F_2^n, varying the update rule.
We furthermore show that all even (element of the alternating group)
bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57,
by iterating it a sufficient number of times with varying update rules, at
least for n <= 10. We characterize the non-bijective functions computable by
asynchronous rules.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 01:55:32 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Vielhaber",
"Michael",
"",
"Hochschule Bremerhaven, Germany"
]
] |
new_dataset
| 0.969316 |
1208.2765
|
EPTCS
|
Simon Wacker (Karlsruhe Institute of Technology, Germany), Thomas
Worsch (Karlsruhe Institute of Technology, Germany)
|
Phase Space Invertible Asynchronous Cellular Automata
|
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498
|
EPTCS 90, 2012, pp. 236-254
|
10.4204/EPTCS.90.19
| null |
cs.FL cs.CC cs.DM nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While for synchronous deterministic cellular automata there is an accepted
definition of reversibility, the situation is less clear for asynchronous
cellular automata. We first discuss a few possibilities and then investigate
what we call phase space invertible asynchronous cellular automata in more
detail. We will show that for each Turing machine there is such a cellular
automaton simulating it, and that it is decidable whether an asynchronous
cellular automaton has this property or not, even in higher dimensions.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 01:55:52 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Wacker",
"Simon",
"",
"Karlsruhe Institute of Technology, Germany"
],
[
"Worsch",
"Thomas",
"",
"Karlsruhe Institute of Technology, Germany"
]
] |
new_dataset
| 0.997539 |
1208.2785
|
Sathish Govindarajan
|
Pradeesha Ashok, Umair Azmi, Sathish Govindarajan
|
Small Strong Epsilon Nets
|
19 pages, 12 figures
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a
centerpoint of P if x is contained in every convex object that contains more
than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a
family of objects $\mathcal{C}$ if $x \in P$ is contained in every object $C
\in \mathcal{C}$ that contains more than a constant fraction of points of P. A
strong centerpoint does not exist even for halfspaces in $\mathbb{R}^2$. We
prove that a strong centerpoint exists for axis-parallel boxes in
$\mathbb{R}^d$ and give exact bounds. We then extend this to small strong
$\epsilon$-nets in the plane and prove upper and lower bounds for
$\epsilon_i^\mathcal{S}$ where $\mathcal{S}$ is the family of axis-parallel
rectangles, halfspaces and disks. Here $\epsilon_i^\mathcal{S}$ represents the
smallest real number in $[0,1]$ such that there exists an
$\epsilon_i^\mathcal{S}$-net of size i with respect to $\mathcal{S}$.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 05:05:11 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Ashok",
"Pradeesha",
""
],
[
"Azmi",
"Umair",
""
],
[
"Govindarajan",
"Sathish",
""
]
] |
new_dataset
| 0.996153 |
1208.2877
|
Alexandre Dulaunoy
|
Gerard Wagener, Alexandre Dulaunoy, Radu State
|
Torinj : Automated Exploitation Malware Targeting Tor Users
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We propose in this paper a new propagation vector for malicious software by
abusing the Tor network. Tor is particularly relevant, since operating a Tor
exit node is easy and involves low costs compared to attack institutional or
ISP networks. After presenting the Tor network from an attacker perspective, we
describe an automated exploitation malware which is operated on a Tor exit node
targeting to infect web browsers. Our experiments show that the current
deployed Tor network, provides a large amount of potential victims.
|
[
{
"version": "v1",
"created": "Tue, 14 Aug 2012 14:25:32 GMT"
}
] | 2012-08-15T00:00:00 |
[
[
"Wagener",
"Gerard",
""
],
[
"Dulaunoy",
"Alexandre",
""
],
[
"State",
"Radu",
""
]
] |
new_dataset
| 0.998505 |
1104.4669
|
Hao-Hsiang Hung
|
Michelangelo Grigni and Hao-Hsiang Hung
|
Finding Light Spanners in Bounded Pathwidth Graphs
|
10 pages, 3 figures; 37th International Symposium on Mathematical
Foundations of Computer Science (MFCS 2012)
| null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Given an edge-weighted graph $G$ and $\epsilon>0$, a $(1+\epsilon)$-spanner
is a spanning subgraph $G'$ whose shortest path distances approximate those of
$G$ within a $(1+\epsilon)$ factor. If $G$ is from certain minor-closed graph
families (at least bounded genus graphs and apex graphs), then we know that
light spanners exist. That is, we can compute a $(1+\epsilon)$-spanner $G'$
with total edge weight at most a constant times the weight of a minimum
spanning tree. This constant may depend on $\epsilon$ and the graph family, but
not on the particular graph $G$ nor on its edge weighting. For weighted graphs
from several minor-closed graph families, the existence of light spanners has
been essential in the design of approximation schemes for the metric TSP (the
traveling salesman problem) and some similar problems. In this paper we make
some progress towards the conjecture that light spanners exist for every
minor-closed graph family. In particular, we show that they exist for graphs
with bounded pathwidth. We do this via the construction of light enough
monotone spanning trees in such graphs.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2011 00:59:46 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Aug 2012 01:39:55 GMT"
}
] | 2012-08-14T00:00:00 |
[
[
"Grigni",
"Michelangelo",
""
],
[
"Hung",
"Hao-Hsiang",
""
]
] |
new_dataset
| 0.994413 |
1207.3133
|
Guenda Kenza
|
Kenza Guenda and T. Aaron Gulliver
|
New Symmetric and Asymmetric Quantum Codes
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
New infinite families of quantum symmetric and asymmetric codes are
constructed. Several of these are MDS. The codes obtained are shown to have
parameters which are better than previously known. A number of known codes are
special cases of the codes given here.
|
[
{
"version": "v1",
"created": "Fri, 13 Jul 2012 02:29:04 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Aug 2012 15:24:25 GMT"
}
] | 2012-08-14T00:00:00 |
[
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.99988 |
1207.7019
|
Vinayak Prabhu
|
Krishnendu Chatterjee and Thomas A. Henzinger and Vinayak S. Prabhu
|
Finite Automata with Time-Delay Blocks (Extended Version)
|
Full version
| null | null | null |
cs.FL cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of delays arises naturally in many computational models, such as,
in the design of circuits, control systems, and dataflow languages. In this
work, we introduce \emph{automata with delay blocks} (ADBs), extending finite
state automata with variable time delay blocks, for deferring individual
transition output symbols, in a discrete-time setting. We show that the ADB
languages strictly subsume the regular languages, and are incomparable in
expressive power to the context-free languages. We show that ADBs are closed
under union, concatenation and Kleene star, and under intersection with regular
languages, but not closed under complementation and intersection with other ADB
languages. We show that the emptiness and the membership problems are decidable
in polynomial time for ADBs, whereas the universality problem is undecidable.
Finally we consider the linear-time model checking problem, i.e., whether the
language of an ADB is contained in a regular language, and show that the model
checking problem is PSPACE-complete.
|
[
{
"version": "v1",
"created": "Mon, 30 Jul 2012 18:05:52 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Aug 2012 17:23:29 GMT"
},
{
"version": "v3",
"created": "Thu, 2 Aug 2012 22:45:32 GMT"
},
{
"version": "v4",
"created": "Mon, 13 Aug 2012 16:43:03 GMT"
}
] | 2012-08-14T00:00:00 |
[
[
"Chatterjee",
"Krishnendu",
""
],
[
"Henzinger",
"Thomas A.",
""
],
[
"Prabhu",
"Vinayak S.",
""
]
] |
new_dataset
| 0.999545 |
1208.2447
|
Rishi Gupta
|
Rishi Gupta, Piotr Indyk, Eric Price, and Yaron Rachlin
|
Compressive Sensing with Local Geometric Features
| null | null | null | null |
cs.CG cs.DS
|
http://creativecommons.org/licenses/by/3.0/
|
We propose a framework for compressive sensing of images with local
distinguishable objects, such as stars, and apply it to solve a problem in
celestial navigation. Specifically, let x be an N-pixel real-valued image,
consisting of a small number of local distinguishable objects plus noise. Our
goal is to design an m-by-N measurement matrix A with m << N, such that we can
recover an approximation to x from the measurements Ax.
We construct a matrix A and recovery algorithm with the following properties:
(i) if there are k objects, the number of measurements m is O((k log N)/(log
k)), undercutting the best known bound of O(k log(N/k)) (ii) the matrix A is
very sparse, which is important for hardware implementations of compressive
sensing algorithms, and (iii) the recovery algorithm is empirically fast and
runs in time polynomial in k and log(N).
We also present a comprehensive study of the application of our algorithm to
attitude determination, or finding one's orientation in space. Spacecraft
typically use cameras to acquire an image of the sky, and then identify stars
in the image to compute their orientation. Taking pictures is very expensive
for small spacecraft, since camera sensors use a lot of power. Our algorithm
optically compresses the image before it reaches the camera's array of pixels,
reducing the number of sensors that are required.
|
[
{
"version": "v1",
"created": "Sun, 12 Aug 2012 18:12:58 GMT"
}
] | 2012-08-14T00:00:00 |
[
[
"Gupta",
"Rishi",
""
],
[
"Indyk",
"Piotr",
""
],
[
"Price",
"Eric",
""
],
[
"Rachlin",
"Yaron",
""
]
] |
new_dataset
| 0.975903 |
1208.2239
|
Ernest Ryu
|
Ernest Ryu, Sean Choi
|
Stochastic Kronecker Graph on Vertex-Centric BSP
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently Stochastic Kronecker Graph (SKG), a network generation model, and
vertex-centric BSP, a graph processing framework like Pregel, have attracted
much attention in the network analysis community. Unfortunately the two are not
very well-suited for each other and thus an implementation of SKG on
vertex-centric BSP must either be done serially or in an unnatural manner.
In this paper, we present a new network generation model, which we call
Poisson Stochastic Kronecker Graph (PSKG), that generate edges according to the
Poisson distribution. The advantage of PSKG is that it is easily parallelizable
on vertex-centric BSP, requires no communication between computational nodes,
and yet retains all the desired properties of SKG.
|
[
{
"version": "v1",
"created": "Fri, 10 Aug 2012 18:16:52 GMT"
}
] | 2012-08-13T00:00:00 |
[
[
"Ryu",
"Ernest",
""
],
[
"Choi",
"Sean",
""
]
] |
new_dataset
| 0.97387 |
1106.1017
|
Ronit Bustin
|
Ronit Bustin, Shlomo Shamai
|
MMSE of "Bad" Codes
|
8 pages, 2 figures, submitted to the IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine codes, over the additive Gaussian noise channel, designed for
reliable communication at some specific signal-to-noise ratio (SNR) and
constrained by the permitted minimum mean-square error (MMSE) at lower SNRs.
The maximum possible rate is below point-to-point capacity, and hence these are
non-optimal codes (alternatively referred to as "bad" codes). We show that the
maximum possible rate is the one attained by superposition codebooks. Moreover,
the MMSE and mutual information behavior as a function of SNR, for any code
attaining the maximum rate under the MMSE constraint, is known for all SNR. We
also provide a lower bound on the MMSE for finite length codes, as a function
of the error probability of the code.
|
[
{
"version": "v1",
"created": "Mon, 6 Jun 2011 11:07:26 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Aug 2012 07:00:16 GMT"
}
] | 2012-08-10T00:00:00 |
[
[
"Bustin",
"Ronit",
""
],
[
"Shamai",
"Shlomo",
""
]
] |
new_dataset
| 0.994801 |
1205.5106
|
Nikolaos Triantafyllou
|
Nikolaos Triantafyllou, Petros Stefaneas and Panayiotis Frangos
|
OTS/CafeOBJ2JML: An attempt to combine Design By Contract with
Behavioral Specifications
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Design by Constract (DBC) has influenced the development of formal
specification languages that allow the mix of specification and implementation
code, like Eiffel, the Java Modeling Language (JML) and Spec#. Meanwhile
algebraic specification languages have been developing independently and offer
full support for specification and verification of design for large and complex
systems in a mathematical rigorous way. However there is no guarantee that the
final implementation will comply to the specification. In this paper we
proposed the use of the latter for the specification and verification of the
systems design and then by presenting a translation between the two, the use of
the former to ensure that the implementation respects the specification and
thus enjoy the verified properties.
|
[
{
"version": "v1",
"created": "Wed, 23 May 2012 07:17:42 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Aug 2012 15:43:03 GMT"
}
] | 2012-08-10T00:00:00 |
[
[
"Triantafyllou",
"Nikolaos",
""
],
[
"Stefaneas",
"Petros",
""
],
[
"Frangos",
"Panayiotis",
""
]
] |
new_dataset
| 0.998648 |
1208.1896
|
Kuan Hoong Poo
|
Poo Kuan Hoong, Ian K. T. Tan and Chee Yik Keong
|
Bittorrent Network Traffic Forecasting With ARMA
|
14 pages
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
In recent years, there are some major changes in the way content is being
distributed over the network. The content distribution techniques have recently
started to embrace peer-to-peer (P2P) systems as an alternative to the
traditional client-server architecture. P2P systemsthat are based on the
BitTorrent protocol uses end-users' resources to provide a cost effective
distribution of bandwidth intensive content to thousands of users. The
BitTorrent protocol system offers a scalable mechanism for distributing a large
volume of data to a set of peers over the Internet. With the growing demand for
file sharing and content distribution, BitTorrent has become one of the most
popular Internet applications and contributes to a signification fraction of
the Internet traffic. With the wide usage of the BitTorrent protocol system, it
has basically solved one of the major problems where data can be quickly
transferred to a group of interested parties. The strength of the BitTorrent
protocol lies in efficient bandwidth utilization for the downloading and
uploading processes. However, the usage of BitTorrent protocol also causes
latency for other applications in terms of network bandwidth which in turn has
caused concerns for the Internet Service Providers, who strives for quality of
service for all their customers. In this paper, we study the network traffic
patterns of theBitTorrent network traffic and investigate its behavior by
usingthe time series ARMA model. Our experimental results show that BitTorrent
network traffic can be modeled and forecasted by using ARMA models. We compared
and evaluated the forecasted network traffic with the real traffic patterns.
This modeling can be utilized by the Internet Service Providers to manage their
network bandwidth and also detect any abnormality in their network.
|
[
{
"version": "v1",
"created": "Thu, 9 Aug 2012 13:07:17 GMT"
}
] | 2012-08-10T00:00:00 |
[
[
"Hoong",
"Poo Kuan",
""
],
[
"Tan",
"Ian K. T.",
""
],
[
"Keong",
"Chee Yik",
""
]
] |
new_dataset
| 0.995265 |
1208.1906
|
Richard Perry
|
Richard Perry
|
Batch Spreadsheet for C Programmers
|
(2009) Batch Spreadsheet for C Programmers, International Conference
on Scientific Computing (CSC'09)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A computing environment is proposed, based on batch spreadsheet processing,
which produces a spreadsheet display from plain text input files of commands,
similar to the way documents are created using LaTeX. In this environment,
besides the usual spreadsheet rows and columns of cells, variables can be
defined and are stored in a separate symbol table. Cell and symbol formulas may
contain cycles, and cycles which converge can be used to implement iterative
algorithms. Formulas are specified using the syntax of the C programming
language, and all of C's numeric operators are supported, with operators such
as ++, +=, etc. being implicitly cyclic. User-defined functions can be written
in C and are accessed using a dynamic link library. The environment can be
combined with a GUI front-end processor to enable easier interaction and
graphics including plotting.
|
[
{
"version": "v1",
"created": "Thu, 9 Aug 2012 13:38:26 GMT"
}
] | 2012-08-10T00:00:00 |
[
[
"Perry",
"Richard",
""
]
] |
new_dataset
| 0.999276 |
1208.1959
|
Pathik Shah
|
Akshai Aggarwal, Savita Gandhi, Nirbhay Chaubey, Pathik Shah, Madhvi
Sadhwani
|
AODVSEC: A Novel Approach to Secure Ad Hoc on-Demand Distance Vector
(AODV) Routing Protocol from Insider Attacks in MANETs
|
20 Pages, 24 Figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.4, No.4, July 2012, 191-210
|
10.5121/ijcnc.2012.4412
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Ad hoc Network (MANET) is a collection of mobile nodes that can
communicate with each other using multihop wireless links without requiring any
fixed based-station infrastructure and centralized management. Each node in the
network acts as both a host and a router. In such scenario, designing of an
efficient, reliable and secure routing protocol has been a major challenging
issue over the last many years. Numerous schemes have been proposed for secure
routing protocols and most of the research work has so far focused on providing
security for routing using cryptography. In this paper, we propose a novel
approach to secure Ad hoc On-demand Distance Vector (AODV) routing protocol
from the insider attacks launched through active forging of its Route Reply
(RREP) control message. AODV routing protocol does not have any security
provision that makes it less reliable in publicly open ad hoc network. To deal
with the concerned security attacks, we have proposed AODV Security Extension
(AODVSEC) which enhances the scope of AODV for the security provision. We have
compared AODVSEC with AODV and Secure AODV (SAODV) in normal situation as well
as in presence of the three concerned attacks viz. Resource Consumption (RC)
attack, Route Disturb (RD) attack, Route Invasion (RI) attack and Blackhole
(BH) attack. To evaluate the performances, we have considered Packet Delivery
Fraction (PDF), Average End-to-End Delay (AED), Average Throughput (AT),
Normalized Routing Load (NRL) and Average Jitter and Accumulated Average
Processing Time.
|
[
{
"version": "v1",
"created": "Thu, 9 Aug 2012 15:58:09 GMT"
}
] | 2012-08-10T00:00:00 |
[
[
"Aggarwal",
"Akshai",
""
],
[
"Gandhi",
"Savita",
""
],
[
"Chaubey",
"Nirbhay",
""
],
[
"Shah",
"Pathik",
""
],
[
"Sadhwani",
"Madhvi",
""
]
] |
new_dataset
| 0.999038 |
1205.6186
|
Ilan Shomorony
|
Ilan Shomorony and Ra\'ul Etkin and Farzad Parvaresh and A. Salman
Avestimehr
|
Diamond Networks with Bursty Traffic: Bounds on the Minimum
Energy-Per-Bit
|
Several proofs were updated
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When data traffic in a wireless network is bursty, small amounts of data
sporadically become available for transmission, at times that are unknown at
the receivers, and an extra amount of energy must be spent at the transmitters
to overcome this lack of synchronization between the network nodes. In
practice, pre-defined header sequences are used with the purpose of
synchronizing the different network nodes. However, in networks where relays
must be used for communication, the overhead required for synchronizing the
entire network may be very significant.
In this work, we study the fundamental limits of energy-efficient
communication in an asynchronous diamond network with two relays. We formalize
the notion of relay synchronization by saying that a relay is synchronized if
the conditional entropy of the arrival time of the source message given the
received signals at the relay is small. We show that the minimum energy-per-bit
for bursty traffic in diamond networks is achieved with a coding scheme where
each relay is either synchronized or not used at all. A consequence of this
result is the derivation of a lower bound to the minimum energy-per-bit for
bursty communication in diamond networks. This bound allows us to show that
schemes that perform the tasks of synchronization and communication separately
(i.e., with synchronization signals preceding the communication block) can
achieve the minimum energy-per-bit to within a constant fraction that ranges
from 2 in the synchronous case to 1 in the highly asynchronous regime.
|
[
{
"version": "v1",
"created": "Mon, 28 May 2012 18:50:15 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Aug 2012 14:35:11 GMT"
}
] | 2012-08-09T00:00:00 |
[
[
"Shomorony",
"Ilan",
""
],
[
"Etkin",
"Raúl",
""
],
[
"Parvaresh",
"Farzad",
""
],
[
"Avestimehr",
"A. Salman",
""
]
] |
new_dataset
| 0.983702 |
1208.1574
|
Mohammad Doomun
|
Zaafir Barahim, M. Razvi Doomun, Nazrana Joomun
|
Low-Cost Bluetooth Mobile Positioning for Location-based Application
|
4 pages 3rd IEEE/IFIP International Conference in Central Asia on
Internet 2007, ICI 2007
| null |
10.1109/CANET.2007.4401707
| null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Bluetooth is a promising short-range radio network technology. We present a
low cost and easily deployed, scalable infrastructure for indoor location-based
computing of mobile devices based on Bluetooth technology. The system consists
of 2 main components, namely the Bluetooth (BT) Sensor System and the Central
Navigation System which have been developed using the JDK 6.0. The Bluetooth
Sensor System allows mobile devices whose Bluetooth mode is set to
discoverable, to be scanned and detected, and they receive customizable text
message of their positioning information, e.g. room identity. The positioning
information is also sent to the Central Navigation System which in turn
displays and updates the navigation map. The system is also used to track the
movement of different BT mobile devices within the implemented environment.
|
[
{
"version": "v1",
"created": "Wed, 8 Aug 2012 04:38:39 GMT"
}
] | 2012-08-09T00:00:00 |
[
[
"Barahim",
"Zaafir",
""
],
[
"Doomun",
"M. Razvi",
""
],
[
"Joomun",
"Nazrana",
""
]
] |
new_dataset
| 0.999662 |
1208.1366
|
Christian Sternagel
|
Christian Sternagel
|
A Locale for Minimal Bad Sequences
|
7 pages, Isabelle Users Workshop 2012
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a locale that abstracts over the necessary ingredients for
constructing a minimal bad sequence, as required in classical proofs of
Higman's lemma and Kruskal's tree theorem.
|
[
{
"version": "v1",
"created": "Tue, 7 Aug 2012 08:45:28 GMT"
}
] | 2012-08-08T00:00:00 |
[
[
"Sternagel",
"Christian",
""
]
] |
new_dataset
| 0.998561 |
1207.6873
|
Ravindranath Chowdary C
|
Surendranath Chowdary Chandra and Ravindranath Chowdary C
|
JASF: Jasta Security Framework
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
JASM is a model designed to increase the security level in authentication
systems. It uses IP Address of the user in the authentication process to
enhance the security.
|
[
{
"version": "v1",
"created": "Mon, 30 Jul 2012 09:16:14 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Aug 2012 16:49:54 GMT"
}
] | 2012-08-07T00:00:00 |
[
[
"Chandra",
"Surendranath Chowdary",
""
],
[
"C",
"Ravindranath Chowdary",
""
]
] |
new_dataset
| 0.998538 |
1208.0591
|
Partha Pratim Ray
|
Poulami Majumder, Partha Pratim Ray
|
Hatch-Sens: a Theoretical Bio-Inspired Model to Monitor the Hatching of
Plankton Culture in the Vicinity of Wireless Sensor Network
|
ISSN 0975-9646
|
International Journal of Computer Science and Information
Technologies (IJCSIT) 3(4) 4764-4769 (2012)
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Plankton research has always been an important area of biology. Due to
various environmental issues and other research interests, plankton hatching
and harnessing has been extremely red-marked zone for bio-aqua scientists
recently. To counter this problem, no wireless sensor assisted technique or
mechanism has yet not been devised. In this literature, we propose a novel
approach to pursue this task by the virtue of a theoretical Bio-inspired model
named Hatch-Sens, to automatically monitor different parameters of plankton
hatching in laboratory environment. This literature illustrates the concepts
and detailed mechanisms to accumulate this given problem. Hatch-Sens is a novel
idea which combines the biology with computer in its sensing network to monitor
hatching parameters of Artemia salina. This model reduces the manual tiresome
monitoring of hatching of plankton culture by wireless sensor network.
|
[
{
"version": "v1",
"created": "Thu, 2 Aug 2012 17:01:53 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Aug 2012 07:08:41 GMT"
}
] | 2012-08-07T00:00:00 |
[
[
"Majumder",
"Poulami",
""
],
[
"Ray",
"Partha Pratim",
""
]
] |
new_dataset
| 0.993094 |
1208.0722
|
Gabriel Renault
|
Eric Duch\^ene and Gabriel Renault
|
Vertex Nim played on graphs
| null | null | null | null |
cs.DM cs.GT math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph G with positive integer weights on the vertices, and a token
placed on some current vertex u, two players alternately remove a positive
integer weight from u and then move the token to a new current vertex adjacent
to u. When the weight of a vertex is set to 0, it is removed and its
neighborhood becomes a clique. The player making the last move wins. This
adaptation of Nim on graphs is called Vertexnim, and slightly differs from the
game Vertex NimG introduced by Stockman in 2004. Vertexnim can be played on
both directed or undirected graphs. In this paper, we study the complexity of
deciding whether a given game position of Vertexnim is winning for the first or
second player. In particular, we show that for undirected graphs, this problem
can be solved in quadratic time. Our algorithm is also available for the game
Vertex NimG, thus improving Stockman's exptime algorithm. In the directed case,
we are able to compute the winning strategy in polynomial time for several
instances, including circuits or digraphs with self loops.
|
[
{
"version": "v1",
"created": "Fri, 3 Aug 2012 12:06:04 GMT"
}
] | 2012-08-06T00:00:00 |
[
[
"Duchêne",
"Eric",
""
],
[
"Renault",
"Gabriel",
""
]
] |
new_dataset
| 0.999932 |
1208.0755
|
Partha Pratim Ray
|
Partha Pratim Ray
|
Universal Numeric Segment Display for Indian Scheduled Languages: an
Architectural View
|
ISSN 2231-2803. arXiv admin note: text overlap with arXiv:1009.4977
by other authors
|
International Journal of Computer Trends and Technology (IJCTT)
2(2/2) 161-166 (2011)
| null | null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
India is country of several hundred different languages. Though twenty two
languages have only been devised as scheduled to the Eighth Schedule of Indian
Constitution in 2007. But as there is yet no proposed compact display
architecture to display all the scheduled language numerals at a time, this
paper proposes a uniform display architecture to display all twenty two
different language digits with higher accuracy and simplicity by using a
17-segment display, which is an improvement over the 16-segment display.
|
[
{
"version": "v1",
"created": "Thu, 2 Aug 2012 17:00:03 GMT"
}
] | 2012-08-06T00:00:00 |
[
[
"Ray",
"Partha Pratim",
""
]
] |
new_dataset
| 0.999812 |
1208.0805
|
Jorge Arpasi
|
Jorge P. Arpasi
|
On the control of abelian group codes with information group of prime
order
|
12 pages, 2 figures
| null | null | null |
cs.IT math.GR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Finite State Machine (FSM) model is widely used in the construction of binary
convolutional codes. If Z_2={0,1} is the binary mod-2 addition group and
(Z_2)^n is the n-times direct product of Z_2, then a binary convolutional
encoder, with rate (k/n)< 1 and memory m, is a FSM with (Z_2)^k as inputs
group, (Z_2)^n as outputs group and (Z_2)^m as states group. The next state
mapping nu:[(Z_2)^k x (Z_2)^m] --> (Z_2)^m is a surjective group homomorphism.
The encoding mapping omega:[(Z_2)^k x (Z_2)^m] --> (Z_2)^n is a homomorphism
adequately restricted by the trellis graph produced by nu. The binary
convolutional code is the family of bi-infinite sequences produced by the
binary convolutional encoder. Thus, a convolutional code can be considered as a
dynamical system and it is known that well behaved dynamical systems must be
necessarily controllable. The generalization of binary convolutional encoders
over arbitrary finite groups is made by using the extension of groups, instead
of direct product. In this way, given finite groups U,S and Y, a wide-sense
homomorphic encoder (WSHE) is a FSM with U as inputs group, S as states group,
and Y as outputs group. By denoting (U x S) as the extension of U by S, the
next state homomorphism nu:(U x S) --> S needs to be surjective and the
encoding homomorphism omega:(U x S) --> Y has restrictions given by the trellis
graph produced by nu. The code produced by a WSHE is known as group code. In
this work we will study the case when the extension (U x S) is abelian with U
being Z_p, p a positive prime number. We will show that this class of WSHEs
will produce controllable codes only if the states group S is isomorphic with
(Z_p)^j, for some positive integer j.
|
[
{
"version": "v1",
"created": "Fri, 3 Aug 2012 17:57:03 GMT"
}
] | 2012-08-06T00:00:00 |
[
[
"Arpasi",
"Jorge P.",
""
]
] |
new_dataset
| 0.996028 |
1208.0403
|
Dr Brij Gupta
|
Esraa Alomari, Selvakumar Manickam, B. B. Gupta, Shankar Karuppayah,
Rafeef Alfaris
|
Botnet-based Distributed Denial of Service (DDoS) Attacks on Web
Servers: Classification and Art
| null | null |
10.5120/7640-0724
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Botnets are prevailing mechanisms for the facilitation of the distributed
denial of service (DDoS) attacks on computer networks or applications.
Currently, Botnet-based DDoS attacks on the application layer are latest and
most problematic trends in network security threats. Botnet-based DDoS attacks
on the application layer limits resources, curtails revenue, and yields
customer dissatisfaction, among others. DDoS attacks are among the most
difficult problems to resolve online, especially, when the target is the Web
server. In this paper, we present a comprehensive study to show the danger of
Botnet-based DDoS attacks on application layer, especially on the Web server
and the increased incidents of such attacks that has evidently increased
recently. Botnet-based DDoS attacks incidents and revenue losses of famous
companies and government websites are also described. This provides better
understanding of the problem, current solution space, and future research scope
to defend against such attacks efficiently.
|
[
{
"version": "v1",
"created": "Thu, 2 Aug 2012 05:35:05 GMT"
}
] | 2012-08-03T00:00:00 |
[
[
"Alomari",
"Esraa",
""
],
[
"Manickam",
"Selvakumar",
""
],
[
"Gupta",
"B. B.",
""
],
[
"Karuppayah",
"Shankar",
""
],
[
"Alfaris",
"Rafeef",
""
]
] |
new_dataset
| 0.990754 |
1009.4898
|
Sanat Sarangi
|
Sanat Sarangi and Subrat Kar
|
Location Estimation with Reactive Routing in Resource Constrained Sensor
Networks
|
6 pages, 6 figures
|
International Conference on Sensors and Related Networks
(SENNET'09), VIT University, Vellore, India, Dec. 08-10, 2009, pp.563-567
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Routing algorithms for wireless sensor networks can be broadly divided into
two classes - proactive and reactive. Proactive routing is suitable for a
network with a fixed topology. On the other hand, reactive routing is more
suitable for a set of mobile nodes where routes are created on demand and there
is not much time to evaluate the worthiness of a route, the prime concern being
reachability due to constantly changing node positions. Sensor networks route
events of interest from source(s) to destination(s) where appropriate actions
could be taken. However, with mobile sensor nodes, it is not only important to
know the events but the location of the nodes generating the events. Most
sensor nodes are not equipped with expensive GPS or accurate RSSI computation
hardware to aid localization. Keeping these in view, we propose a modified
reactive routing algorithm, with added support for localization, to localize
mobile sensor nodes on the basis of information received from fixed sensor
nodes during mutual exchange of routing control packets. The accuracy of
localization depends on the ratio of the number of fixed nodes to the number of
mobile nodes and the topology of the fixed nodes. A typical application
scenario would be a mix of mobile nodes and fixed nodes, where fixed nodes know
their absolute location and the location of mobile nodes is derived from the
fixed nodes, in step with the reactive routing protocol in action. The modified
algorithm would be suitable for deployments where the approximate position of a
mobile node (i.e. the event location) is required but there is no external
support infrastructure available for localization.
|
[
{
"version": "v1",
"created": "Fri, 24 Sep 2010 17:30:56 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Aug 2012 14:28:01 GMT"
}
] | 2012-08-02T00:00:00 |
[
[
"Sarangi",
"Sanat",
""
],
[
"Kar",
"Subrat",
""
]
] |
new_dataset
| 0.993186 |
1112.4106
|
Ravi Chugh
|
Ravi Chugh and David Herman and Ranjit Jhala
|
Dependent Types for JavaScript
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Dependent JavaScript (DJS), a statically-typed dialect of the
imperative, object-oriented, dynamic language. DJS supports the particularly
challenging features such as run-time type-tests, higher-order functions,
extensible objects, prototype inheritance, and arrays through a combination of
nested refinement types, strong updates to the heap, and heap unrolling to
precisely track prototype hierarchies. With our implementation of DJS, we
demonstrate that the type system is expressive enough to reason about a variety
of tricky idioms found in small examples drawn from several sources, including
the popular book JavaScript: The Good Parts and the SunSpider benchmark suite.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2011 01:42:11 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Apr 2012 07:22:59 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Aug 2012 04:56:07 GMT"
}
] | 2012-08-02T00:00:00 |
[
[
"Chugh",
"Ravi",
""
],
[
"Herman",
"David",
""
],
[
"Jhala",
"Ranjit",
""
]
] |
new_dataset
| 0.953914 |
1204.3569
|
Federico Librino
|
Federico Librino, Marco Levorato and Michele Zorzi
|
An Algorithmic Solution for Computing Circle Intersection Areas and its
Applications to Wireless Communications
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel iterative algorithm for the efficient computation of the intersection
areas of an arbitrary number of circles is presented. The algorithm, based on a
trellis-structure, hinges on two geometric results which allow the
existence-check and the computation of the area of the intersection regions
generated by more than three circles by simple algebraic manipulations of the
intersection areas of a smaller number of circles. The presented algorithm is a
powerful tool for the performance analysis of wireless networks, and finds many
applications, ranging from sensor to cellular networks. As an example of
practical application, an insightful study of the uplink outage probability of
in a wireless network with cooperative access points as a function of the
transmission power and access point density is presented.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2012 16:55:50 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Aug 2012 16:33:01 GMT"
}
] | 2012-08-02T00:00:00 |
[
[
"Librino",
"Federico",
""
],
[
"Levorato",
"Marco",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.950155 |
1208.0044
|
Mourad Kmimech
|
Mouti Hammami
|
Maintenance de l'outil Wr2fdr de traduction de Wright vers CSP
|
arXiv admin note: substantial text overlap with arXiv:1207.7121,
arXiv:1207.6831 by other authors
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of formal ADL like Wright is critically dependent on the tools that
are made available to architects. The Wr2fdr tools accompanying the formal
Wright ADL provides translation to Wright to CSP. Wr2fdr automates four
standard properties concerning consistency Connectors (properties 2 and 3),
Component (a property 1) and Configuration Management (Property 8) Wright using
the model checker FDR. After conducting an audit activity of this tool, we were
able to correct errors related to both properties 2 and 3. In addition, we
proposed an implementation of both properties 1 and 8. Finally, we added the
tool Wr2fdr with a semantic analyzer of Wright.
|
[
{
"version": "v1",
"created": "Mon, 9 Jul 2012 15:58:44 GMT"
}
] | 2012-08-02T00:00:00 |
[
[
"Hammami",
"Mouti",
""
]
] |
new_dataset
| 0.984326 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.