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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1206.4708
|
Serban Vlad E.
|
Serban E. Vlad
|
On the serial connection of the regular asynchronous systems
|
9 pages; ROMAI Journal, Vol. 7, Nr. 2, 2011
| null | null | null |
cs.GL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The asynchronous systems f are multi-valued functions, representing the
non-deterministic models of the asynchronous circuits from the digital
electrical engineering. In real time, they map an 'admissible input' function
u:R\rightarrow{0,1}^{m} to a set f(u) of 'possible states' x\inf(u), where
x:R\rightarrow{0,1}^{m}. When f is defined by making use of a 'generator
function' {\Phi}:{0,1}^{n}\times{0,1}^{m}\rightarrow{0,1}^{n}, the system is
called regular. The usual definition of the serial connection of systems as
composition of multi-valued functions does not bring the regular systems into
regular systems, thus the first issue in this study is to modify in an
acceptable manner the definition of the serial connection in a way that matches
regularity. This intention was expressed for the first time, without proving
the regularity of the serial connection of systems, in a previous work. Our
present purpose is to restate with certain corrections and prove that result.
|
[
{
"version": "v1",
"created": "Wed, 20 Jun 2012 20:14:13 GMT"
}
] | 2012-06-22T00:00:00 |
[
[
"Vlad",
"Serban E.",
""
]
] |
new_dataset
| 0.97834 |
1206.4522
|
Phil Gooch
|
Phil Gooch
|
BADREX: In situ expansion and coreference of biomedical abbreviations
using dynamic regular expressions
|
6 pages, 2 figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BADREX uses dynamically generated regular expressions to annotate term
definition-term abbreviation pairs, and corefers unpaired acronyms and
abbreviations back to their initial definition in the text. Against the
Medstract corpus BADREX achieves precision and recall of 98% and 97%, and
against a much larger corpus, 90% and 85%, respectively. BADREX yields improved
performance over previous approaches, requires no training data and allows
runtime customisation of its input parameters. BADREX is freely available from
https://github.com/philgooch/BADREX-Biomedical-Abbreviation-Expander as a
plugin for the General Architecture for Text Engineering (GATE) framework and
is licensed under the GPLv3.
|
[
{
"version": "v1",
"created": "Wed, 20 Jun 2012 15:06:48 GMT"
}
] | 2012-06-21T00:00:00 |
[
[
"Gooch",
"Phil",
""
]
] |
new_dataset
| 0.971976 |
1206.4531
|
Jaume Barcelo
|
Jaume Barcelo, Boris Bellalta, Cristina Cano, Azadeh Faridi, Miquel
Oliver
|
On the Distributed Construction of a Collision-Free Schedule in
Multi-Hop Packet Radio Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a protocol that distributively constructs a
collision-free schedule for multi-hop packet radio networks in the presence of
hidden terminals. As a preliminary step, each wireless station computes the
schedule length after gathering information about the number of flows in its
neighbourhood. Then, a combination of deterministic and random backoffs are
used to reach a collision-free schedule. A deterministic backoff is used after
successful transmissions and a random backoff is used otherwise. It is
explained that the short acknowledgement control packets can easily result in
channel time fragmentation and, to avoid this, the use of link layer delayed
acknowledgements is advocated and implemented. The performance results show
that a collision-free protocol easily outperforms a collision-prone protocol
such as Aloha. The time that is required for the network to converge to a
collision-free schedule is assessed by means of simulation.
|
[
{
"version": "v1",
"created": "Wed, 20 Jun 2012 15:25:54 GMT"
}
] | 2012-06-21T00:00:00 |
[
[
"Barcelo",
"Jaume",
""
],
[
"Bellalta",
"Boris",
""
],
[
"Cano",
"Cristina",
""
],
[
"Faridi",
"Azadeh",
""
],
[
"Oliver",
"Miquel",
""
]
] |
new_dataset
| 0.985209 |
1111.0654
|
Mojtaba Vaezi
|
Mojtaba Vaezi and Fabrice Labeau
|
Distributed Lossy Source Coding Using Real-Number Codes
|
5 pages, 5 figures, to appear in VTC_Fall 2012
| null | null | null |
cs.IT cs.CV cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how real-number codes can be used to compress correlated sources, and
establish a new framework for lossy distributed source coding, in which we
quantize compressed sources instead of compressing quantized sources. This
change in the order of binning and quantization blocks makes it possible to
model correlation between continuous-valued sources more realistically and
correct quantization error when the sources are completely correlated. The
encoding and decoding procedures are described in detail, for discrete Fourier
transform (DFT) codes. Reconstructed signal, in the mean squared error sense,
is seen to be better than that in the conventional approach.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 20:46:44 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Jun 2012 16:54:47 GMT"
}
] | 2012-06-20T00:00:00 |
[
[
"Vaezi",
"Mojtaba",
""
],
[
"Labeau",
"Fabrice",
""
]
] |
new_dataset
| 0.985934 |
1206.4126
|
Yousuf Ibrahim Khan
|
Yousuf Ibrahim Khan
|
Image based Cryptography from a distance
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An information is a message which is received and understood. Information can
be sent one person to another over a long range but the process of sending
information must be done in a secure way especially in case of a private
message. Mathematicians and Engineers have historically relied on different
algorithmic techniques to secure messages and signals. Cryptography, to most
people, is concerned with keeping communications private. Indeed, the
protection of sensitive communications has been the emphasis of cryptography
throughout much of its history. Sometimes it is safer to send a message using
an image and thus cryptography can also be done using images during an
emergency. The need to extract information from images and interpret their
contents has been one of the driving factors in the development of image
processing and cryptography during the past decades. In this paper, a simple
cryptographic method was used to decode a message which was in an image and it
was done using a popular computational software.
|
[
{
"version": "v1",
"created": "Tue, 19 Jun 2012 06:02:32 GMT"
}
] | 2012-06-20T00:00:00 |
[
[
"Khan",
"Yousuf Ibrahim",
""
]
] |
new_dataset
| 0.99515 |
1206.4185
|
Eliyahu Osherovich
|
Eliyahu Osherovich
|
Ant Robotics: Covering Continuous Domains by Multi-A(ge)nt Systems
| null | null | null |
MSC-2007-18
|
cs.RO cs.AI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we present an algorithm for covering continuous connected
domains by ant-like robots with very limited capabilities. The robots can mark
visited places with pheromone marks and sense the level of the pheromone in
their local neighborhood. In case of multiple robots these pheromone marks can
be sensed by all robots and provide the only way of (indirect) communication
between the robots. The robots are assumed to be memoryless, and to have no
global information such as the domain map, their own position (either absolute
or relative), total marked area percentage, maximal pheromone level, etc..
Despite the robots' simplicity, we show that they are able, by running a very
simple rule of behavior, to ensure efficient covering of arbitrary connected
domains, including non-planar and multidimensional ones. The novelty of our
algorithm lies in the fact that, unlike previously proposed methods, our
algorithm works on continuous domains without relying on some "induced"
underlying graph, that effectively reduces the problem to a discrete case of
graph covering. The algorithm guarantees complete coverage of any connected
domain. We also prove that the algorithm is noise immune, i.e., it is able to
cope with any initial pheromone profile (noise). In addition the algorithm
provides a bounded constant time between two successive visits of the robot,
and thus, is suitable for patrolling or surveillance applications.
|
[
{
"version": "v1",
"created": "Tue, 19 Jun 2012 12:00:47 GMT"
}
] | 2012-06-20T00:00:00 |
[
[
"Osherovich",
"Eliyahu",
""
]
] |
new_dataset
| 0.99022 |
1206.4226
|
Mahtab Mirmohseni Dr
|
Mahtab Mirmohseni, Bahareh Akhbari, and Mohammad Reza Aref
|
Three-User Cognitive Interference Channel: Capacity Region with Strong
Interference
|
To appear in IET Communications, 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study investigates the capacity region of a three-user cognitive radio
network with two primary users and one cognitive user. A three-user Cognitive
Interference Channel (C-IFC) is proposed by considering a three-user
Interference Channel (IFC) where one of the transmitters has cognitive
capabilities and knows the messages of the other two transmitters in a
non-causal manner. First, two inner bounds on the capacity region of the
three-user C-IFC are obtained based on using the schemes which allow all
receivers to decode all messages with two different orders. Next, two sets of
conditions are derived, under which the capacity region of the proposed model
coincides with the capacity region of a three-user C-IFC in which all three
messages are required at all receivers. Under these conditions, referred to as
strong interference conditions, the capacity regions for the proposed
three-user C-IFC are characterized. Moreover, the Gaussian three-user C-IFC is
considered and the capacity results are derived for the Gaussian case. Some
numerical examples are also provided.
|
[
{
"version": "v1",
"created": "Tue, 19 Jun 2012 14:39:18 GMT"
}
] | 2012-06-20T00:00:00 |
[
[
"Mirmohseni",
"Mahtab",
""
],
[
"Akhbari",
"Bahareh",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.994804 |
1201.2430
|
Li Tan
|
Li Tan
|
A Well-typed Lightweight Situation Calculus
|
In Proceedings of the 21st Workshop on Logic-based methods in
Programming Environments (WLPE'11), ICLP 2011 Workshop, pp. 62-73, Lexington,
Kentucky, USA, July 2011
| null | null | null |
cs.PL cs.AI
|
http://creativecommons.org/licenses/by/3.0/
|
Situation calculus has been widely applied in Artificial Intelligence related
fields. This formalism is considered as a dialect of logic programming language
and mostly used in dynamic domain modeling. However, type systems are hardly
deployed in situation calculus in the literature. To achieve a correct and
sound typed program written in situation calculus, adding typing elements into
the current situation calculus will be quite helpful. In this paper, we propose
to add more typing mechanisms to the current version of situation calculus,
especially for three basic elements in situation calculus: situations, actions
and objects, and then perform rigid type checking for existing situation
calculus programs to find out the well-typed and ill-typed ones. In this way,
type correctness and soundness in situation calculus programs can be guaranteed
by type checking based on our type system. This modified version of a
lightweight situation calculus is proved to be a robust and well-typed system.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2012 21:44:18 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jun 2012 23:18:40 GMT"
}
] | 2012-06-19T00:00:00 |
[
[
"Tan",
"Li",
""
]
] |
new_dataset
| 0.993006 |
1205.4378
|
Yu Zheng
|
Yin Zhu, Yu Zheng, Liuhang Zhang, Darshan Santani, Xing Xie, Qiang
Yang
|
Inferring Taxi Status Using GPS Trajectories
| null | null | null | null |
cs.AI cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we infer the statuses of a taxi, consisting of occupied,
non-occupied and parked, in terms of its GPS trajectory. The status information
can enable urban computing for improving a city's transportation systems and
land use planning. In our solution, we first identify and extract a set of
effective features incorporating the knowledge of a single trajectory,
historical trajectories and geographic data like road network. Second, a
parking status detection algorithm is devised to find parking places (from a
given trajectory), dividing a trajectory into segments (i.e.,
sub-trajectories). Third, we propose a two-phase inference model to learn the
status (occupied or non-occupied) of each point from a taxi segment. This model
first uses the identified features to train a local probabilistic classifier
and then carries out a Hidden Semi-Markov Model (HSMM) for globally considering
long term travel patterns. We evaluated our method with a large-scale
real-world trajectory dataset generated by 600 taxis, showing the advantages of
our method over baselines.
|
[
{
"version": "v1",
"created": "Sun, 20 May 2012 03:24:25 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jun 2012 08:15:27 GMT"
}
] | 2012-06-19T00:00:00 |
[
[
"Zhu",
"Yin",
""
],
[
"Zheng",
"Yu",
""
],
[
"Zhang",
"Liuhang",
""
],
[
"Santani",
"Darshan",
""
],
[
"Xie",
"Xing",
""
],
[
"Yang",
"Qiang",
""
]
] |
new_dataset
| 0.998777 |
1206.3562
|
Chunbao Ding
|
Chunbao Ding, Wanrong Zhang, Dongyue Jin, Hongyun Xie, Pei Shen, Liang
Chen
|
A Novel Low Power UWB Cascode SiGe BiCMOS LNA with Current Reuse and
Zero-Pole Cancellation
|
7 pages, 13 figures
| null | null | null |
cs.OH physics.ins-det
|
http://creativecommons.org/licenses/by/3.0/
|
A low power cascode SiGe BiCMOS low noise amplifier (LNA) with current reuse
and zero-pole cancellation is presented for ultra-wideband (UWB) application.
The LNA is composed of cascode input stage and common emitter (CE) output stage
with dual loop feedbacks. The novel cascode-CE current reuse topology replaces
the traditional two stages topology so as to obtain low power consumption. The
emitter degenerative inductor in input stage is adopted to achieve good input
impedance matching and noise performance. The two poles are introduced by the
emitter inductor, which will degrade the gain performance, are cancelled by the
dual loop feedbacks of the resistance-inductor (RL) shunt-shunt feedback and
resistance-capacitor (RC) series-series feedback in the output stage.
Meanwhile, output impedance matching is also achieved. Based on TSMC 0.35{\mu}m
SiGe BiCMOS process, the topology and chip layout of the proposed LNA are
designed and post-simulated. The LNA achieves the noise figure of 2.3~4.1dB,
gain of 18.9~20.2dB, gain flatness of \pm0.65dB, input third order intercept
point (IIP3) of -7dBm at 6GHz, exhibits less than 16ps of group delay
variation, good input and output impedances matching, and unconditionally
stable over the whole band. The power consuming is only 18mW.
|
[
{
"version": "v1",
"created": "Fri, 15 Jun 2012 02:53:12 GMT"
}
] | 2012-06-19T00:00:00 |
[
[
"Ding",
"Chunbao",
""
],
[
"Zhang",
"Wanrong",
""
],
[
"Jin",
"Dongyue",
""
],
[
"Xie",
"Hongyun",
""
],
[
"Shen",
"Pei",
""
],
[
"Chen",
"Liang",
""
]
] |
new_dataset
| 0.99885 |
1206.3881
|
Alessandro Rozza
|
Claudio Ceruti and Simone Bassis and Alessandro Rozza and Gabriele
Lombardi and Elena Casiraghi and Paola Campadelli
|
DANCo: Dimensionality from Angle and Norm Concentration
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last decades the estimation of the intrinsic dimensionality of a
dataset has gained considerable importance. Despite the great deal of research
work devoted to this task, most of the proposed solutions prove to be
unreliable when the intrinsic dimensionality of the input dataset is high and
the manifold where the points lie is nonlinearly embedded in a higher
dimensional space. In this paper we propose a novel robust intrinsic
dimensionality estimator that exploits the twofold complementary information
conveyed both by the normalized nearest neighbor distances and by the angles
computed on couples of neighboring points, providing also closed-forms for the
Kullback-Leibler divergences of the respective distributions. Experiments
performed on both synthetic and real datasets highlight the robustness and the
effectiveness of the proposed algorithm when compared to state of the art
methodologies.
|
[
{
"version": "v1",
"created": "Mon, 18 Jun 2012 10:33:29 GMT"
}
] | 2012-06-19T00:00:00 |
[
[
"Ceruti",
"Claudio",
""
],
[
"Bassis",
"Simone",
""
],
[
"Rozza",
"Alessandro",
""
],
[
"Lombardi",
"Gabriele",
""
],
[
"Casiraghi",
"Elena",
""
],
[
"Campadelli",
"Paola",
""
]
] |
new_dataset
| 0.97015 |
1206.3999
|
C\'edric Bentz
|
C\'edric Bentz
|
A polynomial-time algorithm for planar multicuts with few source-sink
pairs
|
11 pages, 1 figure
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given an edge-weighted undirected graph and a list of k source-sink pairs of
vertices, the well-known minimum multicut problem consists in selecting a
minimum-weight set of edges whose removal leaves no path between every source
and its corresponding sink. We give the first polynomial-time algorithm to
solve this problem in planar graphs, when k is fixed. Previously, this problem
was known to remain NP-hard in general graphs with fixed k, and in trees with
arbitrary k; the most noticeable tractable case known so far was in planar
graphs with fixed k and sources and sinks lying on the outer face.
|
[
{
"version": "v1",
"created": "Mon, 18 Jun 2012 17:32:34 GMT"
}
] | 2012-06-19T00:00:00 |
[
[
"Bentz",
"Cédric",
""
]
] |
new_dataset
| 0.98682 |
1206.3138
|
Ashish Khisti
|
Ashish Khisti, Brett Hern, and Krishna Narayanan
|
On Modulo-Sum Computation over an Erasure Multiple Access Channel
|
Shorter Version will Appear at ISIT 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study computation of a modulo-sum of two binary source sequences over a
two-user erasure multiple access channel. The channel is modeled as a
binary-input, erasure multiple access channel, which can be in one of three
states - either the channel output is a modulo-sum of the two input symbols, or
the channel output equals the input symbol on the first link and an erasure on
the second link, or vice versa. The associated state sequence is independent
and identically distributed. We develop a new upper bound on the sum-rate by
revealing only part of the state sequence to the transmitters. Our coding
scheme is based on the compute and forward and the decode and forward
techniques. When a (strictly) causal feedback of the channel state is available
to the encoders, we show that the modulo-sum capacity is increased. Extensions
to the case of lossy reconstruction of the modulo-sum and to channels involving
additional states are also treated briefly.
|
[
{
"version": "v1",
"created": "Thu, 14 Jun 2012 15:23:23 GMT"
}
] | 2012-06-15T00:00:00 |
[
[
"Khisti",
"Ashish",
""
],
[
"Hern",
"Brett",
""
],
[
"Narayanan",
"Krishna",
""
]
] |
new_dataset
| 0.991858 |
1206.2914
|
Thiyagarajan P
|
P. Thiyagarajan, G. Aghila, V. Prasanna Venkatesan
|
Steganalysis Using Color Model Conversion
|
arXiv admin note: substantial text overlap with arXiv:1206.2586
|
Thiyagarajan P, Aghila G, Prasanna Venkatesan V, "Steganalysis
using Color Model Conversion", Signal and Image Processing: An International
Journal (SIPIJ) ISSN 0976-710x Volume 2, No 4 December 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The major threat in cyber crime for digital forensic examiner is to identify,
analyze and interpret the concealed information inside digital medium such as
image, audio and video. There are strong indications that hiding information
inside digital medium has been used for planning criminal activities. In this
way, it is important to develop a steganalysis technique which detects the
existence of hidden messages inside digital medium. This paper focuses on
universal image steganalysis method which uses RGB to HSI colour model
conversion. Any Universal Steganalysis algorithm developed should be tested
with various stego-images to prove its efficiency. The developed Universal
Steganalysis algorithm is tested in stego-image database which is obtained by
implementing various RGB Least Significant Bit Steganographic algorithms.
Though there are many stego-image sources available on the internet it lacks in
the information such as how many rows has been infected by the steganography
algorithms, how many bits have been modified and which channel has been
affected. These parameters are important for Steganalysis algorithms and it
helps to rate its efficiency. Proposed Steganalysis using Colour Model has been
tested with our Image Database and the results were affirmative.
|
[
{
"version": "v1",
"created": "Tue, 12 Jun 2012 06:59:51 GMT"
}
] | 2012-06-14T00:00:00 |
[
[
"Thiyagarajan",
"P.",
""
],
[
"Aghila",
"G.",
""
],
[
"Venkatesan",
"V. Prasanna",
""
]
] |
new_dataset
| 0.979803 |
1206.0142
|
Hicham Elasri
|
Hicham Elasri, Neknane Mehdi, Aatab Jamila and Ganoun Karima
|
Open source based cadastral information system : ANCFCC-MOROCCO
|
International conference of GIS users, May 23-24, 2012, Fez (Morocco)
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
This present project is developing a geographic information system to support
the cadastral business. This system based on open source solutions which
developed within the National Agency of Land Registry, Cadastre and Cartography
(ANCFCC) enabling monitoring and analysis of cadastral procedures as well as
offering consumable services by other information systems: consultation and
querying spatial data. The project will also assist the various user profiles
in the completion of production tasks and the possibility to eliminate the
deficiencies identified to ensure an optimum level of productivity
|
[
{
"version": "v1",
"created": "Fri, 1 Jun 2012 10:42:20 GMT"
}
] | 2012-06-13T00:00:00 |
[
[
"Elasri",
"Hicham",
""
],
[
"Mehdi",
"Neknane",
""
],
[
"Jamila",
"Aatab",
""
],
[
"Karima",
"Ganoun",
""
]
] |
new_dataset
| 0.993118 |
1206.0549
|
Achim Hekler
|
Achim Hekler, J\"org Fischer, Uwe D. Hanebeck
|
Sequence-Based Control for Networked Control Systems Based on Virtual
Control Inputs
| null | null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of controlling a system over an
unreliable connection that is affected by time-varying delays and randomly
occurring packet losses. A novel sequence-based approach is proposed that
extends a given controller designed without consideration of the
network-induced disturbances. Its key idea is to model the unknown future
control inputs by random variables, the so-called virtual control inputs, which
are characterized by discrete probability density functions. Subject to this
probabilistic description, the actual sequence of future control inputs is
determined and transmitted to the actuator. The high performance of the
proposed approach is demonstrated by means of Monte Carlo simulation runs with
an inverted pendulum on a cart and by a detailed comparison to standard NCS
approaches.
|
[
{
"version": "v1",
"created": "Mon, 4 Jun 2012 08:56:35 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jun 2012 08:11:21 GMT"
}
] | 2012-06-13T00:00:00 |
[
[
"Hekler",
"Achim",
""
],
[
"Fischer",
"Jörg",
""
],
[
"Hanebeck",
"Uwe D.",
""
]
] |
new_dataset
| 0.968236 |
1206.2544
|
Shah Mahmood Mr.
|
Shah Mahmood and Ismatullah Nazar
|
Education in Conflict Zones: a Web and Mobility Approach
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new framework for education in conflict zones, considering the
explosive growth of social media, web services, and mobile Internet over the
past decade. Moreover, we focus on one conflict zone, Afghanistan, as a case
study, because of its alarmingly high illiteracy rate, lack of qualified
teachers, rough terrain, and relatively high mobile penetration of over 50%. In
several of Afghanistan's provinces, it is hard to currently sustain the
traditional bricks-and-mortar school model, due to numerous incidents of
schools, teachers, and students being attacked because of the ongoing
insurgency and political instability. Our model improves the virtual school
model, by addressing most of its disadvantages, to provide students in
Afghanistan with an opportunity to achieve standardised education, even when
the security situation does not allow them to attend traditional schools. One
of the biggest advantages of this model is that it is sufficiently robust to
deal with gender discrimination, imposed by culture or politics of the region.
|
[
{
"version": "v1",
"created": "Tue, 12 Jun 2012 14:32:55 GMT"
}
] | 2012-06-13T00:00:00 |
[
[
"Mahmood",
"Shah",
""
],
[
"Nazar",
"Ismatullah",
""
]
] |
new_dataset
| 0.998745 |
1206.2583
|
Thiyagarajan P
|
P. Thiyagarajan, G. Aghila, V. Prasanna Venkatesan
|
Dynamic Pattern Based Image Steganography
|
Journal of Computing ISSN 2151-9617, Volume 3, Issue 2 February 2011
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Steganography is the art of hiding secret information in media such as image,
audio and video. The purpose of steganography is to conceal the existence of
the secret information in any given medium. This work aims at strengthening the
security in steganography algorithm by generating dynamic pattern in selection
of indicator sequence. In addition to this dynamicity is also encompassed in
number of bits embedded in data channel. This technique has been implemented
and the results have been compared and evaluated with existing similar
techniques.
|
[
{
"version": "v1",
"created": "Tue, 12 Jun 2012 16:38:29 GMT"
}
] | 2012-06-13T00:00:00 |
[
[
"Thiyagarajan",
"P.",
""
],
[
"Aghila",
"G.",
""
],
[
"Venkatesan",
"V. Prasanna",
""
]
] |
new_dataset
| 0.974359 |
1206.1918
|
Sugata Sanyal
|
Preetida Vinayakray-Jani, Sugata Sanyal
|
Routing Protocols for Mobile and Vehicular Ad-Hoc Networks: A
Comparative Analysis
|
7 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present comparative analysis of MANET (Mobile Ad-Hoc Network) and VANET
(Vehicular Ad-Hoc Network) routing protocols, in this paper. The analysis is
based on various design factors. The traditional routing protocols of AODV (Ad
hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and DSDV
(Destination-Sequenced Distance-Vector) of MANET are utilizing node centric
routing which leads to frequent breaking of routes, causing instability in
routing. Usage of these protocols in high mobility environment like VANET may
eventually cause many packets to drop. Route repairs and failures notification
overheads increase significantly leading to low throughput and long delays.
Such phenomenon is not suitable for Vehicular Ad hoc Networks (VANET) due to
high mobility of nodes where network can be dense or sparse. Researchers have
proposed various routing algorithms or mechanism for MANET and VANET. This
paper describes the relevant protocols, associated algorithm and the strength
and weakness of these routing protocols.
|
[
{
"version": "v1",
"created": "Sat, 9 Jun 2012 09:05:19 GMT"
}
] | 2012-06-12T00:00:00 |
[
[
"Vinayakray-Jani",
"Preetida",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.994789 |
1206.2132
|
Lei Li
|
Lei Li, Tianshi Chen, Yunji Chen, Ling Li, and Ruiyang Wu
|
RepTFD: Replay Based Transient Fault Detection
|
22 pages, 11 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advances in IC process make future chip multiprocessors (CMPs) more and
more vulnerable to transient faults. To detect transient faults, previous
core-level schemes provide redundancy for each core separately. As a result,
they may leave transient faults in the uncore parts, which consume over 50%
area of a modern CMP, escaped from detection. This paper proposes RepTFD, the
first core-level transient fault detection scheme with 100% coverage. Instead
of providing redundancy for each core separately, RepTFD provides redundancy
for a group of cores as a whole. To be specific, it replays the execution of
the checked group of cores on a redundant group of cores. Through comparing the
execution results between the two groups of cores, all malignant transient
faults can be caught. Moreover, RepTFD adopts a novel pending period based
record-replay approach, which can greatly reduce the number of execution orders
that need to be enforced in the replay-run. Hence, RepTFD brings only 4.76%
performance overhead in comparison to the normal execution without
fault-tolerance according to our experiments on the RTL design of an industrial
CMP named Godson-3. In addition, RepTFD only consumes about 0.83% area of
Godson-3, while needing only trivial modifications to existing components of
Godson-3.
|
[
{
"version": "v1",
"created": "Mon, 11 Jun 2012 08:50:37 GMT"
}
] | 2012-06-12T00:00:00 |
[
[
"Li",
"Lei",
""
],
[
"Chen",
"Tianshi",
""
],
[
"Chen",
"Yunji",
""
],
[
"Li",
"Ling",
""
],
[
"Wu",
"Ruiyang",
""
]
] |
new_dataset
| 0.994627 |
1206.2320
|
YenFu Ou
|
Yen-Fu Ou, Yuanyi Xue, Yao Wang
|
Q-STAR:A Perceptual Video Quality Model Considering Impact of Spatial,
Temporal, and Amplitude Resolutions
|
13 pages
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the impact of spatial, temporal and amplitude
resolution (STAR) on the perceptual quality of a compressed video. Subjective
quality tests were carried out on a mobile device. Seven source sequences are
included in the tests and for each source sequence we have 27 test
configurations generated by JSVM encoder (3 QP levels, 3 spatial resolutions,
and 3 temporal resolutions), resulting a total of 189 processed video sequences
(PVSs). Videos coded at different spatial resolutions are displayed at the full
screen size of the mobile platform. Subjective data reveal that the impact of
spatial resolution (SR), temporal resolution (TR) and quantization stepsize
(QS) can each be captured by a function with a single content-dependent
parameter. The joint impact of SR, TR and QS can be accurately modeled by the
product of these three functions with only three parameters. We further find
that the quality decay rates with SR and QS, respectively are independent of
TR, and likewise, the decay rate with TR is independent of SR and QS,
respectively. However, there is a significant interaction between the effects
of SR and QS. The overall quality model is further validated on five other
datasets with very high accuracy. The complete model correlates well with the
subjective ratings with a Pearson Correlation Coefficient (PCC) of 0.991.
|
[
{
"version": "v1",
"created": "Mon, 11 Jun 2012 19:06:07 GMT"
}
] | 2012-06-12T00:00:00 |
[
[
"Ou",
"Yen-Fu",
""
],
[
"Xue",
"Yuanyi",
""
],
[
"Wang",
"Yao",
""
]
] |
new_dataset
| 0.988593 |
1206.2322
|
Yipeng Liu Dr.
|
Rong Fan, Qun Wan, Xiao Zhang, Hui Chen, Yipeng Liu
|
A Fast HRRP Synthesis Algorithm with Sensing Dictionary in GTD Model
|
16 pages, 8 figures, 2 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To achieve high range resolution profile (HRRP), the geometric theory of
diffraction (GTD) parametric model is widely used in stepped-frequency radar
system. In the paper, a fast synthetic range profile algorithm, called
orthogonal matching pursuit with sensing dictionary (OMP-SD), is proposed. It
formulates the traditional HRRP synthetic to be a sparse approximation problem
over redundant dictionary. As it employs a priori information that targets are
sparsely distributed in the range space, the synthetic range profile (SRP) can
be accomplished even in presence of data lost. Besides, the computational
complexity is reduced by introducing sensing dictionary (SD) and it mitigates
the model mismatch at the same time. The computation complexity decreases from
O(MNDK) flops for OMP to O(M(N +D)K) flops for OMP-SD. Simulation experiments
illustrate its advantages both in additive white Gaussian noise (AWGN) and
noiseless situation, respectively.
|
[
{
"version": "v1",
"created": "Mon, 11 Jun 2012 19:11:32 GMT"
}
] | 2012-06-12T00:00:00 |
[
[
"Fan",
"Rong",
""
],
[
"Wan",
"Qun",
""
],
[
"Zhang",
"Xiao",
""
],
[
"Chen",
"Hui",
""
],
[
"Liu",
"Yipeng",
""
]
] |
new_dataset
| 0.996705 |
1206.1618
|
Ahmed Dooguy Kora
|
Ahmed Dooguy Kora
|
DWDM/OOC and large spectrum sources performance in broadband access
network
|
(IJDPS) Vol.3, No.3, May 2012, International Journal of Distributed
and Parallel Systems (IJDPS) Vol.3, No.3, May 2012
| null |
10.5121/ijdps.2012.3317
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a performance evaluation based on elaborated analytical
expressions of error probability for broadband access network in the case of a
combined technique of dense wavelength division multiplexing (DWDM) and one
dimensional optical orthogonal codes (1D-OOC). Optical sources with relatively
large spectrum has been considered and simulated. Besides the Multiple Access
Interference (MAI) at the receiver due to the access method which is optical
code division multiple access (OCDMA), the emitted radiation of these sources
in a dense WDM communication link introduces additional interference.
Conventional correlation receiver (CCR) and parallel interference cancellation
(PIC) receiver limitations are discussed. This paper has investigated the kind
of optical sources with large spectrum bandwidth which could be accepted for a
targeted bit error rate (BER) and given number of users in broadband access
network supporting DWDM with optical orthogonal codes.
|
[
{
"version": "v1",
"created": "Thu, 7 Jun 2012 21:06:15 GMT"
}
] | 2012-06-11T00:00:00 |
[
[
"Kora",
"Ahmed Dooguy",
""
]
] |
new_dataset
| 0.994355 |
1206.1674
|
Ankur Dumka Mr.
|
Ankur Dumka and Hardwari Lal Mandoria
|
Dynamic MPLS with Feedback
|
6 pages and 3 figures
|
International Journal of Computer Science, Engineering and
Applications (IJCSEA) Vol.2, No.2, April 2012, 125-130
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiprotocol Label Switching (MPLS) fasten the speed of packet forwarding by
forwarding the packets based on labels and reduces the use of routing table
look up from all routers to label edge routers(LER), where as the label switch
routers (LSRs) uses Label Distribution Protocol (LDP) or RSVP (Resource
reservation Protocol) for label allocation and Label table for packet
forwarding. Dynamic protocol is implemented which carries a Updates packets for
the details of Label Switch Paths, along with this feedback mechanism is also
introduced which find the shortest path among MPLS network and also feedback is
provided which also help to overcome congestion, this feedback mechanism is on
a hop by hop basis rather than end to end thus providing a more reliable and
much faster and congestion free path for the packets.
|
[
{
"version": "v1",
"created": "Fri, 8 Jun 2012 06:53:46 GMT"
}
] | 2012-06-11T00:00:00 |
[
[
"Dumka",
"Ankur",
""
],
[
"Mandoria",
"Hardwari Lal",
""
]
] |
new_dataset
| 0.999203 |
1206.1722
|
Surekha T.P
|
T.P. Surekha, T. Ananthapadmanabha, C. Puttamadappa
|
C-Band VSAT Data Communication System and RF Impairments
|
18 pages
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with modelling and simulation of VSAT (very small
aperture terminal) data messaging network operating in India at Karnataka with
extended C-band. VSATs in Karnataka of KPTCL use VSATS 6.875-6.9465G Hz uplinks
and 4.650- 4.7215 GHz downlinks. These frequencies are dedicated to fixed
services. The Satellite is Intelsat -3A, the hub has a 7.2 m diameter antenna
and uses 350W or 600W TWTA (Travelling wave Tube Amplifier). The VSAT's are 1.2
m with RF power of 1W or 2W depending on their position in the uplink beam with
data rate of 64 or 128 K bit/s. The performance of the system is analysed by
the error probability called BER (Bit Error Rate) and results are derived from
Earth station to hub and hub to Earth station using satellite Transponder as
the media of communication channel. The Link budgets are developed for a single
one-way satellite link.
|
[
{
"version": "v1",
"created": "Fri, 8 Jun 2012 10:37:57 GMT"
}
] | 2012-06-11T00:00:00 |
[
[
"Surekha",
"T. P.",
""
],
[
"Ananthapadmanabha",
"T.",
""
],
[
"Puttamadappa",
"C.",
""
]
] |
new_dataset
| 0.971079 |
1206.1833
|
Richard van de Stadt
|
Richard van de Stadt
|
CyberChair: A Web-Based Groupware Application to Facilitate the Paper
Reviewing Process
|
7 pages, 7 figures, created 29 May 2000, when I still worked at the
University of Twente, The Netherlands. The paper was submitted to a Python
conference and accepted, but due to a misunderstanding with my employer, I
had to withdraw the paper from the conference. The paper describes the public
version, called CyberChair, and not the commercial version called
CyberChairPRO
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe CyberChair, a web-based groupware application that
supports the review process for technical contributions to conferences.
CyberChair deals with most administrative tasks that are involved in the review
process, such as storing author information, abstracts, (camera-ready) papers
and reviews. It generates several overviews based on the reviews which support
the Program Committee (PC) in selecting the best papers. CyberChair points out
conflicting reviews and offers the reviewers means to easily communicate to
solve these conflicts. In his paper Identify the Champion, O. Nierstrasz
describes this review process in terms of a pattern language. CyberChair
supports PCs by using these patterns in its implementation.
|
[
{
"version": "v1",
"created": "Fri, 8 Jun 2012 18:19:01 GMT"
}
] | 2012-06-11T00:00:00 |
[
[
"van de Stadt",
"Richard",
""
]
] |
new_dataset
| 0.997188 |
1107.3438
|
Sudhir R. Ghorpade
|
Peter Beelen, Sudhir R. Ghorpade, Tom Hoeholdt
|
Duals of Affine Grassmann Codes and their Relatives
|
20 pages
|
IEEE Transactions on Information Theory, Vol. 58, No. 6 (2012),
pp. 3843-3855
|
10.1109/TIT.2012.2187171
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Affine Grassmann codes are a variant of generalized Reed-Muller codes and are
closely related to Grassmann codes. These codes were introduced in a recent
work [2]. Here we consider, more generally, affine Grassmann codes of a given
level. We explicitly determine the dual of an affine Grassmann code of any
level and compute its minimum distance. Further, we ameliorate the results of
[2] concerning the automorphism group of affine Grassmann codes. Finally, we
prove that affine Grassmann codes and their duals have the property that they
are linear codes generated by their minimum-weight codewords. This provides a
clean analogue of a corresponding result for generalized Reed-Muller codes.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2011 14:05:15 GMT"
}
] | 2012-06-07T00:00:00 |
[
[
"Beelen",
"Peter",
""
],
[
"Ghorpade",
"Sudhir R.",
""
],
[
"Hoeholdt",
"Tom",
""
]
] |
new_dataset
| 0.989098 |
1206.1312
|
Joseph O'Rourke
|
Stephanie Jakus and Joseph O'Rourke
|
From Pop-Up Cards to Coffee-Cup Caustics: The Knight's Visor
|
12 pages, 13 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a pedagogical exercise, we derive the shape of a particularly elegant
pop-up card design, and show that it connects to a classically studied plane
curve that is (among other interpretations) a caustic of a circle.
|
[
{
"version": "v1",
"created": "Wed, 6 Jun 2012 19:38:53 GMT"
}
] | 2012-06-07T00:00:00 |
[
[
"Jakus",
"Stephanie",
""
],
[
"O'Rourke",
"Joseph",
""
]
] |
new_dataset
| 0.971445 |
1206.0805
|
Gelasio Salazar
|
J\'ozsef Balogh, Hern\'an Gonz\'alez-Aguilar, and Gelasio Salazar
|
Large convex holes in random point sets
| null | null | null | null |
cs.CG math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the
plane is a convex polygon with vertices in $P$, containing no points of $P$ in
its interior. Let $R$ be a bounded convex region in the plane. We show that the
expected number of vertices of the largest convex hole of a set of $n$ random
points chosen independently and uniformly over $R$ is
$\Theta(\log{n}/(\log{\log{n}}))$, regardless of the shape of $R$.
|
[
{
"version": "v1",
"created": "Tue, 5 Jun 2012 01:00:18 GMT"
}
] | 2012-06-06T00:00:00 |
[
[
"Balogh",
"József",
""
],
[
"González-Aguilar",
"Hernán",
""
],
[
"Salazar",
"Gelasio",
""
]
] |
new_dataset
| 0.998217 |
1206.0848
|
M Sinaie
|
Hashem Moradmand Ziyabar, Mahnaz Sinaie, Ali Payandeh, Vahid Tabataba
Vakili
|
Secure FSM- based arithmetic codes
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, arithmetic coding has attracted the attention of many scholars
because of its high compression capability. Accordingly, in this paper a method
which adds secrecy to this well-known source code is proposed. Finite state
arithmetic code (FSAC) is used as source code to add security. Its finite state
machine (FSM) characteristic is exploited to insert some random jumps during
source coding process. In addition, a Huffman code is designed for each state
to make decoding possible even in jumps. Being Prefix free, Huffman codes are
useful in tracking correct states for an authorized user when s/he decodes with
correct symmetric pseudo random key. The robustness of our proposed scheme is
further reinforced by adding another extra uncertainty by swapping outputs of
Huffman codes in each state. Several test images are used for inspecting the
validity of the proposed Huffman Finite State Arithmetic Coding (HFSAC). The
results of several experimental, key space analyses, statistical analysis, key
sensitivity and plaintext sensitivity tests show that HFSAC with a little
effect on compression efficiency for image cryptosystem provides an efficient
and secure way for real-time image encryption and transmission.
|
[
{
"version": "v1",
"created": "Tue, 5 Jun 2012 09:08:47 GMT"
}
] | 2012-06-06T00:00:00 |
[
[
"Ziyabar",
"Hashem Moradmand",
""
],
[
"Sinaie",
"Mahnaz",
""
],
[
"Payandeh",
"Ali",
""
],
[
"Vakili",
"Vahid Tabataba",
""
]
] |
new_dataset
| 0.999545 |
1206.0978
|
Sanjay Singh
|
Pradeep B. H. and Sanjay Singh
|
Privacy Preserving and Ownership Authentication in Ubiquitous Computing
Devices using Secure Three Way Authentication
|
13 pages, 4 figures, presented at IIT'12, Al Ain, UAE
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In todays world of technology and gadgets almost every person is having a
portable device, be it a laptop or the smart phones. The user would like to
have all the services at his fingertips and access them through the portable
device he owns. Maybe he wants some data from the fellow user or from the
service provider or maybe he wants to control his smart devices at home from
wherever he is. In the present era of mobile environments, interactions between
the user device and the service provider must be secure enough regardless of
the type of device used to access or utilize the services. In this paper we
propose a "Secure Three Way Authentication (STWA)" technique intended to
preserve the user privacy and to accomplish ownership authentication in order
to securely deliver the services to the user devices. This technique will also
help the users or the service providers to check if the device is compromised
or not with the help of the encrypted pass-phrases that are being exchanged.
|
[
{
"version": "v1",
"created": "Tue, 5 Jun 2012 16:17:14 GMT"
}
] | 2012-06-06T00:00:00 |
[
[
"H.",
"Pradeep B.",
""
],
[
"Singh",
"Sanjay",
""
]
] |
new_dataset
| 0.990736 |
1206.0995
|
Mahsa Shirmohammadi
|
Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
|
Infinite Synchronizing Words for Probabilistic Automata (Erratum)
|
5 pages, 3 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In [1], we introduced the weakly synchronizing languages for probabilistic
automata. In this report, we show that the emptiness problem of weakly
synchronizing languages for probabilistic automata is undecidable. This implies
that the decidability result of [1-3] for the emptiness problem of weakly
synchronizing language is incorrect.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 17:54:53 GMT"
}
] | 2012-06-06T00:00:00 |
[
[
"Doyen",
"Laurent",
""
],
[
"Massart",
"Thierry",
""
],
[
"Shirmohammadi",
"Mahsa",
""
]
] |
new_dataset
| 0.957479 |
1004.0777
|
arXiv Admin
|
Kamaljit Lakhtaria (1), Bhaskar N. Patel (2), Satish G. Prajapati (2),
N. N. Jani (3),((1) Rajkot Gujarat, India,(2) Ganpat Vidyanagar, Kherava,
Gujarat, India,(3) Kadi Vishvadiva Vidyalaya (Deemed University), S K Patel
Gandhinagar, India)
|
Securing AODV for MANETs using Message Digest with Secret Key
|
This article has been withdrawn by arXiv admins because it contains
plagiarized content from International Conference on Computer Networks and
Security (ICCNS 2008, September 27-28, 2008): "Securing AODV for MANETs using
Message Digest with Secret Key", by Sunil J. Soni and Prashant B. Swadas
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This article has been withdrawn by arXiv admins because it contains
plagiarized content from International Conference on Computer Networks and
Security (ICCNS 2008, September 27-28, 2008): "Securing AODV for MANETs using
Message Digest with Secret Key", by Sunil J. Soni and Prashant B. Swadas.
|
[
{
"version": "v1",
"created": "Tue, 6 Apr 2010 05:49:56 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Jun 2012 15:14:26 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Lakhtaria",
"Kamaljit",
""
],
[
"Patel",
"Bhaskar N.",
""
],
[
"Prajapati",
"Satish G.",
""
],
[
"Jani",
"N. N.",
""
]
] |
new_dataset
| 0.970361 |
1109.2613
|
Xiaomeng Shi
|
Xiaomeng Shi, Muriel Medard, Daniel E. Lucani
|
Whether and Where to Code in the Wireless Relay Channel
|
11 pages, 12 figures, to be published in the IEEE JSAC Special Issue
on Theories and Methods for Advanced Wireless Relays
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The throughput benefits of random linear network codes have been studied
extensively for wirelined and wireless erasure networks. It is often assumed
that all nodes within a network perform coding operations. In
energy-constrained systems, however, coding subgraphs should be chosen to
control the number of coding nodes while maintaining throughput. In this paper,
we explore the strategic use of network coding in the wireless packet erasure
relay channel according to both throughput and energy metrics. In the relay
channel, a single source communicates to a single sink through the aid of a
half-duplex relay. The fluid flow model is used to describe the case where both
the source and the relay are coding, and Markov chain models are proposed to
describe packet evolution if only the source or only the relay is coding. In
addition to transmission energy, we take into account coding and reception
energies. We show that coding at the relay alone while operating in a rateless
fashion is neither throughput nor energy efficient. Given a set of system
parameters, our analysis determines the optimal amount of time the relay should
participate in the transmission, and where coding should be performed.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2011 20:15:27 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jun 2012 21:26:51 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Shi",
"Xiaomeng",
""
],
[
"Medard",
"Muriel",
""
],
[
"Lucani",
"Daniel E.",
""
]
] |
new_dataset
| 0.992397 |
1202.5282
|
Mohammad Iftekhar Husain
|
Mohammad Iftekhar Husain, Lokesh Mandvekar, Chunming Qiao, Ramalingam
Sridhar
|
How to Bypass Verified Boot Security in Chromium OS
|
Update information about Chromium OS. Added new and advanced
exploits. Added mitigation techniques and evaluation
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Verified boot is an interesting feature of Chromium OS that supposedly can
detect any modification in the root file system (rootfs) by a dedicated
adversary. However, by exploiting a design flaw in verified boot, we show that
an adversary can replace the original rootfs by a malicious rootfs containing
exploits such as a spyware or keylogger and still pass the verified boot
process. The exploit is based on the fact that a dedicated adversary can
replace the rootfs and the corresponding verification information in the
bootloader. We experimentally demonstrate an attack using both the base and
developer version of Chromium OS in which the adversary installs a spyware in
the target system to send cached user data to the attacker machine in plain
text which are otherwise encrypted, and thus inaccessible. We also demonstrate
techniques to mitigate this vulnerability.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2012 20:12:00 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Jun 2012 15:56:26 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Husain",
"Mohammad Iftekhar",
""
],
[
"Mandvekar",
"Lokesh",
""
],
[
"Qiao",
"Chunming",
""
],
[
"Sridhar",
"Ramalingam",
""
]
] |
new_dataset
| 0.998936 |
1204.6325
|
Konstantinos Chorianopoulos
|
Konstantinos Chorianopoulos, Vassiliki Tsaknaki
|
CELL: Connecting Everyday Life in an archipeLago
|
This paper has been withdrawn by the author due to some errors
| null | null | null |
cs.HC cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore the design of a seamless broadcast communication system that
brings together the distributed community of remote secondary education
schools. In contrast to higher education, primary and secondary education
establishments should remain distributed, in order to maintain a balance of
urban and rural life in the developing and the developed world. We plan to
deploy an ambient and social interactive TV platform (physical installation,
authoring tools, interactive content) that supports social communication in a
positive way. In particular, we present the physical design and the conceptual
model of the system.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2012 20:10:16 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Jun 2012 08:45:46 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Chorianopoulos",
"Konstantinos",
""
],
[
"Tsaknaki",
"Vassiliki",
""
]
] |
new_dataset
| 0.998101 |
1206.0381
|
Shamim Ripon
|
Md. Nawab Yousuf Ali, Shamim Ripon and Shaikh Muhammad Allayear
|
UNL Based Bangla Natural Text Conversion - Predicate Preserving Parser
Approach
|
7 pages, International Journal of Computer Science Issues (IJCSI),
Volume 9, Issue 3 May 2012
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Universal Networking Language (UNL) is a declarative formal language that is
used to represent semantic data extracted from natural language texts. This
paper presents a novel approach to converting Bangla natural language text into
UNL using a method known as Predicate Preserving Parser (PPP) technique. PPP
performs morphological, syntactic and semantic, and lexical analysis of text
synchronously. This analysis produces a semantic-net like structure represented
using UNL. We demonstrate how Bangla texts are analyzed following the PPP
technique to produce UNL documents which can then be translated into any other
suitable natural language facilitating the opportunity to develop a universal
language translation method via UNL.
|
[
{
"version": "v1",
"created": "Sat, 2 Jun 2012 13:23:18 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Ali",
"Md. Nawab Yousuf",
""
],
[
"Ripon",
"Shamim",
""
],
[
"Allayear",
"Shaikh Muhammad",
""
]
] |
new_dataset
| 0.954497 |
1206.0420
|
Gopalakrishnan Tr Nair
|
Mary Cherian, T. R. Gopalakrishnan Nair
|
Multipath Routing With Novel Packet Scheduling Approach In Wireless
Sensor Networks
|
pages 5, figures 5, ISSN: 1793-821X (Online Version); 1793-8201
(Print Version), International Journal of Computer Theory and Engineering,
Vol. 3, No. 5, October 2011,pp. 666-670
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks sense and monitor real-time events. They supervise a
geographic area where a phenomenon is to be monitored. The data in sensor
networks have different levels of priority and hence their criticality differs.
In order to keep up the real time commitment, the applications need higher
transmission rates and reliability in information delivery. In this work we
propose a multipath routing algorithm which enables the reliable delivery of
data. By controlling the scheduling rate, it is possible to prevent congestion
and packet loss in the network. The algorithm provides an efficient way to
prevent the packet loss at each node. This results in congestion management in
the sensor networks. This protocol prevents packet clustering and provides
smoothness to the traffic. Through monitoring and controlling the scheduling
rate the flow control and congestion control are managed.
|
[
{
"version": "v1",
"created": "Sun, 3 Jun 2012 04:54:18 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Cherian",
"Mary",
""
],
[
"Nair",
"T. R. Gopalakrishnan",
""
]
] |
new_dataset
| 0.997709 |
1206.0514
|
Taylor Gordon
|
Taylor Gordon
|
Simultaneous Embeddings with Vertices Mapping to Pre-Specified Points
|
12 pages (plus appendix), 7 figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the problem of embedding graphs in the plane with restrictions on
the vertex mapping. In particular, we introduce a technique for drawing planar
graphs with a fixed vertex mapping that bounds the number of times edges bend.
An immediate consequence of this technique is that any planar graph can be
drawn with a fixed vertex mapping so that edges map to piecewise linear curves
with at most $3n + O(1)$ bends each. By considering uniformly random planar
graphs, we show that $2n + O(1)$ bends per edge is sufficient on average.
To further utilize our technique, we consider simultaneous embeddings of $k$
uniformly random planar graphs with vertices mapping to a fixed, common point
set. We explain how to achieve such a drawing so that edges map to piecewise
linear curves with $O(n^{1-1/k})$ bends each, which holds with overwhelming
probability. This result improves upon the previously best known result of O(n)
bends per edge for the case where $k \geq 2$. Moreover, we give a lower bound
on the number of bends that matches our upper bound, proving our results are
optimal.
|
[
{
"version": "v1",
"created": "Mon, 4 Jun 2012 04:06:13 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Gordon",
"Taylor",
""
]
] |
new_dataset
| 0.973071 |
1206.0604
|
Adrian Glaubitz
|
John Paul Adrian Glaubitz
|
Modern consumerism and the waste problem
|
8 pages, 4 images
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advance of industrial mass production, modern micro-electronics and
computers, the intervals between the release of new generations of consumer
products have been dramatically reduced and so have their lifetime cycles.
While it was very natural in the post-war era, that sophisticated consumer
products like television sets and stereo equipment would not be replaced with a
new product until they break, and usually beyond that point since it was very
common to have a broken television set serviced, the habits of consumers have
changed during the last quarter of the 20th century.
A modern consumer product, like Apple's famous iPhone has a market life of
approximately one year until a successor is announced and subsequently pushed
into the market. Usually these new generations bring a bunch of new features,
have a higher performance while maintaining the price or becoming even cheaper,
thus the consumer greatly benefits from the reduced lifetime cycle of these
products.
However, electronic devices not only require a lot of of Earth's limited
resources for their production, but their production processes are a major
source for harmful climate gases like carbon dioxide and toxic waste like heavy
metal alloys, acids and alkalis. And last but not least is every obsoleted
iPhone a candidate for waste facilities unless consumers are going to sell them
on the second hand market.
While we can not expect consumers and manufacturers to go back to the early
days of consumer products where lifetime cycles reached up to 20 years, the
world record being the famous "Centennial Lightbulb" in Livermore, CA in the
US, which has been lit for over 100 years, it is certainly about time to
rethink modern consumerism with regard to responsibility to future generations.
|
[
{
"version": "v1",
"created": "Mon, 4 Jun 2012 13:01:09 GMT"
}
] | 2012-06-05T00:00:00 |
[
[
"Glaubitz",
"John Paul Adrian",
""
]
] |
new_dataset
| 0.999424 |
1205.5224
|
Rafael Dowsley
|
Nico D\"ottling, Rafael Dowsley, J\"orn M\"uller-Quade and Anderson C.
A. Nascimento
|
A CCA2 Secure Variant of the McEliece Cryptosystem
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The McEliece public-key encryption scheme has become an interesting
alternative to cryptosystems based on number-theoretical problems. Differently
from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum
computer. Moreover, even tough McEliece PKC has a relatively big key size,
encryption and decryption operations are rather efficient. In spite of all the
recent results in coding theory based cryptosystems, to the date, there are no
constructions secure against chosen ciphertext attacks in the standard model -
the de facto security notion for public-key cryptosystems. In this work, we
show the first construction of a McEliece based public-key cryptosystem secure
against chosen ciphertext attacks in the standard model. Our construction is
inspired by a recently proposed technique by Rosen and Segev.
|
[
{
"version": "v1",
"created": "Wed, 23 May 2012 17:11:21 GMT"
},
{
"version": "v2",
"created": "Tue, 29 May 2012 23:35:29 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Jun 2012 00:32:10 GMT"
}
] | 2012-06-04T00:00:00 |
[
[
"Döttling",
"Nico",
""
],
[
"Dowsley",
"Rafael",
""
],
[
"Müller-Quade",
"Jörn",
""
],
[
"Nascimento",
"Anderson C. A.",
""
]
] |
new_dataset
| 0.998054 |
1206.0107
|
Andrea Munari
|
Andrea Munari, Marco Levorato, Michele Zorzi
|
Cooperation in Carrier Sense Based Wireless Ad Hoc Networks - Part II:
Proactive Schemes
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work is the second of a two-part series of papers on the effectiveness
of cooperative techniques in non-centralized carrier sense-based ad hoc
wireless networks. While Part I extensively discussed reactive cooperation,
characterized by relayed transmissions triggered by failure events at the
intended receiver, Part II investigates in depth proactive solutions, in which
the source of a packet exploits channel state information to preemptively
coordinate with relays in order to achieve the optimal overall rate to the
destination. In particular, this work shows by means of both analysis and
simulation that the performance of reactive cooperation is reduced by the
intrinsic nature of the considered medium access policy, which biases the
distribution of the available relays, locating them in unfavorable positions
for rate optimization. Moreover, the highly dynamic nature of interference that
characterizes non-infrastructured ad hoc networks is proved to hamper the
efficacy and the reliability of preemptively allocated cooperative links, as
unpredicted births and deaths of surrounding transmissions may force relays to
abort their support and/or change the maximum achievable rate at the intended
receiver. As a general conclusion, our work extensively suggests that
CSMA-based link layers are not apt to effectively support cooperative
strategies in large-scale non-centralized ad hoc networks.
|
[
{
"version": "v1",
"created": "Fri, 1 Jun 2012 07:24:24 GMT"
}
] | 2012-06-04T00:00:00 |
[
[
"Munari",
"Andrea",
""
],
[
"Levorato",
"Marco",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.958917 |
1206.0122
|
Jeremy Buisson
|
Jean-Eudes M\'ehus (CREC), Thais Batista (DIMAP), J\'er\'emy Buisson
(CREC, IRISA, UEB)
|
ACME vs PDDL: support for dynamic reconfiguration of software
architectures
|
6\`eme \'edition de la Conf\'erence Francophone sur les Architectures
Logicielles (CAL 2012), Montpellier : France (2012)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On the one hand, ACME is a language designed in the late 90s as an
interchange format for software architectures. The need for recon guration at
runtime has led to extend the language with speci c support in Plastik. On the
other hand, PDDL is a predicative language for the description of planning
problems. It has been designed in the AI community for the International
Planning Competition of the ICAPS conferences. Several related works have
already proposed to encode software architectures into PDDL. Existing planning
algorithms can then be used in order to generate automatically a plan that
updates an architecture to another one, i.e., the program of a recon guration.
In this paper, we improve the encoding in PDDL. Noticeably we propose how to
encode ADL types and constraints in the PDDL representation. That way, we can
statically check our design and express PDDL constraints in order to ensure
that the generated plan never goes through any bad or inconsistent
architecture, not even temporarily.
|
[
{
"version": "v1",
"created": "Fri, 1 Jun 2012 08:19:16 GMT"
}
] | 2012-06-04T00:00:00 |
[
[
"Méhus",
"Jean-Eudes",
"",
"CREC"
],
[
"Batista",
"Thais",
"",
"DIMAP"
],
[
"Buisson",
"Jérémy",
"",
"CREC, IRISA, UEB"
]
] |
new_dataset
| 0.998347 |
1206.0169
|
Pradeep Singla
|
Pradeep Singla, Kamya Dhingra, Naveen Kr. Malik
|
DSTN (Distributed Sleep Transistor Network) for Low Power Programmable
Logic array Design
|
6 pages, 7 Figures
|
IJCA 45(17):31-36, May 2012. Published by Foundation of Computer
Science, New York, USA
|
10.5120/7004-9563
| null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
With the high demand of the portable electronic products, Low- power design
of VLSI circuits & Power dissipation has been recognized as a challenging
technology in the recent years. PLA (Programming logic array) is one of the
important off shelf part in the industrial application. This paper describes
the new design of PLA using power gating structure sleep transistor at circuit
level implementation for the low power applications. The important part of the
power gating design i.e. header and footer switch selection is also describes
in the paper. The simulating results of the proposed architecture of the new
PLA is shown and compared with the conventional PLA. This paper clearly shows
the optimization in the reduction of power dissipation in the new design
implementation of the PLA. The transient response of the power gates structure
of PLA is also illustrate in the paper by using TINA-PRO software.
|
[
{
"version": "v1",
"created": "Fri, 1 Jun 2012 13:09:24 GMT"
}
] | 2012-06-04T00:00:00 |
[
[
"Singla",
"Pradeep",
""
],
[
"Dhingra",
"Kamya",
""
],
[
"Malik",
"Naveen Kr.",
""
]
] |
new_dataset
| 0.999283 |
1205.6832
|
Michael Zock
|
Ga\"elle Lortal (TRT), Brigitte Grau (LIMSI), Michael Zock (LIF)
|
Syst\`eme d'aide \`a l'acc\`es lexical : trouver le mot qu'on a sur le
bout de la langue
|
TALN, Fez : Maroc (2004)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The study of the Tip of the Tongue phenomenon (TOT) provides valuable clues
and insights concerning the organisation of the mental lexicon (meaning, number
of syllables, relation with other words, etc.). This paper describes a tool
based on psycho-linguistic observations concerning the TOT phenomenon. We've
built it to enable a speaker/writer to find the word he is looking for, word he
may know, but which he is unable to access in time. We try to simulate the TOT
phenomenon by creating a situation where the system knows the target word, yet
is unable to access it. In order to find the target word we make use of the
paradigmatic and syntagmatic associations stored in the linguistic databases.
Our experiment allows the following conclusion: a tool like SVETLAN, capable to
structure (automatically) a dictionary by domains can be used sucessfully to
help the speaker/writer to find the word he is looking for, if it is combined
with a database rich in terms of paradigmatic links like EuroWordNet.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2012 17:33:47 GMT"
}
] | 2012-06-01T00:00:00 |
[
[
"Lortal",
"Gaëlle",
"",
"TRT"
],
[
"Grau",
"Brigitte",
"",
"LIMSI"
],
[
"Zock",
"Michael",
"",
"LIF"
]
] |
new_dataset
| 0.996231 |
1205.7044
|
Negin Golrezaei
|
Negin Golrezaei, Alexandros G. Dimakis, Andreas F. Molisch
|
Wireless Device-to-Device Communications with Distributed Caching
|
to appear in ISIT 2012
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel wireless device-to-device (D2D) collaboration
architecture that exploits distributed storage of popular content to enable
frequency reuse. We identify a fundamental conflict between collaboration
distance and interference and show how to optimize the transmission power to
maximize frequency reuse. Our analysis depends on the user content request
statistics which are modeled by a Zipf distribution. Our main result is a
closed form expression of the optimal collaboration distance as a function of
the content reuse distribution parameters. We show that if the Zipf exponent of
the content reuse distribution is greater than 1, it is possible to have a
number of D2D interference-free collaboration pairs that scales linearly in the
number of nodes. If the Zipf exponent is smaller than 1, we identify the best
possible scaling in the number of D2D collaborating links. Surprisingly, a very
simple distributed caching policy achieves the optimal scaling behavior and
therefore there is no need to centrally coordinate what each node is caching.
|
[
{
"version": "v1",
"created": "Thu, 31 May 2012 17:02:31 GMT"
}
] | 2012-06-01T00:00:00 |
[
[
"Golrezaei",
"Negin",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.999034 |
1204.1677
|
Anatoly Khina
|
Idan Livni, Anatoly Khina, Ayal Hitron, Uri Erez
|
Space-Time MIMO Multicasting
|
ISIT 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multicasting is the general method of conveying the same information to
multiple users over a broadcast channel. In this work, the Gaussian MIMO
broadcast channel is considered, with multiple users and any number of antennas
at each node. A "closed loop" scenario is assumed, for which a practical
capacity-achieving multicast scheme is constructed. In the proposed scheme,
linear modulation is carried over time and space together, which allows to
transform the problem into that of transmission over parallel scalar
sub-channels, the gains of which are equal, except for a fraction of
sub-channels that vanishes with the number of time slots used. Over these
sub-channels, off-the-shelf fixed-rate AWGN codes can be used to approach
capacity.
|
[
{
"version": "v1",
"created": "Sat, 7 Apr 2012 20:41:33 GMT"
},
{
"version": "v2",
"created": "Wed, 30 May 2012 11:08:09 GMT"
}
] | 2012-05-31T00:00:00 |
[
[
"Livni",
"Idan",
""
],
[
"Khina",
"Anatoly",
""
],
[
"Hitron",
"Ayal",
""
],
[
"Erez",
"Uri",
""
]
] |
new_dataset
| 0.982964 |
1205.6568
|
Wei Su
|
Wei Su, Alexander Pott, and Xiaohu Tang
|
Characterization of Negabent Functions and Construction of Bent-Negabent
Functions with Maximum Algebraic Degree
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present necessary and sufficient conditions for a Boolean function to be a
negabent function for both even and odd number of variables, which demonstrate
the relationship between negabent functions and bent functions. By using these
necessary and sufficient conditions for Boolean functions to be negabent, we
obtain that the nega spectrum of a negabent function has at most 4 values. We
determine the nega spectrum distribution of negabent functions. Further, we
provide a method to construct bent-negabent functions in $n$ variables ($n$
even) of algebraic degree ranging from 2 to $\frac{n}{2}$, which implies that
the maximum algebraic degree of an $n$-variable bent-negabent function is equal
to $\frac{n}{2}$. Thus, we answer two open problems proposed by Parker and Pott
and by St\v{a}nic\v{a} \textit{et al.} respectively.
|
[
{
"version": "v1",
"created": "Wed, 30 May 2012 07:55:46 GMT"
}
] | 2012-05-31T00:00:00 |
[
[
"Su",
"Wei",
""
],
[
"Pott",
"Alexander",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.98232 |
1205.6605
|
Jan Egger
|
Jan Egger, Bernd Freisleben, Christopher Nimsky, Tina Kapur
|
Template-Cut: A Pattern-Based Segmentation Paradigm
|
8 pages, 6 figures, 3 tables, 6 equations, 51 references
|
J. Egger, B. Freisleben, C. Nimsky, T. Kapur. Template-Cut: A
Pattern-Based Segmentation Paradigm. Nature - Scientific Reports, Nature
Publishing Group (NPG), 2(420), 2012
| null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We present a scale-invariant, template-based segmentation paradigm that sets
up a graph and performs a graph cut to separate an object from the background.
Typically graph-based schemes distribute the nodes of the graph uniformly and
equidistantly on the image, and use a regularizer to bias the cut towards a
particular shape. The strategy of uniform and equidistant nodes does not allow
the cut to prefer more complex structures, especially when areas of the object
are indistinguishable from the background. We propose a solution by introducing
the concept of a "template shape" of the target object in which the nodes are
sampled non-uniformly and non-equidistantly on the image. We evaluate it on
2D-images where the object's textures and backgrounds are similar, and large
areas of the object have the same gray level appearance as the background. We
also evaluate it in 3D on 60 brain tumor datasets for neurosurgical planning
purposes.
|
[
{
"version": "v1",
"created": "Wed, 30 May 2012 09:44:43 GMT"
}
] | 2012-05-31T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Kapur",
"Tina",
""
]
] |
new_dataset
| 0.970757 |
1205.6699
|
Benjamin Sowell
|
Benjamin Sowell, Wojciech Golab, Mehul A. Shah
|
Minuet: A Scalable Distributed Multiversion B-Tree
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
884-895 (2012)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data management systems have traditionally been designed to support either
long-running analytics queries or short-lived transactions, but an increasing
number of applications need both. For example, online games, socio-mobile apps,
and e-commerce sites need to not only maintain operational state, but also
analyze that data quickly to make predictions and recommendations that improve
user experience. In this paper, we present Minuet, a distributed, main-memory
B-tree that supports both transactions and copy-on-write snapshots for in-situ
analytics. Minuet uses main-memory storage to enable low-latency transactional
operations as well as analytics queries without compromising transaction
performance. In addition to supporting read-only analytics queries on
snapshots, Minuet supports writable clones, so that users can create branching
versions of the data. This feature can be quite useful, e.g. to support complex
"what-if" analysis or to facilitate wide-area replication. Our experiments show
that Minuet outperforms a commercial main-memory database in many ways. It
scales to hundreds of cores and TBs of memory, and can process hundreds of
thousands of B-tree operations per second while executing long-running scans.
|
[
{
"version": "v1",
"created": "Wed, 30 May 2012 14:33:38 GMT"
}
] | 2012-05-31T00:00:00 |
[
[
"Sowell",
"Benjamin",
""
],
[
"Golab",
"Wojciech",
""
],
[
"Shah",
"Mehul A.",
""
]
] |
new_dataset
| 0.997578 |
1102.1107
|
Ketan Savla
|
Giacomo Como, Ketan Savla, Daron Acemoglu, Munther A. Dahleh and
Emilio Frazzoli
|
Robust Distributed Routing in Dynamical Flow Networks - Part I: Locally
Responsive Policies and Weak Resilience
|
32 pages, 5 figures, journal submission
| null |
10.1016/j.compeleceng.2012.04.013
| null |
cs.SY math.CA math.DS math.OC nlin.AO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robustness of distributed routing policies is studied for dynamical flow
networks, with respect to adversarial disturbances that reduce the link flow
capacities. A dynamical flow network is modeled as a system of ordinary
differential equations derived from mass conservation laws on a directed
acyclic graph with a single origin-destination pair and a constant inflow at
the origin. Routing policies regulate the way the inflow at a non-destination
node gets split among its outgoing links as a function of the current particle
density, while the outflow of a link is modeled to depend on the current
particle density on that link through a flow function. The dynamical flow
network is called partially transferring if the total inflow at the destination
node is asymptotically bounded away from zero, and its weak resilience is
measured as the minimum sum of the link-wise magnitude of all disturbances that
make it not partially transferring. The weak resilience of a dynamical flow
network with arbitrary routing policy is shown to be upper-bounded by the
network's min-cut capacity, independently of the initial flow conditions.
Moreover, a class of distributed routing policies that rely exclusively on
local information on the particle densities, and are locally responsive to
that, is shown to yield such maximal weak resilience. These results imply that
locality constraints on the information available to the routing policies do
not cause loss of weak resilience. Some fundamental properties of dynamical
flow networks driven by locally responsive distributed policies are analyzed in
detail, including global convergence to a unique limit flow.
|
[
{
"version": "v1",
"created": "Sat, 5 Feb 2011 23:12:19 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Mar 2011 01:26:51 GMT"
}
] | 2012-05-30T00:00:00 |
[
[
"Como",
"Giacomo",
""
],
[
"Savla",
"Ketan",
""
],
[
"Acemoglu",
"Daron",
""
],
[
"Dahleh",
"Munther A.",
""
],
[
"Frazzoli",
"Emilio",
""
]
] |
new_dataset
| 0.995136 |
1201.2471
|
Tao Yang
|
Tao Yang, Xiaojun Yuan, Li Ping, Iain B. Collings, Jinhong Yuan
|
Eigen-Direction Alignment Based Physical-Layer Network Coding for MIMO
Two-Way Relay Channels
|
This work was partially presented at IEEE ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel communication strategy which incorporates
physical-layer network coding (PNC) into multiple-input multiple output (MIMO)
two-way relay channels (TWRCs). At the heart of the proposed scheme lies a new
key technique referred to as eigen-direction alignment (EDA) precoding. The EDA
precoding efficiently aligns the two-user's eigen-modes into the same
directions. Based on that, we carry out multi-stream PNC over the aligned
eigen-modes. We derive an achievable rate of the proposed EDA-PNC scheme, based
on nested lattice codes, over a MIMO TWRC. Asymptotic analysis shows that the
proposed EDA-PNC scheme approaches the capacity upper bound as the number of
user antennas increases towards infinity. For a finite number of user antennas,
we formulate the design criterion of the optimal EDA precoder and present
solutions. Numerical results show that there is only a marginal gap between the
achievable rate of the proposed EDA-PNC scheme and the capacity upper bound of
the MIMO TWRC, in the median-to-large SNR region. We also show that the
proposed EDA-PNC scheme significantly outperforms existing amplify-and-forward
and decode-and-forward based schemes for MIMO TWRCs.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2012 03:57:33 GMT"
},
{
"version": "v2",
"created": "Tue, 29 May 2012 05:58:05 GMT"
}
] | 2012-05-30T00:00:00 |
[
[
"Yang",
"Tao",
""
],
[
"Yuan",
"Xiaojun",
""
],
[
"Ping",
"Li",
""
],
[
"Collings",
"Iain B.",
""
],
[
"Yuan",
"Jinhong",
""
]
] |
new_dataset
| 0.995089 |
1110.4123
|
Antonios Garas
|
David Garcia, Antonios Garas, and Frank Schweitzer
|
Positive words carry less information than negative words
|
16 pages, 3 figures, 3 tables
|
EPJ Data Science 2012, 1:3
|
10.1140/epjds3
| null |
cs.CL cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the frequency of word use is not only determined by the word
length \cite{Zipf1935} and the average information content
\cite{Piantadosi2011}, but also by its emotional content. We have analyzed
three established lexica of affective word usage in English, German, and
Spanish, to verify that these lexica have a neutral, unbiased, emotional
content. Taking into account the frequency of word usage, we find that words
with a positive emotional content are more frequently used. This lends support
to Pollyanna hypothesis \cite{Boucher1969} that there should be a positive bias
in human expression. We also find that negative words contain more information
than positive words, as the informativeness of a word increases uniformly with
its valence decrease. Our findings support earlier conjectures about (i) the
relation between word frequency and information content, and (ii) the impact of
positive emotions on communication and social links.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2011 20:54:21 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2011 10:19:34 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Apr 2012 12:29:23 GMT"
},
{
"version": "v4",
"created": "Sun, 27 May 2012 14:55:40 GMT"
}
] | 2012-05-29T00:00:00 |
[
[
"Garcia",
"David",
""
],
[
"Garas",
"Antonios",
""
],
[
"Schweitzer",
"Frank",
""
]
] |
new_dataset
| 0.998708 |
1205.5863
|
Hassan Mehri
|
Hassan Mehri and Mohammad Reza Sadeghi
|
Construction of LDGM lattices
| null | null | null | null |
cs.IT cs.CR math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low density generator matrix (LDGM) codes have an acceptable performance
under iterative decoding algorithms. This idea is used to construct a class of
lattices with relatively good performance and low encoding and decoding
complexity. To construct such lattices, Construction D is applied to a set of
generator vectors of a class of LDGM codes. Bounds on the minimum distance and
the coding gain of the corresponding lattices and a corollary for the cross
sections and projections of these lattices are provided. The progressive edge
growth (PEG) algorithm is used to construct a class of binary codes to generate
the corresponding lattice. Simulation results confirm the acceptable
performance of these class of lattices.
|
[
{
"version": "v1",
"created": "Sat, 26 May 2012 09:03:57 GMT"
}
] | 2012-05-29T00:00:00 |
[
[
"Mehri",
"Hassan",
""
],
[
"Sadeghi",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.963207 |
1205.5975
|
Paolo Bientinesi
|
Diego Fabregat-Traver (1) and Paolo Bientinesi (1), ((1) AICES, RWTH
Aachen)
|
A Domain-Specific Compiler for Linear Algebra Operations
| null | null | null |
AICES-2012/01-2
|
cs.MS cs.PL cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a prototypical linear algebra compiler that automatically exploits
domain-specific knowledge to generate high-performance algorithms. The input to
the compiler is a target equation together with knowledge of both the structure
of the problem and the properties of the operands. The output is a variety of
high-performance algorithms, and the corresponding source code, to solve the
target equation. Our approach consists in the decomposition of the input
equation into a sequence of library-supported kernels. Since in general such a
decomposition is not unique, our compiler returns not one but a number of
algorithms. The potential of the compiler is shown by means of its application
to a challenging equation arising within the genome-wide association study. As
a result, the compiler produces multiple "best" algorithms that outperform the
best existing libraries.
|
[
{
"version": "v1",
"created": "Sun, 27 May 2012 15:22:23 GMT"
}
] | 2012-05-29T00:00:00 |
[
[
"Fabregat-Traver",
"Diego",
""
],
[
"Bientinesi",
"Paolo",
""
]
] |
new_dataset
| 0.983833 |
1112.2795
|
Luke Mathieson
|
Bernard Mans and Luke Mathieson
|
On the Treewidth of Dynamic Graphs
| null | null | null | null |
cs.CC cs.DM cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic graph theory is a novel, growing area that deals with graphs that
change over time and is of great utility in modelling modern wireless, mobile
and dynamic environments. As a graph evolves, possibly arbitrarily, it is
challenging to identify the graph properties that can be preserved over time
and understand their respective computability.
In this paper we are concerned with the treewidth of dynamic graphs. We focus
on metatheorems, which allow the generation of a series of results based on
general properties of classes of structures. In graph theory two major
metatheorems on treewidth provide complexity classifications by employing
structural graph measures and finite model theory. Courcelle's Theorem gives a
general tractability result for problems expressible in monadic second order
logic on graphs of bounded treewidth, and Frick & Grohe demonstrate a similar
result for first order logic and graphs of bounded local treewidth.
We extend these theorems by showing that dynamic graphs of bounded (local)
treewidth where the length of time over which the graph evolves and is observed
is finite and bounded can be modelled in such a way that the (local) treewidth
of the underlying graph is maintained. We show the application of these results
to problems in dynamic graph theory and dynamic extensions to static problems.
In addition we demonstrate that certain widely used dynamic graph classes
naturally have bounded local treewidth.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2011 05:13:24 GMT"
},
{
"version": "v2",
"created": "Fri, 25 May 2012 04:55:40 GMT"
}
] | 2012-05-28T00:00:00 |
[
[
"Mans",
"Bernard",
""
],
[
"Mathieson",
"Luke",
""
]
] |
new_dataset
| 0.998333 |
1205.5611
|
Jason Priem
|
Judit Bar-Ilan (1), Stefanie Haustein (2), Isabella Peters (3), Jason
Priem (4), Hadas Shema (1) and Jens Terliesner (3) ((1) Department of
Information Science, Bar-Ilan University, (2) Central Library,
Forschungszentrum J\"ulich, (3) Department of Information Science,
Heinrich-Heine-University, (4) School of Information and Library Science,
University of North Carolina-Chapel Hill)
|
Beyond citations: Scholars' visibility on the social Web
|
Accepted to 17th International Conference on Science and Technology
Indicators, Montreal, Canada, 5-8 Sept. 2012. 14 pages, 3 figures, 3 tables
| null | null | null |
cs.DL cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditionally, scholarly impact and visibility have been measured by counting
publications and citations in the scholarly literature. However, increasingly
scholars are also visible on the Web, establishing presences in a growing
variety of social ecosystems. But how wide and established is this presence,
and how do measures of social Web impact relate to their more traditional
counterparts? To answer this, we sampled 57 presenters from the 2010 Leiden STI
Conference, gathering publication and citations counts as well as data from the
presenters' Web "footprints." We found Web presence widespread and diverse: 84%
of scholars had homepages, 70% were on LinkedIn, 23% had public Google Scholar
profiles, and 16% were on Twitter. For sampled scholars' publications, social
reference manager bookmarks were compared to Scopus and Web of Science
citations; we found that Mendeley covers more than 80% of sampled articles, and
that Mendeley bookmarks are significantly correlated (r=.45) to Scopus citation
counts.
|
[
{
"version": "v1",
"created": "Fri, 25 May 2012 04:41:40 GMT"
}
] | 2012-05-28T00:00:00 |
[
[
"Bar-Ilan",
"Judit",
""
],
[
"Haustein",
"Stefanie",
""
],
[
"Peters",
"Isabella",
""
],
[
"Priem",
"Jason",
""
],
[
"Shema",
"Hadas",
""
],
[
"Terliesner",
"Jens",
""
]
] |
new_dataset
| 0.969812 |
1205.5699
|
Marin\^es Guerreiro
|
Gladys Chalom, Raul Ant\^onio Ferraz, Marin\^es Guerreiro and C\'esar
Polcino Milies
|
Minimal Binary Abelian Codes of length $p^m q^n$
|
8 pages, contents partially presented at the Groups, Rings and Group
Rings Conferences held in Ubatuba-SP (Brasil) and Edmonton-AL (Canada)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are
prime rational integers under some restrictive hypotheses. In this case, we
determine the idempotents generating minimal codes and either the respective
weights or bounds of these weights. We give examples showing that these bounds
are attained in some cases.
|
[
{
"version": "v1",
"created": "Fri, 25 May 2012 14:05:03 GMT"
}
] | 2012-05-28T00:00:00 |
[
[
"Chalom",
"Gladys",
""
],
[
"Ferraz",
"Raul Antônio",
""
],
[
"Guerreiro",
"Marinês",
""
],
[
"Milies",
"César Polcino",
""
]
] |
new_dataset
| 0.997862 |
1110.3014
|
Sonoko Moriyama
|
Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto,
Sonoko Moriyama
|
On the Existence of Hamiltonian Paths for History Based Pivot Rules on
Acyclic Unique Sink Orientations of Hypercubes
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An acyclic USO on a hypercube is formed by directing its edges in such as way
that the digraph is acyclic and each face of the hypercube has a unique sink
and a unique source. A path to the global sink of an acyclic USO can be modeled
as pivoting in a unit hypercube of the same dimension with an abstract
objective function, and vice versa. In such a way, Zadeh's 'least entered rule'
and other history based pivot rules can be applied to the problem of finding
the global sink of an acyclic USO. In this paper we present some theoretical
and empirical results on the existence of acyclic USOs for which the various
history based pivot rules can be made to follow a Hamiltonian path. In
particular, we develop an algorithm that can enumerate all such paths up to
dimension 6 using efficient pruning techniques. We show that Zadeh's original
rule admits Hamiltonian paths up to dimension 9 at least, and prove that most
of the other rules do not for all dimensions greater than 5.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2011 17:57:59 GMT"
},
{
"version": "v2",
"created": "Thu, 24 May 2012 15:19:07 GMT"
}
] | 2012-05-25T00:00:00 |
[
[
"Aoshima",
"Yoshikazu",
""
],
[
"Avis",
"David",
""
],
[
"Deering",
"Theresa",
""
],
[
"Matsumoto",
"Yoshitake",
""
],
[
"Moriyama",
"Sonoko",
""
]
] |
new_dataset
| 0.991883 |
1205.5395
|
Abuzer Yakaryilmaz
|
Abuzer Yakaryilmaz
|
Turing-equivalent automata using a fixed-size quantum memory
|
28 pages
| null | null | null |
cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new public quantum interactive proof system and
the first quantum alternating Turing machine: qAM proof system and qATM,
respectively. Both are obtained from their classical counterparts
(Arthur-Merlin proof system and alternating Turing machine, respectively,) by
augmenting them with a fixed-size quantum register. We focus on space-bounded
computation, and obtain the following surprising results: Both of them with
constant-space are Turing-equivalent. More specifically, we show that for any
Turing-recognizable language, there exists a constant-space weak-qAM system,
(the nonmembers do not need to be rejected with high probability), and we show
that any Turing-recognizable language can be recognized by a constant-space
qATM even with one-way input head.
For strong proof systems, where the nonmembers must be rejected with high
probability, we show that the known space-bounded classical private protocols
can also be simulated by our public qAM system with the same space bound.
Besides, we introduce a strong version of qATM: The qATM that must halt in
every computation path. Then, we show that strong qATMs (similar to private
ATMs) can simulate deterministic space with exponentially less space. This
leads to shifting the deterministic space hierarchy exactly by one-level. The
method behind the main results is a new public protocol cleverly using its
fixed-size quantum register. Interestingly, the quantum part of this public
protocol cannot be simulated by any space-bounded classical protocol in some
cases.
|
[
{
"version": "v1",
"created": "Thu, 24 May 2012 10:48:02 GMT"
}
] | 2012-05-25T00:00:00 |
[
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.999673 |
1205.5055
|
Matthew Anderson
|
Matthew Anderson, Maciej Brodowicz, Hartmut Kaiser, Bryce
Adelstein-Lelbach, and Thomas Sterling
|
Neutron Star Evolutions using Tabulated Equations of State with a New
Execution Model
|
9 pages, 8 figures. arXiv admin note: substantial text overlap with
arXiv:1110.1131
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The addition of nuclear and neutrino physics to general relativistic fluid
codes allows for a more realistic description of hot nuclear matter in neutron
star and black hole systems. This additional microphysics requires that each
processor have access to large tables of data, such as equations of state, and
in large simulations the memory required to store these tables locally can
become excessive unless an alternative execution model is used. In this work we
present relativistic fluid evolutions of a neutron star obtained using a
message driven multi-threaded execution model known as ParalleX. These neutron
star simulations would require substantial memory overhead dedicated entirely
to the equation of state table if using a more traditional execution model. We
introduce a ParalleX component based on Futures for accessing large tables of
data, including out-of-core sized tables, which does not require substantial
memory overhead and effectively hides any increased network latency.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 20:46:11 GMT"
}
] | 2012-05-24T00:00:00 |
[
[
"Anderson",
"Matthew",
""
],
[
"Brodowicz",
"Maciej",
""
],
[
"Kaiser",
"Hartmut",
""
],
[
"Adelstein-Lelbach",
"Bryce",
""
],
[
"Sterling",
"Thomas",
""
]
] |
new_dataset
| 0.982911 |
1205.5088
|
Dustin Webb
|
Dustin J. Webb, Jur van den Berg
|
Kinodynamic RRT*: Optimal Motion Planning for Systems with Linear
Differential Constraints
|
8 pages, 7 figures, 1 table, slated for submission to ICRA 2013
| null | null | null |
cs.RO cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Kinodynamic RRT*, an incremental sampling-based approach for
asymptotically optimal motion planning for robots with linear differential
constraints. Our approach extends RRT*, which was introduced for holonomic
robots (Karaman et al. 2011), by using a fixed-final-state-free-final-time
controller that exactly and optimally connects any pair of states, where the
cost function is expressed as a trade-off between the duration of a trajectory
and the expended control effort. Our approach generalizes earlier work on
extending RRT* to kinodynamic systems, as it guarantees asymptotic optimality
for any system with controllable linear dynamics, in state spaces of any
dimension. Our approach can be applied to non-linear dynamics as well by using
their first-order Taylor approximations. In addition, we show that for the rich
subclass of systems with a nilpotent dynamics matrix, closed-form solutions for
optimal trajectories can be derived, which keeps the computational overhead of
our algorithm compared to traditional RRT* at a minimum. We demonstrate the
potential of our approach by computing asymptotically optimal trajectories in
three challenging motion planning scenarios: (i) a planar robot with a 4-D
state space and double integrator dynamics, (ii) an aerial vehicle with a 10-D
state space and linearized quadrotor dynamics, and (iii) a car-like robot with
a 5-D state space and non-linear dynamics.
|
[
{
"version": "v1",
"created": "Wed, 23 May 2012 04:00:24 GMT"
}
] | 2012-05-24T00:00:00 |
[
[
"Webb",
"Dustin J.",
""
],
[
"Berg",
"Jur van den",
""
]
] |
new_dataset
| 0.976673 |
1205.4813
|
Praveen Sivadasan
|
Praveen Sivadasan, P. Sojan Lal
|
Securing SQLJ Source Codes from Business Logic Disclosure by Data Hiding
Obfuscation
|
4 pages,3 Figures
| null | null | null |
cs.CR cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information security is protecting information from unauthorized access, use,
disclosure, disruption, modification, perusal and destruction. CAIN model
suggest maintaining the Confidentiality, Authenticity, Integrity and
Non-repudiation (CAIN) of information. Oracle 8i, 9i and 11g Databases support
SQLJ framework allowing embedding of SQL statements in Java Programs and
providing programmer friendly means to access the Oracle database. As cloud
computing technology is becoming popular, SQLJ is considered as a flexible and
user friendly language for developing distributed applications in grid
architectures. SQLJ source codes are translated to java byte codes and
decompilation is generation of source codes from intermediate byte codes. The
intermediate SQLJ application byte codes are open to decompilation, allowing a
malicious reader to forcefully decompile it for understanding confidential
business logic or data from the codes. To the best of our knowledge, strong and
cost effective techniques exist for Oracle Database security, but still data
security techniques are lacking for client side applications, giving
possibility for revelation of confidential business data. Data obfuscation is
hiding the data in codes and we suggest enhancing the data security in SQLJ
source codes by data hiding, to mitigate disclosure of confidential business
data, especially integers in distributed applications.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 06:18:32 GMT"
}
] | 2012-05-23T00:00:00 |
[
[
"Sivadasan",
"Praveen",
""
],
[
"Lal",
"P. Sojan",
""
]
] |
new_dataset
| 0.960278 |
1205.4829
|
Somdip Dey Mr.
|
Somdip Dey
|
SD-EQR: A New Technique To Use QR CodesTM in Cryptography
|
6 Pages and 3 figures, International Journal of Information
Technology & Computer Science (IJITCS), May/June 2012
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper the author present a new technique of using QR Codes (commonly
known as 'Quick Respond Codes') in the field of Cryptography. QR Codes are
mainly used to convey or store messages because they have higher or large
storage capacity than any other normal conventional 'barcodes'. In this paper
the primary focus will be on storing messages in encrypted format with a
password and send it to the required destination hiding in a QR Code, without
being tracked or decrypted properly by any hacker or spyware. Since QR Codes
have fast response time and have large storage capacity, QR Codes can be used
perfectly to send encrypted data (messages) to the receiver. This method will
be suitable in any business house, government sectors, communication network to
send their encrypted messages faster to the destination. Or a person can even
use this method to keep his important documents, like passport number, pan-card
id, social security number, perfectly secured with him all the time, without
the information getting leaked to outside world. The new method is achieved by
entering the message along with a password. This password will generate a
secret code, which will be added to each digit or alphabet in the numbers or
text entered in the message (which is needed to be encrypted) and generate the
first phase of encryption. That newly generated encrypted message will again be
encrypted using various other methods to generate the final encrypted message.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 07:46:15 GMT"
}
] | 2012-05-23T00:00:00 |
[
[
"Dey",
"Somdip",
""
]
] |
new_dataset
| 0.999434 |
1205.4832
|
Somdip Dey Mr.
|
Somdip Dey
|
SD-REE: A Cryptographic Method to Exclude Repetition from a Message
|
7 Pages,1 table for Results, 1 table for Cryptanalysis and 6 figures
|
Proceedings of The International Conference on Informatics and
Applications (ICIA2012), Malaysia
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the author presents a new cryptographic technique, SD-REE, to
exclude the repetitive terms in a message, when it is to be encrypted, so that
it becomes almost impossible for a person to retrieve or predict the original
message from the encrypted message. In modern world, cryptography hackers try
to break a code or cryptographic algorithm [1,2] or retrieve the key, used for
encryption, by inserting repetitive bytes / characters in the message and
encrypt the message or by analyzing repetitions in the encrypted message, to
find out the encryption algorithm or retrieve the key used for the encryption.
But in SD-REE method the repetitive bytes / characters are removed and there is
no trace of any repetition in the message, which was encrypted.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 08:02:59 GMT"
}
] | 2012-05-23T00:00:00 |
[
[
"Dey",
"Somdip",
""
]
] |
new_dataset
| 0.990903 |
1205.4889
|
Thomas Brihaye
|
Thomas Brihaye, V\'eronique Bruy\`ere, Julie De Pril
|
On Equilibria in Quantitative Games with Reachability/Safety Objectives
|
Full version of the CSR 2010 proceedings paper
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study turn-based quantitative multiplayer non zero-sum
games played on finite graphs with both reachability and safety objectives. In
this framework a player with a reachability objective aims at reaching his own
goal as soon as possible, whereas a player with a safety objective aims at
avoiding his bad set or, if impossible, delaying its visit as long as possible.
We prove the existence of Nash equilibria with finite memory in quantitative
multiplayer reachability/safety games. Moreover, we prove the existence of
finite-memory secure equilibria for quantitative two-player reachability games.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 12:08:37 GMT"
}
] | 2012-05-23T00:00:00 |
[
[
"Brihaye",
"Thomas",
""
],
[
"Bruyère",
"Véronique",
""
],
[
"De Pril",
"Julie",
""
]
] |
new_dataset
| 0.980684 |
1205.4900
|
Adethya Sudarsanan Mr
|
Adethya Sudarsanan
|
CloudPass - a passport system based on Cloud Computing and Near Field
Communication
|
Presented at Cloud2012 - International Workshop on Cloud Computing,
New Delhi, India
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless communication has penetrated into all fields of technology,
especially in mobility, where wireless transactions are gaining importance with
improvements in standards like 3G and 4G. There are many technologies that
support the wireless forms of interactions between devices. One among them is
NFC - Near Field Communication. In addition to NFC, other external technologies
like Quick Response (QR) Codes assist in establishing interactions among
participating devices. In this paper, we examine an approach that will involve
standards and technologies like NFC, QR Codes and Cloud Infrastructure to
design a mobile application which will perform desired functionalities. Cloud
Storage is used as a reservoir to store the artifacts used by the application.
Development and testing of the application is initially carried out on
emulators or simulators followed by testing on real handsets/devices.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 12:47:45 GMT"
}
] | 2012-05-23T00:00:00 |
[
[
"Sudarsanan",
"Adethya",
""
]
] |
new_dataset
| 0.998906 |
0903.4014
|
Jun Muramatsu
|
Jun Muramatsu and Shigeki Miyake
|
Construction of Codes for Wiretap Channel and Secret Key Agreement from
Correlated Source Outputs by Using Sparse Matrices
|
A part of this paper is presented in part at 2009 IEEE Information
Theory Workshop (ITW2009), Taormina, Italy, pp.105-109, 2009. This paper is
submitted to IEEE Transactions on Information Theory. 34 pages
|
IEEE Transactions on Information Theory, vol. 58, no. 2, pp.
671-692, Feb. 2012
| null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this paper is to prove coding theorems for the wiretap channel
coding problem and secret key agreement problem based on the the notion of a
hash property for an ensemble of functions. These theorems imply that codes
using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate
universal coding theorems for a wiretap channel and a secret key agreement are
also proved.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2009 05:29:04 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Apr 2010 06:22:59 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Muramatsu",
"Jun",
""
],
[
"Miyake",
"Shigeki",
""
]
] |
new_dataset
| 0.974472 |
1010.1260
|
Laura Grigori
|
Ioan O. Hupca, Joel Falcou, Laura Grigori, and Radek Stompor
|
Spherical harmonic transform with GPUs
| null |
Proceedings of Euro-Par 2011, Lecture Notes in Computer Science,
2012, Vol. 7155/2012, p. 355
|
10.1007/978-3-642-29737-3_40
|
INRIA technical report 7409
|
cs.DC astro-ph.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an algorithm for computing an inverse spherical harmonic
transform suitable for graphic processing units (GPU). We use CUDA and base our
implementation on a Fortran90 routine included in a publicly available parallel
package, S2HAT. We focus our attention on the two major sequential steps
involved in the transforms computation, retaining the efficient parallel
framework of the original code. We detail optimization techniques used to
enhance the performance of the CUDA-based code and contrast them with those
implemented in the Fortran90 version. We also present performance comparisons
of a single CPU plus GPU unit with the S2HAT code running on either a single or
4 processors. In particular we find that use of the latest generation of GPUs,
such as NVIDIA GF100 (Fermi), can accelerate the spherical harmonic transforms
by as much as 18 times with respect to S2HAT executed on one core, and by as
much as 5.5 with respect to S2HAT on 4 cores, with the overall performance
being limited by the Fast Fourier transforms. The work presented here has been
performed in the context of the Cosmic Microwave Background simulations and
analysis. However, we expect that the developed software will be of more
general interest and applicability.
|
[
{
"version": "v1",
"created": "Wed, 6 Oct 2010 20:06:54 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Hupca",
"Ioan O.",
""
],
[
"Falcou",
"Joel",
""
],
[
"Grigori",
"Laura",
""
],
[
"Stompor",
"Radek",
""
]
] |
new_dataset
| 0.984145 |
1205.4261
|
Belkacem Kouninef Dr
|
Kouninef Belkacem and Bouzerita Mohamed
|
Deployment of software components: Application to Wireless System
| null |
ARPN Journal of Systems and Software Volume 1 No. 3, JUNE 2011
ISSN 2222-9833
| null | null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
The wide variety of wireless devices brings to design mobile applications as
a collection of interchangeable software components adapted to the deployment
environment of the software. To ensure the proper functioning of the software
assembly and make a real enforcement in case of failures, the introduction of
concepts, models and tools necessary for the administration of these components
is crucial. This article proposes a method for deploying components in wireless
systems.
|
[
{
"version": "v1",
"created": "Fri, 18 May 2012 20:48:55 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Belkacem",
"Kouninef",
""
],
[
"Mohamed",
"Bouzerita",
""
]
] |
new_dataset
| 0.991454 |
1205.4279
|
Somdip Dey Mr.
|
Somdip Dey
|
SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with
Bit-Manipulation to Exclude Repetition from a Message to be Encrypted
|
The paper (manuscript) consist of 5 pages, in which there are 10
figures and 1 table for results
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper the author presents a new cryptographic technique to exclude
the repetitive terms in a message, when it is to be encrypted, so that it
becomes almost impossible for a person to retrieve or predict the original
message from the encrypted message. In modern world, cryptography hackers try
to break a code or cryptographic algorithm or try to retrieve the key, which is
needed to encrypt a message, by analyzing the insertion or presence of
repetitive bits / characters (bytes) in the message and encrypted message to
find out the encryption algorithm or the key used for it. So it is must for a
good encryption method to exclude the repetitive terms such that no trace of
repetitions can be tracked down. For this reason we apply SD-AREE cryptographic
method to exclude repetitive terms from a message, which is to be encrypted. In
SD-AREE method the repetitive bits / characters are removed and there is no
trace of any repetition in the message.
|
[
{
"version": "v1",
"created": "Fri, 18 May 2012 23:02:07 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Dey",
"Somdip",
""
]
] |
new_dataset
| 0.998941 |
1205.4361
|
Muhammad Fahad Khan
|
Muhammad Fahad Khan and Saira Beg
|
Transference & Retrieval of Pulse-code modulation Audio over Short
Messaging Service
|
3,3, International Journal of Computer Applications (0975 -
8887),Volume 32- No.10, October 2011
|
International Journal of Computer Applications ,Volume 32-- No.10,
October 2011
| null | null |
cs.NI cs.MM cs.SD
|
http://creativecommons.org/licenses/by/3.0/
|
The paper presents the method of transferring PCM (Pulse-Code Modulation)
based audio messages through SMS (Short Message Service) over GSM (Global
System for Mobile Communications) network. As SMS is text based service, and
could not send voice. Our method enables voice transferring through SMS, by
converting PCM audio into characters. Than Huffman coding compression technique
is applied in order to reduce numbers of characters which will latterly set as
payload text of SMS. Testing the said method we develop an application using
J2me platform
|
[
{
"version": "v1",
"created": "Sat, 19 May 2012 21:25:17 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Khan",
"Muhammad Fahad",
""
],
[
"Beg",
"Saira",
""
]
] |
new_dataset
| 0.983585 |
1205.4487
|
Rajesh V
|
V. Rajesh, P. Vijaya Kumar
|
CDMA Based Interconnect Mechanism for SOPC
|
IJCSI Vol.9 Issue 2, 2012
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Network-on-chip (NoC) designs consisting of large pack of Intellectual
Property (IP) blocks (cores) on the same silicon die is becoming technically
possible nowadays. But, the communication between the IP Cores is the main
issue in recent years. This paper presents the design of a Code Division
Multiple Access (CDMA) based wrapper interconnect as a component of System on
programmable chip (SOPC) builder to communicate between IP cores. In the
proposal, only bus lines that carry address and data signals are CDMA coded.
CDMA technology has better data integrity, channel continuity, channel
isolation, and also mainly it reduces the no.of lines in the bus architecture
for transmitting the data from master to slave.
|
[
{
"version": "v1",
"created": "Mon, 21 May 2012 05:01:24 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Rajesh",
"V.",
""
],
[
"Kumar",
"P. Vijaya",
""
]
] |
new_dataset
| 0.954492 |
1205.4489
|
Saraju Mohanty
|
Saraju P. Mohanty
|
ISWAR: An Imaging System with Watermarking and Attack Resilience
| null | null | null | null |
cs.CR cs.DL cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the explosive growth of internet technology, easy transfer of digital
multimedia is feasible. However, this kind of convenience with which authorized
users can access information, turns out to be a mixed blessing due to
information piracy. The emerging field of Digital Rights Management (DRM)
systems addresses issues related to the intellectual property rights of digital
content. In this paper, an object-oriented (OO) DRM system, called "Imaging
System with Watermarking and Attack Resilience" (ISWAR), is presented that
generates and authenticates color images with embedded mechanisms for
protection against infringement of ownership rights as well as security
attacks. In addition to the methods, in the object-oriented sense, for
performing traditional encryption and decryption, the system implements methods
for visible and invisible watermarking. This paper presents one visible and one
invisible watermarking algorithm that have been integrated in the system. The
qualitative and quantitative results obtained for these two watermarking
algorithms with several benchmark images indicate that high-quality watermarked
images are produced by the algorithms. With the help of experimental results it
is demonstrated that the presented invisible watermarking techniques are
resilient to the well known benchmark attacks and hence a fail-safe method for
providing constant protection to ownership rights.
|
[
{
"version": "v1",
"created": "Mon, 21 May 2012 05:25:48 GMT"
}
] | 2012-05-22T00:00:00 |
[
[
"Mohanty",
"Saraju P.",
""
]
] |
new_dataset
| 0.998509 |
1205.3863
|
Saeed Hajizadeh
|
Saeed Hajizadeh and Ghosheh Abed Hodtani
|
Three-Receiver Broadcast Channels with Side Information
|
5 pages, 2 figures, This paper was accepted for presentation at IEEE
ISIT 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Three-receiver broadcast channel (BC) is of interest due to its information
theoretical differences with two receiver one. In this paper, we derive
achievable rate regions for two classes of 3-receiver BC with side information
available at the transmitter, Multilevel BC and 3-receiver less noisy BC, by
using superposition coding, Gel'fand-Pinsker binning scheme and Nair-El Gamal
indirect decoding. Our rate region for multilevel BC subsumes the Steinberg
rate region for 2-receiver degraded BC with side information as its special
case. We also find the capacity region of 3-receiver less noisy BC when side
information is available both at the transmitter and at the receivers.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2012 07:00:13 GMT"
},
{
"version": "v2",
"created": "Fri, 18 May 2012 11:51:39 GMT"
}
] | 2012-05-21T00:00:00 |
[
[
"Hajizadeh",
"Saeed",
""
],
[
"Hodtani",
"Ghosheh Abed",
""
]
] |
new_dataset
| 0.979787 |
1205.4049
|
Vincent Gauthier
|
Teck Aguilar, Syue-Ju Syue, Vincent Gauthier, Hossam Afifi and
Chin-Liang Wang
|
CoopGeo: A Beaconless Geographic Cross-Layer Protocol for Cooperative
Wireless Ad Hoc Networks
| null |
IEEE Transactions on Wireless Communications (2011)
|
10.1109/TWC.2011.060711.100480
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperative relaying has been proposed as a promising transmission technique
that effectively creates spatial diversity through the cooperation among
spatially distributed nodes. However, to achieve efficient communications while
gaining full benefits from cooperation, more interactions at higher protocol
layers, particularly the MAC (Medium Access Control) and network layers, are
vitally required. This is ignored in most existing articles that mainly focus
on physical (PHY)-layer relaying techniques. In this paper, we propose a novel
cross-layer framework involving two levels of joint design---a MAC-network
cross-layer design for forwarder selection (or termed routing) and a MAC-PHY
for relay selection---over symbol-wise varying channels. Based on location
knowledge and contention processes, the proposed cross-layer protocol, CoopGeo,
aims at providing an efficient, distributed approach to select next hops and
optimal relays along a communication path. Simulation results demonstrate that
CoopGeo not only operates properly with varying densities of nodes, but
performs significantly better than the existing protocol BOSS in terms of
packet error rate, transmission error probability, and saturated throughput.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2012 21:48:59 GMT"
}
] | 2012-05-21T00:00:00 |
[
[
"Aguilar",
"Teck",
""
],
[
"Syue",
"Syue-Ju",
""
],
[
"Gauthier",
"Vincent",
""
],
[
"Afifi",
"Hossam",
""
],
[
"Wang",
"Chin-Liang",
""
]
] |
new_dataset
| 0.998227 |
1205.3986
|
Yusuf Perwej
|
Omar S. Al-Mushayt, Yusuf Perwej, Kashiful Haq
|
Electronic-government in Saudi Arabia: A positive revolution in the
peninsula
|
12 Pages, 1 Figures, ISSN Print: (0974-7273),ISSN Online:(0975-3761)
|
International Transactions in Applied Sciences (ITAS), January
2009, Volume 1 , Number 1, Pages 87-98
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The informatization practice of countries all over the world has shown that
the level of a government's informatization is one main factor that can affect
its international competitive power. At present, e-government construction is
regarded as one of the most important tasks for the national economy and
society upliftment and informatization in Saudi Arabia. Unlike the traditional
governments, an e-government takes on a new look with its framework and
operation mode more suitable for the contemporary era. In fact, it is a basic
national strategy to promote Saudi Arabia's informatization by means of
e-government construction. This talk firstly introduces the basic concepts and
relevant viewpoints of egovernment, then reviews the development process of
e-government in Saudi Arabia, and describes the current states, development
strategies of e-government in Saudi Arabia. And also review e-government
maturity models and synthesize them e-government maturity models are
investigated, in which the authors have proposed the Delloite's six-stage
model, Layne and Lee four-stage model and Accenture five-stage model. So, the
main e-government maturity stages are: online presence, interaction,
transaction, transformation and digital democracy. After that, according to
many references, the main technologies which are used in each stage are
summarized.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2012 17:23:50 GMT"
}
] | 2012-05-18T00:00:00 |
[
[
"Al-Mushayt",
"Omar S.",
""
],
[
"Perwej",
"Yusuf",
""
],
[
"Haq",
"Kashiful",
""
]
] |
new_dataset
| 0.998986 |
1205.3998
|
Yiannis Andreopoulos
|
Dujdow Buranapanichkit and Yiannis Andreopoulos
|
Distributed Time-Frequency Division Multiple Access Protocol For
Wireless Sensor Networks
|
4 pages, IEEE Wireless Communications Letters, to appear in 2012
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that biology-inspired self-maintaining algorithms in
wireless sensor nodes achieve near optimum time division multiple access (TDMA)
characteristics in a decentralized manner and with very low complexity. We
extend such distributed TDMA approaches to multiple channels (frequencies).
This is achieved by extending the concept of collaborative reactive listening
in order to balance the number of nodes in all available channels. We prove the
stability of the new protocol and estimate the delay until the balanced system
state is reached. Our approach is benchmarked against single-channel
distributed TDMA and channel hopping approaches using TinyOS imote2 wireless
sensors.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2012 18:11:22 GMT"
}
] | 2012-05-18T00:00:00 |
[
[
"Buranapanichkit",
"Dujdow",
""
],
[
"Andreopoulos",
"Yiannis",
""
]
] |
new_dataset
| 0.97841 |
1205.3570
|
Gopalakrishnan Tr Nair
|
Mary Cherian, T.R Gopalakrishnan Nair
|
A QoS-Aware Routing Protocol for Real-time Applications in Wireless
Sensor Networks
|
10 pages. arXiv admin note: text overlap with arXiv:1001.5339 by
other authors
|
Innovative Systems Design and Engineering, ISSN 2222-1727
(Paper),ISSN 2222-2871 (Online), Vol 2, No 7, 2011 pp. 84-93
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a quality of service aware routing protocol which provides
low latency for high priority packets. Packets are differentiated based on
their priority by applying queuing theory. Low priority packets are transferred
through less energy paths. The sensor nodes interact with the pivot nodes which
in turn communicate with the sink node. This protocol can be applied in
monitoring context aware physical environments for critical applications.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2012 06:48:43 GMT"
}
] | 2012-05-17T00:00:00 |
[
[
"Cherian",
"Mary",
""
],
[
"Nair",
"T. R Gopalakrishnan",
""
]
] |
new_dataset
| 0.997241 |
1205.3642
|
Ana Monga
|
Ana Monga, Balwinder Singh
|
Finite State Machine based Vending Machine Controller with Auto-Billing
Features
| null |
International Journal on VLSI and Communication System,April 2012
pp 19-28
|
10.5121/vlsic.2012.3202
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, Vending Machines are well known among Japan, Malaysia and
Singapore. The quantity of machines in these countries is on the top worldwide.
This is due to the modern lifestyles which require fast food processing with
high quality. This paper describes the designing of multi select machine using
Finite State Machine Model with Auto-Billing Features. Finite State Machine
(FSM) modelling is the most crucial part in developing proposed model as this
reduces the hardware. In this paper the process of four state (user Selection,
Waiting for money insertion, product delivery and servicing) has been modelled
using MEALY Machine Model. The proposed model is tested using Spartan 3
development board and its performance is compared with CMOS based machine.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2012 11:59:48 GMT"
}
] | 2012-05-17T00:00:00 |
[
[
"Monga",
"Ana",
""
],
[
"Singh",
"Balwinder",
""
]
] |
new_dataset
| 0.997234 |
1205.3728
|
Ignasi Sau
|
Nicolas Bousquet, Daniel Gon\c{c}alves, George B. Mertzios, Christophe
Paul, Ignasi Sau, and St\'ephan Thomass\'e
|
Parameterized Domination in Circle Graphs
| null | null | null | null |
cs.DS cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A circle graph is the intersection graph of a set of chords in a circle. Keil
[Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set,
Connected Dominating Set, and Total Dominating Set are NP-complete in circle
graphs. To the best of our knowledge, nothing was known about the parameterized
complexity of these problems in circle graphs. In this paper we prove the
following results, which contribute in this direction:
- Dominating Set, Independent Dominating Set, Connected Dominating Set, Total
Dominating Set, and Acyclic Dominating Set are W[1]-hard in circle graphs,
parameterized by the size of the solution.
- Whereas both Connected Dominating Set and Acyclic Dominating Set are
W[1]-hard in circle graphs, it turns out that Connected Acyclic Dominating Set
is polynomial-time solvable in circle graphs.
- If T is a given tree, deciding whether a circle graph has a dominating set
isomorphic to T is NP-complete when T is in the input, and FPT when
parameterized by |V(T)|. We prove that the FPT algorithm is subexponential.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2012 16:32:43 GMT"
}
] | 2012-05-17T00:00:00 |
[
[
"Bousquet",
"Nicolas",
""
],
[
"Gonçalves",
"Daniel",
""
],
[
"Mertzios",
"George B.",
""
],
[
"Paul",
"Christophe",
""
],
[
"Sau",
"Ignasi",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.997114 |
1202.4576
|
Maxwell Young
|
Seth Gilbert, Maxwell Young
|
Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks
| null | null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider a time-slotted, single-hop, wireless sensor network (WSN) consisting
of n correct devices and and t=f*n Byzantine devices where f>=0 is any
constant; that is, the Byzantine devices may outnumber the correct ones. There
exists a trusted sender Alice who wishes to deliver a message m over a single
channel to the correct devices. There also exists a malicious user Carol who
controls the t Byzantine devices and uses them to disrupt the communication
channel. For a constant k>=2, the correct and Byzantine devices each possess a
meager energy budget of O(n^{1/k}), Alice and Carol each possess a limited
budget of \tilde{O}(n^{1/k}), and sending or listening in a slot incurs unit
cost. This general setup captures the inherent challenges of guaranteeing
communication despite scarce resources and attacks on the network. Given this
Alice versus Carol scenario, we ask: Is communication of m feasible and, if so,
at what cost?
We develop a protocol which, for an arbitrarily small constant \epsilon>0,
ensures that at least (1-\epsilon)n correct devices receive m with high
probability. Furthermore, if Carol's devices expend T energy jamming the
channel, then Alice and the correct devices each spend only
\tilde{O}(T^{1/(k+1)}). In other words, delaying the transmission of m forces a
jammer to rapidly deplete its energy supply and, consequently, cease attacks on
the network.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2012 09:42:51 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Mar 2012 05:36:14 GMT"
},
{
"version": "v3",
"created": "Sun, 22 Apr 2012 17:48:38 GMT"
},
{
"version": "v4",
"created": "Tue, 15 May 2012 00:45:22 GMT"
}
] | 2012-05-16T00:00:00 |
[
[
"Gilbert",
"Seth",
""
],
[
"Young",
"Maxwell",
""
]
] |
new_dataset
| 0.997926 |
1205.3212
|
Lin Zhong
|
Siqi Zhao, Lin Zhong, Jehan Wickramasuriya, Venu Vasudevan, Robert
LiKamWa, Ahmad Rahmati
|
SportSense: Real-Time Detection of NFL Game Events from Twitter
| null | null | null |
Technical Report TR0511-2012
|
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report our experience in building a working system, SportSense
(http://www.sportsense.us), which exploits Twitter users as human sensors of
the physical world to detect events in real-time. Using the US National
Football League (NFL) games as a case study, we report in-depth measurement
studies of the delay and post rate of tweets, and their dependence on other
properties. We subsequently develop a novel event detection method based on
these findings, and demonstrate that it can effectively and accurately extract
game events using open access Twitter data. SportSense has been evolving during
the 2010-11 and 2011-12 NFL seasons and is able to recognize NFL game big plays
in 30 to 90 seconds with 98% true positive, and 9% false positive rates. Using
a smart electronic TV program guide, we show that SportSense can utilize human
sensors to empower novel services.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2012 22:57:15 GMT"
}
] | 2012-05-16T00:00:00 |
[
[
"Zhao",
"Siqi",
""
],
[
"Zhong",
"Lin",
""
],
[
"Wickramasuriya",
"Jehan",
""
],
[
"Vasudevan",
"Venu",
""
],
[
"LiKamWa",
"Robert",
""
],
[
"Rahmati",
"Ahmad",
""
]
] |
new_dataset
| 0.999652 |
0902.4060
|
Ken Yamamoto
|
Ken Yamamoto, Yoshihiro Yamazaki
|
Network of two-Chinese-character compound words in Japanese language
| null |
Physica A 388, 2555-2560 (2009)
|
10.1016/j.physa.2009.02.032
| null |
cs.CL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some statistical properties of a network of two-Chinese-character compound
words in Japanese language are reported. In this network, a node represents a
Chinese character and an edge represents a two-Chinese-character compound word.
It is found that this network has properties of "small-world" and "scale-free."
A network formed by only Chinese characters for common use ({\it joyo-kanji} in
Japanese), which is regarded as a subclass of the original network, also has
small-world property. However, a degree distribution of the network exhibits no
clear power law. In order to reproduce disappearance of the power-law property,
a model for a selecting process of the Chinese characters for common use is
proposed.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2009 04:53:49 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Yamamoto",
"Ken",
""
],
[
"Yamazaki",
"Yoshihiro",
""
]
] |
new_dataset
| 0.998184 |
1103.6248
|
Garth Wells
|
Anders Logg and Garth N. Wells
|
DOLFIN: Automated Finite Element Computing
| null |
ACM Transactions on Mathematical Software 37(2), Article 20 (April
2010), 28 pages
|
10.1145/1731022.1731030
| null |
cs.MS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe here a library aimed at automating the solution of partial
differential equations using the finite element method. By employing novel
techniques for automated code generation, the library combines a high level of
expressiveness with efficient computation. Finite element variational forms may
be expressed in near mathematical notation, from which low-level code is
automatically generated, compiled and seamlessly integrated with efficient
implementations of computational meshes and high-performance linear algebra.
Easy-to-use object-oriented interfaces to the library are provided in the form
of a C++ library and a Python module. This paper discusses the mathematical
abstractions and methods used in the design of the library and its
implementation. A number of examples are presented to demonstrate the use of
the library in application code.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2011 17:29:27 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Logg",
"Anders",
""
],
[
"Wells",
"Garth N.",
""
]
] |
new_dataset
| 0.999154 |
1201.6117
|
Justin Thaler
|
Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry Yuen
|
Continuous Time Channels with Interference
|
7 pages. To appear in ISIT 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Khanna and Sudan \cite{KS11} studied a natural model of continuous time
channels where signals are corrupted by the effects of both noise and delay,
and showed that, surprisingly, in some cases both are not enough to prevent
such channels from achieving unbounded capacity. Inspired by their work, we
consider channels that model continuous time communication with adversarial
delay errors. The sender is allowed to subdivide time into an arbitrarily large
number $M$ of micro-units in which binary symbols may be sent, but the symbols
are subject to unpredictable delays and may interfere with each other. We model
interference by having symbols that land in the same micro-unit of time be
summed, and we study $k$-interference channels, which allow receivers to
distinguish sums up to the value $k$. We consider both a channel adversary that
has a limit on the maximum number of steps it can delay each symbol, and a more
powerful adversary that only has a bound on the average delay.
We give precise characterizations of the threshold between finite and
infinite capacity depending on the interference behavior and on the type of
channel adversary: for max-bounded delay, the threshold is at
$D_{\text{max}}=\ThetaM \log\min{k, M}))$, and for average bounded delay the
threshold is at $D_{\text{avg}} = \Theta(\sqrt{M \cdot \min\{k, M\}})$.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2012 07:05:58 GMT"
},
{
"version": "v2",
"created": "Fri, 11 May 2012 20:45:29 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Ivan",
"Ioana",
""
],
[
"Mitzenmacher",
"Michael",
""
],
[
"Thaler",
"Justin",
""
],
[
"Yuen",
"Henry",
""
]
] |
new_dataset
| 0.99281 |
1205.2748
|
Juliusz Chroboczek
|
Juliusz Chroboczek (PPS), Sylvain Lebresne (PPS)
|
Juppix: a Linux Live-CD for Undergraduate Students
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Juppix is a Linux Live-CD with a comfortable programming environment for the
Java, C and O'Caml programming languages that has been distributed to hundreds
of undergaduate students at the University of Paris 7 over the last few years.
We describe the lessons we learnt while compiling and distributing Juppix, and
outline our future plans.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2012 07:51:54 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Chroboczek",
"Juliusz",
"",
"PPS"
],
[
"Lebresne",
"Sylvain",
"",
"PPS"
]
] |
new_dataset
| 0.999898 |
1205.2797
|
Yusuf Perwej
|
Yusuf Perwej, Asif Perwej
|
Forecasting of Indian Rupee (INR) / US Dollar (USD) Currency Exchange
Rate Using Artificial Neural Network
|
12 Pages, 3 Figures, ISSN:2230-9616(Online);2231-0088(Print)
|
International Journal of Computer Science, Engineering and
Applications (IJCSEA), April 2012, Volume 2, Number 2, Pages 41-52
|
10.5121/ijcsea.2012.2204
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large part of the workforce, and growing every day, is originally from
India. India one of the second largest populations in the world, they have a
lot to offer in terms of jobs. The sheer number of IT workers makes them a
formidable travelling force as well, easily picking up employment in English
speaking countries. The beginning of the economic crises since 2008 September,
many Indians have return homeland, and this has had a substantial impression on
the Indian Rupee (INR) as liken to the US Dollar (USD). We are using
numerational knowledge based techniques for forecasting has been proved highly
successful in present time. The purpose of this paper is to examine the effects
of several important neural network factors on model fitting and forecasting
the behaviours. In this paper, Artificial Neural Network has successfully been
used for exchange rate forecasting. This paper examines the effects of the
number of inputs and hidden nodes and the size of the training sample on the
in-sample and out-of-sample performance. The Indian Rupee (INR) / US Dollar
(USD) is used for detailed examinations. The number of input nodes has a
greater impact on performance than the number of hidden nodes, while a large
number of observations do reduce forecast errors.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2012 17:26:49 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Perwej",
"Yusuf",
""
],
[
"Perwej",
"Asif",
""
]
] |
new_dataset
| 0.999596 |
1205.3021
|
Sari Haj Hussein
|
Sari Haj Hussein
|
The Hush Cryptosystem
|
7 pages. 5 figures. Appeared in the 2nd International Conference on
Security of Information and Networks (SIN 2009), North Cyprus, Turkey;
Proceedings of the 2nd International Conference on Security of Information
and Networks (SIN 2009), North Cyprus, Turkey
| null |
10.1145/1626195.1626224
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe a new cryptosystem we call "The Hush Cryptosystem"
for hiding encrypted data in innocent Arabic sentences. The main purpose of
this cryptosystem is to fool observer-supporting software into thinking that
the encrypted data is not encrypted at all. We employ a modified Word
Substitution Method known as the Grammatical Substitution Method in our
cryptosystem. We also make use of Hidden Markov Models. We test our
cryptosystem using a computer program written in the Java Programming Language.
Finally, we test the output of our cryptosystem using statistical tests.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2012 13:35:03 GMT"
}
] | 2012-05-15T00:00:00 |
[
[
"Hussein",
"Sari Haj",
""
]
] |
new_dataset
| 0.997227 |
1205.0699
|
Dieter Duyck
|
Dieter Duyck, Sheng Yang, Fambirai Takawira, Joseph J. Boutros and
Marc Moeneclaey
|
Time-Varying Space-Only Codes for Coded MIMO
|
submitted to IEEE Trans. on Inf. Theory, May 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple antenna (MIMO) devices are widely used to increase reliability and
information bit rate. Optimal error rate performance (full diversity and large
coding gain), for unknown channel state information at the transmitter and for
maximal rate, can be achieved by approximately universal space-time codes, but
comes at a price of large detection complexity, infeasible for most practical
systems. We propose a new coded modulation paradigm: error-correction outer
code with space-only but time-varying precoder (as inner code). We refer to the
latter as Ergodic Mutual Information (EMI) code. The EMI code achieves the
maximal multiplexing gain and full diversity is proved in terms of the outage
probability. Contrary to most of the literature, our work is not based on the
elegant but difficult classical algebraic MIMO theory. Instead, the relation
between MIMO and parallel channels is exploited. The theoretical proof of full
diversity is corroborated by means of numerical simulations for many MIMO
scenarios, in terms of outage probability and word error rate of LDPC coded
systems. The full-diversity and full-rate at low detection complexity comes at
a price of a small coding gain loss for outer coding rates close to one, but
this loss vanishes with decreasing coding rate.
|
[
{
"version": "v1",
"created": "Thu, 3 May 2012 12:55:08 GMT"
},
{
"version": "v2",
"created": "Fri, 11 May 2012 18:56:47 GMT"
}
] | 2012-05-14T00:00:00 |
[
[
"Duyck",
"Dieter",
""
],
[
"Yang",
"Sheng",
""
],
[
"Takawira",
"Fambirai",
""
],
[
"Boutros",
"Joseph J.",
""
],
[
"Moeneclaey",
"Marc",
""
]
] |
new_dataset
| 0.999073 |
1205.2432
|
Kamal Chauhan
|
Kamal Kumar Chauhan and Amit Kumar Singh Sanger
|
Securing Mobile Ad hoc Networks:Key Management and Routing
|
11 pages,(65-75)
|
International Journal on AdHoc Networking Systems (IJANS) Vol. 2,
No. 2, April 2012
|
10.5121/ijans.2012.2207
| null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Secure communication between two nodes in a network depends on reliable key
management systems that generate and distribute keys between communicating
nodes and a secure routing protocol that establishes a route between them. But
due to lack of central server and infrastructure in Mobile Ad hoc Networks
(MANETs), this is major problem to manage the keys in the network. Dynamically
changes in network's topology causes weak trust relationship among the nodes in
the network. In MANETs a mobile node operates as not only end terminal but also
as an intermediate router. Therefore, a multi-hop scenario occurs for
communication in MANETs; where there may be one or more malicious nodes in
between source and destination. A routing protocol is said to be secure that
detects the detrimental effects of malicious node(s in the path from source to
destination). In this paper, we proposed a key management scheme and a secure
routing protocol that secures on demand routing protocol such as DSR and AODV.
We assume that MANETs is divided into groups having a group leader in each
group. Group leader has responsibility of key management in its group. Proposed
key management scheme is a decentralized scheme that does not require any
Trusted Third Party (TTP) for key management. In proposed key management
system, both a new node and group leader authenticates each other mutually
before joining the network. While proposed secure routing protocol allows both
communicating parties as well as intermediate nodes to authenticate other nodes
and maintains message integrity
|
[
{
"version": "v1",
"created": "Fri, 11 May 2012 05:57:39 GMT"
}
] | 2012-05-14T00:00:00 |
[
[
"Chauhan",
"Kamal Kumar",
""
],
[
"Sanger",
"Amit Kumar Singh",
""
]
] |
new_dataset
| 0.997304 |
1205.2483
|
Ton Kloks
|
Maw-Shang Chang and Ton Kloks and Ching-Hao Liu
|
Edge-clique graphs of cocktail parties have unbounded rankwidth
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an attempt to find a polynomial-time algorithm for the edge-clique cover
problem on cographs we tried to prove that the edge-clique graphs of cographs
have bounded rankwidth. However, this is not the case. In this note we show
that the edge-clique graphs of cocktail party graphs have unbounded rankwidth.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2012 11:12:11 GMT"
}
] | 2012-05-14T00:00:00 |
[
[
"Chang",
"Maw-Shang",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Ching-Hao",
""
]
] |
new_dataset
| 0.999605 |
1205.2638
|
Albert Xin Jiang
|
Albert Xin Jiang, Kevin Leyton-Brown, Avi Pfeffer
|
Temporal Action-Graph Games: A New Representation for Dynamic Games
|
Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty
in Artificial Intelligence (UAI2009)
| null | null |
UAI-P-2009-PG-268-276
|
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce temporal action graph games (TAGGs), a novel
graphical representation of imperfect-information extensive form games. We show
that when a game involves anonymity or context-specific utility independencies,
its encoding as a TAGG can be much more compact than its direct encoding as a
multiagent influence diagram (MAID).We also show that TAGGs can be understood
as indirect MAID encodings in which many deterministic chance nodes are
introduced. We provide an algorithm for computing with TAGGs, and show both
theoretically and empirically that our approach improves significantly on the
previous state of the art.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2012 15:36:06 GMT"
}
] | 2012-05-14T00:00:00 |
[
[
"Jiang",
"Albert Xin",
""
],
[
"Leyton-Brown",
"Kevin",
""
],
[
"Pfeffer",
"Avi",
""
]
] |
new_dataset
| 0.999107 |
1205.2164
|
Ankit Kumar
|
Ankit Kumar, Tushar Patnaik, Vivek Kr Verma
|
Discrimination of English to other Indian languages (Kannada and Hindi)
for OCR system
|
9 Pages, 5 Figure, 5 Tables, International Journal of Computer
Science, Engineering and Applications (IJCSEA) Vol.2, No.2, April 2012
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
India is a multilingual multi-script country. In every state of India there
are two languages one is state local language and the other is English. For
example in Andhra Pradesh, a state in India, the document may contain text
words in English and Telugu script. For Optical Character Recognition (OCR) of
such a bilingual document, it is necessary to identify the script before
feeding the text words to the OCRs of individual scripts. In this paper, we are
introducing a simple and efficient technique of script identification for
Kannada, English and Hindi text words of a printed document. The proposed
approach is based on the horizontal and vertical projection profile for the
discrimination of the three scripts. The feature extraction is done based on
the horizontal projection profile of each text words. We analysed 700 different
words of Kannada, English and Hindi in order to extract the discrimination
features and for the development of knowledge base. We use the horizontal
projection profile of each text word and based on the horizontal projection
profile we extract the appropriate features. The proposed system is tested on
100 different document images containing more than 1000 text words of each
script and a classification rate of 98.25%, 99.25% and 98.87% is achieved for
Kannada, English and Hindi respectively.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2012 06:14:51 GMT"
}
] | 2012-05-11T00:00:00 |
[
[
"Kumar",
"Ankit",
""
],
[
"Patnaik",
"Tushar",
""
],
[
"Verma",
"Vivek Kr",
""
]
] |
new_dataset
| 0.999171 |
1205.2345
|
Salah A. Aly
|
Hossam Zawbaa and Salah A. Aly
|
Hajj and Umrah Event Recognition Datasets
|
4 pages, 18 figures with 33 images
| null | null | null |
cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note, new Hajj and Umrah Event Recognition datasets (HUER) are
presented. The demonstrated datasets are based on videos and images taken
during 2011-2012 Hajj and Umrah seasons. HUER is the first collection of
datasets covering the six types of Hajj and Umrah ritual events (rotating in
Tawaf around Kabaa, performing Sa'y between Safa and Marwa, standing on the
mount of Arafat, staying overnight in Muzdalifah, staying two or three days in
Mina, and throwing Jamarat). The HUER datasets also contain video and image
databases for nine types of human actions during Hajj and Umrah (walking,
drinking from Zamzam water, sleeping, smiling, eating, praying, sitting,
shaving hairs and ablutions, reading the holy Quran and making duaa). The
spatial resolutions are 1280 x 720 pixels for images and 640 x 480 pixels for
videos and have lengths of 20 seconds in average with 30 frame per second
rates.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2012 19:10:18 GMT"
}
] | 2012-05-11T00:00:00 |
[
[
"Zawbaa",
"Hossam",
""
],
[
"Aly",
"Salah A.",
""
]
] |
new_dataset
| 0.999724 |
1205.2352
|
Samir Medjiah
|
Samir Medjiah (LaBRI), Toufik Ahmed (LaBRI)
|
Orion Routing Protocol for Delay-Tolerant Networks
| null |
IEEE International Conference on Communications (ICC), 2011, Kyoto
: Japan (2011)
|
10.1109/icc.2011.5963362
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of efficient routing in delay tolerant
network. We propose a new routing protocol dubbed as ORION. In ORION, only a
single copy of a data packet is kept in the network and transmitted, contact by
contact, towards the destination. The aim of the ORION routing protocol is
twofold: on one hand, it enhances the delivery ratio in networks where an
end-to-end path does not necessarily exist, and on the other hand, it minimizes
the routing delay and the network overhead to achieve better performance. In
ORION, nodes are aware of their neighborhood by the mean of actual and
statistical estimation of new contacts. ORION makes use of autoregressive
moving average (ARMA) stochastic processes for best contact prediction and
geographical coordinates for optimal greedy data packet forwarding. Simulation
results have demonstrated that ORION outperforms other existing DTN routing
protocols such as PRoPHET in terms of end-to-end delay, packet delivery ratio,
hop count and first packet arrival.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2012 19:16:43 GMT"
}
] | 2012-05-11T00:00:00 |
[
[
"Medjiah",
"Samir",
"",
"LaBRI"
],
[
"Ahmed",
"Toufik",
"",
"LaBRI"
]
] |
new_dataset
| 0.998352 |
1205.2357
|
Samir Medjiah
|
Samir Medjiah (LaBRI), Toufik Ahmed (LaBRI), Abolghasem Hamid Asgari
(TRT UK)
|
Streaming multimedia over WMSNs: an online multipath routing protocol
| null |
International Journal of Sensor Networks 11, 1 (2012) 10-21
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Routing is a challenge to Wireless Multimedia Sensor Networks (WMSNs) for
supporting multimedia applications due to nodes' energy constraints and
computational capabilities, and the ways sensor nodes obtain forwarding
information. In this paper, we propose an online multipath routing protocol
that uses nodes' positions to make forwarding decisions at each hop. Real-time
decisions are made without any need to have the entire network topology
knowledge. The protocol achieves load-balancing and minimises nodes' energy
consumption by utilizing: (a) smart greedy forwarding scheme for selecting next
hop, and (b) walking back forwarding scheme to bypass network holes.
Performance comparisons of the proposed protocol (schemes) are made with TPGF
and GPSR. The results show that our schemes: (a) maximise the overall network
lifespan by not draining energy from some specific nodes, (b) provide QoS
delivery for video streams by using best nodes along the route, and (c) scale
better in high density WMSN.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2012 19:21:07 GMT"
}
] | 2012-05-11T00:00:00 |
[
[
"Medjiah",
"Samir",
"",
"LaBRI"
],
[
"Ahmed",
"Toufik",
"",
"LaBRI"
],
[
"Asgari",
"Abolghasem Hamid",
"",
"TRT UK"
]
] |
new_dataset
| 0.998436 |
1205.1823
|
Anna-Lena Trautmann
|
Anna-Lena Trautmann
|
Pl\"ucker Embedding of Cyclic Orbit Codes
|
to appear in Proceedings of the 20th International Symposium on
Mathematical Theory of Networks and Systems 2012, Melbourne, Australia
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic orbit codes are a family of constant dimension codes used for random
network coding. We investigate the Pl\"ucker embedding of these codes and show
how to efficiently compute the Grassmann coordinates of the code words.
|
[
{
"version": "v1",
"created": "Tue, 8 May 2012 20:52:28 GMT"
}
] | 2012-05-10T00:00:00 |
[
[
"Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.999572 |
1205.1886
|
Ishit Makwana
|
Ishit Makwana, Vitrag Sheth
|
A low power high bandwidth four quadrant analog multiplier in 32 nm
CNFET technology
| null |
International Journal of VLSI design & Communication Systems
(VLSICS) Vol.3, No.2, April 2012, 73-83
|
10.5121/vlsic.2012.3207
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Carbon Nanotube Field Effect Transistor (CNFET) is a promising new technology
that overcomes several limitations of traditional silicon integrated circuit
technology. In recent years, the potential of CNFET for analog circuit
applications has been explored. This paper proposes a novel four quadrant
analog multiplier design using CNFETs. The simulation based on 32nm CNFET
technology shows that the proposed multiplier has very low harmonic distortion
(<0.45%), large input range ({\pm}400mV), large bandwidth (~50GHz) and low
power consumption (~247{\mu}W), while operating at a supply voltage of
{\pm}0.9V.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2012 07:16:28 GMT"
}
] | 2012-05-10T00:00:00 |
[
[
"Makwana",
"Ishit",
""
],
[
"Sheth",
"Vitrag",
""
]
] |
new_dataset
| 0.989171 |
1205.2007
|
Asif Khan Mr
|
Ahmed Barnawi, Nadine Akkari, Muhammad Emran, Asif Irshad Khan
|
Deploying SIP-based Mobile Exam Application onto Next Generation Network
testbed
|
6 Pages, Electronics, Communications and Photonics Conference
(SIECPC), 2011 Saudi International, Riyadh, KSA, 24-26 April 2011
|
IEEE Xplore, E-ISBN: 978-1-4577-0067-5 ,April 2011
|
10.1109/SIECPC.2011.5876936
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past few years, mobile operators are faced with enormous challenges.
Of such challenges, evolved user demands on personalized applications.
Telecommunications industry as well as research community have paid enormous
attention to Next Generation Networks (NGN) to address this challenge. NGN is
perceived as a sophisticated platform where both application developers and
mobile operators cooperate to develop user applications with enhanced quality
of experience. The objective of this paper is twofold: first we present an
introduction to state-of-the-art NGN testbed to be developed at KAU, and second
we provide initial analysis for deploying a mobile application on top of the
testbed.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2012 10:09:43 GMT"
}
] | 2012-05-10T00:00:00 |
[
[
"Barnawi",
"Ahmed",
""
],
[
"Akkari",
"Nadine",
""
],
[
"Emran",
"Muhammad",
""
],
[
"Khan",
"Asif Irshad",
""
]
] |
new_dataset
| 0.97148 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.