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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1009.4300
|
Eddy Chiu
|
Eddy Chiu, Vincent K. N. Lau, Huang Huang, Tao Wu and Sheng Liu
|
Robust Transceiver Design for K-Pairs Quasi-Static MIMO Interference
Channels via Semi-Definite Relaxation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a robust transceiver design for the K-pair
quasi-static MIMO interference channel. Each transmitter is equipped with M
antennas, each receiver is equipped with N antennas, and the k-th transmitter
sends L_k independent data streams to the desired receiver. In the literature,
there exist a variety of theoretically promising transceiver designs for the
interference channel such as interference alignment-based schemes, which have
feasibility and practical limitations. In order to address practical system
issues and requirements, we consider a transceiver design that enforces
robustness against imperfect channel state information (CSI) as well as fair
performance among the users in the interference channel. Specifically, we
formulate the transceiver design as an optimization problem to maximize the
worst-case signal-to-interference-plus-noise ratio among all users. We devise a
low complexity iterative algorithm based on alternative optimization and
semi-definite relaxation techniques. Numerical results verify the advantages of
incorporating into transceiver design for the interference channel important
practical issues such as CSI uncertainty and fairness performance.
|
[
{
"version": "v1",
"created": "Wed, 22 Sep 2010 08:56:35 GMT"
}
] | 2010-09-23T00:00:00 |
[
[
"Chiu",
"Eddy",
""
],
[
"Lau",
"Vincent K. N.",
""
],
[
"Huang",
"Huang",
""
],
[
"Wu",
"Tao",
""
],
[
"Liu",
"Sheng",
""
]
] |
new_dataset
| 0.965545 |
1009.4012
|
Geoffroy Gueguen
|
Geoffroy Gueguen
|
Van Wijngaarden grammars, metamorphism and K-ary malwares
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grammars are used to describe sentences structure, thanks to some sets of
rules, which depends on the grammar type. A classification of grammars has been
made by Noam Chomsky, which led to four well-known types. Yet, there are other
types of grammars, which do not exactly fit in Chomsky's classification, such
as the two-level grammars. As their name suggests it, the main idea behind
these grammars is that they are composed of two grammars. Van Wijngaarden
grammars, particularly, are such grammars. They are interesting by their power
(expressiveness), which can be the same, under some hypotheses, as the most
powerful grammars of Chomsky's classification, i.e. Type 0 grammars. Another
point of interest is their relative conciseness and readability. Van
Wijngaarden grammars can describe static and dynamic semantic of a language.
So, by using them as a generative engine, it is possible to generate a possibly
infinite set of words, while assuring us that they all have the same semantic.
Moreover, they can describe K-ary codes, by describing the semantic of each
components of a code.
|
[
{
"version": "v1",
"created": "Tue, 21 Sep 2010 07:24:20 GMT"
}
] | 2010-09-22T00:00:00 |
[
[
"Gueguen",
"Geoffroy",
""
]
] |
new_dataset
| 0.998981 |
1008.1224
|
Sandor P. Fekete
|
Erik D. Demaine, Sandor P. Fekete, and Robert J. Lang
|
Circle Packing for Origami Design Is Hard
|
17 pages, 13 figures. An abstract was presented at the 5th
International Conference on Origami in Science, Mathematics and Education
(5OSME). Updated to fix a numerical typo related to Figure 13, and a new
result
| null | null | null |
cs.CG cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that deciding whether a given set of circles can be packed into a
rectangle, an equilateral triangle, or a unit square are NP-hard problems,
settling the complexity of these natural packing problems. On the positive
side, we show that any set of circles of total area 1 can be packed into a
square of size 4/\sqrt{pi}=2.2567... These results are motivated by problems
arising in the context of origami design.
|
[
{
"version": "v1",
"created": "Fri, 6 Aug 2010 16:05:28 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Sep 2010 10:58:47 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Fekete",
"Sandor P.",
""
],
[
"Lang",
"Robert J.",
""
]
] |
new_dataset
| 0.999385 |
1009.3502
|
Krishnam Raju Jampani
|
Krishnam Raju Jampani and Anna Lubiw
|
Simultaneous Interval Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a recent paper, we introduced the simultaneous representation problem
(defined for any graph class C) and studied the problem for chordal,
comparability and permutation graphs. For interval graphs, the problem is
defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I
(and the corresponding induced edges), are said to be `simultaneous interval
graphs' if there exist interval representations R_1 and R_2 of G_1 and G_2,
such that any vertex of I is mapped to the same interval in both R_1 and R_2.
Equivalently, G_1 and G_2 are simultaneous interval graphs if there exist edges
E' between G_1-I and G_2-I such that G_1 \cup G_2 \cup E' is an interval graph.
Simultaneous representation problems are related to simultaneous planar
embeddings, and have applications in any situation where it is desirable to
consistently represent two related graphs, for example: interval graphs
capturing overlaps of DNA fragments of two similar organisms; or graphs
connected in time, where one is an updated version of the other.
In this paper we give an O(n^2*logn) time algorithm for recognizing
simultaneous interval graphs,where n = |G_1 \cup G_2|. This result complements
the polynomial time algorithms for recognizing probe interval graphs and
provides an efficient algorithm for the interval graph sandwich problem for the
special case where the set of optional edges induce a complete bipartite graph.
|
[
{
"version": "v1",
"created": "Fri, 17 Sep 2010 20:25:56 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Jampani",
"Krishnam Raju",
""
],
[
"Lubiw",
"Anna",
""
]
] |
new_dataset
| 0.997246 |
1009.3539
|
Fangying Xiao
|
Fangying Xiao and Hanwu Chen
|
Is A Quantum Stabilizer Code Degenerate or Nondegenerate for Pauli
Channel?
|
7 pages,1 figure
| null | null | null |
cs.CR quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mapping an error syndrome to the error operator is the core of quantum
decoding network and is also the key step of recovery. The definitions of the
bit-flip error syndrome matrix and the phase-flip error syndrome matrix were
presented, and then the error syndromes of quantum errors were expressed in
terms of the columns of the bit-flip error syndrome matrix and the phase-flip
error syndrome matrix. It also showed that the error syndrome matrices of a
stabilizer code are determined by its check matrix, which is similar to the
classical case. So, the error-detection and recovery techniques of classical
linear codes can be applied to quantum stabilizer codes after some
modifications. Some necessary and/or sufficient conditions for the stabilizer
code over GF(2) is degenerate or nondegenerate for Pauli channel based on the
relationship between the error syndrome matrices and the check matrix was
presented. A new way to find the minimum distance of the quantum stabilizer
codes based on their check matrices was presented, and followed from which we
proved that the performance of degenerate quantum code outperform (at least
have the same performance) nondegenerate quantum code for Pauli channel.
|
[
{
"version": "v1",
"created": "Sat, 18 Sep 2010 07:47:16 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Xiao",
"Fangying",
""
],
[
"Chen",
"Hanwu",
""
]
] |
new_dataset
| 0.995552 |
1009.3552
|
Arash Habibi Lashkari
|
Behrang Parhizkar, Abdulbasit Mohammad Abdulrahman Alazizi, Mohammad
Nabil Sadegh Ali, Anand Ramachandran, Sujata Navaratnam
|
PC 2 Phone Event Announcer
|
5 pages, 3 figures, IJCSIS Vol. 8 No. 5
|
International Journal of Computer Science& Information
Security(IJCSIS) Vol. 8 No. 5, August 2010, ISSN 1947-5500
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, mobile phones are indispensable devices; it has become a trend now
that college and university students are owners of such devices and this
particular factor plays a very important role behind the coming up with the
proposed system. "PC 2 Phone event Announcer", is the name of the new proposed
system suggested to solve the existing communication problem between the
College staff and students. As the name suggests, it can be deduced that the
system will involve computers and phones, more specifically mobile phones.
|
[
{
"version": "v1",
"created": "Sat, 18 Sep 2010 12:02:33 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Parhizkar",
"Behrang",
""
],
[
"Alazizi",
"Abdulbasit Mohammad Abdulrahman",
""
],
[
"Ali",
"Mohammad Nabil Sadegh",
""
],
[
"Ramachandran",
"Anand",
""
],
[
"Navaratnam",
"Sujata",
""
]
] |
new_dataset
| 0.999573 |
1009.3602
|
Fang Liu
|
Fang Liu, Daiyuan Peng, Zhengchun Zhou, and Xiaohu Tang
|
Construction of Frequency Hopping Sequence Set Based upon Generalized
Cyclotomy
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frequency hopping (FH) sequences play a key role in frequency hopping spread
spectrum communication systems. It is important to find FH sequences which have
simultaneously good Hamming correlation, large family size and large period. In
this paper, a new set of FH sequences with large period is proposed, and the
Hamming correlation distribution of the new set is investigated. The
construction of new FH sequences is based upon Whiteman's generalized
cyclotomy. It is shown that the proposed FH sequence set is optimal with
respect to the average Hamming correlation bound.
|
[
{
"version": "v1",
"created": "Sun, 19 Sep 2010 03:28:17 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Liu",
"Fang",
""
],
[
"Peng",
"Daiyuan",
""
],
[
"Zhou",
"Zhengchun",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.976686 |
1009.3665
|
Amitabh Chaudhary
|
Tanu Malik, Xiaodan Wang, Philip Little, Amitabh Chaudhary, and Ani
Thakar
|
A Dynamic Data Middleware Cache for Rapidly-growing Scientific
Repositories
| null | null | null | null |
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern scientific repositories are growing rapidly in size. Scientists are
increasingly interested in viewing the latest data as part of query results.
Current scientific middleware cache systems, however, assume repositories are
static. Thus, they cannot answer scientific queries with the latest data. The
queries, instead, are routed to the repository until data at the cache is
refreshed. In data-intensive scientific disciplines, such as astronomy,
indiscriminate query routing or data refreshing often results in runaway
network costs. This severely affects the performance and scalability of the
repositories and makes poor use of the cache system. We present Delta, a
dynamic data middleware cache system for rapidly-growing scientific
repositories. Delta's key component is a decision framework that adaptively
decouples data objects---choosing to keep some data object at the cache, when
they are heavily queried, and keeping some data objects at the repository, when
they are heavily updated. Our algorithm profiles incoming workload to search
for optimal data decoupling that reduces network costs. It leverages formal
concepts from the network flow problem, and is robust to evolving scientific
workloads. We evaluate the efficacy of Delta, through a prototype
implementation, by running query traces collected from a real astronomy survey.
|
[
{
"version": "v1",
"created": "Sun, 19 Sep 2010 22:26:23 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Malik",
"Tanu",
""
],
[
"Wang",
"Xiaodan",
""
],
[
"Little",
"Philip",
""
],
[
"Chaudhary",
"Amitabh",
""
],
[
"Thakar",
"Ani",
""
]
] |
new_dataset
| 0.996375 |
1009.3779
|
Mostafa Zaman Chowdhury
|
Mostafa Zaman Chowdhury and Yeong Min Jang
|
Handover Control for WCDMA Femtocell Networks
|
Published in "The Journal of Korea Information and Communication
Society" for the volume of May 2010
|
The Journal of Korea Information and Communication Society, May
2010
| null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to seamlessly switch between the macro networks and femtocell
networks is a key driver for femtocell network deployment. The handover
procedures for the integrated femtocell/macrocell networks differ from the
existing handovers. Some modifications of existing network and protocol
architecture for the integration of femtocell networks with the existing
macrocell networks are also essential. These modifications change the signal
flow for handover procedures due to different 2-tier cell (macrocell and
femtocell) environment. The handover between two networks should be performed
with minimum signaling. A frequent and unnecessary handover is another problem
for hierarchical femtocell/macrocell network environment that must be
minimized. This work studies the details mobility management schemes for small
and medium scale femtocell network deployment. To do that, firstly we present
two different network architectures for small scale and medium scale WCDMA
femtocell deployment. The details handover call flow for these two network
architectures and CAC scheme to minimize the unnecessary handovers are proposed
for the integrated femtocell/macrocell networks. The numerical analysis for the
proposed M/M/N/N queuing scheme and the simulation results of the proposed CAC
scheme demonstrate the handover call control performances for femtocell
environment.
|
[
{
"version": "v1",
"created": "Mon, 20 Sep 2010 11:50:21 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"Chowdhury",
"Mostafa Zaman",
""
],
[
"Jang",
"Yeong Min",
""
]
] |
new_dataset
| 0.995766 |
1009.3806
|
Germ\'an Vidal
|
Paulo Andr\'e and Salvador Abreu
|
Casting of the WAM as an EAM
|
Online proceedings of the Joint Workshop on Implementation of
Constraint Logic Programming Systems and Logic-based Methods in Programming
Environments (CICLOPS-WLPE 2010), Edinburgh, Scotland, U.K., July 15, 2010
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Logic programming provides a very high-level view of programming, which comes
at the cost of some execution efficiency. Improving performance of logic
programs is thus one of the holy grails of Prolog system implementations and a
wide range of approaches have historically been taken towards this goal.
Designing computational models that both exploit the available parallelism in a
given application and that try hard to reduce the explored search space has
been an ongoing line of research for many years. These goals in particular have
motivated the design of several computational models, one of which is the
Extended Andorra Model (EAM). In this paper, we present a preliminary
specification and implementation of the EAM with Implicit Control, the WAM2EAM,
which supplies regular WAM instructions with an EAM-centered interpretation.
|
[
{
"version": "v1",
"created": "Mon, 20 Sep 2010 13:04:13 GMT"
}
] | 2010-09-21T00:00:00 |
[
[
"André",
"Paulo",
""
],
[
"Abreu",
"Salvador",
""
]
] |
new_dataset
| 0.993652 |
1009.3291
|
Zhiying Wang
|
Zhiying Wang and Alexandros G. Dimakis and Jehoshua Bruck
|
Rebuilding for Array Codes in Distributed Storage Systems
|
7 pages, 3 figures, accepted by workshop on the Application of
Communication Theory to Emerging Memory Technologies (ACTEMT) 2010
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In distributed storage systems that use coding, the issue of minimizing the
communication required to rebuild a storage node after a failure arises. We
consider the problem of repairing an erased node in a distributed storage
system that uses an EVENODD code. EVENODD codes are maximum distance separable
(MDS) array codes that are used to protect against erasures, and only require
XOR operations for encoding and decoding. We show that when there are two
redundancy nodes, to rebuild one erased systematic node, only 3/4 of the
information needs to be transmitted. Interestingly, in many cases, the required
disk I/O is also minimized.
|
[
{
"version": "v1",
"created": "Thu, 16 Sep 2010 21:54:20 GMT"
}
] | 2010-09-20T00:00:00 |
[
[
"Wang",
"Zhiying",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.9815 |
1009.3415
|
Caihong Kai
|
Cai Hong Kai and Soung Chang Liew
|
Temporal Starvation in CSMA Wireless Networks
|
27 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that links in CSMA wireless networks are prone to
starvation. Prior works focused almost exclusively on equilibrium starvation.
In this paper, we show that links in CSMA wireless networks are also
susceptible to temporal starvation. Specifically, although some links have good
equilibrium throughputs and do not suffer from equilibrium starvation, they can
still have no throughput for extended periods from time to time. Given its
impact on quality of service, it is important to understand and characterize
temporal starvation. To this end, we develop a "trap theory" to analyze
temporal throughput fluctuation. The trap theory serves two functions. First,
it allows us to derive new mathematical results that shed light on the
transient behavior of CSMA networks. For example, we show that the duration of
a trap, during which some links receive no throughput, is insensitive to the
distributions of the backoff countdown and transmission time (packet duration)
in the CSMA protocol. Second, we can develop analytical tools for computing the
"degrees of starvation" for CSMA networks to aid network design. For example,
given a CSMA network, we can determine whether it suffers from starvation, and
if so, which links will starve. Furthermore, the likelihood and durations of
temporal starvation can also be computed. We believe that the ability to
identify and characterize temporal starvation as established in this paper will
serve as an important first step toward the design of effective remedies for
it.
|
[
{
"version": "v1",
"created": "Fri, 17 Sep 2010 13:21:16 GMT"
}
] | 2010-09-20T00:00:00 |
[
[
"Kai",
"Cai Hong",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.982915 |
1009.2218
|
Amol Aggarwal
|
Amol Aggarwal
|
On Isosceles Triangles and Related Problems in a Convex Polygon
| null | null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given any convex $n$-gon, in this article, we: (i) prove that its vertices
can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of
unit length and show that this bound is optimal in the first order, (ii)
conjecture that its vertices can form at most $3n^2/4 + o(n^2)$ isosceles
triangles and prove this conjecture for a special group of convex $n$-gons,
(iii) prove that its vertices can form at most $\lfloor n/k \rfloor$ regular
$k$-gons for any integer $k\ge 4$ and that this bound is optimal, and (iv)
provide a short proof that the sum of all the distances between its vertices is
at least $(n-1)/2$ and at most $\lfloor n/2 \rfloor \lceil n/2 \rceil(1/2)$ as
long as the convex $n$-gon has unit perimeter.
|
[
{
"version": "v1",
"created": "Sun, 12 Sep 2010 05:56:03 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Sep 2010 05:06:19 GMT"
}
] | 2010-09-16T00:00:00 |
[
[
"Aggarwal",
"Amol",
""
]
] |
new_dataset
| 0.998756 |
1009.2902
|
Jan Bergstra
|
Jan A. Bergstra
|
Informal Control code logic
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
General definitions as well as rules of reasoning regarding control code
production, distribution, deployment, and usage are described. The role of
testing, trust, confidence and risk analysis is considered. A rationale for
control code testing is sought and found for the case of safety critical
embedded control code.
|
[
{
"version": "v1",
"created": "Wed, 15 Sep 2010 12:02:04 GMT"
}
] | 2010-09-16T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
]
] |
new_dataset
| 0.996328 |
1009.2927
|
Yi Ma
|
Na Yi, Yi Ma and Rahim Tafazolli
|
Underlay Cognitive Radio with Full or Partial Channel Quality
Information
|
29 Pages, 8 figures
|
International Journal of Navigation and Observation 2010
|
10.1155/2010/105723
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Underlay cognitive radios (UCRs) allow a secondary user to enter a primary
user's spectrum through intelligent utilization of multiuser channel quality
information (CQI) and sharing of codebook. The aim of this work is to study
two-user Gaussian UCR systems by assuming the full or partial knowledge of
multiuser CQI. Key contribution of this work is motivated by the fact that the
full knowledge of multiuser CQI is not always available. We first establish a
location-aided UCR model where the secondary user is assumed to have partial
CQI about the secondary-transmitter to primary-receiver link as well as full
CQI about the other links. Then, new UCR approaches are proposed and carefully
analyzed in terms of the secondary user's achievable rate, denoted by $C_2$,
the capacity penalty to primary user, denoted by $\Delta C_1$, and capacity
outage probability. Numerical examples are provided to visually compare the
performance of UCRs with full knowledge of multiuser CQI and the proposed
approaches with partial knowledge of multiuser CQI.
|
[
{
"version": "v1",
"created": "Wed, 15 Sep 2010 13:52:15 GMT"
}
] | 2010-09-16T00:00:00 |
[
[
"Yi",
"Na",
""
],
[
"Ma",
"Yi",
""
],
[
"Tafazolli",
"Rahim",
""
]
] |
new_dataset
| 0.98822 |
1009.2617
|
Anish Das Sarma
|
Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang
|
Understanding Fashion Cycles as a Social Choice
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a formal model for studying fashion trends, in terms of three
parameters of fashionable items: (1) their innate utility; (2) individual
boredom associated with repeated usage of an item; and (3) social influences
associated with the preferences from other people. While there are several
works that emphasize the effect of social influence in understanding fashion
trends, in this paper we show how boredom plays a strong role in both
individual and social choices. We show how boredom can be used to explain the
cyclic choices in several scenarios such as an individual who has to pick a
restaurant to visit every day, or a society that has to repeatedly `vote' on a
single fashion style from a collection. We formally show that a society that
votes for a single fashion style can be viewed as a single individual cycling
through different choices.
In our model, the utility of an item gets discounted by the amount of boredom
that has accumulated over the past; this boredom increases with every use of
the item and decays exponentially when not used. We address the problem of
optimally choosing items for usage, so as to maximize over-all satisfaction,
i.e., composite utility, over a period of time. First we show that the simple
greedy heuristic of always choosing the item with the maximum current composite
utility can be arbitrarily worse than the optimal. Second, we prove that even
with just a single individual, determining the optimal strategy for choosing
items is NP-hard. Third, we show that a simple modification to the greedy
algorithm that simply doubles the boredom of each item is a provably close
approximation to the optimal strategy. Finally, we present an experimental
study over real-world data collected from query logs to compare our algorithms.
|
[
{
"version": "v1",
"created": "Tue, 14 Sep 2010 10:32:44 GMT"
}
] | 2010-09-15T00:00:00 |
[
[
"Sarma",
"Anish Das",
""
],
[
"Gollapudi",
"Sreenivas",
""
],
[
"Panigrahy",
"Rina",
""
],
[
"Zhang",
"Li",
""
]
] |
new_dataset
| 0.994847 |
1005.3045
|
Noah Stein
|
Noah D. Stein, Pablo A. Parrilo, and Asuman Ozdaglar
|
A partial proof of Nash's Theorem via exchangeable equilibria
|
Announcement of an error found in the original proof submitted 17 May
2010
| null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document consists of two parts: the second part was submitted earlier as
a new proof of Nash's theorem, and the first part is a note explaining a
problem found in that proof. We are indebted to Sergiu Hart and Eran Shmaya for
their careful study which led to their simultaneous discovery of this error. So
far the error has not been fixed, but many of the results and techniques of the
paper remain valid, so we will continue to make it available online.
Abstract for the original paper:
We give a novel proof of the existence of Nash equilibria in all finite games
without using fixed point theorems or path following arguments. Our approach
relies on a new notion intermediate between Nash and correlated equilibria
called exchangeable equilibria, which are correlated equilibria with certain
symmetry and factorization properties. We prove these exist by a duality
argument, using Hart and Schmeidler's proof of correlated equilibrium existence
as a first step.
In an appropriate limit exchangeable equilibria converge to the convex hull
of Nash equilibria, proving that these exist as well. Exchangeable equilibria
are defined in terms of symmetries of the game, so this method automatically
proves the stronger statement that a symmetric game has a symmetric Nash
equilibrium. The case without symmetries follows by a symmetrization argument.
|
[
{
"version": "v1",
"created": "Mon, 17 May 2010 20:50:45 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Aug 2010 19:45:54 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Sep 2010 13:40:01 GMT"
}
] | 2010-09-14T00:00:00 |
[
[
"Stein",
"Noah D.",
""
],
[
"Parrilo",
"Pablo A.",
""
],
[
"Ozdaglar",
"Asuman",
""
]
] |
new_dataset
| 0.993012 |
1009.2206
|
Justin F Brunelle
|
Kyle B. Dempsey, Justin F. Brunelle, G. Tanner Jackson, Chutima
Boonthum, Irwin B. Levinstein, and Danielle S. McNamara
|
MiBoard: Multiplayer Interactive Board Game
|
14th International Conference on Artificial Intelligence in Education
(AIED), 2009
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Serious games have recently emerged as an avenue for curriculum delivery.
Serious games incorporate motivation and entertainment while providing pointed
curriculum for the user. This paper presents a serious game, called MiBoard,
currently being developed from the iSTART Intelligent Tutoring System. MiBoard
incorporates a multiplayer interaction that iSTART was previously unable to
provide. This multiplayer interaction produces a wide variation across game
trials, while also increasing the repeat playability for users. This paper
presents a demonstration of the MiBoard system and the expectations for its
application.
|
[
{
"version": "v1",
"created": "Sun, 12 Sep 2010 00:33:16 GMT"
}
] | 2010-09-14T00:00:00 |
[
[
"Dempsey",
"Kyle B.",
""
],
[
"Brunelle",
"Justin F.",
""
],
[
"Jackson",
"G. Tanner",
""
],
[
"Boonthum",
"Chutima",
""
],
[
"Levinstein",
"Irwin B.",
""
],
[
"McNamara",
"Danielle S.",
""
]
] |
new_dataset
| 0.997431 |
1009.2207
|
Justin F Brunelle
|
Kyle B Dempsey, G. Tanner Jackson, Justin F. Brunelle, Michael Rowe,
Danielle S. McNamara
|
MiBoard: A Digital Game from a Physical World
| null |
FLAIRS-23, May 22-23 2010
| null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasing user engagement is constant challenge for Intelligent Tutoring
Systems researchers. A current trend in the ITS field is to increase engagement
of proven learning systems by integrating them within games, or adding in game
like components. Incorporating proven learning methods within a game based
environment is expected to add to the overall experience without detracting
from the original goals, however, the current study demonstrates two important
issues with regard to ITS design. First, effective designs from the physical
world do not always translate into the digital world. Second, games do not
necessarily improve engagement, and in some cases, they may have the opposite
effect. The current study discusses the development and a brief assessment of
MiBoard a multiplayer collaborative online board game designed to closely
emulate a previously developed physical board game, iSTART: The Board Game.
|
[
{
"version": "v1",
"created": "Sun, 12 Sep 2010 00:35:50 GMT"
}
] | 2010-09-14T00:00:00 |
[
[
"Dempsey",
"Kyle B",
""
],
[
"Jackson",
"G. Tanner",
""
],
[
"Brunelle",
"Justin F.",
""
],
[
"Rowe",
"Michael",
""
],
[
"McNamara",
"Danielle S.",
""
]
] |
new_dataset
| 0.998102 |
1009.2002
|
Zeeshan Ahmed Mr.
|
Zeeshan Ahmed
|
Aero Fighter - 2D Gaming
|
In the proceedings of 9th National Research Conference on Management
and Computer Sciences, SZABIST Institute of Science and Technology, Pakistan
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing and developing quality based computer game is always a challenging
task for developers. In this paper I briefly discuss aero fighting war game
based on simple 2D gaming concepts and developed in C & C++ programming
languages, using old bitmapping concepts. Going into the details of the game
development, I discuss the designed strategies, flow of game and implemented
prototype version of game, especially for beginners of game programming.
|
[
{
"version": "v1",
"created": "Fri, 10 Sep 2010 12:56:30 GMT"
}
] | 2010-09-13T00:00:00 |
[
[
"Ahmed",
"Zeeshan",
""
]
] |
new_dataset
| 0.998329 |
1009.2003
|
Zeeshan Ahmed Mr.
|
Zeeshan Ahmed
|
AI 3D Cybug Gaming
|
In the proceedings of 9th National Research Conference on Management
and Computer Sciences, SZABIST Institute of Science and Technology, Pakistan
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this short paper I briefly discuss 3D war Game based on artificial
intelligence concepts called AI WAR. Going in to the details, I present the
importance of CAICL language and how this language is used in AI WAR. Moreover
I also present a designed and implemented 3D War Cybug for AI WAR using CAICL
and discus the implemented strategy to defeat its enemies during the game life.
|
[
{
"version": "v1",
"created": "Fri, 10 Sep 2010 12:58:30 GMT"
}
] | 2010-09-13T00:00:00 |
[
[
"Ahmed",
"Zeeshan",
""
]
] |
new_dataset
| 0.999129 |
0810.1268
|
Sang Joon Kim
|
Sang Joon Kim, Natasha Devroye, Vahid Tarokh
|
Bi-directional half-duplex protocols with multiple relays
|
44 pages, 17 figures, Submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a bi-directional relay channel, two nodes wish to exchange independent
messages over a shared wireless half-duplex channel with the help of relays.
Recent work has considered information theoretic limits of the bi-directional
relay channel with a single relay. In this work we consider bi-directional
relaying with multiple relays. We derive achievable rate regions and outer
bounds for half-duplex protocols with multiple decode and forward relays and
compare these to the same protocols with amplify and forward relays in an
additive white Gaussian noise channel. We consider three novel classes of
half-duplex protocols: the (m,2) 2 phase protocol with m relays, the (m,3) 3
phase protocol with m relays, and general (m, t) Multiple Hops and Multiple
Relays (MHMR) protocols, where m is the total number of relays and 3<t< m+3 is
the number of temporal phases in the protocol. The (m,2) and (m,3) protocols
extend previous bi-directional relaying protocols for a single m=1 relay, while
the new (m,t) protocol efficiently combines multi-hop routing with
message-level network coding. Finally, we provide a comprehensive treatment of
the MHMR protocols with decode and forward relaying and amplify and forward
relaying in the Gaussian noise, obtaining their respective achievable rate
regions, outer bounds and relative performance under different SNRs and relay
geometries, including an analytical comparison on the protocols at low and high
SNR.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2008 18:26:39 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Sep 2010 11:57:46 GMT"
}
] | 2010-09-10T00:00:00 |
[
[
"Kim",
"Sang Joon",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Tarokh",
"Vahid",
""
]
] |
new_dataset
| 0.989127 |
1005.0830
|
Jean-Guillaume Dumas
|
Jean-Guillaume Dumas (LJK), Thierry Gautier (INRIA Rh\^one-Alpes / LIG
Laboratoire d'Informatique de Grenoble), Jean-Louis Roch (INRIA Rh\^one-Alpes
/ LIG Laboratoire d'Informatique de Grenoble)
|
Generic design of Chinese remaindering schemes
|
International Symposium on Parallel Symbolic Computation, Grenoble :
France (2010)
| null |
10.1145/1837210.1837218
| null |
cs.SC cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a generic design for Chinese remainder algorithms. A Chinese
remainder computation consists in reconstructing an integer value from its
residues modulo non coprime integers. We also propose an efficient linear data
structure, a radix ladder, for the intermediate storage and computations. Our
design is structured into three main modules: a black box residue computation
in charge of computing each residue; a Chinese remaindering controller in
charge of launching the computation and of the termination decision; an integer
builder in charge of the reconstruction computation. We then show that this
design enables many different forms of Chinese remaindering (e.g.
deterministic, early terminated, distributed, etc.), easy comparisons between
these forms and e.g. user-transparent parallelism at different parallel grains.
|
[
{
"version": "v1",
"created": "Wed, 5 May 2010 19:45:22 GMT"
}
] | 2010-09-09T00:00:00 |
[
[
"Dumas",
"Jean-Guillaume",
"",
"LJK"
],
[
"Gautier",
"Thierry",
"",
"INRIA Rhône-Alpes / LIG\n Laboratoire d'Informatique de Grenoble"
],
[
"Roch",
"Jean-Louis",
"",
"INRIA Rhône-Alpes\n / LIG Laboratoire d'Informatique de Grenoble"
]
] |
new_dataset
| 0.971425 |
1009.1412
|
Grenville Croll
|
Patrick O'Beirne
|
Spreadsheet Refactoring
|
14 Pages
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2010 24-32
ISBN 978-1-905404-50-6
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Refactoring is a change made to the internal structure of software to make it
easier to understand and cheaper to modify without changing its observable
behaviour. A database refactoring is a small change to the database schema
which improves its design without changing its semantics. This paper presents
example 'spreadsheet refactorings', derived from the above and taking into
account the unique characteristics of spreadsheet formulas and VBA code. The
techniques are constrained by the tightly coupled data and code in
spreadsheets.
|
[
{
"version": "v1",
"created": "Tue, 7 Sep 2010 21:35:50 GMT"
}
] | 2010-09-09T00:00:00 |
[
[
"O'Beirne",
"Patrick",
""
]
] |
new_dataset
| 0.965113 |
1009.1194
|
Sindhuben Kanojia Babulal
|
Kanojia Sindhuben Babulal and Rajiv Ranjan Tewari
|
E2XLRADR (Energy Efficient Cross Layer Routing Algorithm with Dynamic
Retransmission for Wireless Sensor Networks)
| null |
http://airccse.org/journal/jwmn/0203ijwmn12.pdf. International
Journal of Wireless & Mobile Networks ( IJWMN ), Vol.2, No.3, August 2010
|
10.5121/ijwmn.2010.2312
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main focus of this article is to achieve prolonged network lifetime with
overall energy efficiency in wireless sensor networks through controlled
utilization of limited energy. Major percentage of energy in wireless sensor
network is consumed during routing from source to destination, retransmission
of data on packet loss. For improvement, cross layered algorithm is proposed
for routing and retransmission scheme. Simulation and results shows that this
approach can save the overall energy consumption
|
[
{
"version": "v1",
"created": "Tue, 7 Sep 2010 05:15:54 GMT"
}
] | 2010-09-08T00:00:00 |
[
[
"Babulal",
"Kanojia Sindhuben",
""
],
[
"Tewari",
"Rajiv Ranjan",
""
]
] |
new_dataset
| 0.982394 |
0806.1148
|
Dominik Scheder
|
Dominik Scheder and Philipp Zumstein
|
Unsatisfiable CNF Formulas need many Conflicts
|
new version; added an upper bound on the number of conflicts
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pair of clauses in a CNF formula constitutes a conflict if there is a
variable that occurs positively in one clause and negatively in the other. A
CNF formula without any conflicts is satisfiable. The Lovasz Local Lemma
implies that a k-CNF formula is satisfiable if each clause conflicts with at
most 2^k/e-1 clauses. It does not, however, give any good bound on how many
conflicts an unsatisfiable formula has globally. We show here that every
unsatisfiable k-CNF formula requires 2.69^k conflicts and there exist
unsatisfiable k-CNF formulas with 3.51^k conflicts.
|
[
{
"version": "v1",
"created": "Fri, 6 Jun 2008 12:48:42 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Sep 2010 13:36:12 GMT"
}
] | 2010-09-07T00:00:00 |
[
[
"Scheder",
"Dominik",
""
],
[
"Zumstein",
"Philipp",
""
]
] |
new_dataset
| 0.996777 |
1006.2361
|
Marko A. Rodriguez
|
Marko A. Rodriguez and Peter Neubauer
|
Constructions from Dots and Lines
|
In press with the Bulletin of the American Society for Information
Science and Technology
|
Bulletin of the American Society for Information Science and
Technology, American Society for Information Science and Technology, 36,(6),
pp. 35-41, ISSN:1550-8366, August 2010
| null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e.
edges). The dots and lines of a graph can be organized into intricate
arrangements. The ability for a graph to denote objects and their relationships
to one another allow for a surprisingly large number of things to be modeled as
a graph. From the dependencies that link software packages to the wood beams
that provide the framing to a house, most anything has a corresponding graph
representation. However, just because it is possible to represent something as
a graph does not necessarily mean that its graph representation will be useful.
If a modeler can leverage the plethora of tools and algorithms that store and
process graphs, then such a mapping is worthwhile. This article explores the
world of graphs in computing and exposes situations in which graphical models
are beneficial.
|
[
{
"version": "v1",
"created": "Fri, 11 Jun 2010 18:16:10 GMT"
}
] | 2010-09-07T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
],
[
"Neubauer",
"Peter",
""
]
] |
new_dataset
| 0.995813 |
1009.0806
|
Geevarghese Philip
|
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
|
A Quartic Kernel for Pathwidth-One Vertex Deletion
|
Full version of an extended abstract accepted for publication in the
proceedings of WG 2010. 18 pages, 1 figure
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pathwidth of a graph is a measure of how path-like the graph is. Given a
graph G and an integer k, the problem of finding whether there exist at most k
vertices in G whose deletion results in a graph of pathwidth at most one is NP-
complete. We initiate the study of the parameterized complexity of this
problem, parameterized by k. We show that the problem has a quartic
vertex-kernel: We show that, given an input instance (G = (V, E), k); |V| = n,
we can construct, in polynomial time, an instance (G', k') such that (i) (G, k)
is a YES instance if and only if (G', k') is a YES instance, (ii) G' has
O(k^{4}) vertices, and (iii) k' \leq k. We also give a fixed parameter
tractable (FPT) algorithm for the problem that runs in O(7^{k} k \cdot n^{2})
time.
|
[
{
"version": "v1",
"created": "Sat, 4 Sep 2010 05:39:41 GMT"
}
] | 2010-09-07T00:00:00 |
[
[
"Philip",
"Geevarghese",
""
],
[
"Raman",
"Venkatesh",
""
],
[
"Villanger",
"Yngve",
""
]
] |
new_dataset
| 0.999632 |
0812.0956
|
Florian Hartig
|
Florian Hartig, Martin Horn, Martin Drechsler
|
EcoTRADE - a multi player network game of a tradable permit market for
biodiversity credits
|
3 pages, 1 figure
|
Environmental Modelling & Software, 2010, 25, 1479-1480
|
10.1016/j.envsoft.2009.01.003
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EcoTRADE is a multi player network game of a virtual biodiversity credit
market. Each player controls the land use of a certain amount of parcels on a
virtual landscape. The biodiversity credits of a particular parcel depend on
neighboring parcels, which may be owned by other players. The game can be used
to study the strategies of players in experiments or classroom games and also
as a communication tool for stakeholders participating in credit markets that
include spatially interdependent credits.
|
[
{
"version": "v1",
"created": "Thu, 4 Dec 2008 15:43:16 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Sep 2010 16:53:24 GMT"
}
] | 2010-09-06T00:00:00 |
[
[
"Hartig",
"Florian",
""
],
[
"Horn",
"Martin",
""
],
[
"Drechsler",
"Martin",
""
]
] |
new_dataset
| 0.99966 |
1009.0585
|
Dananjayan Perumal
|
P. Samundiswary, D.Sathian and P. Dananjayan
|
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
|
12 pages, 16 figures
|
International Journal of Ad hoc, Sensor & Ubiquitous Computing(
IJASUC ) Vol.1, No.2, June 2010
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks are collections of large number of sensor nodes. The
sensor nodes are featured with limited energy, computation and transmission
power. Each node in the network coordinates with every other node in forwarding
their packets to reach the destination. Since these nodes operate in a
physically insecure environment; they are vulnerable to different types of
attacks such as selective forwarding and sinkhole. These attacks can inject
malicious packets by compromising the node. Geographical routing protocols of
wireless sensor networks have been developed without considering the security
aspects against these attacks. In this paper, a secure routing protocol named
secured greedy perimeter stateless routing protocol (S-GPSR) is proposed for
mobile sensor networks by incorporating trust based mechanism in the existing
greedy perimeter stateless routing protocol (GPSR). Simulation results prove
that S-GPSR outperforms the GPSR by reducing the overhead and improving the
delivery ratio of the networks.
|
[
{
"version": "v1",
"created": "Fri, 3 Sep 2010 05:06:04 GMT"
}
] | 2010-09-06T00:00:00 |
[
[
"Samundiswary",
"P.",
""
],
[
"Sathian",
"D.",
""
],
[
"Dananjayan",
"P.",
""
]
] |
new_dataset
| 0.991647 |
1009.0670
|
Marko A. Rodriguez
|
Marko A. Rodriguez and Jennifer H. Watkins
|
Grammar-Based Geodesics in Semantic Networks
|
First draft written in 2007
|
Knowledge-Based Systems, 23(8), pp. 844-855, December 2010
|
10.1016/j.knosys.2010.05.009
|
LA-UR-07-4042
|
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A geodesic is the shortest path between two vertices in a connected network.
The geodesic is the kernel of various network metrics including radius,
diameter, eccentricity, closeness, and betweenness. These metrics are the
foundation of much network research and thus, have been studied extensively in
the domain of single-relational networks (both in their directed and undirected
forms). However, geodesics for single-relational networks do not translate
directly to multi-relational, or semantic networks, where vertices are
connected to one another by any number of edge labels. Here, a more
sophisticated method for calculating a geodesic is necessary. This article
presents a technique for calculating geodesics in semantic networks with a
focus on semantic networks represented according to the Resource Description
Framework (RDF). In this framework, a discrete "walker" utilizes an abstract
path description called a grammar to determine which paths to include in its
geodesic calculation. The grammar-based model forms a general framework for
studying geodesic metrics in semantic networks.
|
[
{
"version": "v1",
"created": "Fri, 3 Sep 2010 13:49:47 GMT"
}
] | 2010-09-06T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
],
[
"Watkins",
"Jennifer H.",
""
]
] |
new_dataset
| 0.995285 |
1008.3452
|
Farnood Merrikh-Bayat
|
Farnood Merrikh-Bayat, Saeed Bagheri Shouraki
|
Memristor-based Circuits for Performing Basic Arithmetic Operations
|
5pages, 4 figures, Accepted in World Conference on Information
Technology, turkey, 2010
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In almost all of the currently working circuits, especially in analog
circuits implementing signal processing applications, basic arithmetic
operations such as multiplication, addition, subtraction and division are
performed on values which are represented by voltages or currents. However, in
this paper, we propose a new and simple method for performing analog arithmetic
operations which in this scheme, signals are represented and stored through a
memristance of the newly found circuit element, i.e. memristor, instead of
voltage or current. Some of these operators such as divider and multiplier are
much simpler and faster than their equivalent voltage-based circuits and they
require less chip area. In addition, a new circuit is designed for programming
the memristance of the memristor with predetermined analog value. Presented
simulation results demonstrate the effectiveness and the accuracy of the
proposed circuits.
|
[
{
"version": "v1",
"created": "Fri, 20 Aug 2010 07:53:24 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Sep 2010 15:59:24 GMT"
}
] | 2010-09-03T00:00:00 |
[
[
"Merrikh-Bayat",
"Farnood",
""
],
[
"Shouraki",
"Saeed Bagheri",
""
]
] |
new_dataset
| 0.999754 |
1009.0397
|
Wided Oueslati wided
|
wided oueslati and jalel akaichi
|
Mobile Information Collectors' Trajectory Data Warehouse Design
|
20 pages, 9 figures
|
international journal of managing information technology august
2010
| null | null |
cs.DB
|
http://creativecommons.org/licenses/by/3.0/
|
To analyze complex phenomena which involve moving objects, Trajectory Data
Warehouse (TDW) seems to be an answer for many recent decision problems related
to various professions (physicians, commercial representatives, transporters,
ecologists ...) concerned with mobility. This work aims to make trajectories as
a first class concept in the trajectory data conceptual model and to design a
TDW, in which data resulting from mobile information collectors' trajectory are
gathered. These data will be analyzed, according to trajectory characteristics,
for decision making purposes, such as new products commercialization, new
commerce implementation, etc.
|
[
{
"version": "v1",
"created": "Thu, 2 Sep 2010 11:41:29 GMT"
}
] | 2010-09-03T00:00:00 |
[
[
"oueslati",
"wided",
""
],
[
"akaichi",
"jalel",
""
]
] |
new_dataset
| 0.997763 |
1008.1673
|
Alex Berka Mr
|
Alex V Berka
|
Space and the Synchronic A-Ram
|
8 pages
| null | null | null |
cs.CL cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Space is a circuit oriented, spatial programming language designed to exploit
the massive parallelism available in a novel formal model of computation called
the Synchronic A-Ram, and physically related FPGA and reconfigurable
architectures. Space expresses variable grained MIMD parallelism, is modular,
strictly typed, and deterministic. Barring operations associated with memory
allocation and compilation, modules cannot access global variables, and are
referentially transparent. At a high level of abstraction, modules exhibit a
small, sequential state transition system, aiding verification. Space deals
with communication, scheduling, and resource contention issues in parallel
computing, by resolving them explicitly in an incremental manner, module by
module, whilst ascending the ladder of abstraction. Whilst the Synchronic A-Ram
model was inspired by linguistic considerations, it is also put forward as a
formal model for reconfigurable digital circuits. A programming environment has
been developed, that incorporates a simulator and compiler that transform Space
programs into Synchronic A-Ram machine code, consisting of only three bit-level
instructions, and a marking instruction. Space and the Synchronic A-Ram point
to novel routes out of the parallel computing crisis.
|
[
{
"version": "v1",
"created": "Tue, 10 Aug 2010 09:46:21 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Aug 2010 10:33:08 GMT"
}
] | 2010-08-31T00:00:00 |
[
[
"Berka",
"Alex V",
""
]
] |
new_dataset
| 0.979518 |
1008.4873
|
Saleh Omari
|
Saleh Ali K. Al-Omari and Putra Sumari
|
Spiking Neurons with ASNN Based-Methods for the Neural Block Cipher
|
11 pages, 4 Figures, International journal of computer science &
information Technology
|
International journal of computer science & information Technology
(IJCSIT) Vol.2, No.4, August 2010
| null | null |
cs.CR cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Problem statement: This paper examines Artificial Spiking Neural Network
(ASNN) which inter-connects group of artificial neurons that uses a
mathematical model with the aid of block cipher. The aim of undertaken this
research is to come up with a block cipher where by the keys are randomly
generated by ASNN which can then have any variable block length. This will show
the private key is kept and do not have to be exchange to the other side of the
communication channel so it present a more secure procedure of key scheduling.
The process enables for a faster change in encryption keys and a network level
encryption to be implemented at a high speed without the headache of
factorization. Approach: The block cipher is converted in public cryptosystem
and had a low level of vulnerability to attack from brute, and moreover can
able to defend against linear attacks since the Artificial Neural Networks
(ANN) architecture convey non-linearity to the encryption/decryption
procedures. Result: In this paper is present to use the Spiking Neural Networks
(SNNs) with spiking neurons as its basic unit. The timing for the SNNs is
considered and the output is encoded in 1's and 0's depending on the occurrence
or not occurrence of spikes as well as the spiking neural networks use a sign
function as activation function, and present the weights and the filter
coefficients to be adjust, having more degrees of freedom than the classical
neural networks. Conclusion: In conclusion therefore, encryption algorithm can
be deployed in communication and security applications where data transfers are
most crucial. So this paper, the neural block cipher proposed where the keys
are generated by the SNN and the seed is considered the public key which
generates the both keys on both sides In future therefore a new research will
be conducted on the Spiking Neural Network (SNN) impacts on communication.
|
[
{
"version": "v1",
"created": "Sat, 28 Aug 2010 14:55:38 GMT"
}
] | 2010-08-31T00:00:00 |
[
[
"Al-Omari",
"Saleh Ali K.",
""
],
[
"Sumari",
"Putra",
""
]
] |
new_dataset
| 0.961717 |
1008.4776
|
Alexander Gutfraind
|
Alexander Gutfraind
|
Targeting by Transnational Terrorist Groups
| null | null | null |
LA-UR 10-05689
|
cs.GT nlin.AO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many successful terrorist groups operate across international borders where
different countries host different stages of terrorist operations. Often the
recruits for the group come from one country or countries, while the targets of
the operations are in another. Stopping such attacks is difficult because
intervention in any region or route might merely shift the terrorists
elsewhere. Here we propose a model of transnational terrorism based on the
theory of activity networks. The model represents attacks on different
countries as paths in a network. The group is assumed to prefer paths of lowest
cost (or risk) and maximal yield from attacks. The parameters of the model are
computed for the Islamist-Salafi terrorist movement based on open source data
and then used for estimation of risks of future attacks. The central finding is
that the USA has an enduring appeal as a target, due to lack of other nations
of matching geopolitical weight or openness. It is also shown that countries in
Africa and Asia that have been overlooked as terrorist bases may become highly
significant threats in the future. The model quantifies the dilemmas facing
countries in the effort to cut such networks, and points to a limitation of
deterrence against transnational terrorists.
|
[
{
"version": "v1",
"created": "Fri, 27 Aug 2010 18:39:41 GMT"
}
] | 2010-08-30T00:00:00 |
[
[
"Gutfraind",
"Alexander",
""
]
] |
new_dataset
| 0.981772 |
1008.4264
|
Salah A. Aly
|
Salah A. Aly, Ahmed E. Kamal, Anwar I. Walid
|
Network Protection Design Using Network Coding
|
ITW2010
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Link and node failures are two common fundamental problems that affect
operational networks. Protection of communication networks against such
failures is essential for maintaining network reliability and performance.
Network protection codes (NPC) are proposed to protect operational networks
against link and node failures. Furthermore, encoding and decoding operations
of such codes are well developed over binary and finite fields. Finding network
topologies, practical scenarios, and limits on graphs applicable for NPC are of
interest. In this paper, we establish limits on network protection design. We
investigate several network graphs where NPC can be deployed using network
coding. Furthermore, we construct graphs with minimum number of edges suitable
for network protection codes deployment.
|
[
{
"version": "v1",
"created": "Wed, 25 Aug 2010 12:35:58 GMT"
}
] | 2010-08-26T00:00:00 |
[
[
"Aly",
"Salah A.",
""
],
[
"Kamal",
"Ahmed E.",
""
],
[
"Walid",
"Anwar I.",
""
]
] |
new_dataset
| 0.977537 |
cs/0702079
|
Otfried Cheong
|
Otfried Cheong, Mira Lee
|
The Hadwiger Number of Jordan Regions is Unbounded
| null | null | null | null |
cs.CG math.MG
| null |
We show that for every n > 0 there is a planar topological disk A_0 and n
translates A_1, A_2, ..., A_n of A_0 such that the interiors of A_0, ... A_n
are pairwise disjoint, but with each A_i touching A_0 for 1 <= i <= n.
|
[
{
"version": "v1",
"created": "Wed, 14 Feb 2007 15:31:30 GMT"
}
] | 2010-08-26T00:00:00 |
[
[
"Cheong",
"Otfried",
""
],
[
"Lee",
"Mira",
""
]
] |
new_dataset
| 0.975302 |
cs/0702090
|
Otfried Cheong
|
Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
|
Aperture-Angle and Hausdorff-Approximation of Convex Figures
|
Fixed incorrect affiliation
| null | null | null |
cs.CG math.MG
| null |
The aperture angle alpha(x, Q) of a point x not in Q in the plane with
respect to a convex polygon Q is the angle of the smallest cone with apex x
that contains Q. The aperture angle approximation error of a compact convex set
C in the plane with respect to an inscribed convex polygon Q of C is the
minimum aperture angle of any x in C Q with respect to Q. We show that for any
compact convex set C in the plane and any k > 2, there is an inscribed convex
k-gon Q of C with aperture angle approximation error (1 - 2/(k+1)) pi. This
bound is optimal, and settles a conjecture by Fekete from the early 1990s. The
same proof technique can be used to prove a conjecture by Brass: If a polygon P
admits no approximation by a sub-k-gon (the convex hull of k vertices of P)
with Hausdorff distance sigma, but all subpolygons of P (the convex hull of
some vertices of P) admit such an approximation, then P is a (k+1)-gon. This
implies the following result: For any k > 2 and any convex polygon P of
perimeter at most 1 there is a sub-k-gon Q of P such that the
Hausdorff-distance of P and Q is at most 1/(k+1) * sin(pi/(k+1)).
|
[
{
"version": "v1",
"created": "Fri, 16 Feb 2007 06:00:08 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Feb 2007 00:39:36 GMT"
}
] | 2010-08-26T00:00:00 |
[
[
"Ahn",
"Hee-Kap",
""
],
[
"Bae",
"Sang Won",
""
],
[
"Cheong",
"Otfried",
""
],
[
"Gudmundsson",
"Joachim",
""
]
] |
new_dataset
| 0.996296 |
1008.3653
|
Guyslain Naves
|
Guyslain Naves, Christophe Weibel
|
Congestion in planar graphs with demands on faces
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an algorithm to route a multicommodity flow in a planar graph $G$
with congestion $O(\log k)$, where $k$ is the maximum number of terminals on
the boundary of a face, when each demand edge lie on a face of $G$. We also
show that our specific method cannot achieve a substantially better congestion.
|
[
{
"version": "v1",
"created": "Sat, 21 Aug 2010 18:33:43 GMT"
}
] | 2010-08-24T00:00:00 |
[
[
"Naves",
"Guyslain",
""
],
[
"Weibel",
"Christophe",
""
]
] |
new_dataset
| 0.998076 |
1001.1597
|
Graham Norton
|
Graham H. Norton
|
The Berlekamp-Massey Algorithm via Minimal Polynomials
|
Major revision of earlier versions: Introduction expanded, main
theorem is now a recursive construction using a recursively defined index
function and is relative to any element of $D$. Includes some simpler proofs,
a recursive Berlekamp-Massey 'theorem' and additional references
| null | null | null |
cs.IT cs.SC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a recursive minimal polynomial theorem for finite sequences over a
commutative integral domain $D$. This theorem is relative to any element of
$D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a
recursive 'index function' and simple mathematical induction. Taking
reciprocals gives a 'Berlekamp-Massey theorem' i.e. a recursive construction of
the polynomials arising in the Berlekamp-Massey algorithm, relative to any
element of $D$. The recursive theorem readily yields the iterative minimal
polynomial algorithm due to the author and a transparent derivation of the
iterative Berlekamp-Massey algorithm.
We give an upper bound for the sum of the linear complexities of $s$ which is
tight if $s$ has a perfect linear complexity profile. This implies that over a
field, both iterative algorithms require at most $2\lfloor
\frac{n^2}{4}\rfloor$ multiplications.
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2010 11:40:51 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Jan 2010 01:20:33 GMT"
},
{
"version": "v3",
"created": "Thu, 19 Aug 2010 07:35:33 GMT"
}
] | 2010-08-20T00:00:00 |
[
[
"Norton",
"Graham H.",
""
]
] |
new_dataset
| 0.999095 |
1008.3208
|
Pooya Hatami
|
Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian
|
On minimum vertex cover of generalized Petersen graphs
|
11 pages, 1 figure,
|
Australasian Journal of Combinatorics, Vol. 40 (2007) pp. 253-264
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph
$P(n,k)$, is defined by vertex set $\lbrace u_i,v_i\rbrace$ and edge set
$\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\rbrace$; where $i = 1,2,\dots,n$ and
subscripts are reduced modulo $n$. Here first, we characterize minimum vertex
covers in generalized Petersen graphs. Second, we present a lower bound and
some upper bounds for $\beta(P(n,k))$, the size of minimum vertex cover of
$P(n,k)$. Third, in some cases, we determine the exact values of
$\beta(P(n,k))$. Our conjecture is that $\beta(P(n,k)) \le n +
\lceil\frac{n}{5}\rceil$, for all $n$ and $k$.
|
[
{
"version": "v1",
"created": "Thu, 19 Aug 2010 04:17:46 GMT"
}
] | 2010-08-20T00:00:00 |
[
[
"Behsaz",
"Babak",
""
],
[
"Hatami",
"Pooya",
""
],
[
"Mahmoodian",
"Ebadollah S.",
""
]
] |
new_dataset
| 0.996697 |
1008.3352
|
Md. Saiful Islam
|
Md. Rafiqul Islam, Md. Saiful Islam, Muhammad Rezaul Karim, Abdullah
Al Mahmud, Hafiz Md. Hasan Babu
|
Variable Block Carry Skip Logic using Reversible Gates
|
4 pages, 7 figures, 3 tables
|
Proc. of 10th International Symposium on Integrated Circuits,
Devices and Systems, Nanyang Technological University, Suntec, Singapore, pp
9-12, 8-10 September, 2004
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reversible circuits have applications in digital signal processing, computer
graphics, quantum computation and cryptography. In this paper, a generalized
k*k reversible gate family is proposed and a 3*3 gate of the family is
discussed. Inverter, AND, OR, NAND, NOR, and EXOR gates can be realized by this
gate. Implementation of a full-adder circuit using two such 3*3 gates is given.
This full-adder circuit contains only two reversible gates and produces no
extra garbage outputs. The proposed full-adder circuit is efficient in terms of
gate count, garbage outputs and quantum cost. A 4-bit carry skip adder is
designed using this full-adder circuit and a variable block carry skip adder is
discussed. Necessary equations required to evaluate these adder are presented.
|
[
{
"version": "v1",
"created": "Thu, 19 Aug 2010 17:07:51 GMT"
}
] | 2010-08-20T00:00:00 |
[
[
"Islam",
"Md. Rafiqul",
""
],
[
"Islam",
"Md. Saiful",
""
],
[
"Karim",
"Muhammad Rezaul",
""
],
[
"Mahmud",
"Abdullah Al",
""
],
[
"Babu",
"Hafiz Md. Hasan",
""
]
] |
new_dataset
| 0.98495 |
1008.3357
|
Md. Saiful Islam
|
Hafiz Md. Hasaan Babu, Md. Saiful Islam, Md. Rafiqul Islam, Lafifa
Jamal, Abu Ahmed Ferdaus, Muhammad Rezaul Karim, Abdullah Al Mahmud
|
Building Toffoli Network for Reversible Logic Synthesis Based on
Swapping Bit Strings
|
9 pages
|
Dhaka University Journal of Science, Vol. 55, No. 2, pp. 153-156,
2007
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we have implemented and designed a sorting network for
reversible logic circuits synthesis in terms of n*n Toffoli gates. The
algorithm presented in this paper constructs a Toffoli Network based on
swapping bit strings. Reduction rules are then applied by simple template
matching and removing useless gates from the network. Random selection of bit
strings and reduction of control inputs are used to minimize both the number of
gates and gate width. The method produces near optimal results for up to
3-input 3-output circuits.
|
[
{
"version": "v1",
"created": "Thu, 19 Aug 2010 17:21:54 GMT"
}
] | 2010-08-20T00:00:00 |
[
[
"Babu",
"Hafiz Md. Hasaan",
""
],
[
"Islam",
"Md. Saiful",
""
],
[
"Islam",
"Md. Rafiqul",
""
],
[
"Jamal",
"Lafifa",
""
],
[
"Ferdaus",
"Abu Ahmed",
""
],
[
"Karim",
"Muhammad Rezaul",
""
],
[
"Mahmud",
"Abdullah Al",
""
]
] |
new_dataset
| 0.986143 |
0912.0180
|
Bram Reps
|
Bram Reps, Wim Vanroose and Hisham bin Zubair
|
On the indefinite Helmholtz equation: complex stretched absorbing
boundary layers, iterative analysis, and preconditioning
| null |
Journal of Computational Physics (2010)
|
10.1016/j.jcp.2010.07.022
| null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies and analyzes a preconditioned Krylov solver for Helmholtz
problems that are formulated with absorbing boundary layers based on complex
coordinate stretching. The preconditioner problem is a Helmholtz problem where
not only the coordinates in the absorbing layer have an imaginary part, but
also the coordinates in the interior region. This results into a preconditioner
problem that is invertible with a multigrid cycle. We give a numerical analysis
based on the eigenvalues and evaluate the performance with several numerical
experiments. The method is an alternative to the complex shifted Laplacian and
it gives a comparable performance for the studied model problems.
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2009 15:15:44 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jun 2010 09:35:35 GMT"
}
] | 2010-08-19T00:00:00 |
[
[
"Reps",
"Bram",
""
],
[
"Vanroose",
"Wim",
""
],
[
"Zubair",
"Hisham bin",
""
]
] |
new_dataset
| 0.974928 |
1008.3136
|
Mao Wang
|
C. Jiang, M. Wang, C. Yang
|
MIMO Precoding Using Rotating Codebooks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Next generation wireless communications rely on multiple input multiple
output (MIMO) techniques to achieve high data rates. Feedback of channel
information can be used in MIMO precoding to fully activate the strongest
channel modes and improve MIMO performance. Unfortunately, the bandwidth of the
control channel via which the feedback is conveyed is severely limited. An
important issue is how to improve the MIMO precoding performance with minimal
feedback. In this letter, we present a method that uses a rotating codebook
technique to effectively improve the precoding performance without the need of
increasing feedback overhead. The basic idea of the rotating codebook precoding
is to expend the effective precoding codebook size via rotating multiple
codebooks so that the number of feedback bits remains unchanged. Simulation
results are presented to show the performance gain of the proposed rotating
codebook precoding over the conventional precoding.
|
[
{
"version": "v1",
"created": "Wed, 18 Aug 2010 17:10:34 GMT"
}
] | 2010-08-19T00:00:00 |
[
[
"Jiang",
"C.",
""
],
[
"Wang",
"M.",
""
],
[
"Yang",
"C.",
""
]
] |
new_dataset
| 0.986102 |
1007.1407
|
Amir Ingber
|
Amir Ingber and Meir Feder
|
Parallel Bit Interleaved Coded Modulation
|
19 pages, 15 figures. A shorter version will be presented at the 48th
Allerton Conference on Communication, Control, and Computing (Allerton 2010)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new variant of bit interleaved coded modulation (BICM) is proposed. In the
new scheme, called Parallel BICM, L identical binary codes are used in parallel
using a mapper, a newly proposed finite-length interleaver and a binary dither
signal. As opposed to previous approaches, the scheme does not rely on any
assumptions of an ideal, infinite-length interleaver. Over a memoryless
channel, the new scheme is proven to be equivalent to a binary memoryless
channel. Therefore the scheme enables one to easily design coded modulation
schemes using a simple binary code that was designed for that binary channel.
The overall performance of the coded modulation scheme is analytically
evaluated based on the performance of the binary code over the binary channel.
The new scheme is analyzed from an information theoretic viewpoint, where the
capacity, error exponent and channel dispersion are considered. The capacity of
the scheme is identical to the BICM capacity. The error exponent of the scheme
is numerically compared to a recently proposed mismatched-decoding exponent
analysis of BICM.
|
[
{
"version": "v1",
"created": "Thu, 8 Jul 2010 15:50:08 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Aug 2010 12:29:39 GMT"
}
] | 2010-08-18T00:00:00 |
[
[
"Ingber",
"Amir",
""
],
[
"Feder",
"Meir",
""
]
] |
new_dataset
| 0.992493 |
1008.2767
|
Derek Groen
|
Derek Groen (Leiden), Steven Rieder (Leiden), Paola Grosso
(Amsterdam), Cees de Laat (Amsterdam), Simon Portegies Zwart (Leiden)
|
A Light-Weight Communication Library for Distributed Computing
|
17 pages, 10 figures, published in Computational Science & Discovery
|
Derek Groen et al 2010 Comput. Sci. Disc. 3 015002
|
10.1088/1749-4699/3/1/015002
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MPWide, a platform independent communication library for
performing message passing between computers. Our library allows coupling of
several local MPI applications through a long distance network and is
specifically optimized for such communications. The implementation is
deliberately kept light-weight, platform independent and the library can be
installed and used without administrative privileges. The only requirements are
a C++ compiler and at least one open port to a wide area network on each site.
In this paper we present the library, describe the user interface, present
performance tests and apply MPWide in a large scale cosmological N-body
simulation on a network of two computers, one in Amsterdam and the other in
Tokyo.
|
[
{
"version": "v1",
"created": "Mon, 16 Aug 2010 20:14:11 GMT"
}
] | 2010-08-18T00:00:00 |
[
[
"Groen",
"Derek",
"",
"Leiden"
],
[
"Rieder",
"Steven",
"",
"Leiden"
],
[
"Grosso",
"Paola",
"",
"Amsterdam"
],
[
"de Laat",
"Cees",
"",
"Amsterdam"
],
[
"Zwart",
"Simon Portegies",
"",
"Leiden"
]
] |
new_dataset
| 0.975335 |
1008.2909
|
Bjoern Andres
|
Bjoern Andres, Ullrich Koethe, Thorben Kroeger, and Fred A. Hamprecht
|
Runtime-Flexible Multi-dimensional Arrays and Views for C++98 and C++0x
|
Free source code available
| null | null | null |
cs.DS cs.MS cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-dimensional arrays are among the most fundamental and most useful data
structures of all. In C++, excellent template libraries exist for arrays whose
dimension is fixed at runtime. Arrays whose dimension can change at runtime
have been implemented in C. However, a generic object-oriented C++
implementation of runtime-flexible arrays has so far been missing. In this
article, we discuss our new implementation called Marray, a package of class
templates that fills this gap. Marray is based on views as an underlying
concept. This concept brings some of the flexibility known from script
languages such as R and MATLAB to C++. Marray is free both for commercial and
non-commercial use and is publicly available from www.andres.sc/marray
|
[
{
"version": "v1",
"created": "Tue, 17 Aug 2010 14:50:56 GMT"
}
] | 2010-08-18T00:00:00 |
[
[
"Andres",
"Bjoern",
""
],
[
"Koethe",
"Ullrich",
""
],
[
"Kroeger",
"Thorben",
""
],
[
"Hamprecht",
"Fred A.",
""
]
] |
new_dataset
| 0.98669 |
1008.2729
|
Michael Robinson
|
Michael Robinson
|
Asynchronous logic circuits and sheaf obstructions
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article exhibits a particular encoding of logic circuits into a sheaf
formalism. The central result of this article is that there exists strictly
more information available to a circuit designer in this setting than exists in
static truth tables, but less than exists in event-level simulation. This
information is related to the timing behavior of the logic circuits, and
thereby provides a ``bridge'' between static logic analysis and detailed
simulation.
|
[
{
"version": "v1",
"created": "Mon, 16 Aug 2010 18:14:06 GMT"
}
] | 2010-08-17T00:00:00 |
[
[
"Robinson",
"Michael",
""
]
] |
new_dataset
| 0.999605 |
1008.2223
|
Alin Suciu PhD
|
Alin Suciu and Tudor Carean
|
Benchmarking the True Random Number Generator of TPM Chips
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A TPM (trusted platform module) is a chip present mostly on newer
motherboards, and its primary function is to create, store and work with
cryptographic keys. This dedicated chip can serve to authenticate other devices
or to protect encryption keys used by various software applications. Among
other features, it comes with a True Random Number Generator (TRNG) that can be
used for cryptographic purposes. This random number generator consists of a
state machine that mixes unpredictable data with the output of a one way hash
function. According the specification it can be a good source of unpredictable
random numbers even without having to require a genuine source of hardware
entropy. However the specification recommends collecting entropy from any
internal sources available such as clock jitter or thermal noise in the chip
itself, a feature that was implemented by most manufacturers. This paper will
benchmark the random number generator of several TPM chips from two
perspectives: the quality of the random bit sequences generated, as well as the
output bit rate.
|
[
{
"version": "v1",
"created": "Thu, 12 Aug 2010 21:51:22 GMT"
}
] | 2010-08-16T00:00:00 |
[
[
"Suciu",
"Alin",
""
],
[
"Carean",
"Tudor",
""
]
] |
new_dataset
| 0.970414 |
0911.4459
|
Petros Petrosyan
|
Petros A. Petrosyan
|
Interval edge colorings of some products of graphs
|
14 pages, 5 figures, minor changes
| null | null | null |
cs.DM
|
http://creativecommons.org/licenses/by/3.0/
|
An edge coloring of a graph $G$ with colors $1,2,\ldots ,t$ is called an
interval $t$-coloring if for each $i\in \{1,2,\ldots,t\}$ there is at least one
edge of $G$ colored by $i$, and the colors of edges incident to any vertex of
$G$ are distinct and form an interval of integers. A graph $G$ is interval
colorable, if there is an integer $t\geq 1$ for which $G$ has an interval
$t$-coloring. Let $\mathfrak{N}$ be the set of all interval colorable graphs.
In 2004 Kubale and Giaro showed that if $G,H\in \mathfrak{N}$, then the
Cartesian product of these graphs belongs to $\mathfrak{N}$. Also, they
formulated a similar problem for the lexicographic product as an open problem.
In this paper we first show that if $G\in \mathfrak{N}$, then $G[nK_{1}]\in
\mathfrak{N}$ for any $n\in \mathbf{N}$. Furthermore, we show that if $G,H\in
\mathfrak{N}$ and $H$ is a regular graph, then strong and lexicographic
products of graphs $G,H$ belong to $\mathfrak{N}$. We also prove that tensor
and strong tensor products of graphs $G,H$ belong to $\mathfrak{N}$ if $G\in
\mathfrak{N}$ and $H$ is a regular graph.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2009 18:26:31 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Aug 2010 07:15:58 GMT"
}
] | 2010-08-13T00:00:00 |
[
[
"Petrosyan",
"Petros A.",
""
]
] |
new_dataset
| 0.973105 |
1008.2036
|
Kamaljit I Lakhtaria
|
Kamaljit I. Lakhtaria
|
Providing content based billing architecture over Next Generation
Network
| null |
International Journal on Computer Engineering & Information
Technology March - May 2009, pp 118-124
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Communication marketplace has stressed that "content is king" ever
since the initial footsteps for Next Generation Networks like 3G, 3GPP, IP
Multimedia subsystem (IMS) services. However, many carriers and content
providers have struggled to drive revenue for content services, primarily due
to current limitations of certain types of desirable content offerings,
simplistic billing models, and the inability to support flexible pricing,
charging and settlement. Unlike wire line carriers, wireless carriers have a
limit to the volume of traffic they can carry, bounded by the finite wireless
spectrum. Event based services like calling, conferencing etc., only perceive
charge per event, while the Content based charging system attracts Mobile
Network Operators (MNOs) to maximize service delivery to customer and achieve
best ARPU. With the Next Generation Networks, the number of data related
services that can be offered, is increased significantly. The wireless carrier
will be able to move from offering wireless telecommunications services to
offering wireless telecommunication services plus a number of personalized
Value Added Services like news, games, video broadcasts, or multimedia
messaging service (MMS) through the network. The next generation Content Based
Billing systems allow the operators to maximize their revenues from such
services. These systems will enable operators to offer and bill for
application-based and content-based services, rather than for just bytes of
data. Therefore, the wireless business focus is no longer on infrastructure
build-outs but on customer retention and increased average revenue per customer
(ARPU). The mobile operator generates new revenues, strengthens brand value,
and differentiates its service to attract and retain customers.
|
[
{
"version": "v1",
"created": "Thu, 12 Aug 2010 03:43:08 GMT"
}
] | 2010-08-13T00:00:00 |
[
[
"Lakhtaria",
"Kamaljit I.",
""
]
] |
new_dataset
| 0.977405 |
1008.2186
|
Julien Leblay
|
Fran\c{c}ois Goasdou\'e (LRI), Konstantinos Karanasos (INRIA Saclay -
Ile de France), Julien Leblay (INRIA Saclay - Ile de France), Ioana Manolescu
(LRI, INRIA Saclay - Ile de France)
|
RDFViewS: A Storage Tuning Wizard for RDF Applications
| null |
ACM International Conference on Information and Knowledge
Management, Toronto : Canada (2010)
| null | null |
cs.DB cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, the significant growth of RDF data used in numerous
applications has made its efficient and scalable manipulation an important
issue. In this paper, we present RDFViewS, a system capable of choosing the
most suitable views to materialize, in order to minimize the query response
time for a specific SPARQL query workload, while taking into account the view
maintenance cost and storage space constraints. Our system employs practical
algorithms and heuristics to navigate through the search space of potential
view configurations, and exploits the possibly available semantic information -
expressed via an RDF Schema - to ensure the completeness of the query
evaluation.
|
[
{
"version": "v1",
"created": "Thu, 12 Aug 2010 18:55:15 GMT"
}
] | 2010-08-13T00:00:00 |
[
[
"Goasdoué",
"François",
"",
"LRI"
],
[
"Karanasos",
"Konstantinos",
"",
"INRIA Saclay -\n Ile de France"
],
[
"Leblay",
"Julien",
"",
"INRIA Saclay - Ile de France"
],
[
"Manolescu",
"Ioana",
"",
"LRI, INRIA Saclay - Ile de France"
]
] |
new_dataset
| 0.995463 |
1008.1610
|
Yeow Meng Chee
|
Yeow Meng Chee, Chaoping Xing, and Sze Ling Yeo
|
New Constant-Weight Codes from Propagation Rules
|
4 pages
|
IEEE Transactions on Information Theory, vol. 56, no. 4, pp.
1596-1599, 2010
|
10.1109/TIT.2010.2040964
| null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes some simple propagation rules which give rise to new
binary constant-weight codes.
|
[
{
"version": "v1",
"created": "Tue, 10 Aug 2010 00:56:33 GMT"
}
] | 2010-08-11T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Xing",
"Chaoping",
""
],
[
"Yeo",
"Sze Ling",
""
]
] |
new_dataset
| 0.977718 |
1008.1611
|
Yeow Meng Chee
|
Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, and San Ling
|
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition
Codes
|
12 pages
|
IEEE Transactions on Information Theory, vol. 56, no. 1, pp.
140-151, 2010
|
10.1109/TIT.2009.2034814
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An optimal constant-composition or constant-weight code of weight $w$ has
linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq
2w$, the determination of the exact size of such a constant-composition or
constant-weight code is trivial, but the case of $d=2w-1$ has been solved
previously only for binary and ternary constant-composition and constant-weight
codes, and for some sporadic instances.
This paper provides a construction for quasicyclic optimal
constant-composition and constant-weight codes of weight $w$ and distance
$2w-1$ based on a new generalization of difference triangle sets. As a result,
the sizes of optimal constant-composition codes and optimal constant-weight
codes of weight $w$ and distance $2w-1$ are determined for all such codes of
sufficiently large lengths. This solves an open problem of Etzion.
The sizes of optimal constant-composition codes of weight $w$ and distance
$2w-1$ are also determined for all $w\leq 6$, except in two cases.
|
[
{
"version": "v1",
"created": "Tue, 10 Aug 2010 01:02:07 GMT"
}
] | 2010-08-11T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Dau",
"Son Hoang",
""
],
[
"Ling",
"Alan C. H.",
""
],
[
"Ling",
"San",
""
]
] |
new_dataset
| 0.996647 |
1008.1650
|
EPTCS
|
Zoltan \'Esik (University of Szeged)
|
Representing Small Ordinals by Finite Automata
|
In Proceedings DCFS 2010, arXiv:1008.1270
|
EPTCS 31, 2010, pp. 78-87
|
10.4204/EPTCS.31.10
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that an ordinal is the order type of the lexicographic ordering
of a regular language if and only if it is less than omega^omega. We design a
polynomial time algorithm that constructs, for each well-ordered regular
language L with respect to the lexicographic ordering, given by a deterministic
finite automaton, the Cantor Normal Form of its order type. It follows that
there is a polynomial time algorithm to decide whether two deterministic finite
automata accepting well-ordered regular languages accept isomorphic languages.
We also give estimates on the size of the smallest automaton representing an
ordinal less than omega^omega, together with an algorithm that translates each
such ordinal to an automaton.
|
[
{
"version": "v1",
"created": "Tue, 10 Aug 2010 08:33:10 GMT"
}
] | 2010-08-11T00:00:00 |
[
[
"Ésik",
"Zoltan",
"",
"University of Szeged"
]
] |
new_dataset
| 0.995198 |
1008.1665
|
EPTCS
|
Martin Kappes, Andreas Malcher, Detlef Wotschke
|
Remembering Chandra Kintala
|
In Proceedings DCFS 2010, arXiv:1008.1270
|
EPTCS 31, 2010, pp. 15-26
|
10.4204/EPTCS.31.4
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With this contribution we would like to remember Chandra M. R. Kintala who
passed away in November 2009. We will give short overviews of his CV and his
contributions to the field of theoretical and applied computer science and,
given the opportunity, will attempt to present the current state of limited
nondeterminism and limited resources for machines. Finally, we will briefly
touch on some research topics which hopefully will be addressed in the not so
distant future.
|
[
{
"version": "v1",
"created": "Tue, 10 Aug 2010 08:34:51 GMT"
}
] | 2010-08-11T00:00:00 |
[
[
"Kappes",
"Martin",
""
],
[
"Malcher",
"Andreas",
""
],
[
"Wotschke",
"Detlef",
""
]
] |
new_dataset
| 0.988449 |
1002.0777
|
Emmanuel Abbe A
|
Emmanuel Abbe, Emre Telatar
|
Polar Codes for the m-User MAC
| null | null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, polar codes for the $m$-user multiple access channel (MAC)
with binary inputs are constructed. It is shown that Ar{\i}kan's polarization
technique applied individually to each user transforms independent uses of a
$m$-user binary input MAC into successive uses of extremal MACs. This
transformation has a number of desirable properties: (i) the `uniform sum rate'
of the original MAC is preserved, (ii) the extremal MACs have uniform rate
regions that are not only polymatroids but matroids and thus (iii) their
uniform sum rate can be reached by each user transmitting either uncoded or
fixed bits; in this sense they are easy to communicate over. A polar code can
then be constructed with an encoding and decoding complexity of $O(n \log n)$
(where $n$ is the block length), a block error probability of $o(\exp(- n^{1/2
- \e}))$, and capable of achieving the uniform sum rate of any binary input MAC
with arbitrary many users. An application of this polar code construction to
communicating on the AWGN channel is also discussed.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2010 16:10:31 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Aug 2010 16:57:16 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Abbe",
"Emmanuel",
""
],
[
"Telatar",
"Emre",
""
]
] |
new_dataset
| 0.998895 |
1005.4122
|
Alexander Prolubnikov
|
A. Prolubnikov
|
On a new complete invariant of acyclic graphs
|
This paper has been withdrawn by the author due to update
| null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new complete invariant for acyclic graphs is presented
|
[
{
"version": "v1",
"created": "Sat, 22 May 2010 12:30:39 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Jun 2010 18:38:06 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Jul 2010 03:31:22 GMT"
},
{
"version": "v4",
"created": "Sun, 8 Aug 2010 04:26:41 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Prolubnikov",
"A.",
""
]
] |
new_dataset
| 0.998225 |
1008.1321
|
Zeeshan Ahmed Mr.
|
Zeeshan Ahmed, Detlef Gerhard
|
Contributions of PDM Systems in Organizational Technical Data Management
|
In the proceedings of The First IEEE International Conference On
Computer, Control & Communication (IEEE-IC4 2007), 12-13 November 2007
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Product Data Management (PDM) claims of producing desktop and web based
systems to maintain the organizational data to increase the quality of products
by improving the process of development, business process flows, change
management, product structure management, project tracking and resource
planning. Moreover PDM helps in reducing the cost and effort required in
engineering. This paper discusses PDM desktop and web based system, needed
information and important guidelines for PDM system development, functional
requirements, basic components in detail and some already implemented PDM
Sys-tems. In the end paper investigates and briefly concludes major currently
faced challenges to Product Data Management (PDM) community.
|
[
{
"version": "v1",
"created": "Sat, 7 Aug 2010 11:14:25 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Ahmed",
"Zeeshan",
""
],
[
"Gerhard",
"Detlef",
""
]
] |
new_dataset
| 0.998328 |
1008.1343
|
Yeow Meng Chee
|
Yeow Meng Chee, Gennian Ge, Alan C. H. Ling
|
Spectrum of Sizes for Perfect Deletion-Correcting Codes
|
23 pages
|
SIAM Journal on Discrete Mathematics, vol. 24, no. 1, pp. 33-55,
2010
|
10.1137/090751311
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One peculiarity with deletion-correcting codes is that perfect
$t$-deletion-correcting codes of the same length over the same alphabet can
have different numbers of codewords, because the balls of radius $t$ with
respect to the Levenshte\u{\i}n distance may be of different sizes. There is
interest, therefore, in determining all possible sizes of a perfect
$t$-deletion-correcting code, given the length $n$ and the alphabet size~$q$.
In this paper, we determine completely the spectrum of possible sizes for
perfect $q$-ary 1-deletion-correcting codes of length three for all $q$, and
perfect $q$-ary 2-deletion-correcting codes of length four for almost all $q$,
leaving only a small finite number of cases in doubt.
|
[
{
"version": "v1",
"created": "Sat, 7 Aug 2010 13:32:44 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Ge",
"Gennian",
""
],
[
"Ling",
"Alan C. H.",
""
]
] |
new_dataset
| 0.999172 |
1008.1360
|
Minghui Jiang
|
Adrian Dumitrescu and Minghui Jiang
|
Coloring translates and homothets of a convex body
|
11 pages, 2 figures
| null | null | null |
cs.DM cs.CG math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We obtain improved upper bounds and new lower bounds on the chromatic number
as a linear function of the clique number, for the intersection graphs (and
their complements) of finite families of translates and homothets of a convex
body in $\RR^n$.
|
[
{
"version": "v1",
"created": "Sat, 7 Aug 2010 18:59:49 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Jiang",
"Minghui",
""
]
] |
new_dataset
| 0.960688 |
1008.1387
|
Fr\'ed\'erique Oggier
|
Frederique Oggier, Patrick Sole, Jean-Claude Belfiore
|
Codes over Matrix Rings for Space-Time Coded Modulations
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that, for transmission over quasi-static MIMO fading channels
with n transmit antennas, diversity can be obtained by using an inner fully
diverse space-time block code while coding gain, derived from the determinant
criterion, comes from an appropriate outer code. When the inner code has a
cyclic algebra structure over a number field, as for perfect space-time codes,
an outer code can be designed via coset coding. More precisely, we take the
quotient of the algebra by a two-sided ideal which leads to a finite alphabet
for the outer code, with a cyclic algebra structure over a finite field or a
finite ring. We show that the determinant criterion induces various metrics on
the outer code, such as the Hamming and Bachoc distances. When n=2,
partitioning the 2x2 Golden code by using an ideal above the prime 2 leads to
consider codes over either M2(F_2) or M2(F_2[i]), both being non-commutative
alphabets. Matrix rings of higher dimension, suitable for 3x3 and 4x4 perfect
codes, give rise to more complex examples.
|
[
{
"version": "v1",
"created": "Sun, 8 Aug 2010 06:04:10 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"Oggier",
"Frederique",
""
],
[
"Sole",
"Patrick",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.999767 |
1008.1571
|
Ananth Narayan Sankaranarayanan
|
Ananth Narayan S and Somsubhra Sharangi and Alexandra Fedorova
|
Scaling Turbo Boost to a 1000 cores
|
7 pages, short paper
| null | null | null |
cs.PF cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Intel Core i7 processor code named Nehalem provides a feature named Turbo
Boost which opportunistically varies the frequencies of the processor's cores.
The frequency of a core is determined by core temperature, the number of active
cores, the estimated power consumption, the estimated current consumption, and
operating system frequency scaling requests. For a chip multi-processor(CMP)
that has a small number of physical cores and a small set of performance
states, deciding the Turbo Boost frequency to use on a given core might not be
difficult. However, we do not know the complexity of this decision making
process in the context of a large number of cores, scaling to the 100s, as
predicted by researchers in the field.
|
[
{
"version": "v1",
"created": "Mon, 9 Aug 2010 19:23:10 GMT"
}
] | 2010-08-10T00:00:00 |
[
[
"S",
"Ananth Narayan",
""
],
[
"Sharangi",
"Somsubhra",
""
],
[
"Fedorova",
"Alexandra",
""
]
] |
new_dataset
| 0.99967 |
1008.1053
|
Muriel Dulieu
|
Boris Aronov, Muriel Dulieu and Ferran Hurtado
|
Witness (Delaunay) Graphs
|
27 pages. JCCGG 2009
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Proximity graphs are used in several areas in which a neighborliness
relationship for input data sets is a useful tool in their analysis, and have
also received substantial attention from the graph drawing community, as they
are a natural way of implicitly representing graphs. However, as a tool for
graph representation, proximity graphs have some limitations that may be
overcome with suitable generalizations. We introduce a generalization, witness
graphs, that encompasses both the goal of more power and flexibility for graph
drawing issues and a wider spectrum for neighborhood analysis. We study in
detail two concrete examples, both related to Delaunay graphs, and consider as
well some problems on stabbing geometric objects and point set discrimination,
that can be naturally described in terms of witness graphs.
|
[
{
"version": "v1",
"created": "Thu, 5 Aug 2010 19:55:58 GMT"
}
] | 2010-08-06T00:00:00 |
[
[
"Aronov",
"Boris",
""
],
[
"Dulieu",
"Muriel",
""
],
[
"Hurtado",
"Ferran",
""
]
] |
new_dataset
| 0.997975 |
0806.3209
|
Russell O'Connor
|
Russell O'Connor
|
A Computer Verified Theory of Compact Sets
|
This paper is to be part of the proceedings of the Symbolic
Computation in Software Science Austrian-Japanese Workshop (SCSS 2008)
| null | null |
RISC-Linz Report Series 08-08
|
cs.LO
|
http://creativecommons.org/licenses/publicdomain/
|
Compact sets in constructive mathematics capture our intuition of what
computable subsets of the plane (or any other complete metric space) ought to
be. A good representation of compact sets provides an efficient means of
creating and displaying images with a computer. In this paper, I build upon
existing work about complete metric spaces to define compact sets as the
completion of the space of finite sets under the Hausdorff metric. This
definition allowed me to quickly develop a computer verified theory of compact
sets. I applied this theory to compute provably correct plots of uniformly
continuous functions.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2008 18:09:01 GMT"
}
] | 2010-08-04T00:00:00 |
[
[
"O'Connor",
"Russell",
""
]
] |
new_dataset
| 0.996985 |
1008.0045
|
Sidharth Jaggi
|
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko and Lingxiao Xia
|
Universal and Robust Distributed Network Codes
|
12 pages, 7 figures, 1 table, under submission to INFOCOM 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Random linear network codes can be designed and implemented in a distributed
manner, with low computational complexity. However, these codes are classically
implemented over finite fields whose size depends on some global network
parameters (size of the network, the number of sinks) that may not be known
prior to code design. Also, if new nodes join the entire network code may have
to be redesigned.
In this work, we present the first universal and robust distributed linear
network coding schemes. Our schemes are universal since they are independent of
all network parameters. They are robust since if nodes join or leave, the
remaining nodes do not need to change their coding operations and the receivers
can still decode. They are distributed since nodes need only have topological
information about the part of the network upstream of them, which can be
naturally streamed as part of the communication protocol.
We present both probabilistic and deterministic schemes that are all
asymptotically rate-optimal in the coding block-length, and have guarantees of
correctness. Our probabilistic designs are computationally efficient, with
order-optimal complexity. Our deterministic designs guarantee zero error
decoding, albeit via codes with high computational complexity in general. Our
coding schemes are based on network codes over ``scalable fields". Instead of
choosing coding coefficients from one field at every node, each node uses
linear coding operations over an ``effective field-size" that depends on the
node's distance from the source node. The analysis of our schemes requires
technical tools that may be of independent interest. In particular, we
generalize the Schwartz-Zippel lemma by proving a non-uniform version, wherein
variables are chosen from sets of possibly different sizes. We also provide a
novel robust distributed algorithm to assign unique IDs to network nodes.
|
[
{
"version": "v1",
"created": "Sat, 31 Jul 2010 02:23:50 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Aug 2010 10:35:52 GMT"
}
] | 2010-08-04T00:00:00 |
[
[
"Ho",
"Tracey",
""
],
[
"Jaggi",
"Sidharth",
""
],
[
"Vyetrenko",
"Svitlana",
""
],
[
"Xia",
"Lingxiao",
""
]
] |
new_dataset
| 0.997713 |
1008.0208
|
Gang Xu
|
Gang Xu and Guozhao Wang
|
Parametric polynomial minimal surfaces of arbitrary degree
| null | null | null | null |
cs.GR math.DG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Weierstrass representation is a classical parameterization of minimal
surfaces. However, two functions should be specified to construct the
parametric form in Weierestrass representation. In this paper, we propose an
explicit parametric form for a class of parametric polynomial minimal surfaces
of arbitrary degree. It includes the classical Enneper surface for cubic case.
The proposed minimal surfaces also have some interesting properties such as
symmetry, containing straight lines and self-intersections. According to the
shape properties, the proposed minimal surface can be classified into four
categories with respect to $n=4k-1$ $n=4k+1$, $n=4k$ and $n=4k+2$. The explicit
parametric form of corresponding conjugate minimal surfaces is given and the
isometric deformation is also implemented.
|
[
{
"version": "v1",
"created": "Sun, 1 Aug 2010 22:58:04 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Aug 2010 08:15:53 GMT"
}
] | 2010-08-04T00:00:00 |
[
[
"Xu",
"Gang",
""
],
[
"Wang",
"Guozhao",
""
]
] |
new_dataset
| 0.978127 |
0906.0531
|
Jaeok Park
|
Jaeok Park and Mihaela van der Schaar
|
Medium Access Control Protocols With Memory
|
32 pages, 7 figures, 2 tables
|
IEEE/ACM Transactions on Networking, 2010
|
10.1109/TNET.2010.2050699
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many existing medium access control (MAC) protocols utilize past information
(e.g., the results of transmission attempts) to adjust the transmission
parameters of users. This paper provides a general framework to express and
evaluate distributed MAC protocols utilizing a finite length of memory for a
given form of feedback information. We define protocols with memory in the
context of a slotted random access network with saturated arrivals. We
introduce two performance metrics, throughput and average delay, and formulate
the problem of finding an optimal protocol. We first show that a TDMA outcome,
which is the best outcome in the considered scenario, can be obtained after a
transient period by a protocol with (N-1)-slot memory, where N is the total
number of users. Next, we analyze the performance of protocols with 1-slot
memory using a Markov chain and numerical methods. Protocols with 1-slot memory
can achieve throughput arbitrarily close to 1 (i.e., 100% channel utilization)
at the expense of large average delay, by correlating successful users in two
consecutive slots. Finally, we apply our framework to wireless local area
networks.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2009 16:43:16 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jan 2010 02:57:13 GMT"
}
] | 2010-08-03T00:00:00 |
[
[
"Park",
"Jaeok",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] |
new_dataset
| 0.998906 |
1007.1802
|
Shlomi Dolev
|
Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu,
Sebastien Tixeuil
|
Practically Stabilizing Atomic Memory
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A self-stabilizing simulation of a single-writer multi-reader atomic register
is presented. The simulation works in asynchronous message-passing systems, and
allows processes to crash, as long as at least a majority of them remain
working. A key element in the simulation is a new combinatorial construction of
a bounded labeling scheme that can accommodate arbitrary labels, i.e.,
including those not generated by the scheme itself.
|
[
{
"version": "v1",
"created": "Sun, 11 Jul 2010 21:00:58 GMT"
},
{
"version": "v2",
"created": "Sat, 31 Jul 2010 15:04:40 GMT"
}
] | 2010-08-03T00:00:00 |
[
[
"Alon",
"Noga",
""
],
[
"Attiya",
"Hagit",
""
],
[
"Dolev",
"Shlomi",
""
],
[
"Dubois",
"Swan",
""
],
[
"Gradinariu",
"Maria",
""
],
[
"Tixeuil",
"Sebastien",
""
]
] |
new_dataset
| 0.969495 |
1008.0170
|
Michael Moortgat
|
Michael Moortgat
|
Symmetric categorial grammar: residuation and Galois connections
|
Submitted to the Jim Lambek Festschrift of Linguistic Analysis (LA,
volume 36, to appear)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Lambek-Grishin calculus is a symmetric extension of the Lambek calculus:
in addition to the residuated family of product, left and right division
operations of Lambek's original calculus, one also considers a family of
coproduct, right and left difference operations, related to the former by an
arrow-reversing duality. Communication between the two families is implemented
in terms of linear distributivity principles. The aim of this paper is to
complement the symmetry between (dual) residuated type-forming operations with
an orthogonal opposition that contrasts residuated and Galois connected
operations. Whereas the (dual) residuated operations are monotone, the Galois
connected operations (and their duals) are antitone. We discuss the algebraic
properties of the (dual) Galois connected operations, and generalize the
(co)product distributivity principles to include the negative operations. We
give a continuation-passing-style translation for the new type-forming
operations, and discuss some linguistic applications.
|
[
{
"version": "v1",
"created": "Sun, 1 Aug 2010 12:45:58 GMT"
}
] | 2010-08-03T00:00:00 |
[
[
"Moortgat",
"Michael",
""
]
] |
new_dataset
| 0.984164 |
1007.5180
|
Alessandro Dal Pal\`u
|
Alessandro Dal Palu', Agostino Dovier, Federico Fogolari, Enrico
Pontelli
|
CLP-based protein fragment assembly
|
special issue dedicated to ICLP 2010
|
Theory and Practice of Logic Programming, special issue dedicated
to ICLP 2010. 10(4-6): pp 709-724, July 2010
|
10.1017/S1471068410000372
| null |
cs.AI cs.CE cs.PL q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper investigates a novel approach, based on Constraint Logic
Programming (CLP), to predict the 3D conformation of a protein via fragments
assembly. The fragments are extracted by a preprocessor-also developed for this
work- from a database of known protein structures that clusters and classifies
the fragments according to similarity and frequency. The problem of assembling
fragments into a complete conformation is mapped to a constraint solving
problem and solved using CLP. The constraint-based model uses a medium
discretization degree Ca-side chain centroid protein model that offers
efficiency and a good approximation for space filling. The approach adapts
existing energy models to the protein representation used and applies a large
neighboring search strategy. The results shows the feasibility and efficiency
of the method. The declarative nature of the solution allows to include future
extensions, e.g., different size fragments for better accuracy.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 10:44:49 GMT"
}
] | 2010-08-02T00:00:00 |
[
[
"Palu'",
"Alessandro Dal",
""
],
[
"Dovier",
"Agostino",
""
],
[
"Fogolari",
"Federico",
""
],
[
"Pontelli",
"Enrico",
""
]
] |
new_dataset
| 0.998425 |
1007.5090
|
EPTCS
|
Imene Ben-Hafaiedh (Universite Joseph Fourier/VERIMAG), Susanne Graf
(Universite Joseph Fourier/VERIMAG), Hammadi Khairallah (Tunisia Polytechnic
School)
|
Implementing Distributed Controllers for Systems with Priorities
|
In Proceedings FOCLASA 2010, arXiv:1007.4993
|
EPTCS 30, 2010, pp. 31-46
|
10.4204/EPTCS.30.3
| null |
cs.DC cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implementing a component-based system in a distributed way so that it ensures
some global constraints is a challenging problem. We consider here abstract
specifications consisting of a composition of components and a controller given
in the form of a set of interactions and a priority order amongst them. In the
context of distributed systems, such a controller must be executed in a
distributed fashion while still respecting the global constraints imposed by
interactions and priorities.
We present in this paper an implementation of an algorithm that allows a
distributed execution of systems with (binary) interactions and priorities. We
also present a comprehensive simulation analysis that shows how sensitive to
changes our algorithm is, in particular changes related to the degree of
conflict in the system.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 00:12:49 GMT"
}
] | 2010-07-30T00:00:00 |
[
[
"Ben-Hafaiedh",
"Imene",
"",
"Universite Joseph Fourier/VERIMAG"
],
[
"Graf",
"Susanne",
"",
"Universite Joseph Fourier/VERIMAG"
],
[
"Khairallah",
"Hammadi",
"",
"Tunisia Polytechnic\n School"
]
] |
new_dataset
| 0.99194 |
1007.5092
|
EPTCS
|
Javier Cubo (University of Malaga), Ernesto Pimentel (University of
Malaga), Gwen Sala\"un (Grenoble INP, INRIA-Grenoble, LIG), Carlos Canal
(University of Malaga)
|
Handling Data-Based Concurrency in Context-Aware Service Protocols
|
In Proceedings FOCLASA 2010, arXiv:1007.4993
|
EPTCS 30, 2010, pp. 62-77
|
10.4204/EPTCS.30.5
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dependency analysis is a technique to identify and determine data
dependencies between service protocols. Protocols evolving concurrently in the
service composition need to impose an order in their execution if there exist
data dependencies. In this work, we describe a model to formalise context-aware
service protocols. We also present a composition language to handle dynamically
the concurrent execution of protocols. This language addresses data dependency
issues among several protocols concurrently executed on the same user device,
using mechanisms based on data semantic matching. Our approach aims at
assisting the user in establishing priorities between these dependencies,
avoiding the occurrence of deadlock situations. Nevertheless, this process is
error-prone, since it requires human intervention. Therefore, we also propose
verification techniques to automatically detect possible inconsistencies
specified by the user while building the data dependency set. Our approach is
supported by a prototype tool we have implemented.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 00:13:00 GMT"
}
] | 2010-07-30T00:00:00 |
[
[
"Cubo",
"Javier",
"",
"University of Malaga"
],
[
"Pimentel",
"Ernesto",
"",
"University of\n Malaga"
],
[
"Salaün",
"Gwen",
"",
"Grenoble INP, INRIA-Grenoble, LIG"
],
[
"Canal",
"Carlos",
"",
"University of Malaga"
]
] |
new_dataset
| 0.970377 |
1007.5095
|
EPTCS
|
Mohammad Mahdi Jaghoori (LIACS and CWI), Tom Chothia (University of
Birmingham)
|
Timed Automata Semantics for Analyzing Creol
|
In Proceedings FOCLASA 2010, arXiv:1007.4993
|
EPTCS 30, 2010, pp. 108-122
|
10.4204/EPTCS.30.8
| null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a real-time semantics for the concurrent, object-oriented modeling
language Creol, by mapping Creol processes to a network of timed automata. We
can use our semantics to verify real time properties of Creol objects, in
particular to see whether processes can be scheduled correctly and meet their
end-to-end deadlines. Real-time Creol can be useful for analyzing, for
instance, abstract models of multi-core embedded systems. We show how analysis
can be done in Uppaal.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 00:13:14 GMT"
}
] | 2010-07-30T00:00:00 |
[
[
"Jaghoori",
"Mohammad Mahdi",
"",
"LIACS and CWI"
],
[
"Chothia",
"Tom",
"",
"University of\n Birmingham"
]
] |
new_dataset
| 0.981857 |
1007.5130
|
Secretary Ijaia
|
Giuseppe Della Penna (1), Benedetto Intrigila (2), Daniele Magazzeni
(3) and Fabio Mercorio (1) ((1) University of L'Aquila, Italy, (2) University
of Rome, Italy and (3) University of Chieti, Italy)
|
Resource-Optimal Planning For An Autonomous Planetary Vehicle
|
15 pages, 4 figures
|
International Journal of Artificial Intelligence & Applications
1.3 (2010) 15-29
|
10.5121/ijaia.2010.1302
| null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Autonomous planetary vehicles, also known as rovers, are small autonomous
vehicles equipped with a variety of sensors used to perform exploration and
experiments on a planet's surface. Rovers work in a partially unknown
environment, with narrow energy/time/movement constraints and, typically, small
computational resources that limit the complexity of on-line planning and
scheduling, thus they represent a great challenge in the field of autonomous
vehicles. Indeed, formal models for such vehicles usually involve hybrid
systems with nonlinear dynamics, which are difficult to handle by most of the
current planning algorithms and tools. Therefore, when offline planning of the
vehicle activities is required, for example for rovers that operate without a
continuous Earth supervision, such planning is often performed on simplified
models that are not completely realistic. In this paper we show how the
UPMurphi model checking based planning tool can be used to generate
resource-optimal plans to control the engine of an autonomous planetary
vehicle, working directly on its hybrid model and taking into account several
safety constraints, thus achieving very accurate results.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 07:27:25 GMT"
}
] | 2010-07-30T00:00:00 |
[
[
"Della Penna",
"Giuseppe",
""
],
[
"Intrigila",
"Benedetto",
""
],
[
"Magazzeni",
"Daniele",
""
],
[
"Mercorio",
"Fabio",
""
]
] |
new_dataset
| 0.993203 |
1007.5139
|
Secretary Ijaia
|
Anuradha Banerjee (1) and Paramartha Dutta (2) ((1) Kalyani Govt.
Engg. College, India and (2) Visva-Bharati University, India)
|
Reputation-Based Attack-Resistant Cooperation Stimulation (RACS) For
Mobile Ad hoc Networks
|
20 pages, 4 figures
|
International Journal of Artificial Intelligence & Applications
1.3 (2010) 71-90
|
10.5121/ijaia.2010.1306
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In mobile ad hoc networks (MANET), nodes usually belong to different
authorities and pursue different goals. In order to maximize their own
performance, nodes in such networks tend to be selfish and are not willing to
forward packets for benefit of others. Meanwhile, some nodes may behave
maliciously and try to disrupt the network through wasting other nodes
resources in a very large scale. In this article, we present a reputation-based
attack resistant cooperation stimulation (RACS) system which ensures that
damage caused by malicious nodes can be bounded and cooperation among the
selfish nodes can be enforced. Mathematical analyses of the system as well as
the simulation results have confirmed effectiveness of our proposed system.
RACS is completely self-organizing and distributed. It does not require any
tamper-proof hardware or central management policy.
|
[
{
"version": "v1",
"created": "Thu, 29 Jul 2010 07:54:51 GMT"
}
] | 2010-07-30T00:00:00 |
[
[
"Banerjee",
"Anuradha",
""
],
[
"Dutta",
"Paramartha",
""
]
] |
new_dataset
| 0.993454 |
0802.0823
|
Marco Chiani Dr.
|
Enrico Paolini, Marc Fossorier, Marco Chiani
|
Doubly-Generalized LDPC Codes: Stability Bound over the BEC
|
Submitted to IEEE Trans. on Inform. Theory
|
IEEE Trans. Inform. Theory, vol. 55, no. 3, pp. 1027-1046, March
2009
|
10.1109/TIT.2008.2011446
| null |
cs.IT math.IT
| null |
The iterative decoding threshold of low-density parity-check (LDPC) codes
over the binary erasure channel (BEC) fulfills an upper bound depending only on
the variable and check nodes with minimum distance 2. This bound is a
consequence of the stability condition, and is here referred to as stability
bound. In this paper, a stability bound over the BEC is developed for
doubly-generalized LDPC codes, where the variable and the check nodes can be
generic linear block codes, assuming maximum a posteriori erasure correction at
each node. It is proved that in this generalized context as well the bound
depends only on the variable and check component codes with minimum distance 2.
A condition is also developed, namely the derivative matching condition, under
which the bound is achieved with equality.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2008 16:29:14 GMT"
}
] | 2010-07-28T00:00:00 |
[
[
"Paolini",
"Enrico",
""
],
[
"Fossorier",
"Marc",
""
],
[
"Chiani",
"Marco",
""
]
] |
new_dataset
| 0.996777 |
1007.4606
|
Qingchun Zhao
|
Qingchun Zhao and Hongxi Yin
|
Gbits/s physical-layer stream ciphers based on chaotic light
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
We propose a novel high-speed stream cipher encryption scheme based on the
true random key generated by a chaotic semiconductor laser. A 5-Gbits/s
non-return-to-zero plaintext is successfully encrypted and decrypted using this
cryptography. The scheme can be applied in the areas of real-time high-speed
physical encryption.
|
[
{
"version": "v1",
"created": "Tue, 27 Jul 2010 01:58:33 GMT"
}
] | 2010-07-28T00:00:00 |
[
[
"Zhao",
"Qingchun",
""
],
[
"Yin",
"Hongxi",
""
]
] |
new_dataset
| 0.983314 |
1007.4801
|
Aylin Yener
|
Xiang He and Aylin Yener
|
MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel
States
|
Submitted to IEEE Transactions on Information Theory, July 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a class of information theoretic secrecy problems is addressed
where the eavesdropper channel states are completely unknown to the legitimate
parties. In particular, MIMO wiretap channel models are considered where the
channel of the eavesdropper is arbitrarily varying over time. Assuming that the
number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO
wiretap channel in the sense of strong secrecy is derived, and shown to match
with the converse in secure degrees of freedom. It is proved that there exists
a universal coding scheme that secures the confidential message against any
sequence of channel states experienced by the eavesdropper. This yields the
conclusion that secure communication is possible regardless of the location or
channel states of (potentially infinite number of) eavesdroppers. Additionally,
it is observed that, the present setting renders the secrecy capacity problems
for multi-terminal wiretap-type channels more tractable as compared the case
with full or partial knowledge of eavesdropper channel states. To demonstrate
this observation, secure degrees of freedom regions are derived for the
Gaussian MIMO multiple access wiretap channel (MIMO MAC-WT) and the Gaussian
MIMO broadcast wiretap channel (MIMO BC-WT) where the transmitter(s) and the
intended receiver(s) have the same number of antennas.
|
[
{
"version": "v1",
"created": "Tue, 27 Jul 2010 19:28:29 GMT"
}
] | 2010-07-28T00:00:00 |
[
[
"He",
"Xiang",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.962095 |
1007.4066
|
Mubashir Husain Rehmani
|
Zeeshan Ali Khan and Mubashir Husain Rehmani
|
A Tutorial on Broadcasting Packets over Multiple-Channels in a
Multi-Inferface Network Setting in NS-2
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the proliferation of cheaper electronic devices, wireless communication
over multiple-channels in a multi-interface network is now possible. For
instace, wireless sensor nodes can now operate over multiplechannels. Moreover,
cognitive radio sensor networks are also evolving, which also operates over
multiple-channels. In the market, we can find antennas that can support the
operation of multiple channels, for e.g. the cc2420 antenna that is used for
communication between wireless sensor nodes consists of 16 programmable
channels. The proper utilization of multiple-channels reduces the interference
between the nodes and increase the network throughput. Recently, a Cognitive
Radio Cognitive Network (CRCN) patch for NS-2 simulator has proposed to support
multi-channel multi-interface capability in NS-2. In this tutorial, we consider
how to simulate a multi-channel multiinterface wireless network using the NS-2
simulator. This tutorial is trageted to the novice users who wants to
understand the implementation of multi-channel multi-interface in NS-2. We take
the Cognitive Radio Cognitive Network (CRCN) patch for NS-2 simulator and
demonstrate broadcasting over multiple-channels in a multi-interface network
setting. In our seeting, node braodcasts the Hello packets to its neighbors.
Neighboring nodes receive the Hello packets if and only if they are tuned to
the same channel. We demonstrate through example that the tuning of receivers
can be done in two fashions.
|
[
{
"version": "v1",
"created": "Fri, 23 Jul 2010 08:20:25 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jul 2010 13:02:50 GMT"
}
] | 2010-07-27T00:00:00 |
[
[
"Khan",
"Zeeshan Ali",
""
],
[
"Rehmani",
"Mubashir Husain",
""
]
] |
new_dataset
| 0.994576 |
1005.3902
|
Nabil Hathout
|
Nabil Hathout (CLLE)
|
Morphonette: a morphological network of French
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes in details the first version of Morphonette, a new
French morphological resource and a new radically lexeme-based method of
morphological analysis. This research is grounded in a paradigmatic conception
of derivational morphology where the morphological structure is a structure of
the entire lexicon and not one of the individual words it contains. The
discovery of this structure relies on a measure of morphological similarity
between words, on formal analogy and on the properties of two morphological
paradigms:
|
[
{
"version": "v1",
"created": "Fri, 21 May 2010 08:12:12 GMT"
}
] | 2010-07-26T00:00:00 |
[
[
"Hathout",
"Nabil",
"",
"CLLE"
]
] |
new_dataset
| 0.997131 |
1005.5608
|
Olivier Finkel
|
Olivier Finkel (ELM)
|
On Infinitary Rational Relations and Borel Sets
| null |
Fourth International Conference on Discrete Mathematics and
Theoretical Computer Science DMTCS'03, 7 - 12 July 2003, Dijon, France.,
France (2003)
| null | null |
cs.LO cs.CC math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove in this paper that there exists some infinitary rational relations
which are Sigma^0_3-complete Borel sets and some others which are
Pi^0_3-complete. This implies that there exists some infinitary rational
relations which are Delta^0_4-sets but not (Sigma^0_3U Pi^0_3)-sets. These
results give additional answers to questions of Simonnet and of Lescow and
Thomas.
|
[
{
"version": "v1",
"created": "Mon, 31 May 2010 07:50:09 GMT"
}
] | 2010-07-26T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM"
]
] |
new_dataset
| 0.991914 |
1007.4040
|
Yisong Wang
|
Yisong Wang and Jia-Huai You and Li Yan Yuan and Yi-Dong Shen
|
Loop Formulas for Description Logic Programs
|
29 pages, 1 figures (in pdf), a short version appeared in ICLP'10
|
yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen: Loop
formulas for description logic programs. TPLP 10(4-6): 531-545 (2010)
|
10.1017/S1471068410000268
| null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute
an elegant yet powerful formalism for the integration of answer set programming
with description logics, for the Semantic Web. In this paper, we generalize the
notions of completion and loop formulas of logic programs to description logic
programs and show that the answer sets of a dl-program can be precisely
captured by the models of its completion and loop formulas. Furthermore, we
propose a new, alternative semantics for dl-programs, called the {\em canonical
answer set semantics}, which is defined by the models of completion that
satisfy what are called canonical loop formulas. A desirable property of
canonical answer sets is that they are free of circular justifications. Some
properties of canonical answer sets are also explored.
|
[
{
"version": "v1",
"created": "Fri, 23 Jul 2010 04:48:19 GMT"
}
] | 2010-07-26T00:00:00 |
[
[
"Wang",
"Yisong",
""
],
[
"You",
"Jia-Huai",
""
],
[
"Yuan",
"Li Yan",
""
],
[
"Shen",
"Yi-Dong",
""
]
] |
new_dataset
| 0.998912 |
1007.2327
|
Michal Kryczka
|
Ruben Cuevas, Michal Kryczka, Angel Cuevas, Sebastian Kaune, Carmen
Guerrero, Reza Rejaie
|
Is Content Publishing in BitTorrent Altruistic or Profit-Driven
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BitTorrent is the most popular P2P content delivery application where
individual users share various type of content with tens of thousands of other
users. The growing popularity of BitTorrent is primarily due to the
availability of valuable content without any cost for the consumers. However,
apart from required resources, publishing (sharing) valuable (and often
copyrighted) content has serious legal implications for user who publish the
material (or publishers). This raises a question that whether (at least major)
content publishers behave in an altruistic fashion or have other incentives
such as financial. In this study, we identify the content publishers of more
than 55k torrents in 2 major BitTorrent portals and examine their behavior. We
demonstrate that a small fraction of publishers are responsible for 66% of
published content and 75% of the downloads. Our investigations reveal that
these major publishers respond to two different profiles. On one hand,
antipiracy agencies and malicious publishers publish a large amount of fake
files to protect copyrighted content and spread malware respectively. On the
other hand, content publishing in BitTorrent is largely driven by companies
with financial incentive. Therefore, if these companies lose their interest or
are unable to publish content, BitTorrent traffic/portals may disappear or at
least their associated traffic will significantly reduce.
|
[
{
"version": "v1",
"created": "Wed, 14 Jul 2010 13:40:22 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Jul 2010 10:56:31 GMT"
}
] | 2010-07-23T00:00:00 |
[
[
"Cuevas",
"Ruben",
""
],
[
"Kryczka",
"Michal",
""
],
[
"Cuevas",
"Angel",
""
],
[
"Kaune",
"Sebastian",
""
],
[
"Guerrero",
"Carmen",
""
],
[
"Rejaie",
"Reza",
""
]
] |
new_dataset
| 0.998605 |
1007.3794
|
EPTCS
|
Lucas Dixon (University of Edinburgh), Ross Duncan (University of
Oxford), Aleks Kissinger (University of Oxford)
|
Open Graphs and Computational Reasoning
|
In Proceedings DCM 2010, arXiv:1006.1937
|
EPTCS 26, 2010, pp. 169-180
|
10.4204/EPTCS.26.16
| null |
cs.LO cs.MS cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a form of algebraic reasoning for computational objects which are
expressed as graphs. Edges describe the flow of data between primitive
operations which are represented by vertices. These graphs have an interface
made of half-edges (edges which are drawn with an unconnected end) and enjoy
rich compositional principles by connecting graphs along these half-edges. In
particular, this allows equations and rewrite rules to be specified between
graphs. Particular computational models can then be encoded as an axiomatic set
of such rules. Further rules can be derived graphically and rewriting can be
used to simulate the dynamics of a computational system, e.g. evaluating a
program on an input. Examples of models which can be formalised in this way
include traditional electronic circuits as well as recent categorical accounts
of quantum information.
|
[
{
"version": "v1",
"created": "Thu, 22 Jul 2010 03:31:39 GMT"
}
] | 2010-07-23T00:00:00 |
[
[
"Dixon",
"Lucas",
"",
"University of Edinburgh"
],
[
"Duncan",
"Ross",
"",
"University of\n Oxford"
],
[
"Kissinger",
"Aleks",
"",
"University of Oxford"
]
] |
new_dataset
| 0.998127 |
1007.3836
|
Oleksiy Kurganskyy
|
Oleksiy Kurgansky
|
A state of a dynamic computational structure distributed in an
environment: a model and its corollaries
|
11 pages, 5 figures
| null | null | null |
cs.FL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently there is great interest in computational models consisting of
underlying regular computational environments, and built on them distributed
computational structures. Examples of such models are cellular automata,
spatial computation and space-time crystallography. For any computational model
it is natural to define a functional equivalence of different but related
computational structures. In the finite automata theory an example of such
equivalence is automata homomorphism and, in particular, automata isomorphism.
If we continue to stick to the finite automata theory, a fundamental question
arise, what a state of a distributed computational structure is. This work is
devoted to particular solution of the issue.
|
[
{
"version": "v1",
"created": "Thu, 22 Jul 2010 09:38:57 GMT"
}
] | 2010-07-23T00:00:00 |
[
[
"Kurgansky",
"Oleksiy",
""
]
] |
new_dataset
| 0.95555 |
1007.3896
|
Amos Lapidoth
|
Shraga I. Bross and Amos Lapidoth
|
The State-Dependent Multiple-Access Channel with States Available at a
Cribbing Encoder
|
This is a longer version of a submission to the 2010 IEEE 26-th
Convention of Electrical and Electronics Engineers in Israel (IEEEI 2010)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The two-user discrete memoryless state-dependent multiple-access channel
(MAC) models a scenario in which two encoders transmit independent messages to
a single receiver via a MAC whose channel law is governed by the pair of
encoders' inputs and by an i.i.d. state random variable. In the cooperative
state-dependent MAC model it is further assumed that Message 1 is shared by
both encoders whereas Message 2 is known only to Encoder 2 - the cognitive
transmitter. The capacity of the cooperative state-dependent MAC where the
realization of the state sequence is known non-causally to the cognitive
encoder has been derived by Somekh-Baruch et. al.
In this work we dispense of the assumption that Message 1 is shared a-priori
by both encoders. Instead, we study the case in which Encoder 2 cribs causally
from Encoder 1. We determine the capacity region for both, the case where
Encoder 2 cribs strictly causal and the case where Encoder 2 cribs causally
from Encoder 1.
|
[
{
"version": "v1",
"created": "Thu, 22 Jul 2010 14:41:00 GMT"
}
] | 2010-07-23T00:00:00 |
[
[
"Bross",
"Shraga I.",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.982355 |
1007.3649
|
Satish N. Srirama
|
Satish Narayana Srirama and Anton Naumenko
|
Secure Communication and Access Control for Mobile Web Service
Provisioning
|
Proceedings of the First International Conference on Security of
Information and Networks (SIN 2007), May 8-10, 2007. Trafford Publishing,
Canada
| null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is now feasible to host basic web services on a smart phone due to the
advances in wireless devices and mobile communication technologies. While the
applications are quite welcoming, the ability to provide secure and reliable
communication in the vulnerable and volatile mobile ad-hoc topologies is vastly
becoming necessary. The paper mainly addresses the details and issues in
providing secured communication and access control for the mobile web service
provisioning domain. While the basic message-level security can be provided,
providing proper access control mechanisms for the Mobile Host still poses a
great challenge. This paper discusses details of secure communication and
proposes the distributed semantics-based authorization mechanism.
|
[
{
"version": "v1",
"created": "Wed, 21 Jul 2010 13:20:33 GMT"
}
] | 2010-07-22T00:00:00 |
[
[
"Srirama",
"Satish Narayana",
""
],
[
"Naumenko",
"Anton",
""
]
] |
new_dataset
| 0.996711 |
1007.3661
|
Ryuhei Mori
|
Ryuhei Mori and Toshiyuki Tanaka
|
Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry
Codes
|
5 pages, 3 figures, to appear in ITW 2010 Dublin
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes, introduced by Arikan, achieve symmetric capacity of any discrete
memoryless channels under low encoding and decoding complexity. Recently,
non-binary polar codes have been investigated. In this paper, we calculate
error probability of non-binary polar codes constructed on the basis of
Reed-Solomon matrices by numerical simulations. It is confirmed that 4-ary
polar codes have significantly better performance than binary polar codes on
binary-input AWGN channel. We also discuss an interpretation of polar codes in
terms of algebraic geometry codes, and further show that polar codes using
Hermitian codes have asymptotically good performance.
|
[
{
"version": "v1",
"created": "Wed, 21 Jul 2010 13:58:11 GMT"
}
] | 2010-07-22T00:00:00 |
[
[
"Mori",
"Ryuhei",
""
],
[
"Tanaka",
"Toshiyuki",
""
]
] |
new_dataset
| 0.999821 |
0909.1392
|
Dhananjoy Dey
|
Dhananjoy Dey, Prasanna Raghaw Mishra and Indranath Sengupta
|
HF-hash : Hash Functions Using Restricted HFE Challenge-1
|
44 pages including 32 pages appendix (list of polynomials) 2 figures,
corrected Surname
| null | null | null |
cs.CR math.AC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vulnerability of dedicated hash functions to various attacks has made the
task of designing hash function much more challenging. This provides us a
strong motivation to design a new cryptographic hash function viz. HF-hash.
This is a hash function, whose compression function is designed by using first
32 polynomials of HFE Challenge-1 with 64 variables by forcing remaining 16
variables as zero. HF-hash gives 256 bits message digest and is as efficient as
SHA-256. It is secure against the differential attack proposed by Chabaud and
Joux as well as by Wang et. al. applied to SHA-0 and SHA-1.
|
[
{
"version": "v1",
"created": "Tue, 8 Sep 2009 05:42:54 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Oct 2009 11:25:40 GMT"
}
] | 2010-07-21T00:00:00 |
[
[
"Dey",
"Dhananjoy",
""
],
[
"Mishra",
"Prasanna Raghaw",
""
],
[
"Sengupta",
"Indranath",
""
]
] |
new_dataset
| 0.997691 |
0906.1346
|
Jianfeng Zhan
|
Jianfeng Zhan, Lei Wang, Bibo Tu, Yong Li, Peng Wang, Wei Zhou, Dan
Meng
|
Phoenix Cloud: Consolidating Different Computing Loads on Shared Cluster
System for Large Organization
|
5 page, 8 figures, The First Workshop of Cloud Computing and its
Application, The modified version. The original version is on the web site of
http://www.cca08.org/, which is dated from August 13, 2008
|
The first workshop of cloud computing and its application (CCA
08), Chicago, 2008
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Different departments of a large organization often run dedicated cluster
systems for different computing loads, like HPC (high performance computing)
jobs or Web service applications. In this paper, we have designed and
implemented a cloud management system software Phoenix Cloud to consolidate
heterogeneous workloads from different departments affiliated to the same
organization on the shared cluster system. We have also proposed cooperative
resource provisioning and management policies for a large organization and its
affiliated departments, running HPC jobs and Web service applications, to share
the consolidated cluster system. The experiments show that in comparison with
the case that each department operates its dedicated cluster system, Phoenix
Cloud significantly decreases the scale of the required cluster system for a
large organization, improves the benefit of the scientific computing
department, and at the same time provisions enough resources to the other
department running Web services with varying loads.
|
[
{
"version": "v1",
"created": "Sun, 7 Jun 2009 10:15:28 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Feb 2010 07:59:05 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Mar 2010 06:01:45 GMT"
},
{
"version": "v4",
"created": "Tue, 6 Apr 2010 23:03:03 GMT"
},
{
"version": "v5",
"created": "Thu, 15 Jul 2010 00:13:39 GMT"
},
{
"version": "v6",
"created": "Sat, 17 Jul 2010 00:03:21 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"Zhan",
"Jianfeng",
""
],
[
"Wang",
"Lei",
""
],
[
"Tu",
"Bibo",
""
],
[
"Li",
"Yong",
""
],
[
"Wang",
"Peng",
""
],
[
"Zhou",
"Wei",
""
],
[
"Meng",
"Dan",
""
]
] |
new_dataset
| 0.993666 |
1007.2855
|
Graeme Smith
|
Graeme Smith
|
Quantum Channel Capacities
|
This review of quantum channel capacities is the basis for my
upcoming talk at ITW 2010 in Dublin
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A quantum communication channel can be put to many uses: it can transmit
classical information, private classical information, or quantum information.
It can be used alone, with shared entanglement, or together with other
channels. For each of these settings there is a capacity that quantifies a
channel's potential for communication. In this short review, I summarize what
is known about the various capacities of a quantum channel, including a
discussion of the relevant additivity questions. I also give some indication of
potentially interesting directions for future research.
|
[
{
"version": "v1",
"created": "Fri, 16 Jul 2010 20:02:13 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"Smith",
"Graeme",
""
]
] |
new_dataset
| 0.990937 |
1007.2981
|
Satish N. Srirama
|
Satish Narayana Srirama, Matthias Jarke, Wolfgang Prinz
|
A Mediation Framework for Mobile Web Service Provisioning
|
Proceedings of 2006 Middleware for Web Services (MWS 2006) Workshop @
10th International IEEE EDOC Conference "The Enterprise Computing
Conference", October 16, 2006, pp. 14-17. IEEE Computer Society
| null |
10.1109/EDOCW.2006.9
| null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web Services and mobile data services are the newest trends in information
systems engineering in wired and wireless domains, respectively. Web Services
have a broad range of service distributions while mobile phones have large and
expanding user base. To address the confluence of Web Services and pervasive
mobile devices and communication environments, a basic mobile Web Service
provider was developed for smart phones. The performance of this Mobile Host
was also analyzed in detail. Further analysis of the Mobile Host to provide
proper QoS and to check Mobile Host's feasibility in the P2P networks,
identified the necessity of a mediation framework. The paper describes the
research conducted with the Mobile Host, identifies the tasks of the mediation
framework and then discusses the feasible realization details of such a mobile
Web Services mediation framework.
|
[
{
"version": "v1",
"created": "Sun, 18 Jul 2010 09:22:31 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"Srirama",
"Satish Narayana",
""
],
[
"Jarke",
"Matthias",
""
],
[
"Prinz",
"Wolfgang",
""
]
] |
new_dataset
| 0.994091 |
1007.3058
|
Ghassan Samara
|
Ghassan Samara, Sureswaran Ramadas, Wafaa A.H. Al-Salihy
|
Safety Message Power Transmission Control for Vehicular Ad hoc Networks
| null |
Journal of Computer Science 6 (10): 1027-1032, 2010 ISSN
1549-3636, 2010 Science Publications
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular Ad hoc Networks (VANET) is one of the most challenging research
area in the field of Mobile Ad Hoc Networks. In this research we proposed a
dynamic power adjustment protocol that will be used for sending the periodical
safety message. (Beacon)based on the analysis of the channel status depending
on the channel congestion and the power used for transmission. The Beacon Power
Control (BPC) protocol first sensed and examined the percentage of the channel
congestion, the result obtained was used to adjust the transmission power for
the safety message to reach the optimal power. This will lead to decrease the
congestion in the channel and achieve good channel performance and beacon
dissemination.
|
[
{
"version": "v1",
"created": "Mon, 19 Jul 2010 03:05:36 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"Samara",
"Ghassan",
""
],
[
"Ramadas",
"Sureswaran",
""
],
[
"Al-Salihy",
"Wafaa A. H.",
""
]
] |
new_dataset
| 0.991668 |
1007.3159
|
Fabrizio Riguzzi PhD
|
Marco Gavanelli and Fabrizio Riguzzi and Michela Milano and Paolo
Cagnoli
|
Logic-Based Decision Support for Strategic Environmental Assessment
|
17 pages, 1 figure, 26th Int'l. Conference on Logic Programming
(ICLP'10)
|
Theory and Practice of Logic Programming, 26th Int'l. Conference
on Logic Programming (ICLP'10) Special Issue, 10(4-6), 643-658, 2010
|
10.1017/S1471068410000335
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Strategic Environmental Assessment is a procedure aimed at introducing
systematic assessment of the environmental effects of plans and programs. This
procedure is based on the so-called coaxial matrices that define dependencies
between plan activities (infrastructures, plants, resource extractions,
buildings, etc.) and positive and negative environmental impacts, and
dependencies between these impacts and environmental receptors. Up to now, this
procedure is manually implemented by environmental experts for checking the
environmental effects of a given plan or program, but it is never applied
during the plan/program construction. A decision support system, based on a
clear logic semantics, would be an invaluable tool not only in assessing a
single, already defined plan, but also during the planning process in order to
produce an optimized, environmentally assessed plan and to study possible
alternative scenarios. We propose two logic-based approaches to the problem,
one based on Constraint Logic Programming and one on Probabilistic Logic
Programming that could be, in the future, conveniently merged to exploit the
advantages of both. We test the proposed approaches on a real energy plan and
we discuss their limitations and advantages.
|
[
{
"version": "v1",
"created": "Mon, 19 Jul 2010 14:36:54 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"Gavanelli",
"Marco",
""
],
[
"Riguzzi",
"Fabrizio",
""
],
[
"Milano",
"Michela",
""
],
[
"Cagnoli",
"Paolo",
""
]
] |
new_dataset
| 0.994278 |
1007.3181
|
Joseph O'Rourke
|
Joseph O'Rourke
|
On Folding a Polygon to a Polyhedron
|
6 pages, 1 figure
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the open problem presented in "Geometric Folding Algorithms:
Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and
Zalgaller [BZ96] from more than a decade earlier.
|
[
{
"version": "v1",
"created": "Mon, 19 Jul 2010 15:20:24 GMT"
}
] | 2010-07-20T00:00:00 |
[
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.999371 |
0705.0315
|
Omid Amini
|
Omid Amini, Frederic Havet, Florian Huc, Stephan Thomasse
|
WDM and Directed Star Arboricity
|
18 pages, 2 figures. Final version
|
Combinatorics, Probability and Computing, Volume 19, Issue 02,
March 2010, pp 161-182
| null | null |
cs.NI math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A digraph is $m$-labelled if every arc is labelled by an integer in $\{1,
\dots,m\}$. Motivated by wavelength assignment for multicasts in optical
networks, we introduce and study $n$-fibre colourings of labelled digraphs.
These are colourings of the arcs of $D$ such that at each vertex $v$, and for
each colour $\alpha$, $in(v,\alpha)+out(v,\alpha)\leq n$ with $in(v,\alpha)$
the number of arcs coloured $\alpha$ entering $v$ and $out(v,\alpha)$ the
number of labels $l$ such that there is at least one arc of label $l$ leaving
$v$ and coloured with $\alpha$. The problem is to find the minimum number of
colours $\lambda_n(D)$ such that the $m$-labelled digraph $D$ has an $n$-fibre
colouring. In the particular case when $D$ is $1$-labelled, $\lambda_1(D)$ is
called the directed star arboricity of $D$, and is denoted by $dst(D)$. We
first show that $dst(D)\leq 2\Delta^-(D)+1$, and conjecture that if
$\Delta^-(D)\geq 2$, then $dst(D)\leq 2\Delta^-(D)$. We also prove that for a
subcubic digraph $D$, then $dst(D)\leq 3$, and that if $\Delta^+(D),
\Delta^-(D)\leq 2$, then $dst(D)\leq 4$. Finally, we study
$\lambda_n(m,k)=\max\{\lambda_n(D) \tq D \mbox{is $m$-labelled} \et
\Delta^-(D)\leq k\}$. We show that if $m\geq n$, then $\ds
\left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil + \frac{k}{n}
\right\rceil\leq \lambda_n(m,k) \leq\left\lceil\frac{m}{n}\left\lceil
\frac{k}{n}\right\rceil + \frac{k}{n} \right\rceil + C \frac{m^2\log k}{n}$ for
some constant $C$. We conjecture that the lower bound should be the right value
of $\lambda_n(m,k)$.
|
[
{
"version": "v1",
"created": "Wed, 2 May 2007 15:54:55 GMT"
},
{
"version": "v2",
"created": "Thu, 3 May 2007 08:38:06 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Jul 2010 01:05:23 GMT"
}
] | 2010-07-16T00:00:00 |
[
[
"Amini",
"Omid",
""
],
[
"Havet",
"Frederic",
""
],
[
"Huc",
"Florian",
""
],
[
"Thomasse",
"Stephan",
""
]
] |
new_dataset
| 0.995816 |
1003.3307
|
Secretary Aircc Journal
|
S. Mehta (1) and K.S. Kwak (1) ((1)Inha University, Korea)
|
H-MAC: A Hybrid MAC Protocol for Wireless Sensor Networks
|
10 pages, IJCNC Journal 2010
|
International Journal of Computer Networks & Communications 2.2
(2010) 108-117
|
10.5121/ijcnc.2010.2208
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we propose a hybrid medium access control protocol (H-MAC) for
wireless sensor networks. It is based on the IEEE 802.11's power saving
mechanism (PSM) and slotted aloha, and utilizes multiple slots dynamically to
improve performance. Existing MAC protocols for sensor networks reduce energy
consumptions by introducing variation in an active/sleep mechanism. But they
may not provide energy efficiency in varying traffic conditions as well as they
did not address Quality of Service (QoS) issues. H-MAC, the propose MAC
protocol maintains energy efficiency as well as QoS issues like latency,
throughput, and channel utilization. Our numerical results show that H-MAC has
significant improvements in QoS parameters than the existing MAC protocols for
sensor networks while consuming comparable amount of energy.
|
[
{
"version": "v1",
"created": "Wed, 17 Mar 2010 06:48:13 GMT"
}
] | 2010-07-15T00:00:00 |
[
[
"Mehta",
"S.",
"",
"Inha University, Korea"
],
[
"Kwak",
"K. S.",
"",
"Inha University, Korea"
]
] |
new_dataset
| 0.996876 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.