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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1401.5848
|
Christer B\"ackstr\"om
|
Christer B\"ackstr\"om, Peter Jonsson
|
Algorithms and Limits for Compact Plan Representations
| null |
Journal Of Artificial Intelligence Research, Volume 44, pages
141-177, 2012
|
10.1613/jair.3534
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compact representations of objects is a common concept in computer science.
Automated planning can be viewed as a case of this concept: a planning instance
is a compact implicit representation of a graph and the problem is to find a
path (a plan) in this graph. While the graphs themselves are represented
compactly as planning instances, the paths are usually represented explicitly
as sequences of actions. Some cases are known where the plans always have
compact representations, for example, using macros. We show that these results
do not extend to the general case, by proving a number of bounds for compact
representations of plans under various criteria, like efficient sequential or
random access of actions. In addition to this, we show that our results have
consequences for what can be gained from reformulating planning into some other
problem. As a contrast to this we also prove a number of positive results,
demonstrating restricted cases where plans do have useful compact
representations, as well as proving that macro plans have favourable access
properties. Our results are finally discussed in relation to other relevant
contexts.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 02:41:51 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Bäckström",
"Christer",
""
],
[
"Jonsson",
"Peter",
""
]
] |
new_dataset
| 0.999384 |
1401.6015
|
Parisa Jalili Marandi
|
Parisa Jalili Marandi, Marco Primi, Nicolas Schiper, Fernando Pedone
|
Ring Paxos: High-Throughput Atomic Broadcast
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Atomic broadcast is an important communication primitive often used to
implement state-machine replication. Despite the large number of atomic
broadcast algorithms proposed in the literature, few papers have discussed how
to turn these algorithms into efficient executable protocols. This paper
focuses on a class of atomic broadcast algorithms based on Paxos, with its
corresponding desirable properties: safety under asynchrony assumptions,
liveness under weak synchrony assumptions, and resiliency-optimality. The paper
presents two protocols, M-Ring Paxos and U-Ring Paxos, derived from Paxos. The
protocols inherit the properties of Paxos and can be implemented very
efficiently. We report a detailed performance analysis of M-Ring Paxos and
U-Ring Paxos and compare them to other atomic broadcast protocols.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 15:49:17 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Marandi",
"Parisa Jalili",
""
],
[
"Primi",
"Marco",
""
],
[
"Schiper",
"Nicolas",
""
],
[
"Pedone",
"Fernando",
""
]
] |
new_dataset
| 0.999599 |
1401.6049
|
Richard Hoshino
|
Richard Hoshino, Ken-ichi Kawarabayashi
|
Generating Approximate Solutions to the TTP using a Linear Distance
Relaxation
| null |
Journal Of Artificial Intelligence Research, Volume 45, pages
257-286, 2012
|
10.1613/jair.3713
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In some domestic professional sports leagues, the home stadiums are located
in cities connected by a common train line running in one direction. For these
instances, we can incorporate this geographical information to determine
optimal or nearly-optimal solutions to the n-team Traveling Tournament Problem
(TTP), an NP-hard sports scheduling problem whose solution is a double
round-robin tournament schedule that minimizes the sum total of distances
traveled by all n teams. We introduce the Linear Distance Traveling Tournament
Problem (LD-TTP), and solve it for n=4 and n=6, generating the complete set of
possible solutions through elementary combinatorial techniques. For larger n,
we propose a novel "expander construction" that generates an approximate
solution to the LD-TTP. For n congruent to 4 modulo 6, we show that our
expander construction produces a feasible double round-robin tournament
schedule whose total distance is guaranteed to be no worse than 4/3 times the
optimal solution, regardless of where the n teams are located. This
4/3-approximation for the LD-TTP is stronger than the currently best-known
ratio of 5/3 + epsilon for the general TTP. We conclude the paper by applying
this linear distance relaxation to general (non-linear) n-team TTP instances,
where we develop fast approximate solutions by simply "assuming" the n teams
lie on a straight line and solving the modified problem. We show that this
technique surprisingly generates the distance-optimal tournament on all
benchmark sets on 6 teams, as well as close-to-optimal schedules for larger n,
even when the teams are located around a circle or positioned in
three-dimensional space.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 16:45:07 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Hoshino",
"Richard",
""
],
[
"Kawarabayashi",
"Ken-ichi",
""
]
] |
new_dataset
| 0.995561 |
1401.6102
|
Fernando Almeida Dr.
|
Fernando Almeida, Jos\'e D. Santos, Jos\'e A. Monteiro
|
e-commerce business models in the context of web3.0 paradigm
|
12 pages, International Journal of Advanced Information Technology
(IJAIT) Vol. 3, No. 6, December 2013
| null |
10.5121/ijait.2013.3601
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web 3.0 promises to have a significant effect in users and businesses. It
will change how people work and play, how companies use information to market
and sell their products, as well as operate their businesses. The basic shift
occurring in Web 3.0 is from information-centric to knowledge-centric patterns
of computing. Web 3.0 will enable people and machines to connect, evolve, share
and use knowledge on an unprecedented scale and in new ways that make our
experience of the Internet better. Additionally, semantic technologies have the
potential to drive significant improvements in capabilities and life cycle
economics through cost reductions, improved efficiencies, enhanced
effectiveness, and new functionalities that were not possible or economically
feasible before. In this paper we look to the semantic web and Web 3.0
technologies as enablers for the creation of value and appearance of new
business models. For that, we analyze the role and impact of Web 3.0 in
business and we identify nine potential business models, based in direct and
undirected revenue sources, which have emerged with the appearance of semantic
web technologies.
|
[
{
"version": "v1",
"created": "Thu, 9 Jan 2014 15:12:19 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Almeida",
"Fernando",
""
],
[
"Santos",
"José D.",
""
],
[
"Monteiro",
"José A.",
""
]
] |
new_dataset
| 0.999652 |
1401.6121
|
Chandra Sekhar Mr
|
Vorugunti Chandra Sekhar, Mrudula Sarvabhatla
|
A Robust Password-Based Multi-Server Authentication Scheme
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2013, Tsai et al. cryptanalyzed Yeh et al. scheme and shown that Yeh et
al., scheme is vulnerable to various cryptographic attacks and proposed an
improved scheme. In this poster we will show that Tsai et al., scheme is also
vulnerable to undetectable online password guessing attack, on success of the
attack, the adversary can perform all major cryptographic attacks. As apart of
our contribution, we have proposed an improved scheme which overcomes the
defects in Tsai et al. and Yeh et al. schemes.
|
[
{
"version": "v1",
"created": "Sat, 7 Dec 2013 03:48:11 GMT"
}
] | 2014-01-24T00:00:00 |
[
[
"Sekhar",
"Vorugunti Chandra",
""
],
[
"Sarvabhatla",
"Mrudula",
""
]
] |
new_dataset
| 0.998006 |
1312.4863
|
Ariel Gabizon
|
Hasan Abasi and Nader H. Bshouty and Ariel Gabizon and Elad Haramaty
|
On $r$-Simple $k$-Path
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes
through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a
graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We
first show that this problem is NP-Complete. We then show that there is a graph
$G$ that contains an $r$-simple $k$-path and no simple path of length greater
than $4\log k/\log r$. So this, in a sense, motivates this problem especially
when one's goal is to find a short path that visits many vertices in the graph
while bounding the number of visits at each vertex.
We then give a randomized algorithm that runs in time $$\mathrm{poly}(n)\cdot
2^{O( k\cdot \log r/r)}$$ that solves the $r$-SIMPLE $k$-PATH on a graph with
$n$ vertices with one-sided error. We also show that a randomized algorithm
with running time $\mathrm{poly}(n)\cdot 2^{(c/2)k/ r}$ with $c<1$ gives a
randomized algorithm with running time $\poly(n)\cdot 2^{cn}$ for the
Hamiltonian path problem in a directed graph - an outstanding open problem. So
in a sense our algorithm is optimal up to an $O(\log r)$ factor.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 17:08:27 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jan 2014 15:51:18 GMT"
}
] | 2014-01-23T00:00:00 |
[
[
"Abasi",
"Hasan",
""
],
[
"Bshouty",
"Nader H.",
""
],
[
"Gabizon",
"Ariel",
""
],
[
"Haramaty",
"Elad",
""
]
] |
new_dataset
| 0.983694 |
1401.3936
|
Adnan Anwar
|
Adnan Anwar, Abdun Naser Mahmood
|
Cyber Security of Smart Grid Infrastructure
|
The State of the Art in Intrusion Prevention and Detection, CRC
Press, Taylor & Francis Group, USA, January 2014
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart grid security is crucial to maintain stable and reliable power system
operation during the contingency situation due to the failure of any critical
power system component. Ensuring a secured smart grid involves with a less
possibility of power grid collapse or equipment malfunction. Due to lack of the
proper security measures, a major blackout may occur which can even lead to a
cascading failure. Therefore, to protect this critical power system
infrastructure and to ensure a reliable and an uninterrupted power supply to
the end users, smart grid security issues must be addressed with high priority.
In a smart grid environment, electric power infrastructure is modernized by
incorporating the current and future requirements and advanced functionalities
to its consumers. To make the smart grid happen, cyber system is integrated
with the physical power system. Although adoption of cyber system has made the
grid more energy efficient and modernized, it has introduced cyber-attack
issues which are critical for national infrastructure security and customer
satisfaction. Due to the cyber-attack, power grid may face operational failures
and loss of synchronization. This operational failure may damage critical power
system components which may interrupt the power supply and make the system
unstable resulting high financial penalties. In this chapter, some recent cyber
attack related incidents into a smart grid environment are discussed. The
requirements and the state of the art of cyber security issues of a critical
power system infrastructure are illustrated elaborately.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 08:53:28 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jan 2014 05:00:21 GMT"
}
] | 2014-01-23T00:00:00 |
[
[
"Anwar",
"Adnan",
""
],
[
"Mahmood",
"Abdun Naser",
""
]
] |
new_dataset
| 0.98251 |
1401.5546
|
Christopher Stewart
|
Chen Li
|
GreenMail: Reducing Email Service's Carbon Emission with Minimum Cost
|
Master's Thesis
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet services contribute a large fraction of worldwide carbon emission
nowadays, in a context of increasing number of companies tending to provide and
more and more developers use Internet services. Noticeably, a trend is those
service providers are trying to reduce their carbon emissions by utilizing
on-site or off-site renewable energy in their datacenters in order to attract
more customers. With such efforts have been paid, there are still some users
who are aggressively calling for even cleaner Internet services. For example,
over 500,000 Facebook users petitioned the social networking site to use
renewable energy to power its datacenter. However, it seems impossible for such
demand to be satisfied merely from the inside of those production datacenters,
considering the transition cost and stability. Outside the existing Internet
services, on the other hand, may easily set up a proxy service to attract those
renewable-energy-sensitive users, by 1) using carbon neutral or even
over-offsetting cloud instances to bridge the end user and traditional Internet
services; and 2) estimating and offsetting the carbon emissions from the
traditional Internet services. In our paper, we proposed GreenMail, which is a
general IMAP proxy caching system that connects email users and traditional
email services. GreenMail runs on green web hosts to cache users' emails on
green cloud instances. Besides, it offsets the carbon emitted by traditional
backend email services. With GreenMail, users could set a carbon emission
constraint and use traditional email service without breaking any code
modification of user side and email server side.
|
[
{
"version": "v1",
"created": "Wed, 22 Jan 2014 03:24:12 GMT"
}
] | 2014-01-23T00:00:00 |
[
[
"Li",
"Chen",
""
]
] |
new_dataset
| 0.998833 |
1401.5698
|
Yifan Li
|
Yifan Li, Petr Musilek, Marek Reformat, Loren Wyard-Scott
|
Identification of Pleonastic It Using the Web
| null |
Journal Of Artificial Intelligence Research, Volume 34, pages
339-389, 2009
|
10.1613/jair.2622
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a significant minority of cases, certain pronouns, especially the pronoun
it, can be used without referring to any specific entity. This phenomenon of
pleonastic pronoun usage poses serious problems for systems aiming at even a
shallow understanding of natural language texts. In this paper, a novel
approach is proposed to identify such uses of it: the extrapositional cases are
identified using a series of queries against the web, and the cleft cases are
identified using a simple set of syntactic rules. The system is evaluated with
four sets of news articles containing 679 extrapositional cases as well as 78
cleft constructs. The identification results are comparable to those obtained
by human efforts.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 05:11:43 GMT"
}
] | 2014-01-23T00:00:00 |
[
[
"Li",
"Yifan",
""
],
[
"Musilek",
"Petr",
""
],
[
"Reformat",
"Marek",
""
],
[
"Wyard-Scott",
"Loren",
""
]
] |
new_dataset
| 0.994553 |
1306.3113
|
Christopher Batty
|
Fang Da, Christopher Batty, Eitan Grinspun
|
Multimaterial Front Tracking
|
The paper has been drastically revised and submitted to a journal
that requires author anonymity; while this cannot be achieved under arXiv.org
policy, we have nevertheless decided to withdraw the paper to reflect our
attempt to satisfy anonymity
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the first triangle mesh-based technique for tracking the evolution
of general three-dimensional multimaterial interfaces undergoing complex
topology changes induced by deformations and collisions. Our core
representation is a non-manifold triangle surface mesh with material labels
assigned to each half-face to distinguish volumetric regions. We advect the
vertices of the mesh in a Lagrangian manner, and employ a complete set of
collision-safe mesh improvement and topological operations that track and
update material labels. In particular, we develop a unified, collision-safe
strategy for handling complex topological operations acting on evolving triple-
and higher-valence junctions, and a flexible method to merge colliding
multimaterial meshes. We demonstrate our approach with a number of challenging
geometric flows, including passive advection, normal flow, and mean curvature
flow.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 14:11:28 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jan 2014 04:02:59 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Da",
"Fang",
""
],
[
"Batty",
"Christopher",
""
],
[
"Grinspun",
"Eitan",
""
]
] |
new_dataset
| 0.999215 |
1401.2405
|
Ghassan Samara
|
Ghassan Samara, Tareq Alhmiedat, Amer O. Abu Salem
|
Dynamic Safety Message Power Control in VANET Using PSO
|
9 pages. arXiv admin note: substantial text overlap with
arXiv:1311.2364
|
The World of Computer Science and Information Technology Journal
(WSCIT). 2013, Volume 3, Issue 10. pp. 176.184
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the recent years Vehicular Ad hoc Networks (VANET) became one of the most
challenging research area in the field of Mobile Ad hoc Networks (MANET).
Vehicles in VANET send emergency and safety periodic messages through one
control channel having a limited bandwidth, which causes a growing collision to
the channel especially in dense traffic situations. In this paper a protocol
Particle swarm optimization Beacon Power Control (PBPC) is proposed, which
makes dynamic transmission power control to adjust the transmission power of
the safety periodic messages that have been aggressively sent by all vehicles
on the road 10 times per a second, the proposed protocol aims to decrease the
packet collision resulted from periodic safety messages, which leads to control
the load on the channel while ensuring a high probability of message reception
within the safety distance of the sender vehicle.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 17:10:20 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jan 2014 13:22:00 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Samara",
"Ghassan",
""
],
[
"Alhmiedat",
"Tareq",
""
],
[
"Salem",
"Amer O. Abu",
""
]
] |
new_dataset
| 0.999602 |
1401.5097
|
Olle Fredriksson
|
Olle Fredriksson
|
Distributed call-by-value machines
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new abstract machine, called DCESH, which describes the
execution of higher-order programs running in distributed architectures. DCESH
implements a generalised form of Remote Procedure Call that supports calling
higher-order functions across node boundaries, without sending actual code. Our
starting point is a variant of the SECD machine that we call the CES machine,
which implements reduction for untyped call-by-value PCF. We successively add
the features that we need for distributed execution and show the correctness of
each addition. First we add heaps, forming the CESH machine, which provides
features necessary for more efficient execution, and show that there is a
bisimulation between the CES and the CESH machine. Then we construct a
two-level operational semantics, where the high level is a network of
communicating machines, and the low level is given by local machine
transitions. Using these networks, we arrive at our final system, the
distributed CESH machine (DCESH). We show that there is a bisimulation relation
also between the CESH machine and the DCESH machine. All the technical results
have been formalised and proved correct in Agda, and a prototype compiler has
been developed.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 21:32:38 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Fredriksson",
"Olle",
""
]
] |
new_dataset
| 0.9995 |
1401.5181
|
Umer Asgher
|
Fahad Moazzam Dar, Umer Asgher, Daniyal Malik, Emmad Adil, Hassan
Shahzad, Anees Ali
|
Automation of Prosthetic Upper Limbs for Transhumeral Amputees Using
Switch-controlled Motors
|
7 Pages, The International Journal of Soft Computing and Software
Engineering [JSCSE], Vol. 3, No. 3, Special Issue The Proceeding of
International Conference on Soft Computing and Software Engineering 2013
[SCSE 13], San Francisco State University, CA, U.S.A., March 2013
|
The International Journal of Soft Computing and Software
Engineering [JSCSE], Vol. 3, No. 3, 2013. e-ISSN: 2251-7545
|
10.7321/jscse.v3.n3.90
|
e-ISSN: 2251-7545
|
cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The issues of research required in the field of bio medical engineering and
externally-powered prostheses are attracting attention of regulatory bodies and
the common people in various parts of the globe. Today, 90 percent of
prostheses used are conventional body powered cable-controlled ones which are
very uncomfortable to the amputees as fairly large amount of forces and
excursions have to be generated by the amputee. Additionally, its amount of
rotation is limited. Alternatively, prosthetic limbs driven using electrical
motors might deliver added functionality and improved control, accompanied by
better cosmesis, however,it could be bulky and costly. Presently existing
proposals usually require fewer bodily response and need additional upkeep than
the cable operated prosthetic limbs. Due to the motives mentioned, proposal for
mechanization of body-powered prostheses, with ease of maintenance and cost in
mind, is presented in this paper. The prosthetic upper limb which is being
automated is for Transhumeral type of amputees that is amputated from above
elbow. The study consists of two main portions: one is lifting mechanism of the
limb and the other is gripping mechanism for the hand using switch controls,
which is the most cost effective and optimized solution, rather than using
complex and expensive myoelectric control signals.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 05:26:34 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Dar",
"Fahad Moazzam",
""
],
[
"Asgher",
"Umer",
""
],
[
"Malik",
"Daniyal",
""
],
[
"Adil",
"Emmad",
""
],
[
"Shahzad",
"Hassan",
""
],
[
"Ali",
"Anees",
""
]
] |
new_dataset
| 0.997297 |
1401.5208
|
Chen Guo
|
Chen Guo, Cenzhe Zhu, Teng Tiow Tay
|
ShAppliT: A Novel Broker-mediated Solution to Generic Application
Sharing in a Cluster of Closed Operating Systems
|
17 pages
|
International Journal of Soft Computing and Software Engineering
Vol. 2, No. 6, 2012
|
10.7321/jscse.v2.n6.2
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With advances in hardware and networking technologies and mass manufacturing,
the cost of high end hardware had fall dramatically in recent years. However,
software cost still remains high and is the dominant fraction of the overall
computing budget. Application sharing is a promising solution to reduce the
overall IT cost. Currently software licenses are still based on the number of
copies installed. An organization can thus reduce the IT cost if the users are
able to remotely access the software that is installed on certain computer
servers instead of running the software on every local computer. In this paper,
we propose a generic application sharing architecture for users' application
sharing in a cluster of closed operating systems such as Microsoft Windows. We
also propose a broker-mediated solution where we allow multiple users to access
a single user software license on a time multiplex basis through a single
logged in user. An application sharing tool called ShAppliT has been introduced
and implemented in Microsoft Windows operating system. We evaluated their
performance on CPU usage and memory consumption when a computer is hosting
multiple concurrent shared application sessions.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 07:37:08 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Guo",
"Chen",
""
],
[
"Zhu",
"Cenzhe",
""
],
[
"Tay",
"Teng Tiow",
""
]
] |
new_dataset
| 0.997245 |
1401.5234
|
Elodie Leducq
|
Elodie Leducq
|
On the third weight of generalized Reed-Muller codes
| null | null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the third weight of generalized Reed-Muller codes. We
prove under some restrictive condition that the third weight of generalized
Reed-Muller codes depends on the third weight of generalized Reed-Muller codes
of small order with two variables. In some cases, we are able to determine the
third weight and the third weight codewords of generalized Reed-Muller codes.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 09:38:33 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Leducq",
"Elodie",
""
]
] |
new_dataset
| 0.988513 |
1401.5306
|
Anthony Marcus Ph.D.
|
Anthony Marcus, Ionut Cardei, Borko Furht, Osman Salem and Ahmed
Mehaoua
|
A Mobile Device Prototype Application for the Detection and Prediction
of Node Faults in Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various implementations of wireless sensor networks (i.e. personal area-,
wireless body area- networks) are prone to node and network failures by such
characteristics as limited node energy resources and hardware damage incurred
from their surrounding environment (i.e. flooding, forest fires, a patient
falling). This may jeopardize their reliability to act as early warning
systems, monitoring systems for patients and athletes, and industrial and
environmental observation networks. Following the current trend and widespread
use of hand held, mobile communication devices, we outline an application
architecture designed to detect and predict faulty nodes in wireless sensor
networks. Furthermore, we implement our design as a proof of concept prototype
for Android-based smartphones, which may be extended to develop other
applications used for monitoring networked wireless personal area and body
sensors used in other capacities. We have conducted several preliminary
experiments to demonstrate the use of our design, which is capable of
monitoring networks of wireless sensor devices and predicting node faults based
on several localized metrics. As attributes of such networks may change over
time, any models generated when the application is initialized must be updated
periodically such that the applied machine learning algorithm maintains high
levels of both accuracy and precision. The application is designed to discover
node faults and, once identified, alert the user so that appropriate action may
be taken.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 13:10:22 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Marcus",
"Anthony",
""
],
[
"Cardei",
"Ionut",
""
],
[
"Furht",
"Borko",
""
],
[
"Salem",
"Osman",
""
],
[
"Mehaoua",
"Ahmed",
""
]
] |
new_dataset
| 0.999376 |
1401.5382
|
Tharun Prasath M
|
M. Tharun Prasath
|
Continuous Speech Recognition Based on Deterministic Finite Automata
Machine using Utterance and Pitch Verification
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a set of acoustic modeling techniques for utterance
verification (UV) based continuous speech recognition (CSR). Utterance
verification in this work implies the ability to determine when portions of a
hypothesized word string correspond to incorrectly decoded vocabulary words or
out-of-vocabulary words that may appear in an utterance. This capability is
implemented here as a likelihood ratio (LR). There are two UV techniques that
are presented here. The first is voice verification along with the vocabulary
testing, at the same time the parameters for UV models are generated based on
the optimization criterion which is directly related to the LR measure. The
second technique is a pitch recognition based on weighted finite-state
transducers. These transducers provide a common and natural representation for
major components of speech recognition systems, including hidden Markov models
(HMMs), context-dependency models, pronunciation dictionaries, statistical
grammars, and word or phone lattices. The finite state machine processes the
acoustic parameters of UV models. The results of an experimental study
presented in the paper shows that LR based parameter estimation results in a
significant improvement in UV performance for this task. The study also found
that the use of the LR based weighted finite-state transducers along with the
UV, can provide as much as an 11% improvement in UV performance when compared
to existing UV procedures. Finally, it was also found that the performance of
the finite state machine was highly dependent on the use of the LR criterion in
training acoustic models. Several observations are made in the paper concerning
the formation of confidence measures for UV and the interaction of these
techniques with statistical language models.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 16:51:07 GMT"
}
] | 2014-01-22T00:00:00 |
[
[
"Prasath",
"M. Tharun",
""
]
] |
new_dataset
| 0.968911 |
1204.4104
|
Satyadev Nandakumar
|
Satyadev Nandakumar, Santhosh Kumar Vangapelli
|
Normality and Finite-state Dimension of Liouville numbers
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Liouville numbers were the first class of real numbers which were proven to
be transcendental. It is easy to construct non-normal Liouville numbers. Kano
and Bugeaud have proved, using analytic techniques, that there are normal
Liouville numbers. Here, for a given base k >= 2, we give two simple
constructions of a Liouville number which is normal to the base k.
The first construction is combinatorial, and is based on de Bruijn sequences.
A real number in the unit interval is normal if and only if its finite-state
dimension is 1. We generalize our construction to prove that for any rational r
in the closed unit interval, there is a Liouville number with finite state
dimension r. This refines Staiger's result that the set of Liouville numbers
has constructive Hausdorff dimension zero, showing a new quantitative
classification of Liouville numbers can be attained using finite-state
dimension.
In the second number-theoretic construction, we use an arithmetic property of
numbers - the existence of primitive roots - to construct Liouville numbers
normal in finitely many bases, assuming a Generalized Artin's conjecture on
primitive roots.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2012 15:12:40 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jan 2014 13:27:18 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Nandakumar",
"Satyadev",
""
],
[
"Vangapelli",
"Santhosh Kumar",
""
]
] |
new_dataset
| 0.996448 |
1211.2496
|
Armin Banaei
|
Armin Banaei, Daren B. H. Cline, Costas N. Georghiades, and Shuguang
Cui
|
On Asymptotic Statistics for Geometric Routing Schemes in Wireless
Ad-Hoc Networks
|
15 pages, 11 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a methodology employing statistical analysis and
stochastic geometry to study geometric routing schemes in wireless ad-hoc
networks. In particular, we analyze the network layer performance of one such
scheme, the random $\frac{1}{2}$disk routing scheme, which is a localized
geometric routing scheme in which each node chooses the next relay randomly
among the nodes within its transmission range and in the general direction of
the destination. The techniques developed in this paper enable us to establish
the asymptotic connectivity and the convergence results for the mean and
variance of the routing path lengths generated by geometric routing schemes in
random wireless networks. In particular, we approximate the progress of the
routing path towards the destination by a Markov process and determine the
sufficient conditions that ensure the asymptotic connectivity for both dense
and large-scale ad-hoc networks deploying the random $\frac{1}{2}$disk routing
scheme. Furthermore, using this Markov characterization, we show that the
expected length (hop-count) of the path generated by the random
$\frac{1}{2}$disk routing scheme normalized by the length of the path generated
by the ideal direct-line routing, converges to $3\pi/4$ asymptotically.
Moreover, we show that the variance-to-mean ratio of the routing path length
converges to $9\pi^2/64-1$ asymptotically. Through simulation, we show that the
aforementioned asymptotic statistics are in fact quite accurate even for finite
granularity and size of the network.
|
[
{
"version": "v1",
"created": "Mon, 12 Nov 2012 02:26:53 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Jul 2013 17:57:22 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Jan 2014 01:50:49 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Banaei",
"Armin",
""
],
[
"Cline",
"Daren B. H.",
""
],
[
"Georghiades",
"Costas N.",
""
],
[
"Cui",
"Shuguang",
""
]
] |
new_dataset
| 0.998189 |
1310.4777
|
Jihong Park
|
Jihong Park and Seong-Lyun Kim
|
Content-Specific Broadcast Cellular Networks based on User Demand
Prediction: A Revenue Perspective
|
6 pages; This paper will appear in the Proc. of IEEE WCNC 2014
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Long Term Evolution (LTE) broadcast is a promising solution to cope with
exponentially increasing user traffic by broadcasting common user requests over
the same frequency channels. In this paper, we propose a novel network
framework provisioning broadcast and unicast services simultaneously. For each
serving file to users, a cellular base station determines either to broadcast
or unicast the file based on user demand prediction examining the file's
content specific characteristics such as: file size, delay tolerance, price
sensitivity. In a network operator's revenue maximization perspective while not
inflicting any user payoff degradation, we jointly optimize resource
allocation, pricing, and file scheduling. In accordance with the state of the
art LTE specifications, the proposed network demonstrates up to 32% increase in
revenue for a single cell and more than a 7-fold increase for a 7 cell
coordinated LTE broadcast network, compared to the conventional unicast
cellular networks.
|
[
{
"version": "v1",
"created": "Thu, 17 Oct 2013 17:15:47 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jan 2014 15:55:10 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Park",
"Jihong",
""
],
[
"Kim",
"Seong-Lyun",
""
]
] |
new_dataset
| 0.963146 |
1311.2903
|
Ahmed El Shafie
|
Ahmed El Shafie, Tamer Khattab and H. Vincent Poor
|
Protocol Design and Stability Analysis of Cooperative Cognitive Radio
Users
|
Accepted in WCNC 2014
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A single cognitive radio transmitter--receiver pair shares the spectrum with
two primary users communicating with their respective receivers. Each primary
user has a local traffic queue, whereas the cognitive user has three queues;
one storing its own traffic while the other two are relaying queues used to
store primary relayed packets admitted from the two primary users. A new
cooperative cognitive medium access control protocol for the described network
is proposed, where the cognitive user exploits the idle periods of the primary
spectrum bands. Traffic arrival to each relaying queue is controlled using a
tuneable admittance factor, while relaying queues service scheduling is
controlled via channel access probabilities assigned to each queue based on the
band of operation. The stability region of the proposed protocol is
characterized shedding light on its maximum expected throughput. Numerical
results demonstrate the performance gains of the proposed cooperative cognitive
protocol.
|
[
{
"version": "v1",
"created": "Tue, 12 Nov 2013 20:05:51 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Nov 2013 02:22:43 GMT"
},
{
"version": "v3",
"created": "Sat, 18 Jan 2014 20:31:06 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Shafie",
"Ahmed El",
""
],
[
"Khattab",
"Tamer",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.996194 |
1401.4629
|
Moustafa Mohamed
|
Moustafa Mohamed, Zheng Li, Xi Chen, Alan Mickelson
|
HERMES: A Hierarchical Broadcast-Based Silicon Photonic Interconnect for
Scalable Many-Core Systems
|
10 pages
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optical interconnection networks, as enabled by recent advances in silicon
photonic device and fabrication technology, have the potential to address
on-chip and off-chip communication bottlenecks in many-core systems. Although
several designs have shown superior power efficiency and performance compared
to electrical alternatives, these networks will not scale to the thousands of
cores required in the future.
In this paper, we introduce Hermes, a hybrid network composed of an optimized
broadcast for power-efficient low-latency global-scale coordination and
circuit-switch sub-networks for high-throughput data delivery. This network
will scale for use in thousand core chip systems. At the physical level,
SoI-based adiabatic coupler has been designed to provide low-loss and compact
optical power splitting. Based on the adiabatic coupler, a topology based on
2-ary folded butterfly is designed to provide linear power division in a
thousand core layout with minimal cross-overs. To address the network agility
and provide for efficient use of optical bandwidth, a flow control and routing
mechanism is introduced to dynamically allocate bandwidth and provide fairness
usage of network resources. At the system level, bloom filter-based filtering
for localization of communication are designed for reducing global traffic. In
addition, a novel greedy-based data and workload migration are leveraged to
increase the locality of communication in a NUCA (non-uniform cache access)
architecture. First order analytic evaluation results have indicated that
Hermes is scalable to at least 1024 cores and offers significant performance
improvement and power savings over prior silicon photonic designs.
|
[
{
"version": "v1",
"created": "Sun, 19 Jan 2014 03:20:40 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Mohamed",
"Moustafa",
""
],
[
"Li",
"Zheng",
""
],
[
"Chen",
"Xi",
""
],
[
"Mickelson",
"Alan",
""
]
] |
new_dataset
| 0.996399 |
1401.4795
|
Tuen Wai Ng
|
Wai-Shun Cheung and Tuen-Wai Ng
|
A Three-Dimensional Voting System in Hong Kong
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The voting system in the Legislative Council of Hong Kong (Legco) is
sometimes unicameral and sometimes bicameral, depending on whether the bill is
proposed by the Hong Kong government. Therefore, although without any
representative within Legco, the Hong Kong government has certain degree of
legislative power --- as if there is a virtual representative of the Hong Kong
government within the Legco. By introducing such a virtual representative of
the Hong Kong government, we show that Legco is a three-dimensional voting
system. We also calculate two power indices of the Hong Kong government through
this virtual representative and consider the $C$-dimension and the
$W$-dimension of Legco. Finally, some implications of this Legco model to the
current constitutional reform in Hong Kong will be given.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 05:58:50 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Cheung",
"Wai-Shun",
""
],
[
"Ng",
"Tuen-Wai",
""
]
] |
new_dataset
| 0.991766 |
1401.4844
|
Rosy Madaan
|
Ashish Kumar Mourya, Niraj Singhal
|
Managing Congestion Control in Mobile AD-HOC Network Using Mobile Agents
|
9 Pages. IJCEA, 2014. arXiv admin note: substantial text overlap with
arXiv:0907.5441 by other authors without attribution
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In mobile adhoc networks, congestion occurs with limited resources. The
standard TCP congestion control mechanism is not able to handle the special
properties of a shared wireless channel. TCP congestion control works very well
on the Internet. But mobile adhoc networks exhibit some unique properties that
greatly affect the design of appropriate protocols and protocol stacks in
general, and of congestion control mechanism in particular. As it turned out,
the vastly differing environment in a mobile adhoc network is highly
problematic for standard TCP. Many approaches have been proposed to overcome
these difficulties. Mobile agent based congestion control Technique is proposed
to avoid congestion in adhoc network. When mobile agent travels through the
network, it can select a less-loaded neighbor node as its next hop and update
the routing table according to the node congestion status. With the aid of
mobile agents, the nodes can get the dynamic network topology in time. In this
paper, a mobile agent based congestion control mechanism is presented.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 09:51:07 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Mourya",
"Ashish Kumar",
""
],
[
"Singhal",
"Niraj",
""
]
] |
new_dataset
| 0.996162 |
1401.4917
|
Philipp Winter
|
Philipp Winter and Stefan Lindskog
|
Spoiled Onions: Exposing Malicious Tor Exit Relays
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several hundred Tor exit relays together push more than 1 GiB/s of network
traffic. However, it is easy for exit relays to snoop and tamper with
anonymised network traffic and as all relays are run by independent volunteers,
not all of them are innocuous.
In this paper, we seek to expose malicious exit relays and document their
actions. First, we monitored the Tor network after developing a fast and
modular exit relay scanner. We implemented several scanning modules for
detecting common attacks and used them to probe all exit relays over a period
of four months. We discovered numerous malicious exit relays engaging in
different attacks. To reduce the attack surface users are exposed to, we
further discuss the design and implementation of a browser extension patch
which fetches and compares suspicious X.509 certificates over independent Tor
circuits.
Our work makes it possible to continuously monitor Tor exit relays. We are
able to detect and thwart many man-in-the-middle attacks which makes the
network safer for its users. All our code is available under a free license.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 14:31:24 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Winter",
"Philipp",
""
],
[
"Lindskog",
"Stefan",
""
]
] |
new_dataset
| 0.985261 |
1401.4932
|
Egor Ianovski
|
Egor Ianovski
|
The existential fragment of S1S over element and successor is the
co-Buchi languages
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Buchi's theorem, in establishing the equivalence between languages definable
in S1S over element and < and the omega-regular languages also demonstrated
that S1S over element and < is no more expressive than its existential
fragment. It is also easy to see that S1S over element and < is equi-expressive
with S1S over element and successor. However, it is not immediately obvious
whether it is possible to adapt Buchi's argument to establish equivalence
between expressivity in S1S over element and successor and its existential
fragment. In this paper we show that it is not: the existential fragment of S1S
over element and successor is strictly less expressive, and is in fact
equivalent to the co-Buchi languages.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 15:07:42 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Ianovski",
"Egor",
""
]
] |
new_dataset
| 0.969489 |
1401.5051
|
Olivier Cur\'e
|
Olivier Cur\'e and Guillaume Blin and Dominique Revuz and David Faye
|
WaterFowl, a Compact, Self-indexed RDF Store with Inference-enabled
Dictionaries
|
12 pages, 3 figures
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel approach -- called WaterFowl -- for the
storage of RDF triples that addresses some key issues in the contexts of big
data and the Semantic Web. The architecture of our prototype, largely based on
the use of succinct data structures, enables the representation of triples in a
self-indexed, compact manner without requiring decompression at query answering
time. Moreover, it is adapted to efficiently support RDF and RDFS entailment
regimes thanks to an optimized encoding of ontology concepts and properties
that does not require a complete inference materialization or extensive query
rewriting algorithms. This approach implies to make a distinction between the
terminological and the assertional components of the knowledge base early in
the process of data preparation, i.e., preprocessing the data before storing it
in our structures. The paper describes the complete architecture of this system
and presents some preliminary results obtained from evaluations conducted on
our first prototype.
|
[
{
"version": "v1",
"created": "Mon, 20 Jan 2014 20:48:05 GMT"
}
] | 2014-01-21T00:00:00 |
[
[
"Curé",
"Olivier",
""
],
[
"Blin",
"Guillaume",
""
],
[
"Revuz",
"Dominique",
""
],
[
"Faye",
"David",
""
]
] |
new_dataset
| 0.978665 |
1401.4443
|
Remus Brad
|
Nusrat Fatema and Remus Brad
|
Attacks And Counterattacks On Wireless Sensor Networks
| null |
Nusrat Fatema and Remus Brad, Attacks and Counterattacks on
Wireless Sensor Networks, International Journal of Ad hoc, Sensor and
Ubiquitous Computing, vol. 4(6), pp. 1-15, December 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WSN is formed by autonomous nodes with partial memory, communication range,
power, and bandwidth. Their occupation depends on inspecting corporal and
environmental conditions and communing through a system and performing data
processing. The application field is vast, comprising military, ecology,
healthcare, home or commercial and require a highly secured communication. The
paper analyses different types of attacks and counterattacks and provides
solutions for the WSN threats
|
[
{
"version": "v1",
"created": "Fri, 17 Jan 2014 19:43:42 GMT"
}
] | 2014-01-20T00:00:00 |
[
[
"Fatema",
"Nusrat",
""
],
[
"Brad",
"Remus",
""
]
] |
new_dataset
| 0.989407 |
1401.4447
|
Abdul Kadir
|
Abdul Kadir, Lukito Edi Nugroho, Adhi Susanto, Paulus Insap Santosa
|
Leaf Classification Using Shape, Color, and Texture Features
|
6 pages, International Journal of Computer Trends and Technology-
July to Aug Issue 2011
| null | null | null |
cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several methods to identify plants have been proposed by several researchers.
Commonly, the methods did not capture color information, because color was not
recognized as an important aspect to the identification. In this research,
shape and vein, color, and texture features were incorporated to classify a
leaf. In this case, a neural network called Probabilistic Neural network (PNN)
was used as a classifier. The experimental result shows that the method for
classification gives average accuracy of 93.75% when it was tested on Flavia
dataset, that contains 32 kinds of plant leaves. It means that the method gives
better performance compared to the original work.
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 07:55:40 GMT"
}
] | 2014-01-20T00:00:00 |
[
[
"Kadir",
"Abdul",
""
],
[
"Nugroho",
"Lukito Edi",
""
],
[
"Susanto",
"Adhi",
""
],
[
"Santosa",
"Paulus Insap",
""
]
] |
new_dataset
| 0.971598 |
0801.3239
|
Andrij Rovenchak
|
Solomiya Buk, Andrij Rovenchak
|
Online-concordance "Perekhresni stezhky" ("The Cross-Paths"), a novel by
Ivan Franko
|
in Ukrainian
|
Ivan Franko: Spirit, Science, Thought, Will (Proceedings of the
International Scientific Congress dedicated to the 150th anniversary (Lviv,
27 September -- 1 October 2006, Lviv University Press, Vol. 2, pp. 203-211,
2010)
| null | null |
cs.CL cs.DL
| null |
In the article, theoretical principles and practical realization for the
compilation of the concordance to "Perekhresni stezhky" ("The Cross-Paths"), a
novel by Ivan Franko, are described. Two forms for the context presentation are
proposed. The electronic version of this lexicographic work is available
online.
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2008 17:41:57 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Buk",
"Solomiya",
""
],
[
"Rovenchak",
"Andrij",
""
]
] |
new_dataset
| 0.998241 |
1208.1151
|
Minglai Cai
|
Vladimir Blinovsky, Minglai Cai
|
Classical-Quantum Arbitrarily Varying Wiretap Channel
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://creativecommons.org/licenses/by/3.0/
|
We derive a lower bound on the capacity of classical-quantum arbitrarily
varying wiretap channel and determine the capacity of the classicalquantum
arbitrarily varying wiretap channel with channel state information at the
transmitter.
|
[
{
"version": "v1",
"created": "Mon, 6 Aug 2012 12:48:45 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Oct 2012 09:32:06 GMT"
},
{
"version": "v3",
"created": "Mon, 15 Oct 2012 08:28:27 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Blinovsky",
"Vladimir",
""
],
[
"Cai",
"Minglai",
""
]
] |
new_dataset
| 0.977188 |
1302.2082
|
Reza Parhizkar
|
Reza Parhizkar, Yann Barbotin and Martin Vetterli
|
Sequences with Minimal Time-Frequency Uncertainty
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A central problem in signal processing and communications is to design
signals that are compact both in time and frequency. Heisenberg's uncertainty
principle states that a given function cannot be arbitrarily compact both in
time and frequency, defining an "uncertainty" lower bound. Taking the variance
as a measure of localization in time and frequency, Gaussian functions reach
this bound for continuous-time signals. For sequences, however, this is not
true; it is known that Heisenberg's bound is generally unachievable. For a
chosen frequency variance, we formulate the search for "maximally compact
sequences" as an exactly and efficiently solved convex optimization problem,
thus providing a sharp uncertainty principle for sequences. Interestingly, the
optimization formulation also reveals that maximally compact sequences are
derived from Mathieu's harmonic cosine function of order zero. We further
provide rational asymptotic expansions of this sharp uncertainty bound. We use
the derived bounds as a benchmark to compare the compactness of well-known
window functions with that of the optimal Mathieu's functions.
|
[
{
"version": "v1",
"created": "Fri, 8 Feb 2013 16:49:22 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Mar 2013 13:55:05 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jan 2014 14:34:57 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Parhizkar",
"Reza",
""
],
[
"Barbotin",
"Yann",
""
],
[
"Vetterli",
"Martin",
""
]
] |
new_dataset
| 0.97925 |
1302.5392
|
Nikola Milo\v{s}evi\'c MSc
|
Nikola Milo\v{s}evi\'c
|
History of malware
|
11 pages, 8 figures describing history and evolution of PC malware
from first PC malware to Stuxnet, DoQu and Flame. This article has been
withdrawed due some errors in text and publication in the jurnal that asked
to withdraw article from other sources
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In past three decades almost everything has changed in the field of malware
and malware analysis. From malware created as proof of some security concept
and malware created for financial gain to malware created to sabotage
infrastructure. In this work we will focus on history and evolution of malware
and describe most important malwares.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 19:57:06 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Jul 2013 07:49:16 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jan 2014 10:44:59 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Milošević",
"Nikola",
""
]
] |
new_dataset
| 0.998579 |
1401.3280
|
Krzysztof Bar
|
Krzysztof Bar and Jamie Vicary
|
Groupoid Semantics for Thermal Computing
|
We describe a groupoid model for thermodynamic computation, and a
quantization procedure that turns encrypted communication into quantum
teleportation. Everything is done using higher category theory
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A groupoid semantics is presented for systems with both logical and thermal
degrees of freedom. We apply this to a syntactic model for encryption, and
obtain an algebraic characterization of the heat produced by the encryption
function, as predicted by Landauer's principle. Our model has a linear
representation theory that reveals an underlying quantum semantics, giving for
the first time a functorial classical model for quantum teleportation and other
quantum phenomena.
|
[
{
"version": "v1",
"created": "Tue, 14 Jan 2014 18:48:25 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jan 2014 11:55:56 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Bar",
"Krzysztof",
""
],
[
"Vicary",
"Jamie",
""
]
] |
new_dataset
| 0.980308 |
1401.3824
|
Xiaohan Wei
|
Xiaohan Wei, Michael J. Neely
|
Power Aware Wireless File Downloading: A Constrained Restless Bandit
Approach
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper treats power-aware throughput maximization in a multi-user file
downloading system. Each user can receive a new file only after its previous
file is finished. The file state processes for each user act as coupled Markov
chains that form a generalized restless bandit system. First, an optimal
algorithm is derived for the case of one user. The algorithm maximizes
throughput subject to an average power constraint. Next, the one-user algorithm
is extended to a low complexity heuristic for the multi-user problem. The
heuristic uses a simple online index policy and its effectiveness is shown via
simulation. For simple 3-user cases where the optimal solution can be computed
offline, the heuristic is shown to be near-optimal for a wide range of
parameters.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 04:18:47 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Wei",
"Xiaohan",
""
],
[
"Neely",
"Michael J.",
""
]
] |
new_dataset
| 0.976957 |
1401.3829
|
Amy Greenwald
|
Amy Greenwald, Seong Jae Lee, Victor Naroditskiy
|
RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel
| null |
Journal Of Artificial Intelligence Research, Volume 36, pages
513-546, 2009
|
10.1613/jair.2904
| null |
cs.GT cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe our autonomous bidding agent, RoxyBot, who emerged
victorious in the travel division of the 2006 Trading Agent Competition in a
photo finish. At a high level, the design of many successful trading agents can
be summarized as follows: (i) price prediction: build a model of market prices;
and (ii) optimization: solve for an approximately optimal set of bids, given
this model. To predict, RoxyBot builds a stochastic model of market prices by
simulating simultaneous ascending auctions. To optimize, RoxyBot relies on the
sample average approximation method, a stochastic optimization technique.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 04:47:45 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Greenwald",
"Amy",
""
],
[
"Lee",
"Seong Jae",
""
],
[
"Naroditskiy",
"Victor",
""
]
] |
new_dataset
| 0.988779 |
1401.3844
|
Yagil Engel
|
Yagil Engel, Michael P. Wellman
|
Multiattribute Auctions Based on Generalized Additive Independence
| null |
Journal Of Artificial Intelligence Research, Volume 37, pages
479-525, 2010
|
10.1613/jair.3002
| null |
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop multiattribute auctions that accommodate generalized additive
independent (GAI) preferences. We propose an iterative auction mechanism that
maintains prices on potentially overlapping GAI clusters of attributes, thus
decreases elicitation and computational burden, and creates an open competition
among suppliers over a multidimensional domain. Most significantly, the auction
is guaranteed to achieve surplus which approximates optimal welfare up to a
small additive factor, under reasonable equilibrium strategies of traders. The
main departure of GAI auctions from previous literature is to accommodate
non-additive trader preferences, hence allowing traders to condition their
evaluation of specific attributes on the value of other attributes. At the same
time, the GAI structure supports a compact representation of prices, enabling a
tractable auction process. We perform a simulation study, demonstrating and
quantifying the significant efficiency advantage of more expressive preference
modeling. We draw random GAI-structured utility functions with various internal
structures, generate additive functions that approximate the GAI utility, and
compare the performance of the auctions using the two representations. We find
that allowing traders to express existing dependencies among attributes
improves the economic efficiency of multiattribute auctions.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 04:55:39 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Engel",
"Yagil",
""
],
[
"Wellman",
"Michael P.",
""
]
] |
new_dataset
| 0.994462 |
1401.3888
|
Dmytro Korzhyk
|
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintveld, Vincent
Conitzer, Milind Tambe
|
Stackelberg vs. Nash in Security Games: An Extended Investigation of
Interchangeability, Equivalence, and Uniqueness
| null |
Journal Of Artificial Intelligence Research, Volume 41, pages
297-327, 2011
|
10.1613/jair.3269
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been significant recent interest in game-theoretic approaches to
security, with much of the recent research focused on utilizing the
leader-follower Stackelberg game model. Among the major applications are the
ARMOR program deployed at LAX Airport and the IRIS program in use by the US
Federal Air Marshals (FAMS). The foundational assumption for using Stackelberg
games is that security forces (leaders), acting first, commit to a randomized
strategy; while their adversaries (followers) choose their best response after
surveillance of this randomized strategy. Yet, in many situations, a leader may
face uncertainty about the follower's surveillance capability. Previous work
fails to address how a leader should compute her strategy given such
uncertainty. We provide five contributions in the context of a general class of
security games. First, we show that the Nash equilibria in security games are
interchangeable, thus alleviating the equilibrium selection problem. Second,
under a natural restriction on security games, any Stackelberg strategy is also
a Nash equilibrium strategy; and furthermore, the solution is unique in a class
of security games of which ARMOR is a key exemplar. Third, when faced with a
follower that can attack multiple targets, many of these properties no longer
hold. Fourth, we show experimentally that in most (but not all) games where the
restriction does not hold, the Stackelberg strategy is still a Nash equilibrium
strategy, but this is no longer true when the attacker can attack multiple
targets. Finally, as a possible direction for future research, we propose an
extensive-form game model that makes the defender's uncertainty about the
attacker's ability to observe explicit.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 05:15:53 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Korzhyk",
"Dmytro",
""
],
[
"Yin",
"Zhengyu",
""
],
[
"Kiekintveld",
"Christopher",
""
],
[
"Conitzer",
"Vincent",
""
],
[
"Tambe",
"Milind",
""
]
] |
new_dataset
| 0.994747 |
1401.3903
|
Noa Agmon
|
Noa Agmon, Gal A. Kaminka, Sarit Kraus
|
Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent
| null |
Journal Of Artificial Intelligence Research, Volume 42, pages
887-916, 2011
|
10.1613/jair.3365
| null |
cs.MA cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of adversarial multi-robot patrol has gained interest in recent
years, mainly due to its immediate relevance to various security applications.
In this problem, robots are required to repeatedly visit a target area in a way
that maximizes their chances of detecting an adversary trying to penetrate
through the patrol path. When facing a strong adversary that knows the patrol
strategy of the robots, if the robots use a deterministic patrol algorithm,
then in many cases it is easy for the adversary to penetrate undetected (in
fact, in some of those cases the adversary can guarantee penetration).
Therefore this paper presents a non-deterministic patrol framework for the
robots. Assuming that the strong adversary will take advantage of its knowledge
and try to penetrate through the patrols weakest spot, hence an optimal
algorithm is one that maximizes the chances of detection in that point. We
therefore present a polynomial-time algorithm for determining an optimal patrol
under the Markovian strategy assumption for the robots, such that the
probability of detecting the adversary in the patrols weakest spot is
maximized. We build upon this framework and describe an optimal patrol strategy
for several robotic models based on their movement abilities (directed or
undirected) and sensing abilities (perfect or imperfect), and in different
environment models - either patrol around a perimeter (closed polygon) or an
open fence (open polyline).
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 05:21:33 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Agmon",
"Noa",
""
],
[
"Kaminka",
"Gal A.",
""
],
[
"Kraus",
"Sarit",
""
]
] |
new_dataset
| 0.999088 |
1401.4151
|
Steve Schneider
|
Chris Culnane and Steve Schneider
|
A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
|
49 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Web Bulletin Board (WBB) is a key component of verifiable election
systems. It is used in the context of election verification to publish evidence
of voting and tallying that voters and officials can check, and where
challenges can be launched in the event of malfeasance. In practice, the
election authority has responsibility for implementing the web bulletin board
correctly and reliably, and will wish to ensure that it behaves correctly even
in the presence of failures and attacks. To ensure robustness, an
implementation will typically use a number of peers to be able to provide a
correct service even when some peers go down or behave dishonestly. In this
paper we propose a new protocol to implement such a Web Bulletin Board,
motivated by the needs of the vVote verifiable voting system. Using a
distributed algorithm increases the complexity of the protocol and requires
careful reasoning in order to establish correctness. Here we use the Event-B
modelling and refinement approach to establish correctness of the peered design
against an idealised specification of the bulletin board behaviour. In
particular we show that for n peers, a threshold of t > 2n/3 peers behaving
correctly is sufficient to ensure correct behaviour of the bulletin board
distributed design. The algorithm also behaves correctly even if honest or
dishonest peers temporarily drop out of the protocol and then return. The
verification approach also establishes that the protocols used within the
bulletin board do not interfere with each other. This is the first time a
peered web bulletin board suite of protocols has been formally verified.
|
[
{
"version": "v1",
"created": "Thu, 16 Jan 2014 20:11:42 GMT"
}
] | 2014-01-17T00:00:00 |
[
[
"Culnane",
"Chris",
""
],
[
"Schneider",
"Steve",
""
]
] |
new_dataset
| 0.981238 |
1307.8192
|
Yushi Uno
|
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, and
Masahide Yamato
|
Morpion Solitaire 5D: a new upper bound of 121 on the maximum score
|
7 pages, 3 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Morpion Solitaire is a pencil-and-paper game for a single player. A move in
this game consists of putting a cross at a lattice point and then drawing a
line segment that passes through exactly five consecutive crosses. The
objective is to make as many moves as possible, starting from a standard
initial configuration of crosses. For one of the variants of this game, called
5D, we prove an upper bound of 121 on the number of moves. This is done by
introducing line-based analysis, and improves the known upper bound of 138
obtained by potential-based analysis.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 02:20:10 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jan 2014 08:39:14 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Kawamura",
"Akitoshi",
""
],
[
"Okamoto",
"Takuma",
""
],
[
"Tatsu",
"Yuichi",
""
],
[
"Uno",
"Yushi",
""
],
[
"Yamato",
"Masahide",
""
]
] |
new_dataset
| 0.995061 |
1401.0190
|
Jerome Jaffre
|
Adi Adimurthi (TIFR-CAM), G. D. Veerappa Gowda (TIFR-CAM), J\'er\^ome
Jaffr\'e (Inria Paris-Rocquencourt)
|
The DFLU flux for systems of conservation laws
|
This paper is published in the Journal of Computational and Applied
Mathematics 247 (2013) 102-123. arXiv admin note: substantial text overlap
with arXiv:0908.0320
|
N° RR-8442 (2013)
| null |
RR-8442
|
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The DFLU numerical flux was introduced in order to solve hyperbolic scalar
conservation laws with a flux function discontinuous in space. We show how this
flux can be used to solve certain class of systems of conservation laws such as
systems modeling polymer flooding in oil reservoir engineering. Furthermore,
these results are extended to the case where the flux function is discontinuous
in the space variable. Such a situation arises for example while dealing with
oil reservoirs which are heterogeneous. Numerical experiments are presented to
illustrate the efficiency of this new scheme compared to other standard schemes
like upstream mobility, Lax-Friedrichs and Force schemes.
|
[
{
"version": "v1",
"created": "Tue, 31 Dec 2013 17:09:32 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Adimurthi",
"Adi",
"",
"TIFR-CAM"
],
[
"Gowda",
"G. D. Veerappa",
"",
"TIFR-CAM"
],
[
"Jaffré",
"Jérôme",
"",
"Inria Paris-Rocquencourt"
]
] |
new_dataset
| 0.995868 |
1401.3485
|
Boris Motik
|
Boris Motik, Rob Shearer, Ian Horrocks
|
Hypertableau Reasoning for Description Logics
| null |
Journal Of Artificial Intelligence Research, Volume 36, pages
165-228, 2009
|
10.1613/jair.2811
| null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel reasoning calculus for the description logic SHOIQ^+---a
knowledge representation formalism with applications in areas such as the
Semantic Web. Unnecessary nondeterminism and the construction of large models
are two primary sources of inefficiency in the tableau-based reasoning calculi
used in state-of-the-art reasoners. In order to reduce nondeterminism, we base
our calculus on hypertableau and hyperresolution calculi, which we extend with
a blocking condition to ensure termination. In order to reduce the size of the
constructed models, we introduce anywhere pairwise blocking. We also present an
improved nominal introduction rule that ensures termination in the presence of
nominals, inverse roles, and number restrictions---a combination of DL
constructs that has proven notoriously difficult to handle. Our implementation
shows significant performance improvements over state-of-the-art reasoners on
several well-known ontologies.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 05:37:06 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Motik",
"Boris",
""
],
[
"Shearer",
"Rob",
""
],
[
"Horrocks",
"Ian",
""
]
] |
new_dataset
| 0.987433 |
1401.3487
|
Alessandro Artale
|
Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael
Zakharyaschev
|
The DL-Lite Family and Relations
| null |
Journal Of Artificial Intelligence Research, Volume 36, pages
1-69, 2009
|
10.1613/jair.2820
| null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recently introduced series of description logics under the common moniker
DL-Lite has attracted attention of the description logic and semantic web
communities due to the low computational complexity of inference, on the one
hand, and the ability to represent conceptual modeling formalisms, on the
other. The main aim of this article is to carry out a thorough and systematic
investigation of inference in extensions of the original DL-Lite logics along
five axes: by (i) adding the Boolean connectives and (ii) number restrictions
to concept constructs, (iii) allowing role hierarchies, (iv) allowing role
disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity
constraints, and (v) adopting or dropping the unique same assumption. We
analyze the combined complexity of satisfiability for the resulting logics, as
well as the data complexity of instance checking and answering positive
existential queries. Our approach is based on embedding DL-Lite logics in
suitable fragments of the one-variable first-order logic, which provides useful
insights into their properties and, in particular, computational behavior.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 05:37:57 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Artale",
"Alessandro",
""
],
[
"Calvanese",
"Diego",
""
],
[
"Kontchakov",
"Roman",
""
],
[
"Zakharyaschev",
"Michael",
""
]
] |
new_dataset
| 0.996932 |
1401.3490
|
William Yeoh
|
William Yeoh, Ariel Felner, Sven Koenig
|
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
| null |
Journal Of Artificial Intelligence Research, Volume 38, pages
85-133, 2010
|
10.1613/jair.2849
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed constraint optimization (DCOP) problems are a popular way of
formulating and solving agent-coordination problems. A DCOP problem is a
problem where several agents coordinate their values such that the sum of the
resulting constraint costs is minimal. It is often desirable to solve DCOP
problems with memory-bounded and asynchronous algorithms. We introduce
Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP search
algorithm that uses the message-passing and communication framework of ADOPT
(Modi, Shen, Tambe, and Yokoo, 2005), a well known memory-bounded asynchronous
DCOP search algorithm, but changes the search strategy of ADOPT from best-first
search to depth-first branch-and-bound search. Our experimental results show
that BnB-ADOPT finds cost-minimal solutions up to one order of magnitude faster
than ADOPT for a variety of large DCOP problems and is as fast as NCBB, a
memory-bounded synchronous DCOP search algorithm, for most of these DCOP
problems. Additionally, it is often desirable to find bounded-error solutions
for DCOP problems within a reasonable amount of time since finding cost-minimal
solutions is NP-hard. The existing bounded-error approximation mechanism allows
users only to specify an absolute error bound on the solution cost but a
relative error bound is often more intuitive. Thus, we present two new
bounded-error approximation mechanisms that allow for relative error bounds and
implement them on top of BnB-ADOPT.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 05:39:26 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Yeoh",
"William",
""
],
[
"Felner",
"Ariel",
""
],
[
"Koenig",
"Sven",
""
]
] |
new_dataset
| 0.994442 |
1401.3519
|
Kamlesh Sharma
|
Kamlesh Sharma, Dr. T.V Prasad
|
Swar The Voice Operated PC
|
4 pages, 1 figure
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Keyboard, although a popular medium, is not very convenient as it requires a
certain amount of skill for effective usage. A mouse on the other hand requires
a good hand-eye co-ordination. Also current computer interfaces also assume a
certain level of literacy from the user. It also expect the user to have
certain level of proficiency in English. In our country where the literacy
level is as low as 50% in some states, if information technology has to reach
the grass root level; these constraints have to be eliminated. As a solution
for these, Speech Recognition and hence the concept of Voice operated computer
system comes into picture. In this paper we propose a technique to develop a
voice recognition system which will be used for controlling computer via speech
input from any user i.e. without the use of mouse and / or keyboard. Once
developed this system would be of great benefit to physically handicapped
people as Instead of scrolling through written procedures on a laptop or
handheld computer, they can wear a headset and have their hands and eyes free.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 08:58:56 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Sharma",
"Kamlesh",
""
],
[
"Prasad",
"Dr. T. V",
""
]
] |
new_dataset
| 0.999534 |
1401.3623
|
Ankit Mundra
|
Ankit Mundra, Geetanjali Rathee, Meenu Chawla, Nitin Rakesh, Ashsutosh
Soni
|
Transport Information System using Query Centric Cyber Physical Systems
(QCPS)
|
5 pages, 4 Figures
|
International Journal of Computer Applications 85(3):12-16,
January 2014. Published by Foundation of Computer Science, New York, USA
|
10.5120/14820-3050
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To incorporate the computation and communication with the physical world,
next generation architecture i.e. CPS is viewed as a new technology. To improve
the better interaction with the physical world or to perk up the electricity
delivery usage, various CPS based approaches have been introduced. Recently
several GPS equipped smart phones and sensor based frameworks have been
proposed which provide various services i.e. environment estimation, road
safety improvement but encounter certain limitations like elevated energy
consumption and high computation cost. To meet the high reliability and safety
requirements, this paper introduces a novel approach based on QCPS model which
provides several users services (discussed in this paper). Further, this paper
proposed a Transport Information System (TIS), which provide the communication
with lower cost overhead by arranging the similar sensors in the form of grids.
Each grid has a coordinator which interacts with cloud to process the user
query. In order to evaluate the performance of proposed approach we have
implemented a test bed of 16 wireless sensor nodes and have shown the
performance in terms of computation and communication cost.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 15:19:42 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Mundra",
"Ankit",
""
],
[
"Rathee",
"Geetanjali",
""
],
[
"Chawla",
"Meenu",
""
],
[
"Rakesh",
"Nitin",
""
],
[
"Soni",
"Ashsutosh",
""
]
] |
new_dataset
| 0.976634 |
1401.3660
|
Andrea Munari
|
Andrea Munari, Michael Heindlmaier, Gianluigi Liva, Matteo Berioli
|
The Throughput of Slotted Aloha with Diversity
|
Accepted for publications at 51st Annual Allerton Conference on
Communication, Control, and Computing
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a simple variation of classical Slotted Aloha is introduced
and analyzed. The enhancement relies on adding multiple receivers that gather
different observations of the packets transmitted by a user population in one
slot. For each observation, the packets transmitted in one slot are assumed to
be subject to independent on-off fading, so that each of them is either
completely faded, and then does not bring any power or interference at the
receiver, or it arrives unfaded, and then may or may not, collide with other
unfaded transmissions. With this model, a novel type of diversity is introduced
to the conventional SA scheme, leading to relevant throughput gains already for
moderate number of receivers. The analytical framework that we introduce allows
to derive closed-form expression of both throughput and packet loss rate an
arbitrary number of receivers, providing interesting hints on the key
trade-offs that characterize the system. We then focus on the problem of having
receivers forward the full set of collected packets to a final gateway using
the minimum possible amount of resources, i.e., avoiding delivery of duplicate
packets, without allowing any exchange of information among them. We derive
what is the minimum amount of resources needed and propose a scheme based on
random linear network coding that achieves asymptotically this bound without
the need for the receivers to coordinate among them.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 16:53:09 GMT"
}
] | 2014-01-16T00:00:00 |
[
[
"Munari",
"Andrea",
""
],
[
"Heindlmaier",
"Michael",
""
],
[
"Liva",
"Gianluigi",
""
],
[
"Berioli",
"Matteo",
""
]
] |
new_dataset
| 0.996076 |
1202.5150
|
Emil Stefanov
|
Emil Stefanov, Marten van Dijk, Elaine Shi, T-H. Hubert Chan,
Christopher Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas
|
Path ORAM: An Extremely Simple Oblivious RAM Protocol
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small
amount of client storage. Partly due to its simplicity, Path ORAM is the most
practical ORAM scheme known to date with small client storage. We formally
prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B =
Omega(log^2 N) bits. For such block sizes, Path ORAM is asymptotically better
than the best known ORAM schemes with small client storage. Due to its
practicality, Path ORAM has been adopted in the design of secure processors
since its proposal.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2012 11:05:34 GMT"
},
{
"version": "v2",
"created": "Fri, 17 May 2013 21:53:37 GMT"
},
{
"version": "v3",
"created": "Tue, 14 Jan 2014 01:29:02 GMT"
}
] | 2014-01-15T00:00:00 |
[
[
"Stefanov",
"Emil",
""
],
[
"van Dijk",
"Marten",
""
],
[
"Shi",
"Elaine",
""
],
[
"Chan",
"T-H. Hubert",
""
],
[
"Fletcher",
"Christopher",
""
],
[
"Ren",
"Ling",
""
],
[
"Yu",
"Xiangyao",
""
],
[
"Devadas",
"Srinivas",
""
]
] |
new_dataset
| 0.999842 |
1401.3088
|
Stefano Tomasin
|
Stefano Tomasin and Nicola Laurenti
|
Secret Message Transmission by HARQ with Multiple Encoding
|
Proc. Int. Conference on Communications (ICC) 2014
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secure transmission between two agents, Alice and Bob, over block fading
channels can be achieved similarly to conventional hybrid automatic repeat
request (HARQ) by letting Alice transmit multiple blocks, each containing an
encoded version of the secret message, until Bob informs Alice about successful
decoding by a public error-free return channel. In existing literature each
block is a differently punctured version of a single codeword generated with a
Wyner code that uses a common randomness for all blocks. In this paper instead
we propose a more general approach where multiple codewords are generated from
independent randomnesses. The class of channels for which decodability and
secrecy is ensured is characterized, with derivations for the existence of
secret codes. We show in particular that the classes are not a trivial subset
(or superset) of those of existing schemes, thus highlighting the novelty of
the proposed solution. The result is further confirmed by deriving the average
achievable secrecy throughput, thus taking into account both decoding and
secrecy outage.
|
[
{
"version": "v1",
"created": "Tue, 14 Jan 2014 07:26:54 GMT"
}
] | 2014-01-15T00:00:00 |
[
[
"Tomasin",
"Stefano",
""
],
[
"Laurenti",
"Nicola",
""
]
] |
new_dataset
| 0.98985 |
1401.3090
|
Bin Guo
|
Bin Guo, Zhiwen Yu, Daqing Zhang, Xingshe Zhou
|
From Participatory Sensing to Mobile Crowd Sensing
| null | null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The research on the efforts of combining human and machine intelligence has a
long history. With the development of mobile sensing and mobile Internet
techniques, a new sensing paradigm called Mobile Crowd Sensing (MCS), which
leverages the power of citizens for large-scale sensing has become popular in
recent years. As an evolution of participatory sensing, MCS has two unique
features: (1) it involves both implicit and explicit participation; (2) MCS
collects data from two user-participant data sources: mobile social networks
and mobile sensing. This paper presents the literary history of MCS and its
unique issues. A reference framework for MCS systems is also proposed. We
further clarify the potential fusion of human and machine intelligence in MCS.
Finally, we discuss the future research trends as well as our efforts to MCS.
|
[
{
"version": "v1",
"created": "Tue, 14 Jan 2014 07:32:50 GMT"
}
] | 2014-01-15T00:00:00 |
[
[
"Guo",
"Bin",
""
],
[
"Yu",
"Zhiwen",
""
],
[
"Zhang",
"Daqing",
""
],
[
"Zhou",
"Xingshe",
""
]
] |
new_dataset
| 0.992227 |
1112.3471
|
Girish Nair
|
Girish N. Nair
|
A Nonstochastic Information Theory for Communication and State
Estimation
| null |
IEEE Transactions on Automatic Control 58 (2013) 1497-1510
|
10.1109/TAC.2013.2241491
| null |
cs.SY cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In communications, unknown variables are usually modelled as random
variables, and concepts such as independence, entropy and information are
defined in terms of the underlying probability distributions. In contrast,
control theory often treats uncertainties and disturbances as bounded unknowns
having no statistical structure. The area of networked control combines both
fields, raising the question of whether it is possible to construct meaningful
analogues of stochastic concepts such as independence, Markovness, entropy and
information without assuming a probability space. This paper introduces a
framework for doing so, leading to the construction of a maximin information
functional for nonstochastic variables. It is shown that the largest maximin
information rate through a memoryless, error-prone channel in this framework
coincides with the block-coding zero-error capacity of the channel. Maximin
information is then used to derive tight conditions for uniformly estimating
the state of a linear time-invariant system over such a channel, paralleling
recent results of Matveev and Savkin.
|
[
{
"version": "v1",
"created": "Thu, 15 Dec 2011 10:33:11 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Jan 2012 05:09:41 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Jul 2012 08:19:11 GMT"
},
{
"version": "v4",
"created": "Tue, 11 Sep 2012 15:58:53 GMT"
},
{
"version": "v5",
"created": "Sat, 11 Jan 2014 16:49:10 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Nair",
"Girish N.",
""
]
] |
new_dataset
| 0.99398 |
1401.2468
|
Erich Schikuta
|
Erich Schikuta and Erwin Mann
|
N2Sky - Neural Networks as Services in the Clouds
|
extended version of paper published at IJCNN 2013
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the N2Sky system, which provides a framework for the exchange of
neural network specific knowledge, as neural network paradigms and objects, by
a virtual organization environment. It follows the sky computing paradigm
delivering ample resources by the usage of federated Clouds. N2Sky is a novel
Cloud-based neural network simulation environment, which follows a pure service
oriented approach. The system implements a transparent environment aiming to
enable both novice and experienced users to do neural network research easily
and comfortably. N2Sky is built using the RAVO reference architecture of
virtual organizations which allows itself naturally integrating into the Cloud
service stack (SaaS, PaaS, and IaaS) of service oriented architectures.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 21:09:36 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Schikuta",
"Erich",
""
],
[
"Mann",
"Erwin",
""
]
] |
new_dataset
| 0.994158 |
1401.2482
|
Marko Horvat
|
Marko Horvat, Nikola Bogunovi\'c, Kre\v{s}imir \'Cosi\'c
|
STIMONT: A core ontology for multimedia stimuli description
|
27 pages, 13 figures
|
Multimedia tools and applications, 11042, July 2013
|
10.1007/s11042-013-1624-4
| null |
cs.MM cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Affective multimedia documents such as images, sounds or videos elicit
emotional responses in exposed human subjects. These stimuli are stored in
affective multimedia databases and successfully used for a wide variety of
research in psychology and neuroscience in areas related to attention and
emotion processing. Although important all affective multimedia databases have
numerous deficiencies which impair their applicability. These problems, which
are brought forward in the paper, result in low recall and precision of
multimedia stimuli retrieval which makes creating emotion elicitation
procedures difficult and labor-intensive. To address these issues a new core
ontology STIMONT is introduced. The STIMONT is written in OWL-DL formalism and
extends W3C EmotionML format with an expressive and formal representation of
affective concepts, high-level semantics, stimuli document metadata and the
elicited physiology. The advantages of ontology in description of affective
multimedia stimuli are demonstrated in a document retrieval experiment and
compared against contemporary keyword-based querying methods. Also, a software
tool Intelligent Stimulus Generator for retrieval of affective multimedia and
construction of stimuli sequences is presented.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 23:36:51 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Horvat",
"Marko",
""
],
[
"Bogunović",
"Nikola",
""
],
[
"Ćosić",
"Krešimir",
""
]
] |
new_dataset
| 0.996859 |
1401.2514
|
Abhijit Bhattacharya
|
Abhijit Bhattacharya, Akhila Rao, K. P. Naveen, P. P. Nishanth, S.V.R.
Anand, and Anurag Kumar
|
QoS Constrained Optimal Sink and Relay Placement in Planned Wireless
Sensor Networks
| null | null | null | null |
cs.NI cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are given a set of sensors at given locations, a set of potential
locations for placing base stations (BSs, or sinks), and another set of
potential locations for placing wireless relay nodes. There is a cost for
placing a BS and a cost for placing a relay. The problem we consider is to
select a set of BS locations, a set of relay locations, and an association of
sensor nodes with the selected BS locations, so that number of hops in the path
from each sensor to its BS is bounded by hmax, and among all such feasible
networks, the cost of the selected network is the minimum. The hop count bound
suffices to ensure a certain probability of the data being delivered to the BS
within a given maximum delay under a light traffic model. We observe that the
problem is NP-Hard, and is hard to even approximate within a constant factor.
For this problem, we propose a polynomial time approximation algorithm
(SmartSelect) based on a relay placement algorithm proposed in our earlier
work, along with a modification of the greedy algorithm for weighted set cover.
We have analyzed the worst case approximation guarantee for this algorithm. We
have also proposed a polynomial time heuristic to improve upon the solution
provided by SmartSelect. Our numerical results demonstrate that the algorithms
provide good quality solutions using very little computation time in various
randomly generated network scenarios.
|
[
{
"version": "v1",
"created": "Sat, 11 Jan 2014 08:44:47 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Bhattacharya",
"Abhijit",
""
],
[
"Rao",
"Akhila",
""
],
[
"Naveen",
"K. P.",
""
],
[
"Nishanth",
"P. P.",
""
],
[
"Anand",
"S. V. R.",
""
],
[
"Kumar",
"Anurag",
""
]
] |
new_dataset
| 0.999578 |
1401.2688
|
Kiran Sree Pokkuluri Prof
|
Pokkuluri Kiran Sree, Inamupudi Ramesh Babu, SSSN Usha Devi N
|
PSMACA: An Automated Protein Structure Prediction Using MACA (Multiple
Attractor Cellular Automata)
|
6 pages. arXiv admin note: substantial text overlap with
arXiv:1310.4342, arXiv:1310.4495
|
Journal of Bioinformatics and Intelligent Control Vol 2, pp
211--215, 2013
|
10.1166/jbic.2013.1052
| null |
cs.CE cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Protein Structure Predication from sequences of amino acid has gained a
remarkable attention in recent years. Even though there are some prediction
techniques addressing this problem, the approximate accuracy in predicting the
protein structure is closely 75%. An automated procedure was evolved with MACA
(Multiple Attractor Cellular Automata) for predicting the structure of the
protein. Most of the existing approaches are sequential which will classify the
input into four major classes and these are designed for similar sequences.
PSMACA is designed to identify ten classes from the sequences that share
twilight zone similarity and identity with the training sequences. This method
also predicts three states (helix, strand, and coil) for the structure. Our
comprehensive design considers 10 feature selection methods and 4 classifiers
to develop MACA (Multiple Attractor Cellular Automata) based classifiers that
are build for each of the ten classes. We have tested the proposed classifier
with twilight-zone and 1-high-similarity benchmark datasets with over three
dozens of modern competing predictors shows that PSMACA provides the best
overall accuracy that ranges between 77% and 88.7% depending on the dataset.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 00:38:52 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Sree",
"Pokkuluri Kiran",
""
],
[
"Babu",
"Inamupudi Ramesh",
""
],
[
"N",
"SSSN Usha Devi",
""
]
] |
new_dataset
| 0.999035 |
1401.2716
|
Lingfei Jin
|
Yang Ding, Lingfei Jin and Chaoping Xing
|
Erasure List-Decodable Codes from Random and Algebraic Geometry Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erasure list decoding was introduced to correct a larger number of erasures
with output of a list of possible candidates. In the present paper, we consider
both random linear codes and algebraic geometry codes for list decoding erasure
errors. The contributions of this paper are two-fold. Firstly, we show that,
for arbitrary $0<R<1$ and $\epsilon>0$ ($R$ and $\epsilon$ are independent),
with high probability a random linear code is an erasure list decodable code
with constant list size $2^{O(1/\epsilon)}$ that can correct a fraction
$1-R-\epsilon$ of erasures, i.e., a random linear code achieves the
information-theoretic optimal trade-off between information rate and fraction
of erasure errors. Secondly, we show that algebraic geometry codes are good
erasure list-decodable codes. Precisely speaking, for any $0<R<1$ and
$\epsilon>0$, a $q$-ary algebraic geometry code of rate $R$ from the
Garcia-Stichtenoth tower can correct
$1-R-\frac{1}{\sqrt{q}-1}+\frac{1}{q}-\epsilon$ fraction of erasure errors with
list size $O(1/\epsilon)$. This improves the Johnson bound applied to algebraic
geometry codes. Furthermore, list decoding of these algebraic geometry codes
can be implemented in polynomial time.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 05:33:15 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"Ding",
"Yang",
""
],
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.999434 |
1401.2920
|
Vincenzo De Florio
|
Vincenzo De Florio, Greet Deconinck, Rudy Lauwereins
|
The EFTOS Voting Farm: A Software Tool for Fault Masking in Message
Passing Parallel Environments
|
Proc. of the 24th EUROMICRO Conf. on Engineering Systems and Software
for the next decade, Vaesteras, Sweden, August 25-27, 1998; pp. 379-386
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a set of C functions implementing a distributed software voting
mechanism for EPX or similar message passing environments, and we place it
within the EFTOS framework (Embedded Fault-Tolerant Supercomputing, ESPRIT-IV
Project 21012) of software tools for enhancing the dependability of a user
application. The described mechanism can be used for instance to implement
restoring organs i.e., N-modular redundancy systems with N-replicated voters.
We show that, besides structural design goals like fault transparency, this
tool achieves replication transparency, a high degree of flexibility and
ease-of-use, and good performance.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 17:14:44 GMT"
}
] | 2014-01-14T00:00:00 |
[
[
"De Florio",
"Vincenzo",
""
],
[
"Deconinck",
"Greet",
""
],
[
"Lauwereins",
"Rudy",
""
]
] |
new_dataset
| 0.982863 |
1107.0845
|
Sparisoma Viridi
|
Suprijadi, Thomas Muliawan, Sparisoma Viridi
|
Automatic Road Lighting System (ARLS) Model Based on Image Processing of
Moving Object
|
5 pages, 8 figures, 1 table, submitted to ARPN Journal of Science and
Technology
|
ARPN Journal of Science and Technology 3 (12), 1105-1109 (2013)
| null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Using a vehicle toy (in next future called vehicle) as a moving object an
automatic road lighting system (ARLS) model is constructed. A digital video
camera with 25 fps is used to capture the vehicle motion as it moves in the
test segment of the road. Captured images are then processed to calculate
vehicle speed. This information of the speed together with position of vehicle
is then used to control the lighting system along the path that passes by the
vehicle. Length of the road test segment is 1 m, the video camera is positioned
about 1.1 m above the test segment, and the vehicle toy dimension is 13 cm
\times 9.3 cm. In this model, the maximum speed that ARLS can handle is about
1.32 m/s, and the highest performance is obtained about 91% at speed 0.93 m/s.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2011 11:06:04 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jul 2011 00:26:49 GMT"
},
{
"version": "v3",
"created": "Fri, 19 Aug 2011 06:32:43 GMT"
},
{
"version": "v4",
"created": "Wed, 27 Nov 2013 03:39:17 GMT"
}
] | 2014-01-13T00:00:00 |
[
[
"Suprijadi",
"",
""
],
[
"Muliawan",
"Thomas",
""
],
[
"Viridi",
"Sparisoma",
""
]
] |
new_dataset
| 0.998036 |
1401.2165
|
Stefanie Roos
|
Stefanie Roos, Thorsten Strufe
|
NextBestOnce: Achieving Polylog Routing despite Non-greedy Embeddings
|
23 pages, 2 figures
| null | null | null |
cs.DS cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social Overlays suffer from high message delivery delays due to insufficient
routing strategies. Limiting connections to device pairs that are owned by
individuals with a mutual trust relationship in real life, they form topologies
restricted to a subgraph of the social network of their users. While
centralized, highly successful social networking services entail a complete
privacy loss of their users, Social Overlays at higher performance represent an
ideal private and censorship-resistant communication substrate for the same
purpose.
Routing in such restricted topologies is facilitated by embedding the social
graph into a metric space. Decentralized routing algorithms have up to date
mainly been analyzed under the assumption of a perfect lattice structure.
However, currently deployed embedding algorithms for privacy-preserving Social
Overlays cannot achieve a sufficiently accurate embedding and hence
conventional routing algorithms fail. Developing Social Overlays with
acceptable performance hence requires better models and enhanced algorithms,
which guarantee convergence in the presence of local optima with regard to the
distance to the target.
We suggest a model for Social Overlays that includes inaccurate embeddings
and arbitrary degree distributions. We further propose NextBestOnce, a routing
algorithm that can achieve polylog routing length despite local optima. We
provide analytical bounds on the performance of NextBestOnce assuming a
scale-free degree distribution, and furthermore show that its performance can
be improved by more than a constant factor when including Neighbor-of-Neighbor
information in the routing decisions.
|
[
{
"version": "v1",
"created": "Thu, 9 Jan 2014 21:05:57 GMT"
}
] | 2014-01-13T00:00:00 |
[
[
"Roos",
"Stefanie",
""
],
[
"Strufe",
"Thorsten",
""
]
] |
new_dataset
| 0.997513 |
1401.1887
|
Li Shuxing
|
Shuxing Li, Tao Feng, Gennian Ge
|
On the Weight Distribution of Cyclic Codes with Niho Exponents
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, there has been intensive research on the weight distributions of
cyclic codes. In this paper, we compute the weight distributions of three
classes of cyclic codes with Niho exponents. More specifically, we obtain two
classes of binary three-weight and four-weight cyclic codes and a class of
nonbinary four-weight cyclic codes. The weight distributions follow from the
determination of value distributions of certain exponential sums. Several
examples are presented to show that some of our codes are optimal and some have
the best known parameters.
|
[
{
"version": "v1",
"created": "Thu, 9 Jan 2014 04:38:18 GMT"
}
] | 2014-01-10T00:00:00 |
[
[
"Li",
"Shuxing",
""
],
[
"Feng",
"Tao",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.99637 |
1401.2058
|
Rachit Puri
|
Rachit Puri
|
Gesture recognition based mouse events
|
9 pages, IJCSIT
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/3.0/
|
This paper presents the maneuver of mouse pointer and performs various mouse
operations such as left click, right click, double click, drag etc using
gestures recognition technique. Recognizing gestures is a complex task which
involves many aspects such as motion modeling, motion analysis, pattern
recognition and machine learning. Keeping all the essential factors in mind a
system has been created which recognizes the movement of fingers and various
patterns formed by them. Color caps have been used for fingers to distinguish
it from the background color such as skin color. Thus recognizing the gestures
various mouse events have been performed. The application has been created on
MATLAB environment with operating system as windows 7.
|
[
{
"version": "v1",
"created": "Thu, 9 Jan 2014 16:26:54 GMT"
}
] | 2014-01-10T00:00:00 |
[
[
"Puri",
"Rachit",
""
]
] |
new_dataset
| 0.999307 |
1310.6485
|
Reza Hooshmand
|
Reza Hooshmand
|
Secret Key Cryptosystem based on Non-Systematic Polar Codes
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a new class of error correcting linear block codes, whose
generator matrix is specified by the knowledge of transmission channel
parameters, code length and code dimension. Moreover, regarding computational
security, it is assumed that an attacker with a restricted processing power has
unlimited access to the transmission media. Therefore, the attacker can
construct the generator matrix of polar codes, especially in the case of Binary
Erasure Channels, on which this matrix can be easily constructed. In this
paper, we introduce a novel method to keep the generator matrix of polar codes
in secret in a way that the attacker cannot access the required information to
decode the intended polar code. With the help of this method, a secret key
cryptosystem is proposed based on non-systematic polar codes. In fact, the main
objective of this study is to achieve an acceptable level of security and
reliability through taking advantage of the special properties of polar codes.
The analyses revealed that our scheme resists the typical attacks on the secret
key cryptosystems based on linear block codes. In addition, by employing some
efficient methods, the key length of the proposed scheme is decreased compared
to that of the previous cryptosystems. Moreover, this scheme enjoys other
advantages including high code rate, and proper error performance as well.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 04:55:37 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Jan 2014 03:56:58 GMT"
}
] | 2014-01-08T00:00:00 |
[
[
"Hooshmand",
"Reza",
""
]
] |
new_dataset
| 0.999621 |
1401.1232
|
Yeray Cachon YC
|
Yeray Cachon Santana
|
A Cryptographic Scheme Of Mellin Transform
|
Cryptography using Mellin's transform
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper it has been developed an algorithm for cryptography, using the
Mellin's transform. Cryptography is very important to protect data to ensure
that two people, using an insecure channel, may communicate in a secure way. In
the present age, ensure the communications will essential to shared data that
have to be protected. The original message is a plain text, and the encrypted
form as cipher text. The cipher text message contains all the information of
the plain text, but is cannot be read from a human without a key and a method
to decrypt it.
|
[
{
"version": "v1",
"created": "Mon, 6 Jan 2014 22:50:30 GMT"
}
] | 2014-01-08T00:00:00 |
[
[
"Santana",
"Yeray Cachon",
""
]
] |
new_dataset
| 0.986506 |
1401.1318
|
Chandra Sekhar Mr
|
Vorugunti Chandra Sekhar and Mrudula Sarvabhatla
|
A Robust Biometric-Based Three-factor Remote User Authentication Scheme
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid development of Internet of Things (IoT) technology, which is an
inter connection of networks through an insecure public channel i.e. Internet
demands for authenticating the remote user trying to access the secure network
resources. In 2013, Ankita et al. proposed an improved three factor remote user
authentication scheme. In this poster we will show that Ankita et al scheme is
vulnerable to known session specific temporary information attack, on
successfully performing the attack, the adversary can perform all other major
cryptographic attacks. As a part of our contribution, we will propose an
improved scheme which is resistance to all major cryptographic attacks and
overcomes the defects in Ankita et al. scheme.
|
[
{
"version": "v1",
"created": "Tue, 7 Jan 2014 09:29:57 GMT"
}
] | 2014-01-08T00:00:00 |
[
[
"Sekhar",
"Vorugunti Chandra",
""
],
[
"Sarvabhatla",
"Mrudula",
""
]
] |
new_dataset
| 0.992938 |
1401.0734
|
Megasthenis Asteris
|
Megasthenis Asteris, Alexandros G. Dimakis
|
Repairable Fountain Codes
|
To appear in IEEE Journal on Selected Areas in Communications, Issue
on Communication Methodologies for Next-Generation Storage Systems 2013, 11
pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new family of Fountain codes that are systematic and also have
sparse parities. Given an input of $k$ symbols, our codes produce an unbounded
number of output symbols, generating each parity independently by linearly
combining a logarithmic number of randomly selected input symbols. The
construction guarantees that for any $\epsilon>0$ accessing a random subset of
$(1+\epsilon)k$ encoded symbols, asymptotically suffices to recover the $k$
input symbols with high probability.
Our codes have the additional benefit of logarithmic locality: a single lost
symbol can be repaired by accessing a subset of $O(\log k)$ of the remaining
encoded symbols. This is a desired property for distributed storage systems
where symbols are spread over a network of storage nodes. Beyond recovery upon
loss, local reconstruction provides an efficient alternative for reading
symbols that cannot be accessed directly. In our code, a logarithmic number of
disjoint local groups is associated with each systematic symbol, allowing
multiple parallel reads.
Our main mathematical contribution involves analyzing the rank of sparse
random matrices with specific structure over finite fields. We rely on
establishing that a new family of sparse random bipartite graphs have perfect
matchings with high probability.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2014 21:18:12 GMT"
}
] | 2014-01-07T00:00:00 |
[
[
"Asteris",
"Megasthenis",
""
],
[
"Dimakis",
"Alexandros G.",
""
]
] |
new_dataset
| 0.997728 |
1401.1190
|
Purnendu Banerjee
|
Souvik Bhowmick, Purnendu Banerjee
|
Bangla Text Recognition from Video Sequence: A New Focus
| null |
NATIONAL CONFERENCE ON COMPUTING AND SYSTEMS (NaCCS), pp.
62-67,2012
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Extraction and recognition of Bangla text from video frame images is
challenging due to complex color background, low-resolution etc. In this paper,
we propose an algorithm for extraction and recognition of Bangla text form such
video frames with complex background. Here, a two-step approach has been
proposed. First, the text line is segmented into words using information based
on line contours. First order gradient value of the text blocks are used to
find the word gap. Next, a local binarization technique is applied on each word
and text line is reconstructed using those words. Secondly, this binarized text
block is sent to OCR for recognition purpose.
|
[
{
"version": "v1",
"created": "Mon, 6 Jan 2014 20:25:26 GMT"
}
] | 2014-01-07T00:00:00 |
[
[
"Bhowmick",
"Souvik",
""
],
[
"Banerjee",
"Purnendu",
""
]
] |
new_dataset
| 0.99841 |
1312.0910
|
Derek Groen
|
Derek Groen, Steven Rieder and Simon Portegies Zwart
|
MPWide: a light-weight library for efficient message passing over wide
area networks
|
accepted by the Journal Of Open Research Software, 13 pages, 4
figures, 1 table
|
Journal of Open Research Software 1(1):e9, 2013
|
10.5334/jors.ah
| null |
cs.DC cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
We present MPWide, a light weight communication library which allows
efficient message passing over a distributed network. MPWide has been designed
to connect application running on distributed (super)computing resources, and
to maximize the communication performance on wide area networks for those
without administrative privileges. It can be used to provide message-passing
between application, move files, and make very fast connections in
client-server environments. MPWide has already been applied to enable
distributed cosmological simulations across up to four supercomputers on two
continents, and to couple two different bloodflow simulations to form a
multiscale simulation.
|
[
{
"version": "v1",
"created": "Tue, 3 Dec 2013 19:17:57 GMT"
}
] | 2014-01-06T00:00:00 |
[
[
"Groen",
"Derek",
""
],
[
"Rieder",
"Steven",
""
],
[
"Zwart",
"Simon Portegies",
""
]
] |
new_dataset
| 0.96651 |
1401.0561
|
Janne Lindqvist
|
Michael Sherman, Gradeigh Clark, Yulong Yang, Shridatt Sugrim, Arttu
Modig, Janne Lindqvist, Antti Oulasvirta, Teemu Roos
|
User-Generated Free-Form Gestures for Authentication: Security and
Memorability
| null | null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the security and memorability of free-form multitouch
gestures for mobile authentication. Towards this end, we collected a dataset
with a generate-test-retest paradigm where participants (N=63) generated
free-form gestures, repeated them, and were later retested for memory. Half of
the participants decided to generate one-finger gestures, and the other half
generated multi-finger gestures. Although there has been recent work on
template-based gestures, there are yet no metrics to analyze security of either
template or free-form gestures. For example, entropy-based metrics used for
text-based passwords are not suitable for capturing the security and
memorability of free-form gestures. Hence, we modify a recently proposed metric
for analyzing information capacity of continuous full-body movements for this
purpose. Our metric computed estimated mutual information in repeated sets of
gestures. Surprisingly, one-finger gestures had higher average mutual
information. Gestures with many hard angles and turns had the highest mutual
information. The best-remembered gestures included signatures and simple
angular shapes. We also implemented a multitouch recognizer to evaluate the
practicality of free-form gestures in a real authentication system and how they
perform against shoulder surfing attacks. We conclude the paper with strategies
for generating secure and memorable free-form gestures, which present a robust
method for mobile authentication.
|
[
{
"version": "v1",
"created": "Thu, 2 Jan 2014 23:15:27 GMT"
}
] | 2014-01-06T00:00:00 |
[
[
"Sherman",
"Michael",
""
],
[
"Clark",
"Gradeigh",
""
],
[
"Yang",
"Yulong",
""
],
[
"Sugrim",
"Shridatt",
""
],
[
"Modig",
"Arttu",
""
],
[
"Lindqvist",
"Janne",
""
],
[
"Oulasvirta",
"Antti",
""
],
[
"Roos",
"Teemu",
""
]
] |
new_dataset
| 0.999801 |
1401.0585
|
Thomas Sandholm
|
Thomas Sandholm, Dongman Lee, Bjorn Tegelund, Seonyeong Han,
Byoungheon Shin, Byoungoh Kim
|
CloudFridge: A Testbed for Smart Fridge Interactions
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a testbed for exploring novel smart refrigerator interactions, and
identify three key adoption-limiting interaction shortcomings of
state-of-the-art smart fridges: lack of 1) user experience focus, 2)
low-intrusion object recognition and 2) automatic item position detection. Our
testbed system addresses these limitations by a combination of sensors,
software filters, architectural components and a RESTful API to track
interaction events in real-time, and retrieve current state and historical data
to learn patterns and recommend user actions. We evaluate the accuracy and
overhead of our system in a realistic interaction flow. The accuracy was
measured to 83-88% and the overhead compared to a representative
state-of-the-art barcode scanner improved by 27%. We also showcase two
applications built on top of our testbed, one for finding expired items and
ingredients of dishes; and one to monitor your health. The pattern that these
applications have in common is that they cast the interaction as an
item-recommendation problem triggered when the user takes something out. Our
testbed could help reveal further user-experience centric interaction patterns
and new classes of applications for smart fridges that inherently, by relying
on our testbed primitives, mitigate the issues with existing approaches.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2014 04:45:49 GMT"
}
] | 2014-01-06T00:00:00 |
[
[
"Sandholm",
"Thomas",
""
],
[
"Lee",
"Dongman",
""
],
[
"Tegelund",
"Bjorn",
""
],
[
"Han",
"Seonyeong",
""
],
[
"Shin",
"Byoungheon",
""
],
[
"Kim",
"Byoungoh",
""
]
] |
new_dataset
| 0.99804 |
1401.0598
|
Wu Wu
|
Wu Wu, Jiulin Hu, Xiaofang Huang, Huijie Chen, Bo Sun
|
Flight trajectory recreation and playback system of aerial mission based
on ossimplanet
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recreation of flight trajectory is important among research areas. The design
of a flight trajectory recreation and playback system is presented in this
paper. Rather than transferring the flight data to diagram, graph and table,
flight data is visualized on the 3D global of ossimPlanet. ossimPlanet is an
open-source 3D global geo-spatial viewer and the system realization is based on
analysis it. Users are allowed to choose their interested flight of aerial
mission. The aerial photographs and corresponding configuration files in which
flight data is included would be read in. And the flight statuses would be
stored. The flight trajectory is then recreated. Users can view the photographs
and flight trajectory marks on the correct positions of 3D global. The scene
along flight trajectory is also simulated at the plane's eye point. This paper
provides a more intuitive way for recreation of flight trajectory. The cost is
decreased remarkably and security is ensured by secondary development on
open-source platform.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2014 07:10:25 GMT"
}
] | 2014-01-06T00:00:00 |
[
[
"Wu",
"Wu",
""
],
[
"Hu",
"Jiulin",
""
],
[
"Huang",
"Xiaofang",
""
],
[
"Chen",
"Huijie",
""
],
[
"Sun",
"Bo",
""
]
] |
new_dataset
| 0.999137 |
1205.5838
|
Linh Anh Nguyen D.Sc.
|
Linh Anh Nguyen
|
ExpTime Tableaux for the Description Logic SHIQ Based on Global State
Caching and Integer Linear Feasibility Checking
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give the first ExpTime (complexity-optimal) tableau decision procedure for
checking satisfiability of a knowledge base in the description logic SHIQ when
numbers are coded in unary. Our procedure is based on global state caching and
integer linear feasibility checking.
|
[
{
"version": "v1",
"created": "Fri, 25 May 2012 23:58:40 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Nov 2012 19:08:17 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Feb 2013 19:41:42 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Dec 2013 16:03:58 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Nguyen",
"Linh Anh",
""
]
] |
new_dataset
| 0.970677 |
1207.0561
|
Naoki Masuda Dr.
|
Naoki Masuda, Issei Kurahashi, Hiroko Onari
|
Suicide ideation of individuals in online social networks
|
4 figures, 9 tables
|
PLOS ONE, 8 (4), e62262 (2013)
|
10.1371/journal.pone.0062262
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suicide explains the largest number of death tolls among Japanese adolescents
in their twenties and thirties. Suicide is also a major cause of death for
adolescents in many other countries. Although social isolation has been
implicated to influence the tendency to suicidal behavior, the impact of social
isolation on suicide in the context of explicit social networks of individuals
is scarcely explored. To address this question, we examined a large data set
obtained from a social networking service dominant in Japan. The social network
is composed of a set of friendship ties between pairs of users created by
mutual endorsement. We carried out the logistic regression to identify users'
characteristics, both related and unrelated to social networks, which
contribute to suicide ideation. We defined suicide ideation of a user as the
membership to at least one active user-defined community related to suicide. We
found that the number of communities to which a user belongs to, the
intransitivity (i.e., paucity of triangles including the user), and the
fraction of suicidal neighbors in the social network, contributed the most to
suicide ideation in this order. Other characteristics including the age and
gender contributed little to suicide ideation. We also found qualitatively the
same results for depressive symptoms.
|
[
{
"version": "v1",
"created": "Tue, 3 Jul 2012 01:40:29 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Aug 2012 01:55:41 GMT"
},
{
"version": "v3",
"created": "Tue, 31 Dec 2013 12:32:02 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Masuda",
"Naoki",
""
],
[
"Kurahashi",
"Issei",
""
],
[
"Onari",
"Hiroko",
""
]
] |
new_dataset
| 0.996026 |
1212.6382
|
Jasine Babu
|
Jasine Babu and Manu Basavaraju and L. Sunil Chandran and Deepak
Rajendraprasad
|
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
| null | null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to
add edges to G to get a supergraph of G, which is 2-vertex-connected,
outerplanar and of pathwidth O(p). This settles an open problem raised by
Biedl, in the context of computing minimum height planar straight line drawings
of outerplanar graphs, with their vertices placed on a two dimensional grid. In
conjunction with the result of this paper, the constant factor approximation
algorithm for this problem obtained by Biedl for 2-vertex-connected outerplanar
graphs will work for all outer planar graphs.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 15:09:02 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Jan 2013 13:32:57 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jan 2014 18:20:32 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Babu",
"Jasine",
""
],
[
"Basavaraju",
"Manu",
""
],
[
"Chandran",
"L. Sunil",
""
],
[
"Rajendraprasad",
"Deepak",
""
]
] |
new_dataset
| 0.999815 |
1312.3740
|
Ashish Jain
|
Ashish Jain, Narendra S. Chaudhari
|
Analytical Observations on Knapsack Cipher 0/255
|
article submitted in the reputed journal
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We observed few important facts that concerns with the new proposal of
knapsack cipher 0/255, recently published by Pham [1]. The author claimed that
the time complexity for solving new improved trapdoor knapsack is O(256^N). In
this paper, we show that the knapsack cipher 0/255 can be solved in the same
time that is required for solving the basic knapsack-cipher proposed by Merkle
and Hellman [2]. In other words we claim that the improved version proposed by
Pham [1] is technically same as the basic Merkle and Hellman Knapsack-based
cryptosystem.
|
[
{
"version": "v1",
"created": "Fri, 13 Dec 2013 09:23:52 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Dec 2013 05:56:17 GMT"
},
{
"version": "v3",
"created": "Tue, 31 Dec 2013 08:21:07 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Jain",
"Ashish",
""
],
[
"Chaudhari",
"Narendra S.",
""
]
] |
new_dataset
| 0.993325 |
1401.0114
|
Andrea Detti PhD
|
Nicola Blefari Melazzi, Andrea Detti, Mayutan Arumaithurai, K.K.
Ramakrishnan
|
Internames: a name-to-name principle for the future Internet
|
6 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose Internames, an architectural framework in which names are used to
identify all entities involved in communication: contents, users, devices,
logical as well as physical points involved in the communication, and services.
By not having a static binding between the name of a communication entity and
its current location, we allow entities to be mobile, enable them to be reached
by any of a number of basic communication primitives, enable communication to
span networks with different technologies and allow for disconnected operation.
Furthermore, with the ability to communicate between names, the communication
path can be dynamically bound to any of a number of end-points, and the
end-points themselves could change as needed. A key benefit of our architecture
is its ability to accommodate gradual migration from the current IP
infrastructure to a future that may be a ubiquitous Information Centric
Network. Basic building blocks of Internames are: i) a name-based Application
Programming Interface; ii) a separation of identifiers (names) and locators;
iii) a powerful Name Resolution Service (NRS) that dynamically maps names to
locators, as a function of time/location/context/service; iv) a built-in
capacity of evolution, allowing a transparent migration from current networks
and the ability to include as particular cases current specific architectures.
To achieve this vision, shared by many other researchers, we exploit and expand
on Information Centric Networking principles, extending ICN functionality
beyond content retrieval, easing send-to-name and push services, and allowing
to use names also to route data in the return path. A key role in this
architecture is played by the NRS, which allows for the co-existence of
multiple network "realms", including current IP and non-IP networks, glued
together by a name-to-name overarching communication primitive.
|
[
{
"version": "v1",
"created": "Tue, 31 Dec 2013 09:05:06 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Melazzi",
"Nicola Blefari",
""
],
[
"Detti",
"Andrea",
""
],
[
"Arumaithurai",
"Mayutan",
""
],
[
"Ramakrishnan",
"K. K.",
""
]
] |
new_dataset
| 0.998724 |
1401.0437
|
Omer Melih Gul
|
Omer Melih Gul, Elif Uysal-Biyikoglu
|
UROP: A Simple, Near-Optimal Scheduling Policy for Energy Harvesting
Sensors
|
32 pages, 10 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a single-hop wireless network where a central node (or
fusion center, FC) collects data from a set of m energy harvesting (EH) nodes
(e.g. nodes of a wireless sensor network). In each time slot, k of m nodes can
be scheduled by the FC for transmission over k orthogonal channels. FC has no
knowledge about EH processes and current battery states of nodes; however, it
knows outcomes of previous transmission attempts. The objective is to find a
low complexity scheduling policy that maximizes total throughput of the data
backlogged system using the harvested energy, for all types (uniform,
non-uniform, independent, correlated (i.e. Markovian), etc.) EH processes.
Energy is assumed to be stored losslessly in the nodes batteries, up to a
storage capacity (the infinite capacity case is also considered.) The problem
is treated in finite and infinite problem horizons. A low-complexity policy,
UROP (Uniformizing Random Ordered Policy) is proposed, whose near optimality is
shown. Numerical examples indicate that under a reasonable-sized battery
capacity, UROP uses the arriving energy with almost perfect efficiency. As the
problem is a restless multi-armed bandit (RMAB) problem with an average reward
criterion, UROP may have a wider application area than communication networks.
|
[
{
"version": "v1",
"created": "Thu, 2 Jan 2014 13:49:28 GMT"
}
] | 2014-01-03T00:00:00 |
[
[
"Gul",
"Omer Melih",
""
],
[
"Uysal-Biyikoglu",
"Elif",
""
]
] |
new_dataset
| 0.990469 |
1003.1520
|
Zolt\'an K\'asa
|
Zolt\'an K\'asa
|
On arc-disjoint Hamiltonian cycles in De Bruijn graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give two equivalent formulations of a conjecture [2,4] on the number of
arc-disjoint Hamiltonian cycles in De Bruijn graphs.
|
[
{
"version": "v1",
"created": "Sun, 7 Mar 2010 20:31:39 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Mar 2010 05:59:10 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Dec 2013 12:05:27 GMT"
}
] | 2013-12-31T00:00:00 |
[
[
"Kása",
"Zoltán",
""
]
] |
new_dataset
| 0.992573 |
1304.4758
|
Jan Bergstra
|
Jan A. Bergstra and Karl de Leeuw
|
Bitcoin and Beyond: Exclusively Informational Monies
|
82 pages. Revision of v2: the Paragraph on monopresence and
pseudomonopresence has been improved and extended; the paragraph on units for
monies of account has been extended; several minor clarifications have been
included; 8 additional references were added; improvements were made of small
errors throughout the paper
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The famous new money Bitcoin is classified as a technical informational money
(TIM). Besides introducing the idea of a TIM, a more extreme notion of
informational money will be developed: exclusively informational money (EXIM).
The informational coins (INCOs) of an EXIM can be in control of an agent but
are not owned by any agent. INCOs of an EXIM cannot be stolen, but they can be
lost, or thrown away. The difference between an EXIM and a TIM shows up when
considering a user perspective on security matters. Security for an EXIM user
is discussed in substantial detail, with the remarkable conclusion that
computer security (security models, access control, user names, passwords,
firewalls etc.) is not always essential for an EXIM, while the application of
cryptography based information security is unavoidable for the use of an EXIM.
Bitcoin seems to meet the criteria of an EXIM, but the assertion that
"Bitcoin is an EXIM", might also be considered problematic. As a thought
experiment we will contemplate Bitguilder, a hypothetical copy of Bitcoin that
qualifies as an EXIM.
A business ethics assessment of Bitcoin is made which reveals a number of
worries. By combining Bitguilder with a so-called technical informational
near-money (TINM) a dual money system, having two units with a fluctuating
rate, may be obtained. It seems that a dual money can remedy some, but not all,
of the ethical worries that arise when contemplating Bitcoin after
hypothetically having become a dominant form of money.
The contributions that Bitcoin's designers can potentially make to the
evolution of EXIMs and TIMs is analyzed in terms of the update of the portfolio
of money related natural kinds that comes with Bitcoin.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 10:21:55 GMT"
},
{
"version": "v2",
"created": "Sun, 12 May 2013 14:48:57 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Dec 2013 16:39:27 GMT"
}
] | 2013-12-31T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"de Leeuw",
"Karl",
""
]
] |
new_dataset
| 0.997127 |
1312.7363
|
Andrew Adamatzky
|
Andrew Adamatzky
|
How beta-skeletons lose their edges
| null |
Adamatzky A. How {\beta}-skeletons lose their edges. Information
Sciences 254 (2014) 213-224
| null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A {\beta}-skeleton is a proximity graphs with node neighbourhood defined by
continuous-valued parameter {\beta}. Two nodes in a {\beta}-skeleton are
connected by an edge if their lune-based neighbourhood contains no other nodes.
With increase of {\beta} some edges a skeleton are disappear. We study how a
number of edges in {\beta}-skeleton depends on {\beta}. We speculate how this
dependence can be used to discriminate between random and non-random planar
sets. We also analyse stability of {\beta}-skeletons and their sensitivity to
perturbations.
|
[
{
"version": "v1",
"created": "Fri, 27 Dec 2013 22:30:13 GMT"
}
] | 2013-12-31T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.994893 |
1312.7522
|
Piotr Borowiecki
|
Gabor Bacso, Piotr Borowiecki, Mihaly Hujter and Zsolt Tuza
|
Minimum order of graphs with given coloring parameters
|
23 pages, 6 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A complete $k$-coloring of a graph $G=(V,E)$ is an assignment
$\varphi:V\to\{1,\ldots,k\}$ of colors to the vertices such that no two
vertices of the same color are adjacent, and the union of any two color classes
contains at least one edge. Three extensively investigated graph invariants
related to complete colorings are the minimum and maximum number of colors in a
complete coloring (chromatic number $\chi(G)$ and achromatic number $\psi(G)$,
respectively), and the Grundy number $\Gamma(G)$ defined as the largest $k$
admitting a complete coloring $\varphi$ with exactly $k$ colors such that every
vertex $v\in V$ of color $\varphi(v)$ has a neighbor of color $i$ for all $1\le
i<\varphi(v)$. The inequality chain $\chi(G)\le \Gamma(G)\le \psi(G)$ obviously
holds for all graphs $G$. A triple $(f,g,h)$ of positive integers at least 2 is
called realizable if there exists a connected graph $G$ with $\chi(G)=f$,
$\Gamma(G)=g$, and $\psi(G)=h$. Chartrand et al. (A note on graphs with
prescribed complete coloring numbers, J. Combin. Math. Combin. Comput. LXXIII
(2010) 77-84) found the list of realizable triples. In this paper we determine
the minimum number of vertices in a connected graph with chromatic number $f$,
Grundy number $g$, and achromatic number $h$, for all realizable triples
$(f,g,h)$ of integers. Furthermore, for $f=g=3$ we describe the (two) extremal
graphs for each $h \geq 6$. For $h=4$ and $5$, there are more extremal graphs,
their description is contained as well.
|
[
{
"version": "v1",
"created": "Sun, 29 Dec 2013 11:31:32 GMT"
}
] | 2013-12-31T00:00:00 |
[
[
"Bacso",
"Gabor",
""
],
[
"Borowiecki",
"Piotr",
""
],
[
"Hujter",
"Mihaly",
""
],
[
"Tuza",
"Zsolt",
""
]
] |
new_dataset
| 0.953194 |
1312.7844
|
Felix Ming Fai Wong
|
Felix Ming Fai Wong, Carlee Joe-Wong, Sangtae Ha, Zhenming Liu, Mung
Chiang
|
Mind Your Own Bandwidth: An Edge Solution to Peak-hour Broadband
Congestion
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by recent increases in network traffic, we propose a decentralized
network edge-based solution to peak-hour broadband congestion that incentivizes
users to moderate their bandwidth demands to their actual needs. Our solution
is centered on smart home gateways that allocate bandwidth in a two-level
hierarchy: first, a gateway purchases guaranteed bandwidth from the Internet
Service Provider (ISP) with virtual credits. It then self-limits its bandwidth
usage and distributes the bandwidth among its apps and devices according to
their relative priorities. To this end, we design a credit allocation and
redistribution mechanism for the first level, and implement our gateways on
commodity wireless routers for the second level. We demonstrate our system's
effectiveness and practicality with theoretical analysis, simulations and
experiments on real traffic. Compared to a baseline equal sharing algorithm,
our solution significantly improves users' overall satisfaction and yields a
fair allocation of bandwidth across users.
|
[
{
"version": "v1",
"created": "Mon, 30 Dec 2013 20:06:57 GMT"
}
] | 2013-12-31T00:00:00 |
[
[
"Wong",
"Felix Ming Fai",
""
],
[
"Joe-Wong",
"Carlee",
""
],
[
"Ha",
"Sangtae",
""
],
[
"Liu",
"Zhenming",
""
],
[
"Chiang",
"Mung",
""
]
] |
new_dataset
| 0.997234 |
1305.5956
|
Jan Bergstra
|
Jan A. Bergstra and Karl de Leeuw
|
Questions related to Bitcoin and other Informational Money
|
31 pages. In v2 the section on patterns for use and misuse has been
improved and expanded with so-called contaminations. Other small improvements
were made and 13 additional references have been included
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A collection of questions about Bitcoin and its hypothetical relatives
Bitguilder and Bitpenny is formulated. These questions concern technical issues
about protocols, security issues, issues about the formalizations of
informational monies in various contexts, and issues about forms of use and
misuse. Some questions are formulated in the more general setting of
informational monies and near-monies.
We also formulate questions about legal, psychological, and ethical aspects
of informational money. Finally we formulate a number of questions concerning
the economical merits of and outlooks for Bitcoin.
|
[
{
"version": "v1",
"created": "Sat, 25 May 2013 18:58:24 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Dec 2013 20:42:45 GMT"
}
] | 2013-12-30T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"de Leeuw",
"Karl",
""
]
] |
new_dataset
| 0.991393 |
1306.0783
|
Julianna Zsid\'o
|
Julianna Zsid\'o
|
Theorem of three circles in Coq
|
27 pages, 5 figures
| null |
10.1007/s10817-013-9299-0
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The theorem of three circles in real algebraic geometry guarantees the
termination and correctness of an algorithm of isolating real roots of a
univariate polynomial. The main idea of its proof is to consider polynomials
whose roots belong to a certain area of the complex plane delimited by straight
lines. After applying a transformation involving inversion this area is mapped
to an area delimited by circles. We provide a formalisation of this rather
geometric proof in Ssreflect, an extension of the proof assistant Coq,
providing versatile algebraic tools. They allow us to formalise the proof from
an algebraic point of view.
|
[
{
"version": "v1",
"created": "Tue, 4 Jun 2013 13:34:51 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Nov 2013 22:27:03 GMT"
}
] | 2013-12-30T00:00:00 |
[
[
"Zsidó",
"Julianna",
""
]
] |
new_dataset
| 0.983415 |
1312.7013
|
Lear Bahack
|
Lear Bahack
|
Theoretical Bitcoin Attacks with less than Half of the Computational
Power (draft)
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A widespread security claim of the Bitcoin system, presented in the original
Bitcoin white-paper, states that the security of the system is guaranteed as
long as there is no attacker in possession of half or more of the total
computational power used to maintain the system. This claim, however, is proved
based on theoretically flawed assumptions.
In the paper we analyze two kinds of attacks based on two theoretical flaws:
the Block Discarding Attack and the Difficulty Raising Attack. We argue that
the current theoretical limit of attacker's fraction of total computational
power essential for the security of the system is in a sense not $\frac{1}{2}$
but a bit less than $\frac{1}{4}$, and outline proposals for protocol change
that can raise this limit to be as close to $\frac{1}{2}$ as we want.
The basic idea of the Block Discarding Attack has been noted as early as
2010, and lately was independently though-of and analyzed by both author of
this paper and authors of a most recently pre-print published paper. We thus
focus on the major differences of our analysis, and try to explain the
unfortunate surprising coincidence. To the best of our knowledge, the second
attack is presented here for the first time.
|
[
{
"version": "v1",
"created": "Wed, 25 Dec 2013 20:04:36 GMT"
}
] | 2013-12-30T00:00:00 |
[
[
"Bahack",
"Lear",
""
]
] |
new_dataset
| 0.996548 |
1312.6834
|
Kiran Sree Pokkuluri Prof
|
P. Kiran Sree, I. Ramesh Babu
|
Face Detection from still and Video Images using Unsupervised Cellular
Automata with K means clustering algorithm
|
ICGST-GVIP Journal, ISSN: 1687-398X, Volume 8, Issue 2, July 2008
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pattern recognition problem rely upon the features inherent in the pattern of
images. Face detection and recognition is one of the challenging research areas
in the field of computer vision. In this paper, we present a method to identify
skin pixels from still and video images using skin color. Face regions are
identified from this skin pixel region. Facial features such as eyes, nose and
mouth are then located. Faces are recognized from color images using an RBF
based neural network. Unsupervised Cellular Automata with K means clustering
algorithm is used to locate different facial elements. Orientation is corrected
by using eyes. Parameters like inter eye distance, nose length, mouth position,
Discrete Cosine Transform (DCT) coefficients etc. are computed and used for a
Radial Basis Function (RBF) based neural network. This approach reliably works
for face sequence with orientation in head, expressions etc.
|
[
{
"version": "v1",
"created": "Sun, 15 Dec 2013 15:43:52 GMT"
}
] | 2013-12-25T00:00:00 |
[
[
"Sree",
"P. Kiran",
""
],
[
"Babu",
"I. Ramesh",
""
]
] |
new_dataset
| 0.975106 |
1310.6635
|
Jason Cloud
|
Jason Cloud, Douglas Leith, and Muriel Medard
|
Network Coded TCP (CTCP) Performance over Satellite Networks
|
4 pages, 4 figures, Accepted at SPACOMM 2014
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show preliminary results for the performance of Network Coded TCP (CTCP)
over large latency networks. While CTCP performs very well in networks with
relatively short RTT, the slow-start mechanism currently employed does not
adequately fill the available bandwidth when the RTT is large. Regardless, we
show that CTCP still outperforms current TCP variants (i.e., Cubic TCP and
Hybla TCP) for high packet loss rates (e.g., >2.5%). We then explore the
possibility of a modified congestion control mechanism based off of H-TCP that
opens the congestion window quickly to overcome the challenges of large latency
networks. Preliminary results are provided that show the combination of network
coding with an appropriate congestion control algorithm can provide gains on
the order of 20 times that of existing TCP variants. Finally, we provide a
discussion of the future work needed to increase CTCP's performance in these
networks.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 14:43:15 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Dec 2013 16:24:47 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Cloud",
"Jason",
""
],
[
"Leith",
"Douglas",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.993644 |
1312.4552
|
Dr. Nadeem Javaid
|
Muhammad Zohaib, Syed Mustafa Pasha, Nadeem Javaid, Jamshed Iqbal
|
Intelligent Bug Algorithm (IBA): A Novel Strategy to Navigate Mobile
Robots Autonomously
|
Springer's International Multi Topic Conference 2013 (IMTIC '13)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research proposed an intelligent obstacle avoidance algorithm to
navigate an autonomous mobile robot. The presented Intelligent Bug Algorithm
(IBA) over performs and reaches the goal in relatively less time as compared to
existing Bug algorithms. The improved algorithm offers a goal oriented strategy
by following smooth and short trajectory. This has been achieved by
continuously considering the goal position during obstacle avoidance. The
proposed algorithm is computationally inexpensive and easy to tune. The paper
also presents the performance comparison of IBA and reported Bug algorithms.
Simulation results of robot navigation in an environment with obstacles
demonstrate the performance of the improved algorithm.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 10:54:22 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Dec 2013 13:36:57 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Zohaib",
"Muhammad",
""
],
[
"Pasha",
"Syed Mustafa",
""
],
[
"Javaid",
"Nadeem",
""
],
[
"Iqbal",
"Jamshed",
""
]
] |
new_dataset
| 0.987981 |
1312.6119
|
Theodor Borsche
|
Theodor Borsche and Andreas Ulbig and G\"oran Andersson
|
A New Frequency Control Reserve Framework based on Energy-Constrained
Units
|
working paper, submitted to PSCC 2014
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frequency control reserves are an essential ancillary service in any electric
power system, guaranteeing that generation and demand of active power are
balanced at all times. Traditionally, conventional power plants are used for
frequency reserves. There are economical and technical benefits of instead
using energy constrained units such as storage systems and demand response, but
so far they have not been widely adopted as their energy constraints prevent
them from following traditional regulation signals, which sometimes are biased
over long time-spans. This paper proposes a frequency control framework that
splits the control signals according to the frequency spectrum. This guarantees
that all control signals are zero-mean over well-defined time-periods, which is
a crucial requirement for the usage of energy-constraint units such as
batteries. A case-study presents a possible implementation, and shows how
different technologies with widely varying characteristics can all participate
in frequency control reserve provision, while guaranteeing that their
respective energy constraints are always fulfilled.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 14:06:45 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Borsche",
"Theodor",
""
],
[
"Ulbig",
"Andreas",
""
],
[
"Andersson",
"Göran",
""
]
] |
new_dataset
| 0.996811 |
1312.6156
|
Michael Fink
|
Joost Vennekens
|
Negation in the Head of CP-logic Rules
|
Proceedings of Answer Set Programming and Other Computing Paradigms
(ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both
of these logics adhere to a Tarskian informal semantics, in which
interpretations represent objective states-of-affairs. In other words, these
logics lack the epistemic component of ASP, in which interpretations represent
the beliefs or knowledge of a rational agent. Consequently, neither CP-logic
nor FO(ID) have the need for two kinds of negations: there is only one
negation, and its meaning is that of objective falsehood. Nevertheless, the
formal semantics of this objective negation is mathematically more similar to
ASP's negation-as-failure than to its classical negation. The reason is that
both CP-logic and FO(ID) have a constructive semantics in which all atoms start
out as false, and may only become true as the result of a rule application.
This paper investigates the possibility of adding the well-known ASP feature of
allowing negation in the head of rules to CP-logic. Because CP-logic only has
one kind of negation, it is of necessity this ''negation-as-failure like''
negation that will be allowed in the head. We investigate the intuitive meaning
of such a construct and the benefits that arise from it.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 21:41:20 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Vennekens",
"Joost",
""
]
] |
new_dataset
| 0.99941 |
1312.6293
|
Jerome Darmont
|
Jaume Ferrarons (ERIC), Mulu Adhana (ERIC), Carlos Colmenares (ERIC),
Sandra Pietrowska (ERIC), Fadila Bentayeb (ERIC), J\'er\^ome Darmont (ERIC)
|
PRIMEBALL: a Parallel Processing Framework Benchmark for Big Data
Applications in the Cloud
|
5th TPC Technology Conference on Performance Evaluation and
Benchmarking (VLDB/TPCTC 13), Riva del Garda : Italy (2013)
| null | null | null |
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we draw the specifications of a novel benchmark for comparing
parallel processing frameworks in the context of big data applications hosted
in the cloud. We aim at filling several gaps in already existing cloud data
processing benchmarks, which lack a real-life context for their processes, thus
losing relevance when trying to assess performance for real applications.
Hence, we propose a fictitious news site hosted in the cloud that is to be
managed by the framework under analysis, together with several objective use
case scenarios and measures for evaluating system performance. The main
strengths of our benchmark are parallelization capabilities supporting cloud
features and big data properties.
|
[
{
"version": "v1",
"created": "Sat, 21 Dec 2013 19:15:22 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Ferrarons",
"Jaume",
"",
"ERIC"
],
[
"Adhana",
"Mulu",
"",
"ERIC"
],
[
"Colmenares",
"Carlos",
"",
"ERIC"
],
[
"Pietrowska",
"Sandra",
"",
"ERIC"
],
[
"Bentayeb",
"Fadila",
"",
"ERIC"
],
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] |
new_dataset
| 0.999739 |
1312.6501
|
Thomas Sandholm
|
Thomas Sandholm, Boris Magnusson, Bjorn A. Johnsson
|
On-Demand WebRTC Tunneling in Restricted Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the implementation of a WebRTC gateway service that
can forward ad-hoc RTP data plane traffic from a browser on one local network
to a browser on another local network. The advantage compared to the existing
IETF STUN (RFC 5389), TURN (RFC 5766) and ICE (RFC 5245) protocols is that it
does not require a public host and port mapping for each participating local
host, and it works with more restrictive firewall policies. WebRTC implements
ICE which combines STUN and TURN probes to automatically find the best
connection between two peers who want to communicate. In corporate networks,
simple hole punching and NAT traversal techniques typically do not work, e.g.
because of symmetric NATs. Dynamic allocation of ports on an external 3rd party
relay service is also typically blocked on restricted hosts. In our use case,
doctors at hospitals can only access port 80 through the hospital firewall on
external machines, and they need to communicate with patients who are typically
behind a NAT in a local WiFi network. VPN solutions only work for staff but not
between patients and staff. Our solution solves this problem by redirecting all
WebRTC traffic through a gateway service on the local network that has a secure
tunnel established with a public gateway. The public gateway redirects traffic
from multiple concurrent streams securely between local gateway services that
connect to it. The local gateways also communicate with browsers on their local
network to mimic a direct browser-to-browser connection without having to
change the browser runtime. We have demonstrated that this technique works well
within the hospital network and arbitrary patient networks, without the need
for any individual host configuration. In our evaluation we show that the
latency overhead is 18-20 ms for each concurrent stream added to the same
gateway service.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 10:02:27 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Sandholm",
"Thomas",
""
],
[
"Magnusson",
"Boris",
""
],
[
"Johnsson",
"Bjorn A.",
""
]
] |
new_dataset
| 0.979297 |
1312.6532
|
Fran\c{c}ois Dupressoir
|
Fran\c{c}ois Dupressoir and Andrew D. Gordon and Jan J\"urjens and
David A. Naumann
|
Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols
|
To appear in Journal of Computer Security
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe how to verify security properties of C code for cryptographic
protocols by using a general-purpose verifier. We prove security theorems in
the symbolic model of cryptography. Our techniques include: use of ghost state
to attach formal algebraic terms to concrete byte arrays and to detect
collisions when two distinct terms map to the same byte array; decoration of a
crypto API with contracts based on symbolic terms; and expression of the
attacker model in terms of C programs. We rely on the general-purpose verifier
VCC; we guide VCC to prove security simply by writing suitable header files and
annotations in implementation files, rather than by changing VCC itself. We
formalize the symbolic model in Coq in order to justify the addition of axioms
to VCC.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 12:05:34 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Dupressoir",
"François",
""
],
[
"Gordon",
"Andrew D.",
""
],
[
"Jürjens",
"Jan",
""
],
[
"Naumann",
"David A.",
""
]
] |
new_dataset
| 0.994941 |
1312.6615
|
Shatrughan Modi
|
Shatrughan Modi and Dr. Seema Bawa
|
Automated Coin Recognition System using ANN
|
6 pages, 11 figures, 1 table, Published with International Journal of
Computer Applications (IJCA)
|
International Journal of Computer Applications 26(4):13-18, July
2011
|
10.5120/3093-4244
| null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coins are integral part of our day to day life. We use coins everywhere like
grocery store, banks, buses, trains etc. So it becomes a basic need that coins
can be sorted and counted automatically. For this it is necessary that coins
can be recognized automatically. In this paper we have developed an ANN
(Artificial Neural Network) based Automated Coin Recognition System for the
recognition of Indian Coins of denomination Rs. 1, 2, 5 and 10 with rotation
invariance. We have taken images from both sides of coin. So this system is
capable of recognizing coins from both sides. Features are extracted from
images using techniques of Hough Transformation, Pattern Averaging etc. Then,
the extracted features are passed as input to a trained Neural Network. 97.74%
recognition rate has been achieved during the experiments i.e. only 2.26% miss
recognition, which is quite encouraging.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 17:40:08 GMT"
}
] | 2013-12-24T00:00:00 |
[
[
"Modi",
"Shatrughan",
""
],
[
"Bawa",
"Dr. Seema",
""
]
] |
new_dataset
| 0.999054 |
1312.5763
|
Ahmed Rashid
|
Rashid Ahmed, John N. Avaritsiotis
|
Identification of Employees Using RFID in IE-NTUA
|
5 pages, 6 figures, 1 table, IJACSA journal 2013
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During the last decade with the rapid increase in indoor wireless
communications, location-aware services have received a great deal of attention
for commercial, public-safety, and a military application, the greatest
challenge associated with indoor positioning methods is moving object data and
identification. Mobility tracking and localization are multifaceted problems,
which have been studied for a long time in different contexts. Many potential
applications in the domain of WSNs require such capabilities. The mobility
tracking needs inherent in many surveillance, security and logistic
applications. This paper presents the identification of employees in National
Technical University in Athens (IE-NTUA), when the employees access to a
certain area of the building (enters and leaves to/from the college), Radio
Frequency Identification (RFID) applied for identification by offering special
badges containing RFID-tags.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 21:55:00 GMT"
}
] | 2013-12-23T00:00:00 |
[
[
"Ahmed",
"Rashid",
""
],
[
"Avaritsiotis",
"John N.",
""
]
] |
new_dataset
| 0.993718 |
1312.5941
|
Julie Dugdale
|
Hong Van Truong, Elise Beck, Julie Dugdale, and Carole Adam
|
Developing a model of evacuation after an earthquake in Lebanon
|
8 pages, 11 figures, ISCRAM Vietnam Conference, November 2013
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article describes the development of an agent-based model (AMEL,
Agent-based Model for Earthquake evacuation in Lebanon) that aims at simulating
the movement of pedestrians shortly after an earthquake. The GAMA platform was
chosen to implement the model. AMEL is applied to a real case study, a district
of the city of Beirut, Lebanon, which potentially could be stricken by a M7
earthquake. The objective of the model is to reproduce real life mobility
behaviours that have been gathered through a survey in Beirut and to test
different future scenarios, which may help the local authorities to target
information campaigns.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 13:51:11 GMT"
}
] | 2013-12-23T00:00:00 |
[
[
"Van Truong",
"Hong",
""
],
[
"Beck",
"Elise",
""
],
[
"Dugdale",
"Julie",
""
],
[
"Adam",
"Carole",
""
]
] |
new_dataset
| 0.99863 |
1312.6036
|
Lutz Frommberger
|
Lutz Frommberger and Falko Schmid
|
Crowdsourced bi-directional disaster reporting and alerting on
smartphones in Lao PDR
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Natural disasters are a large threat for people especially in developing
countries such as Laos. ICT-based disaster management systems aim at supporting
disaster warning and response efforts. However, the ability to directly
communicate in both directions between local and administrative level is often
not supported, and a tight integration into administrative workflows is
missing. In this paper, we present the smartphone-based disaster and reporting
system Mobile4D. It allows for bi-directional communication while being fully
involved in administrative processes. We present the system setup and discuss
integration into administrative structures in Lao PDR.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 16:47:37 GMT"
}
] | 2013-12-23T00:00:00 |
[
[
"Frommberger",
"Lutz",
""
],
[
"Schmid",
"Falko",
""
]
] |
new_dataset
| 0.954795 |
1312.5480
|
Maurizio Bocca Ph.D.
|
Maurizio Bocca, Anh Luong, Neal Patwari, Thomas Schmid
|
Dial It In: Rotating RF Sensors to Enhance Radio Tomography
|
9 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A radio tomographic imaging (RTI) system uses the received signal strength
(RSS) measured by RF sensors in a static wireless network to localize people in
the deployment area, without having them to carry or wear an electronic device.
This paper addresses the fact that small-scale changes in the position and
orientation of the antenna of each RF sensor can dramatically affect imaging
and localization performance of an RTI system. However, the best placement for
a sensor is unknown at the time of deployment. Improving performance in a
deployed RTI system requires the deployer to iteratively "guess-and-retest",
i.e., pick a sensor to move and then re-run a calibration experiment to
determine if the localization performance had improved or degraded. We present
an RTI system of servo-nodes, RF sensors equipped with servo motors which
autonomously "dial it in", i.e., change position and orientation to optimize
the RSS on links of the network. By doing so, the localization accuracy of the
RTI system is quickly improved, without requiring any calibration experiment
from the deployer. Experiments conducted in three indoor environments
demonstrate that the servo-nodes system reduces localization error on average
by 32% compared to a standard RTI system composed of static RF sensors.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 11:05:58 GMT"
}
] | 2013-12-20T00:00:00 |
[
[
"Bocca",
"Maurizio",
""
],
[
"Luong",
"Anh",
""
],
[
"Patwari",
"Neal",
""
],
[
"Schmid",
"Thomas",
""
]
] |
new_dataset
| 0.998746 |
1312.5520
|
Tamara Mchedlidze David
|
William Evans and Michael Kaufmann and William Lenhart and Giuseppe
Liotta and Tamara Mchedlidze and Stephen Wismath
|
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
| null | null | null | null |
cs.DS cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is called a strong (resp. weak) bar 1-visibility graph if its
vertices can be represented as horizontal segments (bars) in the plane so that
its edges are all (resp. a subset of) the pairs of vertices whose bars have a
$\epsilon$-thick vertical line connecting them that intersects at most one
other bar.
We explore the relation among weak (resp. strong) bar 1-visibility graphs and
other nearly planar graph classes. In particular, we study their relation to
1-planar graphs, which have a drawing with at most one crossing per edge;
quasi-planar graphs, which have a drawing with no three mutually crossing
edges; the squares of planar 1-flow networks, which are upward digraphs with
in- or out-degree at most one. Our main results are that 1-planar graphs and
the (undirected) squares of planar 1-flow networks are weak bar 1-visibility
graphs and that these are quasi-planar graphs.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 12:52:02 GMT"
}
] | 2013-12-20T00:00:00 |
[
[
"Evans",
"William",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Lenhart",
"William",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Wismath",
"Stephen",
""
]
] |
new_dataset
| 0.985005 |
1312.5691
|
Wei Zhang
|
Wei Zhang, Olivier Tardieu, David Grove, Benjamin Herta, Tomio Kamada,
Vijay Saraswat, Mikio Takeuchi
|
GLB: Lifeline-based Global Load Balancing library in X10
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present GLB, a programming model and an associated implementation that can
handle a wide range of irregular paral- lel programming problems running over
large-scale distributed systems. GLB is applicable both to problems that are
easily load-balanced via static scheduling and to problems that are hard to
statically load balance. GLB hides the intricate syn- chronizations (e.g.,
inter-node communication, initialization and startup, load balancing,
termination and result collection) from the users. GLB internally uses a
version of the lifeline graph based work-stealing algorithm proposed by
Saraswat et al. Users of GLB are simply required to write several pieces of
sequential code that comply with the GLB interface. GLB then schedules and
orchestrates the parallel execution of the code correctly and efficiently at
scale. We have applied GLB to two representative benchmarks: Betweenness
Centrality (BC) and Unbalanced Tree Search (UTS). Among them, BC can be
statically load-balanced whereas UTS cannot. In either case, GLB scales well--
achieving nearly linear speedup on different computer architectures (Power,
Blue Gene/Q, and K) -- up to 16K cores.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 18:46:00 GMT"
}
] | 2013-12-20T00:00:00 |
[
[
"Zhang",
"Wei",
""
],
[
"Tardieu",
"Olivier",
""
],
[
"Grove",
"David",
""
],
[
"Herta",
"Benjamin",
""
],
[
"Kamada",
"Tomio",
""
],
[
"Saraswat",
"Vijay",
""
],
[
"Takeuchi",
"Mikio",
""
]
] |
new_dataset
| 0.995693 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.