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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1412.2449
|
Vinay Kolar
|
Vikram Munishwar, Vinay Kolar, Praveen Jayachandran, Ravi Kokku
|
RTChoke: Efficient Real-Time Traffic Chokepoint Detection and Monitoring
|
11 pages, Tech rep of the paper accepted at COMSNETS 2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel efficient adaptive sensing and monitoring solution for a
system of mobile sensing devices that support traffic monitoring applications.
We make a key observation that much of the variance in commute times arises at
a few congestion hotspots, and a reliable estimate of congestion can be
obtained by selectively monitoring congestion just at these hotspots. We design
a smartphone application and a backend system that automatically identifies and
monitors congestion hotspots. The solution has low resource footprint in terms
of both battery usage on the sensing devices and the network bytes used for
uploading data. When a user is not inside any hotspot zone, adaptive sampling
conserves battery power and reduces network usage, while ensuring that any new
hotspots can be effectively identified. Our results show that our application
consumes 40- 80% less energy than a periodic sampling system for different
routes in our experiments, with similar accuracy of congestion information. The
system can be used for a variety of applications such as automatic congestion
alerts to users approaching hotspots, reliable end-to-end commute time
estimates and effective alternate route suggestions.
|
[
{
"version": "v1",
"created": "Mon, 8 Dec 2014 05:16:36 GMT"
}
] | 2014-12-09T00:00:00 |
[
[
"Munishwar",
"Vikram",
""
],
[
"Kolar",
"Vinay",
""
],
[
"Jayachandran",
"Praveen",
""
],
[
"Kokku",
"Ravi",
""
]
] |
new_dataset
| 0.98307 |
1412.2495
|
Ronak Sumbaly
|
Priyanka Bhatia and Ronak Sumbaly
|
Framework for Wireless Network Security using Quantum Cryptography
|
17 pages, 11 figures
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.6, November 2014
|
10.5121/ijcnc.2014.6604
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data that is transient over an unsecured wireless network is always
susceptible to being intercepted by anyone within the range of the wireless
signal. Hence providing secure communication to keep the user information and
devices safe when connected wirelessly has become one of the major concerns.
Quantum cryptography provides a solution towards absolute communication
security over the network by encoding information as polarized photons, which
can be sent through the air. This paper explores on the aspect of application
of quantum cryptography in wireless networks. In this paper we present a
methodology for integrating quantum cryptography and security of IEEE 802.11
wireless networks in terms of distribution of the encryption keys.
|
[
{
"version": "v1",
"created": "Mon, 8 Dec 2014 09:47:42 GMT"
}
] | 2014-12-09T00:00:00 |
[
[
"Bhatia",
"Priyanka",
""
],
[
"Sumbaly",
"Ronak",
""
]
] |
new_dataset
| 0.973244 |
1412.1908
|
Rui Zhao
|
Rui Zhao, Wanli Ouyang, Xiaogang Wang
|
Person Re-identification by Saliency Learning
|
This manuscript has 14 pages with 25 figures, and a preliminary
version was published in ICCV 2013
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Human eyes can recognize person identities based on small salient regions,
i.e. human saliency is distinctive and reliable in pedestrian matching across
disjoint camera views. However, such valuable information is often hidden when
computing similarities of pedestrian images with existing approaches. Inspired
by our user study result of human perception on human saliency, we propose a
novel perspective for person re-identification based on learning human saliency
and matching saliency distribution. The proposed saliency learning and matching
framework consists of four steps: (1) To handle misalignment caused by drastic
viewpoint change and pose variations, we apply adjacency constrained patch
matching to build dense correspondence between image pairs. (2) We propose two
alternative methods, i.e. K-Nearest Neighbors and One-class SVM, to estimate a
saliency score for each image patch, through which distinctive features stand
out without using identity labels in the training procedure. (3) saliency
matching is proposed based on patch matching. Matching patches with
inconsistent saliency brings penalty, and images of the same identity are
recognized by minimizing the saliency matching cost. (4) Furthermore, saliency
matching is tightly integrated with patch matching in a unified structural
RankSVM learning framework. The effectiveness of our approach is validated on
the VIPeR dataset and the CUHK01 dataset. Our approach outperforms the
state-of-the-art person re-identification methods on both datasets.
|
[
{
"version": "v1",
"created": "Fri, 5 Dec 2014 07:33:48 GMT"
}
] | 2014-12-08T00:00:00 |
[
[
"Zhao",
"Rui",
""
],
[
"Ouyang",
"Wanli",
""
],
[
"Wang",
"Xiaogang",
""
]
] |
new_dataset
| 0.985468 |
1412.1952
|
Albert Y.S. Lam
|
Albert Y.S. Lam and Victor O.K. Li
|
Opportunistic Routing for the Vehicular Energy Network
|
13 pages
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular energy network (VEN) is a vehicular network which can transport
energy over a large geographical area by means of electric vehicles (EVs). In
the near future, an abundance of EVs, plentiful generation of the renewables,
and mature wireless energy transfer and vehicular communication technologies
will expedite the realization of VEN. To transmit energy from a source to a
destination, we need to establish energy paths, which are composed of segments
of vehicular routes, while satisfying various design objectives. In this paper,
we develop a method to construct all energy paths for a particular energy
source-destination pair, followed by some analytical results of the method. We
describe how to utilize the energy paths to develop optimization models for
different design goals and propose two solutions. We also develop a heuristic
for the power loss minimization problem. We compare the performance of the
three solution methods with artificial and real-world traffic networks and
provide a comprehensive comparison in terms of solution quality, computation
time, solvable problem size, and applicability. This paper lays the foundations
of VEN routing.
|
[
{
"version": "v1",
"created": "Fri, 5 Dec 2014 11:02:07 GMT"
}
] | 2014-12-08T00:00:00 |
[
[
"Lam",
"Albert Y. S.",
""
],
[
"Li",
"Victor O. K.",
""
]
] |
new_dataset
| 0.999155 |
1412.2070
|
Jo\~ao Rodrigues
|
Jo\~ao G. P. Rodrigues, Ana Aguiar, Jo\~ao Barros
|
SenseMyCity: Crowdsourcing an Urban Sensor
|
10 pages, 11 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People treat smartphones as a second skin, having them around nearly 24/7 and
constantly interacting with them. Although smartphones are used mainly for
personal communication, social networking and web browsing, they have many
connectivity capabilities, and are at the same time equipped with a wide range
of embedded sensors. Additionally, bluetooth connectivity can be leveraged to
collect data from external sensors, greatly extending the sensing capabilities.
However, massive data-gathering using smartphones still poses many
architectural challenges, such as limited battery and processing power, and
possibly connectivity costs.
This article describes SenseMyCity (SMC), an Internet of Things mobile urban
sensor that is extensible and fully configurable. The platform consists of an
app, a backoffice and a frontoffice. The SMC app can collect data from embedded
sensors, like GPS, wifi, accelerometer, magnetometer, etc, as well as from
external bluetooth sensors, ranging from On-Board Diagnostics gathering data
from vehicles, to wearable cardiac sensors. Adding support for new internal or
external sensors is straightforward due to the modular architecture. Data
transmission to our servers can occur either on-demand or in real-time, while
keeping costs down by only using the configured type of Internet connectivity.
We discuss our experience implementing the platform and using it to make
longitudinal studies with many users. Further, we present results on bandwidth
utilization and energy consumption for different sensors and sampling rates.
Finally, we show two use cases: mapping fuel consumption and user stress
extracted from cardiac sensors.
|
[
{
"version": "v1",
"created": "Fri, 5 Dec 2014 17:10:02 GMT"
}
] | 2014-12-08T00:00:00 |
[
[
"Rodrigues",
"João G. P.",
""
],
[
"Aguiar",
"Ana",
""
],
[
"Barros",
"João",
""
]
] |
new_dataset
| 0.966581 |
0910.2415
|
Andrei Romashchenko
|
Bruno Durand (LIF), Andrei Romashchenko (LIF), Alexander Shen (LIF)
|
Fixed-point tile sets and their applications
|
v7: updated reference to S.G.Simpson's paper
| null | null | null |
cs.CC math.DS math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An aperiodic tile set was first constructed by R. Berger while proving the
undecidability of the domino problem. It turned out that aperiodic tile sets
appear in many topics ranging from logic (the Entscheidungsproblem) to physics
(quasicrystals). We present a new construction of an aperiodic tile set that is
based on Kleene's fixed-point construction instead of geometric arguments. This
construction is similar to J. von Neumann self-reproducing automata; similar
ideas were also used by P. Gacs in the context of error-correcting
computations. This construction it rather flexible, so it can be used in many
ways: we show how it can be used to implement substitution rules, to construct
strongly aperiodic tile sets (any tiling is far from any periodic tiling), to
give a new proof for the undecidability of the domino problem and related
results, characterize effectively closed 1D subshift it terms of 2D shifts of
finite type (improvement of a result by M. Hochman), to construct a tile set
which has only complex tilings, and to construct a "robust" aperiodic tile set
that does not have periodic (or close to periodic) tilings even if we allow
some (sparse enough) tiling errors. For the latter we develop a hierarchical
classification of points in random sets into islands of different ranks.
Finally, we combine and modify our tools to prove our main result: there exists
a tile set such that all tilings have high Kolmogorov complexity even if
(sparse enough) tiling errors are allowed.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2009 18:55:52 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Oct 2009 06:38:41 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Jan 2010 14:42:41 GMT"
},
{
"version": "v4",
"created": "Fri, 17 Sep 2010 14:22:01 GMT"
},
{
"version": "v5",
"created": "Fri, 12 Nov 2010 15:39:26 GMT"
},
{
"version": "v6",
"created": "Mon, 3 Oct 2011 19:31:37 GMT"
},
{
"version": "v7",
"created": "Thu, 4 Dec 2014 10:19:41 GMT"
}
] | 2014-12-05T00:00:00 |
[
[
"Durand",
"Bruno",
"",
"LIF"
],
[
"Romashchenko",
"Andrei",
"",
"LIF"
],
[
"Shen",
"Alexander",
"",
"LIF"
]
] |
new_dataset
| 0.987652 |
1412.1602
|
Jan Chorowski
|
Jan Chorowski, Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio
|
End-to-end Continuous Speech Recognition using Attention-based Recurrent
NN: First Results
|
As accepted to: Deep Learning and Representation Learning Workshop,
NIPS 2014
| null | null | null |
cs.NE cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We replace the Hidden Markov Model (HMM) which is traditionally used in in
continuous speech recognition with a bi-directional recurrent neural network
encoder coupled to a recurrent neural network decoder that directly emits a
stream of phonemes. The alignment between the input and output sequences is
established using an attention mechanism: the decoder emits each symbol based
on a context created with a subset of input symbols elected by the attention
mechanism. We report initial results demonstrating that this new approach
achieves phoneme error rates that are comparable to the state-of-the-art
HMM-based decoders, on the TIMIT dataset.
|
[
{
"version": "v1",
"created": "Thu, 4 Dec 2014 10:00:19 GMT"
}
] | 2014-12-05T00:00:00 |
[
[
"Chorowski",
"Jan",
""
],
[
"Bahdanau",
"Dzmitry",
""
],
[
"Cho",
"Kyunghyun",
""
],
[
"Bengio",
"Yoshua",
""
]
] |
new_dataset
| 0.972577 |
1412.1623
|
Christian Mainka
|
Christian Mainka, Vladislav Mladenov, J\"org Schwenk
|
Do not trust me: Using malicious IdPs for analyzing and attacking Single
Sign-On
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single Sign-On (SSO) systems simplify login procedures by using an an
Identity Provider (IdP) to issue authentication tokens which can be consumed by
Service Providers (SPs). Traditionally, IdPs are modeled as trusted third
parties. This is reasonable for SSO systems like Kerberos, MS Passport and
SAML, where each SP explicitely specifies which IdP he trusts. However, in open
systems like OpenID and OpenID Connect, each user may set up his own IdP, and a
discovery phase is added to the protocol flow. Thus it is easy for an attacker
to set up its own IdP. In this paper we use a novel approach for analyzing SSO
authentication schemes by introducing a malicious IdP. With this approach we
evaluate one of the most popular and widely deployed SSO protocols - OpenID. We
found four novel attack classes on OpenID, which were not covered by previous
research, and show their applicability to real-life implementations. As a
result, we were able to compromise 11 out of 16 existing OpenID implementations
like Sourceforge, Drupal and ownCloud. We automated discovery of these attacks
in a open source tool OpenID Attacker, which additionally allows fine-granular
testing of all parameters in OpenID implementations. Our research helps to
better understand the message flow in the OpenID protocol, trust assumptions in
the different components of the system, and implementation issues in OpenID
components. It is applicable to other SSO systems like OpenID Connect and SAML.
All OpenID implementations have been informed about their vulnerabilities and
we supported them in fixing the issues.
|
[
{
"version": "v1",
"created": "Thu, 4 Dec 2014 11:14:03 GMT"
}
] | 2014-12-05T00:00:00 |
[
[
"Mainka",
"Christian",
""
],
[
"Mladenov",
"Vladislav",
""
],
[
"Schwenk",
"Jörg",
""
]
] |
new_dataset
| 0.988764 |
1412.1736
|
Tim Boykett
|
Tim Boykett and Gerhard Wendt
|
J2 Radical in Automata Nearrings
|
Published
|
International Journal of Foundations of Computer Science Vol. 25,
No. 05, pp. 585-595 (2014)
|
10.1142/S0129054114500233
| null |
cs.FL math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Looking at the automata defined over a group alphabet as a nearring, we see
that they are a highly complicated structure. As with ring theory, one method
to deal with complexity is to look at semisimplicity modulo radical structures.
We find some bounds on the Jacobson 2-radical and show that in certain groups,
this radical can be explicitly found and the semisimple image determined.
|
[
{
"version": "v1",
"created": "Thu, 4 Dec 2014 17:14:34 GMT"
}
] | 2014-12-05T00:00:00 |
[
[
"Boykett",
"Tim",
""
],
[
"Wendt",
"Gerhard",
""
]
] |
new_dataset
| 0.999428 |
1412.1790
|
Martin Hachet
|
J\'er\'emy Frey (INRIA Bordeaux - Sud-Ouest, LaBRI), Renaud Gervais
(INRIA Bordeaux - Sud-Ouest, LaBRI), St\'ephanie Fleck, Fabien Lotte (INRIA
Bordeaux - Sud-Ouest, LaBRI), Martin Hachet (INRIA Bordeaux - Sud-Ouest,
LaBRI)
|
Teegi: Tangible EEG Interface
|
to appear in UIST-ACM User Interface Software and Technology
Symposium, Oct 2014, Honolulu, United States
| null |
10.1145/2642918.2647368
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Teegi, a Tangible ElectroEncephaloGraphy (EEG) Interface that
enables novice users to get to know more about something as complex as brain
signals, in an easy, en- gaging and informative way. To this end, we have
designed a new system based on a unique combination of spatial aug- mented
reality, tangible interaction and real-time neurotech- nologies. With Teegi, a
user can visualize and analyze his or her own brain activity in real-time, on a
tangible character that can be easily manipulated, and with which it is
possible to interact. An exploration study has shown that interacting with
Teegi seems to be easy, motivating, reliable and infor- mative. Overall, this
suggests that Teegi is a promising and relevant training and mediation tool for
the general public.
|
[
{
"version": "v1",
"created": "Thu, 4 Dec 2014 20:04:08 GMT"
}
] | 2014-12-05T00:00:00 |
[
[
"Frey",
"Jérémy",
"",
"INRIA Bordeaux - Sud-Ouest, LaBRI"
],
[
"Gervais",
"Renaud",
"",
"INRIA Bordeaux - Sud-Ouest, LaBRI"
],
[
"Fleck",
"Stéphanie",
"",
"INRIA\n Bordeaux - Sud-Ouest, LaBRI"
],
[
"Lotte",
"Fabien",
"",
"INRIA\n Bordeaux - Sud-Ouest, LaBRI"
],
[
"Hachet",
"Martin",
"",
"INRIA Bordeaux - Sud-Ouest,\n LaBRI"
]
] |
new_dataset
| 0.99838 |
1412.1127
|
Ahmad Lashgar
|
Ahmad Lashgar and Alireza Majidi and Amirali Baniasadi
|
IPMACC: Open Source OpenACC to CUDA/OpenCL Translator
|
14 pages, 2 figures
| null | null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce IPMACC, a framework for translating OpenACC
applications to CUDA or OpenCL. IPMACC is composed of set of translators
translating OpenACC for C applications to CUDA or OpenCL. The framework uses
the system compiler (e.g. nvcc) for generating final accelerator's binary. The
framework can be used for extending the OpenACC API, executing OpenACC
applications, or obtaining CUDA or OpenCL code which is equivalent to OpenACC
code. We verify correctness of our framework under several benchmarks included
from Rodinia Benchmark Suit and CUDA SDK. We also compare the performance of
CUDA version of the benchmarks to OpenACC version which is compiled by our
framework. By comparing CUDA and OpenACC versions, we discuss the limitations
of OpenACC in achieving a performance near to highly-optimized CUDA version.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 22:49:14 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Lashgar",
"Ahmad",
""
],
[
"Majidi",
"Alireza",
""
],
[
"Baniasadi",
"Amirali",
""
]
] |
new_dataset
| 0.999755 |
1412.1140
|
Josef Spjut
|
Dong-hyeon Park, Akhil Bagaria, Fabiha Hannan, Eric Storm, Josef Spjut
|
Sphynx: A Shared Instruction Cache Exporatory Study
|
4 pages, 6 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Sphynx project was an exploratory study to discover what might be done to
improve the heavy replication of in- structions in independent instruction
caches for a massively parallel machine where a single program is executing
across all of the cores. While a machine with only many cores (fewer than 50)
might not have any issues replicating the instructions for each core, as we
approach the era where thousands of cores can be placed on one chip, the
overhead of instruction replication may become unacceptably large. We believe
that a large amount of sharing should be possible when the ma- chine is
configured for all of the threads to issue from the same set of instructions.
We propose a technique that allows sharing an instruction cache among a number
of independent processor cores to allow for inter-thread sharing and reuse of
instruction memory. While we do not have test cases to demonstrate the
potential magnitude of performance gains that could be achieved, the potential
for sharing reduces the die area required for instruction storage on chip.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2014 00:16:43 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Park",
"Dong-hyeon",
""
],
[
"Bagaria",
"Akhil",
""
],
[
"Hannan",
"Fabiha",
""
],
[
"Storm",
"Eric",
""
],
[
"Spjut",
"Josef",
""
]
] |
new_dataset
| 0.993641 |
1412.1153
|
EPTCS
|
Hossein Hojjat (Cornell University, USA), Philipp R\"ummer (Uppsala
University, Sweden), Pavle Subotic (Uppsala University, Sweden), Wang Yi
(Uppsala University, Sweden)
|
Horn Clauses for Communicating Timed Systems
|
In Proceedings HCVS 2014, arXiv:1412.0825
|
EPTCS 169, 2014, pp. 39-52
|
10.4204/EPTCS.169.6
| null |
cs.LO cs.SE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Languages based on the theory of timed automata are a well established
approach for modelling and analysing real-time systems, with many applications
both in industrial and academic context. Model checking for timed automata has
been studied extensively during the last two decades; however, even now
industrial-grade model checkers are available only for few timed automata
dialects (in particular Uppaal timed automata), exhibit limited scalability for
systems with large discrete state space, or cannot handle parametrised systems.
We explore the use of Horn constraints and off-the-shelf model checkers for
analysis of networks of timed automata. The resulting analysis method is fully
symbolic and applicable to systems with large or infinite discrete state space,
and can be extended to include various language features, for instance
Uppaal-style communication/broadcast channels and BIP-style interactions, and
systems with infinite parallelism. Experiments demonstrate the feasibility of
the method.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2014 01:39:51 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Hojjat",
"Hossein",
"",
"Cornell University, USA"
],
[
"Rümmer",
"Philipp",
"",
"Uppsala\n University, Sweden"
],
[
"Subotic",
"Pavle",
"",
"Uppsala University, Sweden"
],
[
"Yi",
"Wang",
"",
"Uppsala University, Sweden"
]
] |
new_dataset
| 0.950492 |
1412.1194
|
Feng Shi
|
Feng Shi, Robert Laganiere, Emil Petriu
|
Gradient Boundary Histograms for Action Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a high efficient local spatiotemporal descriptor,
called gradient boundary histograms (GBH). The proposed GBH descriptor is built
on simple spatio-temporal gradients, which are fast to compute. We demonstrate
that it can better represent local structure and motion than other
gradient-based descriptors, and significantly outperforms them on large
realistic datasets. A comprehensive evaluation shows that the recognition
accuracy is preserved while the spatial resolution is greatly reduced, which
yields both high efficiency and low memory usage.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2014 05:23:03 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Shi",
"Feng",
""
],
[
"Laganiere",
"Robert",
""
],
[
"Petriu",
"Emil",
""
]
] |
new_dataset
| 0.967804 |
1412.1215
|
Odile Piton
|
H\'el\`ene Pignot (SAMM), Odile Piton (SAMM)
|
Mary Astell's words in A Serious Proposal to the Ladies (part I), a
lexicographic inquiry with NooJ
|
Zoe Gavriilidou, Elina Chadjipapa, Lena Papadopoulou, Max
Silberztein. Nooj 2010 International Conference and Workshop, May 2010,
Komotini, Greece. University of Thrace, Proceedings of the Nooj 2010
International Conference and Workshop, pp.232-244,
http://synmorphose.compulaw.gr/joomlatools-files/docman-files/Zoe-Gav\_BOOK\_7.pdf
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the following article we elected to study with NooJ the lexis of a 17 th
century text, Mary Astell's seminal essay, A Serious Proposal to the Ladies,
part I, published in 1694. We first focused on the semantics to see how Astell
builds her vindication of the female sex, which words she uses to sensitise
women to their alienated condition and promote their education. Then we studied
the morphology of the lexemes (which is different from contemporary English)
used by the author, thanks to the NooJ tools we have devised for this purpose.
NooJ has great functionalities for lexicographic work. Its commands and graphs
prove to be most efficient in the spotting of archaic words or variants in
spelling. Introduction In our previous articles, we have studied the
singularities of 17 th century English within the framework of a diachronic
analysis thanks to syntactical and morphological graphs and thanks to the
dictionaries we have compiled from a corpus that may be expanded overtime. Our
early work was based on a limited corpus of English travel literature to Greece
in the 17 th century. This article deals with a late seventeenth century text
written by a woman philosopher and essayist, Mary Astell (1666--1731),
considered as one of the first English feminists. Astell wrote her essay at a
time in English history when women were "the weaker vessel" and their main
business in life was to charm and please men by their looks and submissiveness.
In this essay we will see how NooJ can help us analyse Astell's rhetoric (what
point of view does she adopt, does she speak in her own name, in the name of
all women, what is her representation of men and women and their relationships
in the text, what are the goals of education?). Then we will turn our attention
to the morphology of words in the text and use NooJ commands and graphs to
carry out a lexicographic inquiry into Astell's lexemes.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2014 07:16:04 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Pignot",
"Hélène",
"",
"SAMM"
],
[
"Piton",
"Odile",
"",
"SAMM"
]
] |
new_dataset
| 0.970419 |
1412.1393
|
Marco Antoniotti
|
Marco Antoniotti
|
CLAZY: Lazy Calling for Common Lisp
|
A version of this note was presented at the 1st European Lisp
Symposium 2008, Bordeaux, France
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document contains a description of a Common Lisp extension that allows a
programmer to write functional programs that use "normal order" evaluation, as
in "non-strict" languages like Haskell. The extension is relatively
straightforward, and it appears to be the first one such that is integrated in
the overall Common Lisp framework.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2014 16:34:11 GMT"
}
] | 2014-12-04T00:00:00 |
[
[
"Antoniotti",
"Marco",
""
]
] |
new_dataset
| 0.999049 |
1411.5853
|
Colm \'O D\'unlaing
|
Colm \'O D\'unlaing
|
An ACCL which is not a CRCL
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is fairly easy to show that every regular set is an almost-confluent
congruential language (ACCL), and it is known that every regular set is a
Church-Rosser congruential language (CRCL). Whether there exists an ACCL, which
is not a CRCL, seems to remain an open question. In this note we present one
such ACCL.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 12:56:39 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Dec 2014 10:48:47 GMT"
}
] | 2014-12-03T00:00:00 |
[
[
"Dúnlaing",
"Colm Ó",
""
]
] |
new_dataset
| 0.999414 |
1412.0784
|
Linus Hamilton
|
Linus Hamilton
|
Braid is undecidable
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Braid is a 2008 puzzle game centered around the ability to reverse time. We
show that Braid can simulate an arbitrary computation. Our construction makes
no use of Braid's unique time mechanics, and therefore may apply to many other
video games.
We also show that a plausible "bounded" variant of Braid lies within
2-EXPSPACE. Our proof relies on a technical lemma about Turing machines which
may be of independent interest. Namely, define a braidlike Turing machine to be
a Turing machine that, when it writes to the tape, deletes all data on the tape
to the right of the head. We prove that deciding the behavior of such a machine
lies in EXPSPACE.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 05:29:18 GMT"
}
] | 2014-12-03T00:00:00 |
[
[
"Hamilton",
"Linus",
""
]
] |
new_dataset
| 0.990143 |
1305.6395
|
Gabriele Fici
|
Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipt\'ak
|
On the Number of Closed Factors in a Word
|
Accepted to LATA 2015
| null | null | null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A closed word (a.k.a. periodic-like word or complete first return) is a word
whose longest border does not have internal occurrences, or, equivalently,
whose longest repeated prefix is not right special. We investigate the
structure of closed factors of words. We show that a word of length $n$
contains at least $n+1$ distinct closed factors, and characterize those words
having exactly $n+1$ closed factors. Furthermore, we show that a word of length
$n$ can contain $\Theta(n^{2})$ many distinct closed factors.
|
[
{
"version": "v1",
"created": "Tue, 28 May 2013 07:44:39 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Oct 2014 16:29:38 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Dec 2014 08:16:17 GMT"
}
] | 2014-12-02T00:00:00 |
[
[
"Badkobeh",
"Golnaz",
""
],
[
"Fici",
"Gabriele",
""
],
[
"Lipták",
"Zsuzsanna",
""
]
] |
new_dataset
| 0.986589 |
1412.0008
|
Robert Templeman
|
Mohammed Korayem, Robert Templeman, Dennis Chen, David Crandall, Apu
Kapadia
|
ScreenAvoider: Protecting Computer Screens from Ubiquitous Cameras
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We live and work in environments that are inundated with cameras embedded in
devices such as phones, tablets, laptops, and monitors. Newer wearable devices
like Google Glass, Narrative Clip, and Autographer offer the ability to quietly
log our lives with cameras from a `first person' perspective. While capturing
several meaningful and interesting moments, a significant number of images
captured by these wearable cameras can contain computer screens. Given the
potentially sensitive information that is visible on our displays, there is a
need to guard computer screens from undesired photography. People need
protection against photography of their screens, whether by other people's
cameras or their own cameras.
We present ScreenAvoider, a framework that controls the collection and
disclosure of images with computer screens and their sensitive content.
ScreenAvoider can detect images with computer screens with high accuracy and
can even go so far as to discriminate amongst screen content. We also introduce
a ScreenTag system that aids in the identification of screen content, flagging
images with highly sensitive content such as messaging applications or email
webpages. We evaluate our concept on realistic lifelogging datasets, showing
that ScreenAvoider provides a practical and useful solution that can help users
manage their privacy.
|
[
{
"version": "v1",
"created": "Fri, 28 Nov 2014 01:50:53 GMT"
}
] | 2014-12-02T00:00:00 |
[
[
"Korayem",
"Mohammed",
""
],
[
"Templeman",
"Robert",
""
],
[
"Chen",
"Dennis",
""
],
[
"Crandall",
"David",
""
],
[
"Kapadia",
"Apu",
""
]
] |
new_dataset
| 0.999682 |
1412.0065
|
Gr\'egory Rogez
|
Gregory Rogez, James S. Supancic III, Maryam Khademi, Jose Maria
Martinez Montiel, Deva Ramanan
|
3D Hand Pose Detection in Egocentric RGB-D Images
|
14 pages, 15 figures, extended version of the corresponding ECCV
workshop paper, submitted to International Journal of Computer Vision
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We focus on the task of everyday hand pose estimation from egocentric
viewpoints. For this task, we show that depth sensors are particularly
informative for extracting near-field interactions of the camera wearer with
his/her environment. Despite the recent advances in full-body pose estimation
using Kinect-like sensors, reliable monocular hand pose estimation in RGB-D
images is still an unsolved problem. The problem is considerably exacerbated
when analyzing hands performing daily activities from a first-person viewpoint,
due to severe occlusions arising from object manipulations and a limited
field-of-view. Our system addresses these difficulties by exploiting strong
priors over viewpoint and pose in a discriminative tracking-by-detection
framework. Our priors are operationalized through a photorealistic synthetic
model of egocentric scenes, which is used to generate training data for
learning depth-based pose classifiers. We evaluate our approach on an annotated
dataset of real egocentric object manipulation scenes and compare to both
commercial and academic approaches. Our method provides state-of-the-art
performance for both hand detection and pose estimation in egocentric RGB-D
images.
|
[
{
"version": "v1",
"created": "Sat, 29 Nov 2014 03:19:56 GMT"
}
] | 2014-12-02T00:00:00 |
[
[
"Rogez",
"Gregory",
""
],
[
"Supancic",
"James S.",
"III"
],
[
"Khademi",
"Maryam",
""
],
[
"Montiel",
"Jose Maria Martinez",
""
],
[
"Ramanan",
"Deva",
""
]
] |
new_dataset
| 0.994504 |
1411.7482
|
Easwar Vivek Mangipudi
|
Abhijit Bhattacharya, Sanjay Motilal Ladwa, Rachit Srivastava,
Aniruddha Mallya, Akhila Rao, Easwar Vivek. M, Deeksha G. Rao Sahib, S.V.R.
Anand, and Anurag Kumar
|
SmartConnect: A System for the Design and Deployment of Wireless Sensor
Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have developed SmartConnect, a tool that addresses the growing need for
the design and deployment of multihop wireless relay networks for connecting
sensors to a control center. Given the locations of the sensors, the traffic
that each sensor generates, the quality of service (QoS) requirements, and the
potential locations at which relays can be placed, SmartConnect helps design
and deploy a low- cost wireless multihop relay network. SmartConnect adopts a
field interactive, iterative approach, with model based network design, field
evaluation and relay augmentation per- formed iteratively until the desired QoS
is met. The design process is based on approximate combinatorial optimization
algorithms. In the paper, we provide the design choices made in SmartConnect
and describe the experimental work that led to these choices. We provide
results from some experimental deployments. Finally, we conduct an experimental
study of the robustness of the network design over long time periods (as
channel conditions slowly change), in terms of the relay augmentation and route
adaptation required.
|
[
{
"version": "v1",
"created": "Thu, 27 Nov 2014 06:52:58 GMT"
}
] | 2014-12-01T00:00:00 |
[
[
"Bhattacharya",
"Abhijit",
""
],
[
"Ladwa",
"Sanjay Motilal",
""
],
[
"Srivastava",
"Rachit",
""
],
[
"Mallya",
"Aniruddha",
""
],
[
"Rao",
"Akhila",
""
],
[
"M",
"Easwar Vivek.",
""
],
[
"Sahib",
"Deeksha G. Rao",
""
],
[
"Anand",
"S. V. R.",
""
],
[
"Kumar",
"Anurag",
""
]
] |
new_dataset
| 0.99956 |
1411.7647
|
Abuzer Yakaryilmaz
|
A. C. Cem Say and Abuzer Yakaryilmaz
|
Magic coins are useful for small-space quantum machines
|
16 pages!
| null | null | null |
cs.CC cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although polynomial-time probabilistic Turing machines can utilize
uncomputable transition probabilities to recognize uncountably many languages
with bounded error when allowed to use logarithmic space, it is known that such
"magic coins" give no additional computational power to constant-space versions
of those machines. We show that adding a few quantum bits to the model changes
the picture dramatically. For every language $L$, there exists such a two-way
quantum finite automaton that recognizes a language of the same Turing degree
as $L$ with bounded error in polynomial time. When used as verifiers in
public-coin interactive proof systems, such automata can verify membership in
all languages with bounded error, outperforming their classical counterparts,
which are known to fail for the palindromes language.
|
[
{
"version": "v1",
"created": "Thu, 27 Nov 2014 17:12:55 GMT"
}
] | 2014-12-01T00:00:00 |
[
[
"Say",
"A. C. Cem",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.993526 |
1411.7663
|
Stephan Schmidt Dr.
|
Stephan Schmidt
|
A Two Stage CVT / Eikonal Convection Mesh Deformation Approach for Large
Nodal Deformations
| null | null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A two step mesh deformation approach for large nodal deformations, typically
arising from non-parametric shape optimization, fluid-structure interaction or
computer graphics, is considered. Two major difficulties, collapsed cells and
an undesirable parameterization, are overcome by considering a special form of
ray tracing paired with a centroid Voronoi reparameterization. The ray
direction is computed by solving an Eikonal equation. With respect to the
Hadamard form of the shape derivative, both steps are within the kernel of the
objective and have no negative impact on the minimizer. The paper concludes
with applications in 2D and 3D fluid dynamics and automatic code generation and
manages to solve these problems without any remeshing. The methodology is
available as a FEniCS shape optimization add-on at
http://www.mathematik.uni-wuerzburg.de/~schmidt/femorph.
|
[
{
"version": "v1",
"created": "Thu, 27 Nov 2014 17:44:25 GMT"
}
] | 2014-12-01T00:00:00 |
[
[
"Schmidt",
"Stephan",
""
]
] |
new_dataset
| 0.993596 |
1411.7816
|
Murat Guzeltepe Mr
|
Murat G\"uzeltepe
|
Erratum to "Lattice constellation and codes from quadratic number
fields" [IEEE Trans. Inform. Theory, vol. 47, No. 4, May. 2001]
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We correct a partial mistake for a metric presented in the article "Lattice
constellation and codes from quadratic number fields" [IEEE Trans. Inform.
Theory, vol. 47, No. 4, May. 2001]. We show that the metric defined in the
article is not true, therefore, this brings about to destroy the encoding and
decoding procedures. Also, we define a proper metric for some codes defined in
the article and show that there exist some $1-$error correcting perfect codes
with respect to this new metric.
|
[
{
"version": "v1",
"created": "Fri, 28 Nov 2014 11:20:04 GMT"
}
] | 2014-12-01T00:00:00 |
[
[
"Güzeltepe",
"Murat",
""
]
] |
new_dataset
| 0.997074 |
1411.7820
|
Vivi Nastase
|
Vivi Nastase and Angela Fahrni
|
Coarse-grained Cross-lingual Alignment of Comparable Texts with Topic
Models and Encyclopedic Knowledge
|
9 pages, 4 figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method for coarse-grained cross-lingual alignment of comparable
texts: segments consisting of contiguous paragraphs that discuss the same theme
(e.g. history, economy) are aligned based on induced multilingual topics. The
method combines three ideas: a two-level LDA model that filters out words that
do not convey themes, an HMM that models the ordering of themes in the
collection of documents, and language-independent concept annotations to serve
as a cross-language bridge and to strengthen the connection between paragraphs
in the same segment through concept relations. The method is evaluated on
English and French data previously used for monolingual alignment. The results
show state-of-the-art performance in both monolingual and cross-lingual
settings.
|
[
{
"version": "v1",
"created": "Fri, 28 Nov 2014 11:33:02 GMT"
}
] | 2014-12-01T00:00:00 |
[
[
"Nastase",
"Vivi",
""
],
[
"Fahrni",
"Angela",
""
]
] |
new_dataset
| 0.99242 |
1403.7970
|
Carlo Novara
|
Carlo Novara
|
Direct design of LPV feedback controllers: technical details and
numerical examples
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper contains technical details of recent results developed by the
author, regarding the design of LPV controllers directly from experimental
data. Two numerical examples are also presented, about control of the Duffing
oscillator and control of a two-degree-of-freedom manipulator.
|
[
{
"version": "v1",
"created": "Mon, 31 Mar 2014 12:25:53 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Sep 2014 12:25:48 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Nov 2014 21:53:55 GMT"
}
] | 2014-11-27T00:00:00 |
[
[
"Novara",
"Carlo",
""
]
] |
new_dataset
| 0.988787 |
1411.7158
|
Martin Berger
|
Richard Prideaux Evans, Martin Berger
|
Cathoristic logic: A modal logic of incompatible propositions
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cathoristic logic is a multi-modal logic where negation is replaced by a
novel operator allowing the expression of incompatible sentences. We present
the syntax and semantics of the logic including complete proof rules, and
establish a number of results such as compactness, a semantic characterisation
of elementary equivalence, the existence of a quadratic-time decision
procedure, and Brandom's incompatibility semantics property. We demonstrate the
usefulness of the logic as a language for knowledge representation.
|
[
{
"version": "v1",
"created": "Wed, 26 Nov 2014 09:57:58 GMT"
}
] | 2014-11-27T00:00:00 |
[
[
"Evans",
"Richard Prideaux",
""
],
[
"Berger",
"Martin",
""
]
] |
new_dataset
| 0.964815 |
1411.7225
|
Abdelkader Baaziz
|
Abdelkader Baaziz, Luc Quoniam
|
Patents used by NPE as an Open Information System in Web 2.0 - Two mini
case studies
|
10 pages, 3 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Information Systems around patents are complex, their study coupled with
a creative vision of "out of the box", overcomes the strict basic functions of
the patent. We have, on several occasions, guiding research around the patent
solely-based on information, since the writing of new patents ; invalidation of
existing patents, the creation of value-added information and their links to
other Information Systems. The traditional R&D based on heavy investments is
one type of technology transfer. But, patent information is also, another
powerful tool of technology transfer, innovation and creativity. Indeed,
conduct research on the patent, from an academic viewpoint, although not always
focusing only on financial revenue, can be considered as a form of "Non
Practicing Entities" (NPE) activity, called rightly or wrongly "Patent Trolls".
We'll see why the term "patent troll" for this activity is controversial and
inappropriate. The research we will describe in this paper falls within this
context. We show two case studies of efficient use of patent information in
Emerging countries, the first concern the pharmaceutical industry in Brazil and
the second, the oil industry in Algeria.
|
[
{
"version": "v1",
"created": "Wed, 26 Nov 2014 13:44:54 GMT"
}
] | 2014-11-27T00:00:00 |
[
[
"Baaziz",
"Abdelkader",
""
],
[
"Quoniam",
"Luc",
""
]
] |
new_dataset
| 0.990502 |
1411.7336
|
Mohammed alzaidi
|
Mohammed A. Talab, Siti Norul Huda Sheikh Abdullah, Bilal Bataineh
|
Edge direction matrixes-based local binar patterns descriptor for shape
pattern recognition
| null | null | null | null |
cs.CV cs.IR
|
http://creativecommons.org/licenses/by/3.0/
|
Shapes and texture image recognition usage is an essential branch of pattern
recognition. It is made up of techniques that aim at extracting information
from images via human knowledge and works. Local Binary Pattern (LBP) ensures
encoding global and local information and scaling invariance by introducing a
look-up table to reflect the uniformity structure of an object. However, edge
direction matrixes (EDMS) only apply global invariant descriptor which employs
first and secondary order relationships. The main idea behind this methodology
is the need of improved recognition capabilities, a goal achieved by the
combinative use of these descriptors. This collaboration aims to make use of
the major advantages each one presents, by simultaneously complementing each
other, in order to elevate their weak points. By using multiple classifier
approaches such as random forest and multi-layer perceptron neural network, the
proposed combinative descriptor are compared with the state of the art
combinative methods based on Gray-Level Co-occurrence matrix (GLCM with EDMS),
LBP and moment invariant on four benchmark dataset MPEG-7 CE-Shape-1, KTH-TIPS
image, Enghlishfnt and Arabic calligraphy . The experiments have shown the
superiority of the introduced descriptor over the GLCM with EDMS, LBP and
moment invariants and other well-known descriptor such as Scale Invariant
Feature Transform from the literature.
|
[
{
"version": "v1",
"created": "Wed, 26 Nov 2014 19:12:33 GMT"
}
] | 2014-11-27T00:00:00 |
[
[
"Talab",
"Mohammed A.",
""
],
[
"Abdullah",
"Siti Norul Huda Sheikh",
""
],
[
"Bataineh",
"Bilal",
""
]
] |
new_dataset
| 0.987507 |
1411.6667
|
Carol Wang
|
Venkatesan Guruswami and Carol Wang
|
Deletion codes in the high-noise and high-rate regimes
| null | null | null | null |
cs.IT cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The noise model of deletions poses significant challenges in coding theory,
with basic questions like the capacity of the binary deletion channel still
being open. In this paper, we study the harder model of worst-case deletions,
with a focus on constructing efficiently decodable codes for the two extreme
regimes of high-noise and high-rate. Specifically, we construct polynomial-time
decodable codes with the following trade-offs (for any eps > 0):
(1) Codes that can correct a fraction 1-eps of deletions with rate poly(eps)
over an alphabet of size poly(1/eps);
(2) Binary codes of rate 1-O~(sqrt(eps)) that can correct a fraction eps of
deletions; and
(3) Binary codes that can be list decoded from a fraction (1/2-eps) of
deletions with rate poly(eps)
Our work is the first to achieve the qualitative goals of correcting a
deletion fraction approaching 1 over bounded alphabets, and correcting a
constant fraction of bit deletions with rate aproaching 1. The above results
bring our understanding of deletion code constructions in these regimes to a
similar level as worst-case errors.
|
[
{
"version": "v1",
"created": "Mon, 24 Nov 2014 21:54:47 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Wang",
"Carol",
""
]
] |
new_dataset
| 0.996669 |
1411.6767
|
Debajyoti Mukhopadhyay Prof.
|
Vijayata Waghmare, Debajyoti Mukhopadhyay
|
Mobile Agent based Market Basket Analysis on Cloud
|
6 pages, 7 figures
| null | null | null |
cs.CY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the design and development of a location-based mobile
shopping application for bakery product shops. Whole application is deployed on
cloud. The three-tier architecture consists of, front-end, middle-ware and
back-end. The front-end level is a location-based mobile shopping application
for android mobile devices, for purchasing bakery products of nearby places.
Front-end level also displays association among the purchased products. The
middle-ware level provides a web service to generate JSON (JavaScript Object
Notation) output from the relational database. It exchanges information and
data between mobile application and servers in cloud. The back-end level
provides the Apache Tomcat Web server and MySQL database. The application also
uses the Google Cloud Messaging for generating and sending notification of
orders to shopkeeper.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 08:51:45 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Waghmare",
"Vijayata",
""
],
[
"Mukhopadhyay",
"Debajyoti",
""
]
] |
new_dataset
| 0.999033 |
1411.6791
|
Tie (Tony) Luo
|
Tie Luo and Vikram Srinivasan and Mehul Motani
|
A Metric for DISH Networks: Analysis, Implications, and Applications
|
Cooperative protocol, availability of cooperation, multi-channel
multi-hop wireless network, multi-channel MAC protocols, distributed
information sharing (DISH), channel bandwidth allocation
|
IEEE Transactions on Mobile Computing, vol. 9, no. 3, pp.
376--389, March 2010
|
10.1109/TMC.2009.138
| null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless networks, node cooperation has been exploited as a data relaying
mechanism for decades. However, the wireless channel allows for much richer
interaction among nodes. In particular, Distributed Information SHaring (DISH)
represents a new improvement to multi-channel MAC protocol design by using a
cooperative element at the control plane. In this approach, nodes exchange
control information to make up for other nodes' insufficient knowledge about
the environment, and thereby aid in their decision making. To date, what is
lacking is a theoretical understanding of DISH. In this paper, we view
cooperation as a network resource and evaluate the availability of cooperation,
$p_{co}$. We first analyze $p_{co}$ in the context of a multi-channel multi-hop
wireless network, and then perform simulations which show that the analysis
accurately characterizes $p_{co}$ as a function of underlying network
parameters. Next, we investigate the correlation between $p_{co}$ and network
metrics such as collision rate, packet delay, and throughput. We find a
near-linear relationship between $p_{co}$ and the metrics, which suggests that
$p_{co}$ can be used as an appropriate performance indicator itself. Finally,
we apply our analysis to solving a channel bandwidth allocation problem, where
we derive optimal schemes and provide general guidelines on bandwidth
allocation for DISH networks.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 10:22:06 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Luo",
"Tie",
""
],
[
"Srinivasan",
"Vikram",
""
],
[
"Motani",
"Mehul",
""
]
] |
new_dataset
| 0.998489 |
1411.6831
|
James Whiting
|
James G.H. Whiting, Ben P.J. de Lacy Costello, Andrew Adamatzky
|
Physarum Chip: Developments in growing computers from slime mould
|
Conference abstract presented at the Unconventional Computation &
Natural Computation 2014. University of Western Ontario, London, Ontario,
Canada, July 14-18. 2 pages
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Phychip project is a collaborative European research initiative to design
and implement computation using the organism Physarum polycephalum; it is
funded by the Seventh Framework Programme (FP7) by the European Commission
within CORDIS and the FET Proactive scheme. Included in this presentation are
details the development of a Physarum based biosensor and biological logic
gate, offering significant advancements in the respective fields. The work
demonstrates the first steps towards Physarum computation and practical
Physarum Biosensor; subsequent work will focus on development of a hybrid
electronic-Physarum device capable of implementing computation.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 12:19:55 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Whiting",
"James G. H.",
""
],
[
"Costello",
"Ben P. J. de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.998417 |
1411.6841
|
Jing Jiang
|
Jing Jiang, Minquan Cheng, Ying Miao and Dianhua Wu
|
Multimedia IPP Codes with Efficient Tracing
|
12 pages, submitted to IEEE transction on information theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary multimedia identifiable parent property codes (binary $t$-MIPPCs) are
used in multimedia fingerprinting schemes where the identification of users
taking part in the averaging collusion attack to illegally redistribute content
is required. In this paper, we first introduce a binary strong multimedia
identifiable parent property code (binary $t$-SMIPPC) whose tracing algorithm
is more efficient than that of a binary $t$-MIPPC. Then a composition
construction for binary $t$-SMIPPCs from $q$-ary $t$-SMIPPCs is provided.
Several infinite series of optimal $q$-ary $t$-SMIPPCs of length $2$ with $t =
2, 3$ are derived from the relationships among $t$-SMIPPCs and other
fingerprinting codes, such as $\overline{t}$-separable codes and $t$-MIPPCs.
Finally, combinatorial properties of $q$-ary $2$-SMIPPCs of length $3$ are
investigated, and optimal $q$-ary $2$-SMIPPCs of length $3$ with $q \equiv 0,
1, 2, 5 \pmod 6$ are constructed.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 12:51:51 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Jiang",
"Jing",
""
],
[
"Cheng",
"Minquan",
""
],
[
"Miao",
"Ying",
""
],
[
"Wu",
"Dianhua",
""
]
] |
new_dataset
| 0.985681 |
1411.6998
|
Diego Arenas
|
Diego Arenas (IFSTTAR/COSYS/ESTAS, LAMIH), Remy Chevirer
(IFSTTAR/COSYS/ESTAS), Said Hanafi (LAMIH), Joaquin Rodriguez
(IFSTTAR/COSYS/ESTAS)
|
Solving the Periodic Timetabling Problem using a Genetic Algorithm
|
XVIII Congreso Panamericano de Ingenier\'ia de Transito, Transporte y
Logistica (PANAM 2014), Jun 2014, Santander, Spain.
http://www.panam2014.unican.es
| null | null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In railway operations, a timetable is established to determine the departure
and arrival times for the trains or other rolling stock at the different
stations or relevant points inside the rail network or a subset of this
network. The elaboration of this timetable is done to respond to the commercial
requirements for both passenger and freight traffic, but also it must respect a
set of security and capacity constraints associated with the railway network,
rolling stock and legislation. Combining these requirements and constraints, as
well as the important number of trains and schedules to plan, makes the
preparation of a feasible timetable a complex and time-consuming process, that
normally takes several months to be completed. This article addresses the
problem of generating periodic timetables, which means that the involved trains
operate in a recurrent pattern. For instance, the trains belonging to the same
train line, depart from some station every 15 minutes or one hour. To tackle
the problem, we present a constraint-based model suitable for this kind of
problem. Then, we propose a genetic algorithm, allowing a rapid generation of
feasible periodic timetables. Finally, two case studies are presented, the
first, describing a sub-set of the Netherlands rail network, and the second a
large portion of the Nord-pas-de-Calais regional rail network, both of them are
then solved using our algorithm and the results are presented and discussed.
|
[
{
"version": "v1",
"created": "Mon, 24 Nov 2014 15:24:25 GMT"
}
] | 2014-11-26T00:00:00 |
[
[
"Arenas",
"Diego",
"",
"IFSTTAR/COSYS/ESTAS, LAMIH"
],
[
"Chevirer",
"Remy",
"",
"IFSTTAR/COSYS/ESTAS"
],
[
"Hanafi",
"Said",
"",
"LAMIH"
],
[
"Rodriguez",
"Joaquin",
"",
"IFSTTAR/COSYS/ESTAS"
]
] |
new_dataset
| 0.987432 |
1005.0129
|
Mikhail Volkov
|
Dmitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov
|
Slowly synchronizing automata and digraphs
|
13 pages, 5 figures
|
In: A. Kucera, P. Hlineny (eds.), Mathematical Foundations of
Computer Science [Lect. Notes Comp. Sci., 6281], Springer-Verlag, 2010, 55-65
|
10.1007/978-3-642-15155-2_7
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present several infinite series of synchronizing automata for which the
minimum length of reset words is close to the square of the number of states.
These automata are closely related to primitive digraphs with large exponent.
|
[
{
"version": "v1",
"created": "Sun, 2 May 2010 09:04:27 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Ananichev",
"Dmitry S.",
""
],
[
"Gusev",
"Vladimir V.",
""
],
[
"Volkov",
"Mikhail V.",
""
]
] |
new_dataset
| 0.998455 |
1302.5793
|
Mikhail Volkov
|
Dmitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov
|
Primitive digraphs with large exponents and slowly synchronizing
automata
|
23 pages, 11 figures, 3 tables. This is a translation (with a
slightly updated bibliography) of the authors' paper published in Russian in:
Zapiski Nauchnyh Seminarov POMI [Kombinatorika i Teorija Grafov. IV], Vol.
402, 9-39 (2012), see ftp://ftp.pdmi.ras.ru/pub/publicat/znsl/v402/p009.pdf
Version 2: a few typos are corrected
|
J. Math. Sci. 192 (2013), 263-278
|
10.1007/s10958-013-1392-8
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present several infinite series of synchronizing automata for which the
minimum length of reset words is close to the square of the number of states.
All these automata are tightly related to primitive digraphs with large
exponent.
|
[
{
"version": "v1",
"created": "Sat, 23 Feb 2013 12:56:16 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Apr 2013 16:09:16 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Ananichev",
"Dmitry S.",
""
],
[
"Gusev",
"Vladimir V.",
""
],
[
"Volkov",
"Mikhail V.",
""
]
] |
new_dataset
| 0.992489 |
1306.3414
|
Ella Gale
|
Ella Gale, Andrew Adamatzky and Ben de Lacy Costello
|
Slime Mould Memristors
|
14 pages, 6 figures
| null |
10.1007/s12668-014-0156-3
| null |
cs.ET cond-mat.other physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In laboratory experiments we demonstrate that protoplasmic tubes of acellular
slime mould \emph{Physarum polycephalum} show current versus voltage profiles
consistent with memristive systems and that the effect is due to the living
protoplasm of the mould. This complements previous findings on memristive
properties of other living systems (human skin and blood) and contributes to
development of self-growing bio-electronic circuits. Distinctive asymmetric
$V$-$I$ curves which were occasionally observed when the internal current is on
the same order as the driven current, are well-modelled by the concept of
active memristors.
|
[
{
"version": "v1",
"created": "Fri, 14 Jun 2013 14:44:51 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Apr 2014 14:02:10 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Gale",
"Ella",
""
],
[
"Adamatzky",
"Andrew",
""
],
[
"Costello",
"Ben de Lacy",
""
]
] |
new_dataset
| 0.997852 |
1411.6027
|
Bernhard Rumpe
|
Radu Grosu, Bernhard Rumpe
|
Concurrent Timed Port Automata
|
34 pages, 3 figures, Technical Report TUM-I9533, TU Munich, 1995
| null | null |
TUM-I9533
|
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new and powerful class of automata which are explicitly
concurrent and allow a very simple definition of composition. The novelty of
these automata is their time-synchronous message-asynchronous communication
mechanism. Time synchrony is obtained by using global clock. Message asynchrony
is obtained by requiring the automata to react to every input. Explicit
concurrency is obtained by marking each transition with a set of input and
output messages. We compare these automata with a history based approach which
uses the same communication mechanism and show that they are equivalent.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 13:07:05 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Grosu",
"Radu",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.997394 |
1411.6087
|
Tao Li
|
Tao Li, Pingyi Fan and Khaled Ben Letaief
|
Wireless Communication System with RF-based Energy Harvesting: From
Information Theory to Green System
|
12 pages, 12 figures, a short version will appear in GLOBECOM 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Harvesting energy from ambient environment is a new promising solution to
free electronic devices from electric wire or limited-lifetime battery, which
may find very significant applications in sensor networks and body-area
networks. This paper mainly investigate the fundamental limits of information
transmission in wireless communication system with RF-based energy harvesting,
in which a master node acts not only as an information source but also an
energy source for child node while only information is transmitted back from
child to master node. Three typical structures: optimum receiver, orthogonal
receiver and power splitting receiver are considered where two way information
transmission between two nodes under an unique external power supply constraint
at master node are jointly investigated in the viewpoint of systemic level. We
explicitly characterize the achievable capacity-rate region and also discuss
the effect of signal processing power consumption at child node. The optimal
transmission strategy corresponding to the most energy-efficient status, namely
the point on the boundary of achievable capacity-rate region, is derived with
help of conditional capacity function. Simulation confirms the substantial
gains of employing optimal transmission strategy and optimum receiver
structure. Besides, a typical application on minimizing required transmit power
to green system is presented.
|
[
{
"version": "v1",
"created": "Sat, 22 Nov 2014 06:31:43 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Li",
"Tao",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Letaief",
"Khaled Ben",
""
]
] |
new_dataset
| 0.965638 |
1411.6172
|
Abhishek Sinha
|
Abhishek Sinha, Georgios Paschos, Chih-ping Li and Eytan Modiano
|
Throughput-Optimal Broadcast on Directed Acyclic Graphs
|
To appear in the proceedings of INFOCOM, 2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of broadcasting packets in wireless networks. At each
time slot, a network controller activates non-interfering links and forwards
packets to all nodes at a common rate; the maximum rate is referred to as the
broadcast capacity of the wireless network. Existing policies achieve the
broadcast capacity by balancing traffic over a set of spanning trees, which are
difficult to maintain in a large and time-varying wireless network. We propose
a new dynamic algorithm that achieves the broadcast capacity when the
underlying network topology is a directed acyclic graph (DAG). This algorithm
utilizes local queue-length information, does not use any global topological
structures such as spanning trees, and uses the idea of in-order packet
delivery to all network nodes. Although the in-order packet delivery constraint
leads to degraded throughput in cyclic graphs, we show that it is throughput
optimal in DAGs and can be exploited to simplify the design and analysis of
optimal algorithms. Our simulation results show that the proposed algorithm has
superior delay performance as compared to tree-based approaches.
|
[
{
"version": "v1",
"created": "Sat, 22 Nov 2014 22:07:54 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Sinha",
"Abhishek",
""
],
[
"Paschos",
"Georgios",
""
],
[
"Li",
"Chih-ping",
""
],
[
"Modiano",
"Eytan",
""
]
] |
new_dataset
| 0.987318 |
1411.6185
|
Fidel Barrera-Cruz
|
Fidel Barrera-Cruz and Penny Haxell and Anna Lubiw
|
Morphing Planar Graph Drawings with Unidirectional Moves
|
13 pages, 9 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alamdari et al. showed that given two straight-line planar drawings of a
graph, there is a morph between them that preserves planarity and consists of a
polynomial number of steps where each step is a \emph{linear morph} that moves
each vertex at constant speed along a straight line. An important step in their
proof consists of converting a \emph{pseudo-morph} (in which contractions are
allowed) to a true morph. Here we introduce the notion of \emph{unidirectional
morphing} step, where the vertices move along lines that all have the same
direction. Our main result is to show that any planarity preserving
pseudo-morph consisting of unidirectional steps and contraction of low degree
vertices can be turned into a true morph without increasing the number of
steps. Using this, we strengthen Alamdari et al.'s result to use only
unidirectional morphs, and in the process we simplify the proof.
|
[
{
"version": "v1",
"created": "Sun, 23 Nov 2014 03:12:26 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Barrera-Cruz",
"Fidel",
""
],
[
"Haxell",
"Penny",
""
],
[
"Lubiw",
"Anna",
""
]
] |
new_dataset
| 0.979801 |
1411.6328
|
Zhiying Wang
|
Zhiying Wang, Itzhak Tamo, and Jehoshua Bruck
|
Explicit MDS Codes for Optimal Repair Bandwidth
|
17 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MDS codes are erasure-correcting codes that can correct the maximum number of
erasures for a given number of redundancy or parity symbols. If an MDS code has
$r$ parities and no more than $r$ erasures occur, then by transmitting all the
remaining data in the code, the original information can be recovered. However,
it was shown that in order to recover a single symbol erasure, only a fraction
of $1/r$ of the information needs to be transmitted. This fraction is called
the repair bandwidth (fraction). Explicit code constructions were given in
previous works. If we view each symbol in the code as a vector or a column over
some field, then the code forms a 2D array and such codes are especially widely
used in storage systems. In this paper, we address the following question:
given the length of the column $l$, number of parities $r$, can we construct
high-rate MDS array codes with optimal repair bandwidth of $1/r$, whose code
length is as long as possible? In this paper, we give code constructions such
that the code length is $(r+1)\log_r l$.
|
[
{
"version": "v1",
"created": "Mon, 24 Nov 2014 02:28:06 GMT"
}
] | 2014-11-25T00:00:00 |
[
[
"Wang",
"Zhiying",
""
],
[
"Tamo",
"Itzhak",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.998773 |
1411.5127
|
Oscar Stiffelman
|
Oscar Stiffelman
|
PivotCompress: Compression by Sorting
|
preprint, compression by sorting, quicksort as universal code; this
version describes the permutation vector and its inverse
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sorted data is usually easier to compress than unsorted permutations of the
same data. This motivates a simple compression scheme: specify the sorted
permutation of the data along with a representation of the sorted data
compressed recursively. The sorted permutation can be specified by recording
the decisions made by quicksort. If the size of the data is known, then the
quicksort decisions describe the data at a rate that is nearly as efficient as
the minimal prefix-free code for the distribution, which is bounded by the
entropy of the distribution. This is possible even though the distribution is
unknown ahead of time. Used in this way, quicksort acts as a universal code in
that it is asymptotically optimal for any stationary source. The Shannon
entropy is a lower bound when describing stochastic, independent symbols.
However, it is possible to encode non-uniform, finite strings below the entropy
of the sample distribution by also encoding symbol counts because the values in
the sequence are no longer independent once the counts are known. The key
insight is that sparse quicksort comparison vectors can also be compressed to
achieve an even lower rate when data is highly non-uniform while incurring only
a modest penalty when data is random.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 06:48:20 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Nov 2014 01:37:51 GMT"
}
] | 2014-11-24T00:00:00 |
[
[
"Stiffelman",
"Oscar",
""
]
] |
new_dataset
| 0.979006 |
1411.5765
|
Franck Dernoncourt
|
Franck Dernoncourt
|
TrackMania is NP-complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that completing an untimed, unbounded track in TrackMania Nations
Forever is NP-complete by using a reduction from 3-SAT and showing that a
solution can be checked in polynomial time.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 04:08:28 GMT"
}
] | 2014-11-24T00:00:00 |
[
[
"Dernoncourt",
"Franck",
""
]
] |
new_dataset
| 0.998492 |
1411.5782
|
Chong Shangguan
|
Chong Shangguan, Xin Wang, Gennian Ge and Ying Miao
|
New Bounds For Frameproof Codes
|
7 pages, submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frameproof codes are used to fingerprint digital data. It can prevent
copyrighted materials from unauthorized use. In this paper, we study upper and
lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size
$q$. The upper bound is based on a combinatorial approach and the lower bound
is based on a probabilistic construction. Both bounds can improve previous
results when $q$ is small compared to $w$, say $cq\leq w$ for some constant
$c\leq q$. Furthermore, we pay special attention to binary frameproof codes. We
show a binary $w$-frameproof code of length $N$ can not have more than $N$
codewords if $N<\binom{w+1}{2}$.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 07:47:09 GMT"
}
] | 2014-11-24T00:00:00 |
[
[
"Shangguan",
"Chong",
""
],
[
"Wang",
"Xin",
""
],
[
"Ge",
"Gennian",
""
],
[
"Miao",
"Ying",
""
]
] |
new_dataset
| 0.967132 |
1411.5951
|
Tom van der Zanden
|
Tom C. van der Zanden and Hans L. Bodlaender
|
PSPACE-completeness of Bloxorz and of Games with 2-Buttons
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bloxorz is an online puzzle game where players move a 1 by 1 by 2 block by
tilting it on a subset of the two dimensional grid. Bloxorz features switches
that open and close trapdoors. The puzzle is to move the block from its initial
position to an upright position on the destination square. We show that the
problem of deciding whether a given Bloxorz level is solvable is
PSPACE-complete and that this remains so even when all trapdoors are initially
closed or all trapdoors are initially open. We also answer an open question of
Viglietta, showing that 2-buttons are sufficient for PSPACE-hardness of general
puzzle games. We also examine the hardness of some variants of Bloxorz,
including variants where the block is a 1 by 1 by 1 cube, and variants with
single-use tiles.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 16:46:40 GMT"
}
] | 2014-11-24T00:00:00 |
[
[
"van der Zanden",
"Tom C.",
""
],
[
"Bodlaender",
"Hans L.",
""
]
] |
new_dataset
| 0.997801 |
1007.4053
|
Harry Enke
|
Harry Enke (AIP), Matthias Steinmetz (AIP), Hans-Martin Adorf (MPA),
Alexander Beck-Ratzka (AEI), Frank Breitling (AIP), Thomas Bruesemeister
(ZAH), Arthur Carlson (MPE), Torsten Ensslin (MPA), Mikael Hoegqvist (ZIB),
Iliya Nickelt (AIP), Thomas Radke (AEI), Alexander Reinefeld (ZIB), Angelika
Reiser (TUM), Tobias Scholl (TUM), Rainer Spurzem (ZAH, NAOC), Juergen
Steinacker (ZAH), Wolfgang Voges (MPE), Joachim Wambsganss (ZAH), Steve White
(AIP)
|
AstroGrid-D: Grid Technology for Astronomical Science
|
14 pages, 12 figures Subjects: data analysis, image processing,
robotic telescopes, simulations, grid. Accepted for publication in New
Astronomy
|
New Astron.16:79-93,2011
|
10.1016/j.newast.2010.07.005
| null |
cs.DC astro-ph.IM cs.DB cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present status and results of AstroGrid-D, a joint effort of
astrophysicists and computer scientists to employ grid technology for
scientific applications. AstroGrid-D provides access to a network of
distributed machines with a set of commands as well as software interfaces. It
allows simple use of computer and storage facilities and to schedule or monitor
compute tasks and data management. It is based on the Globus Toolkit middleware
(GT4). Chapter 1 describes the context which led to the demand for advanced
software solutions in Astrophysics, and we state the goals of the project. We
then present characteristic astrophysical applications that have been
implemented on AstroGrid-D in chapter 2. We describe simulations of different
complexity, compute-intensive calculations running on multiple sites, and
advanced applications for specific scientific purposes, such as a connection to
robotic telescopes. We can show from these examples how grid execution improves
e.g. the scientific workflow. Chapter 3 explains the software tools and
services that we adapted or newly developed. Section 3.1 is focused on the
administrative aspects of the infrastructure, to manage users and monitor
activity. Section 3.2 characterises the central components of our architecture:
The AstroGrid-D information service to collect and store metadata, a file
management system, the data management system, and a job manager for automatic
submission of compute tasks. We summarise the successfully established
infrastructure in chapter 4, concluding with our future plans to establish
AstroGrid-D as a platform of modern e-Astronomy.
|
[
{
"version": "v1",
"created": "Fri, 23 Jul 2010 06:50:52 GMT"
}
] | 2014-11-21T00:00:00 |
[
[
"Enke",
"Harry",
"",
"AIP"
],
[
"Steinmetz",
"Matthias",
"",
"AIP"
],
[
"Adorf",
"Hans-Martin",
"",
"MPA"
],
[
"Beck-Ratzka",
"Alexander",
"",
"AEI"
],
[
"Breitling",
"Frank",
"",
"AIP"
],
[
"Bruesemeister",
"Thomas",
"",
"ZAH"
],
[
"Carlson",
"Arthur",
"",
"MPE"
],
[
"Ensslin",
"Torsten",
"",
"MPA"
],
[
"Hoegqvist",
"Mikael",
"",
"ZIB"
],
[
"Nickelt",
"Iliya",
"",
"AIP"
],
[
"Radke",
"Thomas",
"",
"AEI"
],
[
"Reinefeld",
"Alexander",
"",
"ZIB"
],
[
"Reiser",
"Angelika",
"",
"TUM"
],
[
"Scholl",
"Tobias",
"",
"TUM"
],
[
"Spurzem",
"Rainer",
"",
"ZAH, NAOC"
],
[
"Steinacker",
"Juergen",
"",
"ZAH"
],
[
"Voges",
"Wolfgang",
"",
"MPE"
],
[
"Wambsganss",
"Joachim",
"",
"ZAH"
],
[
"White",
"Steve",
"",
"AIP"
]
] |
new_dataset
| 0.997833 |
1309.5049
|
Ruizhi Liao
|
Ruizhi Liao, Boris Bellalta, Trang Cao Minh, Jaume Barcelo, Miquel
Oliver
|
Uni-MUMAC: A Unified Down/Up-link MU-MIMO MAC Protocol for IEEE 802.11ac
WLANs
|
27 pages, 16 figures
| null |
10.1007/s11276-014-0861-4
| null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Due to the dominance of the downlink traffic in Wireless Local Area Networks
(WLANs), a large number of previous research efforts have been put to enhance
the transmission from the Access Point (AP) to stations (STAs). The downlink
Multi-User Multiple-Input Multiple-Output (MU-MIMO) technique, supported by the
latest IEEE amendment-802.11ac, is considered as one of the key enhancements
leading WLANs to the Gigabit era. However, as cloud uploading services,
Peer-to-Peer (P2P) and telepresence applications get popular, the need for a
higher uplink capacity becomes inevitable.
In this paper, a unified down/up-link Medium Access Control (MAC) protocol
called Uni-MUMAC is proposed to enhance the performance of IEEE 802.11ac WLANs
by exploring the multi-user spatial multiplexing technique. Specifically, in
the downlink, we implement an IEEE 802.11ac-compliant MU-MIMO transmission
scheme to allow the AP to simultaneously send frames to a group of STAs. In the
uplink, we extend the traditional one round channel access contention to two
rounds, which coordinate multiple STAs to transmit frames to the AP
simultaneously. 2-nd round Contention Window (CW2nd), a parameter that makes
the length of the 2-nd contention round elastic according to the traffic
condition, is introduced. Uni-MUMAC is evaluated through simulations in
saturated and non-saturated conditions when both downlink and uplink traffic
are present in the system. We also propose an analytic saturation model to
validate the simulation results. By properly setting CW2nd and other
parameters, Uni-MUMAC is compared to a prominent multi-user transmission scheme
in the literature. The results exhibit that Uni-MUMAC not only performs well in
the downlink-dominant scenario, but it is also able to balance both the
downlink and uplink throughput in the emerging uplink bandwidth-hungry
scenario.
|
[
{
"version": "v1",
"created": "Thu, 19 Sep 2013 16:49:16 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Dec 2013 14:02:56 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Sep 2014 10:08:15 GMT"
}
] | 2014-11-21T00:00:00 |
[
[
"Liao",
"Ruizhi",
""
],
[
"Bellalta",
"Boris",
""
],
[
"Minh",
"Trang Cao",
""
],
[
"Barcelo",
"Jaume",
""
],
[
"Oliver",
"Miquel",
""
]
] |
new_dataset
| 0.995062 |
1411.5394
|
Shyamnath Gollakota
|
Rajalakshmi Nandakumar and Bryce Kellogg and Shyamnath Gollakota
|
Wi-Fi Gesture Recognition on Existing Devices
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the first wireless gesture recognition system that
operates using existingWi-Fi signals and devices. To achieve this, we first
identify limitations of existing wireless gesture recognition approaches that
limit their applicability to Wi-Fi. We then introduce algorithms that can
classify gestures using information that is readily available on Wi-Fi devices.
We demonstrate the feasibility of our design using a prototype implementation
on off-the-shelf Wi-Fi devices. Our results show that we can achieve a
classification accuracy of 91% while classifying four gestures across six
participants, without the need for per-participant training. Finally, we show
the feasibility of gesture recognition in non-line-ofsight situations with the
participants interacting with a Wi-Fi device placed in a backpack.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 21:55:20 GMT"
}
] | 2014-11-21T00:00:00 |
[
[
"Nandakumar",
"Rajalakshmi",
""
],
[
"Kellogg",
"Bryce",
""
],
[
"Gollakota",
"Shyamnath",
""
]
] |
new_dataset
| 0.981942 |
1410.0745
|
Robinson Piramuthu Robinson Piramuthu
|
Qiaosong Wang, Vignesh Jagadeesh, Bryan Ressler, Robinson Piramuthu
|
Im2Fit: Fast 3D Model Fitting and Anthropometrics using Single Consumer
Depth Camera and Synthetic Data
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent advances in consumer depth sensors have created many opportunities for
human body measurement and modeling. Estimation of 3D body shape is
particularly useful for fashion e-commerce applications such as virtual try-on
or fit personalization. In this paper, we propose a method for capturing
accurate human body shape and anthropometrics from a single consumer grade
depth sensor. We first generate a large dataset of synthetic 3D human body
models using real-world body size distributions. Next, we estimate key body
measurements from a single monocular depth image. We combine body measurement
estimates with local geometry features around key joint positions to form a
robust multi-dimensional feature vector. This allows us to conduct a fast
nearest-neighbor search to every sample in the dataset and return the closest
one. Compared to existing methods, our approach is able to predict accurate
full body parameters from a partial view using measurement parameters learned
from the synthetic dataset. Furthermore, our system is capable of generating 3D
human mesh models in real-time, which is significantly faster than methods
which attempt to model shape and pose deformations. To validate the efficiency
and applicability of our system, we collected a dataset that contains frontal
and back scans of 83 clothed people with ground truth height and weight.
Experiments on real-world dataset show that the proposed method can achieve
real-time performance with competing results achieving an average error of 1.9
cm in estimated measurements.
|
[
{
"version": "v1",
"created": "Fri, 3 Oct 2014 02:33:08 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Nov 2014 20:30:32 GMT"
}
] | 2014-11-20T00:00:00 |
[
[
"Wang",
"Qiaosong",
""
],
[
"Jagadeesh",
"Vignesh",
""
],
[
"Ressler",
"Bryan",
""
],
[
"Piramuthu",
"Robinson",
""
]
] |
new_dataset
| 0.999429 |
1411.5078
|
Triet Vo-Huu
|
Triet D. Vo-Huu and Guevara Noubir
|
CBM: A Crypto-Coded Modulation Scheme for Rate Information Concealing
and Robustness Boosting
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exposing the rate information of wireless transmission enables highly
efficient attacks that can severely degrade the performance of a network at
very low cost. In this paper, we introduce an integrated solution to conceal
the rate information of wireless transmissions while simultaneously boosting
the resiliency against interference. The proposed solution is based on a
generalization of Trellis Coded Modulation combined with Cryptographic
Interleaving. We develop algorithms for discovering explicit codes for
concealing any modulation in {BPSK, QPSK, 8-PSK, 16-QAM, 64-QAM}. We
demonstrate that in most cases this modulation hiding scheme has the side
effect of boosting resiliency by up to 8.5dB.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 00:14:29 GMT"
}
] | 2014-11-20T00:00:00 |
[
[
"Vo-Huu",
"Triet D.",
""
],
[
"Noubir",
"Guevara",
""
]
] |
new_dataset
| 0.998633 |
1411.5161
|
Achmad Benny Mutiara
|
A.B. Mutiara, R. Refianti, B.A. Witono
|
Developing a SAAS-Cloud Integrated Development Environment (IDE) for C,
C++, and Java
|
9 pages. arXiv admin note: text overlap with arXiv:1410.1159,
arXiv:1304.4047 by other authors
|
Journal of Theoretical and Applied Information Technology, Vol. 68
No.1, 2014
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud era brought revolution of computerization world. People could access
their data from anywhere and anytime with different devices. One of the cloud's
model is Software as a Service, which capable to provide applications that run
on a cloud infrastructure.An IDE (Integrated Development Environment) is the
most popular tool to develop application in the network or single computer
development. By installing IDE in each computer of the network could causes the
lot of time and budget spending. The objective of the research is developing an
efficient cloud based IDE. The IDE could compile the code which sent from
client browser through SaaS IDE to the server and send it back to the client.
The method that used in the research is the System Development Life-Cycle:
Waterfall and Unified Model Language as system designing tool. The research
successfully produced the cloud-based SaaS IDE with excellent result from
several testing in local network and internet.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 09:55:44 GMT"
}
] | 2014-11-20T00:00:00 |
[
[
"Mutiara",
"A. B.",
""
],
[
"Refianti",
"R.",
""
],
[
"Witono",
"B. A.",
""
]
] |
new_dataset
| 0.998048 |
1411.5255
|
Alex James Dr
|
Alex Pappachen James, Dinesh S. Kumar, Arun Ajayan
|
Threshold Logic Computing: Memristive-CMOS Circuits for Fast Fourier
Transform and Vedic Multiplication
|
5 Pages, IEEE Transactions on Very Large Scale Integration (VLSI)
Systems, 2014
| null |
10.1109/TVLSI.2014.2371857
| null |
cs.ET cs.AR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Brain inspired circuits can provide an alternative solution to implement
computing architectures taking advantage of fault tolerance and generalisation
ability of logic gates. In this brief, we advance over the memristive threshold
circuit configuration consisting of memristive averaging circuit in combination
with operational amplifier and/or CMOS inverters in application to realizing
complex computing circuits. The developed memristive threshold logic gates are
used for designing FFT and multiplication circuits useful for modern
microprocessors. Overall, the proposed threshold logic outperforms previous
memristive-CMOS logic cells on every aspect, however, indicate a lower chip
area, lower THD, and controllable leakage power, but a higher power dissipation
with respect to CMOS logic.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 15:36:23 GMT"
}
] | 2014-11-20T00:00:00 |
[
[
"James",
"Alex Pappachen",
""
],
[
"Kumar",
"Dinesh S.",
""
],
[
"Ajayan",
"Arun",
""
]
] |
new_dataset
| 0.998842 |
1411.5343
|
Subodh Paudel
|
Subodh Paudel, Jagan Nath Shrestha, Fernando J Neto, Jorge AF
Ferreira, Muna Adhikari
|
Optimization of Hybrid PV/Wind Power System for Remote Telecom Station
| null | null |
10.1109/ICPES.2011.6156618
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid depletion of fossil fuel resources and environmental concerns has
given awareness on generation of renewable energy resources. Among the various
renewable resources, hybrid solar and wind energy seems to be promising
solutions to provide reliable power supply with improved system efficiency and
reduced storage requirements for stand-alone applications. This paper presents
a feasibility assessment and optimum size of photovoltaic (PV) array, wind
turbine and battery bank for a standalone hybrid Solar/Wind Power system
(HSWPS) at remote telecom station of Nepal at Latitude (27{\deg}23'50") and
Longitude (86{\deg}44'23") consisting a telecommunication load of Very Small
Aperture Terminal (VSAT), Repeater station and Code Division Multiple Access
Base Transceiver Station (CDMA 2C10 BTS). In any RES based system, the
feasibility assessment is considered as the first step analysis. In this work,
feasibility analysis is carried through hybrid optimization model for electric
renewables (HOMER) and mathematical models were implemented in the MATLAB
environment to perform the optimal configuration for a given load and a desired
loss of power supply probability (LPSP) from a set of systems components with
the lowest value of cost function defined in terms of reliability and levelized
unit electricity cost (LUCE). The simulation results for the existing and the
proposed models are compared. The simulation results shows that existing
architecture consisting of 6.12 kW KC85T photovoltaic modules, 1kW H3.1 wind
turbine and 1600 Ah GFM-800 battery bank have a 36.6% of unmet load during a
year. On the other hand, the proposed system includes 1kW *2 H3.1 Wind turbine,
8.05 kW TSM-175DA01 photovoltaic modules and 1125 Ah T-105 battery bank with
system reliability of 99.99% with a significant cost reduction as well as
reliable energy production.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 20:01:44 GMT"
}
] | 2014-11-20T00:00:00 |
[
[
"Paudel",
"Subodh",
""
],
[
"Shrestha",
"Jagan Nath",
""
],
[
"Neto",
"Fernando J",
""
],
[
"Ferreira",
"Jorge AF",
""
],
[
"Adhikari",
"Muna",
""
]
] |
new_dataset
| 0.980625 |
1411.4670
|
Mohamed Hussein
|
Mohamed E. Hussein and Marwan Torki and Ahmed Elsallamy and Mahmoud
Fayyaz
|
AlexU-Word: A New Dataset for Isolated-Word Closed-Vocabulary Offline
Arabic Handwriting Recognition
|
6 pages, 8 figure, and 6 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce the first phase of a new dataset for offline
Arabic handwriting recognition. The aim is to collect a very large dataset of
isolated Arabic words that covers all letters of the alphabet in all possible
shapes using a small number of simple words. The end goal is to collect a very
large dataset of segmented letter images, which can be used to build and
evaluate Arabic handwriting recognition systems that are based on segmented
letter recognition. The current version of the dataset contains $25114$ samples
of $109$ unique Arabic words that cover all possible shapes of all alphabet
letters. The samples were collected from $907$ writers. In its current form,
the dataset can be used for the problem of closed-vocabulary word recognition.
We evaluated a number of window-based descriptors and classifiers on this task
and obtained an accuracy of $92.16\%$ using a SIFT-based descriptor and ANN.
|
[
{
"version": "v1",
"created": "Mon, 17 Nov 2014 21:23:26 GMT"
}
] | 2014-11-19T00:00:00 |
[
[
"Hussein",
"Mohamed E.",
""
],
[
"Torki",
"Marwan",
""
],
[
"Elsallamy",
"Ahmed",
""
],
[
"Fayyaz",
"Mahmoud",
""
]
] |
new_dataset
| 0.999883 |
1411.4692
|
Ishay Haviv
|
Ishay Haviv, Ning Xie
|
Sunflowers and Testing Triangle-Freeness of Functions
|
21 pages, ITCS 2015
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A function $f: \mathbb{F}_2^n \rightarrow \{0,1\}$ is triangle-free if there
are no $x_1,x_2,x_3 \in \mathbb{F}_2^n$ satisfying $x_1+x_2+x_3=0$ and
$f(x_1)=f(x_2)=f(x_3)=1$. In testing triangle-freeness, the goal is to
distinguish with high probability triangle-free functions from those that are
$\varepsilon$-far from being triangle-free. It was shown by Green that the
query complexity of the canonical tester for the problem is upper bounded by a
function that depends only on $\varepsilon$ (GAFA, 2005), however the best
known upper bound is a tower type function of $1/\varepsilon$. The best known
lower bound on the query complexity of the canonical tester is
$1/\varepsilon^{13.239}$ (Fu and Kleinberg, RANDOM, 2014).
In this work we introduce a new approach to proving lower bounds on the query
complexity of triangle-freeness. We relate the problem to combinatorial
questions on collections of vectors in $\mathbb{Z}_D^n$ and to sunflower
conjectures studied by Alon, Shpilka, and Umans (Comput. Complex., 2013). The
relations yield that a refutation of the Weak Sunflower Conjecture over
$\mathbb{Z}_4$ implies a super-polynomial lower bound on the query complexity
of the canonical tester for triangle-freeness. Our results are extended to
testing $k$-cycle-freeness of functions with domain $\mathbb{F}_p^n$ for every
$k \geq 3$ and a prime $p$. In addition, we generalize the lower bound of Fu
and Kleinberg to $k$-cycle-freeness for $k \geq 4$ by generalizing the
construction of uniquely solvable puzzles due to Coppersmith and Winograd (J.
Symbolic Comput., 1990).
|
[
{
"version": "v1",
"created": "Mon, 17 Nov 2014 23:04:38 GMT"
}
] | 2014-11-19T00:00:00 |
[
[
"Haviv",
"Ishay",
""
],
[
"Xie",
"Ning",
""
]
] |
new_dataset
| 0.974741 |
1411.4956
|
Etienne Burdet
|
Etienne Burdet, Morgane Colombert, Denis Morand, Youssef Diab
|
Integrated canopy, building energy and radiosity model for 3D urban
design
| null | null | null | null |
cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an integrated, three dimensional, model of urban canopy, building
energy and radiosity, for early stage urban designs and test it on four urban
morphologies. All sub-models share a common descriptions of the urban
morphology, similar to 3D urban design master plans and have simple parameters.
The canopy model is a multilayer model, with a new discrete layer approach that
does not rely on simplified geometry such as canyon or regular arrays. The
building energy model is a simplified RC equivalent model, with no hypotheses
on internal zoning or wall composition. We use the CitySim software for the
radiosity model. We study the effects of convexity, the number of buildings and
building height, at constant density and thermal characteristics. Our results
suggest that careful three dimensional morphology design can reduce heat demand
by a factor of 2, especially by improving insolation of lower levels. The most
energy efficient morphology in our simulations has both the highest
surface/volume ratio and the biggest impact on the urban climate.
|
[
{
"version": "v1",
"created": "Mon, 17 Nov 2014 14:20:14 GMT"
}
] | 2014-11-19T00:00:00 |
[
[
"Burdet",
"Etienne",
""
],
[
"Colombert",
"Morgane",
""
],
[
"Morand",
"Denis",
""
],
[
"Diab",
"Youssef",
""
]
] |
new_dataset
| 0.983124 |
1208.5188
|
Andrew King
|
Katherine Edwards and Andrew D. King
|
A superlocal version of Reed's Conjecture
|
17 pages, 3 figures. arXiv admin note: substantial text overlap with
arXiv:1109.2112
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reed's well-known $\omega$, $\Delta$, $\chi$ conjecture proposes that every
graph satisfies $\chi \leq \lceil \frac 12(\Delta+1+\omega)\rceil$. The second
author formulated a {\em local strengthening} of this conjecture that considers
a bound supplied by the neighbourhood of a single vertex. Following the idea
that the chromatic number cannot be greatly affected by any particular stable
set of vertices, we propose a further strengthening that considers a bound
supplied by the neighbourhoods of two adjacent vertices. We provide some
fundamental evidence in support, namely that the stronger bound holds in the
fractional relaxation and holds for both quasi-line graphs and graphs with
stability number two. We also conjecture that in the fractional version, we can
push the locality even further.
|
[
{
"version": "v1",
"created": "Sun, 26 Aug 2012 04:01:31 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Nov 2014 00:23:25 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Edwards",
"Katherine",
""
],
[
"King",
"Andrew D.",
""
]
] |
new_dataset
| 0.997187 |
1407.7061
|
Ciaran McCreesh
|
Ciaran McCreesh and Patrick Prosser
|
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique
Problem
|
Author-final version. Accepted to Optimization Letters
| null | null | null |
cs.DS cs.DC cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The maximum labelled clique problem is a variant of the maximum clique
problem where edges in the graph are given labels, and we are not allowed to
use more than a certain number of distinct labels in a solution. We introduce a
new branch-and-bound algorithm for the problem, and explain how it may be
parallelised. We evaluate an implementation on a set of benchmark instances,
and show that it is consistently faster than previously published results,
sometimes by four or five orders of magnitude.
|
[
{
"version": "v1",
"created": "Fri, 25 Jul 2014 21:11:13 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Nov 2014 14:46:09 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"McCreesh",
"Ciaran",
""
],
[
"Prosser",
"Patrick",
""
]
] |
new_dataset
| 0.995539 |
1409.4744
|
Jun Lin
|
Jun Lin and Zhiyuan Yan
|
An Efficient List Decoder Architecture for Polar Codes
|
12 pages, accepted by IEEE TVLSI Systems
| null | null | null |
cs.AR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long polar codes can achieve the symmetric capacity of arbitrary binary-input
discrete memoryless channels under a low complexity successive cancelation (SC)
decoding algorithm. However, for polar codes with short and moderate code
length, the decoding performance of the SC algorithm is inferior. The cyclic
redundancy check (CRC) aided successive cancelation list (SCL) decoding
algorithm has better error performance than the SC algorithm for short or
moderate polar codes. In this paper, we propose an efficient list decoder
architecture for the CRC aided SCL algorithm, based on both algorithmic
reformulations and architectural techniques. In particular, an area efficient
message memory architecture is proposed to reduce the area of the proposed
decoder architecture. An efficient path pruning unit suitable for large list
size is also proposed. For a polar code of length 1024 and rate $\frac{1}{2}$,
when list size $L=2$ and 4, the proposed list decoder architecture is
implemented under a TSMC 90nm CMOS technology. Compared with the list decoders
in the literature, our decoder achieves 1.33 to 1.96 times hardware efficiency.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2014 19:39:49 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Nov 2014 15:59:04 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Lin",
"Jun",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.977856 |
1411.0740
|
Ahmadreza Baghaie
|
Ahmadreza Baghaie, Roshan M. D'souza, Zeyun Yu
|
State-of-the-Art in Retinal Optical Coherence Tomography Image Analysis
|
Added references, corrected typos
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optical Coherence Tomography (OCT) is one of the most emerging imaging
modalities that has been used widely in the field of biomedical imaging. From
its emergence in 1990's, plenty of hardware and software improvements have been
made. Its applications range from ophthalmology to dermatology to coronary
imaging etc. Here, the focus is on applications of OCT in ophthalmology and
retinal imaging. OCT is able to non-invasively produce cross-sectional volume
images of the tissues which are further used for analysis of the tissue
structure and its properties. Due to the underlying physics, OCT images usually
suffer from a granular pattern, called speckle noise, which restricts the
process of interpretation, hence requiring specialized noise reduction
techniques to remove the noise while preserving image details. Also, given the
fact that OCT images are in the $\mu m$ -level, further analysis in needed to
distinguish between the different structures in the imaged volume. Therefore
the use of different segmentation techniques are of high importance. The
movement of the tissue under imaging or the progression of disease in the
tissue also imposes further implications both on the quality and the proper
interpretation of the acquired images. Thus, use of image registration
techniques can be very helpful. In this work, an overview of such image
analysis techniques will be given.
|
[
{
"version": "v1",
"created": "Tue, 4 Nov 2014 00:10:57 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Nov 2014 20:36:38 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Baghaie",
"Ahmadreza",
""
],
[
"D'souza",
"Roshan M.",
""
],
[
"Yu",
"Zeyun",
""
]
] |
new_dataset
| 0.997649 |
1411.3519
|
Mohamed Hussein
|
Marwan Torki, Mohamed E. Hussein, Ahmed Elsallamy, Mahmoud Fayyaz,
Shehab Yaser
|
Window-Based Descriptors for Arabic Handwritten Alphabet Recognition: A
Comparative Study on a Novel Dataset
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a comparative study for window-based descriptors on the
application of Arabic handwritten alphabet recognition. We show a detailed
experimental evaluation of different descriptors with several classifiers. The
objective of the paper is to evaluate different window-based descriptors on the
problem of Arabic letter recognition. Our experiments clearly show that they
perform very well. Moreover, we introduce a novel spatial pyramid partitioning
scheme that enhances the recognition accuracy for most descriptors. In
addition, we introduce a novel dataset for Arabic handwritten isolated alphabet
letters, which can serve as a benchmark for future research.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2014 12:22:57 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Nov 2014 17:55:32 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Torki",
"Marwan",
""
],
[
"Hussein",
"Mohamed E.",
""
],
[
"Elsallamy",
"Ahmed",
""
],
[
"Fayyaz",
"Mahmoud",
""
],
[
"Yaser",
"Shehab",
""
]
] |
new_dataset
| 0.999161 |
1411.4246
|
Md Lisul Islam
|
Md. Lisul Islam, Swakkhar Shatabda and M. Sohel Rahman
|
GreMuTRRR: A Novel Genetic Algorithm to Solve Distance Geometry Problem
for Protein Structures
|
Accepted for publication in the 8th International Conference on
Electrical and Computer Engineering (ICECE 2014)
| null | null | null |
cs.NE cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nuclear Magnetic Resonance (NMR) Spectroscopy is a widely used technique to
predict the native structure of proteins. However, NMR machines are only able
to report approximate and partial distances between pair of atoms. To build the
protein structure one has to solve the Euclidean distance geometry problem
given the incomplete interval distance data produced by NMR machines. In this
paper, we propose a new genetic algorithm for solving the Euclidean distance
geometry problem for protein structure prediction given sparse NMR data. Our
genetic algorithm uses a greedy mutation operator to intensify the search, a
twin removal technique for diversification in the population and a random
restart method to recover stagnation. On a standard set of benchmark dataset,
our algorithm significantly outperforms standard genetic algorithms.
|
[
{
"version": "v1",
"created": "Sun, 16 Nov 2014 11:26:06 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Islam",
"Md. Lisul",
""
],
[
"Shatabda",
"Swakkhar",
""
],
[
"Rahman",
"M. Sohel",
""
]
] |
new_dataset
| 0.998544 |
1411.4299
|
Anupama Aggarwal
|
Anupama Aggarwal, Ponnurangam Kumaraguru
|
What They Do in Shadows: Twitter Underground Follower Market
|
arXiv admin note: text overlap with arXiv:1408.1534
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet users and businesses are increasingly using online social networks
(OSN) to drive audience traffic and increase their popularity. In order to
boost social presence, OSN users need to increase the visibility and reach of
their online profile, like - Facebook likes, Twitter followers, Instagram
comments and Yelp reviews. For example, an increase in Twitter followers not
only improves the audience reach of the user but also boosts the perceived
social reputation and popularity. This has led to a scope for an underground
market that provides followers, likes, comments, etc. via a network of
fraudulent and compromised accounts and various collusion techniques.
In this paper, we landscape the underground markets that provide Twitter
followers by studying their basic building blocks - merchants, customers and
phony followers. We charecterize the services provided by merchants to
understand their operational structure and market hierarchy. Twitter
underground markets can operationalize using a premium monetary scheme or other
incentivized freemium schemes. We find out that freemium market has an
oligopoly structure with few merchants being the market leaders. We also show
that merchant popularity does not have any correlation with the quality of
service provided by the merchant to its customers. Our findings also shed light
on the characteristics and quality of market customers and the phony followers
provided. We draw comparison between legitimate users and phony followers, and
find out key identifiers to separate such users. With the help of these
differentiating features, we build a supervised learning model to predict
suspicious following behaviour with an accuracy of 89.2%.
|
[
{
"version": "v1",
"created": "Sun, 16 Nov 2014 20:10:30 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Aggarwal",
"Anupama",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.999611 |
1411.4366
|
Prashant Dahiwale Prof
|
Prashant Dahiwale, M M Raghuwanshi, Latesh malik
|
PDD Crawler: A focused web crawler using link and content analysis for
relevance prediction
|
9 pages, SEAS-2014, Dubai, UAE, International Conference 7-8 Nov 2014
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Majority of the computer or mobile phone enthusiasts make use of the web for
searching activity. Web search engines are used for the searching; The results
that the search engines get are provided to it by a software module known as
the Web Crawler. The size of this web is increasing round-the-clock. The
principal problem is to search this huge database for specific information. To
state whether a web page is relevant to a search topic is a dilemma. This paper
proposes a crawler called as PDD crawler which will follow both a link based as
well as a content based approach. This crawler follows a completely new
crawling strategy to compute the relevance of the page. It analyses the content
of the page based on the information contained in various tags within the HTML
source code and then computes the total weight of the page. The page with the
highest weight, thus has the maximum content and highest relevance.
|
[
{
"version": "v1",
"created": "Mon, 17 Nov 2014 05:33:51 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Dahiwale",
"Prashant",
""
],
[
"Raghuwanshi",
"M M",
""
],
[
"malik",
"Latesh",
""
]
] |
new_dataset
| 0.999615 |
1411.4617
|
Xudong Ma
|
Xudong Ma
|
Joint Write-Once-Memory and Error-Control Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Write-Once-Memory (WOM) is a model for many modern non-volatile memories,
such as flash memories. Recently, several capacity-achieving WOM coding schemes
have been proposed based on polar coding. Due to the fact that practical
computer memory systems always contain noises, a nature question to ask next is
how may we generalize these coding schemes, such that they may also have the
error-control capabilities. In this paper, we discuss a joint WOM and
error-control coding scheme, which is a generalization of the
capacity-achieving WOM codes based on source polarization. In this paper, we
prove a sufficient and necessary condition for the noisy reading channel being
less noisy than the test channel in data encoding in the polar WOM coding. Such
a sufficient and necessary condition is usually satisfied in reality. As a
consequence of the sufficient and necessary condition, the high entropy set
related to the noisy channel is usually strictly contained in the high entropy
set related to the test channel in data encoding. Therefore the low-complexity
polar joint WOM and error-control codes are sufficient for most practical
coding scenarios.
|
[
{
"version": "v1",
"created": "Mon, 17 Nov 2014 20:12:30 GMT"
}
] | 2014-11-18T00:00:00 |
[
[
"Ma",
"Xudong",
""
]
] |
new_dataset
| 0.997932 |
1411.3742
|
Mohammed Ahmed
|
Mohammed Ahmed
|
TCP Congestion Control Identification
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Transmission Control Protocol (TCP) carries most of the traffic on the
Internet these days. There are several implementations of TCP, and the most
important difference among them is their mechanism for controlling congestion.
One of the methods for determining type of a TCP is active probing. Active
probing considers a TCP implementation as a black box, sends different streams
of data to the appropriate host. According to the response received from the
host, it figures out the type of TCP version implemented.
TCP Behavior Inference Tool (TBIT) is an implemented tool that uses active
probing to check the running TCP on web servers. It can check several aspects
of the running TCP including initial value of congestion window, congestion
control algorithm, conformant congestion control, response to selective
acknowledgment, response to Explicit Congestion Notification (ECN) and time
wait duration. In this paper we focus on congestion control algorithm aspect of
it, explain the mechanism used by TBIT and present the results.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2014 21:19:18 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Ahmed",
"Mohammed",
""
]
] |
new_dataset
| 0.998619 |
1411.3777
|
Ardalan Amiri Sani
|
Ardalan Amiri Sani, Lin Zhong, Dan S. Wallach
|
Glider: A GPU Library Driver for Improved System Security
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Legacy device drivers implement both device resource management and
isolation. This results in a large code base with a wide high-level interface
making the driver vulnerable to security attacks. This is particularly
problematic for increasingly popular accelerators like GPUs that have large,
complex drivers. We solve this problem with library drivers, a new driver
architecture. A library driver implements resource management as an untrusted
library in the application process address space, and implements isolation as a
kernel module that is smaller and has a narrower lower-level interface (i.e.,
closer to hardware) than a legacy driver. We articulate a set of device and
platform hardware properties that are required to retrofit a legacy driver into
a library driver. To demonstrate the feasibility and superiority of library
drivers, we present Glider, a library driver implementation for two GPUs of
popular brands, Radeon and Intel. Glider reduces the TCB size and attack
surface by about 35% and 84% respectively for a Radeon HD 6450 GPU and by about
38% and 90% respectively for an Intel Ivy Bridge GPU. Moreover, it incurs no
performance cost. Indeed, Glider outperforms a legacy driver for applications
requiring intensive interactions with the device driver, such as applications
using the OpenGL immediate mode API.
|
[
{
"version": "v1",
"created": "Fri, 14 Nov 2014 02:30:08 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Sani",
"Ardalan Amiri",
""
],
[
"Zhong",
"Lin",
""
],
[
"Wallach",
"Dan S.",
""
]
] |
new_dataset
| 0.999386 |
1411.3791
|
EPTCS
|
Mario Bravetti (University of Bologna, Italy / INRIA, France),
Gianluigi Zavattaro (University of Bologna, Italy / INRIA, France)
|
Choreographies and Behavioural Contracts on the Way to Dynamic Updates
|
In Proceedings MOD* 2014, arXiv:1411.3453
|
EPTCS 168, 2014, pp. 12-31
|
10.4204/EPTCS.168.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We survey our work on choreographies and behavioural contracts in multiparty
interactions. In particular theories of behavioural contracts are presented
which enable reasoning about correct service composition (contract compliance)
and service substitutability (contract refinement preorder) under different
assumptions concerning service communication: synchronous address or name based
communication with patient non-preemptable or impatient invocations, or
asynchronous communication. Correspondingly relations between behavioural
contracts and choreographic descriptions are considered, where a contract for
each communicating party is, e.g., derived by projection. The considered
relations are induced as the maximal preoders which preserve contract
compliance and global traces: we show maximality to hold (permitting services
to be discovered/substituted independently for each party) when contract
refinement preorders with all the above asymmetric communication means are
considered and, instead, not to hold if the standard symmetric CCS/pi-calculus
communication is considered (or when directly relating choreographies to
behavioral contracts via a preorder, no matter the communication mean). The
obtained maximal preorders are then characterized in terms of a new form of
testing, called compliance testing, where not only tests must succeed but also
the system under test (thus relating to controllability theory), and compared
with classical preorders such as may/must testing, trace inclusion, etc.
Finally, recent work about adaptable choreographies and behavioural contracts
is presented, where the theory above is extended to update mechanisms allowing
choreographies/contracts to be modified at run-time by internal
(self-adaptation) or external intervention.
|
[
{
"version": "v1",
"created": "Fri, 14 Nov 2014 04:38:51 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Bravetti",
"Mario",
"",
"University of Bologna, Italy / INRIA, France"
],
[
"Zavattaro",
"Gianluigi",
"",
"University of Bologna, Italy / INRIA, France"
]
] |
new_dataset
| 0.988341 |
cs/0111030
|
Hai Dong
|
H. Dong, R. Flood, C. Hovater, J. Musson
|
A Dual Digital Signal Processor VME Board For Instrumentation And
Control Applications
|
3 PDF pages
|
eConf C011127:THAP049,2001
| null | null |
cs.AR
| null |
A Dual Digital Signal Processing VME Board was developed for the Continuous
Electron Beam Accelerator Facility (CEBAF) Beam Current Monitor (BCM) system at
Jefferson Lab. It is a versatile general-purpose digital signal processing
board using an open architecture, which allows for adaptation to various
applications. The base design uses two independent Texas Instrument (TI)
TMS320C6711, which are 900 MFLOPS floating-point digital signal processors
(DSP). Applications that require a fixed point DSP can be implemented by
replacing the baseline DSP with the pin-for-pin compatible TMS320C6211. The
design can be manufactured with a reduced chip set without redesigning the
printed circuit board. For example it can be implemented as a single-channel
DSP with no analog I/O.
|
[
{
"version": "v1",
"created": "Fri, 9 Nov 2001 16:04:17 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Dong",
"H.",
""
],
[
"Flood",
"R.",
""
],
[
"Hovater",
"C.",
""
],
[
"Musson",
"J.",
""
]
] |
new_dataset
| 0.998687 |
cs/0306070
|
Mary R. Thompson
|
M. Thompson, A. Essiari, K. Keahey, V. Welch, S.Lang, B. Liu
|
Fine-Grained Authorization for Job and Resource Management Using Akenti
and the Globus Toolkit
|
CHEP03, La Jolla, Mar 24-27, TUB2006, Grid Security, 7 pages, 5
figures
|
ECONF C0303241:TUBT006,2003
| null |
LBNL-52976
|
cs.DC cs.CR
| null |
As the Grid paradigm is adopted as a standard way of sharing remote resources
across organizational domains, the need for fine-grained access control to
these resources increases. This paper presents an authorization solution for
job submission and control, developed as part of the National Fusion
Collaboratory, that uses the Globus Toolkit 2 and the Akenti authorization
service in order to perform fine-grained authorization of job and resource
management requests in a Grid environment. At job startup, it allows the system
to evaluate a user's Resource Specification Language request against
authorization policies on resource usage (determining how many CPUs or memory a
user can use on a given resource or which executables the user can run).
Furthermore, based on authorization policies, it allows other virtual
organization members to manage the user's job.
|
[
{
"version": "v1",
"created": "Fri, 13 Jun 2003 18:15:03 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jun 2003 23:28:49 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Thompson",
"M.",
""
],
[
"Essiari",
"A.",
""
],
[
"Keahey",
"K.",
""
],
[
"Welch",
"V.",
""
],
[
"Lang",
"S.",
""
],
[
"Liu",
"B.",
""
]
] |
new_dataset
| 0.999222 |
cs/0503088
|
Masahito Hayashi
|
Masahito Hayashi
|
General non-asymptotic and asymptotic formulas in channel resolvability
and identification capacity and their application to wire-tap channel
| null |
IEEE Transactions on Information Theory, Vol. 52, No. 4, 1562-1575
(2006)
| null | null |
cs.IT math.IT
| null |
Several non-asymptotic formulas are established in channel resolvability and
identification capacity, and they are applied to wire-tap channel. By using
these formulas, the $\epsilon$ capacities of the above three problems are
considered in the most general setting, where no structural assumptions such as
the stationary memoryless property are made on a channel. As a result, we solve
an open problem proposed in Han & Verdu and Han. Moreover, we obtain lower
bounds of the exponents of error probability and the wire-tapper's information
in wire-tap channel.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2005 05:16:29 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2005 09:19:34 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Hayashi",
"Masahito",
""
]
] |
new_dataset
| 0.994197 |
cs/9401101
| null |
N. Nilsson
|
Teleo-Reactive Programs for Agent Control
|
See http://www.jair.org/ for any accompanying files
|
Journal of Artificial Intelligence Research, Vol 1, (1994),
139-158
| null | null |
cs.AI
| null |
A formalism is presented for computing and organizing actions for autonomous
agents in dynamic environments. We introduce the notion of teleo-reactive (T-R)
programs whose execution entails the construction of circuitry for the
continuous computation of the parameters and conditions on which agent action
is based. In addition to continuous feedback, T-R programs support parameter
binding and recursion. A primary difference between T-R programs and many other
circuit-based systems is that the circuitry of T-R programs is more compact; it
is constructed at run time and thus does not have to anticipate all the
contingencies that might arise over all possible runs. In addition, T-R
programs are intuitive and easy to write and are written in a form that is
compatible with automatic planning and learning methods. We briefly describe
some experimental applications of T-R programs in the control of simulated and
actual mobile robots.
|
[
{
"version": "v1",
"created": "Sat, 1 Jan 1994 00:00:00 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Nilsson",
"N.",
""
]
] |
new_dataset
| 0.991741 |
cs/9704101
| null |
P. Agre, I. Horswill
|
Lifeworld Analysis
|
See http://www.jair.org/ for any accompanying files
|
Journal of Artificial Intelligence Research, Vol 6, (1997),
111-145
| null | null |
cs.AI
| null |
We argue that the analysis of agent/environment interactions should be
extended to include the conventions and invariants maintained by agents
throughout their activity. We refer to this thicker notion of environment as a
lifeworld and present a partial set of formal tools for describing structures
of lifeworlds and the ways in which they computationally simplify activity. As
one specific example, we apply the tools to the analysis of the Toast system
and show how versions of the system with very different control structures in
fact implement a common control structure together with different conventions
for encoding task state in the positions or states of objects in the
environment.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 1997 00:00:00 GMT"
}
] | 2014-11-17T00:00:00 |
[
[
"Agre",
"P.",
""
],
[
"Horswill",
"I.",
""
]
] |
new_dataset
| 0.990273 |
1408.3598
|
Cristina Flaut
|
Cristina Flaut
|
BCK-algebras arising from block codes
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we will provide an algorithm which allows us to find a
BCK-algebra starting from a given block code.
|
[
{
"version": "v1",
"created": "Fri, 15 Aug 2014 17:58:37 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Nov 2014 09:06:57 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Nov 2014 20:13:57 GMT"
}
] | 2014-11-14T00:00:00 |
[
[
"Flaut",
"Cristina",
""
]
] |
new_dataset
| 0.998878 |
1411.3555
|
Panagiotis Metaxas
|
Panagiotis Takis Metaxas, Eni Mustafaraj, Kily Wong, Laura Zeng, Megan
O'Keefe, Samantha Finn
|
Do Retweets indicate Interest, Trust, Agreement? (Extended Abstract)
|
5 pages, 2 figures, extended abstract
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arguably one of the most important features of Twitter is the support for
"retweets" or messages re-posted verbatim by a user that were originated by
someone else. (This does not include modified tweets that sometimes are
referred to as retweets.) Despite the fact that retweets are routinely studied
and reported, many important questions remain about user motivation for their
use and their significance. In this paper we answer the question of what users
indicate when they retweet. We do so in a comprehensive fashion, by employing a
user survey, a study of user profiles, and a meta-analysis of over 100 research
publications from three related major conferences. Our findings indicate that
retweeting indicates not only interest in a message, but also trust in the
message and the originator, and agreement with the message contents. However,
the findings are significantly weaker for journalists, some of whom beg to
differ declaring so in their own user profiles. On the other hand, the
inclusion of hashtags strengthens the signal of agreement, especially when the
hashtags are related to politics. While in the past there have been additional
claims in the literature about possible reasons for retweeting, many of them
are not supported, especially given the technical changes introduced recently
by Twitter.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2014 14:34:55 GMT"
}
] | 2014-11-14T00:00:00 |
[
[
"Metaxas",
"Panagiotis Takis",
""
],
[
"Mustafaraj",
"Eni",
""
],
[
"Wong",
"Kily",
""
],
[
"Zeng",
"Laura",
""
],
[
"O'Keefe",
"Megan",
""
],
[
"Finn",
"Samantha",
""
]
] |
new_dataset
| 0.98481 |
1411.3044
|
David Furcy
|
Kimberly Barth, David Furcy, Scott M. Summers, Paul Totzke
|
Scaled tree fractals do not strictly self-assemble
|
13 pages, 3 figures, Appeared in the Proceedings of UCNC-2014, pp
27-39; Unconventional Computation and Natural Computation - 13th
International Conference, UCNC 2014, London, ON, Canada, July 14-18, 2014,
Springer Lecture Notes in Computer Science ISBN 978-3-319-08122-9
| null |
10.1007/978-3-319-08123-6_3
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we show that any scaled-up version of any discrete
self-similar {\it tree} fractal does not strictly self-assemble, at any
temperature, in Winfree's abstract Tile Assembly Model.
|
[
{
"version": "v1",
"created": "Wed, 12 Nov 2014 01:55:48 GMT"
}
] | 2014-11-13T00:00:00 |
[
[
"Barth",
"Kimberly",
""
],
[
"Furcy",
"David",
""
],
[
"Summers",
"Scott M.",
""
],
[
"Totzke",
"Paul",
""
]
] |
new_dataset
| 0.965518 |
1411.3061
|
Yong Zeng
|
Yong Zeng and Rui Zhang
|
Full-Duplex Wireless-Powered Relay with Self-Energy Recycling
|
10 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter studies a wireless-powered amplify-and-forward relaying system,
where an energy-constrained relay node assists the information transmission
from the source to the destination using the energy harvested from the source.
We propose a novel two-phase protocol for efficient energy transfer and
information relaying, in which the relay operates in full-duplex mode with
simultaneous energy harvesting and information transmission. Compared with the
existing protocols, the proposed design possesses two main advantages: i) it
ensures uninterrupted information transmission since no time switching or power
splitting is needed at the relay for energy harvesting; ii) it enables the
so-called self-energy recycling, i.e., part of the energy (loop energy) that is
used for information transmission by the relay can be harvested and reused in
addition to the dedicated energy sent by the source. Under the multiple-input
single-output (MISO) channel setup, the optimal power allocation and
beamforming design at the relay are derived. Numerical results show a
significant throughput gain achieved by our proposed design over the existing
time switching-based relay protocol.
|
[
{
"version": "v1",
"created": "Wed, 12 Nov 2014 03:43:18 GMT"
}
] | 2014-11-13T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.995653 |
1411.3124
|
Bhavani Anantapur
|
A B Bhavani
|
Cross Site Request Forgery on Android WebView
| null |
International Journal for Computer Science and Network Volume 3
Issue 3 June 2014
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android has always been about connectivity and providing great browsing
experience. Web-based content can be embedded into the Android application
using WebView. It is a User Interface component that displays webpages. It can
either display a remote webpage or can also load static HTML data. This
encompasses the functionality of a browser that can be integrated to
application. WebView provides a number of APIs which enables the applications
to interact with the web content inside WebView. In the current paper Cross
site request forgery or XSRF attack specific to android WebView is
investigated. In XSRF attack the trusts of a web application in its
authenticated users is exploited by letting the attacker make arbitrary HTTP
requests on behalf of a victim user. When the user is logged into the trusted
site through the WebView the site authenticates the WebView and not
application. The application can launch attacks on the behalf of user with the
APIs of Webview exploiting user credentials resulting in Cross site request
forgery. Attacks can also be launched by setting cookies as HTTP headers and
making malicious HTTP Request on behalf of victim.
|
[
{
"version": "v1",
"created": "Wed, 12 Nov 2014 10:29:12 GMT"
}
] | 2014-11-13T00:00:00 |
[
[
"Bhavani",
"A B",
""
]
] |
new_dataset
| 0.998954 |
1410.4393
|
Christopher Herbon
|
Christopher Herbon
|
The HAWKwood Database
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a database consisting of wood pile images, which can be used as a
benchmark to evaluate the performance of wood pile detection and surveying
algorithms. We distinguish six database cate- gories which can be used for
different types of algorithms. Images of real and synthetic scenes are
provided, which consist of 7655 images divided into 354 data sets. Depending on
the category the data sets either include ground truth data or forestry
specific measurements with which algorithms may be compared.
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 12:25:50 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Nov 2014 07:07:30 GMT"
}
] | 2014-11-12T00:00:00 |
[
[
"Herbon",
"Christopher",
""
]
] |
new_dataset
| 0.999564 |
1411.2351
|
Wim Martens
|
Wim Martens, Frank Neven, Stijn Vansummeren
|
SCULPT: A Schema Language for Tabular Data on the Web
|
16 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by the recent working effort towards a recommendation by the World
Wide Web Consortium (W3C) for tabular data and metadata on the Web, we present
in this paper a concept for a schema language for tabular web data called
SCULPT. The language consists of rules constraining and defining the structure
of regions in the table. These regions are defined through the novel formalism
of region selection expressions. We present a formal model for SCULPT and
obtain a linear time combined complexity evaluation algorithm. In addition, we
consider weak and strong streaming evaluation for SCULPT and present a fragment
for each of these streaming variants. Finally, we discuss several extensions of
SCULPT including alternative semantics, types, complex content, and explore
region selection expressions as a basis for a transformation language.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 08:57:47 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Nov 2014 08:40:52 GMT"
}
] | 2014-11-12T00:00:00 |
[
[
"Martens",
"Wim",
""
],
[
"Neven",
"Frank",
""
],
[
"Vansummeren",
"Stijn",
""
]
] |
new_dataset
| 0.99585 |
1411.2714
|
Peng Hui Tan
|
Peng Hui Tan, Jingon Joung, Sumei Sun
|
Opportunistic Multicast Scheduling for Unicast Transmission in MIMO-OFDM
System
|
6 pages, conference
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a multicast scheduling scheme to exploit content reuse when there
is asynchronicity in user requests. A unicast transmission setup is used for
content delivery, while multicast transmission is employed opportunistically to
reduce wireless resource usage. We then develop a multicast scheduling scheme
for the downlink multiple-input multiple output orthogonal-frequency division
multiplexing system in IEEE 802.11 wireless local area network (WLAN). At each
time slot, the scheduler serves the users by either unicast or multicast
transmission. Out-sequence data received by a user is stored in user's cache
for future use.Multicast precoding and user selection for multicast grouping
are also considered and compliance with the IEEE 802.11 WLAN transmission
protocol. The scheduling scheme is based on the Lyapunov optimization
technique, which aims to maximize system rate. The resulting scheme has low
complexity and requires no prior statistical information on the channels and
queues. Furthermore, in the absence of channel error, the proposed scheme
restricts the worst case of frame dropping deadline, which is useful for
delivering real-time traffic. Simulation results show that our proposed
algorithm outperforms existing techniques by 17 % to 35 % in term of user
capacity.
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2014 07:21:55 GMT"
}
] | 2014-11-12T00:00:00 |
[
[
"Tan",
"Peng Hui",
""
],
[
"Joung",
"Jingon",
""
],
[
"Sun",
"Sumei",
""
]
] |
new_dataset
| 0.996337 |
1402.2648
|
Deliang Fan Deliang Fan
|
Deliang Fan, Mrigank Sharad, Kaushik Roy
|
Design and Synthesis of Ultra Low Energy Spin-Memristor Threshold Logic
|
this paper is submitted to IEEE Transactions on Nanotechnology. It is
currently under review
|
IEEE Transactions on Nanotechnology, Volume:13, Issue: 3, 2014
|
10.1109/TNANO.2014.2312177
| null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A threshold logic gate (TLG) performs weighted sum of multiple inputs and
compares the sum with a threshold. We propose Spin-Memeristor Threshold Logic
(SMTL) gates, which employ memristive cross-bar array (MCA) to perform
current-mode summation of binary inputs, whereas, the low-voltage
fast-switching spintronic threshold devices (STD) carry out the threshold
operation in an energy efficient manner. Field programmable SMTL gate arrays
can operate at a small terminal voltage of ~50mV, resulting in ultra-low power
consumption in gates as well as programmable interconnect networks. We evaluate
the performance of SMTL using threshold logic synthesis. Results for common
benchmarks show that SMTL based programmable logic hardware can be more than
100x energy efficient than state of the art CMOS FPGA.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 19:59:29 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Fan",
"Deliang",
""
],
[
"Sharad",
"Mrigank",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.997029 |
1406.6772
|
Yung-Chih Chen
|
Yung-Chih Chen, Don Towsley, Ramin Khalili
|
MSPlayer: Multi-Source and multi-Path LeverAged YoutubER
|
accepted to ACM CoNEXT'14
| null |
10.1145/2674005.2675007
| null |
cs.NI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online video streaming through mobile devices has become extremely popular
nowadays. YouTube, for example, reported that the percentage of its traffic
streaming to mobile devices has soared from 6% to more than 40% over the past
two years. Moreover, people are constantly seeking to stream high quality video
for better experience while often suffering from limited bandwidth. Thanks to
the rapid deployment of content delivery networks (CDNs), popular videos are
now replicated at different sites, and users can stream videos from close-by
locations with low latencies. As mobile devices nowadays are equipped with
multiple wireless interfaces (e.g., WiFi and 3G/4G), aggregating bandwidth for
high definition video streaming has become possible.
We propose a client-based video streaming solution, MSPlayer, that takes
advantage of multiple video sources as well as multiple network paths through
different interfaces. MSPlayer reduces start-up latency and provides high
quality video streaming and robust data transport in mobile scenarios. We
experimentally demonstrate our solution on a testbed and through the YouTube
video service.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2014 05:34:19 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Nov 2014 19:26:38 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Chen",
"Yung-Chih",
""
],
[
"Towsley",
"Don",
""
],
[
"Khalili",
"Ramin",
""
]
] |
new_dataset
| 0.999249 |
1409.3050
|
Roy Timo
|
Roy Timo and Mich\'ele Wigger
|
Slepian-Wolf Coding for Broadcasting with Cooperative Base-Stations
|
16 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a base-station (BS) cooperation model for broadcasting a discrete
memoryless source in a cellular or heterogeneous network. The model allows the
receivers to use helper BSs to improve network performance, and it permits the
receivers to have prior side information about the source. We establish the
model's information-theoretic limits in two operational modes: In Mode 1, the
helper BSs are given information about the channel codeword transmitted by the
main BS, and in Mode 2 they are provided correlated side information about the
source. Optimal codes for Mode 1 use \emph{hash-and-forward coding} at the
helper BSs; while, in Mode 2, optimal codes use source codes from Wyner's
\emph{helper source-coding problem} at the helper BSs. We prove the optimality
of both approaches by way of a new list-decoding generalisation of [8, Thm. 6],
and, in doing so, show an operational duality between Modes 1 and 2.
|
[
{
"version": "v1",
"created": "Wed, 10 Sep 2014 12:59:12 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Nov 2014 09:20:49 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Timo",
"Roy",
""
],
[
"Wigger",
"Michéle",
""
]
] |
new_dataset
| 0.993812 |
1409.5908
|
Nipun Batra
|
Jack Kelly, Nipun Batra, Oliver Parson, Haimonti Dutta, William
Knottenbelt, Alex Rogers, Amarjeet Singh, Mani Srivastava
|
Demo Abstract: NILMTK v0.2: A Non-intrusive Load Monitoring Toolkit for
Large Scale Data Sets
|
1st ACM International Conference on Embedded Systems For
Energy-Efficient Buildings, 2014
| null |
10.1145/2674061.2675024
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this demonstration, we present an open source toolkit for evaluating
non-intrusive load monitoring research; a field which aims to disaggregate a
household's total electricity consumption into individual appliances. The
toolkit contains: a number of importers for existing public data sets, a set of
preprocessing and statistics functions, a benchmark disaggregation algorithm
and a set of metrics to evaluate the performance of such algorithms.
Specifically, this release of the toolkit has been designed to enable the use
of large data sets by only loading individual chunks of the whole data set into
memory at once for processing, before combining the results of each chunk.
|
[
{
"version": "v1",
"created": "Sat, 20 Sep 2014 17:36:43 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Oct 2014 16:43:18 GMT"
},
{
"version": "v3",
"created": "Sun, 9 Nov 2014 20:43:51 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Kelly",
"Jack",
""
],
[
"Batra",
"Nipun",
""
],
[
"Parson",
"Oliver",
""
],
[
"Dutta",
"Haimonti",
""
],
[
"Knottenbelt",
"William",
""
],
[
"Rogers",
"Alex",
""
],
[
"Singh",
"Amarjeet",
""
],
[
"Srivastava",
"Mani",
""
]
] |
new_dataset
| 0.993295 |
1410.8509
|
Su Kim
|
Su Kim
|
Photomapping Using Aerial Vehicle
| null | null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
Creating a photomap plays a critical role in navigation. Therefore, flying
vehicles are usually used to create topdown maps of the environment. In this
report we used two different aerial vehicles to create a map in a simulated
environment
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 19:29:29 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Nov 2014 19:45:39 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Kim",
"Su",
""
]
] |
new_dataset
| 0.989684 |
1410.8844
|
Paul Madden
|
Paul Madden, Eduardo G. Valente Jr
|
DDTS: A Practical System Testing Framework for Scientific Software
|
Fixed bad formatting on last page
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many scientific-software projects test their codes inadequately, or not at
all. Despite its well-known benefits, adopting routine testing is often not
easy. Development teams may have doubts about establishing effective test
procedures, writing test software, or handling the ever-growing complexity of
test cases. They may need to run (and test) on restrictive HPC platforms. They
almost certainly face time and budget pressures that can keep testing
languishing near the bottom of their to-do lists. This paper presents DDTS, a
framework for building test suite applications, designed to fit
scientific-software projects' requirements. DDTS aims to simplify introduction
of rigorous testing, and to ease growing pains as needs mature. It decomposes
the testing problem into practical, intuitive phases; makes configuration and
extension easy; is portable and suitable to HPC platforms; and exploits
parallelism. DDTS is currently used for automated regression and developer
pre-commit testing for several scientific-software projects with disparate
testing requirements.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2014 18:45:47 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Nov 2014 22:23:52 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Madden",
"Paul",
""
],
[
"Valente",
"Eduardo G.",
"Jr"
]
] |
new_dataset
| 0.980396 |
1411.2105
|
Marc Hellmuth
|
Sarah Berkemer, Ricardo Chaves, Adrian Fritz, Marc Hellmuth, Maribel
Hernandez-Rosales and Peter F. Stadler
|
Spiders can be recognized by counting their legs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spiders are arthropods that can be distinguished from their closest
relatives, the insects, by counting their legs. Spiders have 8, insects just 6.
Spider graphs are a very restricted class of graphs that naturally appear in
the context of cograph editing. The vertex set of a spider (or its complement)
is naturally partitioned into a clique (the body), an independent set (the
legs), and a rest (serving as the head). Here we show that spiders can be
recognized directly from their degree sequences through the number of their
legs (vertices with degree 1). Furthermore, we completely characterize the
degree sequences of spiders.
|
[
{
"version": "v1",
"created": "Sat, 8 Nov 2014 10:38:01 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Berkemer",
"Sarah",
""
],
[
"Chaves",
"Ricardo",
""
],
[
"Fritz",
"Adrian",
""
],
[
"Hellmuth",
"Marc",
""
],
[
"Hernandez-Rosales",
"Maribel",
""
],
[
"Stadler",
"Peter F.",
""
]
] |
new_dataset
| 0.999528 |
1411.2160
|
Marcos Aguilera
|
Marcos K. Aguilera, Joshua B. Leners, Ramakrishna Kotla, Michael
Walfish
|
Yesquel: scalable SQL storage for Web applications
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on a brief history of the storage systems for Web applications, we
motivate the need for a new storage system. We then describe the architecture
of such a system, called Yesquel. Yesquel supports the SQL query language and
offers performance similar to NOSQL storage systems.
|
[
{
"version": "v1",
"created": "Sat, 8 Nov 2014 20:32:17 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Aguilera",
"Marcos K.",
""
],
[
"Leners",
"Joshua B.",
""
],
[
"Kotla",
"Ramakrishna",
""
],
[
"Walfish",
"Michael",
""
]
] |
new_dataset
| 0.999807 |
1411.2195
|
Ong Sing Goh
|
Li Ching Liew and Ong Sing Goh
|
GeoTravel: Harvesting Ambient Geographic Footprints from GPS
Trajectories
| null | null | null |
GeoTravel/PSM/FTMK/UTeM/2014
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study is about harvesting point of interest from GPS trajectories.
Trajectories are the paths that moving objects move by follow through space in
a function of time while GPS trajectories generally are point-sequences with
geographic coordinates, time stamp, speed and heading. User can get information
from GPS enable device. For example, user can acquire present location, search
the information around them and design driving routes to a destination and thus
design travel itineraries. By sharing GPS logs among each other, people are
able to find some places that attract them from other people's travel route.
Analysis on the GPS logs can get the point of interest that is popular. By
present the point of interest, user can choose travel place easily and the
travel itineraries is plan based on the user preferences.
|
[
{
"version": "v1",
"created": "Sun, 9 Nov 2014 04:14:02 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Liew",
"Li Ching",
""
],
[
"Goh",
"Ong Sing",
""
]
] |
new_dataset
| 0.985701 |
1411.2212
|
Mehdi Masoudi
|
Mehdi Masoudi, Milad Mazaheri, Aliakbar Rezaei and Keivan Navi
|
Designing high-speed, low-power full adder cells based on carbon
nanotube technology
|
13 Pages, 13 Figures, 2 Tables
| null |
10.5121/vlsic.2014.5503
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents novel high speed and low power full adder cells based
on carbon nanotube field effect transistor (CNFET). Four full adder cells are
proposed in this article. First one (named CN9P4G) and second one (CN9P8GBUFF)
utilizes 13 and 17 CNFETs respectively. Third design that we named CN10PFS uses
only 10 transistors and is full swing. Finally, CN8P10G uses 18 transistors and
divided into two modules, causing Sum and Cout signals are produced in a
parallel manner. All inputs have been used straight, without inverting. These
designs also used the special feature of CNFET that is controlling the
threshold voltage by adjusting the diameters of CNFETs to achieve the best
performance and right voltage levels. All simulation performed using Synopsys
HSPICE software and the proposed designs are compared to other classical and
modern CMOS and CNFET-based full adder cells in terms of delay, power
consumption and power delay product.
|
[
{
"version": "v1",
"created": "Sun, 9 Nov 2014 09:26:43 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Masoudi",
"Mehdi",
""
],
[
"Mazaheri",
"Milad",
""
],
[
"Rezaei",
"Aliakbar",
""
],
[
"Navi",
"Keivan",
""
]
] |
new_dataset
| 0.975701 |
1411.2311
|
Jos\'e A. Soto
|
Jos\'e A. Soto, Claudio Telha
|
Independent sets and hitting sets of bicolored rectangular families
|
36 pages, A preliminary version of this work appeared in IPCO 2011
under the name "Jump Number of Two-Directional Orthogonal Ray Graphs"
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A bicolored rectangular family BRF is a collection of all axis-parallel
rectangles contained in a given region Z of the plane formed by selecting a
bottom-left corner from a set A and an upper-right corner from a set B. We
prove that the maximum independent set and the minimum hitting set of a BRF
have the same cardinality and devise polynomial time algorithms to compute
both. As a direct consequence, we obtain the first polynomial time algorithm to
compute minimum biclique covers, maximum cross-free matchings and jump numbers
in a class of bipartite graphs that significantly extends convex bipartite
graphs and interval bigraphs. We also establish several connections between our
work and other seemingly unrelated problems. Furthermore, when the bicolored
rectangular family is weighted, we show that the problem of finding the maximum
weight of an independent set is NP-hard, and provide efficient algorithms to
solve it on certain subclasses.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 02:09:58 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Soto",
"José A.",
""
],
[
"Telha",
"Claudio",
""
]
] |
new_dataset
| 0.996466 |
1411.2356
|
Thim Strothmann
|
Zahra Derakhshandeh, Robert Gmyr, Andrea W. Richa, Christian
Scheideler, Thim Strothmann, Shimrit Tzur-David
|
Infinite Object Coating in the Amoebot Model
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The term programmable matter refers to matter which has the ability to change
its physical properties (shape, density, moduli, conductivity, optical
properties, etc.) in a programmable fashion, based upon user input or
autonomous sensing. This has many applications like smart materials, autonomous
monitoring and repair, and minimal invasive surgery. While programmable matter
might have been considered pure science fiction more than two decades ago, in
recent years a large amount of research has been conducted in this field. Often
programmable matter is envisioned as a very large number of small locally
interacting computational particles. We propose the Amoebot model, a new model
which builds upon this vision of programmable matter. Inspired by the behavior
of amoeba, the Amoebot model offers a versatile framework to model
self-organizing particles and facilitates rigorous algorithmic research in the
area of programmable matter. We present an algorithm for the problem of coating
an infinite object under this model, and prove the correctness of the algorithm
and that it is work-optimal.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 09:12:15 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Derakhshandeh",
"Zahra",
""
],
[
"Gmyr",
"Robert",
""
],
[
"Richa",
"Andrea W.",
""
],
[
"Scheideler",
"Christian",
""
],
[
"Strothmann",
"Thim",
""
],
[
"Tzur-David",
"Shimrit",
""
]
] |
new_dataset
| 0.998713 |
1411.2373
|
Pedro M. d'Orey
|
Pedro M. d'Orey, Nitin Maslekar, Idoia de la Iglesia and Nikola K.
Zahariev
|
NAVI: Neighbor Aware Virtual Infrastructure for Information
Dissemination in Vehicular Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular Networks enable a vast number of innovative applications, which
rely on the efficient exchange of information between vehicles. However,
efficient and reliable data dissemination is a particularly challenging task in
the context of vehicular networks due to the underlying properties of these
networks, limited availability of network infrastructure and variable
penetration rates for distinct communication technologies. This paper presents
a novel system and mechanism for information dissemination based on virtual
infrastructure selection in combination with multiple communication
technologies. The system has been evaluated using a simulation framework,
involving network simulation in conjugation with realistic vehicular mobility
traces. The presented simulation results show the feasibility of the proposed
mechanism to achieve maximum message penetration with reduced overhead.
Compared with a cellular-based only solution, our mechanism shows that the
judicious vehicle selection can lead to improved network utilization through
the offload of traffic to the short-range communication network.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 10:40:44 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"d'Orey",
"Pedro M.",
""
],
[
"Maslekar",
"Nitin",
""
],
[
"de la Iglesia",
"Idoia",
""
],
[
"Zahariev",
"Nikola K.",
""
]
] |
new_dataset
| 0.992935 |
1411.2392
|
Philipp Leitner
|
Rostyslav Zabolotnyi and Philipp Leitner and Waldemar Hummer and
Schahram Dustdar
|
JCloudScale: Closing the Gap Between IaaS and PaaS
| null | null | null | null |
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Infrastructure-as-a-Service (IaaS) model of cloud computing is a
promising approach towards building elastically scaling systems. Unfortunately,
building such applications today is a complex, repetitive and error-prone
endeavor, as IaaS does not provide any abstraction on top of naked virtual
machines. Hence, all functionality related to elasticity needs to be
implemented anew for each application. In this paper, we present JCloudScale, a
Java-based middleware that supports building elastic applications on top of a
public or private IaaS cloud. JCloudScale allows to easily bring applications
to the cloud, with minimal changes to the application code. We discuss the
general architecture of the middleware as well as its technical features, and
evaluate our system with regard to both, user acceptance (based on a user
study) and performance overhead. Our results indicate that JCloudScale indeed
allowed many participants to build IaaS applications more efficiently,
comparable to the convenience features provided by industrial
Platform-as-a-Service (PaaS) solutions. However, unlike PaaS, using JCloudScale
does not lead to a loss of control and vendor lock-in for the developer.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 11:58:30 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Zabolotnyi",
"Rostyslav",
""
],
[
"Leitner",
"Philipp",
""
],
[
"Hummer",
"Waldemar",
""
],
[
"Dustdar",
"Schahram",
""
]
] |
new_dataset
| 0.968477 |
1411.2443
|
Bo-Kai Hsu
|
Bo-Kai Hsu, Chia-Han Lee, and Ping-Cheng Yeh
|
On Timing Synchronization for Quantity-based Modulation in Additive
Inverse Gaussian Channel with Drift
|
8 pages, 9 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Diffusion-based Molecular Communications, the channel between Transmitter
Nano-machine (TN) and Receiver Nano-machine (RN) can be modeled by Additive
Inverse Gaussian Channel, that is the first hitting time of messenger molecule
released from TN and captured by RN follows Inverse Gaussian distribution. In
this channel, a quantity-based modulation embedding message on the different
quantity levels of messenger molecules relies on a time-slotted system between
TN and RN. Accordingly, their clocks need to synchronize with each other. In
this paper, we discuss the approaches to make RN estimate its timing offset
between TN efficiently by the arrival times of molecules. We propose many
methods such as Maximum Likelihood Estimation (MLE), Unbiased Linear Estimation
(ULE), Iterative ULE, and Decision Feedback (DF). The numerical results shows
the comparison of them. We evaluate these methods by not only the Mean Square
Error, but also the computational complexity.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 14:48:36 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Hsu",
"Bo-Kai",
""
],
[
"Lee",
"Chia-Han",
""
],
[
"Yeh",
"Ping-Cheng",
""
]
] |
new_dataset
| 0.975015 |
1411.2565
|
Ru Zhu
|
Ru Zhu
|
Grace: a Cross-platform Micromagnetic Simulator On Graphics Processing
Units
|
9 pages, 5 figures
| null | null | null |
cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A micromagnetic simulator running on graphics processing unit (GPU) is
presented. It achieves significant performance boost as compared to previous
central processing unit (CPU) simulators, up to two orders of magnitude for
large input problems. Different from GPU implementations of other research
groups, this simulator is developed with C++ Accelerated Massive Parallelism
(C++ AMP) and is hardware platform compatible. It runs on GPU from venders
include NVidia, AMD and Intel, which paved the way for fast micromagnetic
simulation on both high-end workstations with dedicated graphics cards and
low-end personal computers with integrated graphics card. A copy of the
simulator software is publicly available.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 20:12:46 GMT"
}
] | 2014-11-11T00:00:00 |
[
[
"Zhu",
"Ru",
""
]
] |
new_dataset
| 0.997392 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.