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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1003.5627
|
Ashley Smith
|
Mahmoud I. Abdalla and Hanaa S. Ali
|
Wavelet-Based Mel-Frequency Cepstral Coefficients for Speaker
Identification using Hidden Markov Models
| null |
Journal of Telecommunications, Volume 1, Issue 2, pp16-21, March
2010
| null | null |
cs.SD cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To improve the performance of speaker identification systems, an effective
and robust method is proposed to extract speech features, capable of operating
in noisy environment. Based on the time-frequency multi-resolution property of
wavelet transform, the input speech signal is decomposed into various frequency
channels. For capturing the characteristic of the signal, the Mel-Frequency
Cepstral Coefficients (MFCCs) of the wavelet channels are calculated. Hidden
Markov Models (HMMs) were used for the recognition stage as they give better
recognition for the speaker's features than Dynamic Time Warping (DTW).
Comparison of the proposed approach with the MFCCs conventional feature
extraction method shows that the proposed method not only effectively reduces
the influence of noise, but also improves recognition. A recognition rate of
99.3% was obtained using the proposed feature extraction technique compared to
98.7% using the MFCCs. When the test patterns were corrupted by additive white
Gaussian noise with 20 dB S/N ratio, the recognition rate was 97.3% using the
proposed method compared to 93.3% using the MFCCs.
|
[
{
"version": "v1",
"created": "Mon, 29 Mar 2010 17:54:55 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Abdalla",
"Mahmoud I.",
""
],
[
"Ali",
"Hanaa S.",
""
]
] |
new_dataset
| 0.981374 |
1003.5749
|
Sylvie Billot
|
Iris Eshkol (CORAL), Isabelle Tellier (LIFO), Taalab Samer (LIFO),
Sylvie Billot (LIFO)
|
Etiqueter un corpus oral par apprentissage automatique \`a l'aide de
connaissances linguistiques
| null |
10\`emes Journ\'ees Internationales d'Analyse statistique des
Donn\'ees Textuelles JADT'2010, Rome : Italie (2010)
| null | null |
cs.LG cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thanks to the Eslo1 ("Enqu\^ete sociolinguistique d'Orl\'eans", i.e.
"Sociolinguistic Inquiery of Orl\'eans") campain, a large oral corpus has been
gathered and transcribed in a textual format. The purpose of the work presented
here is to associate a morpho-syntactic label to each unit of this corpus. To
this aim, we have first studied the specificities of the necessary labels, and
their various possible levels of description. This study has led to a new
original hierarchical structuration of labels. Then, considering that our new
set of labels was different from the one used in every available software, and
that these softwares usually do not fit for oral data, we have built a new
labeling tool by a Machine Learning approach, from data labeled by Cordial and
corrected by hand. We have applied linear CRF (Conditional Random Fields)
trying to take the best possible advantage of the linguistic knowledge that was
used to define the set of labels. We obtain an accuracy between 85 and 90%,
depending of the parameters used.
|
[
{
"version": "v1",
"created": "Tue, 30 Mar 2010 07:04:46 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Eshkol",
"Iris",
"",
"CORAL"
],
[
"Tellier",
"Isabelle",
"",
"LIFO"
],
[
"Samer",
"Taalab",
"",
"LIFO"
],
[
"Billot",
"Sylvie",
"",
"LIFO"
]
] |
new_dataset
| 0.994178 |
1003.5782
|
Vahan Mkrtchyan
|
Vahan Mkrtchyan, Eckhard Steffen
|
Bricks and conjectures of Berge, Fulkerson and Seymour
|
4 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $r$-graph is an $r$-regular graph where every odd set of vertices is
connected by at least $r$ edges to the rest of the graph. Seymour conjectured
that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph
contains $2r$ perfect matchings such that each edge belongs to two of them. We
show that the minimum counter-example to either of these conjectures is a
brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.
|
[
{
"version": "v1",
"created": "Tue, 30 Mar 2010 10:34:26 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Mkrtchyan",
"Vahan",
""
],
[
"Steffen",
"Eckhard",
""
]
] |
new_dataset
| 0.99514 |
1003.5891
|
Sandip Rakshit
|
Sandip Rakshit, Subhadip Basu
|
Recognition of Handwritten Roman Script Using Tesseract Open source OCR
Engine
|
Proc. National Conference on NAQC (2008) 141-145
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the present work, we have used Tesseract 2.01 open source Optical
Character Recognition (OCR) Engine under Apache License 2.0 for recognition of
handwriting samples of lower case Roman script. Handwritten isolated and
free-flow text samples were collected from multiple users. Tesseract is trained
to recognize user-specific handwriting samples of both the categories of
document pages. On a single user model, the system is trained with 1844
isolated handwritten characters and the performance is tested on 1133
characters, taken form the test set. The overall character-level accuracy of
the system is observed as 83.5%. The system fails to segment 5.56% characters
and erroneously classifies 10.94% characters.
|
[
{
"version": "v1",
"created": "Tue, 30 Mar 2010 18:35:37 GMT"
}
] | 2010-03-31T00:00:00 |
[
[
"Rakshit",
"Sandip",
""
],
[
"Basu",
"Subhadip",
""
]
] |
new_dataset
| 0.998741 |
0804.0722
|
Daniel Karapetyan
|
Gregory Gutin, Daniel Karapetyan
|
A Memetic Algorithm for the Generalized Traveling Salesman Problem
|
15 pages, to appear in Natural Computing, Springer, available online:
http://www.springerlink.com/content/5v4568l492272865/?p=e1779dd02e4d4cbfa49d0d27b19b929f&pi=13
|
Natural Computing 9(1) (2010) 47-60
|
10.1007/s11047-009-9111-6
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The generalized traveling salesman problem (GTSP) is an extension of the
well-known traveling salesman problem. In GTSP, we are given a partition of
cities into groups and we are required to find a minimum length tour that
includes exactly one city from each group. The recent studies on this subject
consider different variations of a memetic algorithm approach to the GTSP. The
aim of this paper is to present a new memetic algorithm for GTSP with a
powerful local search procedure. The experiments show that the proposed
algorithm clearly outperforms all of the known heuristics with respect to both
solution quality and running time. While the other memetic algorithms were
designed only for the symmetric GTSP, our algorithm can solve both symmetric
and asymmetric instances.
|
[
{
"version": "v1",
"created": "Fri, 4 Apr 2008 13:21:40 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Nov 2008 23:58:20 GMT"
},
{
"version": "v3",
"created": "Fri, 13 Mar 2009 22:13:27 GMT"
}
] | 2010-03-30T00:00:00 |
[
[
"Gutin",
"Gregory",
""
],
[
"Karapetyan",
"Daniel",
""
]
] |
new_dataset
| 0.973285 |
0809.4839
|
Jean-Marie Vanherpe
|
Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)
|
M\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs
| null |
Discussionnes Mathematicae on Graph Theory 30, 2 (2010) xxx-yyy
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts that every
bridgeless cubic graph has two perfect matchings whose intersection does not
contain any odd edge cut. We prove this conjecture for graphs with few vertices
and we give a stronger result for traceable graphs.
|
[
{
"version": "v1",
"created": "Sun, 28 Sep 2008 11:31:20 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Nov 2009 18:41:37 GMT"
}
] | 2010-03-30T00:00:00 |
[
[
"Fouquet",
"Jean-Luc",
"",
"LIFO"
],
[
"Vanherpe",
"Jean-Marie",
"",
"LIFO"
]
] |
new_dataset
| 0.999643 |
1001.3497
|
William Jackson
|
Shahid Hussain, Sheikh Muhammad Saqib, Bashir Ahmad, Shakeel Ahmad
|
Mapping of SOA and RUP: DOA as Case Study
|
Journal of Computing, Vol. 2, Issue 1, January 2010,
https://sites.google.com/site/journalofcomputing/
|
Journal of Computing, Vol. 2, Issue 1, January 2010,
https://sites.google.com/site/journalofcomputing/
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SOA (Service Oriented Architecture) is a new trend towards increasing the
profit margins in an organization due to incorporating business services to
business practices. Rational Unified Process (RUP) is a unified method planning
form for large business applications that provides a language for describing
method content and processes. The well defined mapping of SOA and RUP leads to
successful completion of RUP software projects to provide services to their
users. DOA (Digital Office Assistant) is a multi user SOA type application that
provides appropriate viewer for each user to assist him through services. In
this paper authors proposed the mapping strategy of SOA with RUP by considering
DOA as case study.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 08:11:10 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Mar 2010 07:37:16 GMT"
}
] | 2010-03-30T00:00:00 |
[
[
"Hussain",
"Shahid",
""
],
[
"Saqib",
"Sheikh Muhammad",
""
],
[
"Ahmad",
"Bashir",
""
],
[
"Ahmad",
"Shakeel",
""
]
] |
new_dataset
| 0.991255 |
1003.5320
|
Michael Bronstein
|
Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel
|
The Video Genome
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fast evolution of Internet technologies has led to an explosive growth of
video data available in the public domain and created unprecedented challenges
in the analysis, organization, management, and control of such content. The
problems encountered in video analysis such as identifying a video in a large
database (e.g. detecting pirated content in YouTube), putting together video
fragments, finding similarities and common ancestry between different versions
of a video, have analogous counterpart problems in genetic research and
analysis of DNA and protein sequences. In this paper, we exploit the analogy
between genetic sequences and videos and propose an approach to video analysis
motivated by genomic research. Representing video information as video DNA
sequences and applying bioinformatic algorithms allows to search, match, and
compare videos in large-scale databases. We show an application for
content-based metadata mapping between versions of annotated video.
|
[
{
"version": "v1",
"created": "Sat, 27 Mar 2010 20:57:47 GMT"
}
] | 2010-03-30T00:00:00 |
[
[
"Bronstein",
"Alexander M.",
""
],
[
"Bronstein",
"Michael M.",
""
],
[
"Kimmel",
"Ron",
""
]
] |
new_dataset
| 0.951927 |
1003.5515
|
EPTCS
|
Maribel Fern\'andez, Nikolaos Siafakas
|
Labelled Lambda-calculi with Explicit Copy and Erase
| null |
EPTCS 22, 2010, pp. 49-64
|
10.4204/EPTCS.22.5
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two rewriting systems that define labelled explicit substitution
lambda-calculi. Our work is motivated by the close correspondence between
Levy's labelled lambda-calculus and paths in proof-nets, which played an
important role in the understanding of the Geometry of Interaction. The
structure of the labels in Levy's labelled lambda-calculus relates to the
multiplicative information of paths; the novelty of our work is that we design
labelled explicit substitution calculi that also keep track of exponential
information present in call-by-value and call-by-name translations of the
lambda-calculus into linear logic proof-nets.
|
[
{
"version": "v1",
"created": "Mon, 29 Mar 2010 12:02:10 GMT"
}
] | 2010-03-30T00:00:00 |
[
[
"Fernández",
"Maribel",
""
],
[
"Siafakas",
"Nikolaos",
""
]
] |
new_dataset
| 0.983033 |
1003.5173
|
Charles Robert
|
Charles A. B. Robert (LORIA)
|
LEXSYS: Architecture and Implication for Intelligent Agent systems
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LEXSYS, (Legume Expert System) was a project conceived at IITA (International
Institute of Tropical Agriculture) Ibadan Nigeria. It was initiated by the
COMBS (Collaborative Group on Maize-Based Systems Research in the 1990. It was
meant for a general framework for characterizing on-farm testing for technology
design for sustainable cereal-based cropping system. LEXSYS is not a true
expert system as the name would imply, but simply a user-friendly information
system. This work is an attempt to give a formal representation of the existing
system and then present areas where intelligent agent can be applied.
|
[
{
"version": "v1",
"created": "Fri, 26 Mar 2010 16:01:52 GMT"
}
] | 2010-03-29T00:00:00 |
[
[
"Robert",
"Charles A. B.",
"",
"LORIA"
]
] |
new_dataset
| 0.995202 |
1003.5192
|
Christoph Lange
|
Christoph Lange
|
wiki.openmath.org - how it works, how you can participate
|
OpenMath workshop 2009 (http://staff.bath.ac.uk/masjhd/OM2009.html)
| null | null | null |
cs.DL cs.MS math.HO
|
http://creativecommons.org/licenses/by/3.0/
|
At http://wiki.openmath.org, the OpenMath 2 and 3 Content Dictionaries are
accessible via a semantic wiki interface, powered by the SWiM system. We
shortly introduce the inner workings of the system, then describe how to use
it, and conclude with first experiences gained from OpenMath society members
working with the system and an outlook to further development plans.
|
[
{
"version": "v1",
"created": "Fri, 26 Mar 2010 17:32:10 GMT"
}
] | 2010-03-29T00:00:00 |
[
[
"Lange",
"Christoph",
""
]
] |
new_dataset
| 0.973515 |
1003.4879
|
Natalia Silberstein
|
Natalia Silberstein and Tuvi Etzion
|
Large Constant Dimension Codes and Lexicodes
|
submitted for ALCOMA10
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constant dimension codes, with a prescribed minimum distance, have found
recently an application in network coding. All the codewords in such a code are
subspaces of $\F_q^n$ with a given dimension. A computer search for large
constant dimension codes is usually inefficient since the search space domain
is extremely large. Even so, we found that some constant dimension lexicodes
are larger than other known codes. We show how to make the computer search more
efficient. In this context we present a formula for the computation of the
distance between two subspaces, not necessarily of the same dimension.
|
[
{
"version": "v1",
"created": "Thu, 25 Mar 2010 12:59:03 GMT"
}
] | 2010-03-26T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.999602 |
1001.3477
|
William Jackson
|
Y. Robiah, S. Siti Rahayu, S. Shahrin, M. A. Faizal, M. Mohd Zaki, R.
Marliza
|
New Multi-step Worm Attack Model
| null |
Journal of Computing, Vol. 2, Issue 1, January 2010
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The traditional worms such as Blaster, Code Red, Slammer and Sasser, are
still infecting vulnerable machines on the internet. They will remain as
significant threats due to their fast spreading nature on the internet. Various
traditional worms attack pattern has been analyzed from various logs at
different OSI layers such as victim logs, attacker logs and IDS alert log.
These worms attack pattern can be abstracted to form worms' attack model which
describes the process of worms' infection. For the purpose of this paper, only
Blaster variants were used during the experiment. This paper proposes a
multi-step worm attack model which can be extended into research areas in alert
correlation and computer forensic investigation.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 07:21:39 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Robiah",
"Y.",
""
],
[
"Rahayu",
"S. Siti",
""
],
[
"Shahrin",
"S.",
""
],
[
"Faizal",
"M. A.",
""
],
[
"Zaki",
"M. Mohd",
""
],
[
"Marliza",
"R.",
""
]
] |
new_dataset
| 0.995489 |
1001.3491
|
William Jackson
|
P.R.Sujin, T.Ruban Deva Prakash, M.Mary Linda
|
Particle Swarm Optimization Based Reactive Power Optimization
| null |
Journal of Computing, Vol. 2, Issue 1, January 2010
| null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reactive power plays an important role in supporting the real power transfer
by maintaining voltage stability and system reliability. It is a critical
element for a transmission operator to ensure the reliability of an electric
system while minimizing the cost associated with it. The traditional objectives
of reactive power dispatch are focused on the technical side of reactive
support such as minimization of transmission losses. Reactive power cost
compensation to a generator is based on the incurred cost of its reactive power
contribution less the cost of its obligation to support the active power
delivery. In this paper an efficient Particle Swarm Optimization (PSO) based
reactive power optimization approach is presented. The optimal reactive power
dispatch problem is a nonlinear optimization problem with several constraints.
The objective of the proposed PSO is to minimize the total support cost from
generators and reactive compensators. It is achieved by maintaining the whole
system power loss as minimum thereby reducing cost allocation. The purpose of
reactive power dispatch is to determine the proper amount and location of
reactive support. Reactive Optimal Power Flow (ROPF) formulation is developed
as an analysis tool and the validity of proposed method is examined using an
IEEE-14 bus system.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 07:57:02 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Sujin",
"P. R.",
""
],
[
"Prakash",
"T. Ruban Deva",
""
],
[
"Linda",
"M. Mary",
""
]
] |
new_dataset
| 0.966676 |
1002.3992
|
William Jackson
|
L. Bercea, G. Nemtoi, C. Ungureanu
|
The government of state's power bodies by means of the Internet
| null |
Journal of Computing, Volume 2, Issue 2, February 2010,
https://sites.google.com/site/journalofcomputing/
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The electronic government involves developing the informational society,
which refers to an economy and a society in which the access, acquisition,
memorizing, taking, transmitting, spreading and using the knowledge accede to a
decisive role. The informational society involves changes in the domains of
administration (e-Government), business (electronic commerce and e-business),
education (long distance education), culture (multimedia centers and virtual
libraries), mass- media (TV, video advertising panels), and in the labor manner
(tele-work and virtual commuting).The e-government refers to the interaction
between the Government, Parliament and other public institutions with the
citizens by the electronic means.
|
[
{
"version": "v1",
"created": "Sun, 21 Feb 2010 18:59:25 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Bercea",
"L.",
""
],
[
"Nemtoi",
"G.",
""
],
[
"Ungureanu",
"C.",
""
]
] |
new_dataset
| 0.996693 |
1002.4007
|
William Jackson
|
Ram Sarkar, Nibaran Das, Subhadip Basu, Mahantapas Kundu, Mita
Nasipuri, Dipak Kumar Basu
|
Word level Script Identification from Bangla and Devanagri Handwritten
Texts mixed with Roman Script
| null |
Journal of Computing, Volume 2, Issue 2, February 2010,
https://sites.google.com/site/journalofcomputing/
| null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
India is a multi-lingual country where Roman script is often used alongside
different Indic scripts in a text document. To develop a script specific
handwritten Optical Character Recognition (OCR) system, it is therefore
necessary to identify the scripts of handwritten text correctly. In this paper,
we present a system, which automatically separates the scripts of handwritten
words from a document, written in Bangla or Devanagri mixed with Roman scripts.
In this script separation technique, we first, extract the text lines and words
from document pages using a script independent Neighboring Component Analysis
technique. Then we have designed a Multi Layer Perceptron (MLP) based
classifier for script separation, trained with 8 different wordlevel holistic
features. Two equal sized datasets, one with Bangla and Roman scripts and the
other with Devanagri and Roman scripts, are prepared for the system evaluation.
On respective independent text samples, word-level script identification
accuracies of 99.29% and 98.43% are achieved.
|
[
{
"version": "v1",
"created": "Sun, 21 Feb 2010 19:48:16 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Sarkar",
"Ram",
""
],
[
"Das",
"Nibaran",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Kundu",
"Mahantapas",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"Dipak Kumar",
""
]
] |
new_dataset
| 0.999127 |
1002.4040
|
William Jackson
|
Nibaran Das, Bindaban Das, Ram Sarkar, Subhadip Basu, Mahantapas
Kundu, Mita Nasipuri
|
Handwritten Bangla Basic and Compound character recognition using MLP
and SVM classifier
| null |
Journal of Computing, Volume 2, Issue 2, February 2010,
https://sites.google.com/site/journalofcomputing/
| null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel approach for recognition of handwritten compound Bangla characters,
along with the Basic characters of Bangla alphabet, is presented here. Compared
to English like Roman script, one of the major stumbling blocks in Optical
Character Recognition (OCR) of handwritten Bangla script is the large number of
complex shaped character classes of Bangla alphabet. In addition to 50 basic
character classes, there are nearly 160 complex shaped compound character
classes in Bangla alphabet. Dealing with such a large varieties of handwritten
characters with a suitably designed feature set is a challenging problem.
Uncertainty and imprecision are inherent in handwritten script. Moreover, such
a large varieties of complex shaped characters, some of which have close
resemblance, makes the problem of OCR of handwritten Bangla characters more
difficult. Considering the complexity of the problem, the present approach
makes an attempt to identify compound character classes from most frequently to
less frequently occurred ones, i.e., in order of importance. This is to develop
a frame work for incrementally increasing the number of learned classes of
compound characters from more frequently occurred ones to less frequently
occurred ones along with Basic characters. On experimentation, the technique is
observed produce an average recognition rate of 79.25 after three fold cross
validation of data with future scope of improvement and extension.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2010 02:58:49 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Feb 2010 06:44:32 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Das",
"Nibaran",
""
],
[
"Das",
"Bindaban",
""
],
[
"Sarkar",
"Ram",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Kundu",
"Mahantapas",
""
],
[
"Nasipuri",
"Mita",
""
]
] |
new_dataset
| 0.999541 |
1003.4610
|
Barbara Di Fabio
|
Barbara Di Fabio and Claudia Landi
|
Stability of Reeb graphs under function perturbations: the case of
closed curves
|
23 pages, 12 figures
| null | null |
2759
|
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reeb graphs provide a method for studying the shape of a manifold by encoding
the evolution and arrangement of level sets of a simple Morse function defined
on the manifold. Since their introduction in computer graphics they have been
gaining popularity as an effective tool for shape analysis and matching. In
this context one question deserving attention is whether Reeb graphs are robust
against function perturbations. Focusing on 1-dimensional manifolds, we define
an editing distance between Reeb graphs of curves, in terms of the cost
necessary to transform one graph into another. Our main result is that changes
in Morse functions induce smaller changes in the editing distance between Reeb
graphs of curves, implying stability of Reeb graphs under function
perturbations.
|
[
{
"version": "v1",
"created": "Wed, 24 Mar 2010 10:47:47 GMT"
}
] | 2010-03-25T00:00:00 |
[
[
"Di Fabio",
"Barbara",
""
],
[
"Landi",
"Claudia",
""
]
] |
new_dataset
| 0.989278 |
0905.4165
|
Murat Guzeltepe Mr
|
Murat Guzeltepe, Mehmet Ozen
|
Cyclic Codes over Some Finite Quaternion Integer Rings
| null | null |
10.1016/j.jfranklin.2010.02.008
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, cyclic codes are established over some finite quaternion
integer rings with respect to the quaternion Mannheim distance, and de- coding
algorithm for these codes is given.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2009 11:11:34 GMT"
}
] | 2010-03-24T00:00:00 |
[
[
"Guzeltepe",
"Murat",
""
],
[
"Ozen",
"Mehmet",
""
]
] |
new_dataset
| 0.999713 |
1003.4369
|
Rachid Echahed
|
Ph. Balbiani, R. Echahed, A. Herzig
|
A Modal Logic for Termgraph Rewriting
| null | null | null | null |
cs.LO cs.PL cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a modal logic tailored to describe graph transformations and
discuss some of its properties. We focus on a particular class of graphs called
termgraphs. They are first-order terms augmented with sharing and cycles.
Termgraphs allow one to describe classical data-structures (possibly with
pointers) such as doubly-linked lists, circular lists etc. We show how the
proposed logic can faithfully describe (i) termgraphs as well as (ii) the
application of a termgraph rewrite rule (i.e. matching and replacement) and
(iii) the computation of normal forms with respect to a given rewrite system.
We also show how the proposed logic, which is more expressive than
propositional dynamic logic, can be used to specify shapes of classical
data-structures (e.g. binary trees, circular lists etc.).
|
[
{
"version": "v1",
"created": "Tue, 23 Mar 2010 10:34:14 GMT"
}
] | 2010-03-24T00:00:00 |
[
[
"Balbiani",
"Ph.",
""
],
[
"Echahed",
"R.",
""
],
[
"Herzig",
"A.",
""
]
] |
new_dataset
| 0.999298 |
1003.2616
|
Sugata Sanyal
|
Vipul Goyal, Sugata Sanyal, Dharma P. Agrawal
|
Vcache: Caching Dynamic Documents
|
4 Pages, 3 Figures, 6th International Conference on Information
Technology (CIT-2003), India, Dec 2003, pp. 338-342
| null | null |
Proceedings of the 6th International Conference on Information
Technology (CIT-2003), India, Dec 2003, pp. 338-342.
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The traditional web caching is currently limited to static documents only. A
page generated on the fly from a server side script may have different contents
on different accesses and hence cannot be cached. A number of proposals for
attacking the problem have emerged based on the observation that different
instances of a dynamic document are usually quite similar in most cases, i.e.
they have a lot of common HTML code. In this paper, we first review these
related techniques and show their inadequacy for practical use. We then present
a general and fully automatic technique called Vcache based on the
decomposition of dynamic documents into a hierarchy of templates and bindings.
The technique is designed keeping in mind languages like Perl and C etc that
generate the documents using low-level print like statements. These languages
together, account for the largest number of dynamic documents on the web.
|
[
{
"version": "v1",
"created": "Fri, 12 Mar 2010 20:45:35 GMT"
}
] | 2010-03-23T00:00:00 |
[
[
"Goyal",
"Vipul",
""
],
[
"Sanyal",
"Sugata",
""
],
[
"Agrawal",
"Dharma P.",
""
]
] |
new_dataset
| 0.998649 |
1003.3908
|
Wei Zhang
|
Wei Zhang, Long Shi, and Xiang-Gen Xia
|
Full Diversity Space-Time Block Codes with Low-Complexity Partial
Interference Cancellation Group Decoding
|
10 pages, 3 figures.
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partial interference cancellation (PIC) group decoding proposed by Guo and
Xia is an attractive low-complexity alternative to the optimal processing for
multiple-input multiple-output (MIMO) wireless communications. It can well deal
with the tradeoff among rate, diversity and complexity of space-time block
codes (STBC). In this paper, a systematic design of full-diversity STBC with
low-complexity PIC group decoding is proposed. The proposed code design is
featured as a group-orthogonal STBC by replacing every element of an Alamouti
code matrix with an elementary matrix composed of multiple diagonal layers of
coded symbols. With the PIC group decoding and a particular grouping scheme,
the proposed STBC can achieve full diversity, a rate of $(2M)/(M+2)$ and a
low-complexity decoding for $M$ transmit antennas. Simulation results show that
the proposed codes can achieve the full diversity with PIC group decoding while
requiring half decoding complexity of the existing codes.
|
[
{
"version": "v1",
"created": "Sat, 20 Mar 2010 05:43:31 GMT"
}
] | 2010-03-23T00:00:00 |
[
[
"Zhang",
"Wei",
""
],
[
"Shi",
"Long",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.994456 |
1003.3996
|
Michael Neufeld
|
Michael Neufeld
|
DIP: Disruption-Tolerance for IP
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Disruption Tolerant Networks (DTN) have been a popular subject of recent
research and development. These networks are characterized by frequent, lengthy
outages and a lack of contemporaneous end-to-end paths. In this work we discuss
techniques for extending IP to operate more effectively in DTN scenarios. Our
scheme, Disruption Tolerant IP (DIP) uses existing IP packet headers, uses the
existing socket API for applications, is compatible with IPsec, and uses
familiar Policy-Based Routing techniques for network management.
|
[
{
"version": "v1",
"created": "Sun, 21 Mar 2010 13:44:48 GMT"
}
] | 2010-03-23T00:00:00 |
[
[
"Neufeld",
"Michael",
""
]
] |
new_dataset
| 0.999265 |
1003.4080
|
William Jackson
|
Nazleeni S. Haron, Nur S. Saleem, Mohd H. Hasan, Mazeyanti M. Ariffin,
Izzatdin A. Aziz
|
A RFID-based Campus Context-Aware Notification System
| null |
Journal of Computing, Volume 2, Issue 3, March 2010,
https://sites.google.com/site/journalofcomputing/
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the design and development of a context-aware
notification system for university students using RFID technology. This system
is leveraging on the student's matrix card as the RFID tag (sensor), RFID
reader and server as the processors and screen monitor at the various locations
in the campus as the actuator of the output. This system aims to deliver urgent
notifications to the intended students immediately at their respective
locations. In addition, the system is also able to display personalized
information based on the students' preferences and current location when
accessing the system. The background of the study, the design approaches for
this system and the preliminary evaluation of the prototype are presented in
this paper. The evaluation results have indicated that the the proposed system
is useful and easy to use.
|
[
{
"version": "v1",
"created": "Mon, 22 Mar 2010 06:34:08 GMT"
}
] | 2010-03-23T00:00:00 |
[
[
"Haron",
"Nazleeni S.",
""
],
[
"Saleem",
"Nur S.",
""
],
[
"Hasan",
"Mohd H.",
""
],
[
"Ariffin",
"Mazeyanti M.",
""
],
[
"Aziz",
"Izzatdin A.",
""
]
] |
new_dataset
| 0.975503 |
1003.3490
|
Ileana Streinu
|
Gaiane Panina and Ileana Streinu
|
Flattening single-vertex origami: the non-expansive case
|
Accepted, to appear in Computational Geometry: Theory and
applications.
| null | null | null |
cs.CG math.DG math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A single-vertex origami is a piece of paper with straight-line rays called
creases emanating from a fold vertex placed in its interior or on its boundary.
The Single-Vertex Origami Flattening problem asks whether it is always possible
to reconfigure the creased paper from any configuration compatible with the
metric, to a flat, non-overlapping position, in such a way that the paper is
not torn, stretched and, for rigid origami, not bent anywhere except along the
given creases.
Streinu and Whiteley showed how to reduce the problem to the carpenter's rule
problem for spherical polygons. Using spherical expansive motions, they solved
the cases of open < \pi and closed <= 2\pi spherical polygons. Here, we solve
the case of open polygons with total length between [\pi, 2\pi), which requires
non-expansive motions. Our motion planning algorithm works in a finite number
of discrete steps, for which we give precise bounds depending on both the
number of links and the angle deficit.
|
[
{
"version": "v1",
"created": "Wed, 17 Mar 2010 23:05:39 GMT"
}
] | 2010-03-19T00:00:00 |
[
[
"Panina",
"Gaiane",
""
],
[
"Streinu",
"Ileana",
""
]
] |
new_dataset
| 0.998892 |
1003.3370
|
Yeb Havinga
|
Yeb Havinga, Willem Dijkstra, Ander de Keijzer
|
Adding HL7 version 3 data types to PostgreSQL
|
12 pages, 9 figures, 6 tables
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The HL7 standard is widely used to exchange medical information
electronically. As a part of the standard, HL7 defines scalar communication
data types like physical quantity, point in time and concept descriptor but
also complex types such as interval types, collection types and probabilistic
types. Typical HL7 applications will store their communications in a database,
resulting in a translation from HL7 concepts and types into database types.
Since the data types were not designed to be implemented in a relational
database server, this transition is cumbersome and fraught with programmer
error. The purpose of this paper is two fold. First we analyze the HL7 version
3 data type definitions and define a number of conditions that must be met, for
the data type to be suitable for implementation in a relational database. As a
result of this analysis we describe a number of possible improvements in the
HL7 specification. Second we describe an implementation in the PostgreSQL
database server and show that the database server can effectively execute
scientific calculations with units of measure, supports a large number of
operations on time points and intervals, and can perform operations that are
akin to a medical terminology server. Experiments on synthetic data show that
the user defined types perform better than an implementation that uses only
standard data types from the database server.
|
[
{
"version": "v1",
"created": "Wed, 17 Mar 2010 14:01:19 GMT"
}
] | 2010-03-18T00:00:00 |
[
[
"Havinga",
"Yeb",
""
],
[
"Dijkstra",
"Willem",
""
],
[
"de Keijzer",
"Ander",
""
]
] |
new_dataset
| 0.964713 |
1003.2440
|
Kien Nguyen
|
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
|
Stochastic Games for Security in Networks with Interdependent Nodes
| null | null | null | null |
cs.CR cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies a stochastic game theoretic approach to security and
intrusion detection in communication and computer networks. Specifically, an
Attacker and a Defender take part in a two-player game over a network of nodes
whose security assets and vulnerabilities are correlated. Such a network can be
modeled using weighted directed graphs with the edges representing the
influence among the nodes. The game can be formulated as a non-cooperative
zero-sum or nonzero-sum stochastic game. However, due to correlation among the
nodes, if some nodes are compromised, the effective security assets and
vulnerabilities of the remaining ones will not stay the same in general, which
leads to complex system dynamics. We examine existence, uniqueness, and
structure of the solution and also provide numerical examples to illustrate our
model.
|
[
{
"version": "v1",
"created": "Thu, 11 Mar 2010 22:59:20 GMT"
}
] | 2010-03-15T00:00:00 |
[
[
"Nguyen",
"Kien C.",
""
],
[
"Alpcan",
"Tansu",
""
],
[
"Basar",
"Tamer",
""
]
] |
new_dataset
| 0.956404 |
1003.2547
|
Laurent Deniau
|
Laurent Deniau
|
The C Object System: Using C as a High-Level Object-Oriented Language
|
18p
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The C Object System (Cos) is a small C library which implements high-level
concepts available in Clos, Objc and other object-oriented programming
languages: uniform object model (class, meta-class and property-metaclass),
generic functions, multi-methods, delegation, properties, exceptions, contracts
and closures. Cos relies on the programmable capabilities of the C programming
language to extend its syntax and to implement the aforementioned concepts as
first-class objects. Cos aims at satisfying several general principles like
simplicity, extensibility, reusability, efficiency and portability which are
rarely met in a single programming language. Its design is tuned to provide
efficient and portable implementation of message multi-dispatch and message
multi-forwarding which are the heart of code extensibility and reusability.
With COS features in hand, software should become as flexible and extensible as
with scripting languages and as efficient and portable as expected with C
programming. Likewise, Cos concepts should significantly simplify adaptive and
aspect-oriented programming as well as distributed and service-oriented
computing
|
[
{
"version": "v1",
"created": "Fri, 12 Mar 2010 14:31:23 GMT"
}
] | 2010-03-15T00:00:00 |
[
[
"Deniau",
"Laurent",
""
]
] |
new_dataset
| 0.997943 |
1003.1336
|
Zolt\'an K\'asa
|
Peter Fornai, Antal Ivanyi
|
FIFO anomaly is unbounded
| null |
Acta Univ. Sapientiae, Informatica, 2,1 (2010) 80-89
| null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Virtual memory of computers is usually implemented by demand paging. For some
page replacement algorithms the number of page faults may increase as the
number of page frames increases. Belady, Nelson and Shedler constructed
reference strings for which page replacement algorithm FIFO produces near twice
more page faults in a larger memory than in a smaller one. They formulated the
conjecture that 2 is a general bound. We prove that this ratio can be
arbitrarily large.
|
[
{
"version": "v1",
"created": "Fri, 5 Mar 2010 20:34:44 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Mar 2010 13:02:01 GMT"
}
] | 2010-03-13T00:00:00 |
[
[
"Fornai",
"Peter",
""
],
[
"Ivanyi",
"Antal",
""
]
] |
new_dataset
| 0.996315 |
1003.1387
|
Zolt\'an K\'asa
|
Gy\"ongyv\'er M\'arton
|
Public-key cryptography in functional programming context
| null |
Acta Univ. Sapientiae, Informatica, 2, 1 (2010) 99-112
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Up to now, for efficiency reasons cryptographic algorithm has been written in
an imperative language. But to get acquaintance with a functional programming
language a question arises: functional programming offers some new for secure
communication or not? This article investigates this question giving an
overview on some cryptography algorithms and presents how the RSA encryption in
the functional language Clean can be implemented and how can be measured the
efficiency of a certain application.
|
[
{
"version": "v1",
"created": "Sat, 6 Mar 2010 14:23:09 GMT"
}
] | 2010-03-13T00:00:00 |
[
[
"Márton",
"Gyöngyvér",
""
]
] |
new_dataset
| 0.988367 |
1003.2142
|
Shuping Gong
|
Husheng Li and Weiyi Zhang
|
QoS Routing in Smart Grid
|
submitted to IEEE 2010'Globecom
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart grid is an emerging technology which is able to control the power load
via price signaling. The communication between the power supplier and power
customers is a key issue in smart grid. Performance degradation like delay or
outage may cause significant impact on the stability of the pricing based
control and thus the reward of smart grid. Therefore, a QoS mechanism is
proposed for the communication system in smart grid, which incorporates the
derivation of QoS requirement and applies QoS routing in the communication
network. For deriving the QoS requirement, the dynamics of power load and the
load-price mapping are studied. The corresponding impacts of different QoS
metrics like delay are analyzed. Then, the QoS is derived via an optimization
problem that maximizes the total revenue. Based on the derived QoS requirement,
a simple greedy QoS routing algorithm is proposed for the requirement of high
speed routing in smart grid. It is also proven that the proposed greedy
algorithm is a $K$-approximation. Numerical simulation shows that the proposed
mechanism and algorithm can effectively derive and secure the communication QoS
in smart grid.
|
[
{
"version": "v1",
"created": "Wed, 10 Mar 2010 16:10:49 GMT"
}
] | 2010-03-11T00:00:00 |
[
[
"Li",
"Husheng",
""
],
[
"Zhang",
"Weiyi",
""
]
] |
new_dataset
| 0.992259 |
0907.4068
|
Masud Hasan
|
Syed Ishtiaque Ahmed, Masud Hasan, and Md. Ariful Islam
|
Cutting a Convex Polyhedron Out of a Sphere
|
10 pages
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an
$O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and
has cutting cost $O((\log n)^2)$ times the optimal.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2009 14:11:59 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Mar 2010 17:26:51 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Ahmed",
"Syed Ishtiaque",
""
],
[
"Hasan",
"Masud",
""
],
[
"Islam",
"Md. Ariful",
""
]
] |
new_dataset
| 0.995742 |
1003.1775
|
Erik Wilde
|
Nick Doty and Deirdre K. Mulligan and Erik Wilde
|
Privacy Issues of the W3C Geolocation API
| null | null | null |
UC Berkeley School of Information Report 2010-038
|
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The W3C's Geolocation API may rapidly standardize the transmission of
location information on the Web, but, in dealing with such sensitive
information, it also raises serious privacy concerns. We analyze the manner and
extent to which the current W3C Geolocation API provides mechanisms to support
privacy. We propose a privacy framework for the consideration of location
information and use it to evaluate the W3C Geolocation API, both the
specification and its use in the wild, and recommend some modifications to the
API as a result of our analysis.
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 03:32:29 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Doty",
"Nick",
""
],
[
"Mulligan",
"Deirdre K.",
""
],
[
"Wilde",
"Erik",
""
]
] |
new_dataset
| 0.973618 |
1003.1796
|
Rdv Ijcsis
|
Zunera Jalil, Anwar M. Mirza, Maria Sabir
|
Content based Zero-Watermarking Algorithm for Authentication of Text
Documents
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Copyright protection and authentication of digital contents has become a
significant issue in the current digital epoch with efficient communication
mediums such as internet. Plain text is the rampantly used medium used over the
internet for information exchange and it is very crucial to verify the
authenticity of information. There are very limited techniques available for
plain text watermarking and authentication. This paper presents a novel
zero-watermarking algorithm for authentication of plain text. The algorithm
generates a watermark based on the text contents and this watermark can later
be extracted using extraction algorithm to prove the authenticity of text
document. Experimental results demonstrate the effectiveness of the algorithm
against tampering attacks identifying watermark accuracy and distortion rate on
10 different text samples of varying length and attacks.
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 06:49:43 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Jalil",
"Zunera",
""
],
[
"Mirza",
"Anwar M.",
""
],
[
"Sabir",
"Maria",
""
]
] |
new_dataset
| 0.977803 |
1003.1806
|
Rdv Ijcsis
|
Ms.A.Rathika, Ms. R.Saranya, Ms.R.Iswarya
|
Securing Our Bluetooth Mobiles From Intruder Attack Using Enhanced
Authentication Scheme And Plausible Exchange Algorithm
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
When Bluetooth devices come within the range of another, an electronic
conversation takes place to determine whether the devices in range are known or
whether one needs to control the other. Most Bluetooth devices do not require
any form of user interaction for this to occur. If devices within range are
known to one another, the devices automatically form a network known as a
pairing. Authentication addresses the identity of each communicating device.
The sender sends an encrypted authentication request frame to the receiver. The
receiver sends an encrypted challenge frame back to the sender. Both perform a
predefined algorithm. The sender sends its findings back to the receiver, which
in turn either allows or denies the connection. There are three different
functions for authentication in Bluetooth-E1, E2, and E3. E1 is used when
encrypting the authorization challenge-response values.E2 is for generating
different link keys.E3 is used when creating the encryption key.
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 07:09:11 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Rathika",
"Ms. A.",
""
],
[
"Saranya",
"Ms. R.",
""
],
[
"Iswarya",
"Ms. R.",
""
]
] |
new_dataset
| 0.996152 |
1003.1811
|
Rdv Ijcsis
|
Samir Elmougy, Ibrahim El-Henawy, Ahmed El-Azab
|
Model Based Ceramic tile inspection using Discrete Wavelet Transform and
Euclidean Distance
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Visual inspection of industrial products is used to determine the control
quality for these products. This paper deals with the problem of visual
inspection of ceramic tiles industry using Wavelet Transform. The third level
the coefficients of two dimensions Haar Discrete Wavelet Transform (HDWT) is
used in this paper to process the images and feature extraction. The proposed
algorithm consists of two main phases. The first phase is to compute the
wavelet transform for an image free of defects which known as reference image,
and the image to be inspected which known as test image. The second phase is
used to decide whether the tested image is defected or not using the Euclidean
distance similarity measure. The experimentation results of the proposed
algorithm give 97% for correct detection of ceramic defects.
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 07:23:58 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Elmougy",
"Samir",
""
],
[
"El-Henawy",
"Ibrahim",
""
],
[
"El-Azab",
"Ahmed",
""
]
] |
new_dataset
| 0.998234 |
1003.1891
|
Ayatullah Faruk Mollah
|
Nibaran Das, Ayatullah Faruk Mollah, Sudip Saha, Syed Sahidul Haque
|
Handwritten Arabic Numeral Recognition using a Multi Layer Perceptron
|
Proc. National Conference on Recent Trends in Information Systems
(ReTIS-06), July 14-15, 2006, Kolkata, India, pp 200-203
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handwritten numeral recognition is in general a benchmark problem of Pattern
Recognition and Artificial Intelligence. Compared to the problem of printed
numeral recognition, the problem of handwritten numeral recognition is
compounded due to variations in shapes and sizes of handwritten characters.
Considering all these, the problem of handwritten numeral recognition is
addressed under the present work in respect to handwritten Arabic numerals.
Arabic is spoken throughout the Arab World and the fifth most popular language
in the world slightly before Portuguese and Bengali. For the present work, we
have developed a feature set of 88 features is designed to represent samples of
handwritten Arabic numerals for this work. It includes 72 shadow and 16 octant
features. A Multi Layer Perceptron (MLP) based classifier is used here for
recognition handwritten Arabic digits represented with the said feature set. On
experimentation with a database of 3000 samples, the technique yields an
average recognition rate of 94.93% evaluated after three-fold cross validation
of results. It is useful for applications related to OCR of handwritten Arabic
Digit and can also be extended to include OCR of handwritten characters of
Arabic alphabet.
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 14:56:00 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Das",
"Nibaran",
""
],
[
"Mollah",
"Ayatullah Faruk",
""
],
[
"Saha",
"Sudip",
""
],
[
"Haque",
"Syed Sahidul",
""
]
] |
new_dataset
| 0.99962 |
1003.1930
|
Achmad Benny Mutiara
|
D.K. Ningtyas and A.B. Mutiara
|
Simulating Grover's Quantum Search in a Classical Computer
|
24 pages, no figures
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The rapid progress of computer science has been accompanied by a
corresponding evolution of computation, from classical computation to quantum
computation. As quantum computing is on its way to becoming an established
discipline of computing science, much effort is being put into the development
of new quantum algorithms. One of quantum algorithms is Grover algorithm, which
is used for searching an element in an unstructured list of N elements with
quadratic speed-up over classical algorithms. In this work, Quantum Computer
Language (QCL) is used to make a Grover's quantum search simulation in a
classical computer
|
[
{
"version": "v1",
"created": "Tue, 9 Mar 2010 17:02:21 GMT"
}
] | 2010-03-10T00:00:00 |
[
[
"Ningtyas",
"D. K.",
""
],
[
"Mutiara",
"A. B.",
""
]
] |
new_dataset
| 0.996622 |
1003.1343
|
Gregory Benford
|
David H. Wolpert and Gregory Benford
|
What does Newcomb's paradox teach us?
| null | null | null | null |
cs.GT cs.AI math.OC math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Newcomb's paradox you choose to receive either the contents of a
particular closed box, or the contents of both that closed box and another one.
Before you choose, a prediction algorithm deduces your choice, and fills the
two boxes based on that deduction. Newcomb's paradox is that game theory
appears to provide two conflicting recommendations for what choice you should
make in this scenario. We analyze Newcomb's paradox using a recent extension of
game theory in which the players set conditional probability distributions in a
Bayes net. We show that the two game theory recommendations in Newcomb's
scenario have different presumptions for what Bayes net relates your choice and
the algorithm's prediction. We resolve the paradox by proving that these two
Bayes nets are incompatible. We also show that the accuracy of the algorithm's
prediction, the focus of much previous work, is irrelevant. In addition we show
that Newcomb's scenario only provides a contradiction between game theory's
expected utility and dominance principles if one is sloppy in specifying the
underlying Bayes net. We also show that Newcomb's paradox is time-reversal
invariant; both the paradox and its resolution are unchanged if the algorithm
makes its `prediction' after you make your choice rather than before.
|
[
{
"version": "v1",
"created": "Sat, 6 Mar 2010 00:52:29 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Wolpert",
"David H.",
""
],
[
"Benford",
"Gregory",
""
]
] |
new_dataset
| 0.988147 |
1003.1401
|
Zolt\~An K\~Asa
|
Branislav Sobota, Milan Guzan
|
Macro and micro view on steady states in state space
| null |
Acta Univ. Sapientiae, Informatica, 2,1 (2010) 90-98
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes visualization of chaotic attractor and elements of the
singularities in 3D space. 3D view of these effects enables to create a
demonstrative projection about relations of chaos generated by physical
circuit, the Chua's circuit. Via macro views on chaotic attractor is obtained
not only visual space illustration of representative point motion in state
space, but also its relation to planes of singularity elements. Our created
program enables view on chaotic attractor both in 2D and 3D space together with
plane objects visualization -- elements of singularities.
|
[
{
"version": "v1",
"created": "Sat, 6 Mar 2010 16:42:53 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Sobota",
"Branislav",
""
],
[
"Guzan",
"Milan",
""
]
] |
new_dataset
| 0.997795 |
1003.1422
|
Onur Ozan Koyluoglu
|
O. Ozan Koyluoglu and Hesham El Gamal
|
Polar Coding for Secure Transmission and Key Agreement
|
Proceedings of the 21st Annual IEEE International Symposium on
Personal, Indoor, and Mobile Radio Communications (PIMRC 2010), Sept. 2010,
Istanbul, Turkey
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wyner's work on wiretap channels and the recent works on information
theoretic security are based on random codes. Achieving information theoretical
security with practical coding schemes is of definite interest. In this note,
the attempt is to overcome this elusive task by employing the polar coding
technique of Ar{\i}kan. It is shown that polar codes achieve non-trivial
perfect secrecy rates for binary-input degraded wiretap channels while enjoying
their low encoding-decoding complexity. In the special case of symmetric main
and eavesdropper channels, this coding technique achieves the secrecy capacity.
Next, fading erasure wiretap channels are considered and a secret key agreement
scheme is proposed, which requires only the statistical knowledge of the
eavesdropper channel state information (CSI). The enabling factor is the
creation of advantage over Eve, by blindly using the proposed scheme over each
fading block, which is then exploited with privacy amplification techniques to
generate secret keys.
|
[
{
"version": "v1",
"created": "Sat, 6 Mar 2010 23:52:30 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Koyluoglu",
"O. Ozan",
""
],
[
"Gamal",
"Hesham El",
""
]
] |
new_dataset
| 0.974193 |
1003.1492
|
Rdv Ijcsis
|
Harshvardhan Tiwari, Dr. Krishna Asawa
|
A Secure Hash Function MD-192 With Modified Message Expansion
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Cryptographic hash functions play a central role in cryptography. Hash
functions were introduced in cryptology to provide message integrity and
authentication. MD5, SHA1 and RIPEMD are among the most commonly used message
digest algorithm. Recently proposed attacks on well known and widely used hash
functions motivate a design of new stronger hash function. In this paper a new
approach is presented that produces 192 bit message digest and uses a modified
message expansion mechanism which generates more bit difference in each working
variable to make the algorithm more secure. This hash function is collision
resistant and assures a good compression and preimage resistance.
|
[
{
"version": "v1",
"created": "Sun, 7 Mar 2010 17:03:10 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Tiwari",
"Harshvardhan",
""
],
[
"Asawa",
"Dr. Krishna",
""
]
] |
new_dataset
| 0.99535 |
1003.1497
|
Rdv Ijcsis
|
Bala Dhandayuthapani Veerasamy
|
Creating A Model HTTP Server Program Using java
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
HTTP Server is a computer programs that serves webpage content to clients. A
webpage is a document or resource of information that is suitable for the World
Wide Web and can be accessed through a web browser and displayed on a computer
screen. This information is usually in HTML format, and may provide navigation
to other webpage's via hypertext links. WebPages may be retrieved from a local
computer or from a remote HTTP Server. WebPages are requested and served from
HTTP Servers using Hypertext Transfer Protocol (HTTP). WebPages may consist of
files of static or dynamic text stored within the HTTP Server's file system.
Client-side scripting can make WebPages more responsive to user input once in
the client browser. This paper encompasses the creation of HTTP server program
using java language, which is basically supporting for HTML and JavaScript.
|
[
{
"version": "v1",
"created": "Sun, 7 Mar 2010 17:25:28 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Veerasamy",
"Bala Dhandayuthapani",
""
]
] |
new_dataset
| 0.999088 |
1003.1502
|
Rdv Ijcsis
|
Farhan Hassan Khan, Saba Bashir, M.Younus Javed, Aihab Khan, Malik
Sikandar Hayat Khiyal
|
QoS Based Dynamic Web Services Composition & Execution
|
Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
5500, http://sites.google.com/site/ijcsis/
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The use of web services has dominated software industry. Existing
technologies of web services are extended to give value added customized
services to customers through composition. Automated web service composition is
a very challenging task. This paper proposed the solution of existing problems
and proposed a technique by combination of interface based and functionality
based rules. The proposed framework also solves the issues related to
unavailability of updated information and inaccessibility of web services from
repository/databases due to any fault/failure. It provides updated information
problem by adding aging factor in repository/WSDB (Web Services Database) and
inaccessibility is solved by replication of WSDB. We discussed data
distribution techniques and proposed our framework by using one of these
strategies by considering quality of service issues. Finally, our algorithm
eliminates the dynamic service composition and execution issues, supports web
service composition considering QoS (Quality of Service), efficient data
retrieval and updation, fast service distribution and fault tolerance.
|
[
{
"version": "v1",
"created": "Sun, 7 Mar 2010 17:52:14 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Khan",
"Farhan Hassan",
""
],
[
"Bashir",
"Saba",
""
],
[
"Javed",
"M. Younus",
""
],
[
"Khan",
"Aihab",
""
],
[
"Khiyal",
"Malik Sikandar Hayat",
""
]
] |
new_dataset
| 0.997976 |
1003.1572
|
Stephan Schroevers
|
Stephan Schroevers
|
Expressiveness and Extensions of an Instruction Sequence Semigroup
|
Master's thesis - Master of Logic - University of Amsterdam
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PGA, short for ProGram Algebra, describes sequential programs as finite or
infinite (repeating) sequences of instructions. The semigroup C of finite
instruction sequences was introduced as an equally expressive alternative to
PGA. PGA instructions are executed from left to right; most C instructions come
in a left-to-right as well as a right-to-left flavor. This thesis builds on C
by introducing an alternative semigroup Cg which employs label and goto
instructions instead of relative jump instructions as control structures. Cg
can be translated to C and vice versa (and is thus equally expressive). It is
shown that restricting the instruction sets of C and Cg to contain only
finitely many distinct jump, goto or label instructions in either or both
directions reduces their expressiveness. Instruction sets with an infinite
number of these instructions in both directions (not necessarily all such
instructions) do not suffer a loss of expressiveness.
|
[
{
"version": "v1",
"created": "Mon, 8 Mar 2010 08:56:17 GMT"
}
] | 2010-03-09T00:00:00 |
[
[
"Schroevers",
"Stephan",
""
]
] |
new_dataset
| 0.970069 |
1002.4665
|
Jordan Boyd-Graber
|
Jordan Boyd-Graber, David M. Blei
|
Syntactic Topic Models
| null | null | null | null |
cs.CL cs.AI math.ST stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The syntactic topic model (STM) is a Bayesian nonparametric model of language
that discovers latent distributions of words (topics) that are both
semantically and syntactically coherent. The STM models dependency parsed
corpora where sentences are grouped into documents. It assumes that each word
is drawn from a latent topic chosen by combining document-level features and
the local syntactic context. Each document has a distribution over latent
topics, as in topic models, which provides the semantic consistency. Each
element in the dependency parse tree also has a distribution over the topics of
its children, as in latent-state syntax models, which provides the syntactic
consistency. These distributions are convolved so that the topic of each word
is likely under both its document and syntactic context. We derive a fast
posterior inference algorithm based on variational methods. We report
qualitative and quantitative studies on both synthetic data and hand-parsed
documents. We show that the STM is a more predictive model of language than
current models based only on syntax or only on topics.
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2010 00:00:47 GMT"
}
] | 2010-03-04T00:00:00 |
[
[
"Boyd-Graber",
"Jordan",
""
],
[
"Blei",
"David M.",
""
]
] |
new_dataset
| 0.987423 |
1003.0735
|
Lili Zhang
|
Lili Zhang, Jinhua Jiang, Shuguang Cui
|
Compress-and-Forward Performance in Low-SNR Relay Channels
|
13 pages, 5 figures, submitted to IEEE Transactions on Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the Gaussian relay channels in the low
signal-to-noise ratio (SNR) regime with the time-sharing compress-and-forward
(CF) scheme, where at each time slot all the nodes keep silent at the first
fraction of time and then transmit with CF at a higher peak power in the second
fraction. Such a silent vs. active two-phase relay scheme is preferable in the
low-SNR regime. With this setup, the upper and lower bounds on the minimum
energy per bit required over the relay channel are established under both
full-duplex and half-duplex relaying modes. In particular, the lower bound is
derived by applying the max-flow min-cut capacity theorem; the upper bound is
established with the aforementioned time-sharing CF scheme, and is further
minimized by letting the active phase fraction decrease to zero at the same
rate as the SNR value. Numerical results are presented to validate the
theoretical results.
|
[
{
"version": "v1",
"created": "Wed, 3 Mar 2010 06:12:47 GMT"
}
] | 2010-03-04T00:00:00 |
[
[
"Zhang",
"Lili",
""
],
[
"Jiang",
"Jinhua",
""
],
[
"Cui",
"Shuguang",
""
]
] |
new_dataset
| 0.980876 |
1003.0662
|
Carla Selmi
|
Mustapha Arfi (LITIS), Bedine Ould M. Lemine (LITIS), Carla Selmi
(LITIS)
|
Strategical languages of infinite words
| null |
Information Processing Letters 109 (2009) 749-753
| null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We deal in this paper with strategical languages of infinite words, that is
those generated by a nondeterministic strategy in the sense of game theory. We
first show the existence of a minimal strategy for such languages, for which we
give an explicit expression. Then we characterize the family of strategical
languages as that of closed ones, in the topological space of infinite words.
Finally, we give a definition of a Nash equilibrium for such languages, that we
illustrate with a famous example.
|
[
{
"version": "v1",
"created": "Tue, 2 Mar 2010 19:47:21 GMT"
}
] | 2010-03-03T00:00:00 |
[
[
"Arfi",
"Mustapha",
"",
"LITIS"
],
[
"Lemine",
"Bedine Ould M.",
"",
"LITIS"
],
[
"Selmi",
"Carla",
"",
"LITIS"
]
] |
new_dataset
| 0.994797 |
1002.4996
|
Zhi Xu
|
Lila Kari, Shinnosuke Seki, Zhi Xu
|
Triangular Self-Assembly
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the self-assembly system of triangular tiles instead of square
tiles, in particular right triangular tiles and equilateral triangular tiles.
We show that the triangular tile assembly system, either deterministic or
non-deterministic, has the same power to the square tile assembly system in
computation, which is Turing universal. By providing counter-examples, we show
that the triangular tile assembly system and the square tile assembly system
are not comparable in general. More precisely, there exists square tile
assembly system S such that no triangular tile assembly system is a division of
S and produces the same shape; there exists triangular tile assembly system T
such that no square tile assembly system produces the same compatible shape
with border glues. We also discuss the assembly of triangles by triangular
tiles and obtain results similar to the assembly of squares, that is to
assemble a triangular of size O(N^2), the minimal number of tiles required is
in O(log N/log log N).
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2010 14:27:20 GMT"
}
] | 2010-03-01T00:00:00 |
[
[
"Kari",
"Lila",
""
],
[
"Seki",
"Shinnosuke",
""
],
[
"Xu",
"Zhi",
""
]
] |
new_dataset
| 0.998984 |
1002.5026
|
Ersen Ekrem
|
Ersen Ekrem and Sennur Ulukus
|
Capacity Region of Gaussian MIMO Broadcast Channels with Common and
Confidential Messages
|
Submitted to IEEE Transactions on Information Theory, February 2010.
Conference version submitted to IEEE ISIT, January 2010
| null | null | null |
cs.IT cs.CR 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 needs to be 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 obtain 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": "Fri, 26 Feb 2010 18:26:45 GMT"
}
] | 2010-03-01T00:00:00 |
[
[
"Ekrem",
"Ersen",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.994295 |
0912.4115
|
Swaminathan Sankararaman
|
Swaminathan Sankararaman, Alon Efrat, Srinivasan Ramasubramanian,
Pankaj K. Agarwal
|
On Channel-Discontinuity-Constraint Routing in Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-channel wireless networks are increasingly being employed as
infrastructure networks, e.g. in metro areas. Nodes in these networks
frequently employ directional antennas to improve spatial throughput. In such
networks, given a source and destination, it is of interest to compute an
optimal path and channel assignment on every link in the path such that the
path bandwidth is the same as that of the link bandwidth and such a path
satisfies the constraint that no two consecutive links on the path are assigned
the same channel, referred to as "Channel Discontinuity Constraint" (CDC).
CDC-paths are also quite useful for TDMA system, where preferably every
consecutive links along a path are assigned different time slots.
This paper contains several contributions. We first present an $O(N^{2})$
distributed algorithm for discovering the shortest CDC-path between given
source and destination. This improves the running time of the $O(N^{3})$
centralized algorithm of Ahuja et al. for finding the minimum-weight CDC-path.
Our second result is a generalized $t$-spanner for CDC-path; For any $\theta>0$
we show how to construct a sub-network containing only $O(\frac{N}{\theta})$
edges, such that that length of shortest CDC-paths between arbitrary sources
and destinations increases by only a factor of at most
$(1-2\sin{\tfrac{\theta}{2}})^{-2}$. We propose a novel algorithm to compute
the spanner in a distributed manner using only $O(n\log{n})$ messages. An
important conclusion of this scheme is in the case of directional antennas are
used. In this case, it is enough to consider only the two closest nodes in each
cone.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2009 09:34:26 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Feb 2010 19:36:56 GMT"
}
] | 2010-02-26T00:00:00 |
[
[
"Sankararaman",
"Swaminathan",
""
],
[
"Efrat",
"Alon",
""
],
[
"Ramasubramanian",
"Srinivasan",
""
],
[
"Agarwal",
"Pankaj K.",
""
]
] |
new_dataset
| 0.999262 |
1002.4836
|
Ashley Smith
|
Prasun Ghosal, Malabika Biswas and Manish Biswas
|
Hardware Implementation of TDES Crypto System with On Chip Verification
in FPGA
|
Journal of Telecommunications,Volume 1, Issue 1, pp113-117, February
2010
|
P. Ghosal, M. Biswas and M. Biswas, "Hardware Implementation of
TDES Crypto System with On Chip Verification in FPGA", Journal of
Telecommunications, Volume 1, Issue 1, pp113-117, February 2010
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security issues are playing dominant role in today's high speed communication
systems. A fast and compact FPGA based implementation of the Data Encryption
Standard (DES) and Triple DES algorithm is presented in this paper that is
widely used in cryptography for securing the Internet traffic in modern day
communication systems. The design of the digital cryptographic circuit was
implemented in a Vertex 5 series (XCVLX5110T) target device with the use of
VHDL as the hardware description language. In order to confirm the expected
behavior of these algorithms, the proposed design was extensively simulated,
synthesized for different FPGA devices both in Spartan and Virtex series from
Xilinx viz. Spartan 3, Spartan 3AN, Virtex 5, Virtex E device families. The
novelty and contribution of this work is in three folds: (i) Extensive
simulation and synthesis of the proposed design targeted for various FPGA
devices, (ii) Complete hardware implementation of encryption and decryption
algorithms onto Virtex 5 series device (XCVLX5110T) based FPGA boards and,
(iii) Generation of ICON and VIO core for the design and on chip verification
and analyzing using Chipscope Pro. The experimental as well as implementation
results compared to the implementations reported so far are quite encouraging.
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2010 17:24:25 GMT"
}
] | 2010-02-26T00:00:00 |
[
[
"Ghosal",
"Prasun",
""
],
[
"Biswas",
"Malabika",
""
],
[
"Biswas",
"Manish",
""
]
] |
new_dataset
| 0.960451 |
1001.4108
|
Justin Smith
|
Ben Lund, Justin W Smith
|
A Multi-Stage CUDA Kernel for Floyd-Warshall
|
9 pages, 7 figures, 1 table
| null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new implementation of the Floyd-Warshall All-Pairs Shortest
Paths algorithm on CUDA. Our algorithm runs approximately 5 times faster than
the previously best reported algorithm. In order to achieve this speedup, we
applied a new technique to reduce usage of on-chip shared memory and allow the
CUDA scheduler to more effectively hide instruction latency.
|
[
{
"version": "v1",
"created": "Sat, 23 Jan 2010 00:22:33 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Feb 2010 02:01:14 GMT"
}
] | 2010-02-25T00:00:00 |
[
[
"Lund",
"Ben",
""
],
[
"Smith",
"Justin W",
""
]
] |
new_dataset
| 0.999129 |
1002.4510
|
Joaquim Borges
|
Joaquim Borges, Josep Rifa, Victor Zinoviev
|
On linear $q$-ary completely regular codes with $\rho=2$ and dual
antipodal
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We characterize all linear $q$-ary completely regular codes with covering
radius $\rho=2$ when the dual codes are antipodal. These completely regular
codes are extensions of linear completely regular codes with covering radius 1,
which are all classified. For $\rho=2$, we give a list of all such codes known
to us. This also gives the characterization of two weight linear antipodal
codes.
|
[
{
"version": "v1",
"created": "Wed, 24 Feb 2010 10:15:57 GMT"
}
] | 2010-02-25T00:00:00 |
[
[
"Borges",
"Joaquim",
""
],
[
"Rifa",
"Josep",
""
],
[
"Zinoviev",
"Victor",
""
]
] |
new_dataset
| 0.998111 |
cs/0611010
|
Diego Ruano
|
Diego Ruano
|
On the structure of generalized toric codes
| null |
The final version can be found in: Journal of Symbolic
Computation. Volume 44, Issue 5, May 2009, Pages 499-506
| null | null |
cs.IT math.IT
| null |
Toric codes are obtained by evaluating rational functions of a nonsingular
toric variety at the algebraic torus. One can extend toric codes to the so
called generalized toric codes. This extension consists on evaluating elements
of an arbitrary polynomial algebra at the algebraic torus instead of a linear
combination of monomials whose exponents are rational points of a convex
polytope. We study their multicyclic and metric structure, and we use them to
express their dual and to estimate their minimum distance.
|
[
{
"version": "v1",
"created": "Thu, 2 Nov 2006 14:18:07 GMT"
}
] | 2010-02-25T00:00:00 |
[
[
"Ruano",
"Diego",
""
]
] |
new_dataset
| 0.996987 |
1002.4303
|
Wojciech Mazurczyk
|
Wojciech Mazurczyk, Krzysztof Cabaj, Krzysztof Szczypiorski
|
What are suspicious VoIP delays?
|
17 pages, 12 figures
| null | null | null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice over IP (VoIP) is unquestionably the most popular real-time service in
IP networks today. Recent studies have shown that it is also a suitable carrier
for information hiding. Hidden communication may pose security concerns as it
can lead to confidential information leakage. In VoIP, RTP (Real-time Transport
Protocol) in particular, which provides the means for the successful transport
of voice packets through IP networks, is suitable for steganographic purposes.
It is characterised by a high packet rate compared to other protocols used in
IP telephony, resulting in a potentially high steganographic bandwidth. The
modification of an RTP packet stream provides many opportunities for hidden
communication as the packets may be delayed, reordered or intentionally lost.
In this paper, to enable the detection of steganographic exchanges in VoIP, we
examined real RTP traffic traces to answer the questions, what do the "normal"
delays in RTP packet streams look like? and, is it possible to detect the use
of known RTP steganographic methods based on this knowledge?
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2010 11:22:50 GMT"
}
] | 2010-02-24T00:00:00 |
[
[
"Mazurczyk",
"Wojciech",
""
],
[
"Cabaj",
"Krzysztof",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.986903 |
1002.3629
|
Jing ( Tiffany ) Li
|
Xingkai Bao, and Jing Li (Tiffany)
|
Generalized Adaptive Network Coded Cooperation (GANCC): A Unified
Framework for Network Coding and Channel Coding
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers distributed coding for multi-source single-sink data
collection wireless networks. A unified framework for network coding and
channel coding, termed "generalized adaptive network coded cooperation"
(GANCC), is proposed. Key ingredients of GANCC include: matching code graphs
with the dynamic network graphs on-the-fly, and integrating channel coding with
network coding through circulant low-density parity-check codes. Several code
constructing methods and several families of sparse-graph codes are proposed,
and information theoretical analysis is performed. It is shown that GANCC is
simple to operate, adaptive in real time, distributed in nature, and capable of
providing remarkable coding gains even with a very limited number of
cooperating users.
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2010 22:28:03 GMT"
}
] | 2010-02-22T00:00:00 |
[
[
"Bao",
"Xingkai",
"",
"Tiffany"
],
[
"Li",
"Jing",
"",
"Tiffany"
]
] |
new_dataset
| 0.956788 |
0910.3123
|
Johannes Fischer
|
Johannes Fischer
|
Wee LCP
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that longest common prefix (LCP) information can be stored in much
less space than previously known. More precisely, we show that in the presence
of the text and the suffix array, o(n) additional bits are sufficient to answer
LCP-queries asymptotically in the same time that is needed to retrieve an entry
from the suffix array. This yields the smallest compressed suffix tree with
sub-logarithmic navigation time.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2009 13:50:12 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Feb 2010 09:19:42 GMT"
}
] | 2010-02-19T00:00:00 |
[
[
"Fischer",
"Johannes",
""
]
] |
new_dataset
| 0.973427 |
1002.3409
|
Subhash Kak
|
Subhash Kak
|
Aryabhata's Mathematics
|
Keynote Lecture at RSA Conference, San Jose, February 13-17, 2006
| null | null | null |
cs.CR math.HO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents certains aspects of the mathematics of Aryabhata that are
of interest to the cryptography community.
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2010 00:14:25 GMT"
}
] | 2010-02-19T00:00:00 |
[
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.999881 |
1002.3521
|
Ryuhei Mori
|
Ryuhei Mori
|
Properties and Construction of Polar Codes
|
Master thesis. The supervisor is Toshiyuki Tanaka. 24 pages, 3
figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Ar{\i}kan introduced the method of channel polarization on which
one can construct efficient capacity-achieving codes, called polar codes, for
any binary discrete memoryless channel. In the thesis, we show that decoding
algorithm of polar codes, called successive cancellation decoding, can be
regarded as belief propagation decoding, which has been used for decoding of
low-density parity-check codes, on a tree graph. On the basis of the
observation, we show an efficient construction method of polar codes using
density evolution, which has been used for evaluation of the error probability
of belief propagation decoding on a tree graph. We further show that channel
polarization phenomenon and polar codes can be generalized to non-binary
discrete memoryless channels. Asymptotic performances of non-binary polar
codes, which use non-binary matrices called the Reed-Solomon matrices, are
better than asymptotic performances of the best explicitly known binary polar
code. We also find that the Reed-Solomon matrices are considered to be natural
generalization of the original binary channel polarization introduced by
Ar{\i}kan.
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2010 14:19:34 GMT"
}
] | 2010-02-19T00:00:00 |
[
[
"Mori",
"Ryuhei",
""
]
] |
new_dataset
| 0.977895 |
1002.3307
|
Yusuke Watanabe
|
Yusuke Watanabe and Kenji Fukumizu
|
Graph Zeta Function in the Bethe Free Energy and Loopy Belief
Propagation
|
19 pages, Annual Conference on Neural Information Processing Systems
(NIPS 2009), together with the supplementary material
|
Advances in Neural Information Processing Systems 22, pages
2017-2025
| null | null |
cs.AI cs.DM math-ph math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new approach to the analysis of Loopy Belief Propagation (LBP)
by establishing a formula that connects the Hessian of the Bethe free energy
with the edge zeta function. The formula has a number of theoretical
implications on LBP. It is applied to give a sufficient condition that the
Hessian of the Bethe free energy is positive definite, which shows
non-convexity for graphs with multiple cycles. The formula clarifies the
relation between the local stability of a fixed point of LBP and local minima
of the Bethe free energy. We also propose a new approach to the uniqueness of
LBP fixed point, and show various conditions of uniqueness.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 17:55:58 GMT"
}
] | 2010-02-18T00:00:00 |
[
[
"Watanabe",
"Yusuke",
""
],
[
"Fukumizu",
"Kenji",
""
]
] |
new_dataset
| 0.990436 |
1002.3333
|
Ashley Smith
|
Ijaj Md. Laisuzzaman, Nahid Imran, Abdullah Al Nahid, Md. Ziaul and
Md. Abdul Alim
|
The Framework for Implementing ECommerce: The Role of Bank and Telecom
in Bangladesh
|
Journal of Telecommunications,Volume 1, Issue 1, pp57-62, February
2010
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe an effective framework for adapting electronic
commerce or e-commerce services in developing countries like Bangladesh. The
internet has opened up a new horizon for commerce, namely electronic commerce
(e-commerce). It entails the use of the internet in the marketing,
identification, payment and delivery of goods and services. At present internet
facilities are available in Bangladesh. Slowly, but steadily these facilities
are holding a strong position in every aspects of our life. E-commerce is one
of those sectors which need more attention if we want to be a part of global
business. Bangladesh is far-far away to adapt the main stream of e-commerce
application. Though government is shouting to take the challenges of
e-commerce, but they do not take the right step, that is why e-commerce dose
not make any real contribution in our socio-economic life. Here we propose a
model which may develop the e-commerce infrastructure of Bangladesh.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 18:04:15 GMT"
}
] | 2010-02-18T00:00:00 |
[
[
"Laisuzzaman",
"Ijaj Md.",
""
],
[
"Imran",
"Nahid",
""
],
[
"Nahid",
"Abdullah Al",
""
],
[
"Ziaul",
"Md.",
""
],
[
"Alim",
"Md. Abdul",
""
]
] |
new_dataset
| 0.983875 |
1002.3340
|
Ashley Smith
|
S. N. Singh and A. K. Singh
|
FPGA Based Sinusoidal Pulse Width Modulated Waveform Generation for
Solar (PV) Rural Home Power Inverter
|
Journal of Telecommunications,Volume 1, Issue 1, pp72-79, February
2010
|
S. N. Singh and A. K. Singh, "FPGA Based Sinusoidal Pulse Width
Modulated Waveform Generation for Solar (PV) Rural Home Power Inverter",
Journal of Telecommunications, Volume 1, Issue 1, pp72-79, February 2010
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing concern about global environmental protection and energy
demand due to rapid growth of population in developing countries and the
diminishing trend of resources of conventional grid supply, the need to produce
freely available pollution free natural energy such as solar/wind energy has
been drawing increasing interest in every corner of the world. In an effort to
utilize these energies effectively through Power converter, a great deal of
research is being carried out by different researchers / scientist and
engineers at different places in the world to meet the increasing demand of
load. The study presents methodology to integrate solar (PV) energy (which is
freely available in every corner of the world) with grid source and supplement
the existing grid power in rural houses during its cut off or restricted supply
period. In order to get consistency in supply a DG is also added as a standby
source in the proposed integration of network. The software using novel Direct
PWM modulation strategy and its soft control features extend the flexibility to
control converter (inverter) parameters like voltage, frequency, number of
samples of PWM pulses constituting sine-wave without changing any hardware
configuration in the circuit. The system simulation of PWM Pulse generation has
been done on a XILINX based FPGA Spartan 3E board using VHDL code. The test on
simulation of PWM generation program after synthesis and compilation were
recorded and verified on a prototype sample.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 18:16:57 GMT"
}
] | 2010-02-18T00:00:00 |
[
[
"Singh",
"S. N.",
""
],
[
"Singh",
"A. K.",
""
]
] |
new_dataset
| 0.99945 |
0909.3226
|
Stefano Buzzi
|
Stefano Buzzi, Luca Venturino, Alessio Zappone, Antonio De Maio
|
Blind user detection in doubly-dispersive DS/CDMA channels
|
Accepted for publication on IEEE Transactions on Signal Processing
|
IEEE Transactions on Signal Processing, Vol. 58, No. 3, pp. 1446 -
1451, March 2010
|
10.1109/TSP.2009.2033001
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we consider the problem of detecting the presence of a new user
in a direct-sequence/code-division-multiple-access (DS/CDMA) system with a
doubly-dispersive fading channel, and we propose a novel blind detection
strategy which only requires knowledge of the spreading code of the user to be
detected, but no prior information as to the time-varying channel impulse
response and the structure of the multiaccess interference. The proposed
detector has a bounded constant false alarm rate (CFAR) under the design
assumptions, while providing satisfactory detection performance even in the
presence of strong cochannel interference and high user mobility.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2009 14:10:09 GMT"
}
] | 2010-02-17T00:00:00 |
[
[
"Buzzi",
"Stefano",
""
],
[
"Venturino",
"Luca",
""
],
[
"Zappone",
"Alessio",
""
],
[
"De Maio",
"Antonio",
""
]
] |
new_dataset
| 0.959908 |
1002.2966
|
Salah A. Aly
|
Salah A. Aly, Alexei Ashikhmin
|
Nonbinary Quantum Cyclic and Subsystem Codes Over
Asymmetrically-decohered Quantum Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum computers theoretically are able to solve certain problems more
quickly than any deterministic or probabilistic computers. A quantum computer
exploits the rules of quantum mechanics to speed up computations. However, one
has to mitigate the resulting noise and decoherence effects to avoid
computational errors in order to successfully build quantum computers.
In this paper, we construct asymmetric quantum codes to protect quantum
information over asymmetric quantum channels, $\Pr Z \geq \Pr X$. Two generic
methods are presented 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 quantum
BCH, RS, and RM codes over asymmetric quantum channels. Finally, the methods
are used to construct families of asymmetric subsystem codes.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2010 22:17:56 GMT"
}
] | 2010-02-17T00:00:00 |
[
[
"Aly",
"Salah A.",
""
],
[
"Ashikhmin",
"Alexei",
""
]
] |
new_dataset
| 0.998978 |
1002.3083
|
Rafael Caballero
|
Hai-Feng Guo, Wen Zheng, Mahadevan Subramaniam
|
L2C2: Logic-based LSC Consistency Checking
|
To be included in the on-line proceedings of WLPE'2009
|
WLPE 2009 proceedings
| null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Live sequence charts (LSCs) have been proposed as an inter-object
scenario-based specification and visual programming language for reactive
systems. In this paper, we introduce a logic-based framework to check the
consistency of an LSC specification. An LSC simulator has been implemented in
logic programming, utilizing a memoized depth-first search strategy, to show
how a reactive system in LSCs would response to a set of external event
sequences. A formal notation is defined to specify external event sequences,
extending the regular expression with a parallel operator and a testing
control. The parallel operator allows interleaved parallel external events to
be tested in LSCs simultaneously; while the testing control provides users to a
new approach to specify and test certain temporal properties (e.g., CTL
formula) in a form of LSC. Our framework further provides either a state
transition graph or a failure trace to justify the consistency checking
results.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 14:09:43 GMT"
}
] | 2010-02-17T00:00:00 |
[
[
"Guo",
"Hai-Feng",
""
],
[
"Zheng",
"Wen",
""
],
[
"Subramaniam",
"Mahadevan",
""
]
] |
new_dataset
| 0.9985 |
1002.2867
|
EPTCS
|
Magnus Johansson (Uppsala University), Bj\"orn Victor (Uppsala
University), Joachim Parrow (Uppsala University)
|
A Fully Abstract Symbolic Semantics for Psi-Calculi
| null |
EPTCS 18, 2010, pp. 17-31
|
10.4204/EPTCS.18.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a symbolic transition system and bisimulation equivalence for
psi-calculi, and show that it is fully abstract with respect to bisimulation
congruence in the non-symbolic semantics.
A psi-calculus is an extension of the pi-calculus with nominal data types for
data structures and for logical assertions representing facts about data. These
can be transmitted between processes and their names can be statically scoped
using the standard pi-calculus mechanism to allow for scope migrations.
Psi-calculi can be more general than other proposed extensions of the
pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion
calculus, or the concurrent constraint pi-calculus.
Symbolic semantics are necessary for an efficient implementation of the
calculus in automated tools exploring state spaces, and the full abstraction
property means the semantics of a process does not change from the original.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2010 12:30:43 GMT"
}
] | 2010-02-16T00:00:00 |
[
[
"Johansson",
"Magnus",
"",
"Uppsala University"
],
[
"Victor",
"Björn",
"",
"Uppsala\n University"
],
[
"Parrow",
"Joachim",
"",
"Uppsala University"
]
] |
new_dataset
| 0.997666 |
1002.2872
|
EPTCS
|
Gilles Dowek (\'Ecole Polytechnique and INRIA), C\'esar Mu\~noz
(National Institute of Aerospace), Camilo Rocha (University of Illinois)
|
Rewriting Logic Semantics of a Plan Execution Language
| null |
EPTCS 18, 2010, pp. 77-91
|
10.4204/EPTCS.18.6
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Plan Execution Interchange Language (PLEXIL) is a synchronous language
developed by NASA to support autonomous spacecraft operations. In this paper,
we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance
logical engine. The rewriting logic semantics is by itself a formal interpreter
of the language and can be used as a semantic benchmark for the implementation
of PLEXIL executives. The implementation in Maude has the additional benefit of
making available to PLEXIL designers and developers all the formal analysis and
verification tools provided by Maude. The formalization of the PLEXIL semantics
in rewriting logic poses an interesting challenge due to the synchronous nature
of the language and the prioritized rules defining its semantics. To overcome
this difficulty, we propose a general procedure for simulating synchronous set
relations in rewriting logic that is sound and, for deterministic relations,
complete. We also report on two issues at the design level of the original
PLEXIL semantics that were identified with the help of the executable
specification in Maude.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2010 12:48:09 GMT"
}
] | 2010-02-16T00:00:00 |
[
[
"Dowek",
"Gilles",
"",
"École Polytechnique and INRIA"
],
[
"Muñoz",
"César",
"",
"National Institute of Aerospace"
],
[
"Rocha",
"Camilo",
"",
"University of Illinois"
]
] |
new_dataset
| 0.997475 |
0909.3790
|
Mikhail Berlinkov
|
M.V. Berlinkov
|
On Carpi and Alessandro conjecture
|
11 pages, 1 figure
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The well known open \v{C}ern\'y conjecture states that each \san with $n$
states has a \sw of length at most $(n-1)^2$. On the other hand, the best known
upper bound is cubic of $n$. Recently, in the paper \cite{CARPI1} of Alessandro
and Carpi, the authors introduced the new notion of strongly transitivity for
automata and conjectured that this property with a help of \emph{Extension}
method allows to get a quadratic upper bound for the length of the shortest
\sws. They also confirmed this conjecture for circular automata. We disprove
this conjecture and the long-standing \emph{Extension} conjecture too. We also
consider the widely used Extension method and its perspectives.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2009 14:43:15 GMT"
},
{
"version": "v2",
"created": "Sun, 14 Feb 2010 12:09:32 GMT"
}
] | 2010-02-15T00:00:00 |
[
[
"Berlinkov",
"M. V.",
""
]
] |
new_dataset
| 0.956124 |
0910.4839
|
Patrick Erik Bradley
|
Patrick Erik Bradley
|
A $p$-adic RanSaC algorithm for stereo vision using Hensel lifting
|
15 pages; typos removed, abstract changed, computation error removed
|
p-Adic Numbers, Ultrametric Analysis, and Applications, Vol. 2,
No. 1 (2010), 55-67
|
10.1134/S2070046610010048
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $p$-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solving
the relative pose problem in stereo vision is developped. From two 2-adically
encoded images a random sample of five pairs of corresponding points is taken,
and the equations for the essential matrix are solved by lifting solutions
modulo 2 to the 2-adic integers. A recently devised $p$-adic hierarchical
classification algorithm imitating the known LBG quantisation method classifies
the solutions for all the samples after having determined the number of
clusters using the known intra-inter validity of clusterings. In the successful
case, a cluster ranking will determine the cluster containing a 2-adic
approximation to the "true" solution of the problem.
|
[
{
"version": "v1",
"created": "Mon, 26 Oct 2009 09:34:29 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Nov 2009 17:24:27 GMT"
}
] | 2010-02-15T00:00:00 |
[
[
"Bradley",
"Patrick Erik",
""
]
] |
new_dataset
| 0.979336 |
1002.2353
|
Hamed Haddadi
|
Hamed Haddadi
|
Fighting Online Click-Fraud Using Bluff Ads
|
Draft
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Online advertising is currently the greatest source of revenue for many
Internet giants. The increased number of specialized websites and modern
profiling techniques, have all contributed to an explosion of the income of ad
brokers from online advertising. The single biggest threat to this growth, is
however, click-fraud. Trained botnets and even individuals are hired by
click-fraud specialists in order to maximize the revenue of certain users from
the ads they publish on their websites, or to launch an attack between
competing businesses.
In this note we wish to raise the awareness of the networking research
community on potential research areas within this emerging field. As an example
strategy, we present Bluff ads; a class of ads that join forces in order to
increase the effort level for click-fraud spammers. Bluff ads are either
targeted ads, with irrelevant display text, or highly relevant display text,
with irrelevant targeting information. They act as a litmus test for the
legitimacy of the individual clicking on the ads. Together with standard
threshold-based methods, fake ads help to decrease click-fraud levels.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2010 14:59:22 GMT"
}
] | 2010-02-12T00:00:00 |
[
[
"Haddadi",
"Hamed",
""
]
] |
new_dataset
| 0.998813 |
1002.2408
|
Rdv Ijcsis
|
D. Jayanthi, N. Devi, S. SwarnaParvathi
|
Automatic diagnosis of retinal diseases from color retinal images
|
IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 234-238, January 2010, USA
| null |
Journal of Computer Science, ISSN 1947 5500
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Teleophthalmology holds a great potential to improve the quality, access, and
affordability in health care. For patients, it can reduce the need for travel
and provide the access to a superspecialist. Ophthalmology lends itself easily
to telemedicine as it is a largely image based diagnosis. The main goal of the
proposed system is to diagnose the type of disease in the retina and to
automatically detect and segment retinal diseases without human supervision or
interaction. The proposed system will diagnose the disease present in the
retina using a neural network based classifier.The extent of the disease spread
in the retina can be identified by extracting the textural features of the
retina. This system will diagnose the following type of diseases: Diabetic
Retinopathy and Drusen.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2010 19:54:08 GMT"
}
] | 2010-02-12T00:00:00 |
[
[
"Jayanthi",
"D.",
""
],
[
"Devi",
"N.",
""
],
[
"SwarnaParvathi",
"S.",
""
]
] |
new_dataset
| 0.97624 |
1002.2423
|
Rdv Ijcsis
|
Jatinder Singh, Savita Gupta, Lakhwinder Kaur
|
A MAC Layer Based Defense Architecture for Reduction of Quality (RoQ)
Attacks in Wireless LAN
|
IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 284-291, January 2010, USA
| null |
Journal of Computer Science, ISSN 1947 5500
|
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently an alternative of DDoS attacks called shrew attacks or Reduction of
Quality (RoQ) has been identified which is very much difficult to detect. The
RoQ attacks can use source and destination IP address spoofing, and they do not
have distinct periodicity, and may not filter the attack packets precisely. In
this paper, we propose to design the MAC layer based defense architecture for
RoQ attacks in Wireless LAN which includes the detection and response stages.
The attackers are detected by checking the RTS CTS packets from the MAC layer
and the corresponding attack flows are blocked or rejected. By our simulation
results, we show that our proposed technique achieves reduces the attack
throughput there by increasing the received bandwidth and reducing the packet
loss of legitimate users.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2010 20:38:04 GMT"
}
] | 2010-02-12T00:00:00 |
[
[
"Singh",
"Jatinder",
""
],
[
"Gupta",
"Savita",
""
],
[
"Kaur",
"Lakhwinder",
""
]
] |
new_dataset
| 0.985359 |
1002.2184
|
Rdv Ijcsis
|
V. Ashok, T. Balakumaran, C. Gowrishankar, I.L.A. Vennila, A. Nirmal
kumar
|
The Fast Haar Wavelet Transform for Signal & Image Processing
|
IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 126-130, January 2010, USA
| null |
Journal of Computer Science, ISSN 19475500
|
cs.MM cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A method for the design of Fast Haar wavelet for signal processing and image
processing has been proposed. In the proposed work, the analysis bank and
synthesis bank of Haar wavelet is modified by using polyphase structure.
Finally, the Fast Haar wavelet was designed and it satisfies alias free and
perfect reconstruction condition. Computational time and computational
complexity is reduced in Fast Haar wavelet transform.
|
[
{
"version": "v1",
"created": "Wed, 10 Feb 2010 19:27:25 GMT"
}
] | 2010-02-11T00:00:00 |
[
[
"Ashok",
"V.",
""
],
[
"Balakumaran",
"T.",
""
],
[
"Gowrishankar",
"C.",
""
],
[
"Vennila",
"I. L. A.",
""
],
[
"kumar",
"A. Nirmal",
""
]
] |
new_dataset
| 0.978168 |
1002.1773
|
Philippe Wenger
|
Philippe Wenger (IRCCyN)
|
Cuspidal and Noncuspidal Robot Manipulators
| null |
Robotica 25, 6 (2007) 717-724
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article synthezises the most important results on the kinematics of
cuspidal manipulators i.e. nonredundant manipulators that can change posture
without meeting a singularity. The characteristic surfaces, the uniqueness
domains and the regions of feasible paths in the workspace are defined. Then,
several sufficient geometric conditions for a manipulator to be noncuspidal are
enumerated and a general necessary and sufficient condition for a manipulator
to be cuspidal is provided. An explicit DH-parameter-based condition for an
orthogonal manipulator to be cuspidal is derived. The full classification of 3R
orthogonal manipulators is provided and all types of cuspidal and noncuspidal
orthogonal manipulators are enumerated. Finally, some facts about cuspidal and
noncuspidal 6R manipulators are reported.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2010 04:44:26 GMT"
}
] | 2010-02-10T00:00:00 |
[
[
"Wenger",
"Philippe",
"",
"IRCCyN"
]
] |
new_dataset
| 0.999573 |
1002.1828
|
Francesc Rossell\'o
|
Arnau Mir, Francesc Rossello
|
The median of the distance between two leaves in a phylogenetic tree
|
4 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish a limit formula for the median of the distance between two
leaves in a fully resolved unrooted phylogenetic tree with n leaves. More
precisely, we prove that this median is equal, in the limit, to the square root
of 4*ln(2)*n.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2010 11:39:48 GMT"
}
] | 2010-02-10T00:00:00 |
[
[
"Mir",
"Arnau",
""
],
[
"Rossello",
"Francesc",
""
]
] |
new_dataset
| 0.989329 |
1002.1953
|
Rdv Ijcsis
|
Dr. R. Shashikumar, C. N. Vijay Kumar, M. Nagendrakumar, C. S.
Hemanthkumar
|
Ahb Compatible DDR Sdram Controller Ip Core for Arm Based Soc
|
IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 77-85, January 2010, USA
| null |
Journal of Computer Science, ISSN 1947 5500
|
cs.AR cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DDR SDRAM is similar in function to the regular SDRAM but doubles the
bandwidth of the memory by transferring data on both edges of the clock cycles.
DDR SDRAM most commonly used in various embedded application like networking,
image or video processing, Laptops ete. Now a days many applications needs more
and more cheap and fast memory. Especially in the field of signal processing,
requires significant amount of memory. The most used type of dynamic memory for
that purpose is DDR SDRAM. For FPGA design the IC manufacturers are providing
commercial memory controller IP cores working only on their products. Main
disadvantage is the lack of memory access optimization for random memory access
patterns. The data path part of those controllers can be used free of charge.
This work propose an architecture of a DDR SDRAM controller, which takes
advantage of those available and well tested data paths and can be used for any
FPGA device or ASIC design.(5). In most of the SOC design, DDR SDRAM is
commonly used. ARM processor is widely used in SOCs; so that we focused to
implement AHB compatible DDR SDRAM controller suitable for ARM based SOC
design.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2010 19:47:34 GMT"
}
] | 2010-02-10T00:00:00 |
[
[
"Shashikumar",
"Dr. R.",
""
],
[
"Kumar",
"C. N. Vijay",
""
],
[
"Nagendrakumar",
"M.",
""
],
[
"Hemanthkumar",
"C. S.",
""
]
] |
new_dataset
| 0.9964 |
1002.1954
|
Rdv Ijcsis
|
Hadj Zerrouki, Mohamed Feham
|
High Throughput of WiMAX MIMO OFDM Including Adaptive Modulation and
Coding
|
IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 86-91, January 2010, USA
| null |
Journal of Computer Science, ISSN 1947 5500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WiMAX technology is based on the IEEE 802.16 specification of which IEEE
802.16-2004 and 802.16e amendment are Physical (PHY) layer specifications. IEEE
802.16-2004 currently supports several multiple-antenna options including
Space-Time Codes (STC), Multiple-Input Multiple-Output (MIMO) antenna systems
and Adaptive Antenna Systems (AAS). The most recent WiMAX standard (802.16e)
supports broadband applications to mobile terminals and laptops. Using Adaptive
Modulation and Coding (AMC) we analyze the performance of OFDM physical layer
in WiMAX based on the simulation results of Bit Error Rate (BER), and data
throughput. The performance analysis of OFDM PHY is done. In this paper, an
extension to the basic SISO mode, a number of 2 by 2 MIMO extensions are
analysed under different combinations of digital modulation (QPSK, 16QAM and
64QAM) and Convolutional Code (CC) with half, two-third and three quarter rated
codes. The intent of this paper is to provide an idea of the benefits of
multiple antenna systems over single antenna systems in WiMAX type deployments.
|
[
{
"version": "v1",
"created": "Tue, 9 Feb 2010 19:53:22 GMT"
}
] | 2010-02-10T00:00:00 |
[
[
"Zerrouki",
"Hadj",
""
],
[
"Feham",
"Mohamed",
""
]
] |
new_dataset
| 0.998858 |
1002.1549
|
Andrey Breslav
|
Andrey Breslav
|
Extensible type checker for parser generation
| null | null | null | null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parser generators generate translators from language specifications. In many
cases, such specifications contain semantic actions written in the same
language as the generated code. Since these actions are subject to little
static checking, they are usually a source of errors which are discovered only
when generated code is compiled.
In this paper we propose a parser generator front-end which statically checks
semantic actions for typing errors and prevents such errors from appearing in
generated code. The type checking procedure is extensible to support many
implementation languages. An extension for Java is presented along with an
extension for declarative type system descriptions.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2010 08:51:06 GMT"
}
] | 2010-02-09T00:00:00 |
[
[
"Breslav",
"Andrey",
""
]
] |
new_dataset
| 0.974415 |
1002.1687
|
Rdv Ijcsis
|
Mahendra kumar. S, Senthil Prakash. K
|
Wireless Congestion Control Protocol For Multihop Ad Hoc Networks
|
7 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/
|
International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 25-31, January 2010, USA
| null |
Computer Science Volume 7 ISSN 19475500
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The traditional TCP congestion control mechanism encounters a number of new
problems and suffers a poor performance when the IEEE 802.11 MAC protocol is
used in multihop ad hoc networks. Many of the problems result from medium
contention at the MAC layer. In this paper, I first illustrate that severe
medium contention and congestion are intimately coupled, and TCP s congestion
control algorithm becomes too coarse in its granularity, causing throughput
instability and excessively long delay. Further, we illustrate TCP s severe
unfairness problem due to the medium contention and the tradeoff between
aggregate throughput and fairness. Then, based on the novel use of channel
busyness ratio, a more accurate metric to characterize the network utilization
and congestion status, I propose a new wireless congestion control protocol
(WCCP) to efficiently and fairly support the transport service in multihop ad
hoc networks. In this protocol, each forwarding node along a traffic flow
exercises the internode and intranode fair resource allocation and determines
the MAC layer feedback accordingly. The endtoend feedback, which is ultimately
determined by the bottleneck node along the flow, is carried back to the source
to control its sending rate. Extensive simulations show that WCCP significantly
outperforms traditional TCP in terms of channel utilization, delay, and
fairness, and eliminates the starvation problem.
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2010 19:04:05 GMT"
}
] | 2010-02-09T00:00:00 |
[
[
"S",
"Mahendra kumar.",
""
],
[
"K",
"Senthil Prakash.",
""
]
] |
new_dataset
| 0.998813 |
0907.0877
|
Stephen Bloom
|
S.L. Bloom and Z. Esik
|
Algebraic Ordinals
|
30 pages
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An algebraic tree T is one determined by a finite system of fixed point
equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by
the lexicographic order \lex. When (\Fr(T),\lex) is well-ordered, its order
type is an \textbf{algebraic ordinal}. We prove that the algebraic ordinals are
exactly the ordinals less than $\omega^{\omega^\omega}$.
|
[
{
"version": "v1",
"created": "Sun, 5 Jul 2009 18:24:28 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Feb 2010 14:49:46 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Feb 2010 14:49:21 GMT"
}
] | 2010-02-08T00:00:00 |
[
[
"Bloom",
"S. L.",
""
],
[
"Esik",
"Z.",
""
]
] |
new_dataset
| 0.984894 |
1002.1099
|
Ioannis Chatzigiannakis
|
Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos,
Marios Logaras, Panagiotis Kokkinos, Paul Spirakis
|
The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based
on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a
Prototype Game
| null | null | null | null |
cs.HC cs.DC cs.MA cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we discuss multiplayer pervasive games that rely on the use of
ad hoc mobile sensor networks. The unique feature in such games is that players
interact with each other and their surrounding environment by using movement
and presence as a means of performing game-related actions, utilizing sensor
devices. We discuss the fundamental issues and challenges related to these type
of games and the scenarios associated with them. We also present and evaluate
an example of such a game, called the "Hot Potato", developed using the Sun
SPOT hardware platform. We provide a set of experimental results, so as to both
evaluate our implementation and also to identify issues that arise in pervasive
games which utilize sensor network nodes, which show that there is great
potential in this type of games.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2010 23:02:02 GMT"
}
] | 2010-02-08T00:00:00 |
[
[
"Chatzigiannakis",
"Ioannis",
""
],
[
"Mylonas",
"Georgios",
""
],
[
"Akribopoulos",
"Orestis",
""
],
[
"Logaras",
"Marios",
""
],
[
"Kokkinos",
"Panagiotis",
""
],
[
"Spirakis",
"Paul",
""
]
] |
new_dataset
| 0.968208 |
1002.1162
|
Vishal Goyal
|
Shuchita Upadhayaya, Charu Gandhi
|
Node Disjoint Multipath Routing Considering Link and Node Stability
protocol: A characteristic Evaluation
|
International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 2, January 2010,
http://ijcsi.org/articles/Node-Disjoint-Multipath-Routing-Considering-Link-and-Node-Stability-protocol-A-characteristic-Evaluation.php
|
International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 2, January 2010,
http://ijcsi.org/articles/Node-Disjoint-Multipath-Routing-Considering-Link-and-Node-Stability-protocol-A-characteristic-Evaluation.php
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS)
routing in such networks is usually limited by the network breakage due to
either node mobility or energy depletion of the mobile nodes. Also, to fulfill
certain quality parameters, presence of multiple node-disjoint paths becomes
essential. Such paths aid in the optimal traffic distribution and reliability
in case of path breakages. Thus, to cater various challenges in QoS routing in
Mobile Add hoc Networks, a Node Disjoint Multipath Routing Considering Link and
Node Stability (NDMLNR) protocol has been proposed by the authors. The metric
used to select the paths takes into account the stability of the nodes and the
corresponding links. This paper studies various challenges in the QoS routing
and presents the characteristic evaluation of NDMLNR w.r.t various existing
protocols in this area.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2010 09:14:56 GMT"
}
] | 2010-02-08T00:00:00 |
[
[
"Upadhayaya",
"Shuchita",
""
],
[
"Gandhi",
"Charu",
""
]
] |
new_dataset
| 0.98542 |
1002.1193
|
Vishal Goyal
|
Dhirendra Sharma, Vikram Singh
|
ICT in Universities of the Western Himalayan Region of India II: A
Comparative SWOT Analysis
|
International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 3, January 2010,
http://ijcsi.org/articles/ICT-in-Universities-of-the-Western-Himalayan-Region-of-India-II-A-Comparative-SWOT-Analysis.php
|
International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 3, January 2010,
http://ijcsi.org/articles/ICT-in-Universities-of-the-Western-Himalayan-Region-of-India-II-A-Comparative-SWOT-Analysis.php
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study presents a comparative SWOT analysis to comprehend the pattern of
development of ICT within six universities of western Himalayan region of
India. With the objective of achieving quality and excellence in higher
education system in the region, this study provides a basis to decision makers
to exploit opportunities and minimize the external threats. The SWOT analysis
of different universities, placed under three categories, has been undertaken
within the four-tier framework used earlier by the authors. Guided by the
initiatives of National Mission on Education through ICT (NMEICT) for SWOT
analysis, findings of this paper reveal, relative consistency of these three
categories of universities, with the earlier study. A few suggestions, as
opportunities, with an emphasis on problem solving orientation in higher
education, have been made to strengthen the leadership of universities in the
field of ICT.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2010 10:51:00 GMT"
}
] | 2010-02-08T00:00:00 |
[
[
"Sharma",
"Dhirendra",
""
],
[
"Singh",
"Vikram",
""
]
] |
new_dataset
| 0.972996 |
1002.0874
|
Fabio Vandin
|
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci,
Eli Upfal, Fabio Vandin
|
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
|
A preliminary version of this work was presented in WABI 2009. 10
pages, 0 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop, analyze and experiment with a new tool, called MADMX, which
extracts frequent motifs, possibly including don't care characters, from
biological sequences. We introduce density, a simple and flexible measure for
bounding the number of don't cares in a motif, defined as the ratio of solid
(i.e., different from don't care) characters to the total length of the motif.
By extracting only maximal dense motifs, MADMX reduces the output size and
improves performance, while enhancing the quality of the discoveries. The
efficiency of our approach relies on a newly defined combining operation,
dubbed fusion, which allows for the construction of maximal dense motifs in a
bottom-up fashion, while avoiding the generation of nonmaximal ones. We provide
experimental evidence of the efficiency and the quality of the motifs returned
by MADMX
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2010 01:20:12 GMT"
}
] | 2010-02-05T00:00:00 |
[
[
"Grossi",
"Roberto",
""
],
[
"Pietracaprina",
"Andrea",
""
],
[
"Pisanti",
"Nadia",
""
],
[
"Pucci",
"Geppino",
""
],
[
"Upfal",
"Eli",
""
],
[
"Vandin",
"Fabio",
""
]
] |
new_dataset
| 0.999161 |
1002.0936
|
EPTCS
|
Matthew Kehrt (University of Washington), Laura Effinger-Dean
(University of Washington), Michael Schmitz (University of Washington), Dan
Grossman (University of Washington)
|
Programming Idioms for Transactional Events
| null |
EPTCS 17, 2010, pp. 43-48
|
10.4204/EPTCS.17.4
| null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transactional events (TE) are an extension of Concurrent ML (CML), a
programming model for synchronous message-passing. Prior work has focused on
TE's formal semantics and its implementation. This paper considers programming
idioms, particularly those that vary unexpectedly from the corresponding CML
idioms. First, we solve a subtle problem with client-server protocols in TE.
Second, we argue that CML's wrap and guard primitives do not translate well to
TE, and we suggest useful workarounds. Finally, we discuss how to rewrite CML
protocols that use abort actions.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2010 09:43:21 GMT"
}
] | 2010-02-05T00:00:00 |
[
[
"Kehrt",
"Matthew",
"",
"University of Washington"
],
[
"Effinger-Dean",
"Laura",
"",
"University of Washington"
],
[
"Schmitz",
"Michael",
"",
"University of Washington"
],
[
"Grossman",
"Dan",
"",
"University of Washington"
]
] |
new_dataset
| 0.957074 |
1002.0940
|
EPTCS
|
Prodromos Gerakios (National Technical University of Athens), Nikolaos
Papaspyrou (National Technical University of Athens), Konstantinos Sagonas
(National Technical University of Athens)
|
A Concurrent Language with a Uniform Treatment of Regions and Locks
| null |
EPTCS 17, 2010, pp. 79-93
|
10.4204/EPTCS.17.7
| null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A challenge for programming language research is to design and implement
multi-threaded low-level languages providing static guarantees for memory
safety and freedom from data races. Towards this goal, we present a concurrent
language employing safe region-based memory management and hierarchical locking
of regions. Both regions and locks are treated uniformly, and the language
supports ownership transfer, early deallocation of regions and early release of
locks in a safe manner.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2010 09:51:04 GMT"
}
] | 2010-02-05T00:00:00 |
[
[
"Gerakios",
"Prodromos",
"",
"National Technical University of Athens"
],
[
"Papaspyrou",
"Nikolaos",
"",
"National Technical University of Athens"
],
[
"Sagonas",
"Konstantinos",
"",
"National Technical University of Athens"
]
] |
new_dataset
| 0.984169 |
1002.0971
|
Benjamin Nguyen
|
Benjamin Nguyen (PRISM), Fran\c{c}ois-Xavier Dudouet (LASP, IRISES),
Dario Colazzo (LRI), Antoine Vion (LEST), Ioana Manolescu (INRIA Saclay - Ile
de France), Pierre Senellart
|
The WebStand Project
| null |
WebSci'09: Society On-Line Conference, Greece (2009)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the state of advancement of the French ANR WebStand
project. The objective of this project is to construct a customizable XML based
warehouse platform to acquire, transform, analyze, store, query and export data
from the web, in particular mailing lists, with the final intension of using
this data to perform sociological studies focused on social groups of World
Wide Web, with a specific emphasis on the temporal aspects of this data. We are
currently using this system to analyze the standardization process of the W3C,
through its social network of standard setters.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2010 12:09:15 GMT"
}
] | 2010-02-05T00:00:00 |
[
[
"Nguyen",
"Benjamin",
"",
"PRISM"
],
[
"Dudouet",
"François-Xavier",
"",
"LASP, IRISES"
],
[
"Colazzo",
"Dario",
"",
"LRI"
],
[
"Vion",
"Antoine",
"",
"LEST"
],
[
"Manolescu",
"Ioana",
"",
"INRIA Saclay - Ile\n de France"
],
[
"Senellart",
"Pierre",
""
]
] |
new_dataset
| 0.971915 |
1002.0678
|
Andreas Faatz Dr.
|
Andreas Faatz, Andreas Zinnen
|
FORMT: Form-based Mutation Testing of Logical Specifications
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The draft paper defines a system, which is capable of maintaining bases of
test cases for logical specifications. The specifications, which are subject to
this system are transformed from their original shape in first-order logic to
form-based expressions as originally introduced in logics of George
Spencer-Brown. The innovation comes from the operations the system provides
when injecting faults - so-called mutations - to the specifications. The system
presented here applies to logical specifications from areas as different as
programming, ontologies or hardware specifications.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2010 09:35:21 GMT"
}
] | 2010-02-04T00:00:00 |
[
[
"Faatz",
"Andreas",
""
],
[
"Zinnen",
"Andreas",
""
]
] |
new_dataset
| 0.999854 |
0912.2815
|
Liam Roditty
|
David Peleg, Liam Roditty
|
Relaxed spanners for directed disk graphs
| null | null | null | null |
cs.DS cs.CG
|
http://creativecommons.org/licenses/by/3.0/
|
Let $(V,\delta)$ be a finite metric space, where $V$ is a set of $n$ points
and $\delta$ is a distance function defined for these points. Assume that
$(V,\delta)$ has a constant doubling dimension $d$ and assume that each point
$p\in V$ has a disk of radius $r(p)$ around it. The disk graph that corresponds
to $V$ and $r(\cdot)$ is a \emph{directed} graph $I(V,E,r)$, whose vertices are
the points of $V$ and whose edge set includes a directed edge from $p$ to $q$
if $\delta(p,q)\leq r(p)$. In \cite{PeRo08} we presented an algorithm for
constructing a $(1+\eps)$-spanner of size $O(n/\eps^d \log M)$, where $M$ is
the maximal radius $r(p)$. The current paper presents two results. The first
shows that the spanner of \cite{PeRo08} is essentially optimal, i.e., for
metrics of constant doubling dimension it is not possible to guarantee a
spanner whose size is independent of $M$. The second result shows that by
slightly relaxing the requirements and allowing a small perturbation of the
radius assignment, considerably better spanners can be constructed. In
particular, we show that if it is allowed to use edges of the disk graph
$I(V,E,r_{1+\eps})$, where $r_{1+\eps}(p) = (1+\eps)\cdot r(p)$ for every $p\in
V$, then it is possible to get a $(1+\eps)$-spanner of size $O(n/\eps^d)$ for
$I(V,E,r)$. Our algorithm is simple and can be implemented efficiently.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2009 07:31:51 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Feb 2010 13:45:25 GMT"
}
] | 2010-02-03T00:00:00 |
[
[
"Peleg",
"David",
""
],
[
"Roditty",
"Liam",
""
]
] |
new_dataset
| 0.988207 |
0912.3188
|
Shiri Chechik
|
Shiri Chechik and David Peleg
|
Robust Fault Tolerant uncapacitated facility location
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the uncapacitated facility location problem, given a graph, a set of
demands and opening costs, it is required to find a set of facilities R, so as
to minimize the sum of the cost of opening the facilities in R and the cost of
assigning all node demands to open facilities. This paper concerns the robust
fault-tolerant version of the uncapacitated facility location problem (RFTFL).
In this problem, one or more facilities might fail, and each demand should be
supplied by the closest open facility that did not fail. It is required to find
a set of facilities R, so as to minimize the sum of the cost of opening the
facilities in R and the cost of assigning all node demands to open facilities
that did not fail, after the failure of up to \alpha facilities. We present a
polynomial time algorithm that yields a 6.5-approximation for this problem with
at most one failure and a 1.5 + 7.5\alpha-approximation for the problem with at
most \alpha > 1 failures. We also show that the RFTFL problem is NP-hard even
on trees, and even in the case of a single failure.
|
[
{
"version": "v1",
"created": "Wed, 16 Dec 2009 16:46:55 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Feb 2010 11:13:09 GMT"
}
] | 2010-02-03T00:00:00 |
[
[
"Chechik",
"Shiri",
""
],
[
"Peleg",
"David",
""
]
] |
new_dataset
| 0.96466 |
1002.0412
|
Dakshina Ranjan Kisku
|
Dakshina Ranjan Kisku, Hunny Mehrotra, Phalguni Gupta, and Jamuna
Kanta Sing
|
SIFT-based Ear Recognition by Fusion of Detected Keypoints from Color
Similarity Slice Regions
|
6 pages, 4 figures, ACTEA 2009
| null | null | null |
cs.CV cs.AI
|
http://creativecommons.org/licenses/by/3.0/
|
Ear biometric is considered as one of the most reliable and invariant
biometrics characteristics in line with iris and fingerprint characteristics.
In many cases, ear biometrics can be compared with face biometrics regarding
many physiological and texture characteristics. In this paper, a robust and
efficient ear recognition system is presented, which uses Scale Invariant
Feature Transform (SIFT) as feature descriptor for structural representation of
ear images. In order to make it more robust to user authentication, only the
regions having color probabilities in a certain ranges are considered for
invariant SIFT feature extraction, where the K-L divergence is used for keeping
color consistency. Ear skin color model is formed by Gaussian mixture model and
clustering the ear color pattern using vector quantization. Finally, K-L
divergence is applied to the GMM framework for recording the color similarity
in the specified ranges by comparing color similarity between a pair of
reference model and probe ear images. After segmentation of ear images in some
color slice regions, SIFT keypoints are extracted and an augmented vector of
extracted SIFT features are created for matching, which is accomplished between
a pair of reference model and probe ear images. The proposed technique has been
tested on the IITK Ear database and the experimental results show improvements
in recognition accuracy while invariant features are extracted from color slice
regions to maintain the robustness of the system.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2010 08:06:04 GMT"
}
] | 2010-02-03T00:00:00 |
[
[
"Kisku",
"Dakshina Ranjan",
""
],
[
"Mehrotra",
"Hunny",
""
],
[
"Gupta",
"Phalguni",
""
],
[
"Sing",
"Jamuna Kanta",
""
]
] |
new_dataset
| 0.957454 |
1002.0479
|
Odile Piton
|
Odile Piton (SAMM), H\'el\`ene Pignot (SAMM)
|
"Mind your p's and q's": or the peregrinations of an apostrophe in 17th
Century English
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If the use of the apostrophe in contemporary English often marks the Saxon
genitive, it may also indicate the omission of one or more let-ters. Some
writers (wrongly?) use it to mark the plural in symbols or abbreviations,
visual-ised thanks to the isolation of the morpheme "s". This punctuation mark
was imported from the Continent in the 16th century. During the 19th century
its use was standardised. However the rules of its usage still seem problematic
to many, including literate speakers of English. "All too often, the apostrophe
is misplaced", or "errant apostrophes are springing up every-where" is a
complaint that Internet users fre-quently come across when visiting grammar
websites. Many of them detail its various uses and misuses, and attempt to
correct the most common mistakes about it, especially its mis-use in the
plural, called greengrocers' apostro-phes and humorously misspelled
"greengro-cers apostrophe's". While studying English travel accounts published
in the seventeenth century, we noticed that the different uses of this symbol
may accompany various models of metaplasms. We were able to highlight the
linguistic variations of some lexemes, and trace the origin of modern grammar
rules gov-erning its usage.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2010 13:24:20 GMT"
}
] | 2010-02-03T00:00:00 |
[
[
"Piton",
"Odile",
"",
"SAMM"
],
[
"Pignot",
"Hélène",
"",
"SAMM"
]
] |
new_dataset
| 0.96996 |
1002.0573
|
Aubin Lecointre
|
Abdoulaye Berthe (LAAS), Aubin Lecointre (LAAS), Daniela Dragomirescu
(LAAS), Robert Plana (LAAS)
|
Medium Access Control for Wireless Sensor Networks based on Impulse
Radio Ultra Wideband
| null |
International Conference on Electronics Computers and Artificial
Intelligence, ECAI Romania (2009)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a detailed performance evaluation of distributed Medium
Access Control (MAC) protocols for Wireless Sensor Networks based on Impulse
Radio Ultra Wideband (IR-UWB) Physical layer (PHY). Two main classes of Medium
Access Control protocol have been considered: Slotted and UnSlotted with
reliability. The reliability is based on Automatic Repeat ReQuest (ARQ). The
performance evaluation is performed using a complete Wireless Sensor Networks
(WSN) simulator built on the Global Mobile Information System Simulator
(GloMoSim). The optimal operating parameters are first discussed for IR-UWB in
terms of slot size, retransmission delay and the number of retransmission, then
a comparison between IR-UWB and other transmission techniques in terms of
reliability latency and power efficiency.
|
[
{
"version": "v1",
"created": "Tue, 2 Feb 2010 20:05:45 GMT"
}
] | 2010-02-03T00:00:00 |
[
[
"Berthe",
"Abdoulaye",
"",
"LAAS"
],
[
"Lecointre",
"Aubin",
"",
"LAAS"
],
[
"Dragomirescu",
"Daniela",
"",
"LAAS"
],
[
"Plana",
"Robert",
"",
"LAAS"
]
] |
new_dataset
| 0.99 |
1002.0154
|
Pierre Humbert
|
Pierre Humbert (LORIA)
|
Usages et conception des TIC : Proposition d'un mod\`ele d'aide \`a la
repr\'esentation de probl\`eme de conception
| null |
Colloque International Enjeux et Usages des TIC : Strat\'egies du
changement dans les syst\`emes et les territoires, Bordeaux : France (2009)
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers economic intelligence contribution to exploit individual
and collective images of change, in ICT design decision-making. Technical
devices meeting with real use situations often gives the opportunity to emerge
mental images, that a innovation process, through its unprecedented nature, can
not anticipate. Although methodologies exists for quality and design project
management, the survey we conduct among small ICT publishers, show how they are
not very suitable for small firms. This elements taken into account, we try to
build a proposition of exploration ? analyze ? sum up process, adapted to this
type of actors decisional process.
|
[
{
"version": "v1",
"created": "Sun, 31 Jan 2010 20:23:01 GMT"
}
] | 2010-02-02T00:00:00 |
[
[
"Humbert",
"Pierre",
"",
"LORIA"
]
] |
new_dataset
| 0.959546 |
1002.0298
|
Jayanthkumar Kannan
|
Jayanthkumar Kannan, Petros Maniatis, Byung-Gon Chun
|
A Data Capsule Framework For Web Services: Providing Flexible Data
Access Control To Users
| null | null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the notion of a secure data capsule, which refers to an
encapsulation of sensitive user information (such as a credit card number)
along with code that implements an interface suitable for the use of such
information (such as charging for purchases) by a service (such as an online
merchant). In our capsule framework, users provide their data in the form of
such capsules to web services rather than raw data. Capsules can be deployed in
a variety of ways, either on a trusted third party or the user's own computer
or at the service itself, through the use of a variety of hardware or software
modules, such as a virtual machine monitor or trusted platform module: the only
requirement is that the deployment mechanism must ensure that the user's data
is only accessed via the interface sanctioned by the user. The framework
further allows an user to specify policies regarding which services or machines
may host her capsule, what parties are allowed to access the interface, and
with what parameters. The combination of interface restrictions and policy
control lets us bound the impact of an attacker who compromises the service to
gain access to the user's capsule or a malicious insider at the service itself.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2010 18:31:06 GMT"
}
] | 2010-02-02T00:00:00 |
[
[
"Kannan",
"Jayanthkumar",
""
],
[
"Maniatis",
"Petros",
""
],
[
"Chun",
"Byung-Gon",
""
]
] |
new_dataset
| 0.960968 |
1001.2811
|
Krishnendu Chatterjee
|
Yashdeep Godhal and Krishnendu Chatterjee and Thomas A. Henzinger
|
Synthesis of AMBA AHB from Formal Specification
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The standard procedure for hardware design consists of describing circuit in
a hardware description language at logic level followed by extensive
verification and logic-synthesis. However, this process consumes significant
time and needs a lot of effort. An alternative is to use formal specification
language as a high-level hardware description language and synthesize hardware
from formal specification. Bloem et.al. gave formal specifications and
synthesize the AMBA AHB Arbiter. Our contributions are as follows:(1) We
present more complete and compact formal specifications for the AMBA AHB
Arbiter, and obtain significant (order of magnitude) improvement in synthesis
results (both with respect to time and the number of gates of the synthesize
circuit); (2) we present formal specification and synthesize to generate
compact circuits for the remaining two components of the AMBA AHB protocol,
namely, the AMBA AHB Master and AMBA AHB Slave; and (3) from the lessons learnt
we present few principles for writing formal specifications for efficient
hardware synthesis. Thus with intelligently written complete formal
specifications we are able to automatically synthesize an important and widely
used industrial protocol.
|
[
{
"version": "v1",
"created": "Sat, 16 Jan 2010 08:32:17 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Feb 2010 21:18:51 GMT"
}
] | 2010-02-01T00:00:00 |
[
[
"Godhal",
"Yashdeep",
""
],
[
"Chatterjee",
"Krishnendu",
""
],
[
"Henzinger",
"Thomas A.",
""
]
] |
new_dataset
| 0.998942 |
1001.5074
|
Edgar Martinez-Moro
|
M. Borges-Quintana, M.A.Borges-Trenard, E.Martinez-Moro
|
Computing coset leaders of binary codes
|
Submitted to Designs, Codes and Cryptography
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algorithm for computing the set of all coset leaders of a
binary code $\mathcal C \subset \mathbb{F}_2^n$. The method is adapted from
some of the techniques related to the computation of Gr\"obner representations
associated with codes. The algorithm provides a Gr\"obner representation of the
binary code and the set of coset leaders $\mathrm{CL}(\mathcal C)$. Its
efficiency stands of the fact that its complexity is linear on the number of
elements of $\mathrm{CL}(\mathcal C)$, which is smaller than exhaustive search
in $\mathbb{F}_2^n$.
|
[
{
"version": "v1",
"created": "Thu, 28 Jan 2010 00:30:23 GMT"
}
] | 2010-01-29T00:00:00 |
[
[
"Borges-Quintana",
"M.",
""
],
[
"Borges-Trenard",
"M. A.",
""
],
[
"Martinez-Moro",
"E.",
""
]
] |
new_dataset
| 0.995186 |
1001.4880
|
Benjamin Nguyen
|
Benjamin Nguyen and Spyros Zoupanos
|
The WebContent XML Store
|
Must be compiled with pdflatex
|
RFIA 2010 Workshop "Sources Ouvertes et Services"
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we describe the XML storage system used in the WebContent
project. We begin by advocating the use of an XML database in order to store
WebContent documents, and we present two different ways of storing and querying
these documents : the use of a centralized XML database and the use of a P2P
XML database.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2010 09:33:54 GMT"
}
] | 2010-01-28T00:00:00 |
[
[
"Nguyen",
"Benjamin",
""
],
[
"Zoupanos",
"Spyros",
""
]
] |
new_dataset
| 0.999783 |
0802.2432
|
Andrei Romashchenko
|
Bruno Durand (LIF), Andrei Romashchenko (LIP), Alexander Shen (LIF)
|
Fixed Point and Aperiodic Tilings
|
v5: technical revision (positions of figures are shifted)
|
12th International Conference on Developments in Language Theory,
Kyoto : Japan (2008)
|
10.1007/978-3-540-85780-8_22
| null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An aperiodic tile set was first constructed by R.Berger while proving the
undecidability of the domino problem. It turned out that aperiodic tile sets
appear in many topics ranging from logic (the Entscheidungsproblem) to physics
(quasicrystals) We present a new construction of an aperiodic tile set that is
based on Kleene's fixed-point construction instead of geometric arguments. This
construction is similar to J. von Neumann self-reproducing automata; similar
ideas were also used by P. Gacs in the context of error-correcting
computations. The flexibility of this construction allows us to construct a
"robust" aperiodic tile set that does not have periodic (or close to periodic)
tilings even if we allow some (sparse enough) tiling errors. This property was
not known for any of the existing aperiodic tile sets.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2008 07:50:13 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Feb 2008 15:43:21 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Jul 2008 11:16:24 GMT"
},
{
"version": "v4",
"created": "Wed, 13 Jan 2010 13:50:04 GMT"
},
{
"version": "v5",
"created": "Wed, 27 Jan 2010 14:15:07 GMT"
}
] | 2010-01-27T00:00:00 |
[
[
"Durand",
"Bruno",
"",
"LIF"
],
[
"Romashchenko",
"Andrei",
"",
"LIP"
],
[
"Shen",
"Alexander",
"",
"LIF"
]
] |
new_dataset
| 0.986027 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.