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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1001.4703
|
Jeremie Jakubowicz
|
Pascal Bianchi, Jeremie Jakubowicz, Francois Roueff
|
Neyman-Pearson Detection of a Gaussian Source using Dumb Wireless
Sensors
|
28 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the performance of the Neyman-Pearson detection of a
stationary Gaussian process in noise, using a large wireless sensor network
(WSN). In our model, each sensor compresses its observation sequence using a
linear precoder. The final decision is taken by a fusion center (FC) based on
the compressed information. Two families of precoders are studied: random iid
precoders and orthogonal precoders. We analyse their performance in the regime
where both the number of sensors k and the number of samples n per sensor tend
to infinity at the same rate, that is, k/n tends to c in (0, 1). Contributions
are as follows. 1) Using results of random matrix theory and on large Toeplitz
matrices, it is proved that the miss probability of the Neyman-Pearson detector
converges exponentially to zero, when the above families of precoders are used.
Closed form expressions of the corresponding error exponents are provided. 2)
In particular, we propose a practical orthogonal precoding strategy, the
Principal Frequencies Strategy (PFS), which achieves the best error exponent
among all orthogonal strategies, and which requires very few signaling overhead
between the central processor and the nodes of the network. 3) Moreover, when
the PFS is used, a simplified low-complexity testing procedure can be
implemented at the FC. We show that the proposed suboptimal test enjoys the
same error exponent as the Neyman-Pearson test, which indicates a similar
asymptotic behaviour of the performance. We illustrate our findings by
numerical experiments on some examples.
|
[
{
"version": "v1",
"created": "Tue, 26 Jan 2010 14:33:00 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jan 2010 18:53:54 GMT"
}
] | 2010-01-27T00:00:00 |
[
[
"Bianchi",
"Pascal",
""
],
[
"Jakubowicz",
"Jeremie",
""
],
[
"Roueff",
"Francois",
""
]
] |
new_dataset
| 0.974328 |
1001.4150
|
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
| null | null | null | 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": "Sat, 23 Jan 2010 12:34:28 GMT"
}
] | 2010-01-26T00: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 |
1001.4186
|
Archunan Selvi
|
Ravi. J, K. B. Raja, Venugopal. K. R
|
Fingerprint Recognition Using Minutia Score Matching
|
8 Pages
|
IJEST Volume 1 Issue 2 2009 35-42
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
The popular Biometric used to authenticate a person is Fingerprint which is
unique and permanent throughout a person's life. A minutia matching is widely
used for fingerprint recognition and can be classified as ridge ending and
ridge bifurcation. In this paper we projected Fingerprint Recognition using
Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block
Filter is used, which scans the image at the boundary to preserves the quality
of the image and extract the minutiae from the thinned image. The false
matching ratio is better compared to the existing algorithm.
|
[
{
"version": "v1",
"created": "Sat, 23 Jan 2010 18:53:29 GMT"
}
] | 2010-01-26T00:00:00 |
[
[
"J",
"Ravi.",
""
],
[
"Raja",
"K. B.",
""
],
[
"R",
"Venugopal. K.",
""
]
] |
new_dataset
| 0.996444 |
1001.4423
|
Ali Mousavi
|
Ali Mousavi, Pedram Pad, Farokh Marvasti
|
A New Decoding Scheme for Errorless Codes for Overloaded CDMA with
Active User Detection
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, a new class of binary codes for overloaded CDMA systems are
proposed that not only has the ability of errorless communication but also
suitable for detecting active users. These codes are called COWDA [1]. In [1],
a Maximum Likelihood (ML) decoder is proposed for this class of codes. Although
the proposed scheme of coding/decoding show impressive performance, the decoder
can be improved. In this paper by assuming more practical conditions for the
traffic in the system, we suggest an algorithm that increases the performance
of the decoder several orders of magnitude (the Bit-Error-Rate (BER) is divided
by a factor of 400 in some Eb/N0's The algorithm supposes the Poison
distribution for the time of activation/deactivation of the users.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2010 13:40:28 GMT"
}
] | 2010-01-26T00:00:00 |
[
[
"Mousavi",
"Ali",
""
],
[
"Pad",
"Pedram",
""
],
[
"Marvasti",
"Farokh",
""
]
] |
new_dataset
| 0.997417 |
0802.2108
|
Anil Hirani
|
Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar Ramos
|
Well-Centered Triangulation
|
Content has been added to experimental results section. Significant
edits in introduction and in summary of current and previous results. Minor
edits elsewhere
|
SIAM J. Sci. Comput. 31, 6 (2010) 4497-4523
|
10.1137/090748214
|
UIUCDCS-R-2008-2936
|
cs.CG cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Meshes composed of well-centered simplices have nice orthogonal dual meshes
(the dual Voronoi diagram). This is useful for certain numerical algorithms
that prefer such primal-dual mesh pairs. We prove that well-centered meshes
also have optimality properties and relationships to Delaunay and minmax angle
triangulations. We present an iterative algorithm that seeks to transform a
given triangulation in two or three dimensions into a well-centered one by
minimizing a cost function and moving the interior vertices while keeping the
mesh connectivity and boundary vertices fixed. The cost function is a direct
result of a new characterization of well-centeredness in arbitrary dimensions
that we present. Ours is the first optimization-based heuristic for
well-centeredness, and the first one that applies in both two and three
dimensions. We show the results of applying our algorithm to small and large
two-dimensional meshes, some with a complex boundary, and obtain a
well-centered tetrahedralization of the cube. We also show numerical evidence
that our algorithm preserves gradation and that it improves the maximum and
minimum angles of acute triangulations created by the best known previous
method.
|
[
{
"version": "v1",
"created": "Thu, 14 Feb 2008 23:04:07 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Feb 2009 21:21:40 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Aug 2009 16:48:13 GMT"
}
] | 2010-01-25T00:00:00 |
[
[
"VanderZee",
"Evan",
""
],
[
"Hirani",
"Anil N.",
""
],
[
"Guoy",
"Damrong",
""
],
[
"Ramos",
"Edgar",
""
]
] |
new_dataset
| 0.997842 |
1001.3916
|
Zhang Guohua
|
Guohua Zhang and Xinmei Wang
|
Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
|
5 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check
(QC-LDPC) codes with all lengths larger than a certain given number is
proposed, via a given girth-12 code subjected to some constraints. The lengths
of these codes can be arbitrary integers of the form LP, provided that P is
larger than a tight lower bound determined by the maximal element within the
exponent matrix of the given girth-12 code. By applying the method to the case
of row-weight six, we obtained a family of girth-12 (3,6) QC-LDPC codes for
arbitrary lengths above 2688, which includes 30 member codes with shorter code
lengths compared with the shortest girth-12 (3,6) QC-LDPC codes reported by
O'Sullivan.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2010 05:09:08 GMT"
}
] | 2010-01-25T00:00:00 |
[
[
"Zhang",
"Guohua",
""
],
[
"Wang",
"Xinmei",
""
]
] |
new_dataset
| 0.99946 |
1001.3689
|
Mohsen Sardari
|
Mohsen Sardari, Faramarz Hendessi, Faramarz Fekri
|
Infocast: A New Paradigm for Collaborative Content Distribution from
Roadside Units to Vehicular Networks Using Rateless Codes
| null |
Proc. 6th Annual IEEE Communications Society Conference on Sensor,
Mesh and Ad Hoc Communications and Networks SECON '09, 2009, 1-9
|
10.1109/SAHCN.2009.5168939
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of distributing a large amount of bulk
data to a sparse vehicular network from roadside infostations, using efficient
vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the
underlying vehicular network topology, we depart from architectures requiring
centralized coordination, reliable MAC scheduling, or global network state
knowledge, and instead adopt a distributed paradigm with simple protocols. In
other words, we investigate the problem of reliable dissemination from multiple
sources when each node in the network shares a limited amount of its resources
for cooperating with others. By using \emph{rateless} coding at the Road Side
Unit (RSU) and using vehicles as data carriers, we describe an efficient way to
achieve reliable dissemination to all nodes (even disconnected clusters in the
network). In the nutshell, we explore vehicles as mobile storage devices. We
then develop a method to keep the density of the rateless codes packets as a
function of distance from the RSU at the desired level set for the target
decoding distance. We investigate various tradeoffs involving buffer size,
maximum capacity, and the mobility parameter of the vehicles.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 22:24:10 GMT"
}
] | 2010-01-22T00:00:00 |
[
[
"Sardari",
"Mohsen",
""
],
[
"Hendessi",
"Faramarz",
""
],
[
"Fekri",
"Faramarz",
""
]
] |
new_dataset
| 0.992709 |
1001.3708
|
Hamidreza Ebrahimzadeh Saffar
|
Hamidreza Ebrahimzadeh Saffar, Patrick Mitran
|
Capacity Bounds and Lattice Coding for the Star Relay Network
|
5 pages, submitted to IEEE ISIT, 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3
receivers, and a central relay is considered. The transmitters wish to send
information to their corresponding receivers via a two phase communication
protocol. The receivers decode their desired messages by using side information
and the signals received from the relay. We derive an outer bound on the
capacity region of any two phase protocol as well as 3 achievable regions by
employing different relaying strategies. In particular, we combine physical and
network layer coding to take advantage of the interference at the relay, using,
for example, lattice-based codes. We then specialize our results to the
exchange rate. It is shown that for any snr, we can achieve within 0.5 bit of
the upper bound by lattice coding and within 0.34 bit, if we take the best of
the 3 strategies. Also, for high snr, lattice coding is within log(3)/4 ~ 0.4
bit of the upper bound.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2010 01:46:22 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jan 2010 18:46:05 GMT"
}
] | 2010-01-22T00:00:00 |
[
[
"Saffar",
"Hamidreza Ebrahimzadeh",
""
],
[
"Mitran",
"Patrick",
""
]
] |
new_dataset
| 0.984653 |
cs/0107023
|
Joseph O'Rourke
|
Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph
O'Rourke
|
Vertex-Unfoldings of Simplicial Polyhedra
|
10 pages; 7 figures; 8 references
|
Discrete Geometry: In honor of W. Kuperberg's 60th birthday, Pure
and Appl. Math. 253, Marcel Dekker, pp. 215-228, 2003
| null |
Smith Tech. Rep. 071
|
cs.CG cs.DM
| null |
We present two algorithms for unfolding the surface of any polyhedron, all of
whose faces are triangles, to a nonoverlapping, connected planar layout. The
surface is cut only along polyhedron edges. The layout is connected, but it may
have a disconnected interior: the triangles are connected at vertices, but not
necessarily joined along edges.
|
[
{
"version": "v1",
"created": "Wed, 18 Jul 2001 12:35:53 GMT"
}
] | 2010-01-21T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Eppstein",
"David",
""
],
[
"Erickson",
"Jeff",
""
],
[
"Hart",
"George W.",
""
],
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.999233 |
1001.3171
|
Ali Parandehgheibi
|
Ali ParandehGheibi, Asuman Ozdaglar, Michelle Effros, Muriel Medard
|
Optimal Reverse Carpooling Over Wireless Networks - A Distributed
Optimization Approach
|
submitted to CISS 2010
| null | null | null |
cs.NI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We focus on a particular form of network coding, reverse carpooling, in a
wireless network where the potentially coded transmitted messages are to be
decoded immediately upon reception. The network is fixed and known, and the
system performance is measured in terms of the number of wireless broadcasts
required to meet multiple unicast demands. Motivated by the structure of the
coding scheme, we formulate the problem as a linear program by introducing a
flow variable for each triple of connected nodes. This allows us to have a
formulation polynomial in the number of nodes. Using dual decomposition and
projected subgradient method, we present a decentralized algorithm to obtain
optimal routing schemes in presence of coding opportunities. We show that the
primal sub-problem can be expressed as a shortest path problem on an
\emph{edge-graph}, and the proposed algorithm requires each node to exchange
information only with its neighbors.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2010 00:02:40 GMT"
}
] | 2010-01-20T00:00:00 |
[
[
"ParandehGheibi",
"Ali",
""
],
[
"Ozdaglar",
"Asuman",
""
],
[
"Effros",
"Michelle",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.970337 |
1001.3297
|
Ersen Ekrem
|
Ersen Ekrem and Sennur Ulukus
|
Gaussian MIMO Broadcast Channels with Common and Confidential Messages
|
Submitted to IEEE ISIT, 2010
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the two-user Gaussian multiple-input multiple-output (MIMO)
broadcast channel with common and confidential messages. In this channel, the
transmitter sends a common message to both users, and a confidential message to
each user which is kept perfectly secret from the other user. We obtain the
entire capacity region of this channel. We also explore the connections between
the capacity region we obtained for the Gaussian MIMO broadcast channel with
common and confidential messages and the capacity region of its
non-confidential counterpart, i.e., the Gaussian MIMO broadcast channel with
common and private messages, which is not known completely.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2010 14:47:44 GMT"
}
] | 2010-01-20T00:00:00 |
[
[
"Ekrem",
"Ersen",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.999475 |
1001.3332
|
Dror Rawitz
|
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
|
Minimum Vertex Cover in Rectangle Graphs
| null | null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the Vertex Cover problem in intersection graphs of axis-parallel
rectangles on the plane. We present two algorithms: The first is an EPTAS for
non-crossing rectangle families, rectangle families $\calR$ where $R_1
\setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$.
This algorithm extends to intersection graphs of pseudo-disks. The second
algorithm achieves a factor of $(1.5 + \varepsilon)$ in general rectangle
families, for any fixed $\varepsilon > 0$, and works also for the weighted
variant of the problem. Both algorithms exploit the plane properties of
axis-parallel rectangles in a non-trivial way.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2010 15:39:45 GMT"
}
] | 2010-01-20T00:00:00 |
[
[
"Bar-Yehuda",
"Reuven",
""
],
[
"Hermelin",
"Danny",
""
],
[
"Rawitz",
"Dror",
""
]
] |
new_dataset
| 0.998441 |
0809.5191
|
Fahad Syed Muhammad
|
Fahad Syed Muhammad (IETR), Jean-Yves Baudais (IETR),
Jean-Fran\c{c}ois H\'elard (IETR), Matthieu Crussi\`ere (IETR)
|
A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for
Power Line Communication
| null |
International Workshop on Signal Processing Advances in Wireless
Communications, Recife, Pernambuco : Brazil (2008)
|
10.1109/SPAWC.2008.4641669
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear precoded discrete multitone modulation (LP-DMT) system has been
already proved advantageous with adaptive resource allocation algorithm in a
power line communication (PLC) context. In this paper, we investigate the bit
and energy allocation algorithm of an adaptive LP-DMT system taking into
account the channel coding scheme. A coded adaptive LP-DMT system is presented
in the PLC context with a loading algorithm which ccommodates the channel
coding gains in bit and energy calculations. The performance of a concatenated
channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states
trellis code and an outer Reed-Solomon code, in combination with the roposed
algorithm is analyzed. Simulation results are presented for a fixed target bit
error rate in a multicarrier scenario under power spectral density constraint.
Using a multipath model of PLC channel, it is shown that the proposed coded
adaptive LP-DMT system performs better than classical coded discrete multitone.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2008 13:01:17 GMT"
}
] | 2010-01-19T00:00:00 |
[
[
"Muhammad",
"Fahad Syed",
"",
"IETR"
],
[
"Baudais",
"Jean-Yves",
"",
"IETR"
],
[
"Hélard",
"Jean-François",
"",
"IETR"
],
[
"Crussière",
"Matthieu",
"",
"IETR"
]
] |
new_dataset
| 0.955206 |
1001.2862
|
Emden R. Gansner
|
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
|
On Touching Triangle Graphs
|
13 pages, 9 figures, 19 references, 1 appendix
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of representing graphs by triangles
whose sides touch. As a simple necessary condition, we show that pairs of
vertices must have a small common neighborhood. On the positive side, we
present linear time algorithms for creating touching triangle representations
for outerplanar graphs, square grid graphs, and hexagonal grid graphs. We note
that this class of graphs is not closed under minors, making characterization
difficult. However, we present a complete characterization of the subclass of
biconnected graphs that can be represented as triangulations of some polygon.
|
[
{
"version": "v1",
"created": "Sun, 17 Jan 2010 01:01:29 GMT"
}
] | 2010-01-19T00:00:00 |
[
[
"Gansner",
"Emden R.",
""
],
[
"Hu",
"Yifan",
""
],
[
"Kobourov",
"Stephen G.",
""
]
] |
new_dataset
| 0.979864 |
0910.2603
|
Zhang Shengli
|
Shengli Zhang, Soung-Chang Liew
|
Physical layer network coding with multiple antennas
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The two-phase MIMO NC (network coding) scheme can be used to boost the
throughput in a two-way relay channel in which nodes are equipped with multiple
antennas. The obvious strategy is for the relay node to extract the individual
packets from the two end nodes and mix the two packets to form a network-coded
packet. In this paper, we propose a new scheme called MIMO PNC (physical
network coding), in which the relay extracts the summation and difference of
the two end packets and then converts them to the network-coded form. MIMO PNC
is a natural combination of the single-antenna PNC scheme and the linear MIMO
detection scheme. The advantages of MIMO PNC are many. First, it removes the
stringent carrier-phase requirement in single-antenna PNC. Second, it is linear
in complexity with respect to the constellation size and the number of
simultaneous data streams in MIMO. Simulation shows that MIMO PNC outperforms
the straightforward MIMO NC significantly under random Rayleigh fading channel.
Based on our analysis, we further conjecture that MIMO PNC outperforms MIMO NC
under all possible realizations of the channel.
|
[
{
"version": "v1",
"created": "Wed, 14 Oct 2009 12:48:22 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jan 2010 00:42:20 GMT"
}
] | 2010-01-18T00:00:00 |
[
[
"Zhang",
"Shengli",
""
],
[
"Liew",
"Soung-Chang",
""
]
] |
new_dataset
| 0.999569 |
1001.2603
|
Hongyi Yao
|
Hongyi Yao and Theodoros K. Dikaliotis and Sidharth Jaggi and Tracey
Ho
|
Multiple Access Network Information-flow And Correction codes
|
5 pages, 2 figures, submitted to ISIT2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The network communication scenario where one or more receivers request all
the information transmitted by different sources is considered. We introduce
distributed polynomial-time network codes in the presence of malicious nodes.
Our codes can achieve any point inside the rate region of multiple-source
multicast transmission scenarios both in the cases of coherent and non-coherent
network coding. For both cases the encoding and decoding algorithm runs in
poly(|E|)exp(s) time, where poly(|E|) is a polynomial function of the number of
edges |E| in the network and exp(s) is an exponential function of the number of
sources s. Our codes are fully distributed and different sources require no
knowledge of the data transmitted by their peers. Our codes are "end-to-end",
that is, all nodes apart from the sources and the receivers are oblivious to
the adversaries present in the network and simply implement random linear
network coding.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2010 02:53:14 GMT"
}
] | 2010-01-18T00:00:00 |
[
[
"Yao",
"Hongyi",
""
],
[
"Dikaliotis",
"Theodoros K.",
""
],
[
"Jaggi",
"Sidharth",
""
],
[
"Ho",
"Tracey",
""
]
] |
new_dataset
| 0.989038 |
1001.2623
|
Tetsuya Kojima
|
Tetsuya Kojima and Yoshiya Horii
|
A Steganography Based on CT-CDMA Communication Scheme Using Complete
Complementary Codes
|
5 pages, 7 figures, zipped file, submitted to ISIT2010 Conference
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It has been shown that complete complementary codes can be applied into some
communication systems like approximately synchronized CDMA systems because of
its good correlation properties. CT-CDMA is one of the communication systems
based on complete complementary codes. In this system, the information data of
the multiple users can be transmitted by using the same set of complementary
codes through a single frequency band. In this paper, we propose to apply
CT-CDMA systems into a kind of steganography. It is shown that a large amount
of secret data can be embedded in the stego image by the proposed method
through some numerical experiments using color images.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2010 06:53:41 GMT"
}
] | 2010-01-18T00:00:00 |
[
[
"Kojima",
"Tetsuya",
""
],
[
"Horii",
"Yoshiya",
""
]
] |
new_dataset
| 0.999649 |
1001.2326
|
Abhishek Parakh
|
Abhishek Parakh and Subhash Kak
|
A Distributed Data Storage Scheme for Sensor Networks
|
9 pages
|
Security and Privacy in Mobile Information and Communication
Systems. Volume 17, pages 14-22, LNICST, Springer, 2009
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a data storage scheme for sensor networks that achieves the
targets of encryption and distributed storage simultaneously. We partition the
data to be stored into numerous pieces such that at least a specific number of
them have to be brought together to recreate the data. The procedure for
creation of partitions does not use any encryption key and the pieces are
implicitly secure. These pieces are then distributed over random sensors for
storage. Capture or malfunction of one or more (less than a threshold number of
sensors) does not compromise the data. The scheme provides protection against
compromise of data in specific sensors due to physical capture or malfunction.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 22:42:16 GMT"
}
] | 2010-01-15T00:00:00 |
[
[
"Parakh",
"Abhishek",
""
],
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.993866 |
1001.2545
|
Mayank Bakshi
|
Mayank Bakshi, Sidharth Jaggi, Michelle Effros
|
Concatenated Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes have attracted much recent attention as the first codes with low
computational complexity that provably achieve optimal rate-regions for a large
class of information-theoretic problems. One significant drawback, however, is
that for current constructions the probability of error decays
sub-exponentially in the block-length (more detailed designs improve the
probability of error at the cost of significantly increased computational
complexity \cite{KorUS09}). In this work we show how the the classical idea of
code concatenation -- using "short" polar codes as inner codes and a
"high-rate" Reed-Solomon code as the outer code -- results in substantially
improved performance. In particular, code concatenation with a careful choice
of parameters boosts the rate of decay of the probability of error to almost
exponential in the block-length with essentially no loss in computational
complexity. We demonstrate such performance improvements for three sets of
information-theoretic problems -- a classical point-to-point channel coding
problem, a class of multiple-input multiple output channel coding problems, and
some network source coding problems.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2010 20:00:30 GMT"
}
] | 2010-01-15T00:00:00 |
[
[
"Bakshi",
"Mayank",
""
],
[
"Jaggi",
"Sidharth",
""
],
[
"Effros",
"Michelle",
""
]
] |
new_dataset
| 0.998912 |
1001.2554
|
Elodie Leducq
|
Elodie Leducq (IMJ)
|
A new proof of Delsarte, Goethals and Mac Williams theorem on minimal
weight codewords of generalized Reed-Muller code
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal
weight codewords of generalized Reed-Muller codes published in 1970. To prove
this theorem, we consider intersection of support of minimal weight codewords
with affine hyperplanes and we proceed by recursion.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2010 20:41:59 GMT"
}
] | 2010-01-15T00:00:00 |
[
[
"Leducq",
"Elodie",
"",
"IMJ"
]
] |
new_dataset
| 0.99934 |
1001.2052
|
Andrew Drucker
|
Andrew Drucker
|
Block Sensitivity of Minterm-Transitive Functions
|
10 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Boolean functions with symmetry properties are interesting from a complexity
theory perspective; extensive research has shown that these functions, if
nonconstant, must have high `complexity' according to various measures.
In recent work of this type, Sun gave bounds on the block sensitivity of
nonconstant Boolean functions invariant under a transitive permutation group.
Sun showed that all such functions satisfy bs(f) = Omega(N^{1/3}), and that
there exists such a function for which bs(f) = O(N^{3/7}ln N). His example
function belongs to a subclass of transitively invariant functions called the
minterm-transitive functions (defined in earlier work by Chakraborty).
We extend these results in two ways. First, we show that nonconstant
minterm-transitive functions satisfy bs(f) = Omega(N^{3/7}). Thus Sun's example
function has nearly minimal block sensitivity for this subclass. Second, we
give an improved example: a minterm-transitive function for which bs(f) =
O(N^{3/7}ln^{1/7}N).
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 20:29:28 GMT"
}
] | 2010-01-14T00:00:00 |
[
[
"Drucker",
"Andrew",
""
]
] |
new_dataset
| 0.986277 |
1001.2253
|
Rdv Ijcsis
|
Theerayut Jamjaem, Bancha Burapattanasiri
|
High Precision HalfWave Rectifier Circuit In Dual Phase Output Mode
|
4 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 149-152, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper present high precision halfwave rectifier circuit in dual phase
output mode by 0.5 micrometer CMOS technology, plus or minus 1.5 V low voltage,
it has received input signal and sent output current signal, respond in high
frequency. The main structure compound with CMOS inverter circuit, common
source circuit, and current mirror circuit. Simulation and confirmation quality
of working by PSpice program, then it able to operating at maximum frequency
about 100 MHz, maximum input current range about 400 \mu Ap p, high precision
output signal, low power dissipation, and uses a little transistor.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 18:19:14 GMT"
}
] | 2010-01-14T00:00:00 |
[
[
"Jamjaem",
"Theerayut",
""
],
[
"Burapattanasiri",
"Bancha",
""
]
] |
new_dataset
| 0.999179 |
1001.2261
|
Rdv Ijcsis
|
Bancha Burapattanasiri
|
High Precision MultiWave Rectifier Circuit Operating in Low Voltage 1.5
Volt Current Mode
|
5 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 160-164, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article is present high precision multiwave rectifier circuit operating
in low voltage plus or minus 1.5 Volt current modes by CMOS technology 0.5
\mum, receive input and give output in current mode, respond at high frequency
period. The structure compound with high speed current comparator circuit,
current mirror circuit, and CMOS inverter circuit. PSpice program used for
confirmation the performance of testing. The PSpice program shows operating of
circuit is able to working at maximum input current 400 \muAp p, maximum
frequency responding 200 MHz, high precision and low power losses, and
non-precision zero crossing output signal.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 18:44:37 GMT"
}
] | 2010-01-14T00:00:00 |
[
[
"Burapattanasiri",
"Bancha",
""
]
] |
new_dataset
| 0.999623 |
1001.2263
|
Rdv Ijcsis
|
N. Kalyani, Dr K. V. N. Sunitha
|
Syllable Analysis to Build a Dictation System in Telugu language
|
6 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 171-176, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent decades, Speech interactive systems gained increasing importance.
To develop Dictation System like Dragon for Indian languages it is most
important to adapt the system to a speaker with minimum training. In this paper
we focus on the importance of creating speech database at syllable units and
identifying minimum text to be considered while training any speech recognition
system. There are systems developed for continuous speech recognition in
English and in few Indian languages like Hindi and Tamil. This paper gives the
statistical details of syllables in Telugu and its use in minimizing the search
space during recognition of speech. The minimum words that cover maximum
syllables are identified. This words list can be used for preparing a small
text which can be used for collecting speech sample while training the
dictation system. The results are plotted for frequency of syllables and the
number of syllables in each word. This approach is applied on the CIIL Mysore
text corpus which is of 3 million words.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 18:51:08 GMT"
}
] | 2010-01-14T00:00:00 |
[
[
"Kalyani",
"N.",
""
],
[
"Sunitha",
"Dr K. V. N.",
""
]
] |
new_dataset
| 0.991457 |
1001.2264
|
Rdv Ijcsis
|
Bancha Burapattanasiri
|
Sinusoidal Frequency Doublers Circuit With Low Voltage 1.5 Volt CMOS
Inverter
|
4 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 177-180, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is present sinusoidal frequency doublers circuit with low voltage
1.5 volt CMOS inverter. Main structure of circuit has three parts that is CMOS
inverter circuit, differential amplifier circuit, and square root circuit. This
circuit has designed to receive input voltage and give output voltage use few
MOS transistor, easy to understand, non complex of circuit, high precision, low
error and low power. The Simulation of circuit has MOS transistor functional in
active and saturation period. PSpice programmed has used to confirmation of
testing and simulation.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2010 18:54:10 GMT"
}
] | 2010-01-14T00:00:00 |
[
[
"Burapattanasiri",
"Bancha",
""
]
] |
new_dataset
| 0.999798 |
1001.1806
|
Mitsuru Hamada
|
Mitsuru Hamada
|
An Exposition of a Result in "Conjugate Codes for Secure and Reliable
Information Transmission"
|
11 pages, 1 figure. An exposition of a result presented in an invited
talk in ITW 2006, Chengdu, China
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An elementary proof of the attainability of random coding exponent with
linear codes for additive channels is presented. The result and proof are from
Hamada (Proc. ITW, Chendu, China, 2006), and the present material explains the
proof in detail for those unfamiliar with elementary calculations on
probabilities related to linear codes.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2010 13:45:20 GMT"
}
] | 2010-01-13T00:00:00 |
[
[
"Hamada",
"Mitsuru",
""
]
] |
new_dataset
| 0.999001 |
1001.1975
|
Rdv Ijcsis
|
V. Ruckmani, Dr G Sudha Sadasivam
|
A Novel Trigon based Dual Authentication Protocol for Enhancing Security
in Grid Environment
|
9 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 064-072, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent times, a necessity has been raised in order to distribute computing
applications often across grids. These applications are dependent on the
services like data transfer or data portal services as well as submission of
jobs. Security is of utmost importance in grid computing applications as grid
resources are heterogeneous, dynamic, and multidomain. Authentication remains
as the significant security challenge in grid environment. In traditional
authentication protocol a single server stores the sensitive user credentials,
like username and password. When such a server is compromised, a large number
of user passwords, will be exposed. Our proposed approach uses a dual
authentication protocol in order to improve the authentication service in grid
environment. The protocol utilizes the fundamental concepts of trigon and based
on the parameters of the trigon the user authentication will be performed. In
the proposed protocol, the password is interpreted and alienated into more than
one unit and these units are stored in two different servers, namely,
Authentication Server and Backend Server. Only when the combined authentication
scheme from both the servers authenticates the user, the privilege of accessing
the requested resources is obtained by the user. The main advantage of
utilizing the dual authentication protocol in grid computing is that an
adversary user cannot attain the access privilege by compromising a single
consolidated server because of the fact that the split password is stored in
different servers.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2010 18:37:37 GMT"
}
] | 2010-01-13T00:00:00 |
[
[
"Ruckmani",
"V.",
""
],
[
"Sadasivam",
"Dr G Sudha",
""
]
] |
new_dataset
| 0.999093 |
1001.1993
|
Rdv Ijcsis
|
O. B. Longe, V. Mbarika, M. Kourouma, F. Wada, R. Isabalija
|
Seeing Beyond the Surface, Understanding and Tracking Fraudulent Cyber
Activities
|
12 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS December 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 124-135, December 2009, USA
| null |
Volume 6, No. 3, ISSN 1947 5500
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The malaise of electronic spam mail that solicit illicit partnership using
bogus business proposals (popularly called 419 mails) remained unabated on the
internet despite concerted efforts. In addition to these are the emergence and
prevalence of phishing scams that use social engineering tactics to obtain
online access codes such as credit card number, ATM pin numbers, bank account
details, social security number and other personal information (22). In an age
where dependence on electronic transaction is on the increase, the web security
community will have to devise more pragmatic measures to make the cyberspace
safe from these demeaning ills. Understanding the perpetrators of internet
crimes and their mode of operation is a basis for any meaningful effort towards
stemming these crimes. This paper discusses the nature of the criminals engaged
in fraudulent cyberspace activities with special emphasis on the Nigeria 419
scam mails. Based on a qualitative analysis and experiments to trace the source
of electronic spam and phishing emails received over a six months period, we
provide information about the scammers personalities, motivation, methodologies
and victims. We posited that popular email clients are deficient in the
provision of effective mechanisms that can aid users in identifying fraud mails
and protect them against phishing attacks. We demonstrate, using state of the
art techniques, how users can detect and avoid fraudulent emails and conclude
by making appropriate recommendations based on our findings.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2010 19:49:38 GMT"
}
] | 2010-01-13T00:00:00 |
[
[
"Longe",
"O. B.",
""
],
[
"Mbarika",
"V.",
""
],
[
"Kourouma",
"M.",
""
],
[
"Wada",
"F.",
""
],
[
"Isabalija",
"R.",
""
]
] |
new_dataset
| 0.96132 |
1001.1705
|
Jens Zumbr\"agel
|
Jens Zumbragel, Mark F. Flanagan, and Vitaly Skachek
|
On the Pseudocodeword Redundancy
|
5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the AWGNC, BSC, and max-fractional pseudocodeword redundancy of a
code as the smallest number of rows in a parity-check matrix such that the
corresponding minimum pseudoweight is equal to the minimum Hamming distance. We
show that most codes do not have a finite pseudocodeword redundancy. We also
provide bounds on the pseudocodeword redundancy for some families of codes,
including codes based on designs.
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2010 17:19:48 GMT"
}
] | 2010-01-12T00:00:00 |
[
[
"Zumbragel",
"Jens",
""
],
[
"Flanagan",
"Mark F.",
""
],
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.99198 |
1001.1232
|
Laura Anna Ripamonti
|
Laura A. Ripamonti
|
Il rapporto tra ICT e PMI italiane e le problematiche
economico-organizzative dell'OS
|
59 pages, project technical report, in Italian
| null | null |
RT 16-07
|
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This technical report summarizes the preliminary findings of a project that
has been developed in 2007 by an Italian company (Datanet, based in Siracusa,
Italy) togheter with two Italian research institutions: Universita' degli Studi
di Milano and Universita' Bocconi. The main aim of the OS4E (Open Source for
Enterprises) project, has been to investigate if and how open source solutions
could be profitabily and effectively exploited by an IT company based in the
South of Italy, whose core business is IT systems integration and which
operates in the market of Italian SMEs (Small and Medium Enterprises). Beside
this goal, the project also aimed at developing effective tools and
methodologies to support decision making processes while evaluating different
alternative software applications based on OSS (open source software).
|
[
{
"version": "v1",
"created": "Fri, 8 Jan 2010 09:44:13 GMT"
}
] | 2010-01-11T00:00:00 |
[
[
"Ripamonti",
"Laura A.",
""
]
] |
new_dataset
| 0.998874 |
0707.0808
|
Patrick C. McGuire
|
Alexandra Bartolo, Patrick C. McGuire, Kenneth P. Camilleri,
Christopher Spiteri, Jonathan C. Borg, Philip J. Farrugia, Jens Ormo, Javier
Gomez-Elvira, Jose Antonio Rodriguez-Manfredi, Enrique Diaz-Martinez, Helge
Ritter, Robert Haschke, Markus Oesker, Joerg Ontrup
|
The Cyborg Astrobiologist: Porting from a wearable computer to the
Astrobiology Phone-cam
|
15 pages, 4 figures, accepted for publication in the International
Journal of Astrobiology
|
International Journal of Astrobiology, vol. 6, issue 4, pp.
255-261 (2007)
|
10.1017/S1473550407003862
| null |
cs.CV astro-ph cs.AI cs.CE cs.HC cs.NI cs.RO cs.SE
| null |
We have used a simple camera phone to significantly improve an `exploration
system' for astrobiology and geology. This camera phone will make it much
easier to develop and test computer-vision algorithms for future planetary
exploration. We envision that the `Astrobiology Phone-cam' exploration system
can be fruitfully used in other problem domains as well.
|
[
{
"version": "v1",
"created": "Thu, 5 Jul 2007 15:19:37 GMT"
}
] | 2010-01-08T00:00:00 |
[
[
"Bartolo",
"Alexandra",
""
],
[
"McGuire",
"Patrick C.",
""
],
[
"Camilleri",
"Kenneth P.",
""
],
[
"Spiteri",
"Christopher",
""
],
[
"Borg",
"Jonathan C.",
""
],
[
"Farrugia",
"Philip J.",
""
],
[
"Ormo",
"Jens",
""
],
[
"Gomez-Elvira",
"Javier",
""
],
[
"Rodriguez-Manfredi",
"Jose Antonio",
""
],
[
"Diaz-Martinez",
"Enrique",
""
],
[
"Ritter",
"Helge",
""
],
[
"Haschke",
"Robert",
""
],
[
"Oesker",
"Markus",
""
],
[
"Ontrup",
"Joerg",
""
]
] |
new_dataset
| 0.989661 |
0910.5454
|
Patrick C. McGuire
|
P.C. McGuire, C. Gross, L. Wendt, A. Bonnici, V. Souza-Egipsy, J.
Ormo, E. Diaz-Martinez, B.H. Foing, R. Bose, S. Walter, M. Oesker, J. Ontrup,
R. Haschke, H. Ritter
|
The Cyborg Astrobiologist: Testing a Novelty-Detection Algorithm on Two
Mobile Exploration Systems at Rivas Vaciamadrid in Spain and at the Mars
Desert Research Station in Utah
|
28 pages, 12 figures, accepted for publication in the International
Journal of Astrobiology
|
International Journal of Astrobiology, Vol. 9, pp. 11-27 (2010).
|
10.1017/S1473550409990358
| null |
cs.CV astro-ph.EP astro-ph.IM cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(ABRIDGED) In previous work, two platforms have been developed for testing
computer-vision algorithms for robotic planetary exploration (McGuire et al.
2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been
tested at geological and astrobiological field sites in Spain (Rivas
Vaciamadrid and Riba de Santiuste), and the phone-camera has been tested at a
geological field site in Malta. In this work, we (i) apply a Hopfield
neural-network algorithm for novelty detection based upon color, (ii) integrate
a field-capable digital microscope on the wearable computer platform, (iii)
test this novelty detection with the digital microscope at Rivas Vaciamadrid,
(iv) develop a Bluetooth communication mode for the phone-camera platform, in
order to allow access to a mobile processing computer at the field sites, and
(v) test the novelty detection on the Bluetooth-enabled phone-camera connected
to a netbook computer at the Mars Desert Research Station in Utah. This systems
engineering and field testing have together allowed us to develop a real-time
computer-vision system that is capable, for example, of identifying lichens as
novel within a series of images acquired in semi-arid desert environments. We
acquired sequences of images of geologic outcrops in Utah and Spain consisting
of various rock types and colors to test this algorithm. The algorithm robustly
recognized previously-observed units by their color, while requiring only a
single image or a few images to learn colors as familiar, demonstrating its
fast learning capability.
|
[
{
"version": "v1",
"created": "Wed, 28 Oct 2009 18:26:39 GMT"
}
] | 2010-01-08T00:00:00 |
[
[
"McGuire",
"P. C.",
""
],
[
"Gross",
"C.",
""
],
[
"Wendt",
"L.",
""
],
[
"Bonnici",
"A.",
""
],
[
"Souza-Egipsy",
"V.",
""
],
[
"Ormo",
"J.",
""
],
[
"Diaz-Martinez",
"E.",
""
],
[
"Foing",
"B. H.",
""
],
[
"Bose",
"R.",
""
],
[
"Walter",
"S.",
""
],
[
"Oesker",
"M.",
""
],
[
"Ontrup",
"J.",
""
],
[
"Haschke",
"R.",
""
],
[
"Ritter",
"H.",
""
]
] |
new_dataset
| 0.998486 |
1001.0415
|
Deepak Ponvel Chermakani Mr
|
Deepak Ponvel Chermakani
|
A new Rational Generating Function for the Frobenius Coin Problem
|
2 pages, 1 Theorem, I have now enhanced the explanation for Theorem-1
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important question arising from the Frobenius Coin Problem is to decide
whether or not a given monetary sum S can be obtained from N coin
denominations. We develop a new Generating Function G(x), where the coefficient
of x^i is equal to the number of ways in which coins from the given
denominations can be arranged as a stack whose total monetary worth is i. We
show that the Recurrence Relation for obtaining G(x), is linear, enabling G(x)
to be expressed as a rational function, that is, G(x) = P(x)/Q(x), where both
P(x) and Q(x) are Polynomials whose degrees are bounded by the largest coin
denomination.
|
[
{
"version": "v1",
"created": "Sun, 3 Jan 2010 23:03:02 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jan 2010 17:54:19 GMT"
}
] | 2010-01-08T00:00:00 |
[
[
"Chermakani",
"Deepak Ponvel",
""
]
] |
new_dataset
| 0.999505 |
1001.1022
|
Emil Vassev Dr.
|
Emil Vassev
|
LXG Compiler - Design and Implementation
|
37 pages, 2 figures, grammar in BNF
| null | null | null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LXG is a simple Pascal-like language. It is a functional programming language
developed for studying compiler design and implementation. The language
supports procedure and variable declarations, but no classes. This paper
reports the design and implementation of an LXG compiler. Test results are
presented as well.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2010 04:18:02 GMT"
}
] | 2010-01-08T00:00:00 |
[
[
"Vassev",
"Emil",
""
]
] |
new_dataset
| 0.999504 |
1001.0025
|
Panos Papadimitratos
|
P. Papadimitratos and A. Jovanovic
|
GNSS-based positioning: Attacks and Countermeasures
| null |
IEEE MILCOM, San Diego, CA, USA, November 2008
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasing numbers of mobile computing devices, user-portable, or embedded in
vehicles, cargo containers, or the physical space, need to be aware of their
location in order to provide a wide range of commercial services. Most often,
mobile devices obtain their own location with the help of Global Navigation
Satellite Systems (GNSS), integrating, for example, a Global Positioning System
(GPS) receiver. Nonetheless, an adversary can compromise location-aware
applications by attacking the GNSS-based positioning: It can forge navigation
messages and mislead the receiver into calculating a fake location. In this
paper, we analyze this vulnerability and propose and evaluate the effectiveness
of countermeasures. First, we consider replay attacks, which can be effective
even in the presence of future cryptographic GNSS protection mechanisms. Then,
we propose and analyze methods that allow GNSS receivers to detect the
reception of signals generated by an adversary, and then reject fake locations
calculated because of the attack. We consider three diverse defense mechanisms,
all based on knowledge, in particular, own location, time, and Doppler shift,
receivers can obtain prior to the onset of an attack. We find that inertial
mechanisms that estimate location can be defeated relatively easy. This is
equally true for the mechanism that relies on clock readings from off-the-shelf
devices; as a result, highly stable clocks could be needed. On the other hand,
our Doppler Shift Test can be effective without any specialized hardware, and
it can be applied to existing devices.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2009 22:13:59 GMT"
}
] | 2010-01-05T00:00:00 |
[
[
"Papadimitratos",
"P.",
""
],
[
"Jovanovic",
"A.",
""
]
] |
new_dataset
| 0.973516 |
1001.0167
|
Yunnan Wu
|
Yunnan Wu and Anxiao Jiang
|
Position Modulation Code for Rewriting Write-Once Memories
|
Submitted to IEEE Transactions on Information Theory on Sept. 23,
2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A write-once memory (wom) is a storage medium formed by a number of
``write-once'' bit positions (wits), where each wit initially is in a `0' state
and can be changed to a `1' state irreversibly. Examples of write-once memories
include SLC flash memories and optical disks. This paper presents a low
complexity coding scheme for rewriting such write-once memories, which is
applicable to general problem configurations. The proposed scheme is called the
\emph{position modulation code}, as it uses the positions of the zero symbols
to encode some information. The proposed technique can achieve code rates
higher than state-of-the-art practical solutions for some configurations. For
instance, there is a position modulation code that can write 56 bits 10 times
on 278 wits, achieving rate 2.01. In addition, the position modulation code is
shown to achieve a rate at least half of the optimal rate.
|
[
{
"version": "v1",
"created": "Thu, 31 Dec 2009 18:33:24 GMT"
}
] | 2010-01-05T00:00:00 |
[
[
"Wu",
"Yunnan",
""
],
[
"Jiang",
"Anxiao",
""
]
] |
new_dataset
| 0.999056 |
1001.0196
|
Edward Walker
|
Edward Walker
|
A distributed file system for a wide-area high performance computing
infrastructure
|
6 pages, Proceedings of Third USENIX Workshop on Real, Large
Distributed Systems, Seattle, Nov 2006
| null | null | null |
cs.DC cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe our work in implementing a wide-area distributed file system for
the NSF TeraGrid. The system, called XUFS, allows private distributed name
spaces to be created for transparent access to personal files across over 9000
computer nodes. XUFS builds on many principles from prior distributed file
systems research, but extends key design goals to support the workflow of
computational science researchers. Specifically, XUFS supports file access from
the desktop to the wide-area network seamlessly, survives transient
disconnected operations robustly, and demonstrates comparable or better
throughput than some current high performance file systems on the wide-area
network.
|
[
{
"version": "v1",
"created": "Fri, 1 Jan 2010 00:34:59 GMT"
}
] | 2010-01-05T00:00:00 |
[
[
"Walker",
"Edward",
""
]
] |
new_dataset
| 0.967758 |
0812.5030
|
Gregory Price
|
Daniel Kane, Gregory N. Price, and Erik D. Demaine
|
A Pseudopolynomial Algorithm for Alexandrov's Theorem
|
25 pages; new Delaunay triangulation algorithm, minor other changes;
an abbreviated v2 was at WADS 2009
| null | null | null |
cs.CG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Alexandrov's Theorem states that every metric with the global topology and
local geometry required of a convex polyhedron is in fact the intrinsic metric
of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a
differential equation whose solution leads to the polyhedron corresponding to a
given metric. We describe an algorithm based on this differential equation to
compute the polyhedron to arbitrary precision given the metric, and prove a
pseudopolynomial bound on its running time. Along the way, we develop
pseudopolynomial algorithms for computing shortest paths and weighted Delaunay
triangulations on a polyhedral surface, even when the surface edges are not
shortest paths.
|
[
{
"version": "v1",
"created": "Tue, 30 Dec 2008 08:41:29 GMT"
},
{
"version": "v2",
"created": "Wed, 27 May 2009 03:04:09 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Jan 2010 02:43:09 GMT"
}
] | 2010-01-04T00:00:00 |
[
[
"Kane",
"Daniel",
""
],
[
"Price",
"Gregory N.",
""
],
[
"Demaine",
"Erik D.",
""
]
] |
new_dataset
| 0.978215 |
0904.1812
|
Wei Zhang
|
Wei Zhang, Tianyi Xu, and Xiang-Gen Xia
|
Two Designs of Space-Time Block Codes Achieving Full Diversity with
Partial Interference Cancellation Group Decoding
|
41 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A partial interference cancellation (PIC) group decoding based space-time
block code (STBC) design criterion was recently proposed by Guo and Xia, where
the decoding complexity and the code rate trade-off is dealt when the full
diversity is achieved. In this paper, two designs of STBC are proposed for any
number of transmit antennas that can obtain full diversity when a PIC group
decoding (with a particular grouping scheme) is applied at receiver. With the
PIC group decoding and an appropriate grouping scheme for the decoding, the
proposed STBC are shown to obtain the same diversity gain as the ML decoding,
but have a low decoding complexity. The first proposed STBC is designed with
multiple diagonal layers and it can obtain the full diversity for two-layer
design with the PIC group decoding and the rate is up to 2 symbols per channel
use. But with PIC-SIC group decoding, the first proposed STBC can obtain full
diversity for any number of layers and the rate can be full. The second
proposed STBC can obtain full diversity and a rate up to 9/4 with the PIC group
decoding. Some code design examples are given and simulation results show that
the newly proposed STBC can well address the rate-performance-complexity
tradeoff of the MIMO systems.
|
[
{
"version": "v1",
"created": "Sat, 11 Apr 2009 16:47:23 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Apr 2009 07:15:45 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Jan 2010 17:04:14 GMT"
}
] | 2010-01-04T00:00:00 |
[
[
"Zhang",
"Wei",
""
],
[
"Xu",
"Tianyi",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.993767 |
0912.5515
|
Emmanuel Polonowski
|
Emmanuel Polonowski
|
LoopW Technical Reference v0.3
| null | null | null |
TR-LACL-2009-8
|
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document describes the implementation in SML of the LoopW language, an
imperative language with higher-order procedural variables and non-local jumps
equiped with a program logic. It includes the user manual along with some
implementation notes and many examples of certified imperative programs. As a
concluding example, we show the certification of an imperative program encoding
shift/reset using callcc/throw and a global meta-continuation.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2009 18:58:19 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Jan 2010 20:29:50 GMT"
}
] | 2010-01-02T00:00:00 |
[
[
"Polonowski",
"Emmanuel",
""
]
] |
new_dataset
| 0.9985 |
0912.5269
|
Jatinder Singh
|
Aditya Dua, Dimitrios Tsamis, Nicholas Bambos and Jatinder Pal Singh
|
Dynamic Task Fetching Over Time Varying Wireless Channels for Mobile
Computing Applications
|
28 pages, 13 figures, 4 tables
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The processing, computation and memory requirements posed by emerging mobile
broadband services require adaptive memory management and prefetching
techniques at the mobile terminals for satisfactory application performance and
sustained device battery lifetime. In this work we investigate a scenario where
tasks with varied computational requirements are fetched by a mobile device
from a central server over an error prone wireless link. We examine the buffer
dynamics at the mobile terminal and the central server under varying wireless
channel connectivity and device memory congestion states as variable sizes
tasks are executed on the terminal. Our goal is to minimize the latency
experienced by these tasks while judiciously utilizing the device buffering
capability. We use a dynamic programming framework to model the optimal
prefetching policy. We further propose a) a prefetching algorithm Fetch-or- Not
(FON), which uses quasi-static assumption on system state to make prefetching
decisions, and b) a prefetching policy RFON, which uses randomized
approximation to the optimal solution thus obviating the need for dynamic
online optimization and substantially reducing the computational complexity.
Through performance evaluation under slow and fast fading scenarios we show
that proposed algorithms come close to performance of the optimal scheme.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 2009 07:21:50 GMT"
}
] | 2009-12-31T00:00:00 |
[
[
"Dua",
"Aditya",
""
],
[
"Tsamis",
"Dimitrios",
""
],
[
"Bambos",
"Nicholas",
""
],
[
"Singh",
"Jatinder Pal",
""
]
] |
new_dataset
| 0.984459 |
0912.5334
|
Riaz Shaikh
|
Riaz Ahmed Shaikh, Hassan Jameel, Brian J. d Auriol, Heejo Lee,
Sungyoung Lee and Young-Jae Song
|
Intrusion-aware Alert Validation Algorithm for Cooperative Distributed
Intrusion Detection Schemes of Wireless Sensor Networks
|
19 pages, 7 figures
|
Sensors 2009, vol. 9(8), pp. 5989-6007
|
10.3390/s90805989
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing anomaly and intrusion detection schemes of wireless sensor networks
have mainly focused on the detection of intrusions. Once the intrusion is
detected, an alerts or claims will be generated. However, any unidentified
malicious nodes in the network could send faulty anomaly and intrusion claims
about the legitimate nodes to the other nodes. Verifying the validity of such
claims is a critical and challenging issue that is not considered in the
existing cooperative-based distributed anomaly and intrusion detection schemes
of wireless sensor networks. In this paper, we propose a validation algorithm
that addresses this problem. This algorithm utilizes the concept of
intrusion-aware reliability that helps to provide adequate reliability at a
modest communication cost. In this paper, we also provide a security resiliency
analysis of the proposed intrusion-aware alert validation algorithm.
|
[
{
"version": "v1",
"created": "Tue, 29 Dec 2009 16:52:09 GMT"
}
] | 2009-12-31T00:00:00 |
[
[
"Shaikh",
"Riaz Ahmed",
""
],
[
"Jameel",
"Hassan",
""
],
[
"Auriol",
"Brian J. d",
""
],
[
"Lee",
"Heejo",
""
],
[
"Lee",
"Sungyoung",
""
],
[
"Song",
"Young-Jae",
""
]
] |
new_dataset
| 0.971496 |
0910.4613
|
Ruoheng Liu
|
Ruoheng Liu, Yingbin Liang and H. Vincent Poor
|
Fading Cognitive Multiple-Access Channels With Confidential Messages
|
Submitted to the IEEE Transactions on Information Theory, December
2009. The material in this paper was presented in part at the Forty-Seventh
Annual Allerton Conference on Communication, Control, and Computing,
September 30-October 2, 2009, Monticello, Illinois
| null | null | null |
cs.IT cs.CR math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The fading cognitive multiple-access channel with confidential messages
(CMAC-CM) is investigated, in which two users attempt to transmit common
information to a destination and user 1 also has confidential information
intended for the destination. User 1 views user 2 as an eavesdropper and wishes
to keep its confidential information as secret as possible from user 2. The
multiple-access channel (both the user-to-user channel and the
user-to-destination channel) is corrupted by multiplicative fading gain
coefficients in addition to additive white Gaussian noise. The channel state
information (CSI) is assumed to be known at both the users and the destination.
A parallel CMAC-CM with independent subchannels is first studied. The secrecy
capacity region of the parallel CMAC-CM is established, which yields the
secrecy capacity region of the parallel CMAC-CM with degraded subchannels.
Next, the secrecy capacity region is established for the parallel Gaussian
CMAC-CM, which is used to study the fading CMAC-CM. When both users know the
CSI, they can dynamically change their transmission powers with the channel
realization to achieve the optimal performance. The closed-form power
allocation function that achieves every boundary point of the secrecy capacity
region is derived.
|
[
{
"version": "v1",
"created": "Sat, 24 Oct 2009 02:43:30 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Dec 2009 20:55:37 GMT"
}
] | 2009-12-29T00:00:00 |
[
[
"Liu",
"Ruoheng",
""
],
[
"Liang",
"Yingbin",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.997982 |
0912.4878
|
Julien Cohen
|
Julien Cohen (LMI)
|
Typage fort et typage souple des collections topologiques et des
transformations
| null |
Journ\'ees francophones des langages applicatifs,
Sainte-Marie-de-R\'e : France (2004)
| null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Topological collections allow to consider uniformly many data structures in
programming languages and are handled by functions defined by pattern matching
called transformations. We present two type systems for languages with
topological collections and transformations. The first one is a strong type
system \`a la Hindley/Milner which can be entirely typed at compile time. The
second one is a mixed static and dynamic type system allowing to handle
heterogeneous collections, that is collections which contain values with
different types. In the two cases, automatic type inference is possible.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2009 15:27:50 GMT"
}
] | 2009-12-25T00:00:00 |
[
[
"Cohen",
"Julien",
"",
"LMI"
]
] |
new_dataset
| 0.997675 |
0912.4882
|
Alain Bonardi
|
Alain Bonardi (STMS), Francis Rousseaux (STMS, CRESTIC)
|
Interagir avec un contenu op\'eratique : le projet d'op\'era virtuel
interactif Virtualis
| null |
Revue d'Interaction Homme Machine 2, 1 (2001) /
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we present the interactive opera project on CD-ROM
Virtualis. This project includes a scientific dimension as well as artistic. It
gave us the opportunity to design a model of the opera performance using
formalisms from organization sciences. Moreover, our investigation on
interactions between a user and opera contents led us to use models of
relationships between entities based on physical forces, where the user is in a
way absent. We detail some aspects of a reading but also writing environment on
artistic complex contents between text, music and graphics.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2009 15:29:12 GMT"
}
] | 2009-12-25T00:00:00 |
[
[
"Bonardi",
"Alain",
"",
"STMS"
],
[
"Rousseaux",
"Francis",
"",
"STMS, CRESTIC"
]
] |
new_dataset
| 0.985419 |
0912.4324
|
William Jackson
|
Mano Yadav, Vinay Rishiwal, K. V. Arya
|
Routing in Wireless Adhoc Networks: A New Horizon
| null |
Journal of Computing, Volume 1, Issue 1, pp 204-208, December 2009
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A lot of work has been done on routing protocols for mobile ad hoc networks,
but still standardization of them requires some more issues less addressed by
the existing routing protocols. In this paper a new paradigm of maintaining
multiple connections in adhoc routing protocols has been highlighted which may
be crucial for efficient routing in mobile ad hoc networks. The problem of
multiple connections has been hardly worked on in adhoc networks. In this paper
the solution of route maintenance if nodes are maintaining multiple connections
has been proposed. This idea not only helps to solve the multiple connections
problem, but also take care of proper bandwidth distribution to different
connections as per different traffic types. Study has been incorporated on
existing AODV with changes. Simulation studies have been performed over packet
delivery ratio, throughput and message overheads. Results show that the
proposed solution for multiple connections is efficient and worth implementing
in existing as well as new protocols.
|
[
{
"version": "v1",
"created": "Tue, 22 Dec 2009 05:43:52 GMT"
}
] | 2009-12-23T00:00:00 |
[
[
"Yadav",
"Mano",
""
],
[
"Rishiwal",
"Vinay",
""
],
[
"Arya",
"K. V.",
""
]
] |
new_dataset
| 0.998287 |
0912.3957
|
William Jackson
|
Dhiren R. Patel, Sidheshwar A. Khuba
|
Realization of Semantic Atom Blog
| null |
Journal of Computing, Volume 1, Issue 1, pp 34-38, December 2009
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web blog is used as a collaborative platform to publish and share
information. The information accumulated in the blog intrinsically contains the
knowledge. The knowledge shared by the community of people has intangible value
proposition. The blog is viewed as a multimedia information resource available
on the Internet. In a blog, information in the form of text, image, audio and
video builds up exponentially. The multimedia information contained in an Atom
blog does not have the capability, which is required by the software processes
so that Atom blog content can be accessed, processed and reused over the
Internet. This shortcoming is addressed by exploring OWL knowledge modeling,
semantic annotation and semantic categorization techniques in an Atom blog
sphere. By adopting these techniques, futuristic Atom blogs can be created and
deployed over the Internet.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 02:13:10 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Patel",
"Dhiren R.",
""
],
[
"Khuba",
"Sidheshwar A.",
""
]
] |
new_dataset
| 0.959625 |
0912.3962
|
William Jackson
|
G. MadhusudhanaRao, B. V. SankerRam
|
Speed Control of Multi Level Inverter Designed DC Series Motor with
Neuro-Fuzzy Controllers
| null |
Journal of Computing, Volume 1, Issue 1, pp 179-186, December 2009
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the speed control of a DC series motor for an accurate
and high-speed performance. A neural network based controlling operation with
fuzzy modeling is suggested in this paper. The driver units of these machines
are designed with a Multi-level inverter operation and are controlled by a
common current control mechanism for an accurate and efficient driving
technique for DC series motor. The neuro-fuzzy logic control technique is
introduced to eliminate uncertainties in the plant parameters of the DC Series
motors, and also considered as potential candidate for different applications
to prove adequacy of the proposed control algorithm through simulations. The
simulation result with such an approach is made and observed efficient over
other controlling technique.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 02:30:06 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"MadhusudhanaRao",
"G.",
""
],
[
"SankerRam",
"B. V.",
""
]
] |
new_dataset
| 0.990112 |
0912.3964
|
William Jackson
|
P. Jagatheeswari, M. Rajaram
|
A Novel Channel Coding for Progressive Transmission of Medical Images
| null |
Journal of Computing, Volume 1, Issue 1, pp 57-60, December 2009
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel channel coding scheme for progressive transmission of large images is
proposed. The transmission time, low distortion reconstructed image and low
complexity are most concerned in this paper. In the case of medical data
transmission, it is vital to keep the distortion level under control as in most
of the cases certain clinically important regions have to be transmitted
without any visible error. The proposed system significantly reduces the
transmission time and error. The progressive transmission is based on the
process that the input image is decomposed into many subblocks each to be
coded, compressed, and transmitted individually. Therefore, firstly the image
is segmented into a number of subblocks and then the discrete wavelet transform
decomposes each subblock into different time-frequency components. Finally the
components are coded for error control and transmitted. The complete system is
coded in VHDL. In the proposed system, we choose a 3-level Haar wavelet
transform to perform the wavelet transform for each subblock. It is simple,
faster and easier to implement when compared with other transform method. The
channel coding used here is Hamming code which is a simpler and efficient
forward error control code.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 02:35:39 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Jagatheeswari",
"P.",
""
],
[
"Rajaram",
"M.",
""
]
] |
new_dataset
| 0.996225 |
0912.3971
|
William Jackson
|
S. Rodthong, B. Burapattanasiri
|
The Effected Oxide Capacitor in CMOS Structure of Integrated Circuit
Level 5 Micrometer Technology
| null |
Journal of Computing, Volume 1, Issue 1, pp 67-70, December 2009
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article is present the effected oxide capacitor in CMOS structure of
integrated circuit level 5 micrometer technology. It has designed and basic
structure of MOS diode. It establish with aluminum metallization layer by
sputtering method, oxide insulator layer mode from silicon dioxide, n+ and p+
semiconductor layer, it has high capacitance concentrate. From the MOS diode
structure silicon dioxide thickness 0.5 micrometer, it will get capacitance
between aluminum metal layer and p+ semiconductor at 28.62 pF, the capacitance
between aluminum metal layer and n+ semiconductor at 29.55 pF. In this article
establish second metal layer for measurement density values of first aluminum
metal layer with second aluminum metal layer, it has density values at 16 pF.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 03:43:40 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Rodthong",
"S.",
""
],
[
"Burapattanasiri",
"B.",
""
]
] |
new_dataset
| 0.998682 |
0912.3980
|
William Jackson
|
Jamal A. Hussein, Mumtaz A. AlMukhtar
|
Fair Exchange of Digital Signatures using RSA-based CEMBS and Offline
STTP
| null |
Journal of Computing, Volume 1, Issue 1, pp 87-91, December 2009
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the essential security services needed to safeguard online
transactions is fair exchange. In fair exchange protocols two parties can
exchange their signatures in a fair manner, so that either each party gain the
other's signature or no one obtain anything useful. This paper examines
security solutions for achieving fair exchange. It proposes new security
protocols based on the "Certified Encrypted Message Being Signature" (CEMBS) by
using RSA signature scheme. This protocol relies on the help of an "off-line
Semi-Trusted Third Party" (STTP) to achieve fairness. They provide with
confidential protection from the STTP for the exchanged items by limiting the
role and power of the STTP. Three different protocols have been proposed. In
the first protocol, the two main parties exchange their signatures on a common
message. In the second protocol, the signatures are exchanged on two different
messages. While in the third one, the exchange is between confidential data and
signature.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 05:15:22 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Hussein",
"Jamal A.",
""
],
[
"AlMukhtar",
"Mumtaz A.",
""
]
] |
new_dataset
| 0.998077 |
0912.4062
|
Emil Vassev Dr.
|
Emil Vassev
|
Process Description of COM Object Life Cycle
|
15 pages, 7 figures
| null | null | null |
cs.OS cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The objective of this article is to provide for the reader a basic
description of all the steps involved in the COM object life-cycle process. COM
is a software technology and process performer. The first section briefly
introduces the Component Object Model (COM), considering the process of the COM
object life cycle as the baseline of all COM issues. The second part describes
in detail the basic steps of the process - client request, server location,
object creation, interaction, and disconnection. A brief description is given
for the components involved in each step. Finally, the third section provides a
brief conclusion summarizing all the process steps.
|
[
{
"version": "v1",
"created": "Sun, 20 Dec 2009 23:49:25 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Vassev",
"Emil",
""
]
] |
new_dataset
| 0.994595 |
0912.4107
|
Axel Kohnert
|
Axel Kohnert
|
New [48,16,16] Optimal Linear Binary Block Code
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new [48,16,16] optimal linear binary block code is given. To get this code
a general construction is used which is also described in this paper. The
construction of this new code settles an conjecture mentioned in a 2008 paper
by Janosov et al. where the authors found an new optimal [47,15,16]-code, which
is relevant to the applied construction.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2009 09:08:39 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Kohnert",
"Axel",
""
]
] |
new_dataset
| 0.998624 |
0912.4141
|
Felix Moya-Anegon Dr
|
Borja Gonzalez-Pereira (1), Vicente Guerrero-Bote (1) and Felix
Moya-Anegon (2) ((1) University of Extremadura, Department of Information and
Communication, Scimago Group, Spain (2) CSIC, CCHS, IPP, Scimago Group Spain)
|
The SJR indicator: A new indicator of journals' scientific prestige
|
21 pages with graphs and tables
| null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an indicator of journals' scientific prestige, the SJR
indicator, for ranking scholarly journals based on citation weighting schemes
and eigenvector centrality to be used in complex and heterogeneous citation
networks such Scopus. Its computation methodology is described and the results
after implementing the indicator over Scopus 2007 dataset are compared to an
ad-hoc Journal Impact Factor both generally and inside specific scientific
areas. The results showed that SJR indicator and JIF distributions fitted well
to a power law distribution and that both metrics were strongly correlated,
although there were also major changes in rank. There was an observable general
trend that might indicate that SJR indicator values decreased certain JIF
values whose citedeness was greater than would correspond to their scientific
influence.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2009 11:32:08 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Gonzalez-Pereira",
"Borja",
""
],
[
"Guerrero-Bote",
"Vicente",
""
],
[
"Moya-Anegon",
"Felix",
""
]
] |
new_dataset
| 0.955151 |
0912.4184
|
Jianhua Zhao
|
Jianhua Zhao, Xuandong Li
|
Scope Logic: Extending Hoare Logic for Pointer Program Verification
| null | null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by/3.0/
|
This paper presents an extension to Hoare logic for pointer program
verification. First, the Logic for Partial Function (LPF) used by VDM is
extended to specify memory access using pointers and memory layout of composite
types. Then, the concepts of data-retrieve functions (DRF) and memory-scope
functions (MSF) are introduced in this paper. People can define DRFs to
retrieve abstract values from interconnected concrete data objects. The
definition of the corresponding MSF of a DRF can be derived syntactically from
the definition of the DRF. This MSF computes the set of memory units accessed
when the DRF retrieves an abstract value. This memory unit set is called the
memory scope of the abstract value. Finally, the proof rule of assignment
statements in Hoare's logic is modified to deal with pointers. The basic idea
is that a virtual value keeps unmodified as long as no memory unit in its scope
is over-written. Another proof rule is added for memory allocation statements.
The consequence rule and the rules for control-flow statements are slightly
modified. They are essentially same as their original version in Hoare logic.
An example is presented to show the efficacy of this logic. We also give some
heuristics on how to verify pointer programs.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2009 15:02:41 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Zhao",
"Jianhua",
""
],
[
"Li",
"Xuandong",
""
]
] |
new_dataset
| 0.954286 |
0912.4241
|
Oussama Hammami
|
Oussama Hammami, Christian Lathion, Emin Gabrielyan
|
Dynamic routing based on call quality
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The telephony over IP (ToIP) is becoming a new trend in technology widely
used nowadays in almost all business sectors. Its concepts rely on transiting
the telephone communications through the IP network. Today, this technology is
deployed increasingly what the cause of emergence of companies is offering this
service as Switzernet. For several highly demanded destinations, recently fake
vendors appeared in the market offering voice termination but providing only
false answer supervision. The answered signal is returned immediately and calls
are being charged without being connected. Different techniques are used to
keep the calling party on the line. One of these techniques is to play a record
of a ring back tone (while the call is already being charged). Another, more
sophisticated technique is to play a human voice randomly picked up from a set
of records containing contents similar to: hello, hello, I cannot hear you
Apart the fact that the fallaciously established calls are charged at rates of
real calls, such malicious routes seriously handicap the switching process. The
system does not detect a failure on signaling level and is unable to attempt
the call via backup routes, the call technically being already connected. Once
the call flow falls into such trap, the calls will continue being routed via
the fraudulent route until a manual intervention.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2009 19:30:04 GMT"
}
] | 2009-12-22T00:00:00 |
[
[
"Hammami",
"Oussama",
""
],
[
"Lathion",
"Christian",
""
],
[
"Gabrielyan",
"Emin",
""
]
] |
new_dataset
| 0.989836 |
0712.3964
|
Chengqing Li
|
Chengqing Li, Shujun Li, Guanrong Chen and Wolfgang A. Halang
|
Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic
Sequence
|
11 pages, 2 figures
| null |
10.1016/j.imavis.2008.09.004
| null |
cs.CR cs.MM
| null |
Recently, an image encryption scheme based on a compound chaotic sequence was
proposed. In this paper, the security of the scheme is studied and the
following problems are found: (1) a differential chosen-plaintext attack can
break the scheme with only three chosen plain-images; (2) there is a number of
weak keys and some equivalent keys for encryption; (3) the scheme is not
sensitive to the changes of plain-images; and (4) the compound chaotic sequence
does not work as a good random number resource.
|
[
{
"version": "v1",
"created": "Mon, 24 Dec 2007 04:02:35 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Dec 2007 06:08:43 GMT"
}
] | 2009-12-21T00:00:00 |
[
[
"Li",
"Chengqing",
""
],
[
"Li",
"Shujun",
""
],
[
"Chen",
"Guanrong",
""
],
[
"Halang",
"Wolfgang A.",
""
]
] |
new_dataset
| 0.997789 |
0907.4870
|
K. P. Naveen
|
K. P. Naveen and A. Kumar
|
Tunable locally-optimal geographical forwarding in wireless sensor
networks with sleep-wake cycling nodes
|
13 Pages, 6 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a wireless sensor network whose main function is to detect
certain infrequent alarm events, and to forward alarm packets to a base
station, using geographical forwarding. The nodes know their locations, and
they sleep-wake cycle, waking up periodically but not synchronously. In this
situation, when a node has a packet to forward to the sink, there is a
trade-off between how long this node waits for a suitable neighbor to wake up
and the progress the packet makes towards the sink once it is forwarded to this
neighbr. Hence, in choosing a relay node, we consider the problem of minimizing
average delay subject to a constraint on the average progress. By constraint
relaxation, involving a Lagrange multiplier, we formulate this next hop relay
selection problem as a Markov decision process (MDP). The exact optimal
solution (BF (Best Forward)) can be found, but is computationally intensive.
Next, we consider a mathematically simplified model for which the optimal
policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead
rule. Simulations show that SF is very close in performance to BF, even for
reasonably small node density. We then study the end-to-end performance of SF
in comparison with two extremal policies: Max Forward (MF), which makes the
maximum possible progress per hop and thus reduces network energy consumption,
and First Forward (FF), which forwards the packet to the first node to wake up,
and thus tends to make end-to-end forwarding delays small. We find that, with
appropriate choice of one hop average progress constraint, SF can be tuned to
provide a favorable trade-off between end-to-end packet delay and the number of
hops in the forwarding path.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2009 09:37:48 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Jul 2009 11:31:02 GMT"
},
{
"version": "v3",
"created": "Mon, 21 Dec 2009 08:45:37 GMT"
}
] | 2009-12-21T00:00:00 |
[
[
"Naveen",
"K. P.",
""
],
[
"Kumar",
"A.",
""
]
] |
new_dataset
| 0.962849 |
0912.3098
|
Loet Leydesdorff
|
Loet Leydesdorff and Alkim Almila Akdag Salah
|
Maps on the basis of the Arts & Humanities Citation Index: The journals
Leonardo and Art Journal versus "Digital Humanities" as a topic
| null | null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The possibilities of using the Arts & Humanities Citation Index (A&HCI) for
journal mapping have not been sufficiently recognized because of the absence of
a Journal Citations Report (JCR) for this database. A quasi-JCR for the A&HCI
(2008) was constructed from the data contained in the Web-of-Science and is
used for the evaluation of two journals as examples: Leonardo and Art Journal.
The maps on the basis of the aggregated journal-journal citations within this
domain can be compared with maps including references to journals in the
Science Citation Index and Social Science Citation Index. Art journals are
cited by (social) science journals more than by other art journals, but these
journals draw upon one another in terms of their own references. This cultural
impact in terms of being cited is not found when documents with a topic such as
"digital humanities" are analyzed. This community of practice functions more as
an intellectual organizer than a journal.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2009 10:53:03 GMT"
}
] | 2009-12-17T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Salah",
"Alkim Almila Akdag",
""
]
] |
new_dataset
| 0.977997 |
0912.2861
|
Artur Ventura
|
Artur Ventura
|
JSC : A JavaScript Object System
|
7 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The JSC language is a superset of JavaScript designed to ease the development
of large web applications. This language extends JavaScripts own object system
by isolating code in a class declaration, simplifying multiple inheritance and
using method implementation agreements.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2009 12:26:02 GMT"
}
] | 2009-12-16T00:00:00 |
[
[
"Ventura",
"Artur",
""
]
] |
new_dataset
| 0.999824 |
0805.2179
|
Gilles Champenois
|
Gilles Champenois
|
Mnesors for databases
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We add commutativity to axioms defining mnesors and substitute a bitrop for
the lattice. We show that it can be applied to relational database querying:
set union, intersection and selection are redifined only from the mnesor
addition and the granular multiplication. Union-compatibility is not required.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2008 22:01:31 GMT"
},
{
"version": "v2",
"created": "Wed, 21 May 2008 13:52:24 GMT"
},
{
"version": "v3",
"created": "Sun, 24 May 2009 17:22:02 GMT"
},
{
"version": "v4",
"created": "Tue, 15 Dec 2009 16:45:10 GMT"
}
] | 2009-12-15T00:00:00 |
[
[
"Champenois",
"Gilles",
""
]
] |
new_dataset
| 0.99285 |
0912.2381
|
Luis Nunez A
|
R. Camacho, R. Chacon, G. Diaz, C. Guada, V. Hamar, H. Hoeger, A.
Melfo, L. A. Nunez, Y. Perez, C. Quintero, M. Rosales, R. Torrens, the LAGO
Collaboration
|
LAGOVirtual: A Collaborative Environment for the Large Aperture GRB
Observatory
|
Second EELA-2 Conference Choroni, Venezuela, November 25th to 27th
2009
| null | null | null |
cs.CE astro-ph.HE astro-ph.IM hep-ex
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the LAGOVirtual Project: an ongoing project to develop platform to
collaborate in the Large Aperture GRB Observatory (LAGO). This continental-wide
observatory is devised to detect high energy (around 100 GeV) component of
Gamma Ray Bursts, by using the single particle technique in arrays of Water
Cherenkov Detectors (WCD) at high mountain sites (Chacaltaya, Bolivia, 5300 m
a.s.l., Pico Espejo, Venezuela, 4750 m a.s.l., Sierra Negra, Mexico, 4650 m
a.s.l). This platform will allow LAGO collaboration to share data, and computer
resources through its different sites. This environment has the possibility to
generate synthetic data by simulating the showers through AIRES application and
to store/preserve distributed data files collected by the WCD at the LAGO
sites. The present article concerns the implementation of a prototype of
LAGO-DR adapting DSpace, with a hierarchical structure (i.e. country,
institution, followed by collections that contain the metadata and data files),
for the captured/simulated data. This structure was generated by using the
community, sub-community, collection, item model; available at the DSpace
software. Each member institution-country of the project has the appropriate
permissions on the system to publish information (descriptive metadata and
associated data files). The platform can also associate multiple files to each
item of data (data from the instruments, graphics, postprocessed-data, etc.).
|
[
{
"version": "v1",
"created": "Sat, 12 Dec 2009 00:09:58 GMT"
}
] | 2009-12-15T00:00:00 |
[
[
"Camacho",
"R.",
""
],
[
"Chacon",
"R.",
""
],
[
"Diaz",
"G.",
""
],
[
"Guada",
"C.",
""
],
[
"Hamar",
"V.",
""
],
[
"Hoeger",
"H.",
""
],
[
"Melfo",
"A.",
""
],
[
"Nunez",
"L. A.",
""
],
[
"Perez",
"Y.",
""
],
[
"Quintero",
"C.",
""
],
[
"Rosales",
"M.",
""
],
[
"Torrens",
"R.",
""
],
[
"Collaboration",
"the LAGO",
""
]
] |
new_dataset
| 0.997597 |
0912.1901
|
EPTCS
|
Mathijs Schuts (Radboud University Nijmegen), Feng Zhu (Radboud
University Nijmegen), Faranak Heidarian (Radboud University Nijmegen), Frits
Vaandrager (Radboud University Nijmegen)
|
Modelling Clock Synchronization in the Chess gMAC WSN Protocol
| null |
EPTCS 13, 2009, pp. 41-54
|
10.4204/EPTCS.13.4
| null |
cs.LO cs.DC cs.FL cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a detailled timed automata model of the clock synchronization
algorithm that is currently being used in a wireless sensor network (WSN) that
has been developed by the Dutch company Chess. Using the Uppaal model checker,
we establish that in certain cases a static, fully synchronized network may
eventually become unsynchronized if the current algorithm is used, even in a
setting with infinitesimal clock drifts.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2009 12:25:59 GMT"
}
] | 2009-12-11T00:00:00 |
[
[
"Schuts",
"Mathijs",
"",
"Radboud University Nijmegen"
],
[
"Zhu",
"Feng",
"",
"Radboud\n University Nijmegen"
],
[
"Heidarian",
"Faranak",
"",
"Radboud University Nijmegen"
],
[
"Vaandrager",
"Frits",
"",
"Radboud University Nijmegen"
]
] |
new_dataset
| 0.989258 |
0912.2032
|
Luis Nunez A
|
Y. Briceno, H.Y. Contreras, L. A. Nunez, F. Salager-Meyer, A. Rojas,
R. Torrens
|
Institutional Repository saber.ula.ve: A testimonial perspective
|
7th International Conference on Open Access in Accra Ghana from 2nd
to 3rd November 2009
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe our decade-long experience of building and
operating one of the most active Institutional Repository in the world:
www.saber.ula.ve <http://www.saber.ula.ve> (University of the Andes,
Merida-Venezuela). In order to share our experience with other institutions, we
firstly explain the steps we followed to preserve and disseminate the
scientific production of the University of Los Andes' researchers. We then
present some recent quantitative results about our repository activities and we
outline some methodological guidelines that could be applied in order to
replicate similar experiences. These guidelines list the ingredients or
building blocks as well as the processes followed for developing and
maintaining the services of an Institutional Repository. These include
technological infrastructure; institutional policies on preservation,
publication and dissemination of knowledge; recommendations on incentives for
open access publication; the process of selection, testing and adaptation of
technological tools; the planning and organization of services, and the
dissemination and support within the scientific community that will eventually
lead to the adoption of the ideas that lie behind the open access movement. We
summarize the results obtained regarding the acceptance, adoption and use of
the technological tools used for the publication of our institution's
intellectual production, and we present the main obstacles encountered on the
way.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2009 19:55:09 GMT"
}
] | 2009-12-11T00:00:00 |
[
[
"Briceno",
"Y.",
""
],
[
"Contreras",
"H. Y.",
""
],
[
"Nunez",
"L. A.",
""
],
[
"Salager-Meyer",
"F.",
""
],
[
"Rojas",
"A.",
""
],
[
"Torrens",
"R.",
""
]
] |
new_dataset
| 0.998476 |
0912.1805
|
Vishal Goyal
|
Abdelkader Outtagarts and Olivier Martinot
|
iSSEE: IMS Sensors Search Engine Enabler for Sensors Mashups Convergent
Application
|
International Journal of Computer Science Issues, IJCSI Volume 6,
Issue 1, pp1-7, November 2009
|
A. Outtagarts and O. Martinot, "iSSEE: IMS Sensors Search Engine
Enabler for Sensors Mashups Convergent Application", International Journal of
Computer Science Issues, IJCSI, Volume 6, pp1-7, November 2009
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Integrating the sensing capabilities in Internet Protocol network will open
the opportunities to build a wide range of novel multimedia applications. The
problem when using sensors (e.g. temperature sensor, camera, audio, humidity,
etc.) connected to the network is to know dynamically at any time if they are
always connected or not, what type of data they can transmit and where they are
geographically located. This paper describes an application enabler: IMS Sensor
Search Engine Enabler (iSSEE), which allows IMS applications using sensors and
IMS based devices, to get information about the sensor availability, its
location and the type of the sensor. Using data collected by sensors and from
the web, mash-ups convergent applications use cases are proposed by combining
the contents from heterogeneous data.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2009 17:19:10 GMT"
}
] | 2009-12-10T00:00:00 |
[
[
"Outtagarts",
"Abdelkader",
""
],
[
"Martinot",
"Olivier",
""
]
] |
new_dataset
| 0.9924 |
0912.1810
|
Vishal Goyal
|
Nevin Vunka Jungum and Eric Laurent
|
Emotions in Pervasive Computing Environments
|
International Journal of Computer Science Issues, IJCSI Volume 6,
Issue 1, pp8-22, November 2009
|
N. Vunka Jungum and E. LAURENT, "Emotions in Pervasive Computing
Environments", International Journal of Computer Science Issues, IJCSI,
Volume 6, pp8-22, November 2009
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability of an intelligent environment to connect and adapt to real
internal sates, needs and behaviors' meaning of humans can be made possible by
considering users' emotional states as contextual parameters. In this paper, we
build on enactive psychology and investigate the incorporation of emotions in
pervasive systems. We define emotions, and discuss the coding of emotional
human markers by smart environments. In addition, we compare some existing
works and identify how emotions can be detected and modeled by a pervasive
system in order to enhance its service and response to users. Finally, we
analyze closely one XML-based language for representing and annotating emotions
known as EARL and raise two important issues which pertain to emotion
representation and modeling in XML-based languages.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2009 17:32:25 GMT"
}
] | 2009-12-10T00:00:00 |
[
[
"Jungum",
"Nevin Vunka",
""
],
[
"Laurent",
"Eric",
""
]
] |
new_dataset
| 0.97223 |
0912.1820
|
Vishal Goyal
|
Mirzanur Rahman, Sufal Das and Utpal Sharma
|
Parsing of part-of-speech tagged Assamese Texts
|
International Journal of Computer Science Issues, IJCSI Volume 6,
Issue 1, pp28-34, November 2009
|
M. Rahman, S. Das and U. Sharma, "Parsing of part-of-speech tagged
Assamese Texts", International Journal of Computer Science Issues, IJCSI,
Volume 6, Issue 1, pp28-34, November 2009
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A natural language (or ordinary language) is a language that is spoken,
written, or signed by humans for general-purpose communication, as
distinguished from formal languages (such as computer-programming languages or
the "languages" used in the study of formal logic). The computational
activities required for enabling a computer to carry out information processing
using natural language is called natural language processing. We have taken
Assamese language to check the grammars of the input sentence. Our aim is to
produce a technique to check the grammatical structures of the sentences in
Assamese text. We have made grammar rules by analyzing the structures of
Assamese sentences. Our parsing program finds the grammatical errors, if any,
in the Assamese sentence. If there is no error, the program will generate the
parse tree for the Assamese sentence
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2009 18:03:20 GMT"
}
] | 2009-12-10T00:00:00 |
[
[
"Rahman",
"Mirzanur",
""
],
[
"Das",
"Sufal",
""
],
[
"Sharma",
"Utpal",
""
]
] |
new_dataset
| 0.96674 |
0912.1832
|
Vishal Goyal
|
Dr.A. K. Ojha and K. K. Biswal
|
Lexicographic Multi-objective Geometric Programming Problems
|
International Journal of Computer Science Issues, IJCSI Volume 6,
Issue 2, pp20-24, November 2009
|
Dr.A. K. Ojha and K. K. Biswal, "Lexicographic Multi-objective
Geometric Programming Problems", International Journal of Computer Science
Issues, IJCSI, Volume 6, Issue 2, pp20-24, November 2009
| null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Geometric programming (GP) is a type of mathematical problem characterized
by objective and constraint functions that have a special form. Many methods
have been developed to solve large scale engineering design GP problems. In
this paper GP technique has been used to solve multi-objective GP problem as a
vector optimization problem. The duality theory for lexicographic geometric
programming has been developed to solve the problems with posynomial in
objectives and constraints.
|
[
{
"version": "v1",
"created": "Wed, 9 Dec 2009 18:46:01 GMT"
}
] | 2009-12-10T00:00:00 |
[
[
"Ojha",
"Dr. A. K.",
""
],
[
"Biswal",
"K. K.",
""
]
] |
new_dataset
| 0.985174 |
0912.0951
|
Rdv Ijcsis
|
Arash Habibi Lashkari, Samaneh Farmand, Dr. Omar Bin Zakaria, Dr.
Rosli Saleh
|
Shoulder Surfing attack in graphical password authentication
|
10 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS November 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 2, pp. 145-154, November 2009, USA
| null |
ISSN 1947 5500
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information and computer security is supported largely by passwords which are
the principle part of the authentication process. The most common computer
authentication method is to use alphanumerical username and password which has
significant drawbacks. To overcome the vulnerabilities of traditional methods,
visual or graphical password schemes have been developed as possible
alternative solutions to text based scheme. A potential drawback of graphical
password schemes is that they are more vulnerable to shoulder surfing than
conventional alphanumeric text passwords. When users input their passwords in a
public place, they may be at risk of attackers stealing their password. An
attacker can capture a password by direct observation or by recording the
individuals authentication session. This is referred to as shouldersurfing and
is a known risk, of special concern when authenticating in public places. In
this paper we will present a survey on graphical password schemes from 2005
till 2009 which are proposed to be resistant against shoulder surfing attacks.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2009 21:24:18 GMT"
}
] | 2009-12-08T00:00:00 |
[
[
"Lashkari",
"Arash Habibi",
""
],
[
"Farmand",
"Samaneh",
""
],
[
"Zakaria",
"Dr. Omar Bin",
""
],
[
"Saleh",
"Dr. Rosli",
""
]
] |
new_dataset
| 0.999322 |
0807.4618
|
Tobias Kuhn
|
Tobias Kuhn
|
AceWiki: A Natural and Expressive Semantic Wiki
|
To be published as: Proceedings of Semantic Web User Interaction at
CHI 2008: Exploring HCI Challenges, CEUR Workshop Proceedings
|
In Proceedings of the Fifth International Workshop on Semantic Web
User Interaction (SWUI 2008), CEUR Workshop Proceedings, Volume 543, 2009
| null | null |
cs.HC cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present AceWiki, a prototype of a new kind of semantic wiki using the
controlled natural language Attempto Controlled English (ACE) for representing
its content. ACE is a subset of English with a restricted grammar and a formal
semantics. The use of ACE has two important advantages over existing semantic
wikis. First, we can improve the usability and achieve a shallow learning
curve. Second, ACE is more expressive than the formal languages of existing
semantic wikis. Our evaluation shows that people who are not familiar with the
formal foundations of the Semantic Web are able to deal with AceWiki after a
very short learning phase and without the help of an expert.
|
[
{
"version": "v1",
"created": "Tue, 29 Jul 2008 09:54:44 GMT"
}
] | 2009-12-07T00:00:00 |
[
[
"Kuhn",
"Tobias",
""
]
] |
new_dataset
| 0.9988 |
0911.3292
|
Maurizio Serva
|
Filippo Petroni and Maurizio Serva
|
Automated words stability and languages phylogeny
|
XI International Conference "Cognitive Modeling in Linguistics-2009"
Constanca, Romania, September, 7-14, 2009
| null | null | null |
cs.CL physics.soc-ph q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea of measuring distance between languages seems to have its roots in
the work of the French explorer Dumont D'Urville (D'Urville 1832). He collected
comparative words lists of various languages during his voyages aboard the
Astrolabe from 1826 to1829 and, in his work about the geographical division of
the Pacific, he proposed a method to measure the degree of relation among
languages. The method used by modern glottochronology, developed by Morris
Swadesh in the 1950s (Swadesh 1952), measures distances from the percentage of
shared cognates, which are words with a common historical origin. Recently, we
proposed a new automated method which uses normalized Levenshtein distance
among words with the same meaning and averages on the words contained in a
list. Another classical problem in glottochronology is the study of the
stability of words corresponding to different meanings. Words, in fact, evolve
because of lexical changes, borrowings and replacement at a rate which is not
the same for all of them. The speed of lexical evolution is different for
different meanings and it is probably related to the frequency of use of the
associated words (Pagel et al. 2007). This problem is tackled here by an
automated methodology only based on normalized Levenshtein distance.
|
[
{
"version": "v1",
"created": "Tue, 17 Nov 2009 12:47:44 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Dec 2009 17:08:06 GMT"
}
] | 2009-12-07T00:00:00 |
[
[
"Petroni",
"Filippo",
""
],
[
"Serva",
"Maurizio",
""
]
] |
new_dataset
| 0.980626 |
0912.0602
|
Rdv Ijcsis
|
G.Ramesh, S.SundaraVadivelu
|
A Reliable and Fault Tolerant Routing for Optical WDM Networks
|
7 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS November 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 2, pp. 048-054, November 2009, USA
| null |
ISSN 1947 5500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In optical WDM networks, since each lightpath can carry a huge mount of
traffic, failures may seriously damage the end user applications. Hence fault
tolerance becomes an important issue on these networks. The light path which
carries traffic during normal operation is called as primary path. The traffic
is rerouted on a backup path in case of a failure. In this paper we propose to
design a reliable and fault tolerant routing algorithm for establishing primary
and backup paths. In order to establish the primary path, this algorithm uses
load balancing in which link cost metrics are estimated based on the current
load of the links. In backup path setup, the source calculates the blocking
probability through the received feedback from the destination by sending a
small fraction of probe packets along the existing paths. It then selects the
optimal light path with the lowest blocking probability. Based on the
simulation results, we show that the reliable and fault tolerant routing
algorithm reduces the blocking probability and latency while increasing the
throughput and channel utilization.
|
[
{
"version": "v1",
"created": "Thu, 3 Dec 2009 08:58:34 GMT"
}
] | 2009-12-04T00:00:00 |
[
[
"Ramesh",
"G.",
""
],
[
"SundaraVadivelu",
"S.",
""
]
] |
new_dataset
| 0.998597 |
0912.0226
|
Paul Bonsma
|
Paul Bonsma
|
Max-Leaves Spanning Tree is APX-hard for Cubic Graphs
| null | null | null | null |
cs.DM cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of finding a spanning tree with maximum number of
leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a
3/2-approximation algorithm when restricted to graphs where every vertex has
degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and
NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic
graphs. The APX-hardness of the related problem Minimum Connected Dominating
Set for cubic graphs follows.
|
[
{
"version": "v1",
"created": "Tue, 1 Dec 2009 18:26:53 GMT"
}
] | 2009-12-02T00:00:00 |
[
[
"Bonsma",
"Paul",
""
]
] |
new_dataset
| 0.994385 |
0911.5246
|
Ian Pratt-Hartmann
|
Ivo D\"untsch, Ian Pratt-Hartmann
|
Complex Algebras of Arithmetic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a
sequence of arithmetic and logical operations to be performed on sets of
natural numbers. Arithmetic circuits can also be viewed as the elements of the
smallest subalgebra of the complex algebra of the semiring of natural numbers.
In the present paper, we investigate the algebraic structure of complex
algebras of natural numbers, and make some observations regarding the
complexity of various theories of such algebras.
|
[
{
"version": "v1",
"created": "Fri, 27 Nov 2009 11:43:04 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Dec 2009 17:39:28 GMT"
}
] | 2009-12-01T00:00:00 |
[
[
"Düntsch",
"Ivo",
""
],
[
"Pratt-Hartmann",
"Ian",
""
]
] |
new_dataset
| 0.957475 |
0911.5378
|
Victor Odumuyiwa
|
Victor Odumuyiwa (LORIA)
|
De la recherche sociale d'information \`a la recherche collaborative
d'information
| null |
7\`eme colloque du chapitre fran\c{c}ais de l'ISKO, Lyon : France
(2009)
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we explain social information retrieval (SIR) and
collaborative information retrieval (CIR). We see SIR as a way of knowing who
to collaborate with in resolving an information problem while CIR entails the
process of mutual understanding and solving of an information problem among
collaborators. We are interested in the transition from SIR to CIR hence we
developed a communication model to facilitate knowledge sharing during CIR.
|
[
{
"version": "v1",
"created": "Sat, 28 Nov 2009 06:25:00 GMT"
}
] | 2009-12-01T00:00:00 |
[
[
"Odumuyiwa",
"Victor",
"",
"LORIA"
]
] |
new_dataset
| 0.993253 |
0911.5438
|
Jochen L. Leidner
|
Jochen L. Leidner and Gary Berosik
|
Building and Installing a Hadoop/MapReduce Cluster from Commodity
Components
|
Technical Report; 15 pages, 1 figure
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This tutorial presents a recipe for the construction of a compute cluster for
processing large volumes of data, using cheap, easily available personal
computer hardware (Intel/AMD based PCs) and freely available open source
software (Ubuntu Linux, Apache Hadoop).
|
[
{
"version": "v1",
"created": "Sat, 28 Nov 2009 23:50:28 GMT"
}
] | 2009-12-01T00:00:00 |
[
[
"Leidner",
"Jochen L.",
""
],
[
"Berosik",
"Gary",
""
]
] |
new_dataset
| 0.971298 |
0911.5444
|
EPTCS
|
Marco Carbone (IT University of Copenhagen), Joshua Guttman (Worcester
Polytechnic Institute)
|
Choreographies with Secure Boxes and Compromised Principals
| null |
EPTCS 12, 2009, pp. 1-15
|
10.4204/EPTCS.12.1
| null |
cs.CR cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We equip choreography-level session descriptions with a simple abstraction of
a security infrastructure. Message components may be enclosed within (possibly
nested) "boxes" annotated with the intended source and destination of those
components. The boxes are to be implemented with cryptography. Strand spaces
provide a semantics for these choreographies, in which some roles may be played
by compromised principals. A skeleton is a partially ordered structure
containing local behaviors (strands) executed by regular (non-compromised)
principals. A skeleton is realized if it contains enough regular strands so
that it could actually occur, in combination with any possible activity of
compromised principals. It is delivery guaranteed (DG) realized if, in
addition, every message transmitted to a regular participant is also delivered.
We define a novel transition system on skeletons, in which the steps add
regular strands. These steps solve tests, i.e. parts of the skeleton that could
not occur without additional regular behavior. We prove three main results
about the transition system. First, each minimal DG realized skeleton is
reachable, using the transition system, from any skeleton it embeds. Second, if
no step is possible from a skeleton A, then A is DG realized. Finally, if a DG
realized B is accessible from A, then B is minimal. Thus, the transition system
provides a systematic way to construct the possible behaviors of the
choreography, in the presence of compromised principals.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2009 00:20:33 GMT"
}
] | 2009-12-01T00:00:00 |
[
[
"Carbone",
"Marco",
"",
"IT University of Copenhagen"
],
[
"Guttman",
"Joshua",
"",
"Worcester\n Polytechnic Institute"
]
] |
new_dataset
| 0.999531 |
0906.5339
|
Salah A. Aly
|
Salah A. Aly
|
Asymmetric Quantum Cyclic Codes
| null | null | null | null |
cs.IT cs.MS math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is recently conjectured in quantum information processing that phase-shift
errors occur with high probability than qubit-flip errors, hence the former is
more disturbing to quantum information than the later one. This leads us to
construct asymmetric quantum error controlling codes to protect quantum
information over asymmetric channels, $\Pr Z \geq \Pr X$. In this paper we
present two generic methods to derive asymmetric quantum cyclic codes using the
generator polynomials and defining sets of classical cyclic codes.
Consequently, the methods allow us to construct several families of asymmetric
quantum BCH, RS, and RM codes. Finally, the methods are used to construct
families of asymmetric subsystem codes.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2009 19:37:12 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Nov 2009 03:03:56 GMT"
}
] | 2009-11-30T00:00:00 |
[
[
"Aly",
"Salah A.",
""
]
] |
new_dataset
| 0.999466 |
0911.4987
|
EPTCS
|
Rudolf Freund (Vienna University of Technology), Marian Kogler (Vienna
University of Technology)
|
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P
systems
| null |
EPTCS 11, 2009, pp. 123-135
|
10.4204/EPTCS.11.8
| null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The operations drip and mate considered in (mem)brane computing resemble the
operations cut and recombination well known from DNA computing. We here
consider sets of vesicles with multisets of objects on their outside membrane
interacting by drip and mate in two different setups: in test tube systems, the
vesicles may pass from one tube to another one provided they fulfill specific
constraints; in tissue-like P systems, the vesicles are immediately passed to
specified cells after having undergone a drip or mate operation. In both
variants, computational completeness can be obtained, yet with different
constraints for the drip and mate operations.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2009 00:33:04 GMT"
}
] | 2009-11-30T00:00:00 |
[
[
"Freund",
"Rudolf",
"",
"Vienna University of Technology"
],
[
"Kogler",
"Marian",
"",
"Vienna\n University of Technology"
]
] |
new_dataset
| 0.962233 |
0911.4989
|
EPTCS
|
G. Michele Pinna, Andrea Saba
|
Dependencies and Simultaneity in Membrane Systems
| null |
EPTCS 11, 2009, pp. 155-169
|
10.4204/EPTCS.11.10
| null |
cs.CE cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Membrane system computations proceed in a synchronous fashion: at each step
all the applicable rules are actually applied. Hence each step depends on the
previous one. This coarse view can be refined by looking at the dependencies
among rule occurrences, by recording, for an object, which was the a rule that
produced it and subsequently (in a later step), which was the a rule that
consumed it. In this paper we propose a way to look also at the other main
ingredient in membrane system computations, namely the simultaneity in the rule
applications. This is achieved using zero-safe nets that allows to synchronize
transitions, i.e., rule occurrences. Zero-safe nets can be unfolded into
occurrence nets in a classical way, and to this unfolding an event structure
can be associated. The capability of capturing simultaneity of zero-safe nets
is transferred on the level of event structure by adding a way to express which
events occur simultaneously.
|
[
{
"version": "v1",
"created": "Thu, 26 Nov 2009 00:39:34 GMT"
}
] | 2009-11-30T00:00:00 |
[
[
"Pinna",
"G. Michele",
""
],
[
"Saba",
"Andrea",
""
]
] |
new_dataset
| 0.989096 |
0911.5230
|
Yutaka Oiwa
|
Yutaka Oiwa, Hajime Watanabe, Hiromitsu Takagi
|
PAKE-based mutual HTTP authentication for preventing phishing attacks
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a new password-based mutual authentication protocol for
Web systems which prevents various kinds of phishing attacks. This protocol
provides a protection of user's passwords against any phishers even if
dictionary attack is employed, and prevents phishers from imitating a false
sense of successful authentication to users. The protocol is designed
considering interoperability with many recent Web applications which requires
many features which current HTTP authentication does not provide. The protocol
is proposed as an Internet Draft submitted to IETF, and implemented in both
server side (as an Apache extension) and client side (as a Mozilla-based
browser and an IE-based one). The paper also proposes a new user-interface for
this protocol which is always distinguishable from fake dialogs provided by
phishers.
|
[
{
"version": "v1",
"created": "Fri, 27 Nov 2009 10:09:39 GMT"
}
] | 2009-11-30T00:00:00 |
[
[
"Oiwa",
"Yutaka",
""
],
[
"Watanabe",
"Hajime",
""
],
[
"Takagi",
"Hiromitsu",
""
]
] |
new_dataset
| 0.993952 |
cs/0209015
|
C Sauerbier
|
C. Sauerbier
|
Does NP not equal P?
|
withdrawn. It was a rediculously absurd notion
| null | null | null |
cs.CC
| null |
Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then,
as is generally accepted, any polynomial solution of it must also present a
polynomial solution of all NP decision problems. It is here argued, however,
that NP is not of necessity equivalent to P where it is shown that SAT is
contained in P. This due to a paradox, of nature addressed by both Godel and
Russell, in regards to the P-NP system in total.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2002 16:08:21 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Sep 2002 04:34:02 GMT"
}
] | 2009-11-30T00:00:00 |
[
[
"Sauerbier",
"C.",
""
]
] |
new_dataset
| 0.992 |
0802.2594
|
Menelaos Karavelas
|
Menelaos I. Karavelas and Elias P. Tsigaridas
|
Guarding curvilinear art galleries with vertex or point guards
|
35 pages, 24 figures
|
Comput. Geom. Theory Appl. 42(6-7):522-535, 2009
|
10.1016/j.comgeo.2008.11.002
| null |
cs.CG
| null |
One of the earliest and most well known problems in computational geometry is
the so-called art gallery problem. The goal is to compute the minimum possible
number guards placed on the vertices of a simple polygon in such a way that
they cover the interior of the polygon.
In this paper we consider the problem of guarding an art gallery which is
modeled as a polygon with curvilinear walls. Our main focus is on polygons the
edges of which are convex arcs pointing towards the exterior or interior of the
polygon (but not both), named piecewise-convex and piecewise-concave polygons.
We prove that, in the case of piecewise-convex polygons, if we only allow
vertex guards, $\lfloor\frac{4n}{7}\rfloor-1$ guards are sometimes necessary,
and $\lfloor\frac{2n}{3}\rfloor$ guards are always sufficient. Moreover, an
$O(n\log{}n)$ time and O(n) space algorithm is described that produces a vertex
guarding set of size at most $\lfloor\frac{2n}{3}\rfloor$. When we allow point
guards the afore-mentioned lower bound drops down to
$\lfloor\frac{n}{2}\rfloor$. In the special case of monotone piecewise-convex
polygons we can show that $\lfloor\frac{n}{2}\rfloor$ vertex guards are always
sufficient and sometimes necessary; these bounds remain valid even if we allow
point guards.
In the case of piecewise-concave polygons, we show that $2n-4$ point guards
are always sufficient and sometimes necessary, whereas it might not be possible
to guard such polygons by vertex guards. We conclude with bounds for other
types of curvilinear polygons and future work.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2008 06:10:17 GMT"
}
] | 2009-11-25T00:00:00 |
[
[
"Karavelas",
"Menelaos I.",
""
],
[
"Tsigaridas",
"Elias P.",
""
]
] |
new_dataset
| 0.999591 |
0911.4530
|
Xiaohu Shang
|
Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor
|
MIMO Z-Interference Channels: Capacity Under Strong and Noisy
Interference
|
5 pages, presented at Asilomar 09
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity regions of multiple-input multiple-output Gaussian
Z-interference channels are established for the very strong interference and
aligned strong interference cases. The sum-rate capacity of such channels is
established under noisy interference. These results generalize known results
for scalar Gaussian Z-interference channels.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2009 02:49:56 GMT"
}
] | 2009-11-25T00:00:00 |
[
[
"Shang",
"Xiaohu",
""
],
[
"Chen",
"Biao",
""
],
[
"Kramer",
"Gerhard",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.994983 |
0911.4642
|
Isabel Rodet
|
Nicolas Castagn\'e (ACROE), Claude Cadoz (ACROE, ICA), Ali Allaoui
(ACROE, ICA), Olivier Michel Tache (ACROE)
|
G3 : GENESIS software envrionment update
| null |
International Computer Music Conference (ICMC), Montr\'eal :
Canada (2009)
| null | null |
cs.SD cs.HC cs.MM cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GENESIS3 is the new version of the GENESIS software environment for musical
creation by means of mass-interaction physics network modeling. It was
designed, and developed from scratch, in hindsight of more than 10 years
working on and using the previous version. We take the opportunity of this
birth to provide in this article (1) an analysis of the peculiarities in
GENESIS, aiming at highlighting its core ?software paradigm?; and (2) an update
on the features of the new version as compared to the last.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2009 15:07:37 GMT"
}
] | 2009-11-25T00:00:00 |
[
[
"Castagné",
"Nicolas",
"",
"ACROE"
],
[
"Cadoz",
"Claude",
"",
"ACROE, ICA"
],
[
"Allaoui",
"Ali",
"",
"ACROE, ICA"
],
[
"Tache",
"Olivier Michel",
"",
"ACROE"
]
] |
new_dataset
| 0.967322 |
0911.4167
|
Ertem Tuncel
|
Jayanth Nayak, Ertem Tuncel, and Deniz Gunduz
|
Wyner-Ziv Coding over Broadcast Channels: Digital Schemes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses lossy transmission of a common source over a broadcast
channel when there is correlated side information at the receivers, with
emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme
that combines ideas from the lossless version of the problem, i.e.,
Slepian-Wolf coding over broadcast channels, and dirty paper coding, is
presented and analyzed. This scheme uses layered coding where the common layer
information is intended for both receivers and the refinement information is
destined only for one receiver. For the quadratic Gaussian case, a quantity
characterizing the overall quality of each receiver is identified in terms of
channel and side information parameters. It is shown that it is more
advantageous to send the refinement information to the receiver with "better"
overall quality. In the case where all receivers have the same overall quality,
the presented scheme becomes optimal. Unlike its lossless counterpart, however,
the problem eludes a complete characterization.
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2009 08:20:59 GMT"
}
] | 2009-11-24T00:00:00 |
[
[
"Nayak",
"Jayanth",
""
],
[
"Tuncel",
"Ertem",
""
],
[
"Gunduz",
"Deniz",
""
]
] |
new_dataset
| 0.998229 |
0911.4202
|
Maxim Kolosovskiy
|
Maxim A. Kolosovskiy, Elena N. Kryuchkova (Altai State Technical
University, Russia)
|
Network congestion control using NetFlow
|
10 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of congestion control is to avoid congestion in network elements. A
network element is congested if it is being offered more traffic than it can
process. To detect such situations and to neutralize them we should monitor
traffic in the network. In this paper, we propose using Cisco's NetFlow
technology, which allows collecting statistics about traffic in the network by
generating special NetFlow packets. Cisco's routers can send NetFlow packets to
a special node, so we can collect these packets, analyze its content and detect
network congestion. We use Cisco's feature as example, some other vendors
(Juniper, 3COM, Alcatel, etc.) provide similar features for their routers. We
also consider a simple system, which collects statistical information about
network elements, determines overloaded elements and identifies flows, which
congest them.
|
[
{
"version": "v1",
"created": "Sat, 21 Nov 2009 20:59:27 GMT"
}
] | 2009-11-24T00:00:00 |
[
[
"Kolosovskiy",
"Maxim A.",
"",
"Altai State Technical\n University, Russia"
],
[
"Kryuchkova",
"Elena N.",
"",
"Altai State Technical\n University, Russia"
]
] |
new_dataset
| 0.984178 |
0911.4239
|
Chia-Mu Yu
|
Chia-Mu Yu, Chun-Shien Lu, and Sy-Yen Kuo
|
Constrained Function Based En-Route Filtering for Sensor Networks
|
26 pages, single column, extension from a preliminary version
appeared in IEEE WCNC 2009
| null | null | null |
cs.NI cs.CR cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensor networks are vulnerable to \emph{false data injection attack} and
\emph{path-based DoS} (PDoS) attack. While conventional authentication schemes
are insufficient for solving these security conflicts, an \emph{en-route
filtering} scheme acts as a defense against these two attacks. To construct an
efficient en-route filtering scheme, this paper first presents a Constrained
Function based message Authentication (CFA) scheme, which can be thought of as
a hash function directly supporting the en-route filtering functionality.
Together with the \emph{redundancy property} of sensor networks, which means
that an event can be simultaneously observed by multiple sensor nodes, the
devised CFA scheme is used to construct a CFA-based en-route filtering (CFAEF)
scheme. In contrast to most of the existing methods, which rely on complicated
security associations among sensor nodes, our design, which directly exploits
an en-route filtering hash function, appears to be novel. We examine the CFA
and CFAEF schemes from both the theoretical and numerical aspects to
demonstrate their efficiency and effectiveness.
|
[
{
"version": "v1",
"created": "Sun, 22 Nov 2009 08:56:07 GMT"
}
] | 2009-11-24T00:00:00 |
[
[
"Yu",
"Chia-Mu",
""
],
[
"Lu",
"Chun-Shien",
""
],
[
"Kuo",
"Sy-Yen",
""
]
] |
new_dataset
| 0.996935 |
0909.3127
|
Adrian Dumitrescu
|
Adrian Dumitrescu and Minghui Jiang
|
On the largest empty axis-parallel box amidst $n$ points
|
19 pages, 2 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give the first nontrivial upper and lower bounds on the maximum volume of
an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$
containing $n$ points. For a fixed $d$, we show that the maximum volume is of
the order $\Theta(\frac{1}{n})$. We then use the fact that the maximum volume
is $\Omega(\frac{1}{n})$ in our design of the first efficient
$(1-\eps)$-approximation algorithm for the following problem: Given an
axis-parallel $d$-dimensional box $R$ in $\RR^d$ containing $n$ points, compute
a maximum-volume empty axis-parallel $d$-dimensional box contained in $R$. The
running time of our algorithm is nearly linear in $n$, for small $d$, and
increases only by an $O(\log{n})$ factor when one goes up one dimension. No
previous efficient exact or approximation algorithms were known for this
problem for $d \geq 4$. As the problem has been recently shown to be NP-hard in
arbitrary high dimensions (i.e., when $d$ is part of the input), the existence
of efficient exact algorithms is unlikely.
We also obtain tight estimates on the maximum volume of an empty
axis-parallel hypercube inside an axis-parallel unit hypercube in $\RR^d$
containing $n$ points. For a fixed $d$, this maximum volume is of the same
order order $\Theta(\frac{1}{n})$. A faster $(1-\eps)$-approximation algorithm,
with a milder dependence on $d$ in the running time, is obtained in this case.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2009 23:37:56 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Nov 2009 20:42:35 GMT"
}
] | 2009-11-23T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Jiang",
"Minghui",
""
]
] |
new_dataset
| 0.984116 |
0911.3992
|
Eitan Yaakobi
|
Anxiao (Andrew) Jiang, Robert Mateescu, Eitan Yaakobi, Jehoshua Bruck,
Paul H. Siegel, Alexander Vardy, Jack K. Wolf
|
Storage Coding for Wear Leveling in Flash Memories
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Flash memory is a non-volatile computer memory comprised of blocks of cells,
wherein each cell is implemented as either NAND or NOR floating gate. NAND
flash is currently the most widely used type of flash memory. In a NAND flash
memory, every block of cells consists of numerous pages; rewriting even a
single page requires the whole block to be erased and reprogrammed. Block
erasures determine both the longevity and the efficiency of a flash memory.
Therefore, when data in a NAND flash memory are reorganized, minimizing the
total number of block erasures required to achieve the desired data movement is
an important goal. This leads to the flash data movement problem studied in
this paper. We show that coding can significantly reduce the number of block
erasures required for data movement, and present several optimal or nearly
optimal data-movement algorithms based upon ideas from coding theory and
combinatorics. In particular, we show that the sorting-based (non-coding)
schemes require at least O(nlogn) erasures to move data among n blocks, whereas
coding-based schemes require only O(n) erasures. Furthermore, coding-based
schemes use only one auxiliary block, which is the best possible, and achieve a
good balance between the number of erasures in each of the n+1 blocks.
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2009 09:01:26 GMT"
}
] | 2009-11-23T00:00:00 |
[
[
"Anxiao",
"",
"",
"Andrew"
],
[
"Jiang",
"",
""
],
[
"Mateescu",
"Robert",
""
],
[
"Yaakobi",
"Eitan",
""
],
[
"Bruck",
"Jehoshua",
""
],
[
"Siegel",
"Paul H.",
""
],
[
"Vardy",
"Alexander",
""
],
[
"Wolf",
"Jack K.",
""
]
] |
new_dataset
| 0.97388 |
0911.3643
|
Loet Leydesdorff
|
Iina Hellsten, Loet Leydesdorff, Paul Wouters
|
Multiple Presents: How Search Engines Re-write the Past
| null |
New Media & Society, 8(6) (2006), 901-924
| null | null |
cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet search engines function in a present which changes continuously. The
search engines update their indices regularly, overwriting Web pages with newer
ones, adding new pages to the index, and losing older ones. Some search engines
can be used to search for information at the internet for specific periods of
time. However, these 'date stamps' are not determined by the first occurrence
of the pages in the Web, but by the last date at which a page was updated or a
new page was added, and the search engine's crawler updated this change in the
database. This has major implications for the use of search engines in
scholarly research as well as theoretical implications for the conceptions of
time and temporality. We examine the interplay between the different updating
frequencies by using AltaVista and Google for searches at different moments of
time. Both the retrieval of the results and the structure of the retrieved
information erodes over time.
|
[
{
"version": "v1",
"created": "Wed, 18 Nov 2009 20:05:51 GMT"
}
] | 2009-11-19T00:00:00 |
[
[
"Hellsten",
"Iina",
""
],
[
"Leydesdorff",
"Loet",
""
],
[
"Wouters",
"Paul",
""
]
] |
new_dataset
| 0.999167 |
0808.0163
|
Daniel A. Spielman
|
Joshua Batson, Daniel A. Spielman, Nikhil Srivastava
|
Twice-Ramanujan Sparsifiers
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that every graph has a spectral sparsifier with a number of edges
linear in its number of vertices. As linear-sized spectral sparsifiers of
complete graphs are expanders, our sparsifiers of arbitrary graphs can be
viewed as generalizations of expander graphs.
In particular, we prove that for every $d>1$ and every undirected, weighted
graph $G=(V,E,w)$ on $n$ vertices, there exists a weighted graph
$H=(V,F,\tilde{w})$ with at most $\ceil{d(n-1)}$ edges such that for every $x
\in \R^{V}$, \[ x^{T}L_{G}x \leq x^{T}L_{H}x \leq
(\frac{d+1+2\sqrt{d}}{d+1-2\sqrt{d}})\cdot x^{T}L_{G}x \] where $L_{G}$ and
$L_{H}$ are the Laplacian matrices of $G$ and $H$, respectively. Thus, $H$
approximates $G$ spectrally at least as well as a Ramanujan expander with
$dn/2$ edges approximates the complete graph. We give an elementary
deterministic polynomial time algorithm for constructing $H$.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2008 18:19:17 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Dec 2008 19:13:09 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Nov 2009 07:27:03 GMT"
}
] | 2009-11-18T00:00:00 |
[
[
"Batson",
"Joshua",
""
],
[
"Spielman",
"Daniel A.",
""
],
[
"Srivastava",
"Nikhil",
""
]
] |
new_dataset
| 0.983956 |
0911.3262
|
Samuel Ouzan
|
Samuel Ouzan, Yair Be'ery
|
Moderate-Density Parity-Check Codes
|
Submitted to the IEEE Transactions on Communications, September 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new type of short to moderate block-length, linear
error-correcting codes, called moderate-density parity-check (MDPC) codes. The
number of ones of the parity-check matrix of the codes presented is typically
higher than the number of ones of the parity-check matrix of low-density
parity-check (LDPC) codes. But, still lower than those of the parity-check
matrix of classical block codes. The proposed MDPC codes are cyclic and are
designed by constructing idempotents using cyclotomic cosets. The construction
is simple and allows finding short block-length, high-rate codes with good
minimum distance. Inspired by some recent iterative soft-input soft-output
(SISO) decoders used in a context of classical block codes, we propose a low
complexity, efficient, iterative decoder called Auto-Diversity (AD) decoder. AD
decoder is based on belief propagation (BP) decoder and takes advantage of the
fundamental property of automorphism group of the constructed cyclic code.
|
[
{
"version": "v1",
"created": "Tue, 17 Nov 2009 10:59:29 GMT"
}
] | 2009-11-18T00:00:00 |
[
[
"Ouzan",
"Samuel",
""
],
[
"Be'ery",
"Yair",
""
]
] |
new_dataset
| 0.999485 |
0911.2785
|
Cristian Molinaro
|
Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester Zumpano
|
NP Datalog: a Logic Language for Expressing NP Search and Optimization
Problems
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a logic language for expressing NP search and
optimization problems. Specifically, first a language obtained by extending
(positive) Datalog with intuitive and efficient constructs (namely, stratified
negation, constraints and exclusive disjunction) is introduced. Next, a further
restricted language only using a restricted form of disjunction to define
(non-deterministically) subsets (or partitions) of relations is investigated.
This language, called NP Datalog, captures the power of Datalog with
unstratified negation in expressing search and optimization problems. A system
prototype implementing NP Datalog is presented. The system translates NP
Datalog queries into OPL programs which are executed by the ILOG OPL
Development Studio. Our proposal combines easy formulation of problems,
expressed by means of a declarative logic language, with the efficiency of the
ILOG System. Several experiments show the effectiveness of this approach.
|
[
{
"version": "v1",
"created": "Sat, 14 Nov 2009 17:20:30 GMT"
}
] | 2009-11-17T00:00:00 |
[
[
"Greco",
"Sergio",
""
],
[
"Molinaro",
"Cristian",
""
],
[
"Trubitsyna",
"Irina",
""
],
[
"Zumpano",
"Ester",
""
]
] |
new_dataset
| 0.98577 |
0911.3091
|
Loet Leydesdorff
|
Ping Zhou and Loet Leydesdorff
|
The Citation Impacts and Citation Environments of Chinese Journals in
Mathematics
| null |
Zhou, Ping & Loet Leydesdorff, The Citation Impacts and Citation
Environments of Chinese Journals in Mathematics, Scientometrics 72(2),
185-200, 2007
| null | null |
cs.DL math.HO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on the citation data of journals covered by the China Scientific and
Technical Papers and Citations Database (CSTPCD), we obtained aggregated
journal-journal citation environments by applying routines developed
specifically for this purpose. Local citation impact of journals is defined as
the share of the total citations in a local citation environment, which is
expressed as a ratio and can be visualized by the size of the nodes. The
vertical size of the nodes varies proportionally to a journal's total citation
share, while the horizontal size of the nodes is used to provide citation
information after correction for the within-journal (self-) citations. In this
study, we analyze citation impacts of three Chinese journals in mathematics and
compare local citation impacts with impact factors. Local citation impacts
reflect a journal's status and function better than (global) impact factors. We
also found that authors in Chinese journals prefer international instead of
domestic ones as sources for their citations.
|
[
{
"version": "v1",
"created": "Mon, 16 Nov 2009 17:33:00 GMT"
}
] | 2009-11-17T00:00:00 |
[
[
"Zhou",
"Ping",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.997989 |
0911.3092
|
Emil Vassev Dr.
|
Emil Vassev, Que Thu Dung Nguyen, Heng Kuang
|
Fault-Tolerance through Message-logging and Check-pointing: Disaster
Recovery for CORBA-based Distributed Bank Servers
|
42 pages,11 figues
| null | null | null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents results of our endeavor towards developing a
failure-recovery variant of a CORBA-based bank server that provides fault
tolerance features through message logging and checkpoint logging. In this
group of projects, three components were developed to satisfy the requirements:
1) a message-logging protocol for the branch servers of the distributed banking
system to log required information; 2) a recovery module that restarts the bank
server using the message log to help the restarted bank server process
subsequent requests for various operations; 3) a monitor module that
periodically checks whether the bank server is down and helps the recovery
module restart the bank server if the latter has crashed.
|
[
{
"version": "v1",
"created": "Mon, 16 Nov 2009 17:31:09 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Nov 2009 14:33:48 GMT"
}
] | 2009-11-17T00:00:00 |
[
[
"Vassev",
"Emil",
""
],
[
"Nguyen",
"Que Thu Dung",
""
],
[
"Kuang",
"Heng",
""
]
] |
new_dataset
| 0.998039 |
0902.2137
|
Xavier Leroy
|
Xavier Leroy (INRIA Rocquencourt)
|
A formally verified compiler back-end
| null |
Journal of Automated Reasoning 43, 4 (2009) 363-446
|
10.1007/s10817-009-9155-4
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article describes the development and formal verification (proof of
semantic preservation) of a compiler back-end from Cminor (a simple imperative
intermediate language) to PowerPC assembly code, using the Coq proof assistant
both for programming the compiler and for proving its correctness. Such a
verified compiler is useful in the context of formal methods applied to the
certification of critical software: the verification of the compiler guarantees
that the safety properties proved on the source code hold for the executable
compiled code as well.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2009 15:48:28 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jul 2009 13:07:04 GMT"
},
{
"version": "v3",
"created": "Sat, 14 Nov 2009 09:14:31 GMT"
}
] | 2009-11-14T00:00:00 |
[
[
"Leroy",
"Xavier",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.967929 |
0704.0098
|
Jack Raymond
|
Jack Raymond, David Saad
|
Sparsely-spread CDMA - a statistical mechanics based analysis
|
23 pages, 5 figures, figure 1 amended since published version
|
J. Phys. A: Math. Theor. 40 No 41 (12 October 2007) 12315-12333
|
10.1088/1751-8113/40/41/004
| null |
cs.IT math.IT
| null |
Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA
method in which the spreading (signature) matrix contains only a relatively
small number of non-zero elements, is presented and analysed using methods of
statistical physics. The analysis provides results on the performance of
maximum likelihood decoding for sparse spreading codes in the large system
limit. We present results for both cases of regular and irregular spreading
matrices for the binary additive white Gaussian noise channel (BIAWGN) with a
comparison to the canonical (dense) random spreading code.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2007 18:27:26 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Apr 2007 12:39:14 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Aug 2007 19:10:18 GMT"
},
{
"version": "v4",
"created": "Sun, 7 Oct 2007 16:50:39 GMT"
},
{
"version": "v5",
"created": "Wed, 30 Apr 2008 15:36:55 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Raymond",
"Jack",
""
],
[
"Saad",
"David",
""
]
] |
new_dataset
| 0.987688 |
0707.3175
|
Aydin Sezgin
|
Aydin Sezgin and Oliver Henkel
|
Stacked OSTBC: Error Performance and Rate Analysis
|
IEEE Transactions on Signal Processing, accepted
| null |
10.1109/TSP.2007.896025
| null |
cs.IT math.IT
| null |
It is well known, that the Alamouti scheme is the only space-time code from
orthogonal design achieving the capacity of a multiple-input multiple-output
(MIMO) wireless communication system with n_T=2 transmit antennas and n_R=1
receive antenna. In this work, we propose the n-times stacked Alamouti scheme
for n_T=2n transmit antennas and show that this scheme achieves the capacity in
the case of n_R=1 receive antenna. This result may regarded as an extension of
the Alamouti case. For the more general case of more than one receive antenna,
we show that if the number of transmit antennas is higher than the number of
receive antennas we achieve a high portion of the capacity with this scheme.
Further, we show that the MIMO capacity is at most twice the rate achieved with
the proposed scheme for all SNR. We derive lower and upper bounds for the rate
achieved with this scheme and compare it with upper and lower bounds for the
capacity. In addition to the capacity analysis based on the assumption of a
coherent channel, we analyze the error rate performance of the stacked OSTBC
with the optimal ML detector and with the suboptimal lattice-reduction (LR)
aided zero-forcing detector. We compare the error rate performance of the
stacked OSTBC with spatial multiplexing (SM) and full-diversity achieving
schemes. Finally, we illustrate the theoretical results by numerical
simulations.
|
[
{
"version": "v1",
"created": "Sat, 21 Jul 2007 01:09:00 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Sezgin",
"Aydin",
""
],
[
"Henkel",
"Oliver",
""
]
] |
new_dataset
| 0.967398 |
0802.2685
|
Maziar Nekovee
|
C. J. Rhodes and M. Nekovee
|
The Opportunistic Transmission of Wireless Worms between Mobile Devices
|
Submitted for publication
| null |
10.1016/j.physa.2008.09.017
| null |
cs.NI cond-mat.stat-mech cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ubiquity of portable wireless-enabled computing and communications
devices has stimulated the emergence of malicious codes (wireless worms) that
are capable of spreading between spatially proximal devices. The potential
exists for worms to be opportunistically transmitted between devices as they
move around, so human mobility patterns will have an impact on epidemic spread.
The scenario we address in this paper is proximity attacks from fleetingly
in-contact wireless devices with short-range communication range, such as
Bluetooth-enabled smart phones. An individual-based model of mobile devices is
introduced and the effect of population characteristics and device behaviour on
the outbreak dynamics is investigated. We show through extensive simulations
that in the above scenario the resulting mass-action epidemic models remain
applicable provided the contact rate is derived consistently from the
underlying mobility model. The model gives useful analytical expressions
against which more refined simulations of worm spread can be developed and
tested.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2008 17:07:32 GMT"
}
] | 2009-11-13T00:00:00 |
[
[
"Rhodes",
"C. J.",
""
],
[
"Nekovee",
"M.",
""
]
] |
new_dataset
| 0.998968 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.