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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1308.2196
|
Hsiu-Chen Hsu
|
Hsiu-Chen Hsu, Rong-Chin Lo
|
A New Mattress Development Based on Pressure Sensors for Body-contouring
Uniform Support
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For getting good sleep quality, an improved approach of new mattress
development based on the pressure sensors for body-contouring uniform support
is proposed in this paper. This method solved the problems of innerspring
mattresses that cannot allow body-contouring uniform support, and foam
mattresses that cannot provide everybody equal comfort from the same mattress.
By the buried pressure sensor array and actuator array in foam layer of a
mattress, both are connected to a controller to generate the pressure
distribution mapping of a human body on the mattress, then from the data of
this mapping, some of the actuators are driven up or down by the controller to
generate a body-contouring uniform support. By the aid of mathematical
morphology algorithms, user can also choose a different support mode by another
wireless controller with touch-screen to accommodate personal favorite firmness
of the mattress and to take his tensed mood and pressure off with good sleep
until daylight. Moreover, some other homecare functions, such as temperature
measurement, sleep on posture correction and fall down prevention, can approach
by additional hardware and software as user requirement in the future.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 17:31:55 GMT"
}
] | 2013-08-12T00:00:00 |
[
[
"Hsu",
"Hsiu-Chen",
""
],
[
"Lo",
"Rong-Chin",
""
]
] |
new_dataset
| 0.98449 |
1301.7250
|
Andreas Bjorklund
|
Andreas Bj\"orklund and Thore Husfeldt
|
The Parity of Directed Hamiltonian Cycles
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a deterministic algorithm that given any directed graph on n
vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n)
time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n)
expected time algorithm. Our algorithms are based on a new combinatorial
formula for the number of Hamiltonian cycles modulo a positive integer.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2013 14:57:48 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Aug 2013 14:32:17 GMT"
}
] | 2013-08-09T00:00:00 |
[
[
"Björklund",
"Andreas",
""
],
[
"Husfeldt",
"Thore",
""
]
] |
new_dataset
| 0.974492 |
1304.0473
|
Mark Newman
|
Travis Martin, Brian Ball, Brian Karrer, and M. E. J. Newman
|
Coauthorship and citation in scientific publishing
|
10 pages, 11 figures, 3 tables
| null |
10.1103/PhysRevE.88.012814
| null |
cs.DL cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large number of published studies have examined the properties of either
networks of citation among scientific papers or networks of coauthorship among
scientists. Here, using an extensive data set covering more than a century of
physics papers published in the Physical Review, we study a hybrid
coauthorship/citation network that combines the two, which we analyze to gain
insight into the correlations and interactions between authorship and citation.
Among other things, we investigate the extent to which individuals tend to cite
themselves or their collaborators more than others, the extent to which they
cite themselves or their collaborators more quickly after publication, and the
extent to which they tend to return the favor of a citation from another
scientist.
|
[
{
"version": "v1",
"created": "Mon, 1 Apr 2013 20:36:35 GMT"
}
] | 2013-08-09T00:00:00 |
[
[
"Martin",
"Travis",
""
],
[
"Ball",
"Brian",
""
],
[
"Karrer",
"Brian",
""
],
[
"Newman",
"M. E. J.",
""
]
] |
new_dataset
| 0.955059 |
1308.1838
|
Stefanie Haustein
|
Stefanie Haustein, Isabella Peters, Cassidy R. Sugimoto, Mike Thelwall
and Vincent Larivi\`ere
|
Tweeting biomedicine: an analysis of tweets and citations in the
biomedical literature
|
22 pages, 4 figures, 5 tables
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data collected by social media platforms have recently been introduced as a
new source for indicators to help measure the impact of scholarly research in
ways that are complementary to traditional citation-based indicators. Data
generated from social media activities related to scholarly content can be used
to reflect broad types of impact. This paper aims to provide systematic
evidence regarding how often Twitter is used to diffuse journal articles in the
biomedical and life sciences. The analysis is based on a set of 1.4 million
documents covered by both PubMed and Web of Science (WoS) and published between
2010 and 2012. The number of tweets containing links to these documents was
analyzed to evaluate the degree to which certain journals, disciplines, and
specialties were represented on Twitter. It is shown that, with less than 10%
of PubMed articles mentioned on Twitter, its uptake is low in general. The
relationship between tweets and WoS citations was examined for each document at
the level of journals and specialties. The results show that tweeting behavior
varies between journals and specialties and correlations between tweets and
citations are low, implying that impact metrics based on tweets are different
from those based on citations. A framework utilizing the coverage of articles
and the correlation between Twitter mentions and citations is proposed to
facilitate the evaluation of novel social-media based metrics and to shed light
on the question in how far the number of tweets is a valid metric to measure
research impact.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 13:09:13 GMT"
}
] | 2013-08-09T00:00:00 |
[
[
"Haustein",
"Stefanie",
""
],
[
"Peters",
"Isabella",
""
],
[
"Sugimoto",
"Cassidy R.",
""
],
[
"Thelwall",
"Mike",
""
],
[
"Larivière",
"Vincent",
""
]
] |
new_dataset
| 0.988206 |
1308.1857
|
Pollyanna Gon\c{c}alves Ms
|
Pollyanna Gon\c{c}alves, Fabr\'icio Benevenuto, Meeyoung Cha
|
PANAS-t: A Pychometric Scale for Measuring Sentiments on Twitter
|
10 pages, 3 figures
| null | null | null |
cs.SI physics.soc-ph
|
http://creativecommons.org/licenses/by/3.0/
|
Online social networks have become a major communication platform, where
people share their thoughts and opinions about any topic real-time. The short
text updates people post in these network contain emotions and moods, which
when measured collectively can unveil the public mood at population level and
have exciting implications for businesses, governments, and societies.
Therefore, there is an urgent need for developing solid methods for accurately
measuring moods from large-scale social media data. In this paper, we propose
PANAS-t, which measures sentiments from short text updates in Twitter based on
a well-established psychometric scale, PANAS (Positive and Negative Affect
Schedule). We test the efficacy of PANAS-t over 10 real notable events drawn
from 1.8 billion tweets and demonstrate that it can efficiently capture the
expected sentiments of a wide variety of issues spanning tragedies, technology
releases, political debates, and healthcare.
|
[
{
"version": "v1",
"created": "Thu, 8 Aug 2013 14:06:51 GMT"
}
] | 2013-08-09T00:00:00 |
[
[
"Gonçalves",
"Pollyanna",
""
],
[
"Benevenuto",
"Fabrício",
""
],
[
"Cha",
"Meeyoung",
""
]
] |
new_dataset
| 0.997864 |
1305.3688
|
Jianhang Gao
|
Jianhang Gao, Qing Zhao, Ananthram Swami
|
The Thinnest Path Problem
| null | null | null | null |
cs.NI cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We formulate and study the thinnest path problem in wireless ad hoc networks.
The objective is to find a path from a source to its destination that results
in the minimum number of nodes overhearing the message by a judicious choice of
relaying nodes and their corresponding transmission power. We adopt a directed
hypergraph model of the problem and establish the NP-completeness of the
problem in 2-D networks. We then develop two polynomial-time approximation
algorithms that offer $\sqrt{\frac{n}{2}}$ and $\frac{n}{2\sqrt{n-1}}$
approximation ratios for general directed hypergraphs (which can model
non-isomorphic signal propagation in space) and constant approximation ratios
for ring hypergraphs (which result from isomorphic signal propagation). We also
consider the thinnest path problem in 1-D networks and 1-D networks embedded in
2-D field of eavesdroppers with arbitrary unknown locations (the so-called
1.5-D networks). We propose a linear-complexity algorithm based on nested
backward induction that obtains the optimal solution to both 1-D and 1.5-D
networks. This algorithm does not require the knowledge of eavesdropper
locations and achieves the best performance offered by any algorithm that
assumes complete location information of the eavesdroppers.
|
[
{
"version": "v1",
"created": "Thu, 16 May 2013 06:17:51 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Aug 2013 21:55:50 GMT"
}
] | 2013-08-08T00:00:00 |
[
[
"Gao",
"Jianhang",
""
],
[
"Zhao",
"Qing",
""
],
[
"Swami",
"Ananthram",
""
]
] |
new_dataset
| 0.977889 |
1307.5030
|
Ge Xia
|
Wah Loon Keng, Ge Xia
|
The Yao Graph $Y_5$ is a Spanner
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we prove that $Y_5$, the Yao graph with five cones, is a
spanner with stretch factor $\rho = 2+\sqrt{3} \approx 3.74$. Since $Y_5$ is
the only Yao graph whose status of being a spanner or not was open, this
completes the picture of the Yao graphs that are spanners: a Yao graph $Y_k$ is
a spanner if and only if $k \geq 4$.
We complement the above result with a lower bound of 2.87 on the stretch
factor of $Y_5$. We also show that $YY_5$, the Yao-Yao graph with five cones,
is not a spanner.
|
[
{
"version": "v1",
"created": "Thu, 18 Jul 2013 18:18:10 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Aug 2013 18:13:24 GMT"
}
] | 2013-08-08T00:00:00 |
[
[
"Keng",
"Wah Loon",
""
],
[
"Xia",
"Ge",
""
]
] |
new_dataset
| 0.995306 |
1308.1484
|
Alireza Rezvanian
|
Somayeh Nabizadeh, Alireza Rezvanian, Mohammd Reza Meybodi
|
A Multi-Swarm Cellular PSO based on Clonal Selection Algorithm in
Dynamic Environments
|
5 pages, 3 figures, conference paper
|
2012 International Conference on Informatics, Electronics & Vision
(ICIEV 2012) 482-486
|
10.1109/ICIEV.2012.6317524
| null |
cs.NE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many real-world problems are dynamic optimization problems. In this case, the
optima in the environment change dynamically. Therefore, traditional
optimization algorithms disable to track and find optima. In this paper, a new
multi-swarm cellular particle swarm optimization based on clonal selection
algorithm (CPSOC) is proposed for dynamic environments. In the proposed
algorithm, the search space is partitioned into cells by a cellular automaton.
Clustered particles in each cell, which make a sub-swarm, are evolved by the
particle swarm optimization and clonal selection algorithm. Experimental
results on Moving Peaks Benchmark demonstrate the superiority of the CPSOC its
popular methods.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2013 05:46:55 GMT"
}
] | 2013-08-08T00:00:00 |
[
[
"Nabizadeh",
"Somayeh",
""
],
[
"Rezvanian",
"Alireza",
""
],
[
"Meybodi",
"Mohammd Reza",
""
]
] |
new_dataset
| 0.991947 |
1308.1503
|
Cedomir Stefanovic
|
Cedomir Stefanovic and Petar Popovski
|
ALOHA Random Access that Operates as a Rateless Code
|
Revised version submitted to IEEE Transactions on Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various applications of wireless Machine-to-Machine (M2M) communications have
rekindled the research interest in random access protocols, suitable to support
a large number of connected devices. Slotted ALOHA and its derivatives
represent a simple solution for distributed random access in wireless networks.
Recently, a framed version of slotted ALOHA gained renewed interest due to the
incorporation of successive interference cancellation (SIC) in the scheme,
which resulted in substantially higher throughputs. Based on similar principles
and inspired by the rateless coding paradigm, a frameless approach for
distributed random access in slotted ALOHA framework is described in this
paper. The proposed approach shares an operational analogy with rateless
coding, expressed both through the user access strategy and the adaptive length
of the contention period, with the objective to end the contention when the
instantaneous throughput is maximized. The paper presents the related analysis,
providing heuristic criteria for terminating the contention period and showing
that very high throughputs can be achieved, even for a low number for
contending users. The demonstrated results potentially have more direct
practical implications compared to the approaches for coded random access that
lead to high throughputs only asymptotically.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2013 08:48:44 GMT"
}
] | 2013-08-08T00:00:00 |
[
[
"Stefanovic",
"Cedomir",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.998792 |
1308.1556
|
Yinglei Song
|
Yinglei Song
|
On the Independent Set and Common Subgraph Problems in Random Graphs
| null | null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we develop efficient exact and approximate algorithms for
computing a maximum independent set in random graphs. In a random graph $G$,
each pair of vertices are joined by an edge with a probability $p$, where $p$
is a constant between $0$ and $1$. We show that, a maximum independent set in a
random graph that contains $n$ vertices can be computed in expected computation
time $2^{O(\log_{2}^{2}{n})}$. Using techniques based on enumeration, we
develop an algorithm that can find a largest common subgraph in two random
graphs in $n$ and $m$ vertices ($m \leq n$) in expected computation time
$2^{O(n^{\frac{1}{2}}\log_{2}^{\frac{5}{3}}{n})}$. In addition, we show that,
with high probability, the parameterized independent set problem is fixed
parameter tractable in random graphs and the maximum independent set in a
random graph in $n$ vertices can be approximated within a ratio of
$\frac{2n}{2^{\sqrt{\log_{2}{n}}}}$ in expected polynomial time.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2013 12:55:41 GMT"
}
] | 2013-08-08T00:00:00 |
[
[
"Song",
"Yinglei",
""
]
] |
new_dataset
| 0.96436 |
1302.1596
|
Onur Y{\i}lmaz
|
Onur Y{\i}lmaz
|
Tag-based Semantic Website Recommendation for Turkish Language
|
7 pages, research and experiment about recommendation system for
Turkish
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the dramatic increase in the number of websites on the internet, tagging
has become popular for finding related, personal and important documents. When
the potentially increasing internet markets are analyzed, Turkey, in which most
of the people use Turkish language on the internet, found to be exponentially
increasing. In this paper, a tag-based website recommendation method is
presented, where similarity measures are combined with semantic relationships
of tags. In order to evaluate the system, an experiment with 25 people from
Turkey is undertaken and participants are firstly asked to provide websites and
tags in Turkish and then they are asked to evaluate recommended websites.
|
[
{
"version": "v1",
"created": "Wed, 6 Feb 2013 22:02:31 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Feb 2013 20:53:41 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Aug 2013 12:14:12 GMT"
}
] | 2013-08-07T00:00:00 |
[
[
"Yılmaz",
"Onur",
""
]
] |
new_dataset
| 0.993812 |
1308.1178
|
Peter Gloor
|
Takashi Iba
|
Pattern Languages as Media for the Creative Society
|
Presented at COINs13 Conference, Chile, 2013 (arxiv:1308.1028)
| null | null |
coins13/2013/07
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes new languages for basic skills in the Creative Society,
where people create their own goods, tools, concepts, knowledge, and mechanisms
with their own hands: the skills of learning, presentation, and collaboration.
These languages are written as a pattern language, which is a way of describing
the tacit practical knowledge. In this paper, a new type of pattern languages
are proposed as "Pattern Languages 3.0" and three examples are introduced:
Learning Patterns, Collaboration Patterns, and Presentation Patterns. By
analyzing the functions with the social systems theory and the creative systems
theory, pattern languages are considered as communication media and discovery
media.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 03:47:38 GMT"
}
] | 2013-08-07T00:00:00 |
[
[
"Iba",
"Takashi",
""
]
] |
new_dataset
| 0.95953 |
1308.1224
|
Aleksandar Stupar
|
Aleksandar Stupar and Sebastian Michel
|
Benchmarking Soundtrack Recommendation Systems with SRBench
|
Extended version of the CIKM 2013 paper: SRbench-A Benchmark for
Soundtrack Recommendation Systems
| null | null | null |
cs.IR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a benchmark to evaluate the retrieval performance of soundtrack
recommendation systems is proposed. Such systems aim at finding songs that are
played as background music for a given set of images. The proposed benchmark is
based on preference judgments, where relevance is considered a continuous
ordinal variable and judgments are collected for pairs of songs with respect to
a query (i.e., set of images). To capture a wide variety of songs and images,
we use a large space of possible music genres, different emotions expressed
through music, and various query-image themes. The benchmark consists of two
types of relevance assessments: (i) judgments obtained from a user study, that
serve as a "gold standard" for (ii) relevance judgments gathered through
Amazon's Mechanical Turk. We report on an analysis of relevance judgments based
on different levels of user agreement and investigate the performance of two
state-of-the-art soundtrack recommendation systems using the proposed
benchmark.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 10:10:22 GMT"
}
] | 2013-08-07T00:00:00 |
[
[
"Stupar",
"Aleksandar",
""
],
[
"Michel",
"Sebastian",
""
]
] |
new_dataset
| 0.999676 |
1307.6995
|
Andrey Bereza
|
Andrey Bereza, Maksim Lyashov, Luis Blanco
|
Finite State Machine Synthesis for Evolutionary Hardware
| null | null | null | null |
cs.NE cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article considers application of genetic algorithms for finite machine
synthesis. The resulting genetic finite state machines synthesis algorithm
allows for creation of machines with less number of states and within shorter
time. This makes it possible to use hardware-oriented genetic finite machines
synthesis algorithm in autonomous systems on reconfigurable platforms.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 11:11:47 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Aug 2013 21:04:24 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Bereza",
"Andrey",
""
],
[
"Lyashov",
"Maksim",
""
],
[
"Blanco",
"Luis",
""
]
] |
new_dataset
| 0.955311 |
1308.0625
|
Hulya Seferoglu
|
Hulya Seferoglu, Eytan Modiano
|
TCP-Aware Backpressure Routing and Scheduling
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we explore the performance of backpressure routing and
scheduling for TCP flows over wireless networks. TCP and backpressure are not
compatible due to a mismatch between the congestion control mechanism of TCP
and the queue size based routing and scheduling of the backpressure framework.
We propose a TCP-aware backpressure routing and scheduling that takes into
account the behavior of TCP flows. TCP-aware backpressure (i) provides
throughput optimality guarantees in the Lyapunov optimization framework, (ii)
gracefully combines TCP and backpressure without making any changes to the TCP
protocol, (iii) improves the throughput of TCP flows significantly, and (iv)
provides fairness across competing TCP flows.
|
[
{
"version": "v1",
"created": "Fri, 2 Aug 2013 21:51:47 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Seferoglu",
"Hulya",
""
],
[
"Modiano",
"Eytan",
""
]
] |
new_dataset
| 0.968096 |
1308.0632
|
Samuel Cheng
|
Rick Ma and Samuel Cheng
|
Zero-error Slepian-Wolf Coding of Confined Correlated Sources with
Deviation Symmetry
|
submitted to IEEE Trans Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of
a set of sources with deviation symmetry, where the sources are generalization
of the Hamming sources over an arbitrary field. We extend our previous codes,
Generalized Hamming Codes for Multiple Sources, to Matrix Partition Codes and
use the latter to efficiently compress the target sources. We further show that
every perfect or linear-optimal code is a Matrix Partition Code. We also
present some conditions when Matrix Partition Codes are perfect and/or
linear-optimal. Detail discussions of Matrix Partition Codes on Hamming sources
are given at last as examples.
|
[
{
"version": "v1",
"created": "Fri, 2 Aug 2013 22:28:09 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Ma",
"Rick",
""
],
[
"Cheng",
"Samuel",
""
]
] |
new_dataset
| 0.983839 |
1308.0762
|
Klaus Mueller
|
Bing Wang, Puripant Ruchikachorn, Klaus Mueller
|
SketchPadN-D: WYDIWYG Sculpting and Editing in High-Dimensional Space
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-dimensional data visualization has been attracting much attention. To
fully test related software and algorithms, researchers require a diverse pool
of data with known and desired features. Test data do not always provide this,
or only partially. Here we propose the paradigm WYDIWYGS (What You Draw Is What
You Get). Its embodiment, Sketch Pad ND, is a tool that allows users to
generate high-dimensional data in the same interface they also use for
visualization. This provides for an immersive and direct data generation
activity, and furthermore it also enables users to interactively edit and clean
existing high-dimensional data from possible artifacts. Sketch Pad ND offers
two visualization paradigms, one based on parallel coordinates and the other
based on a relatively new framework using an N-D polygon to navigate in
high-dimensional space. The first interface allows users to draw arbitrary
profiles of probability density functions along each dimension axis and sketch
shapes for data density and connections between adjacent dimensions. The second
interface embraces the idea of sculpting. Users can carve data at arbitrary
orientations and refine them wherever necessary. This guarantees the data
generated is truly high-dimensional. We demonstrate our tool's usefulness in
real data visualization scenarios.
|
[
{
"version": "v1",
"created": "Sun, 4 Aug 2013 00:38:36 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Wang",
"Bing",
""
],
[
"Ruchikachorn",
"Puripant",
""
],
[
"Mueller",
"Klaus",
""
]
] |
new_dataset
| 0.973641 |
1308.0768
|
Ibrahim Sabek
|
Ibrahim Sabek and Moustafa Youssef
|
MonoStream: A Minimal-Hardware High Accuracy Device-free WLAN
Localization System
| null | null | null | null |
cs.NI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-free (DF) localization is an emerging technology that allows the
detection and tracking of entities that do not carry any devices nor
participate actively in the localization process. Typically, DF systems require
a large number of transmitters and receivers to achieve acceptable accuracy,
which is not available in many scenarios such as homes and small businesses. In
this paper, we introduce MonoStream as an accurate single-stream DF
localization system that leverages the rich Channel State Information (CSI) as
well as MIMO information from the physical layer to provide accurate DF
localization with only one stream. To boost its accuracy and attain low
computational requirements, MonoStream models the DF localization problem as an
object recognition problem and uses a novel set of CSI-context features and
techniques with proven accuracy and efficiency. Experimental evaluation in two
typical testbeds, with a side-by-side comparison with the state-of-the-art,
shows that MonoStream can achieve an accuracy of 0.95m with at least 26%
enhancement in median distance error using a single stream only. This
enhancement in accuracy comes with an efficient execution of less than 23ms per
location update on a typical laptop. This highlights the potential of
MonoStream usage for real-time DF tracking applications.
|
[
{
"version": "v1",
"created": "Sun, 4 Aug 2013 02:07:54 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Sabek",
"Ibrahim",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.997895 |
1308.0824
|
Sugata Sanyal
|
Rohit Bhadauria, Rajdeep Borgohain, Abirlal Biswas, Sugata Sanyal
|
Secure Authentication of Cloud Data Mining API
|
7 pages, 2 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing is a revolutionary concept that has brought a paradigm shift
in the IT world. This has made it possible to manage and run businesses without
even setting up an IT infrastructure. It offers multi-fold benefits to the
users moving to a cloud, while posing unknown security and privacy issues. User
authentication is one such growing concern and is greatly needed in order to
ensure privacy and security in a cloud computing environment. This paper
discusses the security at different levels viz. network, application and
virtualization, in a cloud computing environment. A security framework based on
one-time pass key mechanism has been proposed. The uniqueness of the proposed
security protocol lies in the fact, that it provides security to both the
service providers as well the users in a highly conflicting cloud environment.
|
[
{
"version": "v1",
"created": "Sun, 4 Aug 2013 16:22:30 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Bhadauria",
"Rohit",
""
],
[
"Borgohain",
"Rajdeep",
""
],
[
"Biswas",
"Abirlal",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.952128 |
1308.1068
|
Laszlo Egri
|
Rajesh Chitnis, Laszlo Egri, Daniel Marx
|
List H-Coloring a Graph by Removing Few Vertices
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the deletion version of the list homomorphism problem, we are given graphs
G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an
integer k. The task is to decide whether there exists a subset W of V(G) of
size at most k such that there is a homomorphism from G \ W to H respecting the
lists. We show that DL-Hom(H), parameterized by k and |H|, is fixed-parameter
tractable for any (P6, C6)-free bipartite graph H; already for this restricted
class of graphs, the problem generalizes Vertex Cover, Odd Cycle Transversal,
and Vertex Multiway Cut parameterized by the size of the cutset and the number
of terminals. We conjecture that DL-Hom(H) is fixed-parameter tractable for the
class of graphs H for which the list homomorphism problem (without deletions)
is polynomial-time solvable; by a result of Feder, Hell and Huang (1999), a
graph H belongs to this class precisely if it is a bipartite graph whose
complement is a circular arc graph. We show that this conjecture is equivalent
to the fixed-parameter tractability of a single fairly natural satisfiability
problem, Clause Deletion Chain-SAT.
|
[
{
"version": "v1",
"created": "Mon, 5 Aug 2013 18:56:38 GMT"
}
] | 2013-08-06T00:00:00 |
[
[
"Chitnis",
"Rajesh",
""
],
[
"Egri",
"Laszlo",
""
],
[
"Marx",
"Daniel",
""
]
] |
new_dataset
| 0.996906 |
1308.0372
|
Mahdi Nasrullah Al-Ameen
|
Mahdi Nasrullah Al-Ameen
|
An Intelligent Fire Alert System using Wireless Mobile Communication
|
10 pages, 8 figures, 4 tables
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The system has come to light through the way of inspiration to develop a
compact system, based on the fundamental ideas of safety, security and control.
Once this system is installed to operation specifying temperature and smoke
threshold, in case of any emergency situation due to increasing temperature
and/or smoke at place surpassing the threshold, the system immediately sends
automatic alert-notifications to the users, concerned with the situations. The
user gets total control over the system through mobile SMS, even from the
distant location, that to change the threshold, turn on/off the feature of
sending 'alert notification' and also to reset the system after the emergency
situation is overcome. Before executing any command (through SMS) from the
user, the system asks for the preset password to verify an authorized user. The
security issues have been considered with utter attention in this system to
ensure its applicability in industries and business organizations, where
security is an important concern. Hence, the fundamental ideas of safety,
security and control have been entirely ensured through the system, which have
definitely worked as the gear moving factor to look for a new dimension of an
'Intelligent Fire Alert System'.
|
[
{
"version": "v1",
"created": "Thu, 1 Aug 2013 22:30:09 GMT"
}
] | 2013-08-05T00:00:00 |
[
[
"Al-Ameen",
"Mahdi Nasrullah",
""
]
] |
new_dataset
| 0.999057 |
1305.6175
|
Dawei Zhao
|
Shangdi Chen and Dawei Zhao
|
New Construction of Authentication Codes with Arbitration from
Pseudo-Symplectic Geometry over Finite Fields
|
arXiv admin note: text overlap with arXiv:1302.3160 by other authors
|
Ars Combinatoria, 2010, 97A: 453-465
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new construction of authentication codes with arbitration from
pseudo-symplectic geometry over finite fields is given. The parameters and the
probabilities of deceptions of the codes are also computed.
|
[
{
"version": "v1",
"created": "Mon, 27 May 2013 11:03:27 GMT"
}
] | 2013-08-02T00:00:00 |
[
[
"Chen",
"Shangdi",
""
],
[
"Zhao",
"Dawei",
""
]
] |
new_dataset
| 0.976781 |
1307.6927
|
Reza Hooshmand
|
Reza Hooshmand, Masoumeh Koochak Shooshtari, Mohammad Reza Aref
|
Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel
|
This paper was submitted to ISCISC 2013 on 19 May 2013 and accepted
on 25 July 2013
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an efficient secret key cryptosystem based on polar codes
over Binary Erasure Channel. We introduce a method, for the first time to our
knowledge, to hide the generator matrix of the polar codes from an attacker. In
fact, our main goal is to achieve secure and reliable communication using
finite-length polar codes. The proposed cryptosystem has a significant security
advantage against chosen plaintext attacks in comparison with the Rao-Nam
cryptosystem. Also, the key length is decreased after applying a new
compression algorithm. Moreover, this scheme benefits from high code rate and
proper error performance for reliable communication.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 05:34:19 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Aug 2013 05:28:25 GMT"
}
] | 2013-08-02T00:00:00 |
[
[
"Hooshmand",
"Reza",
""
],
[
"Shooshtari",
"Masoumeh Koochak",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.999675 |
1308.0315
|
Ali Wali
|
Mohamed Chakroun, Ali Wali and Adel M. Alimi
|
MAS for video objects segmentation and tracking based on active contours
and SURF descriptor
|
6 pages
|
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 2, No 3, March 2013
| null | null |
cs.MM cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In computer vision, video segmentation and tracking is an important
challenging issue. In this paper, we describe a new video sequences
segmentation and tracking algorithm based on MAS "multi-agent systems" and SURF
"Speeded Up Robust Features". Our approach consists in modelling a multi-agent
system for segmenting the first image from a video sequence and tracking
objects in the video sequences. The used agents are supervisor and explorator
agents, they are communicating between them and they inspire in their behavior
from active contours approaches. The tracking of objects is based on SURF
descriptors "Speed Up Robust Features". We used the DIMA platform and "API
Ateji PX" (an extension of the Java language to facilitate parallel programming
on heterogeneous architectures) to implement this algorithm. The experimental
results indicate that the proposed algorithm is more robust and faster than
previous approaches.
|
[
{
"version": "v1",
"created": "Thu, 1 Aug 2013 19:45:23 GMT"
}
] | 2013-08-02T00:00:00 |
[
[
"Chakroun",
"Mohamed",
""
],
[
"Wali",
"Ali",
""
],
[
"Alimi",
"Adel M.",
""
]
] |
new_dataset
| 0.996861 |
1211.1728
|
Han Mao Kiah
|
Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, and Jianxing
Yin
|
Maximum Distance Separable Codes for Symbol-Pair Read Channels
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study (symbol-pair) codes for symbol-pair read channels introduced
recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair
codes is established and infinite families of optimal symbol-pair codes are
constructed. These codes are maximum distance separable (MDS) in the sense that
they meet the Singleton-type bound. In contrast to classical codes, where all
known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair
codes can have length \Omega(q^2). In addition, we completely determine the
existence of MDS symbol-pair codes for certain parameters.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 23:39:26 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Jul 2013 11:00:33 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Ji",
"Lijun",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Wang",
"Chengmin",
""
],
[
"Yin",
"Jianxing",
""
]
] |
new_dataset
| 0.988185 |
1302.0971
|
Leon Abdillah
|
Leon Andretti Abdillah
|
Validasi data dengan menggunakan objek lookup pada borland delphi 7.0
|
16 pages
|
MATRIK. 7 (2005) 1-16
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developing an application with some tables must concern the validation of
input (specially in Table Child). In order to maximize the accuracy and data
input validation. Its called lookup (took data from other dataset). There are
two ways to look up data from Table Parent: 1) Using Objects (DBLookupComboBox
and DBookupListBox), or 2) Arranging the properties of data types fields (shown
by using DBGrid). In this article is using Borland Delphi software (Inprise
product). The method is offered using 5 (five) practise steps: 1) Relational
Database Scheme, 2) Form Design, 3) Object DatabasesRelationships Scheme, 4)
Properties and Field Type Arrangement, and 5) Procedures. The result of this
paper are: 1) The relationship that using lookup objects are valid, and 2)
Delphi Lookup Objects can be used for 1-1, 1-N, and M-N relationship.
|
[
{
"version": "v1",
"created": "Tue, 5 Feb 2013 09:32:54 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.992796 |
1302.5511
|
Leon Abdillah
|
Nuril Aini, Leon Andretti Abdillah, Jemakmun
|
Perangkat lunak bantu mengenal huruf arab melayu ke bentuk huruf latin
bahasa Indonesia
| null |
MATRIK. 8 (2006) 317-334
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development of computer science has contributed greatly for increasing of
efficiency and effectively. Many areas are covered by computer science,
included education. The purpose of this research is to introduce jawi a type of
Indonesian letters. Jawis letter is one of the most popular letter in the past.
But right now few people can read and understand it. Many documents in the past
was written in Jawi. The writer develop or build the software using Pressman
method, and tools such as Microsoft Visual Basic, and Microsoft Access. This
software can introduce Jawi then people can learn it easily.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 08:10:19 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Aini",
"Nuril",
""
],
[
"Abdillah",
"Leon Andretti",
""
],
[
"Jemakmun",
"",
""
]
] |
new_dataset
| 0.999488 |
1307.8179
|
Kester Quist-Aphetsi
|
Quist-Aphetsi Kester, Ajibade Ibrahim Kayode
|
Using SOA with Web Services for effective data integration of Enterprise
Pharmaceutical Information Systems
|
11 pages paper. Submitted paper. arXiv admin note: text overlap with
arXiv:1204.0179, arXiv:1307.7790 by other authors
|
International Journal of Advanced Research in Computer Science and
Software Engineering(IJARCSSE)Vol 3 Issue 6 pp1-8. 2013
| null | null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Medicines exist for combating illnesses and drug stores provide an outlet for
consumers to gain access to these drugs. However, due to various factors such
as cost of production, accessibility and legal issues as well as distribution
factors, availability of these drugs at any location cannot be guaranteed at
all times. There is need for individuals and organizations such as hospitals to
be able to locate required drugs within given geographical vicinity. This is of
immense importance especially during emergencies, travel, and in cases where
the drugs are uncommon. This research work is aimed at solving this problem by
designing a system that integrates all drugstores. The integration of the drug
stores will be based on SOA concepts with web services via a central service
bus. The database systems of the drug stores will be integrated via a service
bus such that drugs can easily be searched for and the results will be
displayed based on its availability. Drugs can easily be searched for within
geographically distributed pharmaceutical databases as well as consumption of
drugs with relation to geographical locations can easily be monitored and
tracked. This will make it easy for health institutions to research on drug
consumption patterns across geographical areas and also control their usage.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 00:47:44 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Kester",
"Quist-Aphetsi",
""
],
[
"Kayode",
"Ajibade Ibrahim",
""
]
] |
new_dataset
| 0.988803 |
1307.8207
|
EPTCS
|
Davide Ancona, Paola Giannini, Elena Zucca
|
Reconciling positional and nominal binding
|
In Proceedings ITRS 2012, arXiv:1307.7849
|
EPTCS 121, 2013, pp. 81-93
|
10.4204/EPTCS.121.6
| null |
cs.PL cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define an extension of the simply-typed lambda calculus where two
different binding mechanisms, by position and by name, nicely coexist. In the
former, as in standard lambda calculus, the matching between parameter and
argument is done on a positional basis, hence alpha-equivalence holds, whereas
in the latter it is done on a nominal basis. The two mechanisms also
respectively correspond to static binding, where the existence and type
compatibility of the argument are checked at compile-time, and dynamic binding,
where they are checked at run-time.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 03:24:46 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Ancona",
"Davide",
""
],
[
"Giannini",
"Paola",
""
],
[
"Zucca",
"Elena",
""
]
] |
new_dataset
| 0.986678 |
1307.8209
|
EPTCS
|
Assia Ben Shil (LIP2 Laboratory, Faculty of Sciences of Tunis,
Tunisia), Kaouther Blibech (LIP2 Laboratory, Faculty of Sciences of Tunis,
Tunisia), Riadh Robbana (LIP2 Laboratory, Faculty of Sciences of Tunis,
Tunisia), Wafa Neji (LIP2 Laboratory, Faculty of Sciences of Tunis, Tunisia)
|
A New PVSS Scheme with a Simple Encryption Function
|
In Proceedings SCSS 2012, arXiv:1307.8029. This PVSS scheme was
proposed to be used to provide a distributed Timestamping scheme
|
EPTCS 122, 2013, pp. 11-22
|
10.4204/EPTCS.122.2
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Publicly Verifiable Secret Sharing (PVSS) scheme allows anyone to verify
the validity of the shares computed and distributed by a dealer. The idea of
PVSS was introduced by Stadler in [18] where he presented a PVSS scheme based
on Discrete Logarithm. Later, several PVSS schemes were proposed. In [2],
Behnad and Eghlidos present an interesting PVSS scheme with explicit membership
and disputation processes. In this paper, we present a new PVSS having the
advantage of being simpler while offering the same features.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 03:28:18 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Shil",
"Assia Ben",
"",
"LIP2 Laboratory, Faculty of Sciences of Tunis,\n Tunisia"
],
[
"Blibech",
"Kaouther",
"",
"LIP2 Laboratory, Faculty of Sciences of Tunis,\n Tunisia"
],
[
"Robbana",
"Riadh",
"",
"LIP2 Laboratory, Faculty of Sciences of Tunis,\n Tunisia"
],
[
"Neji",
"Wafa",
"",
"LIP2 Laboratory, Faculty of Sciences of Tunis, Tunisia"
]
] |
new_dataset
| 0.999752 |
1307.8225
|
Rosy Madaan
|
Deepti Kapri, Rosy Madaan, A. K Sharma, Ashutosh Dixit
|
A Novel Architecture for Relevant Blog Page Identifcation
|
13 Pages. International Journal of Computer Engineering and
Applications, June 2013
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blogs are undoubtedly the richest source of information available in
cyberspace. Blogs can be of various natures i.e. personal blogs which contain
posts on mixed issues or blogs can be domain specific which contains posts on
particular topics, this is the reason, they offer wide variety of relevant
information which is often focused. A general search engine gives back a huge
collection of web pages which may or may not give correct answers, as web is
the repository of information of all kinds and a user has to go through various
documents before he gets what he was originally looking for, which is a very
time consuming process. So, the search can be made more focused and accurate if
it is limited to blogosphere instead of web pages. The reason being that the
blogs are more focused in terms of information. So, User will only get related
blogs in response to his query. These results will be then ranked according to
our proposed method and are finally presented in front of user in descending
order
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 05:40:59 GMT"
}
] | 2013-08-01T00:00:00 |
[
[
"Kapri",
"Deepti",
""
],
[
"Madaan",
"Rosy",
""
],
[
"Sharma",
"A. K",
""
],
[
"Dixit",
"Ashutosh",
""
]
] |
new_dataset
| 0.994553 |
1302.0337
|
Leon Abdillah
|
Leon Andretti Abdillah
|
Perancangan basisdata sistem informasi penggajian
|
18 pages
|
MATRIK. 8 (2006) 135-152
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this research is to design database scheme of information
system at XYZ University. By using database design methods (conceptual scheme,
logical scheme, & physical scheme) the writer designs payroll information
system. The physical scheme is compatible with Borland Delphi Database Engine
Scheme to support the implementation of the I.S. After 3 (three) steps we get 7
(seven) tables, dan 6 (six) forms. By using this shemce, the system can produce
several reports quickly, accurately, efficiently, and effectively.
|
[
{
"version": "v1",
"created": "Sat, 2 Feb 2013 03:36:37 GMT"
}
] | 2013-07-31T00:00:00 |
[
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.998938 |
1307.7786
|
Kester Quist-Aphetsi
|
Quist-Aphetsi Kester
|
A Hybrid Cryptosystem Based On Vigenere Cipher and Columnar
Transposition Cipher
|
7 pages. International Journal of Advanced Technology & Engineering
Research Volume 3 Issue 1 (IJATER), 2013
|
International Journal of Advanced Technology and Engineering
Research (IJATER) Vol 3 Issue 1 pp141-147. 2013
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Privacy is one of the key issues addressed by information Security. Through
cryptographic encryption methods, one can prevent a third party from
understanding transmitted raw data over unsecured channel during signal
transmission. The cryptographic methods for enhancing the security of digital
contents have gained high significance in the current era. Breach of security
and misuse of confidential information that has been intercepted by
unauthorized parties are key problems that information security tries to solve.
This paper sets out to contribute to the general body of knowledge in the area
of classical cryptography by develop- ing a new hybrid way of encryption of
plaintext. The cryptosystem performs its encryption by encrypting the plaintext
using columnar transposition cipher and further using the ciphertext to encrypt
the plaintext again using Vigen\`ere ci- pher. At the end, cryptanalysis was
performed on the ciphertext. The implementation will be done using java
program- ming.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 02:27:06 GMT"
}
] | 2013-07-31T00:00:00 |
[
[
"Kester",
"Quist-Aphetsi",
""
]
] |
new_dataset
| 0.997425 |
1307.7789
|
Kester Quist-Aphetsi
|
Quist-Aphetsi Kester
|
The Role of Rural Banks in Providing Mobile Money Services to Rural Poor
Communities: An effective integration approach of Rural Banks and existing
mobile communications infrastructure
|
10 pages. Accepted and presented at International Conference on
Mobile Money Uptake, by Ghana Technology University College (GTUC) in
partnership with the Institute for Money, Technology and Financial Inclusion
(IMTFI) USA, at Accra, Ghana, 2013, 2013; Int. Conf on Mobile Money
Uptake.2013
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The rapid spread of mobile phones means that the number of mobile users may
already exceed the number of banked people in many low income countries. Mobile
phones can also offer a communications channel for initiating and executing
on-line financial transactions. This channel may not only reduce the cost of
financial transactions for provider and customer, but also allow new entrants
to the financial sector, and new relationships to be formed for distributing
services. These changes hold the prospect of accelerating access to financial
services on the back of the mobile infrastructure. Mobile telephony offers
tremendous promise to facilitate the flow of money among rural and poor
families at much lower transaction costs, bringing the bank to those currently
unbanked. Realizing this promise will require close collaboration among all
stakeholders. But most rural banks do not have mobile banking services for
their customers. This made it difficult for the full potential and benefits of
mobile money financial services to be realized. Most telecommunication service
providers run mobile money service solely for their subscribers without an
integrated approach of incorporating and integrating rural banking systems into
their existing services this makes it difficult for a full fledge exploitation
of the mobile financial market. This paper looks at the existing mobile money
services and takes critical look at the positive advantages of effective
integration approach of Rural Banks and existing mobile communications
infrastructure as well as proposing a model for such integration.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 02:44:14 GMT"
}
] | 2013-07-31T00:00:00 |
[
[
"Kester",
"Quist-Aphetsi",
""
]
] |
new_dataset
| 0.996883 |
1307.7807
|
Li Zhu
|
Hongwei Wang, F. Richard Yu, Li Zhu, Tao Tang, and Bin Ning
|
Finite-State Markov Modeling of Tunnel Channels in Communication-based
Train Control (CBTC) Systems
|
6 pages, 4 figures, conference
| null | null | null |
cs.DM
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Communication-based train control (CBTC) is gradually adopted in urban rail
transit systems, as it can significantly enhance railway network efficiency,
safety and capacity. Since CBTC systems are mostly deployed in underground
tunnels and trains move in high speed, building a train-ground wireless
communication system for CBTC is a challenging task. Modeling the tunnel
channels is very important to design and evaluate the performance of CBTC
systems. Most of existing works on channel modeling do not consider the unique
characteristics in CBTC systems, such as high mobility speed, deterministic
moving direction, and accurate train location information. In this paper, we
develop a finite state Markov channel (FSMC) model for tunnel channels in CBTC
systems. The proposed FSMC model is based on real field CBTC channel
measurements obtained from a business operating subway line. Unlike most
existing channel models, which are not related to specific locations, the
proposed FSMC channel model takes train locations into account to have a more
accurate channel model. The distance between the transmitter and the receiver
is divided into intervals, and an FSMC model is applied in each interval. The
accuracy of the proposed FSMC model is illustrated by the simulation results
generated from the model and the real field measurement results.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 04:18:44 GMT"
}
] | 2013-07-31T00:00:00 |
[
[
"Wang",
"Hongwei",
""
],
[
"Yu",
"F. Richard",
""
],
[
"Zhu",
"Li",
""
],
[
"Tang",
"Tao",
""
],
[
"Ning",
"Bin",
""
]
] |
new_dataset
| 0.994454 |
1307.7814
|
Joseph Paul Cohen
|
Joseph Paul Cohen
|
Wireless Message Dissemination via Selective Relay over Bluetooth
(MDSRoB)
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents a wireless message dissemination method designed with no
need to trust other users. This method utilizes modern wireless adaptors
ability to broadcast device name and identification information. Using the
scanning features built into Bluetooth and Wifi, messages can be exchanged via
their device names. This paper outlines a method of interchanging multiple
messages to discoverable and nondiscoverable devices using a user defined
scanning interval method along with a response based system. By selectively
relaying messages each user is in control of their involvement in the ad-hoc
network.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 04:50:32 GMT"
}
] | 2013-07-31T00:00:00 |
[
[
"Cohen",
"Joseph Paul",
""
]
] |
new_dataset
| 0.997105 |
1307.7398
|
Benjamin Andres
|
Benjamin Andres, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub,
and David Rajaratnam
|
ROSoClingo: A ROS package for ASP-based robot control
| null | null | null | null |
cs.RO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knowledge representation and reasoning capacities are vital to cognitive
robotics because they provide higher level cognitive functions for reasoning
about actions, environments, goals, perception, etc. Although Answer Set
Programming (ASP) is well suited for modelling such functions, there was so far
no seamless way to use ASP in a robotic environment. We address this
shortcoming and show how a recently developed reactive ASP system can be
harnessed to provide appropriate reasoning capacities within a robotic system.
To be more precise, we furnish a package integrating the reactive ASP solver
oClingo with the popular open-source robotic middleware ROS. The resulting
system, ROSoClingo, provides a generic way by which an ASP program can be used
to control the behaviour of a robot and to respond to the results of the
robot's actions.
|
[
{
"version": "v1",
"created": "Sun, 28 Jul 2013 20:10:51 GMT"
}
] | 2013-07-30T00:00:00 |
[
[
"Andres",
"Benjamin",
""
],
[
"Obermeier",
"Philipp",
""
],
[
"Sabuncu",
"Orkunt",
""
],
[
"Schaub",
"Torsten",
""
],
[
"Rajaratnam",
"David",
""
]
] |
new_dataset
| 0.997267 |
1307.7447
|
Zhiyong Chen
|
Zhiyong Chen, Biao Wang, Bin Xia and Hui Liu
|
Wireless Information and Power Transfer in Two-Way Amplify-and-Forward
Relaying Channels
|
Submitted to ICC 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The various wireless networks have made the ambient radio frequency signals
around the world. Wireless information and power transfer enables the devices
to recycle energy from these ambient radio frequency signals and process
information simultaneously. In this paper, we develop a wireless information
and power transfer protocol in two-way amplify-and-forward relaying channels,
where two sources exchange information via an energy harvesting relay node. The
relay node collects energy from the received signals and uses it to provide the
transmission power to forward the received signals. We analytically derive the
exact expressions of the outage probability, the ergodic capacity and the
finite-SNR diversity-multiplexing trade-off (DMT). Furthermore, the tight
closed-form upper and lower bounds of the outage probability and the ergodic
capacity are then developed. Moreover, the impact of the power splitting ratio
is also evaluated and analyzed. Finally, we show that compared to the
non-cooperative relaying scheme, the proposed protocol is a green solution to
offer higher transmission rate and more reliable communication without
consuming additional resource.
|
[
{
"version": "v1",
"created": "Mon, 29 Jul 2013 02:26:15 GMT"
}
] | 2013-07-30T00:00:00 |
[
[
"Chen",
"Zhiyong",
""
],
[
"Wang",
"Biao",
""
],
[
"Xia",
"Bin",
""
],
[
"Liu",
"Hui",
""
]
] |
new_dataset
| 0.995867 |
1307.7563
|
Preetha Theresa Joy
|
Preetha Theresa Joy and K. Poulose Jacob
|
Cooperative Caching Framework for Mobile Cloud Computing
| null |
Global Journal of Computer Science and Technology, Volume 13 Issue
8 Version 1.0 Year 2013 Network, Web & Security Volume 13 Issue 8 Version 1.0
Year 2013
| null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the advancement in mobile devices and wireless networks mobile cloud
computing, which combines mobile computing and cloud computing has gained
momentum since 2009. The characteristics of mobile devices and wireless network
makes the implementation of mobile cloud computing more complicated than for
fixed clouds. This section lists some of the major issues in Mobile Cloud
Computing. One of the key issues in mobile cloud computing is the end to end
delay in servicing a request. Data caching is o ne of the techniques widely
used in wired and wireless networks to improve data access efficiency. In this
paper we explore the possibility of a cooperative caching approach to enhance
data access efficiency in mobile cloud computing. The proposed approach is
based on cloudlets, one of the architecture designed for mobile cloud
computing.
|
[
{
"version": "v1",
"created": "Mon, 29 Jul 2013 12:57:54 GMT"
}
] | 2013-07-30T00:00:00 |
[
[
"Joy",
"Preetha Theresa",
""
],
[
"Jacob",
"K. Poulose",
""
]
] |
new_dataset
| 0.992313 |
1307.7597
|
Dmitry Namiot
|
Dmitry Namiot, Manfred Sneps-Sneppe, Oleg Skokov
|
Context-aware QR-codes
|
6 pages
| null | null | null |
cs.IT cs.CY cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a new model for presenting local information based on
the network proximity. We present a novelty mobile mashup which combines Wi-Fi
proximity measurements with QR-codes. Our mobile mashup automatically adds
context information the content presented by QR-codes. It simplifies the
deployment schemes and allows to use unified presentation for all data points,
for example. This paper describes how to combine QR-codes and network proximity
information.
|
[
{
"version": "v1",
"created": "Fri, 5 Jul 2013 19:37:27 GMT"
}
] | 2013-07-30T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
],
[
"Skokov",
"Oleg",
""
]
] |
new_dataset
| 0.997823 |
1307.3696
|
Daniel Genin
|
Daniel Genin and Jolene Splett
|
Where in the Internet is congestion?
| null | null | null | null |
cs.NI cs.SI
|
http://creativecommons.org/licenses/publicdomain/
|
Understanding the distribution of congestion in the Internet is a
long-standing problem. Using data from the SamKnows US broadband access network
measurement study, commissioned by the FCC, we explore patterns of congestion
distribution in DSL and cable Internet service provider (ISP) networks. Using
correlation-based analysis we estimate prevalence of congestion in the
periphery versus the core of ISP networks. We show that there are significant
differences in congestion levels and its distribution between DSL and cable ISP
networks and identify bottleneck sections in each type of network.
|
[
{
"version": "v1",
"created": "Sun, 14 Jul 2013 04:06:46 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Jul 2013 01:27:04 GMT"
}
] | 2013-07-29T00:00:00 |
[
[
"Genin",
"Daniel",
""
],
[
"Splett",
"Jolene",
""
]
] |
new_dataset
| 0.984707 |
1307.6975
|
K.S.Kuppusamy
|
K.S. Kuppusamy, Leena Mary Francis, G. Aghila
|
LogMin: A Model For Call Log Mining In Mobile Devices
|
12 Pages, 5 Figures
|
International Journal in Foundations of Computer Science &
Technology (IJFCST), Vol. 3, No.4, July 2013
|
10.5121/ijfcst.2013.3405
|
1839-7662
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In today's instant communication era, mobile phones play an important role in
the efficient communication with respect to both individual and official
communication strata. With the drastic explosion in the quantity of calls
received and made, there is a need for analyses of patterns in these call logs
to assist the user of the mobile device in the optimal utilization. This paper
proposes a model termed "LogMin" (Log Mining of Calls in Mobile devices) which
is aimed towards mining of call log in mobile phones to discover patterns and
keep the user informed about the trends in the log. The logging of calls would
facilitate the user to get an insight into patterns based on the six different
parameters identified by the proposed LogMin model. The proposed model is
validated with a prototype implementation in the Android platform and various
experiments were conducted on it. The results of the experiments in the LogMin
Android implementation validate the efficiency of the proposed model with
respect to user's relevancy metric which is computed as 96.52%.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 09:42:37 GMT"
}
] | 2013-07-29T00:00:00 |
[
[
"Kuppusamy",
"K. S.",
""
],
[
"Francis",
"Leena Mary",
""
],
[
"Aghila",
"G.",
""
]
] |
new_dataset
| 0.982093 |
1306.1332
|
Ferdous Barbhuiya Ahmed
|
Ferdous A Barbhuiya, Santosh Biswas, Sukumar Nandi
|
An Active Host-Based Intrusion Detection System for ARP-Related Attacks
and its Verification
|
International Journal of Network Security & Its Applications (IJNSA),
Vol.3, No.3, May 2011
|
Journal of Information Assurance and Security. ISSN 1554-1010
Volume 7 (2012) pp. 284-295
|
10.5121/ijnsa.2011.3311
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spoofing with falsified IP-MAC pair is the first step in most of the LAN
based-attacks. Address Resolution Protocol (ARP) is stateless, which is the
main cause that makes spoofing possible. Several network level and host level
mechanisms have been proposed to detect and mitigate ARP spoofing but each of
them has their own drawback. In this paper we propose a Host-based Intrusion
Detection system for LAN attacks, which works without any extra constraint like
static IP-MAC, modifying ARP etc. The proposed scheme is verified under all
possible attack scenarios. The scheme is successfully validated in a test bed
with various attack scenarios and the results show the effectiveness of the
proposed technique.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 08:11:25 GMT"
}
] | 2013-07-26T00:00:00 |
[
[
"Barbhuiya",
"Ferdous A",
""
],
[
"Biswas",
"Santosh",
""
],
[
"Nandi",
"Sukumar",
""
]
] |
new_dataset
| 0.991335 |
1307.6343
|
Qixin Wang
|
Jun Zhang, Xia Liu
|
The wireless router based on the linux system
|
5 pages, 4 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the expansion of computer networks,the mobile terminal with wireless
access capability experience a sharp increase in the number of wireless
routers, especially low cost wireless routers are becoming very important
network equipment. This paper designs a wireless router based on the ARM
platform, the Linux system. First, there is a research and analysis on the
working principle and implementation of Network Address Translation (NAT)
technology. Then I study the IPTABLES components under the Linux system and use
it when processing data packets which go into the chain and the table and
finally using laptop with Ethernet card and the WIFI card to build the Linux
operating system. Related routing forwarding rules are defined between the two
cards and use IPTABLES to achieve a laptop as a wireless WIFI hotspot providing
routing and network connections to other computer services. It proves this
paper's design, and production feasibility. The paper also discusses the design
and production method of the wireless router with ARM board feasibility.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 09:23:33 GMT"
}
] | 2013-07-25T00:00:00 |
[
[
"Zhang",
"Jun",
""
],
[
"Liu",
"Xia",
""
]
] |
new_dataset
| 0.991683 |
1307.6369
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on reducing number of keys on a Computer Keyboard -- A TRIZ
based analysis
|
8 pages
| null |
10.2139/ssrn.931458
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A computer keyboard consists of several sections and each section consists of
several numbers of keys. The text entry section contains the standard character
keys, navigation section contains cursor movement and page control keys,
numeric keypad contains numeric keys and function keys section contain function
keys and special keys. Although the increased number of keys helps smooth
interaction with a computer there are situations where it is necessary to
reduce the number of keys.
The need for reducing number of keys in a keyboard creates a technical
contradiction. Generally more number of keys can support more number of
functions and less number of keys can support less number of functions. We need
more number of functions (all the functions available in a full size keyboard),
but we want only less number of keys (Contradiction). This contradiction has
been solved by using multi-stroke mechanism.
There may be different purposes to reduce the number of keys in a keyboard.
Some of them intend to reduce the size of the keyboard while some others intend
to increase the speed of typing. But all of these inventions use multi-stroke
mechanism to generate more number of signals from less number of keys.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 10:13:34 GMT"
}
] | 2013-07-25T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.994632 |
1307.6372
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on Soft Keyboards -- A TRIZ Based Analysis
|
7 pages. TRIZsite Journal, February 2005
| null |
10.2139/ssrn.931461
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The soft keyboards are onscreen representation of physical keyboard having
alphanumeric characters and other controls. The user operates the soft keyboard
with the mouse, a stylus or other pointing device. The soft keys dont have any
mechanical component.
The soft keyboards are used in many public places for informational purpose,
educational systems and financial transactional systems. A soft keyboard is
convenient in some cases where a hard keyboard is difficult to manage. The soft
keyboard is a substitute of a physical keyboard and is displayed on the screen.
It displays the same type of alphanumeric and control keys like the keys on the
actual keyboard.
There are many inventions on a soft keyboard which makes the soft keyboard
more efficient and effective. This article illustrates some inventions on soft
keyboards from US patent database.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 10:35:03 GMT"
}
] | 2013-07-25T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999682 |
1307.6378
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on Keyboard Illumination - A TRIZ Based Analysis
|
8 pages
| null |
10.2139/ssrn.931466
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional computers are not usable in dark, as the user cannot see the
keyboard to operate properly. But there are many situations where the user may
like to work on his computer under low light conditions, such as, during
nights, while traveling in flights/ trains having low lights, working in the
garden during evening etc. So it is necessary to provide some light to the
laptop to operate the keyboard under low light situations.
Luminescence of the keyboard is a desirable feature for portable computers.
There may be several methods to illuminate the keyboard, the most crude may be
carrying an external light and fixing at a point where it can light the
keyboard. But solutions like this are not very convenient. The inventors have
been looking for better solutions. This article analyses 6 patents on keyboard
illumination.
A good illumination system do not consume more battery, do not increase the
size and weight of the laptop, do not increase heat inside the laptop box, and
do not cost much to manufacture. The light should uniformly illuminate the
whole keyboard and should not throw light on other areas that are not required.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 10:55:59 GMT"
}
] | 2013-07-25T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999308 |
1307.6462
|
Travis Gagie
|
Hector Ferrada, Travis Gagie, Tommi Hirvola, Simon J. Puglisi
|
AliBI: An Alignment-Based Index for Genomic Datasets
| null | null | null | null |
cs.DS cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With current hardware and software, a standard computer can now hold in RAM
an index for approximate pattern matching on about half a dozen human genomes.
Sequencing technologies have improved so quickly, however, that scientists will
soon demand indexes for thousands of genomes. Whereas most researchers who have
addressed this problem have proposed completely new kinds of indexes, we
recently described a simple technique that scales standard indexes to work on
more genomes. Our main idea was to filter the dataset with LZ77, build a
standard index for the filtered file, and then create a hybrid of that standard
index and an LZ77-based index. In this paper we describe how to our technique
to use alignments instead of LZ77, in order to simplify and speed up both
preprocessing and random access.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 15:42:23 GMT"
}
] | 2013-07-25T00:00:00 |
[
[
"Ferrada",
"Hector",
""
],
[
"Gagie",
"Travis",
""
],
[
"Hirvola",
"Tommi",
""
],
[
"Puglisi",
"Simon J.",
""
]
] |
new_dataset
| 0.988492 |
1212.4913
|
Sadeque Khan
|
Sadeque Reza Khan, Siddique Reza Khan and Arifa Ferdousi
|
Voltage Temperature Monitoring System (VTMS) for a BTS Room
| null |
International Journal of Instrumentation and Control Systems
(IJICS), Volume: 02, Number:04, page: 01-10, ISSN: 2249 - 1147, year:2012
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although Cellular communication is getting more and more popular in our
country present days, but its network improvement is hampered by the crysis of
electricity. The recent decision of present Government is that they will not
provide any electricity from the grid to any new BTS rooms of any Celluler
operator companies like Grammen Phone, Robi, Airtel etc. These companies have
to develop their own power stations either by using generators or by developing
solar plants. Now a days most of the BTS rooms, that the cellular operators are
installing with a generator and 48 volt battery backup. So for the
synchronisation of the operation of PDB, Generator and battery, they require a
device called Voltage Temperature Monitoring System or VTMS. It is a
Microcontroller based controlling unit which controlls the operation of
generator and battery when PDB in not available in the BTS room.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 03:42:14 GMT"
}
] | 2013-07-24T00:00:00 |
[
[
"Khan",
"Sadeque Reza",
""
],
[
"Khan",
"Siddique Reza",
""
],
[
"Ferdousi",
"Arifa",
""
]
] |
new_dataset
| 0.998198 |
1303.7032
|
Zhe Yao
|
Zhe Yao, Vincent Gripon and Michael G. Rabbat
|
A Massively Parallel Associative Memory Based on Sparse Neural Networks
| null | null | null | null |
cs.AI cs.DC cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Associative memories store content in such a way that the content can be
later retrieved by presenting the memory with a small portion of the content,
rather than presenting the memory with an address as in more traditional
memories. Associative memories are used as building blocks for algorithms
within database engines, anomaly detection systems, compression algorithms, and
face recognition systems. A classical example of an associative memory is the
Hopfield neural network. Recently, Gripon and Berrou have introduced an
alternative construction which builds on ideas from the theory of error
correcting codes and which greatly outperforms the Hopfield network in
capacity, diversity, and efficiency. In this paper we implement a variation of
the Gripon-Berrou associative memory on a general purpose graphical processing
unit (GPU). The work of Gripon and Berrou proposes two retrieval rules,
sum-of-sum and sum-of-max. The sum-of-sum rule uses only matrix-vector
multiplication and is easily implemented on the GPU. The sum-of-max rule is
much less straightforward to implement because it involves non-linear
operations. However, the sum-of-max rule gives significantly better retrieval
error rates. We propose a hybrid rule tailored for implementation on a GPU
which achieves a 880-fold speedup without sacrificing any accuracy.
|
[
{
"version": "v1",
"created": "Thu, 28 Mar 2013 03:49:57 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Jul 2013 14:29:21 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Yao",
"Zhe",
""
],
[
"Gripon",
"Vincent",
""
],
[
"Rabbat",
"Michael G.",
""
]
] |
new_dataset
| 0.954589 |
1307.5420
|
Umakant Mishra
|
Umakant Mishra
|
How do Viruses Attack Anti-Virus Programs
|
8 pages
|
Umakant Mishra, "How do Viruses Attack Anti-virus Programs",
TRIZsite Journal, June 2012,
http://trizsite.tk/trizsite/articles/default.asp?month=Jun&year=2012
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the anti-viruses run in a trusted kernel level any loophole in the
anti-virus program can enable attackers to take full control over the computer
system and steal data or do serious damages. Hence the anti-virus engines must
be developed with proper security in mind. The ant-virus should be able to any
type of specially created executable files, compression packages or documents
that are intentionally created to exploit the anti-virus weakness.
Viruses are present in almost every system even though there are anti-viruses
installed. This is because every anti-virus, however good it may be, leads to
some extent of false positives and false negatives. Our faith on the anti-virus
system often makes us more careless about hygienic habits which increases the
possibility of infection. It is necessary for an anti-virus to detect and
destroy the malware before its own files are detected and destroyed by the
malware.
|
[
{
"version": "v1",
"created": "Sat, 20 Jul 2013 12:54:58 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999366 |
1307.5423
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on Keyboard key layout: A TRIZ based analysis
|
TRIZsite Journal, January 2005 (also available at SSRN,
http://papers.ssrn.com/abstract=931227)
| null |
10.2139/ssrn.931227
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The standard QWERTY keyboard was developed in the late 1800s for the
typewriters. As people were acquainted with that the same layout was retained
for the computer keyboards. Many people feel that the QWERTY layout is not very
efficient layout and there have been many inventions on different layouts of
character keys.
In order to improve the key arrangement, two major issues should be
addressed. (i) The improved key arrangement should offer significantly improved
productivity. (ii) The training time for learning the improved key arrangement
should be minimized.
This article analyzes 10 inventions from US patent database each of which
have proposed a new layout giving us some specific advantage. The inventions
try to achieve one or more of the following advantages, viz., to reduce finger
movements during typing, to achieve speed in data entry, to reduce errors in
typing, making keyboard easy to learn, making easy for children to find keys,
reduce stress in hands and finger and suitability for special purpose
computers.
|
[
{
"version": "v1",
"created": "Sat, 20 Jul 2013 13:29:33 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.985821 |
1307.5431
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on keyboard attachments-A TRIZ based analysis
|
Umakant Mishra, 10 Inventions on Keyboard attachments: A TRIZ based
analysis, TRIZsite Journal, January 2005, (Also available at SSRN
http://papers.ssrn.com/abstract=931232)
| null |
10.2139/ssrn.931232
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although the primary objective of the keyboard to input data into the
computer, the advanced keyboards keep various other things in mind, such as,
how to use the same keyboard for various other purposes, or how to use the same
keyboard efficiently by using various other attachments to the keyboard. This
objective led to various inventions on keyboard attachments, some of which are
illustrated below in this article.
This article illustrates 10 inventions on various keyboard attachments from
US patent database. Each different attachment improves the usability of the
keyboard in some way or other. Some attachments illustrated are template
holders, paper holders, pointing device attachments, mouse pad attachments,
wrist rest attachments, storage device attachments, and multimedia attachments.
|
[
{
"version": "v1",
"created": "Sat, 20 Jul 2013 14:29:14 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.993114 |
1307.5547
|
Ross M. McConnell
|
Ross M. McConnell and Yahav Nussbaum
|
Linear-Time Recognition of Probe Interval Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The interval graph for a set of intervals on a line consists of one vertex
for each interval, and an edge for each intersecting pair of intervals. A probe
interval graph is a variant that is motivated by an application to genomics,
where the intervals are partitioned into two sets: probes and non-probes. The
graph has an edge between two vertices if they intersect and at least one of
them is a probe. We give a linear-time algorithm for determining whether a
given graph and partition of vertices into probes and non-probes is a probe
interval graph. If it is, we give a layout of intervals that proves this. We
can also determine whether the layout of the intervals is uniquely constrained
within the same time bound. As part of the algorithm, we solve the
consecutive-ones probe matrix problem in linear time, develop algorithms for
operating on PQ trees, and give results that relate PQ trees for different
submatrices of a consecutive-ones matrix.
|
[
{
"version": "v1",
"created": "Sun, 21 Jul 2013 17:16:50 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"McConnell",
"Ross M.",
""
],
[
"Nussbaum",
"Yahav",
""
]
] |
new_dataset
| 0.999188 |
1307.5619
|
Uri Abraham
|
Uri Abraham, Gal Amram
|
On the Mailbox Problem
| null | null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by/3.0/
|
The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport
in their 2010 DC paper with an algorithm that uses two flag registers that
carry 14 values each. An interesting problem that they ask is whether there is
a mailbox algorithm with smaller flag values. We give a positive answer by
describing a mailbox algorithm with 6 and 4 values in the two flag registers.
|
[
{
"version": "v1",
"created": "Mon, 22 Jul 2013 08:27:31 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Abraham",
"Uri",
""
],
[
"Amram",
"Gal",
""
]
] |
new_dataset
| 0.999362 |
1307.5710
|
Lucas Paletta
|
Jan T\"unnermann, Dieter Enns, and B\"arbel Mertsching
|
Saliency-Guided Perceptual Grouping Using Motion Cues in Region-Based
Artificial Visual Attention
| null | null | null |
ISACS/2013/05
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Region-based artificial attention constitutes a framework for bio-inspired
attentional processes on an intermediate abstraction level for the use in
computer vision and mobile robotics. Segmentation algorithms produce regions of
coherently colored pixels. These serve as proto-objects on which the
attentional processes determine image portions of relevance. A single
region---which not necessarily represents a full object---constitutes the focus
of attention. For many post-attentional tasks, however, such as identifying or
tracking objects, single segments are not sufficient. Here, we present a
saliency-guided approach that groups regions that potentially belong to the
same object based on proximity and similarity of motion. We compare our results
to object selection by thresholding saliency maps and a further
attention-guided strategy.
|
[
{
"version": "v1",
"created": "Mon, 22 Jul 2013 13:48:13 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Tünnermann",
"Jan",
""
],
[
"Enns",
"Dieter",
""
],
[
"Mertsching",
"Bärbel",
""
]
] |
new_dataset
| 0.999358 |
1307.5748
|
Riccardo Satta
|
Riccardo Satta
|
Appearance Descriptors for Person Re-identification: a Comprehensive
Review
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In video-surveillance, person re-identification is the task of recognising
whether an individual has already been observed over a network of cameras.
Typically, this is achieved by exploiting the clothing appearance, as classical
biometric traits like the face are impractical in real-world video surveillance
scenarios. Clothing appearance is represented by means of low-level
\textit{local} and/or \textit{global} features of the image, usually extracted
according to some part-based body model to treat different body parts (e.g.
torso and legs) independently. This paper provides a comprehensive review of
current approaches to build appearance descriptors for person
re-identification. The most relevant techniques are described in detail, and
categorised according to the body models and features used. The aim of this
work is to provide a structured body of knowledge and a starting point for
researchers willing to conduct novel investigations on this challenging topic.
|
[
{
"version": "v1",
"created": "Mon, 22 Jul 2013 15:41:57 GMT"
}
] | 2013-07-23T00:00:00 |
[
[
"Satta",
"Riccardo",
""
]
] |
new_dataset
| 0.978673 |
1307.5260
|
Abdelhakim Herrouz
|
Abdelhakim Herrouz, Chabane Khentout and Mahieddine Djoudi
|
Navigation Assistance and Web Accessibility Helper
|
07 pages. arXiv admin note: substantial text overlap with
arXiv:1304.2610
|
Herrouz, A., Khentout, C., Djoudi, M. Navigation Assistance and
Web Accessibility Helper. IJAIEM International Journal of Application or
Innovation in Engineering & Management, Vol.2, Issue 5, May 2013, pp.
517-523, 2013
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web accessibility is actually the most important aspect for providing access
to information and interaction for people with disabilities. However, it seems
that the ability of users with disabilities to navigate over the Web is not
dependent on the graphical complexity, but on the markup used to create the
structure of the website. Consequently, it is necessary to design some software
assistants to help all users to mark themselves in space during a navigation
session. In this paper, we propose an assistant for browsing on the Internet to
allow user to get one s bearings within Web navigation. We describe our
approach which puts at the disposal of the user a visited site map, thus giving
an explicit representation of virtual space. Different levels of visualization
are implemented in order to make the map more visible and less overloaded.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 20:04:58 GMT"
}
] | 2013-07-22T00:00:00 |
[
[
"Herrouz",
"Abdelhakim",
""
],
[
"Khentout",
"Chabane",
""
],
[
"Djoudi",
"Mahieddine",
""
]
] |
new_dataset
| 0.996718 |
1109.2152
|
G. Gottlob
|
G. Gottlob, G. Greco, F. Scarcello
|
Pure Nash Equilibria: Hard and Easy Games
| null |
Journal Of Artificial Intelligence Research, Volume 24, pages
357-406, 2005
|
10.1613/jair.1683
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate complexity issues related to pure Nash equilibria of strategic
games. We show that, even in very restrictive settings, determining whether a
game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has
a strong Nash equilibrium is SigmaP2-complete. We then study practically
relevant restrictions that lower the complexity. In particular, we are
interested in quantitative and qualitative restrictions of the way each players
payoff depends on moves of other players. We say that a game has small
neighborhood if the utility function for each player depends only on (the
actions of) a logarithmically small number of other players. The dependency
structure of a game G can be expressed by a graph DG(G) or by a hypergraph
H(G). By relating Nash equilibrium problems to constraint satisfaction problems
(CSPs), we show that if G has small neighborhood and if H(G) has bounded
hypertree width (or if DG(G) has bounded treewidth), then finding pure Nash and
Pareto equilibria is feasible in polynomial time. If the game is graphical,
then these problems are LOGCFL-complete and thus in the class NC2 of highly
parallelizable problems.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2011 20:42:30 GMT"
}
] | 2013-07-19T00:00:00 |
[
[
"Gottlob",
"G.",
""
],
[
"Greco",
"G.",
""
],
[
"Scarcello",
"F.",
""
]
] |
new_dataset
| 0.996763 |
1207.2615
|
Florian B\"aurle
|
Hannah Bast, Florian B\"aurle, Bj\"orn Buchhold, Elmar Haussmann
|
Broccoli: Semantic Full-Text Search at your Fingertips
|
10 pages, 3 figures, 4 tables
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Broccoli, a fast and easy-to-use search engine for what we call
semantic full-text search. Semantic full-text search combines the capabilities
of standard full-text search and ontology search. The search operates on four
kinds of objects: ordinary words (e.g., edible), classes (e.g., plants),
instances (e.g., Broccoli), and relations (e.g., occurs-with or native-to).
Queries are trees, where nodes are arbitrary bags of these objects, and arcs
are relations. The user interface guides the user in incrementally constructing
such trees by instant (search-as-you-type) suggestions of words, classes,
instances, or relations that lead to good hits. Both standard full-text search
and pure ontology search are included as special cases. In this paper, we
describe the query language of Broccoli, the main idea behind a new kind of
index that enables fast processing of queries from that language as well as
fast query suggestion, the natural language processing required, and the user
interface. We evaluated query times and result quality on the full version of
the English Wikipedia (40 GB XML dump) combined with the YAGO ontology (26
million facts). We have implemented a fully functional prototype based on our
ideas and provide a web application to reproduce our quality experiments. Both
are accessible via http://broccoli.informatik.uni-freiburg.de/repro-corr/ .
|
[
{
"version": "v1",
"created": "Wed, 11 Jul 2012 12:29:35 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Sep 2012 16:00:43 GMT"
},
{
"version": "v3",
"created": "Thu, 18 Jul 2013 14:49:52 GMT"
}
] | 2013-07-19T00:00:00 |
[
[
"Bast",
"Hannah",
""
],
[
"Bäurle",
"Florian",
""
],
[
"Buchhold",
"Björn",
""
],
[
"Haussmann",
"Elmar",
""
]
] |
new_dataset
| 0.999457 |
1307.4952
|
Neha Gupta
|
Sudip Mittal, Neha Gupta, Prateek Dewan, Ponnurangam Kumaraguru
|
The Pin-Bang Theory: Discovering The Pinterest World
|
15 pages, 10 figures, 5 tables
| null | null | null |
cs.SI cs.SY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pinterest is an image-based online social network, which was launched in the
year 2010 and has gained a lot of traction, ever since. Within 3 years,
Pinterest has attained 48.7 million unique users. This stupendous growth makes
it interesting to study Pinterest, and gives rise to multiple questions about
it's users, and content. We characterized Pinterest on the basis of large scale
crawls of 3.3 million user profiles, and 58.8 million pins. In particular, we
explored various attributes of users, pins, boards, pin sources, and user
locations, in detail and performed topical analysis of user generated textual
content. The characterization revealed most prominent topics among users and
pins, top image sources, and geographical distribution of users on Pinterest.
We then investigated this social network from a privacy and security
standpoint, and found traces of malware in the form of pin sources. Instances
of Personally Identifiable Information (PII) leakage were also discovered in
the form of phone numbers, BBM (Blackberry Messenger) pins, and email
addresses. Further, our analysis demonstrated how Pinterest is a potential
venue for copyright infringement, by showing that almost half of the images
shared on Pinterest go uncredited. To the best of our knowledge, this is the
first attempt to characterize Pinterest at such a large scale.
|
[
{
"version": "v1",
"created": "Thu, 18 Jul 2013 14:14:55 GMT"
}
] | 2013-07-19T00:00:00 |
[
[
"Mittal",
"Sudip",
""
],
[
"Gupta",
"Neha",
""
],
[
"Dewan",
"Prateek",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.989487 |
1307.4046
|
Marcin Nagy MN
|
Marcin Nagy, N. Asokan, and Joerg Ott
|
PeerShare: A System Secure Distribution of Sensitive Data Among Social
Contacts
|
Technical report of the PeerShare system
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design and implementation of the PeerShare, a system that can
be used by applications to securely distribute sensitive data to social
contacts of a user. PeerShare incorporates a generic framework that allows
different applications to distribute data with different security requirements.
By using interfaces available from existing popular social networks. PeerShare
is designed to be easy to use for both end users as well as developers of
applications. PeerShare can be used to distribute shared keys, public keys and
any other data that need to be distributed with authenticity and
confidentiality guarantees to an authorized set of recipients, specified in
terms of social relationships. We have used \peershare already in three
different applications and plan to make it available for developers.
|
[
{
"version": "v1",
"created": "Mon, 15 Jul 2013 18:34:34 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Jul 2013 15:58:55 GMT"
}
] | 2013-07-18T00:00:00 |
[
[
"Nagy",
"Marcin",
""
],
[
"Asokan",
"N.",
""
],
[
"Ott",
"Joerg",
""
]
] |
new_dataset
| 0.989535 |
1307.4465
|
EPTCS
|
Maciej Gazda, Tim A.C. Willemse
|
Zielonka's Recursive Algorithm: dull, weak and solitaire games and
tighter bounds
|
In Proceedings GandALF 2013, arXiv:1307.4162
|
EPTCS 119, 2013, pp. 7-20
|
10.4204/EPTCS.119.4
| null |
cs.LO cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dull, weak and nested solitaire games are important classes of parity games,
capturing, among others, alternation-free mu-calculus and ECTL* model checking
problems. These classes can be solved in polynomial time using dedicated
algorithms. We investigate the complexity of Zielonka's Recursive algorithm for
solving these special games, showing that the algorithm runs in O(d (n + m)) on
weak games, and, somewhat surprisingly, that it requires exponential time to
solve dull games and (nested) solitaire games. For the latter classes, we
provide a family of games G, allowing us to establish a lower bound of 2^(n/3).
We show that an optimisation of Zielonka's algorithm permits solving games from
all three classes in polynomial time. Moreover, we show that there is a family
of (non-special) games M that permits us to establish a lower bound of 2^(n/3),
improving on the previous lower bound for the algorithm.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 01:41:13 GMT"
}
] | 2013-07-18T00:00:00 |
[
[
"Gazda",
"Maciej",
""
],
[
"Willemse",
"Tim A. C.",
""
]
] |
new_dataset
| 0.968411 |
1307.4466
|
EPTCS
|
Michael Huth (Imperial College London), Jim Huan-Pu Kuo (Imperial
College London), Nir Piterman (University of Leicester)
|
The Rabin index of parity games
|
In Proceedings GandALF 2013, arXiv:1307.4162
|
EPTCS 119, 2013, pp. 35-49
|
10.4204/EPTCS.119.6
| null |
cs.GT cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the descriptive complexity of parity games by taking into account
the coloring of their game graphs whilst ignoring their ownership structure.
Colored game graphs are identified if they determine the same winning regions
and strategies, for all ownership structures of nodes. The Rabin index of a
parity game is the minimum of the maximal color taken over all equivalent
coloring functions. We show that deciding whether the Rabin index is at least k
is in PTIME for k=1 but NP-hard for all fixed k > 1. We present an EXPTIME
algorithm that computes the Rabin index by simplifying its input coloring
function. When replacing simple cycle with cycle detection in that algorithm,
its output over-approximates the Rabin index in polynomial time. Experimental
results show that this approximation yields good values in practice.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 01:41:27 GMT"
}
] | 2013-07-18T00:00:00 |
[
[
"Huth",
"Michael",
"",
"Imperial College London"
],
[
"Kuo",
"Jim Huan-Pu",
"",
"Imperial\n College London"
],
[
"Piterman",
"Nir",
"",
"University of Leicester"
]
] |
new_dataset
| 0.991799 |
1307.4468
|
EPTCS
|
Mark Reynolds (The University of Western Australia)
|
A Faster Tableau for CTL*
|
In Proceedings GandALF 2013, arXiv:1307.4162
|
EPTCS 119, 2013, pp. 50-63
|
10.4204/EPTCS.119.7
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There have been several recent suggestions for tableau systems for deciding
satisfiability in the practically important branching time temporal logic known
as CTL*. In this paper we present a streamlined and more traditional tableau
approach built upon the author's earlier theoretical work.
Soundness and completeness results are proved. A prototype implementation
demonstrates the significantly improved performance of the new approach on a
range of test formulas. We also see that it compares favourably to state of the
art, game and automata based decision procedures.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 01:41:36 GMT"
}
] | 2013-07-18T00:00:00 |
[
[
"Reynolds",
"Mark",
"",
"The University of Western Australia"
]
] |
new_dataset
| 0.997441 |
1009.5249
|
Bin Jiang
|
Xintao Liu and Bin Jiang
|
Defining and Generating Axial Lines from Street Center Lines for better
Understanding of Urban Morphologies
|
10 pages, 7 figures, and 2 tables, one figure added + minor revision
|
International Journal of Geographical Information Science, 26(8),
2012, 1521-1532
| null | null |
cs.CV physics.data-an
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Axial lines are defined as the longest visibility lines for representing
individual linear spaces in urban environments. The least number of axial lines
that cover the free space of an urban environment or the space between
buildings constitute what is often called an axial map. This is a fundamental
tool in space syntax, a theory developed by Bill Hillier and his colleagues for
characterizing the underlying urban morphologies. For a long time, generating
axial lines with help of some graphic software has been a tedious manual
process that is criticized for being time consuming, subjective, or even
arbitrary. In this paper, we redefine axial lines as the least number of
individual straight line segments mutually intersected along natural streets
that are generated from street center lines using the Gestalt principle of good
continuity. Based on this new definition, we develop an automatic solution to
generating the newly defined axial lines from street center lines. We apply
this solution to six typical street networks (three from North America and
three from Europe), and generate a new set of axial lines for analyzing the
urban morphologies. Through a comparison study between the new axial lines and
the conventional or old axial lines, and between the new axial lines and
natural streets, we demonstrate with empirical evidence that the newly defined
axial lines are a better alternative in capturing the underlying urban
structure.
Keywords: Space syntax, street networks, topological analysis, traffic,
head/tail division rule
|
[
{
"version": "v1",
"created": "Mon, 27 Sep 2010 13:17:40 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2011 04:03:29 GMT"
}
] | 2013-07-17T00:00:00 |
[
[
"Liu",
"Xintao",
""
],
[
"Jiang",
"Bin",
""
]
] |
new_dataset
| 0.995595 |
1307.4230
|
Peter Sasvari
|
Peter Sasvari
|
The State of Information and Communication Technology in Hungary, A
Comparative Analysis
|
6 pages
|
Informatica 35 (2011) 239-244
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel comparative research and analysis method is proposed and applied on
the Hungarian economic sectors. The question of what factors have an effect on
their net income is essential for enterprises. First, the potential indicators
related to economic sectors were studied and then compared to the net income of
the surveyed enterprises. The data resulting from the comparison showed that
the growing penetration of electronic marketpalces contributed to the change of
the net income of enterprises in various economic sectors to the extent of 37%.
Among all the potential indicators, only the indicator of electronic
marketplaces has a direct influence on the net income of enterprises. Two
clusters based on the potential indicators were indicated.
|
[
{
"version": "v1",
"created": "Tue, 16 Jul 2013 10:06:54 GMT"
}
] | 2013-07-17T00:00:00 |
[
[
"Sasvari",
"Peter",
""
]
] |
new_dataset
| 0.978757 |
1307.4257
|
Anna Adamaszek
|
Anna Adamaszek and Andreas Wiese
|
A QPTAS for Maximum Weight Independent Set of Polygons with
Polylogarithmically Many Vertices
| null | null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Maximum Weight Independent Set of Polygons problem is a fundamental
problem in computational geometry. Given a set of weighted polygons in the
2-dimensional plane, the goal is to find a set of pairwise non-overlapping
polygons with maximum total weight. Due to its wide range of applications, the
MWISP problem and its special cases have been extensively studied both in the
approximation algorithms and the computational geometry community. Despite a
lot of research, its general case is not well-understood. Currently the best
known polynomial time algorithm achieves an approximation ratio of n^(epsilon)
[Fox and Pach, SODA 2011], and it is not even clear whether the problem is
APX-hard. We present a (1+epsilon)-approximation algorithm, assuming that each
polygon in the input has at most a polylogarithmic number of vertices. Our
algorithm has quasi-polynomial running time.
We use a recently introduced framework for approximating maximum weight
independent set in geometric intersection graphs. The framework has been used
to construct a QPTAS in the much simpler case of axis-parallel rectangles. We
extend it in two ways, to adapt it to our much more general setting. First, we
show that its technical core can be reduced to the case when all input polygons
are triangles. Secondly, we replace its key technical ingredient which is a
method to partition the plane using only few edges such that the objects
stemming from the optimal solution are evenly distributed among the resulting
faces and each object is intersected only a few times. Our new procedure for
this task is not more complex than the original one, and it can handle the
arising difficulties due to the arbitrary angles of the polygons. Note that
already this obstacle makes the known analysis for the above framework fail.
Also, in general it is not well understood how to handle this difficulty by
efficient approximation algorithms.
|
[
{
"version": "v1",
"created": "Tue, 16 Jul 2013 12:25:24 GMT"
}
] | 2013-07-17T00:00:00 |
[
[
"Adamaszek",
"Anna",
""
],
[
"Wiese",
"Andreas",
""
]
] |
new_dataset
| 0.985434 |
1307.4259
|
Robert Gmyr
|
Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian Scheideler
|
Ameba-inspired Self-organizing Particle Systems
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Particle systems are physical systems of simple computational particles that
can bond to neighboring particles and use these bonds to move from one spot to
another (non-occupied) spot. These particle systems are supposed to be able to
self-organize in order to adapt to a desired shape without any central control.
Self-organizing particle systems have many interesting applications like
coating objects for monitoring and repair purposes and the formation of
nano-scale devices for surgery and molecular-scale electronic structures. While
there has been quite a lot of systems work in this area, especially in the
context of modular self-reconfigurable robotic systems, only very little
theoretical work has been done in this area so far. We attempt to bridge this
gap by proposing a model inspired by the behavior of ameba that allows rigorous
algorithmic research on self-organizing particle systems.
|
[
{
"version": "v1",
"created": "Tue, 16 Jul 2013 12:41:05 GMT"
}
] | 2013-07-17T00:00:00 |
[
[
"Dolev",
"Shlomi",
""
],
[
"Gmyr",
"Robert",
""
],
[
"Richa",
"Andrea W.",
""
],
[
"Scheideler",
"Christian",
""
]
] |
new_dataset
| 0.999208 |
1307.4329
|
Delgado Lopez-Cozar emilio
|
Liliana Marcela Reina Leal, Rafael Repiso, Emilio Delgado Lopez-Cozar
|
H Index of scientific Nursing journals according to Google Scholar
Metrics (2007-2011)
|
9 pages
| null | null |
EC35
|
cs.DL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The aim of this report is to present a ranking of Nursing journals covered in
Google Scholar Metrics (GSM), a Google product launched in 2012 to assess the
impact of scientific journals from citation counts this receive on Google
Scholar. Google has chosen to include only those journals that have published
at least 100 papers and have at least one citation in a period of five years
(2007-2011). Journal rankings are sorted by languages (showing the 100 papers
with the greatest impact). This tool allows to sort by subject areas and
disciplines, but only in the case of journals in English. In this case, it only
shows the 20 journals with the highest h index. This option is not available
for journals in the other nine languages present in Google (Chinese,
Portuguese, German, Spanish, French, Korean, Japanese, Dutch and Italian).
Google Scholar Metrics doesnt currently allow to group and sort all journals
belonging to a scientific discipline. In the case of Nursing, in the ten
listings displayed by GSM we can only locate 34 journals. Therefore, in an
attempt to overcome this limitation, we have used the diversity of search
procedures allowed by GSM to identify the greatest number of scientific
journals of Nursing with h index calculated by this bibliometric tool.
Bibliographic searches were conducted between 10th and 30th May 2013.
The result is a ranking of 337 nursing journals sorted by the same h index,
and mean as discriminating value. Journals are also grouped by quartiles.
|
[
{
"version": "v1",
"created": "Tue, 16 Jul 2013 16:19:47 GMT"
}
] | 2013-07-17T00:00:00 |
[
[
"Leal",
"Liliana Marcela Reina",
""
],
[
"Repiso",
"Rafael",
""
],
[
"Lopez-Cozar",
"Emilio Delgado",
""
]
] |
new_dataset
| 0.997349 |
1305.3164
|
Travis Gagie
|
Travis Gagie, Pawe{\l} Gawrychowski and Yakov Nekrich
|
Heaviest Induced Ancestors and Longest Common Substrings
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose we have two trees on the same set of leaves, in which nodes are
weighted such that children are heavier than their parents. We say a node from
the first tree and a node from the second tree are induced together if they
have a common leaf descendant. In this paper we describe data structures that
efficiently support the following heaviest-induced-ancestor query: given a node
from the first tree and a node from the second tree, find an induced pair of
their ancestors with maximum combined weight. Our solutions are based on a
geometric interpretation that enables us to find heaviest induced ancestors
using range queries. We then show how to use these results to build an
LZ-compressed index with which we can quickly find with high probability a
longest substring common to the indexed string and a given pattern.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 14:24:42 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Jul 2013 23:33:37 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Gagie",
"Travis",
""
],
[
"Gawrychowski",
"Paweł",
""
],
[
"Nekrich",
"Yakov",
""
]
] |
new_dataset
| 0.96181 |
1307.3573
|
Shuai Yuan
|
Shuai Yuan, Jun Wang, Maurice van der Meer
|
Adaptive Keywords Extraction with Contextual Bandits for Advertising on
Parked Domains
|
To appear in the proceedings of the IATP '13 workshop
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Domain name registrars and URL shortener service providers place
advertisements on the parked domains (Internet domain names which are not in
service) in order to generate profits. As the web contents have been removed,
it is critical to make sure the displayed ads are directly related to the
intents of the visitors who have been directed to the parked domains. Because
of the missing contents in these domains, it is non-trivial to generate the
keywords to describe the previous contents and therefore the users intents. In
this paper we discuss the adaptive keywords extraction problem and introduce an
algorithm based on the BM25F term weighting and linear multi-armed bandits. We
built a prototype over a production domain registration system and evaluated it
using crowdsourcing in multiple iterations. The prototype is compared with
other popular methods and is shown to be more effective.
|
[
{
"version": "v1",
"created": "Fri, 12 Jul 2013 20:32:42 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Yuan",
"Shuai",
""
],
[
"Wang",
"Jun",
""
],
[
"van der Meer",
"Maurice",
""
]
] |
new_dataset
| 0.967358 |
1307.3638
|
Gaurav Soni GS
|
Gaurav Soni, Kamlesh Chandravanshi
|
A Nobel Defence Scheme Against Selfish Node Attack in MANET
|
5 tables, 4 figures, 13 references
|
International Journal on Computational Science &
Applications(IJCSA) 2013 ISSN: 2200-0011 is a AIRCC journel
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security is one of the major issue in wired and wireless network but due to
the presence of centralized administration not difficult to find out
misbehavior in network other than in Mobile Ad hoc Network due to the absence
of centralized management and frequently changes in topology security is one of
a major issue in MANET. Only prevention methods for attack are not enough. In
this paper a new Intrusion Detection System (IDS) algorithm has proposed
against selfish node attack to secure MANET. Here the behavior of selfish node
is unnecessary flooding the information in network and block all types of
packets transferring between the reliable nodes. Proposed IDS Algorithm
identifies the behavior of selfish node and also blocked their misbehavior
activities. In case of selfish node attack network performance is almost
negligible but after applying IDS on attack network performance is enhanced up
to 92% and provides 0% Infection rate from attack.
|
[
{
"version": "v1",
"created": "Sat, 13 Jul 2013 10:15:55 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Soni",
"Gaurav",
""
],
[
"Chandravanshi",
"Kamlesh",
""
]
] |
new_dataset
| 0.977694 |
1307.3722
|
Chih-Hong Cheng
|
Chih-Hong Cheng and Edward A. Lee
|
Numerical LTL Synthesis for Cyber-Physical Systems
|
10 pages; work-in-progress report
| null | null | null |
cs.SE cs.LO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyber-physical systems (CPS) are systems that interact with the physical
world via sensors and actuators. In such a system, the reading of a sensor
represents measures of a physical quantity, and sensor values are often reals
ranged over bounded intervals. The implementation of control laws is based on
nonlinear numerical computations over the received sensor values. Synthesizing
controllers fulfilling features within CPS brings a huge challenge to the
research community in formal methods, as most of the works in automatic
controller synthesis (LTL synthesis) are restricted to specifications having a
few discrete inputs within the Boolean domain.
In this report, we present a novel approach that addresses the above
challenge to synthesize controllers for CPS. Our core methodology, called
numerical LTL synthesis, extends LTL synthesis by using inputs or outputs in
real numbers and by allowing predicates of polynomial constraints to be defined
within an LTL formula as specification. The synthesis algorithm is based on an
interplay between an LTL synthesis engine which handles the pseudo-Boolean
structure, together with a nonlinear constraint validity checker which tests
the (in)feasibility of a (counter-)strategy. The methodology is integrated
within the CPS research framework Ptolemy II via the development of an LTL
synthesis module G4LTL and a validity checker JBernstein. Although we only
target the theory of nonlinear real arithmetic, the use of pseudo-Boolean
synthesis framework also allows an easy extension to embed a richer set of
theories, making the technique applicable to a much broader audience.
|
[
{
"version": "v1",
"created": "Sun, 14 Jul 2013 10:49:14 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Cheng",
"Chih-Hong",
""
],
[
"Lee",
"Edward A.",
""
]
] |
new_dataset
| 0.950872 |
1307.3799
|
Xiaoyu Wang Dr.
|
D. Mahinda Vilathgamuwa, X. Y. Wang, King Jet Tseng, and C. J.
Gajanayake
|
Z-source Inverter Based Grid-interface For Variable-speed Permanent
Magnet Wind Turbine Generators
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Z-source inverter based grid-interface for a variable-speed wind turbine
connected to a permanent magnet synchronous generator is proposed. A control
system is designed to harvest maximum wind energy under varied wind conditions
with the use of a permanent magnet synchronous generator, a diode-rectifier and
a Z-source inverter. Control systems for speed regulation of the generator and
for DC- and AC- sides of the Z-source inverter are implemented. Laboratory
experiments are used to verify the efficacy of the proposed approach.
|
[
{
"version": "v1",
"created": "Mon, 15 Jul 2013 00:07:31 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Vilathgamuwa",
"D. Mahinda",
""
],
[
"Wang",
"X. Y.",
""
],
[
"Tseng",
"King Jet",
""
],
[
"Gajanayake",
"C. J.",
""
]
] |
new_dataset
| 0.995869 |
1307.3940
|
Wei Ding
|
Wei Ding and Tiejun Lv
|
Large-scale MU-MIMO: It Is Necessary to Deploy Extra Antennas at Base
Station
|
6 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the large-scale MU-MIMO system is considered where a base
station (BS) with extremely large number of antennas (N) serves relatively less
number of users (K). In order to achieve largest sum rate, it is proven that
the amount of users must be limited such that the number of antennas at the BS
is preponderant over that of the antennas at all the users. In other words, the
antennas at the BS should be excess. The extra antennas at the BS are no longer
just an optional approach to enhance the system performance but the
prerequisite to the largest sum rate. Based on this factor, for a fixed N, the
optimal K that maximizes the sum rate is further obtained. Additionally, it is
also pointed out that the sum rate can be substantially improved by only adding
a few antennas at the BS when the system is N=KM with M denoting the antennas
at each user. The derivations are under the assumption of N and M going to
infinity, and being implemented on different precoders. Numerical simulations
verify the tightness and accuracy of our asymptotic results even for small N
and M.
|
[
{
"version": "v1",
"created": "Mon, 15 Jul 2013 13:54:59 GMT"
}
] | 2013-07-16T00:00:00 |
[
[
"Ding",
"Wei",
""
],
[
"Lv",
"Tiejun",
""
]
] |
new_dataset
| 0.995118 |
1307.3272
|
Michael Kerber
|
Michael Kerber and R. Sharathkumar
|
Approximate Cech Complexes in Low and High Dimensions
| null | null | null | null |
cs.CG math.AT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
\v{C}ech complexes reveal valuable topological information about point sets
at a certain scale in arbitrary dimensions, but the sheer size of these
complexes limits their practical impact. While recent work introduced
approximation techniques for filtrations of (Vietoris-)Rips complexes, a
coarser version of \v{C}ech complexes, we propose the approximation of \v{C}ech
filtrations directly.
For fixed dimensional point set $S$, we present an approximation of the
\v{C}ech filtration of $S$ by a sequence of complexes of size linear in the
number of points. We generalize well-separated pair decompositions (WSPD) to
well-separated simplicial decomposition (WSSD) in which every simplex defined
on $S$ is covered by some element of WSSD. We give an efficient algorithm to
compute a linear-sized WSSD in fixed dimensional spaces. Using a WSSD, we then
present a linear-sized approximation of the filtration of \v{C}ech complex of
$S$.
We also present a generalization of the known fact that the Rips complex
approximates the \v{C}ech complex by a factor of $\sqrt{2}$. We define a class
of complexes that interpolate between \v{C}ech and Rips complexes and that,
given any parameter $\eps > 0$, approximate the \v{C}ech complex by a factor
$(1+\eps)$. Our complex can be represented by roughly $O(n^{\lceil
1/2\eps\rceil})$ simplices without any hidden dependence on the ambient
dimension of the point set. Our results are based on an interesting link
between \v{C}ech complex and coresets for minimum enclosing ball of
high-dimensional point sets. As a consequence of our analysis, we show improved
bounds on coresets that approximate the radius of the minimum enclosing ball.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 21:06:53 GMT"
}
] | 2013-07-15T00:00:00 |
[
[
"Kerber",
"Michael",
""
],
[
"Sharathkumar",
"R.",
""
]
] |
new_dataset
| 0.996478 |
1307.3396
|
Karnavel Kuppusamy
|
R. Swaminathan, K. Karnavel
|
Software as a Service - Common Service Bus (SAAS-CSB)
| null | null |
10.5121/cseij.2013.3301
| null |
cs.DC cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
Software-as-a-Service (SaaS) is a form of cloud computing that relieves the
user from the concern of hardware, software installation and management. It is
an emerging business model that delivers software applications to the users
through Web-based technology. Software vendors have varying requirements and
SaaS applications most typically support such requirements. The various
applications used by unique customers in a single instance are known as
Multi-Tenancy. There would be a delay in service when the user sends the data
from multiple applications to multiple destinations and from multiple
applications to single destination due to the use of single CSB. This problem
can be overcome by using multiple CSB concepts and hence multiple senders can
efficiently send their data to multiple receivers at the same time. The
multiple clouds are monitored and managed by the SaaS-CSB portal. The idea of
SaaS-CSB Portal is to provide a single pane of glass for the user to consume
and govern any service from any cloud. Thus, SaaS-CSB application allows
companies to save their IT cost and valuable time.
|
[
{
"version": "v1",
"created": "Fri, 12 Jul 2013 10:25:28 GMT"
}
] | 2013-07-15T00:00:00 |
[
[
"Swaminathan",
"R.",
""
],
[
"Karnavel",
"K.",
""
]
] |
new_dataset
| 0.996114 |
1307.3399
|
Karnavel Kuppusamy
|
N. Sampath Kumar, U. KarthikChandran, N.ArunKumar, K. Karnavel
|
Social Networking Site For Self Portfolio
| null | null | null | null |
cs.SI cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
Online social networking concept is a global phenomenon and there are
millions of sites which help in being connected with friends and family. This
project focuses on creating self-portfolios for the users which makes the users
engaging with their skills. The users follow the other users to interact and
communicate with them. Users can encourage the other users blogs and videos by
clicking the hit button. The functionality of this site is designed to focus on
both professional as well as academics. Each user is given a dashboard for
uploading videos and writing blogs.
|
[
{
"version": "v1",
"created": "Fri, 12 Jul 2013 10:35:30 GMT"
}
] | 2013-07-15T00:00:00 |
[
[
"Kumar",
"N. Sampath",
""
],
[
"KarthikChandran",
"U.",
""
],
[
"ArunKumar",
"N.",
""
],
[
"Karnavel",
"K.",
""
]
] |
new_dataset
| 0.96063 |
1307.3411
|
Ahmadreza Montazerolghaem
|
Ahmad Reza Montazerolghaem and Mohammad Hossein Yaghmaee
|
Sip Overload Control Testbed: Design, Building and Evaluation
|
10 pages, 9 figures, 2 table, 37 references
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Having facilities such as being in text form, end-to-end connection
establishment, and being independence from the type of transmitted data, SIP
protocol is a good choice for signaling protocol in order to set up a
connection between two users of an IP network. Although utilization of SIP
protocol in a wide range of applications has made various vulnerabilities in
this protocol, amongst which overload could make serious problems in SIP
servers. A SIP is overloaded when it does not have sufficient resources
(majorly CPU processing power and memory) to process all messages. In this
paper the window-based overload control mechanism which does not require
explicit feedback is developed and implemented on Asterisk open source proxy
and evaluated. The results of implementation show that this method could
practically maintain throughput in case of overload. As we know this is the
only overload control method which is implemented on a real platform without
using explicit feedback. The results show that the under load server maintains
its throughput at the maximum capacity.
|
[
{
"version": "v1",
"created": "Fri, 12 Jul 2013 11:07:09 GMT"
}
] | 2013-07-15T00:00:00 |
[
[
"Montazerolghaem",
"Ahmad Reza",
""
],
[
"Yaghmaee",
"Mohammad Hossein",
""
]
] |
new_dataset
| 0.999703 |
1307.2352
|
Peter Trifonov
|
Peter Trifonov and Vera Miloslavskaya
|
Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed
Search
|
Accepted to ITW2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel construction of polar codes with dynamic frozen symbols is proposed.
The proposed codes are subcodes of extended BCH codes, which ensure
sufficiently high minimum distance. Furthermore, a decoding algorithm is
proposed, which employs estimates of the not-yet-processed bit channel error
probabilities to perform directed search in code tree, reducing thus the total
number of iterations.
|
[
{
"version": "v1",
"created": "Tue, 9 Jul 2013 07:19:30 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jul 2013 20:01:08 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Trifonov",
"Peter",
""
],
[
"Miloslavskaya",
"Vera",
""
]
] |
new_dataset
| 0.999784 |
1307.2977
|
Qiwei Lu
|
Qiwei Lu, Wenchao Huang, Xudong Gong, Xingfu Wang, Yan Xiong, and
Fuyou Miao
|
A Secure Distributed Authentication scheme based on CRT-VSS and Trusted
Computing in MANET
|
under submission
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid development of MANET, secure and practical authentication is
becoming increasingly important. The existing works perform the research from
two aspects, i.e., (a)secure key division and distributed storage, (b)secure
distributed authentication. But there still exist several unsolved problems.
Specifically, it may suffer from cheating problems and fault authentication
attack, which can result in authentication failure and DoS attack towards
authentication service. Besides, most existing schemes are not with
satisfactory efficiency due to exponential arithmetic based on Shamir's scheme.
In this paper, we explore the property of verifiable secret sharing(VSS)
schemes with Chinese Remainder Theorem (CRT), then propose a secret key
distributed storage scheme based on CRT-VSS and trusted computing for MANET.
Specifically, we utilize trusted computing technology to solve two existing
cheating problems in secret sharing area before. After that, we do the analysis
of homomorphism property with CRT-VSS and design the corresponding
shares-product sharing scheme with better concision. On such basis, a secure
distributed Elliptic Curve-Digital Signature Standard signature (ECC-DSS)
authentication scheme based on CRT-VSS scheme and trusted computing is
proposed. Furthermore, as an important property of authentication scheme, we
discuss the refreshing property of CRT-VSS and do thorough comparisons with
Shamir's scheme. Finally, we provide formal guarantees towards our schemes
proposed in this paper.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 05:35:28 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Lu",
"Qiwei",
""
],
[
"Huang",
"Wenchao",
""
],
[
"Gong",
"Xudong",
""
],
[
"Wang",
"Xingfu",
""
],
[
"Xiong",
"Yan",
""
],
[
"Miao",
"Fuyou",
""
]
] |
new_dataset
| 0.989299 |
1307.3013
|
Takahiro Kawamura
|
Keisuke Umezu, Takahiro Kawamura, and Akihiko Ohsuga
|
Context-based Barrier Notification Service Toward Outdoor Support for
the Elderly
| null | null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aging society has been becoming a global problem not only in advanced
countries. Under such circumstances, it is said that participation of elderly
people in social activities is highly desirable from various perspectives
including decrease of social welfare costs. Thus, we propose a mobile service
that notifies barrier information nearby users outside to lowers the anxiety of
elderly people and promote their social activities. There are barrier free maps
in some areas, but those are static and updated annually at the earliest.
However, there exist temporary barriers like road repairing and parked
bicycles, and also every barrier is not for every elder person. That is, the
elder people are under several conditions and wills to go out, so that a
barrier for an elder person is not necessarily the one for the other.
Therefore, we first collect the barrier information in the user participatory
manner and select the ones the user need to know, then timely provide them via
a mobile phone equipped with GPS. This paper shows the public experiment that
we conducted in Tokyo, and confirms the usability and the accuracy of the
information filtering.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 08:24:02 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Umezu",
"Keisuke",
""
],
[
"Kawamura",
"Takahiro",
""
],
[
"Ohsuga",
"Akihiko",
""
]
] |
new_dataset
| 0.998635 |
1307.3017
|
Kanika Kaur Prof.
|
Kanika Kaur, Arti Noor
|
CMOS Low Power Cell Library For Digital Design
|
9 pages
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Historically, VLSI designers have focused on increasing the speed and
reducing the area of digital systems. However, the evolution of portable
systems and advanced Deep Sub-Micron fabrication technologies have brought
power dissipation as another critical design factor. Low power design reduces
cooling cost and increases reliability especially for high density systems.
Moreover, it reduces the weight and size of portable devices. The power
dissipation in CMOS circuits consists of static and dynamic components. Since
dynamic power is proportional to V2 dd and static power is proportional to Vdd,
lowering the supply voltage and device dimensions, the transistor threshold
voltage also has to be scaled down to achieve the required performance. In case
of static power, the power is consumed during the steady state condition i.e
when there are no input/output transitions. Static power has two sources: DC
power and Leakage power. Consecutively to facilitate voltage scaling without
disturbing the performance, threshold voltage has to be minimized. Furthermore
it leads to better noise margins and helps to avoid the hot carrier effects in
short channel devices. In this paper we have been proposed the new CMOS library
for the complex digital design using scaling the supply voltage and device
dimensions and also suggest the methods to control the leakage current to
obtain the minimum power dissipation at optimum value of supply voltage and
transistor threshold. In this paper CMOS Cell library has been implemented
using TSMC (0.18um) and TSMC (90nm) technology using HEP2 tool of IC designing
from Mentor Graphics for various analysis and simulations.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 08:48:13 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Kaur",
"Kanika",
""
],
[
"Noor",
"Arti",
""
]
] |
new_dataset
| 0.999524 |
1307.3091
|
Gra\c{c}a Marietto Dr
|
Maria das Gra\c{c}as Bruno Marietto, Rafael Varago de Aguiar, Gislene
de Oliveira Barbosa, Wagner Tanaka Botelho, Edson Pimentel, Robson dos Santos
Fran\c{c}a and Vera L\'ucia da Silva
|
Artificial Intelligence MArkup Language: A Brief Tutorial
|
International Journal of Computer science and engineering Survey
(IJCSES) - 2013
| null | null | null |
cs.AI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this paper is to serve as a reference guide for the
development of chatterbots implemented with the AIML language. In order to
achieve this, the main concepts in Pattern Recognition area are described
because the AIML uses such theoretical framework in their syntactic and
semantic structures. After that, AIML language is described and each AIML
command/tag is followed by an application example. Also, the usage of AIML
embedded tags for the handling of sequence dialogue limitations between humans
and machines is shown. Finally, computer systems that assist in the design of
chatterbots with the AIML language are classified and described.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 12:49:43 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Marietto",
"Maria das Graças Bruno",
""
],
[
"de Aguiar",
"Rafael Varago",
""
],
[
"Barbosa",
"Gislene de Oliveira",
""
],
[
"Botelho",
"Wagner Tanaka",
""
],
[
"Pimentel",
"Edson",
""
],
[
"França",
"Robson dos Santos",
""
],
[
"da Silva",
"Vera Lúcia",
""
]
] |
new_dataset
| 0.987955 |
1307.3110
|
Hauke Holtkamp
|
Hauke Holtkamp, Gunther Auer, Samer Bazzi, Harald Haas
|
Minimizing Base Station Power Consumption
|
27 pages
|
Selected Areas in Communications, IEEE Journal on (Volume:PP ,
Issue: 99 ), 2014
|
10.1109/JSAC.2014.141210
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new radio resource management algorithm which aims at minimizing
the base station supply power consumption for multi-user MIMO-OFDM. Given a
base station power model that establishes a relation between the RF transmit
power and the supply power consumption, the algorithm optimizes the trade-off
between three basic power-saving mechanisms: antenna adaptation, power control
and discontinuous transmission. The algorithm comprises two steps: a) the first
step estimates sleep mode duration, resource shares and antenna configuration
based on average channel conditions and b) the second step exploits
instantaneous channel knowledge at the transmitter for frequency selective
time-variant channels. The proposed algorithm finds the number of transmit
antennas, the RF transmission power per resource unit and spatial channel, the
number of discontinuous transmission time slots, and the multi-user resource
allocation, such that supply power consumption is minimized. Simulation results
indicate that the proposed algorithm is capable of reducing the supply power
consumption by between 25% and 40%, dependend on the system load.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 13:51:44 GMT"
}
] | 2013-07-12T00:00:00 |
[
[
"Holtkamp",
"Hauke",
""
],
[
"Auer",
"Gunther",
""
],
[
"Bazzi",
"Samer",
""
],
[
"Haas",
"Harald",
""
]
] |
new_dataset
| 0.996314 |
1307.2599
|
Bin Han
|
Bin Han, Qun Mo, and Zhenpeng Zhao
|
Compactly Supported Tensor Product Complex Tight Framelets with
Directionality
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although tensor product real-valued wavelets have been successfully applied
to many high-dimensional problems, they can only capture well edge
singularities along the coordinate axis directions. As an alternative and
improvement of tensor product real-valued wavelets and dual tree complex
wavelet transform, recently tensor product complex tight framelets with
increasing directionality have been introduced in [8] and applied to image
denoising in [13]. Despite several desirable properties, the directional tensor
product complex tight framelets constructed in [8,13] are bandlimited and do
not have compact support in the space/time domain. Since compactly supported
wavelets and framelets are of great interest and importance in both theory and
application, it remains as an unsolved problem whether there exist compactly
supported tensor product complex tight framelets with directionality. In this
paper, we shall satisfactorily answer this question by proving a theoretical
result on directionality of tight framelets and by introducing an algorithm to
construct compactly supported complex tight framelets with directionality. Our
examples show that compactly supported complex tight framelets with
directionality can be easily derived from any given eligible low-pass filters
and refinable functions. Several examples of compactly supported tensor product
complex tight framelets with directionality have been presented.
|
[
{
"version": "v1",
"created": "Tue, 9 Jul 2013 21:00:36 GMT"
}
] | 2013-07-11T00:00:00 |
[
[
"Han",
"Bin",
""
],
[
"Mo",
"Qun",
""
],
[
"Zhao",
"Zhenpeng",
""
]
] |
new_dataset
| 0.996677 |
1307.2228
|
Minjia Shi
|
Minjia Shi
|
The MacWilliams identity for $m$-spotty weight enumerator over
$\mathbb{F}_2+u\mathbb{F}_2+\cdots+u^{m-1}\mathbb{F}_2$
|
Research paper, under review since 18th October 2012. arXiv admin
note: substantial text overlap with arXiv:1307.1786
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Past few years have seen an extensive use of RAM chips with wide I/O data
(e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly
vulnerable to a special type of byte error, called an $m$-spotty byte error,
which can be effectively detected or corrected using byte error-control codes.
The MacWilliams identity provides the relationship between the weight
distribution of a code and that of its dual. The main purpose of this paper is
to present a version of the MacWilliams identity for $m$-spotty weight
enumerators over
$\mathbbm{F}_{2}+u\mathbbm{F}_{2}+\cdots+u^{m-1}\mathbbm{F}_{2}$ (shortly
$R_{u, m, 2}$).
|
[
{
"version": "v1",
"created": "Sat, 6 Jul 2013 14:35:46 GMT"
}
] | 2013-07-10T00:00:00 |
[
[
"Shi",
"Minjia",
""
]
] |
new_dataset
| 0.994685 |
1307.2430
|
Pin-Hsun Lin
|
Pin-Hsun Lin, Chien-Li Su, Hsuan-Jung Su
|
On The Fast Fading Multiple-Antenna Gaussian Broadcast Channel with
Confidential Messages and Partial CSIT
|
31 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wiretap channels the eavesdropper's channel state information (CSI) is
commonly assumed to be known at transmitter, fully or partially. However, under
perfect secrecy constraint the eavesdropper may not be motivated to feedback
any correct CSI. In this paper we consider a more feasible problem for the
transmitter to have eavesdropper's CSI. That is, the fast fading
multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential
messages, where both receivers are legitimate users such that they both are
willing to feedback accurate CSI to maintain their secure transmission, and not
to be eavesdropped by the other. We assume that only the statistics of the
channel state information are known by the transmitter. We first show the
necessary condition for the FMGBC-CM not to be degraded to the common wiretap
channels. Then we derive the achievable rate region for the FMGBC-CM where the
channel input covariance matrices and the inflation factor are left unknown and
to be solved. After that we provide an analytical solution to the channel input
covariance matrices. We also propose an iterative algorithm to solve the
channel input covariance matrices and the inflation factor. Due to the
complicated rate region formulae in normal SNR, we resort to low SNR analysis
to investigate the characteristics of the channel. Finally, numerical examples
show that under perfect secrecy constraint both users can achieve positive
rates simultaneously, which verifies our derived necessary condition. Numerical
results also elucidate the effectiveness of the analytic solution and proposed
algorithm of solving the channel input covariance matrices and the inflation
factor under different conditions.
|
[
{
"version": "v1",
"created": "Tue, 9 Jul 2013 12:47:07 GMT"
}
] | 2013-07-10T00:00:00 |
[
[
"Lin",
"Pin-Hsun",
""
],
[
"Su",
"Chien-Li",
""
],
[
"Su",
"Hsuan-Jung",
""
]
] |
new_dataset
| 0.969152 |
1307.2467
|
John Pfaltz
|
John L. Pfaltz
|
The Irreducible Spine(s) of Undirected Networks
|
Submitted to WISE 2013
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using closure concepts, we show that within every undirected network, or
graph, there is a unique irreducible subgraph which we call its "spine". The
chordless cycles which comprise this irreducible core effectively characterize
the connectivity structure of the network as a whole. In particular, it is
shown that the center of the network, whether defined by distance or
betweenness centrality, is effectively contained in this spine. By counting the
number of cycles of length 3 <= k <= max_length, we can also create a kind of
signature that can be used to identify the network. Performance is analyzed,
and the concepts we develop are illurstrated by means of a relatively small
running sample network of about 400 nodes.
|
[
{
"version": "v1",
"created": "Tue, 9 Jul 2013 14:15:01 GMT"
}
] | 2013-07-10T00:00:00 |
[
[
"Pfaltz",
"John L.",
""
]
] |
new_dataset
| 0.985656 |
1009.3728
|
Krishnan Prasad
|
K. Prasad and B. Sundar Rajan
|
Network-Error Correcting Codes using Small Fields
|
Minor changes from previous version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing construction algorithms of block network-error correcting codes
require a rather large field size, which grows with the size of the network and
the number of sinks, and thereby can be prohibitive in large networks. In this
work, we give an algorithm which, starting from a given network-error
correcting code, can obtain another network code using a small field, with the
same error correcting capability as the original code. An algorithm for
designing network codes using small field sizes proposed recently by Ebrahimi
and Fragouli can be seen as a special case of our algorithm. The major step in
our algorithm is to find a least degree irreducible polynomial which is coprime
to another large degree polynomial. We utilize the algebraic properties of
finite fields to implement this step so that it becomes much faster than the
brute-force method. As a result the algorithm given by Ebrahimi and Fragouli is
also quickened.
|
[
{
"version": "v1",
"created": "Mon, 20 Sep 2010 08:14:56 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Jul 2013 11:56:30 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Prasad",
"K.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.987274 |
1102.1782
|
Krishnan Prasad
|
K. Prasad and B. Sundar Rajan
|
On network coding for acyclic networks with delays
|
Minor updates
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Problems related to network coding for acyclic, instantaneous networks (where
the edges of the acyclic graph representing the network are assumed to have
zero-delay) have been extensively dealt with in the recent past. The most
prominent of these problems include (a) the existence of network codes that
achieve maximum rate of transmission, (b) efficient network code constructions,
and (c) field size issues. In practice, however, networks have transmission
delays. In network coding theory, such networks with transmission delays are
generally abstracted by assuming that their edges have integer delays. Note
that using enough memory at the nodes of an acyclic network with integer delays
can effectively simulate instantaneous behavior, which is probably why only
acyclic instantaneous networks have been primarily focused on thus far. In this
work, we elaborate on issues ((a), (b) and (c) above) related to network coding
for acyclic networks with integer delays, which have till now mostly been
overlooked. We show that the delays associated with the edges of the network
cannot be ignored, and in fact turn out to be advantageous, disadvantageous or
immaterial, depending on the topology of the network and the problem considered
i.e., (a), (b) or (c). In the process, we also show that for a single source
multicast problem in acyclic networks (instantaneous and with delays), the
network coding operations at each node can simply be limited to storing old
symbols and coding them over a binary field. Therefore, operations over
elements of larger fields are unnecessary in the network, the trade-off being
that enough memory exists at the nodes and at the sinks, and that the sinks
have more processing power.
|
[
{
"version": "v1",
"created": "Wed, 9 Feb 2011 05:07:11 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Apr 2011 07:24:12 GMT"
},
{
"version": "v3",
"created": "Sat, 6 Jul 2013 11:50:35 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Prasad",
"K.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.99648 |
1201.6459
|
Krishnan Prasad
|
K. Prasad and B. Sundar Rajan
|
A Matroidal Framework for Network-Error Correcting Codes
|
New results on insufficiency of network-error detection added.
Submitted to Transactions on Info. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We abstract the essential aspects of network-error detecting and correcting
codes to arrive at the definitions of matroidal error detecting networks and
matroidal error correcting networks. An acyclic network (with arbitrary sink
demands) is then shown to possess a scalar linear error detecting (correcting)
network code if and only if it is a matroidal error detecting (correcting)
network associated with a representable matroid. Therefore, constructing such
network-error correcting and detecting codes implies the construction of
certain representable matroids that satisfy some special conditions, and vice
versa. We then present algorithms which enable the construction of matroidal
error detecting and correcting networks with a specified capability of
network-error correction. Using these construction algorithms, a large class of
hitherto unknown scalar linearly solvable networks with multisource multicast
and multiple-unicast network-error correcting codes is made available for
theoretical use and practical implementation, with parameters such as number of
information symbols, number of sinks, number of coding nodes, error correcting
capability, etc. being arbitrary but for computing power (for the execution of
the algorithms). The complexity of the construction of these networks is shown
to be comparable to the complexity of existing algorithms that design multicast
scalar linear network-error correcting codes. Finally we also show that linear
network coding is not sufficient for the general network-error detection
problem with arbitrary demands. In particular, for the same number of
network-errors, we show a network for which there is a nonlinear network-error
detecting code satisfying the demands at the sinks, while there are no linear
network-error detecting codes that do the same.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2012 07:19:09 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Mar 2012 07:30:21 GMT"
},
{
"version": "v3",
"created": "Sat, 6 Jul 2013 11:35:18 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Prasad",
"K.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.980232 |
1207.2819
|
Antoine Amarilli
|
Antoine Amarilli, Marc Jeanmougin
|
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown
Automata
|
Corrected a typo in a definition, added related work, added
acknowledgement, added note about proving Ogden's lemma
| null | null | null |
cs.FL
|
http://creativecommons.org/licenses/by/3.0/
|
The pumping lemma for context-free languages is a result about pushdown
automata which is strikingly similar to the well-known pumping lemma for
regular languages. However, though the lemma for regular languages is simply
proved by using the pigeonhole principle on deterministic automata, the lemma
for pushdown automata is proven through an equivalence with context-free
languages and through the more powerful Ogden's lemma. We present here a proof
of the pumping lemma for context-free languages which relies on pushdown
automata instead of context-free grammars.
|
[
{
"version": "v1",
"created": "Thu, 12 Jul 2012 01:01:58 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Jul 2013 11:25:46 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Amarilli",
"Antoine",
""
],
[
"Jeanmougin",
"Marc",
""
]
] |
new_dataset
| 0.998579 |
1208.2515
|
Gal Itzhak
|
Eliahu Baransky, Gal Itzhak, Idan Shmuel, Noam Wagner, Eli Shoshan,
Yonina C. Eldar
|
A Sub-Nyquist Radar Prototype: Hardware and Algorithms
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional radar sensing typically involves matched filtering between the
received signal and the shape of the transmitted pulse. Under the confinement
of classic sampling theorem this requires that the received signals must first
be sampled at twice the baseband bandwidth, in order to avoid aliasing. The
growing demands for target distinction capability and spatial resolution imply
significant growth in the bandwidth of the transmitted pulse. Thus, correlation
based radar systems require high sampling rates, and with the large amounts of
data sampled also necessitate vast memory capacity. In addition, real-time
processing of the data typically results in high power consumption. Recently,
new approaches for radar sensing and detection were introduced, based on the
Finite Rate of Innovation and Xampling frameworks. These techniques allow
significant reduction in sampling rate, implying potential power savings, while
maintaining the system's detection capabilities at high enough SNR. Here we
present for the first time a design and implementation of a Xampling-based
hardware prototype that allows sampling of radar signals at rates much lower
than Nyquist. We demostrate by real-time analog experiments that our system is
able to maintain reasonable detection capabilities, while sampling radar
signals that require sampling at a rate of about 30MHz at a total rate of 1Mhz.
|
[
{
"version": "v1",
"created": "Mon, 13 Aug 2012 07:42:46 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Jul 2013 15:14:08 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Baransky",
"Eliahu",
""
],
[
"Itzhak",
"Gal",
""
],
[
"Shmuel",
"Idan",
""
],
[
"Wagner",
"Noam",
""
],
[
"Shoshan",
"Eli",
""
],
[
"Eldar",
"Yonina C.",
""
]
] |
new_dataset
| 0.998602 |
1305.4308
|
Alina Ene
|
Alina Ene, Nitish Korula, Ali Vakilian
|
Connected Domatic Packings in Node-capacitated Graphs
|
12 pages
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set of vertices in a graph is a dominating set if every vertex outside the
set has a neighbor in the set. A dominating set is connected if the subgraph
induced by its vertices is connected. The connected domatic partition problem
asks for a partition of the nodes into connected dominating sets. The connected
domatic number of a graph is the size of a largest connected domatic partition
and it is a well-studied graph parameter with applications in the design of
wireless networks. In this note, we consider the fractional counterpart of the
connected domatic partition problem in \emph{node-capacitated} graphs. Let $n$
be the number of nodes in the graph and let $k$ be the minimum capacity of a
node separator in $G$. Fractionally we can pack at most $k$ connected
dominating sets subject to the capacities on the nodes, and our algorithms
construct packings whose sizes are proportional to $k$. Some of our main
contributions are the following: \begin{itemize} \item An algorithm for
constructing a fractional connected domatic packing of size $\Omega(k)$ for
node-capacitated planar and minor-closed families of graphs. \item An algorithm
for constructing a fractional connected domatic packing of size $\Omega(k /
\ln{n})$ for node-capacitated general graphs. \end{itemize}
|
[
{
"version": "v1",
"created": "Sun, 19 May 2013 00:10:34 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jul 2013 22:08:08 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Ene",
"Alina",
""
],
[
"Korula",
"Nitish",
""
],
[
"Vakilian",
"Ali",
""
]
] |
new_dataset
| 0.958479 |
1307.1370
|
Latanya Sweeney
|
Latanya Sweeney
|
Matching Known Patients to Health Records in Washington State Data
|
13 pages
| null | null | null |
cs.CY cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The State of Washington sells patient-level health data for $50. This
publicly available dataset has virtually all hospitalizations occurring in the
State in a given year, including patient demographics, diagnoses, procedures,
attending physician, hospital, a summary of charges, and how the bill was paid.
It does not contain patient names or addresses (only ZIPs). Newspaper stories
printed in the State for the same year that contain the word "hospitalized"
often include a patient's name and residential information and explain why the
person was hospitalized, such as vehicle accident or assault. News information
uniquely and exactly matched medical records in the State database for 35 of
the 81 cases (or 43 percent) found in 2011, thereby putting names to patient
records. A news reporter verified matches by contacting patients. Employers,
financial organizations and others know the same kind of information as
reported in news stories making it just as easy for them to identify the
medical records of employees, debtors, and others.
|
[
{
"version": "v1",
"created": "Thu, 4 Jul 2013 15:21:34 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jul 2013 23:04:48 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Sweeney",
"Latanya",
""
]
] |
new_dataset
| 0.998503 |
1307.1772
|
Sadagopan Narasimhan
|
Surabhi Jain and N.Sadagopan
|
Simpler Sequential and Parallel Biconnectivity Augmentation
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a connected graph, a vertex separator is a set of vertices whose removal
creates at least two components and a minimum vertex separator is a vertex
separator of least cardinality. The vertex connectivity refers to the size of a
minimum vertex separator. For a connected graph $G$ with vertex connectivity $k
(k \geq 1)$, the connectivity augmentation refers to a set $S$ of edges whose
augmentation to $G$ increases its vertex connectivity by one. A minimum
connectivity augmentation of $G$ is the one in which $S$ is minimum. In this
paper, we focus our attention on connectivity augmentation of trees. Towards
this end, we present a new sequential algorithm for biconnectivity augmentation
in trees by simplifying the algorithm reported in \cite{nsn}. The simplicity is
achieved with the help of edge contraction tool. This tool helps us in getting
a recursive subproblem preserving all connectivity information. Subsequently,
we present a parallel algorithm to obtain a minimum connectivity augmentation
set in trees. Our parallel algorithm essentially follows the overall structure
of sequential algorithm. Our implementation is based on CREW PRAM model with
$O(\Delta)$ processors, where $\Delta$ refers to the maximum degree of a tree.
We also show that our parallel algorithm is optimal whose processor-time
product is O(n) where $n$ is the number of vertices of a tree, which is an
improvement over the parallel algorithm reported in \cite{hsu}.
|
[
{
"version": "v1",
"created": "Sat, 6 Jul 2013 12:18:55 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Jain",
"Surabhi",
""
],
[
"Sadagopan",
"N.",
""
]
] |
new_dataset
| 0.975998 |
1307.1786
|
Minjia Shi
|
Minjia Shi
|
MacWilliams type identities for some new $m$-spotty weight enumerators
over finite commutative Frobenius rings
|
Research article, under review since 30th March 2013. 18 pages,6
Tables. arXiv admin note: text overlap with arXiv:1109.3800 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Past few years have seen an extensive use of RAM chips with wide I/O data
(e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly
vulnerable to a special type of byte error, called an $m$-spotty byte error,
which can be effectively detected or corrected using byte error-control codes.
The MacWilliams identity provides the relationship between the weight
distribution of a code and that of its dual. This paper introduces $m$-spotty
Hamming weight enumerator, joint $m$-spotty Hamming weight enumerator and split
$m$-spotty Hamming weight enumerator for byte error-control codes over finite
commutative Frobenius rings as well as $m$-spotty Lee weight enumerator over an
infinite family of rings. In addition, MacWilliams type identities are also
derived for these enumerators.
|
[
{
"version": "v1",
"created": "Sat, 6 Jul 2013 14:06:11 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Shi",
"Minjia",
""
]
] |
new_dataset
| 0.991338 |
1307.1943
|
EPTCS
|
Carst Tankink (Institute for Computing and Information Science,
Radboud University Nijmegen)
|
Proof in Context -- Web Editing with Rich, Modeless Contextual Feedback
|
In Proceedings UITP 2012, arXiv:1307.1528
|
EPTCS 118, 2013, pp. 42-56
|
10.4204/EPTCS.118.3
| null |
cs.HC cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Agora system is a prototypical Wiki for formal mathematics: a web-based
system for collaborating on formal mathematics, intended to support informal
documentation of formal developments. This system requires a reusable proof
editor component, both for collaborative editing of documents, and for
embedding in the resulting documents. This paper describes the design of
Agora's asynchronous editor, that is generic enough to support different tools
working on editor content and providing contextual information, with
interactive theorem proverss being a special, but important, case described in
detail for the Coq theorem prover.
|
[
{
"version": "v1",
"created": "Mon, 8 Jul 2013 04:41:39 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Tankink",
"Carst",
"",
"Institute for Computing and Information Science,\n Radboud University Nijmegen"
]
] |
new_dataset
| 0.997927 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.