id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1209.4504
|
Xiaomin Chen
|
Xiaomin Chen and Douglas Leith
|
Frames in Outdoor 802.11 WLANs Provide a Hybrid
Binary-Symmetric/Packet-Erasure Channel
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Corrupted frames with CRC errors potentially provide a useful channel through
which we can transmit information. Using measurements taken in an outdoor
environment, we demonstrate that for 802.11 wireless links the channel provided
by corrupted frames alone (i.e. ignoring frames with PHY errors and frames
received correctly) can be accurately modelled as a binary symmetric channel
(BSC) provided appropriate pre- and post- processing is carried out. Also, the
channel provided by corrupted frames and other frames combined can be
accurately modelled as a hybrid binary symmetric/packet erasure channel.
Importantly, we find that this hybrid channel offers capacity increases of more
than 100% compared to a conventional packet erasure channel over a wide range
of RSSIs. This is a striking observation as it indicates that the potential
exists for significant network throughput gains if the information contained in
802.11 corrupted packets is exploited.
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 12:12:23 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Dec 2012 15:48:52 GMT"
}
] | 2012-12-06T00:00:00 |
[
[
"Chen",
"Xiaomin",
""
],
[
"Leith",
"Douglas",
""
]
] |
new_dataset
| 0.991751 |
1212.0992
|
Aydogan Ozcan
|
Sam Mavandadi, Steve Feng, Frank Yu, Richard Yu and Aydogan Ozcan
|
BigFoot: Analysis, monitoring, tracking and sharing of bio-medical
features of human appendages using consumer-grade home and office based
imaging devices
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Here we describe a system for personal and professional management and
analysis of bio-medical images captured using off-the-shelf, consumer-grade
imaging devices such as scanners, digital cameras, cellphones, webcams and
tablet PCs. Specifically, we describe an implementation of this system for the
analysis, monitoring and tracking of conditions and features of human feet
using a flatbed scanner as the image capture device and a custom-designed set
of algorithms and software to manage and analyze the acquired data.
|
[
{
"version": "v1",
"created": "Wed, 5 Dec 2012 10:53:20 GMT"
}
] | 2012-12-06T00:00:00 |
[
[
"Mavandadi",
"Sam",
""
],
[
"Feng",
"Steve",
""
],
[
"Yu",
"Frank",
""
],
[
"Yu",
"Richard",
""
],
[
"Ozcan",
"Aydogan",
""
]
] |
new_dataset
| 0.998823 |
1106.6196
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
On the behaviours produced by instruction sequences under execution
|
36 pages, consolidates material from arXiv:0811.0436 [cs.PL],
arXiv:0902.2859 [cs.PL], and arXiv:0905.2257 [cs.PL]; abstract and
introduction rewritten, examples and proofs added
|
Fundamenta Informaticae, 120(2):111--144, 2012
|
10.3233/FI-2012-753
| null |
cs.PL cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study several aspects of the behaviours produced by instruction sequences
under execution in the setting of the algebraic theory of processes known as
ACP. We use ACP to describe the behaviours produced by instruction sequences
under execution and to describe two protocols implementing these behaviours in
the case where the processing of instructions takes place remotely. We also
show that all finite-state behaviours considered in ACP can be produced by
instruction sequences under execution.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 11:51:25 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jun 2012 07:11:09 GMT"
}
] | 2012-12-05T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.974018 |
1212.0804
|
Tamara Mchedlidze David
|
Emilio Di Giacomo and Giuseppe Liotta and Tamara Mchedlidze
|
How many vertex locations can be arbitrarily chosen when drawing planar
graphs?
| null | null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is proven that every set $S$ of distinct points in the plane with
cardinality $\lceil \frac{\sqrt{\log_2 n}-1}{4} \rceil$ can be a subset of the
vertices of a crossing-free straight-line drawing of any planar graph with $n$
vertices. It is also proven that if $S$ is restricted to be a one-sided convex
point set, its cardinality increases to $\lceil \sqrt[3]{n} \rceil$. The proofs
are constructive and give rise to O(n)-time drawing algorithms. As a part of
our proofs, we show that every maximal planar graph contains a large induced
biconnected outerplanar graphs and a large induced outerpath (an outerplanar
graph whose weak dual is a path).
|
[
{
"version": "v1",
"created": "Tue, 4 Dec 2012 17:33:45 GMT"
}
] | 2012-12-05T00:00:00 |
[
[
"Di Giacomo",
"Emilio",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Mchedlidze",
"Tamara",
""
]
] |
new_dataset
| 0.967356 |
1212.0819
|
Evgeny Shchepin
|
Evgeny Shchepin
|
A Topological Code for Plane Images
| null | null | null | null |
cs.CV math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is proposed a new code for contours of plane images. This code was applied
for optical character recognition of printed and handwritten characters. One
can apply it to recognition of any visual images.
|
[
{
"version": "v1",
"created": "Tue, 4 Dec 2012 18:39:14 GMT"
}
] | 2012-12-05T00:00:00 |
[
[
"Shchepin",
"Evgeny",
""
]
] |
new_dataset
| 0.999634 |
1211.1572
|
Jarek Duda dr
|
Jarek Duda
|
Embedding grayscale halftone pictures in QR Codes using Correction Trees
|
16 pages, 6 figures
| null | null | null |
cs.IT cs.CR cs.MM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Barcodes like QR Codes have made that encoded messages have entered our
everyday life, what suggests to attach them a second layer of information:
directly available to human receiver for informational or marketing purposes.
We will discuss a general problem of using codes with chosen statistical
constrains, for example reproducing given grayscale picture using halftone
technique. If both sender and receiver know these constrains, the optimal
capacity can be easily approached by entropy coder. The problem is that this
time only the sender knows them - we will refer to these scenarios as
constrained coding. Kuznetsov and Tsybakov problem in which only the sender
knows which bits are fixed can be seen as a special case, surprisingly
approaching the same capacity as if both sides would know the constrains. We
will analyze Correction Trees to approach analogous capacity in the general
case - use weaker: statistical constrains, what allows to apply them to all
bits. Finding satisfying coding is similar to finding the proper correction in
error correction problem, but instead of single ensured possibility, there are
now statistically expected some. While in standard steganography we hide
information in the least important bits, this time we create codes resembling
given picture - hide information in the freedom of realizing grayness by black
and white pixels using halftone technique. We will also discuss combining with
error correction and application to rate distortion problem.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 15:19:23 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Nov 2012 08:59:33 GMT"
},
{
"version": "v3",
"created": "Sun, 2 Dec 2012 08:44:38 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Duda",
"Jarek",
""
]
] |
new_dataset
| 0.988699 |
1211.4976
|
Benjamin Varcoe
|
Benjamin T. H. Varcoe
|
Channel Independent Cryptographic Key Distribution
|
7 Pages, 5 Figures, Submitted to IEEE Transactions on Information
Theory, Corrected typo in eqn 6
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a method of cryptographic key distribution using an
`artificially' noisy channel. This is an important development because, while
it is known that a noisy channel can be used to generate unconditional secrecy,
there are many circumstances in which it is not possible to have a noisy
information exchange, such as in error corrected communication stacks. It is
shown that two legitimate parties can simulate a noisy channel by adding local
noise onto the communication and that the simulated channel has a secrecy
capacity even if the underlying channel does not. A derivation of the secrecy
conditions is presented along with numerical simulations of the channel
function to show that key exchange is feasible.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2012 09:33:12 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Dec 2012 16:29:29 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Varcoe",
"Benjamin T. H.",
""
]
] |
new_dataset
| 0.992669 |
1212.0094
|
Samuel Blake T
|
Samuel T. Blake, Andrew Z. Tirkel
|
A Construction for Periodic ZCZ Sequences
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a construction for periodic zero correlation zone (ZCZ)
sequences over roots of unity. The sequences share similarities to the perfect
periodic sequence constructions of Liu, Frank, and Milewski. The sequences have
two non-zero off-peak autocorrelation values which asymptotically approach $\pm
2 \pi$, so the sequences are asymptotically perfect.
|
[
{
"version": "v1",
"created": "Sat, 1 Dec 2012 11:13:43 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Blake",
"Samuel T.",
""
],
[
"Tirkel",
"Andrew Z.",
""
]
] |
new_dataset
| 0.998427 |
1212.0134
|
Ankit Chaudhary
|
J.L.Raheja, Karen Das, Ankit Chaudhary
|
Fingertip Detection: A Fast Method with Natural Hand
| null |
International Journal of Embedded Systems and Computer
Engineering, 2011
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many vision based applications have used fingertips to track or manipulate
gestures in their applications. Gesture identification is a natural way to pass
the signals to the machine, as the human express its feelings most of the time
with hand expressions. Here a novel time efficient algorithm has been described
for fingertip detection. This method is invariant to hand direction and in
preprocessing it cuts only hand part from the full image, hence further
computation would be much faster than processing full image. Binary silhouette
of the input image is generated using HSV color space based skin filter and
hand cropping done based on intensity histogram of the hand image
|
[
{
"version": "v1",
"created": "Sat, 1 Dec 2012 16:59:07 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Raheja",
"J. L.",
""
],
[
"Das",
"Karen",
""
],
[
"Chaudhary",
"Ankit",
""
]
] |
new_dataset
| 0.991124 |
1212.0167
|
Yuantao Gu
|
Zhaoqun Chen, Pengfei Liu, Xiaohan Wang, and Yuantao Gu
|
Follow Whom? Chinese Users Have Different Choice
|
9 pages, 13 figures
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sina Weibo, which was launched in 2009, is the most popular Chinese
micro-blogging service. It has been reported that Sina Weibo has more than 400
million registered users by the end of the third quarter in 2012. Sina Weibo
and Twitter have a lot in common, however, in terms of the following
preference, Sina Weibo users, most of whom are Chinese, behave differently
compared with those of Twitter.
This work is based on a data set of Sina Weibo which contains 80.8 million
users' profiles and 7.2 billion relations and a large data set of Twitter.
Firstly some basic features of Sina Weibo and Twitter are analyzed such as
degree and activeness distribution, correlation between degree and activeness,
and the degree of separation. Then the following preference is investigated by
studying the assortative mixing, friend similarities, following distribution,
edge balance ratio, and ranking correlation, where edge balance ratio is newly
proposed to measure balance property of graphs. It is found that Sina Weibo has
a lower reciprocity rate, more positive balanced relations and is more
disassortative. Coinciding with Asian traditional culture, the following
preference of Sina Weibo users is more concentrated and hierarchical: they are
more likely to follow people at higher or the same social levels and less
likely to follow people lower than themselves. In contrast, the same kind of
following preference is weaker in Twitter. Twitter users are open as they
follow people from levels, which accords with its global characteristic and the
prevalence of western civilization. The message forwarding behavior is studied
by displaying the propagation levels, delays, and critical users. The following
preference derives from not only the usage habits but also underlying reasons
such as personalities and social moralities that is worthy of future research.
|
[
{
"version": "v1",
"created": "Sat, 1 Dec 2012 23:05:49 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Chen",
"Zhaoqun",
""
],
[
"Liu",
"Pengfei",
""
],
[
"Wang",
"Xiaohan",
""
],
[
"Gu",
"Yuantao",
""
]
] |
new_dataset
| 0.994176 |
1212.0253
|
Emmanuel Polonowski
|
Emmanuel Polonowski
|
DBGen User Manual
| null | null | null |
TR--LACL--2012--4
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DBGen is a tool for Coq developers. It takes as input the definition of a
term structure with bindings annotations and generates definitions and
properties for lifting and substitution in the De Bruijn setting, up to the
substitution lemma. It provides also a named syntax and a translation function
to the De Bruijn syntax.
|
[
{
"version": "v1",
"created": "Sun, 2 Dec 2012 22:28:14 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Polonowski",
"Emmanuel",
""
]
] |
new_dataset
| 0.988236 |
1212.0383
|
Asha V
|
V. Asha, N. U. Bhajantri, P. Nagabhushan
|
GLCM-based chi-square histogram distance for automatic detection of
defects on patterned textures
|
IJCVR, Vol. 2, No. 4, 2011, pp. 302-313
|
IJCVR, Vol. 2, No. 4, 2011, pp. 302-313
|
10.1504/IJCVR.2011.045267
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chi-square histogram distance is one of the distance measures that can be
used to find dissimilarity between two histograms. Motivated by the fact that
texture discrimination by human vision system is based on second-order
statistics, we make use of histogram of gray-level co-occurrence matrix (GLCM)
that is based on second-order statistics and propose a new machine vision
algorithm for automatic defect detection on patterned textures. Input defective
images are split into several periodic blocks and GLCMs are computed after
quantizing the gray levels from 0-255 to 0-63 to keep the size of GLCM compact
and to reduce computation time. Dissimilarity matrix derived from chi-square
distances of the GLCMs is subjected to hierarchical clustering to automatically
identify defective and defect-free blocks. Effectiveness of the proposed method
is demonstrated through experiments on defective real-fabric images of 2 major
wallpaper groups (pmm and p4m groups).
|
[
{
"version": "v1",
"created": "Mon, 3 Dec 2012 13:40:41 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Asha",
"V.",
""
],
[
"Bhajantri",
"N. U.",
""
],
[
"Nagabhushan",
"P.",
""
]
] |
new_dataset
| 0.999296 |
1212.0402
|
Khurram Soomro
|
Khurram Soomro, Amir Roshan Zamir and Mubarak Shah
|
UCF101: A Dataset of 101 Human Actions Classes From Videos in The Wild
| null | null | null |
CRCV-TR-12-01
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce UCF101 which is currently the largest dataset of human actions.
It consists of 101 action classes, over 13k clips and 27 hours of video data.
The database consists of realistic user uploaded videos containing camera
motion and cluttered background. Additionally, we provide baseline action
recognition results on this new dataset using standard bag of words approach
with overall performance of 44.5%. To the best of our knowledge, UCF101 is
currently the most challenging dataset of actions due to its large number of
classes, large number of clips and also unconstrained nature of such clips.
|
[
{
"version": "v1",
"created": "Mon, 3 Dec 2012 14:45:31 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Soomro",
"Khurram",
""
],
[
"Zamir",
"Amir Roshan",
""
],
[
"Shah",
"Mubarak",
""
]
] |
new_dataset
| 0.999745 |
1212.0433
|
Laurent Jacques
|
Prasad Sudhakar, Laurent Jacques, Xavier Dubois, Philippe Antoine, Luc
Joannes
|
Compressive Schlieren Deflectometry
|
9 pages, 7 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Schlieren deflectometry aims at characterizing the deflections undergone by
refracted incident light rays at any surface point of a transparent object. For
smooth surfaces, each surface location is actually associated with a sparse
deflection map (or spectrum). This paper presents a novel method to
compressively acquire and reconstruct such spectra. This is achieved by
altering the way deflection information is captured in a common Schlieren
Deflectometer, i.e., the deflection spectra are indirectly observed by the
principle of spread spectrum compressed sensing. These observations are
realized optically using a 2-D Spatial Light Modulator (SLM) adjusted to the
corresponding sensing basis and whose modulations encode the light deviation
subsequently recorded by a CCD camera. The efficiency of this approach is
demonstrated experimentally on the observation of few test objects. Further,
using a simple parametrization of the deflection spectra we show that relevant
key parameters can be directly computed using the measurements, avoiding full
reconstruction.
|
[
{
"version": "v1",
"created": "Mon, 3 Dec 2012 16:21:07 GMT"
}
] | 2012-12-04T00:00:00 |
[
[
"Sudhakar",
"Prasad",
""
],
[
"Jacques",
"Laurent",
""
],
[
"Dubois",
"Xavier",
""
],
[
"Antoine",
"Philippe",
""
],
[
"Joannes",
"Luc",
""
]
] |
new_dataset
| 0.998962 |
1209.4978
|
Yanfang Liu
|
Yanfang Liu and William Zhu
|
Covering matroid
|
15 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new type of matroids, namely covering matroids,
and investigate the connections with the second type of covering-based rough
sets and some existing special matroids. Firstly, as an extension of
partitions, coverings are more natural combinatorial objects and can sometimes
be more efficient to deal with problems in the real world. Through extending
partitions to coverings, we propose a new type of matroids called covering
matroids and prove them to be an extension of partition matroids. Secondly,
since some researchers have successfully applied partition matroids to
classical rough sets, we study the relationships between covering matroids and
covering-based rough sets which are an extension of classical rough sets.
Thirdly, in matroid theory, there are many special matroids, such as
transversal matroids, partition matroids, 2-circuit matroid and
partition-circuit matroids. The relationships among several special matroids
and covering matroids are studied.
|
[
{
"version": "v1",
"created": "Sat, 22 Sep 2012 09:34:10 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Nov 2012 02:42:55 GMT"
}
] | 2012-12-03T00:00:00 |
[
[
"Liu",
"Yanfang",
""
],
[
"Zhu",
"William",
""
]
] |
new_dataset
| 0.998163 |
1211.7161
|
Michael Soltys
|
Sam Buss, Michael Soltys
|
Unshuffling a Square is NP-Hard
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A shuffle of two strings is formed by interleaving the characters into a new
string, keeping the characters of each string in order. A string is a square if
it is a shuffle of two identical strings. There is a known polynomial time
dynamic programming algorithm to determine if a given string z is the shuffle
of two given strings x,y; however, it has been an open question whether there
is a polynomial time algorithm to determine if a given string z is a square. We
resolve this by proving that this problem is NP-complete via a many-one
reduction from 3- Partition.
|
[
{
"version": "v1",
"created": "Fri, 30 Nov 2012 06:14:06 GMT"
}
] | 2012-12-03T00:00:00 |
[
[
"Buss",
"Sam",
""
],
[
"Soltys",
"Michael",
""
]
] |
new_dataset
| 0.999619 |
1211.7326
|
Guenda Kenza
|
Kenza Guenda and T. Aaron Gulliver
|
Repeated Root Constacyclic Codes of Length $mp^s$ over
$\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We give the structure of $\lambda$-constacyclic codes of length $p^sm$ over
$R=\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$ with
$\lambda \in \F_{p^r}^*$. We also give the structure of $\lambda$-constacyclic
codes of length $p^sm$ with $\lambda=\alpha_1+u\alpha_2+...+u^{e-1}
\alpha_{e-1}$, where $\alpha_1,\alpha_2 \neq 0$ and study the self-duality of
these codes.
|
[
{
"version": "v1",
"created": "Fri, 30 Nov 2012 17:52:30 GMT"
}
] | 2012-12-03T00:00:00 |
[
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.999225 |
1211.7356
|
Debashis Dash
|
Sai Shankar N. and Debashis Dash and Hassan El Madi and Guru
Gopalakrishnan
|
WiGig and IEEE 802.11ad - For multi-gigabyte-per-second WPAN and WLAN
|
24 pages, 18 figures. Submitted to ZTE Communications 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Wireless Gigabit Alliance (WiGig) and IEEE 802.11ad are developing a
multigigabit wireless personal and local area network (WPAN/WLAN) specification
in the 60 GHz millimeter wave band. Chipset manufacturers, original equipment
manufacturers (OEMs), and telecom companies are also assisting in this
development. 60 GHz millimeter wave transmission will scale the speed of WLANs
and WPANs to 6.75 Gbit/s over distances less than 10 meters. This technology is
the first of its kind and will eliminate the need for cable around personal
computers, docking stations, and other consumer electronic devices.
High-definition multimedia interface (HDMI), display port, USB 3.0, and
peripheral component interconnect express (PCIe) 3.0 cables will all be
eliminated. Fast downloads and uploads, wireless sync, and
multi-gigabit-per-second WLANs will be possible over shorter distances. 60 GHz
millimeter wave supports fast session transfer (FST) protocol, which makes it
backward compatible with 5 GHz or 2.4 GHz WLAN so that end users experience the
same range as in today's WLANs. IEEE 802.11ad specifies the physical (PHY)
sublayer and medium access control (MAC) sublayer of the protocol stack. The
MAC protocol is based on time-division multiple access (TDMA), and the PHY
layer uses single carrier (SC) and orthogonal frequency division multiplexing
(OFDM) to simultaneously enable low-power, high-performance applications.
|
[
{
"version": "v1",
"created": "Fri, 30 Nov 2012 19:54:07 GMT"
}
] | 2012-12-03T00:00:00 |
[
[
"N.",
"Sai Shankar",
""
],
[
"Dash",
"Debashis",
""
],
[
"Madi",
"Hassan El",
""
],
[
"Gopalakrishnan",
"Guru",
""
]
] |
new_dataset
| 0.99907 |
1207.7139
|
Nicolas Christin
|
Nicolas Christin
|
Traveling the Silk Road: A measurement analysis of a large anonymous
online marketplace
|
26 pages, 13 figures, 4 tables; changes to v1 include revised sales
volume and commission estimates (Sec. 5) and slightly expanded discussion
| null | null |
CMU-Cylab-12-018
|
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We perform a comprehensive measurement analysis of Silk Road, an anonymous,
international online marketplace that operates as a Tor hidden service and uses
Bitcoin as its exchange currency. We gather and analyze data over eight months
between the end of 2011 and 2012, including daily crawls of the marketplace for
nearly six months in 2012. We obtain a detailed picture of the type of goods
being sold on Silk Road, and of the revenues made both by sellers and Silk Road
operators. Through examining over 24,400 separate items sold on the site, we
show that Silk Road is overwhelmingly used as a market for controlled
substances and narcotics, and that most items sold are available for less than
three weeks. The majority of sellers disappears within roughly three months of
their arrival, but a core of 112 sellers has been present throughout our
measurement interval. We evaluate the total revenue made by all sellers, from
public listings, to slightly over USD 1.2 million per month; this corresponds
to about USD 92,000 per month in commissions for the Silk Road operators. We
further show that the marketplace has been operating steadily, with daily sales
and number of sellers overall increasing over our measurement interval. We
discuss economic and policy implications of our analysis and results, including
ethical considerations for future research in this area.
|
[
{
"version": "v1",
"created": "Tue, 31 Jul 2012 00:21:48 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Nov 2012 23:01:33 GMT"
}
] | 2012-11-30T00:00:00 |
[
[
"Christin",
"Nicolas",
""
]
] |
new_dataset
| 0.999102 |
1209.5456
|
Yanfang Liu
|
Yanfang Liu and William Zhu
|
Relation matroid and its relationship with generalized rough set based
on relation
|
15 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, the relationship between matroids and generalized rough sets based
on relations has been studied from the viewpoint of linear independence of
matrices. In this paper, we reveal more relationships by the predecessor and
successor neighborhoods from relations. First, through these two neighborhoods,
we propose a pair of matroids, namely predecessor relation matroid and
successor relation matroid, respectively. Basic characteristics of this pair of
matroids, such as dependent sets, circuits, the rank function and the closure
operator, are described by the predecessor and successor neighborhoods from
relations. Second, we induce a relation from a matroid through the circuits of
the matroid. We prove that the induced relation is always an equivalence
relation. With these two inductions, a relation induces a relation matroid, and
the relation matroid induces an equivalence relation, then the connection
between the original relation and the induced equivalence relation is studied.
Moreover, the relationships between the upper approximation operator in
generalized rough sets and the closure operator in matroids are investigated.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2012 23:42:09 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Nov 2012 10:43:02 GMT"
}
] | 2012-11-30T00:00:00 |
[
[
"Liu",
"Yanfang",
""
],
[
"Zhu",
"William",
""
]
] |
new_dataset
| 0.9984 |
1211.6781
|
Grenville croll
|
Jerzy Tyszkiewicz, Dermot Balson
|
User Defined Spreadsheet Functions in Excel
|
11 Pages, 9 B&W & Colour Figures
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creating user defined functions (UDFs) is a powerful method to improve the
quality of computer applications, in particular spreadsheets. However, the only
direct way to use UDFs in spreadsheets is to switch from the functional and
declarative style of spreadsheet formulas to the imperative VBA, which creates
a high entry barrier even for proficient spreadsheet users. It has been
proposed to extend Excel by UDFs declared by a spreadsheet: user defined
spreadsheet functions (UDSFs). In this paper we present a method to create a
limited form of UDSFs in Excel without any use of VBA. Calls to those UDSFs
utilize what-if data tables to execute the same part of a worksheet several
times, thus turning it into a reusable function definition.
|
[
{
"version": "v1",
"created": "Wed, 28 Nov 2012 23:25:12 GMT"
}
] | 2012-11-30T00:00:00 |
[
[
"Tyszkiewicz",
"Jerzy",
""
],
[
"Balson",
"Dermot",
""
]
] |
new_dataset
| 0.998298 |
1108.1464
|
Claudio Pacchierotti
|
Domenico Prattichizzo, Claudio Pacchierotti, Giulio Rosati
|
Cutaneous Force Feedback as a Sensory Subtraction Technique in Haptics
| null |
D. Prattichizzo, C. Pacchierotti, G. Rosati. Cutaneous force
feedback as a sensory subtraction technique in haptics. IEEE Transactions on
Haptics, 5(4):289-300, 2012
|
10.1109/TOH.2012.15
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel sensory substitution technique is presented. Kinesthetic and
cutaneous force feedback are substituted by cutaneous feedback (CF) only,
provided by two wearable devices able to apply forces to the index finger and
the thumb, while holding a handle during a teleoperation task. The force
pattern, fed back to the user while using the cutaneous devices, is similar, in
terms of intensity and area of application, to the cutaneous force pattern
applied to the finger pad while interacting with a haptic device providing both
cutaneous and kinesthetic force feedback. The pattern generated using the
cutaneous devices can be thought as a subtraction between the complete haptic
feedback (HF) and the kinesthetic part of it. For this reason, we refer to this
approach as sensory subtraction instead of sensory substitution. A needle
insertion scenario is considered to validate the approach. The haptic device is
connected to a virtual environment simulating a needle insertion task.
Experiments show that the perception of inserting a needle using the
cutaneous-only force feedback is nearly indistinguishable from the one felt by
the user while using both cutaneous and kinesthetic feedback. As most of the
sensory substitution approaches, the proposed sensory subtraction technique
also has the advantage of not suffering from stability issues of teleoperation
systems due, for instance, to communication delays. Moreover, experiments show
that the sensory subtraction technique outperforms sensory substitution with
more conventional visual feedback (VF).
|
[
{
"version": "v1",
"created": "Sat, 6 Aug 2011 08:37:25 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Mar 2012 16:54:14 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Nov 2012 17:38:24 GMT"
}
] | 2012-11-28T00:00:00 |
[
[
"Prattichizzo",
"Domenico",
""
],
[
"Pacchierotti",
"Claudio",
""
],
[
"Rosati",
"Giulio",
""
]
] |
new_dataset
| 0.972925 |
1211.6039
|
Giovanni Viglietta
|
Giovanni Viglietta
|
Rendezvous of two robots with visible bits
|
18 pages, 4 figures
| null | null | null |
cs.MA cs.CG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the rendezvous problem for two robots moving in the plane (or on a
line). Robots are autonomous, anonymous, oblivious, and carry colored lights
that are visible to both. We consider deterministic distributed algorithms in
which robots do not use distance information, but try to reduce (or increase)
their distance by a constant factor, depending on their lights' colors.
We give a complete characterization of the number of colors that are
necessary to solve the rendezvous problem in every possible model, ranging from
fully synchronous to semi-synchronous to asynchronous, rigid and non-rigid,
with preset or arbitrary initial configuration.
In particular, we show that three colors are sufficient in the non-rigid
asynchronous model with arbitrary initial configuration. In contrast, two
colors are insufficient in the rigid asynchronous model with arbitrary initial
configuration and in the non-rigid asynchronous model with preset initial
configuration.
Additionally, if the robots are able to distinguish between zero and non-zero
distances, we show how they can solve rendezvous and detect termination using
only three colors, even in the non-rigid asynchronous model with arbitrary
initial configuration.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2012 17:55:01 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Nov 2012 05:15:55 GMT"
}
] | 2012-11-28T00:00:00 |
[
[
"Viglietta",
"Giovanni",
""
]
] |
new_dataset
| 0.997947 |
1211.6191
|
EPTCS
|
Tatiana Mangels, Jan Peleska
|
CTGEN - a Unit Test Generator for C
|
In Proceedings SSV 2012, arXiv:1211.5873
|
EPTCS 102, 2012, pp. 88-102
|
10.4204/EPTCS.102.9
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new unit test generator for C code, CTGEN. It generates test
data for C1 structural coverage and functional coverage based on
pre-/post-condition specifications or internal assertions. The generator
supports automated stub generation, and data to be returned by the stub to the
unit under test (UUT) may be specified by means of constraints. The typical
application field for CTGEN is embedded systems testing; therefore the tool can
cope with the typical aliasing problems present in low-level C, including
pointer arithmetics, structures and unions. CTGEN creates complete test
procedures which are ready to be compiled and run against the UUT. In this
paper we describe the main features of CTGEN, their technical realisation, and
we elaborate on its performance in comparison to a list of competing test
generation tools. Since 2011, CTGEN is used in industrial scale test campaigns
for embedded systems code in the automotive domain.
|
[
{
"version": "v1",
"created": "Tue, 27 Nov 2012 02:36:52 GMT"
}
] | 2012-11-28T00:00:00 |
[
[
"Mangels",
"Tatiana",
""
],
[
"Peleska",
"Jan",
""
]
] |
new_dataset
| 0.959047 |
1211.6279
|
Hasan Tavakoli
|
H. Tavakoli, M. Ahmadian, M. Reza Peyghami
|
Optimal Rate Irregular LDPC Codes in Binary Erasure Channel
|
published in IET Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we design the optimal rate capacity approaching irregular
Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using
practical Semi-Definite Programming approach. Our method does not use any
relaxation or any approximate solution unlike previous works. Our simulation
results include two parts; first, we present some codes and their degree
distribution functions that their rates are close to the capacity. Second, the
maximum achievable rate behavior of codes in our method is illustrated through
some figures.
|
[
{
"version": "v1",
"created": "Tue, 27 Nov 2012 12:16:28 GMT"
}
] | 2012-11-28T00:00:00 |
[
[
"Tavakoli",
"H.",
""
],
[
"Ahmadian",
"M.",
""
],
[
"Peyghami",
"M. Reza",
""
]
] |
new_dataset
| 0.994051 |
1211.6321
|
Guo Zhang
|
Guo Zhang, Ying Ding, Sta\v{s}a Milojevi\'c
|
Citation content analysis (cca): A framework for syntactic and semantic
analysis of citation content
| null | null | null | null |
cs.DL cs.IR cs.IT math.IT physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a new framework for Citation Content Analysis (CCA), for
syntactic and semantic analysis of citation content that can be used to better
analyze the rich sociocultural context of research behavior. The framework
could be considered the next generation of citation analysis. This paper
briefly reviews the history and features of content analysis in traditional
social sciences, and its previous application in Library and Information
Science. Based on critical discussion of the theoretical necessity of a new
method as well as the limits of citation analysis, the nature and purposes of
CCA are discussed, and potential procedures to conduct CCA, including
principles to identify the reference scope, a two-dimensional (citing and
cited) and two-modular (syntactic and semantic modules) codebook, are provided
and described. Future works and implications are also suggested.
|
[
{
"version": "v1",
"created": "Tue, 27 Nov 2012 15:07:43 GMT"
}
] | 2012-11-28T00:00:00 |
[
[
"Zhang",
"Guo",
""
],
[
"Ding",
"Ying",
""
],
[
"Milojević",
"Staša",
""
]
] |
new_dataset
| 0.976791 |
1012.6012
|
Ofer Shayevitz
|
Ofer Shayevitz and Michele Wigger
|
On the Capacity of the Discrete Memoryless Broadcast Channel with
Feedback
|
Accepted to the IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A coding scheme for the discrete memoryless broadcast channel with
{noiseless, noisy, generalized} feedback is proposed, and the associated
achievable region derived. The scheme is based on a block-Markov strategy
combining the Marton scheme and a lossy version of the Gray-Wyner scheme with
side-information. In each block the transmitter sends fresh data and update
information that allows the receivers to improve the channel outputs observed
in the previous block. For a generalization of Dueck's broadcast channel our
scheme achieves the noiseless-feedback capacity, which is strictly larger than
the no-feedback capacity. For a generalization of Blackwell's channel and when
the feedback is noiseless our new scheme achieves rate points that are outside
the no-feedback capacity region. It follows by a simple continuity argument
that for both these channels and when the feedback noise is sufficiently low,
our scheme improves on the no-feedback capacity even when the feedback is
noisy.
|
[
{
"version": "v1",
"created": "Wed, 29 Dec 2010 19:48:40 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Nov 2011 16:51:09 GMT"
},
{
"version": "v3",
"created": "Sun, 25 Nov 2012 15:15:38 GMT"
}
] | 2012-11-27T00:00:00 |
[
[
"Shayevitz",
"Ofer",
""
],
[
"Wigger",
"Michele",
""
]
] |
new_dataset
| 0.998549 |
1211.1345
|
Bata Vasic Mr.
|
Bata Vasic
|
Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)
|
Accepted for publishing and Copyright transfered to Advances in
Electrical and Computer Engineering, November 23th 2012
| null | null | null |
cs.CG cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an algorithm for identifying vertices from three dimensional (3D)
meshes that are most important for a geometric shape creation. Extracting such
a set of vertices from a 3D mesh is important in applications such as digital
watermarking, but also as a component of optimization and triangulation. In the
first step, the Ordered Statistics Vertex Extraction and Tracing Algorithm
(OSVETA) estimates precisely the local curvature, and most important
topological features of mesh geometry. Using the vertex geometric importance
ranking, the algorithm traces and extracts a vector of vertices, ordered by
decreasing index of importance.
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2012 18:39:50 GMT"
},
{
"version": "v2",
"created": "Sat, 24 Nov 2012 14:30:35 GMT"
}
] | 2012-11-27T00:00:00 |
[
[
"Vasic",
"Bata",
""
]
] |
new_dataset
| 0.996047 |
1211.5629
|
Wook-Sung Yoo
|
Wook-Sung Yoo
|
Prototype for Extended XDB Using Wiki
|
8 pages
|
International Journal of Database Management Systems (IJDMS)
Vol.4, No.5, October 2012
| null | null |
cs.DB cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a prototype of extended XDB. XDB is an open-source and
extensible database architecture developed by National Aeronautics and Space
Administration (NASA) to provide integration of heterogeneous and distributed
information resources for scientific and engineering applications. XDB enables
an unlimited number of desktops and distributed information sources to be
linked seamlessly and efficiently into an information grid using Data Access
and Retrieval Composition (DARC) protocol which provides a contextual search
and retrieval capability useful for lightweight web applications. This paper
shows the usage of XDB on common data management in the enterprise without
burdening users and application developers with unnecessary complexity and
formal schemas. Supported by NASA Ames Research Center through NASA Exploration
System Mission Directorate (ESMD) Higher Education grant, a project team at
Fairfield University extended this concept and developed an extended XDB
protocol and a prototype providing text-searches for Wiki. The technical
specification of the protocol was posted to Source Forge (sourceforge.net) and
a prototype providing text-searches for Wiki was developed. The prototype was
created for 16 tags of the MediaWiki dialect. As part of future works, the
prototype will be further extended to the complete Wiki markups and other
dialects of Wiki.
|
[
{
"version": "v1",
"created": "Sat, 24 Nov 2012 00:58:19 GMT"
}
] | 2012-11-27T00:00:00 |
[
[
"Yoo",
"Wook-Sung",
""
]
] |
new_dataset
| 0.991438 |
1211.5820
|
Erjia Yan
|
Erjia Yan, Ying Ding, Blaise Cronin, Loet Leydesdorff
|
A bird's-eye view of scientific trading: Dependency relations among
fields of science
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use a trading metaphor to study knowledge transfer in the sciences as well
as the social sciences. The metaphor comprises four dimensions: (a) Discipline
Self-dependence, (b) Knowledge Exports/Imports, (c) Scientific Trading
Dynamics, and (d) Scientific Trading Impact. This framework is applied to a
dataset of 221 Web of Science subject categories. We find that: (i) the
Scientific Trading Impact and Dynamics of Materials Science And Transportation
Science have increased; (ii) Biomedical Disciplines, Physics, And Mathematics
are significant knowledge exporters, as is Statistics & Probability; (iii) in
the social sciences, Economics, Business, Psychology, Management, And Sociology
are important knowledge exporters; (iv) Discipline Self-dependence is
associated with specialized domains which have ties to professional practice
(e.g., Law, Ophthalmology, Dentistry, Oral Surgery & Medicine, Psychology,
Psychoanalysis, Veterinary Sciences, And Nursing).
|
[
{
"version": "v1",
"created": "Sun, 25 Nov 2012 23:22:05 GMT"
}
] | 2012-11-27T00:00:00 |
[
[
"Yan",
"Erjia",
""
],
[
"Ding",
"Ying",
""
],
[
"Cronin",
"Blaise",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.954173 |
1211.6089
|
Menelaos Karavelas
|
Menelaos I. Karavelas, Christos Konaxis, and Eleni Tzanaki
|
The maximum number of faces of the Minkowski sum of three convex
polytopes
|
44 pages, 3 figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We derive tight expressions for the maximum number of $k$-faces, $0\le k\le
d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex
polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of
the polytopes, for any $d\ge 2$. Expressing the Minkowski sum of the three
polytopes as a section of their Cayley polytope $\mathcal{C}$, the problem of
counting the number of $k$-faces of $P_1+P_2+P_3$, reduces to counting the
number of $(k+2)$-faces of the subset of $\mathcal{C}$ comprising of the faces
that contain at least one vertex from each $P_i$. In two dimensions our
expressions reduce to known results, while in three dimensions, the tightness
of our bounds follows by exploiting known tight bounds for the number of faces
of $r$ $d$-polytopes, where $r\ge d$. For $d\ge 4$, the maximum values are
attained when $P_1$, $P_2$ and $P_3$ are $d$-polytopes, whose vertex sets are
chosen appropriately from three distinct $d$-dimensional moment-like curves.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2012 20:47:25 GMT"
}
] | 2012-11-27T00:00:00 |
[
[
"Karavelas",
"Menelaos I.",
""
],
[
"Konaxis",
"Christos",
""
],
[
"Tzanaki",
"Eleni",
""
]
] |
new_dataset
| 0.976988 |
1102.3270
|
Emmanuel Lochin
|
R\'emi Diana and Emmanuel Lochin
|
Analytical Model of TCP Relentless Congestion Control
|
Extended version of the one presented at 6th International Workshop
on Verification and Evaluation of Computer and Communication Systems (Vecos
2012)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a model of the Relentless Congestion Control proposed by Matt
Mathis. Relentless Congestion Control (RCC) is a modification of the AIMD
(Additive Increase Multiplicative Decrease) congestion control which consists
in decreasing the TCP congestion window by the number of lost segments instead
of halving it. Despite some on-going discussions at the ICCRG IRTF-group, this
congestion control has, to the best of our knowledge, never been modeled. In
this paper, we provide an analytical model of this novel congestion control and
propose an implementation of RCC for the commonly-used network simulator ns-2.
We also improve RCC with the addition of a loss retransmission detection scheme
(based on SACK+) to prevent RTO caused by a loss of a retransmission and called
this new version RCC+. The proposed models describe both the original RCC
algorithm and RCC+ improvement and would allow to better assess the impact of
this new congestion control scheme over the network traffic.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 09:12:26 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Nov 2012 12:26:23 GMT"
},
{
"version": "v3",
"created": "Thu, 22 Nov 2012 03:53:26 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"Diana",
"Rémi",
""
],
[
"Lochin",
"Emmanuel",
""
]
] |
new_dataset
| 0.98201 |
1210.4053
|
Omry Tuval
|
Avinatan Hassidim, Haim Kaplan, Omry Tuval
|
Joint Cache Partition and Job Assignment on Multi-Core Processors
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multicore shared cache processors pose a challenge for designers of embedded
systems who try to achieve minimal and predictable execution time of workloads
consisting of several jobs. To address this challenge the cache is statically
partitioned among the cores and the jobs are assigned to the cores so as to
minimize the makespan. Several heuristic algorithms have been proposed that
jointly decide how to partition the cache among the cores and assign the jobs.
We initiate a theoretical study of this problem which we call the joint cache
partition and job assignment problem.
By a careful analysis of the possible cache partitions we obtain a constant
approximation algorithm for this problem. For some practical special cases we
obtain a 2-approximation algorithm, and show how to improve the approximation
factor even further by allowing the algorithm to use additional cache. We also
study possible improvements that can be obtained by allowing dynamic cache
partitions and dynamic job assignments.
We define a natural special case of the well known scheduling problem on
unrelated machines in which machines are ordered by "strength". Our joint cache
partition and job assignment problem generalizes this scheduling problem which
we think is of independent interest. We give a polynomial time algorithm for
this scheduling problem for instances obtained by fixing the cache partition in
a practical case of the joint cache partition and job assignment problem where
job loads are step functions.
|
[
{
"version": "v1",
"created": "Mon, 15 Oct 2012 14:47:01 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Oct 2012 09:03:28 GMT"
},
{
"version": "v3",
"created": "Thu, 22 Nov 2012 17:16:23 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"Hassidim",
"Avinatan",
""
],
[
"Kaplan",
"Haim",
""
],
[
"Tuval",
"Omry",
""
]
] |
new_dataset
| 0.968443 |
1210.8293
|
Sivaranjani S
|
K. P. Nagarjun, S. Sivaranjani, George Koshy
|
Lyapunov Control of Quantum Systems with Applications to Quantum
Computing
|
A final version will be uploaded with significant expansions
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the design of complex quantum systems like ion traps for quantum
computing, it is usually desired to stabilize a particular system state or make
the system state track a desired trajectory. Several control theoretical
approaches based on feedback seem attractive to solve such problems. But the
uncertain dynamics introduced by measurement on quantum systems makes the
synthesis of feedback control laws very complicated. Although we have not
explicitly modeled the change in system dynamics due to measurement (we have
assumed weak measurements), this is a first step towards a more detailed
analysis and closed-loop feedback design. Here, we present a Lyapunov-based
control approach on the lines of that developed by Mirrahimi, Rouchon, Turnici
(2005). The states are assumed to be obtained from weak measurements. The
Lyapunov control technique has not been applied to realistic quantum systems so
far. We have extended and applied the technique to two realistic physical
systems - the quantum harmonic oscillator and the n-qubit system. We also
propose to extend this concept to ion traps.
|
[
{
"version": "v1",
"created": "Wed, 31 Oct 2012 10:51:41 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Nov 2012 16:14:37 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"Nagarjun",
"K. P.",
""
],
[
"Sivaranjani",
"S.",
""
],
[
"Koshy",
"George",
""
]
] |
new_dataset
| 0.999246 |
1211.5157
|
Fotis Foukalas
|
Fotis Foukalas and Tamer Khattab
|
To Relay or Not To Relay in Cognitive Radio Sensor Networks
| null | null | null | null |
cs.NI cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent works proposed the relaying at the MAC layer in cognitive radio
networks whereby the primary packets are forwarded by the secondary node
maintaining an extra queue devoted to the relaying function. However, relaying
of primary packets may introduce delays on the secondary packets (called
secondary delay) and require additional power budget in order to forward the
primary packets that is especially crucial when the network is deployed using
sensors with limited power resources. To this end, an admission control can be
employed in order to manage efficiently the relaying in cognitive radio sensor
networks. In this paper, we first analyse and formulate the secondary delay and
the required power budget of the secondary sensor node in relation with the
acceptance factor that indicates whether the primary packets are allowed to be
forwarded or not. Having defined the above, we present the tradeoff between the
secondary delay and the required power budget when the acceptance factor is
adapted. In the sequel, we formulate an optimization problem to minimize the
secondary delay over the admission control parameter subject to a limit on the
required power budget plus the constraints related to the stabilities of the
individual queues due to their interdependencies observed by the analysis. The
solution of this problem is provided using iterative decomposition methods i.e.
dual and primal decompositions using Lagrange multipliers that simplifies the
original complicated problem resulting in a final equivalent dual problem that
includes the initial Karush Kuhn Tucker conditions. Using the derived
equivalent dual problem, we obtain the optimal acceptance factor while in
addition we highlight the possibilities for extra delay minimization that is
provided by relaxing the initial constraints through changing the values of the
Lagrange multipliers.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2012 21:47:19 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"Foukalas",
"Fotis",
""
],
[
"Khattab",
"Tamer",
""
]
] |
new_dataset
| 0.997883 |
1211.5248
|
Partha Garai
|
Chaitali Biswas Dutta, Partha Garai and Amitabha Sinha
|
Design Of A Reconfigurable DSP Processor With Bit Efficient Residue
Number System
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Residue Number System (RNS), which originates from the Chinese Remainder
Theorem, offers a promising future in VLSI because of its carry-free operations
in addition, subtraction and multiplication. This property of RNS is very
helpful to reduce the complexity of calculation in many applications. A residue
number system represents a large integer using a set of smaller integers,
called residues. But the area overhead, cost and speed not only depend on this
word length, but also the selection of moduli, which is a very crucial step for
residue system. This parameter determines bit efficiency, area, frequency etc.
In this paper a new moduli set selection technique is proposed to improve bit
efficiency which can be used to construct a residue system for digital signal
processing environment. Subsequently, it is theoretically proved and
illustrated using examples, that the proposed solution gives better results
than the schemes reported in the literature. The novelty of the architecture is
shown by comparison the different schemes reported in the literature. Using the
novel moduli set, a guideline for a Reconfigurable Processor is presented here
that can process some predefined functions. As RNS minimizes the carry
propagation, the scheme can be implemented in Real Time Signal Processing &
other fields where high speed computations are required.
|
[
{
"version": "v1",
"created": "Thu, 22 Nov 2012 10:46:25 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"Dutta",
"Chaitali Biswas",
""
],
[
"Garai",
"Partha",
""
],
[
"Sinha",
"Amitabha",
""
]
] |
new_dataset
| 0.999543 |
1211.5251
|
Josep Rif\`a
|
\'Angel del Rio, Josep Rif\`a
|
Families of Hadamard Z2Z4Q8-codes
|
Submitted to IT-IEEE
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Z2Z4Q8-code is a non-empty subgroup of a direct product of copies of Z_2,
Z_4 and Q_8 (the binary field, the ring of integers modulo 4 and the quaternion
group on eight elements, respectively). Such Z2Z4Q8-codes are translation
invariant propelinear codes as the well known Z_4-linear or Z_2Z_4-linear
codes.
In the current paper, we show that there exist "pure" Z2Z4Q8-codes, that is,
codes that do not admit any abelian translation invariant propelinear
structure. We study the dimension of the kernel and rank of the Z2Z4Q8-codes,
and we give upper and lower bounds for these parameters. We give tools to
construct a new class of Hadamard codes formed by several families of
Z2Z4Q8-codes; we study and show the different shapes of such a codes and we
improve the upper and lower bounds for the rank and the dimension of the kernel
when the codes are Hadamard.
|
[
{
"version": "v1",
"created": "Thu, 22 Nov 2012 10:56:58 GMT"
}
] | 2012-11-26T00:00:00 |
[
[
"del Rio",
"Ángel",
""
],
[
"Rifà",
"Josep",
""
]
] |
new_dataset
| 0.998798 |
1211.4986
|
Sonja Kabicher-Fuchs
|
Sonja Kabicher-Fuchs and Stefanie Rinderle-Ma and Jan Recker and Marta
Indulska and Francois Charoy and Rob Christiaanse and Reinhold Dunkl and
Gregor Grambow and Jens Kolb and Henrik Leopold and Jan Mendling
|
Human-Centric Process-Aware Information Systems (HC-PAIS)
|
8 pages
| null | null |
TR-201211213534
|
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Process-Aware Information Systems (PAIS) support organizations in managing
and automating their processes. A full automation of processes is in particular
industries, such as service-oriented markets, not practicable. The integration
of humans in PAIS is necessary to manage and perform processes that require
human capabilities, judgments and decisions. A challenge of interdisciplinary
PAIS research is to provide concepts and solutions that support human
integration in PAIS and human orientation of PAIS in a way that provably
increase the PAIS users' satisfaction and motivation with working with the
Human-Centric Process Aware Information System (HC-PAIS) and consequently
influence users' performance of tasks. This work is an initial step of research
that aims at providing a definition of Human-Centric Process Aware Information
Systems (HC-PAIS) and future research challenges of HC-PAIS. Results of focus
group research are presented.
|
[
{
"version": "v1",
"created": "Wed, 21 Nov 2012 10:36:12 GMT"
}
] | 2012-11-22T00:00:00 |
[
[
"Kabicher-Fuchs",
"Sonja",
""
],
[
"Rinderle-Ma",
"Stefanie",
""
],
[
"Recker",
"Jan",
""
],
[
"Indulska",
"Marta",
""
],
[
"Charoy",
"Francois",
""
],
[
"Christiaanse",
"Rob",
""
],
[
"Dunkl",
"Reinhold",
""
],
[
"Grambow",
"Gregor",
""
],
[
"Kolb",
"Jens",
""
],
[
"Leopold",
"Henrik",
""
],
[
"Mendling",
"Jan",
""
]
] |
new_dataset
| 0.97827 |
1008.0770
|
Giorgi Japaridze
|
Giorgi Japaridze
|
Introduction to clarithmetic III
| null | null | null | null |
cs.LO math.LO math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper constructs three new systems of clarithmetic (arithmetic
based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html):
CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally
complete with respect to PA-provably recursive time computability. This is in
the sense that an arithmetical problem A has a t-time solution for some
PA-provably recursive function t iff A is represented by some theorem of CLA8.
System CLA9 is shown to be sound and intensionally complete with respect to
constructively PA-provable computability. This is in the sense that a sentence
X is a theorem of CLA9 iff, for some particular machine M, PA proves that M
computes (the problem represented by) X. And system CLA10 is shown to be sound
and intensionally complete with respect to not-necessarily-constructively
PA-provable computability. This means that a sentence X is a theorem of CLA10
iff PA proves that X is computable, even if PA does not "know" of any
particular machine M that computes X.
|
[
{
"version": "v1",
"created": "Wed, 4 Aug 2010 12:53:20 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Nov 2012 16:13:23 GMT"
}
] | 2012-11-21T00:00:00 |
[
[
"Japaridze",
"Giorgi",
""
]
] |
new_dataset
| 0.966624 |
1106.2649
|
Joseph Y. Halpern
|
Joseph Y. Halpern and David C. Parkes
|
Viewpoint: Journals for Certification, Conferences for Rapid
Dissemination
|
To appear, Communications of the ACM
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The publication culture in Computer Science is different from that of all
other disciplines. Whereas other disciplines focus on journal publication, the
standard practice in CS has been to publish in a conference and then
(sometimes) publish a journal version of the conference paper. We discuss the
role of journal publication in CS.
Indeed, it is through publication in selective, leading conferences that the
quality of CS research is typically assessed.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 09:37:39 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Dec 2011 13:45:46 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Nov 2012 22:17:24 GMT"
}
] | 2012-11-21T00:00:00 |
[
[
"Halpern",
"Joseph Y.",
""
],
[
"Parkes",
"David C.",
""
]
] |
new_dataset
| 0.989849 |
1211.4723
|
Arindam Sarkar
|
Arindam Sarkar and J. K. Mandal
|
Key Generation and Certification using Multilayer Perceptron in Wireless
communication(KGCMLP)
|
17 pages, International Journal of Security, Privacy and Trust
Management (IJSPTM), Vol. 1, No 5, October 2012. arXiv admin note:
substantial text overlap with arXiv:1208.2334; and text overlap with
arXiv:0711.2411 by other authors
| null |
10.5121/ijsptm.2012.1503
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a key generation and certification technique using multilayer
perceptron (KGCMLP) has been proposed in wireless communication of
data/information. In this proposed KGCMLP technique both sender and receiver
uses an identical multilayer perceptrons. Both perceptrons are start
synchronization by exchanging some control frames. During synchronization
process message integrity test and synchronization test has been carried out.
Only the synchronization test does not guarantee the security for this reason
key certification phase also been introduced in KGCMLP technique. After Key
generation and certification procedure synchronized identical weight vector
forms the key for encryption/decryption. Parametric tests have been done and
results are compared with some existing classical techniques, which show
comparable results for the proposed technique.
|
[
{
"version": "v1",
"created": "Tue, 20 Nov 2012 12:04:55 GMT"
}
] | 2012-11-21T00:00:00 |
[
[
"Sarkar",
"Arindam",
""
],
[
"Mandal",
"J. K.",
""
]
] |
new_dataset
| 0.972418 |
1211.4779
|
EPTCS
|
Adriana Compagnoni (Stevens Institute of Technology), Mariangiola
Dezani-Ciancaglini (Universita' di Torino), Paola Giannini (Universita' del
Piemonte Orientale), Karin Sauer (Binghamton University), Vishakha Sharma
(Stevens Institute of Technology), Angelo Troina (Universita' di Torino)
|
Parallel BioScape: A Stochastic and Parallel Language for Mobile and
Spatial Interactions
|
In Proceedings MeCBIC 2012, arXiv:1211.3476
|
EPTCS 100, 2012, pp. 101-106
|
10.4204/EPTCS.100.7
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BioScape is a concurrent language motivated by the biological landscapes
found at the interface of biology and biomaterials. It has been motivated by
the need to model antibacterial surfaces, biofilm formation, and the effect of
DNAse in treating and preventing biofilm infections. As its predecessor, SPiM,
BioScape has a sequential semantics based on Gillespie's algorithm, and its
implementation does not scale beyond 1000 agents. However, in order to model
larger and more realistic systems, a semantics that may take advantage of the
new multi-core and GPU architectures is needed. This motivates the introduction
of parallel semantics, which is the contribution of this paper: Parallel
BioScape, an extension with fully parallel semantics.
|
[
{
"version": "v1",
"created": "Sat, 17 Nov 2012 09:15:14 GMT"
}
] | 2012-11-21T00:00:00 |
[
[
"Compagnoni",
"Adriana",
"",
"Stevens Institute of Technology"
],
[
"Dezani-Ciancaglini",
"Mariangiola",
"",
"Universita' di Torino"
],
[
"Giannini",
"Paola",
"",
"Universita' del\n Piemonte Orientale"
],
[
"Sauer",
"Karin",
"",
"Binghamton University"
],
[
"Sharma",
"Vishakha",
"",
"Stevens Institute of Technology"
],
[
"Troina",
"Angelo",
"",
"Universita' di Torino"
]
] |
new_dataset
| 0.999202 |
1206.6098
|
EPTCS
|
Adrien Basso-Blandin (IBISC Lab), Franck Delaplace (IBISC Lab)
|
GUBS, a Behavior-based Language for Open System Dedicated to Synthetic
Biology
|
In Proceedings MeCBIC 2012, arXiv:1211.3476
|
EPTCS 100, 2012, pp. 29-47
|
10.4204/EPTCS.100.3
| null |
cs.PL cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we propose a domain specific language, GUBS (Genomic Unified
Behavior Specification), dedicated to the behavioral specification of synthetic
biological devices, viewed as discrete open dynamical systems. GUBS is a
rule-based declarative language. By contrast to a closed system, a program is
always a partial description of the behavior of the system. The semantics of
the language accounts the existence of some hidden non-specified actions
possibly altering the behavior of the programmed device. The compilation
framework follows a scheme similar to automatic theorem proving, aiming at
improving synthetic biological design safety.
|
[
{
"version": "v1",
"created": "Tue, 26 Jun 2012 19:56:41 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Nov 2012 00:07:07 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Basso-Blandin",
"Adrien",
"",
"IBISC Lab"
],
[
"Delaplace",
"Franck",
"",
"IBISC Lab"
]
] |
new_dataset
| 0.975882 |
1210.6456
|
Loet Leydesdorff
|
Loet Leydesdorff, Duncan Kushnir, and Ismael Rafols
|
Interactive Overlay Maps for US Patent (USPTO) Data Based on
International Patent Classifications (IPC)
|
Scientometrics (forthcoming)
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on the development of an interface to the US Patent and Trademark
Office (USPTO) that allows for the mapping of patent portfolios as overlays to
basemaps constructed from citation relations among all patents contained in
this database during the period 1976-2011. Both the interface and the data are
in the public domain; the freeware programs VOSViewer and/or Pajek can be used
for the visualization. These basemaps and overlays can be generated at both the
3-digit and 4-digit levels of the International Patent Classifications (IPC) of
the World Intellectual Property Organization (WIPO). The basemaps can provide a
stable mental framework for analysts to follow developments over searches for
different years, which can be animated. The full flexibility of the advanced
search engines of USPTO are available for generating sets of patents and/or
patent applications which can thus be visualized and compared. This instrument
allows for addressing questions about technological distance, diversity in
portfolios, and animating the developments of both technologies and
technological capacities of organizations over time.
|
[
{
"version": "v1",
"created": "Wed, 24 Oct 2012 08:32:44 GMT"
},
{
"version": "v2",
"created": "Sun, 18 Nov 2012 11:17:07 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Kushnir",
"Duncan",
""
],
[
"Rafols",
"Ismael",
""
]
] |
new_dataset
| 0.993271 |
1211.4095
|
EPTCS
|
Masahiro Hamano (PRESTO, Japan Science and Technology Agency (JST))
|
RNA interference and Register Machines (extended abstract)
|
In Proceedings MeCBIC 2012, arXiv:1211.3476
|
EPTCS 100, 2012, pp. 107-112
|
10.4204/EPTCS.100.8
| null |
cs.LO cs.CE q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RNA interference (RNAi) is a mechanism whereby small RNAs (siRNAs) directly
control gene expression without assistance from proteins. This mechanism
consists of interactions between RNAs and small RNAs both of which may be
single or double stranded. The target of the mechanism is mRNA to be degraded
or aberrated, while the initiator is double stranded RNA (dsRNA) to be cleaved
into siRNAs. Observing the digital nature of RNAi, we represent RNAi as a
Minsky register machine such that (i) The two registers hold single and double
stranded RNAs respectively, and (ii) Machine's instructions are interpreted by
interactions of enzyme (Dicer), siRNA (with RISC com- plex) and polymerization
(RdRp) to the appropriate registers. Interpreting RNAi as a computational
structure, we can investigate the computational meaning of RNAi, especially its
complexity. Initially, the machine is configured as a Chemical Ground Form
(CGF), which generates incorrect jumps. To remedy this problem, the system is
remodeled as recursive RNAi, in which siRNA targets not only mRNA but also the
machine instructional analogues of Dicer and RISC. Finally, probabilistic
termination is investigated in the recursive RNAi system.
|
[
{
"version": "v1",
"created": "Sat, 17 Nov 2012 09:15:22 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Hamano",
"Masahiro",
"",
"PRESTO, Japan Science and Technology Agency"
]
] |
new_dataset
| 0.999165 |
1211.4113
|
Ivan Guo
|
Ivan Guo
|
Unilaterally Competitive Multi-Player Stopping Games
|
25 pages, 2 figures
| null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multi-player competitive Dynkin stopping game is constructed. Each player
can either exit the game for a fixed payoff, determined a priori, or stay and
receive an adjusted payoff depending on the decision of other players. The
single period case is shown to be "weakly unilaterally competitive". We present
an explicit construction of the unique value at which Nash and optimal
equilibria are attained. Multiple period generalisations are explored. The game
has interpretations in economic and financial contexts, for example, as a
consumption model with bounded resources. It also serves as a starting point to
the construction of multi-person financial game options. In particular, the
concept of optimal equilibria becomes pivotal in the pricing of the game
options via super-replication.
|
[
{
"version": "v1",
"created": "Sat, 17 Nov 2012 11:16:56 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Guo",
"Ivan",
""
]
] |
new_dataset
| 0.993746 |
1211.4384
|
Jan Oksanen
|
Jan Oksanen, Visa Koivunen, H. Vincent Poor
|
A Sensing Policy Based on Confidence Bounds and a Restless Multi-Armed
Bandit Model
|
In proceedings of the 46th Asilomar conference 2012
| null | null | null |
cs.IT cs.LG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sensing policy for the restless multi-armed bandit problem with stationary
but unknown reward distributions is proposed. The work is presented in the
context of cognitive radios in which the bandit problem arises when deciding
which parts of the spectrum to sense and exploit. It is shown that the proposed
policy attains asymptotically logarithmic weak regret rate when the rewards are
bounded independent and identically distributed or finite state Markovian.
Simulation results verifying uniformly logarithmic weak regret are also
presented. The proposed policy is a centrally coordinated index policy, in
which the index of a frequency band is comprised of a sample mean term and a
confidence term. The sample mean term promotes spectrum exploitation whereas
the confidence term encourages exploration. The confidence term is designed
such that the time interval between consecutive sensing instances of any
suboptimal band grows exponentially. This exponential growth between suboptimal
sensing time instances leads to logarithmically growing weak regret. Simulation
results demonstrate that the proposed policy performs better than other similar
methods in the literature.
|
[
{
"version": "v1",
"created": "Mon, 19 Nov 2012 12:19:45 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Oksanen",
"Jan",
""
],
[
"Koivunen",
"Visa",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.999136 |
1211.4552
|
Gabriel Synnaeve
|
Gabriel Synnaeve (LIG, LPPA), Pierre Bessiere (LPPA)
|
A Dataset for StarCraft AI \& an Example of Armies Clustering
|
Artificial Intelligence in Adversarial Real-Time Games 2012, Palo
Alto : United States (2012)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper advocates the exploration of the full state of recorded real-time
strategy (RTS) games, by human or robotic players, to discover how to reason
about tactics and strategy. We present a dataset of StarCraft games
encompassing the most of the games' state (not only player's orders). We
explain one of the possible usages of this dataset by clustering armies on
their compositions. This reduction of armies compositions to mixtures of
Gaussian allow for strategic reasoning at the level of the components. We
evaluated this clustering method by predicting the outcomes of battles based on
armies compositions' mixtures components
|
[
{
"version": "v1",
"created": "Mon, 19 Nov 2012 20:18:43 GMT"
}
] | 2012-11-20T00:00:00 |
[
[
"Synnaeve",
"Gabriel",
"",
"LIG, LPPA"
],
[
"Bessiere",
"Pierre",
"",
"LPPA"
]
] |
new_dataset
| 0.999416 |
1201.1462
|
Xudong Ma
|
Xudong Ma
|
Symbol-Index-Feedback Polar Coding Schemes for Low-Complexity Devices
|
Accepted for publication in the Proceedings of the International
Conference on Computing, Networking and Communications 2013, San Diego, USA,
January 28-31, 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, a new class of error-control codes, the polar codes, have attracted
much attention. The polar codes are the first known class of capacity-achieving
codes for many important communication channels. In addition, polar codes have
low-complexity encoding algorithms. Therefore, these codes are favorable
choices for low-complexity devices, for example, in ubiquitous computing and
sensor networks. However, the polar codes fall short in terms of finite-length
error probabilities, compared with the state-of-the-art codes, such as the
low-density parity-check codes. In this paper, in order to improve the error
probabilities of the polar codes, we propose novel interactive coding schemes
using receiver feedbacks based on polar codes. The proposed coding schemes have
very low computational complexities at the transmitter side. By experimental
results, we show that the proposed coding schemes achieve significantly lower
error probabilities.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2012 18:04:54 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Nov 2012 08:18:15 GMT"
}
] | 2012-11-19T00:00:00 |
[
[
"Ma",
"Xudong",
""
]
] |
new_dataset
| 0.998559 |
1211.3700
|
Michael Clarkson
|
Andrew K. Hirsch and Michael R. Clarkson
|
Nexus Authorization Logic (NAL): Logical Results
| null | null | null | null |
cs.CR cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nexus Authorization Logic (NAL) [Schneider et al. 2011] is a logic for
reasoning about authorization in distributed systems. A revised version of NAL
is given here, including revised syntax, a revised proof theory using localized
hypotheses, and a new Kripke semantics. The proof theory is proved sound with
respect to the semantics, and that proof is formalized in Coq.
|
[
{
"version": "v1",
"created": "Thu, 15 Nov 2012 19:22:11 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Nov 2012 03:29:01 GMT"
}
] | 2012-11-19T00:00:00 |
[
[
"Hirsch",
"Andrew K.",
""
],
[
"Clarkson",
"Michael R.",
""
]
] |
new_dataset
| 0.99964 |
1001.2913
|
Mirela Damian
|
Prosenjit Bose, Mirela Damian, Karim Douieb, Joseph O'Rourke, Ben
Seamone, Michiel Smid and Stefanie Wuhrer
|
Pi/2-Angle Yao Graphs are Spanners
|
20 pages, 9 figures
|
International Journal of Computational Geometry & Applications,
22(1):61-82, 2012
|
10.1142/S0218195912600047
| null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the Yao graph Y4 in the L2 metric is a spanner with stretch
factor 8(29+23sqrt(2)). Enroute to this, we also show that the Yao graph Y4 in
the Linf metric is a planar spanner with stretch factor 8.
|
[
{
"version": "v1",
"created": "Sun, 17 Jan 2010 18:38:36 GMT"
}
] | 2012-11-15T00:00:00 |
[
[
"Bose",
"Prosenjit",
""
],
[
"Damian",
"Mirela",
""
],
[
"Douieb",
"Karim",
""
],
[
"O'Rourke",
"Joseph",
""
],
[
"Seamone",
"Ben",
""
],
[
"Smid",
"Michiel",
""
],
[
"Wuhrer",
"Stefanie",
""
]
] |
new_dataset
| 0.995933 |
1211.3128
|
Ankur Kulkarni
|
Ankur A. Kulkarni and Negar Kiyavash
|
Non-asymptotic Upper Bounds for Deletion Correcting Codes
|
18 pages, 4 figures
| null | null | null |
cs.IT math.CO math.IT math.NT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Explicit non-asymptotic upper bounds on the sizes of multiple-deletion
correcting codes are presented. In particular, the largest single-deletion
correcting code for $q$-ary alphabet and string length $n$ is shown to be of
size at most $\frac{q^n-q}{(q-1)(n-1)}$. An improved bound on the asymptotic
rate function is obtained as a corollary. Upper bounds are also derived on
sizes of codes for a constrained source that does not necessarily comprise of
all strings of a particular length, and this idea is demonstrated by
application to sets of run-length limited strings.
The problem of finding the largest deletion correcting code is modeled as a
matching problem on a hypergraph. This problem is formulated as an integer
linear program. The upper bound is obtained by the construction of a feasible
point for the dual of the linear programming relaxation of this integer linear
program.
The non-asymptotic bounds derived imply the known asymptotic bounds of
Levenshtein and Tenengolts and improve on known non-asymptotic bounds.
Numerical results support the conjecture that in the binary case, the
Varshamov-Tenengolts codes are the largest single-deletion correcting codes.
|
[
{
"version": "v1",
"created": "Tue, 13 Nov 2012 21:02:06 GMT"
}
] | 2012-11-15T00:00:00 |
[
[
"Kulkarni",
"Ankur A.",
""
],
[
"Kiyavash",
"Negar",
""
]
] |
new_dataset
| 0.95377 |
1211.3189
|
Tao Feng
|
Tao Feng
|
A characterization of two-weight projective cyclic codes
|
5 pages
| null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give necessary conditions for a two-weight projective cyclic code to be
the direct sum of two one-weight irreducible cyclic subcodes of the same
dimension, following the work of Wolfmann and Vega. This confirms Vega's
conjecture that all the two-weight cyclic codes of this type are the known ones
in the projective case.
|
[
{
"version": "v1",
"created": "Wed, 14 Nov 2012 03:10:49 GMT"
}
] | 2012-11-15T00:00:00 |
[
[
"Feng",
"Tao",
""
]
] |
new_dataset
| 0.99413 |
1211.2365
|
Sylvester Eriksson-Bique
|
Sylvester Eriksson-Bique (University of Washington and University of
Helsinki) and David Kirkpatrick (University of British Columbia) and Valentin
Polishchuk (University of Helsinki)
|
Discrete Dubins Paths
|
26 pages
| null | null | null |
cs.DM cs.CG math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Dubins path is a shortest path with bounded curvature. The seminal result
in non-holonomic motion planning is that (in the absence of obstacles) a Dubins
path consists either from a circular arc followed by a segment followed by
another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof
uses advanced calculus; later, Dubins result was reproved using control theory
techniques [Reeds and Shepp, 1990], [Sussmann and Tang, 1991], [Boissonnat,
C\'er\'ezo, and Leblond, 1994].
We introduce and study a discrete analogue of curvature-constrained motion.
We show that shortest "bounded-curvature" polygonal paths have the same
structure as Dubins paths. The properties of Dubins paths follow from our
results as a limiting case---this gives a new, "discrete" proof of Dubins
result.
|
[
{
"version": "v1",
"created": "Sun, 11 Nov 2012 01:45:17 GMT"
}
] | 2012-11-14T00:00:00 |
[
[
"Eriksson-Bique",
"Sylvester",
"",
"University of Washington and University of\n Helsinki"
],
[
"Kirkpatrick",
"David",
"",
"University of British Columbia"
],
[
"Polishchuk",
"Valentin",
"",
"University of Helsinki"
]
] |
new_dataset
| 0.999037 |
1211.3020
|
J\"org Fischer
|
J\"org Fischer, Achim Hekler, Maxim Dolgov, Uwe D. Hanebeck
|
Optimal Sequence-Based LQG Control over TCP-like Networks Subject to
Random Transmission Delays and Packet Losses
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of sequence-based controller design for
Networked Control Systems (NCS), where control inputs and measurements are
transmitted over TCP-like network connections that are subject to stochastic
packet losses and time-varying packet delays. At every time step, the
controller sends a sequence of predicted control inputs to the actuator in
addition to the current control input. In this sequence-based setup, we derive
an optimal solution to the Linear Quadratic Gaussian (LQG) control problem and
prove that the separation principle holds. Simulations demonstrate the improved
performance of this optimal controller compared to other sequence-based
approaches.
|
[
{
"version": "v1",
"created": "Tue, 13 Nov 2012 15:29:08 GMT"
}
] | 2012-11-14T00:00:00 |
[
[
"Fischer",
"Jörg",
""
],
[
"Hekler",
"Achim",
""
],
[
"Dolgov",
"Maxim",
""
],
[
"Hanebeck",
"Uwe D.",
""
]
] |
new_dataset
| 0.998518 |
1104.0405
|
Linh Anh Nguyen D.Sc.
|
Linh Anh Nguyen
|
A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending
Converse-PDL with Regular Inclusion Axioms
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give the first cut-free ExpTime (optimal) tableau decision procedure for
the logic CPDLreg, which extends Converse-PDL with regular inclusion axioms
characterized by finite automata. The logic CPDLreg is the combination of
Converse-PDL and regular grammar logic with converse. Our tableau decision
procedure uses global state caching and has been designed to increase
efficiency and allow various optimization techniques, including on-the-fly
propagation of local and global (in)consistency.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2011 16:59:59 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Nov 2012 18:57:19 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Nguyen",
"Linh Anh",
""
]
] |
new_dataset
| 0.999393 |
1210.5486
|
Nisheeth Joshi
|
Juhi Ameta, Nisheeth Joshi, Iti Mathur
|
A Lightweight Stemmer for Gujarati
|
In Proceedings of 46th Annual Convention of Computer Society of India
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gujarati is a resource poor language with almost no language processing tools
being available. In this paper we have shown an implementation of a rule based
stemmer of Gujarati. We have shown the creation of rules for stemming and the
richness in morphology that Gujarati possesses. We have also evaluated our
results by verifying it with a human expert.
|
[
{
"version": "v1",
"created": "Fri, 19 Oct 2012 17:49:06 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Nov 2012 17:10:35 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Ameta",
"Juhi",
""
],
[
"Joshi",
"Nisheeth",
""
],
[
"Mathur",
"Iti",
""
]
] |
new_dataset
| 0.999723 |
1211.2367
|
Ada Wai-chee Fu
|
Ada Wai-Chee Fu and Huanhuan Wu and James Cheng and Shumo Chu and
Raymond Chi-Wing Wong
|
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point
Distance Querying on Large Graphs
|
12 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of computing shortest path or distance between two query
vertices in a graph, which has numerous important applications. Quite a number
of indexes have been proposed to answer such distance queries. However, all of
these indexes can only process graphs of size barely up to 1 million vertices,
which is rather small in view of many of the fast-growing real-world graphs
today such as social networks and Web graphs. We propose an efficient index,
which is a novel labeling scheme based on the independent set of a graph. We
show that our method can handle graphs of size three orders of magnitude larger
than those existing indexes.
|
[
{
"version": "v1",
"created": "Sun, 11 Nov 2012 01:59:11 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Fu",
"Ada Wai-Chee",
""
],
[
"Wu",
"Huanhuan",
""
],
[
"Cheng",
"James",
""
],
[
"Chu",
"Shumo",
""
],
[
"Wong",
"Raymond Chi-Wing",
""
]
] |
new_dataset
| 0.993008 |
1211.2386
|
Mohamed Labib Borham
|
Mohamed Labib Borham, Mostafa Sami Mostafa, Hossam Eldeen Moustafa
Shamardan
|
MDSA: Modified Distributed Storage Algorithm for Wireless Sensor
Networks
|
5 pages, 9 figures. arXiv admin note: text overlap with
arXiv:1201.0178, arXiv:1011.2795, arXiv:0902.1278, arXiv:0908.4419 by other
authors
|
International Journal of Advanced Computer Science and
Applications (IJACSA),Vol. 3, No. 10, 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a Modified distributed storage algorithm for
wireless sensor networks (MDSA). Wireless Sensor Networks, as it is well known,
suffer of power limitation, small memory capacity,and limited processing
capabilities. Therefore, every node may disappear temporarily or permanently
from the network due to many different reasons such as battery failure or
physical damage. Since every node collects significant data about its region,
it is important to find a methodology to recover these data in case of failure
of the source node. Distributed storage algorithms provide reliable access to
data through the redundancy spread over individual unreliable nodes. The
proposed algorithm uses flooding to spread data over the network and unicasting
to provide controlled data redundancy through the network. We evaluate the
performance of the proposed algorithm through implementation and simulation. We
show the results and the performance evaluation of the proposed algorithm.
|
[
{
"version": "v1",
"created": "Sun, 11 Nov 2012 09:05:14 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Borham",
"Mohamed Labib",
""
],
[
"Mostafa",
"Mostafa Sami",
""
],
[
"Shamardan",
"Hossam Eldeen Moustafa",
""
]
] |
new_dataset
| 0.990404 |
1211.2404
|
Rayed AlGhamdi
|
Rayed AlGhamdi, Steve Drew and Waleed Al-Ghaith
|
Factors unflinching e-commerce adoption by retailers in Saudi Arabia:
Qual Analysis
| null |
The Electronic Journal on Information Systems in Developing
Countries (2011)
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the preliminary findings of a study researching the
diffusion and the adoption of online retailing in Saudi Arabia. It reports new
research that identifies and explores the key issues that positively and
negatively influence retailers in Saudi Arabia regarding the adoption of
electronic commerce. Retailers in Saudi Arabia have been reserved in their
adoption of electronically delivered aspects of their business. Despite the
fact that Saudi Arabia has the largest and fastest growth of ICT marketplaces
in the Arab region, ecommerce activities are not progressing at the same speed.
Only a tiny number of Saudi commercial organizations, mostly medium and large
companies from the manufacturing sector, are involved in e-commerce
implementation. Based on qualitative data, collected by conducting interviews
with a sample population of retail sector decision makers in Saudi Arabia, both
positive and negative issues influencing retailer adoption of electronic
retailing systems in Saudi Arabia are identified. A number of impediments which
include cultural, business and technical issues were reported. Facilitating
factors include access to educational programs and awareness building of
e-commerce, government support and assistance for ecommerce, trustworthy and
secure online payment options, developing strong ICT infrastructure, and
provision of sample e-commerce software to trial. While literature reveals that
government promotion has had limited effects on the diffusion of e-commerce in
most countries, this study significantly indicates government promotion and
support as a key driver to online retailing in KSA.
|
[
{
"version": "v1",
"created": "Sun, 11 Nov 2012 11:45:31 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"AlGhamdi",
"Rayed",
""
],
[
"Drew",
"Steve",
""
],
[
"Al-Ghaith",
"Waleed",
""
]
] |
new_dataset
| 0.958731 |
1211.2495
|
Mohamed Firdhous
|
M. F. M. Firdhous and D. L. Basnayake and K. H. L. Kodithuwakku and N.
K. Haththalla and N. W. Charlin and P. M. R. I. K. Bandara
|
Route Planning Made Easy - An Automated System for Sri Lanka
|
17 pages, 17 figures and 2 tables
|
Route Planning Made Easy-An Automated System for Sri Lanka, Bhumi:
the Planning Research Journal of the University of Moratuwa, Vol. 02 No. 02,
2010, pp. 13-24
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Commercial cities like Colombo constantly face to problem of traffic
congestion due to the large number of people visiting the city for various
reasons. Also these cities have a large number of roads with many roads
connecting any two selected locations. Finding the best path between two
locations in Colombo city is not a trivial task, due to the complexity of the
road network and other reasons such as heavy traffic, changes to the road
networks such as road closures and one-ways. This paper presents the results of
a study carried out to understand this problem and development of a system to
plan the travel way ahead of the planned day or time of the journey. This
system can compute the best route from between two locations taking multiple
factors such as traffic conditions, road closures or one-way declarations etc.,
into account. This system also has the capability to compute the best route
between any two locations on a future date based on the road conditions on that
date. The system comprises three main modules and two user interfaces one for
normal users and the other for administrators. The Administrative interface can
only be accessed via web browser running on a computer, while the other
interface can be accessed either via a web browser or a GPRS enabled mobile
phone. The system is powered mainly by the Geographic Information System (GIS)
technology and the other supporting technologies used are database management
system, ASP.Net technology and the GPRS technology. Finally the developed
system was evaluated for its functionality and user friendliness using a user
survey. The results of the survey are also presented in this paper.
|
[
{
"version": "v1",
"created": "Mon, 12 Nov 2012 02:13:46 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Firdhous",
"M. F. M.",
""
],
[
"Basnayake",
"D. L.",
""
],
[
"Kodithuwakku",
"K. H. L.",
""
],
[
"Haththalla",
"N. K.",
""
],
[
"Charlin",
"N. W.",
""
],
[
"Bandara",
"P. M. R. I. K.",
""
]
] |
new_dataset
| 0.997767 |
1211.2569
|
Ka Chun Lam
|
Lok Ming Lui, Ka Chun Lam, Shing-Tung Yau, Xianfeng Gu
|
Teichm\"uller extremal mapping and its applications to landmark matching
registration
|
26 pages, 21 figures
| null | null | null |
cs.CG cs.GR cs.MM math.DG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Registration, which aims to find an optimal 1-1 correspondence between
shapes, is an important process in different research areas. Conformal mappings
have been widely used to obtain a diffeomorphism between shapes that minimizes
angular distortion. Conformal registrations are beneficial since it preserves
the local geometry well. However, when landmark constraints are enforced,
conformal mappings generally do not exist. This motivates us to look for a
unique landmark matching quasi-conformal registration, which minimizes the
conformality distortion. Under suitable condition on the landmark constraints,
a unique diffeomporphism, called the Teichm\"uller extremal mapping between two
surfaces can be obtained, which minimizes the maximal conformality distortion.
In this paper, we propose an efficient iterative algorithm, called the
Quasi-conformal (QC) iterations, to compute the Teichm\"uller mapping. The
basic idea is to represent the set of diffeomorphisms using Beltrami
coefficients (BCs), and look for an optimal BC associated to the desired
Teichm\"uller mapping. The associated diffeomorphism can be efficiently
reconstructed from the optimal BC using the Linear Beltrami Solver(LBS). Using
BCs to represent diffeomorphisms guarantees the diffeomorphic property of the
registration. Using our proposed method, the Teichm\"uller mapping can be
accurately and efficiently computed within 10 seconds. The obtained
registration is guaranteed to be bijective. The proposed algorithm can also be
extended to compute Teichm\"uller mapping with soft landmark constraints. We
applied the proposed algorithm to real applications, such as brain landmark
matching registration, constrained texture mapping and human face registration.
Experimental results shows that our method is both effective and efficient in
computing a non-overlap landmark matching registration with least amount of
conformality distortion.
|
[
{
"version": "v1",
"created": "Mon, 12 Nov 2012 11:16:31 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Lui",
"Lok Ming",
""
],
[
"Lam",
"Ka Chun",
""
],
[
"Yau",
"Shing-Tung",
""
],
[
"Gu",
"Xianfeng",
""
]
] |
new_dataset
| 0.995946 |
1211.2723
|
S. M. Hossein Tabatabaei Yazdi
|
S. M. Hossein Tabatabaei Yazdi, Serap A. Savari
|
On the Relationships among Optimal Symmetric Fix-Free Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symmetric fix-free codes are prefix condition codes in which each codeword is
required to be a palindrome. Their study is motivated by the topic of joint
source-channel coding. Although they have been considered by a few communities
they are not well understood. In earlier work we used a collection of instances
of Boolean satisfiability problems as a tool in the generation of all optimal
binary symmetric fix-free codes with n codewords and observed that the number
of different optimal codelength sequences grows slowly compared with the
corresponding number for prefix condition codes. We demonstrate that all
optimal symmetric fix-free codes can alternatively be obtained by sequences of
codes generated by simple manipulations starting from one particular code. We
also discuss simplifications in the process of searching for this set of codes.
|
[
{
"version": "v1",
"created": "Mon, 12 Nov 2012 18:26:32 GMT"
}
] | 2012-11-13T00:00:00 |
[
[
"Yazdi",
"S. M. Hossein Tabatabaei",
""
],
[
"Savari",
"Serap A.",
""
]
] |
new_dataset
| 0.976195 |
1211.2063
|
Padmanabha Venkatagiri Seshadri
|
Padmanabha Venkatagiri Seshadri, Mun Choon Chan, Wei Tsang Ooi
(National University of Singapore)
|
Mobile-to-Mobile Video Recommendation
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile device users can now easily capture and socially share video clips in
a timely manner by uploading them wirelessly to a server. When attending
crowded events, such as an exhibition or the Olympic Games, however, timely
sharing of videos becomes difficult due to choking bandwidth in the network
infrastructure, preventing like-minded attendees from easily sharing videos
with each other through a server. One solution to alleviate this problem is to
use direct device-to-device communication to share videos among nearby
attendees. Contact capacity between two devices, however, is limited, and thus
a recommendation algorithm, such as collaborative filtering, is needed to
select and transmit only videos of potential interest to an attendee. In this
paper, we address the question: which video clip should be transmitted to which
user. We proposed an video transmission scheduling algorithm, called CoFiGel,
that runs in a distributed manner and aims to improve both the prediction
coverage and precision of the collaborative filtering algorithm. At each
device, CoFiGel transmits the video that would increase the estimated number of
positive user-video ratings the most if this video is transferred to the
destination device. We evaluated CoFiGel using real-world traces and show that
substantial improvement can be achieved compared to baseline schemes that do
not consider rating or contact history.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 07:43:16 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Seshadri",
"Padmanabha Venkatagiri",
"",
"National University of Singapore"
],
[
"Chan",
"Mun Choon",
"",
"National University of Singapore"
],
[
"Ooi",
"Wei Tsang",
"",
"National University of Singapore"
]
] |
new_dataset
| 0.999291 |
1211.2073
|
Yang Lu
|
Yang Lu and Mengying Wang and Kenny Q. Zhu and Bo Yuan
|
LAGE: A Java Framework to reconstruct Gene Regulatory Networks from
Large-Scale Continues Expression Data
|
2 pages
| null | null | null |
cs.LG cs.CE q-bio.QM stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LAGE is a systematic framework developed in Java. The motivation of LAGE is
to provide a scalable and parallel solution to reconstruct Gene Regulatory
Networks (GRNs) from continuous gene expression data for very large amount of
genes. The basic idea of our framework is motivated by the philosophy of
divideand-conquer. Specifically, LAGE recursively partitions genes into
multiple overlapping communities with much smaller sizes, learns
intra-community GRNs respectively before merge them altogether. Besides, the
complete information of overlapping communities serves as the byproduct, which
could be used to mine meaningful functional modules in biological networks.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 08:34:25 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Lu",
"Yang",
""
],
[
"Wang",
"Mengying",
""
],
[
"Zhu",
"Kenny Q.",
""
],
[
"Yuan",
"Bo",
""
]
] |
new_dataset
| 0.994441 |
1211.2081
|
Tianyu Wang
|
Tianyu Wang, Lingyang Song, Zhu Han, and Bingli Jiao
|
Dynamic Popular Content Distribution in Vehicular Networks using
Coalition Formation Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Driven by both safety concerns and commercial interests, vehicular ad hoc
networks (VANETs) have recently received considerable attentions. In this
paper, we address popular content distribution (PCD) in VANETs, in which one
large popular file is downloaded from a stationary roadside unit (RSU), by a
group of on-board units (OBUs) driving through an area of interest (AoI) along
a highway. Due to high speeds of vehicles and deep fadings of
vehicle-to-roadside (V2R) channels, some of the vehicles may not finish
downloading the entire file but only possess several pieces of it. To
successfully send a full copy to each OBU, we propose a cooperative approach
based on the coalition formation games, in which OBUs exchange their possessed
pieces by broadcasting to and receiving from their neighbors. Simulation
results show that our proposed approach presents a considerable performance
improvement relative to the non-cooperative approach, in which the OBUs
broadcast randomly selected pieces to their neighbors as along as the spectrum
is detected to be unoccupied.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 09:11:56 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Wang",
"Tianyu",
""
],
[
"Song",
"Lingyang",
""
],
[
"Han",
"Zhu",
""
],
[
"Jiao",
"Bingli",
""
]
] |
new_dataset
| 0.999089 |
1211.2087
|
Arindam Sarkar
|
Arindam Sarkar and J. K. Mandal
|
Secured Wireless Communication using Fuzzy Logic based High Speed
Public-Key Cryptography (FLHSPKC)
|
9 pages
|
(IJACSA) International Journal of Advanced Computer Science and
Applications, Vol. 3, No. 10, 2012, 137-145
| null | null |
cs.CR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper secured wireless communication using fuzzy logic based high
speed public key cryptography (FLHSPKC) has been proposed by satisfying the
major issues likes computational safety, power management and restricted usage
of memory in wireless communication. Wireless Sensor Network (WSN) has several
major constraints likes inadequate source of energy, restricted computational
potentiality and limited memory. Though conventional Elliptic Curve
Cryptography (ECC) which is a sort of public key cryptography used in wireless
communication provides equivalent level of security like other existing public
key algorithm using smaller parameters than other but this traditional ECC does
not take care of all these major limitations in WSN. In conventional ECC
consider Elliptic curve point p, an arbitrary integer k and modulus m, ECC
carry out scalar multiplication kP mod m, which takes about 80% of key
computation time on WSN. In this paper proposed FLHSPKC scheme provides some
novel strategy including novel soft computing based strategy to speed up scalar
multiplication in conventional ECC and which in turn takes shorter
computational time and also satisfies power consumption restraint, limited
usage of memory without hampering the security level. Performance analysis of
the different strategies under FLHSPKC scheme and comparison study with
existing conventional ECC methods has been done.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 09:57:16 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Sarkar",
"Arindam",
""
],
[
"Mandal",
"J. K.",
""
]
] |
new_dataset
| 0.998344 |
1211.2118
|
Tillmann Miltzow
|
Tillmann Miltzow
|
Trees in simple Polygons
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that every simple polygon contains a degree 3 tree encompassing a
prescribed set of vertices. We give tight bounds on the minimal number of
degree 3 vertices. We apply this result to reprove a result from Bose et al.
that every set of disjoint line segments in the plane admits a binary tree.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 13:01:54 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Miltzow",
"Tillmann",
""
]
] |
new_dataset
| 0.992718 |
1211.2150
|
Mohamed Ben Halima
|
Mohamed Ben Halima, Hichem karray, Adel. M. Alimi and Ana Fern\'andez
Vila
|
NF-SAVO: Neuro-Fuzzy system for Arabic Video OCR
|
09 pages
|
International Journal of Advanced Computer Science and
Applications, Vol. 3, No. 10, 2012, 128-136
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a robust approach for text extraction and
recognition from video clips which is called Neuro-Fuzzy system for Arabic
Video OCR. In Arabic video text recognition, a number of noise components
provide the text relatively more complicated to separate from the background.
Further, the characters can be moving or presented in a diversity of colors,
sizes and fonts that are not uniform. Added to this, is the fact that the
background is usually moving making text extraction a more intricate process.
Video include two kinds of text, scene text and artificial text. Scene text is
usually text that becomes part of the scene itself as it is recorded at the
time of filming the scene. But artificial text is produced separately and away
from the scene and is laid over it at a later stage or during the post
processing time. The emergence of artificial text is consequently vigilantly
directed. This type of text carries with it important information that helps in
video referencing, indexing and retrieval.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 14:57:53 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Halima",
"Mohamed Ben",
""
],
[
"karray",
"Hichem",
""
],
[
"Alimi",
"Adel. M.",
""
],
[
"Vila",
"Ana Fernández",
""
]
] |
new_dataset
| 0.999669 |
1211.2187
|
Ali Eslami
|
Ali Eslami and H. Pishro-Nik
|
On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor,
and Concatenated Design
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates properties of polar codes that can be potentially
useful in real-world applications. We start with analyzing the performance of
finite-length polar codes over the binary erasure channel (BEC), while assuming
belief propagation as the decoding method. We provide a stopping set analysis
for the factor graph of polar codes, where we find the size of the minimum
stopping set. We also find the girth of the graph for polar codes. Our analysis
along with bit error rate (BER) simulations demonstrate that finite-length
polar codes show superior error floor performance compared to the conventional
capacity-approaching coding techniques. In order to take advantage from this
property while avoiding the shortcomings of polar codes, we consider the idea
of combining polar codes with other coding schemes. We propose a polar
code-based concatenated scheme to be used in Optical Transport Networks (OTNs)
as a potential real-world application. Comparing against conventional
concatenation techniques for OTNs, we show that the proposed scheme outperforms
the existing methods by closing the gap to the capacity while avoiding error
floor, and maintaining a low complexity at the same time.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2012 16:58:22 GMT"
}
] | 2012-11-12T00:00:00 |
[
[
"Eslami",
"Ali",
""
],
[
"Pishro-Nik",
"H.",
""
]
] |
new_dataset
| 0.996642 |
1208.5413
|
Alan Guo
|
Alan Guo, Swastik Kopparty, Madhu Sudan
|
New affine-invariant codes from lifting
|
27 pages
| null | null | null |
cs.IT cs.CC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we explore error-correcting codes derived from the "lifting" of
"affine-invariant" codes. Affine-invariant codes are simply linear codes whose
coordinates are a vector space over a field and which are invariant under
affine-transformations of the coordinate space. Lifting takes codes defined
over a vector space of small dimension and lifts them to higher dimensions by
requiring their restriction to every subspace of the original dimension to be a
codeword of the code being lifted. While the operation is of interest on its
own, this work focusses on new ranges of parameters that can be obtained by
such codes, in the context of local correction and testing. In particular we
present four interesting ranges of parameters that can be achieved by such
lifts, all of which are new in the context of affine-invariance and some may be
new even in general. The main highlight is a construction of high-rate codes
with sublinear time decoding. The only prior construction of such codes is due
to Kopparty, Saraf and Yekhanin \cite{KSY}. All our codes are extremely simple,
being just lifts of various parity check codes (codes with one symbol of
redundancy), and in the final case, the lift of a Reed-Solomon code.
We also present a simple connection between certain lifted codes and lower
bounds on the size of "Nikodym sets". Roughly, a Nikodym set in
$\mathbb{F}_q^m$ is a set $S$ with the property that every point has a line
passing through it which is almost entirely contained in $S$. While previous
lower bounds on Nikodym sets were roughly growing as $q^m/2^m$, we use our
lifted codes to prove a lower bound of $(1 - o(1))q^m$ for fields of constant
characteristic.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2012 14:57:52 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Nov 2012 19:32:06 GMT"
}
] | 2012-11-09T00:00:00 |
[
[
"Guo",
"Alan",
""
],
[
"Kopparty",
"Swastik",
""
],
[
"Sudan",
"Madhu",
""
]
] |
new_dataset
| 0.976203 |
1209.5805
|
Eduardo Arvelo
|
Eduardo Arvelo, Eric Kim and Nuno C. Martins
|
Memoryless Control Design for Persistent Surveillance under Safety
Constraints
| null | null | null | null |
cs.SY cs.RO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with the design of time-invariant memoryless control
policies for robots that move in a finite two- dimensional lattice and are
tasked with persistent surveillance of an area in which there are forbidden
regions. We model each robot as a controlled Markov chain whose state comprises
its position in the lattice and the direction of motion. The goal is to find
the minimum number of robots and an associated time-invariant memoryless
control policy that guarantees that the largest number of states are
persistently surveilled without ever visiting a forbidden state. We propose a
design method that relies on a finitely parametrized convex program inspired by
entropy maximization principles. Numerical examples are provided.
|
[
{
"version": "v1",
"created": "Wed, 26 Sep 2012 01:18:33 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Nov 2012 17:56:24 GMT"
}
] | 2012-11-09T00:00:00 |
[
[
"Arvelo",
"Eduardo",
""
],
[
"Kim",
"Eric",
""
],
[
"Martins",
"Nuno C.",
""
]
] |
new_dataset
| 0.975018 |
1211.1904
|
Dan Wallach
|
Josh Benaloh and Mike Byrne and Philip Kortum and Neal McBurnett and
Olivier Pereira and Philip B. Stark and Dan S. Wallach
|
STAR-Vote: A Secure, Transparent, Auditable, and Reliable Voting System
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In her 2011 EVT/WOTE keynote, Travis County, Texas County Clerk Dana
DeBeauvoir described the qualities she wanted in her ideal election system to
replace their existing DREs. In response, in April of 2012, the authors,
working with DeBeauvoir and her staff, jointly architected STAR-Vote, a voting
system with a DRE-style human interface and a "belt and suspenders" approach to
verifiability. It provides both a paper trail and end-to-end cryptography using
COTS hardware. It is designed to support both ballot-level risk-limiting
audits, and auditing by individual voters and observers. The human interface
and process flow is based on modern usability research. This paper describes
the STAR-Vote architecture, which could well be the next-generation voting
system for Travis County and perhaps elsewhere.
|
[
{
"version": "v1",
"created": "Thu, 8 Nov 2012 17:06:33 GMT"
}
] | 2012-11-09T00:00:00 |
[
[
"Benaloh",
"Josh",
""
],
[
"Byrne",
"Mike",
""
],
[
"Kortum",
"Philip",
""
],
[
"McBurnett",
"Neal",
""
],
[
"Pereira",
"Olivier",
""
],
[
"Stark",
"Philip B.",
""
],
[
"Wallach",
"Dan S.",
""
]
] |
new_dataset
| 0.967657 |
1207.5124
|
Jeffrey Shallit
|
Daniel Goc, Kalle Saari, Jeffrey Shallit
|
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent
Sequences
| null | null | null | null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate questions related to the presence of primitive words and
Lyndon words in automatic and linearly recurrent sequences. We show that the
Lyndon factorization of a k-automatic sequence is itself k-automatic. We also
show that the function counting the number of primitive factors (resp., Lyndon
factors) of length n in a k-automatic sequence is k-regular. Finally, we show
that the number of Lyndon factors of a linearly recurrent sequence is bounded.
|
[
{
"version": "v1",
"created": "Sat, 21 Jul 2012 11:55:09 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jul 2012 12:18:52 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Nov 2012 21:32:27 GMT"
}
] | 2012-11-08T00:00:00 |
[
[
"Goc",
"Daniel",
""
],
[
"Saari",
"Kalle",
""
],
[
"Shallit",
"Jeffrey",
""
]
] |
new_dataset
| 0.998229 |
1211.1581
|
Volker Weinberg
|
Volker Weinberg
|
Data-parallel programming with Intel Array Building Blocks (ArBB)
|
13 pages, 7 figures, PRACE Whitepaper
| null | null | null |
cs.PF cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intel Array Building Blocks is a high-level data-parallel programming
environment designed to produce scalable and portable results on existing and
upcoming multi- and many-core platforms.
We have chosen several mathematical kernels - a dense matrix-matrix
multiplication, a sparse matrix-vector multiplication, a 1-D complex FFT and a
conjugate gradients solver - as synthetic benchmarks and representatives of
scientific codes and ported them to ArBB. This whitepaper describes the ArBB
ports and presents performance and scaling measurements on the Westmere-EX
based system SuperMIG at LRZ in comparison with OpenMP and MKL.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 16:00:28 GMT"
}
] | 2012-11-08T00:00:00 |
[
[
"Weinberg",
"Volker",
""
]
] |
new_dataset
| 0.999708 |
1211.1661
|
Mark Korenblit
|
Mark Korenblit and Vadim E. Levit
|
A One-Vertex Decomposition Algorithm for Generating Algebraic
Expressions of Square Rhomboids
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper investigates relationship between algebraic expressions and graphs.
We consider a digraph called a square rhomboid that is an example of
non-series-parallel graphs. Our intention is to simplify the expressions of
square rhomboids and eventually find their shortest representations. With that
end in view, we describe the new algorithm for generating square rhomboid
expressions, which improves on our previous algorithms.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 20:25:20 GMT"
}
] | 2012-11-08T00:00:00 |
[
[
"Korenblit",
"Mark",
""
],
[
"Levit",
"Vadim E.",
""
]
] |
new_dataset
| 0.952536 |
1211.1109
|
Raghu Meka
|
Daniel Kane, Raghu Meka
|
A PRG for Lipschitz Functions of Polynomials with Applications to
Sparsest Cut
| null | null | null | null |
cs.CC cs.DS math.FA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give improved pseudorandom generators (PRGs) for Lipschitz functions of
low-degree polynomials over the hypercube. These are functions of the form
psi(P(x)), where P is a low-degree polynomial and psi is a function with small
Lipschitz constant. PRGs for smooth functions of low-degree polynomials have
received a lot of attention recently and play an important role in constructing
PRGs for the natural class of polynomial threshold functions. In spite of the
recent progress, no nontrivial PRGs were known for fooling Lipschitz functions
of degree O(log n) polynomials even for constant error rate. In this work, we
give the first such generator obtaining a seed-length of (log
n)\tilde{O}(d^2/eps^2) for fooling degree d polynomials with error eps.
Previous generators had an exponential dependence on the degree.
We use our PRG to get better integrality gap instances for sparsest cut, a
fundamental problem in graph theory with many applications in graph
optimization. We give an instance of uniform sparsest cut for which a powerful
semi-definite relaxation (SDP) first introduced by Goemans and Linial and
studied in the seminal work of Arora, Rao and Vazirani has an integrality gap
of exp(\Omega((log log n)^{1/2})). Understanding the performance of the
Goemans-Linial SDP for uniform sparsest cut is an important open problem in
approximation algorithms and metric embeddings and our work gives a
near-exponential improvement over previous lower bounds which achieved a gap of
\Omega(log log n).
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2012 04:51:27 GMT"
}
] | 2012-11-07T00:00:00 |
[
[
"Kane",
"Daniel",
""
],
[
"Meka",
"Raghu",
""
]
] |
new_dataset
| 0.993838 |
1211.1279
|
Sunirmal Khatua
|
Sunirmal Khatua and Nandini Mukherjee
|
Application-centric Resource Provisioning for Amazon EC2 Spot Instances
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In late 2009, Amazon introduced spot instances to offer their unused
resources at lower cost with reduced reliability. Amazon's spot instances allow
customers to bid on unused Amazon EC2 capacity and run those instances for as
long as their bid exceeds the current spot price. The spot price changes
periodically based on supply and demand, and customers whose bids exceed it
gain access to the available spot instances. Customers may expect their
services at lower cost with spot instances compared to on-demand or reserved.
However the reliability is compromised since the instances(IaaS) providing the
service(SaaS) may become unavailable at any time without any notice to the
customer. Checkpointing and migration schemes are of great use to cope with
such situation. In this paper we study various checkpointing schemes that can
be used with spot instances. Also we device some algorithms for checkpointing
scheme on top of application-centric resource provisioning framework that
increase the reliability while reducing the cost significantly.
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2012 15:58:55 GMT"
}
] | 2012-11-07T00:00:00 |
[
[
"Khatua",
"Sunirmal",
""
],
[
"Mukherjee",
"Nandini",
""
]
] |
new_dataset
| 0.995717 |
1211.1332
|
Hossein Jahandideh
|
Hossein Jahandideh, Mehrzad Namvar
|
Use of PSO in Parameter Estimation of Robot Dynamics; Part Two:
Robustness
|
6 pages, 1 figure, 5 tables, Published in the International
Conference on System Theory, Control and Computing 2012 (IEEE) Proceedings,
to be indexed in IEEExplore
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we analyze the robustness of the PSO-based approach to
parameter estimation of robot dynamics presented in Part One. We have made
attempts to make the PSO method more robust by experimenting with potential
cost functions. The simulated system is a cylindrical robot; through
simulation, the robot is excited, samples are taken, error is added to the
samples, and the noisy samples are used for estimating the robot parameters
through the presented method. Comparisons are made with the least squares,
total least squares, and robust least squares methods of estimation.
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2012 18:08:26 GMT"
}
] | 2012-11-07T00:00:00 |
[
[
"Jahandideh",
"Hossein",
""
],
[
"Namvar",
"Mehrzad",
""
]
] |
new_dataset
| 0.963211 |
1211.0645
|
Pietro Oliva
|
Pietro Oliva
|
Project G.N.O.S.I.S.: Geographical Network Of Synoptic Information
System
|
3 pages, Proposal for future project
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Everybody knows how much synoptic maps are useful today. An excellent example
above all is Google Earth: its simplicity and friendly interface allows every
user to have the Earth maps ready in just one simple layout; nevertheless a
crucial dimension is missing in Google Earth: the time. This doesn't mean we
simply aim to add history to Google Earth (though it could be already a nice
goal): the main idea behind GNOSIS project is to produce applications to "dress
up" the Globe with a set of skin-maps representing the most various different
kind of histories like the evolution of geology, genetics, agriculture,
ethnology, linguistics, musicology, metallurgy and so forth, in time. It may be
interesting in the near future to have such a possibility to watch on the map
the positions and movements of the armies during the battles of Waterloo or
Thermopylae, the spreading of the cultivation of corn in time, the rise and
fall of Roman Empire or the diffusion of Smallpox together with the spread of a
religion, a specific dialect, the early pottery techniques or the natural
resources available to pre-Columbian civilizations on a Google-Earth-map-like,
that is to say to have at one's hand the ultimate didactic-enciclopedic tool.
To do so we foresee the use of a general-purpose intermediate/high level
programming language, possibly object-oriented such C++ or Java.
|
[
{
"version": "v1",
"created": "Sat, 3 Nov 2012 22:33:34 GMT"
}
] | 2012-11-06T00:00:00 |
[
[
"Oliva",
"Pietro",
""
]
] |
new_dataset
| 0.95457 |
1105.2375
|
Bharath Bettagere
|
B. N. Bharath and Chandra R. Murthy
|
On the DMT of TDD-SIMO Systems with Channel-Dependent Reverse Channel
Training
|
Accepted for publication in IEEE Transactions on Communications
| null |
10.1109/TCOMM.2012.082712.110820
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the Diversity-Multiplexing gain Trade-off (DMT) of a
training based reciprocal Single Input Multiple Output (SIMO) system, with (i)
perfect Channel State Information (CSI) at the Receiver (CSIR) and noisy CSI at
the Transmitter (CSIT), and (ii) noisy CSIR and noisy CSIT. In both the cases,
the CSIT is acquired through Reverse Channel Training (RCT), i.e., by sending a
training sequence from the receiver to the transmitter. A channel-dependent
fixed-power training scheme is proposed for acquiring CSIT, along with a
forward-link data transmit power control scheme. With perfect CSIR, the
proposed scheme is shown to achieve a diversity order that is quadratically
increasing with the number of receive antennas. This is in contrast with
conventional orthogonal RCT schemes, where the diversity order is known to
saturate as the number of receive antennas is increased, for a given channel
coherence time. Moreover, the proposed scheme can achieve a larger DMT compared
to the orthogonal training scheme. With noisy CSIR and noisy CSIT, a three-way
training scheme is proposed and its DMT performance is analyzed. It is shown
that nearly the same diversity order is achievable as in the perfect CSIR case.
The time-overhead in the training schemes is explicitly accounted for in this
work, and the results show that the proposed channel-dependent RCT and data
power control schemes offer a significant improvement in terms of the DMT,
compared to channel-agnostic orthogonal RCT schemes. The outage performance of
the proposed scheme is illustrated through Monte-Carlo simulations.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2011 05:38:33 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Nov 2012 04:43:04 GMT"
}
] | 2012-11-05T00:00:00 |
[
[
"Bharath",
"B. N.",
""
],
[
"Murthy",
"Chandra R.",
""
]
] |
new_dataset
| 0.996166 |
1210.5660
|
Dong Fang
|
Dong Fang and Alister Burr
|
Linear Physical-layer Network Coding in Galois Field for Rayleigh fading
2-Way Relay Channels
|
There is a a crucial error for the conditons of generating linear
combination. The corresponding simulations are thus incorrect. The draft
should be withdrawn
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel linear physicallayer network coding (LPNC)
for Rayleigh fading 2-way relay channels (2-WRC). Rather than the simple
modulo-2 (bit-XOR) operation, the relay directly maps the superimposed signal
of the two users into the linear network coded combination in GF(2^2) by
multiplying the user data by properly selected generator matrix. We derive the
constellation constrained capacities for LPNC and 5QAM denoise-and forward
(5QAM-DNF) [2] and further explicitly characterize the capacity difference
between LPNC and 5QAM-DNF. Based on our analysis and simulation, we highlight
that without employing the irregular 5QAM mapping and sacrificing the spectral
efficiency, our LPNC in GF(2^2) is superior to 5QAM-DNF scheme in low SNR
regime while they achieve equal performance in the the moderate-to-high SNR
regime.
|
[
{
"version": "v1",
"created": "Sat, 20 Oct 2012 22:08:52 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Nov 2012 13:56:41 GMT"
}
] | 2012-11-05T00:00:00 |
[
[
"Fang",
"Dong",
""
],
[
"Burr",
"Alister",
""
]
] |
new_dataset
| 0.95787 |
1211.0175
|
Herman Haverkort
|
Herman Haverkort
|
Harmonious Hilbert curves and other extradimensional space-filling
curves
|
40 pages, 10 figures, pseudocode included
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new way of generalizing Hilbert's two-dimensional
space-filling curve to arbitrary dimensions. The new curves, called harmonious
Hilbert curves, have the unique property that for any d' < d, the d-dimensional
curve is compatible with the d'-dimensional curve with respect to the order in
which the curves visit the points of any d'-dimensional axis-parallel space
that contains the origin. Similar generalizations to arbitrary dimensions are
described for several variants of Peano's curve (the original Peano curve, the
coil curve, the half-coil curve, and the Meurthe curve). The d-dimensional
harmonious Hilbert curves and the Meurthe curves have neutral orientation: as
compared to the curve as a whole, arbitrary pieces of the curve have each of d!
possible rotations with equal probability. Thus one could say these curves are
`statistically invariant' under rotation---unlike the Peano curves, the coil
curves, the half-coil curves, and the familiar generalization of Hilbert curves
by Butz and Moore.
In addition, prompted by an application in the construction of R-trees, this
paper shows how to construct a 2d-dimensional generalized Hilbert or Peano
curve that traverses the points of a certain d-dimensional diagonally placed
subspace in the order of a given d-dimensional generalized Hilbert or Peano
curve.
Pseudocode is provided for comparison operators based on the curves presented
in this paper.
|
[
{
"version": "v1",
"created": "Thu, 1 Nov 2012 13:40:52 GMT"
}
] | 2012-11-02T00:00:00 |
[
[
"Haverkort",
"Herman",
""
]
] |
new_dataset
| 0.99887 |
1210.8318
|
H.R. Chennamma
|
H. R. Chennamma and Lalitha Rangarajan
|
Mugshot Identification from Manipulated Facial Images
|
8 pages, 5 figures, 1 table, journal. arXiv admin note: substantial
text overlap with arXiv:1106.4907
|
International Journal of Machine Intelligence, Volume 4, Issue 1,
pp. 407, 2012
| null | null |
cs.CV cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Editing on digital images is ubiquitous. Identification of deliberately
modified facial images is a new challenge for face identification system. In
this paper, we address the problem of identification of a face or person from
heavily altered facial images. In this face identification problem, the input
to the system is a manipulated or transformed face image and the system reports
back the determined identity from a database of known individuals. Such a
system can be useful in mugshot identification in which mugshot database
contains two views (frontal and profile) of each criminal. We considered only
frontal view from the available database for face identification and the query
image is a manipulated face generated by face transformation software tool
available online. We propose SIFT features for efficient face identification in
this scenario. Further comparative analysis has been given with well known
eigenface approach. Experiments have been conducted with real case images to
evaluate the performance of both methods.
|
[
{
"version": "v1",
"created": "Wed, 31 Oct 2012 12:55:57 GMT"
}
] | 2012-11-01T00:00:00 |
[
[
"Chennamma",
"H. R.",
""
],
[
"Rangarajan",
"Lalitha",
""
]
] |
new_dataset
| 0.986303 |
1210.8433
|
Ender Ayanoglu
|
Ender Ayanoglu
|
Green Cellular Wireless Networks: Where to Begin?
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conventional cellular wireless networks were designed with the purpose of
providing high throughput for the user and high capacity for the service
provider, without any provisions of energy efficiency. As a result, these
networks have an enormous Carbon footprint. In this note, we describe the
sources of the inefficiencies in such networks. First we quantify how much
Carbon footprint such networks generate. We also discuss how much more mobile
traffic is expected to increase so that this Carbon footprint will even
increase tremendously more. We then discuss specific sources of inefficiency
and potential sources of improvement at the physical layer as well as higher
layers of the communication protocol hierarchy. In particular, considering that
most of the energy inefficiency in wireless cellular networks is at the base
stations, we discuss multi-tier networks and point to the potential of
exploiting mobility patterns in order to use base station energy judiciously.
|
[
{
"version": "v1",
"created": "Wed, 31 Oct 2012 18:39:47 GMT"
}
] | 2012-11-01T00:00:00 |
[
[
"Ayanoglu",
"Ender",
""
]
] |
new_dataset
| 0.998414 |
1210.5802
|
Ryan Rossi
|
Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin, Md. Mostofa
Ali Patwary
|
What if CLIQUE were fast? Maximum Cliques in Information Networks and
Strong Components in Temporal Networks
| null | null | null | null |
cs.SI cs.DC cs.DM physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exact maximum clique finders have progressed to the point where we can
investigate cliques in million-node social and information networks, as well as
find strongly connected components in temporal networks. We use one such finder
to study a large collection of modern networks emanating from biological,
social, and technological domains. We show inter-relationships between maximum
cliques and several other common network properties, including network density,
maximum core, and number of triangles. In temporal networks, we find that the
largest temporal strong components have around 20-30% of the vertices of the
entire network. These components represent groups of highly communicative
individuals. In addition, we discuss and improve the performance and utility of
the maximum clique finder itself.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 04:21:07 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Oct 2012 19:57:39 GMT"
}
] | 2012-10-31T00:00:00 |
[
[
"Rossi",
"Ryan A.",
""
],
[
"Gleich",
"David F.",
""
],
[
"Gebremedhin",
"Assefaw H.",
""
],
[
"Patwary",
"Md. Mostofa Ali",
""
]
] |
new_dataset
| 0.950012 |
1210.7931
|
Franti\v{s}ek Mat\'u\v{s}
|
Franti\v{s}ek Mat\'u\v{s}
|
Polymatroids and polyquantoids
| null |
\emph{Proceedings of WUPES 2012}, Sept.\ 12--15, Mari\'ansk\'e
L\'azn\`i, Czech Republic, 126--136
| null | null |
cs.IT cs.CR math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When studying entropy functions of multivariate probability distributions,
polymatroids and matroids emerge. Entropy functions of pure multiparty quantum
states give rise to analogous notions, called here polyquantoids and quantoids.
Polymatroids and polyquantoids are related via linear mappings and duality.
Quantum secret sharing schemes that are ideal are described by selfdual
matroids. Expansions of integer polyquantoids to quantoids are studied and
linked to that of polymatroids.
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2012 08:48:03 GMT"
}
] | 2012-10-31T00:00:00 |
[
[
"Matúš",
"František",
""
]
] |
new_dataset
| 0.982942 |
1210.8025
|
Ka Chun Lam
|
Lok Ming Lui, Ka Chun Lam, Tsz Wai Wong, XianFeng Gu
|
Beltrami Representation and its applications to texture map and video
compression
|
30 pages, 23 figures
| null | null | null |
cs.MM cs.GR math.DG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Surface parameterizations and registrations are important in computer
graphics and imaging, where 1-1 correspondences between meshes are computed. In
practice, surface maps are usually represented and stored as 3D coordinates
each vertex is mapped to, which often requires lots of storage memory. This
causes inconvenience in data transmission and data storage. To tackle this
problem, we propose an effective algorithm for compressing surface
homeomorphisms using Fourier approximation of the Beltrami representation. The
Beltrami representation is a complex-valued function defined on triangular
faces of the surface mesh with supreme norm strictly less than 1. Under
suitable normalization, there is a 1-1 correspondence between the set of
surface homeomorphisms and the set of Beltrami representations. Hence, every
bijective surface map is associated with a unique Beltrami representation.
Conversely, given a Beltrami representation, the corresponding bijective
surface map can be exactly reconstructed using the Linear Beltrami Solver
introduced in this paper. Using the Beltrami representation, the surface
homeomorphism can be easily compressed by Fourier approximation, without
distorting the bijectivity of the map. The storage memory can be effectively
reduced, which is useful for many practical problems in computer graphics and
imaging. In this paper, we proposed to apply the algorithm to texture map
compression and video compression. With our proposed algorithm, the storage
requirement for the texture properties of a textured surface can be
significantly reduced. Our algorithm can further be applied to compressing
motion vector fields for video compression, which effectively improve the
compression ratio.
|
[
{
"version": "v1",
"created": "Thu, 18 Oct 2012 12:17:12 GMT"
}
] | 2012-10-31T00:00:00 |
[
[
"Lui",
"Lok Ming",
""
],
[
"Lam",
"Ka Chun",
""
],
[
"Wong",
"Tsz Wai",
""
],
[
"Gu",
"XianFeng",
""
]
] |
new_dataset
| 0.988701 |
1210.8055
|
Sudhindu Bikash Mandal SBM
|
Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur-Kolay
|
A Synthesis Method for Quaternary Quantum Logic Circuits
|
10 pages
|
Progress in VLSI Design and Test Lecture Notes in Computer Science
Volume 7373, 2012, pp 270-280
|
10.1007/978-3-642-31494-0_31
| null |
cs.OH quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis of quaternary quantum circuits involves basic quaternary gates and
logic operations in the quaternary quantum domain. In this paper, we propose
new projection operations and quaternary logic gates for synthesizing
quaternary logic functions. We also demonstrate the realization of the proposed
gates using basic quantum quaternary operations. We then employ our synthesis
method to design of quaternary adder and some benchmark circuits. Our results
in terms of circuit cost, are better than the existing works.
|
[
{
"version": "v1",
"created": "Fri, 26 Oct 2012 12:34:05 GMT"
}
] | 2012-10-31T00:00:00 |
[
[
"Mandal",
"Sudhindu Bikash",
""
],
[
"Chakrabarti",
"Amlan",
""
],
[
"Sur-Kolay",
"Susmita",
""
]
] |
new_dataset
| 0.978789 |
1210.6154
|
Federico-Vladimir Gutierrez-Corea
|
Federico-Vladimir Gutierrez-Corea (UNI), Adolfo-Javier
Urrutia-Zambrana (UNI)
|
Propuesta de sistema GeoInform\'atico con representaci\'on de escenarios
para auxiliar en la nueva metodolog\'ia propuesta por INETER y la UNI para el
estudio a gran escala de la vulnerabilidad y da\~nos debido a sismos en las
edificaciones
|
Published date: 02/07/2007
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A GIS based software is presented which permits the estimation of seismic
vulnerability and the presentation of results in digital maps for single
houses, groups of buildings, parts of settlements or even complete towns.
Nicaragua is a country with a high seismic activity. The assessment of seismic
vulnerability requires the execution of distinct tasks, e.g. recollection of
field data, integration of data from the municipal cadastre, reprocessing or
screening to test the reliability of the data, definition of calculation of
vulnerability functions, calculation of vulnerability for single objects as
houses or buildings, calculation of mean vulnerability for certain areas as
barrios or squares. In order to reduce time and effort to be spent with several
unspecialized tools and procedures, an integrated software system was created,
the user of which has not to care about separate software tools for each part
of the process. The main advantage of the software is the combination of
Geographical Information System (GIS) with the logics that surrounds the
specific methodologies of seismic vulnerability index, index of damages and
presentation of results. The new software uses a connection with an external
centralized Enterprise Data Base which stores all the input information and
calculation results and which is automatically synchronized for the
presentation of results using GIS. The cadastral information contains data on
the constructive type of the house, dimensions, year of construction, type of
walls, roof, number of inhabitants, etc.. The system also allows to present
damage scenarios for specific seismic events with given hypocenter and
magnitude. The documentation of the software serves as a guide for students
working on object oriented software engineering by using unified modeling
language (UML) and software logic architecture (3-tiers).
|
[
{
"version": "v1",
"created": "Tue, 23 Oct 2012 07:41:58 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Oct 2012 23:01:13 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Gutierrez-Corea",
"Federico-Vladimir",
"",
"UNI"
],
[
"Urrutia-Zambrana",
"Adolfo-Javier",
"",
"UNI"
]
] |
new_dataset
| 0.998518 |
1210.7282
|
Ruggero Micheletto
|
Robert Bishop and Ruggero Micheletto
|
The Hangulphabet: A Descriptive Alphabet
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the Hangulphabet, a new writing system that should prove
useful in a number of contexts. Using the Hangulphabet, a user can instantly
see voicing, manner and place of articulation of any phoneme found in human
language. The Hangulphabet places consonant graphemes on a grid with the x-axis
representing the place of articulation and the y-axis representing manner of
articulation. Each individual grapheme contains radicals from both axes where
the points intersect. The top radical represents manner of articulation where
the bottom represents place of articulation. A horizontal line running through
the middle of the bottom radical represents voicing. For vowels, place of
articulation is located on a grid that represents the position of the tongue in
the mouth. This grid is similar to that of the IPA vowel chart (International
Phonetic Association, 1999). The difference with the Hangulphabet being the
trapezoid representing the vocal apparatus is on a slight tilt. Place of
articulation for a vowel is represented by a breakout figure from the grid.
This system can be used as an alternative to the International Phonetic
Alphabet (IPA) or as a complement to it. Beginning students of linguistics may
find it particularly useful. A Hangulphabet font has been created to facilitate
switching between the Hangulphabet and the IPA.
|
[
{
"version": "v1",
"created": "Sat, 27 Oct 2012 02:34:35 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Bishop",
"Robert",
""
],
[
"Micheletto",
"Ruggero",
""
]
] |
new_dataset
| 0.999424 |
1210.7295
|
Chung-Chieh Fang
|
Chung-Chieh Fang and Eyad H. Abed
|
Analysis and Control of Period-Doubling Bifurcation in Buck Converters
Using Harmonic Balance
|
Published in the International Journal of Latin American Applied
Research, 31(3), pp. 149-156, Jul. 2001, Special theme issue: Bifurcation
Control: Methodologies and Applications, In Honor of the 65th Birthday of
Professor Leon O. Chua
|
International Journal of Latin American Applied Research, 31(3),
pp. 149-156, Jul. 2001
| null | null |
cs.SY math.DS nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Period doubling bifurcation in buck converters is studied by using the
harmonic balance method. A simple dynamic model of a buck converter in
continuous conduction mode under voltage mode or current mode control is
derived. This model consists of the feedback connection of a linear system and
a nonlinear one. An exact harmonic balance analysis is used to obtain a
necessary and sufficient condition for a period doubling bifurcation to occur.
If such a bifurcation occurs, the analysis also provides information on its
exact location. Using the condition for bifurcation, a feedforward control is
designed to eliminate the period doubling bifurcation. This results in a wider
range of allowed source voltage, and also in improved line regulation.
|
[
{
"version": "v1",
"created": "Sat, 27 Oct 2012 06:24:07 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Fang",
"Chung-Chieh",
""
],
[
"Abed",
"Eyad H.",
""
]
] |
new_dataset
| 0.970484 |
1210.7349
|
Katherine Edwards
|
Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul
Seymour
|
Edge-colouring seven-regular planar graphs
|
23 pages. arXiv admin note: substantial text overlap with
arXiv:1209.1176
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conjecture due to the fourth author states that every $d$-regular planar
multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of
vertices, there are at least $d$ edges between $X$ and its complement. For $d =
3$ this is the four-colour theorem, and the conjecture has been proved for all
$d\le 8$, by various authors. In particular, two of us proved it when $d=7$;
and then three of us proved it when $d=8$. The methods used for the latter give
a proof in the $d=7$ case that is simpler than the original, and we present it
here.
|
[
{
"version": "v1",
"created": "Sat, 27 Oct 2012 17:12:37 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Chudnovsky",
"Maria",
""
],
[
"Edwards",
"Katherine",
""
],
[
"Kawarabayashi",
"Ken-ichi",
""
],
[
"Seymour",
"Paul",
""
]
] |
new_dataset
| 0.996608 |
1210.7401
|
Huiyue Yi
|
Huiyue Yi
|
Joint Doppler frequency shift compensation and data detection method
using 2-D unitary ESPRIT algorithm for SIMO-OFDM railway communication
systems
|
25 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a joint Doppler frequency shift compensation and
data detection method using 2-D unitary ESPRIT algorithm for SIMO-OFDM railway
communication systems over fast time-varying sparse multipath channels. By
creating the spatio-temporal array data matrix utilizing the ISI-free part of
the CP (cyclic prefix), we first propose a novel algorithm for obtaining
auto-paired joint DOA and Doppler frequency shift estimates of all paths via
2-D unitary ESPRIT algorithm. Thereafter, based on the obtained estimates, a
joint Doppler frequency shift compensation and data detection method is
developed. This method consists of three parts: (a) the received signal is
spatially filtered to get the signal corresponding to each path, and the signal
corresponding to each path is compensated for the Doppler frequency shift in
time domain, (b) the Doppler frequency shift-compensated signals of all paths
are summed together, and (c) the desired information is detected by performing
FFT on the summed signal after excluding the CP. Moreover, we prove that the
channel matrix becomes time-invariant after Doppler frequency shift
compensation and the ICI is effectively avoided. Finally, simulation results
are presented to demonstrate the performance of the proposed method and compare
it with the conventional method.
|
[
{
"version": "v1",
"created": "Sun, 28 Oct 2012 05:17:56 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Yi",
"Huiyue",
""
]
] |
new_dataset
| 0.994812 |
1210.7417
|
Roohallah Rastaghi
|
Roohallah Rastaghi, Hamid R. Dalili Oskouei
|
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction
Algorithm
| null |
IJCSI International Journal of Computer Science Issues, Vol. 9,
Issue 5, No 1, September 2012
| null | null |
cs.CR cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We proposed a new attack against Hwang et al.'s cryptosystem. This
cryptosystem uses a super-increasing sequence as private key and the authors
investigate a new algorithm called permutation combination algorithm to enhance
density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j.
Sattar, "An improved knapsack public key cryptography system", International
Journal of Internet Technology and Secured Transactions, Vol.3 (3), pp.310-319,
2011] used Shamir's attack on the basic Merkle-Hellman cryptosystem to break
this cryptosystem.
In this paper, we introduce a direct attack against Hwang et al.'s
cryptosystem based on Lattice basis reduction algorithms. By computing
complexity of propose attack, we show that unlike Aboud's cryptanalysis, our
cryptanalysis is more efficient and practicable.
|
[
{
"version": "v1",
"created": "Sun, 28 Oct 2012 07:41:20 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Rastaghi",
"Roohallah",
""
],
[
"Oskouei",
"Hamid R. Dalili",
""
]
] |
new_dataset
| 0.995338 |
1210.7482
|
Nader Ale Ebrahim
|
Nader Ale Ebrahim, Shamsuddin Ahmed, Zahari Taha
|
Modified Stage-Gate: A Conceptual Model of Virtual Product Development
Process
|
24 pages
|
African Journal of Marketing Management, 1(9) (2009) 211-219
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In today s dynamic marketplace, manufacturing companies are under strong
pressure to introduce new products for long-term survival with their
competitors. Nevertheless, every company cannot cope up progressively or
immediately with the market requirements due to knowledge dynamics being
experienced in the competitive milieu. Increased competition and reduced
product life cycles put force upon companies to develop new products faster. In
response to these pressing needs, there should be some new approach compatible
in flexible circumstances. This paper presents a solution based on the popular
Stage-Gate system, which is closely linked with virtual team approach. Virtual
teams can provide a platform to advance the knowledge-base in a company and
thus to reduce time-to-market. This article introduces conceptual product
development architecture under a virtual team umbrella. The paper describes all
the major aspects of new product development (NPD), NPD process and its
relationship with virtual teams, Stage-Gate system finally presents a modified
Stage-Gate system to cope up with the changing needs. It also provides the
guidelines for the successful implementation of virtual teams in new product
development.
|
[
{
"version": "v1",
"created": "Sun, 28 Oct 2012 17:50:48 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Ebrahim",
"Nader Ale",
""
],
[
"Ahmed",
"Shamsuddin",
""
],
[
"Taha",
"Zahari",
""
]
] |
new_dataset
| 0.968607 |
1210.7515
|
Eitan Yaakobi
|
Eitan Yaakobi, Hessam Mahdavifar, Paul H. Siegel, Alexander Vardy,
Jack K. Wolf
|
Rewriting Codes for Flash Memories
|
arXiv admin note: substantial text overlap with arXiv:0905.1512
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Flash memory is a non-volatile computer memory comprising blocks of cells,
wherein each cell can take on q different values or levels. While increasing
the cell level is easy, reducing the level of a cell can be accomplished only
by erasing an entire block. Since block erasures are highly undesirable, coding
schemes - known as floating codes (or flash codes) and buffer codes - have been
designed in order to maximize the number of times that information stored in a
flash memory can be written (and re-written) prior to incurring a block
erasure.
An (n,k,t)q flash code C is a coding scheme for storing k information bits in
$n$ cells in such a way that any sequence of up to t writes can be accommodated
without a block erasure. The total number of available level transitions in n
cells is n(q-1), and the write deficiency of C, defined as \delta(C) =
n(q-1)-t, is a measure of how close the code comes to perfectly utilizing all
these transitions. In this paper, we show a construction of flash codes with
write deficiency O(qk\log k) if q \geq \log_2k, and at most O(k\log^2 k)
otherwise.
An (n,r,\ell,t)q buffer code is a coding scheme for storing a buffer of r
\ell-ary symbols such that for any sequence of t symbols it is possible to
successfully decode the last r symbols that were written. We improve upon a
previous upper bound on the maximum number of writes t in the case where there
is a single cell to store the buffer. Then, we show how to improve a
construction by Jiang et al. that uses multiple cells, where n\geq 2r.
|
[
{
"version": "v1",
"created": "Sun, 28 Oct 2012 21:33:42 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Yaakobi",
"Eitan",
""
],
[
"Mahdavifar",
"Hessam",
""
],
[
"Siegel",
"Paul H.",
""
],
[
"Vardy",
"Alexander",
""
],
[
"Wolf",
"Jack K.",
""
]
] |
new_dataset
| 0.998858 |
1210.7605
|
Zdenek Dvorak
|
Zdenek Dvorak and Ken-ichi Kawarabayashi
|
List-coloring embedded graphs
|
14 pages, 0 figures, accepted to SODA'13
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any fixed surface Sigma of genus g, we give an algorithm to decide
whether a graph G of girth at least five embedded in Sigma is colorable from an
assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow
a subgraph (of any size) with at most s components to be precolored, at the
expense of increasing the time complexity of the algorithm to
O(|V(G)|^{K(g+s)+1}) for some absolute constant K; in both cases, the
multiplicative constant hidden in the O-notation depends on g and s. This also
enables us to find such a coloring when it exists. The idea of the algorithm
can be applied to other similar problems, e.g., 5-list-coloring of graphs on
surfaces.
|
[
{
"version": "v1",
"created": "Mon, 29 Oct 2012 09:56:59 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Dvorak",
"Zdenek",
""
],
[
"Kawarabayashi",
"Ken-ichi",
""
]
] |
new_dataset
| 0.994614 |
1210.7631
|
Amelia Carolina Sparavigna
|
Amelia Carolina Sparavigna
|
The fortresses of Ejin: an example of outlining a site from satellite
images
|
Keywords: Satellite Imagery, Image processing, GIS, fortresses, China
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From 1960's to 1970's, the Chinese Army built some fortified artificial
hills. Some of them are located in the Inner Mongolia, Western China. These
large fortresses are surrounded by moats. For some of them it is still possible
to see earthworks, trenches and ditches, the planning of which could have a
symbolic meaning. We can argue this result form their digital outlining,
obtained after an image processing of satellite images, based on edge
detection.
|
[
{
"version": "v1",
"created": "Mon, 29 Oct 2012 11:53:35 GMT"
}
] | 2012-10-30T00:00:00 |
[
[
"Sparavigna",
"Amelia Carolina",
""
]
] |
new_dataset
| 0.993443 |
1210.7102
|
Harivinod N
|
B. H. Shekar, N. Harivinod, M. Sharmila Kumari, K. Raghurama Holla
|
3D Face Recognition using Significant Point based SULD Descriptor
| null | null |
10.1109/ICRTIT.2011.5972443
| null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this work, we present a new 3D face recognition method based on Speeded-Up
Local Descriptor (SULD) of significant points extracted from the range images
of faces. The proposed model consists of a method for extracting distinctive
invariant features from range images of faces that can be used to perform
reliable matching between different poses of range images of faces. For a given
3D face scan, range images are computed and the potential interest points are
identified by searching at all scales. Based on the stability of the interest
point, significant points are extracted. For each significant point we compute
the SULD descriptor which consists of vector made of values from the convolved
Haar wavelet responses located on concentric circles centred on the significant
point, and where the amount of Gaussian smoothing is proportional to the radii
of the circles. Experimental results show that the newly proposed method
provides higher recognition rate compared to other existing contemporary models
developed for 3D face recognition.
|
[
{
"version": "v1",
"created": "Fri, 26 Oct 2012 11:27:33 GMT"
}
] | 2012-10-29T00:00:00 |
[
[
"Shekar",
"B. H.",
""
],
[
"Harivinod",
"N.",
""
],
[
"Kumari",
"M. Sharmila",
""
],
[
"Holla",
"K. Raghurama",
""
]
] |
new_dataset
| 0.997467 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.