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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1205.2048
|
Joseph O'Rourke
|
Joseph O'Rourke
|
Unfolding Prismatoids as Convex Patches: Counterexamples and Positive
Results
|
This paper was prepared for but never submitted to CCCG'12. 12
two-column pages. 27 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the unsolved problem of unfolding prismatoids in a new context,
viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the
surface of a convex polyhedron homeomorphic to a disk. We show that several
natural strategies for unfolding a prismatoid can fail, but obtain a positive
result for "petal unfolding" topless prismatoids. We also show that the natural
extension to a convex patch consisting of a face of a polyhedron and all its
incident faces, does not always have a nonoverlapping petal unfolding. However,
we obtain a positive result by excluding the problematical patches. This then
leads a positive result for restricted prismatoids. Finally, we suggest suggest
studying the unfolding of convex patches in general, and offer some possible
lines of investigation.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2012 17:52:51 GMT"
}
] | 2012-05-10T00:00:00 |
[
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.995376 |
1201.1259
|
Romain Boulet
|
Romain Boulet (LMTG), Pierre Mazzega (LMTG), Dani\`ele Bourcier
(CERSA)
|
Network Analysis of the French Environmental Code
|
AI Approaches to the Complexity of Legal Systems (AICOL 2009),
Rotterdam : Netherlands (2009)
| null |
10.1007/978-3-642-16524-5_4
| null |
cs.SI cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We perform a detailed analysis of the network constituted by the citations in
a legal code, we search for hidden structures and properties. The graph
associated to the Environmental code has a small-world structure and it is
partitioned in several hidden communities of articles that only partially
coincide with the organization of the code as given by its table of content.
Several articles are also connected with a low number of articles but are
intermediate between large communities. The structure of the Environmental Code
is contrasting with the reference network of all the French Legal Codes that
presents a rich-club of ten codes very central to the whole French legal
system, but no small-world property. This comparison shows that the structural
properties of the reference network associated to a legal system strongly
depends on the scale and granularity of the analysis, as is the case for many
complex systems
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2011 20:54:43 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Boulet",
"Romain",
"",
"LMTG"
],
[
"Mazzega",
"Pierre",
"",
"LMTG"
],
[
"Bourcier",
"Danièle",
"",
"CERSA"
]
] |
new_dataset
| 0.996081 |
1205.1604
|
Mohammad Arif
|
Mohammad Arif and Tara Rani
|
ACO based routing for MANETs
|
12 pages, 7 figures, ISSN:0975-3834 (Online); 0975-4679 (Print), 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It
dynamically forms a temporary network without using any pre existing network
infrastructure or centralized administration i.e. with minimal prior planning.
All nodes have routing capabilities and forward data packets to other nodes in
multi-hop fashion. As the network is dynamic, the network topology continuously
experiences alterations during deployment. The biggest challenge in MANETs is
to find a path between communicating nodes. The considerations of the MANET
environment and the nature of the mobile nodes create further complications
which results in the need to develop special routing algorithms to meet these
challenges. Swarm intelligence, a bio-inspired technique, which has proven to
be very adaptable in other problem domains, has been applied to the MANET
routing problem as it forms a good fit to the problem. In ant societies the
activities of the individuals are not regulated by any explicit form of
centralized control but are the result of self-organizing dynamics driven by
local interactions and communications among a number of relatively simple
individuals. This unique characteristic has made ant societies an attractive
and inspiring model for building new algorithms and new multi-agent systems. In
this paper, we have studied and reviewed Ant Colony based routing algorithms
and its variants. Finally, a performance evaluation of the original ARA and the
EARA is carried out with respect to each other.
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 07:12:47 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Arif",
"Mohammad",
""
],
[
"Rani",
"Tara",
""
]
] |
new_dataset
| 0.9994 |
1205.1630
|
Karima Ben Hamida El Abri
|
Karima Ben Hamida El Abri and Ammar Bouallegue
|
A New UWB System Based on a Frequency Domain Transformation Of The
Received Signal
|
14 pages,5 figures, journal paper
|
Karima Ben Hamida El Abri and Ammar Bouallegue,"A New UWB System
Based on a Frequency Domain Transformation Of The Received Signal", IJWMN,
april 2012
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Differential system for ultra wide band (UWB) transmission is a very
attractive solution from a practical point of view. In this paper, we present a
new direct sequence (DS) UWB system based on the conversion of the received
signal from time domain to frequency domain that's why we called FDR receiver.
Simulation results show that the proposed receiver structure outperforms the
classical differential one for both low and high data rate systems.
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 08:50:33 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Abri",
"Karima Ben Hamida El",
""
],
[
"Bouallegue",
"Ammar",
""
]
] |
new_dataset
| 0.991604 |
1205.1642
|
Jose Texier
|
Jose Texier and Bermudez Manuel
|
Traductor Writing System Web
|
LACCEI 2008, ISBN-10 0-9822896-1-8, ISBN-13 978-0-9822896-1-7
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A compilator is a program which is development in a programming language that
read a file known as source. After this file have to translate and have to
convert in other program known as object or to generate a exit. The best way
for to know any programming language is analizing a compilation process which
is same in all programming paradigm existents. To like to generate a tool that
permit a learning in university course. This course could explain in any
plataform such as Linux o Windows. This goal is posible through development a
Web aplication which is unite with a compilator, it is Traductor Writing System
(Sistema de Escritura de Traductores). This system is complete and permit
extend and modify the compilator. The system is a module in Moodle which is a
Course Management System (CMS) that help teachers for to create comunities of
learning in line. This software is in free software license (GPL).
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 09:30:46 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Texier",
"Jose",
""
],
[
"Manuel",
"Bermudez",
""
]
] |
new_dataset
| 0.99889 |
1205.1657
|
Maher Heni
|
Maher Heni and Ridha Bouallegue
|
Power control in reactive routing protocol for Mobile Ad Hoc Network
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this work is to change the routing strategy of AODV protocol (Ad
hoc On Demand Vector) in order to improve the energy consumption in mobile ad
hoc networks (MANET). The purpose is to minimize the regular period of HELLO
messages generated by the AODV protocol used for the research, development and
maintenance of routes. This information is useful to have an idea about battery
power levels of different network hosts. After storing this information, the
node elect the shortest path following the classical model used this
information to elect safest path (make a compromise) in terms of energy.
Transmitter node does not select another node as its battery will be exhausted
soon. Any node of the network can have the same information's about the
neighborhoods as well as other information about the energy level of the
different terminal to avoid routing using a link that will be lost due to an
exhausted battery of a node in this link. Analytical study and simulations by
Jist/SWANS have been conducted to note that no divergence relatively to the
classical AODV, a node can have this type of information that improves the
energy efficiency in ad hoc networks.
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 10:35:54 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Heni",
"Maher",
""
],
[
"Bouallegue",
"Ridha",
""
]
] |
new_dataset
| 0.998443 |
1205.1745
|
Pedram Hajiani Mr.
|
Pedram Hajiani, Javad Poshtan
|
Reconfigurable Controller Design For Actuator Faults In A Four-Tank
System Benchmark
|
8 pages, 5 figures, 3 tables
|
International Journal of Instrumentation and Control Systems
(IJICS) Vol.2, No.2, April 2012
| null | null |
cs.SY
|
http://creativecommons.org/licenses/publicdomain/
|
The purpose of this work is to design a state feedback controller using
Parametric Eigenstructure Assignment (PAE) technique that has the capacity to
be reconfigured in the case that partial actuator faults occur. The proposed
controller is capable of compensating the gain losses in actuators and
maintaining the control performance in faulty situations. Simulations show the
performance enhancement in comparison to the non-reconfigurable controller
through Integral Absolute Error (IAE) index for different fault scenarios.
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 17:06:37 GMT"
}
] | 2012-05-09T00:00:00 |
[
[
"Hajiani",
"Pedram",
""
],
[
"Poshtan",
"Javad",
""
]
] |
new_dataset
| 0.998721 |
1202.3097
|
Friedrich Slivovsky
|
Friedrich Slivovsky and Stefan Szeider
|
Computing Resolution-Path Dependencies in Linear Time
|
14 pages, SAT 2012
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The alternation of existential and universal quantifiers in a quantified
boolean formula (QBF) generates dependencies among variables that must be
respected when evaluating the formula. Dependency schemes provide a general
framework for representing such dependencies. Since it is generally intractable
to determine dependencies exactly, a set of potential dependencies is computed
instead, which may include false positives. Among the schemes proposed so far,
resolution-path dependencies introduce the fewest spurious dependencies. In
this work, we describe an algorithm that detects resolution-path dependencies
in linear time, resolving a problem posed by Van Gelder (CP 2011).
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2012 17:33:34 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2012 20:56:46 GMT"
},
{
"version": "v3",
"created": "Sat, 5 May 2012 10:13:45 GMT"
}
] | 2012-05-08T00:00:00 |
[
[
"Slivovsky",
"Friedrich",
""
],
[
"Szeider",
"Stefan",
""
]
] |
new_dataset
| 0.998579 |
1202.5449
|
John Fearnley
|
John Fearnley, Doron Peled, Sven Schewe
|
Synthesis of Succinct Systems
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis of correct by design systems from specification has recently
attracted much attention. The theoretical results imply that this problem is
highly intractable, e.g., synthesizing a system is 2EXPTIME-complete for an LTL
specification, and EXPTIME-complete for a CTL specification. However, an
argument against it is that the temporal specification is highly compact, and
the complexity reflects the large size of the system constructed. In that
respect, the complexity should, perhaps, be specified relative to the size of
the minimal satisfying system. A careful observation reveals that the size of
the system is presented in such arguments as the size of its state space. This
view is a bit nonstandard, in the sense that the state space can be
exponentially larger than the size of a reasonable implementation such as a
circuit or a program. Although this alternative measure of the size of the
synthesized system is more intuitive (e.g., this is the standard way model
checking problems are measured), research on synthesis has so far stayed with
measuring the system in terms of the explicit state space. This raises the
question of whether or not there always exists a small system. In this paper,
we show that this is the case if, and only if, PSPACE = EXPTIME.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2012 13:26:18 GMT"
},
{
"version": "v2",
"created": "Fri, 4 May 2012 16:34:18 GMT"
}
] | 2012-05-07T00:00:00 |
[
[
"Fearnley",
"John",
""
],
[
"Peled",
"Doron",
""
],
[
"Schewe",
"Sven",
""
]
] |
new_dataset
| 0.95533 |
1205.0919
|
Omri Mohamed Nazih
|
Radhouane Boughammoura Lobna Hlaoua and Mohamed Nazih Omri
|
ViQIE: A New Approach for Visual Query Interpretation and Extraction
|
ICITES 2012 - 2nd International Conference on Information Technology
and e-Services
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web services are accessed via query interfaces which hide databases
containing thousands of relevant information. User's side, distant database is
a black box which accepts query and returns results, there is no way to access
database schema which reflect data and query meanings. Hence, web services are
very autonomous. Users view this autonomy as a major drawback because they need
often to combine query capabilities of many web services at the same time. In
this work, we will present a new approach which allows users to benefit of
query capabilities of many web services while respecting autonomy of each
service. This solution is a new contribution in Information Retrieval research
axe and has proven good performances on two standard datasets.
|
[
{
"version": "v1",
"created": "Fri, 4 May 2012 11:08:31 GMT"
}
] | 2012-05-07T00:00:00 |
[
[
"Hlaoua",
"Radhouane Boughammoura Lobna",
""
],
[
"Omri",
"Mohamed Nazih",
""
]
] |
new_dataset
| 0.998381 |
1009.3819
|
Md. Saiful Islam
|
Md. Saiful Islam, Muhammad Mahbubur Rahman, Zerina Begum, Mohd.
Zulfiquar Hafiz
|
Fault Tolerant Variable Block Carry Skip Logic (VBCSL) using Parity
Preserving Reversible Gates
|
9 pages, 16 figures, 2 tables, Accepted for publication in IJCEE,
IACSIT, Singapore
|
International Journal of Computer and Electrical Engineering vol.
3, no. 1, pp. 1-7, 2011
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reversible logic design has become one of the promising research directions
in low power dissipating circuit design in the past few years and has found its
application in low power CMOS design, digital signal processing and
nanotechnology. This paper presents the efficient design approaches of fault
tolerant carry skip adders (FTCSAs) and compares those designs with the
existing ones. Variable block carry skip logic (VBCSL) using the fault tolerant
full adders (FTFAs) has also been developed. The designs are minimized in terms
of hardware complexity, gate count, constant inputs and garbage outputs.
Besides of it, technology independent evaluation of the proposed designs
clearly demonstrates its superiority with the existing counterparts.
|
[
{
"version": "v1",
"created": "Mon, 20 Sep 2010 13:53:39 GMT"
}
] | 2012-05-04T00:00:00 |
[
[
"Islam",
"Md. Saiful",
""
],
[
"Rahman",
"Muhammad Mahbubur",
""
],
[
"Begum",
"Zerina",
""
],
[
"Hafiz",
"Mohd. Zulfiquar",
""
]
] |
new_dataset
| 0.985176 |
1204.4535
|
Jay Shah
|
Jay Shah and Ayan Mahalanobis
|
A New Guess-and-Determine Attack on the A5/1 Stream Cipher
|
14 pages, 4 figures, 3 tables
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Europe and North America, the most widely used stream cipher to ensure
privacy and confidentiality of conversations in GSM mobile phones is the A5/1.
In this paper, we present a new attack on the A5/1 stream cipher with an
average time complexity of 2^(48.5), which is much less than the brute-force
attack with a complexity of 2^(64). The attack has a 100% success rate and
requires about 5.65GB storage. We provide a detailed description of our new
attack along with its implementation and results.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2012 05:53:40 GMT"
},
{
"version": "v2",
"created": "Thu, 3 May 2012 06:54:15 GMT"
}
] | 2012-05-04T00:00:00 |
[
[
"Shah",
"Jay",
""
],
[
"Mahalanobis",
"Ayan",
""
]
] |
new_dataset
| 0.99899 |
1205.0337
|
Pejman Goudarzi
|
Pejman Goudarzi
|
Stochastic TCO minimization for Video Transmission over IP Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From the viewpoint of service operators the Total Cost of Ownership (TCO) for
developing a communication service comprises from two parts; CAPital
EXpenditure (CAPEX) and OPerational EXpenditure (OPEX). These two types of
costs are interrelated and affect any service provider's deployment strategy.
In many traditional methods, selection of critical elements of a new service is
performed in a heuristic manner aimed at reducing only the OPEX part of the TCO
which is not necessarily optimal. Furthermore, exact cost modeling for such
services is not always possible and contains some uncertainties. In the current
work, after cost modeling of each video streaming element by capturing the
effect of the model uncertainties, the TCO optimization problem for video
streaming over IP networks is formulated as a stochastic optimization problem.
The solution of the proposed optimization problem can cope with the cost
modeling uncertainties and track the dynamism in the TCO and lead to a
time-varying optimal solution. Numerical analysis results verify the developed
method.
|
[
{
"version": "v1",
"created": "Wed, 2 May 2012 06:40:34 GMT"
}
] | 2012-05-03T00:00:00 |
[
[
"Goudarzi",
"Pejman",
""
]
] |
new_dataset
| 0.997364 |
1205.0076
|
Ketan Savla
|
Giacomo Como, Ketan Savla, Daron Acemoglu, Munther A. Dahleh and
Emilio Frazzoli
|
Robust Distributed Routing in Dynamical Networks with Cascading Failures
| null | null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robustness of routing policies for networks is a central problem which is
gaining increased attention with a growing awareness to safeguard critical
infrastructure networks against natural and man-induced disruptions. Routing
under limited information and the possibility of cascades through the network
adds serious challenges to this problem. This abstract considers the framework
of dynamical networks introduced in our earlier work [1,2], where the network
is modeled by a system of ordinary differential equations derived from mass
conservation laws on directed acyclic graphs with a single origin-destination
pair and a constant inflow at the origin. The rate of change of the particle
density on each link of the network equals the difference between the inflow
and the outflow on that link. The latter is modeled to depend on the current
particle density on that link through a flow function. The novel modeling
element in this paper is that every link is assumed to have finite capacity for
particle density and that the flow function is modeled to be strictly
increasing as density increases from zero up to the maximum density capacity,
and is discontinuous at the maximum density capacity, with the flow function
value being zero at that point. This feature, in particular, allows for the
possibility of spill-backs in our model. In this paper, we present our results
on resilience of such networks under distributed routing, towards perturbations
that reduce link-wise flow functions.
|
[
{
"version": "v1",
"created": "Tue, 1 May 2012 02:54:21 GMT"
}
] | 2012-05-02T00:00:00 |
[
[
"Como",
"Giacomo",
""
],
[
"Savla",
"Ketan",
""
],
[
"Acemoglu",
"Daron",
""
],
[
"Dahleh",
"Munther A.",
""
],
[
"Frazzoli",
"Emilio",
""
]
] |
new_dataset
| 0.993541 |
1205.0125
|
Rafayel Kamalian
|
A.M. Khachatryan, R.R. Kamalian
|
On the parameter $\mu_{21}$ of a complete bipartite graph
|
5 pages, no figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with
colors $1,2,...,t$ such that all colors are used, and no two adjacent edges
receive the same color. The set of colors of edges incident with a vertex $x$
is called a spectrum of $x$. An arbitrary nonempty subset of consecutive
integers is called an interval.
Suppose that all edges of a graph $G$ are colored in the game of Alice and
Bob with asymmetric distribution of roles. Alice determines the number $t$ of
colors in the future proper edge coloring of $G$ and aspires to minimize the
number of vertices with an interval spectrum in it. Bob colors edges of $G$
with $t$ colors and aspires to maximize that number. $\mu_{21}(G)$ is equal to
the number of vertices of $G$ with an interval spectrum at the finish of the
game on the supposition that both players choose their best strategies.
In this paper, for arbitrary positive integers $m$ and $n$, the exact value
of the parameter $\mu_{21}(K_{m,n})$ is found.
|
[
{
"version": "v1",
"created": "Tue, 1 May 2012 10:21:51 GMT"
}
] | 2012-05-02T00:00:00 |
[
[
"Khachatryan",
"A. M.",
""
],
[
"Kamalian",
"R. R.",
""
]
] |
new_dataset
| 0.992382 |
1205.0128
|
Rafayel Kamalian
|
R.R. Kamalian
|
It was not known about simple cycles
|
7 pages, no figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A proper edge $t$-coloring of a graph is a coloring of its edges with colors
$1,2,...,t$ such that all colors are used, and no two adjacent edges receive
the same color. For any integer $n\geq 3$, all possible values of $t$ are
found, for which there exists such a proper edge $t$-coloring of the simple
cycle C(n), which uses for each pair of adjacent edges either consecutive
colors or the first and the last ones.
|
[
{
"version": "v1",
"created": "Tue, 1 May 2012 10:38:18 GMT"
}
] | 2012-05-02T00:00:00 |
[
[
"Kamalian",
"R. R.",
""
]
] |
new_dataset
| 0.997035 |
1204.6411
|
Wolfgang Slany
|
Wolfgang Slany
|
Catroid: A Mobile Visual Programming System for Children
|
4 pages. Demo paper at the 11th International Conference on
Interaction Design and Children (IDC 2012)
| null | null | null |
cs.PL cs.CY cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Catroid is a free and open source visual programming language, programming
environment, image manipulation program, and website. Catroid allows casual and
first-time users starting from age eight to develop their own animations and
games solely using their Android phones or tablets. Catroid also allows to
wirelessly control external hardware such as Lego Mindstorms robots via
Bluetooth, Bluetooth Arduino boards, as well as Parrot's popular and
inexpensive AR.Drone quadcopters via WiFi.
|
[
{
"version": "v1",
"created": "Sat, 28 Apr 2012 14:26:56 GMT"
}
] | 2012-05-01T00:00:00 |
[
[
"Slany",
"Wolfgang",
""
]
] |
new_dataset
| 0.999848 |
1204.6459
|
Jean-Pierre Tillich
|
Val\'erie Gauthier and Ayoub Otmani and Jean-Pierre Tillich
|
A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem
Based on Reed-Solomon Codes
|
arXiv admin note: substantial text overlap with arXiv:1203.6686
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main
idea is to replace its permutation matrix by adding to it a rank 1 matrix. The
motivation for this change is twofold: it would allow the use of codes that
were shown to be insecure in the original McEliece's cryptosystem, and it would
reduce the key size while keeping the same security against generic decoding
attacks. The authors suggest to use generalized Reed-Solomon codes instead of
Goppa codes. The public code built with this method is not anymore a
generalized Reed-Solomon code. On the other hand, it contains a very large
secret generalized Reed-Solomon code. In this paper we present an attack that
is built upon a distinguisher which is able to identify elements of this secret
code. The distinguisher is constructed by considering the code generated by
component-wise products of codewords of the public code (the so-called "square
code"). By using square-code dimension considerations, the initial generalized
Reed-Solomon code can be recovered which permits to decode any ciphertext. A
similar technique has already been successful for mounting an attack against a
homomorphic encryption scheme suggested by Bogdanoc et \textit{al.}. This work
can be viewed as another illustration of how a distinguisher of Reed-Solomon
codes can be used to devise an attack on cryptosystems based on them.
|
[
{
"version": "v1",
"created": "Sun, 29 Apr 2012 07:34:55 GMT"
}
] | 2012-05-01T00:00:00 |
[
[
"Gauthier",
"Valérie",
""
],
[
"Otmani",
"Ayoub",
""
],
[
"Tillich",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.987864 |
1204.6492
|
Fernando Brito e Abreu
|
Tiago Pessoa, Fernando Brito e Abreu, Miguel Pessoa Monteiro, Sergio
Bryton
|
An Eclipse Plugin to Support Code Smells Detection
|
12 pages, 7 figures
|
INFORUM'2011 conference proceedings, Luis Caires e Raul Barbosa
(eds.), 8-9 September, Coimbra, Portugal, 2011
| null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Eradication of code smells is often pointed out as a way to improve
readability, extensibility and design in existing software. However, code smell
detection in large systems remains time consuming and error-prone, partly due
to the inherent subjectivity of the detection processes presently available. In
view of mitigating the subjectivity problem, this paper presents a tool that
automates a technique for the detection and assessment of code smells in Java
source code, developed as an Eclipse plug-in. The technique is based upon a
Binary Logistic Regression model and calibrated by expert's knowledge. A short
overview of the technique is provided and the tool is described.
|
[
{
"version": "v1",
"created": "Sun, 29 Apr 2012 16:33:53 GMT"
}
] | 2012-05-01T00:00:00 |
[
[
"Pessoa",
"Tiago",
""
],
[
"Abreu",
"Fernando Brito e",
""
],
[
"Monteiro",
"Miguel Pessoa",
""
],
[
"Bryton",
"Sergio",
""
]
] |
new_dataset
| 0.999218 |
1204.6628
|
Federico Calzolari
|
Daniele Licari, Federico Calzolari
|
The Anatomy of a Grid portal
|
6 pages
|
Journal of Physics: Conference Series 331 (2011) 072043
|
10.1088/1742-6596/331/7/072043
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a new way to deal with Grid portals referring to
our implementation. L-GRID is a light portal to access the EGEE/EGI Grid
infrastructure via Web, allowing users to submit their jobs from a common Web
browser in a few minutes, without any knowledge about the Grid infrastructure.
It provides the control over the complete lifecycle of a Grid Job, from its
submission and status monitoring, to the output retrieval. The system,
implemented as client-server architecture, is based on the Globus Grid
middleware. The client side application is based on a java applet; the server
relies on a Globus User Interface. There is no need of user registration on the
server side, and the user needs only his own X.509 personal certificate. The
system is user-friendly, secure (it uses SSL protocol, mechanism for dynamic
delegation and identity creation in public key infrastructures), highly
customizable, open source, and easy to install. The X.509 personal certificate
does not get out from the local machine. It allows to reduce the time spent for
the job submission, granting at the same time a higher efficiency and a better
security level in proxy delegation and management.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2012 13:32:48 GMT"
}
] | 2012-05-01T00:00:00 |
[
[
"Licari",
"Daniele",
""
],
[
"Calzolari",
"Federico",
""
]
] |
new_dataset
| 0.996379 |
1204.6098
|
Ankit Singh Rawat
|
Ankit Singh Rawat and Sriram Vishwanath
|
On Locality in Distributed Storage Systems
|
Submitted to the IEEE Information Theory Workshop (ITW) 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the design of codes for distributed storage systems (DSS)
that enable local repair in the event of node failure. This paper presents
locally repairable codes based on low degree multivariate polynomials. Its code
construction mechanism extends work on Noisy Interpolating Set by Dvir et al.
\cite{dvir2011}. The paper presents two classes of codes that allow node repair
to be performed by contacting 2 and 3 surviving nodes respectively. It further
shows that both classes are good in terms of their rate and minimum distance,
and allow their rate to be bartered for greater flexibility in the repair
process.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2012 01:39:42 GMT"
}
] | 2012-04-30T00:00:00 |
[
[
"Rawat",
"Ankit Singh",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.997385 |
1204.6106
|
Shengmei Zhao
|
Peng Shi and Shengmei Zhao and Bei Wang
|
Performance of Polar Codes on wireless communications Channel
|
5 pages, to be submitted to GlobeCom 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the performance of polar codes, the capacity-achieving channel
codes, on wireless communication channel in this paper. By generalizing the
definition of Bhattacharyya Parameter in discrete memoryless channel, we
present the special expression of the parameter for Gaussian and Rayleigh
fading the two continuous channels, including the recursive formulas and the
initial values. We analyze the applications of polar codes with the defined
parameter over Rayleigh fading channel by transmitting image and speech. By
comparing with low density parity-check codes(LDPC) at the same cases, our
simulation results show that polar codes have better performance than that of
LDPC codes. Polar codes will be good candidate for wireless communication
channel.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2012 03:42:09 GMT"
}
] | 2012-04-30T00:00:00 |
[
[
"Shi",
"Peng",
""
],
[
"Zhao",
"Shengmei",
""
],
[
"Wang",
"Bei",
""
]
] |
new_dataset
| 0.999475 |
1204.6284
|
Romain Boulet
|
Pierre Mazzega (LMTG), Dani\`ele Bourcier (CERSA), Romain Boulet
(LMTG)
|
The Network of French Legal Codes
| null |
12th International Conference on Artificial Intelligence and Law
(ICAIL 2009), Barcelona : Espagne (2009)
|
10.1145/1568234.1568271
| null |
cs.AI cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an analysis of the codified Law of France as a structured system.
Fifty two legal codes are selected on the basis of explicit legal criteria and
considered as vertices with their mutual quotations forming the edges in a
network which properties are analyzed relying on graph theory. We find that a
group of 10 codes are simultaneously the most citing and the most cited by
other codes, and are also strongly connected together so forming a "rich club"
sub-graph. Three other code communities are also found that somewhat partition
the legal field is distinct thematic sub-domains. The legal interpretation of
this partition is opening new untraditional lines of research. We also
conjecture that many legal systems are forming such new kind of networks that
share some properties in common with small worlds but are far denser. We
propose to call "concentrated world".
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2011 07:56:00 GMT"
}
] | 2012-04-30T00:00:00 |
[
[
"Mazzega",
"Pierre",
"",
"LMTG"
],
[
"Bourcier",
"Danièle",
"",
"CERSA"
],
[
"Boulet",
"Romain",
"",
"LMTG"
]
] |
new_dataset
| 0.999073 |
1111.7299
|
Pierre Lescanne
|
Pierre Lescanne (LIP)
|
Les crashs sont rationnels
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As we show by using notions of equilibrium in infinite sequential games,
crashes or financial escalations are rational for economic or environmental
agents, who have a vision of an infinite world. This contradicts a picture of a
self-regulating, wise and pacific economic world. In other words, in this
context, equilibrium is not synonymous of stability. We try to draw, from this
statement, methodological consequences and new ways of thinking, especially in
economic game theory. Among those new paths, coinduction is the basis of our
reasoning in infinite games.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2011 20:27:28 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Dec 2011 15:14:21 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Dec 2011 15:39:40 GMT"
},
{
"version": "v4",
"created": "Sun, 8 Jan 2012 07:03:24 GMT"
},
{
"version": "v5",
"created": "Thu, 26 Apr 2012 12:01:55 GMT"
}
] | 2012-04-27T00:00:00 |
[
[
"Lescanne",
"Pierre",
"",
"LIP"
]
] |
new_dataset
| 0.997013 |
1204.5828
|
Adrian Dumitrescu
|
Adrian Dumitrescu
|
The traveling salesman problem for lines and rays in the plane
|
10 pages, 5 figures
| null | null | null |
cs.CG math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of
$n$ regions (neighborhoods) and we seek a shortest tour that visits each
region. In the path variant, we seek a shortest path that visits each region.
We present several linear-time approximation algorithms with improved ratios
for these problems for two cases of neighborhoods that are (infinite) lines,
and respectively, (half-infinite) rays. Along the way we derive a tight bound
on the minimum perimeter of a rectangle enclosing an open curve of length $L$.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2012 04:56:56 GMT"
}
] | 2012-04-27T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
]
] |
new_dataset
| 0.972318 |
1204.5852
|
Youssef Bassil
|
Youssef Bassil, Mohammad Alwani
|
Context-sensitive Spelling Correction Using Google Web 1T 5-Gram
Information
|
LACSC - Lebanese Association for Computational Sciences -
http://www.lacsc.org
|
Computer and Information Science, Vol. 5, No. 3, May 2012
|
10.5539/cis.v5n3p37
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In computing, spell checking is the process of detecting and sometimes
providing spelling suggestions for incorrectly spelled words in a text.
Basically, a spell checker is a computer program that uses a dictionary of
words to perform spell checking. The bigger the dictionary is, the higher is
the error detection rate. The fact that spell checkers are based on regular
dictionaries, they suffer from data sparseness problem as they cannot capture
large vocabulary of words including proper names, domain-specific terms,
technical jargons, special acronyms, and terminologies. As a result, they
exhibit low error detection rate and often fail to catch major errors in the
text. This paper proposes a new context-sensitive spelling correction method
for detecting and correcting non-word and real-word errors in digital text
documents. The approach hinges around data statistics from Google Web 1T 5-gram
data set which consists of a big volume of n-gram word sequences, extracted
from the World Wide Web. Fundamentally, the proposed method comprises an error
detector that detects misspellings, a candidate spellings generator based on a
character 2-gram model that generates correction suggestions, and an error
corrector that performs contextual error correction. Experiments conducted on a
set of text documents from different domains and containing misspellings,
showed an outstanding spelling error correction rate and a drastic reduction of
both non-word and real-word errors. In a further study, the proposed algorithm
is to be parallelized so as to lower the computational cost of the error
detection and correction processes.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2012 07:44:18 GMT"
}
] | 2012-04-27T00:00:00 |
[
[
"Bassil",
"Youssef",
""
],
[
"Alwani",
"Mohammad",
""
]
] |
new_dataset
| 0.998435 |
1204.5887
|
Rigo Michel
|
Michel Rigo
|
Numeration Systems: a Link between Number Theory and Formal Language
Theory
|
21 pages, 3 figures, invited talk DLT'2010
|
Proceedings of Developments in Language Theory, London, Ontario,
Canada (2010), Lect. Notes in Comput. Sci. 6224, 33-53 Springer-Verlag (2010)
| null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We survey facts mostly emerging from the seminal results of Alan Cobham
obtained in the late sixties and early seventies. We do not attempt to be
exhaustive but try instead to give some personal interpretations and some
research directions. We discuss the notion of numeration systems, recognizable
sets of integers and automatic sequences. We briefly sketch some results about
transcendence related to the representation of real numbers. We conclude with
some applications to combinatorial game theory and verification of
infinite-state systems and present a list of open problems.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2012 11:26:44 GMT"
}
] | 2012-04-27T00:00:00 |
[
[
"Rigo",
"Michel",
""
]
] |
new_dataset
| 0.992272 |
1204.5929
|
Fabrizio Luccio
|
Fabrizio Luccio and Linda Pagli
|
Chain Rotations: a New Look at Tree Distance
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As well known the rotation distance D(S,T) between two binary trees S, T of n
vertices is the minimum number of rotations of pairs of vertices to transform S
into T. We introduce the new operation of chain rotation on a tree, involving
two chains of vertices, that requires changing exactly three pointers in the
data structure as for a standard rotation, and define the corresponding chain
distance C(S,T). As for D(S,T), no polynomial time algorithm to compute C(S,T)
is known. We prove a constructive upper bound and an analytical lower bound on
C(S,T) based on the number of maximal chains in the two trees. In terms of n we
prove the general upper bound C(S,T)<= n-1 and we show that there are pairs of
trees for which this bound is tight. No similar result is known for D(S,T)
where the best upper and lower bounds are 2n-6 and 5n/3-4 respectively.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2012 14:05:22 GMT"
}
] | 2012-04-27T00:00:00 |
[
[
"Luccio",
"Fabrizio",
""
],
[
"Pagli",
"Linda",
""
]
] |
new_dataset
| 0.984305 |
1108.3033
|
Karl Schlechta
|
Dov Gabbay, Karl Schlechta
|
Equilibria und weiteres Heiteres II
|
arXiv admin note: incorporates entirety of text from arXiv:0907.4017
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate several technical and conceptual questions.
Our main subject is the investigation of independence as a ternary relation
in the context of non-monotonic logic. In the context of probability, this
investigation was started by W.Spohn et al., and then followed by J.Pearl. We
look at products of function sets, and thus continue our own investigation of
independence in non-monotonic logic. We show that a finite characterization of
this relation in our context is impossible, and indicate how to construct all
valid rules.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2011 16:59:07 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Sep 2011 11:56:02 GMT"
},
{
"version": "v3",
"created": "Sat, 17 Sep 2011 19:36:06 GMT"
},
{
"version": "v4",
"created": "Sun, 16 Oct 2011 05:37:12 GMT"
},
{
"version": "v5",
"created": "Tue, 31 Jan 2012 09:18:23 GMT"
},
{
"version": "v6",
"created": "Wed, 25 Apr 2012 06:28:15 GMT"
}
] | 2012-04-26T00:00:00 |
[
[
"Gabbay",
"Dov",
""
],
[
"Schlechta",
"Karl",
""
]
] |
new_dataset
| 0.998628 |
1204.5580
|
Damien Chablat
|
Montserrat Manubens, Guillaume Moroz (INRIA Lorraine - LORIA), Damien
Chablat (IRCCyN), Philippe Wenger (IRCCyN), Fabrice Rouillier (INRIA
Rocquencourt)
|
Cusp Points in the Parameter Space of Degenerate 3-RPR Planar Parallel
Manipulators
|
ASME Journal of Mechanisms and Robotics (2012) 1-10
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the conditions in the design parameter space for the
existence and distribution of the cusp locus for planar parallel manipulators.
Cusp points make possible non-singular assembly-mode changing motion, which
increases the maximum singularity-free workspace. An accurate algorithm for the
determination is proposed amending some imprecisions done by previous existing
algorithms. This is combined with methods of Cylindric Algebraic Decomposition,
Gr\"obner bases and Discriminant Varieties in order to partition the parameter
space into cells with constant number of cusp points. These algorithms will
allow us to classify a family of degenerate 3-RPR manipulators.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2012 08:03:31 GMT"
}
] | 2012-04-26T00:00:00 |
[
[
"Manubens",
"Montserrat",
"",
"INRIA Lorraine - LORIA"
],
[
"Moroz",
"Guillaume",
"",
"INRIA Lorraine - LORIA"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Wenger",
"Philippe",
"",
"IRCCyN"
],
[
"Rouillier",
"Fabrice",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.97914 |
1204.5267
|
K.S.Kuppusamy
|
K.S. Kuppusamy, Leena Mary Francis, G. Aghila
|
WILI - Web Interface for people with Lowvision Issues
|
8 Pages; 6 Figures, International Journal on Computational Sciences &
Applications (IJCSA) Vo2, No.2, April 2012, ISSN: 2200-0011
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Though World Wide Web is the single largest source of information, it is
ill-equipped to serve the people with vision related problems. With the
prolific increase in the interest to make the web accessible to all sections of
the society, solving this accessibility problem becomes mandatory. This paper
presents a technique for making web pages accessible for people with low vision
issues. A model for making web pages accessible, WILI (Web Interface for people
with Low-vision Issues) has been proposed. The approach followed in this work
is to automatically replace the existing display style of a web page with a new
skin following the guidelines given by Clear Print Booklet provided by Royal
National Institute of Blind. "Single Click Solution" is one of the primary
advantages provided by WILI. A prototype using the WILI model is implemented
and various experiments are conducted. The results of experiments conducted on
WILI indicate 82% effective conversion rate.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2012 04:11:26 GMT"
}
] | 2012-04-25T00:00:00 |
[
[
"Kuppusamy",
"K. S.",
""
],
[
"Francis",
"Leena Mary",
""
],
[
"Aghila",
"G.",
""
]
] |
new_dataset
| 0.963165 |
1204.5284
|
Heping Jiang
|
Heping Jiang
|
Non-Hamiltonian Holes in Grid Graphs
|
10 pages, 8 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we extend general grid graphs to the grid graphs consist of
polygons tiling on a plane, named polygonal grid graphs. With a cycle basis
satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A
Hamilton cycle can be expressed as a symmetric difference of a subset of cycles
in the basis. From the combinatorial relations of vertices in the subset of
cycles in the basis, we deduce the formula of inside faces in Grinberg theorem,
called Grinberg equation, and derive a kind of cycles whose existence make a
polygonal grid graph non-Hamiltonian, called non-Hamiltonian holes, and then we
characterize the existence condition of non-Hamiltonian holes and obtain the
necessary and sufficient condition of a polygonal grid graph to be Hamiltonian.
The result in this paper provides a new starting point for developing a
polynomial-time algorithm for Hamilton problem in general grid graphs.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2012 07:10:26 GMT"
}
] | 2012-04-25T00:00:00 |
[
[
"Jiang",
"Heping",
""
]
] |
new_dataset
| 0.97601 |
1204.5306
|
Anna Bernasconi
|
Anna Bernasconi and Valentina Ciriani and Fabrizio Luccio and Linda
Pagli
|
Compact DSOP and partial DSOP Forms
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a Boolean function f on n variables, a Disjoint Sum-of-Products (DSOP)
of f is a set of products (ANDs) of subsets of literals whose sum (OR) equals
f, such that no two products cover the same minterm of f. DSOP forms are a
special instance of partial DSOPs, i.e. the general case where a subset of
minterms must be covered exactly once and the other minterms (typically
corresponding to don't care conditions of $f$) can be covered any number of
times. We discuss finding DSOPs and partial DSOP with a minimal number of
products, a problem theoretically connected with various properties of Boolean
functions and practically relevant in the synthesis of digital circuits.
Finding an absolute minimum is hard, in fact we prove that the problem of
absolute minimization of partial DSOPs is NP-hard. Therefore it is crucial to
devise a polynomial time heuristic that compares favorably with the known
minimization tools. To this end we develop a further piece of theory starting
from the definition of the weight of a product p as a functions of the number
of fragments induced on other cubes by the selection of p, and show how product
weights can be exploited for building a class of minimization heuristics for
DSOP and partial DSOP synthesis. A set of experiments conducted on major
benchmark functions show that our method, with a family of variants, always
generates better results than the ones of previous heuristics, including the
method based on a BDD representation of f.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2012 08:48:34 GMT"
}
] | 2012-04-25T00:00:00 |
[
[
"Bernasconi",
"Anna",
""
],
[
"Ciriani",
"Valentina",
""
],
[
"Luccio",
"Fabrizio",
""
],
[
"Pagli",
"Linda",
""
]
] |
new_dataset
| 0.991125 |
1204.5407
|
Pradeep Singla
|
Pradeep Singla, Naveen Kr. Malik
|
Reversible Programmable Logic Array (RPLA) using Feynman & MUX Gates for
Low Power Industrial Applications
|
9 Pages, 9 Figures
|
Pradeep Singla and Naveen Kr. Malik. Article: Reversible
Programmable Logic Array (RPLA) using Feynman & MUX Gates for Low Power
Industrial Applications. Proceedinggs of ICIAICT-2012,pp 411-419, March 2012
| null | null |
cs.AR
|
http://creativecommons.org/licenses/by/3.0/
|
This paper present the research work directed towards the design of
reversible programmable logic array using very high speed integrated circuit
hardware description language (VHDL). Reversible logic circuits have
significant importance in bioinformatics, optical information processing, CMOS
design etc. In this paper the authors propose the design of new RPLA using
Feynman & MUX gate.VHDL based codes of reversible gates with simulating results
are shown .This proposed RPLA may be further used to design any reversible
logic function or Boolean function (Adder, subtractor etc.) which dissipate
very low or ideally no heat.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2012 15:28:25 GMT"
}
] | 2012-04-25T00:00:00 |
[
[
"Singla",
"Pradeep",
""
],
[
"Malik",
"Naveen Kr.",
""
]
] |
new_dataset
| 0.988239 |
1106.1933
|
Puduru Reddy V
|
Dario Bauso, Puduru Viswanadha Reddy and Tamer Basar
|
Lyapunov stochastic stability and control of robust dynamic coalitional
games with transferable utilities
| null | null | null | null |
cs.GT cs.LG cs.SY math.OC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper considers a dynamic game with transferable utilities (TU), where
the characteristic function is a continuous-time bounded mean ergodic process.
A central planner interacts continuously over time with the players by choosing
the instantaneous allocations subject to budget constraints. Before the game
starts, the central planner knows the nature of the process (bounded mean
ergodic), the bounded set from which the coalitions' values are sampled, and
the long run average coalitions' values. On the other hand, he has no knowledge
of the underlying probability function generating the coalitions' values. Our
goal is to find allocation rules that use a measure of the extra reward that a
coalition has received up to the current time by re-distributing the budget
among the players. The objective is two-fold: i) guaranteeing convergence of
the average allocations to the core (or a specific point in the core) of the
average game, ii) driving the coalitions' excesses to an a priori given cone.
The resulting allocation rules are robust as they guarantee the aforementioned
convergence properties despite the uncertain and time-varying nature of the
coaltions' values. We highlight three main contributions. First, we design an
allocation rule based on full observation of the extra reward so that the
average allocation approaches a specific point in the core of the average game,
while the coalitions' excesses converge to an a priori given direction. Second,
we design a new allocation rule based on partial observation on the extra
reward so that the average allocation converges to the core of the average
game, while the coalitions' excesses converge to an a priori given cone. And
third, we establish connections to approachability theory and attainability
theory.
|
[
{
"version": "v1",
"created": "Thu, 9 Jun 2011 23:55:58 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Apr 2012 18:19:52 GMT"
}
] | 2012-04-24T00:00:00 |
[
[
"Bauso",
"Dario",
""
],
[
"Reddy",
"Puduru Viswanadha",
""
],
[
"Basar",
"Tamer",
""
]
] |
new_dataset
| 0.991108 |
1110.1687
|
Chi-Yao Hong
|
Ankit Singla, Chi-Yao Hong, Lucian Popa, P. Brighten Godfrey
|
Jellyfish: Networking Data Centers Randomly
|
14 pages, 12 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Industry experience indicates that the ability to incrementally expand data
centers is essential. However, existing high-bandwidth network designs have
rigid structure that interferes with incremental expansion. We present
Jellyfish, a high-capacity network interconnect, which, by adopting a random
graph topology, yields itself naturally to incremental expansion. Somewhat
surprisingly, Jellyfish is more cost-efficient than a fat-tree: A Jellyfish
interconnect built using the same equipment as a fat-tree, supports as many as
25% more servers at full capacity at the scale of a few thousand nodes, and
this advantage improves with scale. Jellyfish also allows great flexibility in
building networks with different degrees of oversubscription. However,
Jellyfish's unstructured design brings new challenges in routing, physical
layout, and wiring. We describe and evaluate approaches that resolve these
challenges effectively, indicating that Jellyfish could be deployed in today's
data centers.
|
[
{
"version": "v1",
"created": "Sat, 8 Oct 2011 01:24:57 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Oct 2011 15:05:52 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Apr 2012 20:38:43 GMT"
}
] | 2012-04-24T00:00:00 |
[
[
"Singla",
"Ankit",
""
],
[
"Hong",
"Chi-Yao",
""
],
[
"Popa",
"Lucian",
""
],
[
"Godfrey",
"P. Brighten",
""
]
] |
new_dataset
| 0.995363 |
1204.4951
|
Chathuranga Widanapathirana
|
C.H. Widanapathirana, Bok-Min Goi, Sim Moh Lim
|
MPIFA: A Modified Protocol Independent Fairness Algorithm for Community
Wireless Mesh Networks
|
Innovative Technologies in Intelligent Systems and Industrial
Applications(CITISIA) 2009
| null |
10.1109/CITISIA.2009.5224195
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Community Wireless Mesh Networks (WMN) is a paradigm in wireless
communication of 21st centuary as means of providing high speed braodband
access. Un-cooperative nodes, both selfish and malicious proves to be a
significant threat in Community WMN that require a solution independent of
routing protocols being used. We propose to implement Modified PIFA (MPIFA), an
Improved version of Protocol Independent Fairness Algorithm (PIFA) proposed by
Younghwan Yoo, Sanghyun and P. Agrawal [6] with ability to cater specific
requirements in Community WMN. MPIFA has malicious nodes detection rate
improvement of 50% when nodes demonstrate low probabilistic malicious behavior
of 10% to circumvent the security measures in place. Improvements were also
made to reduce false malicious node detections to 4% when node-to-node link
failures occur in Community WMN.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2012 00:02:11 GMT"
}
] | 2012-04-24T00:00:00 |
[
[
"Widanapathirana",
"C. H.",
""
],
[
"Goi",
"Bok-Min",
""
],
[
"Lim",
"Sim Moh",
""
]
] |
new_dataset
| 0.99181 |
1105.3671
|
Michal Kryczka
|
Michal Kryczka, Ruben Cuevas, Roberto Gonzalez, Angel Cuevas, Arturo
Azcorra
|
TorrentGuard: stopping scam and malware distribution in the BitTorrent
ecosystem
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we conduct a large scale measurement study in order to analyse
the fake content publishing phenomenon in the BitTorrent Ecosystem. Our results
reveal that fake content represents an important portion (35%) of those files
shared in BitTorrent and just a few tens of users are responsible for 90% of
this content. Furthermore, more than 99% of the analysed fake files are linked
to either malware or scam websites. This creates a serious threat for the
BitTorrent ecosystem. To address this issue, we present a new detection tool
named TorrentGuard for the early detection of fake content. Based on our
evaluation this tool may prevent the download of more than 35 millions of fake
files per year. This could help to reduce the number of computer infections and
scams suffered by BitTorrent users. TorrentGuard is already available and it
can be accessed through both a webpage or a Vuze plugin.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2011 15:56:24 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Sep 2011 11:18:11 GMT"
},
{
"version": "v3",
"created": "Thu, 19 Apr 2012 21:28:21 GMT"
}
] | 2012-04-23T00:00:00 |
[
[
"Kryczka",
"Michal",
""
],
[
"Cuevas",
"Ruben",
""
],
[
"Gonzalez",
"Roberto",
""
],
[
"Cuevas",
"Angel",
""
],
[
"Azcorra",
"Arturo",
""
]
] |
new_dataset
| 0.997886 |
1204.4476
|
Rizwan Chaudhry
|
Rizwan Chaudhry and Gregory Hager and Rene Vidal
|
Dynamic Template Tracking and Recognition
| null | null | null | null |
cs.CV cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we address the problem of tracking non-rigid objects whose
local appearance and motion changes as a function of time. This class of
objects includes dynamic textures such as steam, fire, smoke, water, etc., as
well as articulated objects such as humans performing various actions. We model
the temporal evolution of the object's appearance/motion using a Linear
Dynamical System (LDS). We learn such models from sample videos and use them as
dynamic templates for tracking objects in novel videos. We pose the problem of
tracking a dynamic non-rigid object in the current frame as a maximum
a-posteriori estimate of the location of the object and the latent state of the
dynamical system, given the current image features and the best estimate of the
state in the previous frame. The advantage of our approach is that we can
specify a-priori the type of texture to be tracked in the scene by using
previously trained models for the dynamics of these textures. Our framework
naturally generalizes common tracking methods such as SSD and kernel-based
tracking from static templates to dynamic templates. We test our algorithm on
synthetic as well as real examples of dynamic textures and show that our simple
dynamics-based trackers perform at par if not better than the state-of-the-art.
Since our approach is general and applicable to any image feature, we also
apply it to the problem of human action tracking and build action-specific
optical flow trackers that perform better than the state-of-the-art when
tracking a human performing a particular action. Finally, since our approach is
generative, we can use a-priori trained trackers for different texture or
action classes to simultaneously track and recognize the texture or action in
the video.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 21:17:08 GMT"
}
] | 2012-04-23T00:00:00 |
[
[
"Chaudhry",
"Rizwan",
""
],
[
"Hager",
"Gregory",
""
],
[
"Vidal",
"Rene",
""
]
] |
new_dataset
| 0.96095 |
1204.4301
|
Maulahikmah Galinium
|
Bunga Sugiarto, Danny Laidi, Arra'di Nur Rizal, Maulahikmah Galinium,
Pradana Atmadiputra, Melvin Rubianto, Husni Fahmi, Tri Sampurno, Marsudi
Kisworo
|
Design and Implementation of the Connectionless Network Protocol (CLNP)
as Loadable Kernel Modules in Linux Kernel 2.6
|
7 pages conference paper. Published in Proceedings of MoMM2007 &
iiWAS2007 Workshops
|
2007, Frontiers in Mobile and Web Computing: Proceedings of
MoMM2007 & iiWAS2007 Workshops, pp. 239-245, published by \"Osterreichische
Computer Gesellschaft Komitee f\"ur \"Offentlichkeitsarbeit
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present an implementation of CLNP ground-to-ground packet
processing for ATN in Linux kernel version 2.6. We present the big picture of
CLNP packet processing, the details of input, routing, and output processing
functions, and the implementation of each function based on ISO 8473-1. The
functions implemented in this work are PDU header decomposition, header format
analysis, header error detection, error reporting, reassembly, source routing,
congestion notification, forwarding, composition, segmentation, and transmit to
device functions. Each function is initially implemented and tested as a
separated loadable kernel module. These modules are successfully loaded into
Linux kernel 2.6.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 10:05:17 GMT"
}
] | 2012-04-20T00:00:00 |
[
[
"Sugiarto",
"Bunga",
""
],
[
"Laidi",
"Danny",
""
],
[
"Rizal",
"Arra'di Nur",
""
],
[
"Galinium",
"Maulahikmah",
""
],
[
"Atmadiputra",
"Pradana",
""
],
[
"Rubianto",
"Melvin",
""
],
[
"Fahmi",
"Husni",
""
],
[
"Sampurno",
"Tri",
""
],
[
"Kisworo",
"Marsudi",
""
]
] |
new_dataset
| 0.991308 |
1204.4307
|
Andino Maseleno
|
Andino Maseleno, Md. Mahmud Hasan
|
Avian Influenza (H5N1) Warning System using Dempster-Shafer Theory and
Web Mapping
|
International Seminar Indonesian Students in ASEAN "Green Technology,
Social Work and Public Health for the Development of Indonesia", 28 - 29
October 2011, Bangkok, Thailand
| null | null | null |
cs.AI math.PR
|
http://creativecommons.org/licenses/by/3.0/
|
Based on Cumulative Number of Confirmed Human Cases of Avian Influenza (H5N1)
Reported to World Health Organization (WHO) in the 2011 from 15 countries,
Indonesia has the largest number death because Avian Influenza which 146
deaths. In this research, the researcher built a Web Mapping and
Dempster-Shafer theory as early warning system of avian influenza. Early
warning is the provision of timely and effective information, through
identified institutions, that allows individuals exposed to a hazard to take
action to avoid or reduce their risk and prepare for effective response. In
this paper as example we use five symptoms as major symptoms which include
depression, combs, wattle, bluish face region, swollen face region, narrowness
of eyes, and balance disorders. Research location is in the Lampung Province,
South Sumatera. The researcher reason to choose Lampung Province in South
Sumatera on the basis that has a high poultry population. Geographically,
Lampung province is located at 103040' to 105050' East Longitude and 6045' -
3045' South latitude, confined with: South Sumatera and Bengkulu on North Side,
Sunda Strait on the Side, Java Sea on the East Side, Indonesia Ocean on the
West Side. Our approach uses Dempster Shafer theory to combine beliefs in
certain hypotheses under conditions of uncertainty and ignorance, and allows
quantitative measurement of the belief and plausibility in our identification
result. Web Mapping is also used for displaying maps on a screen to visualize
the result of the identification process. The result reveal that avian
influenza warning system has successfully identified the existence of avian
influenza and the maps can be displayed as the visualization.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 10:55:14 GMT"
}
] | 2012-04-20T00:00:00 |
[
[
"Maseleno",
"Andino",
""
],
[
"Hasan",
"Md. Mahmud",
""
]
] |
new_dataset
| 0.996925 |
1204.4311
|
Andino Maseleno
|
Andino Maseleno, Md. Mahmud Hasan
|
Avian Influenza (H5N1) Expert System using Dempster-Shafer Theory
|
International Conference on Informatics for Development 2011, 26
November 2011, Yogyakarta, Indonesia
| null | null | null |
cs.AI math.PR
|
http://creativecommons.org/licenses/by/3.0/
|
Based on Cumulative Number of Confirmed Human Cases of Avian Influenza (H5N1)
Reported to World Health Organization (WHO) in the 2011 from 15 countries,
Indonesia has the largest number death because Avian Influenza which 146
deaths. In this research, the researcher built an Avian Influenza (H5N1) Expert
System for identifying avian influenza disease and displaying the result of
identification process. In this paper, we describe five symptoms as major
symptoms which include depression, combs, wattle, bluish face region, swollen
face region, narrowness of eyes, and balance disorders. We use chicken as
research object. Research location is in the Lampung Province, South Sumatera.
The researcher reason to choose Lampung Province in South Sumatera on the basis
that has a high poultry population. Dempster-Shafer theory to quantify the
degree of belief as inference engine in expert system, our approach uses
Dempster-Shafer theory to combine beliefs under conditions of uncertainty and
ignorance, and allows quantitative measurement of the belief and plausibility
in our identification result. The result reveal that Avian Influenza (H5N1)
Expert System has successfully identified the existence of avian influenza and
displaying the result of identification process.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 11:12:43 GMT"
}
] | 2012-04-20T00:00:00 |
[
[
"Maseleno",
"Andino",
""
],
[
"Hasan",
"Md. Mahmud",
""
]
] |
new_dataset
| 0.985821 |
1204.4366
|
Michael Robinson
|
Michael Robinson
|
Multipath-dominant, pulsed doppler analysis of rotating blades
|
9 pages, 16 figures
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel angular fingerprinting algorithm for detecting changes in
the direction of rotation of a target with a monostatic, stationary sonar
platform. Unlike other approaches, we assume that the target's centroid is
stationary, and exploit doppler multipath signals to resolve the otherwise
unavoidable ambiguities that arise. Since the algorithm is based on an
underlying differential topological theory, it is highly robust to distortions
in the collected data. We demonstrate performance of this algorithm
experimentally, by exhibiting a pulsed doppler sonar collection system that
runs on a smartphone. The performance of this system is sufficiently good to
both detect changes in target rotation direction using angular fingerprints,
and also to form high-resolution inverse synthetic aperature images of the
target.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 15:02:30 GMT"
}
] | 2012-04-20T00:00:00 |
[
[
"Robinson",
"Michael",
""
]
] |
new_dataset
| 0.957596 |
1204.4428
|
Marco Vieira
|
Marco Vieira and Ilir Gashi
|
EDCC 2012 - Fast Abstracts & Student Forum Proceedings
|
Ninth European Dependable Computing Conference - EDCC 2012, Sibiu,
Romania, May 8-11, 2012
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fast Abstracts at EDCC 2012 are short presentations, aiming to serve as a
rapid and flexible mechanism to report on current work that may or may not be
complete, introduce new ideas to the community, and state positions on
controversial issues or open problems. This way, fast abstracts provide an
opportunity to introduce new work, or present radical opinions, and receive
early feedback from the community. Contributions are welcome from both academia
and industry.
The goal of the Student Forum is to encourage students to attend EDCC 2012
and present their work, exchange ideas with researchers and practitioners, and
get early feedback on their research efforts. All papers were peer-reviewed by
at least three program committee members, and the authors were provided with
detailed comments on their work. In the end we had one accepted paper for the
Student forum.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2012 18:27:58 GMT"
}
] | 2012-04-20T00:00:00 |
[
[
"Vieira",
"Marco",
""
],
[
"Gashi",
"Ilir",
""
]
] |
new_dataset
| 0.999504 |
1202.3549
|
Pierre Aboulker
|
Pierre Aboulker
|
Excluding 4-wheels
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A 4-wheel is a graph formed by a cycle C and a vertex not in C that has at
least four neighbors in C. We prove that a graph G that does not contain a
4-wheel as a subgraph is 4-colorable and we describe some structural properties
of such a graph.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2012 09:58:29 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2012 09:14:52 GMT"
}
] | 2012-04-19T00:00:00 |
[
[
"Aboulker",
"Pierre",
""
]
] |
new_dataset
| 0.991889 |
1204.4054
|
Christoforos Raptopoulos Christoforos Raptopoulos
|
S. Nikoletseas, C. Raptopoulos, P. G. Spirakis
|
Maximum Cliques in Graphs with Small Intersection Number and Random
Intersection Graphs
| null | null | null | null |
cs.DM math.CO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we relate the problem of finding a maximum clique to the
intersection number of the input graph (i.e. the minimum number of cliques
needed to edge cover the graph). In particular, we consider the maximum clique
problem for graphs with small intersection number and random intersection
graphs (a model in which each one of $m$ labels is chosen independently with
probability $p$ by each one of $n$ vertices, and there are edges between any
vertices with overlaps in the labels chosen).
We first present a simple algorithm which, on input $G$ finds a maximum
clique in $O(2^{2^m + O(m)} + n^2 \min\{2^m, n\})$ time steps, where $m$ is an
upper bound on the intersection number and $n$ is the number of vertices.
Consequently, when $m \leq \ln{\ln{n}}$ the running time of this algorithm is
polynomial.
We then consider random instances of the random intersection graphs model as
input graphs. As our main contribution, we prove that, when the number of
labels is not too large ($m=n^{\alpha}, 0< \alpha <1$), we can use the label
choices of the vertices to find a maximum clique in polynomial time whp. The
proof of correctness for this algorithm relies on our Single Label Clique
Theorem, which roughly states that whp a "large enough" clique cannot be formed
by more than one label. This theorem generalizes and strengthens other related
results in the state of the art, but also broadens the range of values
considered.
As an important consequence of our Single Label Clique Theorem, we prove that
the problem of inferring the complete information of label choices for each
vertex from the resulting random intersection graph (i.e. the \emph{label
representation of the graph}) is \emph{solvable} whp. Finding efficient
algorithms for constructing such a label representation is left as an
interesting open problem for future research.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 11:45:17 GMT"
}
] | 2012-04-19T00:00:00 |
[
[
"Nikoletseas",
"S.",
""
],
[
"Raptopoulos",
"C.",
""
],
[
"Spirakis",
"P. G.",
""
]
] |
new_dataset
| 0.992847 |
0903.1147
|
Toby Walsh
|
Yasuhiko Takenaga and Toby Walsh
|
Tetravex is NP-complete
| null |
Inf. Process. Lett. 99(5): 171-174 (2006)
| null | null |
cs.CC cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tetravex is a widely played one person computer game in which you are given
$n^2$ unit tiles, each edge of which is labelled with a number. The objective
is to place each tile within a $n$ by $n$ square such that all neighbouring
edges are labelled with an identical number. Unfortunately, playing Tetravex is
computationally hard. More precisely, we prove that deciding if there is a
tiling of the Tetravex board is NP-complete. Deciding where to place the tiles
is therefore NP-hard. This may help to explain why Tetravex is a good puzzle.
This result compliments a number of similar results for one person games
involving tiling. For example, NP-completeness results have been shown for: the
offline version of Tetris, KPlumber (which involves rotating tiles containing
drawings of pipes to make a connected network), and shortest sliding puzzle
problems. It raises a number of open questions. For example, is the infinite
version Turing-complete? How do we generate Tetravex problems which are truly
puzzling as random NP-complete problems are often surprising easy to solve? Can
we observe phase transition behaviour? What about the complexity of the problem
when it is guaranteed to have an unique solution? How do we generate puzzles
with unique solutions?
|
[
{
"version": "v1",
"created": "Fri, 6 Mar 2009 04:00:47 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Takenaga",
"Yasuhiko",
""
],
[
"Walsh",
"Toby",
""
]
] |
new_dataset
| 0.998792 |
1111.3879
|
Siham Bekkai
|
Siham Bekkai
|
Minimum degree, independence number and pseudo [2,b]-factors in graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each
component C on at least three vertices is a [2,b]-graph. The main contibution
of this paper, is to give an upper bound to the number of components that are
edges or vertices in a pseudo [2,b]-factor of a graph G. This bound is sharp.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2011 17:29:01 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2011 15:56:23 GMT"
},
{
"version": "v3",
"created": "Tue, 17 Apr 2012 12:53:48 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Bekkai",
"Siham",
""
]
] |
new_dataset
| 0.999083 |
1204.3685
|
Muhammad Anshari Mr
|
Mohammad Nabil Almunawar and Muhammad Anshari
|
Improving Customer Service in Healthcare with CRM 2.0
|
Global Science And Technology Forum (GSTF) Business Review, Volume 1
No. 2, October 2011
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Healthcare industry is undergoing a paradigm shift from healthcare
institution-centred care to a citizen-centred care that emphasises on
continuity of care from prevention to rehabilitation. The recent development of
Information and Communication Technology (ICT), especially the Internet and its
related technologies has become the main driver of the paradigm shift. Managing
relationship with customers (patients) is becoming more important in the new
paradigm. The paper discusses Customer Relationship Management (CRM) in
healthcare and proposes a Social CRM or CRM 2.0 model to take advantage of the
multi-way relationships created by Web 2.0 and its widespread use in improving
customer services for mutual benefits between healthcare providers and their
customers.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2012 01:58:27 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Almunawar",
"Mohammad Nabil",
""
],
[
"Anshari",
"Muhammad",
""
]
] |
new_dataset
| 0.982442 |
1204.3689
|
Muhammad Anshari Mr
|
Muhammad Anshari and Mohammad Nabil Almunawar
|
Evaluating CRM Implementation in Healthcare Organization
|
Proceedings of 2011 International Conference on Economics and
Business Information (ICEBI 2011)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, many healthcare organizations are adopting CRM as a strategy, which
involves using technology to organize, automate, and coordinate business
processes, in managing interactions with their patients. CRM with the Web
technology provides healthcare providers the ability to broaden their services
beyond usual practices, and thus offers suitable environment using latest
technology to achieve superb patient care. This paper discusses and
demonstrates how a new approach in CRM based on Web 2.0 will help the
healthcare providers improving their customer support, avoiding conflict, and
promoting better health to patient. With this new approach patients will
benefit from the customized personal service with full information access to
perform self managed their own health. It also helps healthcare providers
retaining the right customer. A conceptual framework of the new approach will
be discussed.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2012 02:34:30 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Anshari",
"Muhammad",
""
],
[
"Almunawar",
"Mohammad Nabil",
""
]
] |
new_dataset
| 0.991981 |
1204.3691
|
Muhammad Anshari Mr
|
Mohammad Nabil Almunawar, Zaw Wint, Patrick Kim Cheng Low, Muhammad
Anshari
|
E-Health Initiative and Customer's Expectation: Case Brunei
|
CiiT International Journal of Automation and Autonomous System, 2012
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is to determine the dimension of e-health services in Brunei
Darussalam (Brunei) from customers' perspective. It is to identify, understand,
analyze and evaluate public's expectation on e-health in Brunei. A
questionnaire was designed to gather quantitative and qualitative data to
survey patients, patient's family, and health practitioners at hospitals,
clinics, or home care centers in Brunei starting from February to March, 2011.
A 25-item Likert-type survey instrument was specifically developed for this
study and administered to a sample of 366 patients. The data were analyzed to
provide initial ideas and recommendation to policy makers on how to move
forward with the e-health initiative as a mean to improve healthcare services.
The survey revealed that there exists a high demand and expectation from people
in Brunei to have better healthcare services accessible through an e-health
system in order to improve health literacy as well as quality and efficiency of
healthcare. Regardless of the limitations of the survey, the general public has
responded with a great support for the capabilities of an e-health system
listed from the questionnaires. The results of the survey provide a solid
foundation for our on going research project to proceed further to develop a
model of e-health and subsequently develop a system prototype that incorporate
expectations from the people.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2012 02:44:06 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Almunawar",
"Mohammad Nabil",
""
],
[
"Wint",
"Zaw",
""
],
[
"Low",
"Patrick Kim Cheng",
""
],
[
"Anshari",
"Muhammad",
""
]
] |
new_dataset
| 0.969447 |
1204.3831
|
Kaiping Xue
|
Kaiping Xue, Peilin Hong, Changsha Ma
|
A lightweight dynamic pseudonym identity based authentication and key
agreement protocol without verification tables for multi-server architecture
|
21pages, 2 fingures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional password based authentication schemes are mostly considered in
single server environments. They are unfitted for the multi-server environments
from two aspects. On the one hand, users need to register in each server and to
store large sets of data, including identities and passwords. On the other
hand, servers are required to store a verification table containing user
identities and passwords. Recently, On the base on Sood et al.'s
protocol(2011), Li et al. proposed an improved dynamic identity based
authentication and key agreement protocol for multi-server architecture(2012).
Li et al. claims that the proposed scheme can make up the security weaknesses
of Sood et al.'s protocol. Unfortunately, our further research shows that Li et
al.'s protocol contains several drawbacks and can not resist some types of
known attacks, such as replay attack, Deny-of-Service attack, internal attack,
eavesdropping attack, masquerade attack, and so on. In this paper, we further
propose a light dynamic pseudonym identity based authentication and key
agreement protocol for multi-server architecture. In our scheme, service
providing servers don't need to maintain verification tables for users. The
proposed protocol provides not only the declared security features in Li et
al.'s paper, but also some other security features, such as traceability and
identity protection.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2012 16:38:16 GMT"
}
] | 2012-04-18T00:00:00 |
[
[
"Xue",
"Kaiping",
""
],
[
"Hong",
"Peilin",
""
],
[
"Ma",
"Changsha",
""
]
] |
new_dataset
| 0.999528 |
1202.6035
|
Nicholas Ruozzi
|
Nicholas Ruozzi
|
The Bethe Partition Function of Log-supermodular Graphical Models
|
Typo, bug fixes, and improved exposition
| null | null | null |
cs.DM math-ph math.CO math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sudderth, Wainwright, and Willsky have conjectured that the Bethe
approximation corresponding to any fixed point of the belief propagation
algorithm over an attractive, pairwise binary graphical model provides a lower
bound on the true partition function. In this work, we resolve this conjecture
in the affirmative by demonstrating that, for any graphical model with binary
variables whose potential functions (not necessarily pairwise) are all
log-supermodular, the Bethe partition function always lower bounds the true
partition function. The proof of this result follows from a new variant of the
"four functions" theorem that may be of independent interest.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2012 19:29:10 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Apr 2012 13:43:51 GMT"
}
] | 2012-04-17T00:00:00 |
[
[
"Ruozzi",
"Nicholas",
""
]
] |
new_dataset
| 0.997031 |
1204.3113
|
\'Alvaro Franco
|
Carlos Eduardo Ferreira, \'Alvaro Junio Pereira Franco
|
Algorithms for Junctions in Directed Acyclic Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a pair of distinct vertices u, v in a graph G, we say that s is a
junction of u, v if there are in G internally vertex disjoint directed paths
from s to u and from s to v. We show how to characterize junctions in directed
acyclic graphs. We also consider the two problems in the following and derive
efficient algorithms to solve them. Given a directed acyclic graph G and a
vertex s in G, how can we find all pairs of vertices of G such that s is a
junction of them? And given a directed acyclic graph G and k pairs of vertices
of G, how can we preprocess G such that all junctions of k given pairs of
vertices could be listed quickly? All junctions of k pairs problem arises in an
application in Anthropology and we apply our algorithm to find such junctions
on kinship networks of some brazilian indian ethnic groups.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2012 21:43:31 GMT"
}
] | 2012-04-17T00:00:00 |
[
[
"Ferreira",
"Carlos Eduardo",
""
],
[
"Franco",
"Álvaro Junio Pereira",
""
]
] |
new_dataset
| 0.999741 |
1204.3410
|
Famantanantsoa Randimbivololona
|
Famantanantsoa Randimbivololona, Abderrahmane Brahmi, Philippe Le Meur
|
Airborne software tests on a fully virtual platform
|
EDCC 2012
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the early deployment of a fully virtual platform to
perform the tests of certified airborne software. This is an alternative to the
current approach based on the use of dedicated hardware platforms.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2012 09:02:33 GMT"
}
] | 2012-04-17T00:00:00 |
[
[
"Randimbivololona",
"Famantanantsoa",
""
],
[
"Brahmi",
"Abderrahmane",
""
],
[
"Meur",
"Philippe Le",
""
]
] |
new_dataset
| 0.982819 |
1204.3581
|
Giuseppe Ottaviano
|
Roberto Grossi, Giuseppe Ottaviano
|
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in
Compressed Space
| null | null | null | null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An indexed sequence of strings is a data structure for storing a string
sequence that supports random access, searching, range counting and analytics
operations, both for exact matches and prefix search. String sequences lie at
the core of column-oriented databases, log processing, and other storage and
query tasks. In these applications each string can appear several times and the
order of the strings in the sequence is relevant. The prefix structure of the
strings is relevant as well: common prefixes are sought in strings to extract
interesting features from the sequence. Moreover, space-efficiency is highly
desirable as it translates directly into higher performance, since more data
can fit in fast memory.
We introduce and study the problem of compressed indexed sequence of strings,
representing indexed sequences of strings in nearly-optimal compressed space,
both in the static and dynamic settings, while preserving provably good
performance for the supported operations.
We present a new data structure for this problem, the Wavelet Trie, which
combines the classical Patricia Trie with the Wavelet Tree, a succinct data
structure for storing a compressed sequence. The resulting Wavelet Trie
smoothly adapts to a sequence of strings that changes over time. It improves on
the state-of-the-art compressed data structures by supporting a dynamic
alphabet (i.e. the set of distinct strings) and prefix queries, both crucial
requirements in the aforementioned applications, and on traditional indexes by
reducing space occupancy to close to the entropy of the sequence.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2012 17:50:35 GMT"
}
] | 2012-04-17T00:00:00 |
[
[
"Grossi",
"Roberto",
""
],
[
"Ottaviano",
"Giuseppe",
""
]
] |
new_dataset
| 0.999678 |
1204.2837
|
Fernand Meyer
|
Fernand Meyer
|
Watersheds, waterfalls, on edge or node weighted graphs
| null | null | null | null |
cs.CV cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algebraic approach to the watershed adapted to edge or node
weighted graphs. Starting with the flooding adjunction, we introduce the
flooding graphs, for which node and edge weights may be deduced one from the
other. Each node weighted or edge weighted graph may be transformed in a
flooding graph, showing that there is no superiority in using one or the other,
both being equivalent. We then introduce pruning operators extract subgraphs of
increasing steepness. For an increasing steepness, the number of never
ascending paths becomes smaller and smaller. This reduces the watershed zone,
where catchment basins overlap. A last pruning operator called scissor
associates to each node outside the regional minima one and only one edge. The
catchment basins of this new graph do not overlap and form a watershed
partition. Again, with an increasing steepness, the number of distinct
watershed partitions contained in a graph becomes smaller and smaller.
Ultimately, for natural image, an infinite steepness leads to a unique
solution, as it is not likely that two absolutely identical non ascending paths
of infinite steepness connect a node with two distinct minima. It happens that
non ascending paths of a given steepness are the geodesics of lexicographic
distance functions of a given depth. This permits to extract the watershed
partitions as skeletons by zone of influence of the minima for such
lexicographic distances. The waterfall hierarchy is obtained by a sequence of
operations. The first constructs the minimum spanning forest which spans an
initial watershed partition. The contraction of the trees into one node
produces a reduced graph which may be submitted to the same treatment. The
process is iterated until only one region remains. The union of the edges of
all forests produced constitutes a minimum spanning tree of the initial graph.
|
[
{
"version": "v1",
"created": "Thu, 12 Apr 2012 20:18:53 GMT"
}
] | 2012-04-16T00:00:00 |
[
[
"Meyer",
"Fernand",
""
]
] |
new_dataset
| 0.993259 |
1204.2880
|
Subhabrata Mukherjee
|
Subhabrata Mukherjee, Amrita Saha, Mrinal K. Naskar and Amitava
Mukherjee
|
Multisource Adaptive Data Distribution and Routing in Wireless Sensor
Networks
|
Accepted in The Second International Conference on Networks &
Communications (NetCoM - 2.0), 2010, Bangalore, India
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The wireless sensor network is a collection of energy-constrained nodes.
Their objective is to sense, collect and process information for some ad-hoc
purpose. Typically the nodes are deployed in geographically inaccessible
regions. Thus the most challenging task is to design a network with minimal
power consumption. As the nodes have to collect and process data very fast,
minimizing data delivery time is another objective. In addition to this, when
multiple sources transmit data simultaneously, the network load gradually
increases and it may lead to congestion. In this paper we have proposed an
adaptive framework in which multiple sources transmit data simultaneously with
minimal end-to-end data delivery time and minimal energy consumption besides
ensuring that congestion remains at an optimum low so that minimal number of
data packets are dropped. This paper presents an adaptive framework to achieve
the above-mentioned objectives. This framework has been used over Mac 802.11
and extensive simulations have been carried out in NS2 to prove the
effectiveness of the framework over traditional Mac as well as few other
existing protocols.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2012 05:00:20 GMT"
}
] | 2012-04-16T00:00:00 |
[
[
"Mukherjee",
"Subhabrata",
""
],
[
"Saha",
"Amrita",
""
],
[
"Naskar",
"Mrinal K.",
""
],
[
"Mukherjee",
"Amitava",
""
]
] |
new_dataset
| 0.998006 |
1109.3428
|
Alberto Pepe
|
Alberto Pepe, Spencer Wolff, Karen Van Godtsenhoven
|
One, None and One Hundred Thousand Profiles: Re-imagining the
Pirandellian Identity Dilemma in the Era of Online Social Networks
|
An abridged version of this paper will be presented/performed under
the title "Identity dilemmas on Facebook" at the Symposium on the Dynamics of
the Internet and Society "A Decade in Internet Time" to be held Wednesday 21
- Saturday 24 September 2011 at the Oxford Internet Institute, University of
Oxford, UK
|
One, None, One Hundred Thousand Profiles. Alberto Pepe, Spencer
Wolff, Karen Van Godtsenhoven. First Monday. Volume 17, Number 4 - 2 April
2012
| null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Uno, Nessuno, Centomila ("One, No One and One Hundred Thousand") is a classic
novel by Italian playwright Luigi Pirandello. Published in 1925, it recounts
the tragedy of Vitangelo Moscarda, a man who struggles to reclaim a coherent
and unitary identity for himself in the face of an inherently social and
multi-faceted world. What would Moscarda identity tragedy look like today? In
this article we transplant Moscarda's identity play from its offline setting to
the contemporary arena of social media and online social networks. With
reference to established theories on identity construction, performance, and
self-presentation, we re-imagine how Moscarda would go about defending the
integrity of his selfhood in the face of the discountenancing influences of the
online world.
|
[
{
"version": "v1",
"created": "Thu, 15 Sep 2011 19:01:31 GMT"
}
] | 2012-04-13T00:00:00 |
[
[
"Pepe",
"Alberto",
""
],
[
"Wolff",
"Spencer",
""
],
[
"Van Godtsenhoven",
"Karen",
""
]
] |
new_dataset
| 0.993002 |
1204.2692
|
Xiaochen Xia
|
Xiaochen Xia, Kui Xu, Youyun Xu
|
Asynchronous Physical-layer Network Coding Scheme for Two-way OFDM Relay
|
6 pages, 7 figures, Submitted to GLOBECOM 2012
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In two-way OFDM relay, carrier frequency offsets (CFOs) between relay and
terminal nodes introduce severe intercarrier interference (ICI) which degrades
the performance of traditional physical-layer network coding (PLNC). Moreover,
traditional algorithm to compute the posteriori probability in the presence of
ICI would incur prohibitive computational complexity at the relay node. In this
paper, we proposed a two-step asynchronous PLNC scheme at the relay to mitigate
the effect of CFOs. In the first step, we intend to reconstruct the ICI
component, in which space-alternating generalized expectationmaximization
(SAGE) algorithm is used to jointly estimate the needed parameters. In the
second step, a channel-decoding and network-coding scheme is proposed to
transform the received signal into the XOR of two terminals' transmitted
information using the reconstructed ICI. It is shown that the proposed scheme
greatly mitigates the impact of CFOs with a relatively lower computational
complexity in two-way OFDM relay.
|
[
{
"version": "v1",
"created": "Thu, 12 Apr 2012 11:48:30 GMT"
}
] | 2012-04-13T00:00:00 |
[
[
"Xia",
"Xiaochen",
""
],
[
"Xu",
"Kui",
""
],
[
"Xu",
"Youyun",
""
]
] |
new_dataset
| 0.994181 |
1110.0864
|
Kazutaka Kurihara
|
Kazutaka Kurihara
|
CinemaGazer: a System for Watching Video at Very High Speed
|
8 pages, 9 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a technology that enables the watching of videos at very
high speed. Subtitles are widely used in DVD movies, and provide useful
supplemental information for understanding video contents. We propose a
"two-level fast-forwarding" scheme for videos with subtitles, which controls
the speed of playback depending on the context: very fast during segments
without language, such as subtitles or speech, and "understandably fast" during
segments with such language. This makes it possible to watch videos at a higher
speed than usual while preserving the entertainment values of the contents. We
also propose "centering" and "fading" features for the display of subtitles to
reduce fatigue when watching high-speed video. We implement a versatile video
encoder that enables movie viewing with two-level fast-forwarding on any mobile
device by specifying the speed of playback, the reading rate, or the overall
viewing time. The effectiveness of our proposed method was demonstrated in an
evaluation study.
|
[
{
"version": "v1",
"created": "Tue, 4 Oct 2011 22:42:03 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Apr 2012 00:10:13 GMT"
}
] | 2012-04-12T00:00:00 |
[
[
"Kurihara",
"Kazutaka",
""
]
] |
new_dataset
| 0.996934 |
1204.2294
|
Wan Mohd Yaakob Wan Bejuri B.Sc. Dip
|
Wan Mohd Yaakob Wan Bejuri, Mohd Murtadha Mohamad, Maimunah Sapri and
Mohd Adly Rosly
|
Ubiquitous WLAN/Camera Positioning using Inverse Intensity Chromaticity
Space-based Feature Detection and Matching: A Preliminary Result
|
International Conference on Man-Machine Systems 2012 (ICOMMS 2012)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper present our new intensity chromaticity space-based feature
detection and matching algorithm. This approach utilizes hybridization of
wireless local area network and camera internal sensor which to receive signal
strength from a access point and the same time retrieve interest point
information from hallways. This information is combined by model fitting
approach in order to find the absolute of user target position. No conventional
searching algorithm is required, thus it is expected reducing the computational
complexity. Finally we present pre-experimental results to illustrate the
performance of the localization system for an indoor environment set-up.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 22:05:34 GMT"
}
] | 2012-04-12T00:00:00 |
[
[
"Bejuri",
"Wan Mohd Yaakob Wan",
""
],
[
"Mohamad",
"Mohd Murtadha",
""
],
[
"Sapri",
"Maimunah",
""
],
[
"Rosly",
"Mohd Adly",
""
]
] |
new_dataset
| 0.979274 |
1204.2516
|
Mostafa Zolfaghari-Nejad
|
Ali Sadr, Mostafa Zolfaghari-Nejad
|
Physical Unclonable Function (PUF) Based Random Number Generator
|
7 pages, 7 figures
|
Advanced Computing: An International Journal (ACIJ), Vol.3, No.2,
March 2012, 139-145
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical Unclonable Functions (PUFs) are widely used to generate random
Numbers. In this paper we propose a new architecture in which an Arbiter Based
PUF has been employed as a nonlinear function in Nonlinear Feedback Shift
Register (NFSR) to generate true random numbers. The rate of producing the
output bit streams is 10 million bits per second. The proposed RNG is able to
pass all NIST tests and the entropy of the output stream is 7.999837 bits per
byte. The proposed circuit has very low resource usage of 193 Slices that makes
it suitable for lightweight applications.
|
[
{
"version": "v1",
"created": "Wed, 11 Apr 2012 18:29:48 GMT"
}
] | 2012-04-12T00:00:00 |
[
[
"Sadr",
"Ali",
""
],
[
"Zolfaghari-Nejad",
"Mostafa",
""
]
] |
new_dataset
| 0.98822 |
1204.2536
|
Hans P. Reiser
|
Benedikt H\"ofling, Hans P. Reiser
|
SecureSMART: A Security Architecture for BFT Replication Libraries
|
2 pages, EDCC 2012 fast abstract
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several research projects have shown that Byzantine fault tolerance (BFT) is
practical today in terms of performance. Deficiencies in other aspects might
still be an obstacle to a more wide-spread deployment in real-world
applications. One of these aspects is an over-all security architecture beyond
the low-level protocol. This paper proposes the security architecture
SecureSMART, which provides dynamic key distribution, internal and external
integrity and confidentiality measures, as well as mechanisms for availability
and access control. For this purpose, it implements security mechanism among
clients, nodes and an external trust center.
|
[
{
"version": "v1",
"created": "Wed, 11 Apr 2012 19:54:30 GMT"
}
] | 2012-04-12T00:00:00 |
[
[
"Höfling",
"Benedikt",
""
],
[
"Reiser",
"Hans P.",
""
]
] |
new_dataset
| 0.997895 |
1204.2134
|
Fernand Meyer
|
Fernand Meyer
|
The steepest watershed: from graphs to images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The watershed is a powerful tool for segmenting objects whose contours appear
as crest lines on a gradient image. The watershed transform associates to a
topographic surface a partition into catchment basins, defined as attraction
zones of a drop of water falling on the relief and following a line of steepest
descent. Unfortunately, catchment basins may overlap and do not form a
partition. Moreover, current watershed algorithms, being shortsighted, do not
correctly estimate the steepness of the downwards trajectories and overestimate
the overlapping zones of catchment basins. An arbitrary division of these zones
between adjacent catchment basin results in a poor localization of the
contours. We propose an algorithm without myopia, which considers the total
length of a trajectory for estimating its steepness. We first consider
topographic surfaces defined on node weighted graphs. The graphs are pruned in
order to eliminate all downwards trajectories which are not the steepest. An
iterative algorithm with simple neighborhood operations performs the pruning
and constructs the catchment basins. The algorithm is then adapted to gray tone
images. The graph structure itself is encoded as an image thanks to the fixed
neighborhood structure of grids. A pair of adaptative erosions and dilations
prune the graph and extend the catchment basins. As a result one obtains a
precise detection of the catchment basins and a graph of the steepest
trajectories. A last iterative algorithm allows to follow selected downwards
trajectories in order to detect particular structures such as rivers or thalweg
lines of the topographic surface.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 13:08:34 GMT"
}
] | 2012-04-11T00:00:00 |
[
[
"Meyer",
"Fernand",
""
]
] |
new_dataset
| 0.999108 |
1204.2202
|
Minghui Jiang
|
Minghui Jiang
|
Clique in 3-track interval graphs is APX-hard
| null | null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Butman, Hermelin, Lewenstein, and Rawitz proved that Clique in t-interval
graphs is NP-hard for t >= 3. We strengthen this result to show that Clique in
3-track interval graphs is APX-hard.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 16:00:48 GMT"
}
] | 2012-04-11T00:00:00 |
[
[
"Jiang",
"Minghui",
""
]
] |
new_dataset
| 0.999414 |
1204.2218
|
Nolmar Melo
|
Nolmar Melo and Douglas F.G. Santiago and Renato Portugal
|
Decoder for Nonbinary CWS Quantum Codes
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://creativecommons.org/licenses/publicdomain/
|
We present a decoder for nonbinary CWS quantum codes using the structure of
union codes. The decoder runs in two steps: first we use a union of stabilizer
codes to detect a sequence of errors, and second we build a new code, called
union code, that allows to correct the errors.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 17:03:56 GMT"
}
] | 2012-04-11T00:00:00 |
[
[
"Melo",
"Nolmar",
""
],
[
"Santiago",
"Douglas F. G.",
""
],
[
"Portugal",
"Renato",
""
]
] |
new_dataset
| 0.998413 |
1204.2250
|
Manel Khelifi
|
Manel Khelifi, Assia Djabelkhir
|
LMEEC: Layered Multi-Hop Energy Efficient Cluster-based Routing Protocol
for Wireless Sensor Networks
|
The 31st Annual IEEE International Conference on Computer
Communications: INFOCOM'2012 Student Posters, Orlando, USA
|
IEEE INFOCOM'2012 Student Posters
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we propose LMEEC, a cluster-based routing protocol with low
energy consumption for wireless sensor networks. Our protocol is based on a
strategy which aims to provide a more reasonable exploitation of the selected
nodes (cluster-heads) energy. Simulation results show the effectiveness of
LMEEC in decreasing the energy consumption, and in prolonging the network
lifetime, compared to LEACH.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 19:11:33 GMT"
}
] | 2012-04-11T00:00:00 |
[
[
"Khelifi",
"Manel",
""
],
[
"Djabelkhir",
"Assia",
""
]
] |
new_dataset
| 0.970236 |
1203.5960
|
Rajdeep Borgohain
|
Rajdeep Borgohain, Moirangthem Tiken Singh, Chandrakant Sakharwade and
Sugata Sanyal
|
TSET: Token based Secure Electronic Transaction
|
7 pages, 3 figures, 2 tables
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security and trust are the most important factors in online transaction, this
paper introduces TSET a Token based Secure Electronic Transaction which is an
improvement over the existing SET, Secure Electronic Transaction protocol. We
take the concept of tokens in the TSET protocol to provide end to end security.
It also provides trust evaluation mechanism so that trustworthiness of the
merchants can be known by customers before being involved in the transaction.
Moreover, we also propose a grading mechanism so that quality of service in the
transactions improves.
|
[
{
"version": "v1",
"created": "Tue, 27 Mar 2012 12:57:52 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Apr 2012 18:20:41 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Apr 2012 11:44:00 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Borgohain",
"Rajdeep",
""
],
[
"Singh",
"Moirangthem Tiken",
""
],
[
"Sakharwade",
"Chandrakant",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.968543 |
1204.1559
|
Nolmar Melo
|
Nolmar Melo
|
Goppa goemetry codes via elementary methods (In Portuguese)
| null | null | null | null |
cs.IT math.AG math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The central objective of this dissertation was to present the Goppa Geometry
Codes via elementary methods which were introduced by J.H. van Lint
,R.Pellikaan and T. Hohold about 1998. On the first part of such dissertation
are presented the fundamental concepts about bodies of rational functions of an
algebraic curve in the direction as to define the Goppa Codes on a classical
manner. In this study we based ourselves mainly on the book ? Algebraic
Function Fields and Codes? of H. Stichtenoth. The second part is initiated with
an introduction about
the functions weight, degree and order which are fundamental for the study of
the Goppa Codes through elementary methods of linear algebra and of semigroups
and such study was based on ? Algebraic Geometry Codes ? of J.H. van
Lint,R.Pellikaan and T. Hohold.
|
[
{
"version": "v1",
"created": "Fri, 6 Apr 2012 20:35:19 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Melo",
"Nolmar",
""
]
] |
new_dataset
| 0.977432 |
1204.1595
|
Negin Golrezaei
|
Negin Golrezaei, Andreas F. Molisch, Alexandros G. Dimakis, Giuseppe
Caire
|
Femtocaching and Device-to-Device Collaboration: A New Architecture for
Wireless Video Distribution
|
7 pages, 7 figures
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new architecture to handle the ongoing explosive increase in the
demand for video content in wireless networks. It is based on distributed
caching of the content in femto-basestations with small or non-existing
backhaul capacity but with considerable storage space, called helper nodes. We
also consider using the mobile terminals themselves as caching helpers, which
can distribute video through device-to-device communications. This approach
allows an improvement in the video throughput without deployment of any
additional infrastructure. The new architecture can improve video throughput by
one to two orders-of-magnitude.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 05:30:26 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Golrezaei",
"Negin",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.99951 |
1204.1614
|
Prasun Chowdhury
|
Prasun Chowdhury, Iti Saha Misra, Salil K Sanyal
|
Cross Layer QoS Support Architecture with Integrated CAC and Scheduling
Algorithms for WiMAX BWA Networks
|
17 pages, (IJACSA) International Journal of Advanced Computer Science
and Applications, Vol. 3, No. 1, 2012. arXiv admin note: text overlap with
arXiv:1012.2518 and arXiv:1110.0147 by other authors
|
(IJACSA) International Journal of Advanced Computer Science and
Applications, Vol. 3, No. 1, 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new technique for cross layer design, based on present Eb/N0
(bit energy per noise density) ratio of the connections and target values of
the Quality of Service (QoS) information parameters from MAC layer, is proposed
to dynamically select the Modulation and Coding Scheme (MCS) at the PHY layer
for WiMAX Broadband Wireless Access (BWA) networks. The QoS information
parameter includes New Connection Blocking Probability (NCBP), Hand off
Connection Dropping Probability (HCDP) and Connection Outage Probability (COP).
In addition, a Signal to Interference plus Noise Ratio (SINR) based Call
Admission Control (CAC) algorithm and Queue based Scheduling algorithm are
integrated for the cross layer design. An analytical model using the Continuous
Time Markov Chain (CTMC) is developed for performance evaluation of the
algorithms under various MCS. The effect of Eb/No is observed for QoS
information parameters in order to determine its optimum range. Simulation
results show that the integrated CAC and packet Scheduling model maximizes the
bandwidth utilization and fair allocation of the system resources for all types
of MCS and guarantees the QoS to the connections.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 08:37:08 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Chowdhury",
"Prasun",
""
],
[
"Misra",
"Iti Saha",
""
],
[
"Sanyal",
"Salil K",
""
]
] |
new_dataset
| 0.990108 |
1204.1651
|
Ali Elouafiq Mr.
|
Ali Elouafiq
|
Authentication and Encryption in GSM and 3GUMTS: An Emphasis on
Protocols and Algorithms
|
12 pages, reference for 3G/2G telecommunications cryptography
| null | null | null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
Mobile communication touches every aspect of our life, it become one of the
major dependencies that the 21st Century civilizations rely on. Thereby,
security is a major issue that should be targeted by communication
technologies. In this paper we will target authentication and encryption in GSM
and 3G/UMTS. In order to understand clearly how things work, we will start by
presenting the architecture of each network, its major components, its
authentication algorithms, protocols used, and KASUMI Block Cipher.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 15:35:56 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Elouafiq",
"Ali",
""
]
] |
new_dataset
| 0.999152 |
1204.1658
|
Anshul Verma Mr.
|
Anshul Verma, Dr. Anurag Srivastava
|
Integrated Routing Protocol for Opportunistic Networks
|
8 pages, 12 figures, (IJACSA) International Journal of Advanced
Computer Science and Applications
|
(IJACSA) International Journal of Advanced Computer Science and
Applications, Vol. 2, No.3, March 2011, pp. 85-92
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In opportunistic networks the existence of a simultaneous path is not assumed
to transmit a message between a sender and a receiver. Information about the
context in which the users communicate is a key piece of knowledge to design
efficient routing protocols in opportunistic networks. But this kind of
information is not always available. When users are very isolated, context
information cannot be distributed, and cannot be used for taking efficient
routing decisions. In such cases, context oblivious based schemes are only way
to enable communication between users. As soon as users become more social,
context data spreads in the network, and context based routing becomes an
efficient solution. In this paper we design an integrated routing protocol that
is able to use context data as soon as it becomes available and falls back to
dissemination based routing when context information is not available. Then, we
provide a comparison between Epidemic and PROPHET, these are representative of
context oblivious and context aware routing protocols. Our results show that
integrated routing protocol is able to provide better result in term of message
delivery probability and message delay in both cases when context information
about users is available or not.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 17:10:38 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Verma",
"Anshul",
""
],
[
"Srivastava",
"Dr. Anurag",
""
]
] |
new_dataset
| 0.997381 |
1204.1749
|
Andrew Adamatzky
|
Yukio-Pegio Gunji, Yuta Nishiyama, Andrew Adamatzky
|
Robust Soldier Crab Ball Gate
| null |
Complex Systems 20 (2011) 2
| null | null |
cs.ET nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Soldier crabs Mictyris guinotae exhibit pronounced swarming behaviour. The
swarms of the crabs tolerant of perturbations. In computer models and
laboratory experiments we demonstrate that swarms of soldier crabs can
implement logical gates when placed in a geometrically constrained environment.
|
[
{
"version": "v1",
"created": "Sun, 8 Apr 2012 17:45:52 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Gunji",
"Yukio-Pegio",
""
],
[
"Nishiyama",
"Yuta",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999397 |
1204.1808
|
Rehan Khan
|
Asad Maqsood and Rehanullah Khan
|
Vehicular Ad-hoc Networks
|
International Journal of Computer Science Issues (IJCSI), Volume 9,
Issue 1, No 3, January 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern day's vehicles require advanced communication system on board to
enable passengers benefit the most from available services. IEEE 802.11p is the
new extension of IEEE 802.11 standards; especially proposed for the high
vehicular environment. The WAVE documentation represents enhancements to the
Media Access Control (MAC) and Physical (PHY) layer of IEEE 802.11 standards to
work efficiently in high vehicular environment. In this research work, the main
emphasis is on the new IEEE 802.11p enhancement of MAC and PHY layers. More
specifically, the target of this research is to setup a simulation environment
which will allow us to investigate the use of real time voice application,
using IEEE 802.11p (WAVE) enhance setting, in a single hop and multi-hop
environment where nodes are not directly connected. Also, the evaluation of
transmission between moving nodes are tested by simply sending and receiving
FTP file between them with varying speed of the moving nodes.
|
[
{
"version": "v1",
"created": "Mon, 9 Apr 2012 06:37:09 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Maqsood",
"Asad",
""
],
[
"Khan",
"Rehanullah",
""
]
] |
new_dataset
| 0.999241 |
1204.1881
|
Jan Bergstra
|
Jan A. Bergstra
|
Four Conceptions of Instruction Sequence Faults
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of an instruction sequence fault is considered from various
perspectives. Four different viewpoints on what constitutes a fault, or how to
use the notion of a fault, are formulated. An integration of these views is
proposed.
|
[
{
"version": "v1",
"created": "Mon, 9 Apr 2012 14:05:02 GMT"
}
] | 2012-04-10T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
]
] |
new_dataset
| 0.987009 |
1203.1569
|
Olaf Hartig
|
Olaf Hartig
|
SPARQL for a Web of Linked Data: Semantics and Computability (Extended
Version)
|
v2: 55 pages, added Appendix D about constant reachability criteria,
aligned with the final version published in ESWC 2012; v1: 52 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The World Wide Web currently evolves into a Web of Linked Data where content
providers publish and link data as they have done with hypertext for the last
20 years. While the declarative query language SPARQL is the de facto for
querying a-priory defined sets of data from the Web, no language exists for
querying the Web of Linked Data itself. However, it seems natural to ask
whether SPARQL is also suitable for such a purpose.
In this paper we formally investigate the applicability of SPARQL as a query
language for Linked Data on the Web. In particular, we study two query models:
1) a full-Web semantics where the scope of a query is the complete set of
Linked Data on the Web and 2) a family of reachability-based semantics which
restrict the scope to data that is reachable by traversing certain data links.
For both models we discuss properties such as monotonicity and computability as
well as the implications of querying a Web that is infinitely large due to data
generating servers.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2012 18:53:35 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Apr 2012 18:36:54 GMT"
}
] | 2012-04-09T00:00:00 |
[
[
"Hartig",
"Olaf",
""
]
] |
new_dataset
| 0.952221 |
1204.1417
|
Christophe Paul
|
Eun Jung Kim and Christophe Paul and Geevarghese Philip
|
A single-exponential FPT algorithm for the $K_4$-minor cover problem
| null | null | null | null |
cs.DS cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given an input graph G and an integer k, the parameterized K_4-minor cover
problem asks whether there is a set S of at most k vertices whose deletion
results in a K_4-minor-free graph, or equivalently in a graph of treewidth at
most 2. This problem is inspired by two well-studied parameterized vertex
deletion problems, Vertex Cover and Feedback Vertex Set, which can also be
expressed as Treewidth-t Vertex Deletion problems: t=0 for Vertex Cover and t=1
for Feedback Vertex Set. While a single-exponential FPT algorithm has been
known for a long time for \textsc{Vertex Cover}, such an algorithm for Feedback
Vertex Set was devised comparatively recently. While it is known to be unlikely
that Treewidth-t Vertex Deletion can be solved in time c^{o(k)}.n^{O(1)}, it
was open whether the K_4-minor cover problem could be solved in
single-exponential FPT time, i.e. in c^k.n^{O(1)} time. This paper answers this
question in the affirmative.
|
[
{
"version": "v1",
"created": "Fri, 6 Apr 2012 06:37:59 GMT"
}
] | 2012-04-09T00:00:00 |
[
[
"Kim",
"Eun Jung",
""
],
[
"Paul",
"Christophe",
""
],
[
"Philip",
"Geevarghese",
""
]
] |
new_dataset
| 0.950539 |
1204.1428
|
Tuan Tran Thai
|
Tuan Tran Thai (DMIA), Emmanuel Lochin (DMIA), Jerome Lacan (DMIA)
|
Online multipath convolutional coding for real-time transmission
|
Online multipath convolutional coding for real-time transmission
(2012)
| null | null | null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of multipath multimedia streaming proposals use Forward Error Correction
(FEC) approach to protect from packet losses. However, FEC does not sustain
well burst of losses even when packets from a given FEC block are spread over
multiple paths. In this article, we propose an online multipath convolutional
coding for real-time multipath streaming based on an on-the-fly coding scheme
called Tetrys. We evaluate the benefits brought out by this coding scheme
inside an existing FEC multipath load splitting proposal known as Encoded
Multipath Streaming (EMS). We demonstrate that Tetrys consistently outperforms
FEC in both uniform and burst losses with EMS scheme. We also propose a
modification of the standard EMS algorithm that greatly improves the
performance in terms of packet recovery. Finally, we analyze different
spreading policies of the Tetrys redundancy traffic between available paths and
observe that the longer propagation delay path should be preferably used to
carry repair packets.
|
[
{
"version": "v1",
"created": "Fri, 6 Apr 2012 07:59:27 GMT"
}
] | 2012-04-09T00:00:00 |
[
[
"Thai",
"Tuan Tran",
"",
"DMIA"
],
[
"Lochin",
"Emmanuel",
"",
"DMIA"
],
[
"Lacan",
"Jerome",
"",
"DMIA"
]
] |
new_dataset
| 0.989734 |
1101.5227
|
Abuzer Yakaryilmaz
|
Abuzer Yakaryilmaz and A. C. Cem Say
|
NP has log-space verifiers with fixed-size public quantum registers
|
9 pages. A revised version
| null | null | null |
cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In classical Arthur-Merlin games, the class of languages whose membership
proofs can be verified by Arthur using logarithmic space (AM(log-space))
coincides with the class P \cite{Co89}. In this note, we show that if Arthur
has a fixed-size quantum register (the size of the register does not depend on
the length of the input) instead of another source of random bits, membership
in any language in NP can be verified with any desired error bound.
|
[
{
"version": "v1",
"created": "Thu, 27 Jan 2011 09:02:25 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Oct 2011 06:33:59 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Apr 2012 11:49:00 GMT"
}
] | 2012-04-06T00:00:00 |
[
[
"Yakaryilmaz",
"Abuzer",
""
],
[
"Say",
"A. C. Cem",
""
]
] |
new_dataset
| 0.999431 |
1204.1096
|
Amitav Mukherjee
|
Amitav Mukherjee, Minyan Pei, and A. Lee Swindlehurst
|
MIMO Precoding in Underlay Cognitive Radio Systems with Completely
Unknown Primary CSI
|
11 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies a novel underlay MIMO cognitive radio (CR) system, where
the instantaneous or statistical channel state information (CSI) of the
interfering channels to the primary receivers (PRs) is completely unknown to
the CR. For the single underlay receiver scenario, we assume a minimum
information rate must be guaranteed on the CR main channel whose CSI is known
at the CR transmitter. We first show that low-rank CR interference is
preferable for improving the throughput of the PRs compared with spreading less
power over more transmit dimensions. Based on this observation, we then propose
a rank minimization CR transmission strategy assuming a minimum information
rate must be guaranteed on the CR main channel. We propose a simple solution
referred to as frugal waterfilling (FWF) that uses the least amount of power
required to achieve the rate constraint with a minimum-rank transmit covariance
matrix. We also present two heuristic approaches that have been used in prior
work to transform rank minimization problems into convex optimization problems.
The proposed schemes are then generalized to an underlay MIMO CR downlink
network with multiple receivers. Finally, a theoretical analysis of the
interference temperature and leakage rate outage probabilities at the PR is
presented for Rayleigh fading channels.We demonstrate that the direct FWF
solution leads to higher PR throughput even though it has higher interference
"temperature (IT) compared with the heuristic methods and classic waterfilling,
which calls into question the use of IT as a metric for CR interference.
|
[
{
"version": "v1",
"created": "Thu, 5 Apr 2012 00:10:44 GMT"
}
] | 2012-04-06T00:00:00 |
[
[
"Mukherjee",
"Amitav",
""
],
[
"Pei",
"Minyan",
""
],
[
"Swindlehurst",
"A. Lee",
""
]
] |
new_dataset
| 0.96908 |
1204.1201
|
Md. Abu Naser Bikas
|
Bijan Paul, Md. Ibrahim and Md. Abu Naser Bikas
|
VANET Routing Protocols: Pros and Cons
| null |
International Journal of Computer Applications, Volume 20, No.3,
April 2011
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous
attention in the recent years. Due to rapid topology changing and frequent
disconnection makes it difficult to design an efficient routing protocol for
routing data among vehicles, called V2V or vehicle to vehicle communication and
vehicle to road side infrastructure, called V2I. The existing routing protocols
for VANET are not efficient to meet every traffic scenarios. Thus design of an
efficient routing protocol has taken significant attention. So, it is very
necessary to identify the pros and cons of routing protocols which can be used
for further improvement or development of any new routing protocol. This paper
presents the pros and cons of VANET routing protocols for inter vehicle
communication.
|
[
{
"version": "v1",
"created": "Thu, 5 Apr 2012 12:32:23 GMT"
}
] | 2012-04-06T00:00:00 |
[
[
"Paul",
"Bijan",
""
],
[
"Ibrahim",
"Md.",
""
],
[
"Bikas",
"Md. Abu Naser",
""
]
] |
new_dataset
| 0.998774 |
1201.6043
|
Patrick Sol\'e
|
Adel Alahmadi, R. E. L. Aldred, Romar dela Cruz, Patrick Sol\'e,
Carsten Thomassen
|
The maximum number of minimal codewords in long codes
|
9 pages, submitted to Discrete Applied Math
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Upper bounds on the maximum number of minimal codewords in a binary code
follow from the theory of matroids. Random coding provide lower bounds. In this
paper we compare these bounds with analogous bounds for the cycle code of
graphs. This problem (in the graphic case) was considered in 1981 by Entringer
and Slater who asked if a connected graph with $p$ vertices and $q$ edges can
have only slightly more that $2^{q-p}$ cycles. The bounds in this note answer
this in the affirmative for all graphs except possibly some that have fewer
than $2p+3\log_2(3p)$ edges. We also conclude that an Eulerian (even) graph has
at most $2^{q-p}$ cycles unless the graph is a subdivision of a 4-regular graph
that is the edge-disjoint union of two Hamiltonian cycles, in which case it may
have as many as $2^{q-p}+p$ cycles.
|
[
{
"version": "v1",
"created": "Sun, 29 Jan 2012 15:00:44 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Apr 2012 10:22:36 GMT"
}
] | 2012-04-05T00:00:00 |
[
[
"Alahmadi",
"Adel",
""
],
[
"Aldred",
"R. E. L.",
""
],
[
"Cruz",
"Romar dela",
""
],
[
"Solé",
"Patrick",
""
],
[
"Thomassen",
"Carsten",
""
]
] |
new_dataset
| 0.996535 |
1203.6559
|
Michiel de Bondt
|
Michiel de Bondt
|
Solving Mahjong Solitaire boards with peeking
|
10 pages
| null | null | null |
cs.CC cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We first prove that solving Mahjong Solitaire boards with peeking is
NP-complete, even if one only allows isolated stacks of the forms /aab/ and
/abb/. We subsequently show that layouts of isolated stacks of heights one and
two can always be solved with peeking, and that doing so is in P, as well as
finding an optimal algorithm for such layouts without peeking.
Next, we describe a practical algorithm for solving Mahjong Solitaire boards
with peeking, which is simple and fast. The algorithm uses an effective pruning
criterion and a heuristic to find and prioritize critical groups. The ideas of
the algorithm can also be applied to solving Shisen-Sho with peeking.
|
[
{
"version": "v1",
"created": "Thu, 29 Mar 2012 15:34:39 GMT"
}
] | 2012-04-04T00:00:00 |
[
[
"de Bondt",
"Michiel",
""
]
] |
new_dataset
| 0.994634 |
1204.0535
|
S Muthukrishnan
|
Yishay Mansour, S. Muthukrishnan and Noam Nisan
|
Doubleclick Ad Exchange Auction
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Display advertisements on the web are sold via ad exchanges that use real
time auction. We describe the challenges of designing a suitable auction, and
present a simple auction called the Optional Second Price (OSP) auction that is
currently used in Doubleclick Ad Exchange.
|
[
{
"version": "v1",
"created": "Mon, 2 Apr 2012 20:56:53 GMT"
}
] | 2012-04-04T00:00:00 |
[
[
"Mansour",
"Yishay",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Nisan",
"Noam",
""
]
] |
new_dataset
| 0.999793 |
0910.4455
|
Emmanuel Lochin
|
Remi Diana and Emmanuel Lochin
|
ECN verbose mode: a statistical method for network path congestion
estimation
| null | null |
10.1016/j.comnet.2011.04.001
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article introduces a simple and effective methodology to determine the
level of congestion in a network with an ECN-like marking scheme. The purpose
of the ECN bit is to notify TCP sources of an imminent congestion in order to
react before losses occur. However, ECN is a binary indicator which does not
reflect the congestion level (i.e. the percentage of queued packets) of the
bottleneck, thus preventing any adapted reaction. In this study, we use a
counter in place of the traditional ECN marking scheme to assess the number of
times a packet has crossed a congested router. Thanks to this simple counter,
we drive a statistical analysis to accurately estimate the congestion level of
each router on a network path. We detail in this paper an analytical method
validated by some preliminary simulations which demonstrate the feasibility and
the accuracy of the concept proposed. We conclude this paper with possible
applications and expected future work.
|
[
{
"version": "v1",
"created": "Fri, 23 Oct 2009 07:49:05 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Feb 2010 08:27:50 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Diana",
"Remi",
""
],
[
"Lochin",
"Emmanuel",
""
]
] |
new_dataset
| 0.985854 |
1204.0029
|
Alexandros Manolakos
|
Alexandros Manolakos, Yair Noam and Andrea J. Goldsmith
|
Blind Null-space Tracking for MIMO Underlay Cognitive Radio Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blind Null Space Learning (BNSL) has recently been proposed for fast and
accurate learning of the null-space associated with the channel matrix between
a secondary transmitter and a primary receiver. In this paper we propose a
channel tracking enhancement of the algorithm, namely the Blind Null Space
Tracking (BNST) algorithm that allows transmission of information to the
Secondary Receiver (SR) while simultaneously learning the null-space of the
time-varying target channel. Specifically, the enhanced algorithm initially
performs a BNSL sweep in order to acquire the null space. Then, it performs
modified Jacobi rotations such that the induced interference to the primary
receiver is kept lower than a given threshold $P_{Th}$ with probability $p$
while information is transmitted to the SR simultaneously. We present
simulation results indicating that the proposed approach has strictly better
performance over the BNSL algorithm for channels with independent Rayleigh
fading with a small Doppler frequency.
|
[
{
"version": "v1",
"created": "Fri, 30 Mar 2012 21:28:47 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Manolakos",
"Alexandros",
""
],
[
"Noam",
"Yair",
""
],
[
"Goldsmith",
"Andrea J.",
""
]
] |
new_dataset
| 0.991137 |
1204.0056
|
Heru Susanto
|
Heru Susanto, Mohammad Nabil Almunawar, Yong Chee Tuan, Mehmet Sabih
Aksoy
|
I-SolFramework: An Integrated Solution Framework Six Layers Assessment
on Multimedia Information Security Architecture Policy Compliance
|
International Journal of Electrical & Computer Sciences IJECS-IJENS
Vol: 12 No: 01 (126501-9494 IJECS-IJENS \c{opyright} February 2012 IJENS)
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multimedia Information security becomes a important part for the
organization's intangible assets. Level of confidence and stakeholder trusted
are performance indicator as successes organization, it is imperative for
organizations to use Information Security Management System (ISMS) to
effectively manage their multimedia information assets. The main objective of
this paper is to Provide a novel practical framework approach to the
development of ISMS, Called by the I-SolFramework, implemented in multimedia
information security architecture (MISA), it divides a problem into six object
domains or six layers, namely organization,stakeholders, tool & technology,
policy, knowledge, and culture. In addition, this framework also introduced
novelty algorithm and mathematic models as measurement and assessment tools of
MISA parameters.
|
[
{
"version": "v1",
"created": "Sat, 31 Mar 2012 02:06:00 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Susanto",
"Heru",
""
],
[
"Almunawar",
"Mohammad Nabil",
""
],
[
"Tuan",
"Yong Chee",
""
],
[
"Aksoy",
"Mehmet Sabih",
""
]
] |
new_dataset
| 0.982002 |
1204.0065
|
Ian Lim
|
Ian Lim
|
MIMO Z Channel Interference Management
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MIMO Z Channel is investigated in this paper. We focus on how to tackle the
interference when different users try to send their codewords to their
corresponding receivers while only one user will cause interference to the
other. We assume there are two transmitters and two receivers each with two
antennas. We propose a strategy to remove the interference while allowing
different users transmit at the same time. Our strategy is low-complexity while
the performance is good. Mathematical analysis is provided and simulations are
given based on our system.
|
[
{
"version": "v1",
"created": "Sat, 31 Mar 2012 03:08:17 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Lim",
"Ian",
""
]
] |
new_dataset
| 0.988209 |
1204.0094
|
Nikzad Babaii-Rizvandi
|
Thava Iyer, Robert Hsieh, Nikzad Babaii Rizvandi, Benoy Varghese,
Roksana Boreli
|
Mobile P2P Trusted On-Demand Video Streaming
|
Published as demo in Local Computer Network conference (LCN 2011)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose to demonstrate a mobile server assisted P2P system for on-demand
video streaming. Our proposed solution uses a combination of 3G and ad-hoc
Wi-Fi connections, to enable mobile devices to download content from a
centralised server in a way that minimises the 3G bandwidth use and cost. On
the customised GUI, we show the corresponding reduction in 3G bandwidth
achieved by increasing the number of participating mobile devices in the
combined P2P and ad-hoc Wi- Fi network, while demonstrating the good video
playout quality on each of the mobiles. We also demonstrate the implemented
trust mechanism which enables mobiles to only use trusted adhoc connections.
The system has been implemented on Android based smartphones.
|
[
{
"version": "v1",
"created": "Sat, 31 Mar 2012 12:27:33 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Iyer",
"Thava",
""
],
[
"Hsieh",
"Robert",
""
],
[
"Rizvandi",
"Nikzad Babaii",
""
],
[
"Varghese",
"Benoy",
""
],
[
"Boreli",
"Roksana",
""
]
] |
new_dataset
| 0.997777 |
1204.0140
|
Mario Jarmasz
|
Mario Jarmasz
|
Roget's Thesaurus as a Lexical Resource for Natural Language Processing
|
Thesis submitted to the Faculty of Graduate and Postdoctoral Studies
in partial fulfillment of the requirements for the degree of Master of
Computer Science July, 2003. Ottawa-Carleton Institute for Computer Science,
School of Information Technology and Engineering, University of Ottawa,
Ottawa, Ontario, Canada
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WordNet proved that it is possible to construct a large-scale electronic
lexical database on the principles of lexical semantics. It has been accepted
and used extensively by computational linguists ever since it was released.
Inspired by WordNet's success, we propose as an alternative a similar resource,
based on the 1987 Penguin edition of Roget's Thesaurus of English Words and
Phrases.
Peter Mark Roget published his first Thesaurus over 150 years ago. Countless
writers, orators and students of the English language have used it.
Computational linguists have employed Roget's for almost 50 years in Natural
Language Processing, however hesitated in accepting Roget's Thesaurus because a
proper machine tractable version was not available.
This dissertation presents an implementation of a machine-tractable version
of the 1987 Penguin edition of Roget's Thesaurus - the first implementation of
its kind to use an entire current edition. It explains the steps necessary for
taking a machine-readable file and transforming it into a tractable system.
This involves converting the lexical material into a format that can be more
easily exploited, identifying data structures and designing classes to
computerize the Thesaurus. Roget's organization is studied in detail and
contrasted with WordNet's.
We show two applications of the computerized Thesaurus: computing semantic
similarity between words and phrases, and building lexical chains in a text.
The experiments are performed using well-known benchmarks and the results are
compared to those of other systems that use Roget's, WordNet and statistical
techniques. Roget's has turned out to be an excellent resource for measuring
semantic similarity; lexical chains are easily built but more difficult to
evaluate. We also explain ways in which Roget's Thesaurus and WordNet can be
combined.
|
[
{
"version": "v1",
"created": "Sat, 31 Mar 2012 21:53:56 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Jarmasz",
"Mario",
""
]
] |
new_dataset
| 0.997279 |
1204.0173
|
Hamid G. Bafghi G.
|
Hamid G. Bafghi, Babak Seyfe, Mahtab Mirmohseni, M. Reza Aref
|
On The Achievable Rate Region of a New Wiretap Channel With Side
Information
| null | null | null |
Rep. No. 1, March 22, 2012
|
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new applicable wiretap channel with separated side information is
considered here which consist of a sender, a legitimate receiver and a
wiretapper. In the considered scenario, the links from the transmitter to the
legitimate receiver and the eavesdropper experience different conditions or
channel states. So, the legitimate receiver and the wiretapper listen to the
transmitted signal through the channels with different channel states which may
have some correlation to each other. It is assumed that the transmitter knows
the state of the main channel non-causally and uses this knowledge to encode
its message. The state of the wiretap channel is not known anywhere. An
achievable equivocation rate region is derived for this model and is compared
to the existing works. In some special cases, the results are extended to the
Gaussian wiretap channel.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2012 07:27:17 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Bafghi",
"Hamid G.",
""
],
[
"Seyfe",
"Babak",
""
],
[
"Mirmohseni",
"Mahtab",
""
],
[
"Aref",
"M. Reza",
""
]
] |
new_dataset
| 0.956813 |
1204.0183
|
Youssef Bassil
|
Youssef Bassil
|
Neural Network Model for Path-Planning of Robotic Rover Systems
|
LACSC - Lebanese Association for Computational Sciences,
http://www.lacsc.org/; International Journal of Science and Technology
(IJST), Vol. 2, No. 2, February 2012
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, robotics is an auspicious and fast-growing branch of technology that
involves the manufacturing, design, and maintenance of robot machines that can
operate in an autonomous fashion and can be used in a wide variety of
applications including space exploration, weaponry, household, and
transportation. More particularly, in space applications, a common type of
robots has been of widespread use in the recent years. It is called planetary
rover which is a robot vehicle that moves across the surface of a planet and
conducts detailed geological studies pertaining to the properties of the
landing cosmic environment. However, rovers are always impeded by obstacles
along the traveling path which can destabilize the rover's body and prevent it
from reaching its goal destination. This paper proposes an ANN model that
allows rover systems to carry out autonomous path-planning to successfully
navigate through challenging planetary terrains and follow their goal location
while avoiding dangerous obstacles. The proposed ANN is a multilayer network
made out of three layers: an input, a hidden, and an output layer. The network
is trained in offline mode using back-propagation supervised learning
algorithm. A software-simulated rover was experimented and it revealed that it
was able to follow the safest trajectory despite existing obstacles. As future
work, the proposed ANN is to be parallelized so as to speed-up the execution
time of the training process.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2012 09:24:19 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Bassil",
"Youssef",
""
]
] |
new_dataset
| 0.980317 |
1204.0184
|
Youssef Bassil
|
Youssef Bassil
|
Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset
|
LACSC - Lebanese Association for Computational Sciences,
http://www.lacsc.org/; International Journal of Research and Reviews in
Computer Science (IJRRCS), Vol. 3, No. 1, February 2012
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spell-checking is the process of detecting and sometimes providing
suggestions for incorrectly spelled words in a text. Basically, the larger the
dictionary of a spell-checker is, the higher is the error detection rate;
otherwise, misspellings would pass undetected. Unfortunately, traditional
dictionaries suffer from out-of-vocabulary and data sparseness problems as they
do not encompass large vocabulary of words indispensable to cover proper names,
domain-specific terms, technical jargons, special acronyms, and terminologies.
As a result, spell-checkers will incur low error detection and correction rate
and will fail to flag all errors in the text. This paper proposes a new
parallel shared-memory spell-checking algorithm that uses rich real-world word
statistics from Yahoo! N-Grams Dataset to correct non-word and real-word errors
in computer text. Essentially, the proposed algorithm can be divided into three
sub-algorithms that run in a parallel fashion: The error detection algorithm
that detects misspellings, the candidates generation algorithm that generates
correction suggestions, and the error correction algorithm that performs
contextual error correction. Experiments conducted on a set of text articles
containing misspellings, showed a remarkable spelling error correction rate
that resulted in a radical reduction of both non-word and real-word errors in
electronic text. In a further study, the proposed algorithm is to be optimized
for message-passing systems so as to become more flexible and less costly to
scale over distributed machines.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2012 09:28:20 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Bassil",
"Youssef",
""
]
] |
new_dataset
| 0.999542 |
1204.0188
|
Youssef Bassil
|
Youssef Bassil, Mohammad Alwani
|
OCR Context-Sensitive Error Correction Based on Google Web 1T 5-Gram
Data Set
|
LACSC - Lebanese Association for Computational Sciences,
http://www.lacsc.org/; American Journal of Scientific Research, Issue. 50,
February 2012
| null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the dawn of the computing era, information has been represented
digitally so that it can be processed by electronic computers. Paper books and
documents were abundant and widely being published at that time; and hence,
there was a need to convert them into digital format. OCR, short for Optical
Character Recognition was conceived to translate paper-based books into digital
e-books. Regrettably, OCR systems are still erroneous and inaccurate as they
produce misspellings in the recognized text, especially when the source
document is of low printing quality. This paper proposes a post-processing OCR
context-sensitive error correction method for detecting and correcting non-word
and real-word OCR errors. The cornerstone of this proposed approach is the use
of Google Web 1T 5-gram data set as a dictionary of words to spell-check OCR
text. The Google data set incorporates a very large vocabulary and word
statistics entirely reaped from the Internet, making it a reliable source to
perform dictionary-based error correction. The core of the proposed solution is
a combination of three algorithms: The error detection, candidate spellings
generator, and error correction algorithms, which all exploit information
extracted from Google Web 1T 5-gram data set. Experiments conducted on scanned
images written in different languages showed a substantial improvement in the
OCR error correction rate. As future developments, the proposed algorithm is to
be parallelised so as to support parallel and distributed computing
architectures.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2012 10:06:55 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Bassil",
"Youssef",
""
],
[
"Alwani",
"Mohammad",
""
]
] |
new_dataset
| 0.977582 |
1204.0221
|
Youssef Bassil
|
Youssef Bassil, Aziz Barbar
|
MyProLang - My Programming Language: A Template-Driven Automatic Natural
Programming Language
|
WCECS 2008, October 22-24, 2008, San Francisco, USA
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern computer programming languages are governed by complex syntactic
rules. They are unlike natural languages; they require extensive manual work
and a significant amount of learning and practicing for an individual to become
skilled at and to write correct programs. Computer programming is a difficult,
complicated, unfamiliar, non-automated, and a challenging discipline for
everyone; especially, for students, new programmers and end-users. This paper
proposes a new programming language and an environment for writing computer
applications based on source-code generation. It is mainly a template-driven
automatic natural imperative programming language called MyProLang. It
harnesses GUI templates to generate proprietary natural language source-code,
instead of having computer programmers write the code manually. MyProLang is a
blend of five elements. A proprietary natural programming language with
unsophisticated grammatical rules and expressive syntax; automation templates
that automate the generation of instructions and thereby minimizing the
learning and training time; an NLG engine to generate natural instructions; a
source-to-source compiler that analyzes, parses, and build executables; and an
ergonomic IDE that houses diverse functions whose role is to simplify the
software development process. MyProLang is expected to make programming open to
everyone including students, programmers and end-users. In that sense, anyone
can start programming systematically, in an automated manner and in natural
language; without wasting time in learning how to formulate instructions and
arrange expressions, without putting up with unfamiliar structures and symbols,
and without being annoyed by syntax errors. In the long run, this increases the
productivity, quality and time-to-market in software development.
|
[
{
"version": "v1",
"created": "Sun, 1 Apr 2012 15:35:11 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Bassil",
"Youssef",
""
],
[
"Barbar",
"Aziz",
""
]
] |
new_dataset
| 0.999334 |
1204.0459
|
Zhenghao Zhang
|
Zhenghao Zhang, Shuping Gong, Aleksandar D. Dimitrovski, and Husheng
Li
|
Time Synchronization Attack in Smart Grid-Part I: Impact and Analysis
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many operations in power grids, such as fault detection and event location
estimation, depend on precise timing information. In this paper, a novel Time
Synchronization Attack (TSA) is proposed to attack the timing information in
smart grid. Since many applications in smart grid utilize synchronous
measurements and most of the measurement devices are equipped with global
positioning system (GPS) for precise timing, it is highly probable to attack
the measurement system by spoofing the GPS. The effectiveness of TSA is
demonstrated for three applications of phasor measurement unit (PMU) in smart
grid, namely transmission line fault detection, voltage stability monitoring
and event locationing. The validity of TSA is demonstrated by numerical
simulations.
|
[
{
"version": "v1",
"created": "Mon, 2 Apr 2012 16:31:42 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Zhang",
"Zhenghao",
""
],
[
"Gong",
"Shuping",
""
],
[
"Dimitrovski",
"Aleksandar D.",
""
],
[
"Li",
"Husheng",
""
]
] |
new_dataset
| 0.950219 |
cs/0611079
|
Emmanuel Lochin
|
Emmanuel Lochin and Bruno Talavera
|
Managing network congestion with a Kohonen-based RED queue
|
8 pages, 9 figures
| null |
10.1016/j.engappai.2010.10.012
| null |
cs.NI cs.NE
| null |
The behaviour of the TCP AIMD algorithm is known to cause queue length
oscillations when congestion occurs at a router output link. Indeed, due to
these queueing variations, end-to-end applications experience large delay
jitter. Many studies have proposed efficient Active Queue Management (AQM)
mechanisms in order to reduce queue oscillations and stabilize the queue
length. These AQM are mostly improvements of the Random Early Detection (RED)
model. Unfortunately, these enhancements do not react in a similar manner for
various network conditions and are strongly sensitive to their initial setting
parameters. Although this paper proposes a solution to overcome the
difficulties of setting these parameters by using a Kohonen neural network
model, another goal of this study is to investigate whether cognitive
intelligence could be placed in the core network to solve such stability
problem. In our context, we use results from the neural network area to
demonstrate that our proposal, named Kohonen-RED (KRED), enables a stable queue
length without complex parameters setting and passive measurements.
|
[
{
"version": "v1",
"created": "Thu, 16 Nov 2006 11:26:22 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Nov 2006 06:20:37 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Nov 2006 06:39:29 GMT"
},
{
"version": "v4",
"created": "Thu, 13 Dec 2007 16:08:25 GMT"
}
] | 2012-04-03T00:00:00 |
[
[
"Lochin",
"Emmanuel",
""
],
[
"Talavera",
"Bruno",
""
]
] |
new_dataset
| 0.973866 |
1203.6005
|
Benjamin Piwowarski
|
Benjamin Piwowarski
|
The Kernel Quantum Probabilities (KQP) Library
|
Describes the library available at http://kqp.bpiwowar.net/
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this document, we show how the different quantities necessary to compute
kernel quantum probabilities can be computed. This document form the basis of
the implementation of the Kernel Quantum Probability (KQP) open source project
|
[
{
"version": "v1",
"created": "Tue, 27 Mar 2012 15:57:59 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Mar 2012 18:49:36 GMT"
}
] | 2012-04-02T00:00:00 |
[
[
"Piwowarski",
"Benjamin",
""
]
] |
new_dataset
| 0.988777 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.