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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1101.1507
|
Kyle Burke
|
Kyle Burke, Olivia George
|
A PSPACE-complete Graph Nim
|
14 pages, 3 figures
| null | null | null |
cs.GT cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We build off the game, NimG to create a version named Neighboring Nim. By
reducing from Geography, we show that this game is PSPACE-hard. The games
created by the reduction share strong similarities with Undirected (Vertex)
Geography and regular Nim, both of which are in P. We show how to construct
PSPACE-complete versions with nim heaps *1 and *2. This application of graphs
can be used as a form of game sum with any games, not only Nim.
|
[
{
"version": "v1",
"created": "Fri, 7 Jan 2011 19:19:42 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Aug 2011 03:34:54 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Oct 2014 11:40:08 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Burke",
"Kyle",
""
],
[
"George",
"Olivia",
""
]
] |
new_dataset
| 0.999652 |
1410.0600
|
Ghislain Fourny
|
Ghislain Fourny
|
Cell Stores
|
Technical report - 10 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cell stores provide a relational-like, tabular level of abstraction to
business users while leveraging recent database technologies, such as key-value
stores and document stores. This allows to scale up and out the efficient
storage and retrieval of highly dimensional data. Cells are the primary
citizens and exist in different forms, which can be explained with an analogy
to the state of matter: as a gas for efficient storage, as a solid for
efficient retrieval, and as a liquid for efficient interaction with the
business users. Cell stores were abstracted from, and are compatible with the
XBRL standard for importing and exporting data. The first cell store repository
contains roughly 200GB of SEC filings data, and proves that retrieving data
cubes can be performed in real time (the threshold acceptable by a human user
being at most a few seconds).
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 16:14:22 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Oct 2014 15:51:58 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Fourny",
"Ghislain",
""
]
] |
new_dataset
| 0.997569 |
1410.1613
|
Xianghui Cao
|
Devu Manikantan Shila, Xianghui Cao, Yu Cheng, Zequ Yang, Yang Zhou,
Jiming Chen
|
Ghost-in-the-Wireless: Energy Depletion Attack on ZigBee
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ZigBee has been recently drawing a lot of attention as a promising solution
for ubiquitous computing. The ZigBee devices are normally resource-limited,
making the network susceptible to a variety of security threats. This paper
presents a severe attack on ZigBee networks termed as ghost, which leverages
the underlying vulnerabilities of the IEEE 802.15.4 security suites to deplete
the energy of the devices. We manifest that the impact of ghost is severe as it
can reduce the lifetime of devices from years to days and facilitate a variety
of threats including denial of service and replay attacks. We highlight that
merely deploying a standard suite of advanced security techniques does not
necessarily guarantee improved security, but instead might be leveraged by
adversaries to cause severe disruption in the network. We propose several
recommendations on how to localize and withstand the ghost and other related
attacks in ZigBee networks. Extensive simulations are provided to show the
impact of the ghost and the performance of the proposed recommendations.
Moreover, physical experiments also have been conducted and the observations
confirm the severity of the impact by the ghost attack. We believe that the
presented work will aid the researchers to improve the security of ZigBee
further.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 04:19:04 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Shila",
"Devu Manikantan",
""
],
[
"Cao",
"Xianghui",
""
],
[
"Cheng",
"Yu",
""
],
[
"Yang",
"Zequ",
""
],
[
"Zhou",
"Yang",
""
],
[
"Chen",
"Jiming",
""
]
] |
new_dataset
| 0.996851 |
1410.1639
|
Yichen Jiang
|
Yichen Jiang, Yi Ji, Tianhua Liu
|
An Anonymous Communication Scheme based on Ring Signature in VANETs
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular ad hoc networks allow vehicles to connect themselves as networks so
that cars could communicate with each other. This paper introduces an anonymous
communication scheme providing integrity protection, multi-level privacy and
auditability. The scheme is based on a certificateless ring signature proposed
in this paper, which is contributed to reduce the length of the signature and
simplify the key management. In our scheme, vehicles can compose the anonymous
group without the help of road-side infrastructure or central authority. The
computation overhead is close to a normal signature scheme, so it is efficient
in most application scenarios. We also present a small-scale implementation to
show the availability of the prototype system.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 08:31:34 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Jiang",
"Yichen",
""
],
[
"Ji",
"Yi",
""
],
[
"Liu",
"Tianhua",
""
]
] |
new_dataset
| 0.999414 |
1410.1726
|
Ahmad Abdelfattah
|
Ahmad Abdelfattah, David Keyes, Hatem Ltaief
|
KBLAS: An Optimized Library for Dense Matrix-Vector Multiplication on
GPU Accelerators
|
Submitted to the ACM Transactions on Mathematical Software
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
KBLAS is a new open source high performance library that provides optimized
kernels for a subset of Level 2 BLAS functionalities on CUDA-enabled GPUs.
Since performance of dense matrix-vector multiplication is hindered by the
overhead of memory accesses, a double-buffering optimization technique is
employed to overlap data motion with computation. After identifying a proper
set of tuning parameters, KBLAS is able to efficiently run on various GPU
architectures across different generations, avoiding the time-consuming step of
code rewriting, while still being compliant with the standard BLAS API. Another
advanced optimization technique allows to ensure coalesced memory access when
dealing with submatrices, especially in the context of high level dense linear
algebra algorithms. All four precisions KBLAS kernels have been leveraged to
multi-GPUs environment, which requires the introduction of new APIs to ease
users' experiences on these challenging systems. The KBLAS performance
outperforms existing state-of-the-art implementations on all matrix sizes,
achieves asymptotically up to 50% and 60% speedup on single GPU and multi-GPUs
systems, respectively, and validates our performance model. A subset of KBLAS
high performance kernels has been integrated into NVIDIA's standard BLAS
implementation (cuBLAS) for larger dissemination, starting version 6.0.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 13:43:53 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Abdelfattah",
"Ahmad",
""
],
[
"Keyes",
"David",
""
],
[
"Ltaief",
"Hatem",
""
]
] |
new_dataset
| 0.989011 |
1410.1740
|
Stefanie Haustein
|
Stefanie Haustein, Timothy D. Bowman, Kim Holmberg, Isabella Peters
and Vincent Larivi\`ere
|
Astrophysicists on Twitter: An in-depth analysis of tweeting and
scientific publication behavior
|
14 pages, 5 figures, 7 tables
|
Aslib Journal of Information Management 66(3) (2014) 279-296
|
10.1108/AJIM-09-2013-0081
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper analyzes the tweeting behavior of 37 astrophysicists on Twitter
and compares their tweeting behavior with their publication behavior and
citation impact to show whether they tweet research-related topics or not.
Astrophysicists on Twitter are selected to compare their tweets with their
publications from Web of Science. Different user groups are identified based on
tweeting and publication frequency. A moderate negative correlation (p=-0.390*)
is found between the number of publications and tweets per day, while retweet
and citation rates do not correlate. The similarity between tweets and
abstracts is very low (cos=0.081). User groups show different tweeting behavior
such as retweeting and including hashtags, usernames and URLs. The study is
limited in terms of the small set of astrophysicists. Results are not
necessarily representative of the entire astrophysicist community on Twitter
and they most certainly do not apply to scientists in general. Future research
should apply the methods to a larger set of researchers and other scientific
disciplines. To a certain extent, this study helps to understand how
researchers use Twitter. The results hint at the fact that impact on Twitter
can neither be equated with nor replace traditional research impact metrics.
However, tweets and other so-called altmetrics might be able to reflect other
impact of scientists such as public outreach and science communication. To the
best of our knowledge, this is the first in-depth study comparing researchers'
tweeting activity and behavior with scientific publication output in terms of
quantity, content and impact.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2014 14:26:58 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Haustein",
"Stefanie",
""
],
[
"Bowman",
"Timothy D.",
""
],
[
"Holmberg",
"Kim",
""
],
[
"Peters",
"Isabella",
""
],
[
"Larivière",
"Vincent",
""
]
] |
new_dataset
| 0.99285 |
1410.1773
|
Fredrick Ishengoma
|
Fredrick Romanus Ishengoma
|
A Novel Design of IEEE 802.15.4 and Solar Based Autonomous Water Quality
Monitoring Prototype using ECHERP
|
12 pages, International Journal of Computer Science and Network
Solutions, Volume 2, Issue 1, January 2014
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recently advancement in Wireless Sensor Network (WSN) technology has
brought new distributed sensing applications such as water quality monitoring.
With sensing capabilities and using parameters like pH, conductivity and
temperature, the quality of water can be known. This paper proposes a novel
design based on IEEE 802.15.4 (Zig-Bee protocol) and solar energy called
Autonomous Water Quality Monitoring Prototype (AWQMP). The prototype is
designed to use ECHERP routing protocol and Adruino Mega 2560, an open-source
electronic prototyping platform for data acquisition. AWQMP is expected to give
real time data acquirement and to reduce the cost of manual water quality
monitoring due to its autonomous characteristic. Moreover, the proposed
prototype will help to study the behavior of aquatic animals in deployed water
bodies.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 12:52:37 GMT"
}
] | 2014-10-08T00:00:00 |
[
[
"Ishengoma",
"Fredrick Romanus",
""
]
] |
new_dataset
| 0.991176 |
1010.0852
|
Daniela Maftuleac
|
Victor Chepoi and Daniela Maftuleac
|
Shortest path problem in rectangular complexes of global nonpositive
curvature
| null | null |
10.1016/j.comgeo.2012.04.002
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CAT(0) metric spaces constitute a far-reaching common generalization of
Euclidean and hyperbolic spaces and simple polygons: any two points x and y of
a CAT(0) metric space are connected by a unique shortest path {\gamma}(x,y). In
this paper, we present an efficient algorithm for answering two-point distance
queries in CAT(0) rectangular complexes and two of theirs subclasses, ramified
rectilinear polygons (CAT(0) rectangular complexes in which the links of all
vertices are bipartite graphs) and squaregraphs (CAT(0) rectangular complexes
arising from plane quadrangulations in which all inner vertices have degrees
\geq4). Namely, we show that for a CAT(0) rectangular complex K with n
vertices, one can construct a data structure D of size $O(n^2)$ so that, given
any two points x,y in K, the shortest path {\gamma}(x,y) between x and y can be
computed in O(d(p,q)) time, where p and q are vertices of two faces of K
containing the points x and y, respectively, such that {\gamma}(x,y) is
contained in K(I(p,q)) and d(p,q) is the distance between p and q in the
underlying graph of K. If K is a ramified rectilinear polygon, then one can
construct a data structure D of optimal size O(n) and answer two-point shortest
path queries in O(d(p,q)log{\Delta}) time, where {\Delta} is the maximal degree
of a vertex of G(K). Finally, if K is a squaregraph, then one can construct a
data structure D of size O(nlogn) and answer two-point shortest path queries in
O(d(p,q)) time.
|
[
{
"version": "v1",
"created": "Tue, 5 Oct 2010 12:05:21 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Mar 2012 21:23:18 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Chepoi",
"Victor",
""
],
[
"Maftuleac",
"Daniela",
""
]
] |
new_dataset
| 0.965287 |
1312.0885
|
Dipankar Saha
|
Dipankar Saha, Aanan Chatterjee, Sayan Chatterjee, and C. K. Sarkar
|
Row-Based Dual Vdd Assignment, for a Level Converter Free CSA Design and
Its Near-Threshold Operation
|
Final Version of this work is available @ Advances in Electrical
Engineering, Hindawi Publishing Corporation (Volume 2014 (2014), Article ID
814975, 6 pages)
| null |
10.1155/2014/814975
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Subthreshold circuit designs are very much popular for some of the ultra low
power applications, where the minimum energy consumption is the primary
concern. But, due to the weak driving current, these circuits generally suffer
from huge performance degradation. Therefore, in this paper, we primarily
targeted to analyze the performance of a Near-Threshold Circuit (NTC), which
retains the excellent energy efficiency of the subthreshold design, while
improving the performance to a certain extent. A modified row-based dual Vdd
4-operand CSA (Carry Save Adder) design has been reported in the present work
using 45 nm technology. Moreover, to find out the effectiveness of the
near-threshold operation of the 4-operand CSA design; it has been compared with
the other design styles. From the simulation results, obtained for the
frequency of 20 MHz, we found that the proposed scheme of CSA design consumes
3.009*10-7 Watt of Average Power (Pavg), which is almost 90.9 % lesser than
that of the conventional CSA design. Whereas, looking at the perspective of
maximum delay at output, the proposed scheme of CSA design provides a fair
44.37 % improvement, compared to that of the subthreshold CSA design.
|
[
{
"version": "v1",
"created": "Fri, 29 Nov 2013 09:48:57 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Jul 2014 06:43:16 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Aug 2014 14:33:21 GMT"
},
{
"version": "v4",
"created": "Sun, 5 Oct 2014 11:01:20 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Saha",
"Dipankar",
""
],
[
"Chatterjee",
"Aanan",
""
],
[
"Chatterjee",
"Sayan",
""
],
[
"Sarkar",
"C. K.",
""
]
] |
new_dataset
| 0.998831 |
1312.3735
|
Christoph Bunte
|
Christoph Bunte and Amos Lapidoth
|
Codes for Tasks and R\'enyi Entropy Rate
|
5 pages, to be presented at ISIT 2014; minor changes in the
presentation, added a reference
| null |
10.1109/ISIT.2014.6874852
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A task is randomly drawn from a finite set of tasks and is described using a
fixed number of bits. All the tasks that share its description must be
performed. Upper and lower bounds on the minimum $\rho$-th moment of the number
of performed tasks are derived. The key is an analog of the Kraft Inequality
for partitions of finite sets. When a sequence of tasks is produced by a source
of a given R\'enyi entropy rate of order $1/(1+\rho)$ and $n$ tasks are jointly
described using $nR$ bits, it is shown that for $R$ larger than the R\'enyi
entropy rate, the $\rho$-th moment of the ratio of performed tasks to $n$ can
be driven to one as $n$ tends to infinity, and that for $R$ less than the
R\'enyi entropy rate it tends to infinity. This generalizes a recent result for
IID sources by the same authors. A mismatched version of the direct part is
also considered, where the code is designed according to the wrong law. The
penalty incurred by the mismatch can be expressed in terms of a divergence
measure that was shown by Sundaresan to play a similar role in the
Massey-Arikan guessing problem.
|
[
{
"version": "v1",
"created": "Fri, 13 Dec 2013 09:09:01 GMT"
},
{
"version": "v2",
"created": "Fri, 2 May 2014 13:16:18 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Bunte",
"Christoph",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.994021 |
1402.4675
|
Boris Bellalta Dr.
|
T. Adame, A. Bel, B. Bellalta, J. Barcelo, M. Oliver
|
IEEE 802.11ah: The Wi-Fi Approach for M2M Communications
|
IEEE Wireless Magazine, 2014
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
M2M communications are projected to be one of the fastest growing technology
segments of the IT sector in the next years. Sensor and actuator networks
connect communication machines and devices so that they automatically transmit
information, serving the growing demand for environmental data acquisition.
IEEE 802.11ah Task Group addresses the creation of a new standard for giving
response to the particular requirements of this type of networks: large number
of power-constrained stations, long transmission range, small and infrequent
data messages, low data-rates and non-critical delay. This article explores the
key features of this new standard under development, especially those related
to the reduction of energy consumption in the MAC Layer. In this direction, a
performance assessment of IEEE 802.11ah in four typical M2M scenarios has been
performed.
|
[
{
"version": "v1",
"created": "Wed, 19 Feb 2014 14:35:12 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Oct 2014 17:46:59 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Adame",
"T.",
""
],
[
"Bel",
"A.",
""
],
[
"Bellalta",
"B.",
""
],
[
"Barcelo",
"J.",
""
],
[
"Oliver",
"M.",
""
]
] |
new_dataset
| 0.998527 |
1405.7464
|
Anna-Lena Trautmann
|
Anna-Lena Trautmann and Emanuele Viterbo
|
Cross-Error Correcting Integer Codes over $\mathbb{Z}_{2^m}$
|
To be published in the proceedings of ISITA 2014, IEICE copyright
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we investigate codes in $\mathbb{Z}_{2^m}^n$ that can correct
errors that occur in just one coordinate of the codeword, with a magnitude of
up to a given parameter $t$. We will show upper bounds on these cross codes,
derive constructions for linear codes and respective decoding algorithm. The
constructions (and decoding algorithms) are given for length $n = 2$ and $n =
3$, but for general $m$ and $t$.
|
[
{
"version": "v1",
"created": "Thu, 29 May 2014 05:08:12 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Oct 2014 03:31:09 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Trautmann",
"Anna-Lena",
""
],
[
"Viterbo",
"Emanuele",
""
]
] |
new_dataset
| 0.98947 |
1407.1428
|
Avery Miller
|
Avery Miller, Andrzej Pelc
|
Fast Rendezvous with Advice
| null | null | null | null |
cs.DS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile agents, starting from different nodes of an $n$-node network at
possibly different times, have to meet at the same node. This problem is known
as rendezvous. Agents move in synchronous rounds using a deterministic
algorithm. In each round, an agent decides to either remain idle or to move to
one of the adjacent nodes. Each agent has a distinct integer label from the set
$\{1,...,L\}$, which it can use in the execution of the algorithm, but it does
not know the label of the other agent.
If $D$ is the distance between the initial positions of the agents, then
$\Omega(D)$ is an obvious lower bound on the time of rendezvous. However, if
each agent has no initial knowledge other than its label, time $O(D)$ is
usually impossible to achieve. We study the minimum amount of information that
has to be available a priori to the agents to achieve rendezvous in optimal
time $\Theta(D)$. This information is provided to the agents at the start by an
oracle knowing the entire instance of the problem, i.e., the network, the
starting positions of the agents, their wake-up rounds, and both of their
labels. The oracle helps the agents by providing them with the same binary
string called advice, which can be used by the agents during their navigation.
The length of this string is called the size of advice. Our goal is to find the
smallest size of advice which enables the agents to meet in time $\Theta(D)$.
We show that this optimal size of advice is $\Theta(D\log(n/D)+\log\log L)$.
The upper bound is proved by constructing an advice string of this size, and
providing a natural rendezvous algorithm using this advice that works in time
$\Theta(D)$ for all networks. The matching lower bound, which is the main
contribution of this paper, is proved by exhibiting classes of networks for
which it is impossible to achieve rendezvous in time $\Theta(D)$ with smaller
advice.
|
[
{
"version": "v1",
"created": "Sat, 5 Jul 2014 19:33:08 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Oct 2014 13:08:32 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Miller",
"Avery",
""
],
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.997321 |
1410.1090
|
Junhua Mao
|
Junhua Mao, Wei Xu, Yi Yang, Jiang Wang, Alan L. Yuille
|
Explain Images with Multimodal Recurrent Neural Networks
| null | null | null | null |
cs.CV cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a multimodal Recurrent Neural Network (m-RNN) model
for generating novel sentence descriptions to explain the content of images. It
directly models the probability distribution of generating a word given
previous words and the image. Image descriptions are generated by sampling from
this distribution. The model consists of two sub-networks: a deep recurrent
neural network for sentences and a deep convolutional network for images. These
two sub-networks interact with each other in a multimodal layer to form the
whole m-RNN model. The effectiveness of our model is validated on three
benchmark datasets (IAPR TC-12, Flickr 8K, and Flickr 30K). Our model
outperforms the state-of-the-art generative method. In addition, the m-RNN
model can be applied to retrieval tasks for retrieving images or sentences, and
achieves significant performance improvement over the state-of-the-art methods
which directly optimize the ranking objective function for retrieval.
|
[
{
"version": "v1",
"created": "Sat, 4 Oct 2014 20:24:34 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Mao",
"Junhua",
""
],
[
"Xu",
"Wei",
""
],
[
"Yang",
"Yi",
""
],
[
"Wang",
"Jiang",
""
],
[
"Yuille",
"Alan L.",
""
]
] |
new_dataset
| 0.968699 |
1410.1127
|
Xianwen Wang
|
Xianwen Wang, Shenmeng Xu, Zhi Wang, Lian Peng, Chuanli Wang
|
International Scientific Collaboration of China: Collaborating
Countries, Institutions and Individuals
|
11 pages,3 figures
|
Scientometrics 95.3 (2013): 885-894
|
10.1007/s11192-012-0877-4
| null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using bibliometric methods, we investigate China's international scientific
collaboration from 3 levels of collaborating countries, institutions and
individuals. We design a database in SQL Server, and make analysis of Chinese
SCI papers based on the corresponding author field. We find that China's
international scientific collaboration is focused on a handful of countries.
Nearly 95% international co-authored papers are collaborated with only 20
countries, among which the USA account for more than 40% of all. Results also
show that Chinese lineage in the international co-authorship is obvious, which
means Chinese immigrant scientists are playing an important role in China's
international scientific collaboration, especially in English-speaking
countries.
|
[
{
"version": "v1",
"created": "Sun, 5 Oct 2014 06:41:02 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Wang",
"Xianwen",
""
],
[
"Xu",
"Shenmeng",
""
],
[
"Wang",
"Zhi",
""
],
[
"Peng",
"Lian",
""
],
[
"Wang",
"Chuanli",
""
]
] |
new_dataset
| 0.990933 |
1410.1130
|
Koen Samyn
|
Koen Samyn, Sofie Van Hoecke, Bart Pieters, Charles Hollemeersch,
Aljosha Demeulemeester and Rik van de Walle
|
Real-time animation of human characters with fuzzy controllers
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The production of animation is a resource intensive process in game
companies. Therefore, techniques to synthesize animations have been developed.
However, these procedural techniques offer limited adaptability by animation
artists. In order to solve this, a fuzzy neural network model of the animation
is proposed, where the parameters can be tuned either by machine learning
techniques that use motion capture data as training data or by the animation
artist himself. This paper illustrates how this real time procedural animation
system can be developed, taking the human gait on flat terrain and inclined
surfaces as example. Currently, the parametric model is capable of synthesizing
animations for various limb sizes and step sizes.
|
[
{
"version": "v1",
"created": "Sun, 5 Oct 2014 07:26:44 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Samyn",
"Koen",
""
],
[
"Van Hoecke",
"Sofie",
""
],
[
"Pieters",
"Bart",
""
],
[
"Hollemeersch",
"Charles",
""
],
[
"Demeulemeester",
"Aljosha",
""
],
[
"van de Walle",
"Rik",
""
]
] |
new_dataset
| 0.978588 |
1410.1160
|
Aleksandar Milenkoski
|
Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno
Antunes and Marco Vieira
|
On Benchmarking Intrusion Detection Systems in Virtualized Environments
|
SPEC (Standard Performance Evaluation Corporation) Research Group ---
IDS Benchmarking Working Group
| null | null |
SPEC-RG-2013-002
|
cs.CR cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern intrusion detection systems (IDSes) for virtualized environments are
deployed in the virtualization layer with components inside the virtual machine
monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor
at the same time the network and host activities of all guest VMs running on
top of a VMM being isolated from malicious users of these VMs. We refer to
IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze
state-of-the-art intrusion detection techniques applied in virtualized
environments and architectures of VMM-based IDSes. Further, we identify
challenges that apply specifically to benchmarking VMM-based IDSes focussing on
workloads and metrics. For example, we discuss the challenge of defining
representative baseline benign workload profiles as well as the challenge of
defining malicious workloads containing attacks targeted at the VMM. We also
discuss the impact of on-demand resource provisioning features of virtualized
environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS
benchmarking measures such as capacity and attack detection accuracy. Finally,
we outline future research directions in the area of benchmarking VMM-based
IDSes and of intrusion detection in virtualized environments in general.
|
[
{
"version": "v1",
"created": "Sun, 5 Oct 2014 13:30:15 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Milenkoski",
"Aleksandar",
""
],
[
"Kounev",
"Samuel",
""
],
[
"Avritzer",
"Alberto",
""
],
[
"Antunes",
"Nuno",
""
],
[
"Vieira",
"Marco",
""
]
] |
new_dataset
| 0.985703 |
1410.1267
|
Alex James Dr
|
Akshay Kumar Maan, Dinesh Sasi Kumar, Sherin Sugathan, and Alex
Pappachen James
|
Memristive Threshold Logic Circuit Design of Fast Moving Object
Detection
|
To be published in IEEE Transactions on Very Large Scale Integration
(VLSI) Systems
| null |
10.1109/TVLSI.2014.2359801
| null |
cs.CV cs.AR cs.ET
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Real-time detection of moving objects involves memorisation of features in
the template image and their comparison with those in the test image. At high
sampling rates, such techniques face the problems of high algorithmic
complexity and component delays. We present a new resistive switching based
threshold logic cell which encodes the pixels of a template image. The cell
comprises a voltage divider circuit that programs the resistances of the
memristors arranged in a single node threshold logic network and the output is
encoded as a binary value using a CMOS inverter gate. When a test image is
applied to the template-programmed cell, a mismatch in the respective pixels is
seen as a change in the output voltage of the cell. The proposed cell when
compared with CMOS equivalent implementation shows improved performance in
area, leakage power, power dissipation and delay.
|
[
{
"version": "v1",
"created": "Mon, 6 Oct 2014 06:52:57 GMT"
}
] | 2014-10-07T00:00:00 |
[
[
"Maan",
"Akshay Kumar",
""
],
[
"Kumar",
"Dinesh Sasi",
""
],
[
"Sugathan",
"Sherin",
""
],
[
"James",
"Alex Pappachen",
""
]
] |
new_dataset
| 0.999452 |
1410.0735
|
Roya Ensafi
|
Roya Ensafi, Philipp Winter, Abdullah Mueen, Jedidiah R. Crandall
|
Large-scale Spatiotemporal Characterization of Inconsistencies in the
World's Largest Firewall
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A nation-scale firewall, colloquially referred to as the "Great Firewall of
China," implements many different types of censorship and content filtering to
control China's Internet traffic. Past work has shown that the firewall
occasionally fails. In other words, sometimes clients in China are able to
reach blacklisted servers outside of China. This phenomenon has not yet been
characterized because it is infeasible to find a large and geographically
diverse set of clients in China from which to test connectivity.
In this paper, we overcome this challenge by using hybrid idle scan
techniques that are able to measure connectivity between a remote client and an
arbitrary server, neither of which are under the control of the researcher
performing measurements. In addition to hybrid idle scans, we present and
employ a novel side channel in the Linux kernel's SYN backlog. We demonstrate
both techniques by measuring the reachability of the Tor network which is known
to be blocked in China. Our measurements reveal that 1) failures in the
firewall occur throughout the entire country without any conspicuous
geographical patterns, 2) a network block in China appears to have unfiltered
access to parts of the Tor network, and 3) the filtering seems to be mostly
centralized at the level of Internet exchange points. Our work also answers
many other open questions about the Great Firewall's architecture and
implementation.
|
[
{
"version": "v1",
"created": "Fri, 3 Oct 2014 01:11:24 GMT"
}
] | 2014-10-06T00:00:00 |
[
[
"Ensafi",
"Roya",
""
],
[
"Winter",
"Philipp",
""
],
[
"Mueen",
"Abdullah",
""
],
[
"Crandall",
"Jedidiah R.",
""
]
] |
new_dataset
| 0.99025 |
1410.0879
|
Jean Gregoire
|
Jean Gregoire
|
Priority-based coordination of mobile robots
|
PhD Thesis, 182 pages
| null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the end of the 1980's, the development of self-driven autonomous
vehicles is an intensive research area in most major industrial countries.
Positive socio-economic potential impacts include a decrease of crashes, a
reduction of travel times, energy efficiency improvements, and a reduced need
of costly physical infrastructure. Some form of vehicle-to-vehicle and/or
vehicle-to-infrastructure cooperation is required to ensure a safe and
efficient global transportation system. This thesis deals with a particular
form of cooperation by studying the problem of coordinating multiple mobile
robots at an intersection area. Most of coordination systems proposed in
previous work consist in planning a trajectory and to control the robots along
the planned trajectory: that is the plan-as-program paradigm where planning is
considered as a generative mechanism of action. The approach of the thesis is
to plan priorities -- the relative order of robots to go through the
intersection -- which is much weaker as many trajectories respect the same
priorities. More precisely, priorities encode the homotopy classes of solutions
to the coordination problem. Priority assignment is equivalent to the choice of
some homotopy class to solve the coordination problem instead of a particular
trajectory. Once priorities are assigned, robots are controlled through a
control law preserving the assigned priorities, i.e., ensuring the described
trajectory belongs to the chosen homotopy class. It results in a more robust
coordination system -- able to handle a large class of unexpected events in a
reactive manner -- particularly well adapted for an application to the
coordination of autonomous vehicles at intersections where cars, public
transport and pedestrians share the road.
|
[
{
"version": "v1",
"created": "Fri, 3 Oct 2014 15:24:00 GMT"
}
] | 2014-10-06T00:00:00 |
[
[
"Gregoire",
"Jean",
""
]
] |
new_dataset
| 0.983903 |
1409.6092
|
Wei Hengjia
|
Wei Hengjia, Zhang Hui, Zhu Mingzhi and Ge Gennian
|
Optimal Ternary Constant-Composition Codes with Weight Four and Distance
Six
|
44 pages
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The sizes of optimal constant-composition codes of weight three have been
determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes
played an important role in their constructions. In this paper, we study the
problem of constructing optimal ternary constant-composition codes with Hamming
weight four and minimum distance six. The problem is solved with a small number
of lengths undetermined. The previously known results are those with code
length no greater than 10.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 07:36:49 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Oct 2014 04:48:37 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Hengjia",
"Wei",
""
],
[
"Hui",
"Zhang",
""
],
[
"Mingzhi",
"Zhu",
""
],
[
"Gennian",
"Ge",
""
]
] |
new_dataset
| 0.997453 |
1410.0371
|
Ankit Chaudhary
|
J. L. Raheja, B. Ajay, Ankit Chaudhary
|
Real Time Fabric Defect Detection System on an Embedded DSP Platform
|
Optik Elsevier 2013
| null |
10.1016/j.ijleo.2013.03.038
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In industrial fabric productions, automated real time systems are needed to
find out the minor defects. It will save the cost by not transporting defected
products and also would help in making compmay image of quality fabrics by
sending out only undefected products. A real time fabric defect detection
system (FDDS), implementd on an embedded DSP platform is presented here.
Textural features of fabric image are extracted based on gray level
co-occurrence matrix (GLCM). A sliding window technique is used for defect
detection where window moves over the whole image computing a textural energy
from the GLCM of the fabric image. The energy values are compared to a
reference and the deviations beyond a threshold are reported as defects and
also visually represented by a window. The implementation is carried out on a
TI TMS320DM642 platform and programmed using code composer studio software. The
real time output of this implementation was shown on a monitor.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 02:49:07 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Raheja",
"J. L.",
""
],
[
"Ajay",
"B.",
""
],
[
"Chaudhary",
"Ankit",
""
]
] |
new_dataset
| 0.998625 |
1410.0443
|
Himanshu Tyagi
|
Masahito Hayashi, Himanshu Tyagi, Shun Watanabe
|
Strong Converse for a Degraded Wiretap Channel via Active Hypothesis
Testing
|
This paper was presented at Allerton 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish an upper bound on the rate of codes for a wiretap channel with
public feedback for a fixed probability of error and secrecy parameter. As a
corollary, we obtain a strong converse for the capacity of a degraded wiretap
channel with public feedback. Our converse proof is based on a reduction of
active hypothesis testing for discriminating between two channels to coding for
wiretap channel with feedback.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 02:56:19 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Hayashi",
"Masahito",
""
],
[
"Tyagi",
"Himanshu",
""
],
[
"Watanabe",
"Shun",
""
]
] |
new_dataset
| 0.966038 |
1410.0471
|
Arto Klami
|
Zakria Hussain, Arto Klami, Jussi Kujala, Alex P. Leung, Kitsuchart
Pasupa, Peter Auer, Samuel Kaski, Jorma Laaksonen and John Shawe-Taylor
|
PinView: Implicit Feedback in Content-Based Image Retrieval
|
12 pages
| null | null | null |
cs.IR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes PinView, a content-based image retrieval system that
exploits implicit relevance feedback collected during a search session. PinView
contains several novel methods to infer the intent of the user. From relevance
feedback, such as eye movements or pointer clicks, and visual features of
images, PinView learns a similarity metric between images which depends on the
current interests of the user. It then retrieves images with a specialized
online learning algorithm that balances the tradeoff between exploring new
images and exploiting the already inferred interests of the user. We have
integrated PinView to the content-based image retrieval system PicSOM, which
enables applying PinView to real-world image databases. With the new algorithms
PinView outperforms the original PicSOM, and in online experiments with real
users the combination of implicit and explicit feedback gives the best results.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 08:05:19 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Hussain",
"Zakria",
""
],
[
"Klami",
"Arto",
""
],
[
"Kujala",
"Jussi",
""
],
[
"Leung",
"Alex P.",
""
],
[
"Pasupa",
"Kitsuchart",
""
],
[
"Auer",
"Peter",
""
],
[
"Kaski",
"Samuel",
""
],
[
"Laaksonen",
"Jorma",
""
],
[
"Shawe-Taylor",
"John",
""
]
] |
new_dataset
| 0.998665 |
1410.0478
|
Subhadip Basu
|
Nibaran Das, Sandip Pramanik, Subhadip Basu, Punam Kumar Saha, Ram
Sarkar, Mahantapas Kundu, Mita Nasipuri
|
Recognition of Handwritten Bangla Basic Characters and Digits using
Convex Hull based Feature Set
| null |
2009 International Conference on Artificial Intelligence and
Pattern Recognition, At Orlando, Florida pp. 380-386
|
10.13140/2.1.3689.4089
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In dealing with the problem of recognition of handwritten character patterns
of varying shapes and sizes, selection of a proper feature set is important to
achieve high recognition performance. The current research aims to evaluate the
performance of the convex hull based feature set, i.e. 125 features in all
computed over different bays attributes of the convex hull of a pattern, for
effective recognition of isolated handwritten Bangla basic characters and
digits. On experimentation with a database of 10000 samples, the maximum
recognition rate of 76.86% is observed for handwritten Bangla characters. For
Bangla numerals the maximum success rate of 99.45%. is achieved on a database
of 12000 sample. The current work validates the usefulness of a new kind of
feature set for recognition of handwritten Bangla basic characters and
numerals.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 08:26:38 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Das",
"Nibaran",
""
],
[
"Pramanik",
"Sandip",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Saha",
"Punam Kumar",
""
],
[
"Sarkar",
"Ram",
""
],
[
"Kundu",
"Mahantapas",
""
],
[
"Nasipuri",
"Mita",
""
]
] |
new_dataset
| 0.990901 |
1410.0531
|
Fredrick Ishengoma
|
Fredrick Romanus Ishengoma
|
Online Social Networks and Terrorism 2.0 in Developing Countries
|
11 pages
|
International Journal of Computer Science and Network Solutions,
Volume 1, Issue 4, December 2013
| null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advancement in technology has brought a new era in terrorism where Online
Social Networks have become a major platform of communication with wide range
of usage from message channeling to propaganda and recruitment of new followers
in terrorist groups. Meanwhile, during the terrorist attacks people use social
networks for information exchange, mobilizing and uniting and raising money for
the victims. This paper critically analyses the specific usage of social
networks in the times of terrorism attacks in developing countries.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 12:52:24 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Ishengoma",
"Fredrick Romanus",
""
]
] |
new_dataset
| 0.998217 |
1410.0573
|
Thomas Nickson
|
Thomas Nickson, Igor Potapov
|
Broadcasting Automata and Patterns on Z^2
| null | null | null | null |
cs.FL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Broadcasting Automata model draws inspiration from a variety of sources
such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and
nature, employing many of the same pattern forming methods that can be seen in
the superposition of waves and resonance. Algorithms for broad- casting
automata model are in the same vain as those encountered in distributed
algorithms using a simple notion of waves, messages passed from automata to au-
tomata throughout the topology, to construct computations. The waves generated
by activating processes in a digital environment can be used for designing a
vari- ety of wave algorithms. In this chapter we aim to study the geometrical
shapes of informational waves on integer grid generated in broadcasting
automata model as well as their potential use for metric approximation in a
discrete space. An explo- ration of the ability to vary the broadcasting radius
of each node leads to results of categorisations of digital discs, their form,
composition, encodings and gener- ation. Results pertaining to the nodal
patterns generated by arbitrary transmission radii on the plane are explored
with a connection to broadcasting sequences and ap- proximation of discrete
metrics of which results are given for the approximation of astroids, a
previously unachievable concave metric, through a novel application of the
aggregation of waves via a number of explored functions.
|
[
{
"version": "v1",
"created": "Thu, 2 Oct 2014 14:41:57 GMT"
}
] | 2014-10-03T00:00:00 |
[
[
"Nickson",
"Thomas",
""
],
[
"Potapov",
"Igor",
""
]
] |
new_dataset
| 0.997039 |
1404.1775
|
Erik Demaine
|
Erik D. Demaine and Martin L. Demaine
|
Fun with Fonts: Algorithmic Typography
|
14 pages, 12 figures. Revised paper with new glass cane font.
Original version in Proceedings of the 7th International Conference on Fun
with Algorithms
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past decade, we have designed six typefaces based on mathematical
theorems and open problems, specifically computational geometry. These
typefaces expose the general public in a unique way to intriguing results and
hard problems in hinged dissections, geometric tours, origami design,
computer-aided glass design, physical simulation, and protein folding. In
particular, most of these typefaces include puzzle fonts, where reading the
intended message requires solving a series of puzzles which illustrate the
challenge of the underlying algorithmic problem.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2014 13:03:52 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Oct 2014 02:45:46 GMT"
}
] | 2014-10-02T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
]
] |
new_dataset
| 0.991064 |
1410.0190
|
Iqbal Hussain
|
Iqbal Hussain, Ming Xiao, and Lars K. Rasmussen
|
Rateless Codes for the Multi-Way Relay Channel
|
4 pages, 03 figures, Accepted in IEEE Wireless Communication Letters
|
IEEE Wireless Communication Letters 2014
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider distributed Luby transform (DLT) codes for efficient packet
transmission in a multi-way relay network, where the links are modeled as
erasure channels. Density evolution is applied for asymptotic performance
analysis, and subsequently used in a linear-programming design framework for
optimizing the degree distribution at the relay in terms of overhead. Moreover
a buffer is introduced at the relay to enable efficient downlink transmission
even if packets are lost during uplink transmission. Performance losses in
terms of delay and/or erasure rates caused by link erasures during uplink
transmission are thus alleviated. The proposed DLT codes provide significant
improvements in overhead and decoded erasure rates. Numerical results for
finite-length codes follow closely the asymptotic analysis. Our results
demonstrate that the proposed buffer-based DLT codes outperform its
counterparts for lossy uplink transmission.
|
[
{
"version": "v1",
"created": "Wed, 1 Oct 2014 11:54:32 GMT"
}
] | 2014-10-02T00:00:00 |
[
[
"Hussain",
"Iqbal",
""
],
[
"Xiao",
"Ming",
""
],
[
"Rasmussen",
"Lars K.",
""
]
] |
new_dataset
| 0.981234 |
1409.8372
|
Leon Abdillah
|
Leon Andretti Abdillah
|
Indonesian's presidential social media campaigns
|
Best Paper Award, L. A. Abdillah, "Indonesian's presidential social
media campaigns," in Seminar Nasional Sistem Informasi Indonesia
(SESINDO2014), ITS, Surabaya, 22 September, 2014
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media has been used for political campaigns of presidential candidates
in a number of democratic countries, including Indonesia.The candidates for
president and vice president have been following the latest trends in the
virtual world by using social media such as: 1) Facebook, and 2) Twitter.The
author's continuing research with a focus on the popularity of candidates for
president and vice president of the Indonesian presidential election in July 9,
2014.The authors found that Facebook remains a social media most widely used in
Indonesia for presidential campaigns. Prabowo secured the most number of fans
on Facebook. While Joko Widodo secured the most number of followers on
Twitter.Facebook users is dominated by the user in the age range 18-24 years,
and most cities are using Facebook is Jakarta.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2014 03:07:26 GMT"
}
] | 2014-10-01T00:00:00 |
[
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.999748 |
1409.8464
|
Friedrich Slivovsky
|
Friedrich Slivovsky and Stefan Szeider
|
Model Counting for Formulas of Bounded Clique-Width
|
Extended version of a paper published at ISAAC 2013
|
Proceedings of ISAAC 2013. Lecture Notes in Computer Science, vol.
8283, pp. 677-687, Springer, 2013
| null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that #SAT is polynomial-time tractable for classes of CNF formulas
whose incidence graphs have bounded symmetric clique-width (or bounded
clique-width, or bounded rank-width). This result strictly generalizes
polynomial-time tractability results for classes of formulas with signed
incidence graphs of bounded clique-width and classes of formulas with incidence
graphs of bounded modular treewidth, which were the most general results of
this kind known so far.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2014 10:27:07 GMT"
}
] | 2014-10-01T00:00:00 |
[
[
"Slivovsky",
"Friedrich",
""
],
[
"Szeider",
"Stefan",
""
]
] |
new_dataset
| 0.995044 |
1409.8489
|
Mark Scanlon
|
Mark Scanlon, Jason Farina, M-Tahar Kechadi
|
BitTorrent Sync: Network Investigation Methodology
|
9th International Conference on Availability, Reliability and
Security (ARES 2014)
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The volume of personal information and data most Internet users find
themselves amassing is ever increasing and the fast pace of the modern world
results in most requiring instant access to their files. Millions of these
users turn to cloud based file synchronisation services, such as Dropbox,
Microsoft Skydrive, Apple iCloud and Google Drive, to enable "always-on" access
to their most up-to-date data from any computer or mobile device with an
Internet connection. The prevalence of recent articles covering various
invasion of privacy issues and data protection breaches in the media has caused
many to review their online security practices with their personal information.
To provide an alternative to cloud based file backup and synchronisation,
BitTorrent Inc. released an alternative cloudless file backup and
synchronisation service, named BitTorrent Sync to alpha testers in April 2013.
BitTorrent Sync's popularity rose dramatically throughout 2013, reaching over
two million active users by the end of the year. This paper outlines a number
of scenarios where the network investigation of the service may prove
invaluable as part of a digital forensic investigation. An investigation
methodology is proposed outlining the required steps involved in retrieving
digital evidence from the network and the results from a proof of concept
investigation are presented.
|
[
{
"version": "v1",
"created": "Tue, 30 Sep 2014 11:21:30 GMT"
}
] | 2014-10-01T00:00:00 |
[
[
"Scanlon",
"Mark",
""
],
[
"Farina",
"Jason",
""
],
[
"Kechadi",
"M-Tahar",
""
]
] |
new_dataset
| 0.994525 |
1202.1229
|
Christopher Portmann
|
Christopher Portmann
|
Key recycling in authentication
|
17+3 pages. 11 figures. v3: Rewritten with AC instead of UC. Extended
the main result to both synchronous and asynchronous networks. Matches
published version up to layout and updated references. v2: updated
introduction and references
|
IEEE Trans. Inf. Th., 60(7):4383-4396, 2014
|
10.1109/TIT.2014.2317312
| null |
cs.IT cs.CR math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In their seminal work on authentication, Wegman and Carter propose that to
authenticate multiple messages, it is sufficient to reuse the same hash
function as long as each tag is encrypted with a one-time pad. They argue that
because the one-time pad is perfectly hiding, the hash function used remains
completely unknown to the adversary.
Since their proof is not composable, we revisit it using a composable
security framework. It turns out that the above argument is insufficient: if
the adversary learns whether a corrupted message was accepted or rejected,
information about the hash function is leaked, and after a bounded finite
amount of rounds it is completely known. We show however that this leak is very
small: Wegman and Carter's protocol is still $\epsilon$-secure, if
$\epsilon$-almost strongly universal$_2$ hash functions are used. This implies
that the secret key corresponding to the choice of hash function can be reused
in the next round of authentication without any additional error than this
$\epsilon$.
We also show that if the players have a mild form of synchronization, namely
that the receiver knows when a message should be received, the key can be
recycled for any arbitrary task, not only new rounds of authentication.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2012 18:09:38 GMT"
},
{
"version": "v2",
"created": "Thu, 31 May 2012 14:26:48 GMT"
},
{
"version": "v3",
"created": "Mon, 29 Sep 2014 13:15:35 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Portmann",
"Christopher",
""
]
] |
new_dataset
| 0.995175 |
1408.5445
|
Heide Gluesing-Luerssen
|
Neville Fogarty and Heide Gluesing-Luerssen
|
A Circulant Approach to Skew-Constacyclic Codes
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce circulant matrices that capture the structure of a
skew-polynomial ring F[x;\theta] modulo the left ideal generated by a
polynomial of the type x^n-a. This allows us to develop an approach to
skew-constacyclic codes based on such circulants. Properties of these
circulants are derived, and in particular it is shown that the transpose of a
certain circulant is a circulant again. This recovers the well-known result
that the dual of a skew-constacyclic code is a constacyclic code again. Special
attention is paid to the case where x^n-a is two-sided.
|
[
{
"version": "v1",
"created": "Fri, 22 Aug 2014 23:48:11 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Sep 2014 23:36:05 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Fogarty",
"Neville",
""
],
[
"Gluesing-Luerssen",
"Heide",
""
]
] |
new_dataset
| 0.950484 |
1409.3554
|
Ankit Chaudhary
|
Ankit Chaudhary
|
Finger-Stylus for Non Touch-Enable Systems
|
JKSU Engineering Sciences, Elsevier, 2015
| null |
10.1016/j.jksues.2014.02.002
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since computer was invented, people are using many devices to interact with
computer. Initially there were keyboard, mouse etc. but with the advancement of
technology, new ways are being discovered that are quite usual and natural to
the humans like stylus, touch-enable systems. In the current age of technology,
user is expected to touch the machine interface to give input. Hand gesture is
such a way to interact with machines where natural bare hand is used to
communicate without touching machine interface. It gives a feeling to user that
he is interacting in natural way to some human, not with traditional machines.
This paper presents a technique where user needs not to touch the machine
interface to draw on screen. Here hand finger draws shapes on monitor like
stylus, without touching the monitor. This method can be used in many
applications including games. The finger was used as an input device that acts
like paint-brush or finger-stylus and is used to make shapes in front of the
camera. Fingertip extraction and motion tracking were done in Matlab with real
time constraints. This work is an early attempt to replace stylus with the
natural finger without touching screen.
|
[
{
"version": "v1",
"created": "Sun, 7 Sep 2014 19:20:45 GMT"
},
{
"version": "v2",
"created": "Sat, 27 Sep 2014 06:24:09 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Chaudhary",
"Ankit",
""
]
] |
new_dataset
| 0.999467 |
1409.7853
|
Fatiha Merazka FM
|
Aziz Mouzali, Fatiha Merazka
|
Quantum correction with three codes
|
24 pages
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we provise an implementation of five, seven and nine-qubits
error correcting codes on a classical computer using the quantum simulator
Feynman program. We also compare the three codes by computing the fidelity when
double errors occurs in a depolarizing channel. As triple errors and more are
considered very unlikely, it has negligible effect on the next results
|
[
{
"version": "v1",
"created": "Sat, 27 Sep 2014 22:46:57 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Mouzali",
"Aziz",
""
],
[
"Merazka",
"Fatiha",
""
]
] |
new_dataset
| 0.973616 |
1409.7963
|
Arjun Jain
|
Arjun Jain, Jonathan Tompson, Yann LeCun and Christoph Bregler
|
MoDeep: A Deep Learning Framework Using Motion Features for Human Pose
Estimation
| null | null | null | null |
cs.CV cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a novel and efficient method for articulated human
pose estimation in videos using a convolutional network architecture, which
incorporates both color and motion features. We propose a new human body pose
dataset, FLIC-motion, that extends the FLIC dataset with additional motion
features. We apply our architecture to this dataset and report significantly
better performance than current state-of-the-art pose detection systems.
|
[
{
"version": "v1",
"created": "Sun, 28 Sep 2014 21:32:15 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Jain",
"Arjun",
""
],
[
"Tompson",
"Jonathan",
""
],
[
"LeCun",
"Yann",
""
],
[
"Bregler",
"Christoph",
""
]
] |
new_dataset
| 0.996253 |
1409.8008
|
Arjun Das
|
Arjun Das, Utpal Garain
|
CRF-based Named Entity Recognition @ICON 2013
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes performance of CRF based systems for Named Entity
Recognition (NER) in Indian language as a part of ICON 2013 shared task. In
this task we have considered a set of language independent features for all the
languages. Only for English a language specific feature, i.e. capitalization,
has been added. Next the use of gazetteer is explored for Bengali, Hindi and
English. The gazetteers are built from Wikipedia and other sources. Test
results show that the system achieves the highest F measure of 88% for English
and the lowest F measure of 69% for both Tamil and Telugu. Note that for the
least performing two languages no gazetteer was used. NER in Bengali and Hindi
finds accuracy (F measure) of 87% and 79%, respectively.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 07:11:30 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Das",
"Arjun",
""
],
[
"Garain",
"Utpal",
""
]
] |
new_dataset
| 0.998539 |
1409.8018
|
C. John Deepu
|
C.J. Deepu, X. Zhang, W.-S. Liew, D. L.T. Wong, Y. Lian
|
An ECG-on-Chip with 535-nW/Channel Integrated Lossless Data Compressor
for Wireless Sensors
| null |
IEEE Journal of Solid-State Circuits, Nov 2014
|
10.1109/JSSC.2014.2349994
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a low-power ECG recording system-on-chip (SoC) with
on-chip low-complexity lossless ECG compression for data reduction in
wireless/ambulatory ECG sensor devices. The chip uses a linear slope predictor
for data compression, and incorporates a novel low-complexity dynamic
coding-packaging scheme to frame the prediction error into fixed-length 16-bit
format. The proposed technique achieves an average compression ratio of 2.25x
on MIT/BIH ECG database. Implemented in a standard 0.35 um process, the
compressor uses 0.565K gates/channel occupying 0.4 mm2 for four channels, and
consumes 535 nW/channel at 2.4 V for ECG sampled at 512 Hz. Small size and
ultra-low power consumption makes the proposed technique suitable for wearable
ECG sensor applications.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 08:06:04 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Deepu",
"C. J.",
""
],
[
"Zhang",
"X.",
""
],
[
"Liew",
"W. -S.",
""
],
[
"Wong",
"D. L. T.",
""
],
[
"Lian",
"Y.",
""
]
] |
new_dataset
| 0.991779 |
1409.8020
|
Deepu John
|
C.J. Deepu, X.Y. Xu, X.D. Zou, L.B. Yao, and Y. Lian
|
An ECG-on-Chip for Wearable Cardiac Monitoring Devices
| null |
5th IEEE International Symposium on Electronic Design Test and
Applications 2010
|
10.1109/DELTA.2010.43
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a highly integrated, low power chip solution for ECG
signal processing in wearable devices. The chip contains an instrumentation
amplifier with programmable gain, a band-pass filter, a 12-bit SAR ADC, a novel
QRS detector, 8K on-chip SRAM, and relevant control circuitry and CPU
interfaces. The analog front end circuits accurately senses and digitizes the
raw ECG signal, which is then filtered to extract the QRS. The sampling
frequency used is 256 Hz. ECG samples are buffered locally on an asynchronous
FIFO and is read out using a faster clock, as and when it is required by the
host CPU via an SPI interface. The chip was designed and implemented in 0.35um
standard CMOS process. The analog core operates at 1V while the digital
circuits and SRAM operate at 3.3V. The chip total core area is 5.74 mm^2 and
consumes 9.6uW. Small size and low power consumption make this design suitable
for usage in wearable heart monitoring devices.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 08:14:15 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Deepu",
"C. J.",
""
],
[
"Xu",
"X. Y.",
""
],
[
"Zou",
"X. D.",
""
],
[
"Yao",
"L. B.",
""
],
[
"Lian",
"Y.",
""
]
] |
new_dataset
| 0.998588 |
1409.8152
|
Yelena Mejova
|
Yelena Mejova, Amy X. Zhang, Nicholas Diakopoulos, Carlos Castillo
|
Controversy and Sentiment in Online News
|
Computation+Journalism Symposium 2014
| null | null | null |
cs.CY cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
How do news sources tackle controversial issues? In this work, we take a
data-driven approach to understand how controversy interplays with emotional
expression and biased language in the news. We begin by introducing a new
dataset of controversial and non-controversial terms collected using
crowdsourcing. Then, focusing on 15 major U.S. news outlets, we compare
millions of articles discussing controversial and non-controversial issues over
a span of 7 months. We find that in general, when it comes to controversial
issues, the use of negative affect and biased language is prevalent, while the
use of strong emotion is tempered. We also observe many differences across news
sources. Using these findings, we show that we can indicate to what extent an
issue is controversial, by comparing it with other issues in terms of how they
are portrayed across different media.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 15:23:50 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Mejova",
"Yelena",
""
],
[
"Zhang",
"Amy X.",
""
],
[
"Diakopoulos",
"Nicholas",
""
],
[
"Castillo",
"Carlos",
""
]
] |
new_dataset
| 0.997496 |
1409.8174
|
Mark Scanlon
|
Jason Farina, Mark Scanlon, M-Tahar Kechadi
|
BitTorrent Sync: First Impressions and Digital Forensic Implications
|
Proc. of Digtial Forensics Research Workshop (DFRWS EU 2014)
|
Digital Investigation, Volume 11, Supplement 1, Pages S77-S86,
(2014)
|
10.1016/j.diin.2014.03.010
| null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
With professional and home Internet users becoming increasingly concerned
with data protection and privacy, the privacy afforded by popular cloud file
synchronisation services, such as Dropbox, OneDrive and Google Drive, is coming
under scrutiny in the press. A number of these services have recently been
reported as sharing information with governmental security agencies without
warrants. BitTorrent Sync is seen as an alternative by many and has gathered
over two million users by December 2013 (doubling since the previous month).
The service is completely decentralised, offers much of the same
synchronisation functionality of cloud powered services and utilises encryption
for data transmission (and optionally for remote storage). The importance of
understanding BitTorrent Sync and its resulting digital investigative
implications for law enforcement and forensic investigators will be paramount
to future investigations. This paper outlines the client application, its
detected network traffic and identifies artefacts that may be of value as
evidence for future digital investigations.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 16:20:57 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Farina",
"Jason",
""
],
[
"Scanlon",
"Mark",
""
],
[
"Kechadi",
"M-Tahar",
""
]
] |
new_dataset
| 0.999562 |
1409.8220
|
Irene Marquez Corbella
|
Alain Couvreur (INRIA Saclay - Ile de France), Irene
M\'arquez-Corbella (INRIA Saclay - Ile de France), Ruud Pellikaan
|
Cryptanalysis of public-key cryptosystems that use subcodes of algebraic
geometry codes
| null |
CIM-MS Series by Springer-Verlag (2014)
| null | null |
cs.IT cs.CR math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a polynomial time attack on the McEliece public key cryptosystem
based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes
on the distinguishability of such codes from random codes using the Schur
product. Wieschebrink treated the genus zero case a few years ago but his
approach cannot be extent straightforwardly to other genera. We address this
problem by introducing and using a new notion, which we call the t-closure of a
code.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 18:25:58 GMT"
}
] | 2014-09-30T00:00:00 |
[
[
"Couvreur",
"Alain",
"",
"INRIA Saclay - Ile de France"
],
[
"Márquez-Corbella",
"Irene",
"",
"INRIA Saclay - Ile de France"
],
[
"Pellikaan",
"Ruud",
""
]
] |
new_dataset
| 0.95295 |
1409.7408
|
Xishuo Liu
|
Xishuo Liu, Stark C. Draper
|
LP-decodable multipermutation codes
|
This work was supported by NSF and NSERC. To appear at the 2014
Allerton Conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new way of constructing and decoding
multipermutation codes. Multipermutations are permutations of a multiset that
may consist of duplicate entries. We first introduce a new class of matrices
called multipermutation matrices. We characterize the convex hull of
multipermutation matrices. Based on this characterization, we propose a new
class of codes that we term LP-decodable multipermutation codes. Then, we
derive two LP decoding algorithms. We first formulate an LP decoding problem
for memoryless channels. We then derive an LP algorithm that minimizes the
Chebyshev distance. Finally, we show a numerical example of our algorithm.
|
[
{
"version": "v1",
"created": "Thu, 25 Sep 2014 20:09:01 GMT"
}
] | 2014-09-29T00:00:00 |
[
[
"Liu",
"Xishuo",
""
],
[
"Draper",
"Stark C.",
""
]
] |
new_dataset
| 0.993384 |
1409.7465
|
Ayaka Sakata
|
Rafah El-Khatib, Jean Barbier, Ayaka Sakata, and R\"udiger Urbanke
|
Error correcting codes and spatial coupling
|
Chapter of "Statistical Physics, Optimization, Inference, and
Message-Passing Algorithms", Eds.: F. Krzakala, F. Ricci-Tersenghi, L.
Zdeborov\`a, R. Zecchina, E. W. Tramel, L. F. Cugliandolo (Oxford University
Press, to appear)
| null | null | null |
cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These are notes from the lecture of R\"udiger Urbanke given at the autumn
school "Statistical Physics, Optimization, Inference, and Message-Passing
Algorithms", that took place in Les Houches, France from Monday September 30th,
2013, till Friday October 11th, 2013. The school was organized by Florent
Krzakala from UPMC and ENS Paris, Federico Ricci-Tersenghi from La Sapienza
Roma, Lenka Zdeborov\`a from CEA Saclay and CNRS, and Riccardo Zecchina from
Politecnico Torino. The first three sections cover the basics of polar codes
and low density parity check codes. In the last three sections, we see how the
spatial coupling helps belief propagation decoding.
|
[
{
"version": "v1",
"created": "Fri, 26 Sep 2014 03:13:03 GMT"
}
] | 2014-09-29T00:00:00 |
[
[
"El-Khatib",
"Rafah",
""
],
[
"Barbier",
"Jean",
""
],
[
"Sakata",
"Ayaka",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] |
new_dataset
| 0.967989 |
1403.1180
|
Nikos Chondros
|
Nikos Chondros, Mema Roussopoulos
|
A distributed Integrity Catalog for digital repositories
| null | null | null | null |
cs.DB cs.DC cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital repositories, either digital preservation systems or archival
systems, periodically check the integrity of stored objects to assure users of
their correctness. To do so, prior solutions calculate integrity metadata and
require the repository to store it alongside the actual data objects. This
integrity metadata is essential for regularly verifying the correctness of the
stored data objects. To safeguard and detect damage to this metadata, prior
solutions rely on widely visible media, that is unaffiliated third parties, to
store and provide back digests of the metadata to verify it is intact. However,
they do not address recovery of the integrity metadata in case of damage or
attack by an adversary. In essence, they do not preserve this metadata. We
introduce IntegrityCatalog, a system that collects all integrity related
metadata in a single component, and treats them as first class objects,
managing both their integrity and their preservation. We introduce a
treap-based persistent authenticated dictionary managing arbitrary length
key/value pairs, which we use to store all integrity metadata, accessible
simply by object name. Additionally, IntegrityCatalog is a distributed system
that includes a network protocol that manages both corruption detection and
preservation of this metadata, using administrator-selected network peers with
two possible roles. Verifiers store and offer attestations on digests and have
minimal storage requirements, while preservers efficiently synchronize a
complete copy of the catalog to assist in recovery in case of a detected
catalog compromise on the local system. We describe our prototype
implementation of IntegrityCatalog, measure its performance empirically, and
demonstrate its effectiveness in real-world situations, with worst measured
throughput of approximately 1K insertions per second, and 2K verified search
operations per second.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 17:52:22 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Sep 2014 09:13:02 GMT"
}
] | 2014-09-26T00:00:00 |
[
[
"Chondros",
"Nikos",
""
],
[
"Roussopoulos",
"Mema",
""
]
] |
new_dataset
| 0.989909 |
1409.7247
|
David Karpuk
|
David Karpuk, Camilla Hollanti, Amaro Barreal
|
Node Repair for Distributed Storage Systems over Fading Channels
|
To appear in ISITA 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems and associated storage codes can efficiently
store a large amount of data while ensuring that data is retrievable in case of
node failure. The study of such systems, particularly the design of storage
codes over finite fields, assumes that the physical channel through which the
nodes communicate is error-free. This is not always the case, for example, in a
wireless storage system.
We study the probability that a subpacket is repaired incorrectly during node
repair in a distributed storage system, in which the nodes communicate over an
AWGN or Rayleigh fading channels. The asymptotic probability (as SNR increases)
that a node is repaired incorrectly is shown to be completely determined by the
repair locality of the DSS and the symbol error rate of the wireless channel.
Lastly, we propose some design criteria for physical layer coding in this
scenario, and use it to compute optimally rotated QAM constellations for use in
wireless distributed storage systems.
|
[
{
"version": "v1",
"created": "Thu, 25 Sep 2014 13:06:52 GMT"
}
] | 2014-09-26T00:00:00 |
[
[
"Karpuk",
"David",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Barreal",
"Amaro",
""
]
] |
new_dataset
| 0.975363 |
1303.0210
|
Aysajan Abidin
|
Aysajan Abidin and Jan-{\AA}ke Larsson
|
Direct Proof of Security of Wegman-Carter Authentication with Partially
Known Key
|
15 pages
|
Quantum Information Processing, 13, 2155-2170, 2014
|
10.1007/s11128-013-0641-6
| null |
cs.CR quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information-theoretically secure (ITS) authentication is needed in Quantum
Key Distribution (QKD). In this paper, we study security of an ITS
authentication scheme proposed by Wegman & Carter, in the case of partially
known authentication key. This scheme uses a new authentication key in each
authentication attempt, to select a hash function from an Almost Strongly
Universal$_2$ hash function family. The partial knowledge of the attacker is
measured as the trace distance between the authentication key distribution and
the uniform distribution; this is the usual measure in QKD. We provide direct
proofs of security of the scheme, when using partially known key, first in the
information-theoretic setting and then in terms of witness indistinguishability
as used in the Universal Composability (UC) framework. We find that if the
authentication procedure has a failure probability $\epsilon$ and the
authentication key has an $\epsilon'$ trace distance to the uniform, then under
ITS, the adversary's success probability conditioned on an authentic
message-tag pair is only bounded by $\epsilon+|\mT|\epsilon'$, where $|\mT|$ is
the size of the set of tags. Furthermore, the trace distance between the
authentication key distribution and the uniform increases to $|\mT|\epsilon'$
after having seen an authentic message-tag pair. Despite this, we are able to
prove directly that the authenticated channel is indistinguishable from an
(ideal) authentic channel (the desired functionality), except with probability
less than $\epsilon+\epsilon'$. This proves that the scheme is
($\epsilon+\epsilon'$)-UC-secure, without using the composability theorem.
|
[
{
"version": "v1",
"created": "Fri, 1 Mar 2013 16:19:31 GMT"
}
] | 2014-09-25T00:00:00 |
[
[
"Abidin",
"Aysajan",
""
],
[
"Larsson",
"Jan-Åke",
""
]
] |
new_dataset
| 0.998942 |
1409.6856
|
Julia Padberg
|
Julia Padberg
|
Reconfigurable Decorated PT Nets with Inhibitor Arcs and Transition
Priorities
| null | null | null | null |
cs.LO cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we deal with additional control structures for decorated PT
Nets. The main contribution are inhibitor arcs and priorities. The first ensure
that a marking can inhibit the firing of a transition. Inhibitor arcs force
that the transition may only fire when the place is empty. an order of
transitions restrict the firing, so that an transition may fire only if it has
the highest priority of all enabled transitions. This concept is shown to be
compatible with reconfigurable Petri nets.
|
[
{
"version": "v1",
"created": "Wed, 24 Sep 2014 08:30:53 GMT"
}
] | 2014-09-25T00:00:00 |
[
[
"Padberg",
"Julia",
""
]
] |
new_dataset
| 0.98031 |
1409.7060
|
Bernhard Rumpe
|
Bernhard Rumpe, Peter Scholz
|
A manager's view on large scale XP projects
|
4 pages, 3 figures. arXiv admin note: substantial text overlap with
arXiv:1409.6604
|
Third International Conference on Extreme Programming and Flexible
Processes in Software Engineering, XP2002, May 26-30, Alghero, Italy, pg.
158-159, 2002
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
XP is a code oriented, light weight software engineering methodology, suited
merely for small sized teams who develop software that relies on vague or
rapidly changing requirements. Being very code oriented, the discipline of
systems engineering knows it as approach of incremental system change. In this
contribution, we discuss the enhanced version of a concept on how to extend XP
on large scale projects with hundreds of software engineers and programmers,
respectively. A previous version was already presented in [1]. The basic idea
is to apply the "hierarchical approach", a management principle of reorganizing
companies, as well as well known moderation principles to XP project
organization. We show similarities between software engineering methods and
company reorganization processes and discuss how the elements of the
hierarchical approach can improve XP. We provide guidelines on how to scale up
XP to very large projects e.g. those common in telecommunication industry and
IT technology consultancy firms by using moderation techniques.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 17:51:10 GMT"
}
] | 2014-09-25T00:00:00 |
[
[
"Rumpe",
"Bernhard",
""
],
[
"Scholz",
"Peter",
""
]
] |
new_dataset
| 0.961754 |
1404.5668
|
Pedro Alejandro Ortega
|
Pedro A. Ortega, Daniel D. Lee
|
An Adversarial Interpretation of Information-Theoretic Bounded
Rationality
|
7 pages, 4 figures. Proceedings of AAAI-14
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, there has been a growing interest in modeling planning with
information constraints. Accordingly, an agent maximizes a regularized expected
utility known as the free energy, where the regularizer is given by the
information divergence from a prior to a posterior policy. While this approach
can be justified in various ways, including from statistical mechanics and
information theory, it is still unclear how it relates to decision-making
against adversarial environments. This connection has previously been suggested
in work relating the free energy to risk-sensitive control and to extensive
form games. Here, we show that a single-agent free energy optimization is
equivalent to a game between the agent and an imaginary adversary. The
adversary can, by paying an exponential penalty, generate costs that diminish
the decision maker's payoffs. It turns out that the optimal strategy of the
adversary consists in choosing costs so as to render the decision maker
indifferent among its choices, which is a definining property of a Nash
equilibrium, thus tightening the connection between free energy optimization
and game theory.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 23:21:14 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Ortega",
"Pedro A.",
""
],
[
"Lee",
"Daniel D.",
""
]
] |
new_dataset
| 0.964788 |
1404.5709
|
Mohammad Shahedul Karim
|
Mohammad S. Karim, Parastoo Sadeghi, Neda Aboutorab and Sameh Sorour
|
In Order Packet Delivery in Instantly Decodable Network Coded Systems
over Wireless Broadcast
|
Submitted
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study in-order packet delivery in instantly decodable
network coded systems for wireless broadcast networks. We are interested in
applications, in which the successful delivery of a packet depends on the
correct reception of this packet and all its preceding packets. We formulate
the problem of minimizing the number of undelivered packets to all receivers
over all transmissions until completion as a stochastic shortest path (SSP)
problem. Although finding the optimal packet selection policy using SSP is
computationally complex, it allows us to systematically exploit the problem
structure and draw guidelines for efficient packet selection policies that can
reduce the number of undelivered packets to all receivers over all
transmissions until completion. According to these guidelines, we design a
simple heuristic packet selection algorithm. Simulation results illustrate that
our proposed algorithm provides quicker packet delivery to the receivers
compared to the existing algorithms in the literature.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 05:45:28 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Sep 2014 09:55:30 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Sep 2014 02:46:07 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Karim",
"Mohammad S.",
""
],
[
"Sadeghi",
"Parastoo",
""
],
[
"Aboutorab",
"Neda",
""
],
[
"Sorour",
"Sameh",
""
]
] |
new_dataset
| 0.963624 |
1409.6382
|
Rolando Gomez
|
Rolando G\'omez Macedo and Felipe Zald\'ivar
|
On the Category of Group Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the category of group codes, that generalizes the category of linear
codes over a finite field, and with the generalized notions of direct sums and
ndecomposable group codes, we prove that every MDS non trivial code, every
perfect non trivial code, and every constant weight nondegenerate group code
are indecomposable. We prove that every group code is a direct sum of
indecomposable group codes, and using this result we obtain the automorphism
groups of any group code in terms of its decomposition in indecomposable
components. We conclude with the determination of the structure of decomposable
cyclic group codes.
|
[
{
"version": "v1",
"created": "Tue, 23 Sep 2014 01:18:57 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Macedo",
"Rolando Gómez",
""
],
[
"Zaldívar",
"Felipe",
""
]
] |
new_dataset
| 0.973597 |
1409.6584
|
Bernhard Rumpe
|
Fred W. Rauskolb, Kai Berger, Christian Lipski, Marcus Magnor, Karsten
Cornelsen, Jan Effertz, Thomas Form, Fabian Graefe, Sebastian Ohl, Walter
Schumacher, J\"orn Marten Wille, Peter Hecker, Tobias Nothdurft, Michael
Doering, Kai Homeier, Johannes Morgenroth, Lars Wolf, Christian Basarke,
Christian Berger, Tim G\"ulke, Felix Klose, Bernhard Rumpe
|
Caroline: An Autonomously Driving Vehicle for Urban Environments
|
68 pages, 7 figures
|
M. Buehler, K. Iagnemma, S. Singh (Eds.). The DARPA Urban
Challenge - Autonomous Vehicles in City Traffic. Springer Tracts in Advanced
Robotics, Volume 56, pp. 441-508, 2010
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 2007 DARPA Urban Challenge afforded the golden opportunity for the
Technische Universit\"at Braunschweig to demonstrate its abilities to develop
an autonomously driving vehicle to compete with the world's best competitors.
After several stages of qualification, our team CarOLO qualified early for the
DARPA Urban Challenge Final Event and was among only eleven teams from
initially 89 competitors to compete in the final. We had the ability to work
together in a large group of experts, each contributing his expertise in his
discipline, and significant organisational, financial and technical support by
local sponsors who helped us to become the best non-US team. In this report, we
describe the 2007 DARPA Urban Challenge, our contribution "Caroline", the
technology and algorithms along with her performance in the DARPA Urban
Challenge Final Event on November 3, 2007.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 11:57:55 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Rauskolb",
"Fred W.",
""
],
[
"Berger",
"Kai",
""
],
[
"Lipski",
"Christian",
""
],
[
"Magnor",
"Marcus",
""
],
[
"Cornelsen",
"Karsten",
""
],
[
"Effertz",
"Jan",
""
],
[
"Form",
"Thomas",
""
],
[
"Graefe",
"Fabian",
""
],
[
"Ohl",
"Sebastian",
""
],
[
"Schumacher",
"Walter",
""
],
[
"Wille",
"Jörn Marten",
""
],
[
"Hecker",
"Peter",
""
],
[
"Nothdurft",
"Tobias",
""
],
[
"Doering",
"Michael",
""
],
[
"Homeier",
"Kai",
""
],
[
"Morgenroth",
"Johannes",
""
],
[
"Wolf",
"Lars",
""
],
[
"Basarke",
"Christian",
""
],
[
"Berger",
"Christian",
""
],
[
"Gülke",
"Tim",
""
],
[
"Klose",
"Felix",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.999054 |
1409.6596
|
Bernhard Rumpe
|
Marcus Fontoura, Wolfgang Pree, Bernhard Rumpe
|
The WebShop E-Commerce Framework
|
6 pages, 15 figures
|
International Conference on Internet Computing CSREA press, 2001
| null | null |
cs.SE cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an e-commerce framework called WebShop, which was
developed by the authors for the purpose of demonstrating the use of UML and
the UML-F in the domain of Web applications. Thus, the WebShop is not regarded
as a full-fledged system out of which real Web stores can be derived. For
example, the framework in the presented version does not encounter security
features. However, it presents the most important variation points related to
online catalogs. The UML-F Web site http://www.UML-F.net provides the Java
source files and some sample adaptations of WebShop.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 18:09:12 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Fontoura",
"Marcus",
""
],
[
"Pree",
"Wolfgang",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.998444 |
1409.6598
|
Bernhard Rumpe
|
Steve Cook, Anneke Kleppe, Richard Mitchell, Bernhard Rumpe, Jos
Warmer, Alan Wills
|
The Amsterdam Manifesto on OCL
|
35 pages, 4 figures
|
Object Modeling with the OCL, pp. 115-149 LNCS 2263, Springer
Verlag, 2002
|
10.1007/3-540-45669-4_7
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In November 1998 the authors participated in a two-day workshop on the Object
Constraint Language (OCL) in Amsterdam. The focus was to clarify issues about
the semantics and the use of OCL, and to discuss useful and necessary
extensions of OCL. Various topics have been raised and clarified. This
manifesto contains the results of that workshop and the following work on these
topics. Overview of OCL.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 17:56:16 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Cook",
"Steve",
""
],
[
"Kleppe",
"Anneke",
""
],
[
"Mitchell",
"Richard",
""
],
[
"Rumpe",
"Bernhard",
""
],
[
"Warmer",
"Jos",
""
],
[
"Wills",
"Alan",
""
]
] |
new_dataset
| 0.999361 |
1409.6601
|
Bernhard Rumpe
|
Ulrike Thomas, Gerd Hirzinger, Bernhard Rumpe, Christoph Schulze,
Andreas Wortmann
|
A New Skill Based Robot Programming Language Using UML/P Statecharts
|
6 pages, 10 figures, Proceedings of the 2013 IEEE International
Conference on Robotics and Automation (ICRA), Karlsruhe, Germany
| null |
10.1109/ICRA.2013.6630615
| null |
cs.SE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the new robot programming language LightRocks (Light
Weight Robot Coding for Skills), a domain specific language (DSL) for robot
programming. The language offers three different level of abstraction for robot
programming. On lowest level skills are coded by domain experts. On a more
abstract level these skills are supposed to be combined by shop floor workers
or technicians to define tasks. The language is designed to allow as much
flexibility as necessary on the lowest level of abstraction and is kept as
simple as possible with the more abstract layers. A Statechart like model is
used to describe the different levels of detail. For this we apply the UML/P
and the language workbench MontiCore. To this end we are able to generate code
while hiding controller specific implementation details. In addition the
development in LightRocks is supported by a generic graphical editor
implemented as an Eclipse plugin.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 17:48:53 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Thomas",
"Ulrike",
""
],
[
"Hirzinger",
"Gerd",
""
],
[
"Rumpe",
"Bernhard",
""
],
[
"Schulze",
"Christoph",
""
],
[
"Wortmann",
"Andreas",
""
]
] |
new_dataset
| 0.999028 |
1409.6606
|
Bernhard Rumpe
|
Stefan Schmidt, Holger Krahn, Stefan Fischer, Dietmar W\"atjen
|
A Security Architecture for Mobile Wireless Sensor Networks
|
12 pages, 1 figures
|
Security in Ad-hoc and Sensor Networks: First European Workshop
(ESAS 2004) Heidelberg, Germany, August 6, 2004, Revised Selected Papers.
LNCS 3313, pp 166-177, Springer-Verlag Berlin Heidelberg 2005
|
10.1007/978-3-540-30496-8_14
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks increasingly become viable solutions to many
challenging problems and will successively be deployed in many areas in the
future. However, deploying new technology without security in mind has often
proved to be unreasonably dangerous. We propose a security architecture for
self-organizing mobile wireless sensor networks that prevents many attacks
these networks are exposed to. Furthermore, it limits the security impact of
some attacks that cannot be prevented. We analyse our security architecure and
show that it provides the desired security aspects while still being a
lightweight solution and thus being applicable for self-organizing mobile
wireless sensor networks.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 17:25:18 GMT"
}
] | 2014-09-24T00:00:00 |
[
[
"Schmidt",
"Stefan",
""
],
[
"Krahn",
"Holger",
""
],
[
"Fischer",
"Stefan",
""
],
[
"Wätjen",
"Dietmar",
""
]
] |
new_dataset
| 0.973226 |
1304.5220
|
Marco Mondelli
|
Marco Mondelli, S. Hamed Hassani, R\"udiger Urbanke
|
Scaling Exponent of List Decoders with Applications to Polar Codes
|
14 pages, submitted to IEEE Trans. Inform. Theory and presented in
part to ITW'13
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the significant performance gains which polar codes experience
under successive cancellation list decoding, their scaling exponent is studied
as a function of the list size. In particular, the error probability is fixed
and the trade-off between block length and back-off from capacity is analyzed.
A lower bound is provided on the error probability under $\rm MAP$ decoding
with list size $L$ for any binary-input memoryless output-symmetric channel and
for any class of linear codes such that their minimum distance is unbounded as
the block length grows large. Then, it is shown that under $\rm MAP$ decoding,
although the introduction of a list can significantly improve the involved
constants, the scaling exponent itself, i.e., the speed at which capacity is
approached, stays unaffected for any finite list size. In particular, this
result applies to polar codes, since their minimum distance tends to infinity
as the block length increases. A similar result is proved for genie-aided
successive cancellation decoding when transmission takes place over the binary
erasure channel, namely, the scaling exponent remains constant for any fixed
number of helps from the genie. Note that since genie-aided successive
cancellation decoding might be strictly worse than successive cancellation list
decoding, the problem of establishing the scaling exponent of the latter
remains open.
|
[
{
"version": "v1",
"created": "Thu, 18 Apr 2013 18:47:39 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Apr 2013 18:05:46 GMT"
},
{
"version": "v3",
"created": "Fri, 26 Jul 2013 18:33:23 GMT"
},
{
"version": "v4",
"created": "Mon, 22 Sep 2014 08:40:00 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Mondelli",
"Marco",
""
],
[
"Hassani",
"S. Hamed",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] |
new_dataset
| 0.972312 |
1311.2749
|
Zdenek Dvorak
|
Zdenek Dvorak and Matthias Mnich
|
Large Independent Sets in Triangle-Free Planar Graphs
|
14 pages, 1 figure
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Every triangle-free planar graph on n vertices has an independent set of size
at least (n+1)/3, and this lower bound is tight. We give an algorithm that,
given a triangle-free planar graph G on n vertices and an integer k>=0, decides
whether G has an independent set of size at least (n+k)/3, in time
2^{O(sqrt{k})}n. Thus, the problem is fixed-parameter tractable when
parameterized by k. Furthermore, as a corollary of the result used to prove the
correctness of the algorithm, we show that there exists epsilon>0 such that
every planar graph of girth at least five on n vertices has an independent set
of size at least n/(3-epsilon).
|
[
{
"version": "v1",
"created": "Tue, 12 Nov 2013 12:19:45 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Sep 2014 14:20:03 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Dvorak",
"Zdenek",
""
],
[
"Mnich",
"Matthias",
""
]
] |
new_dataset
| 0.997236 |
1406.7036
|
Bo Yuan
|
Bo Yuan, Keshab K. Parhi
|
Low-Latency Successive-Cancellation List Decoders for Polar Codes with
Multi-bit Decision
|
submitted to IEEE TVLSI in Feb 2014, accepted in Sep. 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes, as the first provable capacity-achieving error-correcting codes,
have received much attention in recent years. However, the decoding performance
of polar codes with traditional successive-cancellation (SC) algorithm cannot
match that of the low-density parity-check (LDPC) or turbo codes. Because SC
list (SCL) decoding algorithm can significantly improve the error-correcting
performance of polar codes, design of SCL decoders is important for polar codes
to be deployed in practical applications. However, because the prior latency
reduction approaches for SC decoders are not applicable for SCL decoders, these
list decoders suffer from the long latency bottleneck. In this paper, we
propose a multi-bit-decision approach that can significantly reduce latency of
SCL decoders. First, we present a reformulated SCL algorithm that can perform
intermediate decoding of 2 bits together. The proposed approach, referred as
2-bit reformulated SCL (2b-rSCL) algorithm, can reduce the latency of SCL
decoder from (3n-2) to (2n-2) clock cycles without any performance loss. Then,
we extend the idea of 2-bit-decision to general case, and propose a general
decoding scheme that can perform intermediate decoding of any 2K bits
simultaneously. This general approach, referred as 2K-bit reformulated SCL
(2Kb-rSCL) algorithm, can reduce the overall decoding latency to as short as
n/2K-2-2 cycles. Furthermore, based on the proposed algorithms, VLSI
architectures for 2b-rSCL and 4b-rSCL decoders are synthesized. Compared with a
prior SCL decoder, the proposed (1024, 512) 2b-rSCL and 4b-rSCL decoders can
achieve 21% and 60% reduction in latency, 1.66 times and 2.77 times increase in
coded throughput with list size 2, and 2.11 times and 3.23 times increase in
coded throughput with list size 4, respectively.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2014 21:41:13 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Sep 2014 07:14:54 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Yuan",
"Bo",
""
],
[
"Parhi",
"Keshab K.",
""
]
] |
new_dataset
| 0.999319 |
1409.5816
|
Martin Derka
|
Therese Biedl, Martin Derka
|
1-String CZ-Representation of Planar Graphs
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove that every planar 4-connected graph has a
CZ-representation---a string representation using paths in a rectangular grid
that contain at most one vertical segment. Furthermore, two paths representing
vertices $u,v$ intersect precisely once whenever there is an edge between $u$
and $v$. The required size of the grid is $n \times 2n$.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2014 21:01:03 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Derka",
"Martin",
""
]
] |
new_dataset
| 0.992465 |
1409.5932
|
Rodrigo de Lamare
|
L. Zhang, Y. Cai, R. C. de Lamare, M. Zhao
|
Robust Multi-Branch Tomlinson-Harashima Precoding in Cooperative MIMO
Relay Systems
|
14 pages, 9 figures, IEEE Transactions on Communications, 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes the design of robust transceivers with
Tomlinson-Harashima precoding (THP) for multiple-input multiple-output (MIMO)
relay systems with amplify-and-forward (AF) protocols based on a multi-branch
(MB) strategy. The MB strategy employs successive interference cancellation
(SIC) on several parallel branches which are equipped with different ordering
patterns so that each branch produces transmit signals by exploiting a certain
ordering pattern. For each parallel branch, the proposed robust nonlinear
transceiver design consists of THP at the source along with a linear precoder
at the relay and a linear minimum-mean-squared-error (MMSE) receiver at the
destination. By taking the channel uncertainties into account, the source and
relay precoders are jointly optimised to minimise the mean-squared-error (MSE).
We then employ a diagonalization method along with some attributes of
matrix-monotone functions to convert the optimization problem with matrix
variables into an optimization problem with scalar variables. We resort to an
iterative method to obtain the solution for the relay and the source precoders
via Karush-Kuhn-Tucker (KKT) conditions. An appropriate selection rule is
developed to choose the nonlinear transceiver corresponding to the best branch
for data transmission. Simulation results demonstrate that the proposed MB-THP
scheme is capable of alleviating the effects of channel state information (CSI)
errors and improving the robustness of the system.
|
[
{
"version": "v1",
"created": "Sun, 21 Sep 2014 02:38:02 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Zhang",
"L.",
""
],
[
"Cai",
"Y.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Zhao",
"M.",
""
]
] |
new_dataset
| 0.998503 |
1409.6142
|
Matthieu Picantin
|
Ines Klimann, Matthieu Picantin and Dmytro Savchuk
|
A connected 3-state reversible Mealy automaton cannot generate an
infinite Burnside group
|
12 pages, 4 figures
| null | null | null |
cs.FL math.GR
|
http://creativecommons.org/licenses/publicdomain/
|
The class of automaton groups is a rich source of the simplest examples of
infinite Burnside groups. However, there are some classes of automata that do
not contain such examples. For instance, all infinite Burnside automaton groups
in the literature are generated by non reversible Mealy automata and it was
recently shown that 2-state invertible-reversible Mealy automata cannot
generate infinite Burnside groups. Here we extend this result to connected
3-state invertible-reversible Mealy automata, using new original techniques.
The results provide the first uniform method to construct elements of infinite
order in each infinite group in this class.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 11:15:35 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Klimann",
"Ines",
""
],
[
"Picantin",
"Matthieu",
""
],
[
"Savchuk",
"Dmytro",
""
]
] |
new_dataset
| 0.974349 |
1409.6281
|
George Kesidis
|
George Kesidis, Douglas Mercer, Christopher Griffin, Serge Fdida
|
Roaming charges for customers of cellular-wireless entrant and incumbent
providers
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a simple two-player game involving a large incumbent and small
entrant into a cellular wireless access provider marketplace. The entrant's
customers must pay roaming charges. We assume that the roaming charges are
regulated, because if they are dictated by the incumbent then they could be set
so high so as to be a barrier to entry in the marketplace. The game is studied
at its Nash equilibrium. A roaming charge is identified that is arguably fair
in the sense that revenues for the access providers are proportionate to their
infrastructure costs.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 19:06:19 GMT"
}
] | 2014-09-23T00:00:00 |
[
[
"Kesidis",
"George",
""
],
[
"Mercer",
"Douglas",
""
],
[
"Griffin",
"Christopher",
""
],
[
"Fdida",
"Serge",
""
]
] |
new_dataset
| 0.989417 |
1409.5595
|
E Canessa
|
M. Rainone, C. Fonda and E. Canessa
|
IMAGINARY Math Exhibition using Low-cost 3D Printers
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We have made an attempt to reproduce 17 objects of the IMAGINARY Open
Mathematics Exhibition (www.imaginary.org) using low-cost, desktop 3D printers.
The IMAGINARY open math is an international project by the Mathematisches
Forschungsinstitut Oberwolfach in Germany and includes galleries of volumetric
objects that are unique, have aesthetic appeal and mathematical meaning. We
illustrate here the printing of these diverse learning materials using new 3D
affordable printing technologies based on Fused Deposition Modelling (FDM) and
the use of biodegradable plastic PLA. The final goal is to support museums,
schools and higher education institutions in countries with lower scientific
infrastructure.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2014 10:50:32 GMT"
}
] | 2014-09-22T00:00:00 |
[
[
"Rainone",
"M.",
""
],
[
"Fonda",
"C.",
""
],
[
"Canessa",
"E.",
""
]
] |
new_dataset
| 0.997852 |
1409.5744
|
Ahmed Badawy
|
Ahmed Badawy, Tamer Khattab, Daniele Trinchero, Tarek El Fouly, Amr
Mohamed
|
A Simple AoA Estimation Scheme
| null | null | null | null |
cs.SY cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an intuitive, simple and hardware friendly, yet surprisingly novel
and efficient, received signal's angle of arrival (AoA) estimation scheme. Our
intuitive, two-phases cross-correlation based scheme relies on a switched beam
antenna array, which is used to collect an omni-directional signal using few
elements of the antenna array in the first phase. In the second phase, the
scheme switches the main beam of the antenna array to scan the angular region
of interest. The collected signal from each beam (direction or angle) is cross
correlated with the omni-directional signal. The cross-correlation coefficient
will be the highest at the correct AoA and relatively negligible elsewhere. The
proposed scheme simplicity stems from its low computational complexity (only
cross-correlation and comparison operations are required) and its independence
of the transmitted signal structure (does not require information about the
transmitted signal). The proposed scheme requires a receiver with switched beam
antenna array, which can be attached to a single radio frequency chain through
phase shifters, hence, its hardware friendliness. The high efficiency of our
system can be observed by comparing its performance with the literature's best
performing MUSIC algorithm. The comparison demonstrates that our scheme
outperforms the MUSIC algorithm, specially at low SNR levels. Moreover, the
number of sources that can be detected using our scheme is bound by the number
of switched beams, rather than the number of antenna elements in the case of
the MUSIC algorithm.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2014 18:14:34 GMT"
}
] | 2014-09-22T00:00:00 |
[
[
"Badawy",
"Ahmed",
""
],
[
"Khattab",
"Tamer",
""
],
[
"Trinchero",
"Daniele",
""
],
[
"Fouly",
"Tarek El",
""
],
[
"Mohamed",
"Amr",
""
]
] |
new_dataset
| 0.999508 |
1404.6974
|
Claudia Schon
|
Ulrich Furbach and Claudia Schon
|
Deontic Logic for Human Reasoning
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deontic logic is shown to be applicable for modelling human reasoning. For
this the Wason selection task and the suppression task are discussed in detail.
Different versions of modelling norms with deontic logic are introduced and in
the case of the Wason selection task it is demonstrated how differences in the
performance of humans in the abstract and in the social contract case can be
explained. Furthermore it is shown that an automated theorem prover can be used
as a reasoning tool for deontic logic.
|
[
{
"version": "v1",
"created": "Mon, 28 Apr 2014 13:34:20 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Sep 2014 08:46:31 GMT"
}
] | 2014-09-19T00:00:00 |
[
[
"Furbach",
"Ulrich",
""
],
[
"Schon",
"Claudia",
""
]
] |
new_dataset
| 0.9996 |
1409.4476
|
Francisco Mota
|
Francisco Mota
|
Projective Root-Locus: An Extension of Root-Locus Plot to the Projective
Plane
|
13 pages, 8 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an extension of the classical Root-Locus (RL) method
where the points are calculated in the real projective plane instead of the
conventional affine real plane; we denominate this extension of the Root-Locus
as "Projective Root-Locus (PjRL)". To plot the PjRL we use the concept of
"Gnomonic Projection" in order to have a representation of the projective real
plane as a simi-sphere of radius one in ${\mathbb R}^3$. We will see that the
PjRL reduces to the RL in the affine $XY$ plane, but also we can plot the RL
onto another affine component of the projective plane, like $ZY$ affine plane
for instance, to obtain what we denominate complementary plots of the
conventional RL. We also show that with the PjRL the points at infinity of the
RL can be computed as solutions of a set algebraic equations.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2014 00:53:37 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Sep 2014 03:36:41 GMT"
}
] | 2014-09-19T00:00:00 |
[
[
"Mota",
"Francisco",
""
]
] |
new_dataset
| 0.972271 |
1409.5257
|
Stefano Salsano
|
Stefano Salsano, Nicola Blefari-Melazzi, Francesco Lo Presti, Giuseppe
Siracusano, Pier Luigi Ventre
|
Generalized Virtual Networking: an enabler for Service Centric
Networking and Network Function Virtualization
| null |
Networks 2014, 16th International Telecommunications Network
Strategy and Planning Symposium, 17-19 September 2014, Funchal, Portugal
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce the Generalized Virtual Networking (GVN) concept.
GVN provides a framework to influence the routing of packets based on service
level information that is carried in the packets. It is based on a protocol
header inserted between the Network and Transport layers, therefore it can be
seen as a layer 3.5 solution. Technically, GVN is proposed as a new transport
layer protocol in the TCP/IP protocol suite. An IP router that is not GVN
capable will simply process the IP destination address as usual. Similar
concepts have been proposed in other works, and referred to as Service Oriented
Networking, Service Centric Networking, Application Delivery Networking, but
they are now generalized in the proposed GVN framework. In this respect, the
GVN header is a generic container that can be adapted to serve the needs of
arbitrary service level routing solutions. The GVN header can be managed by GVN
capable end-hosts and applications or can be pushed/popped at the edge of a GVN
capable network (like a VLAN tag). In this position paper, we show that
Generalized Virtual Networking is a powerful enabler for SCN (Service Centric
Networking) and NFV (Network Function Virtualization) and how it couples with
the SDN (Software Defined Networking) paradigm.
|
[
{
"version": "v1",
"created": "Thu, 18 Sep 2014 11:02:48 GMT"
}
] | 2014-09-19T00:00:00 |
[
[
"Salsano",
"Stefano",
""
],
[
"Blefari-Melazzi",
"Nicola",
""
],
[
"Presti",
"Francesco Lo",
""
],
[
"Siracusano",
"Giuseppe",
""
],
[
"Ventre",
"Pier Luigi",
""
]
] |
new_dataset
| 0.999344 |
1409.5327
|
Neil Walton
|
N.S. Walton
|
Store-Forward and its implications for Proportional Scheduling
| null | null | null | null |
cs.NI cs.PF math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Proportional Scheduler was recently proposed as a scheduling algorithm
for multi-hop switch networks. For these networks, the BackPressure scheduler
is the classical benchmark. For networks with fixed routing, the Proportional
Scheduler is maximum stable, myopic and, furthermore, will alleviate certain
scaling issued found in BackPressure for large networks. Nonetheless, the
equilibrium and delay properties of the Proportional Scheduler has not been
fully characterized.
In this article, we postulate on the equilibrium behaviour of the
Proportional Scheduler though the analysis of an analogous rule called the
Store-Forward allocation. It has been shown that Store-Forward has
asymptotically allocates according to the Proportional Scheduler. Further, for
Store-Forward networks, numerous equilibrium quantities are explicitly
calculable. For FIFO networks under Store-Forward, we calculate the policies
stationary distribution and end-to-end route delay. We discuss network
topologies when the stationary distribution is product-form, a phenomenon which
we call \emph{product form resource pooling}. We extend this product form
notion to independent set scheduling on perfect graphs, where we show that
non-neighbouring queues are statistically independent. Finally, we analyse the
large deviations behaviour of the equilibrium distribution of Store-Forward
networks in order to construct Lyapunov functions for FIFO switch networks.
|
[
{
"version": "v1",
"created": "Wed, 17 Sep 2014 19:45:20 GMT"
}
] | 2014-09-19T00:00:00 |
[
[
"Walton",
"N. S.",
""
]
] |
new_dataset
| 0.988989 |
1406.3216
|
Giuseppe Cascavilla
|
Andrea Burattin, Giuseppe Cascavilla, Mauro Conti
|
SocialSpy: Browsing (Supposedly) Hidden Information in Online Social
Networks
|
16 pages, 6 figures
| null | null | null |
cs.SI cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online Social Networks are becoming the most important "places" where people
share information about their lives. With the increasing concern that users
have about privacy, most social networks offer ways to control the privacy of
the user. Unfortunately, we believe that current privacy settings are not as
effective as users might think.
In this paper, we highlight this problem focusing on one of the most popular
social networks, Facebook. In particular, we show how easy it is to retrieve
information that a user might have set as (and hence thought as) "private". As
a case study, we focus on retrieving the list of friends for users that did set
this information as "hidden" (to non-friends). We propose four different
strategies to achieve this goal, and we evaluate them. The results of our
thorough experiments show the feasibility of our strategies as well as their
effectiveness: our approach is able to retrieve a significant percentage of the
names of the "hidden" friends: i.e., some 25% on average, and more than 70% for
some users.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 12:34:52 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Sep 2014 15:35:29 GMT"
}
] | 2014-09-18T00:00:00 |
[
[
"Burattin",
"Andrea",
""
],
[
"Cascavilla",
"Giuseppe",
""
],
[
"Conti",
"Mauro",
""
]
] |
new_dataset
| 0.974123 |
1409.4958
|
Yi Wang phd
|
Yi Wang
|
Tensity Research Based on the Information of Eye Movement
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
User's mental state is concerned gradually, during the interaction course of
human robot. As the measurement and identification method of psychological
state, tension, has certain practical significance role. At presents there is
no suitable method of measuring the tension. Firstly, sum up some availability
of eye movement index. And then parameters extraction on eye movement
characteristics of normal illumination is studied, including the location of
the face, eyes location, access to the pupil diameter, the eye pupil center
characteristic parameters. And with the judgment of the tension in eye images,
extract exact information of gaze direction. Finally, through the experiment to
prove the proposed method is effective.
|
[
{
"version": "v1",
"created": "Wed, 17 Sep 2014 11:52:36 GMT"
}
] | 2014-09-18T00:00:00 |
[
[
"Wang",
"Yi",
""
]
] |
new_dataset
| 0.952418 |
1409.5054
|
Ayad Ghany Ismaeel
|
Bnar Faisal Daham, Ayad Ghany Ismaeel, Suha A. Abdual-Rahman
|
TCP Performance for Kurd Messenger Application Using Bio-computing
|
15 pages, 11 figures, 6 Tabels. arXiv admin note: substantial text
overlap with arXiv:1206.0893
|
Zanco, Journal of Pure and Applied Sciences, Salahaddin
University, Hawler, IRAQ, Vol. 21 No. 2, 2009, Pages 123-139
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work was conducted to design, implement, and evaluate a new model of
measuring Transmission Control Protocol (TCP) performance of real time network.
The proposed model Biological Kurd Messenger (BIOKM) has two main goals: First
is to run the model efficiently, second is to obtain high TCP performance via
real time network using bio-computing technique, especially molecular
calculation because it provides wisdom results and it can exploit all
facilities of phylogentic analysis. To measure TCP performance two protocols
were selected Internet Relay Chat Daemon (IRCD) and File Transfer Protocol
(FTP), the BIOKM model consists of two applications Kurd Messenger Server Side
(KMSS) and Kurd Messenger Client Side (KMCS) written in Java programming
language by implementing algorithms of BIOKM Server and Client application. The
paper also includes the implementation of hybridized model algorithm based on
Neighbor-Joining (NJ) method to measure TCP performance, then implementing
algorithm of Little law (steady state) for single server queue as a comparison
with bio-computing algorithm. The results obtained by using bio-computing and
little law techniques show very good performance and the two techniques result
are very close to each other this is because of local implementation. The main
tools which have been used in this work can be divided into software and
hardware tools.
Keywords: Biological Kurd Messenger (BIOKM), Kurd Messenger Phylogenetic
tree, Hybridized Model, Little Law, TCP Performance.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2014 09:26:27 GMT"
}
] | 2014-09-18T00:00:00 |
[
[
"Daham",
"Bnar Faisal",
""
],
[
"Ismaeel",
"Ayad Ghany",
""
],
[
"Abdual-Rahman",
"Suha A.",
""
]
] |
new_dataset
| 0.993359 |
1403.2527
|
Runwei Zhang
|
Runwei Zhang, Francois Ingelrest, Guillermo Barrenetxea, Patrick
Thiran, Martin Vetterli
|
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping
in Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless sensor networks (WSNs), the base station (BS) is a critical
sensor node whose failure causes severe data losses. Deploying multiple fixed
BSs improves the robustness, yet requires all BSs to be installed with large
batteries and large energy-harvesting devices due to the high energy
consumption of BSs. In this paper, we propose a scheme to coordinate the
multiple deployed BSs such that the energy supplies required by individual BSs
can be substantially reduced. In this scheme, only one BS is selected to be
active at a time and the other BSs act as regular sensor nodes. We first
present the basic architecture of our system, including how we keep the network
running with only one active BS and how we manage the handover of the role of
the active BS. Then, we propose an algorithm for adaptively selecting the
active BS under the spatial and temporal variations of energy resources. This
algorithm is simple to implement but is also asymptotically optimal under mild
conditions. Finally, by running simulations and real experiments on an outdoor
testbed, we verify that the proposed scheme is energy-efficient, has low
communication overhead and reacts rapidly to network changes.
|
[
{
"version": "v1",
"created": "Tue, 11 Mar 2014 10:25:21 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Mar 2014 14:12:59 GMT"
},
{
"version": "v3",
"created": "Mon, 15 Sep 2014 21:05:09 GMT"
}
] | 2014-09-17T00:00:00 |
[
[
"Zhang",
"Runwei",
""
],
[
"Ingelrest",
"Francois",
""
],
[
"Barrenetxea",
"Guillermo",
""
],
[
"Thiran",
"Patrick",
""
],
[
"Vetterli",
"Martin",
""
]
] |
new_dataset
| 0.964496 |
1409.4626
|
Evgeny Nikulchev
|
Evgeniy Pluzhnik, Evgeny Nikulchev, Simon Payain
|
Laboratory Test Bench for Research Network and Cloud Computing
|
5 pages
|
Int'l J. of Communications, Network and System Sciences, 7:7,
243-247
|
10.4236/ijcns.2014.77026
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At present moment, there is a great interest in development of information
systems operating in cloud infrastructures. Generally, many of tasks remain
unresolved such as tasks of optimization of large databases in a hybrid cloud
infrastructure, quality of service (QoS) at different levels of cloud services,
dynamic control of distribution of cloud resources in application systems and
many others. Research and development of new solutions can be limited in case
of using emulators or international commercial cloud services, due to the
closed architecture and limited opportunities for experimentation. Article
provides answers to questions on the establishment of a pilot cloud practically
"at home" with the ability to adjust the width of the emulation channel and
delays in data transmission. It also describes architecture and configuration
of the experimental setup. The proposed modular structure can be expanded by
available computing power.
|
[
{
"version": "v1",
"created": "Sun, 14 Sep 2014 18:00:13 GMT"
}
] | 2014-09-17T00:00:00 |
[
[
"Pluzhnik",
"Evgeniy",
""
],
[
"Nikulchev",
"Evgeny",
""
],
[
"Payain",
"Simon",
""
]
] |
new_dataset
| 0.99941 |
1308.4477
|
Tong Ye
|
Tong Ye, Tony T. Lee, and Weisheng Hu
|
AWG-based Non-blocking Clos Networks
|
Add some contents to the manuscript in page 2, 12 and 13
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The three-stage Clos networks remain the most popular solution to many
practical switching systems to date. The aim of this paper is to show that the
modular structure of Clos networks is invariant with respect to the
technological changes. Due to the wavelength routing property of
arrayed-waveguide gratings (AWGs), non-blocking and contention-free
wavelength-division-multiplexing (WDM) switches require that two calls carried
by the same wavelength must be connected by separated links; otherwise, they
must be carried by different wavelengths. Thus, in addition to the non-blocking
condition, the challenge of the design of AWG-based multistage switching
networks is to scale down the wavelength granularity and to reduce the
conversion range of tunable wavelength converters (TWCs). We devise a logic
scheme to partition the WDM switch network into wavelength autonomous cells,
and show that the wavelength scalability problem can be solved by recursively
reusing similar, but smaller, set of wavelengths in different cells.
Furthermore, we prove that the rearrangeably non-blocking (RNB) condition and
route assignments in these AWG-based three-stage networks are consistent with
that of classical Clos networks. Thus, the optimal AWG-based non-blocking Clos
networks also can achieve 100% utilization when all input and output wavelength
channels are busy.
|
[
{
"version": "v1",
"created": "Wed, 21 Aug 2013 03:34:39 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Sep 2014 23:28:37 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Ye",
"Tong",
""
],
[
"Lee",
"Tony T.",
""
],
[
"Hu",
"Weisheng",
""
]
] |
new_dataset
| 0.989401 |
1311.4703
|
Tuvi Etzion
|
Michal Horovitz and Tuvi Etzion
|
Constructions of Snake-in-the-Box Codes for Rank Modulation
|
IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Snake-in-the-box code is a Gray code which is capable of detecting a single
error. Gray codes are important in the context of the rank modulation scheme
which was suggested recently for representing information in flash memories.
For a Gray code in this scheme the codewords are permutations, two consecutive
codewords are obtained by using the "push-to-the-top" operation, and the
distance measure is defined on permutations. In this paper the Kendall's
$\tau$-metric is used as the distance measure. We present a general method for
constructing such Gray codes. We apply the method recursively to obtain a snake
of length $M_{2n+1}=((2n+1)(2n)-1)M_{2n-1}$ for permutations of $S_{2n+1}$,
from a snake of length $M_{2n-1}$ for permutations of~$S_{2n-1}$. Thus, we have
$\lim\limits_{n\to \infty} \frac{M_{2n+1}}{S_{2n+1}}\approx 0.4338$, improving
on the previous known ratio of $\lim\limits_{n\to \infty} \frac{1}{\sqrt{\pi
n}}$. By using the general method we also present a direct construction. This
direct construction is based on necklaces and it might yield snakes of length
$\frac{(2n+1)!}{2} -2n+1$ for permutations of $S_{2n+1}$. The direct
construction was applied successfully for $S_7$ and $S_9$, and hence
$\lim\limits_{n\to \infty} \frac{M_{2n+1}}{S_{2n+1}}\approx 0.4743$.
|
[
{
"version": "v1",
"created": "Tue, 19 Nov 2013 11:37:16 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Feb 2014 13:32:24 GMT"
},
{
"version": "v3",
"created": "Sun, 13 Jul 2014 13:44:15 GMT"
},
{
"version": "v4",
"created": "Sun, 14 Sep 2014 17:40:56 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Horovitz",
"Michal",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.997849 |
1404.5665
|
Vasilis Papavasileiou
|
Panagiotis Manolios, Vasilis Papavasileiou, Mirek Riedewald
|
ILP Modulo Data
|
FMCAD 2014 final version plus proofs
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vast quantity of data generated and captured every day has led to a
pressing need for tools and processes to organize, analyze and interrelate this
data. Automated reasoning and optimization tools with inherent support for data
could enable advancements in a variety of contexts, from data-backed decision
making to data-intensive scientific research. To this end, we introduce a
decidable logic aimed at database analysis. Our logic extends quantifier-free
Linear Integer Arithmetic with operators from Relational Algebra, like
selection and cross product. We provide a scalable decision procedure that is
based on the BC(T) architecture for ILP Modulo Theories. Our decision procedure
makes use of database techniques. We also experimentally evaluate our approach,
and discuss potential applications.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 23:02:58 GMT"
},
{
"version": "v2",
"created": "Tue, 20 May 2014 19:22:31 GMT"
},
{
"version": "v3",
"created": "Mon, 15 Sep 2014 19:49:17 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Manolios",
"Panagiotis",
""
],
[
"Papavasileiou",
"Vasilis",
""
],
[
"Riedewald",
"Mirek",
""
]
] |
new_dataset
| 0.994595 |
1404.7067
|
Silvano Dal Zilio
|
Silvano Dal Zilio (LAAS), Lukasz Fronc (LAAS), Bernard Berthomieu
(LAAS), Fran\c{c}ois Vernadat (LAAS)
|
Time Petri Nets with Dynamic Firing Dates: Semantics and Applications
| null | null |
10.1007/978-3-319-10512-3_7
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define an extension of time Petri nets such that the time at which a
transition can fire, also called its firing date, may be dynamically updated.
Our extension provides two mechanisms for updating the timing constraints of a
net. First, we propose to change the static time interval of a transition each
time it is newly enabled; in this case the new time interval is given as a
function of the current marking. Next, we allow to update the firing date of a
transition when it is persistent, that is when a concurrent transition fires.
We show how to carry the widely used state class abstraction to this new kind
of time Petri nets and define a class of nets for which the abstraction is
exact. We show the usefulness of our approach with two applications: first for
scheduling preemptive task, as a poor man's substitute for stopwatch, then to
model hybrid systems with non trivial continuous behavior.
|
[
{
"version": "v1",
"created": "Mon, 28 Apr 2014 17:36:43 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Zilio",
"Silvano Dal",
"",
"LAAS"
],
[
"Fronc",
"Lukasz",
"",
"LAAS"
],
[
"Berthomieu",
"Bernard",
"",
"LAAS"
],
[
"Vernadat",
"François",
"",
"LAAS"
]
] |
new_dataset
| 0.994588 |
1409.1654
|
Ashraf Shahin
|
Ashraf A. Shahin
|
Polymorphic Worms Collection in Cloud Computing
|
International Journal of Computer Science and Mobile Computing, Vol.3
Issue.8, August- 2014, pg. 645-652
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the past few years, computer worms are seen as one of significant
challenges of cloud computing. Worms are rapidly changing and getting more
sophisticated to evade detection. One major issue to defend against computer
worms is collecting worms' payloads to generate their signature and study their
behavior. To collect worms' payloads, we identified challenges for detecting
and collecting worms' payloads and proposed high-interactive honeypot to
collect payloads of zero-day polymorphic worms in homogeneous and heterogeneous
cloud computing platforms. Virtual machine (VM) memory and VM disk image are
inspected from outside using open-source forensics tools and VMWare Virtual
Disk Development Kit. Our experiments show that the proposed approach overcomes
the identified challenges.
|
[
{
"version": "v1",
"created": "Fri, 5 Sep 2014 03:14:47 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Sep 2014 02:20:50 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Shahin",
"Ashraf A.",
""
]
] |
new_dataset
| 0.988082 |
1409.2235
|
Qi Mo
|
Qi Mo, Hengchin Yeh, Dinesh Manocha
|
Tracing Analytic Ray Curves for Light and Sound Propagation in
Non-linear Media
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The physical world consists of spatially varying media, such as the
atmosphere and the ocean, in which light and sound propagates along non-linear
trajectories. This presents a challenge to existing ray-tracing based methods,
which are widely adopted to simulate propagation due to their efficiency and
flexibility, but assume linear rays. We present a novel algorithm that traces
analytic ray curves computed from local media gradients, and utilizes the
closed-form solutions of both the intersections of the ray curves with planar
surfaces, and the travel distance. By constructing an adaptive unstructured
mesh, our algorithm is able to model general media profiles that vary in three
dimensions with complex boundaries consisting of terrains and other scene
objects such as buildings. We trace the analytic ray curves using the adaptive
unstructured mesh, which considerably improves the efficiency over prior
methods. We highlight the algorithm's application on simulation of sound and
visual propagation in outdoor scenes.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 08:19:21 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Sep 2014 01:25:09 GMT"
},
{
"version": "v3",
"created": "Sat, 13 Sep 2014 23:59:10 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Mo",
"Qi",
""
],
[
"Yeh",
"Hengchin",
""
],
[
"Manocha",
"Dinesh",
""
]
] |
new_dataset
| 0.991222 |
1409.3319
|
Pattama Longani
|
Pattama Longani
|
Square Grid Points Coveraged by Connected Sources with Coverage Radius
of One on a Two-Dimensional Grid
|
20 pages, 10 figures, International Journal of Computer Science &
Information Technology (IJCSIT)
|
International Journal of Computer Science & Information Technology
(IJCSIT) Vol 6, No 4, August 2014
|
10.5121/ijcsit
| null |
cs.CC cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
We take some parts of a theoretical mobility model in a two-dimension grid
proposed by Greenlaw and Kantabutra to be our model. The model has eight
necessary factors that we commonly use in a mobile wireless network: sources or
wireless signal providers, the directions that a source can move, users or
mobile devices, the given directions which define a user's movement, the given
directions which define a source's movement, source's velocity, source's
coverage, and obstacles. However, we include only the sources, source's
coverage, and the obstacles in our model. We define Square Grid Points Coverage
(SGPC) problem to minimize number of sources with coverage radius of one to
cover a square grid point size of p with the restriction that all the sources
must be communicable and proof that SGPC is in NP-complete class. We also give
an Approx-Square-Grid-Coverage (ASGC) algorithm to compute the approximate
solution of SGPC. ASGC uses the rule that any number can be obtained from the
addition of 3, 4 and 5 and then combines 3-gadgets, 4-gadgets and 5-gadgets to
specify the position of sources to cover a square grid point size of p. We find
that the algorithm achieves an approximation ratio of . Moreover, we state
about the extension usage of our algorithm and show some examples. We show that
if we use ASGC on a square grid size of p and if sources can be moved, the area
under the square grid can be covered in eight-time-steps movement. We also
prove that if we extend our source coverage radius to 1.59, without any
movement the area under the square gird will also be covered. Further studies
are also discussed and a list of some tentative problems is given in the
conclusion.
|
[
{
"version": "v1",
"created": "Thu, 11 Sep 2014 03:59:48 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Longani",
"Pattama",
""
]
] |
new_dataset
| 0.993029 |
1409.3942
|
Richa Sharma
|
Richa Sharma, Shweta Nigam, Rekha Jain
|
Polarity detection movie reviews in hindi language
| null | null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays peoples are actively involved in giving comments and reviews on
social networking websites and other websites like shopping websites, news
websites etc. large number of people everyday share their opinion on the web,
results is a large number of user data is collected .users also find it trivial
task to read all the reviews and then reached into the decision. It would be
better if these reviews are classified into some category so that the user
finds it easier to read. Opinion Mining or Sentiment Analysis is a natural
language processing task that mines information from various text forms such as
reviews, news, and blogs and classify them on the basis of their polarity as
positive, negative or neutral. But, from the last few years, user content in
Hindi language is also increasing at a rapid rate on the Web. So it is very
important to perform opinion mining in Hindi language as well. In this paper a
Hindi language opinion mining system is proposed. The system classifies the
reviews as positive, negative and neutral for Hindi language. Negation is also
handled in the proposed system. Experimental results using reviews of movies
show the effectiveness of the system
|
[
{
"version": "v1",
"created": "Sat, 13 Sep 2014 12:36:56 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Sharma",
"Richa",
""
],
[
"Nigam",
"Shweta",
""
],
[
"Jain",
"Rekha",
""
]
] |
new_dataset
| 0.999686 |
1409.4078
|
Boris Burshteyn
|
Boris Burshteyn
|
The distributed Language Hello White Paper
|
10 pages
| null | null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hello is a general-purpose, object-oriented, protocol-agnostic distributed
programming language. This paper explains the ideas that guided design of
Hello. It shows the spirit of Hello using two brief expressive programs and
provides a summary of language features. In addition, it explores historical
parallels between the binary programming of early computers and the distributed
programming of modern networks.
|
[
{
"version": "v1",
"created": "Sun, 14 Sep 2014 17:26:34 GMT"
}
] | 2014-09-16T00:00:00 |
[
[
"Burshteyn",
"Boris",
""
]
] |
new_dataset
| 0.998621 |
1002.4317
|
Amelia Carolina Sparavigna
|
Amelia Carolina Sparavigna, Roberto Marazzato
|
CLD-shaped Brushstrokes in Non-Photorealistic Rendering
|
Keywords: Image processing, Non-photorealistic processing,
Image-based rendering Coherence Length Diagram
|
International Journal of Software Engineering and Computing, 2011,
Volume 3, Issue 1, Pages 11-15
| null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rendering techniques based on a random grid can be improved by adapting
brushstrokes to the shape of different areas of the original picture. In this
paper, the concept of Coherence Length Diagram is applied to determine the
adaptive brushstrokes, in order to simulate an impressionist painting. Some
examples are provided to instance the proposed algorithm.
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2010 12:32:34 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Sparavigna",
"Amelia Carolina",
""
],
[
"Marazzato",
"Roberto",
""
]
] |
new_dataset
| 0.996393 |
1205.0997
|
Mario Blaum
|
Mario Blaum, James Lee Hafner and Steven Hetzler
|
Partial-MDS Codes and their Application to RAID Type of Architectures
|
This new version corrects a typo in Theorem 5.5
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A family of codes with a natural two-dimensional structure is presented,
inspired by an application of RAID type of architectures whose units are solid
state drives (SSDs). Arrays of SSDs behave differently to arrays of hard disk
drives (HDDs), since hard errors in sectors are common and traditional RAID
approaches (like RAID 5 or RAID 6) may be either insufficient or excessive. An
efficient solution to this problem is given by the new codes presented, called
partial-MDS (PMDS) codes.
|
[
{
"version": "v1",
"created": "Fri, 4 May 2012 16:08:26 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Sep 2014 16:45:24 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Blaum",
"Mario",
""
],
[
"Hafner",
"James Lee",
""
],
[
"Hetzler",
"Steven",
""
]
] |
new_dataset
| 0.999495 |
1409.3143
|
Teresa Gomez-Diaz
|
Teresa Gomez-Diaz (LIGM)
|
Free software, Open source software, licenses. A short presentation
including a procedure for research software and data dissemination
|
4 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main goal of this document is to help the research community to
understand the basic concepts of software distribution: Free software, Open
source software, licenses. This document also includes a procedure for research
software and data dissemination.
|
[
{
"version": "v1",
"created": "Tue, 9 Sep 2014 19:05:40 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Sep 2014 14:00:57 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Gomez-Diaz",
"Teresa",
"",
"LIGM"
]
] |
new_dataset
| 0.997828 |
1409.3367
|
Gabriel Muller
|
Gabriel L. Muller
|
HTML5 WebSocket protocol and its application to distributed computing
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
HTML5 WebSocket protocol brings real time communication in web browsers to a
new level. Daily, new products are designed to stay permanently connected to
the web. WebSocket is the technology enabling this revolution. WebSockets are
supported by all current browsers, but it is still a new technology in constant
evolution.
WebSockets are slowly replacing older client-server communication
technologies. As opposed to comet-like technologies WebSockets' remarkable
performances is a result of the protocol's fully duplex nature and because it
doesn't rely on HTTP communications.
To begin with this paper studies the WebSocket protocol and different
WebSocket servers implementations. This first theoretic part focuses more
deeply on heterogeneous implementations and OpenCL. The second part is a
benchmark of a new promising library.
The real-time engine used for testing purposes is SocketCluster.
SocketCluster provides a highly scalable WebSocket server that makes use of all
available cpu cores on an instance. The scope of this work is reduced to
vertical scaling of SocketCluster.
|
[
{
"version": "v1",
"created": "Thu, 11 Sep 2014 09:36:46 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Muller",
"Gabriel L.",
""
]
] |
new_dataset
| 0.999535 |
1409.3404
|
Dominik Egarter
|
Christoph Klemenjak, Dominik Egarter, Wilfried Elmenreich
|
YoMo - The Arduino based Smart Metering Board
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart meters are an enabling technology for many smart grid applications.
This paper introduces a design for a low-cost smart meter system as well as the
fundamentals of smart metering. The smart meter platform, provided as open
hardware, is designed with a connector interface compatible to the Arduino
platform, thus opening the possibilities for smart meters with flexible
hardware and computation features, starting from low-cost 8 bit micro
controllers up to powerful single board computers that can run Linux. The
metering platform features a current transformer which allows a non-intrusive
installation of the current measurement unit. The suggested design can switch
loads, offers a variable sampling frequency, and provides measurement data such
as active power, reactive and apparent power. Results indicate that measurement
accuracy and resolution of the proposed metering platform are sufficient for a
range of different applications and loads from a few watts up to five
kilowatts.
|
[
{
"version": "v1",
"created": "Thu, 11 Sep 2014 11:57:04 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Klemenjak",
"Christoph",
""
],
[
"Egarter",
"Dominik",
""
],
[
"Elmenreich",
"Wilfried",
""
]
] |
new_dataset
| 0.999808 |
1409.3512
|
Udaya Raj Dhungana
|
Udaya Raj Dhungana, Subarna Shakya, Kabita Baral and Bharat Sharma
|
Word Sense Disambiguation using WSD specific Wordnet of Polysemy Words
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new model of WordNet that is used to disambiguate the
correct sense of polysemy word based on the clue words. The related words for
each sense of a polysemy word as well as single sense word are referred to as
the clue words. The conventional WordNet organizes nouns, verbs, adjectives and
adverbs together into sets of synonyms called synsets each expressing a
different concept. In contrast to the structure of WordNet, we developed a new
model of WordNet that organizes the different senses of polysemy words as well
as the single sense words based on the clue words. These clue words for each
sense of a polysemy word as well as for single sense word are used to
disambiguate the correct meaning of the polysemy word in the given context
using knowledge based Word Sense Disambiguation (WSD) algorithms. The clue word
can be a noun, verb, adjective or adverb.
|
[
{
"version": "v1",
"created": "Wed, 10 Sep 2014 19:01:18 GMT"
}
] | 2014-09-12T00:00:00 |
[
[
"Dhungana",
"Udaya Raj",
""
],
[
"Shakya",
"Subarna",
""
],
[
"Baral",
"Kabita",
""
],
[
"Sharma",
"Bharat",
""
]
] |
new_dataset
| 0.999642 |
1401.2778
|
Loet Leydesdorff
|
Loet Leydesdorff, Floortje Alkemade, Gaston Heimeriks, and Rinke
Hoekstra
|
Patents as Instruments for Exploring Innovation Dynamics: Geographic and
Technological Perspectives on "Photovoltaic Cells"
|
accepted for publication in Scientometrics on September 10, 2014
| null | null | null |
cs.CY cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dynamics of innovation are nonlinear and complex: geographical,
technological, and economic selection environments can be expected to interact.
Can patents provide an analytical lens to this process in terms of different
attributes such as inventor addresses, classification codes, backward and
forward citations, etc.? Two recently developed patent maps with interactive
overlay techniques--Google Maps and maps based on citation relations among
International Patent Classifications (IPC)--are elaborated into dynamic
versions that allow for online animations and comparisons by using split
screens. Various forms of animation are explored. The recently developed
Cooperative Patent Classifications (CPC) of the U.S. Patent and Trade Office
(USPTO) and the European Patent Office (EPO) provide new options for a precise
delineation of samples in both USPTO data and the Worldwide Patent Statistics
Database (PatStat) of EPO. Among the "technologies for the mitigation of
climate change" (class Y02), we zoom in on nine material technologies for
photovoltaic cells; and focus on one of them (CuInSe2) as a lead case. The
longitudinal development of Rao-Stirling diversity in the IPC-based maps
provides a heuristics for studying technological generations during the period
under study (1975-2012). The sequencing of generations prevails in USPTO data
more than in PatStat data because PatStat aggregates patent information from
countries in different stages of technological development, whereas one can
expect USPTO patents to be competitive at the technological edge.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 10:43:40 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Sep 2014 14:47:39 GMT"
}
] | 2014-09-11T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Alkemade",
"Floortje",
""
],
[
"Heimeriks",
"Gaston",
""
],
[
"Hoekstra",
"Rinke",
""
]
] |
new_dataset
| 0.967465 |
1409.2918
|
Mario Mastriani
|
Mario Mastriani
|
Quantum Edge Detection for Image Segmentation in Optical Environments
|
31 pages, 20 figures, 5 tables. arXiv admin note: substantial text
overlap with arXiv:1406.5121, arXiv:1408.2427; and text overlap with
arXiv:quant-ph/0402085 by other authors
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A quantum edge detector for image segmentation in optical environments is
presented in this work. A Boolean version of the same detector is presented
too. The quantum version of the new edge detector works with computational
basis states, exclusively. This way, we can easily avoid the problem of quantum
measurement retrieving the result of applying the new detector on the image.
Besides, a new criterion and logic based on projections onto vertical axis of
Bloch's Sphere exclusively are presented too. This approach will allow us: 1) a
simpler development of logic quantum operations, where they will closer to
those used in the classical logic operations, 2) building simple and robust
classical-to-quantum and quantum-to-classical interfaces. Said so far is
extended to quantum algorithms outside image processing too. In a special
section on metric and simulations, a new metric based on the comparison between
the classical and quantum versions algorithms for edge detection of images is
presented. Notable differences between the results of classical and quantum
versions of such algorithms (outside and inside of quantum computer,
respectively) show the existence of implementation problems involved in the
experiment, and that they have not been properly modeled for optical
environments. However, although they are different, the quantum results are
equally valid. The latter is clearly seen in the computer simulations
|
[
{
"version": "v1",
"created": "Tue, 9 Sep 2014 23:22:56 GMT"
}
] | 2014-09-11T00:00:00 |
[
[
"Mastriani",
"Mario",
""
]
] |
new_dataset
| 0.994827 |
0903.4875
|
Lynn Reid
|
A. Dubey, L.B. Reid, K. Weide, K. Antypas, M.K. Ganapathy, K. Riley,
D. Sheeler, A. Siegal
|
Extensible Component Based Architecture for FLASH, A Massively Parallel,
Multiphysics Simulation Code
|
33 pages, 7 figures; revised paper submitted to Parallel Computing
| null |
10.1016/j.parco.2009.08.001
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
FLASH is a publicly available high performance application code which has
evolved into a modular, extensible software system from a collection of
unconnected legacy codes. FLASH has been successful because its capabilities
have been driven by the needs of scientific applications, without compromising
maintainability, performance, and usability. In its newest incarnation, FLASH3
consists of inter-operable modules that can be combined to generate different
applications. The FLASH architecture allows arbitrarily many alternative
implementations of its components to co-exist and interchange with each other,
resulting in greater flexibility. Further, a simple and elegant mechanism
exists for customization of code functionality without the need to modify the
core implementation of the source. A built-in unit test framework providing
verifiability, combined with a rigorous software maintenance process, allow the
code to operate simultaneously in the dual mode of production and development.
In this paper we describe the FLASH3 architecture, with emphasis on solutions
to the more challenging conflicts arising from solver complexity, portable
performance requirements, and legacy codes. We also include results from user
surveys conducted in 2005 and 2007, which highlight the success of the code.
|
[
{
"version": "v1",
"created": "Fri, 27 Mar 2009 18:52:05 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Jul 2009 17:16:49 GMT"
}
] | 2014-09-10T00:00:00 |
[
[
"Dubey",
"A.",
""
],
[
"Reid",
"L. B.",
""
],
[
"Weide",
"K.",
""
],
[
"Antypas",
"K.",
""
],
[
"Ganapathy",
"M. K.",
""
],
[
"Riley",
"K.",
""
],
[
"Sheeler",
"D.",
""
],
[
"Siegal",
"A.",
""
]
] |
new_dataset
| 0.956667 |
1409.1023
|
Thomas Nyman
|
Thomas Nyman, Jan-Erik Ekberg and N. Asokan
|
Citizen Electronic Identities using TPM 2.0
|
This work is based on an earlier work: Citizen Electronic Identities
using TPM 2.0, to appear in the Proceedings of the 4th international workshop
on Trustworthy embedded devices, TrustED'14, November 3, 2014, Scottsdale,
Arizona, USA, http://dx.doi.org/10.1145/2666141.2666146
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electronic Identification (eID) is becoming commonplace in several European
countries. eID is typically used to authenticate to government e-services, but
is also used for other services, such as public transit, e-banking, and
physical security access control. Typical eID tokens take the form of physical
smart cards, but successes in merging eID into phone operator SIM cards show
that eID tokens integrated into a personal device can offer better usability
compared to standalone tokens. At the same time, trusted hardware that enables
secure storage and isolated processing of sensitive data have become
commonplace both on PC platforms as well as mobile devices.
Some time ago, the Trusted Computing Group (TCG) released the version 2.0 of
the Trusted Platform Module (TPM) specification. We propose an eID architecture
based on the new, rich authorization model introduced in the TCGs TPM 2.0. The
goal of the design is to improve the overall security and usability compared to
traditional smart card-based solutions. We also provide, to the best our
knowledge, the first accessible description of the TPM 2.0 authorization model.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 10:24:44 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Sep 2014 08:55:32 GMT"
}
] | 2014-09-10T00:00:00 |
[
[
"Nyman",
"Thomas",
""
],
[
"Ekberg",
"Jan-Erik",
""
],
[
"Asokan",
"N.",
""
]
] |
new_dataset
| 0.985438 |
1409.2073
|
Tobias Kortkamp
|
Tobias Kortkamp
|
An NLP Assistant for Clide
|
Bachelor Report
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This report describes an NLP assistant for the collaborative development
environment Clide, that supports the development of NLP applications by
providing easy access to some common NLP data structures. The assistant
visualizes text fragments and their dependencies by displaying the semantic
graph of a sentence, the coreference chain of a paragraph and mined triples
that are extracted from a paragraph's semantic graphs and linked using its
coreference chain. Using this information and a logic programming library, we
create an NLP database which is used by a series of queries to mine the
triples. The algorithm is tested by translating a natural language text
describing a graph to an actual graph that is shown as an annotation in the
text editor.
|
[
{
"version": "v1",
"created": "Sun, 7 Sep 2014 02:31:03 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Kortkamp",
"Tobias",
""
]
] |
new_dataset
| 0.997293 |
1409.2088
|
Michael Kruse
|
Michael Kruse (LRI, INRIA Saclay - Ile de France)
|
Introducing Molly: Distributed Memory Parallelization with LLVM
| null | null | null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Programming for distributed memory machines has always been a tedious task,
but necessary because compilers have not been sufficiently able to optimize for
such machines themselves. Molly is an extension to the LLVM compiler toolchain
that is able to distribute and reorganize workload and data if the program is
organized in statically determined loop control-flows. These are represented as
polyhedral integer-point sets that allow program transformations applied on
them. Memory distribution and layout can be declared by the programmer as
needed and the necessary asynchronous MPI communication is generated
automatically. The primary motivation is to run Lattice QCD simulations on IBM
Blue Gene/Q supercomputers, but since the implementation is not yet completed,
this paper shows the capabilities on Conway's Game of Life.
|
[
{
"version": "v1",
"created": "Sun, 7 Sep 2014 06:41:30 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Kruse",
"Michael",
"",
"LRI, INRIA Saclay - Ile de France"
]
] |
new_dataset
| 0.996011 |
1409.2208
|
Christopher Tucker Ph.D.
|
Christopher A. Tucker
|
A wireless hand-held platform for robotic behavior control
|
12 pages, 4 figures
| null | null | null |
cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The need for customizable properties in autonomous robotic platforms, such as
in-home nursing care for the elderly and parallel implementations of
human-to-machine control interfaces creates an opportunity to introduce methods
deploying commonly available mobile devices running robotic command
applications in managed code. This paper will discuss a human-to-machine
interface and demonstrate a prototype consisting of a mobile device running a
configurable application communicating with a mobile robot using a managed,
type-safe language, C#.NET, over Bluetooth.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 05:09:49 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Tucker",
"Christopher A.",
""
]
] |
new_dataset
| 0.999276 |
1409.2246
|
Philip Wette
|
Philip Wette and Holger Karl
|
DCT${^2}$Gen: A Versatile TCP Traffic Generator for Data Centers
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Only little is publicly known about traffic in non-educational data centers.
Recent studies made some knowledge available, which gives us the opportunity to
create more realistic traffic models for data center research. We used this
knowledge to create the first publicly available traffic generator that
produces realistic traffic between hosts in data centers of arbitrary size. We
characterize traffic by using six probability distribution functions and
concentrate on the generation of traffic on flow-level. The distribution
functions are described as step functions, which makes our generator highly
configurable to generate traffic for different kinds of data centers. Moreover,
in data centers, traffic between hosts in the same rack and hosts in different
racks have different properties. We model this phenomenon, making our generated
traffic very realistic. We carefully evaluated our approach and conclude that
it reproduces these characteristics with high accuracy.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 08:59:17 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Wette",
"Philip",
""
],
[
"Karl",
"Holger",
""
]
] |
new_dataset
| 0.990724 |
1409.2353
|
Bernhard Rumpe
|
Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe
|
Modal Object Diagrams
|
25 pages, 9 figures
|
Proc. 25th Euro. Conf. on Object Oriented Programming (ECOOP'11),
LNCS 6813, pp. 281-305, Springer, 2011
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While object diagrams (ODs) are widely used as a means to document
object-oriented systems, they are expressively weak, as they are limited to
describe specific possible snapshots of the system at hand. In this paper we
introduce modal object diagrams (MODs), which extend the classical OD language
with positive/negative and example/invariant modalities. The extended language
allows the designer to specify not only positive example models but also
negative examples, ones that the system should not allow, positive invariants,
ones that all system's snapshots should include, and negative invariants, ones
that no system snapshot is allowed to include. Moreover, as a primary
application of the extended language we provide a formal verification technique
that decides whether a given class diagram satisfies (i.e., models) a
multi-modal object diagrams specification. In case of a negative answer, the
technique outputs relevant counterexample object models, as applicable. The
verification is based on a reduction to Alloy. The ideas are implemented in a
prototype Eclipse plug-in. Examples show the usefulness of the extended
language in specifying structural requirements of object-oriented systems in an
intuitive yet expressive way.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 14:16:16 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Maoz",
"Shahar",
""
],
[
"Ringert",
"Jan Oliver",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.997363 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.