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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1202.1584
|
Kai Han
|
Kai Han, Liu Xiang, Jun Luo, and Yang Liu
|
MEGCOM: Min-Energy Group COMmunication in Multi-hop Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given the increasing demand from wireless applications, designing
energy-efficient group communication protocols is of great importance to
multi-hop wireless networks. A group communication session involves a set of
member nodes, each of them needs to send a certain number of data packets to
all other members. In this paper, we consider the problem of building a shared
multicast tree spanning the member nodes such that the total energy consumption
of a group communication session using the shared multicast tree is minimized.
Since this problem was proven as NP-complete, we propose, under our Min-Energy
Group COMmunication (MEGCOM) framework, three distributed approximation
algorithms with provable approximation ratios. When the transmission power of
each wireless node is fixed, our first two algorithms have the approximation
ratios of O(ln(\Delta+ 1)) and O(1), respectively, where \Delta is the maximum
node degree in the network. When the transmission power of each wireless node
is adjustable, our third algorithm again delivers a constant approximation
ratio. We also use extensive simulations to verify the practical performance of
our algorithms.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2012 02:53:37 GMT"
},
{
"version": "v2",
"created": "Sun, 19 Feb 2012 08:20:00 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Han",
"Kai",
""
],
[
"Xiang",
"Liu",
""
],
[
"Luo",
"Jun",
""
],
[
"Liu",
"Yang",
""
]
] |
new_dataset
| 0.997829 |
1202.4301
|
Johannes Mittmann
|
Johannes Mittmann, Nitin Saxena and Peter Scheiblechner
|
Algebraic Independence in Positive Characteristic -- A p-Adic Calculus
| null | null | null | null |
cs.CC math.AC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set of multivariate polynomials, over a field of zero or large
characteristic, can be tested for algebraic independence by the well-known
Jacobian criterion. For fields of other characteristic p>0, there is no
analogous characterization known. In this paper we give the first such
criterion. Essentially, it boils down to a non-degeneracy condition on a lift
of the Jacobian polynomial over (an unramified extension of) the ring of p-adic
integers.
Our proof builds on the de Rham-Witt complex, which was invented by Illusie
(1979) for crystalline cohomology computations, and we deduce a natural
generalization of the Jacobian. This new avatar we call the Witt-Jacobian. In
essence, we show how to faithfully differentiate polynomials over F_p (i.e.
somehow avoid dx^p/dx=0) and thus capture algebraic independence.
We apply the new criterion to put the problem of testing algebraic
independence in the complexity class NP^#P (previously best was PSPACE). Also,
we give a modest application to the problem of identity testing in algebraic
complexity theory.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2012 12:25:20 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Mittmann",
"Johannes",
""
],
[
"Saxena",
"Nitin",
""
],
[
"Scheiblechner",
"Peter",
""
]
] |
new_dataset
| 0.995021 |
1202.4307
|
Paraskevas Lekeas
|
Paraskevas V. Lekeas
|
Coalitional Beliefs of Cournot Network Agents
|
Appendix with 2 figures
| null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Network cooperative games, due to computational complexity issues, agents
are not able to base their behavior on the "whole network status" but have to
follow certain "beliefs" as to how it is in their strategic interest to act.
This behavior constitutes the main interest of this paper. To this end, we
quantify and characterize the set of beliefs that support cooperation of such
agents. Assuming that they are engaged in a differentiated Cournot competition
and that they equally split the worth produced, we characterize the set of
coalitional beliefs that support core non-emptiness and thus guarantee
stability of the Network.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2012 12:49:47 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Lekeas",
"Paraskevas V.",
""
]
] |
new_dataset
| 0.988834 |
1202.4347
|
Amit Bawaskar
|
Jayshree Ghorpade, Jitendra Parande, Madhura Kulkarni, Amit Bawaskar
|
GPGPU Processing in CUDA Architecture
|
16 pages, 5 figures, Advanced Computing: an International Journal
(ACIJ) 2012
| null |
10.5121/acij.2012.3109
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The future of computation is the Graphical Processing Unit, i.e. the GPU. The
promise that the graphics cards have shown in the field of image processing and
accelerated rendering of 3D scenes, and the computational capability that these
GPUs possess, they are developing into great parallel computing units. It is
quite simple to program a graphics processor to perform general parallel tasks.
But after understanding the various architectural aspects of the graphics
processor, it can be used to perform other taxing tasks as well. In this paper,
we will show how CUDA can fully utilize the tremendous power of these GPUs.
CUDA is NVIDIA's parallel computing architecture. It enables dramatic increases
in computing performance, by harnessing the power of the GPU. This paper talks
about CUDA and its architecture. It takes us through a comparison of CUDA C/C++
with other parallel programming languages like OpenCL and DirectCompute. The
paper also lists out the common myths about CUDA and how the future seems to be
promising for CUDA.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2012 15:16:40 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Ghorpade",
"Jayshree",
""
],
[
"Parande",
"Jitendra",
""
],
[
"Kulkarni",
"Madhura",
""
],
[
"Bawaskar",
"Amit",
""
]
] |
new_dataset
| 0.964861 |
1202.3872
|
Thomas Pietrzak
|
Thomas Pietrzak (INRIA Lille - Nord Europe), Andrew Crossan (GIST),
Brewster A. Stephen (GIST), Beno\^it Martin (LITA), Isabelle Pecci (LITA)
|
Creating Usable Pin Array Tactons for Non-Visual Information
| null |
IEEE Transactions on Haptics 2, 2 (2009) 61-72
|
10.1109/TOH.2009.6
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spatial information can be difficult to present to a visually impaired
computer user. In this paper we examine a new kind of tactile cueing for
non-visual interaction as a potential solution, building on earlier work on
vibrotactile Tactons. However, unlike vibrotactile Tactons, we use a pin array
to stimulate the finger tip. Here, we describe how to design static and dynamic
Tactons by defining their basic components. We then present user tests
examining how easy it is to distinguish between different forms of pin array
Tactons demonstrating accurate Tacton sets to represent directions. These
experiments demonstrate usable patterns for static, wave and blinking pin array
Tacton sets for guiding a user in one of eight directions. A study is then
described that shows the benefits of structuring Tactons to convey information
through multiple parameters of the signal. By using multiple independent
parameters for a Tacton, this study demonstrates participants perceive more
information through a single Tacton. Two applications using these Tactons are
then presented: a maze exploration application and an electric circuit
exploration application designed for use by and tested with visually impaired
users.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2012 10:49:23 GMT"
}
] | 2012-02-20T00:00:00 |
[
[
"Pietrzak",
"Thomas",
"",
"INRIA Lille - Nord Europe"
],
[
"Crossan",
"Andrew",
"",
"GIST"
],
[
"Stephen",
"Brewster A.",
"",
"GIST"
],
[
"Martin",
"Benoît",
"",
"LITA"
],
[
"Pecci",
"Isabelle",
"",
"LITA"
]
] |
new_dataset
| 0.994241 |
1202.2004
|
Fabio Francesco Gabriele Buono
|
Fabio F. G. Buono
|
A New Type of Cipher
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
We will define a new type of cipher that doesn't use neither an easy to
calcualate and hard to invert matematical function like RSA nor a classical
mono or polyalphabetic cipher.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 14:46:47 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Feb 2012 21:18:47 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Feb 2012 19:10:47 GMT"
}
] | 2012-02-17T00:00:00 |
[
[
"Buono",
"Fabio F. G.",
""
]
] |
new_dataset
| 0.997141 |
1202.3684
|
Marius Leordeanu
|
Marius Leordeanu, Rahul Sukthankar, Cristian Sminchisescu
|
Generalized Boundaries from Multiple Image Interpretations
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Boundary detection is essential for a variety of computer vision tasks such
as segmentation and recognition. In this paper we propose a unified formulation
and a novel algorithm that are applicable to the detection of different types
of boundaries, such as intensity edges, occlusion boundaries or object category
specific boundaries. Our formulation leads to a simple method with
state-of-the-art performance and significantly lower computational cost than
existing methods. We evaluate our algorithm on different types of boundaries,
from low-level boundaries extracted in natural images, to occlusion boundaries
obtained using motion cues and RGB-D cameras, to boundaries from
soft-segmentation. We also propose a novel method for figure/ground
soft-segmentation that can be used in conjunction with our boundary detection
method and improve its accuracy at almost no extra computational cost.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2012 20:08:11 GMT"
}
] | 2012-02-17T00:00:00 |
[
[
"Leordeanu",
"Marius",
""
],
[
"Sukthankar",
"Rahul",
""
],
[
"Sminchisescu",
"Cristian",
""
]
] |
new_dataset
| 0.987105 |
1002.4180
|
Subhadip Basu
|
Saurav Chakraborty, Subhadip Basu
|
Design of a Smart Unmanned Ground Vehicle for Hazardous Environments
|
In proceedings of 2nd National Conference on Recent Trends in
Information Systems (ReTIS-08), pp. 222-225, Feb 7-9, 2008, Kolkata
|
In proceedings of 2nd National Conference on Recent Trends in
Information Systems (ReTIS-08), pp. 222-225, Feb 7-9, 2008, Kolkata
| null | null |
cs.RO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A smart Unmanned Ground Vehicle (UGV) is designed and developed for some
application specific missions to operate predominantly in hazardous
environments. In our work, we have developed a small and lightweight vehicle to
operate in general cross-country terrains in or without daylight. The UGV can
send visual feedbacks to the operator at a remote location. Onboard infrared
sensors can detect the obstacles around the UGV and sends signals to the
operator.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2010 19:39:26 GMT"
}
] | 2012-02-15T00:00:00 |
[
[
"Chakraborty",
"Saurav",
""
],
[
"Basu",
"Subhadip",
""
]
] |
new_dataset
| 0.999236 |
1202.3018
|
Brage Ellingsater
|
Brage Ellings{\ae}ter, Hemdan Bezabih, Josef Noll and Torleiv Maseng
|
Using TV Receiver Information to Increase Cognitive White Space Spectrum
|
26 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the usage of cognitive radio devices within the
service area of TV broadcast stations. Until now the main approach for a
cognitive radio to operate in the TV bands has been to register TV broadcast
stations locations and thus protecting the broadcast stations service area.
Through information about TV receivers location, we show that a cognitive radio
should be able to operate within this service area without causing harmful
interference to the TV receivers as defined by Ofcom and FCC. We provide
simulations based on real statistics from Norway that show that especially in
rural areas TV receiver registration can provide a substantial gain in terms of
exploitable frequencies for a cognitive radio.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2012 12:31:27 GMT"
}
] | 2012-02-15T00:00:00 |
[
[
"Ellingsæter",
"Brage",
""
],
[
"Bezabih",
"Hemdan",
""
],
[
"Noll",
"Josef",
""
],
[
"Maseng",
"Torleiv",
""
]
] |
new_dataset
| 0.995425 |
1202.3048
|
Joydeep Basu
|
Ritesh Ray Chaudhuri, Joydeep Basu and Tarun Kanti Bhattacharyya
|
Design and Fabrication of Micromachined Resonators
|
7 pages, 12 figures
|
Proceedings of the 6th International Conference on Smart
Materials, Structures and Systems, January 04-07, 2012, Bangalore, India
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Microelectromechanical system (MEMS) based on-chip resonators offer great
potential for sensing and high frequency signal processing applications due to
their exceptional features like small size, large frequency-quality factor
product, integrability with CMOS ICs, low power consumption etc. This work is
mainly aimed at the design, modeling, simulation, and fabrication of
micromachined polysilicon disk resonators exhibiting radial-contour mode
vibrations. A few other bulk mode modified resonator geometries are also being
explored. The resonator structures have been designed and simulated in
CoventorWare finite-element platform and fabricated by the PolyMUMPs surface
micromachining process.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2012 14:34:04 GMT"
}
] | 2012-02-15T00:00:00 |
[
[
"Chaudhuri",
"Ritesh Ray",
""
],
[
"Basu",
"Joydeep",
""
],
[
"Bhattacharyya",
"Tarun Kanti",
""
]
] |
new_dataset
| 0.996376 |
1105.6084
|
Ahmed Kosba
|
Ahmed E. Kosba, Ahmed Saeed and Moustafa Youssef
|
RASID: A Robust WLAN Device-free Passive Motion Detection System
|
V1: 14 pages, 11 figures. V2: 16 Pages, 15 figures. The
non-parametric model of the system is compared with a parametric model of the
system operation. Added 2-sample KS-Test for evaluating the profile update
mechanism. Latency in detection decisions was allowed, and parameters
configurations tuned accordingly. Same Conclusions. The effect of network
activity on system profiles is analyzed
| null | null | null |
cs.NI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WLAN Device-free passive DfP indoor localization is an emerging technology
enabling the localization of entities that do not carry any devices nor
participate actively in the localization process using the already installed
wireless infrastructure. This technology is useful for a variety of
applications such as intrusion detection, smart homes and border protection. We
present the design, implementation and evaluation of RASID, a DfP system for
human motion detection. RASID combines different modules for statistical
anomaly detection while adapting to changes in the environment to provide
accurate, robust, and low-overhead detection of human activities using standard
WiFi hardware. Evaluation of the system in two different testbeds shows that it
can achieve an accurate detection capability in both environments with an
F-measure of at least 0.93. In addition, the high accuracy and low overhead
performance are robust to changes in the environment as compared to the current
state of the art DfP detection systems. We also relay the lessons learned
during building our system and discuss future research directions.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 19:39:19 GMT"
},
{
"version": "v2",
"created": "Sun, 12 Feb 2012 03:08:44 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Kosba",
"Ahmed E.",
""
],
[
"Saeed",
"Ahmed",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.99872 |
1202.2420
|
Wajeb Gharibi
|
Wajeb Gharibi and Maha Shaabi
|
Cyber threats in social networking websites
|
8 pages; International Journal of Distributed and Parallel Systems
(IJDPS) Vol.3, No.1, January 2012
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A social network is a social structure made up of individuals or
organizations called nodes, which are connected by one or more specific types
of interdependency, such as friendship, common interest, and exchange of
finance, relationships of beliefs, knowledge or prestige. A cyber threat can be
both unintentional and intentional, targeted or non targeted, and it can come
from a variety of sources, including foreign nations engaged in espionage and
information warfare, criminals, hackers, virus writers, disgruntled employees
and contractors working within an organization. Social networking sites are not
only to communicate or interact with other people globally, but also one
effective way for business promotion. In this paper, we investigate and study
the cyber threats in social networking websites. We go through the amassing
history of online social websites, classify their types and also discuss the
cyber threats, suggest the anti-threats strategies and visualize the future
trends of such hoppy popular websites.
|
[
{
"version": "v1",
"created": "Sat, 11 Feb 2012 06:42:03 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Gharibi",
"Wajeb",
""
],
[
"Shaabi",
"Maha",
""
]
] |
new_dataset
| 0.996548 |
1202.2509
|
Bogdan Alexandru Caprarescu
|
Nicolo M. Calcavecchia, Bogdan Alexandru Caprarescu, Elisabetta Di
Nitto, Daniel J. Dubois, Dana Petcu
|
DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling
|
Submitted to Springer Computing
| null | null |
Technical Report 2012.5, Politecnico di Milano
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dynamic provisioning of virtualized resources offered by cloud computing
infrastructures allows applications deployed in a cloud environment to
automatically increase and decrease the amount of used resources. This
capability is called auto-scaling and its main purpose is to automatically
adjust the scale of the system that is running the application to satisfy the
varying workload with minimum resource utilization. The need for auto-scaling
is particularly important during workload peaks, in which applications may need
to scale up to extremely large-scale systems.
Both the research community and the main cloud providers have already
developed auto-scaling solutions. However, most research solutions are
centralized and not suitable for managing large-scale systems, moreover cloud
providers' solutions are bound to the limitations of a specific provider in
terms of resource prices, availability, reliability, and connectivity.
In this paper we propose DEPAS, a decentralized probabilistic auto-scaling
algorithm integrated into a P2P architecture that is cloud provider
independent, thus allowing the auto-scaling of services over multiple cloud
infrastructures at the same time. Our simulations, which are based on real
service traces, show that our approach is capable of: (i) keeping the overall
utilization of all the instantiated cloud resources in a target range, (ii)
maintaining service response times close to the ones obtained using optimal
centralized auto-scaling approaches.
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2012 09:26:40 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Calcavecchia",
"Nicolo M.",
""
],
[
"Caprarescu",
"Bogdan Alexandru",
""
],
[
"Di Nitto",
"Elisabetta",
""
],
[
"Dubois",
"Daniel J.",
""
],
[
"Petcu",
"Dana",
""
]
] |
new_dataset
| 0.991954 |
1202.2573
|
Ciprian Dobre
|
Ciprian Dobre, George Cristian Tudor
|
Mobile Advertisement in Vehicular Ad-Hoc Networks
|
Please cite this as "Ciprian Dobre, George Cristian Tudor, Mobile
Advertisement in Vehicular Ad-Hoc Networks, in Proc. of 16th Annual
Conference on Web Technology, New Media, Communications and Telematics
Theory, Methods, Tools and Applications (Euromedia'2011), London, UK, 2011,
pp. 43-49, ISBN: 978-90-77381-61-7, EUROSIS-ETI"
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Advertisement is a location-aware dissemination solution built on top
of a vehicular ad-hoc network. We envision a network of WiFi access points that
dynamically disseminate data to clients running on the car's smart device. The
approach can be considered an alternative to the static advertisement
billboards and can be useful to business companies wanting to dynamically
advertise their products and offers to people driving their car. The clients
can subscribe to information based on specific topics. We present design
solutions that use access points as emitters for transmitting messages to
wireless-enabled devices equipped on vehicles. We also present implementation
details for the evaluation of the proposed solution using a simulator designed
for VANET application. The results show that the application can be used for
transferring a significant amount of data even under difficult conditions, such
as when cars are moving at increased speeds, or the congested Wi-Fi network
causes significant packet loss.
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2012 21:11:40 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Dobre",
"Ciprian",
""
],
[
"Tudor",
"George Cristian",
""
]
] |
new_dataset
| 0.988194 |
1202.2736
|
Andr\'e Gaul
|
Andr\'e Gaul
|
Function call overhead benchmarks with MATLAB, Octave, Python, Cython
and C
|
The benchmark's source code is available under GPL3 at
https://bitbucket.org/andrenarchy/funcall
| null | null | null |
cs.PL cs.MS math.NA
|
http://creativecommons.org/licenses/by/3.0/
|
We consider the overhead of function calls in the programming languages
MATLAB/Octave, Python, Cython and C. In many applications a function has to be
called very often inside a loop. One such application in numerical analysis is
the finite element method where integrals have to be computed on each element
in a loop. The called functions can often be evaluated efficiently but the
function call itself may be time-consuming. We present a benchmark whose goal
is to identify and quantify optimization potentials with respect to time
consumption caused by function calls in the mentioned programming languages.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2012 14:14:00 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Gaul",
"André",
""
]
] |
new_dataset
| 0.999269 |
1202.2774
|
Marc Vuffray
|
Nicolas Macris and Marc Vuffray
|
Beyond the Bethe Free Energy of LDPC Codes via Polymer Expansions
| null | null | null | null |
cs.IT cond-mat.stat-mech math-ph math.IT math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The loop series provides a formal way to write down corrections to the Bethe
entropy (and/or free energy) of graphical models. We provide methods to
rigorously control such expansions for low-density parity-check codes used over
a highly noisy binary symmetric channel. We prove that in the asymptotic limit
of large size, with high probability, the Bethe expression gives an exact
formula for the entropy (per bit) of the input word conditioned on the output
of the channel. Our methods also apply to more general models.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2012 15:58:26 GMT"
}
] | 2012-02-14T00:00:00 |
[
[
"Macris",
"Nicolas",
""
],
[
"Vuffray",
"Marc",
""
]
] |
new_dataset
| 0.994244 |
1202.2153
|
Everthon Valadao
|
Everthon Valadao, Dorgival Guedes, Ricardo Duarte
|
Caracteriza\c{c}\~ao de tempos de ida-e-volta na Internet
| null |
Revista Brasileira de Redes de Computadores e Sistemas
Distribu\'idos, v. 3, p. 21-34, 2010
| null | null |
cs.NI cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Round-trip times (RTTs) are an important metric for the operation of many
applications in the Internet. For instance, they are taken into account when
choosing servers or peers in streaming systems, and they impact the operation
of fault detectors and congestion control algorithms. Therefore, detailed
knowledge about RTTs is important for application and protocol developers. In
this work we present results on measuring RTTs between 81 PlanetLab nodes every
ten seconds, for ten days. The resulting dataset has over 550 million
measurements. Our analysis gives us a profile of delays in the network and
identifies a Gamma distribution as the model that best fits our data. The
average times observed are below 500 ms in more than 99% of the pairs, but
there is significant variation, not only when we compare different pairs of
hosts during the experiment, but also considering any given pair of hosts over
time. By using a clustering technique, we observe that links can be divided in
five distinct groups based on the distribution of RTTs over time and the losses
observed, ranging from groups of near, well-connected pairs, to groups of
distant hosts, with lower quality links between them.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 23:50:42 GMT"
}
] | 2012-02-13T00:00:00 |
[
[
"Valadao",
"Everthon",
""
],
[
"Guedes",
"Dorgival",
""
],
[
"Duarte",
"Ricardo",
""
]
] |
new_dataset
| 0.999523 |
1202.2171
|
Raghav Sampangi
|
Raghav V. Sampangi, Saurabh Dey, Shalini R. Urs and Srinivas Sampalli
|
A security suite for wireless body area networks
|
20 pages, 10 figures, 3 tables, International Journal of Network
Security & its Applications (IJNSA)
|
International Journal of Network Security & its Applications
(IJNSA) 4(1) (2012) 97-116
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Body Area Networks (WBANs) have gained a lot of research attention
in recent years since they offer tremendous benefits for remote health
monitoring and continuous, real-time patient care. However, as with any
wireless communication, data security in WBANs is a challenging design issue.
Since such networks consist of small sensors placed on the human body, they
impose resource and computational restrictions, thereby making the use of
sophisticated and advanced encryption algorithms infeasible. This calls for the
design of algorithms with a robust key generation / management scheme, which
are reasonably resource optimal. This paper presents a security suite for
WBANs, comprised of IAMKeys, an independent and adaptive key management scheme
for improving the security of WBANs, and KEMESIS, a key management scheme for
security in inter-sensor communication. The novelty of these schemes lies in
the use of a randomly generated key for encrypting each data frame that is
generated independently at both the sender and the receiver, eliminating the
need for any key exchange. The simplicity of the encryption scheme, combined
with the adaptability in key management makes the schemes simple, yet secure.
The proposed algorithms are validated by performance analysis.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2012 03:18:48 GMT"
}
] | 2012-02-13T00:00:00 |
[
[
"Sampangi",
"Raghav V.",
""
],
[
"Dey",
"Saurabh",
""
],
[
"Urs",
"Shalini R.",
""
],
[
"Sampalli",
"Srinivas",
""
]
] |
new_dataset
| 0.989719 |
1002.0097
|
Ali Kakhbod
|
Ali Kakhbod and Morteza Zadimoghaddam
|
On the Construction of Prefix-Free and Fix-Free Codes with Specified
Codeword Compositions
| null |
Discrete Applied Mathematics (DAM). vol. 159, no. 18, pp
2269-2275, 2011
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the construction of prefix-free and fix-free codes with
specified codeword compositions. We present a polynomial time algorithm which
constructs a fix-free code with the same codeword compositions as a given code
for a special class of codes called distinct codes. We consider the
construction of optimal fix-free codes which minimizes the average codeword
cost for general letter costs with uniform distribution of the codewords and
present an approximation algorithm to find a near optimal fix-free code with a
given constant cost.
|
[
{
"version": "v1",
"created": "Sat, 30 Jan 2010 23:31:07 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Dec 2010 02:44:03 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Jun 2011 04:50:47 GMT"
},
{
"version": "v4",
"created": "Fri, 15 Jul 2011 04:05:00 GMT"
},
{
"version": "v5",
"created": "Thu, 9 Feb 2012 05:39:23 GMT"
}
] | 2012-02-10T00:00:00 |
[
[
"Kakhbod",
"Ali",
""
],
[
"Zadimoghaddam",
"Morteza",
""
]
] |
new_dataset
| 0.999701 |
1110.5712
|
Loet Leydesdorff
|
Loet Leydesdorff and Lutz Bornmann
|
Mapping (USPTO) Patent Data using Overlays to Google Maps
|
Journal of the American Society for Information Science and
Technology (in press)
| null | null | null |
cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A technique is developed using patent information available online (at the US
Patent and Trademark Office) for the generation of Google Maps. The overlays
indicate both the quantity and quality of patents at the city level. This
information is relevant for research questions in technology analysis,
innovation studies and evolutionary economics, as well as economic geography.
The resulting maps can also be relevant for technological innovation policies
and R&D management, because the US market can be considered the leading market
for patenting and patent competition. In addition to the maps, the routines
provide quantitative data about the patents for statistical analysis. The
cities on the map are colored according to the results of significance tests.
The overlays are explored for the Netherlands as a "national system of
innovations," and further elaborated in two cases of emerging technologies:
"RNA interference" and "nanotechnology."
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2011 06:55:24 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jan 2012 09:01:23 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Feb 2012 08:59:01 GMT"
}
] | 2012-02-10T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Bornmann",
"Lutz",
""
]
] |
new_dataset
| 0.99893 |
1202.1925
|
Matthias F\"ugger
|
Danny Dolev, Matthias F\"ugger, Christoph Lenzen, Markus Posch, Ulrich
Schmid, Andreas Steininger
|
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for
SoCs
|
arXiv admin note: significant text overlap with arXiv:1105.4780
| null | null | null |
cs.DC cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present concept and implementation of a self-stabilizing Byzantine
fault-tolerant distributed clock generation scheme for multi-synchronous GALS
architectures in critical applications. It combines a variant of a recently
introduced self-stabilizing algorithm for generating low-frequency,
low-accuracy synchronized pulses with a simple non-stabilizing high-frequency,
high-accuracy clock synchronization algorithm. We provide thorough correctness
proofs and a performance analysis, which use methods from fault-tolerant
distributed computing research but also addresses hardware-related issues like
metastability. The algorithm, which consists of several concurrent
communicating asynchronous state machines, has been implemented in VHDL using
Petrify in conjunction with some extensions, and synthetisized for an Altera
Cyclone FPGA. An experimental validation of this prototype has been carried out
to confirm the skew and clock frequency bounds predicted by the theoretical
analysis, as well as the very short stabilization times (required for
recovering after excessively many transient failures) achievable in practice.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 09:30:32 GMT"
}
] | 2012-02-10T00:00:00 |
[
[
"Dolev",
"Danny",
""
],
[
"Függer",
"Matthias",
""
],
[
"Lenzen",
"Christoph",
""
],
[
"Posch",
"Markus",
""
],
[
"Schmid",
"Ulrich",
""
],
[
"Steininger",
"Andreas",
""
]
] |
new_dataset
| 0.998152 |
1202.1953
|
Murtaza Hussain Shaikh
|
Murtaza Hussain Shaikh
|
Arduino Tool: For Interactive Artwork Installations
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of the digital media and computational tools has widened the
doors for creativity. The cutting edge in the digital arts and role of new
technologies can be explored for the possible creativity. This gives an
opportunity to involve arts with technologies to make creative works. The
interactive artworks are often installed in the places where multiple people
can interact with the installation, which allows the art to achieve its purpose
by allowing the people to observe and involve with the installation. The level
of engagement of the audience depends on the various factors such as aesthetic
satisfaction, how the audience constructs meaning, pleasure and enjoyment. The
method to evaluate these experiences is challenging as it depends on
integration between the artificial life and real life by means of human
computer interaction. This research investigates "How Adriano fits for creative
and interactive artwork installations?" using an artwork installation in the
campus of NTNU (Norwegian University of Science & Technology). The main focus
of this investigation has been to get an overview on the intersection between
information technology and Arts. This gives an opportunity to understand
various attributes like creativity, cooperation and openness of processes
influencing the creative Artworks. The artwork is combination of Adriano and
other auxiliary components such as sensors, LED's and speakers.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 11:12:09 GMT"
}
] | 2012-02-10T00:00:00 |
[
[
"Shaikh",
"Murtaza Hussain",
""
]
] |
new_dataset
| 0.999717 |
1202.1664
|
Sridhar Subramanian
|
Sridhar Subramanian and Baskaran Ramachandran
|
Trust Based Scheme for QoS Assurance in Mobile Ad-Hoc Networks
| null | null |
10.5121/ijnsa.2012.4108
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mobile ad-hoc network (MANET) is a peer-to-peer wireless network where
nodes can communicate with each other without the use of infrastructure such as
access points or base stations. These networks are self-configuring, capable of
self-directed operation and hastily deployable. Nodes cooperate to provide
connectivity, operates without centralized administration. Nodes are itinerant,
topology can be very dynamic and nodes must be able to relay traffic since
communicating nodes might be out of range. The dynamic nature of MANET makes
network open to attacks and unreliability. Routing is always the most
significant part for any networks. Each node should not only work for itself,
but should be cooperative with other nodes. Node misbehaviour due to selfish or
malicious intention could significantly degrade the performance of MANET. The
Qos parameters like PDR, throughput and delay are affected directly due to such
misbehaving nodes. We focus on trust management framework, which is intended to
cope with misbehaviour problem of node and increase the performance of MANETs.
A trust-based system can be used to track this misbehaving of nodes, spot them
and isolate them from routing and provide reliability. In this paper a Trust
Based Reliable AODV [TBRAODV] protocol is presented which implements a trust
value for each node. For every node trust value is calculated and based trust
value nodes are allowed to participate in routing or else identified to become
a misbehaving node. This enhances reliability in AODV routing and results in
increase of PDR, decrease in delay and throughput is maintained. This work is
implemented and simulated on NS-2. Based on simulation results, the proposed
protocol provides more consistent and reliable data transfer compared with
general AODV, if there are misbehaving nodes in the MANET
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2012 11:38:47 GMT"
}
] | 2012-02-09T00:00:00 |
[
[
"Subramanian",
"Sridhar",
""
],
[
"Ramachandran",
"Baskaran",
""
]
] |
new_dataset
| 0.993955 |
1202.1680
|
Deepali Kadam
|
D. D. Kadam Patil and R. K. Shastri (Department of E&TC Vidya
Pratishthan's CoE, Baramati, Maharashtra, India)
|
Design of wireless electronic stethoscope based on zigbee
|
9 pages,7 figures, IJDPS journal; Published in journl IJDPS,January
2012 issue
| null |
10.5121/ijdps.2012.3130
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Heart sound stethoscope is primary stage to access diseases. In this paper
design of an electronic stethoscope with the functions of wireless transmission
is discussed. This electronic stethoscope based on embedded processor. The data
can be transmitted through wireless transmission using Zigbee module. A
microphone is used to pick up the sound of the heart beat. Acoustic stethoscope
can be changed into a digital stethoscope by inserting an electric capacity
microphone into its head. The signal is processed and amplified to play with or
without earphone. Heart sounds are processed, sampled and sent wirelessly using
Zigbee module so that multiple doctors can do auscultation. PC connectivity is
provided through serial port where from audio and video can be made available
through LAN and internet for telemedicine consultation. Heart beat signals are
sensed, sent, displayed, monitored, stored, reviewed, and analysed with ease.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2012 12:51:58 GMT"
}
] | 2012-02-09T00:00:00 |
[
[
"Patil",
"D. D. Kadam",
"",
"Department of E&TC Vidya\n Pratishthan's CoE, Baramati, Maharashtra, India"
],
[
"Shastri",
"R. K.",
"",
"Department of E&TC Vidya\n Pratishthan's CoE, Baramati, Maharashtra, India"
]
] |
new_dataset
| 0.996526 |
1202.1683
|
Emi Mathews
|
Emi Mathews and Ciby Mathew
|
Deployment of mobile routers ensuring coverage and connectivity
|
International Journal of Computer Networks & Communications (IJCNC)
| null | null | null |
cs.RO cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Maintaining connectivity among a group of autonomous agents exploring an area
is very important, as it promotes cooperation between the agents and also helps
message exchanges which are very critical for their mission. Creating an
underlying Ad-hoc Mobile Router Network (AMRoNet) using simple robotic routers
is an approach that facilitates communication between the agents without
restricting their movements. We address the following question in our paper:
How to create an AMRoNet with local information and with minimum number of
routers? We propose two new localized and distributed algorithms 1)
agent-assisted router deployment and 2) a self-spreading for creating AMRoNet.
The algorithms use a greedy deployment strategy for deploying routers
effectively into the area maximizing coverage and a triangular deployment
strategy to connect different connected component of routers from different
base stations. Empirical analysis shows that the proposed algorithms are the
two best localized approaches to create AMRoNets.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2012 12:55:51 GMT"
}
] | 2012-02-09T00:00:00 |
[
[
"Mathews",
"Emi",
""
],
[
"Mathew",
"Ciby",
""
]
] |
new_dataset
| 0.993945 |
1201.1449
|
Yaser Sadra
|
Sodeif Ahadpour, Yaser Sadra, Zahra ArastehFard
|
A Novel Chaotic Encryption Scheme based on Pseudorandom Bit Padding
|
8 pages, 5 figures, Published in IJCSI International Journal of
Computer Science Issues (January 2012)
|
IJCSI International Journal of Computer Science Issues, Vol. 9,
Issue 1, No 2, (2012) 449-456
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptography is always very important in data origin authentications, entity
authentication, data integrity and confidentiality. In recent years, a variety
of chaotic cryptographic schemes have been proposed. These schemes have typical
structure which performed the permutation and the diffusion stages,
alternatively. The random number generators are intransitive in cryptographic
schemes and be used in the diffusion functions of the image encryption for
diffused pixels of plain image. In this paper, we propose a chaotic encryption
scheme based on pseudorandom bit padding that the bits be generated by a novel
logistic pseudorandom image algorithm. To evaluate the security of the cipher
image of this scheme, the key space analysis, the correlation of two adjacent
pixels and differential attack were performed. This scheme tries to improve the
problem of failure of encryption such as small key space and level of security.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2012 16:41:46 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2012 18:31:50 GMT"
}
] | 2012-02-08T00:00:00 |
[
[
"Ahadpour",
"Sodeif",
""
],
[
"Sadra",
"Yaser",
""
],
[
"ArastehFard",
"Zahra",
""
]
] |
new_dataset
| 0.998612 |
1202.0569
|
Alexander Souza
|
Alexander Souza
|
A Constructive Proof of the Cycle Double Cover Conjecture
|
Due to a flaw in Lemma 9, the paper has been withdrawn
| null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cycle double cover conjecture states that a graph is bridge-free if and
only if there is a family of edge-simple cycles such that each edge is
contained in exactly two of them. It was formulated independently by Szekeres
(1973) and Seymour (1979). In this paper, we settle the conjecture in the
affirmative. In particular, we give an algorithm, which inductively constructs
a cycle double cover in polynomial time.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2012 21:47:55 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2012 10:43:09 GMT"
}
] | 2012-02-08T00:00:00 |
[
[
"Souza",
"Alexander",
""
]
] |
new_dataset
| 0.981782 |
1202.1449
|
Ansuman Adhikary Ansuman Adhikary
|
Ansuman Adhikary and Giuseppe Caire
|
On the Coexistence of Macrocell Spatial Multiplexing and Cognitive
Femtocells
|
Submitted to the 1st International Workshop on Small Cell Wireless
Networks (SmallNets), ICC 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a two-tier macrocell/femtocell system where the macrocell base
station is equipped with multiple antennas and makes use of multiuser MIMO
(spatial multiplexing), and the femtocells are "cognitive". In particular, we
assume that the femtocells are aware of the locations of scheduled macrocell
users on every time-frequency slot, so that they can make decisions on their
transmission opportunities accordingly. Femtocell base stations are also
equipped with multiple antennas. We propose a scheme where the macrocell
downlink (macro- DL) is aligned with the femtocells uplink (femto-UL) and, Vice
Versa, the macrocell uplink (macro-UL) is aligned with the femtocells downlink
femto-DL). Using a simple "interference temperature" power control in the
macro-DL/femto-UL direction, and exploiting uplink/downlink duality and the
Yates, Foschini and Miljanic distributed power control algorithm in the macro-
UL/femto-DL direction, we can achieve an extremely attractive macro/femto
throughput tradeoff region in both directions. We investigate the impact of
multiuser MIMO spatial multiplexing in the macrocell under the proposed scheme,
and find that large gains are achievable by letting the macrocell schedule
groups of co-located users, such that the number of femtocells affected by the
interference temperature power constraint is small.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2012 15:45:58 GMT"
}
] | 2012-02-08T00:00:00 |
[
[
"Adhikary",
"Ansuman",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.994694 |
0807.0199
|
Thomas Unger
|
Thomas Unger and Nadya Markin
|
Quadratic Forms and Space-Time Block Codes from Generalized Quaternion
and Biquaternion Algebras
|
8 pages, final version
|
IEEE Trans. Inform. Theory 57 (2011), no. 9, 6148-6156
|
10.1109/TIT.2011.2161909
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the context of space-time block codes (STBCs), the theory of generalized
quaternion and biquaternion algebras (i.e., tensor products of two quaternion
algebras) over arbitrary base fields is presented, as well as quadratic form
theoretic criteria to check if such algebras are division algebras. For base
fields relevant to STBCs, these criteria are exploited, via Springer's theorem,
to construct several explicit infinite families of (bi-)quaternion division
algebras. These are used to obtain new $2\x 2$ and $4\x 4$ STBCs.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2008 17:41:49 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Jun 2010 18:41:29 GMT"
},
{
"version": "v3",
"created": "Sun, 31 Oct 2010 17:57:06 GMT"
},
{
"version": "v4",
"created": "Mon, 11 Apr 2011 16:53:54 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Unger",
"Thomas",
""
],
[
"Markin",
"Nadya",
""
]
] |
new_dataset
| 0.989118 |
0902.4246
|
Oleg Kurmaev
|
Oleg Kurmaev
|
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
|
29 pages, submitted to IEEE Transactions on Information Theory. This
paper is a corrected version of a paper with the same title that appeared on
the arXiv in Feb. 2009. The major change is in Section VI, in which
Subsection D is now well defined
| null |
10.1109/TIT.2011.2145490
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constant-weight and constant-charge binary sequences with constrained run
length of zeros are introduced. For these sequences, the weight and the charge
distribution are found. Then, recurrent and direct formulas for calculating the
number of these sequences are obtained. With considering these numbers of
constant-weight and constant-charge RLL sequences as coefficients of convergent
power series, generating functions are derived. The fact, that generating
function for enumerating constant-charge RLL sequences does not have a closed
form, is proved. Implementation of encoding and decoding procedures using
Cover's enumerative scheme is shown. On the base of obtained results, some
examples, such as enumeration of running-digital-sum (RDS) constrained RLL
sequences or peak-shifts control capability are also provided.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2009 21:33:58 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2009 19:16:47 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Kurmaev",
"Oleg",
""
]
] |
new_dataset
| 0.999452 |
1109.4770
|
Jens Zumbr\"agel
|
Marcus Greferath and Jens Zumbr\"agel
|
On the algebraic representation of selected optimal non-linear binary
codes
|
5 pages
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Revisiting an approach by Conway and Sloane we investigate a collection of
optimal non-linear binary codes and represent them as (non-linear) codes over
Z4. The Fourier transform will be used in order to analyze these codes, which
leads to a new algebraic representation involving subgroups of the group of
units in a certain ring.
One of our results is a new representation of Best's (10, 40, 4) code as a
coset of a subgroup in the group of invertible elements of the group ring
Z4[Z5]. This yields a particularly simple algebraic decoding algorithm for this
code.
The technique at hand is further applied to analyze Julin's (12, 144, 4) code
and the (12, 24, 12) Hadamard code. It can also be used in order to construct a
(non-optimal) binary (14, 56, 6) code.
|
[
{
"version": "v1",
"created": "Thu, 22 Sep 2011 11:03:51 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Feb 2012 15:44:11 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Greferath",
"Marcus",
""
],
[
"Zumbrägel",
"Jens",
""
]
] |
new_dataset
| 0.994132 |
1202.0919
|
Wenbing Dang
|
Wenbing Dang, Ali Pezeshki, Stephen Howard, William Moran, and Robert
Calderbank
|
Coordinating Complementary Waveforms for Sidelobe Suppression
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general method for constructing radar transmit pulse trains and
receive filters for which the radar point-spread function in delay and Doppler,
given by the cross-ambiguity function of the transmit pulse train and the pulse
train used in the receive filter, is essentially free of range sidelobes inside
a Doppler interval around the zero-Doppler axis. The transmit pulse train is
constructed by coordinating the transmission of a pair of Golay complementary
waveforms across time according to zeros and ones in a binary sequence P. The
pulse train used to filter the received signal is constructed in a similar way,
in terms of sequencing the Golay waveforms, but each waveform in the pulse
train is weighted by an element from another sequence Q. We show that a
spectrum jointly determined by P and Q sequences controls the size of the range
sidelobes of the cross-ambiguity function and by properly choosing P and Q we
can clear out the range sidelobes inside a Doppler interval around the zero-
Doppler axis. The joint design of P and Q enables a tradeoff between the order
of the spectral null for range sidelobe suppression and the signal-to-noise
ratio at the receiver output. We establish this trade-off and derive a
necessary and sufficient condition for the construction of P and Q sequences
that produce a null of a desired order.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2012 20:17:10 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Dang",
"Wenbing",
""
],
[
"Pezeshki",
"Ali",
""
],
[
"Howard",
"Stephen",
""
],
[
"Moran",
"William",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.999705 |
1202.1041
|
Ton Kloks
|
Ton Kloks
|
Packing interval graphs with vertex-disjoint triangles
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that there exists a polynomial algorithm to pack interval graphs with
vertex-disjoint triangles.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2012 03:36:23 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Kloks",
"Ton",
""
]
] |
new_dataset
| 0.977696 |
1202.1100
|
\"Omer Bulakci
|
Omer Bulakci
|
Wavelets for Single Carrier Communications
|
This work was presented as a part of Postgraduate Seminar Course:
Wavelets in Communications, Aalto University School of Electrical
Engineering, February 2, 2011. Three-page report followed by a presentation
file. Seminar contribution
| null | null | null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper and the following presentation aim to provide a report regarding
the seminar presentation given on 23.02.2011 as a part of the postgraduate
seminar course S-88.4223 Wavelets in Communications lectured by Dr. Sumesh
Parameswaran at Aalto University School of Electrical Engineering. In
particular, the topic on "wavelets for single carrier communications" has been
considered herein. Furthermore, a summary of wavelets in Single Carrier
(SC)-FDMA Systems is as well provided.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2012 11:01:25 GMT"
}
] | 2012-02-07T00:00:00 |
[
[
"Bulakci",
"Omer",
""
]
] |
new_dataset
| 0.999356 |
1202.0582
|
Ghazale Hosseinabadi
|
Ghazale Hosseinabadi and Nitin Vaidya
|
Token-DCF: An Opportunistic MAC protocol for Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.11 DCF is the MAC protocol currently used in wireless LANs. 802.11
DCF is inefficient due to two types of overhead; channel idle time and
collision time. This paper presents the design and performance evaluation of an
efficient MAC protocol for wireless networks, called Token-DCF. Token-DCF
decreases both idle time and collision time. In Token-DCF, each station keeps
track of neighboring links' queue length by overhearing of transmitted packets
on the wireless medium. The result is then used to assign privileges to the
network stations. A privileged station does not follow the backoff mechanism
and transmits immediately after the channel is sensed idle. Our simulation
results show that Token-DCF can significantly improve channel utilization,
system throughput and channel access delay over 802.11 DCF.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2012 23:37:03 GMT"
}
] | 2012-02-06T00:00:00 |
[
[
"Hosseinabadi",
"Ghazale",
""
],
[
"Vaidya",
"Nitin",
""
]
] |
new_dataset
| 0.999602 |
1202.0598
|
Paul E. Gunnells
|
Dorian Goldfeld and Paul E. Gunnells
|
Defeating the Kalka--Teicher--Tsaban linear algebra attack on the
Algebraic Eraser
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Algebraic Eraser (AE) is a public key protocol for sharing information
over an insecure channel using commutative and noncommutative groups; a
concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP).
In this paper, we describe how to choose data in CBKAP to thwart an attack by
Kalka--Teicher--Tsaban.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2012 02:42:26 GMT"
}
] | 2012-02-06T00:00:00 |
[
[
"Goldfeld",
"Dorian",
""
],
[
"Gunnells",
"Paul E.",
""
]
] |
new_dataset
| 0.984821 |
1202.0788
|
Marek Trt\'ik
|
Jan Obdr\v{z}\'alek, Ji\v{r}\'i Slab\'y and Marek Trt\'ik
|
STANSE: Bug-finding Framework for C Programs
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
STANSE is a free (available under the GPLv2 license) modular framework for
finding bugs in C programs using static analysis. Its two main design goals are
1) ability to process large software projects like the Linux kernel and 2)
extensibility with new bug-finding techniques with a minimal effort. Currently
there are four bug-finding algorithms implemented within STANSE:
AutomatonChecker checks properties described in an automata-based formalism,
ThreadChecker detects deadlocks among multiple threads, LockChecker finds
locking errors based on statistics, and ReachabilityChecker looks for
unreachable code. STANSE has been tested on the Linux kernel, where it has
found dozens of previously undiscovered bugs.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2012 17:47:27 GMT"
}
] | 2012-02-06T00:00:00 |
[
[
"Obdržálek",
"Jan",
""
],
[
"Slabý",
"Jiří",
""
],
[
"Trtík",
"Marek",
""
]
] |
new_dataset
| 0.955017 |
1007.2170
|
Thomas Rothvoss
|
Friedrich Eisenbrand, D\"om\"ot\"or P\'alv\"olgyi, Thomas Rothvo{\ss}
|
Bin Packing via Discrepancy of Permutations
|
Journal version of SODA'11 paper
| null | null | null |
cs.DM math.CO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A well studied special case of bin packing is the 3-partition problem, where
n items of size > 1/4 have to be packed in a minimum number of bins of capacity
one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a
suitable LP relaxation for this problem into an integral solution that requires
at most O(log n) additional bins.
The three-permutations-problem of Beck is the following. Given any 3
permutations on n symbols, color the symbols red and blue, such that in any
interval of any of those permutations, the number of red and blue symbols is
roughly the same. The necessary difference is called the discrepancy.
We establish a surprising connection between bin packing and Beck's problem:
The additive integrality gap of the 3-partition linear programming relaxation
can be bounded by the discrepancy of 3 permutations.
Reversely, making use of a recent example of 3 permutations, for which a
discrepancy of Omega(log n) is necessary, we prove the following: The O(log^2
n) upper bound on the additive gap for bin packing with arbitrary item sizes
cannot be improved by any technique that is based on rounding up items. This
lower bound holds for a large class of algorithms including the Karmarkar-Karp
procedure.
|
[
{
"version": "v1",
"created": "Tue, 13 Jul 2010 18:18:32 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Feb 2012 20:28:26 GMT"
}
] | 2012-02-03T00:00:00 |
[
[
"Eisenbrand",
"Friedrich",
""
],
[
"Pálvölgyi",
"Dömötör",
""
],
[
"Rothvoß",
"Thomas",
""
]
] |
new_dataset
| 0.971631 |
0903.1627
|
Fran\c{c}ois Nicolas
|
Julien Cassaigne and Francois Nicolas
|
On the Morse-Hedlund complexity gap
|
7 pages. Not intended to be submitted. New proof of an old result
| null | null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1938, Morse and Hedlund proved that the subword complexity function of an
infinite word is either bounded or at least linearly growing. In 1982,
Ehrenfeucht and Rozenberg proved that this gap property holds for the subword
complexity function of any language. The aim of the present paper is to present
a self-contained, compact proof of Ehrenfeucht and Rozenberg's result.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2009 19:15:38 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2009 12:28:47 GMT"
},
{
"version": "v3",
"created": "Thu, 19 Nov 2009 08:48:08 GMT"
},
{
"version": "v4",
"created": "Fri, 4 Dec 2009 17:25:05 GMT"
},
{
"version": "v5",
"created": "Wed, 1 Feb 2012 18:07:36 GMT"
}
] | 2012-02-02T00:00:00 |
[
[
"Cassaigne",
"Julien",
""
],
[
"Nicolas",
"Francois",
""
]
] |
new_dataset
| 0.995942 |
1112.6256
|
Li Ning Mr.
|
Mingfei Li, Christoffer Ma and Li Ning
|
(1+epsilon)-Distance Oracle for Planar Labeled Graph
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a vertex-labeled graph, each vertex $v$ is attached with a label from a
set of labels. The vertex-label query desires the length of the shortest path
from the given vertex to the set of vertices with the given label. We show how
to construct an oracle if the given graph is planar, such that
$O(\frac{1}{\epsilon}n\log n)$ storing space is needed, and any vertex-label
query could be answered in $O(\frac{1}{\epsilon}\log n\log \rho)$ time with
stretch $1+\epsilon$. $\rho$ is the radius of the given graph, which is half of
the diameter. For the case that $\rho = O(\log n)$, we construct an oracle that
achieves $O(\log n)$ query time, without changing the order of storing space.
|
[
{
"version": "v1",
"created": "Thu, 29 Dec 2011 09:23:49 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jan 2012 13:17:01 GMT"
}
] | 2012-02-01T00:00:00 |
[
[
"Li",
"Mingfei",
""
],
[
"Ma",
"Christoffer",
""
],
[
"Ning",
"Li",
""
]
] |
new_dataset
| 0.999262 |
1201.6421
|
Ton Kloks
|
Ton Kloks
|
The black-and-white coloring problem on permutation graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph G and integers b and w. The black-and-white coloring problem
asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such
that no vertex in B is adjacent to any vertex in W. In this paper we show that
the problem is polynomial when restricted to permutation graphs.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2012 02:40:54 GMT"
}
] | 2012-02-01T00:00:00 |
[
[
"Kloks",
"Ton",
""
]
] |
new_dataset
| 0.997687 |
1201.6533
|
Patrick Sol\'e
|
Adel Alahmadi, Patrick Sol\'e, Houda Sboui, Olfa Yemen
|
Cyclic codes over $M_2(\F_2)$
|
10 pages; submitted
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ring in the title is the first non commutative ring to have been used as
alphabet for block codes. The original motivation was the construction of some
quaternionic modular lattices from codes. The new application is the
construction of space time codes obtained by concatenation from the Golden
code. In this article, we derive structure theorems for cyclic codes over that
ring, and use them to characterize the lengths where self dual cyclic codes
exist. These codes in turn give rise to formally self dual quaternary codes.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2012 13:18:15 GMT"
}
] | 2012-02-01T00:00:00 |
[
[
"Alahmadi",
"Adel",
""
],
[
"Solé",
"Patrick",
""
],
[
"Sboui",
"Houda",
""
],
[
"Yemen",
"Olfa",
""
]
] |
new_dataset
| 0.971184 |
1201.6033
|
Marek Trt\'ik
|
Marek Trt\'ik
|
Compact Symbolic Execution (technical report)
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a generalisation of King's symbolic execution technique called
compact symbolic execution. It is based on a concept of templates: a template
is a declarative parametric description of such a program part, generating
paths in symbolic execution tree with regularities in program states along
them. Typical sources of these paths are program loops and recursive calls.
Using the templates we fold the corresponding paths into single vertices and
therefore considerably reduce size of the tree without loss of any information.
There are even programs for which compact symbolic execution trees are finite
even though the classic symbolic execution trees are infinite.
|
[
{
"version": "v1",
"created": "Sun, 29 Jan 2012 12:51:06 GMT"
}
] | 2012-01-31T00:00:00 |
[
[
"Trtík",
"Marek",
""
]
] |
new_dataset
| 0.999636 |
1201.5729
|
Jean-Marie Vanherpe
|
Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)
|
On Compatible Normal Odd Partitions in Cubic Graphs
|
Accepted for publication in Journal of Graph Theory
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A normal odd partition T of the edges of a cubic graph is a partition into
trails of odd length (no repeated edge) such that each vertex is the end vertex
of exactly one trail of the partition and internal in some trail. For each
vertex v, we can distinguish the edge for which this vertex is pending. Three
normal odd partitions are compatible whenever these distinguished edges are
distinct for each vertex. We examine this notion and show that a cubic 3
edge-colorable graph can always be provided with three compatible normal odd
partitions. The Petersen graph has this property and we can construct other
cubic graphs with chromatic index four with the same property. Finally, we
propose a new conjecture which, if true, would imply the well known Fan and
Raspaud Conjecture
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2012 09:24:05 GMT"
}
] | 2012-01-30T00:00:00 |
[
[
"Fouquet",
"Jean-Luc",
"",
"LIFO"
],
[
"Vanherpe",
"Jean-Marie",
"",
"LIFO"
]
] |
new_dataset
| 0.991965 |
1201.5603
|
Igor Nesiolovskiy
|
Igor Nesiolovskiy, Artem Nesiolovskiy
|
BIN@ERN: Binary-Ternary Compressing Data Coding
|
11 pages, 4 figures
| null | null | null |
cs.IT cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a new method of data encoding which may be used in
various modern digital, computer and telecommunication systems and devices. The
method permits the compression of data for storage or transmission, allowing
the exact original data to be reconstructed without any loss of content. The
method is characterized by the simplicity of implementation, as well as high
speed and compression ratio. The method is based on a unique scheme of
binary-ternary prefix-free encoding of characters of the original data. This
scheme does not require the transmission of the code tables from encoder to
decoder; allows for the linear presentation of the code lists; permits the
usage of computable indexes of the prefix codes in a linear list for decoding;
makes it possible to estimate the compression ratio prior to encoding; makes
the usage of multiplication and division operations, as well as operations with
the floating point unnecessary; proves to be effective for static as well as
adaptive coding; applicable to character sets of any size; allows for repeated
compression to improve the ratio.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2012 18:53:00 GMT"
}
] | 2012-01-27T00:00:00 |
[
[
"Nesiolovskiy",
"Igor",
""
],
[
"Nesiolovskiy",
"Artem",
""
]
] |
new_dataset
| 0.996348 |
1201.5298
|
Karolina So{\l}tys
|
Michael Lampis, Valia Mitsou, and Karolina So{\l}tys
|
Scrabble is PSPACE-Complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study the computational complexity of the game of Scrabble.
We prove the PSPACE-completeness of a derandomized model of the game, answering
an open question of Erik Demaine and Robert Hearn.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2012 15:27:31 GMT"
}
] | 2012-01-26T00:00:00 |
[
[
"Lampis",
"Michael",
""
],
[
"Mitsou",
"Valia",
""
],
[
"Sołtys",
"Karolina",
""
]
] |
new_dataset
| 0.985113 |
1201.5340
|
Marek Szyku{\l}a
|
Marek Szyku{\l}a, Andrzej Kisielewicz
|
Rainbow Induced Subgraphs in Replication Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph $G$ is called a replication graph of a graph $H$ if $G$ is obtained
from $H$ by replacing vertices of $H$ by arbitrary cliques of vertices and then
replacing each edge in $H$ by all the edges between corresponding cligues. For
a given graph $H$ the $\rho_R(H)$ is the minimal number of vertices of a
replication graph $G$ of $H$ such that every proper vertex coloring of $G$
contains a rainbow induced subgraph isomorphic to $H$ having exactly one vertex
in each replication clique of $G$. We prove some bounds for $\rho_R$ for some
classes of graphs and compute some exact values. Also some experimental results
obtained by a computer search are presented and conjectures based on them are
formulated.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2012 18:54:11 GMT"
}
] | 2012-01-26T00:00:00 |
[
[
"Szykuła",
"Marek",
""
],
[
"Kisielewicz",
"Andrzej",
""
]
] |
new_dataset
| 0.95624 |
0912.4613
|
Pedro Arjona-Villica\~na
|
P. David Arjona-Villica\~na, Costas C. Constantinou and Alexander S.
Stepanenko
|
Chain Routing: A new routing framework for the Internet based on
complete orders
|
Submitted to Computer Networks
|
IET Communications 5(16), 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new framework to perform routing at the Autonomous System level is proposed
in this paper. This mechanism, called Chain Routing, uses complete orders as
its main topological unit. Since complete orders are acyclic digraphs that
possess a known topology, it is possible to define an acyclic structure to
route packets between a group of Autonomous Systems. The adoption of complete
orders also allows easy identification and avoidance of persistent route
oscillations, eliminates the possibility of developing transient loops in
paths, and provides a structure that facilitates the implementation of traffic
engineering. Moreover, by combining Chain Routing with other mechanisms that
implement complete orders in time, we suggest that it is possible to design a
new routing protocol which could be more reliable and stable than BGP's current
implementation. Although Chain Routing will require an increase of the message
overhead and greater coordination between network administrators, the rewards
in stability and resilience should more than compensate for this effort.
|
[
{
"version": "v1",
"created": "Wed, 23 Dec 2009 11:35:13 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Apr 2010 04:28:16 GMT"
}
] | 2012-01-25T00:00:00 |
[
[
"Arjona-Villicaña",
"P. David",
""
],
[
"Constantinou",
"Costas C.",
""
],
[
"Stepanenko",
"Alexander S.",
""
]
] |
new_dataset
| 0.992148 |
1107.4965
|
Woomyoung Park
|
Woomyoung Park and Alexander Barg
|
Polar codes for q-ary channels, q=2^r
|
This version appears under a new title. Complete proofs of
polarization have been added. The preliminary draft (v2) was published in
Proc. 49th Allerton Conference, 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study polarization for nonbinary channels with input alphabet of size
q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual
channels that arise in the process of polarization converge to q-ary channels
with capacity 1,2,...,r bits, and that the total transmission rate approaches
the symmetric capacity of the channel. This leads to an explicit transmission
scheme for q-ary channels. The error probability of decoding using successive
cancellation behaves as exp(-N^\alpha), where N is the code length and {\alpha}
is any constant less than 0.5.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2011 14:54:30 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Oct 2011 14:31:48 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Jan 2012 18:10:55 GMT"
}
] | 2012-01-25T00:00:00 |
[
[
"Park",
"Woomyoung",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.997825 |
1201.2074
|
Jan Wr\'obel
|
Jan Wrobel
|
Reflection Scan: an Off-Path Attack on TCP
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper demonstrates how traffic load of a shared packet queue can be
exploited as a side channel through which protected information leaks to an
off-path attacker. The attacker sends to a victim a sequence of identical
spoofed segments. The victim responds to each segment in the sequence (the
sequence is reflected by the victim) if the segments satisfy a certain
condition tested by the attacker. The responses do not reach the attacker
directly, but induce extra load on a routing queue shared between the victim
and the attacker. Increased processing time of packets traversing the queue
reveal that the tested condition was true. The paper concentrates on the TCP,
but the approach is generic and can be effective against other protocols that
allow to construct requests which are conditionally answered by the victim. A
proof of concept was created to assess applicability of the method in real-life
scenarios.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 15:19:38 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Jan 2012 11:16:26 GMT"
}
] | 2012-01-25T00:00:00 |
[
[
"Wrobel",
"Jan",
""
]
] |
new_dataset
| 0.999104 |
1112.0296
|
Omur Ozel
|
Omur Ozel and Sennur Ulukus
|
AWGN Channel under Time-Varying Amplitude Constraints with Causal
Information at the Transmitter
|
Published in Asilomar Conference on Signals, Systems and Computers,
November 2011; Fig. 4 revised
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the classical AWGN channel where the channel input is constrained
to an amplitude constraint that stochastically varies at each channel use,
independent of the message. This is an abstraction of an energy harvesting
transmitter where the code symbol energy at each channel use is determined by
an exogenous energy arrival process and there is no battery for energy storage.
At each channel use, an independent realization of the amplitude constraint
process is observed by the transmitter causally. This scenario is a
state-dependent channel with perfect causal state information at the
transmitter. We derive the capacity of this channel using Shannon's coding
scheme with causal state information. We prove that the code symbols must be
selected from a finite set in the capacity achieving scheme, as in the case of
Smith. We numerically study the binary on-off energy arrivals where the
amplitude constraint is either zero or a non-zero constant.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2011 20:33:17 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jan 2012 19:10:11 GMT"
}
] | 2012-01-24T00:00:00 |
[
[
"Ozel",
"Omur",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.996328 |
1201.4524
|
Vance Faber
|
Vance Faber
|
Livelock free routing schemes
|
5 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a livelock free routing algorithm for any allowed network. Unlike
some other solutions to this problem:
1) packets entering the network have an absolute upper bound on the time to
reach their destination; 2) under light loads, packets are delivered to their
destinations in nearly optimal time; 3) packets with desired paths far away
from congested areas will have routing times far shorter than packets wanting
to access congested areas; 4) if the network becomes congested and later
clears, the network operates just as it would have when it was initially under
a light load.
The main ideas of this note appear in a different form in my 1994 patent
5,369,745. This note adds to those results and makes them more mathematical.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2012 01:58:21 GMT"
}
] | 2012-01-24T00:00:00 |
[
[
"Faber",
"Vance",
""
]
] |
new_dataset
| 0.999342 |
1201.4536
|
Jaydip Sen
|
Jaydip Sen
|
A Multi-Path Certification Protocol for Mobile Ad Hoc Networks
|
4 pages, 6 figures, 4 pages. In Proceedings of the 4th International
Conference on Computers & Devices for Communications (CODEC), December 14 --
16, 2009, Kolkata, India
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mobile ad hoc network (MANET) is a collection of autonomous nodes that
communicate with each other by forming a multi-hop radio network and
maintaining connections in a decentralized manner. Security remains a major
challenge for these networks due to their features of open medium, dynamically
changing topologies, reliance on cooperative algorithms, absence of centralized
monitoring points, and lack of clear lines of defense. Most of the routing
protocols for MANETs are thus vulnerable to various types of attacks. For
security, these protocols are highly dependent on cryptographic key exchange
operations. This paper presents a multi-path certification protocol for
efficient and reliable key exchange among the nodes in a MANET. Simulation
results have shown the effectiveness and efficiency of the protocol.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2012 07:42:13 GMT"
}
] | 2012-01-24T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.982375 |
1201.4553
|
Loet Leydesdorff
|
Loet Leydesdorff
|
The Knowledge-Based Economy and the Triple Helix Model
|
Annual Review of Information Science and Technology 44 (2010)
367-417; preprint version
| null | null | null |
cs.OH physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
1. Introduction - the metaphor of a "knowledge-based economy"; 2. The Triple
Helix as a model of the knowledge-based economy; 3. Knowledge as a social
coordination mechanism; 4. Neo-evolutionary dynamics in a Triple Helix of
coordination mechanism; 5. The operation of the knowledge base; 6. The
restructuring of knowledge production in a KBE; 7. The KBE and the
systems-of-innovation approach; 8. The KBE and neo-evolutionary theories of
innovation; 8.1 The construction of the evolving unit; 8.2 User-producer
relations in systems of innovation; 8.3 'Mode-2' and the production of
scientific knowledge; 8.4 A Triple Helix model of innovations; 9. Empirical
studies and simulations using the TH model; 10. The KBE and the measurement;
10.1 The communication of meaning and information; 10.2 The expectation of
social structure; 10.3 Configurations in a knowledge-based economy
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2012 12:08:58 GMT"
}
] | 2012-01-24T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.998168 |
1201.4719
|
Marek Trt\'ik
|
Ji\v{r}\'i Slab\'y, Jan Strej\v{c}ek, Marek Trt\'ik
|
On Synergy of Metal, Slicing, and Symbolic Execution
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel technique for finding real errors in programs. The
technique is based on a synergy of three well-known methods: metacompilation,
slicing, and symbolic execution. More precisely, we instrument a given program
with a code that tracks runs of state machines representing various kinds of
errors. Next we slice the program to reduce its size without affecting runs of
state machines. And then we symbolically execute the sliced program. Depending
on the kind of symbolic execution, the technique can be applied as a
stand-alone bug finding technique, or to weed out some false positives from an
output of another bug-finding tool. We provide several examples demonstrating
the practical applicability of our technique.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2012 14:06:32 GMT"
}
] | 2012-01-24T00:00:00 |
[
[
"Slabý",
"Jiří",
""
],
[
"Strejček",
"Jan",
""
],
[
"Trtík",
"Marek",
""
]
] |
new_dataset
| 0.966017 |
1201.4301
|
Chitra Kiran N
|
Chitra Kiran N., G. Narendra Kumar
|
A Robust Client Verification in cloud enabled m-Commerce using Gaining
Protocol
| null |
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 6, No 2, November 2011 ISSN (Online): 1694-0814
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proposed system highlights a novel approach of exclusive verification
process using gain protocol for ensuring security among both the parties
(client-service provider) in m-commerce application with cloud enabled service.
The proposed system is based on the potential to verify the clients with
trusted hand held device depending on the set of frequent events and actions to
be carried out. The framework of the proposed work is design after collecting a
real time data sets from an android enabled hand set, which when subjected to
gain protocol, will result in detection of malicious behavior of illegal
clients in the network. The real time experiment is performed with applicable
datasets gather, which show the best result for identifying threats from last 2
months data collected.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2012 14:21:15 GMT"
}
] | 2012-01-23T00:00:00 |
[
[
"N.",
"Chitra Kiran",
""
],
[
"Kumar",
"G. Narendra",
""
]
] |
new_dataset
| 0.988506 |
1201.3950
|
Koulali Mohammed-Amine
|
Mohammed-Amine Koulali, Mohammed El Koutbi, Abdellatif Kobbane and
Mostafa Azizi
|
QGRP: A Novel QoS-Geographic Routing Protocol for Multimedia Wireless
Sensor Networks
|
ISSN (Online): 1694-0814
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 6, No 2, pages 55-61, 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thanks to the potential they hold and the variety of their application
domains, Multimedia Wireless Sensor Networks (MWSN) are forecast to become
highly integrated into our daily activities. Due to the carried content nature,
mainly composed of images and/or video streams with high throughput and delay
constraints, Quality of Service in the context of MWSN is a crucial issue. In
this paper, we propose a QoS and energy aware geographic routing protocol for
MWSN: QGRP. The proposed protocol addresses bandwidth, delay and energy
constraints associated with MWSN. QGRP adopts an analytical model of IEEE
802.11 Distributed Coordination Function (DCF) to estimate available bandwidth
and generates loop-free routing paths.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2012 00:20:48 GMT"
}
] | 2012-01-20T00:00:00 |
[
[
"Koulali",
"Mohammed-Amine",
""
],
[
"Koutbi",
"Mohammed El",
""
],
[
"Kobbane",
"Abdellatif",
""
],
[
"Azizi",
"Mostafa",
""
]
] |
new_dataset
| 0.999367 |
1201.3821
|
Carlos Miravet
|
Carlos Miravet and Francisco B. Rodr\'iguez
|
A PCA-Based Super-Resolution Algorithm for Short Image Sequences
|
4 pages, 4 figures. A version of this work was submitted to ICIP 2010
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel, learning-based, two-step super-resolution
(SR) algorithm well suited to solve the specially demanding problem of
obtaining SR estimates from short image sequences. The first step, devoted to
increase the sampling rate of the incoming images, is performed by fitting
linear combinations of functions generated from principal components (PC) to
reproduce locally the sparse projected image data, and using these models to
estimate image values at nodes of the high-resolution grid. PCs were obtained
from local image patches sampled at sub-pixel level, which were generated in
turn from a database of high-resolution images by application of a physically
realistic observation model. Continuity between local image models is enforced
by minimizing an adequate functional in the space of model coefficients. The
second step, dealing with restoration, is performed by a linear filter with
coefficients learned to restore residual interpolation artifacts in addition to
low-resolution blurring, providing an effective coupling between both steps of
the method. Results on a demanding five-image scanned sequence of graphics and
text are presented, showing the excellent performance of the proposed method
compared to several state-of-the-art two-step and Bayesian Maximum a Posteriori
SR algorithms.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2012 15:19:03 GMT"
}
] | 2012-01-19T00:00:00 |
[
[
"Miravet",
"Carlos",
""
],
[
"Rodríguez",
"Francisco B.",
""
]
] |
new_dataset
| 0.999601 |
1201.0725
|
Manel Khelifi
|
Manel Khelifi, Assia Djabelkhir
|
LMEEC: Layered Multi-Hop Energy Efficient Cluster-based Routing Protocol
for Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we propose LMEEC, a cluster-based routing protocol with low
energy consumption for wireless sensor networks. Our protocol is based on a
strategy which aims to provide a more reasonable exploitation of the selected
nodes (cluster-heads) energy. Simulation results show the effectiveness of
LMEEC in decreasing the energy consumption, and in prolonging the network
lifetime, compared to LEACH.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2012 19:12:46 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Jan 2012 20:28:58 GMT"
}
] | 2012-01-18T00:00:00 |
[
[
"Khelifi",
"Manel",
""
],
[
"Djabelkhir",
"Assia",
""
]
] |
new_dataset
| 0.970236 |
1007.2460
|
Hiroshi Fukuda
|
Hiroshi Fukuda, Chiaki Kanomata, Nobuaki Mutoh, Gisaku Nakamura, Doris
Schattschneider
|
Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings
with Rotational Symmetry
| null |
Symmetry 2011, 3(4), 828-851
|
10.3390/sym3040828
| null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe computer algorithms that produce the complete set of isohedral
tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains
and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups
of such tilings are of types p3, p31m, p4, p4g, and p6. There are no isohedral
tilings with symmetry groups p3m1, p4m, or p6m that have polyominoes or
polyiamonds as fundamental domains. We display the algorithms' output and give
enumeration tables for small values of n. This expands on our earlier works
(Fukuda et al 2006, 2008).
|
[
{
"version": "v1",
"created": "Thu, 15 Jul 2010 01:21:57 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Jun 2011 02:18:59 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Fukuda",
"Hiroshi",
""
],
[
"Kanomata",
"Chiaki",
""
],
[
"Mutoh",
"Nobuaki",
""
],
[
"Nakamura",
"Gisaku",
""
],
[
"Schattschneider",
"Doris",
""
]
] |
new_dataset
| 0.958793 |
1101.4116
|
Riccardo Murri
|
Riccardo Murri, Peter Z. Kunszt, Sergio Maffioletti, Valery Tschopp
|
GridCertLib: a Single Sign-on Solution for Grid Web Applications and
Portals
|
18 pages, 1 figure; final manuscript accepted for publication by the
"Journal of Grid Computing"
| null |
10.1007/s10723-011-9195-y
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the design and implementation of GridCertLib, a Java
library leveraging a Shibboleth-based authentication infrastructure and the
SLCS online certificate signing service, to provide short-lived X.509
certificates and Grid proxies. The main use case envisioned for GridCertLib, is
to provide seamless and secure access to Grid/X.509 certificates and proxies in
web applications and portals: when a user logs in to the portal using
Shibboleth authentication, GridCertLib can automatically obtain a Grid/X.509
certificate from the SLCS service and generate a VOMS proxy from it. We give an
overview of the architecture of GridCertLib and briefly describe its
programming model. Its application to some deployment scenarios is outlined, as
well as a report on practical experience integrating GridCertLib into portals
for Bioinformatics and Computational Chemistry applications, based on the
popular P-GRADE and Django softwares.
|
[
{
"version": "v1",
"created": "Fri, 21 Jan 2011 11:56:07 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2011 15:46:37 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Sep 2011 14:38:56 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Murri",
"Riccardo",
""
],
[
"Kunszt",
"Peter Z.",
""
],
[
"Maffioletti",
"Sergio",
""
],
[
"Tschopp",
"Valery",
""
]
] |
new_dataset
| 0.998491 |
1108.6197
|
Penying Rochanakul
|
Penying Rochanakul
|
Two-Level Fingerprinting Codes: Non-Trivial Constructions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend the concept of two-level fingerprinting codes, introduced by
Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes, to
other types of fingerprinting codes, namely identifiable parent property (IPP)
codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and
propose the first explicit non-trivial construction for two-level IPP, SFP and
FP codes.
|
[
{
"version": "v1",
"created": "Wed, 31 Aug 2011 11:44:08 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Jan 2012 01:47:34 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Rochanakul",
"Penying",
""
]
] |
new_dataset
| 0.999787 |
1201.2905
|
Qiyang Zhao
|
Zhao Qiyang
|
NegCut: Automatic Image Segmentation based on MRF-MAP
|
Since it's an unlucky failure about length-limit violation, I'd like
to save it on arXiv as a record. Any suggestions are welcome
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Solving the Maximum a Posteriori on Markov Random Field, MRF-MAP, is a
prevailing method in recent interactive image segmentation tools. Although
mathematically explicit in its computational targets, and impressive for the
segmentation quality, MRF-MAP is hard to accomplish without the interactive
information from users. So it is rarely adopted in the automatic style up to
today. In this paper, we present an automatic image segmentation algorithm,
NegCut, based on the approximation to MRF-MAP. First we prove MRF-MAP is
NP-hard when the probabilistic models are unknown, and then present an
approximation function in the form of minimum cuts on graphs with negative
weights. Finally, the binary segmentation is taken from the largest eigenvector
of the target matrix, with a tuned version of the Lanczos eigensolver. It is
shown competitive at the segmentation quality in our experiments.
|
[
{
"version": "v1",
"created": "Fri, 13 Jan 2012 18:18:03 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jan 2012 03:28:43 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Qiyang",
"Zhao",
""
]
] |
new_dataset
| 0.987824 |
1201.2980
|
Xuechong Guan
|
Xuechong Guan and Yongming Li
|
Information algebra system of soft sets
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Information algebra is algebraic structure for local computation and
inference. Given an initial universe set and a parameter set, we show that a
soft set system over them is an information algebra. Moreover, in a soft set
system, the family of all soft sets with a finite parameter subset can form a
compact information algebra.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2012 02:51:25 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Guan",
"Xuechong",
""
],
[
"Li",
"Yongming",
""
]
] |
new_dataset
| 0.986746 |
1201.3011
|
Stephen G. Kobourov
|
Stephen G. Kobourov
|
Spring Embedders and Force Directed Graph Drawing Algorithms
|
23 pages, 8 figures
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Force-directed algorithms are among the most flexible methods for calculating
layouts of simple undirected graphs. Also known as spring embedders, such
algorithms calculate the layout of a graph using only information contained
within the structure of the graph itself, rather than relying on
domain-specific knowledge. Graphs drawn with these algorithms tend to be
aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free
layouts for planar graphs. In this survey we consider several classical
algorithms, starting from Tutte's 1963 barycentric method, and including recent
scalable multiscale methods for large and dynamic graphs.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2012 12:49:31 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.967735 |
1201.3077
|
Joseph Gil
|
Joseph Yossi Gil and David Allen Scott
|
A Bijective String Sorting Transform
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a string of characters, the Burrows-Wheeler Transform rearranges the
characters in it so as to produce another string of the same length which is
more amenable to compression techniques such as move to front, run-length
encoding, and entropy encoders. We present a variant of the transform which
gives rise to similar or better compression value, but, unlike the original,
the transform we present is bijective, in that the inverse transformation
exists for all strings. Our experiments indicate that using our variant of the
transform gives rise to better compression ratio than the original
Burrows-Wheeler transform. We also show that both the transform and its inverse
can be computed in linear time and consuming linear storage.
|
[
{
"version": "v1",
"created": "Sun, 15 Jan 2012 10:17:36 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Gil",
"Joseph Yossi",
""
],
[
"Scott",
"David Allen",
""
]
] |
new_dataset
| 0.953184 |
1201.3315
|
Murat Guzeltepe Mr
|
Murat G\"uzeltepe
|
Perfect Mannheim, Lipschitz and Hurwitz weight codes
|
21 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, upper bounds on codes over Gaussian integers, Lipschitz
integers and Hurwitz integers with respect to Mannheim metric, Lipschitz and
Hurwitz metric are given.
|
[
{
"version": "v1",
"created": "Fri, 13 Jan 2012 14:01:56 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Güzeltepe",
"Murat",
""
]
] |
new_dataset
| 0.999231 |
1201.3318
|
Marcin Kik
|
Marcin Kik
|
Notes on Bit-reversal Broadcast Scheduling
| null | null | null | null |
cs.DS cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report contains revision and extension of some results about RBO
[arXiv:1108.5095]. RBO is a simple and efficient broadcast scheduling of $n =
2^k$ uniform frames for battery powered radio receivers. Each frame contains a
key from some arbitrary linearly ordered universe. The broadcast cycle -- a
sequence of frames sorted by the keys and permuted by $k$-bit reversal -- is
transmitted in a round robin fashion by the broadcaster. At arbitrary time
during the transmission, the receiver may start a simple protocol that reports
to him all the frames with the keys that are contained in a specified interval
of the key values $[K', K"]$. RBO receives at most $2 k + 1$ other frames' keys
before receiving the first key from $[K', K"]$ or noticing that there are no
such keys in the broadcast cycle. As a simple corollary, $4 k + 2$ is upper
bound the number of keys outside $[K', K"]$ that will ever be received. In
unreliable network the expected number of efforts to receive such frames is
bounded by $(8 k + 4) / p + 2 (1 - p) / p^2$, where $p$ is probability of
successful reception, and the reception rate of the requested frames is $p$ --
the highest possible. The receiver's protocol state consists of the values $k$,
$K'$ and $K"$, one wake-up timer and two other $k$-bit variables. Its only
nontrivial computation -- the computation of the next wake-up time slot -- can
be performed in $O (k)$ simple operations, such as arithmetic/bit-wise
operations on $k$-bit numbers, using only constant number of $k$-bit variables.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2012 16:56:45 GMT"
}
] | 2012-01-17T00:00:00 |
[
[
"Kik",
"Marcin",
""
]
] |
new_dataset
| 0.989848 |
1003.3754
|
Murat Guzeltepe Mr
|
Murat G\"uzeltepe, Mehmet \"Ozen
|
Quantum codes from codes over Gaussian integers with respect to the
Mannheim metric
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, some nonbinary quantum codes using classical codes over
Gaussian integers are obtained. Also, some of our quantum codes are better than
or comparable with those known before, (for instance [[8; 2; 5]]4+i).
|
[
{
"version": "v1",
"created": "Fri, 19 Mar 2010 09:35:07 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jan 2012 15:52:00 GMT"
}
] | 2012-01-16T00:00:00 |
[
[
"Güzeltepe",
"Murat",
""
],
[
"Özen",
"Mehmet",
""
]
] |
new_dataset
| 0.99986 |
1201.1548
|
Eric Berberich
|
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
|
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
|
46 pages, 4 figures, submitted to Special Issue of TCS on SNC 2011.
arXiv admin note: substantial text overlap with arXiv:1010.1386 and
arXiv:1103.4697
| null | null | null |
cs.CG cs.MS cs.SC math.AG math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel certified and complete algorithm to compute arrangements
of real planar algebraic curves. It provides a geometric-topological analysis
of the decomposition of the plane induced by a finite number of algebraic
curves in terms of a cylindrical algebraic decomposition. From a high-level
perspective, the overall method splits into two main subroutines, namely an
algorithm denoted Bisolve to isolate the real solutions of a zero-dimensional
bivariate system, and an algorithm denoted GeoTop to analyze a single algebraic
curve.
Compared to existing approaches based on elimination techniques, we
considerably improve the corresponding lifting steps in both subroutines. As a
result, generic position of the input system is never assumed, and thus our
algorithm never demands for any change of coordinates. In addition, we
significantly limit the types of involved exact operations, that is, we only
use resultant and gcd computations as purely symbolic operations. The latter
results are achieved by combining techniques from different fields such as
(modular) symbolic computation, numerical analysis and algebraic geometry.
We have implemented our algorithms as prototypical contributions to the
C++-project CGAL. They exploit graphics hardware to expedite the symbolic
computations. We have also compared our implementation with the current
reference implementations, that is, LGP and Maple's Isolate for polynomial
system solving, and CGAL's bivariate algebraic kernel for analyses and
arrangement computations of algebraic curves. For various series of challenging
instances, our exhaustive experiments show that the new implementations
outperform the existing ones.
|
[
{
"version": "v1",
"created": "Sat, 7 Jan 2012 11:57:44 GMT"
}
] | 2012-01-13T00:00:00 |
[
[
"Berberich",
"Eric",
""
],
[
"Emeliyanenko",
"Pavel",
""
],
[
"Kobel",
"Alexander",
""
],
[
"Sagraloff",
"Michael",
""
]
] |
new_dataset
| 0.960951 |
1201.2551
|
Ignaz Rutter
|
Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
|
Fork-forests in bi-colored complete bipartite graphs
|
5 pages, 3 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the problem in [6], which studies the relative efficiency of
propositional proof systems, 2-edge colorings of complete bipartite graphs are
investigated. It is shown that if the edges of $G=K_{n,n}$ are colored with
black and white such that the number of black edges differs from the number of
white edges by at most 1, then there are at least $n(1-1/\sqrt{2})$
vertex-disjoint forks with centers in the same partite set of $G$. Here, a fork
is a graph formed by two adjacent edges of different colors. The bound is
sharp. Moreover, an algorithm running in time $O(n^2 \log n \sqrt{n
\alpha(n^2,n) \log n})$ and giving a largest such fork forest is found.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2012 12:51:45 GMT"
}
] | 2012-01-13T00:00:00 |
[
[
"Axenovich",
"Maria",
""
],
[
"Krug",
"Marcus",
""
],
[
"Osang",
"Georg",
""
],
[
"Rutter",
"Ignaz",
""
]
] |
new_dataset
| 0.972055 |
1201.2578
|
Zhenghao Zhang
|
Shuping Gong, Zhenghao Zhang, Husheng Li and Aleksandar D. Dimitrovski
|
Time Stamp Attack in Smart Grid: Physical Mechanism and Damage Analysis
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many operations in power grids, such as fault detection and event location
estimation, depend on precise timing information. In this paper, a novel time
stamp attack (TSA) is proposed to attack the timing information in smart grid.
Since many applications in smart grid utilize synchronous measurements and most
of the measurement devices are equipped with global positioning system (GPS)
for precise timing, it is highly probable to attack the measurement system by
spoofing the GPS. The effectiveness of TSA is demonstrated for three
applications of phasor measurement unit (PMU) in smart grid, namely
transmission line fault detection, voltage stability monitoring and event
locationing.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2012 14:38:18 GMT"
}
] | 2012-01-13T00:00:00 |
[
[
"Gong",
"Shuping",
""
],
[
"Zhang",
"Zhenghao",
""
],
[
"Li",
"Husheng",
""
],
[
"Dimitrovski",
"Aleksandar D.",
""
]
] |
new_dataset
| 0.998157 |
1201.1954
|
Michael Singer
|
Shaoshi Chen, Manuel Kauers, Michael F. Singer
|
Telescopers for Rational and Algebraic Functions via Residues
| null | null | null | null |
cs.SC math.AG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the problem of constructing telescopers for functions of m
variables is equivalent to the problem of constructing telescopers for
algebraic functions of m -1 variables and present a new algorithm to construct
telescopers for algebraic functions of two variables. These considerations are
based on analyzing the residues of the input. According to experiments, the
resulting algorithm for rational functions of three variables is faster than
known algorithms, at least in some examples of combinatorial interest. The
algorithm for algebraic functions implies a new bound on the order of the
telescopers.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 02:23:14 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Jan 2012 02:54:02 GMT"
}
] | 2012-01-12T00:00:00 |
[
[
"Chen",
"Shaoshi",
""
],
[
"Kauers",
"Manuel",
""
],
[
"Singer",
"Michael F.",
""
]
] |
new_dataset
| 0.995677 |
1201.2240
|
Kamal Sarkar
|
Kamal Sarkar
|
Bengali text summarization by sentence extraction
| null |
Proceedings of International Conference on Business and
Information Management(ICBIM-2012),NIT Durgapur, PP 233-245
| null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text summarization is a process to produce an abstract or a summary by
selecting significant portion of the information from one or more texts. In an
automatic text summarization process, a text is given to the computer and the
computer returns a shorter less redundant extract or abstract of the original
text(s). Many techniques have been developed for summarizing English text(s).
But, a very few attempts have been made for Bengali text summarization. This
paper presents a method for Bengali text summarization which extracts important
sentences from a Bengali document to produce a summary.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2012 04:56:59 GMT"
}
] | 2012-01-12T00:00:00 |
[
[
"Sarkar",
"Kamal",
""
]
] |
new_dataset
| 0.950013 |
1201.2288
|
Vijay Dhir
|
Vijay Dhir, Rattan K. Datta and Maitreyee Dutta
|
Nimble@ITCEcnoGrid: A Grid in Research Domain for Weather Forecasting
|
11 pages
|
International Journal of Grid Computing & Applications (IJGCA)
Vol.2, No.4, December 2011, 37-47
|
10.5121/ijgca.2011.2404
| null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer Technology has Revolutionized Science. This has motivated scientists
to develop mathematical model to simulate salient features of Physical
universe. These models can approximate reality at many levels of scale such as
atomic nucleus, Earth's biosphere & weather/climate assessment. If the computer
power is greater, the greater will be the accuracy in approximation i.e. close
will be the approximation to the reality. The speed of the computer required
for solution of such problems require computers with processing power of
teraflops to Pets flops speed.. The way to speed up the computation is to
"parallelize" it. One of the approach is to use multimillion dollar
Supercomputer or use Computational Grid (which is also called poor man's
supercomputer) having geographically distributed resources e.g. SETI@home (Used
to detect radio waves emitted by intelligent civilizations outside earth) has
4.6 million participants computers. There are many alternatives tools available
to achieve this goal like Globus Toolkit, Entropia, Legion, BOINC etc but they
are mainly based on Linux platform. As majority of the computers available are
windows based, so it will be easy to develop a larger network of computers
which will use the free cycles of the computer to solve the complex problem at
window platform. Nimble@ITCEcnoGrid has been developed. It includes the feature
of Inter Thread Communication which is missing in any of the toolkits
available. Nimble@ITCEcnoGrid Framework (A Fast Grid with Inter-thread
communication with Economic Based Policy) was tested for computation of 'PI' up
to 120 decimal points. Encouraged by the speed the same system has been
utilized to computes the Momentum, Thermodynamics and Continuity equations for
the Weather Forecasting using the Windows based Desktop computers.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2012 12:02:39 GMT"
}
] | 2012-01-12T00:00:00 |
[
[
"Dhir",
"Vijay",
""
],
[
"Datta",
"Rattan K.",
""
],
[
"Dutta",
"Maitreyee",
""
]
] |
new_dataset
| 0.961417 |
1112.2205
|
Paolo Gasti
|
Steven DiBenedetto, Paolo Gasti, Gene Tsudik, Ersin Uzun
|
ANDaNA: Anonymous Named Data Networking Application
|
NDSS 2012 - Proceedings of the Network and Distributed System
Security Symposium, San Diego, California, USA
| null | null | null |
cs.CR cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content-centric networking -- also known as information-centric networking
(ICN) -- shifts emphasis from hosts and interfaces (as in today's Internet) to
data. Named data becomes addressable and routable, while locations that
currently store that data become irrelevant to applications.
Named Data Networking (NDN) is a large collaborative research effort that
exemplifies the content-centric approach to networking. NDN has some innate
privacy-friendly features, such as lack of source and destination addresses on
packets. However, as discussed in this paper, NDN architecture prompts some
privacy concerns mainly stemming from the semantic richness of names. We
examine privacy-relevant characteristics of NDN and present an initial attempt
to achieve communication privacy. Specifically, we design an NDN add-on tool,
called ANDaNA, that borrows a number of features from Tor. As we demonstrate
via experiments, it provides comparable anonymity with lower relative overhead.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2011 20:38:25 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jan 2012 18:40:33 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"DiBenedetto",
"Steven",
""
],
[
"Gasti",
"Paolo",
""
],
[
"Tsudik",
"Gene",
""
],
[
"Uzun",
"Ersin",
""
]
] |
new_dataset
| 0.999084 |
1201.1966
|
Manoj Kumar Taleja
|
Manoj Kumar, Sandeep K. Arya and Sujata Pandey
|
Single bit full adder design using 8 transistors with novel 3
transistors XNOR gate
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In present work a new XNOR gate using three transistors has been presented,
which shows power dissipation of 550.7272$\mu$W in 0.35$\mu$m technology with
supply voltage of 3.3V. Minimum level for high output of 2.05V and maximum
level for low output of 0.084V have been obtained. A single bit full adder
using eight transistors has been designed using proposed XNOR cell, which shows
power dissipation of 581.542$\mu$W. Minimum level for high output of 1.97V and
maximum level for low output of 0.24V is obtained for sum output signal. For
carry signal maximum level for low output of 0.32V and minimum level for high
output of 3.2V have been achieved. Simulations have been performed by using
SPICE based on TSMC 0.35$\mu$m CMOS technology. Power consumption of proposed
XNOR gate and full adder has been compared with earlier reported circuits and
proposed circuit's shows better performance in terms of power consumption and
transistor count.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 05:15:25 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Kumar",
"Manoj",
""
],
[
"Arya",
"Sandeep K.",
""
],
[
"Pandey",
"Sujata",
""
]
] |
new_dataset
| 0.97991 |
1201.1970
|
Neha Gupta Ms
|
Neha Gupta, Sapna Singh, Meenakshi Suthar, Priyanka Soni
|
Low Power Low Voltage Bulk Driven Balanced OTA
|
International Journal of VLSI design & Communication Systems (VLSICS)
Vol.2, No.4, December 2011, 131-141
| null |
10.5121/vlsic.2011.2411
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The last few decades, a great deal of attention has been paid to low-voltage
(LV) low-power (LP) integrated circuits design since the power consumption has
become a critical issue. Among many techniques used for the design of LV LP
analog circuits, the Bulk-driven principle offers a promising route towards
this design for many aspects mainly the simplicity and using the conventional
MOS technology to implement these designs. This paper is devoted to the
Bulk-driven (BD) principle and utilizing this principle to design LV LP
building block of Operational Transconductance Amplifier (OTA) in standard CMOS
processes and supply voltage 0.9V. The simulation results have been carried out
by the Spice simulator using the 130nm CMOS technology from TSMC.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 06:03:12 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Gupta",
"Neha",
""
],
[
"Singh",
"Sapna",
""
],
[
"Suthar",
"Meenakshi",
""
],
[
"Soni",
"Priyanka",
""
]
] |
new_dataset
| 0.987438 |
1201.2000
|
Ondrej Moris
|
Petr Hlineny, Ondrej Moris
|
Dynamic Scope-Based Dijkstra's Algorithm
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We briefly report on the current state of a new dynamic algorithm for the
route planning problem based on a concept of scope (the static variant
presented at ESA'11, HM2011A). We first motivate dynamization of the concept of
scope admissibility, and then we briefly describe a modification of the
scope-aware query algorithm of HM2011A to dynamic road networks. Finally, we
outline our future work on this concept.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 10:11:11 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Hlineny",
"Petr",
""
],
[
"Moris",
"Ondrej",
""
]
] |
new_dataset
| 0.998063 |
1201.2007
|
Saravanan Kumarasamy
|
Saravanan Kumarasamy and R. Asokan
|
Distributed Denial of Service (DDoS) Attacks Detection Mechanism
| null | null |
10.5121/ijcseit.2011.1504
|
IJCSEIT-12-11
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pushback is a mechanism for defending against Distributed Denial-of-Service
(DDoS) attacks. DDoS attacks are treated as a congestion-control problem, but
because most such congestion is caused by malicious hosts not obeying
traditional end-to-end congestion control, the problem must be handled by the
routers. Functionality is added to each router to detect and preferentially
drop packets that probably belong to an attack. Upstream routers are also
notified to drop such packets in order that the router's resources be used to
route legitimate traffic hence term pushback. Client puzzles have been
advocated as a promising countermeasure to DoS attacks in the recent years. In
order to identify the attackers, the victim server issues a puzzle to the
client that sent the traffic. When the client is able to solve the puzzle, it
is assumed to be authentic and the traffic from it is allowed into the server.
If the victim suspects that the puzzles are solved by most of the clients, it
increases the complexity of the puzzles. This puzzle solving technique allows
the traversal of the attack traffic throughout the intermediate routers before
reaching the destination. In order to attain the advantages of both pushback
and puzzle solving techniques, a hybrid scheme called Router based Pushback
technique, which involves both the techniques to solve the problem of DDoS
attacks is proposed. In this proposal, the puzzle solving mechanism is pushed
back to the core routers rather than having at the victim. The router based
client puzzle mechanism checks the host system whether it is legitimate or not
by providing a puzzle to be solved by the suspected host.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 10:23:37 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Kumarasamy",
"Saravanan",
""
],
[
"Asokan",
"R.",
""
]
] |
new_dataset
| 0.999202 |
1201.2010
|
K. M. Azharul Hasan
|
K. M. Azharul Hasan, Al-Mahmud, Amit Mondal, Amit Saha
|
Recognizing Bangla Grammar using Predictive Parser
|
13 pages, 13 figures
| null |
10.5121/ijcsit.2011.3605
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a Context Free Grammar (CFG) for Bangla language and hence we
propose a Bangla parser based on the grammar. Our approach is very much general
to apply in Bangla Sentences and the method is well accepted for parsing a
language of a grammar. The proposed parser is a predictive parser and we
construct the parse table for recognizing Bangla grammar. Using the parse table
we recognize syntactical mistakes of Bangla sentences when there is no entry
for a terminal in the parse table. If a natural language can be successfully
parsed then grammar checking from this language becomes possible. The proposed
scheme is based on Top down parsing method and we have avoided the left
recursion of the CFG using the idea of left factoring.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 10:33:18 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Hasan",
"K. M. Azharul",
""
],
[
"Al-Mahmud",
"",
""
],
[
"Mondal",
"Amit",
""
],
[
"Saha",
"Amit",
""
]
] |
new_dataset
| 0.950441 |
1201.2043
|
Keivan Navi
|
Mehdi Ghasemi, Mohammad Hossein Moaiyeri and Keivan Navi
|
A New Full Adder Cell for Molecular Electronics
|
13 pages, 14 figures
|
International Journal of VLSI design & Communication
System(VLSICS) Vol.2, No.4, pp.1-13, Dec. 2011
|
10.5121/vlsic.2011.2401
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to high power consumption and difficulties with minimizing the CMOS
transistor size, molecular electronics has been introduced as an emerging
technology. Further, there have been noticeable advances in fabrication of
molecular wires and switches and also molecular diodes can be used for
designing different logic circuits. Considering this novel technology, we use
molecules as the active components of the circuit, for transporting electric
charge. In this paper, a full adder cell based on molecular electronics is
presented. This full adder is consisted of resonant tunneling diodes and
transistors which are implemented via molecular electronics. The area occupied
by this kind of full adder would be much times smaller than the conventional
designs and it can be used as the building block of more complex molecular
arithmetic circuits.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 12:50:15 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Ghasemi",
"Mehdi",
""
],
[
"Moaiyeri",
"Mohammad Hossein",
""
],
[
"Navi",
"Keivan",
""
]
] |
new_dataset
| 0.998972 |
1201.2073
|
Rafi Muhammad
|
Mehwish Aziz, Muhammad Rafi
|
Pbm: A new dataset for blog mining
|
6; Internet and Web Engineering from: International Conference on
Computer Engineering and Technology, 3rd (ICCET 2011)
| null | null | null |
cs.AI cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text mining is becoming vital as Web 2.0 offers collaborative content
creation and sharing. Now Researchers have growing interest in text mining
methods for discovering knowledge. Text mining researchers come from variety of
areas like: Natural Language Processing, Computational Linguistic, Machine
Learning, and Statistics. A typical text mining application involves
preprocessing of text, stemming and lemmatization, tagging and annotation,
deriving knowledge patterns, evaluating and interpreting the results. There are
numerous approaches for performing text mining tasks, like: clustering,
categorization, sentimental analysis, and summarization. There is a growing
need to standardize the evaluation of these tasks. One major component of
establishing standardization is to provide standard datasets for these tasks.
Although there are various standard datasets available for traditional text
mining tasks, but there are very few and expensive datasets for blog-mining
task. Blogs, a new genre in web 2.0 is a digital diary of web user, which has
chronological entries and contains a lot of useful knowledge, thus offers a lot
of challenges and opportunities for text mining. In this paper, we report a new
indigenous dataset for Pakistani Political Blogosphere. The paper describes the
process of data collection, organization, and standardization. We have used
this dataset for carrying out various text mining tasks for blogosphere, like:
blog-search, political sentiments analysis and tracking, identification of
influential blogger, and clustering of the blog-posts. We wish to offer this
dataset free for others who aspire to pursue further in this domain.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 15:18:38 GMT"
}
] | 2012-01-11T00:00:00 |
[
[
"Aziz",
"Mehwish",
""
],
[
"Rafi",
"Muhammad",
""
]
] |
new_dataset
| 0.996144 |
0904.0293
|
Petar Kormushev
|
Gennady Agre, Petar Kormushev, Ivan Dilov
|
INFRAWEBS axiom editor - a graphical ontology-driven tool for creating
complex logical expressions
|
This preprint has been withdrawn by the author for revision
|
International Journal of Information Theories and Applications,
vol. 13, no. 2, ISSN 1310-0513, pp. 169-178, 2006
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current INFRAWEBS European research project aims at developing ICT
framework enabling software and service providers to generate and establish
open and extensible development platforms for Web Service applications. One of
the concrete project objectives is developing a full-life-cycle software
toolset for creating and maintaining Semantic Web Services (SWSs) supporting
specific applications based on Web Service Modelling Ontology (WSMO) framework.
According to WSMO, functional and behavioural descriptions of a SWS may be
represented by means of complex logical expressions (axioms). The paper
describes a specialized user-friendly tool for constructing and editing such
axioms - INFRAWEBS Axiom Editor. After discussing the main design principles of
the Editor, its functional architecture is briefly presented. The tool is
implemented in Eclipse Graphical Environment Framework and Eclipse Rich Client
Platform.
|
[
{
"version": "v1",
"created": "Thu, 2 Apr 2009 02:29:47 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Jan 2012 20:10:33 GMT"
}
] | 2012-01-10T00:00:00 |
[
[
"Agre",
"Gennady",
""
],
[
"Kormushev",
"Petar",
""
],
[
"Dilov",
"Ivan",
""
]
] |
new_dataset
| 0.996963 |
1101.4475
|
Benedikt Bollig
|
Benedikt Bollig (LSV)
|
An automaton over data words that captures EMSO logic
| null | null |
10.1007/978-3-642-23217-6_12
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a general framework for the specification and implementation of
systems whose executions are words, or partial orders, over an infinite
alphabet. As a model of an implementation, we introduce class register
automata, a one-way automata model over words with multiple data values. Our
model combines register automata and class memory automata. It has natural
interpretations. In particular, it captures communicating automata with an
unbounded number of processes, whose semantics can be described as a set of
(dynamic) message sequence charts. On the specification side, we provide a
local existential monadic second-order logic that does not impose any
restriction on the number of variables. We study the realizability problem and
show that every formula from that logic can be effectively, and in elementary
time, translated into an equivalent class register automaton.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 09:39:07 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Jan 2011 09:08:04 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Apr 2011 08:02:21 GMT"
},
{
"version": "v4",
"created": "Fri, 10 Jun 2011 14:42:35 GMT"
}
] | 2012-01-10T00:00:00 |
[
[
"Bollig",
"Benedikt",
"",
"LSV"
]
] |
new_dataset
| 0.998667 |
1112.5396
|
Vahid Liaghat
|
Saeed Alaei, Mohammad T. Hajiaghayi, Vahid Liaghat, Dan Pei, Barna
Saha
|
AdCell: Ad Allocation in Cellular Networks
| null |
ESA 2011: 311-322
| null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With more than four billion usage of cellular phones worldwide, mobile
advertising has become an attractive alternative to online advertisements. In
this paper, we propose a new targeted advertising policy for Wireless Service
Providers (WSPs) via SMS or MMS- namely {\em AdCell}. In our model, a WSP
charges the advertisers for showing their ads. Each advertiser has a valuation
for specific types of customers in various times and locations and has a limit
on the maximum available budget. Each query is in the form of time and location
and is associated with one individual customer. In order to achieve a
non-intrusive delivery, only a limited number of ads can be sent to each
customer. Recently, new services have been introduced that offer location-based
advertising over cellular network that fit in our model (e.g., ShopAlerts by
AT&T) .
We consider both online and offline version of the AdCell problem and develop
approximation algorithms with constant competitive ratio. For the online
version, we assume that the appearances of the queries follow a stochastic
distribution and thus consider a Bayesian setting. Furthermore, queries may
come from different distributions on different times. This model generalizes
several previous advertising models such as online secretary problem
\cite{HKP04}, online bipartite matching \cite{KVV90,FMMM09} and AdWords
\cite{saberi05}. ...
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2011 17:44:55 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Jan 2012 02:51:38 GMT"
}
] | 2012-01-10T00:00:00 |
[
[
"Alaei",
"Saeed",
""
],
[
"Hajiaghayi",
"Mohammad T.",
""
],
[
"Liaghat",
"Vahid",
""
],
[
"Pei",
"Dan",
""
],
[
"Saha",
"Barna",
""
]
] |
new_dataset
| 0.999659 |
1201.1812
|
Jiun-Hung Yu
|
Jiun-Hung Yu and Hans-Andrea Loeliger
|
On Polynomial Remainder Codes
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polynomial remainder codes are a large class of codes derived from the
Chinese remainder theorem that includes Reed-Solomon codes as a special case.
In this paper, we revisit these codes and study them more carefully than in
previous work. We explicitly allow the code symbols to be polynomials of
different degrees, which leads to two different notions of weight and distance.
Algebraic decoding is studied in detail. If the moduli are not irreducible,
the notion of an error locator polynomial is replaced by an error factor
polynomial. We then obtain a collection of gcd-based decoding algorithms, some
of which are not quite standard even when specialized to Reed-Solomon codes.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2012 16:00:45 GMT"
}
] | 2012-01-10T00:00:00 |
[
[
"Yu",
"Jiun-Hung",
""
],
[
"Loeliger",
"Hans-Andrea",
""
]
] |
new_dataset
| 0.988242 |
1001.0695
|
Sang Won Bae
|
Sang Won Bae, Matias Korman, and Yoshio Okamoto
|
The Geodesic Diameter of Polygonal Domains
|
21 pages, 7 figures, preliminary version presented at ESA2010 and
submitted to DCG
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the geodesic diameter of polygonal domains having h holes
and n corners. For simple polygons (i.e., h = 0), the geodesic diameter is
determined by a pair of corners of a given polygon and can be computed in
linear time, as known by Hershberger and Suri. For general polygonal domains
with h >= 1, however, no algorithm for computing the geodesic diameter was
known prior to this paper. In this paper, we present the first algorithms that
compute the geodesic diameter of a given polygonal domain in worst-case time
O(n^7.73) or O(n^7 (log n + h)). The main difficulty unlike the simple polygon
case relies on the following observation revealed in this paper: two interior
points can determine the geodesic diameter and in that case there exist at
least five distinct shortest paths between the two.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2010 13:00:56 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Jan 2012 11:40:06 GMT"
}
] | 2012-01-09T00:00:00 |
[
[
"Bae",
"Sang Won",
""
],
[
"Korman",
"Matias",
""
],
[
"Okamoto",
"Yoshio",
""
]
] |
new_dataset
| 0.997059 |
1201.1422
|
Roli Bansal
|
Roli Bansal, Priti Sehgal, Punam Bedi
|
Minutiae Extraction from Fingerprint Images - a Review
|
12 pages; IJCSI International Journal of Computer Science Issues,
Vol. 8, Issue 5, September 2011
| null | null | null |
cs.CV cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fingerprints are the oldest and most widely used form of biometric
identification. Everyone is known to have unique, immutable fingerprints. As
most Automatic Fingerprint Recognition Systems are based on local ridge
features known as minutiae, marking minutiae accurately and rejecting false
ones is very important. However, fingerprint images get degraded and corrupted
due to variations in skin and impression conditions. Thus, image enhancement
techniques are employed prior to minutiae extraction. A critical step in
automatic fingerprint matching is to reliably extract minutiae from the input
fingerprint images. This paper presents a review of a large number of
techniques present in the literature for extracting fingerprint minutiae. The
techniques are broadly classified as those working on binarized images and
those that work on gray scale images directly.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2011 05:42:36 GMT"
}
] | 2012-01-09T00:00:00 |
[
[
"Bansal",
"Roli",
""
],
[
"Sehgal",
"Priti",
""
],
[
"Bedi",
"Punam",
""
]
] |
new_dataset
| 0.995466 |
1201.1038
|
Nada Alamri Ms
|
Nada Alamri, Nadine Akkari
|
UMTS-WiMAX Vertical Handover in Next Generation Wireless Networks
|
20 pages, 20 figures, 4 tables, IJDPS; Nada Alamri and Nadine
Akkari,"UMTS-WiMAX Vertical Handover in Next Generation Wireless Networks",
International Journal for Distributed and Parallel Systems (IJDPS),2011,
vol.2, No,6
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vision of next generation wireless network (NGWN) is to integrate
different wireless access technologies, each with its own characteristics, into
a common IP-based core network to provide mobile user with service continuity
and seamless roaming. One of the major issues for the converged heterogeneous
networks is providing a seamless vertical handover (VHO) with QoS support. In
this paper we have reviewed the various interworking architectures and handover
scenarios between UMTS and WiMAX. Also, we have compared the proposed solutions
based on different criteria and revealed the pros and cons of each scheme. The
comparison aids to adopt a better interworking and handover mechanism in NGWN.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2012 23:43:32 GMT"
}
] | 2012-01-06T00:00:00 |
[
[
"Alamri",
"Nada",
""
],
[
"Akkari",
"Nadine",
""
]
] |
new_dataset
| 0.952424 |
1201.1065
|
Vo Tam Van
|
Vo Tam Van and Seiichi Mita
|
A Novel Error Correcting System Based on Product Codes for Future
Magnetic Recording Channels
|
4 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel construction of product codes for high-density magnetic
recording based on binary low-density parity check (LDPC) codes and binary
image of Reed Solomon (RS) codes. Moreover, two novel algorithms are proposed
to decode the codes in the presence of both AWGN errors and scattered hard
errors (SHEs). Simulation results show that at a bit error rate (bER) of
approximately 10^-8, our method allows improving the error performance by
approximately 1.9dB compared with that of a hard decision decoder of RS codes
of the same length and code rate. For the mixed error channel including random
noises and SHEs, the signal-to-noise ratio (SNR) is set at 5dB and 150 to 400
SHEs are randomly generated. The bit error performance of the proposed product
code shows a significant improvement over that of equivalent random LDPC codes
or serial concatenation of LDPC and RS codes.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2012 05:41:16 GMT"
}
] | 2012-01-06T00:00:00 |
[
[
"Van",
"Vo Tam",
""
],
[
"Mita",
"Seiichi",
""
]
] |
new_dataset
| 0.992167 |
1201.1122
|
EPTCS
|
Lucien Capedevielle (ENS de Lyon)
|
A type system for PSPACE derived from light linear logic
|
In Proceedings DICE 2011, arXiv:1201.0345
|
EPTCS 75, 2012, pp. 33-46
|
10.4204/EPTCS.75.4
| null |
cs.CC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a polymorphic type system for lambda calculus ensuring that
well-typed programs can be executed in polynomial space: dual light affine
logic with booleans (DLALB).
To build DLALB we start from DLAL (which has a simple type language with a
linear and an intuitionistic type arrow, as well as one modality) which
characterizes FPTIME functions. In order to extend its expressiveness we add
two boolean constants and a conditional constructor in the same way as with the
system STAB.
We show that the value of a well-typed term can be computed by an alternating
machine in polynomial time, thus such a term represents a program of PSPACE
(given that PSPACE = APTIME).
We also prove that all polynomial space decision functions can be represented
in DLALB.
Therefore DLALB characterizes PSPACE predicates.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2012 11:06:58 GMT"
}
] | 2012-01-06T00:00:00 |
[
[
"Capedevielle",
"Lucien",
"",
"ENS de Lyon"
]
] |
new_dataset
| 0.99814 |
1201.1202
|
Julien Moncel
|
Sylvain Gravier (IF), Matjaz Kovse (LaBRI), Michel Mollard (IF),
Julien Moncel (LAAS), Aline Parreau (IF)
|
New results on variants of covering codes in Sierpinski graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study identifying codes, locating-dominating codes, and
total-dominating codes in Sierpinski graphs. We compute the minimum size of
such codes in Sierpinski graphs.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2012 15:48:54 GMT"
}
] | 2012-01-06T00:00:00 |
[
[
"Gravier",
"Sylvain",
"",
"IF"
],
[
"Kovse",
"Matjaz",
"",
"LaBRI"
],
[
"Mollard",
"Michel",
"",
"IF"
],
[
"Moncel",
"Julien",
"",
"LAAS"
],
[
"Parreau",
"Aline",
"",
"IF"
]
] |
new_dataset
| 0.971978 |
1201.0066
|
Muhammad Jawaherul Alam
|
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann,
Stephen G. Kobourov and Torsten Ueckerdt
|
Computing Cartograms with Optimal Complexity
|
18 pages, 7 figures
| null | null | null |
cs.DM cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a rectilinear dual of a planar graph vertices are represented by simple
rectilinear polygons and edges are represented by side-contact between the
corresponding polygons. A rectilinear dual is called a cartogram if the area of
each region is equal to a pre-specified weight of the corresponding vertex. The
complexity of a cartogram is determined by the maximum number of corners (or
sides) required for any polygon. In a series of papers the polygonal complexity
of such representations for maximal planar graphs has been reduced from the
initial 40 to 34, then to 12 and very recently to the currently best known 10.
Here we describe a construction with 8-sided polygons, which is optimal in
terms of polygonal complexity as 8-sided polygons are sometimes necessary.
Specifically, we show how to compute the combinatorial structure and how to
refine the representation into an area-universal rectangular layout in linear
time. The exact cartogram can be computed from the area-universal rectangular
layout with numerical iteration, or can be approximated with a hill-climbing
heuristic.
We also describe an alternative construction for Hamiltonian maximal planar
graphs, which allows us to directly compute the cartograms in linear time.
Moreover, we prove that even for Hamiltonian graphs 8-sided rectilinear
polygons are necessary, by constructing a non-trivial lower bound example. The
complexity of the cartograms can be reduced to 6 if the Hamiltonian path has
the extra property that it is one-legged, as in outer-planar graphs. Thus, we
have optimal representations (in terms of both polygonal complexity and running
time) for Hamiltonian maximal planar and maximal outer-planar graphs.
|
[
{
"version": "v1",
"created": "Fri, 30 Dec 2011 05:44:30 GMT"
}
] | 2012-01-05T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Biedl",
"Therese",
""
],
[
"Felsner",
"Stefan",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kobourov",
"Stephen G.",
""
],
[
"Ueckerdt",
"Torsten",
""
]
] |
new_dataset
| 0.987431 |
1201.0782
|
Dirk Hesselbach
|
Dirk Hesselbach
|
Umgebungserfassungssystem fuer mobile Roboter (environment logging
system for mobile autonomous robots)
| null | null | null | null |
cs.RO cs.AR
|
http://creativecommons.org/licenses/by/3.0/
|
This diploma thesis describes the theoretical bases, the conception of the
module and the final result of the development process in application. for the
environment logging with a small mobile robot for interiors should be sketched
an economical alternative to the expensive laser scanners. the structure, color
or the material of the objects in the radius of action, as well as the
environment brightness and illuminating are to have thereby no influence on the
results of measurement.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2012 22:15:22 GMT"
}
] | 2012-01-05T00:00:00 |
[
[
"Hesselbach",
"Dirk",
""
]
] |
new_dataset
| 0.993485 |
1201.0945
|
Wajeb Gharibi
|
Wajeb Gharibi
|
Symbian `vulnerability' and Mobile Threats
|
4 pages; International Journal of Computer Science and Information
Security (IJCSIS), Vol. 9, No. 10, (2011)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern technologies are becoming ever more integrated with each other. Mobile
phones are becoming increasing intelligent, and handsets are growing ever more
like computers in functionality. We are entering a new era - the age of smart
houses, global advanced networks which encompass a wide range of devices, all
of them exchanging data with each other. Such trends clearly open new horizons
to malicious users, and the potential threats are self evident. In this paper,
we study and discuss one of the most famous mobile operating systems 'Symbian';
its vulnerabilities and recommended protection technologies.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2012 17:49:57 GMT"
}
] | 2012-01-05T00:00:00 |
[
[
"Gharibi",
"Wajeb",
""
]
] |
new_dataset
| 0.998788 |
1005.5448
|
Shailesh Kumar Jagadeesan
|
Shailesh Kumar and Shrisha Rao
|
Failover in cellular automata
|
16 pages, 15 figures and associated video at
http://dl.dropbox.com/u/7553694/failover_demo.avi and simulation at
http://dl.dropbox.com/u/7553694/failover_simulation.jar
|
Physics Procedia, vol. 22, pp. 557--564, 2011
|
10.1016/j.phpro.2011.11.086
| null |
cs.AI nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cellular automata (CA) configuration is constructed that exhibits emergent
failover. The configuration is based on standard Game of Life rules. Gliders
and glider-guns form the core messaging structure in the configuration. The
blinker is represented as the basic computational unit, and it is shown how it
can be recreated in case of a failure. Stateless failover using primary-backup
mechanism is demonstrated. The details of the CA components used in the
configuration and its working are described, and a simulation of the complete
configuration is also presented.
|
[
{
"version": "v1",
"created": "Sat, 29 May 2010 12:17:09 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Kumar",
"Shailesh",
""
],
[
"Rao",
"Shrisha",
""
]
] |
new_dataset
| 0.987915 |
1201.0160
|
Shan Mei
|
Mei Shan, Zhou Xuan, Zhu Yifan, Zu Zhenghu, Zheng Tao, A.V.
Boukhanovsky, P.M.A Sloot
|
Simulating City-level Airborne Infectious Diseases
|
20 pages, 5 figures
| null | null | null |
cs.OH physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the exponential growth in the world population and the constant increase
in human mobility, the danger of outbreaks of epidemics is rising. Especially
in high density urban areas such as public transport and transfer points, where
people come in close proximity of each other, we observe a dramatic increase in
the transmission of airborne viruses and related pathogens. It is essential to
have a good understanding of the `transmission highways' in such areas, in
order to prevent or to predict the spreading of infectious diseases. The
approach we take is to combine as much information as is possible, from all
relevant sources and integrate this in a simulation environment that allows for
scenario testing and decision support. In this paper we lay out a novel
approach to study Urban Airborne Disease spreading by combining traffic
information, with geo-spatial data, infection dynamics and spreading
characteristics.
|
[
{
"version": "v1",
"created": "Fri, 30 Dec 2011 17:56:45 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Shan",
"Mei",
""
],
[
"Xuan",
"Zhou",
""
],
[
"Yifan",
"Zhu",
""
],
[
"Zhenghu",
"Zu",
""
],
[
"Tao",
"Zheng",
""
],
[
"Boukhanovsky",
"A. V.",
""
],
[
"Sloot",
"P. M. A",
""
]
] |
new_dataset
| 0.986226 |
1201.0205
|
Feng Xia
|
Guowei Wu, Dongze Lu, Feng Xia, Lin Yao
|
A Fault-Tolerant Emergency-Aware Access Control Scheme for
Cyber-Physical Systems
| null |
Information Technology and Control, 2011, Vol.40, No.1, pp. 29-40
| null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Access control is an issue of paramount importance in cyber-physical systems
(CPS). In this paper, an access control scheme, namely FEAC, is presented for
CPS. FEAC can not only provide the ability to control access to data in normal
situations, but also adaptively assign emergency-role and permissions to
specific subjects and inform subjects without explicit access requests to
handle emergency situations in a proactive manner. In FEAC, emergency-group and
emergency-dependency are introduced. Emergencies are processed in sequence
within the group and in parallel among groups. A priority and dependency model
called PD-AGM is used to select optimal response-action execution path aiming
to eliminate all emergencies that occurred within the system. Fault-tolerant
access control polices are used to address failure in emergency management. A
case study of the hospital medical care application shows the effectiveness of
FEAC.
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2011 01:13:13 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Wu",
"Guowei",
""
],
[
"Lu",
"Dongze",
""
],
[
"Xia",
"Feng",
""
],
[
"Yao",
"Lin",
""
]
] |
new_dataset
| 0.99962 |
1201.0207
|
Feng Xia
|
Guowei Wu, Feng Xia, Lin Yao, Yan Zhang, Yanwei Zhu
|
A Hop-by-hop Cross-layer Congestion Control Scheme for Wireless Sensor
Networks
| null |
Journal of Software, Dec 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Congestions in wireless sensor networks (WSNs) could potentially cause packet
loss, throughput impairment and energy waste. To address this issue, a
hop-by-hop cross-layer congestion control scheme (HCCC) built on
contention-based MAC protocol is proposed in this paper. According to MAC-layer
channel information including buffer occupancy ratio and congestion degree of
local node, HCCC dynamically adjusts channel access priority in MAC layer and
data transmission rate of the node to tackle the problem of congestion.
Simulations have been conducted to compare HCCC against closely-related
existing schemes. The results show that HCCC exhibits considerable superiority
in terms of packets loss ratio, throughput and energy efficiency.
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2011 01:42:19 GMT"
}
] | 2012-01-04T00:00:00 |
[
[
"Wu",
"Guowei",
""
],
[
"Xia",
"Feng",
""
],
[
"Yao",
"Lin",
""
],
[
"Zhang",
"Yan",
""
],
[
"Zhu",
"Yanwei",
""
]
] |
new_dataset
| 0.998763 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.