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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1411.1933
|
Muralikrishnan Ramane MR
|
Muralikrishnan Ramane, Balaji Vasudevan and Sathappan Allaphan
|
A Provenance-Policy Based Access Control Model For Data Usage Validation
In Cloud
|
October 2014, Volume 3, Number 5, Page. 1-9
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an organization specifically as virtual as cloud there is need for access
control systems to constrain users direct or backhanded action that could lead
to breach of security. In cloud, apart from owner access to confidential data
the third party auditing and accounting is done which could stir up further
data leaks. To control such data leaks and integrity, in past several security
policies based on role, identity and user attributes were proposed and found
ineffective since they depend on static policies which do not monitor data
access and its origin. Provenance on the other hand tracks data usage and its
origin which proves the authenticity of data. To employ provenance in a real
time system like cloud, the service provider needs to store metadata on the
subject of data alteration which is universally called as the Provenance
Information. This paper presents a provenance-policy based access control model
which is designed and integrated with the system that not only makes data
auditable but also incorporates accountability for data alteration events.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 14:35:04 GMT"
}
] | 2014-11-10T00:00:00 |
[
[
"Ramane",
"Muralikrishnan",
""
],
[
"Vasudevan",
"Balaji",
""
],
[
"Allaphan",
"Sathappan",
""
]
] |
new_dataset
| 0.976351 |
1411.1951
|
Manuel P\"oter
|
Manuel P\"oter
|
Pheet meets C++11
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pheet is a C++ task-scheduling framework that allows for easy customization
of internal data-structures. The implementation was started before the C++11
standard was committed and therefore did not use the new standardized memory
model but compiler/platform specific intrinsics for atomic memory operations.
This not only makes the implementation harder to port to other compilers or
architectures but also suffers from the fact that prior C++ versions did not
specify any memory model.
In this report I discuss the porting of one of the internal Pheet data
structures to the new memory model and provide reasoning about the correctness
based on the semantics of the memory consistency model. Using two benchmarks
from the Pheet benchmark suite I compare the performance of the original
against the new implementation which shows a significant speedup under certain
conditions on one of the two test machines.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 15:40:48 GMT"
}
] | 2014-11-10T00:00:00 |
[
[
"Pöter",
"Manuel",
""
]
] |
new_dataset
| 0.983779 |
1411.1953
|
Leroy Cronin Prof
|
Juan Manuel Parrilla Gutierrez, Trevor Hinkley, James Taylor, Kliment
Yanev, Leroy Cronin
|
Hardware and Software manual for Evolution of Oil Droplets in a
Chemo-Robotic Platform
|
42 pages, 25 figures, list of printed parts
| null | null | null |
cs.RO cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This manual outlines a fully automated liquid handling robot to enable
physically-embodied evolution within a chemical oil-droplet system. The robot
is based upon the REPRAP3D printer system and makes the droplets by mixing
chemicals and then placing them in a petri dish after which they are recorded
using a camera and the behaviour of the droplets analysed using image
recognition software. This manual accompanies the open access publication
published in Nature Communications DOI: 10.1038/ncomms6571.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 15:41:34 GMT"
}
] | 2014-11-10T00:00:00 |
[
[
"Gutierrez",
"Juan Manuel Parrilla",
""
],
[
"Hinkley",
"Trevor",
""
],
[
"Taylor",
"James",
""
],
[
"Yanev",
"Kliment",
""
],
[
"Cronin",
"Leroy",
""
]
] |
new_dataset
| 0.998521 |
1411.1999
|
Hossam Ishkewy
|
Hossam Ishkewy, Hany Harb and Hassan Farahat
|
Azhary: An Arabic Lexical Ontology
|
appears in International Journal of Web & Semantic Technology
(IJWesT) Vol.5, No.4, October 2014
| null | null | null |
cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabic language is the most spoken languages in the Semitic languages group,
and one of the most common languages in the world spoken by more than 422
million. It is also of paramount importance to Muslims, it is a sacred language
of the Islamic Holly Book (Quran) and prayer (and other acts of worship) in
Islam is performed only by mastering some of Arabic words. Arabic is also a
major ritual language of a number of Christian churches in the Arab world and
it is also used in writing several intellectual and religious Jewish books in
the Middle Ages. Despite this, there is no semantic Arabic lexicon which
researchers can depend on. In this paper we introduce Azhary as a lexical
ontology for the Arabic language. It groups Arabic words into sets of synonyms
called synsets, and records a number of relationships between words such as
synonym, antonym, hypernym, hyponym, meronym, holonym and association
relations. The ontology contains 26,195 words organized in 13,328 synsets. It
has been developed and contrasted against AWN which is the most common
available Arabic lexical ontology.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 18:23:00 GMT"
}
] | 2014-11-10T00:00:00 |
[
[
"Ishkewy",
"Hossam",
""
],
[
"Harb",
"Hany",
""
],
[
"Farahat",
"Hassan",
""
]
] |
new_dataset
| 0.999886 |
1411.2022
|
Dmitry Kosolobov
|
Dmitry Kosolobov
|
Online Square Detection
|
9 pages, 4 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The online square detection problem is to detect the first occurrence of a
square in a string whose characters are provided as input one at a time. Recall
that a square is a string that is a concatenation of two identical strings. In
this paper we present an algorithm solving this problem in $O(n\log\sigma)$
time and linear space on ordered alphabet, where $\sigma$ is the number of
different letters in the input string. Our solution is relatively simple and
does not require much memory unlike the previously known online algorithm with
the same working time. Also we present an algorithm working in $O(n\log n)$
time and linear space on unordered alphabet, though this solution does not
outperform the previously known result with the same time bound.
|
[
{
"version": "v1",
"created": "Fri, 7 Nov 2014 20:28:37 GMT"
}
] | 2014-11-10T00:00:00 |
[
[
"Kosolobov",
"Dmitry",
""
]
] |
new_dataset
| 0.997355 |
1411.1316
|
David Buckley
|
David Buckley, Ke Chen, Joshua Knowles
|
Rapid Skill Capture in a First-Person Shooter
|
16 pages, 28 figures, journal paper submission
| null | null | null |
cs.HC cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various aspects of computer game design, including adaptive elements of game
levels, characteristics of 'bot' behavior, and player matching in multiplayer
games, would ideally be sensitive to a player's skill level. Yet, while
difficulty and player learning have been explored in the context of games,
there has been little work analyzing skill per se, and how it pertains to a
player's input. To this end, we present a data set of 476 game logs from over
40 players of a first-person shooter game (Red Eclipse) as a basis of a case
study. We then analyze different metrics of skill and show that some of these
can be predicted using only a few seconds of keyboard and mouse input. We argue
that the techniques used here are useful for adapting games to match players'
skill levels rapidly, perhaps more rapidly than solutions based on performance
averaging such as TrueSkill.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2014 16:41:12 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Nov 2014 13:04:25 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Buckley",
"David",
""
],
[
"Chen",
"Ke",
""
],
[
"Knowles",
"Joshua",
""
]
] |
new_dataset
| 0.993626 |
1411.1401
|
Frank Hoppensteadt
|
Frank Hoppensteadt
|
Spin Wave Neuroanalog of von Neumann's Microwave Computer
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frequency and phase of neural activity play important roles in the behaving
brain. The emerging understanding of these roles has been informed by the
design of analog devices that have been important to neuroscience, among them
the neuroanalog computer developed by O. Schmitt in the 1930's. In the 1950's,
J. von Neumann, in a search for high performance computing using microwaves,
invented a logic machine based on similar devices, that can perform logic
functions including binary arithmetic. Described here is a novel embodiment of
his machine using nano-magnetics. The embodiment is based on properties of
ferromagnetic thin films that are governed by a nonlinear Schrodinger equation
for magnetization in a film. Electrical currents through point contacts on a
film create spin torque nano oscillators (STNO) that define the oscillator
elements of the system. These oscillators may communicate through directed
graphs of electrical connections or by radiation in the form of spin waves. It
is shown here how to construct a logic machine using STNO, that this machine
can perform several computations simultaneously using multiplexing of inputs,
that this system can evaluate iterated logic functions, and that spin waves can
communicate frequency, phase and binary information. Neural tissue and the
Schmitt, von Neumann and STNO devices share a common bifurcation structure,
although these systems operate on vastly different space and time scales. This
suggests that neural circuits may be capable of computational functionality
described here.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2014 15:21:30 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Hoppensteadt",
"Frank",
""
]
] |
new_dataset
| 0.996516 |
1411.1531
|
Junyoung Nam
|
Junyoung Nam
|
A Codebook-Based Limited Feedback System for Large-Scale MIMO
|
9 pages, 8 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider limited feedback systems for FDD large-scale
(massive) MIMO. A new codebook-based framework for multiuser (MU) MIMO downlink
systems is introduced and then compared with an ideal non-codebook based
system. We are particularly interested in the less-known finite-rate feedback
regime where the number $M$ of transmit antennas and the number of users are of
the same order of magnitude and $M$ is large but finite, which is a typical
scenario of large-scale MIMO. We provide new findings in this regime and
identify some benefits of the new framework in terms of scheduling gain and
downlink dedicated pilot overhead.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2014 08:48:25 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Nam",
"Junyoung",
""
]
] |
new_dataset
| 0.99825 |
1411.1544
|
Claudia Landi
|
Barbara Di Fabio and Claudia Landi
|
The edit distance for Reeb graphs of surfaces
|
An extended abstract of this work appeared in: E. Barcucci et al.
(Eds.): DGCI 2014, LNCS 8668, pp. 202-213, 2014. c
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reeb graphs are structural descriptors that capture shape properties of a
topological space from the perspective of a chosen function. In this work we
define a combinatorial metric for Reeb graphs of orientable surfaces in terms
of the cost necessary to transform one graph into another by edit operations.
The main contributions of this paper are the stability property and the
optimality of this edit distance. More precisely, the stability result states
that changes in the functions, measured by the maximum norm, imply not greater
changes in the corresponding Reeb graphs, measured by the edit distance. The
optimality result states that our edit distance discriminates Reeb graphs
better than any other metric for Reeb graphs of surfaces satisfying the
stability property.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2014 09:49:07 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Di Fabio",
"Barbara",
""
],
[
"Landi",
"Claudia",
""
]
] |
new_dataset
| 0.974327 |
1411.1567
|
Hauke Holtkamp
|
Hauke Holtkamp, Guido Dietl, Harald Haas
|
Distributed DTX Alignment with Memory
|
13 pages, In 2014 IEEE International Conference on Communications
(ICC), Page(s): 3481 - 3486
| null |
10.1109/ICC.2014.6883860
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper addresses the assignment of transmission and sleep time slots
between interfering transmitters with the objective of minimal power
consumption. In particular, we address the constructive alignment of
Discontinuous Transmission (DTX) time slots under link rate constraints. Due to
the complexity of the combinatorial optimization problem at hand, we resort to
heuristic assignment strategies. We derive four time slot alignment solutions
(sequential alignment, random alignment, p-persistent ranking and DTX alignment
with memory) and identify trade-offs. One solution, DTX alignment with memory,
addresses trade-offs of the other three by maintaining memory of past alignment
and channel quality to buffer short term changes in channel quality. All
strategies are found to exhibit similar convergence behavior, but different
power consumption and retransmission probabilities. DTX alignment with memory
is shown to achieve up to 40% savings in power consumption and more than 20%
lower retransmission probability than the state of the art.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2014 11:20:33 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Holtkamp",
"Hauke",
""
],
[
"Dietl",
"Guido",
""
],
[
"Haas",
"Harald",
""
]
] |
new_dataset
| 0.959729 |
1411.1668
|
Partha Bhowmick
|
Sahadev Bera, Shyamosree Pal, Partha Bhowmick, Bhargab B. Bhattacharya
|
On Chord and Sagitta in ${\mathbb Z}^2$: An Analysis towards Fast and
Robust Circular Arc Detection
|
34 pages
| null | null | null |
cs.CG cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although chord and sagitta, when considered in tandem, may reflect many
underlying geometric properties of circles on the Euclidean plane, their
implications on the digital plane are not yet well-understood. In this paper,
we explore some of their fundamental properties on the digital plane that have
a strong bearing on the unsupervised detection of circles and circular arcs in
a digital image. We show that although the chord-and-sagitta properties of a
real circle do not readily migrate to the digital plane, they can indeed be
used for the analysis in the discrete domain based on certain bounds on their
deviations, which are derived from the real domain. In particular, we derive an
upper bound on the circumferential angular deviation of a point in the context
of chord property, and an upper bound on the relative error in radius
estimation with regard to the sagitta property. Using these two bounds, we
design a novel algorithm for the detection and parameterization of circles and
circular arcs, which does not require any heuristic initialization or manual
tuning. The chord property is deployed for the detection of circular arcs,
whereas the sagitta property is used to estimate their centers and radii.
Finally, to improve the accuracy of estimation, the notion of restricted Hough
transform is used. Experimental results demonstrate superior efficiency and
robustness of the proposed methodology compared to existing techniques.
|
[
{
"version": "v1",
"created": "Sun, 26 Oct 2014 17:45:02 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Bera",
"Sahadev",
""
],
[
"Pal",
"Shyamosree",
""
],
[
"Bhowmick",
"Partha",
""
],
[
"Bhattacharya",
"Bhargab B.",
""
]
] |
new_dataset
| 0.997206 |
1411.1680
|
Siddharth Garg
|
D. Fooladivanda, G. Mancini, S. Garg, C. Rosenberg
|
State of Charge Evolution Equations for Flywheels
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mathematical state-of-charge evolution equation is present for Flywheel
Energy Storage Systems.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2014 18:14:31 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Fooladivanda",
"D.",
""
],
[
"Mancini",
"G.",
""
],
[
"Garg",
"S.",
""
],
[
"Rosenberg",
"C.",
""
]
] |
new_dataset
| 0.997874 |
1411.1733
|
Marcos Portnoi
|
Marcos Portnoi and Chien-Chung Shen
|
Wireless-Delimited Secure Zones with Encrypted Attribute-Based Broadcast
for Safe Firearms
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents an application of the highly expressive Attribute-Based
Encryption to implement wireless-delimited Secure Zones for firearms. Within
these zones, radio-transmitted local policies based on attributes of the
consumer and the firearm are received by embedded hardware in the firearms,
which then advises the consumer about safe operations. The Secure Zones utilize
Attribute-Based Encryption to encode the policies and consumer or user
attributes, and providing privacy and security through it cryptography. We
describe a holistic approach to evolving the firearm to a cyber-physical system
to aid in augmenting safety. We introduce a conceptual model for a firearm
equipped with sensors and a context-aware software agent. Based on the
information from the sensors, the agent can access the context and inform the
consumer of potential unsafe operations. To support Secure Zones and the
cyber-physical firearm model, we propose a Key Infrastructure Scheme for key
generation, distribution, and management, and a Context-Aware Software Agent
Framework for Firearms.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2014 20:22:00 GMT"
}
] | 2014-11-07T00:00:00 |
[
[
"Portnoi",
"Marcos",
""
],
[
"Shen",
"Chien-Chung",
""
]
] |
new_dataset
| 0.992294 |
1305.5359
|
Manoj Gopalkrishnan
|
Manoj Gopalkrishnan
|
A coercion-resistant protocol for conducting elections by telephone
|
v2: 15 pages, no figures. We point out that the protocol requires an
assumption of a trusted election authority, unlike traditional paper ballots;
v1: 14 pages, no figures
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a protocol that allows voters to phone in their votes. Our
protocol makes it expensive for a candidate and a voter to cooperate to prove
to the candidate who the voter voted for. When the electoral pool is large
enough, the cost to the candidate of manipulating sufficiently many votes to
have an influence on the election results becomes impossibly expensive. Hence,
the protocol provides candidates no incentive to attempt inducement or coercion
of voters, resulting in free and fair elections with the promise of cost
savings and higher voter turnout over traditional elections. One major
inadequacy with our suggested protocol is that we assume the existence of a
trusted election authority to count the votes.
|
[
{
"version": "v1",
"created": "Thu, 23 May 2013 09:37:40 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Nov 2014 06:51:03 GMT"
}
] | 2014-11-06T00:00:00 |
[
[
"Gopalkrishnan",
"Manoj",
""
]
] |
new_dataset
| 0.999003 |
1411.1171
|
Rui Zeng
|
Rui Zeng, Jiasong Wu, Zhuhong Shao, Lotfi Senhadji, and Huazhong Shu
|
Multilinear Principal Component Analysis Network for Tensor Object
Classification
|
4 pages, 3 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recently proposed principal component analysis network (PCANet) has been
proved high performance for visual content classification. In this letter, we
develop a tensorial extension of PCANet, namely, multilinear principal analysis
component network (MPCANet), for tensor object classification. Compared to
PCANet, the proposed MPCANet uses the spatial structure and the relationship
between each dimension of tensor objects much more efficiently. Experiments
were conducted on different visual content datasets including UCF sports action
video sequences database and UCF11 database. The experimental results have
revealed that the proposed MPCANet achieves higher classification accuracy than
PCANet for tensor object classification.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2014 07:27:08 GMT"
}
] | 2014-11-06T00:00:00 |
[
[
"Zeng",
"Rui",
""
],
[
"Wu",
"Jiasong",
""
],
[
"Shao",
"Zhuhong",
""
],
[
"Senhadji",
"Lotfi",
""
],
[
"Shu",
"Huazhong",
""
]
] |
new_dataset
| 0.98409 |
1411.1395
|
Partha Bhowmick
|
Sahadev Bera, Partha Bhowmick, Bhargab B. Bhattacharya
|
On Covering a Solid Sphere with Concentric Spheres in ${\mathbb Z}^3$
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that a digital sphere, constructed by the circular sweep of a digital
semicircle (generatrix) around its diameter, consists of some holes
(absentee-voxels), which appear on its spherical surface of revolution. This
incompleteness calls for a proper characterization of the absentee-voxels whose
restoration will yield a complete spherical surface without any holes. In this
paper, we present a characterization of such absentee-voxels using certain
techniques of digital geometry and show that their count varies quadratically
with the radius of the semicircular generatrix. Next, we design an algorithm to
fill these absentee-voxels so as to generate a spherical surface of revolution,
which is more realistic from the viewpoint of visual perception. We further
show that covering a solid sphere by a set of complete spheres also results in
an asymptotically larger count of absentees, which is cubic in the radius of
the sphere. The characterization and generation of complete solid spheres
without any holes can also be accomplished in a similar fashion. We furnish
test results to substantiate our theoretical findings.
|
[
{
"version": "v1",
"created": "Thu, 23 Oct 2014 05:05:23 GMT"
}
] | 2014-11-06T00:00:00 |
[
[
"Bera",
"Sahadev",
""
],
[
"Bhowmick",
"Partha",
""
],
[
"Bhattacharya",
"Bhargab B.",
""
]
] |
new_dataset
| 0.99771 |
1307.3664
|
Martin Strohmeier
|
Martin Strohmeier, Vincent Lenders, Ivan Martinovic
|
On the Security of the Automatic Dependent Surveillance-Broadcast
Protocol
|
Survey, 22 Pages, 21 Figures
| null |
10.1109/COMST.2014.2365951
|
RR-13-10
|
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic dependent surveillance-broadcast (ADS-B) is the communications
protocol currently being rolled out as part of next generation air
transportation systems. As the heart of modern air traffic control, it will
play an essential role in the protection of two billion passengers per year,
besides being crucial to many other interest groups in aviation. The inherent
lack of security measures in the ADS-B protocol has long been a topic in both
the aviation circles and in the academic community. Due to recently published
proof-of-concept attacks, the topic is becoming ever more pressing, especially
with the deadline for mandatory implementation in most airspaces fast
approaching.
This survey first summarizes the attacks and problems that have been reported
in relation to ADS-B security. Thereafter, it surveys both the theoretical and
practical efforts which have been previously conducted concerning these issues,
including possible countermeasures. In addition, the survey seeks to go beyond
the current state of the art and gives a detailed assessment of security
measures which have been developed more generally for related wireless networks
such as sensor networks and vehicular ad hoc networks, including a taxonomy of
all considered approaches.
|
[
{
"version": "v1",
"created": "Sat, 13 Jul 2013 17:05:20 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Apr 2014 23:34:33 GMT"
}
] | 2014-11-05T00:00:00 |
[
[
"Strohmeier",
"Martin",
""
],
[
"Lenders",
"Vincent",
""
],
[
"Martinovic",
"Ivan",
""
]
] |
new_dataset
| 0.994783 |
1211.5568
|
Irene M\'arquez-Corbella
|
M. Borges-Quintana, M. A. Borges-Trenard, I. M\'arquez-Corbella and E.
Mart\'inez-Moro
|
Computing coset leaders and leader codewords of binary codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we use the Gr\"obner representation of a binary linear code
$\mathcal C$ to give efficient algorithms for computing the whole set of coset
leaders, denoted by $\mathrm{CL}(\mathcal C)$ and the set of leader codewords,
denoted by $\mathrm L(\mathcal C)$. The first algorithm could be adapted to
provide not only the Newton and the covering radius of $\mathcal C$ but also to
determine the coset leader weight distribution. Moreover, providing the set of
leader codewords we have a test-set for decoding by a gradient-like decoding
algorithm. Another contribution of this article is the relation stablished
between zero neighbours and leader codewords.
|
[
{
"version": "v1",
"created": "Fri, 23 Nov 2012 18:17:49 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Nov 2014 10:13:05 GMT"
}
] | 2014-11-04T00:00:00 |
[
[
"Borges-Quintana",
"M.",
""
],
[
"Borges-Trenard",
"M. A.",
""
],
[
"Márquez-Corbella",
"I.",
""
],
[
"Martínez-Moro",
"E.",
""
]
] |
new_dataset
| 0.999648 |
1310.6925
|
Albert Y.S. Lam
|
Albert Y.S. Lam, Yiu-Wing Leung, Xiaowen Chu
|
Electric Vehicle Charging Station Placement: Formulation, Complexity,
and Solutions
|
Submitted to IEEE Transactions on Smart Grid, revised
| null |
10.1109/TSG.2014.2344684
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To enhance environmental sustainability, many countries will electrify their
transportation systems in their future smart city plans. So the number of
electric vehicles (EVs) running in a city will grow significantly. There are
many ways to re-charge EVs' batteries and charging stations will be considered
as the main source of energy. The locations of charging stations are critical;
they should not only be pervasive enough such that an EV anywhere can easily
access a charging station within its driving range, but also widely spread so
that EVs can cruise around the whole city upon being re-charged. Based on these
new perspectives, we formulate the Electric Vehicle Charging Station Placement
Problem (EVCSPP) in this paper. We prove that the problem is non-deterministic
polynomial-time hard. We also propose four solution methods to tackle EVCSPP
and evaluate their performance on various artificial and practical cases. As
verified by the simulation results, the methods have their own characteristics
and they are suitable for different situations depending on the requirements
for solution quality, algorithmic efficiency, problem size, nature of the
algorithm, and existence of system prerequisite.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 06:38:18 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Mar 2014 07:24:53 GMT"
},
{
"version": "v3",
"created": "Tue, 10 Jun 2014 01:56:09 GMT"
}
] | 2014-11-04T00:00:00 |
[
[
"Lam",
"Albert Y. S.",
""
],
[
"Leung",
"Yiu-Wing",
""
],
[
"Chu",
"Xiaowen",
""
]
] |
new_dataset
| 0.996247 |
1406.2390
|
Xu Chen
|
Xu Chen, Xiuyuan Cheng and St\'ephane Mallat
|
Unsupervised Deep Haar Scattering on Graphs
| null | null | null | null |
cs.LG cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The classification of high-dimensional data defined on graphs is particularly
difficult when the graph geometry is unknown. We introduce a Haar scattering
transform on graphs, which computes invariant signal descriptors. It is
implemented with a deep cascade of additions, subtractions and absolute values,
which iteratively compute orthogonal Haar wavelet transforms. Multiscale
neighborhoods of unknown graphs are estimated by minimizing an average total
variation, with a pair matching algorithm of polynomial complexity. Supervised
classification with dimension reduction is tested on data bases of scrambled
images, and for signals sampled on unknown irregular grids on a sphere.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 23:51:30 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Nov 2014 15:25:16 GMT"
}
] | 2014-11-04T00:00:00 |
[
[
"Chen",
"Xu",
""
],
[
"Cheng",
"Xiuyuan",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.990385 |
1308.1279
|
Russell Brown
|
Russell A. Brown
|
Barycentric Coordinates as Interpolants
|
8 pages, 1 figure
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Barycentric coordinates are frequently used as interpolants to shade computer
graphics images. A simple equation transforms barycentric coordinates from
screen space into eye space in order to undo the perspective transformation and
permit accurate interpolative shading of texture maps. This technique is
amenable to computation using a block-normalized integer representation.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 14:15:42 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Aug 2013 13:39:44 GMT"
},
{
"version": "v3",
"created": "Thu, 8 Aug 2013 14:09:09 GMT"
},
{
"version": "v4",
"created": "Thu, 23 Oct 2014 09:46:57 GMT"
},
{
"version": "v5",
"created": "Fri, 24 Oct 2014 03:08:21 GMT"
},
{
"version": "v6",
"created": "Mon, 27 Oct 2014 04:34:08 GMT"
},
{
"version": "v7",
"created": "Tue, 28 Oct 2014 00:42:03 GMT"
},
{
"version": "v8",
"created": "Wed, 29 Oct 2014 02:34:55 GMT"
},
{
"version": "v9",
"created": "Thu, 30 Oct 2014 05:07:47 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Brown",
"Russell A.",
""
]
] |
new_dataset
| 0.976722 |
1410.8176
|
Kasim Sinan Yildirim
|
Kas{\i}m Sinan Y{\i}ld{\i}r{\i}m and Ruggero Carli and Luca Schenato
|
Proportional-Integral Clock Synchronization in Wireless Sensor Networks
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we present a new control theoretic distributed time
synchronization algorithm, named PISync, in order to synchronize sensor nodes
in Wireless Sensor Networks (WSNs). PISync algorithm is based on a
Proportional-Integral (PI) controller. It applies a proportional feedback (P)
and an integral feedback (I) on the local measured synchronization errors to
compensate the differences between the clock offsets and clock speeds. We
present practical flooding-based and fully distributed protocol implementations
of the PISync algorithm, and we provide theoretical analysis to highlight the
benefits of this approach in terms of improved steady state error and
scalability as compared to existing synchronization algorithms. We show through
real-world experiments and simulations that PISync protocols have several
advantages over existing protocols in the WSN literature, namely no need for
memory allocation, minimal CPU overhead and code size independent of network
size and topology, and graceful performance degradation in terms of network
size.
|
[
{
"version": "v1",
"created": "Wed, 29 Oct 2014 21:51:09 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Yıldırım",
"Kasım Sinan",
""
],
[
"Carli",
"Ruggero",
""
],
[
"Schenato",
"Luca",
""
]
] |
new_dataset
| 0.997021 |
1410.8205
|
Fabrizio Frati
|
Timothy M. Chan and Fabrizio Frati and Carsten Gutwenger and Anna
Lubiw and Petra Mutzel and Marcus Schaefer
|
Drawing Partially Embedded and Simultaneously Planar Graphs
|
Preliminary version appeared at the 22nd International Symposium on
Graph Drawing (GD '14)
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the problem of constructing planar drawings with few bends for
two related problems, the partially embedded graph problem---to extend a
straight-line planar drawing of a subgraph to a planar drawing of the whole
graph---and the simultaneous planarity problem---to find planar drawings of two
graphs that coincide on shared vertices and edges. In both cases we show that
if the required planar drawings exist, then there are planar drawings with a
linear number of bends per edge and, in the case of simultaneous planarity, a
constant number of crossings between every pair of edges. Our proofs provide
efficient algorithms if the combinatorial embedding of the drawing is given.
Our result on partially embedded graph drawing generalizes a classic result by
Pach and Wenger which shows that any planar graph can be drawn with a linear
number of bends per edge if the location of each vertex is fixed.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 00:17:58 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Chan",
"Timothy M.",
""
],
[
"Frati",
"Fabrizio",
""
],
[
"Gutwenger",
"Carsten",
""
],
[
"Lubiw",
"Anna",
""
],
[
"Mutzel",
"Petra",
""
],
[
"Schaefer",
"Marcus",
""
]
] |
new_dataset
| 0.998788 |
1410.8216
|
EPTCS
|
Andrew Butterfield (Trinity College Dublin)
|
UTP2: Higher-Order Equational Reasoning by Pointing
|
In Proceedings UITP 2014, arXiv:1410.7850
|
EPTCS 167, 2014, pp. 14-22
|
10.4204/EPTCS.167.4
| null |
cs.LO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a prototype theorem prover, UTP2, developed to match the style of
hand-written proof work in the Unifying Theories of Programming semantical
framework. This is based on alphabetised predicates in a 2nd-order logic, with
a strong emphasis on equational reasoning. We present here an overview of the
user-interface of this prover, which was developed from the outset using a
point-and-click approach. We contrast this with the command-line paradigm that
continues to dominate the mainstream theorem provers, and raises the question:
can we have the best of both worlds?
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 01:07:15 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Butterfield",
"Andrew",
"",
"Trinity College Dublin"
]
] |
new_dataset
| 0.995883 |
1410.8217
|
EPTCS
|
Gudmund Grov (Heriot-Watt University), Aleks Kissinger (University of
Oxford), Yuhui Lin (Heriot-Watt University)
|
Tinker, tailor, solver, proof
|
In Proceedings UITP 2014, arXiv:1410.7850
|
EPTCS 167, 2014, pp. 23-34
|
10.4204/EPTCS.167.5
| null |
cs.LO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Tinker, a tool for designing and evaluating proof strategies
based on proof-strategy graphs, a formalism previously introduced by the
authors. We represent proof strategies as open-graphs, which are directed
graphs with additional input/output edges. Tactics appear as nodes in a graph,
and can be `piped' together by adding edges between them. Goals are added to
the input edges of such a graph, and flow through the graph as the strategy is
evaluated. Properties of the edges ensure that only the right `type' of goals
are accepted. In this paper, we detail the Tinker tool and show how it can be
integrated with two different theorem provers: Isabelle and ProofPower.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 01:07:33 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Grov",
"Gudmund",
"",
"Heriot-Watt University"
],
[
"Kissinger",
"Aleks",
"",
"University of\n Oxford"
],
[
"Lin",
"Yuhui",
"",
"Heriot-Watt University"
]
] |
new_dataset
| 0.975262 |
1410.8219
|
EPTCS
|
Florian Rabe (Jacobs University Bremen)
|
A Logic-Independent IDE
|
In Proceedings UITP 2014, arXiv:1410.7850
|
EPTCS 167, 2014, pp. 48-60
|
10.4204/EPTCS.167.7
| null |
cs.LO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The author's MMT system provides a framework for defining and implementing
logical systems. By combining MMT with the jEdit text editor, we obtain a
logic-independent IDE. The IDE functionality includes advanced features such as
context-sensitive auto-completion, search, and change management.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 01:07:58 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Rabe",
"Florian",
"",
"Jacobs University Bremen"
]
] |
new_dataset
| 0.999387 |
1410.8222
|
EPTCS
|
Makarius Wenzel (Univ. Paris-Sud, Laboratoire LRI, UMR8623)
|
System description: Isabelle/jEdit in 2014
|
In Proceedings UITP 2014, arXiv:1410.7850
|
EPTCS 167, 2014, pp. 84-94
|
10.4204/EPTCS.167.10
| null |
cs.LO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is an updated system description for Isabelle/jEdit, according to the
official release Isabelle2014 (August 2014). The following new PIDE concepts
are explained: asynchronous print functions and document overlays, syntactic
and semantic completion, editor navigation, management of auxiliary files
within the document-model.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 01:08:32 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Wenzel",
"Makarius",
"",
"Univ. Paris-Sud, Laboratoire LRI, UMR8623"
]
] |
new_dataset
| 0.998231 |
1410.8336
|
Marthe Bonamy
|
Marthe Bonamy, Lukasz Kowalik
|
A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition
|
22 pages, short version accepted to IPEC'14
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show a kernel of at most $13k$ vertices for the Planar Feedback Vertex Set
problem restricted to planar graphs, i.e., a polynomial-time algorithm that
transforms an input instance $(G,k)$ to an equivalent instance with at most
$13k$ vertices. To this end we introduce a few new reduction rules. However,
our main contribution is an application of the region decomposition technique
in the analysis of the kernel size. We show that our analysis is tight, up to a
constant additive term.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 11:50:36 GMT"
}
] | 2014-10-31T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Kowalik",
"Lukasz",
""
]
] |
new_dataset
| 0.99774 |
1410.8082
|
Reginald Smith
|
Reginald D. Smith
|
Malware "Ecology" Viewed as Ecological Succession: Historical Trends and
Future Prospects
|
13 pages, 3 figures
| null | null | null |
cs.CR q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development and evolution of malware including computer viruses, worms,
and trojan horses, is shown to be closely analogous to the process of community
succession long recognized in ecology. In particular, both changes in the
overall environment by external disturbances, as well as, feedback effects from
malware competition and antivirus coevolution have driven community succession
and the development of different types of malware with varying modes of
transmission and adaptability.
|
[
{
"version": "v1",
"created": "Wed, 24 Sep 2014 17:04:05 GMT"
}
] | 2014-10-30T00:00:00 |
[
[
"Smith",
"Reginald D.",
""
]
] |
new_dataset
| 0.989245 |
1404.0545
|
EPTCS
|
Thomas Given-Wilson (INRIA, Saclay)
|
An Intensional Concurrent Faithful Encoding of Turing Machines
|
In Proceedings ICE 2014, arXiv:1410.7013
|
EPTCS 166, 2014, pp. 21-37
|
10.4204/EPTCS.166.4
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The benchmark for computation is typically given as Turing computability; the
ability for a computation to be performed by a Turing Machine. Many languages
exploit (indirect) encodings of Turing Machines to demonstrate their ability to
support arbitrary computation. However, these encodings are usually by
simulating the entire Turing Machine within the language, or by encoding a
language that does an encoding or simulation itself. This second category is
typical for process calculi that show an encoding of lambda-calculus (often
with restrictions) that in turn simulates a Turing Machine. Such approaches
lead to indirect encodings of Turing Machines that are complex, unclear, and
only weakly equivalent after computation. This paper presents an approach to
encoding Turing Machines into intensional process calculi that is faithful,
reduction preserving, and structurally equivalent. The encoding is demonstrated
in a simple asymmetric concurrent pattern calculus before generalised to
simplify infinite terms, and to show encodings into Concurrent Pattern Calculus
and Psi Calculi.
|
[
{
"version": "v1",
"created": "Wed, 2 Apr 2014 13:25:43 GMT"
},
{
"version": "v2",
"created": "Wed, 7 May 2014 10:04:09 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Jun 2014 09:06:05 GMT"
},
{
"version": "v4",
"created": "Tue, 28 Oct 2014 10:39:18 GMT"
}
] | 2014-10-29T00:00:00 |
[
[
"Given-Wilson",
"Thomas",
"",
"INRIA, Saclay"
]
] |
new_dataset
| 0.975159 |
1410.7466
|
EPTCS
|
H{\aa}kon Normann (IT University of Copenhagen), Cristian Prisacariu
(Institute for Informatics, University of Oslo), Thomas Hildebrandt (IT
University of Copenhagen)
|
Concurrency Models with Causality and Events as Psi-calculi
|
In Proceedings ICE 2014, arXiv:1410.7013
|
EPTCS 166, 2014, pp. 4-20
|
10.4204/EPTCS.166.3
| null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Psi-calculi are a parametric framework for nominal calculi, where standard
calculi are found as instances, like the pi-calculus, or the cryptographic
spi-calculus and applied-pi. Psi-calculi have an interleaving operational
semantics, with a strong foundation on the theory of nominal sets and process
algebras. Much of the expressive power of psi-calculi comes from their logical
part, i.e., assertions, conditions, and entailment, which are left quite open
thus accommodating a wide range of logics. We are interested in how this
expressiveness can deal with event-based models of concurrency. We thus take
the popular prime event structures model and give an encoding into an instance
of psi-calculi. We also take the recent and expressive model of Dynamic
Condition Response Graphs (in which event structures are strictly included) and
give an encoding into another corresponding instance of psi-calculi. The
encodings that we achieve look rather natural and intuitive. Additional results
about these encodings give us more confidence in their correctness.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 00:40:29 GMT"
}
] | 2014-10-29T00:00:00 |
[
[
"Normann",
"Håkon",
"",
"IT University of Copenhagen"
],
[
"Prisacariu",
"Cristian",
"",
"Institute for Informatics, University of Oslo"
],
[
"Hildebrandt",
"Thomas",
"",
"IT\n University of Copenhagen"
]
] |
new_dataset
| 0.978465 |
1410.7540
|
Swaleha Saeed
|
Swaleha Saeed, M Sarosh Umar, M Athar Ali and Musheer Ahmad
|
Fisher-Yates Chaotic Shuffling Based Image Encryption
| null |
International Journal of Information Processing, 8(3), 31-41, 2014
ISSN : 0973-8215 IK International Publishing House Pvt. Ltd., New Delhi,
India
| null | null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Present era, information security is of utmost concern and encryption is
one of the alternatives to ensure security. Chaos based cryptography has
brought a secure and efficient way to meet the challenges of secure multimedia
transmission over the networks. In this paper, we have proposed a secure
Grayscale image encryption methodology in wavelet domain. The proposed
algorithm performs shuffling followed by encryption using states of chaotic map
in a secure manner. Firstly, the image is transformed from spatial domain to
wavelet domain by the Haar wavelet. Subsequently, Fisher Yates chaotic
shuffling technique is employed to shuffle the image in wavelet domain to
confuse the relationship between plain image and cipher image. A key dependent
piece-wise linear chaotic map is used to generate chaos for the chaotic
shuffling. Further, the resultant shuffled approximate coefficients are
chaotically modulated. To enhance the statistical characteristics from
cryptographic point of view, the shuffled image is self keyed diffused and
mixing operation is carried out using keystream extracted from one-dimensional
chaotic map and the plain-image. The proposed algorithm is tested over some
standard image dataset. The results of several experimental, statistical and
sensitivity analyses proved that the algorithm provides an efficient and secure
method to achieve trusted gray scale image encryption.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 07:48:03 GMT"
}
] | 2014-10-29T00:00:00 |
[
[
"Saeed",
"Swaleha",
""
],
[
"Umar",
"M Sarosh",
""
],
[
"Ali",
"M Athar",
""
],
[
"Ahmad",
"Musheer",
""
]
] |
new_dataset
| 0.99587 |
1410.7751
|
Michael Bierma
|
Michael Bierma, Eric Gustafson, Jeremy Erickson, David Fritz, Yung Ryn
Choe
|
Andlantis: Large-scale Android Dynamic Analysis
|
In Proceedings of the Third Workshop on Mobile Security Technologies
(MoST) 2014 (http://arxiv.org/abs/1410.6674)
| null | null |
MoST/2014/08
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analyzing Android applications for malicious behavior is an important area of
research, and is made difficult, in part, by the increasingly large number of
applications available for the platform. While techniques exist to perform
static analysis on a large number of applications, dynamic analysis techniques
are relatively limited in scale due to the computational resources required to
emulate the full Android system to achieve accurate execution. We present
Andlantis, a scalable dynamic analysis system capable of processing over 3000
Android applications per hour. During this processing, the system is able to
collect valuable forensic data, which helps reverse-engineers and malware
researchers identify and understand anomalous application behavior. We discuss
the results of running 1261 malware samples through the system, and provide
examples of malware analysis performed with the resulting data.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 19:22:17 GMT"
}
] | 2014-10-29T00:00:00 |
[
[
"Bierma",
"Michael",
""
],
[
"Gustafson",
"Eric",
""
],
[
"Erickson",
"Jeremy",
""
],
[
"Fritz",
"David",
""
],
[
"Choe",
"Yung Ryn",
""
]
] |
new_dataset
| 0.998183 |
1410.7754
|
Daniel Defreez
|
Daniel Defreez, Bhargava Shastry, Hao Chen, Jean-Pierre Seifert
|
A First Look at Firefox OS Security
|
In Proceedings of the Third Workshop on Mobile Security Technologies
(MoST) 2014 (http://arxiv.org/abs/1410.6674)
| null | null |
MoST/2014/10
|
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With Firefox OS, Mozilla is making a serious push for an HTML5-based mobile
platform. In order to assuage security concerns over providing hardware access
to web applications, Mozilla has introduced a number of mechanisms that make
the security landscape of Firefox OS distinct from both the desktop web and
other mobile operating systems. From an application security perspective, the
two most significant of these mechanisms are the the introduction of a default
Content Security Policy and code review in the market. This paper describes how
lightweight static analysis can augment these mechanisms to find
vulnerabilities which have otherwise been missed. We provide examples of
privileged applications in the market that contain vulnerabilities that can be
automatically detected.
In addition to these findings, we show some of the challenges that occur when
desktop software is repurposed for a mobile operating system. In particular, we
argue that the caching of certificate overrides across applications--a known
problem in Firefox OS--generates a counter-intuitive user experience that
detracts from the security of the system.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 19:23:26 GMT"
}
] | 2014-10-29T00:00:00 |
[
[
"Defreez",
"Daniel",
""
],
[
"Shastry",
"Bhargava",
""
],
[
"Chen",
"Hao",
""
],
[
"Seifert",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.998384 |
1305.2462
|
Liyong Shen
|
Sonia Perez-Diaza, Liyong Shen
|
Characterization of Rational Ruled Surfaces
|
31 pages
|
Journal of Symbolic Computation Volume 63, May 2014, Pages 21-45
|
10.1016/j.jsc.2013.11.003
| null |
cs.SC cs.CG math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ruled surface is a typical modeling surface in computer aided geometric
design. It is usually given in the standard parametric form. However, it can
also be in the forms than the standard one. For these forms, it is necessary to
determine and find the standard form. In this paper, we present algorithms to
determine whether a given implicit surface is a rational ruled surface. A
parametrization of the surface is computed for the affirmative case. We also
consider the parametric situation. More precisely, after a given rational
parametric surface is determined as a ruled one, we reparameterize it to the
standard form.
|
[
{
"version": "v1",
"created": "Sat, 11 May 2013 01:50:15 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jun 2013 00:42:54 GMT"
}
] | 2014-10-28T00:00:00 |
[
[
"Perez-Diaza",
"Sonia",
""
],
[
"Shen",
"Liyong",
""
]
] |
new_dataset
| 0.985205 |
1404.7206
|
Qinsi Wang
|
Qinsi Wang, Paolo Zuliani, Soonho Kong, Sicun Gao, and Edmund M.
Clarke
|
SReach: A Bounded Model Checker for Stochastic Hybrid Systems
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe a new tool, SReach, which solves probabilistic
bounded reachability problems for two classes of stochastic hybrid systems. The
first one is (nonlinear) hybrid automata with parametric uncertainty. The
second one is probabilistic hybrid automata with additional randomness for both
transition probabilities and variable resets. Standard approaches to
reachability problems for linear hybrid systems require numerical solutions for
large optimization problems, and become infeasible for systems involving both
nonlinear dynamics over the reals and stochasticity. Our approach encodes
stochastic information by using random variables, and combines the randomized
sampling, a $\delta$-complete decision procedure, and statistical tests. SReach
utilizes the $\delta$-complete decision procedure to solve reachability
problems in a sound manner, i.e., it always decides correctly if, for a given
assignment to all random variables, the system actually reaches the unsafe
region. The statistical tests adapted guarantee arbitrary small error bounds
between probabilities estimated by SReach and real ones. Compared to standard
simulation-based methods, our approach supports non-deterministic branching,
increases the coverage of simulation, and avoids the zero-crossing problem. We
demonstrate our method's feasibility by applying SReach to three representative
biological models and to additional benchmarks for nonlinear hybrid systems
with multiple probabilistic system parameters.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2014 01:18:14 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Oct 2014 15:36:45 GMT"
}
] | 2014-10-28T00:00:00 |
[
[
"Wang",
"Qinsi",
""
],
[
"Zuliani",
"Paolo",
""
],
[
"Kong",
"Soonho",
""
],
[
"Gao",
"Sicun",
""
],
[
"Clarke",
"Edmund M.",
""
]
] |
new_dataset
| 0.978135 |
1405.6262
|
Xudong Ma
|
Xudong Ma
|
Write-Once-Memory Codes by Source Polarization
|
5 pages, Proceedings of the International Conference on Computing,
Networking and Communications (ICNC 2015), Anaheim, California, USA, February
16-19, 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new Write-Once-Memory (WOM) coding scheme based on source
polarization. By applying a source polarization transformation on the
to-be-determined codeword, the proposed WOM coding scheme encodes information
into the bits in the high-entropy set. We prove in this paper that the proposed
WOM codes are capacity-achieving. WOM codes have found many applications in
modern data storage systems, such as flash memories.
|
[
{
"version": "v1",
"created": "Sat, 24 May 2014 03:33:50 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Oct 2014 16:52:02 GMT"
}
] | 2014-10-28T00:00:00 |
[
[
"Ma",
"Xudong",
""
]
] |
new_dataset
| 0.999441 |
1406.6140
|
Sadanand Kulkarni A
|
Sadanand A. Kulkarni, Prashant L. Borde, Ramesh R. Manza, Pravin L.
Yannawar
|
Offline Handwritten MODI Character Recognition Using HU, Zernike Moments
and Zoning
|
This paper has been withdrawn by the author due to the paper was
rejected by journal with a reson "paper was not suitable for the journal"
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
HOCR is abbreviated as Handwritten Optical Character Recognition. HOCR is a
process of recognition of different handwritten characters from a digital image
of documents. Handwritten automatic character recognition has attracted many
researchers all over the world to contribute handwritten character recognition
domain. Shape identification and feature extraction is very important part of
any character recognition system and success of method is highly dependent on
selection of features. However feature extraction is the most important step in
defining the shape of the character as precisely and as uniquely as possible.
This is indeed the most important step and complex task as well and achieved
success by using invariance property, irrespective of position and orientation.
Zernike moments describes shape, identify rotation invariant due to its
Orthogonality property. MODI is an ancient script of India had cursive and
complex representation of characters. The work described in this paper presents
efficiency of Zernike moments over Hu 7 moment with zoning for automatic
recognition of handwritten MODI characters. Offline approach is used in this
paper because MODI Script was very popular and widely used for writing purpose
till 19th century before Devanagari was officially adopted.
|
[
{
"version": "v1",
"created": "Tue, 24 Jun 2014 05:40:43 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Jul 2014 04:49:04 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Jul 2014 15:09:24 GMT"
},
{
"version": "v4",
"created": "Mon, 27 Oct 2014 13:17:41 GMT"
}
] | 2014-10-28T00:00:00 |
[
[
"Kulkarni",
"Sadanand A.",
""
],
[
"Borde",
"Prashant L.",
""
],
[
"Manza",
"Ramesh R.",
""
],
[
"Yannawar",
"Pravin L.",
""
]
] |
new_dataset
| 0.980288 |
1410.6909
|
Sunil Kumar Kopparapu Dr
|
Sunil Kumar Kopparapu and Lajish V. L
|
A Framework for On-Line Devanagari Handwritten Character Recognition
|
29 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main challenge in on-line handwritten character recognition in Indian
lan- guage is the large size of the character set, larger similarity between
different characters in the script and the huge variation in writing style. In
this paper we propose a framework for on-line handwitten script recognition
taking cues from speech signal processing literature. The framework is based on
identify- ing strokes, which in turn lead to recognition of handwritten on-line
characters rather that the conventional character identification. Though the
framework is described for Devanagari script, the framework is general and can
be applied to any language.
The proposed platform consists of pre-processing, feature extraction, recog-
nition and post processing like the conventional character recognition but ap-
plied to strokes. The on-line Devanagari character recognition reduces to one
of recognizing one of 69 primitives and recognition of a character is performed
by recognizing a sequence of such primitives. We further show the impact of
noise removal on on-line raw data which is usually noisy. The use of Fuzzy
Direc- tional Features to enhance the accuracy of stroke recognition is also
described. The recognition results are compared with commonly used directional
features in literature using several classifiers.
|
[
{
"version": "v1",
"created": "Sat, 25 Oct 2014 10:13:02 GMT"
}
] | 2014-10-28T00:00:00 |
[
[
"Kopparapu",
"Sunil Kumar",
""
],
[
"L",
"Lajish V.",
""
]
] |
new_dataset
| 0.99317 |
1311.1928
|
Narasimhan Sadagopan
|
Mahati Kumar, S.Manasvini, N.Sadagopan, and Adithya Seshadri
|
On Uni Chord Free Graphs
|
This paper has been withdrawn due to a bug in the algorithm
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is unichord free if it does not contain a cycle with exactly one
chord as its subgraph. In [3], it is shown that a graph is unichord free if and
only if every minimal vertex separator is a stable set. In this paper, we first
show that such a graph can be recognized in polynomial time. Further, we show
that the chromatic number of unichord free graphs is one of (2,3, \omega(G)).
We also present a polynomial-time algorithm to produce a coloring with
\omega(G) colors.
|
[
{
"version": "v1",
"created": "Fri, 8 Nov 2013 10:46:04 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jan 2014 10:20:48 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Oct 2014 08:57:14 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Kumar",
"Mahati",
""
],
[
"Manasvini",
"S.",
""
],
[
"Sadagopan",
"N.",
""
],
[
"Seshadri",
"Adithya",
""
]
] |
new_dataset
| 0.999329 |
1410.6500
|
Tarik Anouari
|
Tarik Anouari and Abdelkrim Haqiq
|
QoE-Based Scheduling Algorithm in WiMAX Network using Manhattan Grid
Mobility Model
|
6 pages, 7 figures. arXiv admin note: substantial text overlap with
arXiv:1410.6154, arXiv:1410.5944
|
The World of Computer Science and Information Technology Journal
(WSCIT). 2014, Volume 4, Issue 10. pp. 133.138
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WiMAX (acronym for Worldwide Interoperability for Microwave Access) is a
family of technical standards based on IEEE 802.16 standard that defines the
high speed connection through radio waves unlike DSL (Digital Subscriber Line)
or other wired technology. It can provide coverage to remote rural areas of
several kilometers in radius, it's an adequate response to some rural or
inaccessible areas. WiMAX can provide point-to-point (P2P) and
point-to-multipoint (PMP) modes. In parallel, it was observed that, unlike the
traditional assessment methods for quality, nowadays, current research focuses
on the user perceived quality, the existing scheduling approaches take into
account the quality of service (QoS) and many technical parameters, but does
not take into account the quality of experience (QoE). In this paper, we
present a scheduling algorithm to provide QoE in WiMAX network under Manhattan
Mobility. A new approach is proposed, particularly for the Best Effort (BE)
service class WiMAX, in this approach, if a packet loss occurs on a link
connection, the system then reduces the transmission rate of this connection to
obtain its minimum allowable transmission rate. The NS-2 simulation results
show that the QoE provided to users is enhanced in terms of throughput, jitter,
packet loss rate and delay.
|
[
{
"version": "v1",
"created": "Wed, 22 Oct 2014 09:23:40 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Anouari",
"Tarik",
""
],
[
"Haqiq",
"Abdelkrim",
""
]
] |
new_dataset
| 0.993272 |
1410.6520
|
Jason S. Ku
|
Erik D. Demaine and Jason S. Ku
|
Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed
Boundary Folding
|
13 pages, 7 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a sheet of paper and a prescribed folding of its boundary, is there a
way to fold the paper's interior without stretching so that the boundary lines
up with the prescribed boundary folding? For polygonal boundaries
nonexpansively folded at finitely many points, we prove that a consistent
isometric mapping of the polygon interior always exists and is computable in
polynomial time.
|
[
{
"version": "v1",
"created": "Thu, 23 Oct 2014 22:52:59 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Ku",
"Jason S.",
""
]
] |
new_dataset
| 0.998887 |
1410.6532
|
Ziming Zhang
|
Ziming Zhang, Yuting Chen, Venkatesh Saligrama
|
A Novel Visual Word Co-occurrence Model for Person Re-identification
|
Accepted at ECCV Workshop on Visual Surveillance and
Re-Identification, 2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Person re-identification aims to maintain the identity of an individual in
diverse locations through different non-overlapping camera views. The problem
is fundamentally challenging due to appearance variations resulting from
differing poses, illumination and configurations of camera views. To deal with
these difficulties, we propose a novel visual word co-occurrence model. We
first map each pixel of an image to a visual word using a codebook, which is
learned in an unsupervised manner. The appearance transformation between camera
views is encoded by a co-occurrence matrix of visual word joint distributions
in probe and gallery images. Our appearance model naturally accounts for
spatial similarities and variations caused by pose, illumination &
configuration change across camera views. Linear SVMs are then trained as
classifiers using these co-occurrence descriptors. On the VIPeR and CUHK Campus
benchmark datasets, our method achieves 83.86% and 85.49% at rank-15 on the
Cumulative Match Characteristic (CMC) curves, and beats the state-of-the-art
results by 10.44% and 22.27%.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 01:04:37 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Zhang",
"Ziming",
""
],
[
"Chen",
"Yuting",
""
],
[
"Saligrama",
"Venkatesh",
""
]
] |
new_dataset
| 0.997485 |
1410.6589
|
Lan Zhang
|
Lan Zhang, Taeho Jung, Cihang Liu, Xuan Ding, Xiang-Yang Li, Yunhao
Liu
|
Outsource Photo Sharing and Searching for Mobile Devices With Privacy
Protection
|
10 pages, 13 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the proliferation of mobile devices, cloud-based photo sharing and
searching services are becoming common due to the mobile devices' resource
constrains. Meanwhile, there is also increasing concern about privacy in
photos. In this work, we present a framework \ourprotocolNSP, which enables
cloud servers to provide privacy-preserving photo sharing and search as a
service to mobile device users. Privacy-seeking users can share their photos
via our framework to allow only their authorized friends to browse and search
their photos using resource-bounded mobile devices. This is achieved by our
carefully designed architecture and novel outsourced privacy-preserving
computation protocols, through which no information about the outsourced photos
or even the search contents (including the results) would be revealed to the
cloud servers. Our framework is compatible with most of the existing image
search technologies, and it requires few changes to the existing cloud systems.
The evaluation of our prototype system with 31,772 real-life images shows the
communication and computation efficiency of our system.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 06:21:58 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Zhang",
"Lan",
""
],
[
"Jung",
"Taeho",
""
],
[
"Liu",
"Cihang",
""
],
[
"Ding",
"Xuan",
""
],
[
"Li",
"Xiang-Yang",
""
],
[
"Liu",
"Yunhao",
""
]
] |
new_dataset
| 0.999243 |
1410.6629
|
Gianluca Stringhini
|
Gianluca Stringhini, Olivier Thonnard
|
That Ain't You: Detecting Spearphishing Emails Before They Are Sent
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the ways in which attackers try to steal sensitive information from
corporations is by sending spearphishing emails. This type of emails typically
appear to be sent by one of the victim's coworkers, but have instead been
crafted by an attacker. A particularly insidious type of spearphishing emails
are the ones that do not only claim to come from a trusted party, but were
actually sent from that party's legitimate email account that was compromised
in the first place. In this paper, we propose a radical change of focus in the
techniques used for detecting such malicious emails: instead of looking for
particular features that are indicative of attack emails, we look for possible
indicators of impersonation of the legitimate owners. We present
IdentityMailer, a system that validates the authorship of emails by learning
the typical email-sending behavior of users over time, and comparing any
subsequent email sent from their accounts against this model. Our experiments
on real world e-mail datasets demonstrate that our system can effectively block
advanced email attacks sent from genuine email accounts, which traditional
protection systems are unable to detect. Moreover, we show that it is resilient
to an attacker willing to evade the system. To the best of our knowledge,
IdentityMailer is the first system able to identify spearphishing emails that
are sent from within an organization, by a skilled attacker having access to a
compromised email account.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 09:45:03 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Stringhini",
"Gianluca",
""
],
[
"Thonnard",
"Olivier",
""
]
] |
new_dataset
| 0.992756 |
1410.6651
|
Martin Monperrus
|
Matias Martinez, Martin Monperrus
|
ASTOR: Evolutionary Automatic Software Repair for Java
| null | null | null |
hal-01075976
|
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context: During last years, many automatic software repair approaches have
been presented by the software engineering research community. According to the
corresponding papers, these approaches are able to repair real defects from
open source projects. Problematic: Some previous publications in the automatic
repair field do not provide the implementation of theirs approaches.
Consequently, it is not possible for the research community to re-execute the
original evaluation, to set up new evaluations (for example, to evaluate the
performance against new defects) or to compare approaches against each others.
Solution: We propose a publicly available automatic software repair tool called
Astor. It implements three state-of-the-art automatic software repair
approaches in the context of Java programs (including GenProg and a subset of
PAR's templates). The source code of Astor is licensed under the GNU General
Public Licence (GPL v2).
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 11:38:38 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Martinez",
"Matias",
""
],
[
"Monperrus",
"Martin",
""
]
] |
new_dataset
| 0.992547 |
1410.6656
|
Benedikt Boehm
|
Benedikt Boehm
|
StegExpose - A Tool for Detecting LSB Steganography
| null | null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Steganalysis tools play an important part in saving time and providing new
angles of attack for forensic analysts. StegExpose is a solution designed for
use in the real world, and is able to analyse images for LSB steganography in
bulk using proven attacks in a time efficient manner. When steganalytic methods
are combined intelligently, they are able generate even more accurate results.
This is the prime focus of StegExpose.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 11:52:00 GMT"
}
] | 2014-10-27T00:00:00 |
[
[
"Boehm",
"Benedikt",
""
]
] |
new_dataset
| 0.989816 |
1410.5816
|
Andrey Bogomolov
|
Andrey Bogomolov, Bruno Lepri, Michela Ferron, Fabio Pianesi, Alex
(Sandy) Pentland
|
Daily Stress Recognition from Mobile Phone Data, Weather Conditions and
Individual Traits
|
ACM Multimedia 2014, November 3-7, 2014, Orlando, Florida, USA
| null |
10.1145/2647868.2654933
| null |
cs.CY cs.LG physics.data-an stat.AP stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research has proven that stress reduces quality of life and causes many
diseases. For this reason, several researchers devised stress detection systems
based on physiological parameters. However, these systems require that
obtrusive sensors are continuously carried by the user. In our paper, we
propose an alternative approach providing evidence that daily stress can be
reliably recognized based on behavioral metrics, derived from the user's mobile
phone activity and from additional indicators, such as the weather conditions
(data pertaining to transitory properties of the environment) and the
personality traits (data concerning permanent dispositions of individuals). Our
multifactorial statistical model, which is person-independent, obtains the
accuracy score of 72.28% for a 2-class daily stress recognition problem. The
model is efficient to implement for most of multimedia applications due to
highly reduced low-dimensional feature space (32d). Moreover, we identify and
discuss the indicators which have strong predictive power.
|
[
{
"version": "v1",
"created": "Tue, 21 Oct 2014 18:54:53 GMT"
}
] | 2014-10-23T00:00:00 |
[
[
"Bogomolov",
"Andrey",
"",
"Sandy"
],
[
"Lepri",
"Bruno",
"",
"Sandy"
],
[
"Ferron",
"Michela",
"",
"Sandy"
],
[
"Pianesi",
"Fabio",
"",
"Sandy"
],
[
"Alex",
"",
"",
"Sandy"
],
[
"Pentland",
"",
""
]
] |
new_dataset
| 0.998037 |
1410.2960
|
Shihao Yan
|
Shihao Yan, Robert Malaney, Ido Nevat, and Gareth W. Peters
|
Location Spoofing Detection for VANETs by a Single Base Station in
Rician Fading Channels
|
6 pages, 5 figures, Added further clarification on constraints
imposed on the detection minimization strategy. Minor typos fixed
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we examine the performance of a Location Spoofing Detection
System (LSDS) for vehicular networks in the realistic setting of Rician fading
channels. In the LSDS, an authorized Base Station (BS) equipped with multiple
antennas utilizes channel observations to identify a malicious vehicle, also
equipped with multiple antennas, that is spoofing its location. After deriving
the optimal transmit power and the optimal directional beamformer of a
potentially malicious vehicle, robust theoretical analysis and detailed
simulations are conducted in order to determine the impact of key system
parameters on the LSDS performance. Our analysis shows how LSDS performance
increases as the Rician K-factor of the channel between the BS and legitimate
vehicles increases, or as the number of antennas at the BS or legitimate
vehicle increases. We also obtain the counter-intuitive result that the
malicious vehicle's optimal number of antennas conditioned on its optimal
directional beamformer is equal to the legitimate vehicle's number of antennas.
The results we provide here are important for the verification of location
information reported in IEEE 1609.2 safety messages.
|
[
{
"version": "v1",
"created": "Sat, 11 Oct 2014 07:17:20 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Oct 2014 06:38:43 GMT"
}
] | 2014-10-22T00:00:00 |
[
[
"Yan",
"Shihao",
""
],
[
"Malaney",
"Robert",
""
],
[
"Nevat",
"Ido",
""
],
[
"Peters",
"Gareth W.",
""
]
] |
new_dataset
| 0.988372 |
1410.5604
|
Roger Ten-Valls
|
Joaquim Borges, Cristina Fern\'andez-C\'ordoba, Roger Ten-Valls
|
Z2-double cyclic codes
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of
coordinates can be partitioned into two subsets such that any cyclic shift of
the coordinates of both subsets leaves invariant the code. These codes can be
identified as submodules of the $\mathbb{Z}_2[x]$-module
$\mathbb{Z}_2[x]/(x^r-1)\times\mathbb{Z}_2[x]/(x^s-1).$ We determine the
structure of $\mathbb{Z}_2$-double cyclic codes giving the generator
polynomials of these codes. The related polynomial representation of
$\mathbb{Z}_2$-double cyclic codes and its duals, and the relations between the
polynomial generators of these codes are studied.
|
[
{
"version": "v1",
"created": "Tue, 21 Oct 2014 10:12:42 GMT"
}
] | 2014-10-22T00:00:00 |
[
[
"Borges",
"Joaquim",
""
],
[
"Fernández-Córdoba",
"Cristina",
""
],
[
"Ten-Valls",
"Roger",
""
]
] |
new_dataset
| 0.999084 |
1410.5777
|
Leon Abdillah
|
Ahmad Josi and Leon Andretti Abdillah and Suryayusra
|
Penerapan teknik web scraping pada mesin pencari artikel ilmiah
|
6 pages, Jurnal Sistem Informasi (SISFO), vol. 5, 2014
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Search engines are a combination of hardware and computer software supplied
by a particular company through the website which has been determined. Search
engines collect information from the web through bots or web crawlers that
crawls the web periodically. The process of retrieval of information from
existing websites is called "web scraping." Web scraping is a technique of
extracting information from websites. Web scraping is closely related to Web
indexing, as for how to develop a web scraping technique that is by first
studying the program makers HTML document from the website will be taken to the
information in the HTML tag flanking the aim is for information collected after
the program makers learn navigation techniques on the website information will
be taken to a web application mimicked the scraping that we will create. It
should also be noted that the implementation of this writing only scraping
involves a free search engine such as: portal garuda, Indonesian scientific
journal databases (ISJD), google scholar.
|
[
{
"version": "v1",
"created": "Sat, 18 Oct 2014 11:20:07 GMT"
}
] | 2014-10-22T00:00:00 |
[
[
"Josi",
"Ahmad",
""
],
[
"Abdillah",
"Leon Andretti",
""
],
[
"Suryayusra",
"",
""
]
] |
new_dataset
| 0.999786 |
0905.4160
|
Murat Guzeltepe Mr
|
Murat Guzeltepe, Mehmet Ozen
|
Codes over Quaternion Integers with Respect to Lipschitz Metric
|
The paper cannot give enough novalities. The technic had been already
known
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I want to withdraw this paper.
|
[
{
"version": "v1",
"created": "Tue, 26 May 2009 10:47:37 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Dec 2009 12:48:51 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Mar 2010 07:48:56 GMT"
},
{
"version": "v4",
"created": "Tue, 10 May 2011 07:46:51 GMT"
},
{
"version": "v5",
"created": "Sat, 18 Oct 2014 06:47:45 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Guzeltepe",
"Murat",
""
],
[
"Ozen",
"Mehmet",
""
]
] |
new_dataset
| 0.950815 |
0912.5009
|
Murat Guzeltepe Mr
|
Murat Guzeltepe, Mehmet Ozen
|
The MacWilliams Theorem for Four-Dimensional Modulo Metrics
|
A similar paper had been already published by Jay Wood
| null | null | null |
cs.IT cs.DM math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, the MacWilliams theorem is stated for codes over finite field
with four-dimensional modulo metrics.
|
[
{
"version": "v1",
"created": "Sun, 27 Dec 2009 11:16:48 GMT"
},
{
"version": "v2",
"created": "Sat, 18 Oct 2014 06:38:46 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Guzeltepe",
"Murat",
""
],
[
"Ozen",
"Mehmet",
""
]
] |
new_dataset
| 0.993816 |
1405.6157
|
Natalia Silberstein
|
Natalia Silberstein
|
Fractional Repetition and Erasure Batch Codes
|
Was presented at the fourth International Castle Meeting on Coding
Theory and Applications (4ICMCTA), Palmela, Portugal, September 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Batch codes are a family of codes that represent a distributed storage system
(DSS) of $n$ nodes so that any batch of $t$ data symbols can be retrieved by
reading at most one symbol from each node. Fractional repetition codes are a
family of codes for DSS that enable efficient uncoded repairs of failed nodes.
In this work these two families of codes are combined to obtain fractional
repetition batch (FRB) codes which provide both uncoded repairs and parallel
reads of subsets of stored symbols. In addition, new batch codes which can
tolerate node failures are considered. This new family of batch codes is called
erasure combinatorial batch codes (ECBCs). Some properties of FRB codes and
ECBCs and examples of their constructions based on transversal designs and
affine planes are presented.
|
[
{
"version": "v1",
"created": "Sun, 4 May 2014 13:04:14 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Oct 2014 08:36:40 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
]
] |
new_dataset
| 0.999822 |
1410.4868
|
Michael Bloodgood
|
Kathryn Baker, Michael Bloodgood, Bonnie J. Dorr, Nathaniel W.
Filardo, Lori Levin and Christine Piatko
|
A Modality Lexicon and its use in Automatic Tagging
|
6 pages, 5 figures; appeared in Proceedings of the Seventh
International Conference on Language Resources and Evaluation (LREC'10), May
2010
|
In Proceedings of the Seventh International Conference on Language
Resources and Evaluation (LREC'10), pages 1402-1407, Valletta, Malta, May
2010. European Language Resources Association
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes our resource-building results for an eight-week JHU
Human Language Technology Center of Excellence Summer Camp for Applied Language
Exploration (SCALE-2009) on Semantically-Informed Machine Translation.
Specifically, we describe the construction of a modality annotation scheme, a
modality lexicon, and two automated modality taggers that were built using the
lexicon and annotation scheme. Our annotation scheme is based on identifying
three components of modality: a trigger, a target and a holder. We describe how
our modality lexicon was produced semi-automatically, expanding from an initial
hand-selected list of modality trigger words and phrases. The resulting
expanded modality lexicon is being made publicly available. We demonstrate that
one tagger---a structure-based tagger---results in precision around 86%
(depending on genre) for tagging of a standard LDC data set. In a machine
translation application, using the structure-based tagger to annotate English
modalities on an English-Urdu training corpus improved the translation quality
score for Urdu by 0.3 Bleu points in the face of sparse training data.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 21:19:15 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Baker",
"Kathryn",
""
],
[
"Bloodgood",
"Michael",
""
],
[
"Dorr",
"Bonnie J.",
""
],
[
"Filardo",
"Nathaniel W.",
""
],
[
"Levin",
"Lori",
""
],
[
"Piatko",
"Christine",
""
]
] |
new_dataset
| 0.998598 |
1410.4928
|
Wajeb Gharibi
|
Wajeb Gharibi, Gharib Gharibi
|
Gharibi_FaceCard for Contacts and Easy Personal - Information Exchange
|
2 pages. Proceedings of the 8th INDIACom; INDIACom-2014
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we discuss a new contact way for exchanging personal
information using mobile phones. The idea of this invention depends on
allocating a special code called Gharibi Code (GC) for each personal mobile and
creating a personal information file called Gharibi Face Card (GFC), which has
all specified personal data of the mobile phone user. When you request
someone's GC code, the other party's phone will send you the GFC of that
person. We think that this approach will facilitate the process of
communication and exchanging the specified personal data easily, especially
when acquaintance. Mobile number, phone and e-mail address, for example, will
be sent in a few seconds using a simple code that does not exceed six
characters long to transfer a huge amount of personal data through mobile
devices rather than using traditional business or visiting cards.
|
[
{
"version": "v1",
"created": "Sat, 18 Oct 2014 09:28:15 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Gharibi",
"Wajeb",
""
],
[
"Gharibi",
"Gharib",
""
]
] |
new_dataset
| 0.999732 |
1410.5021
|
Shuiyin Liu
|
Shuiyin Liu, Yi Hong, and Emanuele Viterbo
|
Unshared Secret Key Cryptography
|
13 pages, 4 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current security techniques can be implemented with either secret key
exchange or physical layer wiretap codes. In this work, we investigate an
alternative solution for MIMO wiretap channels. Inspired by the artificial
noise (AN) technique, we propose the unshared secret key (USK) cryptosystem,
where the AN is redesigned as a one-time pad secret key aligned within the null
space between transmitter and legitimate receiver. The proposed USK
cryptosystem is a new physical layer cryptographic scheme, obtained by
combining traditional network layer cryptography and physical layer security.
Unlike previously studied artificial noise techniques, rather than ensuring
non-zero secrecy capacity, the USK is valid for an infinite lattice input
alphabet and guarantees Shannon's ideal secrecy and perfect secrecy, without
the need of secret key exchange. We then show how ideal secrecy can be obtained
for finite lattice constellations with an arbitrarily small outage.
|
[
{
"version": "v1",
"created": "Sun, 19 Oct 2014 01:10:52 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Liu",
"Shuiyin",
""
],
[
"Hong",
"Yi",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.995023 |
1410.5107
|
Tang Liu
|
Tang Liu, Daniela Tuninetti, Syed A. Jafar
|
The DoF of the Asymmetric MIMO Interference Channel with Square Direct
Link Channel Matrices
|
Presented at 52nd Allerton Conference, 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the sum Degrees of Freedom (DoF) of $K$-user {\em
asymmetric} MIMO Interference Channel (IC) with square direct link channel
matrices, that is, the $u$-th transmitter and its intended receiver have
$M_u\in\mathbb{N}$ antennas each, where $M_u$ need not be the same for all
$u\in[1:K]$.
Starting from a $3$-user example, it is shown that existing cooperation-based
outer bounds are insufficient to characterize the DoF. Moreover, it is shown
that two distinct operating regimes exist. With a {\it dominant} user, i.e., a
user that has more antennas than the other two users combined, %(say $M_1\geq
M_2+M_3$), it is DoF optimal to let that user transmit alone on the IC.
Otherwise, it is DoF optimal to {\em decompose} and operate the 3-user MIMO IC
as an $(M_1+ M_2+M_3)$-user SISO IC. This indicates that MIMO operations are
useless from a DoF perspective in systems without a dominant user.
The main contribution of the paper is the derivation of a novel outer bound
for the general $K$-user case that is tight in the regime where a dominant user
is not present; this is done by generalizing the insights from the 3-user
example to an arbitrary number of users.
|
[
{
"version": "v1",
"created": "Sun, 19 Oct 2014 19:45:41 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Liu",
"Tang",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Jafar",
"Syed A.",
""
]
] |
new_dataset
| 0.981718 |
1410.5257
|
Zhiyong Chen
|
Hui Liu, Zhiyong Chen, Xiaohua Tian, Xinbing Wang, Meixia Tao
|
On Content-centric Wireless Delivery Networks
|
20 pages, 7 figures,accepted by IEEE Wireless
Communications,Sept.2014
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The flux of social media and the convenience of mobile connectivity has
created a mobile data phenomenon that is expected to overwhelm the mobile
cellular networks in the foreseeable future. Despite the advent of 4G/LTE, the
growth rate of wireless data has far exceeded the capacity increase of the
mobile networks. A fundamentally new design paradigm is required to tackle the
ever-growing wireless data challenge.
In this article, we investigate the problem of massive content delivery over
wireless networks and present a systematic view on content-centric network
design and its underlying challenges. Towards this end, we first review some of
the recent advancements in Information Centric Networking (ICN) which provides
the basis on how media contents can be labeled, distributed, and placed across
the networks. We then formulate the content delivery task into a content rate
maximization problem over a share wireless channel, which, contrasting the
conventional wisdom that attempts to increase the bit-rate of a unicast system,
maximizes the content delivery capability with a fixed amount of wireless
resources. This conceptually simple change enables us to exploit the "content
diversity" and the "network diversity" by leveraging the abundant computation
sources (through application-layer encoding, pushing and caching, etc.) within
the existing wireless networks. A network architecture that enables wireless
network crowdsourcing for content delivery is then described, followed by an
exemplary campus wireless network that encompasses the above concepts.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2014 13:04:26 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Liu",
"Hui",
""
],
[
"Chen",
"Zhiyong",
""
],
[
"Tian",
"Xiaohua",
""
],
[
"Wang",
"Xinbing",
""
],
[
"Tao",
"Meixia",
""
]
] |
new_dataset
| 0.99714 |
1410.5349
|
Fredrick Ishengoma
|
Fredrick R. Ishengoma, Adam B. Mtaho
|
3D Printing: Developing Countries Perspectives
|
4 pages, International Journal of Computer Applications Volume
104-Number 11, 2014
| null |
10.5120/18249-9329
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the past decade, 3D printing (3DP) has become popular due to availability
of low-cost 3D printers such as RepRap and Fab@Home; and better software, which
offers a broad range of manufacturing platform that enables users to create
customizable products. 3DP offers everybody with the power to convert a digital
design into a three dimensional physical object. While the application of 3DP
in developing countries is still at an early stage, the technology application
promises vast solutions to existing problems. This paper presents a critical
review of the current state of art of 3DP with a particular focus on developing
countries. Moreover, it discusses the challenges, opportunities and future
insights of 3DP in developing countries. This paper will serve as a basis for
discussion and further research on this area.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2014 16:44:11 GMT"
}
] | 2014-10-21T00:00:00 |
[
[
"Ishengoma",
"Fredrick R.",
""
],
[
"Mtaho",
"Adam B.",
""
]
] |
new_dataset
| 0.99835 |
1306.4774
|
Anyu Wang
|
Anyu Wang and Zhifang Zhang
|
Repair Locality with Multiple Erasure Tolerance
|
14 pages
|
IEEE Transactions on Information Theory, Volume 60, Issue 11, pp.
6979 - 6987, Oct 2014
|
10.1109/TIT.2014.2351404
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In distributed storage systems, erasure codes with locality $r$ is preferred
because a coordinate can be recovered by accessing at most $r$ other
coordinates which in turn greatly reduces the disk I/O complexity for small
$r$. However, the local repair may be ineffective when some of the $r$
coordinates accessed for recovery are also erased.
To overcome this problem, we propose the $(r,\delta)_c$-locality providing
$\delta -1$ local repair options for a coordinate. Consequently, the repair
locality $r$ can tolerate $\delta-1$ erasures in total. We derive an upper
bound on the minimum distance $d$ for any linear $[n,k]$ code with information
$(r,\delta)_c$-locality. For general parameters, we prove existence of the
codes that attain this bound when $n\geq k(r(\delta-1)+1)$, implying tightness
of this bound. Although the locality $(r,\delta)$ defined by Prakash et al
provides the same level of locality and local repair tolerance as our
definition, codes with $(r,\delta)_c$-locality are proved to have more
advantage in the minimum distance. In particular, we construct a class of codes
with all symbol $(r,\delta)_c$-locality where the gain in minimum distance is
$\Omega(\sqrt{r})$ and the information rate is close to 1.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 07:35:09 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Wang",
"Anyu",
""
],
[
"Zhang",
"Zhifang",
""
]
] |
new_dataset
| 0.994486 |
1401.2607
|
Anyu Wang
|
Anyu Wang, Zhifang Zhang
|
Repair Locality From a Combinatorial Perspective
| null | null |
10.1109/ISIT.2014.6875178
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Repair locality is a desirable property for erasure codes in distributed
storage systems. Recently, different structures of local repair groups have
been proposed in the definitions of repair locality. In this paper, the concept
of regenerating set is introduced to characterize the local repair groups. A
definition of locality $r^{(\delta -1)}$ (i.e., locality $r$ with repair
tolerance $\delta -1$) under the most general structure of regenerating sets is
given. All previously studied locality turns out to be special cases of this
definition. Furthermore, three representative concepts of locality proposed
before are reinvestigated under the framework of regenerating sets, and their
respective upper bounds on the minimum distance are reproved in a uniform and
brief form. Additionally, a more precise distance bound is derived for the
square code which is a class of linear codes with locality $r^{(2)}$ and high
information rate, and an explicit code construction attaining the optimal
distance bound is obtained.
|
[
{
"version": "v1",
"created": "Sun, 12 Jan 2014 11:29:18 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Wang",
"Anyu",
""
],
[
"Zhang",
"Zhifang",
""
]
] |
new_dataset
| 0.975645 |
1407.0385
|
Alex Horn
|
Alex Horn and Jade Alglave
|
Concurrent Kleene Algebra of Partial Strings
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Concurrent Kleene Algebra (CKA) is a recently proposed algebraic structure by
Hoare and collaborators that unifies the laws of concurrent programming. The
unifying power of CKA rests largely on the so-called exchange law that
describes how concurrent and sequential composition operators can be
interchanged. Based on extensive theoretical work on true concurrency in the
past, this paper extends Gischer's pomset model with least fixed point
operators and formalizes the program refinement relation by \'{E}sik's
monotonic bijective morphisms to construct a partial order model of CKA. The
existence of such a model is relevant when we want to prove and disprove
properties about concurrent programs with loops. In particular, it gives a
foundation for the analysis of programs that concurrently access relaxed memory
as shown in subsequent work.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2014 19:59:41 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Jul 2014 17:51:17 GMT"
},
{
"version": "v3",
"created": "Thu, 31 Jul 2014 11:35:04 GMT"
},
{
"version": "v4",
"created": "Fri, 17 Oct 2014 19:55:45 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Horn",
"Alex",
""
],
[
"Alglave",
"Jade",
""
]
] |
new_dataset
| 0.998134 |
1410.4470
|
Raviteja Vemulapalli
|
Raviteja Vemulapalli, Vinay Praneeth Boda, and Rama Chellappa
|
MKL-RT: Multiple Kernel Learning for Ratio-trace Problems via Convex
Optimization
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the recent past, automatic selection or combination of kernels (or
features) based on multiple kernel learning (MKL) approaches has been receiving
significant attention from various research communities. Though MKL has been
extensively studied in the context of support vector machines (SVM), it is
relatively less explored for ratio-trace problems. In this paper, we show that
MKL can be formulated as a convex optimization problem for a general class of
ratio-trace problems that encompasses many popular algorithms used in various
computer vision applications. We also provide an optimization procedure that is
guaranteed to converge to the global optimum of the proposed optimization
problem. We experimentally demonstrate that the proposed MKL approach, which we
refer to as MKL-RT, can be successfully used to select features for
discriminative dimensionality reduction and cross-modal retrieval. We also show
that the proposed convex MKL-RT approach performs better than the recently
proposed non-convex MKL-DR approach.
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 15:51:50 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Oct 2014 06:12:37 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Vemulapalli",
"Raviteja",
""
],
[
"Boda",
"Vinay Praneeth",
""
],
[
"Chellappa",
"Rama",
""
]
] |
new_dataset
| 0.976972 |
1410.4612
|
Hirosuke Yamamoto
|
Hirosuke Yamamoto and Masashi Ueda
|
Identification Codes to Identify Multiple Objects
|
14 pages, submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the case of ordinary identification coding, a code is devised to identify
a single object among $N$ objects. But, in this paper, we consider an
identification coding problem to identify $K$ objects at once among $N$ objects
in the both cases that $K$ objects are ranked or not ranked. By combining
Kurosawa-Yoshida scheme with Moulin-Koetter scheme, an efficient identification
coding scheme is proposed, which can attain high coding rate and error
exponents compared with the case that an ordinary identification code is used
$K$ times. Furthermore, the achievable triplet of rate and error exponents of
type I and type II decoding error probabilities are derived for the proposed
coding scheme.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 00:31:21 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Yamamoto",
"Hirosuke",
""
],
[
"Ueda",
"Masashi",
""
]
] |
new_dataset
| 0.958559 |
1410.4673
|
Zhiding Yu
|
Weiyang Liu, Zhiding Yu, Lijia Lu, Yandong Wen, Hui Li and Yuexian Zou
|
KCRC-LCD: Discriminative Kernel Collaborative Representation with
Locality Constrained Dictionary for Visual Categorization
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the image classification problem via kernel collaborative
representation classification with locality constrained dictionary (KCRC-LCD).
Specifically, we propose a kernel collaborative representation classification
(KCRC) approach in which kernel method is used to improve the discrimination
ability of collaborative representation classification (CRC). We then measure
the similarities between the query and atoms in the global dictionary in order
to construct a locality constrained dictionary (LCD) for KCRC. In addition, we
discuss several similarity measure approaches in LCD and further present a
simple yet effective unified similarity measure whose superiority is validated
in experiments. There are several appealing aspects associated with LCD. First,
LCD can be nicely incorporated under the framework of KCRC. The LCD similarity
measure can be kernelized under KCRC, which theoretically links CRC and LCD
under the kernel method. Second, KCRC-LCD becomes more scalable to both the
training set size and the feature dimension. Example shows that KCRC is able to
perfectly classify data with certain distribution, while conventional CRC fails
completely. Comprehensive experiments on many public datasets also show that
KCRC-LCD is a robust discriminative classifier with both excellent performance
and good scalability, being comparable or outperforming many other
state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 09:40:20 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Liu",
"Weiyang",
""
],
[
"Yu",
"Zhiding",
""
],
[
"Lu",
"Lijia",
""
],
[
"Wen",
"Yandong",
""
],
[
"Li",
"Hui",
""
],
[
"Zou",
"Yuexian",
""
]
] |
new_dataset
| 0.996316 |
1410.4730
|
Junhui Hou
|
Junhui Hou and Lap-Pui Chau and Nadia Magnenat-Thalmann and Ying He
|
Human Motion Capture Data Tailored Transform Coding
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human motion capture (mocap) is a widely used technique for digitalizing
human movements. With growing usage, compressing mocap data has received
increasing attention, since compact data size enables efficient storage and
transmission. Our analysis shows that mocap data have some unique
characteristics that distinguish themselves from images and videos. Therefore,
directly borrowing image or video compression techniques, such as discrete
cosine transform, does not work well. In this paper, we propose a novel
mocap-tailored transform coding algorithm that takes advantage of these
features. Our algorithm segments the input mocap sequences into clips, which
are represented in 2D matrices. Then it computes a set of data-dependent
orthogonal bases to transform the matrices to frequency domain, in which the
transform coefficients have significantly less dependency. Finally, the
compression is obtained by entropy coding of the quantized coefficients and the
bases. Our method has low computational cost and can be easily extended to
compress mocap databases. It also requires neither training nor complicated
parameter setting. Experimental results demonstrate that the proposed scheme
significantly outperforms state-of-the-art algorithms in terms of compression
performance and speed.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 14:16:08 GMT"
}
] | 2014-10-20T00:00:00 |
[
[
"Hou",
"Junhui",
""
],
[
"Chau",
"Lap-Pui",
""
],
[
"Magnenat-Thalmann",
"Nadia",
""
],
[
"He",
"Ying",
""
]
] |
new_dataset
| 0.957698 |
1309.2402
|
Ke Xu
|
Rui Fan, Jichang Zhao, Yan Chen and Ke Xu
|
Anger is More Influential Than Joy: Sentiment Correlation in Weibo
| null |
PLoS ONE 9(10): e110184, 2014
|
10.1371/journal.pone.0110184
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent years have witnessed the tremendous growth of the online social media.
In China, Weibo, a Twitter-like service, has attracted more than 500 million
users in less than four years. Connected by online social ties, different users
influence each other emotionally. We find the correlation of anger among users
is significantly higher than that of joy, which indicates that angry emotion
could spread more quickly and broadly in the network. While the correlation of
sadness is surprisingly low and highly fluctuated. Moreover, there is a
stronger sentiment correlation between a pair of users if they share more
interactions. And users with larger number of friends posses more significant
sentiment influence to their neighborhoods. Our findings could provide insights
for modeling sentiment influence and propagation in online social networks.
|
[
{
"version": "v1",
"created": "Tue, 10 Sep 2013 07:59:02 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Fan",
"Rui",
""
],
[
"Zhao",
"Jichang",
""
],
[
"Chen",
"Yan",
""
],
[
"Xu",
"Ke",
""
]
] |
new_dataset
| 0.999159 |
1405.6671
|
Abuzer Yakaryilmaz
|
Viliam Geffert and Abuzer Yakaryilmaz
|
Classical automata on promise problems
|
21 pages, significantly improved with a correction (the single
sentence statement given just before Corollary 4 in the previous version and
(in the conference version) is not correct). A preliminary version appeared
in DCFS2014 [vol. 8614 of LNCS, pp. 126--137, Springer-Verlag, 2014]
| null | null | null |
cs.FL cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Promise problems were mainly studied in quantum automata theory. Here we
focus on state complexity of classical automata for promise problems. First, it
was known that there is a family of unary promise problems solvable by quantum
automata by using a single qubit, but the number of states required by
corresponding one-way deterministic automata cannot be bounded by a constant.
For this family, we show that even two-way nondeterminism does not help to save
a single state. By comparing this with the corresponding state complexity of
alternating machines, we then get a tight exponential gap between two-way
nondeterministic and one-way alternating automata solving unary promise
problems. Second, despite of the existing quadratic gap between Las Vegas
realtime probabilistic automata and one-way deterministic automata for language
recognition, we show that, by turning to promise problems, the tight gap
becomes exponential. Last, we show that the situation is different for one-way
probabilistic automata with two-sided bounded-error. We present a family of
unary promise problems that is very easy for these machines; solvable with only
two states, but the number of states in two-way alternating or any simpler
automata is not limited by a constant. Moreover, we show that one-way
bounded-error probabilistic automata can solve promise problems not solvable at
all by any other classical model.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2014 18:34:55 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Oct 2014 16:57:05 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Geffert",
"Viliam",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.995542 |
1410.4256
|
Aude Marzuoli
|
Aude Marzuoli, Emmanuel Boidot, Eric Feron, Paul B.C. van Erp, Alexis
Ucko, Alexandre Bayen, Mark Hansen
|
Anatomy of a Crash
| null | null | null | null |
cs.SY cs.MA physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transportation networks constitute a critical infrastructure enabling the
transfers of passengers and goods, with a significant impact on the economy at
different scales. Transportation modes, whether air, road or rail, are coupled
and interdependent. The frequent occurrence of perturbations on one or several
modes disrupts passengers' entire journeys, directly and through ripple
effects. The present paper provides a case report of the Asiana Crash in San
Francisco International Airport on July 6th 2013 and its repercussions on the
multimodal transportation network. It studies the resulting propagation of
disturbances on the transportation infrastructure in the United States. The
perturbation takes different forms and varies in scale and time frame :
cancellations and delays snowball in the airspace, highway traffic near the
airport is impacted by congestion in previously never congested locations, and
transit passenger demand exhibit unusual traffic peaks in between airports in
the Bay Area. This paper, through a case study, aims at stressing the
importance of further data-driven research on interdependent infrastructure
networks for increased resilience. The end goal is to form the basis for
optimization models behind providing more reliable passenger door-to-door
journeys.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 23:18:12 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Marzuoli",
"Aude",
""
],
[
"Boidot",
"Emmanuel",
""
],
[
"Feron",
"Eric",
""
],
[
"van Erp",
"Paul B. C.",
""
],
[
"Ucko",
"Alexis",
""
],
[
"Bayen",
"Alexandre",
""
],
[
"Hansen",
"Mark",
""
]
] |
new_dataset
| 0.997582 |
1410.4290
|
Peng Wang
|
Peng Wang, Yonghui Li, Lingyang Song, and Branka Vucetic
|
Multi-Gigabits Millimetre Wave Wireless Communications for 5G: From
Fixed Access to Cellular Networks
|
25 pages, 4 figures, 2 tables, to appear in IEEE Communications
Magazine
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the formidable growth of various booming wireless communication services
that require ever-increasing data throughputs, the conventional microwave band
below 10 GHz, which is currently used by almost all mobile communication
systems, is going to reach its saturation point within just a few years.
Therefore, the attention of radio system designers has been pushed towards
ever-higher segments of the frequency spectrum in a quest for capacity
increase. In this article, we investigate the feasibility, advantages and
challenges of future wireless communications over the E-band frequencies. We
start from a brief review of the history of E-band spectrum and its light
licensing policy as well as benefits/challenges. Then we introduce the
propagation characteristics of E-band signals, based on which some potential
fixed and mobile applications at the E-band are investigated. In particular, we
analyze the achievability of non-trivial multiplexing gain in fixed
point-to-point E-band links and propose an E-band mobile broadband (EMB) system
as a candidate for the next generation mobile communication networks. The
channelization and frame structure of the EMB system are discussed in details.
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 04:50:21 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Wang",
"Peng",
""
],
[
"Li",
"Yonghui",
""
],
[
"Song",
"Lingyang",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.997427 |
1410.4330
|
Petar Popovski
|
Petar Popovski
|
Ultra-Reliable Communication in 5G Wireless Systems
|
To be presented at the 1st International Conference on 5G for
Ubiquitous Connectivity
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless 5G systems will not only be "4G, but faster". One of the novel
features discussed in relation to 5G is Ultra-Reliable Communication (URC), an
operation mode not present in today's wireless systems. URC refers to provision
of certain level of communication service almost 100 % of the time. Example URC
applications include reliable cloud connectivity, critical connections for
industrial automation and reliable wireless coordination among vehicles. This
paper puts forward a systematic view on URC in 5G wireless systems. It starts
by analyzing the fundamental mechanisms that constitute a wireless connection
and concludes that one of the key steps towards enabling URC is revision of the
methods for encoding control information (metadata) and data. It introduces the
key concept of Reliable Service Composition, where a service is designed to
adapt its requirements to the level of reliability that can be attained. The
problem of URC is analyzed across two different dimensions. The first dimension
is the type of URC problem that is defined based on the time frame used to
measure the reliability of the packet transmission. Two types of URC problems
are identified: long-term URC (URC-L) and short-term URC (URC-S). The second
dimension is represented by the type of reliability impairment that can affect
the communication reliability in a given scenario. The main objective of this
paper is to create the context for defining and solving the new engineering
problems posed by URC in 5G.
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 08:26:42 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.970044 |
1410.4398
|
Biju Issac
|
B. Issac
|
Secure ARP and Secure DHCP Protocols to Mitigate Security Attacks
|
12 pages. available in Issac, B. (2009). Secure ARP and Secure DHCP
Protocols to Mitigate Security Attacks, International Journal of Network
Security (IJNS), ISSN 1816-353X (print), ISSN 1816-3548 (online), 8(1),
102-113
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For network computers to communicate to one another, they need to know one
another's IP address and MAC address. Address Resolution Protocol (ARP) is
developed to find the Ethernet address that map to a specific IP address. The
source computer broadcasts the request for Ethernet address and eventually the
target computer replies. The IP to Ethernet address mapping would later be
stored in an ARP Cache for some time duration, after which the process is
repeated. Since ARP is susceptible to ARP poisoning attacks, we propose to make
it unicast, centralized and secure, along with a secure design of DHCP protocol
to mitigate MAC spoofing. The secure protocol designs are explained in detail.
Lastly we also discuss some performance issues to show how the proposed
protocols work.
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 12:43:21 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Issac",
"B.",
""
]
] |
new_dataset
| 0.999372 |
1410.4507
|
Tobias Isenberg
|
Tobias Isenberg and Heike Wehrheim
|
Proof-Carrying Hardware via IC3
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Proof-carrying hardware (PCH) is an approach to achieving safety of
dynamically reconfigurable hardware, transferring the idea of proof-carrying
code to the hardware domain. Current PCH approaches are, however, either
limited to combinational and bounded unfoldings of sequential circuits, or only
provide semi-automatic proof generation. We propose a new approach to PCH which
employs IC3 as proof generator, making automatic PCH applicable to sequential
circuits in their full generality. We demonstrate feasibility of our approach
by showing that proof validation is several orders of magnitude faster than
original proof generation while (most often) generating smaller proofs than
current PCHs.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 12:38:49 GMT"
}
] | 2014-10-17T00:00:00 |
[
[
"Isenberg",
"Tobias",
""
],
[
"Wehrheim",
"Heike",
""
]
] |
new_dataset
| 0.994818 |
1310.7665
|
Madhav Jha
|
Madhav Jha, C. Seshadhri, Ali Pinar
|
Counting Triangles in Real-World Graph Streams: Dealing with Repeated
Edges and Time Windows
| null | null | null | null |
cs.DS cs.DM cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-world graphs often manifest as a massive temporal stream of edges. The
need for real-time analysis of such large graph streams has led to progress on
low memory, one-pass streaming graph algorithms. These algorithms were designed
for simple graphs, assuming an edge is not repeated in the stream. Real graph
streams however, are almost always multigraphs i.e., they contain many
duplicate edges. The assumption of no repeated edges requires an extra pass
*storing all the edges* just for deduplication, which defeats the purpose of
small memory algorithms.
We describe an algorithm for estimating the triangle count of a multigraph
stream of edges. We show that all previous streaming algorithms for triangle
counting fail for multigraph streams, despite their impressive accuracies for
simple graphs. The bias created by duplicate edges is a major problem, and
leads these algorithms astray. Our algorithm avoids these biases through
careful debiasing strategies and has provable theoretical guarantees and
excellent empirical performance. Our algorithm builds on the previously
introduced wedge sampling methodology.
Another challenge in analyzing temporal graphs is finding the right temporal
window size. Our algorithm seamlessly handles multiple time windows, and does
not require committing to any window size(s) a priori. We apply our algorithm
to discover fascinating transitivity and triangle trends in real-world graph
streams.
|
[
{
"version": "v1",
"created": "Tue, 29 Oct 2013 02:36:20 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Oct 2014 20:57:33 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Jha",
"Madhav",
""
],
[
"Seshadhri",
"C.",
""
],
[
"Pinar",
"Ali",
""
]
] |
new_dataset
| 0.99312 |
1405.0029
|
Namyoon Lee
|
Namyoon Lee and Robert W. Heath Jr
|
Space-Time Physical-Layer Network Coding
|
To appear in IEEE JSAC special issue on "Fundamental Approaches to
Network Coding in Wireless Communication Systems.""
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A space-time physical-layer network coding (ST- PNC) method is presented for
information exchange among multiple users over fully-connected multi-way relay
networks. The method involves two steps: i) side-information learning and ii)
space-time relay transmission. In the first step, different sets of users are
scheduled to send signals over networks and the remaining users and relays
overhear the transmitted signals, thereby learning the interference patterns.
In the second step, multiple relays cooperatively send out linear combinations
of signals received in the previous phase using space-time precoding so that
all users efficiently exploit their side-information in the form of: 1) what
they sent and 2) what they overheard in decoding. This coding concept is
illustrated through two simple network examples. It is shown that ST-PNC
improves the sum of degrees of freedom (sum-DoF) of the network compared to
existing interference management methods. With ST-PNC, the sum-DoF of a general
multi-way relay network without channel knowledge at the users is characterized
in terms of relevant system parameters, chiefly the number of users, the number
of relays, and the number of antennas at relays. A major implication of the
derived results is that efficiently harnessing both transmit- ted and overheard
signals as side-information brings significant performance improvements to
fully-connected multi-way relay networks.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 20:43:33 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Oct 2014 19:59:46 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Lee",
"Namyoon",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.997825 |
1410.3932
|
Mei Kuan Lim
|
Mei Kuan Lim, Chee Seng Chan, Dorothy Monekosso, Paolo Remagnino
|
Detection of Salient Regions in Crowded Scenes
|
Accepted in Electronics Letters Vol. 5, Issue 5
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increasing number of cameras and a handful of human operators to monitor
the video inputs from hundreds of cameras leave the system ill equipped to
fulfil the task of detecting anomalies. Thus, there is a dire need to
automatically detect regions that require immediate attention for a more
effective and proactive surveillance. We propose a framework that utilises the
temporal variations in the flow field of a crowd scene to automatically detect
salient regions, while eliminating the need to have prior knowledge of the
scene or training. We deem the flow fields to be a dynamic system and adopt the
stability theory of dynamical systems, to determine the motion dynamics within
a given area. In the context of this work, salient regions refer to areas with
high motion dynamics, where points in a particular region are unstable.
Experimental results on public, crowd scenes have shown the effectiveness of
the proposed method in detecting salient regions which correspond to unstable
flow, occlusions, bottlenecks, entries and exits.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 05:24:16 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Lim",
"Mei Kuan",
""
],
[
"Chan",
"Chee Seng",
""
],
[
"Monekosso",
"Dorothy",
""
],
[
"Remagnino",
"Paolo",
""
]
] |
new_dataset
| 0.980926 |
1410.3977
|
Ting-Yu Ho
|
Ting-Yu Ho, Yi-Nung Yeh, and De-Nian Yang
|
Multi-View 3D Video Multicast for Broadband IP Networks
|
9 pages, 10 figures, IEEE ICC 2015
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the recent emergence of 3D-supported TVs, video service providers now
face an opportunity to provide high resolution multi-view 3D videos over IP
networks. One simple way to support efficient communications between a video
server and multiple clients is to deliver each desired view in a multicast
stream. Nevertheless, it is expected that significantly increased bandwidth
will be required to support the transmission of all views in multi-view 3D
videos. However, the recent emergence of a new video synthesis technique called
Depth-Image-Based Rendering (DIBR) suggests that multi-view 3D video does not
necessarily require the transmission of all views. Therefore, we formulate a
new problem, named Multi-view and Multicast Delivery Selection Problem (MMDS),
and design an algorithm, called MMDEA, to find the optimal solution. Simulation
results manifest that using DIBR can effectively reduce bandwidth consumption
by 35% compared to the original multicast delivery scheme.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 09:09:10 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Ho",
"Ting-Yu",
""
],
[
"Yeh",
"Yi-Nung",
""
],
[
"Yang",
"De-Nian",
""
]
] |
new_dataset
| 0.983807 |
1410.4019
|
Subhadip Basu
|
Dipak Kumar Kole, Subhadip Basu
|
An Automated Group Key Authentication System Using Secret Image Sharing
Scheme
| null |
Proceedings of the International Conference on Recent trends in
Information Systems (IRIS-06), pp. 98-106, Kovilpatti, Tamil Nadu, India,
2006
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an open network environment, privacy of group communication and integrity
of the communication data are the two major issues related to secured
information exchange. The required level of security may be achieved by
authenticating a group key in the communication channel, where contribution
from each group member becomes a part of the overall group key. In the current
work, we have developed an authentication system through Central Administrative
Server (CAS) for automatic integration and validation of the group key. For
secured group communication, the CAS generates a secret alphanumeric group key
image. Using secret image sharing scheme, this group key image shares are
distributed among all the participating group members in the open network. Some
or all the secret shares may be merged to reconstruct the group key image at
CAS. A k-nearest neighbor classifier with 48 features to represent the images,
is used to validate the reconstructed image with the one stored in the CAS. 48
topological features are used to represent the reconstructed group key image.
We have achieved 99.1% classification accuracy for 26 printed English uppercase
characters and 10 numeric digits.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 11:38:21 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Kole",
"Dipak Kumar",
""
],
[
"Basu",
"Subhadip",
""
]
] |
new_dataset
| 0.988315 |
1410.4078
|
Bernhard Rumpe
|
Bernhard Rumpe, Christian Berger, Holger Krahn
|
Softwaretechnische Absicherung intelligenter Systeme im Fahrzeug
|
14 pages, 1 figure in German
|
Proceedings der 21. VDI/VW-Gemeinschaftstagung - Integrierte
Sicherheit und Fahrerassistenzsysteme. 12.-13. Oktober 2006, Wolfsburg
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"This article describes software engineering techniques to be used in order
to ensure the necessary quality of intelligent and therefore massive
software-based systems in vehicles. Quality assurance for intelligent software
is achieved through a bundle of modern software engineering methods.
Architecture and design patterns for securing the software components are
supplemented by test concepts and frameworks for validation and checks of
robustness of the implementation. These patterns describe established and
therefore consolidated solutions for certain problems as for instance
reliability or efficient execution.
--
Dieser Artikel skizziert, welche Software-Entwurfstechniken heute zum Einsatz
kommen k\"onnen, um intelligente, Software-lastige Systeme im Fahrzeug
abzusichern. Dabei spielt zun\"achst das Qualit\"atsmanagement durch
Software-technische Ma{\ss}nahmen eine zentrale Rolle. Architektur- und
Entwurfmuster f\"ur die Software-technische Absicherung von Komponenten werden
erg\"anzt um Test-Konzepte zur Validierung von Spezifikationen und der
Robustheit der Implementierung. Architekturen und Entwurfs-Muster beschreiben
erprobte und damit konsolidierte L\"osungen f\"ur bestimmte Problemklassen wie
etwa Zuverl\"assigkeit oder effiziente Ausf\"uhrung.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 14:48:52 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Rumpe",
"Bernhard",
""
],
[
"Berger",
"Christian",
""
],
[
"Krahn",
"Holger",
""
]
] |
new_dataset
| 0.995494 |
1410.4085
|
Alessandro De Luca
|
Aldo de Luca and Alessandro De Luca
|
Sturmian words and the Stern sequence
|
35 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Central, standard, and Christoffel words are three strongly interrelated
classes of binary finite words which represent a finite counterpart of
characteristic Sturmian words. A natural arithmetization of the theory is
obtained by representing central and Christoffel words by irreducible fractions
labeling respectively two binary trees, the Raney (or Calkin-Wilf) tree and the
Stern-Brocot tree. The sequence of denominators of the fractions in Raney's
tree is the famous Stern diatomic numerical sequence. An interpretation of the
terms $s(n)$ of Stern's sequence as lengths of Christoffel words when $n$ is
odd, and as minimal periods of central words when $n$ is even, allows one to
interpret several results on Christoffel and central words in terms of Stern's
sequence and, conversely, to obtain a new insight in the combinatorics of
Christoffel and central words by using properties of Stern's sequence. One of
our main results is a non-commutative version of the "alternating bit sets
theorem" by Calkin and Wilf. We also study the length distribution of
Christoffel words corresponding to nodes of equal height in the tree, obtaining
some interesting bounds and inequalities.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 14:57:10 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"de Luca",
"Aldo",
""
],
[
"De Luca",
"Alessandro",
""
]
] |
new_dataset
| 0.998031 |
1410.4141
|
Shadman Sakib
|
Shadman Sakib, Rakibul Haq and Tariq Wazed
|
Unified mobile public health care system (UMPHCS) for underdeveloped
countries
|
6 pages, 8 figures, 3 tables. Published in the proceedings of 3rd
International Conference on Informatics, Electronics & Vision, Dhaka,
Bangladesh. Available in IEEExplore.
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6850801&url=http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6850801
|
Proceedings of 3rd International Conference on Informatics,
Electronics & Vision-2014, Dhaka, Bangladesh. Published in IEEExplore
|
10.1109/ICIEV.2014.6850801
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we have proposed a new smartphone based system for health
care, monitoring and diagnosis, which is specially designed to efficiently
increase the public health care system in the distant, rural, unreached areas
of the underdeveloped and developing countries. In this all-in-one system, we
have digitized the health monitoring and diagnostic devices in a way so that
each device works as a minimum `plug and play' sensor module of the total
system, reducing the cost radically. Besides, the easy-to-use smartphone
application for operating the whole system reduces the necessity of skilled and
trained manpower, making it a perfect toolbox for the government health workers
in the unreached rural areas.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2014 17:17:14 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Sakib",
"Shadman",
""
],
[
"Haq",
"Rakibul",
""
],
[
"Wazed",
"Tariq",
""
]
] |
new_dataset
| 0.993419 |
1410.4147
|
Belal Amro
|
Belal Amro
|
Mobile Agent Systems, Recent Security Threats and Counter Measures
|
international journal of computer science issues, march 2014
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile agent technology offers a dramatically evolving computing paradigm in
which a program, in the form of a software agent, can suspend its execution on
a host computer, transfers itself to another agent-enabled host on the network,
and resumes execution on the new host. It is 1960's since mobile code has been
used in the form of remote job entry systems. Today's mobile agents can be
characterized in a number of ways ranging from simple distributed objects to
highly organized intelligent softwares. As a result of this rapid evolvement of
mobile agents, plenty of critical security issues has risen and plenty of work
is being done to address these problems. The aim is to provide trusted mobile
agent systems that can be easily deployed and widely adopted. In this paper, we
provide an overview of the most recent threats facing the designers of agent
platforms and the developers of agent-based applications. The paper also
identifies security objectives, and measures for countering the identified
threats and fulfilling those security objectives.
|
[
{
"version": "v1",
"created": "Mon, 6 Oct 2014 19:35:22 GMT"
}
] | 2014-10-16T00:00:00 |
[
[
"Amro",
"Belal",
""
]
] |
new_dataset
| 0.999242 |
1410.3628
|
Jan Vr\v{s}ek
|
Jan Vr\v{s}ek and Miroslav L\'avi\v{c}ka
|
Recognizing implicitly given rational canal surfaces
|
10 pages, 1 figure
| null | null | null |
cs.SC math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is still a challenging task of today to recognize the type of a given
algebraic surface which is described only by its implicit representation.
In~this paper we will investigate in more detail the case of canal surfaces
that are often used in geometric modelling, Computer-Aided Design and technical
practice (e.g. as blending surfaces smoothly joining two parts with circular
ends). It is known that if the squared medial axis transform is a rational
curve then so is also the corresponding surface. However, starting from a
polynomial it is not known how to decide if the corresponding algebraic surface
is rational canal surface or not. Our goal is to formulate a simple and
efficient algorithm whose input is a~polynomial with the coefficients from some
subfield of real numbers and the output is the answer whether the surface is a
rational canal surface. In the affirmative case we also compute a rational
parameterization of the squared medial axis transform which can be then used
for finding a rational parameterization of the implicitly given canal surface.
|
[
{
"version": "v1",
"created": "Tue, 14 Oct 2014 09:46:44 GMT"
}
] | 2014-10-15T00:00:00 |
[
[
"Vršek",
"Jan",
""
],
[
"Lávička",
"Miroslav",
""
]
] |
new_dataset
| 0.9985 |
1410.3710
|
Jisun An
|
Haewoon Kwak and Jisun An
|
Understanding News Geography and Major Determinants of Global News
Coverage of Disasters
|
Presented at Computation+Jounalism Symposium (C+J Symposium) 2014
| null | null | null |
cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we reveal the structure of global news coverage of disasters
and its determinants by using a large-scale news coverage dataset collected by
the GDELT (Global Data on Events, Location, and Tone) project that monitors
news media in over 100 languages from the whole world. Significant variables in
our hierarchical (mixed-effect) regression model, such as the number of
population, the political stability, the damage, and more, are well aligned
with a series of previous research. Yet, strong regionalism we found in news
geography highlights the necessity of the comprehensive dataset for the study
of global news coverage.
|
[
{
"version": "v1",
"created": "Tue, 14 Oct 2014 14:36:29 GMT"
}
] | 2014-10-15T00:00:00 |
[
[
"Kwak",
"Haewoon",
""
],
[
"An",
"Jisun",
""
]
] |
new_dataset
| 0.996693 |
1410.3735
|
Adam Petcher
|
Adam Petcher and Greg Morrisett
|
The Foundational Cryptography Framework
| null | null | null | null |
cs.PL cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Foundational Cryptography Framework (FCF) for developing and
checking complete proofs of security for cryptographic schemes within a proof
assistant. This is a general-purpose framework that is capable of modeling and
reasoning about a wide range of cryptographic schemes, security definitions,
and assumptions. Security is proven in the computational model, and the proof
provides concrete bounds as well as asymptotic conclusions. FCF provides a
language for probabilistic programs, a theory that is used to reason about
programs, and a library of tactics and definitions that are useful in proofs
about cryptography. The framework is designed to leverage fully the existing
theory and capabilities of the Coq proof assistant in order to reduce the
effort required to develop proofs.
|
[
{
"version": "v1",
"created": "Tue, 14 Oct 2014 15:34:39 GMT"
}
] | 2014-10-15T00:00:00 |
[
[
"Petcher",
"Adam",
""
],
[
"Morrisett",
"Greg",
""
]
] |
new_dataset
| 0.998018 |
1410.3791
|
Rami Al-Rfou
|
Rami Al-Rfou, Vivek Kulkarni, Bryan Perozzi, Steven Skiena
|
POLYGLOT-NER: Massive Multilingual Named Entity Recognition
|
9 pages, 4 figures, 5 tables
| null | null | null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increasing diversity of languages used on the web introduces a new level
of complexity to Information Retrieval (IR) systems. We can no longer assume
that textual content is written in one language or even the same language
family. In this paper, we demonstrate how to build massive multilingual
annotators with minimal human expertise and intervention. We describe a system
that builds Named Entity Recognition (NER) annotators for 40 major languages
using Wikipedia and Freebase. Our approach does not require NER human annotated
datasets or language specific resources like treebanks, parallel corpora, and
orthographic rules. The novelty of approach lies therein - using only language
agnostic techniques, while achieving competitive performance.
Our method learns distributed word representations (word embeddings) which
encode semantic and syntactic features of words in each language. Then, we
automatically generate datasets from Wikipedia link structure and Freebase
attributes. Finally, we apply two preprocessing stages (oversampling and exact
surface form matching) which do not require any linguistic expertise.
Our evaluation is two fold: First, we demonstrate the system performance on
human annotated datasets. Second, for languages where no gold-standard
benchmarks are available, we propose a new method, distant evaluation, based on
statistical machine translation.
|
[
{
"version": "v1",
"created": "Tue, 14 Oct 2014 18:37:32 GMT"
}
] | 2014-10-15T00:00:00 |
[
[
"Al-Rfou",
"Rami",
""
],
[
"Kulkarni",
"Vivek",
""
],
[
"Perozzi",
"Bryan",
""
],
[
"Skiena",
"Steven",
""
]
] |
new_dataset
| 0.989972 |
1410.3812
|
Yi-Peng Wei
|
Yi-Peng Wei and Sennur Ulukus
|
Polar Coding for the General Wiretap Channel
|
Submitted to IEEE ITW 2015
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information-theoretic work for wiretap channels is mostly based on random
coding schemes. Designing practical coding schemes to achieve
information-theoretic security is an important problem. By applying the two
recently developed techniques for polar codes, we propose a polar coding scheme
to achieve the secrecy capacity of the general wiretap channel.
|
[
{
"version": "v1",
"created": "Tue, 14 Oct 2014 19:41:48 GMT"
}
] | 2014-10-15T00:00:00 |
[
[
"Wei",
"Yi-Peng",
""
],
[
"Ulukus",
"Sennur",
""
]
] |
new_dataset
| 0.998938 |
1405.5410
|
Kato Mivule
|
Kato Mivule
|
A Codon Frequency Obfuscation Heuristic for Raw Genomic Data Privacy
|
8 Pages, 15 Figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Genomic data provides clinical researchers with vast opportunities to study
various patient ailments. Yet the same data contains revealing information,
some of which a patient might want to remain concealed. The question then
arises: how can an entity transact in full DNA data while concealing certain
sensitive pieces of information in the genome sequence, and maintain DNA data
utility? As a response to this question, we propose a codon frequency
obfuscation heuristic, in which a redistribution of codon frequency values with
highly expressed genes is done in the same amino acid group, generating an
obfuscated DNA sequence. Our preliminary results show that it might be possible
to publish an obfuscated DNA sequence with a desired level of similarity
(utility) to the original DNA sequence.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 13:25:34 GMT"
},
{
"version": "v2",
"created": "Sun, 12 Oct 2014 18:54:40 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Mivule",
"Kato",
""
]
] |
new_dataset
| 0.981238 |
1406.2076
|
Hieu Nguyen
|
Hieu D. Nguyen and Greg E. Coxson
|
Doppler Tolerance, Complementary Code Sets and the Generalized
Thue-Morse Sequence
|
12 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We generalize the construction of Doppler-tolerant Golay complementary
waveforms by Pezeshki-Calderbank-Moran-Howard to complementary code sets having
more than two codes. This is accomplished by exploiting number-theoretic
results involving the sum-of-digits function, equal sums of like powers, and a
generalization to more than two symbols of the classical two-symbol
Prouhet-Thue-Morse sequence.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 04:36:09 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Aug 2014 14:51:33 GMT"
},
{
"version": "v3",
"created": "Sat, 11 Oct 2014 02:55:49 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Nguyen",
"Hieu D.",
""
],
[
"Coxson",
"Greg E.",
""
]
] |
new_dataset
| 0.999098 |
1409.7092
|
Mo Dong
|
Mo Dong and Qingxi Li and Doron Zarchy and Brighten Godfrey and
Michael Schapira
|
PCC: Re-architecting Congestion Control for Consistent High Performance
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TCP and its variants have suffered from surprisingly poor performance for
decades. We argue the TCP family has little hope to achieve consistent high
performance due to a fundamental architectural deficiency: hardwiring
packet-level events to control responses without understanding the real
performance result of its actions. We propose Performance-oriented Congestion
Control (PCC), a new congestion control architecture in which each sender
continuously observes the connection between its actions and empirically
experienced performance, enabling it to consistently adopt actions that result
in high performance. We prove that PCC converges to a stable and fair
equilibrium. Across many real-world and challenging environments, PCC shows
consistent and often 10x performance improvement, with better fairness and
stability than TCP. PCC requires no router hardware support or new packet
format.
|
[
{
"version": "v1",
"created": "Wed, 24 Sep 2014 20:43:01 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Sep 2014 18:08:14 GMT"
},
{
"version": "v3",
"created": "Sat, 11 Oct 2014 02:24:24 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Dong",
"Mo",
""
],
[
"Li",
"Qingxi",
""
],
[
"Zarchy",
"Doron",
""
],
[
"Godfrey",
"Brighten",
""
],
[
"Schapira",
"Michael",
""
]
] |
new_dataset
| 0.97786 |
1409.7489
|
Jisun An
|
Jisun An, Daniele Quercia, Jon Crowcroft
|
Recommending Investors for Crowdfunding Projects
|
Published in Proc. of WWW 2014
| null | null | null |
cs.SI cs.CY cs.HC physics.soc-ph stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To bring their innovative ideas to market, those embarking in new ventures
have to raise money, and, to do so, they have often resorted to banks and
venture capitalists. Nowadays, they have an additional option: that of
crowdfunding. The name refers to the idea that funds come from a network of
people on the Internet who are passionate about supporting others' projects.
One of the most popular crowdfunding sites is Kickstarter. In it, creators post
descriptions of their projects and advertise them on social media sites (mainly
Twitter), while investors look for projects to support. The most common reason
for project failure is the inability of founders to connect with a sufficient
number of investors, and that is mainly because hitherto there has not been any
automatic way of matching creators and investors. We thus set out to propose
different ways of recommending investors found on Twitter for specific
Kickstarter projects. We do so by conducting hypothesis-driven analyses of
pledging behavior and translate the corresponding findings into different
recommendation strategies. The best strategy achieves, on average, 84% of
accuracy in predicting a list of potential investors' Twitter accounts for any
given project. Our findings also produced key insights about the whys and
wherefores of investors deciding to support innovative efforts.
|
[
{
"version": "v1",
"created": "Fri, 26 Sep 2014 07:57:28 GMT"
},
{
"version": "v2",
"created": "Sun, 12 Oct 2014 11:23:36 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"An",
"Jisun",
""
],
[
"Quercia",
"Daniele",
""
],
[
"Crowcroft",
"Jon",
""
]
] |
new_dataset
| 0.983546 |
1410.2889
|
Omar Rafique
|
Omar Rafique
|
Area Versus Speed Trade-off Analysis of a WiMAX Deinterleaver Circuit
Design
|
four pages, two figures and six tables
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trade-off is one of the main design parameters in the field of electronic
circuit design. Whereas smaller electronics devices which use less hardware due
to techniques like hardware multiplexing or due to smaller devices created due
to techniques developed by nanotechnology and MEMS, are more appealing, a
trade-off between area, power and speed is inevitable. This paper analyses the
trade-off in the design of WiMAX deinterleaver. The main aim is to reduce the
hardware utilization in a deinterleaver but speed and power consumption are
important parameters which cannot be overlooked.
|
[
{
"version": "v1",
"created": "Fri, 10 Oct 2014 06:14:09 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Rafique",
"Omar",
""
]
] |
new_dataset
| 0.960563 |
1410.2910
|
Daoud Clarke
|
Daoud Clarke
|
Riesz Logic
| null | null | null | null |
cs.LO cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Riesz Logic, whose models are abelian lattice ordered groups,
which generalise Riesz spaces (vector lattices), and show soundness and
completeness. Our motivation is to provide a logic for distributional semantics
of natural language, where words are typically represented as elements of a
vector space whose dimensions correspond to contexts in which words may occur.
This basis provides a lattice ordering on the space, and this ordering may be
interpreted as "distributional entailment". Several axioms of Riesz Logic are
familiar from Basic Fuzzy Logic, and we show how the models of these two logics
may be related; Riesz Logic may thus be considered a new fuzzy logic. In
addition to applications in natural language processing, there is potential for
applying the theory to neuro-fuzzy systems.
|
[
{
"version": "v1",
"created": "Fri, 10 Oct 2014 21:14:02 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Clarke",
"Daoud",
""
]
] |
new_dataset
| 0.999365 |
1410.3013
|
Mustafa Kocak
|
Mustafa Anil Kocak, Elza Erkip
|
Communicating Lists Over a Noisy Channel
|
Submitted to 52nd Annual Allerton Conference on Communication,
Control, and Computing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work considers a communication scenario where the transmitter chooses a
list of size K from a total of M messages to send over a noisy communication
channel, the receiver generates a list of size L and communication is
considered successful if the intersection of the lists at two terminals has
cardinality greater than a threshold T. In traditional communication systems
K=L=T=1. The fundamental limits of this setup in terms of K, L, T and the
Shannon capacity of the channel between the terminals are examined.
Specifically, necessary and/or sufficient conditions for asymptotically error
free communication are provided.
|
[
{
"version": "v1",
"created": "Sat, 11 Oct 2014 17:18:32 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Kocak",
"Mustafa Anil",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.983771 |
1410.3334
|
Nick Bassiliades
|
Kalliopi Kravari, Nick Bassiliades
|
DISARM: A Social Distributed Agent Reputation Model based on Defeasible
Logic
|
Paper under review. Keywords: Semantic Web, Intelligent Multi-agent
Systems, Agent Reputation, Defeasible Reasoning
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent Agents act in open and thus risky environments, hence making the
appropriate decision about who to trust in order to interact with, could be a
challenging process. As intelligent agents are gradually enriched with Semantic
Web technology, acting on behalf of their users with limited or no human
intervention, their ability to perform assigned tasks is scrutinized. Hence,
trust and reputation models, based on interaction trust or witness reputation,
have been proposed, yet they often presuppose the use of a centralized
authority. Although such mechanisms are more popular, they are usually faced
with skepticism, since users may question the trustworthiness and the
robustness of a central authority. Distributed models, on the other hand, are
more complex but they provide personalized estimations based on each agent's
interests and preferences. To this end, this article proposes DISARM, a novel
distributed reputation model. DISARM deals MASs as social networks, enabling
agents to establish and maintain relationships, limiting the disadvantages of
the common distributed approaches. Additionally, it is based on defeasible
logic, modeling the way intelligent agents, like humans, draw reasonable
conclusions from incomplete and possibly conflicting (thus inconclusive)
information. Finally, we provide an evaluation that illustrates the usability
of the proposed model.
|
[
{
"version": "v1",
"created": "Mon, 13 Oct 2014 14:56:03 GMT"
}
] | 2014-10-14T00:00:00 |
[
[
"Kravari",
"Kalliopi",
""
],
[
"Bassiliades",
"Nick",
""
]
] |
new_dataset
| 0.994779 |
1410.2075
|
Oliver Schaudt
|
Van Bang Le and Andrea Oversberg and Oliver Schaudt
|
Squares of $3$-sun-free split graphs
| null | null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting
an edge between two distinct vertices whenever their distance is two. Then $G$
is called a square root of $G^2$. Deciding whether a given graph has a square
root is known to be NP-complete, even if the root is required to be a split
graph, that is, a graph in which the vertex set can be partitioned into a
stable set and a clique.
We give a wide range of polynomial time solvable cases for the problem of
recognizing if a given graph is the square of some special kind of split graph.
To the best of our knowledge, our result properly contains all previously known
such cases. Our polynomial time algorithms are build on a structural
investigation of graphs that admit a split square root that is 3-sun-free, and
may pave the way toward a dichotomy theorem for recognizing squares of
(3-sun-free) split graphs.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2014 12:05:59 GMT"
}
] | 2014-10-13T00:00:00 |
[
[
"Le",
"Van Bang",
""
],
[
"Oversberg",
"Andrea",
""
],
[
"Schaudt",
"Oliver",
""
]
] |
new_dataset
| 0.997525 |
1410.2757
|
Shenghao Yang
|
Shenghao Yang, Soung Chang Liew, Lizhao You and Yi Chen
|
Linearly-Coupled Fountain Codes
|
37 pages, submitted for journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network-coded multiple access (NCMA) is a communication scheme for wireless
multiple-access networks where physical-layer network coding (PNC) is employed.
In NCMA, a user encodes and spreads its message into multiple packets. Time is
slotted and multiple users transmit packets (one packet each) simultaneously in
each timeslot. A sink node aims to decode the messages of all the users from
the sequence of receptions over successive timeslots. For each timeslot, the
NCMA receiver recovers multiple linear combinations of the packets transmitted
in that timeslot, forming a system of linear equations. Different systems of
linear equations are recovered in different timeslots. A message decoder then
recovers the original messages of all the users by jointly solving multiple
systems of linear equations obtained over different timeslots. We propose a
low-complexity digital fountain approach for this coding problem, where each
source node encodes its message into a sequence of packets using a fountain
code. The aforementioned systems of linear equations recovered by the NCMA
receiver effectively couple these fountain codes together. We refer to the
coupling of the fountain codes as a linearly-coupled (LC) fountain code. The
ordinary belief propagation (BP) decoding algorithm for conventional fountain
codes is not optimal for LC fountain codes. We propose a batched BP decoding
algorithm and analyze the convergence of the algorithm for general LC fountain
codes. We demonstrate how to optimize the degree distributions and show by
numerical results that the achievable rate region is nearly optimal. Our
approach significantly reduces the decoding complexity compared with the
previous NCMA schemes based on Reed-Solomon codes and random linear codes, and
hence has the potential to increase throughput and decrease delay in
computation-limited NCMA systems.
|
[
{
"version": "v1",
"created": "Fri, 10 Oct 2014 12:12:28 GMT"
}
] | 2014-10-13T00:00:00 |
[
[
"Yang",
"Shenghao",
""
],
[
"Liew",
"Soung Chang",
""
],
[
"You",
"Lizhao",
""
],
[
"Chen",
"Yi",
""
]
] |
new_dataset
| 0.998978 |
1410.2381
|
Mohamed Sayedelahl Dr
|
R. M. Farouk, S. Badr and M. Sayed Elahl
|
Recognition of cDNA microarray image Using Feedforward artificial neural
network
|
17 pages, 7 figures and 23 References
|
International Journal of Artificial Intelligence & Applications
(IJAIA), Vol. 5, No. 5, September 2014
| null | null |
cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The complementary DNA (cDNA) sequence is considered to be the magic biometric
technique for personal identification. In this paper, we present a new method
for cDNA recognition based on the artificial neural network (ANN). Microarray
imaging is used for the concurrent identification of thousands of genes. We
have segmented the location of the spots in a cDNA microarray. Thus, a precise
localization and segmenting of a spot are essential to obtain a more accurate
intensity measurement, leading to a more precise expression measurement of a
gene. The segmented cDNA microarray image is resized and it is used as an input
for the proposed artificial neural network. For matching and recognition, we
have trained the artificial neural network. Recognition results are given for
the galleries of cDNA sequences . The numerical results show that, the proposed
matching technique is an effective in the cDNA sequences process. We also
compare our results with previous results and find out that, the proposed
technique is an effective matching performance.
|
[
{
"version": "v1",
"created": "Thu, 9 Oct 2014 08:37:21 GMT"
}
] | 2014-10-10T00:00:00 |
[
[
"Farouk",
"R. M.",
""
],
[
"Badr",
"S.",
""
],
[
"Elahl",
"M. Sayed",
""
]
] |
new_dataset
| 0.998076 |
1410.1735
|
Joshua Davis
|
Joshua Davis
|
A Covert Channel Based on Web Read-time Modulation
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A network covert channel is created that operates by modulating the time
between web resource accesses, with an 'average web user' read-time used as a
reference. While the covert channel may be classified as timing based, it does
not operate by changing deterministic protocol attributes such as inter-packet
delay, as do most timing based network covert channels. Instead, our channel
communicates by modulating transaction level read-time, which in the web
browsing case has significant non-deterministic components. The channel is thus
immune to methods typically used to detect timing based network covert
channels.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 14:03:41 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Oct 2014 08:33:31 GMT"
}
] | 2014-10-09T00:00:00 |
[
[
"Davis",
"Joshua",
""
]
] |
new_dataset
| 0.993752 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.