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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1312.5704
|
Ahmed Ben Achballah
|
Ahmed Ben Achballah, Slim Ben Othman and Slim Ben Saoud
|
Design of Field Programmable Gate Array (FPGA) Based Emulators for Motor
Control Applications
| null |
Am J. Applied Sci., 9: 1166-1181
|
10.3844/ajassp.2012.1166.1181
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Problem Statement: Field Programmable Gate Array (FPGA) circuits play a
significant role in major recent embedded process control designs. However,
exploiting these platforms requires deep hardware conception skills and remains
an important time consuming stage in a design flow. High Level Synthesis
technique avoids this bottleneck and increases design productivity as witnessed
by industry specialists. Approach: This study proposes to apply this technique
for the conception and implementation of a Real Time Direct Current Machine
(RTDCM) emulator for an embedded control application. Results: Several
FPGA-based configuration scenarios are studied. A series of tests including
design and timing-precision analysis were conducted to discuss and validate the
obtained hardware architectures. Conclusion/Recommendations: The proposed
methodology has accelerated the design time besides it has provided an extra
time to refine the hardware core of the DCM emulator. The high level synthesis
technique can be applied to the control field especially to test with low cost
and short delays newest algorithms and motor models.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 19:09:18 GMT"
}
] | 2013-12-20T00:00:00 |
[
[
"Achballah",
"Ahmed Ben",
""
],
[
"Othman",
"Slim Ben",
""
],
[
"Saoud",
"Slim Ben",
""
]
] |
new_dataset
| 0.998871 |
1312.5067
|
Anita Das
|
Anita Das, P. Suresh, S. V. Subrahmanya
|
Rainbow path and color degree in edge colored graphs
|
4 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $G$ be an edge colored graph. A {\it}{rainbow path} in $G$ is a path in
which all the edges are colored with distinct colors. Let $d^c(v)$ be the color
degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on
the edges incident on the vertex $v$. Let $t$ be the maximum length of a
rainbow path in $G$. Chen and Li showed that if $d^c \geq k$, for every vertex
$v$ of $G$, then $t \geq \left \lceil \frac{3 k}{5}\right \rceil + 1$ (Long
heterochromatic paths in edge-colored graphs, The Electronic Journal of
Combinatorics 12 (2005), # R33, Pages:1-33.) Unfortunately, proof by Chen and
Li is very long and comes to about 23 pages in the journal version. Chen and Li
states in their paper that it was conjectured by Akira Saito, that $t \ge \left
\lceil \frac {2k} {3} \right \rceil$. They also states in their paper that they
believe $t \ge k - c$ for some constant $c$.
In this note, we give a short proof to show that $t \ge \left \lceil \frac{3
k}{5}\right \rceil$, using an entirely different method. Our proof is only
about 2 pages long. The draw-back is that our bound is less by 1, than the
bound given by Chen and Li. We hope that the new approach adopted in this paper
would eventually lead to the settlement of the conjectures by Saito and/or Chen
and Li.
|
[
{
"version": "v1",
"created": "Wed, 18 Dec 2013 09:17:36 GMT"
}
] | 2013-12-19T00:00:00 |
[
[
"Das",
"Anita",
""
],
[
"Suresh",
"P.",
""
],
[
"Subrahmanya",
"S. V.",
""
]
] |
new_dataset
| 0.975444 |
1312.5097
|
Alexander Darer
|
Alexander Darer and Peter Lewis
|
A Cellular Automaton Based Controller for a Ms. Pac-Man Agent
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video games can be used as an excellent test bed for Artificial Intelligence
(AI) techniques. They are challenging and non-deterministic, this makes it very
difficult to write strong AI players. An example of such a video game is Ms.
Pac-Man. In this paper we will outline some of the previous techniques used to
build AI controllers for Ms. Pac-Man as well as presenting a new and novel
solution. My technique utilises a Cellular Automaton (CA) to build a
representation of the environment at each time step of the game. The basis of
the representation is a 2-D grid of cells. Each cell has a state and a set of
rules which determine whether or not that cell will dominate (i.e. pass its
state value onto) adjacent cells at each update. Once a certain number of
update iterations have been completed, the CA represents the state of the
environment in the game, the goals and the dangers. At this point, Ms. Pac-Man
will decide her next move based only on her adjacent cells, that is to say, she
has no knowledge of the state of the environment as a whole, she will simply
follow the strongest path. This technique shows promise and allows the
controller to achieve high scores in a live game, the behaviour it exhibits is
interesting and complex. Moreover, this behaviour is produced by using very
simple rules which are applied many times to each cell in the grid. Simple
local interactions with complex global results are truly achieved.
|
[
{
"version": "v1",
"created": "Wed, 18 Dec 2013 11:08:05 GMT"
}
] | 2013-12-19T00:00:00 |
[
[
"Darer",
"Alexander",
""
],
[
"Lewis",
"Peter",
""
]
] |
new_dataset
| 0.997776 |
1312.5138
|
Yongcai Wang
|
Lei Song, Yongcai Wang
|
Locating Multiple Ultrasound Targets in Chorus
|
9 pages
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Ranging by Time of Arrival (TOA) of Narrow-band ultrasound (NBU) has been
widely used by many locating systems for its characteristics of low cost and
high accuracy. However, because it is hard to support code division multiple
access in narrowband signal, to track multiple targets, existing NBU-based
locating systems generally need to assign exclusive time slot to each target to
avoid the signal conflicts. Because the propagation speed of ultrasound is slow
in air, dividing exclusive time slots on a single channel causes the location
updating rate for each target rather low, leading to unsatisfied tracking
performances as the number of targets increases. In this paper, we investigated
a new multiple target locating method using NBU, called UltraChorus, which is
to locate multiple targets while allowing them sending NBU signals
simultaneously, i.e., in chorus mode. It can dramatically increase the location
updating rate. In particular, we investigated by both experiments and
theoretical analysis on the necessary and sufficient conditions for resolving
the conflicts of multiple NBU signals on a single channel, which is referred as
the conditions for chorus ranging and chorus locating. To tackle the difficulty
caused by the anonymity of the measured distances, we further developed
consistent position generation algorithm and probabilistic particle filter
algorithm}to label the distances by sources, to generate reasonable location
estimations, and to disambiguate the motion trajectories of the multiple
concurrent targets based on the anonymous distance measurements. Extensive
evaluations by both simulation and testbed were carried out, which verified the
effectiveness of our proposed theories and algorithms.
|
[
{
"version": "v1",
"created": "Sat, 14 Dec 2013 07:47:51 GMT"
}
] | 2013-12-19T00:00:00 |
[
[
"Song",
"Lei",
""
],
[
"Wang",
"Yongcai",
""
]
] |
new_dataset
| 0.974897 |
1312.5257
|
Hemant Saggar
|
Hemant Saggar, D.K. Mehra
|
Cyclostationary Spectrum Sensing in Cognitive Radios Using FRESH Filters
|
Presented at Advances in Wireless Cellular Telecommunications:
Technologies & Services, 1st ICEIT National Conference on, April 14-15, 2011,
New Delhi
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with spectrum sensing in Cognitive Radios to enable
unlicensed secondary users to opportunistically access a licensed band. The
ability to detect the presence of a primary user at a low signal to noise ratio
(SNR) is a challenging prerequisite to spectrum sensing and earlier proposed
techniques like energy detection and cyclostationary detection have only been
partially successful. This paper proposes the use of FRESH (FREquency SHift)
filters [1] to enable spectrum sensing at low SNR by optimally estimating a
cyclostationary signal using its spectral coherence properties. We establish
the mean square error convergence of the adaptive FRESH filter through
simulation. Subsequently, we formulate a cyclostationarity based binary
hypothesis test on the filtered signal and observe the resultant detection
performance. Simulation results show that the proposed approach performs better
than energy detection and cyclostationary detection techniques for spectrum
sensing.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 18:03:10 GMT"
}
] | 2013-12-19T00:00:00 |
[
[
"Saggar",
"Hemant",
""
],
[
"Mehra",
"D. K.",
""
]
] |
new_dataset
| 0.995337 |
1206.2656
|
Couvreur Alain
|
Alain Couvreur, Nicolas Delfosse, Gilles Z\'emor
|
A Construction of Quantum LDPC Codes from Cayley Graphs
|
The material in this paper was presented in part at ISIT 2011. This
article is published in IEEE Transactions on Information Theory. We point out
that the second step of the proof of Proposition VI.2 in the published
version (Proposition 25 in the present version and Proposition 18 in the ISIT
extended abstract) is not strictly correct. This issue is addressed in the
present version
|
IEEE Trans. Inform. Theory. 59(9). 6087-6098. 2013
| null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison
and Shokrollahi. It is based on the Cayley graph of Fn together with a set of
generators regarded as the columns of the parity-check matrix of a classical
code. We give a general lower bound on the minimum distance of the Quantum code
in $\mathcal{O}(dn^2)$ where d is the minimum distance of the classical code.
When the classical code is the $[n, 1, n]$ repetition code, we are able to
compute the exact parameters of the associated Quantum code which are $[[2^n,
2^{\frac{n+1}{2}}, 2^{\frac{n-1}{2}}]]$.
|
[
{
"version": "v1",
"created": "Tue, 12 Jun 2012 20:11:53 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Feb 2013 12:48:38 GMT"
},
{
"version": "v3",
"created": "Tue, 17 Dec 2013 16:12:19 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Couvreur",
"Alain",
""
],
[
"Delfosse",
"Nicolas",
""
],
[
"Zémor",
"Gilles",
""
]
] |
new_dataset
| 0.999362 |
1304.2263
|
Alexander Barg
|
Alexander Barg, Luciano V. Felix, Marcelo Firer, and Marcos V.P.
Spreafico
|
Linear codes on posets with extension property
|
Final version; 18pp
|
Discrete Mathematics, vol. 317, 2014, pp. 1-13
|
10.1016/j.disc.2013.11.001
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate linear and additive codes in partially ordered Hamming-like
spaces that satisfy the extension property, meaning that automorphisms of
ideals extend to automorphisms of the poset. The codes are naturally described
in terms of translation association schemes that originate from the groups of
linear isometries of the space. We address questions of duality and invariants
of codes, establishing a connection between the dual association scheme and the
scheme defined on the dual poset (they are isomorphic if and only if the poset
is self-dual). We further discuss invariants that play the role of weight
enumerators of codes in the poset case. In the case of regular rooted trees
such invariants are linked to the classical problem of tree isomorphism. We
also study the question of whether these invariants are preserved under
standard operations on posets such as the ordinal sum and the like.
|
[
{
"version": "v1",
"created": "Mon, 8 Apr 2013 16:40:47 GMT"
},
{
"version": "v2",
"created": "Wed, 29 May 2013 21:34:36 GMT"
},
{
"version": "v3",
"created": "Tue, 17 Dec 2013 04:56:35 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Felix",
"Luciano V.",
""
],
[
"Firer",
"Marcelo",
""
],
[
"Spreafico",
"Marcos V. P.",
""
]
] |
new_dataset
| 0.995367 |
1305.3248
|
Laszlo Kish
|
Laszlo B. Kish, Chiman Kwan
|
Physical uncloneable function hardware keys utilizing
Kirchhoff-law-Johnson-noise secure key exchange and noise-based logic
|
some clarifications/enhancements; in publication process
|
Fluct. Noise Lett. 12, 1350018 (2013)
|
10.1142/S0219477513500181
| null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
Weak physical uncloneable function (WPUF) encryption key means that the
manufacturer of the hardware can clone the key but anybody else is unable to so
that. Strong physical uncloneable function (SPUF) encryption key means that
even the manufacturer of the hardware is unable to clone the key. In this
paper, first we introduce a "ultra"-strong PUF with intrinsic dynamical
randomness, which is not only not cloneable but it also gets renewed to an
independent key (with fresh randomness) during each use via the unconditionally
secure key exchange. The solution utilizes the Kirchhoff-law-Johnson-noise
(KLJN) method for dynamical key renewal and a one-time-pad secure key for the
challenge/response process. The secure key is stored in a flash memory on the
chip to provide tamper-resistance and non-volatile storage with zero power
requirements in standby mode. Simplified PUF keys are shown: a strong PUF
utilizing KLJN protocol during the first run and noise-based logic (NBL)
hyperspace vector string verification method for the challenge/response during
the rest of its life or until it is re-initialized. Finally, the simplest PUF
utilizes NBL without KLJN thus it can be cloned by the manufacturer but not by
anybody else.
|
[
{
"version": "v1",
"created": "Sun, 12 May 2013 02:51:16 GMT"
},
{
"version": "v2",
"created": "Tue, 21 May 2013 11:35:14 GMT"
},
{
"version": "v3",
"created": "Fri, 26 Jul 2013 23:27:39 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Kish",
"Laszlo B.",
""
],
[
"Kwan",
"Chiman",
""
]
] |
new_dataset
| 0.998671 |
1312.4598
|
Yasutake Takahashi
|
Tohru Ishii, Yasutake Takahashi, Yoichiro Maeda, and Takayuki Nakamura
|
Tethered Flying Robot for Information Gathering System
|
6 pages, 16 figures, ROSIN2013
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information from the sky is important for rescue activity in large-scale
disaster or dangerous areas. Observation system using a balloon or an airplane
has been studied as an information gathering system from the sky. A balloon
observation system needs helium gas and relatively long time to be ready. An
airplane observation system can be prepared in a short time and its mobility is
good. However, a long time flight is difficult because of limited amount of
fuel.
This paper proposes a kite-based observation system that complements
activities of balloon and airplane observation systems by short preparation
time and long time flight. This research aims at construction of the autonomous
flight information gathering system using a tethered flying unit that consists
of the kite and the ground tether line control unit with a winding machine.
This paper reports development of the kite type tethered flying robot and an
autonomous flying control system inspired by how to fly a kite by a human.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 00:25:42 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Ishii",
"Tohru",
""
],
[
"Takahashi",
"Yasutake",
""
],
[
"Maeda",
"Yoichiro",
""
],
[
"Nakamura",
"Takayuki",
""
]
] |
new_dataset
| 0.988747 |
1312.4742
|
J\"urgen M\"unch
|
Alexis Ocampo, Fabio Bella, J\"urgen M\"unch
|
Software Process Commonality Analysis
|
26 pages. The final publication is available at
http://onlinelibrary.wiley.com/doi/10.1002/spip.229/abstract
|
International Journal on Software Process: Improvement and
Practice, 10(3):273-285, 2005
|
10.1002/spip.229
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To remain viable and thrive, software organizations must rapidly adapt to
frequent, and often rather far-ranging, changes to their operational context.
These changes typically concern many factors, including the nature of the
organization's marketplace in general, its customers' demands, and its business
needs. In today's most highly dynamic contexts, such as web services
development, other changes create additional, severe challenges. Most critical
are changes to the technology in which a software product is written or which
the software product has to control or use to provide its functionality. These
product-support technology changes are frequently relatively 'small' and
incremental. They are, therefore, often handled by relatively 'small,'
incremental changes to the organization's software processes. However, the
frequency of these changes is high, and their impact is elevated by
time-to-market and requirements change demands. The net result is an extremely
challenging need to create and manage a large number of customized process
variants, collectively having more commonalities than differences, and
incorporating experience-based, proven 'best practices'. This paper describes a
tool-based approach to coping with product-support technology changes. The
approach utilizes established capabilities such as descriptive process modeling
and the creation of reference models. It incorporates a new, innovative,
tool-based capability to analyze commonalities and differences among processes.
The paper includes an example-based evaluation of the approach in the domain of
Wireless Internet Services as well as a discussion of its potentially broader
application.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 12:19:21 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Ocampo",
"Alexis",
""
],
[
"Bella",
"Fabio",
""
],
[
"Münch",
"Jürgen",
""
]
] |
new_dataset
| 0.961879 |
1312.4752
|
Ricardo Martins
|
Ricardo Martins
|
BW - Eye Ophthalmologic decision support system based on clinical
workflow and data mining techniques-image registration algorithm
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blueworks - Medical Expert Diagnosis is developing an application, BWEye, to
be used as an ophthalmology consultation decision support system. The
implementation of this application involves several different tasks and one of
them is the implementation of an ophthalmology images registration algorithm.
The work reported in this document is related with the implementation of an
algorithm to register images of angiography, colour retinography and redfree
retinography. The implementations described were developed in the software
MATLAB.
The implemented algorithm is based in the detection of the bifurcation points
(y-features) of the vascular structures of the retina that usually are visible
in the referred type of images. There are proposed two approaches to establish
an initial set of features correspondences. The first approach is based in the
maximization of the mutual information of the bifurcation regions of the
features of images. The second approach is based in the characterization of
each bifurcation point and in the minimization of the Euclidean distance
between the descriptions of the features of the images in the descriptors
space. The final set of the matching features for a pair of images is defined
through the application of the RANSAC algorithm.
Although, it was not achieved the implementation of a full functional
algorithm, there were made several analysis that can be important to future
improvement of the current implementation.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 12:41:39 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Martins",
"Ricardo",
""
]
] |
new_dataset
| 0.996309 |
1312.4853
|
Philip Healy
|
Philip Healy, Stefan Meyer, John Morrison, Theo Lynn, Ashkan Paya, Dan
C. Marinescu
|
Bid-Centric Cloud Service Provisioning
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bid-centric service descriptions have the potential to offer a new cloud
service provisioning model that promotes portability, diversity of choice and
differentiation between providers. A bid matching model based on requirements
and capabilities is presented that provides the basis for such an approach. In
order to facilitate the bidding process, tenders should be specified as
abstractly as possible so that the solution space is not needlessly restricted.
To this end, we describe how partial TOSCA service descriptions allow for a
range of diverse solutions to be proposed by multiple providers in response to
tenders. Rather than adopting a lowest common denominator approach, true
portability should allow for the relative strengths and differentiating
features of cloud service providers to be applied to bids. With this in mind,
we describe how TOSCA service descriptions could be augmented with additional
information in order to facilitate heterogeneity in proposed solutions, such as
the use of coprocessors and provider-specific services.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 16:33:14 GMT"
}
] | 2013-12-18T00:00:00 |
[
[
"Healy",
"Philip",
""
],
[
"Meyer",
"Stefan",
""
],
[
"Morrison",
"John",
""
],
[
"Lynn",
"Theo",
""
],
[
"Paya",
"Ashkan",
""
],
[
"Marinescu",
"Dan C.",
""
]
] |
new_dataset
| 0.987054 |
1208.6391
|
Jalil Boukhobza
|
Pierre Olivier (Lab-STICC), Jalil Boukhobza (Lab-STICC), Eric Senn
(Lab-STICC)
|
On Benchmarking Embedded Linux Flash File Systems
|
Embed With Linux, Lorient : France (2012)
|
ACM SIGBED Review 9(2) 43-47 9, 2 (2012) 43-47
| null | null |
cs.OS cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to its attractive characteristics in terms of performance, weight and
power consumption, NAND flash memory became the main non volatile memory (NVM)
in embedded systems. Those NVMs also present some specific
characteristics/constraints: good but asymmetric I/O performance, limited
lifetime, write/erase granularity asymmetry, etc. Those peculiarities are
either managed in hardware for flash disks (SSDs, SD cards, USB sticks, etc.)
or in software for raw embedded flash chips. When managed in software, flash
algorithms and structures are implemented in a specific flash file system
(FFS). In this paper, we present a performance study of the most widely used
FFSs in embedded Linux: JFFS2, UBIFS,and YAFFS. We show some very particular
behaviors and large performance disparities for tested FFS operations such as
mounting, copying, and searching file trees, compression, etc.
|
[
{
"version": "v1",
"created": "Fri, 31 Aug 2012 06:32:38 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Olivier",
"Pierre",
"",
"Lab-STICC"
],
[
"Boukhobza",
"Jalil",
"",
"Lab-STICC"
],
[
"Senn",
"Eric",
"",
"Lab-STICC"
]
] |
new_dataset
| 0.988678 |
1308.0311
|
Armen Bagdasaryan
|
Armen Bagdasaryan
|
On the partition of R^n by hyperplanes
|
This paper has been withdrawn by the author because, as the author
became aware, some results are not new
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The partitioning of space by hyperplanes in the context of discrete
classification problem is considered. We obtain some relations for the number
of partitions and establish a recurrence relation for the maximal number of
partitions of R^n by m hyperplanes. We rederive an explicit formula for the
number of components into which the space can be partitioned by m hyperplanes.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 17:20:04 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Dec 2013 22:42:41 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Bagdasaryan",
"Armen",
""
]
] |
new_dataset
| 0.973049 |
1312.4042
|
Mina Mishra
|
Mina Mishra, Vijay H. Mankar
|
Chaotic Encryption Scheme Using 1-D Chaotic Map
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes three different chaotic encryption methods using 1-D
chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR
according to the name of chaotic map and non-linear function involved in the
scheme. The designed schemes have been crypt analyzed for five different
methods for testing its strength. Cryptanalysis has been performed for various
texts using various keys selected from domain of key space. Logistic and NLFSR
methods are found to resist known plaintext attack for available first two
characters of plaintext. Plaintext sensitivity of both methods is within small
range along with medium key sensitivity. Identifiability for keys of first two
of the scheme has not been derived concluding that methods may prove to be weak
against brute-force attack. In the last modified scheme avalanche effect found
to be improved compared to the previous ones and method is found to resist
brute-force attack as it derives the conclusion for identifiability.
|
[
{
"version": "v1",
"created": "Sat, 14 Dec 2013 13:12:55 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Mishra",
"Mina",
""
],
[
"Mankar",
"Vijay H.",
""
]
] |
new_dataset
| 0.997514 |
1312.4044
|
Mohammed El-Dosuky
|
M. A. El-Dosuky
|
CACO : Competitive Ant Colony Optimization, A Nature-Inspired
Metaheuristic For Large-Scale Global Optimization
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale problems are nonlinear problems that need metaheuristics, or
global optimization algorithms. This paper reviews nature-inspired
metaheuristics, then it introduces a framework named Competitive Ant Colony
Optimization inspired by the chemical communications among insects. Then a case
study is presented to investigate the proposed framework for large-scale global
optimization.
|
[
{
"version": "v1",
"created": "Sat, 14 Dec 2013 13:33:48 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"El-Dosuky",
"M. A.",
""
]
] |
new_dataset
| 0.998354 |
1312.4071
|
Srinjoy Ganguly Mr.
|
Srinjoy Ganguly, Arpita Chakraborty and Mrinal Kanti Naskar
|
A Trust-based Framework for Congestion-aware Energy Efficient Routing in
Wireless Multimedia Sensor Networks
|
5 pages, 3 figures and 0 tables. Poster Paper at the Student Research
Symposium of the International Conference on High Performance Computing
(HiPC), 2013
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new era in wireless sensor network technology has been ushered in through
the introduction of multimedia sensor networks, which has a major bottleneck in
the form of network congestion. Congestion occurs when resources are in high
demand during the active period while the data processing and transmission
speeds lag behind the speed of the incoming traffic. This may disrupt normal
network operations by buffer overflow, packet loss, increased latency,
excessive energy consumption and even worse, a collapse of the entire
operation. In this paper we propose a novel Trust Integrated Congestion-aware
Energy Efficient Routing algorithm (TCEER) in which the potential of a node is
computed using its trust value, congestion status, residual energy, distance
from the current packet-forwarding node and the distance from the base station
using a Fuzzy Logic Controller. The source node selects the node of highest
potential in its one hop radio range for data transmission. Hop by hop data
routing from source to base station is obtained which is light-weight as well
as energy-efficient. Finally, the merits of the proposed scheme are discussed
by comparing it with the existing protocols and the study shows promising
improvements in network performance.
|
[
{
"version": "v1",
"created": "Sat, 14 Dec 2013 17:49:43 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Ganguly",
"Srinjoy",
""
],
[
"Chakraborty",
"Arpita",
""
],
[
"Naskar",
"Mrinal Kanti",
""
]
] |
new_dataset
| 0.961265 |
1312.4139
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Towards slime mould colour sensor: Recognition of colours by Physarum
polycephalum
| null |
Adamatzky A. Towards slime mould colour sensor: Recognition of
colours by Physarum polycephalum. Organic Electronics 14 (2013) 12, 3355-3361
| null | null |
cs.ET physics.bio-ph q-bio.CB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Acellular slime mould Physarum polycephalum is a popular now user-friendly
living substrate for designing of future and emergent sensing and computing
devices. P. polycephalum exhibits regular patterns of oscillations of its
surface electrical potential. The oscillation patterns are changed when the
slime mould is subjected to mechanical, chemical, electrical or optical
stimuli. We evaluate feasibility of slime-mould based colour sensors by
illuminating Physarum with red, green, blue and white colours and analysing
patterns of the slime mould's electrical potential oscillations. We define that
the slime mould recognises a colour if it reacts to illumination with the
colour by a unique changes in amplitude and periods of oscillatory activity. In
laboratory experiments we found that the slime mould recognises red and blue
colour. The slime mould does not differentiate between green and white colours.
The slime mould also recognises when red colour is switched off. We also map
colours to diversity of the oscillations: illumination with a white colour
increases diversity of amplitudes and periods of oscillations, other colours
studied increase diversity either of amplitude or period.
|
[
{
"version": "v1",
"created": "Sun, 15 Dec 2013 12:02:44 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.951127 |
1312.4189
|
Andrew Adamatzky
|
James G.H. Whiting, Ben P.J. de Lacy Costello, Andrew Adamatzky
|
Towards slime mould chemical sensor: Mapping chemical inputs onto
electrical potential dynamics of Physarum Polycephalum
| null |
Sensors and Actuators B: Chemical 191 (2014) 844-853
| null | null |
cs.ET physics.bio-ph q-bio.CB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We experimentally derived a unique one-to-one mapping between a range of
selected bioactive chemicals and patterns of oscillations of the slime mould's
extacellular electrical potential.
|
[
{
"version": "v1",
"created": "Sun, 15 Dec 2013 20:48:34 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Whiting",
"James G. H.",
""
],
[
"Costello",
"Ben P. J. de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.987028 |
1312.4322
|
Stephen Bryson
|
Steve Bryson
|
Virtual Reality: A Definition History - A Personal Essay
|
6 pages
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This essay, written in 1998 by an active participant in both virtual reality
development and the virtual reality definition debate, discusses the definition
of the phrase "Virtual Reality" (VR). I start with history from a personal
perspective, concentrating on the debate between the "Virtual Reality" and
"Virtual Environment" labels in the late 1980's and early 1990's. Definitions
of VR based on specific technologies are shown to be unsatisfactory. I propose
the following definition of VR, based on the striking effects of a good VR
system: "Virtual Reality is the use of computer technology to create the effect
of an interactive three-dimensional world in which the objects have a sense of
spatial presence." The justification for this definition is discussed in
detail, and is favorably compared with the dictionary definitions of "virtual"
and "reality". The implications of this definition for virtual reality
technology are briefly examined.
|
[
{
"version": "v1",
"created": "Mon, 16 Dec 2013 11:33:06 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Bryson",
"Steve",
""
]
] |
new_dataset
| 0.987934 |
1312.4333
|
Marius Buliga
|
Marius Buliga and Louis H. Kauffman
|
GLC actors, artificial chemical connectomes, topological issues and
knots
| null | null | null | null |
cs.DC math.GT math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on graphic lambda calculus, we propose a program for a new model of
asynchronous distributed computing, inspired from Hewitt Actor Model, as well
as several investigation paths, concerning how one may graft lambda calculus
and knot diagrammatics.
|
[
{
"version": "v1",
"created": "Mon, 16 Dec 2013 12:40:25 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Buliga",
"Marius",
""
],
[
"Kauffman",
"Louis H.",
""
]
] |
new_dataset
| 0.987443 |
1312.4398
|
Shantanu Chhabra
|
Shantanu Chhabra
|
On the number of proper $k$-colorings in an $n$-gon
|
8 pages, 2 tables
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define an $n$-gon to be any convex polygon with $n$ vertices. Let $V$
represent the set of vertices of the polygon. A proper $k$-coloring refers to a
function, $f$ : $V$ $\rightarrow$ $\{1, 2, 3, ... k\}$, such that for any two
vertices $u$ and $v$, if $f(u) = f(v)$, $u$ is not adjacent to $v$. The purpose
of this paper is to develop a recursive algorithm to compute the number of
proper $k$-colorings in an $n$-gon. The proposed algorithm can easily be solved
to obtain the explicit expression. This matches the explicit expression
obtained from the popular conventional solutions, which confirms the
correctness of the proposed algorithm. Often, for huge values of $n$ and $k$,
it becomes impractical to display the output numbers, which would consist of
thousands of digits. We report the answer modulo a certain number. In such
situations, the proposed algorithm is observed to run slightly faster than the
conventional recursive algorithm.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 18:08:28 GMT"
}
] | 2013-12-17T00:00:00 |
[
[
"Chhabra",
"Shantanu",
""
]
] |
new_dataset
| 0.956855 |
0902.2969
|
Giorgi Japaridze
|
Giorgi Japaridze
|
Ptarithmetic
|
Substantially better versions are on their way. Hence the present
article probably will not be published
|
The Baltic International Yearbook on Cognition, Logic and
Communication 8 (2013), Article 5, pp. 1-186
|
10.4148/1944-3676.1074
| null |
cs.LO cs.AI cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present article introduces ptarithmetic (short for "polynomial time
arithmetic") -- a formal number theory similar to the well known Peano
arithmetic, but based on the recently born computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html) instead of classical logic. The
formulas of ptarithmetic represent interactive computational problems rather
than just true/false statements, and their "truth" is understood as existence
of a polynomial time solution. The system of ptarithmetic elaborated in this
article is shown to be sound and complete. Sound in the sense that every
theorem T of the system represents an interactive number-theoretic
computational problem with a polynomial time solution and, furthermore, such a
solution can be effectively extracted from a proof of T. And complete in the
sense that every interactive number-theoretic problem with a polynomial time
solution is represented by some theorem T of the system.
The paper is self-contained, and can be read without any previous familiarity
with computability logic.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2009 19:14:09 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Feb 2009 12:48:43 GMT"
},
{
"version": "v3",
"created": "Fri, 26 Feb 2010 10:17:31 GMT"
}
] | 2013-12-16T00:00:00 |
[
[
"Japaridze",
"Giorgi",
""
]
] |
new_dataset
| 0.999455 |
1306.5005
|
Matthew Patitz
|
Tyler Fochtman, Jacob Hendricks, Jennifer E. Padilla, Matthew J.
Patitz, and Trent A. Rogers
|
Signal Transmission Across Tile Assemblies: 3D Static Tiles Simulate
Active Self-Assembly by 2D Signal-Passing Tiles
|
A condensed version of this paper will appear in a special issue of
Natural Computing for papers from DNA 19. This full version contains proofs
not seen in the published version
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 2-Handed Assembly Model (2HAM) is a tile-based self-assembly model in
which, typically beginning from single tiles, arbitrarily large aggregations of
static tiles combine in pairs to form structures. The Signal-passing Tile
Assembly Model (STAM) is an extension of the 2HAM in which the tiles are
dynamically changing components which are able to alter their binding domains
as they bind together. For our first result, we demonstrate useful techniques
and transformations for converting an arbitrarily complex STAM$^+$ tile set
into an STAM$^+$ tile set where every tile has a constant, low amount of
complexity, in terms of the number and types of ``signals'' they can send, with
a trade off in scale factor.
Using these simplifications, we prove that for each temperature $\tau>1$
there exists a 3D tile set in the 2HAM which is intrinsically universal for the
class of all 2D STAM$^+$ systems at temperature $\tau$ (where the STAM$^+$ does
not make use of the STAM's power of glue deactivation and assembly breaking, as
the tile components of the 2HAM are static and unable to change or break
bonds). This means that there is a single tile set $U$ in the 3D 2HAM which
can, for an arbitrarily complex STAM$^+$ system $S$, be configured with a
single input configuration which causes $U$ to exactly simulate $S$ at a scale
factor dependent upon $S$. Furthermore, this simulation uses only two planes of
the third dimension. This implies that there exists a 3D tile set at
temperature $2$ in the 2HAM which is intrinsically universal for the class of
all 2D STAM$^+$ systems at temperature $1$. Moreover, we show that for each
temperature $\tau>1$ there exists an STAM$^+$ tile set which is intrinsically
universal for the class of all 2D STAM$^+$ systems at temperature $\tau$,
including the case where $\tau = 1$.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 21:42:50 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Dec 2013 05:01:02 GMT"
}
] | 2013-12-16T00:00:00 |
[
[
"Fochtman",
"Tyler",
""
],
[
"Hendricks",
"Jacob",
""
],
[
"Padilla",
"Jennifer E.",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Rogers",
"Trent A.",
""
]
] |
new_dataset
| 0.990223 |
1307.7223
|
Seyed Hamed Hassani
|
S. Hamed Hassani and Rudiger Urbanke
|
Universal Polar Codes
|
Submitted to IEEE transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes, invented by Arikan in 2009, are known to achieve the capacity of
any binary-input memoryless output-symmetric channel. One of the few drawbacks
of the original polar code construction is that it is not universal. This means
that the code has to be tailored to the channel if we want to transmit close to
capacity.
We present two "polar-like" schemes which are capable of achieving the
compound capacity of the whole class of binary-input memoryless
output-symmetric channels with low complexity.
Roughly speaking, for the first scheme we stack up $N$ polar blocks of length
$N$ on top of each other but shift them with respect to each other so that they
form a "staircase." Coding then across the columns of this staircase with a
standard Reed-Solomon code, we can achieve the compound capacity using a
standard successive decoder to process the rows (the polar codes) and in
addition a standard Reed-Solomon erasure decoder to process the columns.
Compared to standard polar codes this scheme has essentially the same
complexity per bit but a block length which is larger by a factor $O(N
\log_2(N)/\epsilon)$, where $\epsilon$ is the gap to capacity.
For the second scheme we first show how to construct a true polar code which
achieves the compound capacity for a finite number of channels. We achieve this
by introducing special "polarization" steps which "align" the good indices for
the various channels. We then show how to exploit the compactness of the space
of binary-input memoryless output-symmetric channels to reduce the compound
capacity problem for this class to a compound capacity problem for a finite set
of channels. This scheme is similar in spirit to standard polar codes, but the
price for universality is a considerably larger blocklength.
We close with what we consider to be some interesting open problems.
|
[
{
"version": "v1",
"created": "Sat, 27 Jul 2013 07:12:39 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Dec 2013 14:10:24 GMT"
}
] | 2013-12-16T00:00:00 |
[
[
"Hassani",
"S. Hamed",
""
],
[
"Urbanke",
"Rudiger",
""
]
] |
new_dataset
| 0.999798 |
1312.3724
|
Pierluigi Gallo
|
Pierluigi Gallo, Ilenia Tinnirello, Laura Giarr\'e, Domenico Garlisi,
Daniele Croce and Adriano Fagiolini
|
ARIANNA: pAth Recognition for Indoor Assisted NavigatioN with Augmented
perception
| null | null | null | null |
cs.CV cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ARIANNA stands for pAth Recognition for Indoor Assisted Navigation with
Augmented perception. It is a flexible and low cost navigation system for vi-
sually impaired people. Arianna permits to navigate colored paths painted or
sticked on the floor revealing their directions through vibrational feedback on
commercial smartphones.
|
[
{
"version": "v1",
"created": "Fri, 13 Dec 2013 07:54:22 GMT"
}
] | 2013-12-16T00:00:00 |
[
[
"Gallo",
"Pierluigi",
""
],
[
"Tinnirello",
"Ilenia",
""
],
[
"Giarré",
"Laura",
""
],
[
"Garlisi",
"Domenico",
""
],
[
"Croce",
"Daniele",
""
],
[
"Fagiolini",
"Adriano",
""
]
] |
new_dataset
| 0.999564 |
1312.3872
|
Stephen Bensman
|
Stephen J. Bensman
|
Eugene Garfield, Francis Narin, and PageRank: The Theoretical Bases of
the Google Search Engine
| null | null | null | null |
cs.IR cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a test of the validity of using Google Scholar to
evaluate the publications of researchers by comparing the premises on which its
search engine, PageRank, is based, to those of Garfield's theory of citation
indexing. It finds that the premises are identical and that PageRank and
Garfield's theory of citation indexing validate each other.
|
[
{
"version": "v1",
"created": "Fri, 13 Dec 2013 16:52:07 GMT"
}
] | 2013-12-16T00:00:00 |
[
[
"Bensman",
"Stephen J.",
""
]
] |
new_dataset
| 0.994011 |
1312.2841
|
Chanabasayya Vastrad M
|
Doreswamy and Chanabasayya .M. Vastrad
|
Predictive Comparative QSAR Analysis Of As 5-Nitofuran-2-YL Derivatives
Myco bacterium tuberculosis H37RV Inhibitors Bacterium Tuberculosis H37RV
Inhibitors
| null |
published Health Informatics- An International Journal (HIIJ)
Vol.2, No.4, November 2013
|
10.5121/hiij.2013.2404
| null |
cs.CE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Antitubercular activity of 5-nitrofuran-2-yl Derivatives series were
subjected to Quantitative Structure Activity Relationship (QSAR) Analysis with
an effort to derive and understand a correlation between the biological
activity as response variable and different molecular descriptors as
independent variables. QSAR models are built using 40 molecular descriptor
dataset. Different statistical regression expressions were got using Partial
Least Squares (PLS),Multiple Linear Regression (MLR) and Principal Component
Regression (PCR) techniques. The among these technique, Partial Least Square
Regression (PLS) technique has shown very promising result as compared to MLR
technique A QSAR model was build by a training set of 30 molecules with
correlation coefficient ($r^2$) of 0.8484, significant cross validated
correlation coefficient ($q^2$) is 0.0939, F test is 48.5187, ($r^2$) for
external test set (pred$_r^2$) is -0.5604, coefficient of correlation of
predicted data set (pred$_r^2se$) is 0.7252 and degree of freedom is 26 by
Partial Least Squares Regression technique.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 15:50:39 GMT"
}
] | 2013-12-13T00:00:00 |
[
[
"Doreswamy",
"",
""
],
[
"Vastrad",
"Chanabasayya . M.",
""
]
] |
new_dataset
| 0.971747 |
1312.3389
|
Yun Fan
|
Yun Fan, San Ling, Hongwei Liu
|
Matrix Product Codes over Finite Commutative Frobenius Rings
|
Des. Codes Cryptogr. published online: 19 Jul 2012
| null |
10.1007/s10623-012-9726-y
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Properties of matrix product codes over finite commutative Frobenius rings
are investigated. The minimum distance of matrix product codes constructed with
several types of matrices is bounded in different ways. The duals of matrix
product codes are also explicitly described in terms of matrix product codes.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 02:53:47 GMT"
}
] | 2013-12-13T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Ling",
"San",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.99976 |
1312.3412
|
Olivier Finkel
|
Olivier Finkel (ELM, IMJ)
|
The Determinacy of Context-Free Games
|
This paper is an extended version of a STACS 2012 conference paper
[arXiv:1112.1186]. It will appear in the Journal of Symbolic Logic
|
Journal of Symbolic Logic 78, 4 (2013) 1115-1134
| null |
EXT-JSL-STACS12
|
cs.LO cs.GT math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the determinacy of Gale-Stewart games whose winning sets are
accepted by real-time 1-counter B\"uchi automata is equivalent to the
determinacy of (effective) analytic Gale-Stewart games which is known to be a
large cardinal assumption. We show also that the determinacy of Wadge games
between two players in charge of omega-languages accepted by 1-counter B\"uchi
automata is equivalent to the (effective) analytic Wadge determinacy. Using
some results of set theory we prove that one can effectively construct a
1-counter B\"uchi automaton A and a B\"uchi automaton B such that: (1) There
exists a model of ZFC in which Player 2 has a winning strategy in the Wadge
game W(L(A), L(B)); (2) There exists a model of ZFC in which the Wadge game
W(L(A), L(B)) is not determined. Moreover these are the only two possibilities,
i.e. there are no models of ZFC in which Player 1 has a winning strategy in the
Wadge game W(L(A), L(B)).
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 07:33:31 GMT"
}
] | 2013-12-13T00:00:00 |
[
[
"Finkel",
"Olivier",
"",
"ELM, IMJ"
]
] |
new_dataset
| 0.992471 |
1312.3420
|
Xinyu Lei
|
Xinyu Lei, Xiaofeng Liao, Yonghong Xiong
|
Group Key Agreement Protocol for MANETs Based on HSK Scheme
|
9 pages, 7 figures
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we first provide a spanning tree (ST)-based centralized group
key agreement protocol for unbalanced mobile Ad Hoc networks (MANETs). Based on
the centralized solution, a local spanning tree (LST)-based distributed
protocol for general MANETs is subsequently presented. Both protocols follow
the basic features of the HSK scheme: 1) H means that a hybrid approach, which
is the combination of key agreement and key distribution via symmetric
encryption, is exploited; 2) S indicates that a ST or LSTs are adopted to form
a connected network topology; and 3) K implies that the extended Kruskal
algorithm is employed to handle dynamic events. It is shown that the HSK scheme
is a uniform approach to handle the initial key establishment process as well
as all kinds of dynamic events in group key agreement protocol for MANETs.
Additionally, the extended Kruskal algorithm enables to realize the reusability
of the precomputed secure links to reduce the overhead. Moreover, some other
aspects, such as the network topology connectivity and security, are well
analyzed.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 08:52:03 GMT"
}
] | 2013-12-13T00:00:00 |
[
[
"Lei",
"Xinyu",
""
],
[
"Liao",
"Xiaofeng",
""
],
[
"Xiong",
"Yonghong",
""
]
] |
new_dataset
| 0.994812 |
1312.3538
|
Philipp Kindermann
|
Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp
Kindermann, Stephen G. Kobourov, and Alexander Wolff
|
Smooth Orthogonal Drawings of Planar Graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an
alternating sequence of axis-aligned segments and circular arcs with common
axis-aligned tangents. In this paper, we study the problem of finding smooth
orthogonal layouts of low \emph{edge complexity}, that is, with few segments
per edge. We say that a graph has \emph{smooth complexity} k---for short, an
SC_k-layout---if it admits a smooth orthogonal drawing of edge complexity at
most $k$.
Our main result is that every 4-planar graph has an SC_2-layout. While our
drawings may have super-polynomial area, we show that, for 3-planar graphs,
cubic area suffices. Further, we show that every biconnected 4-outerplane graph
admits an SC_1-layout. On the negative side, we demonstrate an infinite family
of biconnected 4-planar graphs that requires exponential area for an
SC_1-layout. Finally, we present an infinite family of biconnected 4-planar
graphs that does not admit an SC_1-layout.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 16:34:10 GMT"
}
] | 2013-12-13T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Bekos",
"Michael A.",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kindermann",
"Philipp",
""
],
[
"Kobourov",
"Stephen G.",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.9978 |
1312.3077
|
Lutz Bornmann Dr.
|
Marcin Kozak, Lutz Bornmann, Loet Leydesdorff
|
How have the Eastern European countries of the former Warsaw Pact
developed since 1990? A bibliometric study
| null | null | null | null |
cs.DL stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Did the demise of the Soviet Union in 1991 influence the scientific
performance of the researchers in Eastern European countries? Did this
historical event affect international collaboration by researchers from the
Eastern European countries with those of Western countries? Did it also change
international collaboration among researchers from the Eastern European
countries? Trying to answer these questions, this study aims to shed light on
international collaboration by researchers from the Eastern European countries
(Russia, Ukraine, Belarus, Moldova, Bulgaria, the Czech Republic, Hungary,
Poland, Romania and Slovakia). The number of publications and normalized
citation impact values are compared for these countries based on InCites
(Thomson Reuters), from 1981 up to 2011. The international collaboration by
researchers affiliated to institutions in Eastern European countries at the
time points of 1990, 2000 and 2011 was studied with the help of Pajek and
VOSviewer software, based on data from the Science Citation Index (Thomson
Reuters). Our results show that the breakdown of the communist regime did not
lead, on average, to a huge improvement in the publication performance of the
Eastern European countries and that the increase in international co-authorship
relations by the researchers affiliated to institutions in these countries was
smaller than expected. Most of the Eastern European countries are still subject
to changes and are still awaiting their boost in scientific development.
|
[
{
"version": "v1",
"created": "Wed, 11 Dec 2013 08:43:14 GMT"
}
] | 2013-12-12T00:00:00 |
[
[
"Kozak",
"Marcin",
""
],
[
"Bornmann",
"Lutz",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.999411 |
1312.3182
|
Prasanth G Narasimha-Shenoi
|
Ram Kumar. R, Kannan Balakrishnan, Manoj Changat, A.Sreekumar,
Prasanth G. Narasimha-Shenoi
|
On The Center Sets and Center Numbers of Some Graph Classes
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a set $S$ of vertices and the vertex $v$ in a connected graph $G$,
$\displaystyle\max_{x \in S}d(x,v)$ is called the $S$-eccentricity of $v$ in
$G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center
of $G$. Any set $A$ of vertices of $G$ such that $A$ is an $S$-center for some
set $S$ of vertices of $G$ is called a center set. We identify the center sets
of certain classes of graphs namely, Block graphs, $K_{m,n}$, $K_n-e$, wheel
graphs, odd cycles and symmetric even graphs and enumerate them for many of
these graph classes. We also introduce the concept of center number which is
defined as the number of distinct center sets of a graph and determine the
center number of some graph classes.
|
[
{
"version": "v1",
"created": "Wed, 11 Dec 2013 14:20:55 GMT"
}
] | 2013-12-12T00:00:00 |
[
[
"R",
"Ram Kumar.",
""
],
[
"Balakrishnan",
"Kannan",
""
],
[
"Changat",
"Manoj",
""
],
[
"Sreekumar",
"A.",
""
],
[
"Narasimha-Shenoi",
"Prasanth G.",
""
]
] |
new_dataset
| 0.96275 |
1312.3194
|
Natalia Silberstein
|
Natalia Silberstein, Ankit Singh Rawat and Sriram Vishwanath
|
Error-Correcting Regenerating and Locally Repairable Codes via
Rank-Metric Codes
|
This paper was presented in part at the 2012 50th Annual Allerton
Conference on Communication, Control, and Computing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents and analyzes a novel concatenated coding scheme for
enabling error resilience in two distributed storage settings: one being
storage using existing regenerating codes and the second being storage using
locally repairable codes. The concatenated coding scheme brings together a
maximum rank distance (MRD) code as an outer code and either a globally
regenerating or a locally repairable code as an inner code. Also, error
resilience for combination of locally repairable codes with regenerating codes
is considered. This concatenated coding system is designed to handle two
different types of adversarial errors: the first type includes an adversary
that can replace the content of an affected node only once; while the second
type studies an adversary that is capable of polluting data an unbounded number
of times. The paper establishes an upper bound on the resilience capacity for a
locally repairable code and proves that this concatenated coding coding scheme
attains the upper bound on resilience capacity for the first type of adversary.
Further, the paper presents mechanisms that combine the presented concatenated
coding scheme with subspace signatures to achieve error resilience for the
second type of errors.
|
[
{
"version": "v1",
"created": "Wed, 11 Dec 2013 14:50:08 GMT"
}
] | 2013-12-12T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Rawat",
"Ankit Singh",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.974726 |
1308.6007
|
Cristopher Moore
|
Cristopher Moore and Leonard J. Schulman
|
Tree Codes and a Conjecture on Exponential Sums
|
Proc. ITCS 2014
| null | null | null |
cs.CC cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new conjecture on some exponential sums. These particular sums
have not apparently been considered in the literature. Subject to the
conjecture we obtain the first effective construction of asymptotically good
tree codes. The available numerical evidence is consistent with the conjecture
and is sufficient to certify codes for significant-length communications.
|
[
{
"version": "v1",
"created": "Tue, 27 Aug 2013 22:42:33 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Dec 2013 21:39:00 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Moore",
"Cristopher",
""
],
[
"Schulman",
"Leonard J.",
""
]
] |
new_dataset
| 0.987833 |
1312.2175
|
Sugata Sanyal
|
Bibhas Roy, Suman Banik, Parthi Dey, Sugata Sanyal, Nabendu Chaki
|
Ant Colony based Routing for Mobile Ad-Hoc Networks towards Improved
Quality of Services
|
This paper has been withdrawn by the author due to a crucial sign
error in equation 1
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is
established by a set of mobile nodes on a shared wireless channel. One of the
major issues in MANET is routing due to the mobility of the nodes. Routing
means the act of moving information across an internet work from a source to a
destination. When it comes to MANET, the complexity increases due to various
characteristics like dynamic topology, time varying QoS requirements, limited
resources and energy etc. QoS routing plays an important role for providing QoS
in wireless ad hoc networks. The most complex issue in this kind of networks is
to find a path between the communication end points satisfying QoS requirement
for the user. Nature-inspired algorithms (swarm intelligence) such as ant
colony optimization ACO)algorithms have shown to be a good technique for
developing routing algorithms for MANETs.
In this paper, a new QoS algorithm for mobile ad hoc network has been
proposed. The proposed algorithm combines the idea of Ant Colony Optimization
(ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple
stable paths between source and destination nodes.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 04:55:06 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Dec 2013 16:04:13 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Roy",
"Bibhas",
""
],
[
"Banik",
"Suman",
""
],
[
"Dey",
"Parthi",
""
],
[
"Sanyal",
"Sugata",
""
],
[
"Chaki",
"Nabendu",
""
]
] |
new_dataset
| 0.996642 |
1312.2581
|
Amor Lazzez Dr.
|
Amor Lazzez, Thabet Slimani
|
Deployment of VoIP Technology: QoS Concerns
|
8 pages, 3 figures
|
International Journal of Advanced Research in Computer and
Communication Engineering (IJARCCE), Vol. 2, Issue 9, September 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice over IP (VoIP) is an emerging communication service allowing voice
transmission over a private or a public IP network. VoIP allows significant
benefits for customers and service providers including cost savings, phone and
service portability, mobility, and the integration with other applications.
Nevertheless, the deployment of the VoIP technology encounters many challenges
such as interoperability issues, security issues, and QoS concerns. Among these
disadvantages, QoS issues are considered the most serious due to the QoS
problems that may arise on IP networks, and the stringent QoS requirements of
voice traffic. The aim of this paper is carry out a deep analysis of the QoS
concerns of the VoIP technology. Firstly, we present a brief overview about the
VoIP technology. Then, we discuss the QoS issues related to the use of the IP
networking technology for voice traffic transmission. After that, we present
the QoS concerns related voice clarity. Finally, we present the QoS mechanisms
proposed to make the IP technology able to support voice traffic QoS
requirements in terms of voice clarity, voice packet delay, packet delay
variation, and packet loss.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 15:47:35 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Lazzez",
"Amor",
""
],
[
"Slimani",
"Thabet",
""
]
] |
new_dataset
| 0.991467 |
1312.2625
|
Carlton Thompson
|
Carlton A. Thompson, Haniph A. Latchman, Nathan Angelacos, Bharath
Kumar Pareek
|
A Distributed IP-Based Telecommunication System using SIP
|
16 pages, 10 figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.5, No.6, November 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice over Internet Protocol (VoIP) technologies are integral to modern
telecommunications because of their advanced features, flexibility, and
economic benefits. Internet Service Providers initially promoted these
technologies by providing low cost local and international calling. At present,
there is also a great deal of interest in using IP-based technologies to
replace traditional small and large office telephone systems that use
traditional PBXs (Private Branch eXchange). Unfortunately, the large majority
of the emerging VoIP based office telephone systems have followed the
centralized design of traditional public and private telephone systems in which
all the intelligence in the system is at the core, with quite expensive
hardware and software components and appropriate redundancy for adequate levels
of reliability. In this paper, it is argued that a centralized model for an
IP-based telecommunications system fails to exploit the full capabilities of
Internet-inspired communications and that, very simple, inexpensive, elegant
and flexible solutions are possible by deliberately avoiding the centralized
approach. This paper describes the design, philosophy and implementation of a
prototype for a fully distributed IP-based Telecommunication System (IPTS) that
provides the essential feature set for office and home telecommunications,
including IP-based long-distance and local calling, and with the support for
video as well as data and text. The prototype system was implemented with an
Internet-inspired distributed design using open source software, with
appropriate customizations and configurations.
|
[
{
"version": "v1",
"created": "Mon, 9 Dec 2013 22:51:57 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Thompson",
"Carlton A.",
""
],
[
"Latchman",
"Haniph A.",
""
],
[
"Angelacos",
"Nathan",
""
],
[
"Pareek",
"Bharath Kumar",
""
]
] |
new_dataset
| 0.998563 |
1312.2628
|
Ibrahim Umar
|
Ibrahim Umar, Otto Anshus, Phuong Ha (University of Troms{\o})
|
DeltaTree: A Practical Locality-aware Concurrent Search Tree
| null | null | null |
IFI-UIT Technical Report 2013-74
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As other fundamental programming abstractions in energy-efficient computing,
search trees are expected to support both high parallelism and data locality.
However, existing highly-concurrent search trees such as red-black trees and
AVL trees do not consider data locality while existing locality-aware search
trees such as those based on the van Emde Boas layout (vEB-based trees), poorly
support concurrent (update) operations.
This paper presents DeltaTree, a practical locality-aware concurrent search
tree that combines both locality-optimisation techniques from vEB-based trees
and concurrency-optimisation techniques from non-blocking highly-concurrent
search trees. DeltaTree is a $k$-ary leaf-oriented tree of DeltaNodes in which
each DeltaNode is a size-fixed tree-container with the van Emde Boas layout.
The expected memory transfer costs of DeltaTree's Search, Insert, and Delete
operations are $O(\log_B N)$, where $N, B$ are the tree size and the unknown
memory block size in the ideal cache model, respectively. DeltaTree's Search
operation is wait-free, providing prioritised lanes for Search operations, the
dominant operation in search trees. Its Insert and {\em Delete} operations are
non-blocking to other Search, Insert, and Delete operations, but they may be
occasionally blocked by maintenance operations that are sometimes triggered to
keep DeltaTree in good shape. Our experimental evaluation using the latest
implementation of AVL, red-black, and speculation friendly trees from the
Synchrobench benchmark has shown that DeltaTree is up to 5 times faster than
all of the three concurrent search trees for searching operations and up to 1.6
times faster for update operations when the update contention is not too high.
|
[
{
"version": "v1",
"created": "Mon, 9 Dec 2013 23:30:02 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Umar",
"Ibrahim",
"",
"University of Tromsø"
],
[
"Anshus",
"Otto",
"",
"University of Tromsø"
],
[
"Ha",
"Phuong",
"",
"University of Tromsø"
]
] |
new_dataset
| 0.996468 |
1312.2629
|
Yongcai Wang
|
Yongcai Wang, Haoran Feng, Xiangyu Xi
|
Sense, Model and Identify the Load Signatures of HVAC Systems in Metro
Stations
|
5 pages, 5 figures
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by/3.0/
|
The HVAC systems in subway stations are energy consuming giants, each of
which may consume over 10, 000 Kilowatts per day for cooling and ventilation.
To save energy for the HVAC systems, it is critically important to firstly know
the "load signatures" of the HVAC system, i.e., the quantity of heat imported
from the outdoor environments and by the passengers respectively in different
periods of a day, which will significantly benefit the design of control
policies. In this paper, we present a novel sensing and learning approach to
identify the load signature of the HVAC system in the subway stations. In
particular, sensors and smart meters were deployed to monitor the indoor,
outdoor temperatures, and the energy consumptions of the HVAC system in
real-time. The number of passengers was counted by the ticket checking system.
At the same time, the cooling supply provided by the HVAC system was inferred
via the energy consumption logs of the HVAC system. Since the indoor
temperature variations are driven by the difference of the loads and the
cooling supply, linear regression model was proposed for the load signature,
whose coefficients are derived via a proposed algorithm . We collected real
sensing data and energy log data from HaiDianHuangZhuang Subway station, which
is in line 4 of Beijing from the duration of July 2012 to Sept. 2012. The data
was used to evaluate the coefficients of the regression model. The experiment
results show typical variation signatures of the loads from the passengers and
from the outdoor environments respectively, which provide important contexts
for smart control policies.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 00:11:50 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Wang",
"Yongcai",
""
],
[
"Feng",
"Haoran",
""
],
[
"Xi",
"Xiangyu",
""
]
] |
new_dataset
| 0.992184 |
1312.2632
|
Yongcai Wang
|
Yongcai Wang, Haoran Feng, Xiao Qi
|
SEED: Public Energy and Environment Dataset for Optimizing HVAC
Operation in Subway Stations
|
5 pages, 14 figures
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by/3.0/
|
For sustainability and energy saving, the problem to optimize the control of
heating, ventilating, and air-conditioning (HVAC) systems has attracted great
attentions, but analyzing the signatures of thermal environments and HVAC
systems and the evaluation of the optimization policies has encountered
inefficiency and inconvenient problems due to the lack of public dataset. In
this paper, we present the Subway station Energy and Environment Dataset
(SEED), which was collected from a line of Beijing subway stations, providing
minute-resolution data regarding the environment dynamics (temperature,
humidity, CO2, etc.) working states and energy consumptions of the HVAC systems
(ventilators, refrigerators, pumps), and hour-resolution data of passenger
flows. We describe the sensor deployments and the HVAC systems for data
collection and for environment control, and also present initial investigation
for the energy disaggregation of HVAC system, the signatures of the thermal
load, cooling supply, and the passenger flow using the dataset.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 00:29:04 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Wang",
"Yongcai",
""
],
[
"Feng",
"Haoran",
""
],
[
"Qi",
"Xiao",
""
]
] |
new_dataset
| 0.999761 |
1312.2700
|
EPTCS
|
Yoichi Hirai (National Institute of Advanced Industrial Science and
Technology)
|
Session Types in Abelian Logic
|
In Proceedings PLACES 2013, arXiv:1312.2218
|
EPTCS 137, 2013, pp. 33-52
|
10.4204/EPTCS.137.4
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There was a PhD student who says "I found a pair of wooden shoes. I put a
coin in the left and a key in the right. Next morning, I found those objects in
the opposite shoes." We do not claim existence of such shoes, but propose a
similar programming abstraction in the context of typed lambda calculi. The
result, which we call the Amida calculus, extends Abramsky's linear lambda
calculus LF and characterizes Abelian logic.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 08:03:46 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Hirai",
"Yoichi",
"",
"National Institute of Advanced Industrial Science and\n Technology"
]
] |
new_dataset
| 0.997746 |
1312.2706
|
EPTCS
|
Romain Demeyer, Wim Vanhoof
|
Static Application-Level Race Detection in STM Haskell using Contracts
|
In Proceedings PLACES 2013, arXiv:1312.2218. [email protected];
[email protected]
|
EPTCS 137, 2013, pp. 115-134
|
10.4204/EPTCS.137.10
| null |
cs.LO cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Writing concurrent programs is a hard task, even when using high-level
synchronization primitives such as transactional memories together with a
functional language with well-controlled side-effects such as Haskell, because
the interferences generated by the processes to each other can occur at
different levels and in a very subtle way. The problem occurs when a thread
leaves or exposes the shared data in an inconsistent state with respect to the
application logic or the real meaning of the data. In this paper, we propose to
associate contracts to transactions and we define a program transformation that
makes it possible to extend static contract checking in the context of STM
Haskell. As a result, we are able to check statically that each transaction of
a STM Haskell program handles the shared data in a such way that a given
consistency property, expressed in the form of a user-defined boolean function,
is preserved. This ensures that bad interference will not occur during the
execution of the concurrent program.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 08:04:37 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Demeyer",
"Romain",
""
],
[
"Vanhoof",
"Wim",
""
]
] |
new_dataset
| 0.996295 |
1312.2807
|
Susumu Matsumae
|
Susumu Matsumae
|
Polylogarithmic Gap between Meshes with Reconfigurable Row/Column Buses
and Meshes with Statically Partitioned Buses
|
6 pages, 5 figures
|
International Journal of Advanced Computer Science and
Applications(IJACSA), Volume 3 Issue 2, 2012
|
10.14569/IJACSA.2012.030216
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the difference in computational power between the
mesh-connected parallel computers equipped with dynamically reconfigurable bus
systems and those with static ones. The mesh with separable buses (MSB) is the
mesh-connected parallel computer with dynamically reconfigurable row/column
buses. The broadcast buses of the MSB can be dynamically sectioned into smaller
bus segments by program control. We show that the MSB of size $n \times n$ can
work with$O(\log^2 n)$ step even if its dynamic reconfigurable function is
disabled. Here, we assume the word-model broadcast buses, and use the relation
between the word-model bus and the bit-model bus.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 14:18:46 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Matsumae",
"Susumu",
""
]
] |
new_dataset
| 0.995084 |
1312.2819
|
Jean Cardinal
|
Jean Cardinal, Stefan Felsner
|
Covering Partial Cubes with Zones
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A partial cube is a graph having an isometric embedding in a hypercube.
Partial cubes are characterized by a natural equivalence relation on the edges,
whose classes are called zones. The number of zones determines the minimal
dimension of a hypercube in which the graph can be embedded. We consider the
problem of covering the vertices of a partial cube with the minimum number of
zones. The problem admits several special cases, among which are the problem of
covering the cells of a line arrangement with a minimum number of lines, and
the problem of finding a minimum-size fibre in a bipartite poset. For several
such special cases, we give upper and lower bounds on the minimum size of a
covering by zones. We also consider the computational complexity of those
problems, and establish some hardness results.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 14:54:47 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Felsner",
"Stefan",
""
]
] |
new_dataset
| 0.98323 |
1312.2822
|
Konstantinos Charalampous
|
Konstantinos Charalampous, Ioannis Kostavelis, Dimitrios Chrysostomou,
Angelos Amanatiadis and Antonios Gasteratos
|
3D Maps Registration and Path Planning for Autonomous Robot Navigation
|
3 pages, 6 figures, IROS'13 Workshop on Robots and Sensors
integration in future rescue INformation system (ROSIN'13)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile robots dedicated in security tasks should be capable of clearly
perceiving their environment to competently navigate within cluttered areas, so
as to accomplish their assigned mission. The paper in hand describes such an
autonomous agent designed to deploy competently in hazardous environments
equipped with a laser scanner sensor. During the robot's motion, consecutive
scans are obtained to produce dense 3D maps of the area. A 3D point cloud
registration technique is exploited to merge the successively created maps
during the robot's motion followed by an ICP refinement step. The reconstructed
3D area is then top-down projected with great resolution, to be fed in a path
planning algorithm suitable to trace obstacle-free trajectories in the explored
area. The main characteristic of the path planner is that the robot's
embodiment is considered for producing detailed and safe trajectories of $1$
$cm$ resolution. The proposed method has been evaluated with our mobile robot
in several outdoor scenarios revealing remarkable performance.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 14:57:18 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Charalampous",
"Konstantinos",
""
],
[
"Kostavelis",
"Ioannis",
""
],
[
"Chrysostomou",
"Dimitrios",
""
],
[
"Amanatiadis",
"Angelos",
""
],
[
"Gasteratos",
"Antonios",
""
]
] |
new_dataset
| 0.988011 |
1312.2828
|
Pardis Pourghomi mr
|
Pardis Pourghomi, Muhammad Qasim saeed and Gheorghita Ghinea
|
A Proposed NFC Payment Application
|
9 pages, 4 figures
|
(IJACSA) International Journal of Advanced Computer Science and
Applications, Vol. 4, No. 8, 2013
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Near Field Communication (NFC) technology is based on a short range radio
communication channel which enables users to exchange data between devices.
With NFC technology, mobile services establish a contactless transaction system
to make the payment methods easier for people. Although NFC mobile services
have great potential for growth, they have raised several issues which have
concerned the researches and prevented the adoption of this technology within
societies. Reorganizing and describing what is required for the success of this
technology have motivated us to extend the current NFC ecosystem models to
accelerate the development of this business area. In this paper, we introduce a
new NFC payment application, which is based on our previous NFC Cloud Wallet
model to demonstrate a reliable structure of NFC ecosystem. We also describe
the step by step execution of the proposed protocol in order to carefully
analyse the payment application and our main focus will be on the Mobile
Network Operator (MNO) as the main player within the ecosystem.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 15:13:46 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Pourghomi",
"Pardis",
""
],
[
"saeed",
"Muhammad Qasim",
""
],
[
"Ghinea",
"Gheorghita",
""
]
] |
new_dataset
| 0.999594 |
1312.2865
|
Vitali Volovoi
|
Vitali Volovoi
|
Abridged Petri Nets
|
17 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new graphical framework, Abridged Petri Nets (APNs) is introduced for
bottom-up modeling of complex stochastic systems. APNs are similar to
Stochastic Petri Nets (SPNs) in as much as they both rely on component-based
representation of system state space, in contrast to Markov chains that
explicitly model the states of an entire system. In both frameworks, so-called
tokens (denoted as small circles) represent individual entities comprising the
system; however, SPN graphs contain two distinct types of nodes (called places
and transitions) with transitions serving the purpose of routing tokens among
places. As a result, a pair of place nodes in SPNs can be linked to each other
only via a transient stop, a transition node. In contrast, APN graphs link
place nodes directly by arcs (transitions), similar to state space diagrams for
Markov chains, and separate transition nodes are not needed.
Tokens in APN are distinct and have labels that can assume both discrete
values ("colors") and continuous values ("ages"), both of which can change
during simulation. Component interactions are modeled in APNs using triggers,
which are either inhibitors or enablers (the inhibitors' opposites).
Hierarchical construction of APNs rely on using stacks (layers) of submodels
with automatically matching color policies. As a result, APNs provide at least
the same modeling power as SPNs, but, as demonstrated by means of several
examples, the resulting models are often more compact and transparent,
therefore facilitating more efficient performance evaluation of complex
systems.
|
[
{
"version": "v1",
"created": "Tue, 10 Dec 2013 16:38:27 GMT"
}
] | 2013-12-11T00:00:00 |
[
[
"Volovoi",
"Vitali",
""
]
] |
new_dataset
| 0.996574 |
1007.3476
|
Mohammad Firooz
|
Mohammad H. Firooz, Dustin Maas, Junxing Zhang, Neal Patwari, and
Sneha K. Kasera
|
Channel Sounding for the Masses: Low Complexity GNU 802.11b Channel
Impulse Response Estimation
| null | null |
10.1109/TWC.2011.111611.091774
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New techniques in cross-layer wireless networks are building demand for
ubiquitous channel sounding, that is, the capability to measure channel impulse
response (CIR) with any standard wireless network and node. Towards that goal,
we present a software-defined IEEE 802.11b receiver and CIR estimation system
with little additional computational complexity compared to 802.11b reception
alone. The system implementation, using the universal software radio peripheral
(USRP) and GNU Radio, is described and compared to previous work. By overcoming
computational limitations and performing direct-sequence spread-spectrum
(DS-SS) matched filtering on the USRP, we enable high-quality yet inexpensive
CIR estimation. We validate the channel sounder and present a drive test
campaign which measures hundreds of channels between WiFi access points and an
in-vehicle receiver in urban and suburban areas.
|
[
{
"version": "v1",
"created": "Tue, 20 Jul 2010 18:42:40 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Firooz",
"Mohammad H.",
""
],
[
"Maas",
"Dustin",
""
],
[
"Zhang",
"Junxing",
""
],
[
"Patwari",
"Neal",
""
],
[
"Kasera",
"Sneha K.",
""
]
] |
new_dataset
| 0.999271 |
1205.5324
|
Kenneth Shum
|
Chi Wan Sung, Linyu Huang, Ho Yuet Kwan, Kenneth W. Shum
|
Linear Network Code for Erasure Broadcast Channel with Feedback:
Complexity and Algorithms
|
18 pages, 11 figures, submitted to IEEE Trans. Information Theory
| null | null | null |
cs.IT cs.CC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the construction of linear network codes for
broadcasting a set of data packets to a number of users. The links from the
source to the users are modeled as independent erasure channels. Users are
allowed to inform the source node whether a packet is received correctly via
feedback channels. In order to minimize the number of packet transmissions
until all users have received all packets successfully, it is necessary that a
data packet, if successfully received by a user, can increase the dimension of
the vector space spanned by the encoding vectors he or she has received by one.
Such an encoding vector is called innovative. We prove that innovative linear
network code is uniformly optimal in minimizing user download delay. When the
finite field size is strictly smaller than the number of users, the problem of
determining the existence of innovative vectors is proven to be NP-complete.
When the field size is larger than or equal to the number of users, innovative
vectors always exist and random linear network code (RLNC) is able to find an
innovative vector with high probability. While RLNC is optimal in terms of
completion time, it has high decoding complexity due to the need of solving a
system of linear equations. To reduce decoding time, we propose the use of
sparse linear network code, since the sparsity property of encoding vectors can
be exploited when solving systems of linear equations. Generating a sparsest
encoding vector with large finite field size, however, is shown to be NP-hard.
An approximation algorithm that guarantee the Hamming weight of a generated
encoding vector to be smaller than a certain factor of the optimal value is
constructed. Our simulation results show that our proposed methods have
excellent performance in completion time and outperforms RLNC in terms of
decoding time.
|
[
{
"version": "v1",
"created": "Thu, 24 May 2012 03:39:23 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Dec 2013 03:21:27 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Sung",
"Chi Wan",
""
],
[
"Huang",
"Linyu",
""
],
[
"Kwan",
"Ho Yuet",
""
],
[
"Shum",
"Kenneth W.",
""
]
] |
new_dataset
| 0.998677 |
1301.7245
|
Brett Kaufman
|
Brett Kaufman and Jorma Lilleberg and Behnaam Aazhang
|
Femtocell Architectures with Spectrum Sharing for Cellular Radio
Networks
|
9 pages, 8 figures, Accepted to the International Journal of Advances
in Engineering Sciences and Applied Mathematics special issue on
Multi-Terminal Information Theory
|
International Journal of Advances in Engineering Sciences and
Applied Mathematics, vol. 5, no. 1, pp. 66-75, Mar. 2013
|
10.1007/s12572-013-0083-5
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Femtocells are an emerging technology aimed at providing gains to both
network operators and end-users. These gains come at a cost of increased
interference, specifically the cross network interference between the macrocell
and femtocell networks. This interference is one of the main performance
limiting factors in allowing an underlaid femtocell network to share the
spectrum with the cellular network. To manage this interference, we first
propose a femtocell architecture that orthog- onally partitions the network
bandwidth between the macrocell and femtocell networks. This scheme eliminates
the cross network interference thus giving the femtocells more freedom over
their use of the spectrum. Specifically, no interference constraint is imposed
by the cellular network allowing femto users to transmit at a constant power on
randomly selected channels. Although simple, this scheme is enough to give
gains up to 200% in sum rate.
We then propose a second architecture where both networks share the bandwidth
simultaneously. A femtocell power control scheme that relies on minimal
coordination with the macrocell base station is used in conjunction with an
interference sensing channel assignment mechanism. These two schemes together
yield sum rate gains up to 200%. We then develop a technique for macro users to
join a nearby femtocell and share a common chan- nel with a femtocell user
through the use of successive interfer- ence cancellation. By adding this
mechanism to the power control and channel assignment schemes, we show sum rate
gains over 300% and up to 90% power savings for macrocell users.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2013 14:36:37 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Kaufman",
"Brett",
""
],
[
"Lilleberg",
"Jorma",
""
],
[
"Aazhang",
"Behnaam",
""
]
] |
new_dataset
| 0.993381 |
1311.2549
|
Vladimir D. Tonchev Prof
|
Vladimir D. Tonchev
|
A doubling construction for self-orthogonal codes
|
7 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple construction of quaternary hermitian self-orthogonal codes with
parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal
$[n,k]$ codes, and its link to quantum codes is considered. As an application,
an optimal quaternary linear $[28,20,6]$ dual containing code is found that
yields a new optimal $[[28,12,6]]$ quantum code.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 19:52:56 GMT"
},
{
"version": "v2",
"created": "Sun, 8 Dec 2013 22:01:03 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Tonchev",
"Vladimir D.",
""
]
] |
new_dataset
| 0.998488 |
1312.1299
|
Pierre-Etienne Meunier
|
Pierre-\'Etienne Meunier
|
The self-assembly of paths and squares at temperature 1
|
arXiv admin note: text overlap with arXiv:1306.6710 by other authors
| null | null | null |
cs.CC cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the number of tile types required to build squares of size n x
n, in Winfree's abstract Tile Assembly Model, when restricted to using only
non-cooperative tile bindings, is at least 2n-1, which is also the best known
upper bound. Non-cooperative self-assembly, also known as temperature 1, is
where tiles bind to each other if they match on one or more sides, whereas in
cooperative binding, some tiles can bind only if they match on multiple sides.
Our proof introduces a new programming technique for temperature 1, that
disproves the very intuitive and commonly held belief that, in the same model,
assembling paths between two points A and B cannot be done with less tile types
than the Manhattan distance between them. Then, we prove a necessary condition
for these "efficient paths" to be assembled, and show that this necessary
condition cannot hold in completely filled squares.
This result proves the oldest conjecture in algorithmic self-assembly,
published by Rothemund and Winfree in STOC 2000, in the case where growth
starts from a corner of the square. As a corollary, we establish n as a lower
bound on the tile complexity of the general case. The problem of determining
the minimal number of tile types to self-assemble a shape is known to be
Sigma^p_2-complete.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 21:04:12 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Dec 2013 18:10:28 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Meunier",
"Pierre-Étienne",
""
]
] |
new_dataset
| 0.971946 |
1312.2163
|
Farzad Farnoud (Hassanzadeh)
|
Farzad Farnoud (Hassanzadeh) and Olgica Milenkovic
|
Multipermutation Codes in the Ulam Metric for Nonvolatile Memories
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of multipermutation code design in the Ulam metric for
novel storage applications. Multipermutation codes are suitable for flash
memory where cell charges may share the same rank. Changes in the charges of
cells manifest themselves as errors whose effects on the retrieved signal may
be measured via the Ulam distance. As part of our analysis, we study
multipermutation codes in the Hamming metric, known as constant composition
codes. We then present bounds on the size of multipermutation codes and their
capacity, for both the Ulam and the Hamming metrics. Finally, we present
constructions and accompanying decoders for multipermutation codes in the Ulam
metric.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 01:51:09 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Farnoud",
"Farzad",
"",
"Hassanzadeh"
],
[
"Milenkovic",
"Olgica",
""
]
] |
new_dataset
| 0.999565 |
1312.2185
|
Abhijeet Khopkar
|
Abhijeet Khopkar, Sathish Govindrajan
|
Geometric graphs on convex point sets
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note, we introduce a family of bipartite graphs called path
restricted ordered bipartite graphs and present it as an abstract
generalization of some well known geometric graphs like unit distance graphs on
convex point sets. In the framework of convex point sets, we also focus on a
generalized version of Gabriel graphs known as locally Gabriel graphs or
$LGGs$. $LGGs$ can also be seen as the generalization of unit distance graphs.
The path restricted ordered bipartite graph is also a generalization of $LGGs$.
We study some structural properties of the path restricted ordered bipartite
graphs and also show that such graphs have the maximum edge complexity of
$\theta(n \log n)$. It gives an alternate proof to the well known result that
$UDGs$ and $LGGs$ on convex points have $O(n \log n)$ edges.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 09:31:24 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Khopkar",
"Abhijeet",
""
],
[
"Govindrajan",
"Sathish",
""
]
] |
new_dataset
| 0.99279 |
1312.2225
|
Amor Lazzez Dr.
|
Amor Lazzez
|
VoIP Technology: Security Issues Analysis
|
9 pages
|
International Journal of Emerging Trends & Technology in Computer
Science (IJETTCS), Volume 2, Issue 4, July-August 2013
| null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice over IP (VoIP) is the technology allowing voice and multimedia
transmissions as data packets over a private or a public IP network. Thanks to
the benefits that it may provide, the VoIP technology is increasingly
attracting attention and interest in the industry. Actually, VoIP allows
significant benefits for customers and communication services providers such as
cost savings, rich media service, phone and service portability, mobility, and
the integration with other applications. Nevertheless, the deployment of the
VoIP technology encounters many challenges such as architecture complexity,
interoperability issues, QoS issues, and security concerns. Among these
disadvantages, VoIP security issues are becoming more serious because
traditional security devices, protocols, and architectures cannot adequately
protect VoIP systems from recent intelligent attacks. The aim of this paper is
carry out a deep analysis of the security concerns of the VoIP technology.
Firstly, we present a brief overview about the VoIP technology. Then, we
discuss security attacks and vulnerabilities related to VoIP protocols and
devices. After that, we talk about the security profiles of the VoIP protocols,
and we present the main security components designed to help the deployment of
a reliable and secured VoIP systems.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 15:07:24 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Lazzez",
"Amor",
""
]
] |
new_dataset
| 0.998969 |
1312.2242
|
Nikolaos Mavridis
|
N. Mavridis, S. Konstantopoulos, I. Vetsikas, I. Heldal, P.
Karampiperis, G. Mathiason, S. Thill, K. Stathis, V. Karkaletsis
|
CLIC: A Framework for Distributed, On-Demand, Human-Machine Cognitive
Systems
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional Artificial Cognitive Systems (for example, intelligent robots)
share a number of limitations. First, they are usually made up only of machine
components; humans are only playing the role of user or supervisor. And yet,
there are tasks in which the current state of the art of AI has much worse
performance or is more expensive than humans: thus, it would be highly
beneficial to have a systematic way of creating systems with both human and
machine components, possibly with remote non-expert humans providing
short-duration real-time services. Second, their components are often dedicated
to only one system, and underutilized for a big part of their lifetime. Third,
there is no inherent support for robust operation, and if a new better
component becomes available, one cannot easily replace the old component.
Fourth, they are viewed as a resource to be developed and owned, not as a
utility. Thus, we are presenting CLIC: a framework for constructing cognitive
systems that overcome the above limitations. The architecture of CLIC provides
specific mechanisms for creating and operating cognitive systems that fulfill a
set of desiderata: First, that are distributed yet situated, interacting with
the physical world though sensing and actuation services, and that are also
combining human as well as machine services. Second, that are made up of
components that are time-shared and re-usable. Third, that provide increased
robustness through self-repair. Fourth, that are constructed and reconstructed
on the fly, with components that dynamically enter and exit the system during
operation, on the basis of availability, pricing, and need. Importantly, fifth,
the cognitive systems created and operated by CLIC do not need to be owned and
can be provided on demand, as a utility; thus transforming human-machine
situated intelligence to a service, and opening up many interesting
opportunities.
|
[
{
"version": "v1",
"created": "Sun, 8 Dec 2013 18:53:58 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Mavridis",
"N.",
""
],
[
"Konstantopoulos",
"S.",
""
],
[
"Vetsikas",
"I.",
""
],
[
"Heldal",
"I.",
""
],
[
"Karampiperis",
"P.",
""
],
[
"Mathiason",
"G.",
""
],
[
"Thill",
"S.",
""
],
[
"Stathis",
"K.",
""
],
[
"Karkaletsis",
"V.",
""
]
] |
new_dataset
| 0.980672 |
1312.2451
|
Sarwat Nizamani
|
Sarwat Nizamani, Nasrullah Memon
|
CEAI: CCM based Email Authorship Identification Model
| null |
Egyptian Informatics Journal,Volume 14, Issue 3, November 2013
| null | null |
cs.LG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we present a model for email authorship identification (EAI) by
employing a Cluster-based Classification (CCM) technique. Traditionally,
stylometric features have been successfully employed in various authorship
analysis tasks; we extend the traditional feature-set to include some more
interesting and effective features for email authorship identification (e.g.
the last punctuation mark used in an email, the tendency of an author to use
capitalization at the start of an email, or the punctuation after a greeting or
farewell). We also included Info Gain feature selection based content features.
It is observed that the use of such features in the authorship identification
process has a positive impact on the accuracy of the authorship identification
task. We performed experiments to justify our arguments and compared the
results with other base line models. Experimental results reveal that the
proposed CCM-based email authorship identification model, along with the
proposed feature set, outperforms the state-of-the-art support vector machine
(SVM)-based models, as well as the models proposed by Iqbal et al. [1, 2]. The
proposed model attains an accuracy rate of 94% for 10 authors, 89% for 25
authors, and 81% for 50 authors, respectively on Enron dataset, while 89.5%
accuracy has been achieved on authors' constructed real email dataset. The
results on Enron dataset have been achieved on quite a large number of authors
as compared to the models proposed by Iqbal et al. [1, 2].
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 18:25:15 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Nizamani",
"Sarwat",
""
],
[
"Memon",
"Nasrullah",
""
]
] |
new_dataset
| 0.998401 |
1312.2530
|
Trevor Owens
|
Trevor Owens
|
Mr. Moo's First RPG: Rules, Discussion and the Instructional
Implications of Collective Intelligence on the Open Web
|
Published as a chapter in Rhetoric/Composition/Play: How Electronic
Games Mediate Composition Theory and Practice (and Vice Versa). (2013) New
York, NY: Palgrave Macmillan
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a moment, imagine an active online learning community of writers,
artists, and designers, many spending more than eight hours a week composing
projects. In this community, young people, primarily between the ages of 18-26,
regularly critique, facilitate, and support each other in their composition
activities. They are motivated to participate by their shared interest and
affinity for their creative work. In the age of Wikipedia, this might not seem
particularly novel, but what I am actually describing is an online discussion
board, RPGmakerVX.net. Elsewhere, I have presented a general outline of the
kinds of individuals involved in this community and the way that the site as a
whole functions as an open learning environment (Owens, 2010). In this essay, I
present a case study of one participant in this community. His user name is Mr.
Moo, and at the time I interviewed him, he was a 19 year old college student
from Calgary, Canada. When he created his first role-playing game, Prelude of
Identity, he was eighteen. After providing a conceptual context for this case
study in work on collective intelligence, I draw out the relationship between
the technical system of the discussion boards and the creative process of
engaging with peers in the production of a video game. I suggest that the
discussion board rules and interaction enable a dialogue around composition
that ultimately leaves Mr. Moo with a valuable learning experience while also
producing a role-playing game. Thinking about this system from the perspective
of collective intelligence enables us to use these kinds of interest-driven,
online affinity communities as tools in an open education tool kit for
educators in more formal learning environments. Ultimately, discussion boards
in gaming communities, both the technical and social systems they represent,
could be thought of as instructional tools.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 09:30:27 GMT"
}
] | 2013-12-10T00:00:00 |
[
[
"Owens",
"Trevor",
""
]
] |
new_dataset
| 0.975823 |
1312.1920
|
Rui Meireles
|
Carlos Ameixieira, Andr\'e Cardote, Filipe Neves, Rui Meireles, Susana
Sargento, Lu\'is Coelho, Jo\~ao Afonso, Bruno Areias, Eduardo Mota, Rui
Costa, Ricardo Matos, Jo\~ao Barros
|
HarborNet: A Real-World Testbed for Vehicular Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a real-world testbed for research and development in vehicular
networking that has been deployed successfully in the sea port of Leix\~oes in
Portugal. The testbed allows for cloud-based code deployment, remote network
control and distributed data collection from moving container trucks, cranes,
tow boats, patrol vessels and roadside units, thereby enabling a wide range of
experiments and performance analyses. After describing the testbed architecture
and its various modes of operation, we give concrete examples of its use and
offer insights on how to build effective testbeds for wireless networking with
moving vehicles.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 16:53:26 GMT"
}
] | 2013-12-09T00:00:00 |
[
[
"Ameixieira",
"Carlos",
""
],
[
"Cardote",
"André",
""
],
[
"Neves",
"Filipe",
""
],
[
"Meireles",
"Rui",
""
],
[
"Sargento",
"Susana",
""
],
[
"Coelho",
"Luís",
""
],
[
"Afonso",
"João",
""
],
[
"Areias",
"Bruno",
""
],
[
"Mota",
"Eduardo",
""
],
[
"Costa",
"Rui",
""
],
[
"Matos",
"Ricardo",
""
],
[
"Barros",
"João",
""
]
] |
new_dataset
| 0.999805 |
1312.1969
|
Sarwat Nizamani
|
Jordi M. Cortes, Sarwat Nizamani and Nasrullah Memon
|
PSN: Portfolio Social Network
| null |
IJCEE 2014 Vol.6 (1): 12-15 ISSN: 1793-8163
| null | null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we present a web-based information system which is a portfolio
social network (PSN) that provides solutions to recruiters and job seekers. The
proposed system enables users to create portfolios so that he/she can add his
specializations with piece of code, if any, specifically for software
engineers, which is accessible online. The unique feature of the system is to
enable the recruiters to quickly view the prominent skills of the users. A
comparative analysis of the proposed system with the state of the art systems
is presented. The comparative study reveals that the proposed system has
advanced functionalities.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 19:19:20 GMT"
}
] | 2013-12-09T00:00:00 |
[
[
"Cortes",
"Jordi M.",
""
],
[
"Nizamani",
"Sarwat",
""
],
[
"Memon",
"Nasrullah",
""
]
] |
new_dataset
| 0.988777 |
1312.1037
|
Hari Ram Balakrishnan
|
B Hari Ram, G Kanchana Vaishnavi, and K Giridhar
|
Blind Fractional Interference Alignment
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractional Interference Alignment (FIA) is a transmission scheme which
achieves any value between [0,1] for the Symbols transmitted per Antenna per
Channel use (SpAC). FIA was designed in [1] specifically for Finite Alphabet
(FA) signals, under the constraint that the Minimum Distance (MD) detector is
used at all the receivers. Similar to classical interference alignment, the FIA
precoder also needs perfect channel state information at all the transmitters
(CSIT). In this work, a novel Blind Fractional Interference Alignment (B-FIA)
scheme is introduced, where the basic assumption is that CSIT is not available.
We consider two popular channel models, namely: Broadcast channel, and
Interference channel. For these two channel models, the maximum achievable
value of SpAC satisfying the constraints of the MD detector is obtained, but
with no CSIT, and also a precoder design is provided to obtain any value of
SpAC in the achievable range.
Further, the precoder structure provided has one distinct advantage:
interference channel state information at the receiver (I-CSIR) is not needed,
when all the transmitters and receivers are equipped with one antenna each.
When two or more antennas are used at both ends, I-CSIR must be available to
obtain the maximum achievable value of SpAC. The receiver designs for both the
Minimum Distance and the Maximum Likelihood (ML) decoders are discussed, where
the interference statistics is estimated from the received signal samples.
Simulation results of the B-FIA show that the ML decoder with estimated
statistics achieves a significantly better error rate performance when compared
to the MD decoder with known statistics, since the MD decoder assumes the
interference plus noise term as colored Gaussian noise.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 06:22:38 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Dec 2013 06:57:53 GMT"
}
] | 2013-12-06T00:00:00 |
[
[
"Ram",
"B Hari",
""
],
[
"Vaishnavi",
"G Kanchana",
""
],
[
"Giridhar",
"K",
""
]
] |
new_dataset
| 0.993126 |
1312.1385
|
Sandra Payette
|
Sandra Payette and Thornton Staples
|
The Mellon Fedora Project: Digital Library Architecture Meets XML and
Web Services
| null |
Sixth European Conference on Research and Advanced Technology for
Digital Libraries, Lecture Notes in Computer Science, Springer, September
2003
| null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The University of Virginia received a grant of $1,000,000 from the Andrew W.
Mellon Foundation to enable the Library, in collaboration with Cornell
University, to build a digital object repository system based on the Flexible
Extensible Digital Object and Repository Architecture (Fedora). The new system
demonstrates how distributed digital library architecture can be deployed using
web-based technologies, including XML and Web services. The new system is
designed to be a foundation upon which interoperable web-based digital
libraries can be built. Virginia and collaborating partners in the US and UK
will evaluate the system using a diverse set of digital collections. The
software will be made available to the public as an open-source release.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 23:40:13 GMT"
}
] | 2013-12-06T00:00:00 |
[
[
"Payette",
"Sandra",
""
],
[
"Staples",
"Thornton",
""
]
] |
new_dataset
| 0.999343 |
1312.1423
|
Muhammad Marwan Muhammad Fuad
|
Muhammad Marwan Muhammad Fuad
|
ABC-SG: A New Artificial Bee Colony Algorithm-Based Distance of
Sequential Data Using Sigma Grams
|
The Tenth Australasian Data Mining Conference - AusDM 2012, Sydney,
Australia, 5-7 December, 2012
| null | null | null |
cs.NE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of similarity search is one of the main problems in computer
science. This problem has many applications in text-retrieval, web search,
computational biology, bioinformatics and others. Similarity between two data
objects can be depicted using a similarity measure or a distance metric. There
are numerous distance metrics in the literature, some are used for a particular
data type, and others are more general. In this paper we present a new distance
metric for sequential data which is based on the sum of n-grams. The novelty of
our distance is that these n-grams are weighted using artificial bee colony; a
recent optimization algorithm based on the collective intelligence of a swarm
of bees on their search for nectar. This algorithm has been used in optimizing
a large number of numerical problems. We validate the new distance
experimentally.
|
[
{
"version": "v1",
"created": "Thu, 5 Dec 2013 03:19:51 GMT"
}
] | 2013-12-06T00:00:00 |
[
[
"Fuad",
"Muhammad Marwan Muhammad",
""
]
] |
new_dataset
| 0.992962 |
1309.0157
|
Matthew Parker Prof
|
Gaofei Wu and Matthew G. Parker
|
A complementary construction using mutually unbiased bases
|
25 pages, 1 figure
| null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a construction for complementary pairs of arrays that exploits a
set of mutually-unbiased bases, and enumerate these arrays as well as the
corresponding set of complementary sequences obtained from the arrays by
projection. We also sketch an algorithm to uniquely generate these sequences.
The pairwise squared inner-product of members of the sequence set is shown to
be $\frac{1}{2}$. Moreover, a subset of the set can be viewed as a codebook
that asymptotically achieves $\sqrt{\frac{3}{2}}$ times the Welch bound.
|
[
{
"version": "v1",
"created": "Sat, 31 Aug 2013 21:07:16 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Dec 2013 15:30:52 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Wu",
"Gaofei",
""
],
[
"Parker",
"Matthew G.",
""
]
] |
new_dataset
| 0.995306 |
1312.0940
|
Suranjan Ganguly
|
Pramit Ghosh, Debotosh Bhattacharjee, Mita Nasipuri and Dipak Kumar
Basu
|
Medical Aid for Automatic Detection of Malaria
|
8 pages, International Conference on Computer Information Systems and
Industrial Management Applications 2011. arXiv admin note: text overlap with
arXiv:1312.0809
| null | null | null |
cs.CY cs.CV
|
http://creativecommons.org/licenses/publicdomain/
|
The analysis and counting of blood cells in a microscope image can provide
useful information concerning to the health of a person. In particular,
morphological analysis of red blood cells deformations can effectively detect
important disease like malaria. Blood images, obtained by the microscope, which
is coupled with a digital camera, are analyzed by the computer for diagnosis or
can be transmitted easily to clinical centers than liquid blood samples.
Automatic analysis system for the presence of Plasmodium in microscopic image
of blood can greatly help pathologists and doctors that typically inspect blood
films manually. Unfortunately, the analysis made by human experts is not rapid
and not yet standardized due to the operators capabilities and tiredness. The
paper shows how effectively and accurately it is possible to identify the
Plasmodium in the blood film. In particular, the paper presents how to enhance
the microscopic image and filter out the unnecessary segments followed by the
threshold based segmentation and recognize the presence of Plasmodium. The
proposed system can be deployed in the remote area as a supporting aid for
telemedicine technology and only basic training is sufficient to operate it.
This system achieved more than 98 percentage accuracy for the samples collected
to test this system.
|
[
{
"version": "v1",
"created": "Tue, 3 Dec 2013 13:15:57 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Ghosh",
"Pramit",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Nasipuri",
"Mita",
""
],
[
"Basu",
"Dipak Kumar",
""
]
] |
new_dataset
| 0.973757 |
1312.1172
|
Oleg Verbitsky
|
Johannes K\"obler, Sebastian Kuhnert, Oleg Verbitsky
|
Circular-arc hypergraphs: Rigidity via Connectedness
|
21 pages, 8 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that
is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is
an arc of consecutive vertices. An arc ordering is tight if, for any two
hyperedges $A$ and $B$ such that $A$ is a nonempty subset of $B$ and $B$ is not
equal to $V(H)$, the corresponding arcs share a common endpoint. We give
sufficient conditions for $H$ to have, up to reversing, a unique arc ordering
and a unique tight arc ordering. These conditions are stated in terms of
connectedness properties of $H$.
It is known that $G$ is a proper circular-arc graph exactly when its closed
neighborhood hypergraph $N[G]$ admits a tight arc ordering. We explore
connectedness properties of $N[G]$ and prove that, if $G$ is a connected,
twin-free, proper circular-arc graph with non-bipartite complement, then $N[G]$
has, up to reversing, a unique arc ordering. If the complement of $G$ is
bipartite and connected, then $N[G]$ has, up to reversing, two tight arc
orderings. As a corollary, we notice that in both of the two cases $G$ has an
essentially unique intersection representation. The last result also follows
from the work by Deng, Hell, and Huang based on a theory of local tournaments.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 14:19:07 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Köbler",
"Johannes",
""
],
[
"Kuhnert",
"Sebastian",
""
],
[
"Verbitsky",
"Oleg",
""
]
] |
new_dataset
| 0.99596 |
1312.1178
|
Ben de Lacy Costello Dr
|
Ben de Lacy Costello and Andrew Adamatzky
|
Routing of Physarum polycephalum signals using simple chemicals
|
19 pages, 5 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In previous work the chemotaxis towards simple organic chemicals was
assessed. We utilise the knowledge gained from these chemotactic assays to
route Physarum polycephalum at a series of junctions. By applying chemical
inputs at a simple T-junction we were able to reproducibly control the path
taken by the plasmodium of P. Polycephalum. Where the chemoattractant farnesene
was used at one input a routed signal could be reproducibly generated i.e. P.
Polycephalum moves towards the source of chemoattractant. Where the
chemoattractant was applied at both inputs the signal was reproducibly split.
If a chemorepellent was used then the signal was reproducibly suppressed. If no
chemical input was used in the simple circuit then a random signal was
generated, whereby P. Polycephalum would move towards one output at the
junction, but the direction was randomly selected. We extended this study to a
more complex series of T-junctions to explore further the potential of routing
P. Polycephalum. Although many of the circuits were completed effectively, any
errors from the implementation of the simple T-junction were magnified. There
were also issues with cascading effects through multiple junctions. For example
signal splitting could be reproducibly initiated at the first junction but not
at subsequent junctions. This work highlights the potential for exploiting
chemotaxis to achieve complex and reliable routing of P. Polycephalum signals.
This may be useful in implementing computing algorithms, design of autonomous
robots and directed material synthesis. In additional experiments we showed
that the application of chemoattractant compounds at specific locations on a
homogeneous substrate could be used to reliably control the spatial
configuration of P. Polycephalum. This may have applications in implementing
geometric calculations and in robot navigation tasks such as mapping chemical
plumes.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 14:30:24 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.998017 |
1312.1260
|
Sandra Payette
|
Sandra Payette and Carl Lagoze
|
Policy-Carrying, Policy-Enforcing Digital Objects
|
European Conference on Research and Advanced Technology for Digital
Libraries, Lisbon, Portugal, published in Lecture Notes in Computer Science,
Springer, 2000, http://www.springerlink.com/content/lw0bjhnyvluj0433/
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the motivation for moving policy enforcement for access control
down to the digital object level. The reasons for this include handling of
item-specific behaviors, adapting to evolution of digital objects, and
permitting objects to move among repositories and portable devices. We then
describe our experiments that integrate the Fedora architecture for digital
objects and repositories and the PoET implementation of security automata to
effect such objectcentric policy enforcement.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 17:54:41 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Payette",
"Sandra",
""
],
[
"Lagoze",
"Carl",
""
]
] |
new_dataset
| 0.968636 |
1312.1309
|
Kaniska Mohanty
|
Kaniska Mohanty and Mahesh K. Varanasi
|
On the DoF Region of the K-user MISO Broadcast Channel with Hybrid CSIT
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An outer bound for the degrees of freedom (DoF) region of the K-user
multiple-input single-output (MISO) broadcast channel (BC) is developed under
the hybrid channel state information at transmitter (CSIT) model, in which the
transmitter has instantaneous CSIT of channels to a subset of the receivers and
delayed CSIT of channels to the rest of the receivers. For the 3-user MISO BC,
when the transmitter has instantaneous CSIT of the channel to one receiver and
delayed CSIT of channels to the other two, two new communication schemes are
designed, which are able to achieve the DoF tuple of
$\left(1,\frac{1}{3},\frac{1}{3}\right)$, with a sum DoF of $\frac{5}{3}$, that
is greater than the sum DoF achievable only with delayed CSIT. Another
communication scheme showing the benefit of the alternating CSIT model is also
developed, to obtain the DoF tuple of $\left(1,\frac{4}{9},\frac{4}{9}\right)$
for the 3-user MISO BC.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 20:12:37 GMT"
}
] | 2013-12-05T00:00:00 |
[
[
"Mohanty",
"Kaniska",
""
],
[
"Varanasi",
"Mahesh K.",
""
]
] |
new_dataset
| 0.991848 |
1209.0047
|
Kaniska Mohanty
|
Kaniska Mohanty, Chinmay S. Vaze, Mahesh K. Varanasi
|
The Degrees of Freedom Region of the MIMO Interference Channel with
Hybrid CSIT
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The degrees of freedom (DoF) region of the two-user MIMO (multiple-input
multiple-output) interference channel is established under a new model termed
as hybrid CSIT. In this model, one transmitter has delayed channel state
information (CSI) and the other transmitter has instantaneous CSIT, of incoming
channel matrices at the respective unpaired receivers, and neither transmitter
has any knowledge of the incoming channel matrices of its respective paired
receiver. The DoF region for hybrid CSIT, and consequently that of
$2\times2\times3^{5}$ CSIT models, is completely characterized, and a new
achievable scheme based on a combination of transmit beamforming and
retrospective interference alignment is developed. Conditions are obtained on
the numbers of antennas at each of the four terminals such that the DoF region
under hybrid CSIT is equal to that under (a) global and instantaneous CSIT and
(b) global and delayed CSIT, with the remaining cases resulting in a DoF region
with hybrid CSIT that lies somewhere in between the DoF regions under the
instantaneous and delayed CSIT settings. Further synergistic benefits accruing
from switching between the two hybrid CSIT models are also explored.
|
[
{
"version": "v1",
"created": "Sat, 1 Sep 2012 02:34:05 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Dec 2013 21:33:32 GMT"
}
] | 2013-12-04T00:00:00 |
[
[
"Mohanty",
"Kaniska",
""
],
[
"Vaze",
"Chinmay S.",
""
],
[
"Varanasi",
"Mahesh K.",
""
]
] |
new_dataset
| 0.97527 |
1309.6204
|
Lei Jin
|
Lei Jin, Xuelian Long, James Joshi
|
A Friendship Privacy Attack on Friends and 2-Distant Neighbors in Social
Networks
|
This paper has been withdrawn by the authors
| null | null | null |
cs.SI cs.CR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an undirected social graph, a friendship link involves two users and the
friendship is visible in both the users' friend lists. Such a dual visibility
of the friendship may raise privacy threats. This is because both users can
separately control the visibility of a friendship link to other users and their
privacy policies for the link may not be consistent. Even if one of them
conceals the link from a third user, the third user may find such a friendship
link from another user's friend list. In addition, as most users allow their
friends to see their friend lists in most social network systems, an adversary
can exploit the inconsistent policies to launch privacy attacks to identify and
infer many of a targeted user's friends. In this paper, we propose, analyze and
evaluate such an attack which is called Friendship Identification and Inference
(FII) attack. In a FII attack scenario, we assume that an adversary can only
see his friend list and the friend lists of his friends who do not hide the
friend lists from him. Then, a FII attack contains two attack steps: 1) friend
identification and 2) friend inference. In the friend identification step, the
adversary tries to identify a target's friends based on his friend list and
those of his friends. In the friend inference step, the adversary attempts to
infer the target's friends by using the proposed random walk with restart
approach. We present experimental results using three real social network
datasets and show that FII attacks are generally efficient and effective when
adversaries and targets are friends or 2-distant neighbors. We also
comprehensively analyze the attack results in order to find what values of
parameters and network features could promote FII attacks. Currently, most
popular social network systems with an undirected friendship graph, such as
Facebook, LinkedIn and Foursquare, are susceptible to FII attacks.
|
[
{
"version": "v1",
"created": "Tue, 24 Sep 2013 15:13:13 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Dec 2013 14:00:52 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Jin",
"Lei",
""
],
[
"Long",
"Xuelian",
""
],
[
"Joshi",
"James",
""
]
] |
new_dataset
| 0.991139 |
1312.0078
|
Manuel Serrano
|
G\'erard Berry (INRIA Sophia Antipolis), Manuel Serrano
|
Hop and HipHop : Multitier Web Orchestration
|
International Conference on Distributed Computing and Internet
Technology (2014)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rich applications merge classical computing, client-server concurrency,
web-based interfaces, and the complex time- and event-based reactive
programming found in embedded systems. To handle them, we extend the Hop web
programming platform by HipHop, a domain-specific language dedicated to
event-based process orchestration. Borrowing the synchronous reactive model of
Esterel, HipHop is based on synchronous concurrency and preemption primitives
that are known to be key components for the modular design of complex reactive
behaviors. HipHop departs from Esterel by its ability to handle the dynamicity
of Web applications, thanks to the reflexivity of Hop. Using a music player
example, we show how to modularly build a non-trivial Hop application using
HipHop orchestration code.
|
[
{
"version": "v1",
"created": "Sat, 30 Nov 2013 08:48:02 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Berry",
"Gérard",
"",
"INRIA Sophia Antipolis"
],
[
"Serrano",
"Manuel",
""
]
] |
new_dataset
| 0.998722 |
1312.0148
|
Muhammad Aamir
|
Muhammad Aamir
|
On Replacing PID Controller with ANN Controller for DC Motor Position
Control
|
9 pages, 9 figures, 2 tables
|
International Journal of Research Studies in Computing, Consortia
Academia Publishing, vol. 2 no. 1, pp. 21-29, April 2013
|
10.5861/ijrsc.2013.236
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The process industry implements many techniques with certain parameters in
its operations to control the working of several actuators on field. Amongst
these actuators, DC motor is a very common machine. The angular position of DC
motor can be controlled to drive many processes such as the arm of a robot. The
most famous and well known controller for such applications is PID controller.
It uses proportional, integral and derivative functions to control the input
signal before sending it to the plant unit. In this paper, another controller
based on Artificial Neural Network (ANN) control is examined to replace the PID
controller for controlling the angular position of a DC motor to drive a robot
arm. Simulation is performed in MATLAB after training the neural network
(supervised learning) and it is shown that results are acceptable and
applicable in process industry for reference control applications. The paper
also indicates that the ANN controller can be less complicated and less costly
to implement in industrial control applications as compared to some other
proposed schemes.
|
[
{
"version": "v1",
"created": "Sat, 30 Nov 2013 20:01:39 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Aamir",
"Muhammad",
""
]
] |
new_dataset
| 0.99776 |
1312.0372
|
Marc Fossorier
|
Marc Fossorier
|
Polar Codes: Graph Representation and Duality
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present an iterative construction of a polar code and
develop properties of the dual of a polar code. Based on this approach, belief
propagation of a polar code can be presented in the context of low-density
parity check codes.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 08:35:51 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Fossorier",
"Marc",
""
]
] |
new_dataset
| 0.999716 |
1312.0489
|
Antoine Desmet
|
Antoine Desmet and Erol Gelenbe
|
Capacity Based Evacuation with Dynamic Exit Signs
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exit paths in buildings are designed to minimise evacuation time when the
building is at full capacity. We present an evacuation support system which
does this regardless of the number of evacuees. The core concept is to even-out
congestion in the building by diverting evacuees to less-congested paths in
order to make maximal usage of all accessible routes throughout the entire
evacuation process. The system issues a set of flow-optimal routes using a
capacity-constrained routing algorithm which anticipates evolutions in path
metrics using the concept of "future capacity reservation". In order to direct
evacuees in an intuitive manner whilst implementing the routing algorithm's
scheme, we use dynamic exit signs, i.e. whose pointing direction can be
controlled. To make this system practical and minimise reliance on sensors
during the evacuation, we use an evacuee mobility model and make several
assumptions on the characteristics of the evacuee flow. We validate this
concept using simulations, and show how the underpinning assumptions may limit
the system's performance, especially in low-headcount evacuations.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 15:26:41 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Desmet",
"Antoine",
""
],
[
"Gelenbe",
"Erol",
""
]
] |
new_dataset
| 0.996804 |
1312.0522
|
Brett Kaufman
|
Brett Kaufman and Jorma Lilleberg and Behnaam Aazhang
|
Analog Baseband Cancellation for Full-Duplex: An Experiment Driven
Analysis
|
22 pages, 12 figures, submitted to IEEE JSAC special issue on
Full-Duplex
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent wireless testbed implementations have proven that full-duplex
communication is in fact possible and can outperform half-duplex systems. Many
of these implementations modify existing half-duplex systems to operate in
full-duplex. To realize the full potential of full-duplex, radios need to be
designed with self-interference in mind. In our work, we use a novel patch
antenna prototype in an experimental setup to characterize the
self-interference channel between transmit and receive radios. We derive an
equivalent analytical baseband model and propose analog baseband cancellation
techniques to complement the RF cancellation provided by the patch antenna
prototype. Our results show that a wide bandwidth, moderate isolation scheme
achieves up to 2.4 bps/Hz higher achievable rate than a narrow bandwidth, high
isolation scheme. Furthermore, the analog baseband cancellation yields a
10-10,000 improvement in BER over RF only cancellation.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 17:25:03 GMT"
}
] | 2013-12-03T00:00:00 |
[
[
"Kaufman",
"Brett",
""
],
[
"Lilleberg",
"Jorma",
""
],
[
"Aazhang",
"Behnaam",
""
]
] |
new_dataset
| 0.981705 |
1306.0957
|
Andrea Luigi Tironi
|
Luis Felipe Tapia Cuiti\~no and Andrea Luigi Tironi
|
Dual codes of product semi-linear codes
|
v1: 37 pages; v2: 31 pages, the presentation of the main topics is
improved by some minor changes and additional results, and some mistakes and
typos have been corrected
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta
: \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this
paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a
semi-linear map $T:\mathbb{F}_q^n\to\mathbb{F}_q^n$ for some $n\geq 2$. In
particular, we study three kind of their dual codes, some relations between
them and we focus on codes which are products of module skew codes in the
non-commutative polynomial ring $\mathbb{F}_q[X,\theta]$ as a subcase of linear
codes invariant by a semi-linear map $T$. In this setting we give also an
algorithm for encoding, decoding and detecting errors and we show a method to
construct codes invariant under a fixed $T$.
|
[
{
"version": "v1",
"created": "Wed, 5 Jun 2013 01:30:05 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Nov 2013 01:44:43 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Cuitiño",
"Luis Felipe Tapia",
""
],
[
"Tironi",
"Andrea Luigi",
""
]
] |
new_dataset
| 0.999468 |
1311.7215
|
Alireza Rezvanian
|
Aylin Mousavian, Alireza Rezvanian, Mohammad Reza Meybodi
|
Solving Minimum Vertex Cover Problem Using Learning Automata
|
5 pages, 5 figures, conference
| null | null | null |
cs.AI cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Minimum vertex cover problem is an NP-Hard problem with the aim of finding
minimum number of vertices to cover graph. In this paper, a learning automaton
based algorithm is proposed to find minimum vertex cover in graph. In the
proposed algorithm, each vertex of graph is equipped with a learning automaton
that has two actions in the candidate or non-candidate of the corresponding
vertex cover set. Due to characteristics of learning automata, this algorithm
significantly reduces the number of covering vertices of graph. The proposed
algorithm based on learning automata iteratively minimize the candidate vertex
cover through the update its action probability. As the proposed algorithm
proceeds, a candidate solution nears to optimal solution of the minimum vertex
cover problem. In order to evaluate the proposed algorithm, several experiments
conducted on DIMACS dataset which compared to conventional methods.
Experimental results show the major superiority of the proposed algorithm over
the other methods.
|
[
{
"version": "v1",
"created": "Thu, 28 Nov 2013 05:49:34 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Mousavian",
"Aylin",
""
],
[
"Rezvanian",
"Alireza",
""
],
[
"Meybodi",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.996722 |
1311.7242
|
Jonathan Protzenko
|
Jonathan Protzenko and Fran\c{c}ois Pottier
|
Programming with Permissions in Mezzo
| null |
ICFP 2013, Proceedings of the 18th ACM SIGPLAN international
conference on Functional programming
|
10.1145/2500365.2500598
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Mezzo, a typed programming language of ML lineage. Mezzo is
equipped with a novel static discipline of duplicable and affine permissions,
which controls aliasing and ownership. This rules out certain mistakes,
including representation exposure and data races, and enables new idioms, such
as gradual initialization, memory re-use, and (type)state changes. Although the
core static discipline disallows sharing a mutable data structure, Mezzo offers
several ways of working around this restriction, including a novel dynamic
ownership control mechanism which we dub "adoption and abandon".
|
[
{
"version": "v1",
"created": "Thu, 28 Nov 2013 09:15:55 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Protzenko",
"Jonathan",
""
],
[
"Pottier",
"François",
""
]
] |
new_dataset
| 0.99716 |
1311.7295
|
Gerardo Aragon Camarasa
|
Gerardo Aragon-Camarasa, Susanne B. Oehler, Yuan Liu, Sun Li, Paul
Cockshott and J. Paul Siebert
|
Glasgow's Stereo Image Database of Garments
|
7 pages, 6 figure, image database
| null | null | null |
cs.RO cs.CV
|
http://creativecommons.org/licenses/by/3.0/
|
To provide insight into cloth perception and manipulation with an active
binocular robotic vision system, we compiled a database of 80 stereo-pair
colour images with corresponding horizontal and vertical disparity maps and
mask annotations, for 3D garment point cloud rendering has been created and
released. The stereo-image garment database is part of research conducted under
the EU-FP7 Clothes Perception and Manipulation (CloPeMa) project and belongs to
a wider database collection released through CloPeMa (www.clopema.eu). This
database is based on 16 different off-the-shelve garments. Each garment has
been imaged in five different pose configurations on the project's binocular
robot head. A full copy of the database is made available for scientific
research only at https://sites.google.com/site/ugstereodatabase/.
|
[
{
"version": "v1",
"created": "Thu, 28 Nov 2013 12:09:28 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Aragon-Camarasa",
"Gerardo",
""
],
[
"Oehler",
"Susanne B.",
""
],
[
"Liu",
"Yuan",
""
],
[
"Li",
"Sun",
""
],
[
"Cockshott",
"Paul",
""
],
[
"Siebert",
"J. Paul",
""
]
] |
new_dataset
| 0.998015 |
1311.7400
|
Hafez Moawad seliem
|
Hafez Moawad, Eman Shaaban, Zaki Taha Fayed
|
Stop_times based Routing Protocol for VANET
|
6 pages, 4 figure, Published with International Journal of Computer
Applications (IJCA)
|
International Journal of Computer Applications 81(18):4-9,
November 2013. Published by Foundation of Computer Science, New York, USA
|
10.5120/14221-2029
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular Ad hoc Network (VANET) is a special class of Mobile Ad hoc Network
(MANET) where vehicles are considered as MANET nodes with wireless links. The
key difference of VANET and MANET is the special mobility pattern and rapidly
changeable topology. There has been significant interest in improving safety
and traffic efficiency using VANET. The design of routing protocols in VANET is
important and necessary issue for support the smart ITS. Existing routing
protocols of MANET are not suitable for VANET. AOMDV is the most important on
demand multipath routing protocol. This paper proposes SSD-AOMDV as VANET
routing protocol. SSD-AOMDV improves AOMDV to suit VANET characteristics.
SSD-AOMDV adds the mobility parameters: Stop_times, Speed and Direction to hop
count as new AOMDV routing metric to select next hop during the route discovery
phase. Stop_times metric is added to simulate buses mobility pattern and
traffic lights at intersections. Simulation results show that SSD-AOMDV
achieves better performance compared to AOMDV.
|
[
{
"version": "v1",
"created": "Thu, 28 Nov 2013 19:17:25 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Moawad",
"Hafez",
""
],
[
"Shaaban",
"Eman",
""
],
[
"Fayed",
"Zaki Taha",
""
]
] |
new_dataset
| 0.986016 |
1311.7462
|
Yi-King Choi
|
Yi-King Choi, Wenping Wang, Bernard Mourrain, Changhe Tu, Xiaohong
Jia, Feng Sun
|
Continuous Collision Detection for Composite Quadric Models
|
23 pages, 13 figures
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A composite quadric model (CQM) is an object modeled by piecewise linear or
quadric patches. We study the continuous detection problem of a special type of
CQM objects which are commonly used in CAD/CAM, that is, the boundary surfaces
of such a CQM intersect only in straight line segments or conic curve segments.
We present a framework for continuous collision detection (CCD) of this special
type of CQM (which we also call CQM for brevity) in motion. We derive algebraic
formulations and compute numerically the first contact time instants and the
contact points of two moving CQMs in $\mathbb R^3$. Since it is difficult to
process CCD of two CQMs in a direct manner because they are composed of
semi-algebraic varieties, we break down the problem into subproblems of solving
CCD of pairs of boundary elements of the CQMs. We present procedures to solve
CCD of different types of boundary element pairs in different dimensions. Some
CCD problems are reduced to their equivalents in a lower dimensional setting,
where they can be solved more efficiently.
|
[
{
"version": "v1",
"created": "Fri, 29 Nov 2013 03:08:37 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Choi",
"Yi-King",
""
],
[
"Wang",
"Wenping",
""
],
[
"Mourrain",
"Bernard",
""
],
[
"Tu",
"Changhe",
""
],
[
"Jia",
"Xiaohong",
""
],
[
"Sun",
"Feng",
""
]
] |
new_dataset
| 0.999038 |
1311.7590
|
Mine Alsan Ms
|
Mine Alsan
|
Universal Polar Decoding with Channel Knowledge at the Encoder
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar coding over a class of binary discrete memoryless channels with channel
knowledge at the encoder is studied. It is shown that polar codes achieve the
capacity of convex and one-sided classes of symmetric channels.
|
[
{
"version": "v1",
"created": "Fri, 29 Nov 2013 15:02:33 GMT"
}
] | 2013-12-02T00:00:00 |
[
[
"Alsan",
"Mine",
""
]
] |
new_dataset
| 0.989613 |
1311.6914
|
Nikolaos Freris
|
Nikolaos Freris, Vivek Borkar and P. R. Kumar
|
Model-based clock synchronization protocol for wireless sensor networks
|
Technical report - this work was submitted to IEEE/ACM Transactions
on Networking, Nov. 2013
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a wireless sensor network, nodes communicate time-stamped packets in order
to synchronize their clocks, i.e., estimate each other's time display. We
introduce and analyze a parametrized stochastic model for clocks and use it to
calculate, at any given time, the Maximum-Likelihood (ML) estimate of the
relative skew/offset between two communicating nodes. For network
synchronization, event-based Kalman-Bucy filtering gives rise to a centralized
scheme, and we propose an efficient distributed suboptimal algorithm. We study
the performance both analytically and experimentally and provide provable
guarantees. We summarize our findings into defining a new distributed
model-based clock synchronization protocol (MBCSP), and present a comparative
simulation study of its accuracy versus prior art to showcase improvements.
|
[
{
"version": "v1",
"created": "Wed, 27 Nov 2013 09:50:13 GMT"
}
] | 2013-11-28T00:00:00 |
[
[
"Freris",
"Nikolaos",
""
],
[
"Borkar",
"Vivek",
""
],
[
"Kumar",
"P. R.",
""
]
] |
new_dataset
| 0.968553 |
1311.6929
|
Jonathan Protzenko
|
Jonathan Protzenko
|
Illustrating the Mezzo programming language
| null |
1st French Singaporean Workshop on Formal Methods and Applications
(FSFMA 2013)
|
10.4230/OASIcs.FSFMA.2013.68
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When programmers want to prove strong program invariants, they are usually
faced with a choice between using theorem provers and using traditional
programming languages. The former requires them to provide program proofs,
which, for many applications, is considered a heavy burden. The latter provides
less guarantees and the programmer usually has to write run-time assertions to
compensate for the lack of suitable invariants expressible in the type system.
We introduce Mezzo, a programming language in the tradition of ML, in which
the usual concept of a type is replaced by a more precise notion of a
permission. Programs written in Mezzo usually enjoy stronger guarantees than
programs written in pure ML. However, because Mezzo is based on a type system,
the reasoning requires no user input. In this paper, we illustrate the key
concepts of Mezzo, highlighting the static guarantees our language provides.
|
[
{
"version": "v1",
"created": "Wed, 27 Nov 2013 10:57:10 GMT"
}
] | 2013-11-28T00:00:00 |
[
[
"Protzenko",
"Jonathan",
""
]
] |
new_dataset
| 0.994676 |
1311.6981
|
Gaurav Ojha
|
Anupam Shukla, Gaurav Ojha, Sachin Acharya, Shubham Jain
|
A customized flocking algorithm for swarms of sensors tracking a swarm
of targets
|
13 Pages, 11 Figures, SAI 2013
| null | null | null |
cs.OH cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mobile sensor networks (WMSNs) are groups of mobile sensing agents
with multi-modal sensing capabilities that communicate over wireless networks.
WMSNs have more flexibility in terms of deployment and exploration abilities
over static sensor networks. Sensor networks have a wide range of applications
in security and surveillance systems, environmental monitoring, data gathering
for network-centric healthcare systems, monitoring seismic activities and
atmospheric events, tracking traffic congestion and air pollution levels,
localization of autonomous vehicles in intelligent transportation systems, and
detecting failures of sensing, storage, and switching components of smart
grids. The above applications require target tracking for processes and events
of interest occurring in an environment. Various methods and approaches have
been proposed in order to track one or more targets in a pre-defined area.
Usually, this turns out to be a complicated job involving higher order
mathematics coupled with artificial intelligence due to the dynamic nature of
the targets. To optimize the resources we need to have an approach that works
in a more straightforward manner while resulting in fairly satisfactory data.
In this paper we have discussed the various cases that might arise while
flocking a group of sensors to track targets in a given environment. The
approach has been developed from scratch although some basic assumptions have
been made keeping in mind some previous theories. This paper outlines a
customized approach for feasibly tracking swarms of targets in a specific area
so as to minimize the resources and optimize tracking efficiency.
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 04:46:57 GMT"
}
] | 2013-11-28T00:00:00 |
[
[
"Shukla",
"Anupam",
""
],
[
"Ojha",
"Gaurav",
""
],
[
"Acharya",
"Sachin",
""
],
[
"Jain",
"Shubham",
""
]
] |
new_dataset
| 0.990448 |
1311.6670
|
Nehla Ghouaiel
|
Nehla Ghouaiel (IRIT), Jean-Marc Cieutat, Jean-Pierre Jessel (IRIT)
|
Mobile Augmented Reality Applications to Discover New Environments
|
Science and Information Conference 2013, France (2013)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although man has become sedentary over time, his wish to travel the world
remains as strong as ever. The aim of this paper is to show how techniques
based on imagery and Augmented Reality (AR) can prove to be of great help when
discovering a new urban environment and observing the evolution of the natural
environment. The study's support is naturally the Smartphone which in just a
few years has become our most familiar device, which we take with us
practically everywhere we go in our daily lives.
|
[
{
"version": "v1",
"created": "Tue, 26 Nov 2013 14:00:24 GMT"
}
] | 2013-11-27T00:00:00 |
[
[
"Ghouaiel",
"Nehla",
"",
"IRIT"
],
[
"Cieutat",
"Jean-Marc",
"",
"IRIT"
],
[
"Jessel",
"Jean-Pierre",
"",
"IRIT"
]
] |
new_dataset
| 0.976079 |
1308.2950
|
Xinfeng Li
|
Xinfeng Li, Chenshu Wu, Xiaoyuan Wang, Ming Gu, Xiang-Yang Li and Dong
Xuan
|
BlueSky: Realizing Buried Potential of Bluetooth to Sustain a
Large-scale Multi-hop Network
|
We need to improve this paper further
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditionally, Bluetooth has been deemed unsuitable for sustaining a
large-scale multi-hop network. There are two main reasons: severe frequency
channel collisions under a large-scale network and high complexity of designing
an efficient formation protocol. In this work, we reconsider this viewpoint
from a practical usability perspective and aim to realize the buried potential
of Bluetooth. Firstly, we find that the collision probability under a
low-overhead network is fairly small, which is acceptable for practical
applications. Secondly, we propose BlueSky, a complete system solution to
provide necessary networking functionalities for Bluetooth. In BlueSky, we
develop a connection maintenance mechanism for mitigating the influence of
collisions and a network formation protocol for reliable packet transmissions.
We implement BlueSky on Windows Mobile using 100 commercial smartphones.
Comprehensive usability evaluations demonstrate the negligible overheads of
BlueSky and its good network performance. In particular, 90%-95% of the whole
100 nodes can participate in the communication smoothly.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 19:22:24 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Nov 2013 21:25:09 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Li",
"Xinfeng",
""
],
[
"Wu",
"Chenshu",
""
],
[
"Wang",
"Xiaoyuan",
""
],
[
"Gu",
"Ming",
""
],
[
"Li",
"Xiang-Yang",
""
],
[
"Xuan",
"Dong",
""
]
] |
new_dataset
| 0.988094 |
1311.5978
|
Pei Li
|
Pei Lee and Laks V.S. Lakshmanan and Evangelos E. Milios
|
Event Evolution Tracking from Streaming Social Posts
| null | null | null | null |
cs.SI physics.soc-ph
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Online social post streams such as Twitter timelines and forum discussions
have emerged as important channels for information dissemination. They are
noisy, informal, and surge quickly. Real life events, which may happen and
evolve every minute, are perceived and circulated in post streams by social
users. Intuitively, an event can be viewed as a dense cluster of posts with a
life cycle sharing the same descriptive words. There are many previous works on
event detection from social streams. However, there has been surprisingly
little work on tracking the evolution patterns of events, e.g., birth/death,
growth/decay, merge/split, which we address in this paper. To define a tracking
scope, we use a sliding time window, where old posts disappear and new posts
appear at each moment. Following that, we model a social post stream as an
evolving network, where each social post is a node, and edges between posts are
constructed when the post similarity is above a threshold. We propose a
framework which summarizes the information in the stream within the current
time window as a ``sketch graph'' composed of ``core'' posts. We develop
incremental update algorithms to handle highly dynamic social streams and track
event evolution patterns in real time. Moreover, we visualize events as word
clouds to aid human perception. Our evaluation on a real data set consisting of
5.2 million posts demonstrates that our method can effectively track event
dynamics in the whole life cycle from very large volumes of social streams on
the fly.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 09:07:11 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Lee",
"Pei",
""
],
[
"Lakshmanan",
"Laks V. S.",
""
],
[
"Milios",
"Evangelos E.",
""
]
] |
new_dataset
| 0.967324 |
1311.6009
|
Mohammad Mozumdar
|
Ching-Yen Chung, Joshua Chynoweth, Charlie Qiu, Chi-Cheng Chu, Rajit
Gadh
|
Design of Fast Response Smart Electric Vehicle Charging Infrastructure
|
Proceedings of Green Energy and Systems Conference 2013, November 25,
Long Beach, CA, USA
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The response time of the smart electrical vehicle (EV) charging
infrastructure is the key index of the system performance. The traffic between
the smart EV charging station and the control center dominates the response
time of the smart charging stations. To accelerate the response of the smart EV
charging station, there is a need for a technology that collects the
information locally and relays it to the control center periodically. To reduce
the traffic between the smart EV charger and the control center, a Power
Information Collector (PIC), capable of collecting all the meters power
information in the charging station, is proposed and implemented in this paper.
The response time is further reduced by pushing the power information to the
control center. Thus, a fast response smart EV charging infrastructure is
achieved to handle the shortage of energy in the local grid.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 15:45:41 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Chung",
"Ching-Yen",
""
],
[
"Chynoweth",
"Joshua",
""
],
[
"Qiu",
"Charlie",
""
],
[
"Chu",
"Chi-Cheng",
""
],
[
"Gadh",
"Rajit",
""
]
] |
new_dataset
| 0.996491 |
1311.6012
|
Mohammad Mozumdar
|
Tai-Ran Hsu
|
On a Flywheel-Based Regenerative Braking System for Regenerative Energy
Recovery
|
Proceedings of Green Energy and Systems Conference 2013, November 25,
Long Beach, CA, USA
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents a unique flywheel-based regenerative energy recovery,
storage and release system developed at the author's laboratory. It can recover
and store regenerative energy produced by braking a motion generator with
intermittent rotary velocity such as the rotor of a wind turbogenerator subject
to intermittent intake wind and the axels of electric and hybrid gas-electric
vehicles during frequent coasting and braking. Releasing of the stored
regenerative energy in the flywheel is converted to electricity by the attached
alternator. A proof-of-concept prototype called the SJSU-RBS was designed,
built and tested by author's students with able assistance of a technical staff
in his school.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 15:57:24 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Hsu",
"Tai-Ran",
""
]
] |
new_dataset
| 0.998929 |
1311.6015
|
Mohammad Mozumdar
|
Tai-Ran Hsu
|
On the Sustainability of Electrical Vehicles
|
Proceedings of Green Energy and Systems Conference 2013, November 25,
Long Beach, CA, USA
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Many perceive electric vehicles (EVs) to be eco-environmentally sustainable
because they are free of emissions of toxic and greenhouse gases to the
environment. However, few have questioned the sustainability of the electric
power required to drive these vehicles. This paper presents an in-depth study
that indicates that massive infusion of EVs to our society in a short time span
will likely create a colossal demand for additional electric power generation
much beyond what the US electric power generating industry can provide with its
current generating capacity. Additionally, such demand would result in much
adverse environmental consequences if the current technology of electric power
generation by predominant fossil fuels continues. Other rarely accounted facts
on environmental impacts by EVs are the substantial electric energy required to
produce batteries that drive EVs, and the negative consequences relating to the
recycling of spent batteries.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 16:00:20 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Hsu",
"Tai-Ran",
""
]
] |
new_dataset
| 0.979532 |
1311.6033
|
Ivo Vigan
|
Ivo Vigan
|
Packing and Covering a Polygon with Geodesic Disks
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a polygon $P$, for two points $s$ and $t$ contained in the polygon,
their \emph{geodesic distance} is the length of the shortest $st$-path within
$P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the
set of points in $P$ whose geodesic distance to $v$ is at most $r$. We present
a polynomial time $2$-approximation algorithm for finding a densest geodesic
unit disk packing in $P$. Allowing arbitrary radii but constraining the number
of disks to be $k$, we present a $4$-approximation algorithm for finding a
packing in $P$ with $k$ geodesic disks whose minimum radius is maximized. We
then turn our focus on \emph{coverings} of $P$ and present a $2$-approximation
algorithm for covering $P$ with $k$ geodesic disks whose maximal radius is
minimized. Furthermore, we show that all these problems are $\mathsf{NP}$-hard
in polygons with holes. Lastly, we present a polynomial time exact algorithm
which covers a polygon with two geodesic disks of minimum maximal radius.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 18:21:01 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Vigan",
"Ivo",
""
]
] |
new_dataset
| 0.9954 |
1311.6045
|
Nidhal El-Abbadi
|
Nidhal El-Abbadi, Ahmed Nidhal Khdhair, Adel Al-Nasrawi
|
Build Electronic Arabic Lexicon
|
4 pages
|
The International Arab Journal of Information Technology, Vol. 8,
No. 2, April 2011
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are many known Arabic lexicons organized on different ways, each of
them has a different number of Arabic words according to its organization way.
This paper has used mathematical relations to count a number of Arabic words,
which proofs the number of Arabic words presented by Al Farahidy. The paper
also presents new way to build an electronic Arabic lexicon by using a hash
function that converts each word (as input) to correspond a unique integer
number (as output), these integer numbers will be used as an index to a lexicon
entry.
|
[
{
"version": "v1",
"created": "Sat, 23 Nov 2013 20:10:24 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"El-Abbadi",
"Nidhal",
""
],
[
"Khdhair",
"Ahmed Nidhal",
""
],
[
"Al-Nasrawi",
"Adel",
""
]
] |
new_dataset
| 0.997748 |
1311.6178
|
Alireza Poostindouz
|
Alireza Poostindouz and Adel Aghajan
|
Minimum Delay Huffman Code in Backward Decoding Procedure
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For some applications where the speed of decoding and the fault tolerance are
important, like in video storing, one of the successful answers is Fix-Free
Codes. These codes have been applied in some standards like H.263+ and MPEG-4.
The cost of using fix-free codes is to increase the redundancy of the code
which means the increase in the amount of bits we need to represent any peace
of information. Thus we investigated the use of Huffman Codes with low and
negligible backward decoding delay. We showed that for almost all cases there
is always a Minimum Delay Huffman Code for a given length vector. The average
delay of this code for anti-uniform sources is calculated, that is in agreement
with the simulations, and it is shown that this delay is one bit for large
alphabet sources. Also an algorithm is proposed which will find the minimum
delay code with a good performance.
|
[
{
"version": "v1",
"created": "Sun, 24 Nov 2013 22:20:15 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Poostindouz",
"Alireza",
""
],
[
"Aghajan",
"Adel",
""
]
] |
new_dataset
| 0.969366 |
1311.6199
|
Mohammad Mozumdar
|
Hen-Geul Yeh and Son H. Doan
|
Battery Placement on Performance of VAR Controls
|
Proceedings of Green Energy and Systems Conference 2013, November 25,
Long Beach, CA, USA
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Battery's role in the development of smart grid is gaining greater attention
as an energy storage device that can be integrated with a Photovoltaic (PV)
cell in the distribution circuit. As more PVs are connected to the system, real
power injection to the distribution can cause fluctuation in the voltage. Due
to the rapid fluctuation of the voltage, a more advanced volt-ampere reactive
(VAR) power control scheme on a fast time scale is used to minimize the voltage
deviation on the distribution. Employing both global and local dynamic VAR
control schemes in our previous work, we show the effects of battery placement
on the performance of VAR controls in the example of a single branch radial
distribution circuit. Simulations verify that having battery placement at the
rear in the distribution circuit can provide smaller voltage variations and
higher energy savings than front battery placement when used with dynamic VAR
control algorithms.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 02:45:08 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Yeh",
"Hen-Geul",
""
],
[
"Doan",
"Son H.",
""
]
] |
new_dataset
| 0.950698 |
1311.6236
|
Claudio Soriente
|
Claudio Soriente and Ghassan Karame and Hubert Ritzdorf and Srdjan
Marinovic and Srdjan Capkun
|
Commune: Shared Ownership in an Agnostic Cloud
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although cloud storage platforms promise a convenient way for users to share
files and engage in collaborations, they require all files to have a single
owner who unilaterally makes access control decisions. Existing clouds are,
thus, agnostic to shared ownership. This can be a significant limitation in
many collaborations because one owner can, for example, delete files and revoke
access without consulting the other collaborators.
In this paper, we first formally define a notion of shared ownership within a
file access control model. We then propose a solution, called Commune, to the
problem of distributively enforcing shared ownership in agnostic clouds, so
that access grants require the support of a pre-arranged threshold of owners.
Commune can be used in existing clouds without requiring any modifications to
the platforms. We analyze the security of our solution and evaluate its
scalability and performance by means of an implementation integrated with
Amazon S3.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 08:50:12 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Soriente",
"Claudio",
""
],
[
"Karame",
"Ghassan",
""
],
[
"Ritzdorf",
"Hubert",
""
],
[
"Marinovic",
"Srdjan",
""
],
[
"Capkun",
"Srdjan",
""
]
] |
new_dataset
| 0.953273 |
1311.6247
|
Songnam Hong Mr.
|
Song-Nam Hong and Giuseppe Caire
|
Full-Duplex Relaying with Half-Duplex Relays
|
Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider "virtual" full-duplex relaying by means of half-duplex relays. In
this configuration, each relay stage in a multi-hop relaying network is formed
by at least two relays, used alternatively in transmit and receive modes, such
that while one relay transmits its signal to the next stage, the other relay
receives a signal from the previous stage. With such a pipelined scheme, the
source is active and sends a new information message in each time slot. We
consider the achievable rates for different coding schemes and compare them
with a cut-set upper bound, which is tight in certain conditions. In
particular, we show that both lattice-based Compute and Forward (CoF) and
Quantize reMap and Forward (QMF) yield attractive performance and can be easily
implemented. In particular, QMF in this context does not require "long"
messages and joint (non-unique) decoding, if the quantization mean-square
distortion at the relays is chosen appropriately. Also, in the multi-hop case
the gap of QMF from the cut-set upper bound grows logarithmically with the
number of stages, and not linearly as in the case of "noise level"
quantization. Furthermore, we show that CoF is particularly attractive in the
case of multi-hop relaying, when the channel gains have fluctuations not larger
than 3dB, yielding a rate that does not depend on the number of relaying
stages. In particular, we argue that such architecture may be useful for a
wireless backhaul with line-of-sight propagation between the relays.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 09:54:00 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Hong",
"Song-Nam",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.987054 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.