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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1106.0445
|
Wenji Wu
|
Wenji Wu and Matt Crawford and Phil DeMar
|
A Transport-Friendly NIC for Multicore/Multiprocessor Systems
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
Receive side scaling (RSS) is a network interface card (NIC) technology. It
provides the benefits of parallel receive processing in multiprocessing
environments. However, existing RSS-enabled NICs lack a critical data steering
mechanism that would automatically steer incoming network data to the same core
on which its application process resides. This absence causes inefficient cache
usage if an application is not running on the core on which RSS has scheduled
the received traffic to be processed. In Linux systems, it cannot even ensure
that packets in a TCP flow are processed by a single core, even if the
interrupts for the flow are pinned to a specific core. This results in degraded
performance. In this paper, we develop such a data steering mechanism in the
NIC for multicore or multiprocessor systems. This data steering mechanism is
mainly targeted at TCP, but it can be extended to other transport layer
protocols. We term a NIC with such a data steering mechanism "A Transport
Friendly NIC" (A-TFN). Experimental results have proven the effectiveness of
A-TFN in accelerating TCP/IP performance.
|
[
{
"version": "v1",
"created": "Thu, 2 Jun 2011 15:00:51 GMT"
}
] | 2011-06-03T00:00:00 |
[
[
"Wu",
"Wenji",
""
],
[
"Crawford",
"Matt",
""
],
[
"DeMar",
"Phil",
""
]
] |
new_dataset
| 0.986769 |
1106.0488
|
Ahmad Abu Al Haija Mr.
|
Ahmad Abu Al Haija, and Mai Vu
|
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
|
2011 IEEE International Symposium on Information Theory (ISIT 2011)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a new cooperative communication scheme consisting
of two users in half-duplex mode communicating with one destination over a
discrete memoryless channel. The users encode messages in independent blocks
and divide the transmission of each block into 3 time slots with variable
durations. Cooperation is performed by partial decodeforward relaying over
these 3 time slots. During the first two time slots, each user alternatively
transmits and decodes, while during the last time slot, both users cooperate to
send information to the destination. An achievable rate region for this scheme
is derived using superposition encoding and joint maximum likelihood (ML)
decoding across the 3 time slots. An example of the Gaussian channel is treated
in detail and its achievable rate region is given explicitly. Results show that
the proposed half-duplex scheme achieves significantly larger rate region than
the classical multiple access channel and approaches the performance of a
full-duplex cooperative scheme as the inter-user channel quality increases.
|
[
{
"version": "v1",
"created": "Thu, 2 Jun 2011 19:27:46 GMT"
}
] | 2011-06-03T00:00:00 |
[
[
"Haija",
"Ahmad Abu Al",
""
],
[
"Vu",
"Mai",
""
]
] |
new_dataset
| 0.998146 |
1006.1998
|
Mikko Koivisto
|
Mikko Koivisto, Valentin Polishchuk
|
Geodesic diameter of a polygonal domain in O(n^4 log n) time
|
NOTE: It has turned out that, unfortunately, Lemma 2 does not hold,
which renders the main result incorrect
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the geodesic diameter of a polygonal domain with n vertices can
be computed in O(n^4 log n) time by considering O(n^3) candidate diameter
endpoints; the endpoints are a subset of vertices of the overlay of shortest
path maps from vertices of the domain.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2010 10:47:19 GMT"
},
{
"version": "v2",
"created": "Tue, 31 May 2011 06:53:32 GMT"
}
] | 2011-06-01T00:00:00 |
[
[
"Koivisto",
"Mikko",
""
],
[
"Polishchuk",
"Valentin",
""
]
] |
new_dataset
| 0.998477 |
1105.5981
|
Ayal Hitron
|
Anatoly Khina and Ayal Hitron and Uri Erez
|
Modulation for MIMO Networks with Several Users
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a recent work, a capacity-achieving scheme for the common-message two-user
MIMO broadcast channel, based on single-stream coding and decoding, was
described. This was obtained via a novel joint unitary triangularization which
is applied to the corresponding channel matrices. In this work, the
triangularization is generalized, to any (finite) number of matrices, allowing
multi-user applications. To that end, multiple channel uses are jointly
treated, in a manner reminiscent of space-time coding. As opposed to the
two-user case, in the general case there does not always exist a perfect
(capacity-achieving) solution. However, a nearly optimal scheme (with vanishing
loss in the limit of large blocks) always exists. Common-message broadcasting
is but one example of communication networks with MIMO links which can be
solved using an approach coined "Network Modulation"; the extension beyond two
links carries over to these problems.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 13:11:04 GMT"
},
{
"version": "v2",
"created": "Tue, 31 May 2011 17:41:34 GMT"
}
] | 2011-06-01T00:00:00 |
[
[
"Khina",
"Anatoly",
""
],
[
"Hitron",
"Ayal",
""
],
[
"Erez",
"Uri",
""
]
] |
new_dataset
| 0.997963 |
1105.6160
|
Supasate Choochaisri
|
Supasate Choochaisri, Vit Niennattrakul, Saran Jenjaturong, Chalermek
Intanagonwiwat, Chotirat Ann Ratanamahatana
|
SENVM: Server Environment Monitoring and Controlling System for a Small
Data Center Using Wireless Sensor Network
|
6 pages
|
The 2010 International Computer Science and Engineering Conference
(ICSEC), Chiang Mai, Thailand
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, efficient energy utilization becomes an essential
requirement for data centers, especially in data centers of world-leading
companies, where "Green Data Center" defines a new term for an
environment-concerned data center. Solutions to change existing a data center
to the green one may vary. In the big company, high-cost approaches including
re-planning server rooms, changing air-conditioners, buying low-powered
servers, and equipping sophisticating environmental control equipments are
possible, but not for small to medium enterprises (SMEs) and academic sectors
which have limited budget. In this paper, we propose a novel system, SENVM,
used to monitor and control air temperature in a server room to be in
appropriate condition, not too cold, where very unnecessary cooling leads to
unnecessary extra electricity expenses, and also inefficient in energy
utilization. With implementing on an emerging technology, Wireless Sensor
Network (WSN), Green Data Center is feasible to every small data center with no
wiring installation, easy deployment, and low maintenance fee. In addition, the
prototype of the system has been tested, and the first phase of the project is
deployed in a real-world data center.
|
[
{
"version": "v1",
"created": "Tue, 31 May 2011 04:27:36 GMT"
}
] | 2011-06-01T00:00:00 |
[
[
"Choochaisri",
"Supasate",
""
],
[
"Niennattrakul",
"Vit",
""
],
[
"Jenjaturong",
"Saran",
""
],
[
"Intanagonwiwat",
"Chalermek",
""
],
[
"Ratanamahatana",
"Chotirat Ann",
""
]
] |
new_dataset
| 0.999393 |
1105.6224
|
Alexey Frolov
|
Alexey Frolov and Victor Zyablov
|
Upper and Lower Bounds on the Minimum Distance of Expander Codes
|
5 pages, 1 figure, IEEE International Symposium on Information Theory
2011 (ISIT 2011), Saint Petersburg, Russia, to appear
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The minimum distance of expander codes over GF(q) is studied. A new upper
bound on the minimum distance of expander codes is derived. The bound is shown
to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on
the minimum distance of some families of expander codes are obtained. A lower
bound on the minimum distance of low-density parity-check (LDPC) codes with a
Reed--Solomon constituent code over GF(q) is obtained. The bound is shown to be
very close to the VG bound and to lie above the upper bound for expander codes.
|
[
{
"version": "v1",
"created": "Tue, 31 May 2011 09:41:02 GMT"
}
] | 2011-06-01T00:00:00 |
[
[
"Frolov",
"Alexey",
""
],
[
"Zyablov",
"Victor",
""
]
] |
new_dataset
| 0.988549 |
1105.6314
|
Laurent Michel D
|
L. Michel and P. Van Hentenryck
|
Activity-Based Search for Black-Box Contraint-Programming Solvers
| null | null | null | null |
cs.AI cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robust search procedures are a central component in the design of black-box
constraint-programming solvers. This paper proposes activity-based search, the
idea of using the activity of variables during propagation to guide the search.
Activity-based search was compared experimentally to impact-based search and
the WDEG heuristics. Experimental results on a variety of benchmarks show that
activity-based search is more robust than other heuristics and may produce
significant improvements in performance.
|
[
{
"version": "v1",
"created": "Tue, 31 May 2011 15:25:33 GMT"
}
] | 2011-06-01T00:00:00 |
[
[
"Michel",
"L.",
""
],
[
"Van Hentenryck",
"P.",
""
]
] |
new_dataset
| 0.951981 |
0911.1072
|
Nicolas Bitouz\'e
|
Nicolas Bitouze, Alexandre Graell i Amat, Eirik Rosnes
|
Error Correcting Coding for a Non-symmetric Ternary Channel
|
Submitted to IEEE Transactions on Information Theory. Part of this
work was presented at the Information Theory and Applications Workshop 2009
|
IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5715-5729, Nov. 2010
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ternary channels can be used to model the behavior of some memory devices,
where information is stored in three different levels. In this paper, error
correcting coding for a ternary channel where some of the error transitions are
not allowed, is considered. The resulting channel is non-symmetric, therefore
classical linear codes are not optimal for this channel. We define the
maximum-likelihood (ML) decoding rule for ternary codes over this channel and
show that it is complex to compute, since it depends on the channel error
probability. A simpler alternative decoding rule which depends only on code
properties, called $\da$-decoding, is then proposed. It is shown that
$\da$-decoding and ML decoding are equivalent, i.e., $\da$-decoding is optimal,
under certain conditions. Assuming $\da$-decoding, we characterize the error
correcting capabilities of ternary codes over the non-symmetric ternary
channel. We also derive an upper bound and a constructive lower bound on the
size of codes, given the code length and the minimum distance. The results
arising from the constructive lower bound are then compared, for short sizes,
to optimal codes (in terms of code size) found by a clique-based search. It is
shown that the proposed construction method gives good codes, and that in some
cases the codes are optimal.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2009 16:15:29 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Bitouze",
"Nicolas",
""
],
[
"Amat",
"Alexandre Graell i",
""
],
[
"Rosnes",
"Eirik",
""
]
] |
new_dataset
| 0.981805 |
1105.5675
|
Jierui Xie
|
Jierui Xie and Mandis S. Beigi
|
Scale-Invariant Local Descriptor for Event Recognition in 1D Sensor
Signals
| null |
IEEE International Conference on Multimedia &
Expo(ICME),Page(s):1226 - 1229, 2009
| null | null |
cs.MM cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a shape-based, time-scale invariant feature
descriptor for 1-D sensor signals. The time-scale invariance of the feature
allows us to use feature from one training event to describe events of the same
semantic class which may take place over varying time scales such as walking
slow and walking fast. Therefore it requires less training set. The descriptor
takes advantage of the invariant location detection in the scale space theory
and employs a high level shape encoding scheme to capture invariant local
features of events. Based on this descriptor, a scale-invariant classifier with
"R" metric (SIC-R) is designed to recognize multi-scale events of human
activities. The R metric combines the number of matches of keypoint in scale
space with the Dynamic Time Warping score. SICR is tested on various types of
1-D sensors data from passive infrared, accelerometer and seismic sensors with
more than 90% classification accuracy.
|
[
{
"version": "v1",
"created": "Sat, 28 May 2011 00:44:54 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Xie",
"Jierui",
""
],
[
"Beigi",
"Mandis S.",
""
]
] |
new_dataset
| 0.996499 |
1105.5755
|
Himanshu Asnani
|
Himanshu Asnani and Tsachy Weissman
|
On Real Time Coding with Limited Lookahead
|
27 pages, 6 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A real time coding system with lookahead consists of a memoryless source, a
memoryless channel, an encoder, which encodes the source symbols sequentially
with knowledge of future source symbols upto a fixed finite lookahead, d, with
or without feedback of the past channel output symbols and a decoder, which
sequentially constructs the source symbols using the channel output. The
objective is to minimize the expected per-symbol distortion. For a fixed finite
lookahead d>=1 we invoke the theory of controlled markov chains to obtain an
average cost optimality equation (ACOE), the solution of which, denoted by
D(d), is the minimum expected per-symbol distortion. With increasing d, D(d)
bridges the gap between causal encoding, d=0, where symbol by symbol
encoding-decoding is optimal and the infinite lookahead case, d=\infty, where
Shannon Theoretic arguments show that separation is optimal. We extend the
analysis to a system with finite state decoders, with or without noise-free
feedback. For a Bernoulli source and binary symmetric channel, under hamming
loss, we compute the optimal distortion for various source and channel
parameters, and thus obtain computable bounds on D(d). We also identify regions
of source and channel parameters where symbol by symbol encoding-decoding is
suboptimal. Finally, we demonstrate the wide applicability of our approach by
applying it in additional coding scenarios, such as the case where the
sequential decoder can take cost constrained actions affecting the quality or
availability of side information about the source.
|
[
{
"version": "v1",
"created": "Sun, 29 May 2011 04:46:25 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Asnani",
"Himanshu",
""
],
[
"Weissman",
"Tsachy",
""
]
] |
new_dataset
| 0.998088 |
1105.5939
|
Hyungjun Jang
|
Hyungjun Jang
|
Airborne TDMA for High Throughput and Fast Weather Conditions
Notification
| null |
IJCNC 3, 3, 2011, 206-220
| null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As air traffic grows significantly, aircraft accidents increase. Many
aviation accidents could be prevented if the precise aircraft positions and
weather conditions on the aircraft's route were known. Existing studies propose
determining the precise aircraft positions via a VHF channel with an air-to-air
radio relay system that is based on mobile ad-hoc networks. However, due to the
long propagation delay, the existing TDMA MAC schemes underutilize the
networks. The existing TDMA MAC sends data and receives ACK in one time slot,
which requires two guard times in one time slot. Since aeronautical
communications spans a significant distance, the guard time occupies a
significantly large portion of the slot. To solve this problem, we propose a
piggybacking mechanism ACK. Our proposed MAC has one guard time in one time
slot, which enables the transmission of more data. Using this additional data,
we can send weather conditions that pertain to the aircraft's current position.
Our analysis shows that this proposed MAC performs better than the existing
MAC, since it offers better throughput and network utilization. In addition,
our weather condition notification model achieves a much lower transmission
delay than a HF (high frequency) voice communication.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 10:41:17 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Jang",
"Hyungjun",
""
]
] |
new_dataset
| 0.999868 |
1105.6024
|
Premkumar Karumbu
|
Premkumar Karumbu, Anurag Kumar
|
Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in
Small Extent Wireless Sensor Networks
|
Submitted to IEEE/ACM Transactions on Networking, Feb. 01, 2011. This
is an expanded version of a paper that was presented in IEEE INFOCOM 2008
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of quickest event detection with sleep-wake
scheduling in small extent wireless sensor networks in which, at each time
slot, each sensor node in the awake state observes a sample and communicates
the information to the fusion centre. The sensor nodes in the sleep state do
not sample or communicate any information to the fusion centre (FC), thereby
conserving energy. At each time slot, the FC, after having received the samples
from the sensor nodes in the wake state, makes a decision to stop (and thus
declare that the event has occurred) or to continue observing. If it decides to
continue, the FC also makes the decision of choosing the number of sensor nodes
to be in the wake state in the next time slot. We consider three alternative
approaches to the problem of choosing the number of sensor nodes to be in the
wake state in time slot k+1, based on the information available at time slot k,
namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the
awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of
a sensor node to be in the awake state in time slot k+1, and 3. optimal
probability q that a sensor node is in the awake state in any time slot. In
each case, we formulate the problem as a sequential decision process. We show
that a sufficient statistic for the decision at time k is the a posteriori
probability of change Pi_k. Also, we show that the optimal stopping rule is a
threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few
sensors wake during the prechange phase and then quickly increase the number of
sensors in the wake state when a change is "suspected". Among the three
sleep-wake algorithms described, we observe that the total cost is minimum for
the optimum control of M_{k+1} and is maximum for the optimum control on q.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 16:09:49 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Karumbu",
"Premkumar",
""
],
[
"Kumar",
"Anurag",
""
]
] |
new_dataset
| 0.994377 |
1105.6041
|
Constantinos Panagiotakopoulos
|
Constantinos Panagiotakopoulos and Petroula Tsampouka
|
The Perceptron with Dynamic Margin
|
16 pages
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The classical perceptron rule provides a varying upper bound on the maximum
margin, namely the length of the current weight vector divided by the total
number of updates up to that time. Requiring that the perceptron updates its
internal state whenever the normalized margin of a pattern is found not to
exceed a certain fraction of this dynamic upper bound we construct a new
approximate maximum margin classifier called the perceptron with dynamic margin
(PDM). We demonstrate that PDM converges in a finite number of steps and derive
an upper bound on them. We also compare experimentally PDM with other
perceptron-like algorithms and support vector machines on hard margin tasks
involving linear kernels which are equivalent to 2-norm soft margin.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2011 17:02:09 GMT"
}
] | 2011-05-31T00:00:00 |
[
[
"Panagiotakopoulos",
"Constantinos",
""
],
[
"Tsampouka",
"Petroula",
""
]
] |
new_dataset
| 0.975056 |
1105.5438
|
Chandra Nair
|
Yanlin Geng, Amin Gohari, Chandra Nair, Yuanming Yu
|
The capacity region of classes of product broadcast channels
|
full version of isit paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish a new outer bound for the capacity region of product broadcast
channels. This outer bound matches Marton's inner bound for a variety of
classes of product broadcast channels whose capacity regions were previously
unknown. These classes include product of reversely semi-deterministic and
product of reversely more-capable channels. A significant consequence of this
new outer bound is that it establishes, via an example, that the previously
best known outer-bound is strictly suboptimal for the general broadcast
channel. Our example is comprised of a product broadcast channel with two
semi-deterministic components in reverse orientation.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 01:31:35 GMT"
}
] | 2011-05-30T00:00:00 |
[
[
"Geng",
"Yanlin",
""
],
[
"Gohari",
"Amin",
""
],
[
"Nair",
"Chandra",
""
],
[
"Yu",
"Yuanming",
""
]
] |
new_dataset
| 0.995967 |
1105.5440
|
J. M. Ahuactzin
|
J. M. Ahuactzin, P. Bessiere, E. Mazer
|
The Ariadne's Clew Algorithm
| null |
Journal Of Artificial Intelligence Research, Volume 9, pages
295-316, 1998
|
10.1613/jair.468
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new approach to path planning, called the "Ariadne's clew
algorithm". It is designed to find paths in high-dimensional continuous spaces
and applies to robots with many degrees of freedom in static, as well as
dynamic environments - ones where obstacles may move. The Ariadne's clew
algorithm comprises two sub-algorithms, called Search and Explore, applied in
an interleaved manner. Explore builds a representation of the accessible space
while Search looks for the target. Both are posed as optimization problems. We
describe a real implementation of the algorithm to plan paths for a six degrees
of freedom arm in a dynamic environment where another six degrees of freedom
arm is used as a moving obstacle. Experimental results show that a path is
found in about one second without any pre-processing.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 01:44:34 GMT"
}
] | 2011-05-30T00:00:00 |
[
[
"Ahuactzin",
"J. M.",
""
],
[
"Bessiere",
"P.",
""
],
[
"Mazer",
"E.",
""
]
] |
new_dataset
| 0.996689 |
1105.5446
|
A. Artale
|
A. Artale, E. Franconi
|
A Temporal Description Logic for Reasoning about Actions and Plans
| null |
Journal Of Artificial Intelligence Research, Volume 9, pages
463-506, 1998
|
10.1613/jair.516
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A class of interval-based temporal languages for uniformly representing and
reasoning about actions and plans is presented. Actions are represented by
describing what is true while the action itself is occurring, and plans are
constructed by temporally relating actions and world states. The temporal
languages are members of the family of Description Logics, which are
characterized by high expressivity combined with good computational properties.
The subsumption problem for a class of temporal Description Logics is
investigated and sound and complete decision procedures are given. The basic
language TL-F is considered first: it is the composition of a temporal logic TL
-- able to express interval temporal networks -- together with the non-temporal
logic F -- a Feature Description Logic. It is proven that subsumption in this
language is an NP-complete problem. Then it is shown how to reason with the
more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both
at the temporal and non-temporal sides of the language, the latter extends the
non-temporal side with set-valued features (i.e., roles) and a propositionally
complete language.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 01:46:39 GMT"
}
] | 2011-05-30T00:00:00 |
[
[
"Artale",
"A.",
""
],
[
"Franconi",
"E.",
""
]
] |
new_dataset
| 0.990323 |
1105.5449
|
G. Di Caro
|
G. Di Caro, M. Dorigo
|
AntNet: Distributed Stigmergetic Control for Communications Networks
| null |
Journal Of Artificial Intelligence Research, Volume 9, pages
317-365, 1998
|
10.1613/jair.530
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces AntNet, a novel approach to the adaptive learning of
routing tables in communications networks. AntNet is a distributed, mobile
agents based Monte Carlo system that was inspired by recent work on the ant
colony metaphor for solving optimization problems. AntNet's agents concurrently
explore the network and exchange collected information. The communication among
the agents is indirect and asynchronous, mediated by the network itself. This
form of communication is typical of social insects and is called stigmergy. We
compare our algorithm with six state-of-the-art routing algorithms coming from
the telecommunications and machine learning fields. The algorithms' performance
is evaluated over a set of realistic testbeds. We run many experiments over
real and artificial IP datagram networks with increasing number of nodes and
under several paradigmatic spatial and temporal traffic distributions. Results
are very encouraging. AntNet showed superior performance under all the
experimental conditions with respect to its competitors. We analyze the main
characteristics of the algorithm and try to explain the reasons for its
superiority.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 01:48:39 GMT"
}
] | 2011-05-30T00:00:00 |
[
[
"Di Caro",
"G.",
""
],
[
"Dorigo",
"M.",
""
]
] |
new_dataset
| 0.997226 |
1105.5563
|
Abhijit Sarma
|
Abhijit Sarma, Shantanu Joshi and Sukumar Nandi
|
Context Awarw Mobile Initiated Handoff for Performance Improvement in
IEEE 802.11 Networks
|
19 pages, 14 figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.3, No.3, May 2011 pp 48-66
|
10.5121/ijcnc.2011.3304
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.11 is a widely used wireless LAN standard which offers a good
bandwidth at low cost In an ESS, multiple APs can co-exist with overlapping
coverage area. A mobile node connects to the AP from which it receives the best
signal. Changes in traffic to and from different MNs occur over time. Load
imbalance may develop on different APs. Throughput and delay of the different
flows passing through the APs, where the load has increased beyond certain
limit, may degrade. Different MNs associated to the overloaded APs will
experience performance degradation. Overall performance of the ESS will also
drop. In this paper we propose a scheme where MNs experiencing degraded
performance will initiate action and with assistance from the associate AP
perform handoff to less loaded AP within its range to improve performance.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2011 14:02:23 GMT"
}
] | 2011-05-30T00:00:00 |
[
[
"Sarma",
"Abhijit",
""
],
[
"Joshi",
"Shantanu",
""
],
[
"Nandi",
"Sukumar",
""
]
] |
new_dataset
| 0.998562 |
0802.3492
|
Marko A. Rodriguez
|
Marko A. Rodriguez
|
The RDF Virtual Machine
|
keywords: Resource Description Framework, Virtual Machines,
Distributed Computing, Semantic Web
|
Knowledge-Based Systems, 24(6), 890-903, August 2011
|
10.1016/j.knosys.2011.04.004
|
LA-UR-08-03925
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Resource Description Framework (RDF) is a semantic network data model
that is used to create machine-understandable descriptions of the world and is
the basis of the Semantic Web. This article discusses the application of RDF to
the representation of computer software and virtual computing machines. The
Semantic Web is posited as not only a web of data, but also as a web of
programs and processes.
|
[
{
"version": "v1",
"created": "Sun, 24 Feb 2008 05:28:52 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Mar 2010 19:06:42 GMT"
}
] | 2011-05-26T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
]
] |
new_dataset
| 0.996168 |
1011.0390
|
Marko A. Rodriguez
|
Marko A. Rodriguez and Peter Neubauer
|
A Path Algebra for Multi-Relational Graphs
| null |
2nd International Workshop on Graph Data Management (GDM'11), pp.
128-131, IEEE, Hannover, Germany, April 2011
|
10.1109/ICDEW.2011.5767613
| null |
cs.DM cs.FL
|
http://creativecommons.org/licenses/publicdomain/
|
A multi-relational graph maintains two or more relations over a vertex set.
This article defines an algebra for traversing such graphs that is based on an
$n$-ary relational algebra, a concatenative single-relational path algebra, and
a tensor-based multi-relational algebra. The presented algebra provides a
monoid, automata, and formal language theoretic foundation for the construction
of a multi-relational graph traversal engine.
|
[
{
"version": "v1",
"created": "Mon, 1 Nov 2010 17:33:46 GMT"
}
] | 2011-05-26T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
],
[
"Neubauer",
"Peter",
""
]
] |
new_dataset
| 0.994511 |
1105.4683
|
Xiaofu Wu Dr
|
Xiaofu Wu, Chunming Zhao, and Xiaohu You
|
On the BCJR Algorithm for Asynchronous Physical-layer Network Coding
|
3 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In practical asynchronous bi-directional relaying, symbols transmitted by two
source nodes cannot arrive at the relay with perfect symbol alignment and the
symbol-asynchronous multiple-access channel (MAC) should be seriously
considered. Recently, Lu et al. proposed a Tanner-graph representation of
symbol-asynchronous MAC with rectangular-pulse shaping and further developed
the message-passing algorithm for optimal decoding of the asynchronous
physical-layer network coding. In this paper, we present a general channel
model for the asynchronous multiple-access channel with arbitrary
pulse-shaping. Then, the Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithm is
developed for optimal decoding of asynchronous MAC channel. This formulation
can be well employed to develop various low-complexity algorithms, such as
Log-MAP algorithm, Max-Log-MAP algorithm, which are favorable in practice.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2011 05:55:08 GMT"
}
] | 2011-05-25T00:00:00 |
[
[
"Wu",
"Xiaofu",
""
],
[
"Zhao",
"Chunming",
""
],
[
"You",
"Xiaohu",
""
]
] |
new_dataset
| 0.99677 |
1105.4712
|
H.R. Chennamma
|
H. R. Chennamma, Lalitha Rangarajan
|
Image Splicing Detection Using Inherent Lens Radial Distortion
|
10 pages, 23 figures, 6 tables, Published in IJCSI
|
IJCSI International Journal of Computer Science Issues, Vol. 7,
Issue 6, November 2010, pp. 149-158, ISSN (OnlinePrint): 1694-0814
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image splicing is a common form of image forgery. Such alterations may leave
no visual clues of tampering. In recent works camera characteristics
consistency across the image has been used to establish the authenticity and
integrity of digital images. Such constant camera characteristic properties are
inherent from camera manufacturing processes and are unique. The majority of
digital cameras are equipped with spherical lens and this introduces radial
distortions on images. This aberration is often disturbed and fails to be
consistent across the image, when an image is spliced. This paper describes the
detection of splicing operation on images by estimating radial distortion from
different portions of the image using line-based calibration. For the first
time, the detection of image splicing through the verification of consistency
of lens radial distortion has been explored in this paper. The conducted
experiments demonstrate the efficacy of our proposed approach for the detection
of image splicing on both synthetic and real images.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2011 09:05:04 GMT"
}
] | 2011-05-25T00:00:00 |
[
[
"Chennamma",
"H. R.",
""
],
[
"Rangarajan",
"Lalitha",
""
]
] |
new_dataset
| 0.968506 |
1003.0054
|
Rahul Srivastava
|
Rahul Srivastava and Can Emre Koksal
|
Energy Optimal Transmission Scheduling in Wireless Sensor Networks
|
Accepted for publication in the IEEE Transactions on Wireless
Communications
| null |
10.1109/TWC.2010.05.090275
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the main issues in the design of sensor networks is energy efficient
communication of time-critical data. Energy wastage can be caused by failed
packet transmission attempts at each node due to channel dynamics and
interference. Therefore transmission control techniques that are unaware of the
channel dynamics can lead to suboptimal channel use patterns. In this paper we
propose a transmission controller that utilizes different "grades" of channel
side information to schedule packet transmissions in an optimal way, while
meeting a deadline constraint for all packets waiting in the transmission
queue. The wireless channel is modeled as a finite-state Markov channel. We are
specifically interested in the case where the transmitter has low-grade channel
side information that can be obtained based solely on the ACK/NAK sequence for
the previous transmissions. Our scheduler is readily implementable and it is
based on the dynamic programming solution to the finite-horizon transmission
control problem. We also calculate the information theoretic capacity of the
finite state Markov channel with feedback containing different grades of
channel side information including that, obtained through the ACK/NAK sequence.
We illustrate that our scheduler achieves a given throughput at a power level
that is fairly close to the fundamental limit achievable over the channel.
|
[
{
"version": "v1",
"created": "Sat, 27 Feb 2010 04:01:09 GMT"
}
] | 2011-05-24T00:00:00 |
[
[
"Srivastava",
"Rahul",
""
],
[
"Koksal",
"Can Emre",
""
]
] |
new_dataset
| 0.96807 |
1105.4183
|
Rocio Gonzalez-Diaz
|
Rocio Gonzalez-Diaz, Maria Jose Jimenez, Belen Medrano
|
Cubical Cohomology Ring of 3D Photographs
| null |
Cubical cohomology ring of 3D photographs. International Journal
of Imaging Systems and Technology. Volume 21, Issue 1, March 2011, Pages:
76--85, Rocio Gonzalez-Diaz, Maria Jose Jimenez and Belen Medrano
|
10.1002/ima.20271
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cohomology and cohomology ring of three-dimensional (3D) objects are
topological invariants that characterize holes and their relations. Cohomology
ring has been traditionally computed on simplicial complexes. Nevertheless,
cubical complexes deal directly with the voxels in 3D images, no additional
triangulation is necessary, facilitating efficient algorithms for the
computation of topological invariants in the image context. In this paper, we
present formulas to directly compute the cohomology ring of 3D cubical
complexes without making use of any additional triangulation. Starting from a
cubical complex $Q$ that represents a 3D binary-valued digital picture whose
foreground has one connected component, we compute first the cohomological
information on the boundary of the object, $\partial Q$ by an incremental
technique; then, using a face reduction algorithm, we compute it on the whole
object; finally, applying the mentioned formulas, the cohomology ring is
computed from such information.
|
[
{
"version": "v1",
"created": "Fri, 20 May 2011 22:12:41 GMT"
}
] | 2011-05-24T00:00:00 |
[
[
"Gonzalez-Diaz",
"Rocio",
""
],
[
"Jimenez",
"Maria Jose",
""
],
[
"Medrano",
"Belen",
""
]
] |
new_dataset
| 0.999086 |
1105.4380
|
Labib Francis Gergis Francis
|
Labib Francis Gergis
|
Performance of MF-MSK Systems with Pre-distortion Schemes
|
9 Pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Efficient RF power amplifiers used in third generation systems require
linearization in order to reduce adjacent channel inter-modulation distortion,
without sacrificing efficiency. Digital baseband predistortion is a highly
cost-effective way to linearize power amplifiers (PAs). New communications
services have created a demand for highly linear high power amplifiers (HPA's).
Traveling Wave Tubes Amplifiers (TWTA) continue to offer the best microwave HPA
performance in terms of power efficiency, size and cost, but lag behind Solid
State Power Amplifiers (SSAP's) in linearity. This paper presents a technique
for improving TWTA linearity. The use of predistorter (PD) linearization
technique is described to provide TWTA performance comparable or superior to
conventional SSPA's. The characteristics of the PD scheme is derived based on
the extension of Saleh's model for HPA. The analysis results of Multi-frequency
Minimum Shift Keying (MF-MSK) in non-linear channels are presented in this
paper.
|
[
{
"version": "v1",
"created": "Sun, 22 May 2011 23:30:28 GMT"
}
] | 2011-05-24T00:00:00 |
[
[
"Gergis",
"Labib Francis",
""
]
] |
new_dataset
| 0.963472 |
1105.4431
|
Mostafa Zaman Chowdhury
|
Mostafa Zaman Chowdhury, Bui Minh Trung, Yeong Min Jang, Young-Il Kim,
and Won Ryu
|
Service Level Agreement for the QoS Guaranteed Mobile IPTV Services over
Mobile WiMAX Networks
|
6 pages, 5 figures
|
The Journal of Korea Information and Communications Society
(KICS), vol.36, no.4, April 2011
| null | null |
cs.MM cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While mobile IPTV services are supported through the mobile WiMAX networks,
there must need some guaranteed bandwidth for the IPTV services especially if
IPTV and non-IPTV services are simultaneously supported by the mobile WiMAX
networks. The quality of an IPTV service definitely depends on the allocated
bandwidth for that channel. However, due to the high quality IPTV services and
to support of huge non-IPTV traffic over mobile WiMAX networks, it is not
possible to guarantee the sufficient amount of the limited mobile WiMAX
bandwidth for the mobile IPTV services every time. A Service Level Agreement
(SLA) between the mobile IPTV service provider and mobile WiMAX network
operator to reserve sufficient bandwidth for the IPTV calls can increase the
satisfaction level of the mobile IPTV users. In this paper, we propose a SLA
negotiation procedure for mobile IPTV users over mobile WiMAX networks. The
Bandwidth Broker controls the allocated bandwidth for IPTV and non-IPTV users.
The proposed dynamically reserved bandwidth for the IPTV services increases the
IPTV user's satisfaction level. The simulation results state that, our proposed
scheme is able to provide better user satisfaction level for the IPTV users.
|
[
{
"version": "v1",
"created": "Mon, 23 May 2011 08:30:58 GMT"
}
] | 2011-05-24T00:00:00 |
[
[
"Chowdhury",
"Mostafa Zaman",
""
],
[
"Trung",
"Bui Minh",
""
],
[
"Jang",
"Yeong Min",
""
],
[
"Kim",
"Young-Il",
""
],
[
"Ryu",
"Won",
""
]
] |
new_dataset
| 0.997734 |
0803.0858
|
Oleg Verbitsky
|
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg
Verbitsky
|
Untangling planar graphs from a specified vertex position - Hard cases
|
18 pages, 4 figures. Lemma 3.3 is corrected, several amendments are
made throughout the paper
|
Discrete Applied Mathematics 159:8 (2011) 789-799
|
10.1016/j.dam.2011.01.011
| null |
cs.DM cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a planar graph $G$, we consider drawings of $G$ in the plane where
edges are represented by straight line segments (which possibly intersect).
Such a drawing is specified by an injective embedding $\pi$ of the vertex set
of $G$ into the plane. We prove that a wheel graph $W_n$ admits a drawing $\pi$
such that, if one wants to eliminate edge crossings by shifting vertices to new
positions in the plane, then at most $(2+o(1))\sqrt n$ of all $n$ vertices can
stay fixed. Moreover, such a drawing $\pi$ exists even if it is presupposed
that the vertices occupy any prescribed set of points in the plane. Similar
questions are discussed for other families of planar graphs.
|
[
{
"version": "v1",
"created": "Thu, 6 Mar 2008 13:08:41 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Mar 2008 17:15:12 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Dec 2008 22:44:03 GMT"
},
{
"version": "v4",
"created": "Wed, 3 Jun 2009 13:26:44 GMT"
},
{
"version": "v5",
"created": "Tue, 23 Nov 2010 09:59:13 GMT"
}
] | 2011-05-20T00:00:00 |
[
[
"Kang",
"Mihyun",
""
],
[
"Pikhurko",
"Oleg",
""
],
[
"Ravsky",
"Alexander",
""
],
[
"Schacht",
"Mathias",
""
],
[
"Verbitsky",
"Oleg",
""
]
] |
new_dataset
| 0.994667 |
1105.3715
|
Anderson Vieira
|
Carlos Augusto Almeida Alcantara, Anderson Luiz Nogueira Vieira
|
Tecnologia M\'ovel: Uma Tend\^encia, Uma Realidade
|
Artigo defendido no II Workshop de Redes na Universidade Est\'acio de
S\'a, Juiz de Fora, MG, Brasil
|
PEREZ, Marin, Grande Crescimento para o Com\'ercio M\'ovel,
InformationWeek EUA -- 2009. Praestro Convergence - ebook Mobile Marketing:
Mobile Marketing: Conceitos, Tecnologias e Cases, 2009
| null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Currently, mobility presents itself as a major innovation in historic
technological revolution. From the first decade of this century, nothing
compares to what happened in the field of Information Technology (IT), which is
adding to market a range of news relating to infrastructure such as mobile
computing hardware, software, computer networks, etc.. From a handheld as a
wireless device, iPad, Smartphone, you can connect to the digital world,
people, customers, business partners, etc.. Given the infinite range of
information, services and resources available in the electronic world, it is
considered that few are those, markets and people who want to be left behind.
The interest in this channel of communication becomes not only a new strategy
of marketing and communications. Mobile devices are becoming more sophisticated
and allows access to the web. Thinking in this context is that manufacturers of
electronic components face each other in a war over the disputed technology to
a competitive environment that is open to those who put on the market the
product more attractive, interactive and versatile.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2011 18:49:17 GMT"
}
] | 2011-05-20T00:00:00 |
[
[
"Alcantara",
"Carlos Augusto Almeida",
""
],
[
"Vieira",
"Anderson Luiz Nogueira",
""
]
] |
new_dataset
| 0.999707 |
1105.3790
|
Jun-Chao Lu
|
Jun-Chao Lu, Yu-Yi Chen, Zhen-Jie Qiu, Jinn-Ke Jan
|
A Secure RFID Deactivation/Activation Mechanism for Supporting Customer
Service and Consumer Shopping
|
submitting to computer communication (COMCOM) at 2010.12.28
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RFID has been regarded as a time and money-saving solution for a wide variety
of applications, such as manufacturing, supply chain management, and inventory
control, etc. However, there are some security problems on RFID in the product
managements. The most concerned issues are the tracking and the location
privacy. Numerous scholars tried to solve these problems, but their proposals
do not include the after-sales service. In this paper, we propose a purchase
and after-sales service RFID scheme for shopping mall. The location privacy,
confidentiality, data integrity, and some security protection are hold in this
propose mechanism.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2011 05:13:32 GMT"
}
] | 2011-05-20T00:00:00 |
[
[
"Lu",
"Jun-Chao",
""
],
[
"Chen",
"Yu-Yi",
""
],
[
"Qiu",
"Zhen-Jie",
""
],
[
"Jan",
"Jinn-Ke",
""
]
] |
new_dataset
| 0.996182 |
1105.3835
|
Nestor Hatzidiamantis
|
Nestor D. Chatzidiamantis, Diomidis S. Michalopoulos, Emmanouil E.
Kriezis, George K. Karagiannidis and Robert Schober
|
Protocols for Relay-Assisted Free-Space Optical Systems
|
25 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate transmission protocols for relay-assisted free-space optical
(FSO) systems, when multiple parallel relays are employed and there is no
direct link between the source and the destination. As alternatives to
all-active FSO relaying, where all the available relays transmit concurrently,
we propose schemes that select only a single relay to participate in the
communication between the source and the destination in each transmission slot.
This selection is based on the channel state information (CSI) obtained either
from all or from some of the FSO links. Thus, the need for synchronizing the
relays' transmissions is avoided and the slowly varying nature of the
atmospheric channel is exploited. For both relay selection and all-active
relaying, novel closed-form expressions for their outage performance are
derived, assuming the versatile Gamma-Gamma channel model. Furthermore, based
on the derived analytical results, the problem of allocating the optical power
resources to the FSO links is addressed, and optimum and suboptimum solutions
are proposed. Numerical results are provided for equal and non-equal length FSO
links, which illustrate the outage behavior of the considered relaying
protocols and demonstrate the significant performance gains offered by the
proposed power allocation schemes.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2011 10:31:28 GMT"
}
] | 2011-05-20T00:00:00 |
[
[
"Chatzidiamantis",
"Nestor D.",
""
],
[
"Michalopoulos",
"Diomidis S.",
""
],
[
"Kriezis",
"Emmanouil E.",
""
],
[
"Karagiannidis",
"George K.",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.956088 |
1105.3685
|
Afzal Godil
|
Afzal Godil, Zhouhui Lian, Helin Dutagaci, Rui Fang, Vanamali T.P.,
Chun Pan Cheung
|
Benchmarks, Performance Evaluation and Contests for 3D Shape Retrieval
|
Performance Metrics for Intelligent Systems (PerMIS'10) Workshop,
September, 2010
| null | null | null |
cs.CV cs.CG
|
http://creativecommons.org/licenses/publicdomain/
|
Benchmarking of 3D Shape retrieval allows developers and researchers to
compare the strengths of different algorithms on a standard dataset. Here we
describe the procedures involved in developing a benchmark and issues involved.
We then discuss some of the current 3D shape retrieval benchmarks efforts of
our group and others. We also review the different performance evaluation
measures that are developed and used by researchers in the community. After
that we give an overview of the 3D shape retrieval contest (SHREC) tracks run
under the EuroGraphics Workshop on 3D Object Retrieval and give details of
tracks that we organized for SHREC 2010. Finally we demonstrate some of the
results based on the different SHREC contest tracks and the NIST shape
benchmark.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2011 16:48:47 GMT"
}
] | 2011-05-19T00:00:00 |
[
[
"Godil",
"Afzal",
""
],
[
"Lian",
"Zhouhui",
""
],
[
"Dutagaci",
"Helin",
""
],
[
"Fang",
"Rui",
""
],
[
"P.",
"Vanamali T.",
""
],
[
"Cheung",
"Chun Pan",
""
]
] |
new_dataset
| 0.999586 |
0811.3448
|
William Gilreath
|
William F. Gilreath
|
Binar Sort: A Linear Generalized Sorting Algorithm
|
PDF from Word, 25-pages, 2-figures, 4-diagrams, version 2.0
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sorting is a common and ubiquitous activity for computers. It is not
surprising that there exist a plethora of sorting algorithms. For all the
sorting algorithms, it is an accepted performance limit that sorting algorithms
are linearithmic or O(N lg N). The linearithmic lower bound in performance
stems from the fact that the sorting algorithms use the ordering property of
the data. The sorting algorithm uses comparison by the ordering property to
arrange the data elements from an initial permutation into a sorted
permutation.
Linear O(N) sorting algorithms exist, but use a priori knowledge of the data
to use a specific property of the data and thus have greater performance. In
contrast, the linearithmic sorting algorithms are generalized by using a
universal property of data-comparison, but have a linearithmic performance
lower bound. The trade-off in sorting algorithms is generality for performance
by the chosen property used to sort the data elements.
A general-purpose, linear sorting algorithm in the context of the trade-off
of performance for generality at first consideration seems implausible. But,
there is an implicit assumption that only the ordering property is universal.
But, as will be discussed and examined, it is not the only universal property
for data elements. The binar sort is a general-purpose sorting algorithm that
uses this other universal property to sort linearly.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2008 01:38:09 GMT"
},
{
"version": "v2",
"created": "Tue, 17 May 2011 04:19:05 GMT"
}
] | 2011-05-18T00:00:00 |
[
[
"Gilreath",
"William F.",
""
]
] |
new_dataset
| 0.998553 |
1105.3388
|
Tran Ngoc Duong
|
Alice Nguyenova-Stepanikova and Tran Ngoc Duong
|
The block cipher NSABC (public domain)
|
22 pages, 4 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce NSABC/w -- Nice-Structured Algebraic Block Cipher using w-bit
word arithmetic, a 4w-bit analogous of Skipjack [NSA98] with 5w-bit key. The
Skipjack's internal 4-round Feistel structure is replaced with a w-bit, 2-round
cascade of a binary operation (x,z)\mapsto(x\boxdot z)\lll(w/2) that permutes a
text word x under control of a key word z. The operation \boxdot, similarly to
the multiplication in IDEA [LM91, LMM91], bases on an algebraic group over
w-bit words, so it is also capable of decrypting by means of the inverse
element of z in the group. The cipher utilizes a secret 4w-bit tweak -- an
easily changeable parameter with unique value for each block encrypted under
the same key [LRW02] -- that is derived from the block index and an additional
4w -bit key. A software implementation for w=64 takes circa 9 clock cycles per
byte on x86-64 processors.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2011 14:16:18 GMT"
}
] | 2011-05-18T00:00:00 |
[
[
"Nguyenova-Stepanikova",
"Alice",
""
],
[
"Duong",
"Tran Ngoc",
""
]
] |
new_dataset
| 0.999248 |
1005.2581
|
Kamran Karimi
|
Kamran Karimi, Neil G. Dickson, and Firas Hamze
|
A Performance Comparison of CUDA and OpenCL
|
12 pages, 6 Tables, 5 Figures
| null | null | null |
cs.PF cs.DC physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CUDA and OpenCL are two different frameworks for GPU programming. OpenCL is
an open standard that can be used to program CPUs, GPUs, and other devices from
different vendors, while CUDA is specific to NVIDIA GPUs. Although OpenCL
promises a portable language for GPU programming, its generality may entail a
performance penalty. In this paper, we use complex, near-identical kernels from
a Quantum Monte Carlo application to compare the performance of CUDA and
OpenCL. We show that when using NVIDIA compiler tools, converting a CUDA kernel
to an OpenCL kernel involves minimal modifications. Making such a kernel
compile with ATI's build tools involves more modifications. Our performance
tests measure and compare data transfer times to and from the GPU, kernel
execution times, and end-to-end application execution times for both CUDA and
OpenCL.
|
[
{
"version": "v1",
"created": "Fri, 14 May 2010 17:41:53 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Aug 2010 18:25:57 GMT"
},
{
"version": "v3",
"created": "Mon, 16 May 2011 16:39:03 GMT"
}
] | 2011-05-17T00:00:00 |
[
[
"Karimi",
"Kamran",
""
],
[
"Dickson",
"Neil G.",
""
],
[
"Hamze",
"Firas",
""
]
] |
new_dataset
| 0.979375 |
1105.2874
|
Vassilis Giakoumakis
|
Andreas Brandst\"adt, Vassilis Giakoumakis
|
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and
Algorithmic Consequences
|
14 Pages, 1 figure
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Clique separator decomposition introduced by Tarjan and Whitesides is one of
the most important graph decompositions. A graph is an {\em atom} if it has no
clique separator. A {\em hole} is a chordless cycle with at least five
vertices, and an {\em antihole} is the complement graph of a hole. A graph is
{\em weakly chordal} if it is hole- and antihole-free. $K_4-e$ is also called
{\em diamond}. {\em Paraglider} has five vertices four of which induce a
diamond, and the fifth vertex sees exactly the two vertices of degree two in
the diamond. In this paper we show that atoms of hole- and diamond-free graphs
(of hole- and paraglider-free graphs, respectively) are either weakly chordal
or of a very specific structure. Hole- and paraglider-free graphs are perfect
graphs. The structure of their atoms leads to efficient algorithms for various
problems.
|
[
{
"version": "v1",
"created": "Sat, 14 May 2011 08:54:32 GMT"
}
] | 2011-05-17T00:00:00 |
[
[
"Brandstädt",
"Andreas",
""
],
[
"Giakoumakis",
"Vassilis",
""
]
] |
new_dataset
| 0.998369 |
1105.3116
|
Roman Kolpakov
|
Roman Kolpakov, Michael Rao
|
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10
letters
|
13 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give lower bounds on the growth rate of Dejean words, i.e. minimally
repetitive words, over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10. Put
together with the known upper bounds, we estimate these growth rates with the
precision of 0,005. As an consequence, we establish the exponential growth of
the number of Dejean words over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2011 15:06:26 GMT"
}
] | 2011-05-17T00:00:00 |
[
[
"Kolpakov",
"Roman",
""
],
[
"Rao",
"Michael",
""
]
] |
new_dataset
| 0.989139 |
1105.2624
|
Carlo Condo
|
Carlo Condo, Guido Masera
|
A Flexible LDPC code decoder with a Network on Chip as underlying
interconnect architecture
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LDPC (Low Density Parity Check) codes are among the most powerful and widely
adopted modern error correcting codes. The iterative decoding algorithms
required for these codes involve high computational complexity and high
processing throughput is achieved by allocating a sufficient number of
processing elements (PEs). Supporting multiple heterogeneous LDPC codes on a
parallel decoder poses serious problems in the design of the interconnect
structure for such PEs. The aim of this work is to explore the feasibility of
NoC (Network on Chip) based decoders, where full flexibility in terms of
supported LDPC codes is obtained resorting to an NoC to connect PEs. NoC based
LDPC decoders have been previously considered unfeasible because of the cost
overhead associated to packet management and routing. On the contrary, the
designed NoC adopts a low complexity routing, which introduces a very limited
cost overhead with respect to architectures dedicated to specific classes of
codes. Moreover the paper proposes an efficient configuration technique, which
allows for fast on--the--fly switching among different codes. The decoder
architecture is scalable and VLSI synthesis results are presented for several
cases of study, including the whole set of WiMAX LDPC codes, WiFi codes and
DVB-S2 standard.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2011 07:17:16 GMT"
}
] | 2011-05-16T00:00:00 |
[
[
"Condo",
"Carlo",
""
],
[
"Masera",
"Guido",
""
]
] |
new_dataset
| 0.995424 |
1105.2554
|
Lars Bergstrom
|
Sven Auhagen, Lars Bergstrom, Matthew Fluet, John Reppy
|
Garbage Collection for Multicore NUMA Machines
|
To appear in Memory Systems Performance and Correctness 2011 (MSPC11)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern high-end machines feature multiple processor packages, each of which
contains multiple independent cores and integrated memory controllers connected
directly to dedicated physical RAM. These packages are connected via a shared
bus, creating a system with a heterogeneous memory hierarchy. Since this shared
bus has less bandwidth than the sum of the links to memory, aggregate memory
bandwidth is higher when parallel threads all access memory local to their
processor package than when they access memory attached to a remote package.
This bandwidth limitation has traditionally limited the scalability of modern
functional language implementations, which seldom scale well past 8 cores, even
on small benchmarks.
This work presents a garbage collector integrated with our strict, parallel
functional language implementation, Manticore, and shows that it scales
effectively on both a 48-core AMD Opteron machine and a 32-core Intel Xeon
machine.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2011 19:41:34 GMT"
}
] | 2011-05-13T00:00:00 |
[
[
"Auhagen",
"Sven",
""
],
[
"Bergstrom",
"Lars",
""
],
[
"Fluet",
"Matthew",
""
],
[
"Reppy",
"John",
""
]
] |
new_dataset
| 0.997225 |
1012.5815
|
Tamal Ghosh Tamal Ghosh
|
Tamal Ghosh, Mousumi Modak and Pranab K Dan
|
SAPFOCS: a metaheuristic based approach to part family formation
problems in group technology
|
10 pages; 6 figures; 12 tables
|
nternational Journal of Management Science International Journal
of Management Science and Engineering Management, 6(3): 231-240, 2011
| null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article deals with Part family formation problem which is believed to be
moderately complicated to be solved in polynomial time in the vicinity of Group
Technology (GT). In the past literature researchers investigated that the part
family formation techniques are principally based on production flow analysis
(PFA) which usually considers operational requirements, sequences and time.
Part Coding Analysis (PCA) is merely considered in GT which is believed to be
the proficient method to identify the part families. PCA classifies parts by
allotting them to different families based on their resemblances in: (1) design
characteristics such as shape and size, and/or (2) manufacturing
characteristics (machining requirements). A novel approach based on simulated
annealing namely SAPFOCS is adopted in this study to develop effective part
families exploiting the PCA technique. Thereafter Taguchi's orthogonal design
method is employed to solve the critical issues on the subject of parameters
selection for the proposed metaheuristic algorithm. The adopted technique is
therefore tested on 5 different datasets of size 5 {\times} 9 to 27 {\times} 9
and the obtained results are compared with C-Linkage clustering technique. The
experimental results reported that the proposed metaheuristic algorithm is
extremely effective in terms of the quality of the solution obtained and has
outperformed C-Linkage algorithm in most instances.
|
[
{
"version": "v1",
"created": "Tue, 28 Dec 2010 18:57:04 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 07:18:26 GMT"
}
] | 2011-05-12T00:00:00 |
[
[
"Ghosh",
"Tamal",
""
],
[
"Modak",
"Mousumi",
""
],
[
"Dan",
"Pranab K",
""
]
] |
new_dataset
| 0.984373 |
1105.2202
|
Vadim E. Levit
|
Vadim E. Levit and Eugen Mandrescu
|
On Symmetry of Independence Polynomials
|
16 pages, 13 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An independent set in a graph is a set of pairwise non-adjacent vertices, and
alpha(G) is the size of a maximum independent set in the graph G. A matching is
a set of non-incident edges, while mu(G) is the cardinality of a maximum
matching.
If s_{k} is the number of independent sets of cardinality k in G, then
I(G;x)=s_{0}+s_{1}x+s_{2}x^{2}+...+s_{\alpha(G)}x^{\alpha(G)} is called the
independence polynomial of G (Gutman and Harary, 1983). If
$s_{j}=s_{\alpha-j}$, 0=< j =< alpha(G), then I(G;x) is called symmetric (or
palindromic). It is known that the graph G*2K_{1} obtained by joining each
vertex of G to two new vertices, has a symmetric independence polynomial
(Stevanovic, 1998). In this paper we show that for every graph G and for each
non-negative integer k =< mu(G), one can build a graph H, such that: G is a
subgraph of H, I(H;x) is symmetric, and I(G*2K_{1};x)=(1+x)^{k}*I(H;x).
|
[
{
"version": "v1",
"created": "Wed, 11 May 2011 14:22:17 GMT"
}
] | 2011-05-12T00:00:00 |
[
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] |
new_dataset
| 0.982964 |
1105.2228
|
Shay Mozes
|
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum,
Christian Wulff-Nilsen
|
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in
Near-Linear Time
|
18 pages, 1 figure
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an O(n log^3 n) algorithm that, given an n-node directed planar graph
with arc capacities, a set of source nodes, and a set of sink nodes, finds a
maximum flow from the sources to the sinks. Previously, the fastest algorithms
known for this problem were those for general graphs.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2011 15:56:42 GMT"
}
] | 2011-05-12T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Klein",
"Philip N.",
""
],
[
"Mozes",
"Shay",
""
],
[
"Nussbaum",
"Yahav",
""
],
[
"Wulff-Nilsen",
"Christian",
""
]
] |
new_dataset
| 0.981257 |
1102.1189
|
Pascal Vanier
|
Emmanuel Jeandel (LIF), Pascal Vanier (LIF)
|
Pi01 sets and tilings
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$
there is a tileset $\tau$ with a set of configurations $C$ such that
$P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a
computable set of configurations. As a consequence, if $P$ is countable, this
tileset has the exact same set of Turing degrees.
|
[
{
"version": "v1",
"created": "Sun, 6 Feb 2011 19:28:42 GMT"
},
{
"version": "v2",
"created": "Tue, 10 May 2011 12:41:10 GMT"
}
] | 2011-05-11T00:00:00 |
[
[
"Jeandel",
"Emmanuel",
"",
"LIF"
],
[
"Vanier",
"Pascal",
"",
"LIF"
]
] |
new_dataset
| 0.953273 |
1105.1376
|
Yannick Chevalier
|
Yannick Chevalier (IRIT)
|
Finitary Deduction Systems
|
30 pages. Work begun while in the CASSIS Project, INRIA Nancy Grand
Est
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptographic protocols are the cornerstone of security in distributed
systems. The formal analysis of their properties is accordingly one of the
focus points of the security community, and is usually split among two groups.
In the first group, one focuses on trace-based security properties such as
confidentiality and authentication, and provides decision procedures for the
existence of attacks for an on-line attackers. In the second group, one focuses
on equivalence properties such as privacy and guessing attacks, and provides
decision procedures for the existence of attacks for an offline attacker. In
all cases the attacker is modeled by a deduction system in which his possible
actions are expressed. We present in this paper a notion of finitary deduction
systems that aims at relating both approaches. We prove that for such deduction
systems, deciding equivalence properties for on-line attackers can be reduced
to deciding reachability properties in the same setting.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2011 20:01:26 GMT"
}
] | 2011-05-10T00:00:00 |
[
[
"Chevalier",
"Yannick",
"",
"IRIT"
]
] |
new_dataset
| 0.99785 |
1105.1436
|
Jingchao Chen
|
Jingchao Chen
|
Solving Rubik's Cube Using SAT Solvers
|
13 pages
|
SPA 2011: SAT for Practical Applications
| null | null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Rubik's Cube is an easily-understood puzzle, which is originally called the
"magic cube". It is a well-known planning problem, which has been studied for a
long time. Yet many simple properties remain unknown. This paper studies
whether modern SAT solvers are applicable to this puzzle. To our best
knowledge, we are the first to translate Rubik's Cube to a SAT problem. To
reduce the number of variables and clauses needed for the encoding, we replace
a naive approach of 6 Boolean variables to represent each color on each facelet
with a new approach of 3 or 2 Boolean variables. In order to be able to solve
quickly Rubik's Cube, we replace the direct encoding of 18 turns with the layer
encoding of 18-subtype turns based on 6-type turns. To speed up the solving
further, we encode some properties of two-phase algorithm as an additional
constraint, and restrict some move sequences by adding some constraint clauses.
Using only efficient encoding cannot solve this puzzle. For this reason, we
improve the existing SAT solvers, and develop a new SAT solver based on
PrecoSAT, though it is suited only for Rubik's Cube. The new SAT solver
replaces the lookahead solving strategy with an ALO (\emph{at-least-one})
solving strategy, and decomposes the original problem into sub-problems. Each
sub-problem is solved by PrecoSAT. The empirical results demonstrate both our
SAT translation and new solving technique are efficient. Without the efficient
SAT encoding and the new solving technique, Rubik's Cube will not be able to be
solved still by any SAT solver. Using the improved SAT solver, we can find
always a solution of length 20 in a reasonable time. Although our solver is
slower than Kociemba's algorithm using lookup tables, but does not require a
huge lookup table.
|
[
{
"version": "v1",
"created": "Sat, 7 May 2011 12:07:49 GMT"
}
] | 2011-05-10T00:00:00 |
[
[
"Chen",
"Jingchao",
""
]
] |
new_dataset
| 0.996364 |
1105.1534
|
Thomas Sperl
|
Thomas Sperl
|
Taking the redpill: Artificial Evolution in native x86 systems
|
21 pages, 1 figure
| null | null | null |
cs.NE q-bio.PE
|
http://creativecommons.org/licenses/by/3.0/
|
In analogon to successful artificial evolution simulations as Tierra or
avida, this text presents a way to perform artificial evolution in a native x86
system. The implementation of the artificial chemistry and first results of
statistical experiments are presented.
|
[
{
"version": "v1",
"created": "Sun, 8 May 2011 16:47:35 GMT"
}
] | 2011-05-10T00:00:00 |
[
[
"Sperl",
"Thomas",
""
]
] |
new_dataset
| 0.976545 |
0901.0733
|
\'Eric Martin
|
\'Eric A. Martin
|
Contextual hypotheses and semantics of logic programs
|
To appear in Theory and Practice of Logic Programming (TPLP) 46
pages, 3 figures
| null | null | null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Logic programming has developed as a rich field, built over a logical
substratum whose main constituent is a nonclassical form of negation, sometimes
coexisting with classical negation. The field has seen the advent of a number
of alternative semantics, with Kripke-Kleene semantics, the well-founded
semantics, the stable model semantics, and the answer-set semantics standing
out as the most successful. We show that all aforementioned semantics are
particular cases of a generic semantics, in a framework where classical
negation is the unique form of negation and where the literals in the bodies of
the rules can be `marked' to indicate that they can be the targets of
hypotheses. A particular semantics then amounts to choosing a particular
marking scheme and choosing a particular set of hypotheses. When a literal
belongs to the chosen set of hypotheses, all marked occurrences of that literal
in the body of a rule are assumed to be true, whereas the occurrences of that
literal that have not been marked in the body of the rule are to be derived in
order to contribute to the firing of the rule. Hence the notion of hypothetical
reasoning that is presented in this framework is not based on making global
assumptions, but more subtly on making local, contextual assumptions, taking
effect as indicated by the chosen marking scheme on the basis of the chosen set
of hypotheses. Our approach offers a unified view on the various semantics
proposed in logic programming, classical in that only classical negation is
used, and links the semantics of logic programs to mechanisms that endow
rule-based systems with the power to harness hypothetical reasoning.
|
[
{
"version": "v1",
"created": "Tue, 6 Jan 2009 22:50:22 GMT"
},
{
"version": "v2",
"created": "Fri, 6 May 2011 05:27:50 GMT"
}
] | 2011-05-09T00:00:00 |
[
[
"Martin",
"Éric A.",
""
]
] |
new_dataset
| 0.992678 |
1105.1261
|
Robin Scheibler
|
Robin Scheibler, Paul Hurley, Amina Chebira
|
Pruned Continuous Haar Transform of 2D Polygonal Patterns with
Application to VLSI Layouts
|
4 pages, 5 figures, 1 algorithm
|
R. Scheibler, P. Hurley, and A. Chebira, "Pruned Continuous Haar
Transform of 2D Polygonal Patterns with Application to VLSI Layouts," Proc.
of the 2010 IRAST Int. Cong. on Comp. App. and Computational Sci. (CACS
2010), pp. 984--987, 2010
| null | null |
cs.CE cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an algorithm for the efficient computation of the continuous
Haar transform of 2D patterns that can be described by polygons. These patterns
are ubiquitous in VLSI processes where they are used to describe design and
mask layouts. There, speed is of paramount importance due to the magnitude of
the problems to be solved and hence very fast algorithms are needed. We show
that by techniques borrowed from computational geometry we are not only able to
compute the continuous Haar transform directly, but also to do it quickly. This
is achieved by massively pruning the transform tree and thus dramatically
decreasing the computational load when the number of vertices is small, as is
the case for VLSI layouts. We call this new algorithm the pruned continuous
Haar transform. We implement this algorithm and show that for patterns found in
VLSI layouts the proposed algorithm was in the worst case as fast as its
discrete counterpart and up to 12 times faster.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2011 10:46:32 GMT"
}
] | 2011-05-09T00:00:00 |
[
[
"Scheibler",
"Robin",
""
],
[
"Hurley",
"Paul",
""
],
[
"Chebira",
"Amina",
""
]
] |
new_dataset
| 0.99715 |
1105.1279
|
Fanggang Wang
|
Fanggang Wang and Soung Chang Liew
|
Wireless MIMO Switching with Network Coding
|
This manuscript is an extention work of our previous paper "Wireless
MIMO Switching" and also with some results of a talk given in CUHK. The major
extention is that physical-layer network coding is used and significantly
improves the throughput performance
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a generic switching problem, a switching pattern consists of a one-to-one
mapping from a set of inputs to a set of outputs (i.e., a permutation). We
propose and investigate a wireless switching framework in which a multi-antenna
relay is responsible for switching traffic among a set of $N$ stations. We
refer to such a relay as a MIMO switch. With beamforming and linear detection,
the MIMO switch controls which stations are connected to which other stations.
Each beamforming matrix realizes a permutation pattern among the stations. We
refer to the corresponding permutation matrix as a switch matrix. By scheduling
a set of different switch matrices, full connectivity among the stations can be
established. In this paper, we focus on "fair switching" in which equal amounts
of traffic are to be delivered for all $N(N-1)$ ordered pairs of stations. In
particular, we investigate how the system throughput can be maximized. In
general, for large $N$ the number of possible switch matrices (i.e.,
permutations) is huge, making the scheduling problem combinatorially
challenging. We show that for the cases of N=4 and 5, only a subset of $N-1$
switch matrices need to be considered in the scheduling problem to achieve good
throughput. We conjecture that this will be the case for large $N$ as well.
This conjecture, if valid, implies that for practical purposes, fair-switching
scheduling is not an intractable problem. We also investigate MIMO switching
with physical-layer network coding in this paper. We find that it can improve
throughput appreciably.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2011 13:34:35 GMT"
}
] | 2011-05-09T00:00:00 |
[
[
"Wang",
"Fanggang",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.999254 |
1103.2165
|
Timon Hertli
|
Timon Hertli
|
3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
|
12 pages, no figures; critical variables are now called frozen, added
reference to Makino et al., shortened some proofs and fixed typos
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The PPSZ algorithm by Paturi, Pudl\'ak, Saks, and Zane [1998] is the fastest
known algorithm for Unique k-SAT, where the input formula does not have more
than one satisfying assignment. For k>=5 the same bounds hold for general
k-SAT. We show that this is also the case for k=3,4, using a slightly modified
PPSZ algorithm. We do the analysis by defining a cost for satisfiable CNF
formulas, which we prove to decrease in each PPSZ step by a certain amount.
This improves our previous best bounds with Moser and Scheder [2011] for 3-SAT
to O(1.308^n) and for 4-SAT to O(1.469^n).
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2011 23:18:35 GMT"
},
{
"version": "v2",
"created": "Thu, 5 May 2011 12:37:10 GMT"
}
] | 2011-05-06T00:00:00 |
[
[
"Hertli",
"Timon",
""
]
] |
new_dataset
| 0.95433 |
1105.0673
|
Cristian Danescu-Niculescu-Mizil
|
Cristian Danescu-Niculescu-Mizil, Michael Gamon, Susan Dumais
|
Mark My Words! Linguistic Style Accommodation in Social Media
|
Talk slides available at http://www.cs.cornell.edu/~cristian/www2011
|
Proceedings of WWW, pp. 141--150, 2009
|
10.1145/1963405.1963509
| null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The psycholinguistic theory of communication accommodation accounts for the
general observation that participants in conversations tend to converge to one
another's communicative behavior: they coordinate in a variety of dimensions
including choice of words, syntax, utterance length, pitch and gestures. In its
almost forty years of existence, this theory has been empirically supported
exclusively through small-scale or controlled laboratory studies. Here we
address this phenomenon in the context of Twitter conversations. Undoubtedly,
this setting is unlike any other in which accommodation was observed and, thus,
challenging to the theory. Its novelty comes not only from its size, but also
from the non real-time nature of conversations, from the 140 character length
restriction, from the wide variety of social relation types, and from a design
that was initially not geared towards conversation at all. Given such
constraints, it is not clear a priori whether accommodation is robust enough to
occur given the constraints of this new environment. To investigate this, we
develop a probabilistic framework that can model accommodation and measure its
effects. We apply it to a large Twitter conversational dataset specifically
developed for this task. This is the first time the hypothesis of linguistic
style accommodation has been examined (and verified) in a large scale, real
world setting. Furthermore, when investigating concepts such as stylistic
influence and symmetry of accommodation, we discover a complexity of the
phenomenon which was never observed before. We also explore the potential
relation between stylistic influence and network features commonly associated
with social status.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2011 20:00:05 GMT"
}
] | 2011-05-05T00:00:00 |
[
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Gamon",
"Michael",
""
],
[
"Dumais",
"Susan",
""
]
] |
new_dataset
| 0.989726 |
1105.0738
|
Kyuho Son Dr.
|
Kyuho Son, Soohwan Lee, Yung Yi and Song Chong
|
REFIM: A Practical Interference Management in Heterogeneous Wireless
Access Networks
|
13 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the increasing demand of capacity in wireless cellular networks, the
small cells such as pico and femto cells are becoming more popular to enjoy a
spatial reuse gain, and thus cells with different sizes are expected to coexist
in a complex manner. In such a heterogeneous environment, the role of
interference management (IM) becomes of more importance, but technical
challenges also increase, since the number of cell-edge users, suffering from
severe interference from the neighboring cells, will naturally grow. In order
to overcome low performance and/or high complexity of existing static and other
dynamic IM algorithms, we propose a novel low-complex and fully distributed IM
scheme, called REFIM, in the downlink of heterogeneous multi-cell networks. We
first formulate a general optimization problem that turns out to require
intractable computation complexity for global optimality. To have a practical
solution with low computational and signaling overhead, which is crucial for
low-cost small-cell solutions, e.g., femto cells, in REFIM, we decompose it
into per-BS problems based on the notion of reference user and reduce feedback
overhead over backhauls both temporally and spatially. We evaluate REFIM
through extensive simulations under various configurations, including the
scenarios from a real deployment of BSs. We show that, compared to the schemes
without IM, REFIM can yield more than 40% throughput improvement of cell-edge
users while increasing the overall performance by 10~107%. This is equal to
about 95% performance of the existing centralized IM algorithm that is known to
be near-optimal but hard to implement in practice due to prohibitive
complexity. We also present that as long as interference is managed well, the
spectrum sharing policy can outperform the best spectrum splitting policy where
the number of subchannels is optimally divided between macro and femto cells.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2011 05:56:04 GMT"
}
] | 2011-05-05T00:00:00 |
[
[
"Son",
"Kyuho",
""
],
[
"Lee",
"Soohwan",
""
],
[
"Yi",
"Yung",
""
],
[
"Chong",
"Song",
""
]
] |
new_dataset
| 0.975542 |
1105.0845
|
Henning Schnoor
|
Edith Hemaspaandra and Henning Schnoor
|
A Simplest Undecidable Modal Logic
|
18 pages
| null | null | null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modal logics are widely used in computer science. The complexity of their
satisfiability problems has been an active field of research since the 1970s.
We prove that even very "simple" modal logics can be undecidable: We show that
there is an undecidable modal logic that can be obtained by restricting the
allowed models with a first-order formula in which only universal quantifiers
appear.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2011 15:01:33 GMT"
}
] | 2011-05-05T00:00:00 |
[
[
"Hemaspaandra",
"Edith",
""
],
[
"Schnoor",
"Henning",
""
]
] |
new_dataset
| 0.980834 |
1105.0433
|
Prabhanjan Ananth
|
Prabhanjan Ananth and Ambedkar Dukkipati
|
On Gr\"obner Basis Detection for Zero-dimensional Ideals
|
6 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of
polynomials, decide whether there exists -and if "yes" find- a term order such
that the set of polynomials is a Gr\"obner basis. This problem was shown to be
NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the
context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD
for zero dimensional ideals is also proposed which runs in polynomial time if
the number of indeterminates is a constant.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 20:13:41 GMT"
}
] | 2011-05-04T00:00:00 |
[
[
"Ananth",
"Prabhanjan",
""
],
[
"Dukkipati",
"Ambedkar",
""
]
] |
new_dataset
| 0.982578 |
1105.0473
|
Shiwen Mao
|
Donglin Hu and Shiwen Mao
|
A Sensing Error Aware MAC Protocol for Cognitive Radio Networks
|
21 page, technical report
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive radios (CR) are intelligent radio devices that can sense the radio
environment and adapt to changes in the radio environment. Spectrum sensing and
spectrum access are the two key CR functions. In this paper, we present a
spectrum sensing error aware MAC protocol for a CR network collocated with
multiple primary networks. We explicitly consider both types of sensing errors
in the CR MAC design, since such errors are inevitable for practical spectrum
sensors and more important, such errors could have significant impact on the
performance of the CR MAC protocol. Two spectrum sensing polices are presented,
with which secondary users collaboratively sense the licensed channels. The
sensing policies are then incorporated into p-Persistent CSMA to coordinate
opportunistic spectrum access for CR network users. We present an analysis of
the interference and throughput performance of the proposed CR MAC, and find
the analysis highly accurate in our simulation studies. The proposed sensing
error aware CR MAC protocol outperforms two existing approaches with
considerable margins in our simulations, which justify the importance of
considering spectrum sensing errors in CR MAC design.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2011 03:53:32 GMT"
}
] | 2011-05-04T00:00:00 |
[
[
"Hu",
"Donglin",
""
],
[
"Mao",
"Shiwen",
""
]
] |
new_dataset
| 0.958633 |
1105.0661
|
Jan David Mol
|
Jan David Mol and John W. Romein
|
The LOFAR Beam Former: Implementation and Performance Analysis
| null | null | null | null |
cs.DC astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional radio telescopes use large, steel dishes to observe radio
sources. The LOFAR radio telescope is different, and uses tens of thousands of
fixed, non-movable antennas instead, a novel design that promises
ground-breaking research in astronomy. The antennas observe omnidirectionally,
and sky sources are observed by signal-processing techniques that combine the
data from all antennas.
Another new feature of LOFAR is the elaborate use of software to do signal
processing in real time, where traditional telescopes use custom-built
hardware. The use of software leads to an instrument that is inherently more
flexible. However, the enormous data rate (198 Gb/s of input data) and
processing requirements compel the use of a supercomputer: we use an IBM Blue
Gene/P.
This paper presents a collection of new processing pipelines, collectively
called the beam-forming pipelines, that greatly enhance the functionality of
the telescope. Where our first pipeline could only correlate data to create sky
images, the new pipelines allow the discovery of unknown pulsars, observations
of known pulsars, and (in the future), to observe cosmic rays and study
transient events. Unlike traditional telescopes, we can observe in hundreds of
directions simultaneously. This is useful, for example, to search the sky for
new pulsars. The use of software allows us to quickly add new functionality and
to adapt to new insights that fully exploit the novel features and the power of
our unique instrument. We also describe our optimisations to use the Blue
Gene/P at very high efficiencies, maximising the effectiveness of the entire
telescope. A thorough performance study identifies the limits of our system.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2011 19:28:06 GMT"
}
] | 2011-05-04T00:00:00 |
[
[
"Mol",
"Jan David",
""
],
[
"Romein",
"John W.",
""
]
] |
new_dataset
| 0.980791 |
1105.0034
|
Wenchi Cheng
|
Wenchi Cheng, Xi Zhang, Hailin Zhang
|
Full Duplex Wireless Communications for Cognitive Radio Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a key in cognitive radio networks (CRNs), dynamic spectrum access needs to
be carefully designed to minimize the interference and delay to the
\emph{primary} (licensed) users. One of the main challenges in dynamic spectrum
access is to determine when the \emph{secondary} (unlicensed) users can use the
spectrum. In particular, when the secondary user is using the spectrum, if the
primary user becomes active to use the spectrum, it is usually hard for the
secondary user to detect the primary user instantaneously, thus causing
unexpected interference and delay to primary users. The secondary user cannot
detect the presence of primary users instantaneously because the secondary user
is unable to detect the spectrum at the same time while it is transmitting. To
solve this problem, we propose the full duplex wireless communications scheme
for CRNs. In particular, we employ the Antennas Cancellation (AC), the RF
Interference Cancellation (RIC), and the Digital Interference Cancellation
(DIC) techniques for secondary users so that the secondary user can scan for
active primary users while it is transmitting. Once detecting the presence of
primary users, the secondary user will release the spectrum instantaneously to
avoid the interference and delay to primary users. We analyze the packet loss
rate of primary users in wireless full duplex CRNs, and compare them with the
packet loss rate of primary users in wireless half duplex CRNs. Our analyses
and simulations show that using our developped wireless full duplex CRNs, the
packet loss rate of primary users can be significantly decreased as compared
with that of primary users by using the half duplex CRNs.
|
[
{
"version": "v1",
"created": "Sat, 30 Apr 2011 00:17:51 GMT"
}
] | 2011-05-03T00:00:00 |
[
[
"Cheng",
"Wenchi",
""
],
[
"Zhang",
"Xi",
""
],
[
"Zhang",
"Hailin",
""
]
] |
new_dataset
| 0.999234 |
1105.0377
|
Samarendra Nath Sur
|
Rabindranath Bera, Subir Kumar Sarkar, Bikash Sharma, Samarendra Nath
Sur, Debasish Bhaskar and Soumyasree Bera
|
WiMAX Based 60 GHz Millimeter-Wave Communication for Intelligent
Transport System Applications
| null |
International Journal of Wireless & Mobile Networks (IJWMN) Vol.
3, No. 2, April 2011, 214-223
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the successful worldwide deployment of 3rd generation mobile
communication, security aspects are ensured partly. Researchers are now looking
for 4G mobile for its deployment with high data rate, enhanced security and
reliability so that world should look for CALM, Continuous Air interface for
Long and Medium range communication. This CALM will be a reliable high data
rate secured mobile communication to be deployed for car to car communication
(C2C) for safety application. This paper reviewed the WiMAX ,& 60 GHz RF
carrier for C2C. The system is tested at SMIT laboratory with multimedia
transmission and reception. With proper deployment of this 60 GHz system on
vehicles, the existing commercial products for 802.11P will be required to be
replaced or updated soon .
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 16:49:04 GMT"
}
] | 2011-05-03T00:00:00 |
[
[
"Bera",
"Rabindranath",
""
],
[
"Sarkar",
"Subir Kumar",
""
],
[
"Sharma",
"Bikash",
""
],
[
"Sur",
"Samarendra Nath",
""
],
[
"Bhaskar",
"Debasish",
""
],
[
"Bera",
"Soumyasree",
""
]
] |
new_dataset
| 0.998723 |
1105.0379
|
Anwitaman Datta
|
Frederique Oggier and Anwitaman Datta
|
Self-Repairing Codes for Distributed Storage - A Projective Geometric
Construction
|
5 pages, 2 figures
| null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self-Repairing Codes (SRC) are codes designed to suit the need of coding for
distributed networked storage: they not only allow stored data to be recovered
even in the presence of node failures, they also provide a repair mechanism
where as little as two live nodes can be contacted to regenerate the data of a
failed node. In this paper, we propose a new instance of self-repairing codes,
based on constructions of spreads coming from projective geometry. We study
some of their properties to demonstrate the suitability of these codes for
distributed networked storage.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 16:54:17 GMT"
}
] | 2011-05-03T00:00:00 |
[
[
"Oggier",
"Frederique",
""
],
[
"Datta",
"Anwitaman",
""
]
] |
new_dataset
| 0.999446 |
1105.0401
|
Wenchi Cheng
|
Wenchi Cheng, Xi Zhang, Hailin Zhang, Qiang Wang
|
On-Demand Based Wireless Resources Trading for Green Communications
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of Green Communications is to reduce the energy consumption of
the communication system as much as possible without compromising the quality
of service (QoS) for users. An effective approach for Green Wireless
Communications is On-Demand strategy, which scales power consumption with the
volume and location of user demand. Applying the On-Demand Communications
model, we propose a novel scheme -- Wireless Resource Trading, which
characterizes the trading relationship among different wireless resources for a
given number of performance metrics. According to wireless resource trading
relationship, different wireless resources can be consumed for the same set of
performance metrics. Therefore, to minimize the energy consumption for given
performance metrics, we can trade the other type of wireless resources for the
energy resource under the demanded performance metrics. Based on the wireless
resource trading relationship, we derive the optimal energy-bandwidth and
energy-time wireless resource trading relationship for green wireless
communications. We also develop an adaptive trading strategy by using different
bandwidths or different delays for different transmission distances with
available bandwidths and acceptable delay bounds in wireless networks. Our
conducted simulations show that the energy consumption of wireless networks can
be significantly reduced with our proposed wireless resources trading scheme.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 18:52:09 GMT"
}
] | 2011-05-03T00:00:00 |
[
[
"Cheng",
"Wenchi",
""
],
[
"Zhang",
"Xi",
""
],
[
"Zhang",
"Hailin",
""
],
[
"Wang",
"Qiang",
""
]
] |
new_dataset
| 0.994723 |
0912.5176
|
Yashodhan Kanoria
|
Yashodhan Kanoria and Andrea Montanari
|
On the deletion channel with small deletion probability
|
5 pages, 1 figure v3: minor corrections
|
IEEE Intl. Symp. Information Theory Proc. (2010) 1002-1006
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The deletion channel is the simplest point-to-point communication channel
that models lack of synchronization. Despite significant effort, little is
known about its capacity, and even less about optimal coding schemes. In this
paper we intiate a new systematic approach to this problem, by demonstrating
that capacity can be computed in a series expansion for small deletion
probability. We compute two leading terms of this expansion, and show that
capacity is achieved, up to this order, by i.i.d. uniform random distribution
of the input. We think that this strategy can be useful in a number of capacity
calculations.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 2009 13:18:09 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Feb 2010 04:05:26 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Jun 2010 05:55:12 GMT"
}
] | 2011-05-02T00:00:00 |
[
[
"Kanoria",
"Yashodhan",
""
],
[
"Montanari",
"Andrea",
""
]
] |
new_dataset
| 0.992835 |
1104.5608
|
F. Richard Yu
|
Quansheng Guan, F. Richard Yu, and Shengming Jiang
|
Topology Control and Routing in Mobile Ad Hoc Networks with Cognitive
Radios
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive radio (CR) technology will have significant impacts on upper layer
performance in mobile ad hoc networks (MANETs). In this paper, we study
topology control and routing in CR-MANETs. We propose a distributed
Prediction-based Cognitive Topology Control (PCTC) scheme to provision
cognition capability to routing in CR-MANETs. PCTC is a midware-like
cross-layer module residing between CR module and routing. The proposed PCTC
scheme uses cognitive link availability prediction, which is aware of the
interference to primary users, to predict the available duration of links in
CR-MANETs. Based on the link prediction, PCTC constructs an efficient and
reliable topology, which is aimed at mitigating re-routing frequency and
improving end-to-end network performance such as throughput and delay.
Simulation results are presented to show the effectiveness of the proposed
scheme.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2011 12:22:09 GMT"
}
] | 2011-05-02T00:00:00 |
[
[
"Guan",
"Quansheng",
""
],
[
"Yu",
"F. Richard",
""
],
[
"Jiang",
"Shengming",
""
]
] |
new_dataset
| 0.993317 |
1104.5660
|
Anissa Lamani
|
Sayaka Kamei, Anissa Lamani (MIS), Fukuhito Ooshita, S\'ebastien
Tixeuil (LIP6)
|
Asynchronous mobile robot gathering from symmetric configurations
without global multiplicity detection
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a set of k autonomous robots that are endowed with visibility
sensors (but that are otherwise unable to communicate) and motion actuators.
Those robots must collaborate to reach a sin- gle vertex that is unknown
beforehand, and to remain there hereafter. Previous works on gathering in
ring-shaped networks suggest that there exists a tradeoff between the size of
the set of potential initial configurations, and the power of the sensing
capabilities of the robots (i.e. the larger the initial configuration set, the
most powerful the sensor needs to be). We prove that there is no such trade
off. We propose a gathering protocol for an odd number of robots in a
ring-shaped network that allows symmetric but not periodic configurations as
initial configurations, yet uses only local weak multiplicity detection. Robots
are assumed to be anonymous and oblivious, and the execution model is the
non-atomic CORDA model with asynchronous fair scheduling. Our protocol allows
the largest set of initial configurations (with respect to impossibility
results) yet uses the weakest multiplicity detector to date. The time
complexity of our protocol is O(n2), where n denotes the size of the ring.
Compared to previous work that also uses local weak multiplicity detection, we
do not have the constraint that k < n/2 (here, we simply have 2 < k < n - 3).
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2011 15:20:45 GMT"
}
] | 2011-05-02T00:00:00 |
[
[
"Kamei",
"Sayaka",
"",
"MIS"
],
[
"Lamani",
"Anissa",
"",
"MIS"
],
[
"Ooshita",
"Fukuhito",
"",
"LIP6"
],
[
"Tixeuil",
"Sébastien",
"",
"LIP6"
]
] |
new_dataset
| 0.98452 |
0812.4322
|
Josef Cibulka
|
Josef Cibulka, Jan Kyn\v{c}l, Viola M\'esz\'aros, Rudolf Stola\v{r}
and Pavel Valtr
|
Solution of Peter Winkler's Pizza Problem
|
29 pages, 14 figures
|
In: Fete of Combinatorics and Computer Science, Bolyai Society
Mathematical Studies, vol. 20, pp. 63-93, Springer, 2010
|
10.1007/978-3-642-13580-4_4
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bob cuts a pizza into slices of not necessarily equal size and shares it with
Alice by alternately taking turns. One slice is taken in each turn. The first
turn is Alice's. She may choose any of the slices. In all other turns only
those slices can be chosen that have a neighbor slice already eaten. We prove a
conjecture of Peter Winkler by showing that Alice has a strategy for obtaining
4/9 of the pizza. This is best possible, that is, there is a cutting and a
strategy for Bob to get 5/9 of the pizza. We also give a characterization of
Alice's best possible gain depending on the number of slices. For a given
cutting of the pizza, we describe a linear time algorithm that computes Alice's
strategy gaining at least 4/9 of the pizza and another algorithm that computes
the optimal strategy for both players in any possible position of the game in
quadratic time. We distinguish two types of turns, shifts and jumps. We prove
that Alice can gain 4/9, 7/16 and 1/3 of the pizza if she is allowed to make at
most two jumps, at most one jump and no jump, respectively, and the three
constants are the best possible.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2008 01:18:01 GMT"
}
] | 2011-04-29T00:00:00 |
[
[
"Cibulka",
"Josef",
""
],
[
"Kynčl",
"Jan",
""
],
[
"Mészáros",
"Viola",
""
],
[
"Stolař",
"Rudolf",
""
],
[
"Valtr",
"Pavel",
""
]
] |
new_dataset
| 0.997542 |
1104.4601
|
Shibamouli Lahiri
|
Shibamouli Lahiri, Juan Pablo Fern\'andez Ram\'irez, Shikha Nangia,
Prasenjit Mitra, C. Lee Giles, Karl T. Mueller
|
ChemXSeer Digital Library Gaussian Search
|
4 pages, 6 figures, 2 tables
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on the Gaussian file search system designed as part of the
ChemXSeer digital library. Gaussian files are produced by the Gaussian software
[4], a software package used for calculating molecular electronic structure and
properties. The output files are semi-structured, allowing relatively easy
access to the Gaussian attributes and metadata. Our system is currently capable
of searching Gaussian documents using a boolean combination of atoms (chemical
elements) and attributes. We have also implemented a faceted browsing feature
on three important Gaussian attribute types - Basis Set, Job Type and Method
Used. The faceted browsing feature enables a user to view and process a
smaller, filtered subset of documents.
|
[
{
"version": "v1",
"created": "Sun, 24 Apr 2011 02:19:49 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Apr 2011 06:41:24 GMT"
}
] | 2011-04-29T00:00:00 |
[
[
"Lahiri",
"Shibamouli",
""
],
[
"Ramírez",
"Juan Pablo Fernández",
""
],
[
"Nangia",
"Shikha",
""
],
[
"Mitra",
"Prasenjit",
""
],
[
"Giles",
"C. Lee",
""
],
[
"Mueller",
"Karl T.",
""
]
] |
new_dataset
| 0.988562 |
1103.3310
|
Haris Aziz
|
Haris Aziz and Troels Bjerre S{\o}rensen
|
Path coalitional games
|
15 pages; To be presented at The Second Workshop on Cooperative Games
in Multiagent Systems (COOPMAS 2011)
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general framework to model strategic aspects and stable and fair
resource allocations in networks via variants and generalizations of path
coalitional games. In these games, a coalition of edges or vertices is
successful if it can enable an s-t path. We present polynomial-time algorithms
to compute and verify least core payoffs of cost-based generalizations of path
coalitional games and their duals, thereby settling a number of open problems.
The least core payoffs of path coalitional games are completely characterized
and a polynomial-time algorithm for computing the nucleolus of edge path
coalitional games on undirected series-parallel graphs is presented.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2011 22:26:15 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Apr 2011 10:08:49 GMT"
}
] | 2011-04-28T00:00:00 |
[
[
"Aziz",
"Haris",
""
],
[
"Sørensen",
"Troels Bjerre",
""
]
] |
new_dataset
| 0.996158 |
1104.5139
|
Hela Limam
|
Hela Limam and Jalel Akaichi
|
Web services synchronization health care application
|
18 pages, 12 figures
| null |
10.5121/ijwest.2011.2204
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advance of Web Services technologies and the emergence of Web
Services into the information space, tremendous opportunities for empowering
users and organizations appear in various application domains including
electronic commerce, travel, intelligence information gathering and analysis,
health care, digital government, etc. In fact, Web services appear to be s
solution for integrating distributed, autonomous and heterogeneous information
sources. However, as Web services evolve in a dynamic environment which is the
Internet many changes can occur and affect them. A Web service is affected when
one or more of its associated information sources is affected by schema
changes. Changes can alter the information sources contents but also their
schemas which may render Web services partially or totally undefined. In this
paper, we propose a solution for integrating information sources into Web
services. Then we tackle the Web service synchronization problem by
substituting the affected information sources. Our work is illustrated with a
healthcare case study.
|
[
{
"version": "v1",
"created": "Wed, 27 Apr 2011 13:43:12 GMT"
}
] | 2011-04-28T00:00:00 |
[
[
"Limam",
"Hela",
""
],
[
"Akaichi",
"Jalel",
""
]
] |
new_dataset
| 0.980004 |
1104.4843
|
Patrick Simmons
|
Patrick Simmons
|
Security Through Amnesia: A Software-Based Solution to the Cold Boot
Attack on Disk Encryption
|
13 pages, 4 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Disk encryption has become an important security measure for a multitude of
clients, including governments, corporations, activists, security-conscious
professionals, and privacy-conscious individuals. Unfortunately, recent
research has discovered an effective side channel attack against any disk
mounted by a running machine\cite{princetonattack}. This attack, known as the
cold boot attack, is effective against any mounted volume using
state-of-the-art disk encryption, is relatively simple to perform for an
attacker with even rudimentary technical knowledge and training, and is
applicable to exactly the scenario against which disk encryption is primarily
supposed to defend: an adversary with physical access. To our knowledge, no
effective software-based countermeasure to this attack supporting multiple
encryption keys has yet been articulated in the literature. Moreover, since no
proposed solution has been implemented in publicly available software, all
general-purpose machines using disk encryption remain vulnerable. We present
Loop-Amnesia, a kernel-based disk encryption mechanism implementing a novel
technique to eliminate vulnerability to the cold boot attack. We offer
theoretical justification of Loop-Amnesia's invulnerability to the attack,
verify that our implementation is not vulnerable in practice, and present
measurements showing our impact on I/O accesses to the encrypted disk is
limited to a slowdown of approximately 2x. Loop-Amnesia is written for x86-64,
but our technique is applicable to other register-based architectures. We base
our work on loop-AES, a state-of-the-art open source disk encryption package
for Linux.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2011 05:50:02 GMT"
}
] | 2011-04-27T00:00:00 |
[
[
"Simmons",
"Patrick",
""
]
] |
new_dataset
| 0.978149 |
1104.4927
|
Xiao Ma
|
Xiao Ma, Kai Zhang, Baoming Bai and Xiaoyi Zhang
|
Serial Concatenation of RS Codes with Kite Codes: Performance Analysis,
Iterative Decoding and Design
|
34 pages, 15 figures
| null | null | null |
cs.IT cs.PF math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new ensemble of rateless forward error correction
(FEC) codes. The proposed codes are serially concatenated codes with
Reed-Solomon (RS) codes as outer codes and Kite codes as inner codes. The inner
Kite codes are a special class of prefix rateless low-density parity-check
(PRLDPC) codes, which can generate potentially infinite (or as many as
required) random-like parity-check bits. The employment of RS codes as outer
codes not only lowers down error-floors but also ensures (with high
probability) the correctness of successfully decoded codewords. In addition to
the conventional two-stage decoding, iterative decoding between the inner code
and the outer code are also implemented to improve the performance further. The
performance of the Kite codes under maximum likelihood (ML) decoding is
analyzed by applying a refined Divsalar bound to the ensemble weight
enumerating functions (WEF). We propose a simulation-based optimization method
as well as density evolution (DE) using Gaussian approximations (GA) to design
the Kite codes. Numerical results along with semi-analytic bounds show that the
proposed codes can approach Shannon limits with extremely low error-floors. It
is also shown by simulation that the proposed codes performs well within a wide
range of signal-to-noise-ratios (SNRs).
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2011 14:05:51 GMT"
}
] | 2011-04-27T00:00:00 |
[
[
"Ma",
"Xiao",
""
],
[
"Zhang",
"Kai",
""
],
[
"Bai",
"Baoming",
""
],
[
"Zhang",
"Xiaoyi",
""
]
] |
new_dataset
| 0.998344 |
1104.4668
|
Massimiliano Vasile Massimiliano Vasile
|
Matteo Ceriotti and Massimiliano Vasile
|
MGA trajectory planning with an ACO-inspired algorithm
| null |
Acta Astronautica, 67 (9-10). pp. 1202-1217, ISSN 0094-5765, 2010
| null | null |
cs.CE cs.NE cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set of celestial bodies, the problem of finding an optimal sequence
of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the
elements of the set is combinatorial in nature. The number of possible paths
grows exponentially with the number of celestial bodies. Therefore, the design
of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed
combinatorial-continuous problem. Its automated solution would greatly improve
the design of future space missions, allowing the assessment of a large number
of alternative mission options in a short time. This work proposes to formulate
the complete automated design of a multiple gravity assist trajectory as an
autonomous planning and scheduling problem. The resulting scheduled plan will
provide the optimal planetary sequence and a good estimation of the set of
associated optimal trajectories. The trajectory model consists of a sequence of
celestial bodies connected by twodimensional transfer arcs containing one DSM.
For each transfer arc, the position of the planet and the spacecraft, at the
time of arrival, are matched by varying the pericentre of the preceding
swing-by, or the magnitude of the launch excess velocity, for the first arc.
For each departure date, this model generates a full tree of possible transfers
from the departure to the destination planet. Each leaf of the tree represents
a planetary encounter and a possible way to reach that planet. An algorithm
inspired by Ant Colony Optimization (ACO) is devised to explore the space of
possible plans. The ants explore the tree from departure to destination adding
one node at the time: every time an ant is at a node, a probability function is
used to select a feasible direction. This approach to automatic trajectory
planning is applied to the design of optimal transfers to Saturn and among the
Galilean moons of Jupiter.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2011 00:58:35 GMT"
}
] | 2011-04-26T00:00:00 |
[
[
"Ceriotti",
"Matteo",
""
],
[
"Vasile",
"Massimiliano",
""
]
] |
new_dataset
| 0.998339 |
1104.4690
|
Gopalakrishnan Tr Nair
|
V. Anitha, Dr. J. Akilandeswari
|
Secured Message Transmission in Mobile AD HOC Networks through
Identification and Removal of Byzantine Failures
|
5 pages, 6 figures
|
InterJRI Computer Science and Networking Volume 1 Issue 1, pp 14-
18 August 2010
| null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emerging need for mobile ad hoc networks and secured data transmission
phase is of crucial importance depending upon the environments like military.
In this paper, a new way to improve the reliability of message transmission is
presented. In the open collaborative MANET environment, any node can
maliciously or selfishly disrupt and deny communication of other nodes. Dynamic
changing topology makes it hard to determine the adversary nodes that affect
the communication in MANET. An SMT protocol provides a way to secure message
transmission by dispersing the message among several paths with minimal
redundancy. The multiple routes selected are known as APS -Active Path Set.
This paper describes a technique for fault discovery process to identify
Byzantine failures which include nodes that drop, modify, or mis-route packets
in an attempt to disrupt the routing service. An adaptive probing technique
detects a malicious link through binary search and according to the nodes
behavior, these links are avoided in the active path by multiplicatively
increasing their weights. The proposed scheme provides secure communication
even with increased number of adversaries.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2011 07:06:05 GMT"
}
] | 2011-04-26T00:00:00 |
[
[
"Anitha",
"V.",
""
],
[
"Akilandeswari",
"Dr. J.",
""
]
] |
new_dataset
| 0.995013 |
1104.4375
|
Yuan Yao
|
Yuan Yao, Jianfeng Zheng, and Zhenghe Feng
|
Array independent MIMO channel models with analytical characteristics
|
30 pages, 10 figures, 4 tables, submitted to IEEE Transactions on
Signal Processing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional analytical channel models for multiple-input multiple-output
(MIMO) wireless radio channels are array dependent. In this paper, we present
several array independent MIMO channel models that inherit the essence of
analytical models. The key idea is to decompose the physical scattering channel
into two parts using the manifold decomposition technique: one is the wavefield
independent sampling matrices depending on the antenna arrays only; the other
is the array independent physical channel that can be individually modeled in
an analytical manner. Based on the framework, we firstly extend the
conventional virtual channel representation (VCR), which is restricted to
uniform linear arrays (ULAs) so far, to a general version applicable to
arbitrary array configurations. Then, we present two array independent
stochastic MIMO channel models based on the proposed new VCR as well as the
Weichselberger model. These two models are good at angular power spectrum (APS)
estimation and capacity prediction, respectively. Finally, the impact of array
characteristics on channel capacity is separately investigated by studying the
condition number of the array steering matrix at fixed angles, and the results
agree well with existing conclusions. Numerical results are presented for model
validation and comparison.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2011 01:59:15 GMT"
}
] | 2011-04-25T00:00:00 |
[
[
"Yao",
"Yuan",
""
],
[
"Zheng",
"Jianfeng",
""
],
[
"Feng",
"Zhenghe",
""
]
] |
new_dataset
| 0.998121 |
1104.4427
|
Zolt\'an K\'asa
|
Gerhard Lischke
|
Primitive words and roots of words
| null |
Acta Univ. Sapientiae, Informatica 3, 1 (2011) 5-34
| null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the algebraic theory of codes and formal languages, the set $Q$ of all
primitive words over some alphabet $\zi $ has received special interest. With
this survey article we give an overview about relevant research to this topic
during the last twenty years including own investigations and some new results.
In Section 1 after recalling the most important notions from formal language
theory we illustrate the connection between coding theory and primitive words
by some facts. We define primitive words as words having only a trivial
representation as the power of another word. Nonprimitive words (without the
empty word) are exactly the periodic words. Every nonempty word is a power of
an uniquely determined primitive word which is called the root of the former
one. The set of all roots of nonempty words of a language is called the root of
the language. The primitive words have interesting combinatorial properties
which we consider in Section 2. In Section 3 we investigate the relationship
between the set $Q$ of all primitive words over some fixed alphabet and the
language classes of the Chomsky Hierarchy and the contextual languages over the
same alphabet. The computational complexity of the set $Q$ and of the roots of
languages are considered in Section 4. The set of all powers of the same degree
of all words from a language is the power of this language. We examine the
powers of languages for different sets of exponents, and especially their
regularity and context-freeness, in Section 5, and the decidability of
appropriate questions in Section 6. Section 7 is dedicated to several
generalizations of the notions of periodicity and primitivity of words.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2011 12:25:18 GMT"
}
] | 2011-04-25T00:00:00 |
[
[
"Lischke",
"Gerhard",
""
]
] |
new_dataset
| 0.997091 |
1104.4247
|
Qinghe Du
|
Qinghe Du and Xi Zhang
|
QoS-Aware Base-Station Selections for Distributed MIMO Links in
Broadband Wireless Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the QoS-aware BS-selection schemes for the distributed wireless
MIMO links, which aim at minimizing the BS usages and reducing the interfering
range, while satisfying diverse statistical delay-QoS constraints characterized
by the delay-bound violation probability and the effective capacity technique.
In particular, based on the channel state information (CSI) and QoS
requirements, a subset of BS with variable cardinality for the distributed MIMO
transmission is dynamically selected, where the selections are controlled by a
central server. For the single-user scenario, we develop two optimization
frameworks, respectively, to derive the efficient BS-selection schemes and the
corresponding resource allocation algorithms. One framework uses the
incremental BS-selection and time-sharing (IBS-TS) strategies, and the other
employs the ordered-gain based BS-selection and probabilistic transmissions
(OGBS-PT). The IBS-TS framework can yield better performance, while the scheme
developed under the OGBS-PT framework is easier to implement. For the
multi-user scenario, we propose the optimization framework applying the
priority BS-selection, block-diagonalization precoding, and probabilistic
transmission (PBS-BD-PT) techniques. We also propose the optimization framework
applying the priority BS-selection, time-division-multiple-access, and
probabilistic transmission (PBS-TDMA-PT) techniques. We derive the optimal
transmission schemes for all the aforementioned frameworks, respectively. Also
conducted is a set of simulation evaluations which compare our proposed schemes
with several baseline schemes and show the impact of the delay-QoS
requirements, transmit power, and traffic loads on the performances of BS
selections for distributed MIMO systems.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2011 12:29:16 GMT"
}
] | 2011-04-22T00:00:00 |
[
[
"Du",
"Qinghe",
""
],
[
"Zhang",
"Xi",
""
]
] |
new_dataset
| 0.975581 |
1104.3905
|
Alexander Langer
|
Joachim Kneis, Alexander Langer, Peter Rossmanith
|
Courcelle's Theorem - A Game-Theoretic Approach
|
submitted
| null | null | null |
cs.DS cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Courcelle's Theorem states that every problem definable in Monadic
Second-Order logic can be solved in linear time on structures of bounded
treewidth, for example, by constructing a tree automaton that recognizes or
rejects a tree decomposition of the structure. Existing, optimized software
like the MONA tool can be used to build the corresponding tree automata, which
for bounded treewidth are of constant size. Unfortunately, the constants
involved can become extremely large - every quantifier alternation requires a
power set construction for the automaton. Here, the required space can become a
problem in practical applications.
In this paper, we present a novel, direct approach based on model checking
games, which avoids the expensive power set construction. Experiments with an
implementation are promising, and we can solve problems on graphs where the
automata-theoretic approach fails in practice.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2011 23:33:15 GMT"
}
] | 2011-04-21T00:00:00 |
[
[
"Kneis",
"Joachim",
""
],
[
"Langer",
"Alexander",
""
],
[
"Rossmanith",
"Peter",
""
]
] |
new_dataset
| 0.992353 |
1104.4035
|
Fanggang Wang
|
Fanggang Wang and Soung Chang Liew
|
Wireless MIMO Switching
|
Submitted to IEEE Transactions on Wireless Communication
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a generic switching problem, a switching pattern consists of a one-to-one
mapping from a set of inputs to a set of outputs (i.e., a permutation). We
propose and investigate a wireless switching framework in which a multi-antenna
relay is responsible for switching traffic among a set of $N$ stations. We
refer to such a relay as a MIMO switch. With beamforming and linear detection,
the MIMO switch controls which stations are connected to which stations. Each
beamforming matrix realizes a permutation pattern among the stations. We refer
to the corresponding permutation matrix as a switch matrix. By scheduling a set
of different switch matrices, full connectivity among the stations can be
established. In this paper, we focus on "fair switching" in which equal amounts
of traffic are to be delivered for all $N(N-1)$ ordered pairs of stations. In
particular, we investigate how the system throughput can be maximized. In
general, for large $N$ the number of possible switch matrices (i.e.,
permutations) is huge, making the scheduling problem combinatorially
challenging. We show that for N=4 and 5, only a subset of $N-1$ switch matrices
need to be considered in the scheduling problem to achieve good throughput. We
conjecture that this will be the case for large $N$ as well. This conjecture,
if valid, implies that for practical purposes, fair-switching scheduling is not
an intractable problem.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2011 14:31:23 GMT"
}
] | 2011-04-21T00:00:00 |
[
[
"Wang",
"Fanggang",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.999046 |
0809.2421
|
Juan Manuel Ojeda Sarmiento
|
Juan Ojeda Sarmiento
|
Electricity Demand and Energy Consumption Management System
| null | null | null | null |
cs.AI cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This project describes the electricity demand and energy consumption
management system and its application to Southern Peru smelter. It is composed
of an hourly demand-forecasting module and of a simulation component for a
plant electrical system. The first module was done using dynamic neural
networks with backpropagation training algorithm; it is used to predict the
electric power demanded every hour, with an error percentage below of 1%. This
information allows efficient management of energy peak demands before this
happen, distributing the raise of electric load to other hours or improving
those equipments that increase the demand. The simulation module is based in
advanced estimation techniques, such as: parametric estimation, neural network
modeling, statistic regression and previously developed models, which simulates
the electric behavior of the smelter plant. These modules facilitate
electricity demand and consumption proper planning, because they allow knowing
the behavior of the hourly demand and the consumption patterns of the plant,
including the bill components, but also energy deficiencies and opportunities
for improvement, based on analysis of information about equipments, processes
and production plans, as well as maintenance programs. Finally the results of
its application in Southern Peru smelter are presented.
|
[
{
"version": "v1",
"created": "Sun, 14 Sep 2008 22:26:49 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Oct 2008 20:28:45 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Jun 2009 17:20:27 GMT"
},
{
"version": "v4",
"created": "Sun, 30 Aug 2009 05:22:10 GMT"
},
{
"version": "v5",
"created": "Mon, 18 Apr 2011 23:08:41 GMT"
}
] | 2011-04-20T00:00:00 |
[
[
"Sarmiento",
"Juan Ojeda",
""
]
] |
new_dataset
| 0.989128 |
1104.3681
|
Tejbanta Singh Chingtham Mr
|
Tejbanta Singh Chingtham, G. Sahoo and M.K. Ghose
|
An Unmanned Aerial Vehicle as Human-Assistant Robotics System
| null |
2010 IEEE International Conference on Computational Intelligence
and Computing Research
|
10.1109/ICCIC.2010.5705731
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
According to the American Heritage Dictionary [1],Robotics is the science or
study of the technology associated with the design, fabrication, theory, and
application of Robots. The term Hoverbot is also often used to refer to
sophisticated mechanical devices that are remotely controlled by human beings
even though these devices are not autonomous. This paper describes a remotely
controlled hoverbot by installing a transmitter and receiver on both sides that
is the control computer (PC) and the hoverbot respectively. Data is transmitted
as signal or instruction via a infrastructure network which is converted into a
command for the hoverbot that operates at a remote site.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2011 08:58:11 GMT"
}
] | 2011-04-20T00:00:00 |
[
[
"Chingtham",
"Tejbanta Singh",
""
],
[
"Sahoo",
"G.",
""
],
[
"Ghose",
"M. K.",
""
]
] |
new_dataset
| 0.999374 |
1010.1328
|
Hector Zenil
|
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
|
Complejidad descriptiva y computacional en maquinas de Turing pequenas
|
Art\'iculo en espa\~nol. Actas de las V Jornadas Ib\'ericas, L\'ogica
Universal e Unidade da Ciencia, CFCUL, 2010. 20 pages, 22 figures, 3 tables;
Keywords: small Turing machines, Program-size complexity, Kolmogorov-Chaitin
complexity, space-time complexity, computational complexity, algorithmic
complexity, geometric complexity
| null | null | null |
cs.CC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We start by an introduction to the basic concepts of computability theory and
the introduction of the concept of Turing machine and computation universality.
Then se turn to the exploration of trade-offs between different measures of
complexity, particularly algorithmic (program-size) and computational (time)
complexity as a mean to explain these measure in a novel manner. The
investigation proceeds by an exhaustive exploration and systematic study of the
functions computed by a large set of small Turing machines with 2 and 3 states
with particular attention to runtimes, space-usages and patterns corresponding
to the computed functions when the machines have access to larger resources
(more states).
We report that the average runtime of Turing machines computing a function
increases as a function of the number of states, indicating that non-trivial
machines tend to occupy all the resources at hand. General slow-down was
witnessed and some incidental cases of (linear) speed-up were found. Throughout
our study various interesting structures were encountered. We unveil a study of
structures in the micro-cosmos of small Turing machines.
|
[
{
"version": "v1",
"created": "Thu, 7 Oct 2010 04:13:26 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Apr 2011 20:18:57 GMT"
}
] | 2011-04-19T00:00:00 |
[
[
"Joosten",
"Joost J.",
""
],
[
"Soler-Toscano",
"Fernando",
""
],
[
"Zenil",
"Hector",
""
]
] |
new_dataset
| 0.998729 |
1104.3165
|
Hussein Al-Zubaidy
|
Hussein Al-Zubaidy, Changcheng Huang, James Yan
|
Dynamic Packet Scheduler Optimization in Wireless Relay Networks
|
30 pages, one figure, submitted to JSAC
| null | null | null |
cs.NI cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we investigate the optimal dynamic packet scheduling policy in
a wireless relay network (WRN). We model this network by two sets of parallel
queues, that represent the subscriber stations (SS) and the relay stations
(RS), with random link connectivity. An optimal policy minimizes, in stochastic
ordering sense, the process of cost function of the SS and RS queue sizes. We
prove that, in a system with symmetrical connectivity and arrival
distributions, a policy that tries to balance the lengths of all the system
queues, at every time slot, is optimal. We use stochastic dominance and
coupling arguments in our proof. We also provide a low-overhead algorithm for
optimal policy implementation.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2011 21:40:16 GMT"
}
] | 2011-04-19T00:00:00 |
[
[
"Al-Zubaidy",
"Hussein",
""
],
[
"Huang",
"Changcheng",
""
],
[
"Yan",
"James",
""
]
] |
new_dataset
| 0.997405 |
1104.3333
|
Wojciech Mazurczyk
|
Wojciech Fraczek, Wojciech Mazurczyk, Krzysztof Szczypiorski
|
Hiding Information in a Stream Control Transmission Protocol
|
12 pages, 17 figures, 2 tables
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The STCP (Stream Control Transmission Protocol) is a candidate for a new
transport layer protocol that may replace the TCP (Transmission Control
Protocol) and the UDP (User Datagram Protocol) protocols in future IP networks.
Currently, the SCTP is implemented in, or can be added to, many popular
operating systems (Windows, BSD, Linux, HPUX or Sun Solaris). This paper
identifies and presents all possible "places" where hidden information can be
exchanged using an SCTP. The paper focuses mostly on proposing new
steganographic methods that can be applied to an SCTP and that can utilise new,
characteristic SCTP features, such as multi-homing and multi-streaming.
Moreover, for each method, the countermeasure is covered. When used with
malicious intent, a method may pose a threat to network security. Knowledge
about potential SCTP steganographic methods may be used as a supplement to
RFC5062, which describes security attacks in an SCTP protocol. Presented in
this paper is a complete analysis of information hiding in an SCTP, and this
analysis can be treated as a "guide" when developing steganalysis (detection)
tools.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2011 18:12:28 GMT"
}
] | 2011-04-19T00:00:00 |
[
[
"Fraczek",
"Wojciech",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.979284 |
1104.2936
|
Sergey Goncharov Sergey Goncharov
|
Sergey Goncharov and Lutz Schr\"oder
|
A Coinductive Calculus for Asynchronous Side-effecting Processes
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an abstract framework for concurrent processes in which atomic
steps have generic side effects, handled according to the principle of monadic
encapsulation of effects. Processes in this framework are potentially infinite
resumptions, modelled using final coalgebras over the monadic base. As a
calculus for such processes, we introduce a concurrent extension of Moggi's
monadic metalanguage of effects. We establish soundness and completeness of a
natural equational axiomatisation of this calculus. Moreover, we identify a
corecursion scheme that is explicitly definable over the base language and
provides flexible expressive means for the definition of new operators on
processes, such as parallel composition. As a worked example, we prove the
safety of a generic mutual exclusion scheme using a verification logic built on
top of the equational calculus.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2011 22:18:06 GMT"
}
] | 2011-04-18T00:00:00 |
[
[
"Goncharov",
"Sergey",
""
],
[
"Schröder",
"Lutz",
""
]
] |
new_dataset
| 0.987829 |
1104.2964
|
Deeparnab Chakrabarty
|
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
|
Social Welfare in One-sided Matching Markets without Money
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study social welfare in one-sided matching markets where the goal is to
efficiently allocate n items to n agents that each have a complete, private
preference list and a unit demand over the items. Our focus is on allocation
mechanisms that do not involve any monetary payments. We consider two natural
measures of social welfare: the ordinal welfare factor which measures the
number of agents that are at least as happy as in some unknown, arbitrary
benchmark allocation, and the linear welfare factor which assumes an agent's
utility linearly decreases down his preference lists, and measures the total
utility to that achieved by an optimal allocation. We analyze two matching
mechanisms which have been extensively studied by economists. The first
mechanism is the random serial dictatorship (RSD) where agents are ordered in
accordance with a randomly chosen permutation, and are successively allocated
their best choice among the unallocated items. The second mechanism is the
probabilistic serial (PS) mechanism of Bogomolnaia and Moulin [8], which
computes a fractional allocation that can be expressed as a convex combination
of integral allocations. The welfare factor of a mechanism is the infimum over
all instances. For RSD, we show that the ordinal welfare factor is
asymptotically 1/2, while the linear welfare factor lies in the interval [.526,
2/3]. For PS, we show that the ordinal welfare factor is also 1/2 while the
linear welfare factor is roughly 2/3. To our knowledge, these results are the
first non-trivial performance guarantees for these natural mechanisms.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2011 03:47:44 GMT"
}
] | 2011-04-18T00:00:00 |
[
[
"Bhalgat",
"Anand",
""
],
[
"Chakrabarty",
"Deeparnab",
""
],
[
"Khanna",
"Sanjeev",
""
]
] |
new_dataset
| 0.996289 |
1104.2681
|
Samuel Mimram
|
David Baelde (LIX), Romain Beauxis (LIX, INRIA Saclay - Ile de
France), Samuel Mimram (CEA LIST)
|
Liquidsoap: a High-Level Programming Language for Multimedia Streaming
| null |
SOFSEM 2011: Theory and Practice of Computer Science 6543 (2011)
99-110
|
10.1007/978-3-642-18381-2_8
| null |
cs.PL cs.MM cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generating multimedia streams, such as in a netradio, is a task which is
complex and difficult to adapt to every users' needs. We introduce a novel
approach in order to achieve it, based on a dedicated high-level functional
programming language, called Liquidsoap, for generating, manipulating and
broadcasting multimedia streams. Unlike traditional approaches, which are based
on configuration files or static graphical interfaces, it also allows the user
to build complex and highly customized systems. This language is based on a
model for streams and contains operators and constructions, which make it
adapted to the generation of streams. The interpreter of the language also
ensures many properties concerning the good execution of the stream generation.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2011 07:01:54 GMT"
}
] | 2011-04-15T00:00:00 |
[
[
"Baelde",
"David",
"",
"LIX"
],
[
"Beauxis",
"Romain",
"",
"LIX, INRIA Saclay - Ile de\n France"
],
[
"Mimram",
"Samuel",
"",
"CEA LIST"
]
] |
new_dataset
| 0.999794 |
1104.2745
|
Sibel Tari
|
Cagri Aslan and Sibel Tari
|
An Axis-Based Representation for Recognition
| null |
ICCV(2005) 1339-1346
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new axis-based shape representation scheme along with a
matching framework to address the problem of generic shape recognition. The
main idea is to define the relative spatial arrangement of local symmetry axes
and their metric properties in a shape centered coordinate frame. The resulting
descriptions are invariant to scale, rotation, small changes in viewpoint and
articulations. Symmetry points are extracted from a surface whose level curves
roughly mimic the motion by curvature. By increasing the amount of smoothing on
the evolving curve, only those symmetry axes that correspond to the most
prominent parts of a shape are extracted. The representation does not suffer
from the common instability problems of the traditional connected skeletons. It
captures the perceptual qualities of shapes well. Therefore finding the
similarities and the differences among shapes becomes easier. The matching
process gives highly successful results on a diverse database of 2D shapes.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2011 12:52:40 GMT"
}
] | 2011-04-15T00:00:00 |
[
[
"Aslan",
"Cagri",
""
],
[
"Tari",
"Sibel",
""
]
] |
new_dataset
| 0.998557 |
1007.2885
|
Adam Megacz
|
Adam Megacz
|
Multi-Level Languages are Generalized Arrows
|
12 pages
| null | null | null |
cs.PL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-level languages and Arrows both facilitate metaprogramming, the act of
writing a program which generates a program. The arr function required of all
Arrows turns arbitrary host language expressions into guest language
expressions; because of this, Arrows may be used for metaprogramming only when
the guest language is a superset of the host language. This restriction is also
present in multi-level languages which offer unlimited cross-level persistence.
<p> This paper introduces generalized arrows and proves that they generalize
Arrows in the following sense: every Arrow in a programming language arises
from a generalized arrow with that language's term category as its codomain.
Generalized arrows impose no containment relationship between the guest
language and host language; they facilitate heterogeneous metaprogramming. The
category having all generalized arrows as its morphisms and the category having
all multi-level languages as its morphisms are isomorphic categories. This is
proven formally in Coq, and the proof is offered as justification for the
assertion that multi-level languages are generalized arrows. <p> Combined with
the existence of a particular kind of retraction in the host language, this
proof can be used to define an invertible translation from two-level terms to
one-level terms parameterized by a generalized arrow instance. This is
ergonomically significant: it lets guest language providers write generalized
arrow instances while the users of those guest languages write multi-level
terms. This is beneficial because implementing a generalized arrow instance is
easier than modifying a compiler, whereas writing two-level terms is easier
than manipulating generalized arrow terms.
|
[
{
"version": "v1",
"created": "Fri, 16 Jul 2010 22:42:04 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Apr 2011 02:24:13 GMT"
}
] | 2011-04-13T00:00:00 |
[
[
"Megacz",
"Adam",
""
]
] |
new_dataset
| 0.999575 |
1104.2069
|
Michael Lew
|
Alwin de Rooij
|
GEOMIR2K9 - A Similar Scene Finder
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main goal of the GEOMIR2K9 project is to create a software program that
is able to find similar scenic images clustered by geographical location and
sorted by similarity based only on their visual content. The user should be
able to input a query image, based on this given query image the program should
find relevant visual content and present this to the user in a meaningful way.
Technically the goal for the GEOMIR2K9 project is twofold. The first of these
two goals is to create a basic low level visual information retrieval system.
This includes feature extraction, post processing of the feature data and
classification/ clustering based on similarity with a strong focus on scenic
images. The second goal of this project is to provide the user with a novel and
suitable interface and visualization method so that the user may interact with
the retrieved images in a natural and meaningful way.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2011 21:17:28 GMT"
}
] | 2011-04-13T00:00:00 |
[
[
"de Rooij",
"Alwin",
""
]
] |
new_dataset
| 0.999701 |
1002.3769
|
Benoit Masson
|
Lila Kari, Beno\^it Masson
|
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
|
Submitted to Theoretical Computer Science
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides a bridge between the classical tiling theory and the
complex neighborhood self-assembling situations that exist in practice. The
neighborhood of a position in the plane is the set of coordinates which are
considered adjacent to it. This includes classical neighborhoods of size four,
as well as arbitrarily complex neighborhoods. A generalized tile system
consists of a set of tiles, a neighborhood, and a relation which dictates which
are the "admissible" neighboring tiles of a given tile. Thus, in correctly
formed assemblies, tiles are assigned positions of the plane in accordance to
this relation. We prove that any validly tiled path defined in a given but
arbitrary neighborhood (a zipper) can be simulated by a simple "ribbon" of
microtiles. A ribbon is a special kind of polyomino, consisting of a
non-self-crossing sequence of tiles on the plane, in which successive tiles
stick along their adjacent edge. Finally, we extend this construction to the
case of traditional tilings, proving that we can simulate
arbitrary-neighborhood tilings by simple-neighborhood tilings, while preserving
some of their essential properties.
|
[
{
"version": "v1",
"created": "Fri, 19 Feb 2010 16:19:53 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Apr 2011 07:34:36 GMT"
}
] | 2011-04-12T00:00:00 |
[
[
"Kari",
"Lila",
""
],
[
"Masson",
"Benoît",
""
]
] |
new_dataset
| 0.978456 |
1104.1717
|
Olivier Pironneau Pr
|
Frederic Alauzet and Olivier Pironneau
|
Continuous and Discrete Adjoints to the Euler Equations for Fluids
|
30 pages 16 figures
| null | null | null |
cs.CE math.NA physics.flu-dyn
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Adjoints are used in optimization to speed-up computations, simplify
optimality conditions or compute sensitivities. Because time is reversed in
adjoint equations with first order time derivatives, boundary conditions and
transmission conditions through shocks can be difficult to understand. In this
article we analyze the adjoint equations that arise in the context of
compressible flows governed by the Euler equations of fluid dynamics. We show
that the continuous adjoints and the discrete adjoints computed by automatic
differentiation agree numerically; in particular the adjoint is found to be
continuous at the shocks and usually discontinuous at contact discontinuities
by both.
|
[
{
"version": "v1",
"created": "Sat, 9 Apr 2011 16:05:32 GMT"
}
] | 2011-04-12T00:00:00 |
[
[
"Alauzet",
"Frederic",
""
],
[
"Pironneau",
"Olivier",
""
]
] |
new_dataset
| 0.963762 |
1104.2034
|
Yavor Parvanov
|
Yavor Angelov Parvanov
|
Materials to the Russian-Bulgarian Comparative Dictionary "EAD"
|
Bulgarian Rusistics; Vol. 1 (2010)
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This article presents a fragment of a new comparative dictionary "A
comparative dictionary of names of expansive action in Russian and Bulgarian
languages". Main features of the new web-based comparative dictionary are
placed, the principles of its formation are shown, primary links between the
word-matches are classified. The principal difference between translation
dictionaries and the model of double comparison is also shown. The
classification scheme of the pages is proposed. New concepts and keywords have
been introduced. The real prototype of the dictionary with a few key pages is
published. The broad debate about the possibility of this prototype to become a
version of Russian-Bulgarian comparative dictionary of a new generation is
available.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2011 19:50:50 GMT"
}
] | 2011-04-12T00:00:00 |
[
[
"Parvanov",
"Yavor Angelov",
""
]
] |
new_dataset
| 0.992861 |
1104.1466
|
Mark Burgin
|
Mark Burgin and Kees (C.N.J.) de Vey Mestdagh
|
Logical Varieties in Normative Reasoning
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although conventional logical systems based on logical calculi have been
successfully used in mathematics and beyond, they have definite limitations
that restrict their application in many cases. For instance, the principal
condition for any logical calculus is its consistency. At the same time,
knowledge about large object domains (in science or in practice) is essentially
inconsistent. Logical prevarieties and varieties were introduced to eliminate
these limitations in a logically correct way. In this paper, the Logic of
Reasonable Inferences is described. This logic has been applied successfully to
model legal reasoning with inconsistent knowledge. It is demonstrated that this
logic is a logical variety and properties of logical varieties related to legal
reasoning are developed.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2011 01:41:22 GMT"
}
] | 2011-04-11T00:00:00 |
[
[
"Burgin",
"Mark",
"",
"C.N.J."
],
[
"Kees",
"",
"",
"C.N.J."
],
[
"Mestdagh",
"de Vey",
""
]
] |
new_dataset
| 0.991264 |
1104.1506
|
Jocelyne Troccaz
|
Michael Baumann (TIMC), Michel Bolla, Vincent Daanen, Jean-Luc
Descotes, Jean-Yves Giraud, Nikolai Hungr (TIMC), Antoine Leroy,
Jean-Alexandre Long, S\'ebastien Martin (TIMC), Jocelyne Troccaz (TIMC)
|
Prosper: image and robot-guided prostate brachytherapy
| null | null | null | null |
cs.RO physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brachytherapy for localized prostate cancer consists in destroying cancer by
introducing iodine radioactive seeds into the gland through hollow needles. The
planning of the position of the seeds and their introduction into the prostate
is based on intra-operative ultrasound (US) imaging. We propose to optimize the
global quality of the procedure by: i) using 3D US; ii) enhancing US data with
MRI registration; iii) using a specially designed needle-insertion robot,
connected to the imaging data. The imaging methods have been successfully
tested on patient data while the robot accuracy has been evaluated on a
realistic deformable phantom.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2011 07:37:30 GMT"
}
] | 2011-04-11T00:00:00 |
[
[
"Baumann",
"Michael",
"",
"TIMC"
],
[
"Bolla",
"Michel",
"",
"TIMC"
],
[
"Daanen",
"Vincent",
"",
"TIMC"
],
[
"Descotes",
"Jean-Luc",
"",
"TIMC"
],
[
"Giraud",
"Jean-Yves",
"",
"TIMC"
],
[
"Hungr",
"Nikolai",
"",
"TIMC"
],
[
"Leroy",
"Antoine",
"",
"TIMC"
],
[
"Long",
"Jean-Alexandre",
"",
"TIMC"
],
[
"Martin",
"Sébastien",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] |
new_dataset
| 0.999613 |
0902.0465
|
Bin Jiang
|
Bin Jiang and Xintao Liu
|
AxialGen: A Research Prototype for Automatically Generating the Axial
Map
|
9 pages, 4 figures
|
Proceedings of CUPUM 2009, the 11th International Conference on
Computers in Urban Planning and Urban Management, Hong Kong, 16-18 June 2009
| null | null |
cs.RO cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
AxialGen is a research prototype for automatically generating the axial map,
which consists of the least number of the longest visibility lines (or axial
lines) for representing individual linearly stretched parts of open space of an
urban environment. Open space is the space between closed spaces such as
buildings and street blocks. This paper aims to provide an accessible guide to
software AxialGen, and the underlying concepts and ideas. We concentrate on the
explanation and illustration of the key concept of bucket: its definition,
formation and how it is used in generating the axial map.
Keywords: Bucket, visibility, medial axes, axial lines, isovists, axial map
|
[
{
"version": "v1",
"created": "Tue, 3 Feb 2009 10:08:03 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jun 2009 23:11:24 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Apr 2011 16:20:08 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Jiang",
"Bin",
""
],
[
"Liu",
"Xintao",
""
]
] |
new_dataset
| 0.999772 |
0904.2115
|
Matias Korman
|
G. Aloupis and J. Cardinal and S. Collette and S. Imahori and M.
Korman and S. Langerman and O. Schwartz and S. Smorodinsky and P. Taslakian
|
Colorful Strips
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a planar point set and an integer $k$, we wish to color the points with
$k$ colors so that any axis-aligned strip containing enough points contains all
colors. The goal is to bound the necessary size of such a strip, as a function
of $k$. We show that if the strip size is at least $2k{-}1$, such a coloring
can always be found. We prove that the size of the strip is also bounded in any
fixed number of dimensions. In contrast to the planar case, we show that
deciding whether a 3D point set can be 2-colored so that any strip containing
at least three points contains both colors is NP-complete.
We also consider the problem of coloring a given set of axis-aligned strips,
so that any sufficiently covered point in the plane is covered by $k$ colors.
We show that in $d$ dimensions the required coverage is at most $d(k{-}1)+1$.
Lower bounds are given for the two problems. This complements recent
impossibility results on decomposition of strip coverings with arbitrary
orientations. Finally, we study a variant where strips are replaced by wedges.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2009 13:00:41 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2011 13:17:06 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Aloupis",
"G.",
""
],
[
"Cardinal",
"J.",
""
],
[
"Collette",
"S.",
""
],
[
"Imahori",
"S.",
""
],
[
"Korman",
"M.",
""
],
[
"Langerman",
"S.",
""
],
[
"Schwartz",
"O.",
""
],
[
"Smorodinsky",
"S.",
""
],
[
"Taslakian",
"P.",
""
]
] |
new_dataset
| 0.999219 |
1104.1186
|
Maamar Sedrati
|
Maamar Sedrati, Azeddine Bilami, Mohamed Benmohamed
|
M-AODV : AODV variant to improve quality of service in MANETs
|
8 pages
|
International Journal of Computer Science Issues (IJCSI) Volume 8,
Issue 1, January 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, multimedia and real-time applications consume much network
resources and so, need high flow rates and very small transfer delay. The
current ad hoc networks (MANETs), in their original state, are not able to
satisfy the requirements of quality of service (QoS). Researches for improving
QoS in these networks are main topics and a subject of intensive researches. In
Adhoc networks, the routing phase plays an important role for improving QoS.
Numerous routing protocols (proactive, reactive and hybrid) were proposed. AODV
(Adhoc On demand Distance Vector) is probably the more treated in literature In
this article, we propose a new variant based on the AODV which gives better
results than the original AODV protocol with respect of a set of QoS parameters
and under different constraints, taking into account the limited resources of
mobile environments (bandwidth, energy, etc...). The proposed variant (M-AODV)
suggests that the discovering operation for paths reconstruction should be done
from the source. It also defines a new mechanism for determining multiple
disjoint (separated) routes. To validate our solution, simulations were made
under Network Simulator (NS2). We measure traffic control and packet loss rate
under diverse constraints (mobility, energy and scale).
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2011 20:22:38 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Sedrati",
"Maamar",
""
],
[
"Bilami",
"Azeddine",
""
],
[
"Benmohamed",
"Mohamed",
""
]
] |
new_dataset
| 0.994171 |
1104.1249
|
Damien Chablat
|
Damien Chablat (IRCCyN), Jorge Angeles (CIM)
|
The Design of a Novel Prismatic Drive for a Three-DOF
Parallel-Kinematics Machine
| null |
Journal of Mechanical Design 128, 4 (2006) 710-718
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design of a novel prismatic drive is reported in this paper. This
transmission is based on Slide-o-Cam, a cam mechanism with multiple rollers
mounted on a common translating follower. The design of Slide-o-Cam was
reported elsewhere. This drive thus provides pure-rolling motion, thereby
reducing the friction of rack-and-pinions and linear drives. Such properties
can be used to design new transmissions for parallel-kinematics machines. In
this paper, this transmission is intended to replace the ball-screws in
Orthoglide, a three-dof parallel robot intended for machining applications.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2011 06:25:20 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Angeles",
"Jorge",
"",
"CIM"
]
] |
new_dataset
| 0.993683 |
1104.1279
|
Ashok Sutagundar V
|
Ashok V Sutagundar, Sunilkumar S Manvi
|
Context Aware Multisensor Image Fusion for Military Sensor Networks
using Multi Agent System
| null |
International Journal of Ad hoc, Sensor & Ubiquitous Computing
(IJASUC) Vol.2, No.1, March 2011
|
10.5121/ijasuc.2011.2113
| null |
cs.MA
|
http://creativecommons.org/licenses/by/3.0/
|
This paper proposes a Context Aware Agent based Military Sensor Network
(CAMSN) to form an improved infrastructure for multi-sensor image fusion. It
considers contexts driven by a node and sink. The contexts such as general and
critical object detection are node driven where as sensing time (such as day or
night) is sink driven. The agencies used in the scheme are categorized as node
and sink agency. Each agency employs a set of static and mobile agents to
perform dedicated tasks. Node agency performs context sensing and context
interpretation based on the sensed image and sensing time. Node agency
comprises of node manager agent, context agent and node blackboard (NBB).
Context agent gathers the context from the target and updates the NBB, Node
manager agent interprets the context and passes the context information to sink
node by using flooding mechanism. Sink agency mainly comprises of sink manager
agent, fusing agent, and sink black board. A context at the sensor node
triggers the fusion process at the sink. Based on the context, sink manager
agent triggers the fusing agent. Fusing agent roams around the network, visits
active sensor node, fuses the relevant images and sends the fused image to
sink. The fusing agent uses wavelet transform for fusion. The scheme is
simulated for testing its operation effectiveness in terms of fusion time, mean
square error, throughput, dropping rate, bandwidth requirement, node battery
usage and agent overhead.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2011 09:32:00 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Sutagundar",
"Ashok V",
""
],
[
"Manvi",
"Sunilkumar S",
""
]
] |
new_dataset
| 0.995131 |
1104.1351
|
Guido Salvaneschi
|
Guido Salvaneschi, Carlo Ghezzi and Matteo Pradella
|
JavaCtx: Seamless Toolchain Integration for Context-Oriented Programming
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context-oriented programming is an emerging paradigm addressing at the
language level the issue of dynamic software adaptation and modularization of
context-specific concerns. In this paper we propose JavaCtx, a tool which
employs coding conventions to generate the context-aware semantics for Java
programs and subsequently weave it into the application. The contribution of
JavaCtx is twofold: the design of a set of coding conventions which allow to
write context-oriented software in plain Java and the concept of
context-oriented semantics injection, which allows to introduce the
context-aware semantics without a source-to-source compilations process which
disrupts the structure of the code. Both these points allow to seamless
integrate JavaCtx in the existing industrial-strength appliances and by far
ease the development of context-oriented software.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2011 15:12:56 GMT"
}
] | 2011-04-08T00:00:00 |
[
[
"Salvaneschi",
"Guido",
""
],
[
"Ghezzi",
"Carlo",
""
],
[
"Pradella",
"Matteo",
""
]
] |
new_dataset
| 0.999154 |
1104.1031
|
Saeed Rasouli heikalabad
|
Saeed Rasouli Heikalabad, Hossein Rasouli, Farhad Nematy and Naeim
Rahmani
|
QEMPAR: QoS and Energy Aware Multi-Path Routing Algorithm for Real-Time
Applications in Wireless Sensor Networks
| null |
International Journal of Computer Science Issues, Vol. 8, Issue 1,
January 2011, 466-471
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Enabling real time applications in wireless sensor networks requires certain
delay and bandwidth which pose more challenges in the design of routing
protocols. The algorithm that is used for packet routing in such applications
should be able to establish a tradeoff between end to end delay parameter and
energy consumption. In this paper, we propose a new multi path routing
algorithm for real time applications in wireless sensor networks namely QEMPAR
which is QoS aware and can increase the network lifetime. Simulation results
show that the proposed algorithm is more efficient than previous algorithms in
providing quality of service requirements of real-time applications.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2011 08:22:33 GMT"
}
] | 2011-04-07T00:00:00 |
[
[
"Heikalabad",
"Saeed Rasouli",
""
],
[
"Rasouli",
"Hossein",
""
],
[
"Nematy",
"Farhad",
""
],
[
"Rahmani",
"Naeim",
""
]
] |
new_dataset
| 0.999347 |
1104.0809
|
Andreas Baldi
|
B. G. Kodge, P. S. Hiremath
|
SLDs for Visualizing Multicolor Elevation Contour Lines in Geo-Spatial
Web Applications
|
5 pages
|
World of Computer Science and Information Technology Journal
(WCSIT), ISSN: 2221-0741, Vol. 1, No. 2, 39-43, 2011
| null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the need for geospatial consumers (either humans or
machines) to visualize multicolored elevation contour poly lines with respect
their different contour intervals and control the visual portrayal of the data
with which they work. The current OpenGIS Web Map Service (WMS) specification
supports the ability for an information provider to specify very basic styling
options by advertising a preset collection of visual portrayals for each
available data set. However, while a WMS currently can provide the user with a
choice of style options, the WMS can only tell the user the name of each style.
It cannot tell the user what portrayal will look like on the map. More
importantly, the user has no way of defining their own styling rules. The
ability for a human or machine client to define these rules requires a styling
language that the client and server can both understand. Defining this
language, called the StyledLayerDescriptor (SLD), is the main focus of this
paper, and it can be used to portray the output of Web Map Servers, Web Feature
Servers and Web Coverage Servers.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 11:06:30 GMT"
}
] | 2011-04-06T00:00:00 |
[
[
"Kodge",
"B. G.",
""
],
[
"Hiremath",
"P. S.",
""
]
] |
new_dataset
| 0.969267 |
1103.0120
|
Srimanta Kundu
|
Srimanta Kundu (1), Nibaran Das and Mita Nasipuri
|
Automatic Detection of Ringworm using Local Binary Pattern (LBP)
|
International Symposium on Medical Imaging: Perspectives on
Perception and Diagnostics (MED-IMAGE 2010) organized in conjunction with the
Seventh Indian Conference on Computer Vision, Graphics and Image Processing
(ICVGIP), 9-10th December, 2010
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a novel approach for automatic recognition of ring
worm skin disease based on LBP (Local Binary Pattern) feature extracted from
the affected skin images. The proposed method is evaluated by extensive
experiments on the skin images collected from internet. The dataset is tested
using three different classifiers i.e. Bayesian, MLP and SVM. Experimental
results show that the proposed methodology efficiently discriminates between a
ring worm skin and a normal skin. It is a low cost technique and does not
require any special imaging devices.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2011 10:06:31 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Apr 2011 20:04:52 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"Kundu",
"Srimanta",
""
],
[
"Das",
"Nibaran",
""
],
[
"Nasipuri",
"Mita",
""
]
] |
new_dataset
| 0.989637 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.