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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1203.6686
|
Jean-Pierre Tillich
|
Val\'erie Gauthier and Ayoub Otmani and Jean-Pierre Tillich
|
A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying
on Reed-Solomon Codes
|
11 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bogdanov and Lee suggested a homomorphic public-key encryption scheme based
on error correcting codes. The underlying public code is a modified
Reed-Solomon code obtained from inserting a zero submatrix in the Vandermonde
generating matrix defining it. The columns that define this submatrix are kept
secret and form a set $L$. We give here a distinguisher that detects if one or
several columns belong to $L$ or not. This distinguisher is obtained by
considering the code generated by component-wise products of codewords of the
public code (the so called "square code"). This operation is applied to
punctured versions of this square code obtained by picking a subset
$I$ of the whole set of columns. It turns out that the dimension of the
punctured square code is directly related to the cardinality of the
intersection of $I$ with $L$. This allows an attack which recovers the full set
$L$ and which can then decrypt any ciphertext.
|
[
{
"version": "v1",
"created": "Thu, 29 Mar 2012 23:31:16 GMT"
}
] | 2012-04-02T00:00:00 |
[
[
"Gauthier",
"Valérie",
""
],
[
"Otmani",
"Ayoub",
""
],
[
"Tillich",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.992437 |
1108.0901
|
Richard Formato
|
Richard A. Formato
|
UWB Array Design Using Variable Zo Technology and Central Force
Optimization
|
Rev. 2 (added discussion, citation). arXiv admin note: substantial
text overlap with arXiv:1107.1437, arXiv:1003.0221, arXiv:1103.5629,
arXiv:1003.1039, arXiv:1002.2798, arXiv:1001.0317
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This note applies Variable Zo technology to the design of an Ultra Wideband
(UWB) Yagi-Uda array optimized using Central Force Optimization. Variable Zo is
a novel and proprietary approach to antenna design and optimization that treats
the feed system characteristic impedance, Zo, as a design variable instead of a
fixed design parameter as is traditionally done. Variable Zo is applicable to
any antenna design or optimization methodology, and using it will generally
produce better antenna designs across any user-specified set of performance
objectives.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2011 14:47:49 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Aug 2011 12:17:01 GMT"
}
] | 2012-04-01T00:00:00 |
[
[
"Formato",
"Richard A.",
""
]
] |
new_dataset
| 0.99978 |
1203.6400
|
Nodira Khoussainova
|
Nodira Khoussainova, Magdalena Balazinska, Dan Suciu
|
PerfXplain: Debugging MapReduce Job Performance
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 7, pp.
598-609 (2012)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While users today have access to many tools that assist in performing large
scale data analysis tasks, understanding the performance characteristics of
their parallel computations, such as MapReduce jobs, remains difficult. We
present PerfXplain, a system that enables users to ask questions about the
relative performances (i.e., runtimes) of pairs of MapReduce jobs. PerfXplain
provides a new query language for articulating performance queries and an
algorithm for generating explanations from a log of past MapReduce job
executions. We formally define the notion of an explanation together with three
metrics, relevance, precision, and generality, that measure explanation
quality. We present the explanation-generation algorithm based on techniques
related to decision-tree building. We evaluate the approach on a log of past
executions on Amazon EC2, and show that our approach can generate quality
explanations, outperforming two naive explanation-generation methods.
|
[
{
"version": "v1",
"created": "Thu, 29 Mar 2012 00:04:35 GMT"
}
] | 2012-03-30T00:00:00 |
[
[
"Khoussainova",
"Nodira",
""
],
[
"Balazinska",
"Magdalena",
""
],
[
"Suciu",
"Dan",
""
]
] |
new_dataset
| 0.993927 |
1203.5778
|
Krit Salah-Ddine
|
Krit Salah-ddine, Zared Kamal, Qjidaa Hassan and Zouak Mohcine
|
A 100 mA Low Voltage Linear Regulators for Systems on Chip Applications
Using 0.18 {\mu}m CMOS Technology
|
7 pages
|
IJCSI International Journal of Computer Science Issues, Vol. 9,
Issue 1, No 3, January 2012
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel design for a low dropout (LDO) voltage regulator is presented and
dedicated to power many sections of a typical cellular handset. However, these
baseband, RF, and audio sections have different requirements that influence
which LDO is most appropriate. After discussion of the specific requirements,
different LDOs are recommended. Also, some LDO design techniques are briefly
discussed to demonstrate how an LDO may be optimized for a specific level of
performance. Cellular phone designs require linear regulators with lowdropout,
low-noise, high PSRR, low quiescent current (Iq), and low-cost. They need to
deliver a stable output and use smallvalue output capacitors. Ideally, one
device would have all these characteristics and one low-dropout linear
regulator (LDO) could be used anywhere in the phone without worry. But in
practice, the various cell phone blocks are best powered by LDOs with different
performance characteristics. This paper provides a new design methodology to
choosing the right LDO to power each cell phone and especially for the Voltage
Phase-Locked loops (VPLLs) blocks. Fabricated in a 0.18 {\mu}m CMOS process,
the measured results show the adopted topology achieves a better phase noise
than the conventional saturation current source. and the spread of the current
limitation (without matching) is 100mA, the VPLLs system demonstrates a phase
noise of 782 nv/sqrtHz at 100-kHz, and 33 nv/sqrtHz at 1 MHz, while quiescent
current 33 {\mu}A from a 2.6 V supply voltage.
|
[
{
"version": "v1",
"created": "Sun, 25 Mar 2012 01:55:15 GMT"
}
] | 2012-03-28T00:00:00 |
[
[
"Salah-ddine",
"Krit",
""
],
[
"Kamal",
"Zared",
""
],
[
"Hassan",
"Qjidaa",
""
],
[
"Mohcine",
"Zouak",
""
]
] |
new_dataset
| 0.991587 |
1203.5944
|
Sergio Cabello
|
Sergio Cabello, Bojan Mohar
|
Adding one edge to planar graphs makes crossing number and 1-planarity
hard
|
27 pages, 10 figures. Part of the results appeared in Proceedings of
the 26th Annual Symposium on Computational Geometry (SoCG), 68-76, 2010
| null | null | null |
cs.CG cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is near-planar if it can be obtained from a planar graph by adding an
edge. We show the surprising fact that it is NP-hard to compute the crossing
number of near-planar graphs. A graph is 1-planar if it has a drawing where
every edge is crossed by at most one other edge. We show that it is NP-hard to
decide whether a given near-planar graph is 1-planar. The main idea in both
reductions is to consider the problem of simultaneously drawing two planar
graphs inside a disk, with some of its vertices fixed at the boundary of the
disk. This leads to the concept of anchored embedding, which is of independent
interest. As an interesting consequence we obtain a new, geometric proof of
NP-completeness of the crossing number problem, even when restricted to cubic
graphs. This resolves a question of Hlin\v{e}n\'y.
|
[
{
"version": "v1",
"created": "Tue, 27 Mar 2012 12:03:12 GMT"
}
] | 2012-03-28T00:00:00 |
[
[
"Cabello",
"Sergio",
""
],
[
"Mohar",
"Bojan",
""
]
] |
new_dataset
| 0.984584 |
1203.0290
|
Krishna Kaipa
|
K. V. Kaipa, H. Pillai
|
Weight spectrum of codes associated with the Grassmannian G(3,7)
|
concluding remarks added
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we consider the problem of determining the weight spectrum of
q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6 this was
done by Nogin. We derive a formula for the weight of a codeword of C(3,m), in
terms of certain varieties associated with alternating trilinear forms on
(F_q)^m. The classification of such forms under the action of the general
linear group GL(m,F_q) is the other component that is required to calculate the
spectrum of C(3,m). For m=7, we explicitly determine the varieties mentioned
above. The classification problem for alternating 3-forms on (F_q)^7 was solved
by Cohen and Helminck, which we then use to determine the spectrum of C(3,7).
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2012 20:45:13 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Mar 2012 06:45:43 GMT"
}
] | 2012-03-27T00:00:00 |
[
[
"Kaipa",
"K. V.",
""
],
[
"Pillai",
"H.",
""
]
] |
new_dataset
| 0.993602 |
1006.4700
|
Pascal Koiran
|
Pascal Koiran (LIP)
|
Arithmetic circuits: the chasm at depth four gets wider
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In their paper on the "chasm at depth four", Agrawal and Vinay have shown
that polynomials in m variables of degree O(m) which admit arithmetic circuits
of size 2^o(m) also admit arithmetic circuits of depth four and size 2^o(m).
This theorem shows that for problems such as arithmetic circuit lower bounds or
black-box derandomization of identity testing, the case of depth four circuits
is in a certain sense the general case. In this paper we show that smaller
depth four circuits can be obtained if we start from polynomial size arithmetic
circuits. For instance, we show that if the permanent of n*n matrices has
circuits of size polynomial in n, then it also has depth 4 circuits of size
n^O(sqrt(n)*log(n)). Our depth four circuits use integer constants of
polynomial size. These results have potential applications to lower bounds and
deterministic identity testing, in particular for sums of products of sparse
univariate polynomials. We also give an application to boolean circuit
complexity, and a simple (but suboptimal) reduction to polylogarithmic depth
for arithmetic circuits of polynomial size and polynomially bounded degree.
|
[
{
"version": "v1",
"created": "Thu, 24 Jun 2010 07:22:19 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jul 2010 18:50:37 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Jul 2010 19:17:39 GMT"
},
{
"version": "v4",
"created": "Fri, 23 Mar 2012 07:11:30 GMT"
}
] | 2012-03-26T00:00:00 |
[
[
"Koiran",
"Pascal",
"",
"LIP"
]
] |
new_dataset
| 0.996031 |
1203.5218
|
Robert J. Mokken
|
Robert J. Mokken
|
Coteries, Social Circles and Hamlets Close Communities: A Study of
Acquaintance Networks
|
Keywords: Social networks, acquaintance networks, close communities,
cliques, k-clubs, 2-clubs, diameter 2, shortest spanning trees, girth
| null | null | null |
cs.SI cs.DM math.CO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the analysis of social networks many relatively loose and heuristic
definitions of 'community' abound. In this paper the concept of closely knit
communities is studied as defined by the property that every pair of its
members are neighbors or has at least one common neighbor, where the
neighboring relationship is based on some more or less durable and stable
acquaintance or contact relation. In this paper these are studied in the form
of graphs or networks of diameter two (2-clubs). Their structure can be
characterized by investigating shortest spanning trees and girth leading to a
typology containing just three or, in combination, six types of close
communities.
|
[
{
"version": "v1",
"created": "Fri, 23 Mar 2012 11:50:45 GMT"
}
] | 2012-03-26T00:00:00 |
[
[
"Mokken",
"Robert J.",
""
]
] |
new_dataset
| 0.98908 |
1203.5262
|
Youssef Bassil
|
Youssef Bassil, Paul Semaan
|
ASR Context-Sensitive Error Correction Based on Microsoft N-Gram Dataset
|
LACSC - Lebanese Association for Computational Sciences -
http://www.lacsc.org
|
Journal of Computing, Vol.4, No.1, January 2012
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At the present time, computers are employed to solve complex tasks and
problems ranging from simple calculations to intensive digital image processing
and intricate algorithmic optimization problems to computationally-demanding
weather forecasting problems. ASR short for Automatic Speech Recognition is yet
another type of computational problem whose purpose is to recognize human
spoken speech and convert it into text that can be processed by a computer.
Despite that ASR has many versatile and pervasive real-world applications,it is
still relatively erroneous and not perfectly solved as it is prone to produce
spelling errors in the recognized text, especially if the ASR system is
operating in a noisy environment, its vocabulary size is limited, and its input
speech is of bad or low quality. This paper proposes a post-editing ASR error
correction method based on MicrosoftN-Gram dataset for detecting and correcting
spelling errors generated by ASR systems. The proposed method comprises an
error detection algorithm for detecting word errors; a candidate corrections
generation algorithm for generating correction suggestions for the detected
word errors; and a context-sensitive error correction algorithm for selecting
the best candidate for correction. The virtue of using the Microsoft N-Gram
dataset is that it contains real-world data and word sequences extracted from
the web which canmimica comprehensive dictionary of words having a large and
all-inclusive vocabulary. Experiments conducted on numerous speeches, performed
by different speakers, showed a remarkable reduction in ASR errors. Future
research can improve upon the proposed algorithm so much so that it can be
parallelized to take advantage of multiprocessor and distributed systems.
|
[
{
"version": "v1",
"created": "Fri, 23 Mar 2012 14:51:05 GMT"
}
] | 2012-03-26T00:00:00 |
[
[
"Bassil",
"Youssef",
""
],
[
"Semaan",
"Paul",
""
]
] |
new_dataset
| 0.994886 |
1203.4874
|
Feng Li
|
Christopher Thorpe, Feng Li, Zijia Li, Zhan Yu, David Saunders, Jingyi
Yu
|
A Co-Prime Blur Scheme for Data Security in Video Surveillance
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel Coprime Blurred Pair (CBP) model for visual
data-hiding for security in camera surveillance. While most previous approaches
have focused on completely encrypting the video stream, we introduce a spatial
encryption scheme by blurring the image/video contents to create a CBP. Our
goal is to obscure detail in public video streams by blurring while allowing
behavior to be recognized and to quickly deblur the stream so that details are
available if behavior is recognized as suspicious. We create a CBP by blurring
the same latent image with two unknown kernels. The two kernels are coprime
when mapped to bivariate polynomials in the z domain. To deblur the CBP we
first use the coprime constraint to approximate the kernels and sample the
bivariate CBP polynomials in one dimension on the unit circle. At each sample
point, we factor the 1D polynomial pair and compose the results into a 2D
kernel matrix. Finally, we compute the inverse Fast Fourier Transform (FFT) of
the kernel matrices to recover the coprime kernels and then the latent video
stream. It is therefore only possible to deblur the video stream if a user has
access to both streams. To improve the practicability of our algorithm, we
implement our algorithm using a graphics processing unit (GPU) to decrypt the
blurred video streams in real-time, and extensive experimental results
demonstrate that our new scheme can effectively protect sensitive identity
information in surveillance videos and faithfully reconstruct the unblurred
video stream when two blurred sequences are available.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2012 02:57:53 GMT"
}
] | 2012-03-23T00:00:00 |
[
[
"Thorpe",
"Christopher",
""
],
[
"Li",
"Feng",
""
],
[
"Li",
"Zijia",
""
],
[
"Yu",
"Zhan",
""
],
[
"Saunders",
"David",
""
],
[
"Yu",
"Jingyi",
""
]
] |
new_dataset
| 0.994141 |
1203.4966
|
Amelia Carolina Sparavigna
|
A.C. Sparavigna and R. Marazzato
|
A tour about Isaac Newton's life
|
Georeferencing, Satellite Maps, KML, XML, Acme Mapper, History of
Physics
| null | null | null |
cs.OH physics.hist-ph physics.pop-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Here we propose a tour about the life of Isaac Newton, using a georeferenced
method, based on the free satellite maps. Our tour is modelled on the time-line
of the great scientist's life, as an ancient "itinerarium" was modelled on the
Roman roads, providing a listing of places and intervening distances, sometimes
with short description or symbols concerning the places. KML language and
Google Earth, with its Street View and 3D images are powerful tools to create
this virtual tour.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2012 11:54:52 GMT"
}
] | 2012-03-23T00:00:00 |
[
[
"Sparavigna",
"A. C.",
""
],
[
"Marazzato",
"R.",
""
]
] |
new_dataset
| 0.996072 |
1203.5062
|
Leon Derczynski
|
Leon Derczynski and Robert Gaizauskas
|
An Annotation Scheme for Reichenbach's Verbal Tense Structure
| null |
Proc. 6th Joint ACL-ISO Workshop on Interoperable Semantic
Annotation (2011) 10-17
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper we present RTMML, a markup language for the tenses of verbs and
temporal relations between verbs. There is a richness to tense in language that
is not fully captured by existing temporal annotation schemata. Following
Reichenbach we present an analysis of tense in terms of abstract time points,
with the aim of supporting automated processing of tense and temporal relations
in language. This allows for precise reasoning about tense in documents, and
the deduction of temporal relations between the times and verbal events in a
discourse. We define the syntax of RTMML, and demonstrate the markup in a range
of situations.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2012 18:05:26 GMT"
}
] | 2012-03-23T00:00:00 |
[
[
"Derczynski",
"Leon",
""
],
[
"Gaizauskas",
"Robert",
""
]
] |
new_dataset
| 0.99952 |
1203.5073
|
Leon Derczynski
|
Amev Burman, Arun Jayapal, Sathish Kannan, Madhu Kavilikatta, Ayman
Alhelbawy, Leon Derczynski, Robert Gaizauskas
|
USFD at KBP 2011: Entity Linking, Slot Filling and Temporal Bounding
|
Proc. Text Analysis Conference (2011)
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
This paper describes the University of Sheffield's entry in the 2011 TAC KBP
entity linking and slot filling tasks. We chose to participate in the
monolingual entity linking task, the monolingual slot filling task and the
temporal slot filling tasks. We set out to build a framework for
experimentation with knowledge base population. This framework was created, and
applied to multiple KBP tasks. We demonstrated that our proposed framework is
effective and suitable for collaborative development efforts, as well as useful
in a teaching environment. Finally we present results that, while very modest,
provide improvements an order of magnitude greater than our 2010 attempt.
|
[
{
"version": "v1",
"created": "Thu, 22 Mar 2012 18:34:19 GMT"
}
] | 2012-03-23T00:00:00 |
[
[
"Burman",
"Amev",
""
],
[
"Jayapal",
"Arun",
""
],
[
"Kannan",
"Sathish",
""
],
[
"Kavilikatta",
"Madhu",
""
],
[
"Alhelbawy",
"Ayman",
""
],
[
"Derczynski",
"Leon",
""
],
[
"Gaizauskas",
"Robert",
""
]
] |
new_dataset
| 0.967595 |
1108.2115
|
Hans van Ditmarsch
|
Hans van Ditmarsch
|
The Ditmarsch Tale of Wonders - The Dynamics of Lying
| null | null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a dynamic logic of lying, wherein a 'lie that phi' (where phi is a
formula in the logic) is an action in the sense of dynamic modal logic, that is
interpreted as a state transformer relative to the formula phi. The states that
are being transformed are pointed Kripke models encoding the uncertainty of
agents about their beliefs. Lies can be about factual propositions but also
about modal formulas, such as the beliefs of other agents or the belief
consequences of the lies of other agents. We distinguish (i) an outside
observer who is lying to an agent that is modelled in the system, from (ii) one
agent who is lying to another agent, and where both are modelled in the system.
For either case, we further distinguish (iii) the agent who believes everything
that it is told (even at the price of inconsistency), from (iv) the agent who
only believes what it is told if that is consistent with its current beliefs,
and from (v) the agent who believes everything that it is told by consistently
revising its current beliefs. The logics have complete axiomatizations, which
can most elegantly be shown by way of their embedding in what is known as
action model logic or the extension of that logic to belief revision.
|
[
{
"version": "v1",
"created": "Wed, 10 Aug 2011 07:55:15 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Mar 2012 16:08:53 GMT"
}
] | 2012-03-22T00:00:00 |
[
[
"van Ditmarsch",
"Hans",
""
]
] |
new_dataset
| 0.999511 |
1203.4605
|
Tarek El-Shishtawy Ahmed
|
Tarek El-shishtawy and Abdulwahab Al-sammak
|
Arabic Keyphrase Extraction using Linguistic knowledge and Machine
Learning Techniques
|
Proceedings of the Second International Conference on Arabic Language
Resources and Tools, 2009
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a supervised learning technique for extracting keyphrases of
Arabic documents is presented. The extractor is supplied with linguistic
knowledge to enhance its efficiency instead of relying only on statistical
information such as term frequency and distance. During analysis, an annotated
Arabic corpus is used to extract the required lexical features of the document
words. The knowledge also includes syntactic rules based on part of speech tags
and allowed word sequences to extract the candidate keyphrases. In this work,
the abstract form of Arabic words is used instead of its stem form to represent
the candidate terms. The Abstract form hides most of the inflections found in
Arabic words. The paper introduces new features of keyphrases based on
linguistic knowledge, to capture titles and subtitles of a document. A simple
ANOVA test is used to evaluate the validity of selected features. Then, the
learning model is built using the LDA - Linear Discriminant Analysis - and
training documents. Although, the presented system is trained using documents
in the IT domain, experiments carried out show that it has a significantly
better performance than the existing Arabic extractor systems, where precision
and recall values reach double their corresponding values in the other systems
especially for lengthy and non-scientific articles.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2012 21:52:35 GMT"
}
] | 2012-03-22T00:00:00 |
[
[
"El-shishtawy",
"Tarek",
""
],
[
"Al-sammak",
"Abdulwahab",
""
]
] |
new_dataset
| 0.978315 |
1203.4649
|
Saravanan Kumarasamy
|
K. Saravanan, L. Vijayanand and R. K. Negesh
|
A Novel Bluetooth Man-In-The-Middle Attack Based On SSP using OOB
Association model
| null | null | null |
EMICS12
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As an interconnection technology, Bluetooth has to address all traditional
security problems, well known from the distributed networks. Moreover, as
Bluetooth networks are formed by the radio links, there are also additional
security aspects whose impact is yet not well understood. In this paper, we
propose a novel Man-In-The-Middle (MITM) attack against Bluetooth enabled
mobile phone that support Simple Secure Pairing(SSP). From the literature it
was proved that the SSP association models such as Numeric comparison, Just
works and passkey Entry are not more secure. Here we propose the Out Of Band
(OOB) channeling with enhanced security than the previous methods.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2012 04:20:00 GMT"
}
] | 2012-03-22T00:00:00 |
[
[
"Saravanan",
"K.",
""
],
[
"Vijayanand",
"L.",
""
],
[
"Negesh",
"R. K.",
""
]
] |
new_dataset
| 0.999145 |
1203.4697
|
Devesh Jinwala PhD
|
Devesh Jinwala, Dhiren Patel, Kankar Dasgupta
|
FlexiSec: A Configurable Link Layer Security Architecture for Wireless
Sensor Networks
|
22 pages
|
Journal of Information Assurance and Security 4 (2009) pp. 582-603
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ensuring communications security in Wireless Sensor Networks (WSNs) indeed is
critical; due to the criticality of the resources in the sensor nodes as well
as due to their ubiquitous and pervasive deployment, with varying attributes
and degrees of security required. The proliferation of the next generation
sensor nodes, has not solved this problem, because of the greater emphasis on
low-cost deployment. In addition, the WSNs use data-centric multi-hop
communication that in turn, necessitates the security support to be devised at
the link layer (increasing the cost of security related operations), instead of
being at the application layer, as in general networks. Therefore, an
energy-efficient link layer security framework is necessitated. There do exists
a number of link layer security architectures that offer some combinations of
the security attributes desired by different WSN applications. However, as we
show in this paper, none of them is responsive to the actual security demands
of the applications. Therefore, we believe that there is a need for
investigating the feasibility of a configurable software-based link layer
security architecture wherein an application can be compiled flexibly, with
respect to its actual security demands. In this paper, we analyze, propose and
experiment with the basic design of such configurable link layer security
architecture for WSNs. We also experimentally evaluate various aspects related
to our scheme viz. configurable block ciphers, configurable block cipher modes
of operations, configurable MAC sizes and configurable replay protection. The
architecture proposed is aimed to offer the optimal level of security at the
minimal overhead, thus saving the precious resources in the WSNs.
|
[
{
"version": "v1",
"created": "Wed, 21 Mar 2012 10:06:00 GMT"
}
] | 2012-03-22T00:00:00 |
[
[
"Jinwala",
"Devesh",
""
],
[
"Patel",
"Dhiren",
""
],
[
"Dasgupta",
"Kankar",
""
]
] |
new_dataset
| 0.98963 |
1203.4473
|
Niraj Shakhakarmi
|
Niraj Shakhakarmi and Dhadesugoor R. Vaman
|
Dynamic PL&T using Two Reference Nodes Equipped with Steered Directional
Antenna for Significant PL&T Accuracy
|
7 pages, 12 figures
|
Wireless Telecommunications Symposium,UK London,April 16-18, 2012
| null | null |
cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
Dynamic Position Location and Tracking (PL&T) is proposed deploying the
integrated approach of zone finding and triangulation using two friendly nodes
equipped with Steered Directional Antenna (DA) in Mobile Ad hoc Networks
(MANET). This approach allows the system to use only two references instead of
a typical 3 references for a straight triangulation. Moreover, the performance
of the proposed algorithm with references using directional antennas shows
significant improvement over triangulation using references with
Omnidirectional antennas as the beam power is concentrated. However, dynamic
switching of reference nodes is frequently required as the target moves outside
the predicted zone. This paper presents a better tracking accuracy in using
proposed dynamic PL&T as compared to other PL&T techniques. The multipath
fading is also addressed with the use of KV transform coding technique which
uses forward error correction and sample interleaving achieves greater than 90%
tracking accuracy with BERs of 10-6 or better.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 04:24:59 GMT"
}
] | 2012-03-21T00:00:00 |
[
[
"Shakhakarmi",
"Niraj",
""
],
[
"Vaman",
"Dhadesugoor R.",
""
]
] |
new_dataset
| 0.992692 |
1203.4519
|
Niraj Shakhakarmi
|
Niraj Shakhakarmi, Dhadesugoor R. Vaman
|
Secured Position Location and Tracking (SPL&T) for Detection of Multiple
Malicious Nodes Maintaining Two Friendly References in Mobile Ad hoc Networks
|
8 pages, 11 figures
|
International Journal of Computer Science Issues (IJCSI), Volume
9, Issue 2, March 2012)
| null | null |
cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
Secured Position Location and Tracking (PL&T) scheme is developed for
multiple malicious radios or nodes detection using integrated key based strict
friendly scheme and position location and tracking by multi-sectored based
multiple target's PL&T. The friendly and malicious nodes detection is based on
the integrated key consisting of symmetric keys, geographic location and round
trip response time. Two strictly friend references dynamically form the
tracking zone over the detected multiple malicious nodes using the
multi-sectored adaptive beam forming. This PL&T technique is robust, precise,
scalable, and faster than using the single reference, two reference and three
reference nodes based PL&T method in the battlefield oriented Mobile Ad hoc
Networks. The simulation results show that the lower relative speed bound of
any participating node increased the switching overhead, the decreasing
received energy with increasing number of the multi-sectored beams reduced
tracking accuracy and the strict friendly authentication overhead depends upon
the time period between two latest periodic authentication failures.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 05:01:50 GMT"
}
] | 2012-03-21T00:00:00 |
[
[
"Shakhakarmi",
"Niraj",
""
],
[
"Vaman",
"Dhadesugoor R.",
""
]
] |
new_dataset
| 0.999216 |
1002.3171
|
Mohsen Toorani
|
M. Toorani, A. A. Beheshti
|
SSMS - A Secure SMS Messaging Protocol for the M-payment Systems
|
6 Pages, 5 Figures
|
Proceedings of the 13th IEEE Symposium on Computers and
Communications (ISCC'08), pp.700-705, July 2008
|
10.1109/ISCC.2008.4625610
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The GSM network with the greatest worldwide number of users, succumbs to
several security vulnerabilities. The short message service (SMS) is one of its
superior and well-tried services with a global availability in the GSM
networks. The main contribution of this paper is to introduce a new secure
application layer protocol, called SSMS, to efficiently embed the desired
security attributes in the SMS messages to be used as a secure bearer in the
m-payment systems. SSMS efficiently embeds the confidentiality, integrity,
authentication, and non-repudiation in the SMS messages. It provides an
elliptic curve-based public key solution that uses public keys for the secret
key establishment of a symmetric encryption. It also provides the attributes of
public verification and forward secrecy. It efficiently makes the SMS messaging
suitable for the m-payment applications where the security is the great
concern.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 10:27:29 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Mar 2010 20:12:29 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2011 14:04:01 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Mar 2012 21:19:22 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Toorani",
"M.",
""
],
[
"Beheshti",
"A. A.",
""
]
] |
new_dataset
| 0.997738 |
1002.3176
|
Mohsen Toorani
|
M. Toorani
|
SMEmail - A New Protocol for the Secure E-mail in Mobile Environments
|
6 Pages, 5 Figures
|
Proceedings of the Australian Telecommunications Networks and
Applications Conference (ATNAC'08), pp.39-44, Adelaide, Australia, Dec. 2008
|
10.1109/ATNAC.2008.4783292
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The electronic mail plays an unavoidable role in the humankind
communications. With the great interest for the connection via mobile
platforms, and the growing number of vulnerabilities and attacks, it is
essential to provide suitable security solutions regarding the limitations of
resource restricted platforms. Although some solutions such as PGP and S/MIME
are currently available for the secure e-mail over the Internet, they are based
on traditional public key cryptography that involves huge computational costs.
In this paper, a new secure application-layer protocol, called SMEmail, is
introduced that provides several security attributes such as confidentiality,
integrity, authentication, non-repudiation, and forward secrecy of message
confidentiality for the electronic mails. SMEmail offers an elliptic
curve-based public key solution that uses public keys for the secure key
establishment of a symmetric encryption, and is so suitable for the resource
restricted platforms such as mobile phones.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 10:45:38 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2011 13:51:34 GMT"
},
{
"version": "v3",
"created": "Fri, 16 Mar 2012 21:20:23 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Toorani",
"M.",
""
]
] |
new_dataset
| 0.998976 |
1002.3299
|
Mohsen Toorani
|
M. Toorani, A. A. Beheshti
|
LPKI - A Lightweight Public Key Infrastructure for the Mobile
Environments
|
6 Pages, 6 Figures
|
Proceedings of the 11th IEEE International Conference on
Communication Systems (IEEE ICCS'08), pp.162-166, Guangzhou, China, Nov. 2008
|
10.1109/ICCS.2008.4737164
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The non-repudiation as an essential requirement of many applications can be
provided by the asymmetric key model. With the evolution of new applications
such as mobile commerce, it is essential to provide secure and efficient
solutions for the mobile environments. The traditional public key cryptography
involves huge computational costs and is not so suitable for the
resource-constrained platforms. The elliptic curve-based approaches as the
newer solutions require certain considerations that are not taken into account
in the traditional public key infrastructures. The main contribution of this
paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the
constrained platforms such as mobile phones. It takes advantages of elliptic
curve cryptography and signcryption to decrease the computational costs and
communication overheads, and adapting to the constraints. All the computational
costs of required validations can be eliminated from end-entities by
introduction of a validation authority to the introduced infrastructure and
delegating validations to such a component. LPKI is so suitable for mobile
environments and for applications such as mobile commerce where the security is
the great concern.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 16:12:49 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Mar 2010 20:23:32 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2011 13:50:44 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Mar 2012 21:18:11 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Toorani",
"M.",
""
],
[
"Beheshti",
"A. A.",
""
]
] |
new_dataset
| 0.981069 |
1002.3316
|
Mohsen Toorani
|
M. Toorani, A. A. Beheshti
|
A Directly Public Verifiable Signcryption Scheme based on Elliptic
Curves
|
4 Pages, 2 Figures, 2 Tables
|
Proceedings of the 14th IEEE Symposium on Computers and
Communications (ISCC'09), pp.713-716, July 2009
|
10.1109/ISCC.2009.5202242
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A directly public verifiable signcryption scheme is introduced in this paper
that provides the security attributes of message confidentiality,
authentication, integrity, non-repudiation, unforgeability, and forward secrecy
of message confidentiality. It provides the attribute of direct public
verifiability so anyone can verify the signcryption without any need for any
secret information from the corresponding participants. The proposed scheme is
based on elliptic curve cryptography and is so suitable for environments with
resource constraints.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2010 17:18:28 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Feb 2010 08:00:19 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2011 13:48:35 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Mar 2012 21:17:08 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Toorani",
"M.",
""
],
[
"Beheshti",
"A. A.",
""
]
] |
new_dataset
| 0.955866 |
1002.3567
|
Mohsen Toorani
|
M. Toorani, A. Falahati
|
A Secure Variant of the Hill Cipher
|
4 Pages, 4 Figures
|
Proceedings of the 14th IEEE Symposium on Computers and
Communications (ISCC'09), pp.313-316, July 2009
|
10.1109/ISCC.2009.5202241
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Hill cipher is a classical symmetric encryption algorithm that succumbs
to the know-plaintext attack. Although its vulnerability to cryptanalysis has
rendered it unusable in practice, it still serves an important pedagogical role
in cryptology and linear algebra. In this paper, a variant of the Hill cipher
is introduced that makes the Hill cipher secure while it retains the
efficiency. The proposed scheme includes a ciphering core for which a
cryptographic protocol is introduced.
|
[
{
"version": "v1",
"created": "Thu, 18 Feb 2010 16:41:18 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Mar 2010 20:30:25 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2011 13:46:17 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Mar 2012 21:20:04 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Toorani",
"M.",
""
],
[
"Falahati",
"A.",
""
]
] |
new_dataset
| 0.99762 |
1102.4034
|
Jayita Das
|
Jayita Das, Syed M. Alam, Srinath Rajaram, Sanjukta Bhanja
|
Hybrid CMOS-MQCA Logic Architectures using Multi-Layer Spintronic
Devices
|
The paper has been withdrawn
| null | null | null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel hybrid CMOS-MQCA architecture using multi-layer Spintronic
devices as computing elements. A feasibility study is presented with 22nm CMOS
where new approaches for spin transfer torque induced clocking and read-out
scheme for variability-tolerance are introduced. A first-of-its-kind Spintronic
device model enables circuit simulation using existing CAD infrastructure.
Approximately 70% reduction in energy consumption is observed when compared
against conventional field-induced clocking scheme.
|
[
{
"version": "v1",
"created": "Sun, 20 Feb 2011 00:27:17 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Mar 2012 05:09:18 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Das",
"Jayita",
""
],
[
"Alam",
"Syed M.",
""
],
[
"Rajaram",
"Srinath",
""
],
[
"Bhanja",
"Sanjukta",
""
]
] |
new_dataset
| 0.971515 |
1202.0864
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Nested Lattice Codes for Arbitrary Continuous Sources and Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we show that nested lattice codes achieve the capacity of
arbitrary channels with or without non-casual state information at the
transmitter. We also show that nested lattice codes are optimal for source
coding with or without non-causal side information at the receiver for
arbitrary continuous sources.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2012 03:04:03 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Mar 2012 05:38:07 GMT"
},
{
"version": "v3",
"created": "Sat, 17 Mar 2012 06:02:45 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.987195 |
1202.1896
|
Ton Kloks
|
Ton Kloks, Sheung-Hung Poon and Yue-Li Wang
|
The black-and-white coloring problem on circle graphs
|
This paper has been withdrawn by the author due to a critical mistake
in the circle graph algorithm
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph G and integers b and w. The black-and-white coloring problem
asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such
that no two vertices x in B and y in W are adjacent. In this paper we show that
the problem is polynomial when restricted to permutation graphs and, more
generally, to circle graphs.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2012 06:36:08 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Mar 2012 23:43:53 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Kloks",
"Ton",
""
],
[
"Poon",
"Sheung-Hung",
""
],
[
"Wang",
"Yue-Li",
""
]
] |
new_dataset
| 0.999098 |
1203.0088
|
Panigrahy Rina
|
Rina Panigrahy, Li Zhang
|
The Mind Grows Circuits
| null | null | null | null |
cs.AI cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a vast supply of prior art that study models for mental processes.
Some studies in psychology and philosophy approach it from an inner perspective
in terms of experiences and percepts. Others such as neurobiology or
connectionist-machines approach it externally by viewing the mind as complex
circuit of neurons where each neuron is a primitive binary circuit. In this
paper, we also model the mind as a place where a circuit grows, starting as a
collection of primitive components at birth and then builds up incrementally in
a bottom up fashion. A new node is formed by a simple composition of prior
nodes when we undergo a repeated experience that can be described by that
composition. Unlike neural networks, however, these circuits take "concepts" or
"percepts" as inputs and outputs. Thus the growing circuits can be likened to a
growing collection of lambda expressions that are built on top of one another
in an attempt to compress the sensory input as a heuristic to bound its
Kolmogorov Complexity.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2012 04:20:03 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Mar 2012 19:32:10 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Panigrahy",
"Rina",
""
],
[
"Zhang",
"Li",
""
]
] |
new_dataset
| 0.986893 |
1203.4043
|
Shah Mahmood Mr.
|
Shah Mahmood and Yvo Desmedt
|
Your Facebook Deactivated Friend or a Cloaked Spy (Extended Abstract)
|
Full paper is presented at IEEE International Workshop on Security
and Social Networking SESOC 2012, Lugano, Switzerland
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With over 750 million active users, Facebook is the most famous social
networking website. One particular aspect of Facebook widely discussed in the
news and heavily researched in academic circles is the privacy of its users. In
this paper we introduce a zero day privacy loophole in Facebook. We call this
the deactivated friend attack. The concept of the attack is very similar to
cloaking in Star Trek while its seriousness could be estimated from the fact
that once the attacker is a friend of the victim, it is highly probable the
attacker has indefinite access to the victims private information in a cloaked
way. We demonstrate the impact of the attack by showing the ease of gaining
trust of Facebook users and being befriended online. With targeted friend
requests we were able to add over 4300 users and maintain access to their
Facebook profile information for at least 261 days. No user was able to
unfriend us during this time due to cloaking and short de-cloaking sessions.
The short de-cloaking sessions were enough to get updates about the victims. We
also provide several solutions for the loophole, which range from mitigation to
a permanent solution
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 06:33:44 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Mahmood",
"Shah",
""
],
[
"Desmedt",
"Yvo",
""
]
] |
new_dataset
| 0.995578 |
1203.4154
|
Marios Karagiannis
|
Marios Karagiannis, Laetitia Dallinge, Jose Rolim
|
Irida: A real-time Wireless Sensor Network visualization feedback
protocol
|
7 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the implementation of a real time visualization
and feedback system for Wireless Sensor Network algorithms. The system is based
on a fixed hardware testbed, which is deployed on a vertical flat surface and a
feedback loop system that takes information about the current state of the
network and projects this state, in a visual way, on the surface itself using a
video projector. The protocol used is open and simple to use, and can be easily
adapted for different hardware configurations. We call our system Irida.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 16:28:00 GMT"
}
] | 2012-03-20T00:00:00 |
[
[
"Karagiannis",
"Marios",
""
],
[
"Dallinge",
"Laetitia",
""
],
[
"Rolim",
"Jose",
""
]
] |
new_dataset
| 0.999251 |
1203.0369
|
Ak Rs
|
Abhijit Chowdhury (NSHM College of Management & Technology, Durgapur
West Bengal, INDIA), Angshu Kumar Sinha (NSHM College of Management &
Technology, Durgapur West Bengal, INDIA) Saurabh Dutta (Dr. B.C Roy
Engineering College West Bengal, INDIA)
|
Introduction of a Triple Prime Symmetric Key Block Cipher
| null |
International Journal of Computer Applications (0975 - 8887)
Volume 39 - No.7, February 2012
|
10.5120/4831-7089
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes to put forward an innovative algorithm for symmetric key
block cipher named as "Triple Prime Symmetric Key Block Cipher with Variable
Key-Spaces (TPSKBCVK)" that employs triple prime integers as private key-spaces
of varying lengths to encrypt data files. Principles of modular arithmetic have
been elegantly used in the proposed idea of the cipher. Depending on
observations of the results of implementation of the proposed cipher on a set
of real data files of several types, all results are registered and analyzed.
The strength of the underlying design of the cipher and the liberty of using a
long key-space expectedly makes it reasonably non-susceptible against possible
cryptanalytic intrusions. As a future scope of the work, it is intended to
formulate and employ an improved scheme that will use a carrier media (image or
multimedia data file) for a secure transmission of the private keys.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2012 04:50:35 GMT"
}
] | 2012-03-19T00:00:00 |
[
[
"Chowdhury",
"Abhijit",
"",
"NSHM College of Management & Technology, Durgapur\n West Bengal, INDIA"
],
[
"Sinha",
"Angshu Kumar",
"",
"NSHM College of Management &\n Technology, Durgapur West Bengal, INDIA"
],
[
"Dutta",
"Saurabh",
"",
"Dr. B.C Roy\n Engineering College West Bengal, INDIA"
]
] |
new_dataset
| 0.98857 |
1203.3574
|
Ingmar Steiner
|
Ingmar Steiner (INRIA Lorraine - LORIA), Slim Ouni (INRIA Lorraine -
LORIA)
|
Artimate: an articulatory animation framework for audiovisual speech
synthesis
|
Workshop on Innovation and Applications in Speech Technology (2012)
| null | null | null |
cs.HC cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a modular framework for articulatory animation synthesis using
speech motion capture data obtained with electromagnetic articulography (EMA).
Adapting a skeletal animation approach, the articulatory motion data is applied
to a three-dimensional (3D) model of the vocal tract, creating a portable
resource that can be integrated in an audiovisual (AV) speech synthesis
platform to provide realistic animation of the tongue and teeth for a virtual
character. The framework also provides an interface to articulatory animation
synthesis, as well as an example application to illustrate its use with a 3D
game engine. We rely on cross-platform, open-source software and open standards
to provide a lightweight, accessible, and portable workflow.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2012 21:23:45 GMT"
}
] | 2012-03-19T00:00:00 |
[
[
"Steiner",
"Ingmar",
"",
"INRIA Lorraine - LORIA"
],
[
"Ouni",
"Slim",
"",
"INRIA Lorraine -\n LORIA"
]
] |
new_dataset
| 0.972385 |
1203.3593
|
Erik Vee
|
Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan,
Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason
Zien
|
Ad Serving Using a Compact Allocation Plan
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large fraction of online display advertising is sold via guaranteed
contracts: a publisher guarantees to the advertiser a certain number of user
visits satisfying the targeting predicates of the contract. The publisher is
then tasked with solving the ad serving problem - given a user visit, which of
the thousands of matching contracts should be displayed, so that by the
expiration time every contract has obtained the requisite number of user
visits. The challenges of the problem come from (1) the sheer size of the
problem being solved, with tens of thousands of contracts and billions of user
visits, (2) the unpredictability of user behavior, since these contracts are
sold months ahead of time, when only a forecast of user visits is available and
(3) the minute amount of resources available online, as an ad server must
respond with a matching contract in a fraction of a second.
We present a solution to the guaranteed delivery ad serving problem using
{\em compact allocation plans}. These plans, computed offline, can be
efficiently queried by the ad server during an ad call; they are small, using
only O(1) space for contract; and are stateless, allowing for distributed
serving without any central coordination. We evaluate this approach on a real
set of user visits and guaranteed contracts and show that the compact
allocation plans are an effective way of solving the guaranteed delivery ad
serving problem.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2012 00:31:18 GMT"
}
] | 2012-03-19T00:00:00 |
[
[
"Chen",
"Peiji",
""
],
[
"Ma",
"Wenjing",
""
],
[
"Mandalapu",
"Srinath",
""
],
[
"Nagarajan",
"Chandrashekhar",
""
],
[
"Shanmugasundaram",
"Jayavel",
""
],
[
"Vassilvitskii",
"Sergei",
""
],
[
"Vee",
"Erik",
""
],
[
"Yu",
"Manfai",
""
],
[
"Zien",
"Jason",
""
]
] |
new_dataset
| 0.972856 |
1203.3613
|
K.S.Kuppusamy
|
K.S. Kuppusamy and G. Aghila
|
Morpes: A Model for Personalized Rendering of Web Content on Mobile
Devices
|
10 Pages, 2 Figures
|
International Journal in Foundations of Computer Science &
Technology (IJFCST),Vol. 2, No.2, March 2012
|
10.5121/ijfcst.2012.2204
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the tremendous growth in the information communication sector, the
mobile phones have become the prime information communication devices. The
convergence of traditional telephony with the modern web enabled communication
in the mobile devices has made the communication much effective and simpler. As
mobile phones are becoming the crucial source of accessing the contents of the
World Wide Web which was originally designed for personal computers, has opened
up a new challenge of accommodating the web contents in to the smaller mobile
devices. This paper proposes an approach towards building a model for rendering
the web pages in mobile devices. The proposed model is based on a
multi-dimensional web page segment evaluation model. The incorporation of
personalization in the proposed model makes the rendering user-centric. The
proposed model is validated with a prototype implementation.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2012 04:28:00 GMT"
}
] | 2012-03-19T00:00:00 |
[
[
"Kuppusamy",
"K. S.",
""
],
[
"Aghila",
"G.",
""
]
] |
new_dataset
| 0.962986 |
1203.3323
|
Al-Sakib Khan Pathan
|
Hassen Mohammed Alsafi, Wafaa Mustafa Abduallah, Al-Sakib Khan Pathan
|
IDPS: An Integrated Intrusion Handling Model for Cloud
|
18 pages. Accepted paper and to be published in International Journal
of Computing & Information Technology
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, many organizations are moving their computing services towards the
Cloud. This makes their computer processing available much more conveniently to
users. However, it also brings new security threats and challenges about safety
and reliability. In fact, Cloud Computing is an attractive and cost-saving
service for buyers as it provides accessibility and reliability options for
users and scalable sales for providers. In spite of being attractive, Cloud
feature poses various new security threats and challenges when it comes to
deploying Intrusion Detection System (IDS) in Cloud environments. Most
Intrusion Detection Systems (IDSs) are designed to handle specific types of
attacks. It is evident that no single technique can guarantee protection
against future attacks. Hence, there is a need for an integrated scheme which
can provide robust protection against a complete spectrum of threats. On the
other hand, there is great need for technology that enables the network and its
hosts to defend themselves with some level of intelligence in order to
accurately identify and block malicious traffic and activities. In this case,
it is called Intrusion prevention system (IPS). Therefore, in this paper, we
emphasize on recent implementations of IDS on Cloud Computing environments in
terms of security and privacy. We propose an effective and efficient model
termed as the Integrated Intrusion Detection and Prevention System (IDPS) which
combines both IDS and IPS in a single mechanism. Our mechanism also integrates
two techniques namely, Anomaly Detection (AD) and Signature Detection (SD) that
can work in cooperation to detect various numbers of attacks and stop them
through the capability of IPS.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2012 11:12:08 GMT"
}
] | 2012-03-16T00:00:00 |
[
[
"Alsafi",
"Hassen Mohammed",
""
],
[
"Abduallah",
"Wafaa Mustafa",
""
],
[
"Pathan",
"Al-Sakib Khan",
""
]
] |
new_dataset
| 0.998273 |
1203.2999
|
Neeraj Chasta
|
Neeraj K. Chasta
|
High Speed, Low Power Current Comparators with Hysteresis
| null |
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.3, No.1, February 2012, 85-96
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper, presents a novel idea for analog current comparison which
compares input signal current and reference currents with high speed, low power
and well controlled hysteresis. Proposed circuit is based on current mirror and
voltage latching techniques which produces rail to rail output voltage as a
result of current comparison. The same design can be extended to a simple
current comparator without hysteresis (or very less hysteresis), where
comparator gives high accuracy (less than 50nA) and speed at the cost of
moderate power consumption. The comparators are designed optimally and studied
at 180nm CMOS process technology for a supply voltage of 3V.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2012 04:40:07 GMT"
}
] | 2012-03-15T00:00:00 |
[
[
"Chasta",
"Neeraj K.",
""
]
] |
new_dataset
| 0.988901 |
1203.3098
|
Ahmet Husainov A.
|
Ahmet A. Husainov, Ekaterina S. Kudryashova
|
Generalized Asynchronous Systems
|
8 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper is devoted to a mathematical model of concurrency the special case
of which is asynchronous system. Distributed asynchronous automata are
introduced here. It is proved that the Petri nets and transition systems with
independence can be considered like the distributed asynchronous automata. Time
distributed asynchronous automata are defined in standard way by the map which
assigns time intervals to events. It is proved that the time distributed
asynchronous automata are generalized the time Petri nets and asynchronous
systems.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2012 14:37:25 GMT"
}
] | 2012-03-15T00:00:00 |
[
[
"Husainov",
"Ahmet A.",
""
],
[
"Kudryashova",
"Ekaterina S.",
""
]
] |
new_dataset
| 0.986748 |
1203.3178
|
Ashish Mani Mr.
|
Ashish Mani and C. Patvardhan
|
A Fast fixed-point Quantum Search Algorithm by using Disentanglement and
Measurement
|
arXiv admin note: substantial text overlap with arXiv:1102.2332
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generic quantum search algorithm searches for target entity in an unsorted
database by repeatedly applying canonical Grover's quantum rotation transform
to reach near the vicinity of the target entity. Thus, upon measurement, there
is a high probability of finding the target entity. However, the number of
times quantum rotation transform is to be applied for reaching near the
vicinity of the target is a function of the number of target entities present
in an unsorted database, which is generally unknown. A wrong estimate of the
number of target entities can lead to overshooting or undershooting the
targets, thus reducing the success probability. Some proposals have been made
to overcome this limitation. These proposals either employ quantum counting to
estimate the number of solutions or fixed-point schemes. This paper proposes a
new scheme for stopping the application of quantum rotation transformation on
reaching near the targets by disentanglement, measurement and subsequent
processing to estimate the distance of the state vector from the target states.
It ensures a success probability, which is greater than half for all
practically significant ratios of the number of target entities to the total
number of entities in a database. The search problem is trivial for remaining
possible ratios. The proposed scheme is simpler than quantum counting and more
efficient than the known fixed-point schemes. It has same order of
computational complexity as canonical Grover`s search algorithm but is slow by
a factor of two and requires two additional ancilla qubits.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2012 19:05:22 GMT"
}
] | 2012-03-15T00:00:00 |
[
[
"Mani",
"Ashish",
""
],
[
"Patvardhan",
"C.",
""
]
] |
new_dataset
| 0.972238 |
1203.2668
|
Qiyan Wang
|
Qiyan Wang, Nikita Borisov
|
Octopus: A Secure and Anonymous DHT Lookup
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed Hash Table (DHT) lookup is a core technique in structured
peer-to-peer (P2P) networks. Its decentralized nature introduces security and
privacy vulnerabilities for applications built on top of them; we thus set out
to design a lookup mechanism achieving both security and anonymity, heretofore
an open problem. We present Octopus, a novel DHT lookup which provides strong
guarantees for both security and anonymity. Octopus uses attacker
identification mechanisms to discover and remove malicious nodes, severely
limiting an adversary's ability to carry out active attacks, and splits lookup
queries over separate anonymous paths and introduces dummy queries to achieve
high levels of anonymity. We analyze the security of Octopus by developing an
event-based simulator to show that the attacker discovery mechanisms can
rapidly identify malicious nodes with low error rate. We calculate the
anonymity of Octopus using probabilistic modeling and show that Octopus can
achieve near-optimal anonymity. We evaluate Octopus's efficiency on Planetlab
with 207 nodes and show that Octopus has reasonable lookup latency and
manageable communication overhead.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2012 22:50:58 GMT"
}
] | 2012-03-14T00:00:00 |
[
[
"Wang",
"Qiyan",
""
],
[
"Borisov",
"Nikita",
""
]
] |
new_dataset
| 0.999392 |
1203.2778
|
Inder Jeet Taneja
|
Inder Jeet Tameja
|
Seven Means, Generalized Triangular Discrimination, and Generating
Divergence Measures
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From geometrical point of view, Eve (2003) studied seven means. These means
are Harmonic, Geometric, Arithmetic, Heronian, Contra-harmonic, Root-mean
square and Centroidal mean. We have considered for the first time a new measure
calling generalized triangular discrimination. Inequalities among non-negative
differences arising due to seven means and particular cases of generalized
triangular discrimination are considered. Some new generating measures and
their exponential representations are also presented.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2012 11:38:28 GMT"
}
] | 2012-03-14T00:00:00 |
[
[
"Tameja",
"Inder Jeet",
""
]
] |
new_dataset
| 0.958616 |
1203.2809
|
Mounira Kourjieh
|
Yannick Chevalier (IRIT), Mounira Kourjieh (INRIA Lorraine - LORIA /
LIFC)
|
Automated Synthesis of a Finite Complexity Ordering for Saturation
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present in this paper a new procedure to saturate a set of clauses with
respect to a well-founded ordering on ground atoms such that A < B implies
Var(A) {\subseteq} Var(B) for every atoms A and B. This condition is satisfied
by any atom ordering compatible with a lexicographic, recursive, or multiset
path ordering on terms. Our saturation procedure is based on a priori ordered
resolution and its main novelty is the on-the-fly construction of a finite
complexity atom ordering. In contrast with the usual redundancy, we give a new
redundancy notion and we prove that during the saturation a non-redundant
inference by a priori ordered resolution is also an inference by a posteriori
ordered resolution. We also prove that if a set S of clauses is saturated with
respect to an atom ordering as described above then the problem of whether a
clause C is entailed from S is decidable.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2012 19:36:46 GMT"
}
] | 2012-03-14T00:00:00 |
[
[
"Chevalier",
"Yannick",
"",
"IRIT"
],
[
"Kourjieh",
"Mounira",
"",
"INRIA Lorraine - LORIA /\n LIFC"
]
] |
new_dataset
| 0.998667 |
1111.2102
|
Lawrence Ong
|
Lawrence Ong and Sarah J. Johnson
|
The Capacity Region of the Restricted Two-Way Relay Channel with Any
Deterministic Uplink
|
author's final version (accepted and to appear in IEEE Communications
Letters)
|
IEEE Communications Letters, Vol. 16, No. 3, pp. 396-399, Mar.
2012
|
10.1109/LCOMM.2012.011312.112198
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the two-way relay channel (TWRC) where two users
communicate via a relay. For the restricted TWRC where the uplink from the
users to the relay is any deterministic function and the downlink from the
relay to the users is any arbitrary channel, the capacity region is obtained.
The TWRC considered is restricted in the sense that each user can only transmit
a function of its message.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2011 04:30:22 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Jan 2012 03:59:01 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.992945 |
1203.2299
|
Maxim Makatchev
|
Maxim Makatchev, Reid Simmons, Majd Sakr
|
A Cross-cultural Corpus of Annotated Verbal and Nonverbal Behaviors in
Receptionist Encounters
|
7 pages, 3 figures, presented at the Workshop on Gaze in HRI: From
Modeling to Communication (a Workshop of International Conference on
Human-Robot Interaction), March 5, 2012
| null | null | null |
cs.CL cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the first annotated corpus of nonverbal behaviors in receptionist
interactions, and the first nonverbal corpus (excluding the original video and
audio data) of service encounters freely available online. Native speakers of
American English and Arabic participated in a naturalistic role play at
reception desks of university buildings in Doha, Qatar and Pittsburgh, USA.
Their manually annotated nonverbal behaviors include gaze direction, hand and
head gestures, torso positions, and facial expressions. We discuss possible
uses of the corpus and envision it to become a useful tool for the human-robot
interaction community.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2012 00:45:01 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Makatchev",
"Maxim",
""
],
[
"Simmons",
"Reid",
""
],
[
"Sakr",
"Majd",
""
]
] |
new_dataset
| 0.997713 |
1203.2366
|
Johan Montagnat
|
Franck Michel, Johan Montagnat, Tristan Glatard (CREATIS)
|
Technical support for Life Sciences communities on a production grid
infrastructure
|
HealthGrid'12, Amsterdam : Netherlands (2012)
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Production operation of large distributed computing infrastructures (DCI)
still requires a lot of human intervention to reach acceptable quality of
service. This may be achievable for scientific communities with solid IT
support, but it remains a show-stopper for others. Some application execution
environments are used to hide runtime technical issues from end users. But they
mostly aim at fault-tolerance rather than incident resolution, and their
operation still requires substantial manpower. A longer-term support activity
is thus needed to ensure sustained quality of service for Virtual Organisations
(VO). This paper describes how the biomed VO has addressed this challenge by
setting up a technical support team. Its organisation, tooling, daily tasks,
and procedures are described. Results are shown in terms of resource usage by
end users, amount of reported incidents, and developed software tools. Based on
our experience, we suggest ways to measure the impact of the technical support,
perspectives to decrease its human cost and make it more community-specific.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2012 19:22:51 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Michel",
"Franck",
"",
"CREATIS"
],
[
"Montagnat",
"Johan",
"",
"CREATIS"
],
[
"Glatard",
"Tristan",
"",
"CREATIS"
]
] |
new_dataset
| 0.988522 |
1203.2384
|
Syed Jafar
|
Syed A. Jafar
|
Elements of Cellular Blind Interference Alignment --- Aligned Frequency
Reuse, Wireless Index Coding and Interference Diversity
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore degrees of freedom (DoF) characterizations of partially connected
wireless networks, especially cellular networks, with no channel state
information at the transmitters. Specifically, we introduce three fundamental
elements --- aligned frequency reuse, wireless index coding and interference
diversity --- through a series of examples, focusing first on infinite regular
arrays, then on finite clusters with arbitrary connectivity and message sets,
and finally on heterogeneous settings with asymmetric multiple antenna
configurations. Aligned frequency reuse refers to the optimality of orthogonal
resource allocations in many cases, but according to unconventional reuse
patterns that are guided by interference alignment principles. Wireless index
coding highlights both the intimate connection between the index coding problem
and cellular blind interference alignment, as well as the added complexity
inherent to wireless settings. Interference diversity refers to the observation
that in a wireless network each receiver experiences a different set of
interferers, and depending on the actions of its own set of interferers, the
interference-free signal space at each receiver fluctuates differently from
other receivers, creating opportunities for robust applications of blind
interference alignment principles.
|
[
{
"version": "v1",
"created": "Sun, 11 Mar 2012 22:59:58 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Jafar",
"Syed A.",
""
]
] |
new_dataset
| 0.972127 |
1203.2400
|
Dr Brij Gupta
|
B. B. Gupta, Manoj Misra and R. C. Joshi
|
An ISP Level Solution to Combat DDoS Attacks using Combined Statistical
Based Approach
| null |
International Journal of Information Assurance and Security
(JIAS), vol. 3, no. 2, pp. 102-110, 2008
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Disruption from service caused by DDoS attacks is an immense threat to
Internet today. These attacks can disrupt the availability of Internet services
completely, by eating either computational or communication resources through
sheer volume of packets sent from distributed locations in a coordinated manner
or graceful degradation of network performance by sending attack traffic at low
rate. In this paper, we describe a novel framework that deals with the
detection of variety of DDoS attacks by monitoring propagation of abrupt
traffic changes inside ISP Domain and then characterizes flows that carry
attack traffic. Two statistical metrics namely, Volume and Flow are used as
parameters to detect DDoS attacks. Effectiveness of an anomaly based detection
and characterization system highly depends on accuracy of threshold value
settings. Inaccurate threshold values cause a large number of false positives
and negatives. Therefore, in our scheme, Six-Sigma and varying tolerance factor
methods are used to identify threshold values accurately and dynamically for
various statistical metrics. NS-2 network simulator on Linux platform is used
as simulation testbed to validate effectiveness of proposed approach. Different
attack scenarios are implemented by varying total number of zombie machines and
at different attack strengths. The comparison with volume-based approach
clearly indicates the supremacy of our proposed system.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2012 04:18:11 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Gupta",
"B. B.",
""
],
[
"Misra",
"Manoj",
""
],
[
"Joshi",
"R. C.",
""
]
] |
new_dataset
| 0.981971 |
1203.2506
|
Balasubramanian Karuppanan
|
Akin Cellatoglu and Balasubramanian Karuppanan
|
Vibrating Cantilever Transducer Incorporated in Dual Diaphragms
Structure for Sensing Differential Pneumatic Pressure
|
15 pages 11 figures AIAA conference Tirunelveli, 2011
|
International Journal on Soft Computing ( IJSC ) Vol.2, No.4,
November 2011, 95-109
|
10.5121/ijsc.2011.2409
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pneumatic pressure cells with thin metallic spherical diaphragm of shallow
spherical shell configuration linked with vibrating wire pickup or vibrating
cantilever pickup were reported in the past. In order to enhance the
sensitivity of the pressure cell this work considers dual diaphragm structure
fitted with cantilever pickup. The design and development of the pressure cell
with this dual diaphragm structure having cantilever pickup is presented here.
The geometrical design is optimally made as to sense either mono pressure or
differential pressure resources. The cantilevers of the two diaphragms are
excited to produce vibrations and the frequencies of vibrations are determined
by picking up signals from orthogonally arranged opto-coupler links. With the
computed frequency a lookup table is referred to obtain the pressure acting on
the concerned diaphragm. In the external circuits, the average pressure and the
differential pressure acting on two diaphragms are computed. Furthermore
transmitting circuits taking the average pressure and differential pressure in
digital form and analogue form to remote area are presented. Performance
analysis of the proposed mechatronic pressure cell is made and its improved
performance over other pressure cells is presented.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2012 14:46:58 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Cellatoglu",
"Akin",
""
],
[
"Karuppanan",
"Balasubramanian",
""
]
] |
new_dataset
| 0.998392 |
1203.2508
|
Balasubramanian Karuppanan
|
A. Cellatoglu and K. Balasubramanian
|
Pneumatic Pressure Cell with Twin Diaphragms Embedding Spherical
Corrugations in a Dual Diaphragm Structure
|
6 pages 9 figures; IJCSI International Journal of Computer Science
Issues, Special Issue, ICVCI-2011, Vol. 1, Issue 1, November 2011 ISSN
(Online): 1694-0814
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thin metallic shallow spherical diaphragms are being used for measuring
pneumatic pressure in process industries. The drift in vertex realized due to
application of pressure is transformed into electrical signal and this is
calibrated for pressure. We now propose a modified structure for the pressure
cell by having double ended shallow spherical shells embedded with spherical
corrugations as to enhance the sensitivity to a greater extent. By having dual
such installation in the structure of the pressure cell it concedes further
increase in sensitivity. The construction details of the diaphragm structure,
theory and analysis to assess the performance are presented.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2012 14:52:03 GMT"
}
] | 2012-03-13T00:00:00 |
[
[
"Cellatoglu",
"A.",
""
],
[
"Balasubramanian",
"K.",
""
]
] |
new_dataset
| 0.998523 |
1201.0043
|
Mathew Francis
|
Mathew C. Francis, Daniel Gon\c{c}alves, Pascal Ochem
|
The Maximum Clique Problem in Multiple Interval Graphs
|
22 pages
| null | null | null |
cs.DM cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple interval graphs are variants of interval graphs where instead of a
single interval, each vertex is assigned a set of intervals on the real line.
We study the complexity of the MAXIMUM CLIQUE problem in several classes of
multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding
the size of the maximum clique, is known to be NP-complete for $t$-interval
graphs when $t\geq 3$ and polynomial-time solvable when $t=1$. The problem is
also known to be NP-complete in $t$-track graphs when $t\geq 4$ and
polynomial-time solvable when $t\leq 2$. We show that MAXIMUM CLIQUE is already
NP-complete for unit 2-interval graphs and unit 3-track graphs. Further, we
show that the problem is APX-complete for 2-interval graphs, 3-track graphs,
unit 3-interval graphs and unit 4-track graphs. We also introduce two new
classes of graphs called $t$-circular interval graphs and $t$-circular track
graphs and study the complexity of the MAXIMUM CLIQUE problem in them. On the
positive side, we present a polynomial time $t$-approximation algorithm for
WEIGHTED MAXIMUM CLIQUE on $t$-interval graphs, improving earlier work with
approximation ratio $4t$.
|
[
{
"version": "v1",
"created": "Fri, 30 Dec 2011 00:38:07 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Mar 2012 10:03:51 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Francis",
"Mathew C.",
""
],
[
"Gonçalves",
"Daniel",
""
],
[
"Ochem",
"Pascal",
""
]
] |
new_dataset
| 0.997868 |
1201.2107
|
Naagesh Bhat S
|
Naagesh S. Bhat
|
Design and ASIC implementation of DUC/DDC for communication systems
| null |
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.2, No.4, December 2011
|
10.5121/vlsic.2011.2410
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Communication systems use the concept of transmitting information using the
electrical distribution network as a communication channel. To enable the
transmission data signal modulated on a carrier signal is superimposed on the
electrical wires. Typical power lines are designed to handle 50/60 Hz of AC
power signal; however they can carry the signals up to 500 KHz frequency. This
work aims to aid transmission/reception of an audio signal in the spectrum from
300 Hz to 4000 Hz using PLCC on a tunable carrier frequency in the spectrum
from 200 KHz to 500 KHz. For digital amplitude modulation the sampling rate of
the carrier and the audio signal has to be matched. Tunable carrier generation
can be achieved with Direct Digital Synthesizers at a desired sampling rate.
DSP Sample rate conversion techniques are very useful to make the sampling
circuits to work on their own sampling rates which are fine for the
data/modulated-carrier signal's bandwidth. This also simplifies the complexity
of the sampling circuits. Digital Up Conversion (DUC) and Digital Down
Conversion (DDC) are DSP sample rate conversion techniques which refer to
increasing and decreasing the sampling rate of a signal respectively.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 16:46:57 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Bhat",
"Naagesh S.",
""
]
] |
new_dataset
| 0.978053 |
1203.1964
|
Jean Maitem
|
Jean Maitem, Rosmina Joy Cabauatan, Lorena Rabago, Bartolome Tanguilig
III
|
Math world: A game-based 3D Virtual Learning Environment (3D VLE) for
second graders
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper intends to introduce a game-based 3D Virtual Learning Environment
(VLE) to second graders. The impetus arose from the need to make learning in
mathematics more effective and interesting through multimedia. Applied in a
game, the basic mathematical operations such as addition, subtraction,
multiplication, and division are expected to performed by learners as they
represent themselves as avatars while they immerse in a quest of digital
objects in the VLE called Math World. Educational attributes such as mentality
change, emotional fulfillment, knowledge enhancement, thinking skills
development, and bodily coordination are evaluated to ensure learning
effectiveness. Also, game playability measured in terms of game plays, story,
mechanics and interface usability are examined for its educative design. With
an aggregate of these enhanced indices, results attest that objectives were met
while making mathematics an interesting, motivating and enjoyable subject,
hence VLE a significant tool to complement the conventional approaches of
teaching.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 00:08:43 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Maitem",
"Jean",
""
],
[
"Cabauatan",
"Rosmina Joy",
""
],
[
"Rabago",
"Lorena",
""
],
[
"Tanguilig",
"Bartolome",
"III"
]
] |
new_dataset
| 0.999606 |
1203.1971
|
Naagesh Bhat S
|
Naagesh S. Bhat
|
Design and modelling of different SRAM's based on CNTFET 32nm technology
|
15 Pages
|
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.3, No.1, February 2012
|
10.5121/vlsic.2012.3106
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Carbon nanotube field-effect transistor (CNTFET) refers to a field-effect
transistor that utilizes a single carbon nanotube or an array of carbon
nanotubes as the channel material instead of bulk silicon in the traditional
MOSFET structure. Since it was first demonstrated in 1998, there have been
tremendous developments in CNTFETs, which promise for an alternative material
to replace silicon in future electronics. Carbon nanotubes are promising
materials for the nano-scale electron devices such as nanotube FETs for
ultra-high density integrated circuits and quantum-effect devices for novel
intelligent circuits, which are expected to bring a breakthrough in the present
silicon technology.
A Static Random Access Memory (SRAM) is designed to plug two needs: i) The
SRAM provides as cache memory, communicating between central processing unit
and Dynamic Random Access Memory (DRAM). ii) The SRAM technology act as driving
force for low power application since SRAM is portable compared to DRAM, and
SRAM doesn't require any refresh current. On the basis of acquired knowledge,
we present different SRAM's designed for the conventional CNTFET. HSPICE
simulations of this circuit using Stanford CNTFET model shows a great
improvement in power saving.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 01:59:33 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Bhat",
"Naagesh S.",
""
]
] |
new_dataset
| 0.999754 |
1203.2044
|
Haboub Rachid
|
Rachid Haboub and Mohammed Ouzzif
|
Secure and reliable routing in mobile adhoc networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing diffusion of wireless-enabled portable devices and the recent
advances in Mobile Ad-hoc NETworks (MANETs) open new scenarios where users can
benefit from anywhere and at any time for impromptu collaboration. However,
energy constrained nodes, low channel bandwidth, node mobility, high channel
error rates, channel variability and packet loss are some of the limitations of
MANETs. MANETs presents also security challenges. These networks are prone to
malicious users attack, because any device within the frequency range can get
access to the MANET. There is a need for security mechanisms aware of these
challenges. Thus, this work aims to provide a secure MANET by changing the
frequency of data transmission. This security approach was tested, and the
results shows an interesting decreased of throughput from malicious node when
the number of frequency used is increased, that way the MANET will not waste
it's resources treating malicious packets. The other contribution of this work
is a mobility aware routing approach, which aims to provide a more reliable
routing by handling effectively the nodes mobility.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 11:20:03 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Haboub",
"Rachid",
""
],
[
"Ouzzif",
"Mohammed",
""
]
] |
new_dataset
| 0.995883 |
1203.2147
|
Sudheer Gopinathan Dr
|
G.Sudheer and B.V.S.Renuka Devi
|
A Hybrid Image Cryptosystem Based On OMFLIP Permutation Cipher
|
8 pages
|
Signal & Image Processing : An International Journal (SIPIJ)
Vol.3, No.1, February 2012
| null | null |
cs.MM cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The protection of confidential image data from unauthorized access is an
important area of research in network communication. This paper presents a
high-level security encryption scheme for gray scale images. The gray level
image is first decomposed into binary images using bit scale decomposition.
Each binary image is then compressed by selecting a good scanning path that
minimizes the total number of bits needed to encode the bit sequence along the
scanning path using two dimensional run encoding. The compressed bit string is
then scrambled iteratively using a pseudo-random number generator and finally
encrypted using a bit level permutation OMFLIP. The performance is tested,
illustrated and discussed.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 17:43:28 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Sudheer",
"G.",
""
],
[
"Devi",
"B. V. S. Renuka",
""
]
] |
new_dataset
| 0.977275 |
1203.2167
|
Naagesh Bhat S
|
Naagesh S. Bhat
|
Design and Implementation of IEEE 802.15.4 Mac Protocol on FPGA
|
5 Pages, 11 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IEEE 802.15.4 is a wireless standard introduced for low power, low cost
wireless communication with moderate data rates. In the next few years, it is
expected that Low Rate Wireless Personal Area Networks (LR-WPAN) will be used
in a wide variety of embedded applications, including home automation,
industrial sensing and control, environmental monitoring and sensing. In these
applications, numerous embedded devices running on batteries are distributed in
an area communicating via wireless radios. This work presents a method which
can be used for comparing current consumption of wireless data transfer
embedded systems. This paper implements a small subset of the IEEE 802.15.4
protocol to achieve a point to point communication. The implemented protocol
uses 802.15.4 MAC compliant data and acknowledgment packets. Current
consumption is measured while doing one data packet transmission. Measurements
are compared with existing work. IEEE 802.15.4 protocol implementation is done
using Verilog language. Code implementation is done in such a manner so that it
can be ported to any platform with minimal changes. It can also be modified to
suit any special experimental setup requirements.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2012 20:01:37 GMT"
}
] | 2012-03-12T00:00:00 |
[
[
"Bhat",
"Naagesh S.",
""
]
] |
new_dataset
| 0.969041 |
1203.1448
|
Barak Pearlmutter
|
Alexey Radul and Barak A. Pearlmutter and Jeffrey Mark Siskind
|
AD in Fortran, Part 1: Design
| null | null | null | null |
cs.PL cs.MS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose extensions to Fortran which integrate forward and reverse
Automatic Differentiation (AD) directly into the programming model.
Irrespective of implementation technology, embedding AD constructs directly
into the language extends the reach and convenience of AD while allowing
abstraction of concepts of interest to scientific-computing practice, such as
root finding, optimization, and finding equilibria of continuous games.
Multiple different subprograms for these tasks can share common interfaces,
regardless of whether and how they use AD internally. A programmer can maximize
a function F by calling a library maximizer, XSTAR=ARGMAX(F,X0), which
internally constructs derivatives of F by AD, without having to learn how to
use any particular AD tool. We illustrate the utility of these extensions by
example: programs become much more concise and closer to traditional
mathematical notation. A companion paper describes how these extensions can be
implemented by a program that generates input to existing Fortran-based AD
tools.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 12:04:05 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Mar 2012 09:51:03 GMT"
}
] | 2012-03-09T00:00:00 |
[
[
"Radul",
"Alexey",
""
],
[
"Pearlmutter",
"Barak A.",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.971983 |
1203.1513
|
Joan Bruna
|
Joan Bruna and St\'ephane Mallat
|
Invariant Scattering Convolution Networks
|
15 pages double column, 9 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A wavelet scattering network computes a translation invariant image
representation, which is stable to deformations and preserves high frequency
information for classification. It cascades wavelet transform convolutions with
non-linear modulus and averaging operators. The first network layer outputs
SIFT-type descriptors whereas the next layers provide complementary invariant
information which improves classification. The mathematical analysis of wavelet
scattering networks explains important properties of deep convolution networks
for classification.
A scattering representation of stationary processes incorporates higher order
moments and can thus discriminate textures having the same Fourier power
spectrum. State of the art classification results are obtained for handwritten
digits and texture discrimination, using a Gaussian kernel SVM and a generative
PCA classifier.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2012 17:12:42 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Mar 2012 10:29:32 GMT"
}
] | 2012-03-09T00:00:00 |
[
[
"Bruna",
"Joan",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.974745 |
1203.1633
|
Nathaniel Johnston
|
Nathaniel Johnston
|
The Complexity of the Puzzles of Final Fantasy XIII-2
|
16 pages, 9 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze the computational complexity of solving the three "temporal rift"
puzzles in the recent popular video game Final Fantasy XIII-2. We show that the
Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving
the Crystal Bonds puzzle. We also show that slight generalizations of the
Crystal Bonds and Hands of Time puzzles are NP-hard.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 21:05:24 GMT"
}
] | 2012-03-09T00:00:00 |
[
[
"Johnston",
"Nathaniel",
""
]
] |
new_dataset
| 0.988956 |
1112.1186
|
Olivier Finkel
|
Olivier Finkel (ELM)
|
The Determinacy of Context-Free Games
|
To appear in the Proceedings of the 29 th International Symposium on
Theoretical Aspects of Computer Science, STACS 2012
| null |
10.4230/LIPIcs.STACS.2012.555
| null |
cs.GT cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the determinacy of Gale-Stewart games whose winning sets are
accepted by real-time 1-counter B\"uchi automata is equivalent to the
determinacy of (effective) analytic Gale-Stewart games which is known to be a
large cardinal assumption. We show also that the determinacy of Wadge games
between two players in charge of omega-languages accepted by 1-counter B\"uchi
automata is equivalent to the (effective) analytic Wadge determinacy. Using
some results of set theory we prove that one can effectively construct a
1-counter B\"uchi automaton A and a B\"uchi automaton B such that: (1) There
exists a model of ZFC in which Player 2 has a winning strategy in the Wadge
game W(L(A), L(B)); (2) There exists a model of ZFC in which the Wadge game
W(L(A), L(B)) is not determined. Moreover these are the only two possibilities,
i.e. there are no models of ZFC in which Player 1 has a winning strategy in the
Wadge game W(L(A), L(B)).
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 07:58:59 GMT"
}
] | 2012-03-08T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM"
]
] |
new_dataset
| 0.992471 |
1203.1466
|
Riccardo Murri
|
Riccardo Murri and Sergio Maffioletti
|
Batch-oriented software appliances
|
11 pages, no figures. Submitted to VTDC'12
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents AppPot, a system for creating Linux software appliances.
AppPot can be run as a regular batch or grid job and executed in user space,
and requires no special virtualization support in the infrastructure.
The main design goal of AppPot is to bring the benefits of a
virtualization-based IaaS cloud to existing batch-oriented computing
infrastructures.
In particular, AppPot addresses the application deployment and configuration
on large heterogeneous computing infrastructures: users are enabled to prepare
their own customized virtual appliance for providing a safe execution
environment for their applications. These appliances can then be executed on
virtually any computing infrastructure being in a private or public cloud as
well as any batch-controlled computing clusters the user may have access to.
We give an overview of AppPot and its features, the technology that makes it
possible, and report on experiences running it in production use within the
Swiss National Grid infrastructure SMSCG.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 13:45:24 GMT"
}
] | 2012-03-08T00:00:00 |
[
[
"Murri",
"Riccardo",
""
],
[
"Maffioletti",
"Sergio",
""
]
] |
new_dataset
| 0.994053 |
1103.3641
|
Jens Zumbr\"agel
|
Jens Zumbr\"agel, Vitaly Skachek, and Mark F. Flanagan
|
On the Pseudocodeword Redundancy of Binary Linear Codes
|
14 pages. arXiv admin note: substantial text overlap with
arXiv:1005.3486
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary
linear code are defined to be the smallest number of rows in a parity-check
matrix such that the corresponding minimum pseudoweight is equal to the minimum
Hamming distance of the code. It is shown that most codes do not have a finite
pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy
for some families of codes, including codes based on designs, are provided. The
pseudocodeword redundancies for all codes of small length (at most 9) are
computed. Furthermore, comprehensive results are provided on the cases of
cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel
and Koetter is sharp.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2011 14:57:28 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Mar 2012 13:33:00 GMT"
}
] | 2012-03-07T00:00:00 |
[
[
"Zumbrägel",
"Jens",
""
],
[
"Skachek",
"Vitaly",
""
],
[
"Flanagan",
"Mark F.",
""
]
] |
new_dataset
| 0.988114 |
1203.1097
|
Abhijeet Bhorkar
|
Abhijeet Bhorkar, Mohammad Naghshwar, Tara Javidi
|
Opportunistic Routing with Congestion Diversity in Wireless Ad-hoc
Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of routing packets across a multi-hop network
consisting of multiple sources of traffic and wireless links while ensuring
bounded expected delay. Each packet transmission can be overheard by a random
subset of receiver nodes among which the next relay is selected
opportunistically.
The main challenge in the design of minimum-delay routing policies is
balancing the trade-off between routing the packets along the shortest paths to
the destination and distributing traffic according to the maximum backpressure.
Combining important aspects of shortest path and backpressure routing, this
paper provides a systematic development of a distributed opportunistic routing
policy with congestion diversity ({D-ORCD}).
{D-ORCD} uses a measure of draining time to opportunistically identify and
route packets along the paths with an expected low overall congestion. {D-ORCD}
is proved to ensure a bounded expected delay for all networks and under any
admissible traffic. Furthermore, this paper proposes a practical implementation
which empirically optimizes critical algorithm parameters and their effects on
delay as well as protocol overhead. Realistic Qualnet simulations for
802.11-based networks demonstrate a significant improvement in the average
delay over comparative solutions in the literature. %Finally, various practical
modifications to {D-ORCD} are proposed and their performance are evaluated.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2012 04:30:05 GMT"
}
] | 2012-03-07T00:00:00 |
[
[
"Bhorkar",
"Abhijeet",
""
],
[
"Naghshwar",
"Mohammad",
""
],
[
"Javidi",
"Tara",
""
]
] |
new_dataset
| 0.99721 |
0907.3208
|
Serge Gaspers
|
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and St\'ephan Thomass\'e
|
A Linear Vertex Kernel for Maximum Internal Spanning Tree
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a polynomial time algorithm that for any graph G and integer k >=
0, either finds a spanning tree with at least k internal vertices, or outputs a
new graph G' on at most 3k vertices and an integer k' such that G has a
spanning tree with at least k internal vertices if and only if G' has a
spanning tree with at least k' internal vertices. In other words, we show that
the Maximum Internal Spanning Tree problem parameterized by the number of
internal vertices k, has a 3k-vertex kernel. Our result is based on an
innovative application of a classical min-max result about hypertrees in
hypergraphs which states that "a hypergraph H contains a hypertree if and only
if H is partition connected."
|
[
{
"version": "v1",
"created": "Mon, 20 Jul 2009 18:50:55 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Mar 2012 18:23:27 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Fomin",
"Fedor V.",
""
],
[
"Gaspers",
"Serge",
""
],
[
"Saurabh",
"Saket",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.999377 |
1112.1308
|
Alexey Pospelov
|
Markus Bl\"aser, Jean-S\'ebastien Coron, Alexey Pospelov
|
Small Private Circuits
|
Withdrawing while fixing a flaw in the proof
| null | null | null |
cs.CR cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ishai, Sahai, and Wagner initiated in 2003 the theoretical study of securing
a circuit against an adversary who can probe its wires. They presented a
universal way of transforming an arbitrary boolean circuit of size s into a
circuit of size linear in s and quadratic in t, with perfect security against
an adversary who can read up to t wires of the circuit. We present a new method
for securing circuits against such an adversary with circuit size linear in s
and polylogarithmic in t, while meeting the original privacy requirements from
Ishai et al.
Our solution works for arithmetic circuits over arbitrary fields of positive
characteristic. The improvement from quadratic to quasilinear complexity (in t)
comes from using the DFT instead of naive multiplication.
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 15:15:37 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Mar 2012 21:19:37 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Bläser",
"Markus",
""
],
[
"Coron",
"Jean-Sébastien",
""
],
[
"Pospelov",
"Alexey",
""
]
] |
new_dataset
| 0.981126 |
1203.0640
|
Florentina Pintea
|
Qasim Siddique
|
Kerberos Authentication in Wireless Sensor Networks
|
14 pages
|
Ann. Univ. Tibiscus Comp. Sci. Series VIII / 1 (2010), 67-80
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We proposed an authentication mechanism in the wireless sensor network.
Sensor network uses the Kerberos authentication scheme for the authentication
of bases station in the network. Kerberos provides a centralized authentication
server whose function is to authenticate user by providing him the ticket to
grant request to the base station. In this paper we have provided architecture
for the authentication of base station in the wireless sensor network based on
the Kerberos server authentication scheme.
|
[
{
"version": "v1",
"created": "Sat, 3 Mar 2012 10:34:12 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Siddique",
"Qasim",
""
]
] |
new_dataset
| 0.999386 |
1203.0728
|
Patrick Sol\'e
|
A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Sol\'e, C. Thomassen
|
The maximum number of minimal codewords in an $[n,k]-$code
|
6 pp. Submitted
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Upper and lower bounds are derived for the quantity in the title, which is
tabulated for modest values of $n$ and $k.$ An application to graphs with many
cycles is given.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2012 11:06:54 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Alahmadi",
"A.",
""
],
[
"Aldred",
"R. E. L.",
""
],
[
"Cruz",
"R. dela",
""
],
[
"Solé",
"P.",
""
],
[
"Thomassen",
"C.",
""
]
] |
new_dataset
| 0.991884 |
1203.0744
|
Shu Kong
|
Shu Kong and Donghui Wang
|
A Report on Multilinear PCA Plus Multilinear LDA to Deal with Tensorial
Data: Visual Classification as An Example
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In practical applications, we often have to deal with high order data, such
as a grayscale image and a video sequence are intrinsically 2nd-order tensor
and 3rd-order tensor, respectively. For doing clustering or classification of
these high order data, it is a conventional way to vectorize these data before
hand, as PCA or FDA does, which often induce the curse of dimensionality
problem. For this reason, experts have developed many methods to deal with the
tensorial data, such as multilinear PCA, multilinear LDA, and so on. In this
paper, we still address the problem of high order data representation and
recognition, and propose to study the result of merging multilinear PCA and
multilinear LDA into one scenario, we name it \textbf{GDA} for the abbreviation
of Generalized Discriminant Analysis. To evaluate GDA, we perform a series of
experiments, and the experimental results demonstrate our GDA outperforms a
selection of competing methods such (2D)$^2$PCA, (2D)$^2$LDA, and MDA.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2012 15:00:16 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Kong",
"Shu",
""
],
[
"Wang",
"Donghui",
""
]
] |
new_dataset
| 0.983799 |
1203.0882
|
Subhadip Basu
|
Subhadip Basu, Nibaran Das, Ram Sarkar, Mahantapas Kundu, Mita
Nasipuri, Dipak Kumar Basu
|
Handwritten Bangla Alphabet Recognition using an MLP Based Classifier
| null |
Proc. of the 2nd National Conf. on Computer Processing of Bangla,
pp. 285-291, Feb-2005, Dhaka
| null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work presented here involves the design of a Multi Layer Perceptron (MLP)
based classifier for recognition of handwritten Bangla alphabet using a 76
element feature set Bangla is the second most popular script and language in
the Indian subcontinent and the fifth most popular language in the world. The
feature set developed for representing handwritten characters of Bangla
alphabet includes 24 shadow features, 16 centroid features and 36 longest-run
features. Recognition performances of the MLP designed to work with this
feature set are experimentally observed as 86.46% and 75.05% on the samples of
the training and the test sets respectively. The work has useful application in
the development of a complete OCR system for handwritten Bangla text.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2012 12:22:23 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Basu",
"Subhadip",
""
],
[
"Das",
"Nibaran",
""
],
[
"Sarkar",
"Ram",
""
],
[
"Kundu",
"Mahantapas",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"Dipak Kumar",
""
]
] |
new_dataset
| 0.991374 |
1203.0964
|
Fernando Brito e Abreu
|
Fernando Brito e Abreu
|
The cloud paradigm: Are you tuned for the lyrics?
|
Position paper to introduce a keynote, proceedings of WAMPS'2011 - VI
Annual MPS.BR Workshop, pp. 20-25, Campinas, Brazil, October 2011
| null | null | null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Major players, business angels and opinion-makers are broadcasting beguiled
lyrics on the most recent IT hype: your software should ascend to the clouds.
There are many clouds and the stake is high. Distractedly, many of us became
assiduous users of the cloud, but perhaps due to the legacy systems and legacy
knowledge, IT professionals, mainly those many that work in business
information systems for the long tail, are not as much plunged into producing
cloud-based systems for their clients.
This keynote will delve into several aspects of this cloud paradigm, from
more generic concerns regarding security and value for money, to more specific
worries that reach software engineers in general. Do we need a different
software development process? Are development techniques and tools mature
enough? What about the role of open-source in the cloud? How do we assess the
quality in cloud-based development? Please stay tuned for more!
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2012 09:50:28 GMT"
}
] | 2012-03-06T00:00:00 |
[
[
"Abreu",
"Fernando Brito e",
""
]
] |
new_dataset
| 0.959753 |
1203.0500
|
Amelia Carolina Sparavigna
|
A.C. Sparavigna and R. Marazzato
|
Georeferenced lives
|
GIS, Satellite Maps, Google Earth, KML, XML, Acme Mapper
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To give a georeference means to give a reference as existing in the physical
space of Earth. This procedure is widely used for the location of
archaeological, historical and other sites when geographic information systems
(GIS) are used. Here we are proposing to georeference the lives of famous
people (in the paper, Newton and Schiaparelli) for teaching purposes, to
increase the appeal of some scientific disciplines.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2012 15:51:17 GMT"
}
] | 2012-03-05T00:00:00 |
[
[
"Sparavigna",
"A. C.",
""
],
[
"Marazzato",
"R.",
""
]
] |
new_dataset
| 0.999557 |
1203.0511
|
Dmitry Ageyev
|
Dmitry Ageyev, Haidara Abdalla
|
Multiservice Telecommunication Systems Parametrical Synthesis by using
of Multilayer Graph Mathematical Model
|
9 pages, 2 figures, 14 references. In russian
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This study is devoted to the problem of parametric synthesis of multi-service
telecommunication sys-tems. The main characteristics of telecommunication
systems, which are brought to account in an article, are multilayer structure
formed by the overlayed networks and presence flows with self-similarity
effect. For accounting these features of modern telecommunications systems is
proposed to use a multi-layered graph for describing the system structure, and
self-similar processes model for modeling flows in a network. Solution of
parametric synthesis problem is reduced to a nonlinear programming problem
which is solved by using gradient descent method.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2012 16:23:01 GMT"
}
] | 2012-03-05T00:00:00 |
[
[
"Ageyev",
"Dmitry",
""
],
[
"Abdalla",
"Haidara",
""
]
] |
new_dataset
| 0.976238 |
1202.6548
|
Davide Albanese
|
Davide Albanese and Roberto Visintainer and Stefano Merler and
Samantha Riccadonna and Giuseppe Jurman and Cesare Furlanello
|
mlpy: Machine Learning Python
|
Corrected a few typos; rephrased two sentences in the Overview
section
| null | null | null |
cs.MS cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
mlpy is a Python Open Source Machine Learning library built on top of
NumPy/SciPy and the GNU Scientific Libraries. mlpy provides a wide range of
state-of-the-art machine learning methods for supervised and unsupervised
problems and it is aimed at finding a reasonable compromise among modularity,
maintainability, reproducibility, usability and efficiency. mlpy is
multiplatform, it works with Python 2 and 3 and it is distributed under GPL3 at
the website http://mlpy.fbk.eu.
|
[
{
"version": "v1",
"created": "Wed, 29 Feb 2012 13:49:10 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Mar 2012 13:31:54 GMT"
}
] | 2012-03-02T00:00:00 |
[
[
"Albanese",
"Davide",
""
],
[
"Visintainer",
"Roberto",
""
],
[
"Merler",
"Stefano",
""
],
[
"Riccadonna",
"Samantha",
""
],
[
"Jurman",
"Giuseppe",
""
],
[
"Furlanello",
"Cesare",
""
]
] |
new_dataset
| 0.999159 |
1203.0231
|
Tapalina Bhattasali
|
Tapalina Bhattasali, Rituparna Chaki, Sugata Sanyal
|
Sleep Deprivation Attack Detection in Wireless Sensor Network
|
7 pages,4 figures, IJCA Journal February 2012
|
International Journal of Computer Applications 40(15):19-25,
February 2012. Published by Foundation of Computer Science, New York, USA
|
10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deployment of sensor network in hostile environment makes it mainly
vulnerable to battery drainage attacks because it is impossible to recharge or
replace the battery power of sensor nodes. Among different types of security
threats, low power sensor nodes are immensely affected by the attacks which
cause random drainage of the energy level of sensors, leading to death of the
nodes. The most dangerous type of attack in this category is sleep deprivation,
where target of the intruder is to maximize the power consumption of sensor
nodes, so that their lifetime is minimized. Most of the existing works on sleep
deprivation attack detection involve a lot of overhead, leading to poor
throughput. The need of the day is to design a model for detecting intrusions
accurately in an energy efficient manner. This paper proposes a hierarchical
framework based on distributed collaborative mechanism for detecting sleep
deprivation torture in wireless sensor network efficiently. Proposed model uses
anomaly detection technique in two steps to reduce the probability of false
intrusion.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2012 16:19:43 GMT"
}
] | 2012-03-02T00:00:00 |
[
[
"Bhattasali",
"Tapalina",
""
],
[
"Chaki",
"Rituparna",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.99391 |
1009.0088
|
David Eppstein
|
Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten
L\"offler
|
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial
Area
|
13 pages, 5 figures. This is an extended version of a paper to appear
in Proc. 18th Int. Symp. Graph Drawing, 2010
|
J. Graph Algorithms and Applications 16(2):243-259, 2012
| null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the classic graph drawing problem of drawing a planar graph using
straight-line edges with a prescribed convex polygon as the outer face. Unlike
previous algorithms for this problem, which may produce drawings with
exponential area, our method produces drawings with polynomial area. In
addition, we allow for collinear points on the boundary, provided such vertices
do not create overlapping edges. Thus, we solve an open problem of Duncan et
al., which, when combined with their work, implies that we can produce a planar
straight-line drawing of a combinatorially-embedded genus-g graph with the
graph's canonical polygonal schema drawn as a convex polygonal external face.
|
[
{
"version": "v1",
"created": "Wed, 1 Sep 2010 04:43:43 GMT"
}
] | 2012-03-01T00:00:00 |
[
[
"Chambers",
"Erin W.",
""
],
[
"Eppstein",
"David",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Löffler",
"Maarten",
""
]
] |
new_dataset
| 0.999164 |
1202.6438
|
Yushi Uno
|
Fumika Kino and Yushi Uno
|
Solving Tantrix via Integer Programming
|
14 pages + 1 page appendix, 15 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tantrix is a puzzle to make a loop by connecting lines drawn on hexagonal
tiles, and the objective of this research is to solve it by a computer. For
this purpose, we give a problem setting of solving Tantrix as arranging tiles
in an appropriate shape and making a loop at the same time within a given
hexagonal lattice board. We then formulate it as an integer program by
expressing the rules of Tantrix as its constraints, and solve it by a
mathematical programming solver to have a solution. As a result, we establish a
formulation that solves Tantrix of moderate sizes, and even when the solutions
are invalid only by elementary constraints, we achieved it by introducing
additional constraints and an artificial objective function to avoid flaws in
invalid solutions. By this approach we are successful in solving Tantrix of
size up to 50.
|
[
{
"version": "v1",
"created": "Wed, 29 Feb 2012 04:56:28 GMT"
}
] | 2012-03-01T00:00:00 |
[
[
"Kino",
"Fumika",
""
],
[
"Uno",
"Yushi",
""
]
] |
new_dataset
| 0.999472 |
1202.6591
|
Olivia Saierli
|
A.T. Akinwale and F.T. Ibharalu
|
Password Authentication Scheme with Secured Login Interface
|
9 pages
|
Ann. Univ. Tibiscus Comp. Sci. Series VII/2 (2009), 77-85
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel solution to the age long problem of password
security at input level. In our solution, each of the various characters from
which a password could be composed is encoded with a random single digit
integer and presented to the user via an input interface form. A legitimate
user entering his password only needs to carefully study the sequence of code
that describe his password, and then enter these code in place of his actual
password characters. This approach does not require the input code to be hidden
from anyone or converted to placeholder characters for security reasons. Our
solution engine regenerates new code for each character each time the carriage
return key is struck, producing a hardened password that is convincingly more
secure than conventional password entry system against both online and offline
attackers. Using empirical data and a prototype implementation of our scheme,
we give evidence that our approach is viable in practice, in terms of ease of
use, improved security, and performance.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 14:55:01 GMT"
}
] | 2012-03-01T00:00:00 |
[
[
"Akinwale",
"A. T.",
""
],
[
"Ibharalu",
"F. T.",
""
]
] |
new_dataset
| 0.998058 |
1011.1917
|
Zoran Sunic
|
Zoran Sunic
|
Normal art galleries: wall in - all in
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of a normal gallery, a gallery in which any
configuration of guards that visually covers the walls covers the entire
gallery. We show that any star gallery is normal and any gallery with at most
two reflex corners is normal. A polynomial time algorithm is provided deciding
if, for a given polygon and a finite set of positions, there exists a
configuration of guards in some of these positions that visually covers the
walls but not the entire gallery.
|
[
{
"version": "v1",
"created": "Mon, 8 Nov 2010 21:11:38 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Feb 2012 04:08:09 GMT"
}
] | 2012-02-29T00:00:00 |
[
[
"Sunic",
"Zoran",
""
]
] |
new_dataset
| 0.998853 |
1202.5921
|
Olivia Saierli
|
Nicolae Constantinescu
|
Estimators in Cryptography
|
7 pages
|
Ann. Univ. Tibiscus Comp. Sci. Series VII/2 (2009), 23-29
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the main problems in cryptography is to give criteria to provide good
comparators of cipher systems. The security of a cipher system must include the
security of the algorithm, the security of the key generator and management
module (see [BM94], [CM97],[Mau92a]) and the security of the cryptographic key
agreement protocol (see [Mau93a],[MC94],[Mau93b],[Mau92b]). This paper gives
show the necessary mathematical background to estimate the most important
cryptographic measures of the key generators and of the unconditionally key
agreement protocols. These cryptographic measures are the Shannon entropy (for
the key generator module) and Renyi entropy of order alpha for the key
agreement protocol.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 13:13:17 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Feb 2012 05:46:23 GMT"
}
] | 2012-02-29T00:00:00 |
[
[
"Constantinescu",
"Nicolae",
""
]
] |
new_dataset
| 0.99315 |
1202.6124
|
EPTCS
|
Gerjan Stokkink (University of Twente), Mark Timmer (University of
Twente), Mari\"elle Stoelinga (University of Twente)
|
Talking quiescence: a rigorous theory that supports parallel
composition, action hiding and determinisation
|
In Proceedings MBT 2012, arXiv:1202.5826
|
EPTCS 80, 2012, pp. 73-87
|
10.4204/EPTCS.80.6
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of quiescence - the absence of outputs - is vital in both
behavioural modelling and testing theory. Although the need for quiescence was
already recognised in the 90s, it has only been treated as a second-class
citizen thus far. This paper moves quiescence into the foreground and
introduces the notion of quiescent transition systems (QTSs): an extension of
regular input-output transition systems (IOTSs) in which quiescence is
represented explicitly, via quiescent transitions. Four carefully crafted rules
on the use of quiescent transitions ensure that our QTSs naturally capture
quiescent behaviour.
We present the building blocks for a comprehensive theory on QTSs supporting
parallel composition, action hiding and determinisation. In particular, we
prove that these operations preserve all the aforementioned rules.
Additionally, we provide a way to transform existing IOTSs into QTSs, allowing
even IOTSs as input that already contain some quiescent transitions. As an
important application, we show how our QTS framework simplifies the fundamental
model-based testing theory formalised around ioco.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2012 05:33:49 GMT"
}
] | 2012-02-29T00:00:00 |
[
[
"Stokkink",
"Gerjan",
"",
"University of Twente"
],
[
"Timmer",
"Mark",
"",
"University of\n Twente"
],
[
"Stoelinga",
"Mariëlle",
"",
"University of Twente"
]
] |
new_dataset
| 0.974849 |
1202.6266
|
Florentina Pintea
|
Ali Sadiqui, Noureddine Chenfour
|
Realisation d'un systeme de reconnaissance automatique de la parole
arabe base sur CMU Sphinx
| null |
Ann. Univ. Tibiscus Comp. Sci. Series VIII / 1 (2010), 27-40
| null |
14 pages
|
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the continuation of the work completed by Satori and all.
[SCH07] by the realization of an automatic speech recognition system (ASR) for
Arabic language based SPHINX 4 system. The previous work was limited to the
recognition of the first ten digits, whereas the present work is a remarkable
projection consisting in continuous Arabic speech recognition with a rate of
recognition of surroundings 96%.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2012 16:04:36 GMT"
}
] | 2012-02-29T00:00:00 |
[
[
"Sadiqui",
"Ali",
""
],
[
"Chenfour",
"Noureddine",
""
]
] |
new_dataset
| 0.996221 |
1103.3076
|
Anil Hirani
|
Nathan Bell and Anil N. Hirani
|
PyDEC: Software and Algorithms for Discretization of Exterior Calculus
|
Revised as per referee reports. Added information on scalability,
removed redundant text, emphasized the role of matrix based algorithms,
shortened length of paper
| null | null | null |
cs.NA cs.CG cs.MS math.DG math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the algorithms, features and implementation of PyDEC, a
Python library for computations related to the discretization of exterior
calculus. PyDEC facilitates inquiry into both physical problems on manifolds as
well as purely topological problems on abstract complexes. We describe
efficient algorithms for constructing the operators and objects that arise in
discrete exterior calculus, lowest order finite element exterior calculus and
in related topological problems. Our algorithms are formulated in terms of
high-level matrix operations which extend to arbitrary dimension. As a result,
our implementations map well to the facilities of numerical libraries such as
NumPy and SciPy. The availability of such libraries makes Python suitable for
prototyping numerical methods. We demonstrate how PyDEC is used to solve
physical and topological problems through several concise examples.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2011 01:50:33 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Feb 2012 19:57:51 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Bell",
"Nathan",
""
],
[
"Hirani",
"Anil N.",
""
]
] |
new_dataset
| 0.997492 |
1112.4236
|
Ravi Teja Sukhavasi
|
Ravi Teja Sukhavasi and Babak Hassibi
|
Error Correcting Codes for Distributed Control
|
39 pages
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of stabilizing an unstable plant over a noisy communication link
is an increasingly important one that arises in applications of networked
control systems. Although the work of Schulman and Sahai over the past two
decades, and their development of the notions of "tree codes"\phantom{} and
"anytime capacity", provides the theoretical framework for studying such
problems, there has been scant practical progress in this area because explicit
constructions of tree codes with efficient encoding and decoding did not exist.
To stabilize an unstable plant driven by bounded noise over a noisy channel one
needs real-time encoding and real-time decoding and a reliability which
increases exponentially with decoding delay, which is what tree codes
guarantee. We prove that linear tree codes occur with high probability and, for
erasure channels, give an explicit construction with an expected decoding
complexity that is constant per time instant. We give novel sufficient
conditions on the rate and reliability required of the tree codes to stabilize
vector plants and argue that they are asymptotically tight. This work takes an
important step towards controlling plants over noisy channels, and we
demonstrate the efficacy of the method through several examples.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2011 04:43:47 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Feb 2012 02:29:26 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Sukhavasi",
"Ravi Teja",
""
],
[
"Hassibi",
"Babak",
""
]
] |
new_dataset
| 0.995804 |
1202.5680
|
Saptarshi Das
|
Saptarshi Das, Indranil Pan, Shantanu Das and Amitava Gupta
|
A Novel Fractional Order Fuzzy PID Controller and Its Optimal Time
Domain Tuning Based on Integral Performance Indices
|
30 pages, 20 figures
|
Engineering Applications of Artificial Intelligence, vol. 25, no.
2, pp. 430-442, March 2012
|
10.1016/j.engappai.2011.10.004
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel fractional order (FO) fuzzy Proportional-Integral-Derivative (PID)
controller has been proposed in this paper which works on the closed loop error
and its fractional derivative as the input and has a fractional integrator in
its output. The fractional order differ-integrations in the proposed fuzzy
logic controller (FLC) are kept as design variables along with the input-output
scaling factors (SF) and are optimized with Genetic Algorithm (GA) while
minimizing several integral error indices along with the control signal as the
objective function. Simulations studies are carried out to control a delayed
nonlinear process and an open loop unstable process with time delay. The closed
loop performances and controller efforts in each case are compared with
conventional PID, fuzzy PID and PI{\lambda}D{\mu} controller subjected to
different integral performance indices. Simulation results show that the
proposed fractional order fuzzy PID controller outperforms the others in most
cases.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2012 18:25:57 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Das",
"Saptarshi",
""
],
[
"Pan",
"Indranil",
""
],
[
"Das",
"Shantanu",
""
],
[
"Gupta",
"Amitava",
""
]
] |
new_dataset
| 0.965126 |
1202.5857
|
Camilla Hollanti
|
Camilla Hollanti and Nadya Markin
|
Algebraic Fast-Decodable Relay Codes for Distributed Communications
|
5 pages
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, fast-decodable lattice code constructions are designed for the
nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO)
channel. The constructions are based on different types of algebraic
structures, e.g. quaternion division algebras. When satisfying certain
properties, these algebras provide us with codes whose structure naturally
reduces the decoding complexity. The complexity can be further reduced by
shortening the block length, i.e., by considering rectangular codes called less
than minimum delay (LMD) codes.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 08:44:28 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Hollanti",
"Camilla",
""
],
[
"Markin",
"Nadya",
""
]
] |
new_dataset
| 0.967351 |
1202.5938
|
Olivia Saierli
|
Qasim Siddique
|
Intelligent Car System
|
12 pages
|
Ann. Univ. Tibiscus Comp. Sci. Series VII/2 (2009), 113-124
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In modern life the road safety has becomes the core issue. One single move of
a driver can cause horrifying accident. The main goal of intelligent car system
is to make communication with other cars on the road. The system is able to
control to speed, direction and the distance between the cars the intelligent
car system is able to recognize traffic light and is able to take decision
according to it. This paper presents a framework of the intelligent car system.
I validate several aspect of our system using simulation.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 14:04:55 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Siddique",
"Qasim",
""
]
] |
new_dataset
| 0.952098 |
1202.5941
|
Olivia Saierli
|
P. Chenna Reddy
|
TCP over IEEE 802.11
|
11 pages
|
Ann. Univ. Tibiscus Comp. Sci. Series VII/2 (2009), 173-183
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.11 is a widely used wireless LAN standard for medium access control.
TCP is a prominent transport protocol originally designed for wired networks.
TCP treats packet loss as congestion and reduces the data rate. In wireless
networks packets are lost not only due to congestion but also due to various
other reasons. Hence there is need for making TCP adaptable to wireless
networks. Various parameters of TCP and IEEE 802.11 can be set to appropriate
values to achieve optimum performance results. In this paper optimum values for
various parameters of IEEE 802.11 are determined. Network simulator NS2 is used
for simulation.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 14:11:23 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Reddy",
"P. Chenna",
""
]
] |
new_dataset
| 0.999559 |
1202.5967
|
Deniz Gunduz
|
Deniz Gunduz, Elza Erkip, Andrea Goldsmith, H. Vincent Poor
|
Joint Source-Channel Cooperative Transmission over Relay-Broadcast
Networks
|
Submitted to IEEE Transactions on Information Theory, 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reliable transmission of a discrete memoryless source over a multiple-relay
relay-broadcast network is considered. Motivated by sensor network
applications, it is assumed that the relays and the destinations all have
access to side information correlated with the underlying source signal. Joint
source-channel cooperative transmission is studied in which the relays help the
transmission of the source signal to the destinations by using both their
overheard signals, as in the classical channel cooperation scenario, as well as
the available correlated side information. Decode-and-forward (DF) based
cooperative transmission is considered in a network of multiple relay terminals
and two different achievability schemes are proposed: i) a regular encoding and
sliding-window decoding scheme without explicit source binning at the encoder,
and ii) a semi-regular encoding and backward decoding scheme with binning based
on the side information statistics. It is shown that both of these schemes lead
to the same source-channel code rate, which is shown to be the "source-channel
capacity" in the case of i) a physically degraded relay network in which the
side information signals are also degraded in the same order as the channel;
and ii) a relay-broadcast network in which all the terminals want to
reconstruct the source reliably, while at most one of them can act as a relay.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 15:11:05 GMT"
}
] | 2012-02-28T00:00:00 |
[
[
"Gunduz",
"Deniz",
""
],
[
"Erkip",
"Elza",
""
],
[
"Goldsmith",
"Andrea",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.997852 |
1202.5516
|
Richard McClatchey
|
Ashiq Anjum, Peter Bloodsworth, Irfan Habib, Tom Lansdale, Richard
McClatchey, Yasir Mehmood and the neuGRID Consortium
|
Reusable Services from the neuGRID Project for Grid-Based Health
Applications
|
6 pages; 3 figures.Proceedings the 7th HealthGrid Int. Conference
(HG'09). Berlin, Germany. June 2009
|
Studies in Health Technology & Informatics Vol 147, pp 283-288
ISBN 978-1-60750-027-8 IOS Press. 2009
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By abstracting Grid middleware specific considerations from clinical research
applications, re-usable services should be developed that will provide generic
functionality aimed specifically at medical applications. In the scope of the
neuGRID project, generic services are being designed and developed which will
be applied to satisfy the requirements of neuroscientists. These services will
bring together sources of data and computing elements into a single view as far
as applications are concerned, making it possible to cope with centralised,
distributed or hybrid data and provide native support for common medical file
formats. Services will include querying, provenance, portal, anonymization and
pipeline services together with a 'glueing' service for connection to Grid
services. Thus lower-level services will hide the peculiarities of any specific
Grid technology from upper layers, provide application independence and will
enable the selection of 'fit-for-purpose' infrastructures. This paper outlines
the design strategy being followed in neuGRID using the glueing and pipeline
services as examples.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2012 18:02:14 GMT"
}
] | 2012-02-27T00:00:00 |
[
[
"Anjum",
"Ashiq",
""
],
[
"Bloodsworth",
"Peter",
""
],
[
"Habib",
"Irfan",
""
],
[
"Lansdale",
"Tom",
""
],
[
"McClatchey",
"Richard",
""
],
[
"Mehmood",
"Yasir",
""
],
[
"Consortium",
"the neuGRID",
""
]
] |
new_dataset
| 0.965163 |
0710.1976
|
Yukitaka Ishimoto
|
Yukitaka Ishimoto
|
Solving Infinite Kolam in Knot Theory
|
13 pages, 2 figures, the final version for FORMA with typo fixed
|
Forma 22 (2007) 15-30
| null |
OIQP-06-15
|
cs.DM cond-mat.stat-mech
| null |
In south India, there are traditional patterns of line-drawings encircling
dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam''
provide very interesting questions in mathematics. For example, we address the
following simple question: how many patterns of infinite Kolam can we draw for
a given grid pattern of dots? The simplest way is to draw possible patterns of
Kolam while judging if it is infinite Kolam. Such a search problem seems to be
NP complete. However, it is certainly not. In this paper, we focus on
diamond-shaped grid patterns of dots, (1-3-5-3-1) and (1-3-5-7-5-3-1) in
particular. By using the knot-theory description of the infinite Kolam, we show
how to find the solution, which inevitably gives a sketch of the proof for the
statement ``infinite Kolam is not NP complete.'' Its further discussion will be
given in the final section.
|
[
{
"version": "v1",
"created": "Wed, 10 Oct 2007 11:46:53 GMT"
}
] | 2012-02-23T00:00:00 |
[
[
"Ishimoto",
"Yukitaka",
""
]
] |
new_dataset
| 0.99841 |
1202.4830
|
EPTCS
|
Francisco Botana, Miguel A. Ab\'anades
|
Automatic Deduction in Dynamic Geometry using Sage
|
In Proceedings THedu'11, arXiv:1202.4535
|
EPTCS 79, 2012, pp. 49-62
|
10.4204/EPTCS.79.3
| null |
cs.MS cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a symbolic tool that provides robust algebraic methods to handle
automatic deduction tasks for a dynamic geometry construction. The main
prototype has been developed as two different worksheets for the open source
computer algebra system Sage, corresponding to two different ways of coding a
geometric construction. In one worksheet, diagrams constructed with the open
source dynamic geometry system GeoGebra are accepted. In this worksheet,
Groebner bases are used to either compute the equation of a geometric locus in
the case of a locus construction or to determine the truth of a general
geometric statement included in the GeoGebra construction as a boolean
variable. In the second worksheet, locus constructions coded using the common
file format for dynamic geometry developed by the Intergeo project are accepted
for computation. The prototype and several examples are provided for testing.
Moreover, a third Sage worksheet is presented in which a novel algorithm to
eliminate extraneous parts in symbolically computed loci has been implemented.
The algorithm, based on a recent work on the Groebner cover of parametric
systems, identifies degenerate components and extraneous adherence points in
loci, both natural byproducts of general polynomial algebraic methods. Detailed
examples are discussed.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2012 06:41:37 GMT"
}
] | 2012-02-23T00:00:00 |
[
[
"Botana",
"Francisco",
""
],
[
"Abánades",
"Miguel A.",
""
]
] |
new_dataset
| 0.997039 |
1202.4837
|
EPTCS
|
Jordi Saludes (UPC), Sebastian Xamb\'o (UPC)
|
The GF Mathematics Library
|
In Proceedings THedu'11, arXiv:1202.4535
|
EPTCS 79, 2012, pp. 102-110
|
10.4204/EPTCS.79.6
| null |
cs.MS cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is devoted to present the Mathematics Grammar Library, a system
for multilingual mathematical text processing. We explain the context in which
it originated, its current design and functionality and the current development
goals. We also present two prototype services and comment on possible future
applications in the area of artificial mathematics assistants.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2012 06:43:11 GMT"
}
] | 2012-02-23T00:00:00 |
[
[
"Saludes",
"Jordi",
"",
"UPC"
],
[
"Xambó",
"Sebastian",
"",
"UPC"
]
] |
new_dataset
| 0.999651 |
1202.4865
|
Carlo Alberto Boano
|
Carlo Alberto Boano, Kay R\"omer, Marco Antonio Z\'u\~niga, and Thiemo
Voigt
|
Jam-X: Wireless Agreement under Interference
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless low-power transceivers used in sensor networks such as IEEE 802.15.4
typically operate in unlicensed frequency bands that are subject to external
interference from devices transmitting at much higher power. Communication
protocols should therefore be designed to be robust against such interference.
A critical building block of many protocols at all layers is agreement on a
piece of information among a set of nodes. At the MAC layer, nodes may need to
agree on a new time slot or frequency channel; at the application layer nodes
may need to agree on handing over a leader role from one node to another.
Message loss caused by interference may break agreement in two different ways:
none of the nodes use the new information (time slot, channel, leader) and
stick with the previous assignment, or - even worse - some nodes use the new
information and some do not. This may lead to reduced performance or failures.
In this paper we investigate the problem of agreement under interference and
point out the limitations of the traditional message-based n-way handshake
approach. We propose novel protocols that use jamming instead of message
transmissions and show that they outperform the n-way handshake in terms of
agreement probability, energy consumption, and time-to-completion both in the
unicast case (two neighboring nodes agree) as well as in the broadcast case
(any number of neighboring nodes agree).
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2012 09:21:29 GMT"
}
] | 2012-02-23T00:00:00 |
[
[
"Boano",
"Carlo Alberto",
""
],
[
"Römer",
"Kay",
""
],
[
"Zúñiga",
"Marco Antonio",
""
],
[
"Voigt",
"Thiemo",
""
]
] |
new_dataset
| 0.997168 |
1202.4941
|
Shankar G MR
|
G. Shankar
|
Innovative SQA Service Maturity Model using CMMI and ITIL
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This Journal details a maturity model for SQA services which has been
developed during QMS implementation in the IT division of a large multinational
organization. The scope of the engagement was to establish a standard set of
processes based on CMMI\textregistered and ITIL\textregistered Framework across
four business verticals scattered in Europe, United States and Asia. The
services of Software Quality Analyst (SQA) from different vendors were
leveraged to facilitate implementation of processes which was referred to as
the Quality Management System (QMS). To co-ordinate and support QMS
implementation, a Software Quality Assurance Group (SQAG) was established at
the organizational level. Considering the large number of applications, the
business verticals proposed that process implementation should be owned and
managed by practitioners themselves so that the mass deployment of QMS can be
achieved at a faster rate with the same SQA capacity. This called for a need to
devise an innovative implementation solution before moving to a process
implementation model which proposed Project Managers implementing processes
themself. While there are process models and frameworks available in the market
for establishing processes in an organization, there is no model that
elaborates activities to be performed by the SQA for effective implementation
of processes. SQA service maturity model was proposed as a solution based on
CMMI\textregistered and developed to eventually proceed towards a 'Process
Implementation Model proposing Project Managers implementing processes
themself'.
SQA Service Maturity Model is a Software Quality Assurance implementation
framework that enables organisations to increase Efficiencies in Software
Quality Assurance, reduce the Cost of Defects and ultimately Increasing Return
on Investment in IT.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2012 15:41:27 GMT"
}
] | 2012-02-23T00:00:00 |
[
[
"Shankar",
"G.",
""
]
] |
new_dataset
| 0.999524 |
1202.0863
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Asymptotically Good Codes Over Non-Abelian Groups
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It has been shown that good structured codes over non-Abelian groups do
exist. Specifically, we construct codes over the smallest non-Abelian group
$\mathds{D}_6$ and show that the performance of these codes is superior to the
performance of Abelian group codes of the same alphabet size. This promises the
possibility of using non-Abelian codes for multi-terminal settings where the
structure of the code can be exploited to gain performance.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2012 02:50:45 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Feb 2012 08:31:23 GMT"
}
] | 2012-02-22T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.989962 |
1202.4451
|
Michael Neely
|
Michael J. Neely
|
Wireless Peer-to-Peer Scheduling in Mobile Networks
|
This material will be presented in part at the 46th Annual Conference
on Information Sciences and Systems (CISS), Princeton, NJ, March 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers peer-to-peer scheduling for a network with multiple
wireless devices. A subset of the devices are mobile users that desire specific
files. Each user may already have certain popular files in its cache. The
remaining devices are access points that typically have access to a larger set
of files. Users can download packets of their requested file from an access
point or from a nearby user. Our prior work optimizes peer scheduling in a
general setting, but the resulting delay can be large when applied to mobile
networks. This paper focuses on the mobile case, and develops a new algorithm
that reduces delay by opportunistically grabbing packets from current
neighbors. However, it treats a simpler model where each user desires a single
file with infinite length. An algorithm that provably optimizes throughput
utility while incentivizing participation is developed for this case. The
algorithm extends as a simple heuristic in more general cases with finite file
sizes and random active and idle periods.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2012 01:22:36 GMT"
}
] | 2012-02-22T00:00:00 |
[
[
"Neely",
"Michael J.",
""
]
] |
new_dataset
| 0.989171 |
1202.4631
|
Blerina Sinaimeri
|
Tiziana Calamoneri, Dario Frascaria and Blerina Sinaimeri
|
All graphs with at most seven vertices are Pairwise Compatibility Graphs
|
8 pages, 2 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an
edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and
$d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \in V$
and there is an edge $(u,v) \in E$ if and only if $d_{min} \leq d_{T,w} (l_u,
l_v) \leq d_{max}$ where $d_{T,w} (l_u, l_v)$ is the sum of the weights of the
edges on the unique path from $l_u$ to $l_v$ in $T$.
In this note, we show that all the graphs with at most seven vertices are
PCGs. In particular all these graphs except for the wheel on 7 vertices $W_7$
are PCGs of a particular structure of a tree: a centipede.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2012 13:26:38 GMT"
}
] | 2012-02-22T00:00:00 |
[
[
"Calamoneri",
"Tiziana",
""
],
[
"Frascaria",
"Dario",
""
],
[
"Sinaimeri",
"Blerina",
""
]
] |
new_dataset
| 0.993586 |
1202.4663
|
Mohammad Reza Sohizadeh Abyaneh
|
Mohammad Reza Sohizadeh Abyaneh
|
On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the privacy of two recent RFID tag ownership transfer
protocols are investigated against the tag owners as adversaries. The first
protocol called ROTIV is a scheme which provides a privacy-preserving ownership
transfer by using an HMAC-based authentication with public key encryption.
However, our passive attack on this protocol shows that any legitimate owner
which has been the owner of a specific tag is able to trace it either in the
past or in the future. Tracing the tag is also possible via an active attack
for any adversary who is able to tamper the tag and extract its information.
The second protocol called, Chen et al.'s protocol, is an ownership transfer
protocol for passive RFID tags which conforms EPC Class1 Generation2 standard.
Our attack on this protocol shows that the previous owners of a particular tag
are able to trace it in future. Furthermore, they are able even to obtain the
tag's secret information at any time in the future which makes them capable of
impersonating the tag.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2012 14:55:38 GMT"
}
] | 2012-02-22T00:00:00 |
[
[
"Abyaneh",
"Mohammad Reza Sohizadeh",
""
]
] |
new_dataset
| 0.995833 |
1202.4675
|
Venkata krishnan Sowrirajan
|
S.Venkata Krishnan, R.Sriram and N.Senthil Kumar
|
Adaptive and Dynamic Wireless Routers with Smart Antenna for Power
Management
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the recent evolution of wireless technologies, the power management has
been a worrying factor. In order to overcome the power shortage, steps are
taken to find new kind of energy harvesting methods, power attenuation
reduction methods and power saving techniques. Wireless routers even though
consume not much of power, battery powered devices require a lot. Omni
directional antenna embedded with multiple antennae focusing the beam of radio
wave signals in the direction of nodes with least transmission angle can be a
solution for this problem which is called as "Smart Antenna". To reduce power
maceration we are going for adaptive and dynamic transmission wherein the
transmission angle of antennae is varied in accordance with the movement of
nodes. Apart from saving the power considerably, it also improves the signal
strength
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2012 15:36:22 GMT"
}
] | 2012-02-22T00:00:00 |
[
[
"Krishnan",
"S. Venkata",
""
],
[
"Sriram",
"R.",
""
],
[
"Kumar",
"N. Senthil",
""
]
] |
new_dataset
| 0.960603 |
0912.1424
|
Jose Ignacio Alvarez-Hamelin
|
Jos\'e Ignacio Alvarez-Hamelin (FIUBA), Beir\'o Mariano Gast\'on
(FIUBA), Jorge Rodolfo Busch (FIUBA)
|
Understanding edge-connectivity in the Internet through
core-decomposition
| null |
Internet Mathematics 7, 1 (2011) 45-66
|
10.1080/15427951.2011.560786
| null |
cs.DM cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet is a complex network composed by several networks: the Autonomous
Systems, each one designed to transport information efficiently. Routing
protocols aim to find paths between nodes whenever it is possible (i.e., the
network is not partitioned), or to find paths verifying specific constraints
(e.g., a certain QoS is required). As connectivity is a measure related to both
of them (partitions and selected paths) this work provides a formal lower bound
to it based on core-decomposition, under certain conditions, and low complexity
algorithms to find it. We apply them to analyze maps obtained from the
prominent Internet mapping projects, using the LaNet-vi open-source software
for its visualization.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2009 07:34:27 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Alvarez-Hamelin",
"José Ignacio",
"",
"FIUBA"
],
[
"Gastón",
"Beiró Mariano",
"",
"FIUBA"
],
[
"Busch",
"Jorge Rodolfo",
"",
"FIUBA"
]
] |
new_dataset
| 0.950401 |
1110.5355
|
Jos\'e Ignacio Alvarez-Hamelin Phd.
|
Jos\'e Ignacio Alvarez-Hamelin
|
Is it possible to find the maximum clique in general graphs?
|
http://hal.archives-ouvertes.fr/hal-00625917/en
| null | null | null |
cs.DS cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Finding the maximum clique is a known NP-Complete problem and it is also hard
to approximate. This work proposes two efficient algorithms to obtain it.
Nevertheless, the first one is able to fins the maximum for some special cases,
while the second one has its execution time bounded by the number of cliques
that each vertex belongs to.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2011 21:12:43 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Oct 2011 20:20:36 GMT"
},
{
"version": "v3",
"created": "Fri, 17 Feb 2012 21:35:05 GMT"
}
] | 2012-02-21T00:00:00 |
[
[
"Alvarez-Hamelin",
"José Ignacio",
""
]
] |
new_dataset
| 0.954544 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.