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
|
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1409.2408
|
B\'eatrice B\'erard
|
B\'eatrice B\'erard, Serge Haddad, Aleksandra Jovanovi\'c, Didier Lime
|
Interrupt Timed Automata with Auxiliary Clocks and Parameters
|
26 pages, 6 figures, extended version from Reachability Problems 2013
| null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to
take into account interruptions, according to levels. Due to this feature, this
formalism is incomparable with Timed Automata. However several decidability
results related to reachability and model checking have been obtained. We add
auxiliary clocks to ITA, thereby extending its expressive power while
preserving decidability of reachability. Moreover, we define a parametrized
version of ITA, with polynomials of parameters appearing in guards and updates.
While parametric reasoning is particularly relevant for timed models, it very
often leads to undecidability results. We prove that various reachability
problems, including "robust" reachability, are decidable for this model, and we
give complexity upper bounds for a fixed or variable number of clocks, levels
and parameters.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2014 15:56:45 GMT"
}
] | 2014-09-09T00:00:00 |
[
[
"Bérard",
"Béatrice",
""
],
[
"Haddad",
"Serge",
""
],
[
"Jovanović",
"Aleksandra",
""
],
[
"Lime",
"Didier",
""
]
] |
new_dataset
| 0.999558 |
1407.1687
|
Bin Gao
|
Qing Cui, Bin Gao, Jiang Bian, Siyu Qiu, and Tie-Yan Liu
|
KNET: A General Framework for Learning Word Embedding using
Morphological Knowledge
| null | null | null | null |
cs.CL cs.LG
|
http://creativecommons.org/licenses/by/3.0/
|
Neural network techniques are widely applied to obtain high-quality
distributed representations of words, i.e., word embeddings, to address text
mining, information retrieval, and natural language processing tasks. Recently,
efficient methods have been proposed to learn word embeddings from context that
captures both semantic and syntactic relationships between words. However, it
is challenging to handle unseen words or rare words with insufficient context.
In this paper, inspired by the study on word recognition process in cognitive
psychology, we propose to take advantage of seemingly less obvious but
essentially important morphological knowledge to address these challenges. In
particular, we introduce a novel neural network architecture called KNET that
leverages both contextual information and morphological word similarity built
based on morphological knowledge to learn word embeddings. Meanwhile, the
learning architecture is also able to refine the pre-defined morphological
knowledge and obtain more accurate word similarity. Experiments on an
analogical reasoning task and a word similarity task both demonstrate that the
proposed KNET framework can greatly enhance the effectiveness of word
embeddings.
|
[
{
"version": "v1",
"created": "Mon, 7 Jul 2014 12:45:10 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Sep 2014 16:03:47 GMT"
},
{
"version": "v3",
"created": "Fri, 5 Sep 2014 15:58:35 GMT"
}
] | 2014-09-08T00:00:00 |
[
[
"Cui",
"Qing",
""
],
[
"Gao",
"Bin",
""
],
[
"Bian",
"Jiang",
""
],
[
"Qiu",
"Siyu",
""
],
[
"Liu",
"Tie-Yan",
""
]
] |
new_dataset
| 0.995064 |
1409.1619
|
Shinnosuke Seki
|
Aleck Johnsen, Ming-Yang Kao, and Shinnosuke Seki
|
A manually-checkable proof for the NP-hardness of 11-color pattern
self-assembly tile set synthesis
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum
tile set to uniquely self-assemble a given rectangular (color) pattern. For k
>= 1, k-PATS is a variant of PATS that restricts input patterns to those with
at most $k$ colors. A computer-assisted proof has been recently proposed for
2-PATS by Kari et al. [arXiv:1404.0967 (2014)]. In contrast, the best known
manually-checkable proof is for the NP-hardness of 29-PATS by Johnsen, Kao, and
Seki [ISAAC 2013, LNCS 8283, pp.~699-710]. We propose a manually-checkable
proof for the NP-hardness of 11-PATS.
|
[
{
"version": "v1",
"created": "Thu, 4 Sep 2014 21:29:02 GMT"
}
] | 2014-09-08T00:00:00 |
[
[
"Johnsen",
"Aleck",
""
],
[
"Kao",
"Ming-Yang",
""
],
[
"Seki",
"Shinnosuke",
""
]
] |
new_dataset
| 0.979622 |
1409.1660
|
Ming Jin
|
Kevin Weekly, Ming Jin, Han Zou, Christopher Hsu, Alexandre Bayen,
Costas Spanos
|
Building-in-Briefcase (BiB)
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A building's environment has profound influence on occupant comfort and
health. Continuous monitoring of building occupancy and environment is
essential to fault detection, intelligent control, and building commissioning.
Though many solutions for environmental measuring based on wireless sensor
networks exist, they are not easily accessible to households and building
owners who may lack time or technical expertise needed to set up a system and
get quick and detailed overview of environmental conditions.
Building-in-Briefcase (BiB) is a portable sensor network platform that is
trivially easy to deploy in any building environment. Once the sensors are
distributed, the environmental data is collected and communicated to the BiB
router via TCP/IP protocol and WiFi technology which then forwards the data to
the central database securely over the internet through a 3G radio. The user,
with minimal effort, can access the aggregated data and visualize the trends in
real time on the BiB web portal. Paramount to the adoption and continued
operation of an indoor sensing platform is battery lifetime. This design has
achieved a multi-year lifespan by careful selection of components, an efficient
binary communications protocol and data compression. Our BiB sensor is capable
of collecting a rich set of environmental parameters, and is expandable to
measure others, such as CO2. This paper describes the power characteristics of
BiB sensors and their occupancy estimation and activity recognition
functionality. Our vision is large-scale deployment of BiB in thousands of
buildings, which would provide ample research opportunities and opportunities
to identify ways to improve the building environment and energy efficiency.
|
[
{
"version": "v1",
"created": "Fri, 5 Sep 2014 04:26:40 GMT"
}
] | 2014-09-08T00:00:00 |
[
[
"Weekly",
"Kevin",
""
],
[
"Jin",
"Ming",
""
],
[
"Zou",
"Han",
""
],
[
"Hsu",
"Christopher",
""
],
[
"Bayen",
"Alexandre",
""
],
[
"Spanos",
"Costas",
""
]
] |
new_dataset
| 0.99961 |
1406.0647
|
Georg Nawratil
|
Georg Nawratil and Josef Schicho
|
Pentapods with Mobility 2
|
18 pages, 5 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we give a full classification of all pentapods with mobility 2,
where neither all platform anchor points nor all base anchor points are located
on a line. Therefore this paper solves the famous Borel-Bricard problem for
2-dimensional motions beside the excluded case of five collinear points with
spherical trajectories. But even for this special case we present three new
types as a side-result. Based on our study of pentapods, we also give a
complete list of all non-architecturally singular hexapods with 2-dimensional
self-motions.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2014 09:48:04 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Sep 2014 06:19:55 GMT"
}
] | 2014-09-05T00:00:00 |
[
[
"Nawratil",
"Georg",
""
],
[
"Schicho",
"Josef",
""
]
] |
new_dataset
| 0.998961 |
1409.1348
|
Alexandre Pinlou
|
Fran\c{c}ois Dross, Mickael Montassier, Alexandre Pinlou
|
Large induced forests in planar graphs with girth 4 or 5
|
35 pages, 15 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give here some new lower bounds on the order of a largest induced forest
in planar graphs with girth $4$ and $5$. In particular we prove that a
triangle-free planar graph of order $n$ admits an induced forest of order at
least $\frac{6n+7}{11}$ , improving the lower bound of Salavatipour [M. R.
Salavatipour, Large induced forests in triangle-free planar graphs, Graphs and
Combinatorics, 22:113-126, 2006]. We also prove that a planar graph of order
$n$ and girth at least $5$ admits an induced forest of order at least
$\frac{44n+50}{69}$.
|
[
{
"version": "v1",
"created": "Thu, 4 Sep 2014 07:51:15 GMT"
}
] | 2014-09-05T00:00:00 |
[
[
"Dross",
"François",
""
],
[
"Montassier",
"Mickael",
""
],
[
"Pinlou",
"Alexandre",
""
]
] |
new_dataset
| 0.998216 |
1409.1510
|
Mathias Wagner
|
O. Kaczmarek, C. Schmidt, P. Steinbrecher, Swagato Mukherjee, and M.
Wagner
|
HISQ inverter on Intel Xeon Phi and NVIDIA GPUs
|
7 pages, proceedings, presented at the 32nd International Symposium
on Lattice Field Theory (Lattice 2014), June 23 to June 28, 2014, New York,
USA
| null | null | null |
cs.DC hep-lat
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The runtime of a Lattice QCD simulation is dominated by a small kernel, which
calculates the product of a vector by a sparse matrix known as the "Dslash"
operator. Therefore, this kernel is frequently optimized for various HPC
architectures. In this contribution we compare the performance of the Intel
Xeon Phi to current Kepler-based NVIDIA Tesla GPUs running a conjugate gradient
solver. By exposing more parallelism to the accelerator through inverting
multiple vectors at the same time we obtain a performance 250 GFlop/s on both
architectures. This more than doubles the performance of the inversions. We
give a short overview of both architectures, discuss some details of the
implementation and the effort required to obtain the achieved performance.
|
[
{
"version": "v1",
"created": "Thu, 4 Sep 2014 18:13:30 GMT"
}
] | 2014-09-05T00:00:00 |
[
[
"Kaczmarek",
"O.",
""
],
[
"Schmidt",
"C.",
""
],
[
"Steinbrecher",
"P.",
""
],
[
"Mukherjee",
"Swagato",
""
],
[
"Wagner",
"M.",
""
]
] |
new_dataset
| 0.964558 |
1310.0522
|
Liane Gabora
|
Liane Gabora
|
EVOC: A Computer Model of the Evolution of Culture
|
6 pages. arXiv admin note: substantial text overlap with
arXiv:1005.1516, arXiv:0911.2390, arXiv:0811.2551; replaced version corrects
error in reference at top of first page
|
Gabora, L. (2008). EVOC: A computer model of cultural evolution.
In V. Sloutsky, B. Love & K. McRae (Eds.), 30th Annual Meeting of the
Cognitive Science Society. Washington DC, July 23-26, North Salt Lake, UT:
Sheridan Publishing
| null | null |
cs.MA cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EVOC is a computer model of the EVOlution of Culture. It consists of neural
network based agents that invent ideas for actions, and imitate neighbors'
actions. EVOC replicates using a different fitness function the results
obtained with an earlier model (MAV), including (1) an increase in mean fitness
of actions, and (2) an increase and then decrease in the diversity of actions.
Diversity of actions is positively correlated with number of needs, population
size and density, and with the erosion of borders between populations. Slowly
eroding borders maximize diversity, fostering specialization followed by
sharing of fit actions. Square (as opposed to toroidal) worlds also exhibit
higher diversity. Introducing a leader that broadcasts its actions throughout
the population increases the fitness of actions but reduces diversity; these
effects diminish the more leaders there are. Low density populations have less
fit ideas but broadcasting diminishes this effect.
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 23:36:47 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Sep 2014 11:17:43 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Gabora",
"Liane",
""
]
] |
new_dataset
| 0.99937 |
1401.0200
|
Manjish Pal
|
Nabajyoti Medhi, Manjish Pal
|
Sixsoid: A new paradigm for $k$-coverage in 3D Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coverage in 3D wireless sensor network (WSN) is always a very critical issue
to deal with. Coming up with good coverage models implies more energy efficient
networks. $K$-coverage is one model that ensures that every point in a given 3D
Field of Interest (FoI) is guaranteed to be covered by $k$ sensors. When it
comes to 3D, coming up with a deployment of sensors that gurantees $k$-coverage
becomes much more complicated than in 2D. The basic idea is to come up with a
geometrical shape that is guaranteed to be $k$-covered by taking a specific
arrangement of sensors, and then fill the FoI will non-overlapping copies of
this shape. In this work, we propose a new shape for the 3D scenario which we
call a \textbf{Devilsoid}. Prior to this work, the shape which was proposed for
coverage in 3D was the so called \textbf{Reuleaux Tetrahedron}. Our
construction is motivated from a construction that can be applied to the 2D
version of the problem \cite{MS} in which it imples better guarantees over the
\textbf{Reuleaux Triangle}. Our contribution in this paper is twofold, firstly
we show how Devilsoid gurantees more coverage volume over Reuleaux Tetrahedron,
secondly we show how Devilsoid also guarantees simpler and more pragmatic
deployment strategy for 3D wireless sensor networks. In this paper, we show the
constuction of Devilsoid, calculate its volume and discuss its effect on the
$k$-coverage in WSN.
|
[
{
"version": "v1",
"created": "Tue, 31 Dec 2013 18:15:28 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Feb 2014 06:09:40 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Sep 2014 05:58:04 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Medhi",
"Nabajyoti",
""
],
[
"Pal",
"Manjish",
""
]
] |
new_dataset
| 0.995542 |
1401.1239
|
Behzad Asadi
|
Behzad Asadi, Lawrence Ong, and Sarah J. Johnson
|
The Capacity of Three-Receiver AWGN Broadcast Channels with Receiver
Message Side Information
|
This is an extended version of the same-titled paper submitted to
IEEE International Symposium on Information Theory (ISIT) 2014
|
Proceedings of the 2014 IEEE International Symposium on
Information Theory (ISIT 2014), Honolulu, USA, pp. 2899-2903, June 29-July 4,
2014
|
10.1109/ISIT.2014.6875364
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the capacity region of three-receiver AWGN broadcast
channels where the receivers (i) have private-message requests and (ii) know
the messages requested by some other receivers as side information. We classify
these channels based on their side information into eight groups, and construct
different transmission schemes for the groups. For six groups, we characterize
the capacity region, and show that it improves both the best known inner and
outer bounds. For the remaining two groups, we improve the best known inner
bound by using side information during channel decoding at the receivers.
|
[
{
"version": "v1",
"created": "Mon, 6 Jan 2014 23:45:43 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Asadi",
"Behzad",
""
],
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.983164 |
1401.3127
|
Marco Mondelli
|
Marco Mondelli, S. Hamed Hassani, and R\"udiger Urbanke
|
From Polar to Reed-Muller Codes: a Technique to Improve the
Finite-Length Performance
|
8 pages, 7 figures, in IEEE Transactions on Communications, 2014 and
in ISIT'14
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore the relationship between polar and RM codes and we describe a
coding scheme which improves upon the performance of the standard polar code at
practical block lengths. Our starting point is the experimental observation
that RM codes have a smaller error probability than polar codes under MAP
decoding. This motivates us to introduce a family of codes that "interpolates"
between RM and polar codes, call this family ${\mathcal C}_{\rm inter} =
\{C_{\alpha} : \alpha \in [0, 1]\}$, where $C_{\alpha} \big |_{\alpha = 1}$ is
the original polar code, and $C_{\alpha} \big |_{\alpha = 0}$ is an RM code.
Based on numerical observations, we remark that the error probability under MAP
decoding is an increasing function of $\alpha$. MAP decoding has in general
exponential complexity, but empirically the performance of polar codes at
finite block lengths is boosted by moving along the family ${\mathcal C}_{\rm
inter}$ even under low-complexity decoding schemes such as, for instance,
belief propagation or successive cancellation list decoder. We demonstrate the
performance gain via numerical simulations for transmission over the erasure
channel as well as the Gaussian channel.
|
[
{
"version": "v1",
"created": "Tue, 14 Jan 2014 10:29:44 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Apr 2014 15:00:54 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Sep 2014 18:57:01 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Mondelli",
"Marco",
""
],
[
"Hassani",
"S. Hamed",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] |
new_dataset
| 0.996912 |
1409.0887
|
Yi Ouyang
|
Yi Ouyang, Demosthenis Teneketzis
|
Signaling for Decentralized Routing in a Queueing Network
| null | null | null | null |
cs.SY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A discrete-time decentralized routing problem in a service system consisting
of two service stations and two controllers is investigated. Each controller is
affiliated with one station. Each station has an infinite size buffer.
Exogenous customer arrivals at each station occur with rate $\lambda$. Service
times at each station have rate $\mu$. At any time, a controller can route one
of the customers waiting in its own station to the other station. Each
controller knows perfectly the queue length in its own station and observes the
exogenous arrivals to its own station as well as the arrivals of customers sent
from the other station. At the beginning, each controller has a probability
mass function (PMF) on the number of customers in the other station. These PMFs
are common knowledge between the two controllers. At each time a holding cost
is incurred at each station due to the customers waiting at that station. The
objective is to determine routing policies for the two controllers that
minimize either the total expected holding cost over a finite horizon or the
average cost per unit time over an infinite horizon. In this problem there is
implicit communication between the two controllers; whenever a controller
decides to send or not to send a customer from its own station to the other
station it communicates information about its queue length to the other
station. This implicit communication through control actions is referred to as
signaling in decentralized control. Signaling results in complex communication
and decision problems. In spite of the complexity of signaling involved, it is
shown that an optimal signaling strategy is described by a threshold policy
which depends on the common information between the two controllers; this
threshold policy is explicitly determined.
|
[
{
"version": "v1",
"created": "Tue, 2 Sep 2014 20:40:37 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Ouyang",
"Yi",
""
],
[
"Teneketzis",
"Demosthenis",
""
]
] |
new_dataset
| 0.998394 |
1409.1005
|
Alexander Setzer
|
Alexander Setzer
|
The planar minimum linear arrangement problem is different from the
minimum linear arrangement problem
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In various research papers, such as [2], one will find the claim that the
minLA is optimally solvable on outerplanar graphs, with a reference to [1].
However, the problem solved in that publication, which we refer to as the
planar minimum linear arrangement problem (planar minLA), is different from the
minimum linear arrangement problem (minLA), as we show in this article.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 09:22:47 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Setzer",
"Alexander",
""
]
] |
new_dataset
| 0.973739 |
1409.1052
|
Yuzhe Zhou
|
Yuzhe Zhou, Bo Ai
|
Provide High-QoS of the High-Speed Railway Mobile Communications in
Cyber-Physical Systems
|
6 pages, 5 figures, The IEEE International Conference on Cyber,
Physical and Social Computing (CPSCom 2012), accepted for publication,
November, 2012. arXiv admin note: text overlap with arXiv:0805.2854 by other
authors
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Technical advances in networks, embedded computing, and wireless
communications are leading to the next generation of complex intelligent
systems called Cyber-Physical Systems (CPS). CPS promises to transform the way
we interact with the physical world. Efficient and reliable operation of the
CTCS-3 (Chinese Train Control System Level 3) is great protection of the
national economy and public safety. The CTCS-3 is based on GSM-R (GSM for
Railway) to achieve a continuous and two-way transmission of information
between ground and the train. To ensure the growing needs of safety, fastness
and service diversity of China's railway, the pursuit of high-QoS has been the
key of the relative study. This paper examines the main characteristics of
GSM-R and the requirements of all-layers' QoS indicators for GSM-R. Several
main technologies of improving QoS indicators of all-layers are summarized. As
a solution, a comprehensive scheme is proposed to improve the delay and packet
loss indicators. An example is also presented that illustrates the real-time
features of the proposed solution. Based on the CPS characteristics are highly
correlated with the QoS indicators, conclusions are made that GSM-R can provide
a reliable and real-time way for message.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 12:09:27 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Zhou",
"Yuzhe",
""
],
[
"Ai",
"Bo",
""
]
] |
new_dataset
| 0.99869 |
1409.1066
|
Hamed Haddadi
|
Marjan Falahrastegar, Hamed Haddadi, Steve Uhlig, Richard Mortier
|
Anatomy of the Third-Party Web Tracking Ecosystem
| null | null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The presence of third-party tracking on websites has become customary.
However, our understanding of the third-party ecosystem is still very
rudimentary. We examine third-party trackers from a geographical perspective,
observing the third-party tracking ecosystem from 29 countries across the
globe. When examining the data by region (North America, South America, Europe,
East Asia, Middle East, and Oceania), we observe significant geographical
variation between regions and countries within regions. We find trackers that
focus on specific regions and countries, and some that are hosted in countries
outside their expected target tracking domain. Given the differences in
regulatory regimes between jurisdictions, we believe this analysis sheds light
on the geographical properties of this ecosystem and on the problems that these
may pose to our ability to track and manage the different data silos that now
store personal data about us all.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 12:44:43 GMT"
}
] | 2014-09-04T00:00:00 |
[
[
"Falahrastegar",
"Marjan",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Uhlig",
"Steve",
""
],
[
"Mortier",
"Richard",
""
]
] |
new_dataset
| 0.998458 |
1301.5961
|
Natalia Silberstein
|
Natalia Silberstein and Anna-Lena Trautmann
|
New Lower Bounds for Constant Dimension Codes
| null | null |
10.1109/ISIT.2013.6620279
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides new constructive lower bounds for constant dimension
codes, using different techniques such as Ferrers diagram rank metric codes and
pending blocks. Constructions for two families of parameters of constant
dimension codes are presented. The examples of codes obtained by these
constructions are the largest known constant dimension codes for the given
parameters.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 04:15:12 GMT"
}
] | 2014-09-03T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.989636 |
1401.0615
|
Anna-Lena Trautmann
|
Anna-Lena Trautmann
|
Message Encoding for Spread and Orbit Codes
|
Submitted to IEEE International Symposium on Information Theory 2014
| null |
10.1109/ISIT.2014.6875303
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spread codes and orbit codes are special families of constant dimension
subspace codes. These codes have been well-studied for their error correction
capability and transmission rate, but the question of how to encode messages
has not been investigated. In this work we show how the message space can be
chosen for a given code and how message en- and decoding can be done.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2014 10:07:28 GMT"
}
] | 2014-09-03T00:00:00 |
[
[
"Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.997859 |
1409.0753
|
Nicolas Robinson-Garcia
|
Daniel Torres-Salinas, Evaristo Jim\'enez-Contreras and Nicolas
Robinson-Garc\'ia
|
How many citations are there in the Data Citation Index?
|
Presented at the STI Conference held in Leiden, 3-5 september 2014
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Descriptive analysis on the citation distribution of the Thomson Reuters'
Data Citation Index by publication type and four broad areas: Science,
Engineering & Technology, Humanities & Arts and Social Sciences.
|
[
{
"version": "v1",
"created": "Tue, 2 Sep 2014 15:24:34 GMT"
}
] | 2014-09-03T00:00:00 |
[
[
"Torres-Salinas",
"Daniel",
""
],
[
"Jiménez-Contreras",
"Evaristo",
""
],
[
"Robinson-García",
"Nicolas",
""
]
] |
new_dataset
| 0.997013 |
1409.0814
|
Swakkhar Shatabda
|
Rezaul Karim, Mohd. Momin Al Aziz, Swakkhar Shatabda, M. Sohel Rahman,
Md. Abul Kashem Mia, Farhana Zaman and Salman Rakin
|
CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein
Tertiary Structure Retrieval
|
draft
| null | null | null |
cs.CV cs.CE cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the advancements in technology number of entries in the structural
database of proteins are increasing day by day. Methods for retrieving protein
tertiary structures from this large database is the key to comparative analysis
of structures which plays an important role to understand proteins and their
function. In this paper, we present fast and accurate methods for the retrieval
of proteins from a large database with tertiary structures similar to a query
protein. Our proposed methods borrow ideas from the field of computer vision.
The speed and accuracy of our methods comes from the two newly introduced
features, the co-occurrence matrix of the oriented gradient and pyramid
histogram of oriented gradient and from the use of Euclidean distance as the
distance measure. Experimental results clearly indicate the superiority of our
approach in both running time and accuracy. Our method is readily available for
use from this website: http://research.buet.ac.bd:8080/Comograd/.
|
[
{
"version": "v1",
"created": "Tue, 2 Sep 2014 18:26:50 GMT"
}
] | 2014-09-03T00:00:00 |
[
[
"Karim",
"Rezaul",
""
],
[
"Aziz",
"Mohd. Momin Al",
""
],
[
"Shatabda",
"Swakkhar",
""
],
[
"Rahman",
"M. Sohel",
""
],
[
"Mia",
"Md. Abul Kashem",
""
],
[
"Zaman",
"Farhana",
""
],
[
"Rakin",
"Salman",
""
]
] |
new_dataset
| 0.976587 |
1404.6962
|
Cyril Nicaud
|
Cyril Nicaud
|
Fast Synchronization of Random Automata
| null | null | null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A synchronizing word for an automaton is a word that brings that automaton
into one and the same state, regardless of the starting position. Cerny
conjectured in 1964 that if a n-state deterministic automaton has a
synchronizing word, then it has a synchronizing word of size at most (n-1)^2.
Berlinkov recently made a breakthrough in the probabilistic analysis of
synchronization by proving that with high probability, an automaton has a
synchronizing word. In this article, we prove that with high probability an
automaton admits a synchronizing word of length smaller than n^(1+\epsilon),
and therefore that the Cerny conjecture holds with high probability.
|
[
{
"version": "v1",
"created": "Mon, 28 Apr 2014 12:51:04 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Sep 2014 09:48:55 GMT"
}
] | 2014-09-02T00:00:00 |
[
[
"Nicaud",
"Cyril",
""
]
] |
new_dataset
| 0.987184 |
1409.0296
|
Thienne Johnson
|
Thienne Johnson, Jorge Vergara, Chelsea Doll, Madison Kramer, Gayathri
Sundararaman, Harsha Rajendran, Alon Efrat, Melanie Hingle
|
A Mobile Food Recommendation System Based on The Traffic Light Diet
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Innovative, real-time solutions are needed to address the mismatch between
the demand for and supply of critical information to inform and motivate diet
and health-related behavior change. Research suggests that interventions using
mobile health technologies hold great promise for influencing knowledge,
attitudes, and behaviors related to energy balance. The objective of this paper
is to present insights related to the development and testing of a mobile food
recommendation system targeting fast food restaurants. The system is designed
to provide consumers with information about energy density of food options
combined with tips for healthier choices when dining out, accessible through a
mobile phone.
|
[
{
"version": "v1",
"created": "Mon, 1 Sep 2014 06:18:23 GMT"
}
] | 2014-09-02T00:00:00 |
[
[
"Johnson",
"Thienne",
""
],
[
"Vergara",
"Jorge",
""
],
[
"Doll",
"Chelsea",
""
],
[
"Kramer",
"Madison",
""
],
[
"Sundararaman",
"Gayathri",
""
],
[
"Rajendran",
"Harsha",
""
],
[
"Efrat",
"Alon",
""
],
[
"Hingle",
"Melanie",
""
]
] |
new_dataset
| 0.995987 |
1409.0413
|
Bernhard Rumpe
|
Christian Berger, Bernhard Rumpe
|
Autonomous Driving - 5 Years after the Urban Challenge: The Anticipatory
Vehicle as a Cyber-Physical System
|
10 pages, 7 figures
|
Proceedings of the 10th Workshop on Automotive Software
Engineering (ASE 2012), pp. 789-798, Braunschweig, September 2012
| null | null |
cs.RO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In November 2007 the international competition DARPA Urban Challenge took
place on the former George Airforce Base in Victorville, California to
significantly promote the research and development on autonomously driving
vehicles for urban environments. In the final race only eleven out of initially
89 competitors participated and "Boss" from Carnegie Mellon University
succeeded. This paper summarizes results of the research carried out by all
finalists within the last five years after the competition and provides an
outlook where further investigation especially for software engineering is now
necessary to achieve the goal of driving safely and reliably through urban
environments with an anticipatory vehicle for the mass-market.
|
[
{
"version": "v1",
"created": "Mon, 1 Sep 2014 13:21:17 GMT"
}
] | 2014-09-02T00:00:00 |
[
[
"Berger",
"Christian",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.987809 |
1409.0415
|
Bernhard Rumpe
|
Christoph Herrmann, Thomas Kurpick, Bernhard Rumpe
|
SSELab: A Plug-In-Based Framework for Web-Based Project Portals
|
6 pages, 5 figures. Proceedings of the 2nd International Workshop on
Developing Tools as Plug-Ins (TOPI 2012) at ICSE 2012, June 3, Zurich,
Switzerland, 2012
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tools are an essential part of every software engineering project. But the
number of tools that are used in all phases of the software development
life-cycle and their complexity is growing continually. Consequently, the setup
and maintenance of current tool chains and development environments requires
much effort and consumes a lot of time. One approach to counter this, is to
employ web-based systems for development tasks, because centralized systems
simplify the administration and the deployment of new features. But desktop
IDEs play an important role in software development projects today, and will
not be replaced entirely by web-based environments in the near future.
Therefore, supporting a mixture of hosted tools and tools integrated into
desktop IDEs is a sensible approach. In this paper, we present the SSELab, a
framework for web- based project portals that attempts to migrate more software
development tools from desktop to server environments, but still allows their
integration into modern desktop IDEs. It supports the deployment of tools as
hosted services using plug-in systems on the server-side. Additionally, it
provides access to these tools by a set of clients that can be used in
different contexts, either from the command line, from within IDEs such as
Eclipse, or from web pages. In the paper, we discuss the architecture and the
extensibility of the SSELab framework. Furthermore, we share our experiences
with creating an instance of the framework and integrating various tools for
our own software development projects.
|
[
{
"version": "v1",
"created": "Mon, 1 Sep 2014 13:24:14 GMT"
}
] | 2014-09-02T00:00:00 |
[
[
"Herrmann",
"Christoph",
""
],
[
"Kurpick",
"Thomas",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.999766 |
1409.0461
|
Luca Grilli
|
Michael A. Bekos and Sabine Cornelsen and Luca Grilli and Seok-Hee
Hong and Michael Kaufmann
|
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
| null | null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fan-planar graphs were recently introduced as a generalization of 1-planar
graphs. A graph is fan-planar if it can be embedded in the plane, such that
each edge that is crossed more than once, is crossed by a bundle of two or more
edges incident to a common vertex. A graph is outer-fan-planar if it has a
fan-planar embedding in which every vertex is on the outer face. If, in
addition, the insertion of an edge destroys its outer-fan-planarity, then it is
maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm
to test whether a given graph is maximal outer-fan-planar. The algorithm can
also be employed to produce an outer-fan-planar embedding, if one exists. On
the negative side, we show that testing fan-planarity of a graph is NP-hard,
for the case where the rotation system (i.e., the cyclic order of the edges
around each vertex) is given.
|
[
{
"version": "v1",
"created": "Mon, 1 Sep 2014 16:01:42 GMT"
}
] | 2014-09-02T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"Cornelsen",
"Sabine",
""
],
[
"Grilli",
"Luca",
""
],
[
"Hong",
"Seok-Hee",
""
],
[
"Kaufmann",
"Michael",
""
]
] |
new_dataset
| 0.999742 |
1205.7014
|
Bernhard Haeupler
|
Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian
|
Broadcast Throughput in Radio Networks: Routing vs. Network Coding
| null | null |
10.1137/1.9781611973402.132
| null |
cs.DS cs.DC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The broadcast throughput in a network is defined as the average number of
messages that can be transmitted per unit time from a given source to all other
nodes when time goes to infinity.
Classical broadcast algorithms treat messages as atomic tokens and route them
from the source to the receivers by making intermediate nodes store and forward
messages. The more recent network coding approach, in contrast, prompts
intermediate nodes to mix and code together messages. It has been shown that
certain wired networks have an asymptotic network coding gap, that is, they
have asymptotically higher broadcast throughput when using network coding
compared to routing. Whether such a gap exists for wireless networks has been
an open question of great interest. We approach this question by studying the
broadcast throughput of the radio network model which has been a standard
mathematical model to study wireless communication.
We show that there is a family of radio networks with a tight $\Theta(\log
\log n)$ network coding gap, that is, networks in which the asymptotic
throughput achievable via routing messages is a $\Theta(\log \log n)$ factor
smaller than that of the optimal network coding algorithm. We also provide new
tight upper and lower bounds that show that the asymptotic worst-case broadcast
throughput over all networks with $n$ nodes is $\Theta(1 / \log n)$
messages-per-round for both routing and network coding.
|
[
{
"version": "v1",
"created": "Thu, 31 May 2012 15:03:58 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Oct 2012 17:27:02 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Aug 2014 14:36:35 GMT"
}
] | 2014-08-29T00:00:00 |
[
[
"Alon",
"Noga",
""
],
[
"Ghaffari",
"Mohsen",
""
],
[
"Haeupler",
"Bernhard",
""
],
[
"Khabbazian",
"Majid",
""
]
] |
new_dataset
| 0.956593 |
1408.6591
|
Nico Pietroni
|
Nico Pietroni, Davide Tonelli, Enrico Puppo, Maurizio Froli, Roberto
Scopigno, Paolo Cignoni
|
Voronoi Grid-Shell Structures
|
10 pages
| null | null | null |
cs.GR cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a framework for the generation of grid-shell structures that is
based on Voronoi diagrams and allows us to design tessellations that achieve
excellent static performances. We start from an analysis of stress on the input
surface and we use the resulting tensor field to induce an anisotropic
non-Euclidean metric over it. Then we compute a Centroidal Voronoi Tessellation
under the same metric. The resulting mesh is hex-dominant and made of cells
with a variable density, which depends on the amount of stress, and anisotropic
shape, which depends on the direction of maximum stress. This mesh is further
optimized taking into account symmetry and regularity of cells to improve
aesthetics. We demonstrate that our grid-shells achieve better static
performances with respect to quad-based grid shells, while offering an
innovative and aesthetically pleasing look.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 14:23:57 GMT"
}
] | 2014-08-29T00:00:00 |
[
[
"Pietroni",
"Nico",
""
],
[
"Tonelli",
"Davide",
""
],
[
"Puppo",
"Enrico",
""
],
[
"Froli",
"Maurizio",
""
],
[
"Scopigno",
"Roberto",
""
],
[
"Cignoni",
"Paolo",
""
]
] |
new_dataset
| 0.998594 |
1408.6610
|
Zhengjun Cao
|
Zhengjun Cao and Lihua Liu
|
The Barth-Boneh-Waters Private Broadcast Encryption Scheme Revisited
|
7 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The primitive of private broadcast encryption introduced by Barth, Boneh and
Waters, is used to encrypt a message to several recipients while hiding the
identities of the recipients. In their construction, a recipient has to first
decrypt the received ciphertext to extract the verification key for one-time
signature. He then uses the verification key to check whether the ciphertext is
malformed. The authors did not consider that information delivered over a
channel, especially over a broadcast channel, should be authenticated as to its
origin. We remark that the conventional public key signature suffices to
authenticate data origin and filter out all malformed ciphertexts. We also
discuss the disadvantages of the primitive of one-time signature used in their
construction.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2014 02:36:14 GMT"
}
] | 2014-08-29T00:00:00 |
[
[
"Cao",
"Zhengjun",
""
],
[
"Liu",
"Lihua",
""
]
] |
new_dataset
| 0.999559 |
1408.6661
|
Nikolaos Polatidis Mr
|
Nikolaos Polatidis
|
SFA Referee Allocation Scheme
| null | null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
For many sports, the allocation of officials to matches is performed manually
and is a very time consuming procedure. For the Scottish Football Association
(SFA), the allocation of referees and other officials to matches is governed by
a number of rules specifying the expertise required from the different types of
official at each level, e.g. Scottish Premiership League referee must be a
grade 1 with high experience. The allocation requires an SFA secretary to
expend several hours to find suitable officials, contact them and assign them.
Most of the time, the secretary is a volunteer who performs the allocation as a
hobby and it would be useful to reduce his costs and time.
The project aims to reduce the burden on SFA, and potentially other
secretaries, by developing a program to assign SFA officials. A suitable
algorithm must be devised to search through the set of data about matches and
officials and find a potential allocation. The program then updates the
database with the new data, and provides a web interface for both secretaries
and officials.
A prototype system using the new greedy algorithm has been implemented and
evaluated with SFA secretaries. A final usable referee allocation system has
been designed that uses the greedy algorithm, and is extended after evaluation
of the prototype. The final allocation system based provides both a command
line and a web interface and has also been evaluated by SFA secretaries. In
their letters of recommendation in Appendix F the SFA secretaries indicate that
the final allocation system it will be used again in the future.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2014 09:52:19 GMT"
}
] | 2014-08-29T00:00:00 |
[
[
"Polatidis",
"Nikolaos",
""
]
] |
new_dataset
| 0.998513 |
1408.6762
|
Nikolaos Polatidis Mr
|
Nikolaos Polatidis
|
Chatbot for admissions
| null | null | null | null |
cs.CY cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The communication of potential students with a university department is
performed manually and it is a very time consuming procedure. The opportunity
to communicate with on a one-to-one basis is highly valued. However with many
hundreds of applications each year, one-to-one conversations are not feasible
in most cases. The communication will require a member of academic staff to
expend several hours to find suitable answers and contact each student. It
would be useful to reduce his costs and time.
The project aims to reduce the burden on the head of admissions, and
potentially other users, by developing a convincing chatbot. A suitable
algorithm must be devised to search through the set of data and find a
potential answer. The program then replies to the user and provides a relevant
web link if the user is not satisfied by the answer. Furthermore a web
interface is provided for both users and an administrator.
The achievements of the project can be summarised as follows. To prepare the
background of the project a literature review was undertaken, together with an
investigation of existing tools, and consultation with the head of admissions.
The requirements of the system were established and a range of algorithms and
tools were investigated, including keyword and template matching. An algorithm
that combines keyword matching with string similarity has been developed. A
usable system using the proposed algorithm has been implemented. The system was
evaluated by keeping logs of questions and answers and by feedback received by
potential students that used it.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2014 16:01:10 GMT"
}
] | 2014-08-29T00:00:00 |
[
[
"Polatidis",
"Nikolaos",
""
]
] |
new_dataset
| 0.992311 |
1408.6010
|
Gradeigh Clark
|
Gradeigh D. Clark and Janne Lindqvist
|
Engineering Gesture-Based Authentication Systems
| null | null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gestures are a topic of increasing interest in authentication and successful
implementation as a security layer requires reliable gesture recognition. So
far much work focuses on new ways to recognize gestures, leaving discussion on
the viability of recognition in an authentication scheme to the background.
It is unclear how recognition should be deployed for practical and robust
real-world authentication. In this article, we analyze the effectiveness of
different approaches to recognizing gestures and the potential for use in
secure gesture-based authentication systems.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 05:22:24 GMT"
}
] | 2014-08-28T00:00:00 |
[
[
"Clark",
"Gradeigh D.",
""
],
[
"Lindqvist",
"Janne",
""
]
] |
new_dataset
| 0.998028 |
1408.6315
|
Rahul Mehta
|
Rahul Mehta
|
2048 is (PSPACE) Hard, but Sometimes Easy
|
13 pages, 11 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that a variant of 2048, a popular online puzzle game, is
PSPACE-Complete. Our hardness result holds for a version of the problem where
the player has oracle access to the computer player's moves. Specifically, we
show that for an $n \times n$ game board $\mathcal{G}$, computing a sequence of
moves to reach a particular configuration $\mathbb{C}$ from an initial
configuration $\mathbb{C}_0$ is PSPACE-Complete. Our reduction is from
Nondeterministic Constraint Logic (NCL). We also show that determining whether
or not there exists a fixed sequence of moves $\mathcal{S} \in \{\Uparrow,
\Downarrow, \Leftarrow, \Rightarrow\}^k$ of length $k$ that results in a
winning configuration for an $n \times n$ game board is fixed-parameter
tractable (FPT). We describe an algorithm to solve this problem in $O(4^k n^2)$
time.
|
[
{
"version": "v1",
"created": "Wed, 27 Aug 2014 05:23:43 GMT"
}
] | 2014-08-28T00:00:00 |
[
[
"Mehta",
"Rahul",
""
]
] |
new_dataset
| 0.999745 |
1408.6451
|
Christoph Waldhauser
|
Christoph Waldhauser
|
Public Spheres in Twitter- and Blogosphere. Evidence from the US
|
15 pages, 3 figures, presented at the European Political Science
Conference EPSA 2014
| null | null | null |
cs.SI physics.soc-ph stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The political requires a forum for its deliberation and Habermas has located
it in the public spheres. Originally, mass media's role was one of a
facilitator of these debates. However, under the immense pressures of free
market competition and mobile audiences, mass media prefers episodic over
thematic news. On the opposite end of the spectrum, social media has been
heralded as a new forum, a reincarnation of the ailing public spheres to
further the deliberation of the political. But do the followers of political
parties in social media endorse thematic or episodic content?
To answer this question, I look at the most recent 3,200 tweets that were
broadcast from the Republican and Democratic Twitter accounts. By employing
Latent dirichlet allocation, I extract the prevailing topics of these tweets
and linked websites. Generalized linear models are used to describe the
relationship between episodicity, thematicity and the endorsement counts of the
posts analyzed.
I find that there is a stark contrast between the behavior of Democratic and
Republican followers. In general, there seems to be a slight preference for
thematic messages. Interestingly, the distance to an election increases the
odds of a message to be endorsed.
|
[
{
"version": "v1",
"created": "Wed, 27 Aug 2014 16:07:57 GMT"
}
] | 2014-08-28T00:00:00 |
[
[
"Waldhauser",
"Christoph",
""
]
] |
new_dataset
| 0.998821 |
1406.1069
|
EPTCS
|
Bernd Finkbeiner (Universit\"at des Saarlandes), Ernst-R\"udiger
Olderog (Carl von Ossietzky Universit\"at Oldenburg)
|
Petri Games: Synthesis of Distributed Systems with Causal Memory
|
In Proceedings GandALF 2014, arXiv:1408.5560
|
EPTCS 161, 2014, pp. 217-230
|
10.4204/EPTCS.161.19
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new multiplayer game model for the interaction and the flow of
information in a distributed system. The players are tokens on a Petri net. As
long as the players move in independent parts of the net, they do not know of
each other; when they synchronize at a joint transition, each player gets
informed of the causal history of the other player. We show that for Petri
games with a single environment player and an arbitrary bounded number of
system players, deciding the existence of a safety strategy for the system
players is EXPTIME-complete.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2014 15:07:19 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Aug 2014 08:15:16 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Finkbeiner",
"Bernd",
"",
"Universität des Saarlandes"
],
[
"Olderog",
"Ernst-Rüdiger",
"",
"Carl von Ossietzky Universität Oldenburg"
]
] |
new_dataset
| 0.99894 |
1408.5920
|
Michael Bekos
|
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, and Robert Krug
|
Planar Octilinear Drawings with One Bend Per Edge
| null | null | null | null |
cs.DS
|
http://creativecommons.org/licenses/publicdomain/
|
In octilinear drawings of planar graphs, every edge is drawn as an
alternating sequence of horizontal, vertical and diagonal ($45^\circ$)
line-segments. In this paper, we study octilinear drawings of low edge
complexity, i.e., with few bends per edge. A $k$-planar graph is a planar graph
in which each vertex has degree less or equal to $k$. In particular, we prove
that every 4-planar graph admits a planar octilinear drawing with at most one
bend per edge on an integer grid of size $O(n^2) \times O(n)$. For 5-planar
graphs, we prove that one bend per edge still suffices in order to construct
planar octilinear drawings, but in super-polynomial area. However, for 6-planar
graphs we give a class of graphs whose planar octilinear drawings require at
least two bends per edge.
|
[
{
"version": "v1",
"created": "Mon, 25 Aug 2014 20:26:34 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"Gronemann",
"Martin",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Krug",
"Robert",
""
]
] |
new_dataset
| 0.999312 |
1408.5957
|
EPTCS
|
Peter Faymonville (Saarland University), Martin Zimmermann (Saarland
University)
|
Parametric Linear Dynamic Logic
|
In Proceedings GandALF 2014, arXiv:1408.5560
|
EPTCS 161, 2014, pp. 60-73
|
10.4204/EPTCS.161.8
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear
Dynamic Logic (LDL) by temporal operators equipped with parameters that bound
their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL)
that is able to express all $\omega$-regular specifications while still
maintaining many of LTL's desirable properties like an intuitive syntax and a
translation into non-deterministic B\"uchi automata of exponential size. But
LDL lacks capabilities to express timing constraints. By adding parameterized
operators to LDL, we obtain a logic that is able to express all
$\omega$-regular properties and that subsumes parameterized extensions of LTL
like Parametric LTL and PROMPT-LTL. Our main technical contribution is a
translation of PLDL formulas into non-deterministic B\"uchi word automata of
exponential size via alternating automata. This yields a PSPACE model checking
algorithm and a realizability algorithm with doubly-exponential running time.
Furthermore, we give tight upper and lower bounds on optimal parameter values
for both problems. These results show that PLDL model checking and
realizability are not harder than LTL model checking and realizability.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 01:14:51 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Faymonville",
"Peter",
"",
"Saarland University"
],
[
"Zimmermann",
"Martin",
"",
"Saarland\n University"
]
] |
new_dataset
| 0.996386 |
1408.5960
|
EPTCS
|
Angelo Montanari (Department of Mathematics and Computer Science
University of Udine), Pietro Sala (Department of Computer Science University
of Verona)
|
Interval-based Synthesis
|
In Proceedings GandALF 2014, arXiv:1408.5560
|
EPTCS 161, 2014, pp. 102-115
|
10.4204/EPTCS.161.11
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the synthesis problem for Halpern and Shoham's modal logic of
intervals extended with an equivalence relation over time points, abbreviated
HSeq. In analogy to the case of monadic second-order logic of one successor,
the considered synthesis problem receives as input an HSeq formula phi and a
finite set Sigma of propositional variables and temporal requests, and it
establishes whether or not, for all possible evaluations of elements in Sigma
in every interval structure, there exists an evaluation of the remaining
propositional variables and temporal requests such that the resulting structure
is a model for phi. We focus our attention on decidability of the synthesis
problem for some meaningful fragments of HSeq, whose modalities are drawn from
the set A (meets), Abar (met by), B (begins), Bbar (begun by), interpreted over
finite linear orders and natural numbers. We prove that the fragment ABBbareq
is decidable (non-primitive recursive hard), while the fragment AAbarBBbar
turns out to be undecidable. In addition, we show that even the synthesis
problem for ABBbar becomes undecidable if we replace finite linear orders by
natural numbers.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 01:15:22 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Montanari",
"Angelo",
"",
"Department of Mathematics and Computer Science\n University of Udine"
],
[
"Sala",
"Pietro",
"",
"Department of Computer Science University\n of Verona"
]
] |
new_dataset
| 0.998459 |
1408.5964
|
EPTCS
|
Jason Jaskolka (McMaster University), Ridha Khedri (McMaster
University)
|
A Formulation of the Potential for Communication Condition using C2KA
|
In Proceedings GandALF 2014, arXiv:1408.5560
|
EPTCS 161, 2014, pp. 161-174
|
10.4204/EPTCS.161.15
| null |
cs.LO cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An integral part of safeguarding systems of communicating agents from covert
channel communication is having the ability to identify when a covert channel
may exist in a given system and which agents are more prone to covert channels
than others. In this paper, we propose a formulation of one of the necessary
conditions for the existence of covert channels: the potential for
communication condition. Then, we discuss when the potential for communication
is preserved after the modification of system agents in a potential
communication path. Our approach is based on the mathematical framework of
Communicating Concurrent Kleene Algebra (C2KA). While existing approaches only
consider the potential for communication via shared environments, the approach
proposed in this paper also considers the potential for communication via
external stimuli.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 01:16:04 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Jaskolka",
"Jason",
"",
"McMaster University"
],
[
"Khedri",
"Ridha",
"",
"McMaster\n University"
]
] |
new_dataset
| 0.985102 |
1408.5965
|
EPTCS
|
Yuki Osada (The University of Western Australia), Tim French (The
University of Western Australia), Mark Reynolds (The University of Western
Australia), Harry Smallbone (The University of Western Australia)
|
Hourglass Automata
|
In Proceedings GandALF 2014, arXiv:1408.5560
|
EPTCS 161, 2014, pp. 175-188
|
10.4204/EPTCS.161.16
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we define the class of hourglass automata, which are timed
automata with bounded clocks that can be made to progress backwards as well as
forwards at a constant rate. We then introduce a new clock update for timed
automata that allows hourglass automata to be expressed. This allows us to show
that language emptiness remains decidable with this update when the number of
clocks is two or less. This is done by showing that we can construct a finite
untimed graph using clock regions from any timed automaton that use this new
update.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2014 01:16:15 GMT"
}
] | 2014-08-27T00:00:00 |
[
[
"Osada",
"Yuki",
"",
"The University of Western Australia"
],
[
"French",
"Tim",
"",
"The\n University of Western Australia"
],
[
"Reynolds",
"Mark",
"",
"The University of Western\n Australia"
],
[
"Smallbone",
"Harry",
"",
"The University of Western Australia"
]
] |
new_dataset
| 0.982068 |
1312.4678
|
Djamal Belazzougui
|
Ibrahim Chegrane and Djamal Belazzougui
|
Simple, compact and robust approximate string dictionary
|
Accepted to a journal (19 pages, 2 figures)
| null | null | null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with practical implementations of approximate string
dictionaries that allow edit errors. In this problem, we have as input a
dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size
$\sigma$. Given a bound $k$ and a pattern $x$ of length $m$, a query has to
return all the strings of the dictionary which are at edit distance at most $k$
from $x$, where the edit distance between two strings $x$ and $y$ is defined as
the minimum-cost sequence of edit operations that transform $x$ into $y$. The
cost of a sequence of operations is defined as the sum of the costs of the
operations involved in the sequence. In this paper, we assume that each of
these operations has unit cost and consider only three operations: deletion of
one character, insertion of one character and substitution of a character by
another. We present a practical implementation of the data structure we
recently proposed and which works only for one error. We extend the scheme to
$2\leq k<m$. Our implementation has many desirable properties: it has a very
fast and space-efficient building algorithm. The dictionary data structure is
compact and has fast and robust query time. Finally our data structure is
simple to implement as it only uses basic techniques from the literature,
mainly hashing (linear probing and hash signatures) and succinct data
structures (bitvectors supporting rank queries).
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 07:54:49 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Aug 2014 01:50:57 GMT"
}
] | 2014-08-26T00:00:00 |
[
[
"Chegrane",
"Ibrahim",
""
],
[
"Belazzougui",
"Djamal",
""
]
] |
new_dataset
| 0.993411 |
1408.5543
|
Tao Cheng
|
Tao Cheng
|
Restricted Conformal Property of Compressive Sensing
|
11 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy and direction are tow basic properties of a vector. A discrete signal
is a vector in nature. RIP of compressive sensing can not show the direction
information of a signal but show the energy information of a signal. Hence, RIP
is not complete. Orthogonal matrices can preserve angles and lengths.
Preservation of length can show energies of signals like RIP do; and
preservation of angle can show directions of signals. Therefore, Restricted
Conformal Property (RCP) is proposed according to preservation of angle. RCP
can show the direction of a signal just as RIP shows the energy of a signal.
RCP is important supplement and development of RIP. Tow different proofs of RCP
are given, namely, RCP_JL and RCP_IP.
|
[
{
"version": "v1",
"created": "Sun, 24 Aug 2014 02:00:59 GMT"
}
] | 2014-08-26T00:00:00 |
[
[
"Cheng",
"Tao",
""
]
] |
new_dataset
| 0.954934 |
1408.5560
|
EPTCS
|
Adriano Peron (Universit\`a di Napoli Federico II), Carla Piazza
(Universit\`a degli Studi di Udine)
|
Proceedings Fifth International Symposium on Games, Automata, Logics and
Formal Verification
| null |
EPTCS 161, 2014
|
10.4204/EPTCS.161
| null |
cs.GT cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Fifth International Symposium on
Games, Automata, Logic and Formal Verification (GandALF 2014). The symposium
took place in Verona, Italy, from 10th to 12th of September 2014. The
proceedings of the symposium contain the abstracts of three invited talks and
19 papers that were accepted after a careful evaluation for presentation at the
conference. The topics of the accepted papers range over a wide spectrum,
including algorithmic and behavioral game theory, game semantics, formal
languages and automata theory, modal and temporal logics, software
verification, hybrid systems.
|
[
{
"version": "v1",
"created": "Sun, 24 Aug 2014 05:25:36 GMT"
}
] | 2014-08-26T00:00:00 |
[
[
"Peron",
"Adriano",
"",
"Università di Napoli Federico II"
],
[
"Piazza",
"Carla",
"",
"Università degli Studi di Udine"
]
] |
new_dataset
| 0.981587 |
1408.5696
|
Bernhard Rumpe
|
Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe
|
Synthesis of Component and Connector Models from Crosscutting Structural
Views
|
11 pages, 10 figures
|
Joint Meeting of the European Software Engineering Conference and
the ACM SIGSOFT Symposium on the Foundations of Software Engineering
(ESEC/FSE'13), Eds.: B. Meyer, L. Baresi, M. Mezini, pages 444-454, ACM New
York, 2013
|
10.1145/2491411.2491414
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present component and connector (C&C) views, which specify structural
properties of component and connector models in an expressive and intuitive
way. C&C views provide means to abstract away direct hierarchy, direct
connectivity, port names and types, and thus can crosscut the traditional
boundaries of the implementation-oriented hierarchical decomposition of systems
and sub-systems, and reflect the partial knowledge available to different
stakeholders involved in a system's design. As a primary application for C&C
views we investigate the synthesis problem: given a C&C views specification,
consisting of mandatory, alternative, and negative views, construct a concrete
satisfying C&C model, if one exists. We show that the problem is NP-hard and
solve it, in a bounded scope, using a reduction to SAT, via Alloy. We further
extend the basic problem with support for library components, specification
patterns, and architectural styles. The result of synthesis can be used for
further exploration, simulation, and refinement of the C&C model or, as the
complete, final model itself, for direct code generation. A prototype tool and
an evaluation over four example systems with multiple specifications show
promising results and suggest interesting future research directions towards a
comprehensive development environment for the structure of component and
connector designs.
|
[
{
"version": "v1",
"created": "Mon, 25 Aug 2014 09:30:53 GMT"
}
] | 2014-08-26T00:00:00 |
[
[
"Maoz",
"Shahar",
""
],
[
"Ringert",
"Jan Oliver",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.988782 |
1408.5870
|
Janarbek Matai
|
Janarbek Matai, Dustin Richmond, Dajung Lee, Ryan Kastner
|
Enabling FPGAs for the Masses
|
Presented at First International Workshop on FPGAs for Software
Programmers (FSP 2014) (arXiv:1408.4423)
| null | null |
FSP/2014/03
|
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implementing an application on a FPGA remains a difficult, non-intuitive task
that often requires hardware design expertise in a hardware description
language (HDL). High-level synthesis (HLS) raises the design abstraction from
HDL to languages such as C/C++/Scala/Java. Despite this, in order to get a good
quality of result (QoR), a designer must carefully craft the HLS code. In other
words, HLS designers must implement the application using an abstract language
in a manner that generates an efficient micro-architecture; we call this
process writing restructured code. This reduces the benefits of implementing
the application at a higher level of abstraction and limits the impact of HLS
by requiring explicit knowledge of the underlying hardware architecture.
Developers must know how to write code that reflects low level implementation
details of the application at hand as it is interpreted by HLS tools. As a
result, FPGA design still largely remains job of either hardware engineers or
expert HLS designers. In this work, we aim to take a step towards making HLS
tools useful for a broader set of programmers. To do this, we study
methodologies of restructuring software code for HLS tools; we provide examples
of designing different kernels in state-of-the art HLS tools; and we present a
list of challenges for developing a hardware programming model for software
programmers.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 16:46:48 GMT"
}
] | 2014-08-26T00:00:00 |
[
[
"Matai",
"Janarbek",
""
],
[
"Richmond",
"Dustin",
""
],
[
"Lee",
"Dajung",
""
],
[
"Kastner",
"Ryan",
""
]
] |
new_dataset
| 0.999306 |
1408.5401
|
M\'ario V\'estias
|
M\'ario V\'estias, Hor\'acio Neto
|
A Many-Core Overlay for High-Performance Embedded Computing on FPGAs
|
Presented at First International Workshop on FPGAs for Software
Programmers (FSP 2014) (arXiv:1408.4423)
| null | null |
FSP/2014/14
|
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a configurable many-core overlay for
high-performance embedded computing. The size of internal memory, supported
operations and number of ports can be configured independently for each core of
the overlay. The overlay was evaluated with matrix multiplication, LU
decomposition and Fast-Fourier Transform (FFT) on a ZYNQ-7020 FPGA platform.
The results show that using a system-level many-core overlay avoids complex
hardware design and still provides good performance results.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 11:57:16 GMT"
}
] | 2014-08-25T00:00:00 |
[
[
"Véstias",
"Mário",
""
],
[
"Neto",
"Horácio",
""
]
] |
new_dataset
| 0.990712 |
1306.6710
|
Trent Rogers
|
Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T.
Schweller, Scott M. Summers, and Damien Woods
|
The two-handed tile assembly model is not intrinsically universal
| null | null | null | null |
cs.CG cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The well-studied Two-Handed Tile Assembly Model (2HAM) is a model of tile
assembly in which pairs of large assemblies can bind, or self-assemble,
together. In order to bind, two assemblies must have matching glues that can
simultaneously touch each other, and stick together with strength that is at
least the temperature $\tau$, where $\tau$ is some fixed positive integer. We
ask whether the 2HAM is intrinsically universal, in other words we ask: is
there a single universal 2HAM tile set $U$ which can be used to simulate any
instance of the model? Our main result is a negative answer to this question.
We show that for all $\tau' < \tau$, each temperature-$\tau'$ 2HAM tile system
does not simulate at least one temperature-$\tau$ 2HAM tile system. This
impossibility result proves that the 2HAM is not intrinsically universal, in
stark contrast to the simpler (single-tile addition only) abstract Tile
Assembly Model which is intrinsically universal ("The tile assembly model is
intrinsically universal", FOCS 2012). However, on the positive side, we prove
that, for every fixed temperature $\tau \geq 2$, temperature-$\tau$ 2HAM tile
systems are indeed intrinsically universal: in other words, for each $\tau$
there is a single universal 2HAM tile set $U$ that, when appropriately
initialized, is capable of simulating the behavior of any temperature-$\tau$
2HAM tile system. As a corollary of these results we find an infinite set of
infinite hierarchies of 2HAM systems with strictly increasing simulation power
within each hierarchy. Finally, we show that for each $\tau$, there is a
temperature-$\tau$ 2HAM system that simultaneously simulates all
temperature-$\tau$ 2HAM systems.
|
[
{
"version": "v1",
"created": "Fri, 28 Jun 2013 04:06:31 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Aug 2014 20:46:09 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Rogers",
"Trent A.",
""
],
[
"Schweller",
"Robert T.",
""
],
[
"Summers",
"Scott M.",
""
],
[
"Woods",
"Damien",
""
]
] |
new_dataset
| 0.995502 |
1408.4793
|
Luca Matteis
|
Luca Matteis
|
Restpark: Minimal RESTful API for Retrieving RDF Triples
| null | null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
How do RDF datasets currently get published on the Web? They are either
available as large RDF files, which need to be downloaded and processed
locally, or they exist behind complex SPARQL endpoints. By providing a RESTful
API that can access triple data, we allow users to query a dataset through a
simple interface based on just a couple of HTTP parameters. If RDF resources
were published this way we could quickly build applications that depend on
these datasets, without having to download and process them locally. This is
what Restpark is: a set of HTTP GET parameters that servers need to handle, and
respond with JSON-LD.
|
[
{
"version": "v1",
"created": "Tue, 19 Aug 2014 22:57:41 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Matteis",
"Luca",
""
]
] |
new_dataset
| 0.964345 |
1408.4925
|
Scott Deeann Chen
|
Scott Deeann Chen
|
A Crude Analysis of Twitch Plays Pokemon
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We model and study the game mechanisms and human behavior of the anarchy mode
in Twitch Plays Pokemon with a pure-jump continuous-time Markov process. We
computed the winning probability and expected game time for $1$ player and $N$
players and identified when collaboration helps. A numerical plug-in example is
also provided.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 09:10:24 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Chen",
"Scott Deeann",
""
]
] |
new_dataset
| 0.952086 |
1408.4933
|
Thomas Hackl
|
Oswin Aichholzer and Thomas Hackl and Sarah Lutteropp and Tamara
Mchedlidze and Birgit Vogtenhuber
|
Embedding Four-directional Paths on Convex Point Sets
|
11 pages, full conference version including all proofs
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A directed path whose edges are assigned labels "up", "down", "right", or
"left" is called \emph{four-directional}, and \emph{three-directional} if at
most three out of the four labels are used. A \emph{direction-consistent
embedding} of an \mbox{$n$-vertex} four-directional path $P$ on a set $S$ of
$n$ points in the plane is a straight-line drawing of $P$ where each vertex of
$P$ is mapped to a distinct point of $S$ and every edge points to the direction
specified by its label. We study planar direction-consistent embeddings of
three- and four-directional paths and provide a complete picture of the problem
for convex point sets.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 10:02:55 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Aichholzer",
"Oswin",
""
],
[
"Hackl",
"Thomas",
""
],
[
"Lutteropp",
"Sarah",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] |
new_dataset
| 0.977273 |
1408.4978
|
Bernhard Rumpe
|
Carsten Kolassa, Dirk Riehle, Michel A. Salim
|
The Empirical Commit Frequency Distribution of Open Source Projects
|
8 pages, 7 figures. WikiSym '13 Proceedings of the 9th International
Symposium on Open Collaboration
|
Proceedings of the 2013 Joint International Symposium on Wikis and
Open Collaboration (WikiSym + OpenSym 2013). Page 18:1--18:8. ACM, 2013
|
10.1145/2491055.2491073
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental unit of work in programming is the code contribution ("commit")
that a developer makes to the code base of the project in work. An author's
commit frequency describes how often that author commits. Knowing the
distribution of all commit frequencies is a fundamental part of understanding
software development processes. This paper presents a detailed quantitative
analysis of commit frequencies in open-source software development. The
analysis is based on a large sample of open source projects, and presents the
overall distribution of commit frequencies. We analyze the data to show the
differences between authors and projects by project size; we also includes a
comparison of successful and non successful projects and we derive an activity
indicator from these analyses. By measuring a fundamental dimension of
programming we help improve software development tools and our understanding of
software development. We also validate some fundamental assumptions about
software development.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 12:45:55 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Kolassa",
"Carsten",
""
],
[
"Riehle",
"Dirk",
""
],
[
"Salim",
"Michel A.",
""
]
] |
new_dataset
| 0.955836 |
1408.4986
|
Bernhard Rumpe
|
Carsten Kolassa, David Dieckow, Michael Hirsch, Uwe Creutzburg,
Christian Siemers, Bernhard Rumpe
|
Objektorientierte Graphendarstellung von Simulink-Modellen zur einfachen
Analyse und Transformation
|
10 pages in German, 7 figures. AALE 2013 in Stralsund Germany, 10.
Fachkonferenz, Das Forum f\"ur Fachleute der Automatisierungstechnik aus
Hochschulen und Wirtschaft, 2013
|
Tagungsband AALE 2013, 10. Fachkonferenz, Das Forum f\"ur
Fachleute der Automatisierungstechnik aus Hochschulen und Wirtschaft, pages
277-286, 2013
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In software and hardware development MATLAB and Simulink are used to model
cyber physical systems for many years, , especially in automation technology
and the automotive industry. Compliance with the required product quality and
project efficiency is facilitated by analyzing and transforming Simulink
models. The existing API, provided by MATLAB is only suitable for programmatic
changing of Simulink models. We show using our own tool which is used in
industry, how such as a Simulink model can be edited more easily. For this
purpose the model, is converted to an object-oriented class structure that
provides convenient access and editing APIs and allows applying well-known
algorithms and analyses from graph theory directly. It is also designed as a
bi-directional tool, so it transforms a Simulink model into a graph
representation and vice versa.
-----
In der Software- und Hardwareentwicklung wird seit Jahren verst\"arkt MATLAB
und Simulink f\"ur die Modellierung von cyberphysikalischen Systemen,
insbesondere in der Automatisierungstechnik und der Automobilindustrie
eingesetzt. Die Einhaltung der notwendigen Produktqualit\"at und
Projekteffizienz wird durch Analysen und Transformationen auf Simulink-Modellen
erleichtert. Die bestehende, von MATLAB bereitgestellte, API ist f\"ur die
programmatische Ver\"anderung von Simulink-Modellen nur bedingt geeignet. Wir
zeigen deshalb anhand eines eigenen, im industriellen Einsatz befindlichen
Werkzeugs, wie ein Simulink-Modell leichter bearbeitet werden kann. Dazu wird
es in eine objektorientierte Klassenstruktur \"uberf\"uhrt, die einen
komfortablen Zugang und Bearbeitungs-APIs bietet und es erlaubt bekannte
Algorithmen und Analysen aus der Graphentheorie direkt anzuwenden. Das Werkzeug
ist bidirektional entworfen, es transformiert also ein Simulink-Modell in eine
Graphenrepresentation und umgekehrt.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 13:08:53 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Kolassa",
"Carsten",
""
],
[
"Dieckow",
"David",
""
],
[
"Hirsch",
"Michael",
""
],
[
"Creutzburg",
"Uwe",
""
],
[
"Siemers",
"Christian",
""
],
[
"Rumpe",
"Bernhard",
""
]
] |
new_dataset
| 0.995217 |
1408.4994
|
Kyungchun Lee Prof.
|
Khanh Pham and Kyungchun Lee
|
Interference Alignment for Multicell Multiuser MIMO Uplink Channels
|
Submitted to IEEE Transactions on Signal Processing, Jan., 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a linear interference alignment (IA) scheme which can be
used for uplink channels in a general multicell multiuser MIMO cellular
network. The proposed scheme aims to align interference caused by signals from
a set of transmitters into a subspace which is established by the signals from
only a subset of those transmitters, thereby effectively reducing the number of
interfering transmitters. The total degrees of freedom (DoF) achievable by the
proposed scheme is given in closed-form expression, and a numerical analysis
shows that the proposed scheme can achieve the optimal DoF in certain scenarios
and provides a higher total DoF than other related schemes in most cases.
|
[
{
"version": "v1",
"created": "Thu, 21 Aug 2014 13:21:31 GMT"
}
] | 2014-08-22T00:00:00 |
[
[
"Pham",
"Khanh",
""
],
[
"Lee",
"Kyungchun",
""
]
] |
new_dataset
| 0.958896 |
1407.8194
|
Akitoshi Kawamura
|
Akitoshi Kawamura, Yusuke Kobayashi
|
Fence patrolling by mobile agents with distinct speeds
|
12 pages, 8 figures; preliminary version presented at ISAAC 2012
| null |
10.1007/s00446-014-0226-3
| null |
cs.CG cs.MA cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose we want to patrol a fence (line segment) using k mobile agents with
given speeds v_1, ..., v_k so that every point on the fence is visited by an
agent at least once in every unit time period. Czyzowicz et al. conjectured
that the maximum length of the fence that can be patrolled is (v_1 + ... +
v_k)/2, which is achieved by the simple strategy where each agent i moves back
and forth in a segment of length v_i/2. We disprove this conjecture by a
counterexample involving k = 6 agents. We also show that the conjecture is true
for k = 2, 3.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2014 20:00:29 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Kawamura",
"Akitoshi",
""
],
[
"Kobayashi",
"Yusuke",
""
]
] |
new_dataset
| 0.975683 |
1408.4565
|
Philipp Leitner
|
Joel Scheuner and Philipp Leitner and Jurgen Cito and Harald Gall
|
Cloud WorkBench - Infrastructure-as-Code Based Cloud Benchmarking
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To optimally deploy their applications, users of Infrastructure-as-a-Service
clouds are required to evaluate the costs and performance of different
combinations of cloud configurations to find out which combination provides the
best service level for their specific application. Unfortunately, benchmarking
cloud services is cumbersome and error-prone. In this paper, we propose an
architecture and concrete implementation of a cloud benchmarking Web service,
which fosters the definition of reusable and representative benchmarks. In
distinction to existing work, our system is based on the notion of
Infrastructure-as-Code, which is a state of the art concept to define IT
infrastructure in a reproducible, well-defined, and testable way. We
demonstrate our system based on an illustrative case study, in which we measure
and compare the disk IO speeds of different instance and storage types in
Amazon EC2.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 09:04:57 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Scheuner",
"Joel",
""
],
[
"Leitner",
"Philipp",
""
],
[
"Cito",
"Jurgen",
""
],
[
"Gall",
"Harald",
""
]
] |
new_dataset
| 0.99712 |
1408.4587
|
Pier Stanislao Paolucci
|
Pier Stanislao Paolucci, Iuliana Bacivarov, Devendra Rai, Lars Schor,
Lothar Thiele, Hoeseok Yang, Elena Pastorelli, Roberto Ammendola, Andrea
Biagioni, Ottorino Frezza, Francesca Lo Cicero, Alessandro Lonardo, Francesco
Simula, Laura Tosoratto, Piero Vicini
|
EURETILE D7.3 - Dynamic DAL benchmark coding, measurements on MPI
version of DPSNN-STDP (distributed plastic spiking neural net) and
improvements to other DAL codes
|
34 pages. arXiv admin note: substantial text overlap with
arXiv:1310.8478
| null | null | null |
cs.DC cs.CE cs.MS cs.NE q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The EURETILE project required the selection and coding of a set of dedicated
benchmarks. The project is about the software and hardware architecture of
future many-tile distributed fault-tolerant systems. We focus on dynamic
workloads characterised by heavy numerical processing requirements. The
ambition is to identify common techniques that could be applied to both the
Embedded Systems and HPC domains. This document is the first public deliverable
of Work Package 7: Challenging Tiled Applications.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 10:00:15 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Paolucci",
"Pier Stanislao",
""
],
[
"Bacivarov",
"Iuliana",
""
],
[
"Rai",
"Devendra",
""
],
[
"Schor",
"Lars",
""
],
[
"Thiele",
"Lothar",
""
],
[
"Yang",
"Hoeseok",
""
],
[
"Pastorelli",
"Elena",
""
],
[
"Ammendola",
"Roberto",
""
],
[
"Biagioni",
"Andrea",
""
],
[
"Frezza",
"Ottorino",
""
],
[
"Cicero",
"Francesca Lo",
""
],
[
"Lonardo",
"Alessandro",
""
],
[
"Simula",
"Francesco",
""
],
[
"Tosoratto",
"Laura",
""
],
[
"Vicini",
"Piero",
""
]
] |
new_dataset
| 0.991766 |
1408.4599
|
Martin Horsch
|
Christoph Niethammer and Stefan Becker and Martin Bernreuther and
Martin Buchholz and Wolfgang Eckhardt and Alexander Heinecke and Stephan
Werth and Hans-Joachim Bungartz and Colin W. Glass and Hans Hasse and Jadran
Vrabec and Martin Horsch
|
ls1 mardyn: The massively parallel molecular dynamics code for large
systems
| null | null | null | null |
cs.CE cond-mat.soft physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The molecular dynamics simulation code ls1 mardyn is presented. It is a
highly scalable code, optimized for massively parallel execution on
supercomputing architectures, and currently holds the world record for the
largest molecular simulation with over four trillion particles. It enables the
application of pair potentials to length and time scales which were previously
out of scope for molecular dynamics simulation. With an efficient dynamic load
balancing scheme, it delivers high scalability even for challenging
heterogeneous configurations. Presently, multi-center rigid potential models
based on Lennard-Jones sites, point charges and higher-order polarities are
supported. Due to its modular design, ls1 mardyn can be extended to new
physical models, methods, and algorithms, allowing future users to tailor it to
suit their respective needs. Possible applications include scenarios with
complex geometries, e.g. for fluids at interfaces, as well as non-equilibrium
molecular dynamics simulation of heat and mass transfer.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 10:40:39 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Niethammer",
"Christoph",
""
],
[
"Becker",
"Stefan",
""
],
[
"Bernreuther",
"Martin",
""
],
[
"Buchholz",
"Martin",
""
],
[
"Eckhardt",
"Wolfgang",
""
],
[
"Heinecke",
"Alexander",
""
],
[
"Werth",
"Stephan",
""
],
[
"Bungartz",
"Hans-Joachim",
""
],
[
"Glass",
"Colin W.",
""
],
[
"Hasse",
"Hans",
""
],
[
"Vrabec",
"Jadran",
""
],
[
"Horsch",
"Martin",
""
]
] |
new_dataset
| 0.992955 |
1408.4630
|
Roope Vehkalahti
|
Benjamin Linowitz, Matthew Satriano and Roope Vehkalahti
|
A non-commutative analogue of the Odlyzko bounds and bounds on
performance for space-time lattice codes
| null | null | null | null |
cs.IT math.IT math.NT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers space-time coding over several independently Rayleigh
faded blocks. In particular we will concentrate on giving upper bounds for the
coding gain of lattice space-time codes as the number of blocks grow. This
problem was previously considered in the single antenna case by Bayer et al. in
2006. Crucial to their work was Odlyzko's bound on the discriminant of an
algebraic number field, as this provides an upper bound for the normalized
coding gain of number field codes. In the MIMO context natural codes are
constructed from division algebras defined over number fields and the coding
gain is measured by the discriminant of the corresponding (non-commutative)
algebra. In this paper we will develop analogues of the Odlyzko bounds in this
context and show how these bounds limit the normalized coding gain of a very
general family of division algebra based space-time codes. These bounds can
also be used as benchmarks in practical code design and as tools to analyze
asymptotic bounds of performance as the number of independently faded blocks
increases.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 12:52:19 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Linowitz",
"Benjamin",
""
],
[
"Satriano",
"Matthew",
""
],
[
"Vehkalahti",
"Roope",
""
]
] |
new_dataset
| 0.951553 |
1408.4715
|
Hugo A. Andrade
|
Hugo A. Andrade, Simon Hogg, Stephan Ahrends
|
Making FPGAs Accessible to Scientists and Engineers as Domain Expert
Software Programmers with LabVIEW
|
Presented at First International Workshop on FPGAs for Software
Programmers (FSP 2014) (arXiv:1408.4423)
| null | null |
FSP/2014/02
|
cs.SE cs.DC cs.OS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a graphical programming framework, LabVIEW, and
associated language and libraries, as well as programming techniques and
patterns that we have found useful in making FPGAs accessible to scientists and
engineers as domain expert software programmers.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 16:39:15 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Andrade",
"Hugo A.",
""
],
[
"Hogg",
"Simon",
""
],
[
"Ahrends",
"Stephan",
""
]
] |
new_dataset
| 0.998718 |
1408.4725
|
Sam Skalicky
|
Sam Skalicky, Andrew G. Schmidt, Matthew French
|
High Level Hardware/Software Embedded System Design with Redsharc
|
Presented at First International Workshop on FPGAs for Software
Programmers (FSP 2014) (arXiv:1408.4423)
| null | null |
FSP/2014/05
|
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As tools for designing multiple processor systems-on-chips (MPSoCs) continue
to evolve to meet the demands of developers, there exist systematic gaps that
must be bridged to provide a more cohesive hardware/software development
environment. We present Redsharc to address these problems and enable: system
generation, software/hardware compilation and synthesis, run-time control and
execution of MPSoCs. The efforts presented in this paper extend our previous
work to provide a rich API, build infrastructure, and runtime enabling
developers to design a system of simultaneously executing kernels in software
or hardware, that communicate seamlessly. In this work we take Redsharc further
to support a broader class of applications across a larger number of devices
requiring a more unified system development environment and build
infrastructure. To accomplish this we leverage existing tools and extend
Redsharc with build and control infrastructure to relieve the burden of system
development allowing software programmers to focus their efforts on application
and kernel development.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 17:03:05 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Skalicky",
"Sam",
""
],
[
"Schmidt",
"Andrew G.",
""
],
[
"French",
"Matthew",
""
]
] |
new_dataset
| 0.997564 |
1408.4749
|
Joshua Davis
|
Joshua Davis and Victor S. Frost
|
A Covert Channel Using Named Resources
|
9 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A network covert channel is created that uses resource names such as
addresses to convey information, and that approximates typical user behavior in
order to blend in with its environment. The channel correlates available
resource names with a user defined code-space, and transmits its covert message
by selectively accessing resources associated with the message codes. In this
paper we focus on an implementation of the channel using the Hypertext Transfer
Protocol (HTTP) with Uniform Resource Locators (URLs) as the message names,
though the system can be used in conjunction with a variety of protocols. The
covert channel does not modify expected protocol structure as might be detected
by simple inspection, and our HTTP implementation emulates transaction level
web user behavior in order to avoid detection by statistical or behavioral
analysis.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2014 18:18:17 GMT"
}
] | 2014-08-21T00:00:00 |
[
[
"Davis",
"Joshua",
""
],
[
"Frost",
"Victor S.",
""
]
] |
new_dataset
| 0.99717 |
1212.3416
|
Shuang Cong
|
Shuang Cong, Fangfang Meng, Jianxiu Liu
|
Implicit Lyapunov Control for the Quantum Liouville Equation
|
8 pages, 2 figures
|
Control Theory and Informatics,Vol. 4, No. 6, pp. 21- 32, 2014
| null | null |
cs.SY math-ph math.MP quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A quantum system whose internal Hamiltonian is not strongly regular or/and
control Hamiltonians are not full connected, are thought to be in the
degenerate cases. In this paper, convergence problems of the multi-control
Hamiltonians closed quantum systems in the degenerate cases are solved by
introducing implicit function perturbations and choosing an implicit Lyapunov
function based on the average value of an imaginary mechanical quantity. For
the diagonal and non-diagonal tar-get states, respectively, control laws are
designed. The convergence of the control system is proved, and an explicit
design principle of the imaginary mechanical quantity is proposed. By using the
proposed method, the multi-control Hamiltonians closed quantum systems in the
degenerate cases can converge from any initial state to an arbitrary target
state unitarily equivalent to the initial state. Finally, numerical simulations
are studied to verify the effectiveness of the proposed control method.
|
[
{
"version": "v1",
"created": "Fri, 14 Dec 2012 09:13:14 GMT"
}
] | 2014-08-20T00:00:00 |
[
[
"Cong",
"Shuang",
""
],
[
"Meng",
"Fangfang",
""
],
[
"Liu",
"Jianxiu",
""
]
] |
new_dataset
| 0.994036 |
1307.0608
|
Te Sun Han
|
Te Sun Han, Hiroyuki Endo, Masahide Sasaki
|
Reliability and Secrecy Functions of the Wiretap Channel under Cost
Constraint
|
60 pages, 12 figures
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wiretap channel has been devised and studied first by Wyner, and
subsequently extended to the case with non-degraded general wiretap channels by
Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost
constraint, we newly introduce the notion of reliability and security functions
as a fundamental tool to analyze and/or design the performance of an efficient
wiretap channel system. Compact formulae for those functions are explicitly
given for stationary memoryless wiretap channels. It is also demonstrated that,
based on such a pair of reliability and security functions, we can control the
tradeoff between reliability and security (usually conflicting), both with
exponentially decreasing rates as block length n becomes large. Two ways to do
so are given on the basis of concatenation and rate exchange. In this
framework, the notion of the {\delta} secrecy capacity is defined and shown to
attain the strongest security standard among others. The maximized vs. averaged
security measures is also discussed.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 07:50:55 GMT"
},
{
"version": "v10",
"created": "Mon, 24 Mar 2014 14:33:12 GMT"
},
{
"version": "v11",
"created": "Tue, 19 Aug 2014 07:19:10 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Aug 2013 08:10:37 GMT"
},
{
"version": "v3",
"created": "Thu, 8 Aug 2013 11:27:14 GMT"
},
{
"version": "v4",
"created": "Mon, 12 Aug 2013 11:40:02 GMT"
},
{
"version": "v5",
"created": "Tue, 17 Sep 2013 16:59:53 GMT"
},
{
"version": "v6",
"created": "Thu, 19 Sep 2013 15:01:31 GMT"
},
{
"version": "v7",
"created": "Mon, 2 Dec 2013 14:36:50 GMT"
},
{
"version": "v8",
"created": "Wed, 4 Dec 2013 07:22:30 GMT"
},
{
"version": "v9",
"created": "Fri, 10 Jan 2014 13:56:17 GMT"
}
] | 2014-08-20T00:00:00 |
[
[
"Han",
"Te Sun",
""
],
[
"Endo",
"Hiroyuki",
""
],
[
"Sasaki",
"Masahide",
""
]
] |
new_dataset
| 0.987585 |
1404.6179
|
Moritz Schubotz
|
Moritz Schubotz and Gabriel Wicke
|
Mathoid: Robust, Scalable, Fast and Accessible Math Rendering for
Wikipedia
|
12 pages, accepted at Conferences on Intelligent Computer Mathematics
CICM2014
| null |
10.1007/978-3-319-08434-3_17
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wikipedia is the first address for scientists who want to recap basic
mathematical and physical laws and concepts. Today, formulae in those pages are
displayed as Portable Network Graphics images. Those images do not integrate
well into the text, can not be edited after copying, are inaccessible to screen
readers for people with special needs, do not support line breaks for small
screens and do not scale for high resolution devices. Mathoid improves this
situation and converts formulae specified by Wikipedia editors in a TeX-like
input format to MathML, with Scalable Vector Graphics images as a fallback
solution.
|
[
{
"version": "v1",
"created": "Thu, 24 Apr 2014 16:55:51 GMT"
}
] | 2014-08-20T00:00:00 |
[
[
"Schubotz",
"Moritz",
""
],
[
"Wicke",
"Gabriel",
""
]
] |
new_dataset
| 0.999811 |
1404.6519
|
Howard Cohl
|
Howard S. Cohl, Marjorie A. McClain, Bonita V. Saunders, Moritz
Schubotz, Janelle C. Williams
|
Digital Repository of Mathematical Formulae
| null | null |
10.1007/978-3-319-08434-3_30
| null |
cs.DL
|
http://creativecommons.org/licenses/publicdomain/
|
The purpose of the NIST Digital Repository of Mathematical Formulae (DRMF) is
to create a digital compendium of mathematical formulae for orthogonal
polynomials and special functions (OPSF) and of associated mathematical data.
The DRMF addresses needs of working mathematicians, physicists and engineers:
providing a platform for publication and interaction with OPSF formulae on the
web. Using MediaWiki extensions and other existing technology (such as software
and macro collections developed for the NIST Digital Library of Mathematical
Functions), the DRMF acts as an interactive web domain for OPSF formulae.
Whereas Wikipedia and other web authoring tools manifest notions or
descriptions as first class objects, the DRMF does that with mathematical
formulae. See http://gw32.iu.xsede.org/index.php/Main_Page.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 19:52:31 GMT"
},
{
"version": "v2",
"created": "Wed, 14 May 2014 15:11:36 GMT"
}
] | 2014-08-20T00:00:00 |
[
[
"Cohl",
"Howard S.",
""
],
[
"McClain",
"Marjorie A.",
""
],
[
"Saunders",
"Bonita V.",
""
],
[
"Schubotz",
"Moritz",
""
],
[
"Williams",
"Janelle C.",
""
]
] |
new_dataset
| 0.998451 |
1308.0683
|
Scott A. Hale
|
Mark Graham, Scott A. Hale, and Devin Gaffney
|
Where in the World are You? Geolocation and Language Identification in
Twitter
| null | null |
10.1080/00330124.2014.907699
| null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The movements of ideas and content between locations and languages are
unquestionably crucial concerns to researchers of the information age, and
Twitter has emerged as a central, global platform on which hundreds of millions
of people share knowledge and information. A variety of research has attempted
to harvest locational and linguistic metadata from tweets in order to
understand important questions related to the 300 million tweets that flow
through the platform each day. However, much of this work is carried out with
only limited understandings of how best to work with the spatial and linguistic
contexts in which the information was produced. Furthermore, standard,
well-accepted practices have yet to emerge. As such, this paper studies the
reliability of key methods used to determine language and location of content
in Twitter. It compares three automated language identification packages to
Twitter's user interface language setting and to a human coding of languages in
order to identify common sources of disagreement. The paper also demonstrates
that in many cases user-entered profile locations differ from the physical
locations users are actually tweeting from. As such, these open-ended,
user-generated, profile locations cannot be used as useful proxies for the
physical locations from which information is published to Twitter.
|
[
{
"version": "v1",
"created": "Sat, 3 Aug 2013 11:06:58 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Graham",
"Mark",
""
],
[
"Hale",
"Scott A.",
""
],
[
"Gaffney",
"Devin",
""
]
] |
new_dataset
| 0.998424 |
1311.4941
|
Hongbo Si
|
Hongbo Si, O. Ozan Koyluoglu, and Sriram Vishwanath
|
Polar Coding for Fading Channels: Binary and Exponential Channel Cases
|
31 pages, 8 figures, journal
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a polar coding scheme for fading channels, focusing
primarily on fading binary symmetric and additive exponential noise channels.
For fading binary symmetric channels, a hierarchical coding scheme is
presented, utilizing polar coding both over channel uses and over fading
blocks. The receiver uses its channel state information (CSI) to distinguish
states, thus constructing an overlay erasure channel over the underlying fading
channels. By using this scheme, the capacity of a fading binary symmetric
channel is achieved without CSI at the transmitter. Noting that a fading AWGN
channel with BPSK modulation and demodulation corresponds to a fading binary
symmetric channel, this result covers a fairly large set of practically
relevant channel settings.
For fading additive exponential noise channels, expansion coding is used in
conjunction to polar codes. Expansion coding transforms the continuous-valued
channel to multiple (independent) discrete-valued ones. For each level after
expansion, the approach described previously for fading binary symmetric
channels is used. Both theoretical analysis and numerical results are
presented, showing that the proposed coding scheme approaches the capacity in
the high SNR regime. Overall, utilizing polar codes in this (hierarchical)
fashion enables coding without CSI at the transmitter, while approaching the
capacity with low complexity.
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 02:33:07 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Aug 2014 21:46:50 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Si",
"Hongbo",
""
],
[
"Koyluoglu",
"O. Ozan",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.999594 |
1403.6192
|
Yixuan Xie
|
Yixuan Xie, Jinhong Yuan and Yuichiro Fujiwara
|
Quantum Synchronizable Codes From Quadratic Residue Codes and Their
Supercodes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum synchronizable codes are quantum error-correcting codes designed to
correct the effects of both quantum noise and block synchronization errors.
While it is known that quantum synchronizable codes can be constructed from
cyclic codes that satisfy special properties, only a few classes of cyclic
codes have been proved to give promising quantum synchronizable codes. In this
paper, using quadratic residue codes and their supercodes, we give a simple
construction for quantum synchronizable codes whose synchronization
capabilities attain the upper bound. The method is applicable to cyclic codes
of prime length.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 23:37:40 GMT"
},
{
"version": "v2",
"created": "Wed, 14 May 2014 06:35:33 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Aug 2014 11:42:20 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Xie",
"Yixuan",
""
],
[
"Yuan",
"Jinhong",
""
],
[
"Fujiwara",
"Yuichiro",
""
]
] |
new_dataset
| 0.999852 |
1408.3838
|
Minati Mishra
|
Minati Mishra, Ashanta Ranjan Routray, Sunit Kumar
|
High Security Image Steganography with Modified Arnold cat map
|
5 pages, International Journal of Computer Applications,Volume 37,
No.9, January 2012
| null | null | null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information security is concerned with maintaining the secrecy, reliability
and accessibility of data. The main objective of information security is to
protect information and information system from unauthorized access,
revelation, disruption, alteration, annihilation and use. This paper uses
spatial domain LSB substitution method for information embedding and modified
forms of Arnold transform are applied twice in two different phases to ensure
security. The system is tested and validated against a series of standard
images and the results show that the method is highly secure and provides high
data hiding capacity.
|
[
{
"version": "v1",
"created": "Sun, 17 Aug 2014 17:07:29 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Mishra",
"Minati",
""
],
[
"Routray",
"Ashanta Ranjan",
""
],
[
"Kumar",
"Sunit",
""
]
] |
new_dataset
| 0.986421 |
1408.3955
|
Mathias Soeken
|
Mathias Soeken, Laura Tague, Gerhard W. Dueck, Rolf Drechsler
|
Ancilla-free synthesis of large reversible functions using binary
decision diagrams
|
25 pages, 15 figures
| null | null | null |
cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The synthesis of reversible functions has been an intensively studied
research area in the last decade. Since almost all proposed approaches rely on
representations of exponential size (such as truth tables and permutations),
they cannot be applied efficiently to reversible functions with more than 15
variables.
In this paper, we propose an ancilla-free synthesis approach based on Young
subgroups using symbolic function representations that can efficiently be
implemented with binary decision diagrams (BDDs). As a result, the algorithm
not only allows to synthesize large reversible functions without adding extra
lines, called ancilla, but also leads to significantly smaller circuits
compared to existing approaches.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 09:50:14 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Soeken",
"Mathias",
""
],
[
"Tague",
"Laura",
""
],
[
"Dueck",
"Gerhard W.",
""
],
[
"Drechsler",
"Rolf",
""
]
] |
new_dataset
| 0.969102 |
1408.3977
|
Sadagopan Narasimhan
|
Vandhana.C and S.Hima Bindhu and P.Renjith and N.Sadagopan and
B.Supraja
|
Spanning Tree Enumeration in 2-trees: Sequential and Parallel
Perspective
|
9 pages, 2 figures
| null | null | null |
cs.DM 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. A vertex separator $S$ is minimal if it
contains no other separator as a strict subset and a minimum vertex separator
is a minimal vertex separator of least cardinality. A {\em clique} is a set of
mutually adjacent vertices. A 2-tree is a connected graph in which every
maximal clique is of size three and every minimal vertex separator is of size
two. A spanning tree of a graph $G$ is a connected and an acyclic subgraph of
$G$. In this paper, we focus our attention on two enumeration problems, both
from sequential and parallel perspective. In particular, we consider listing
all possible spanning trees of a 2-tree and listing all perfect elimination
orderings of a chordal graph. As far as enumeration of spanning trees is
concerned, our approach is incremental in nature and towards this end, we work
with the construction order of the 2-tree, i.e. enumeration of $n$-vertex trees
are from $n-1$ vertex trees, $n \geq 4$. Further, we also present a parallel
algorithm for spanning tree enumeration using $O(2^n)$ processors. To our
knowledge, this paper makes the first attempt in designing a parallel algorithm
for this problem. We conclude this paper by presenting a sequential and
parallel algorithm for enumerating all Perfect Elimination Orderings of a
chordal graph.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 11:19:02 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"C",
"Vandhana.",
""
],
[
"Bindhu",
"S. Hima",
""
],
[
"Renjith",
"P.",
""
],
[
"Sadagopan",
"N.",
""
],
[
"Supraja",
"B.",
""
]
] |
new_dataset
| 0.999548 |
1408.4005
|
Kalyani Das
|
Kalyani Das
|
Cactus Graphs and Some Algorithms
|
15 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cactus graph is a connected graph in which every block is either an edge or
a cycle. In this paper, we consider several problems of graph theory and
developed optimal algorithms to solve such problems on cactus graphs. The
running time of these algorithms is O(n), where n is the total number of
vertices of the graph. The cactus graph has many applications in real life
problems, especially in radio communication system.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 13:13:11 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Das",
"Kalyani",
""
]
] |
new_dataset
| 0.99961 |
1408.4099
|
Sander Verdonschot
|
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf
Fagerberg, Andr\'e van Renssen, Perouz Taslakian and Sander Verdonschot
|
Continuous Yao Graphs
|
7 pages, 7 figures. Presented at CCCG 2014
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a variation of the well-studied Yao graphs. Given
a set of points $S\subset \mathbb{R}^2$ and an angle $0 < \theta \leq 2\pi$, we
define the continuous Yao graph $cY(\theta)$ with vertex set $S$ and angle
$\theta$ as follows. For each $p,q\in S$, we add an edge from $p$ to $q$ in
$cY(\theta)$ if there exists a cone with apex $p$ and aperture $\theta$ such
that $q$ is the closest point to $p$ inside this cone.
We study the spanning ratio of $cY(\theta)$ for different values of $\theta$.
Using a new algebraic technique, we show that $cY(\theta)$ is a spanner when
$\theta \leq 2\pi /3$. We believe that this technique may be of independent
interest. We also show that $cY(\pi)$ is not a spanner, and that $cY(\theta)$
may be disconnected for $\theta > \pi$.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 19:08:25 GMT"
}
] | 2014-08-19T00:00:00 |
[
[
"Barba",
"Luis",
""
],
[
"Bose",
"Prosenjit",
""
],
[
"De Carufel",
"Jean-Lou",
""
],
[
"Damian",
"Mirela",
""
],
[
"Fagerberg",
"Rolf",
""
],
[
"van Renssen",
"André",
""
],
[
"Taslakian",
"Perouz",
""
],
[
"Verdonschot",
"Sander",
""
]
] |
new_dataset
| 0.998162 |
1005.2211
|
Francisco Soulignac
|
Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
|
Arboricity, h-Index, and Dynamic Algorithms
|
19 pages, no figures
| null |
10.1016/j.tcs.2011.12.006
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a modification of a technique by Chiba and Nishizeki
[Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J.
Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure
suitable for dynamic graph algorithms. We employ the data structure to
formulate new algorithms for several problems, including counting subgraphs of
four vertices, recognition of diamond-free graphs, cop-win graphs and strongly
chordal graphs, among others. We improve the time complexity for graphs with
low arboricity or h-index.
|
[
{
"version": "v1",
"created": "Wed, 12 May 2010 21:33:10 GMT"
}
] | 2014-08-18T00:00:00 |
[
[
"Lin",
"Min Chih",
""
],
[
"Soulignac",
"Francisco J.",
""
],
[
"Szwarcfiter",
"Jayme L.",
""
]
] |
new_dataset
| 0.994224 |
1111.3548
|
Francisco Soulignac
|
Francisco J. Soulignac
|
Fully dynamic recognition of proper circular-arc graphs
|
60 pages, 15 figures
| null |
10.1007/s00453-013-9835-7
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a fully dynamic algorithm for the recognition of proper
circular-arc (PCA) graphs. The allowed operations on the graph involve the
insertion and removal of vertices (together with its incident edges) or edges.
Edge operations cost O(log n) time, where n is the number of vertices of the
graph, while vertex operations cost O(log n + d) time, where d is the degree of
the modified vertex. We also show incremental and decremental algorithms that
work in O(1) time per inserted or removed edge. As part of our algorithm, fully
dynamic connectivity and co-connectivity algorithms that work in O(log n) time
per operation are obtained. Also, an O(\Delta) time algorithm for determining
if a PCA representation corresponds to a co-bipartite graph is provided, where
\Delta\ is the maximum among the degrees of the vertices. When the graph is
co-bipartite, a co-bipartition of each of its co-components is obtained within
the same amount of time.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2011 15:06:54 GMT"
}
] | 2014-08-18T00:00:00 |
[
[
"Soulignac",
"Francisco J.",
""
]
] |
new_dataset
| 0.997781 |
1210.7269
|
Francisco Soulignac
|
Marina Groshaus and Francisco J. Soulignac and Pablo Terlisky
|
The star and biclique coloring and choosability problems
|
33 pages, 8 figures
| null |
10.7155/jgaa.00326
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A biclique of a graph G is an induced complete bipartite graph. A star of G
is a biclique contained in the closed neighborhood of a vertex. A star
(biclique) k-coloring of G is a k-coloring of G that contains no monochromatic
maximal stars (bicliques). Similarly, for a list assignment L of G, a star
(biclique) L-coloring is an L-coloring of G in which no maximal star (biclique)
is monochromatic. If G admits a star (biclique) L-coloring for every k-list
assignment L, then G is said to be star (biclique) k-choosable. In this article
we study the computational complexity of the star and biclique coloring and
choosability problems. Specifically, we prove that the star (biclique)
k-coloring and k-choosability problems are \Sigma_2^p-complete and
\Pi_3^p-complete for k > 2, respectively, even when the input graph contains no
induced C_4 or K_{k+2}. Then, we study all these problems in some related
classes of graphs, including H-free graphs for every H on three vertices,
graphs with restricted diamonds, split graphs, threshold graphs, and net-free
block graphs.
|
[
{
"version": "v1",
"created": "Fri, 26 Oct 2012 23:12:08 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Nov 2012 00:09:36 GMT"
}
] | 2014-08-18T00:00:00 |
[
[
"Groshaus",
"Marina",
""
],
[
"Soulignac",
"Francisco J.",
""
],
[
"Terlisky",
"Pablo",
""
]
] |
new_dataset
| 0.992749 |
1408.3573
|
Emrah Tasli Dr
|
H. Emrah Tasli and Paul Ivan
|
Turkish Presidential Elections TRT Publicity Speech Facial Expression
Analysis
|
2 pages 3 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, facial expressions of the three Turkish presidential
candidates Demirtas, Erdogan and Ihsanoglu (in alphabetical order) are analyzed
during the publicity speeches featured at TRT (Turkish Radio and Television) on
03.08.2014. FaceReader is used for the analysis where 3D modeling of the face
is achieved using the active appearance models (AAM). Over 500 landmark points
are tracked and analyzed for obtaining the facial expressions during the whole
speech. All source videos and the data are publicly available for research
purposes.
|
[
{
"version": "v1",
"created": "Fri, 15 Aug 2014 15:51:29 GMT"
}
] | 2014-08-18T00:00:00 |
[
[
"Tasli",
"H. Emrah",
""
],
[
"Ivan",
"Paul",
""
]
] |
new_dataset
| 0.998135 |
1408.3575
|
Kamal Kumar
|
Kamal Kumar, A. K. Verma and R. B. Patel
|
Secure Multipath Routing Scheme using Key Pre-Distribution in Wireless
Sensor Networks
|
13 pages
|
International Journal of Foundation in Computer Science &
Technology, Vol. 4, No. 4, pp. 49-61, 2014, Australia
|
10.5121/ijfcst.2014.4404
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multipath routing in WSN has been a long wish in security scenario where
nodes on next-hop may be targeted to compromise. Many proposals of Multipath
routing has been proposed in ADHOC Networks but under constrained from keying
environment most seems ignorant. In WSN where crucial data is reported by nodes
in deployment area to their securely located Sink, route security has to be
guaranteed. Under dynamic load and selective attacks, availability of multiple
secure paths is a boon and increases the attacker efforts by many folds. We
propose to build a subset of neighbors as our front towards destination node.
We also identified forwarders for query by base station. The front is optimally
calculated to maintain the security credential and avail multiple paths.
According to our knowledge ours is first secure multipath routing protocol for
WSN. We established effectiveness of our proposal with mathematical analysis
|
[
{
"version": "v1",
"created": "Wed, 13 Aug 2014 03:31:32 GMT"
}
] | 2014-08-18T00:00:00 |
[
[
"Kumar",
"Kamal",
""
],
[
"Verma",
"A. K.",
""
],
[
"Patel",
"R. B.",
""
]
] |
new_dataset
| 0.999485 |
1308.5211
|
Hongmei Xie
|
Hongmei Xie and Zhiyuan Yan
|
Two-layer Locally Repairable Codes for Distributed Storage Systems
|
This paper has been withdrawn by the author due to inaccuracy of
Claim 1
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose locally repairable codes (LRCs) with optimal
minimum distance for distributed storage systems (DSS). A two-layer encoding
structure is employed to ensure data reconstruction and the designated repair
locality. The data is first encoded in the first layer by any existing maximum
distance separable (MDS) codes, and then the encoded symbols are divided into
non-overlapping groups and encoded by an MDS array code in the second layer.
The encoding in the second layer provides enough redundancy for local repair,
while the overall code performs recovery of the data based on redundancy from
both layers. Our codes can be constructed over a finite field with size growing
linearly with the total number of nodes in the DSS, and facilitate efficient
degraded reads.
|
[
{
"version": "v1",
"created": "Fri, 23 Aug 2013 19:10:27 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Feb 2014 18:25:28 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Aug 2014 03:27:49 GMT"
}
] | 2014-08-15T00:00:00 |
[
[
"Xie",
"Hongmei",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.999381 |
1408.3181
|
Tianyu Wang
|
Tianyu Wang, Lingyang Song, and Zhu Han
|
Coalitional Graph Games for Popular Content Distribution in Cognitive
Radio VANETs
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Popular content distribution is one of the key services provided by vehicular
ad hoc networks (VANETs), in which a popular file is broadcasted by roadside
units (RSUs) to the on-board units (OBUs) driving through a particular area.
Due to fast speed and deep fading, some file packets might be lost during the
vehicle-to-roadside broadcasting stage. In this paper, we propose a
peer-to-peer (P2P) approach to allow the OBUs to exchange data and complement
the missing packets. Specifically, we introduce a coalitional graph game to
model the cooperation among OBUs and propose a coalition formation algorithm to
implement the P2P approach. Moreover, cognitive radio is utilized for
vehicle-to-vehicle transmissions so that the P2P approach does not require
additional bandwidth. Simulation results show that the proposed approach
performs better in various conditions, relative to the non-cooperative
approach, in which the OBUs share no information and simply response to any
data request from other OBUs.
|
[
{
"version": "v1",
"created": "Thu, 14 Aug 2014 02:12:06 GMT"
}
] | 2014-08-15T00:00:00 |
[
[
"Wang",
"Tianyu",
""
],
[
"Song",
"Lingyang",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.999146 |
1408.2824
|
Leonard Apeltsin
|
Leonard Apeltsin
|
A CryptoCubic Protocol for Hacker-Proof Off-Chain Bitcoin Transactions
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Off-Chain transactions allow for the immediate transfer of Cryptocurrency
between two parties, without delays or unavoidable transaction fees. Such
capabilities are critical for mainstream Cryptocurrency adaption. They allow
for the "Coffee-Coin Criteria"; under which a customer orders a coffee and pays
for that coffee in bitcoins. This is not possible with On-Chain transactions
today. Unfortunately, all existing Off-Chain transaction protocols are
notoriously unreliable The current generation of third-party facilitators are
vulnerable to hacker-based attacks. As Mt. Gox tragically demonstrated,
centralized-transaction institutions are easy targets for Cryptocurrency
thieves. The slightest security flaw in a third-party system will pounced on by
hackers, who will proceed to devour it like ants devouring a crab. Under such
circumstances, it no wonder that the Public treats most Cryptocurrency services
with a constant shadow of suspicion. For Bitcoin to flourish, its
anti-hierarchy principles must be applied to safe Off-Chain transactions. First
and foremost, we need a new hacker-proof protocol that can easily be executed
by any experienced developer. Preferably, the protocol will be open-sourced for
full reliability and transparency. This paper presents one such procedure,
which allows for he safe transmission of Bitcoin private key control by way of
Cryptocubic transactions.
|
[
{
"version": "v1",
"created": "Mon, 11 Aug 2014 21:36:03 GMT"
}
] | 2014-08-14T00:00:00 |
[
[
"Apeltsin",
"Leonard",
""
]
] |
new_dataset
| 0.983761 |
1408.2842
|
Manfred Kufleitner
|
Manfred Kufleitner
|
Star-free languages and local divisors
|
This is a prior version of an invited contribution at the 16th
International Workshop on Descriptional Complexity of Formal Systems (DCFS
2014) in Turku, Finland. The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-09704-6_3
|
In H. J\"urgensen, J. Karhum\"aki, and A. Okhotin, editors,
Proceedings of DCFS 2014. LNCS vol. 8614, pp. 23-28, 2014
|
10.1007/978-3-319-09704-6_3
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A celebrated result of Sch\"utzenberger says that a language is star-free if
and only if it is is recognized by a finite aperiodic monoid. We give a new
proof for this theorem using local divisors.
|
[
{
"version": "v1",
"created": "Tue, 12 Aug 2014 20:29:22 GMT"
}
] | 2014-08-14T00:00:00 |
[
[
"Kufleitner",
"Manfred",
""
]
] |
new_dataset
| 0.999459 |
1408.2626
|
Yang Chi
|
Yang Chi, Dharma P. Agrawal
|
TCP-Forward: Fast and Reliable TCP Variant for Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The congestion control algorithms in TCP may incur inferior performance in a
lossy network context like wireless networks. Previous works have shown that
random linear network coding can improve the throughput of TCP in such
networks, although it introduces extra decoding delay at the destination. In
this paper we try to alleviate the decoding delay by replacing random linear
network coding with LT Codes. Due to the inherent difference between linear
network coding and Fountain Codes, such replacement is not as simple as it
sounds. We conquer some practical problems and come up with TCP-Forward, a new
TCP variant which offers many properties that TCP as a streaming transport
protocol should offer. Our performance evaluation shows TCP-Forward provides
better performance than previous works.
|
[
{
"version": "v1",
"created": "Tue, 12 Aug 2014 05:49:53 GMT"
}
] | 2014-08-13T00:00:00 |
[
[
"Chi",
"Yang",
""
],
[
"Agrawal",
"Dharma P.",
""
]
] |
new_dataset
| 0.997984 |
1009.2764
|
Karl Malbrain
|
Karl Malbrain
|
A Blink Tree latch method and protocol to support synchronous node
deletion
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Blink Tree latch method and protocol supports synchronous node deletion in
a high concurrency environment. Full source code is available.
|
[
{
"version": "v1",
"created": "Tue, 14 Sep 2010 20:15:14 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Aug 2014 19:55:33 GMT"
}
] | 2014-08-12T00:00:00 |
[
[
"Malbrain",
"Karl",
""
]
] |
new_dataset
| 0.985068 |
1207.5082
|
David Eppstein
|
David Eppstein
|
Diamond-Kite Adaptive Quadrilateral Meshing
|
21 pages, 11 figures. Expanded version of a paper from the 21st
International Meshing Roundtable, 2012, including additional results on
implementation, smoothing invariance, and a related well-centered mesh
|
Engineering with Computers 30(2):223-225, 2014
|
10.1007/s00366-013-0327-9
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a family of quadrilateral meshes based on diamonds, rhombi with
60 and 120 degree angles, and kites with 60, 90, and 120 degree angles, that
can be adapted to a local size function by local subdivision operations. Our
meshes use a number of elements that is within a constant factor of the minimum
possible for any mesh of bounded aspect ratio elements, graded by the same
local size function, and is invariant under Laplacian smoothing. The vertices
of our meshes form the centers of the circles in a pair of dual circle
packings. The same vertex placement algorithm but a different mesh topology
gives a pair of dual well-centered meshes adapted to the given size function.
|
[
{
"version": "v1",
"created": "Sat, 21 Jul 2012 00:40:21 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jan 2013 06:12:30 GMT"
}
] | 2014-08-12T00:00:00 |
[
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.998424 |
1408.1964
|
Marthe Bonamy
|
Marthe Bonamy, Nicolas Bousquet, St\'ephan Thomass\'e
|
The Erd\H{o}s-Hajnal Conjecture for Long Holes and Anti-holes
|
6 pages, submitted
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erd\H{o}s and Hajnal conjectured that, for every graph $H$, there exists a
constant $c_H$ such that every graph $G$ on $n$ vertices which does not contain
any induced copy of $H$ has a clique or a stable set of size $n^{c_H}$. We
prove that for every $k$, there exists $c_k>0$ such that every graph $G$ on $n$
vertices not inducing a cycle of length at least $k$ nor its complement
contains a clique or a stable set of size $n^{c_k}$.
|
[
{
"version": "v1",
"created": "Fri, 8 Aug 2014 20:01:51 GMT"
}
] | 2014-08-12T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Bousquet",
"Nicolas",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.985762 |
1408.2172
|
Marthe Bonamy
|
Marthe Bonamy, Pierre Charbit, St\'ephan Thomass\'e
|
Graphs with large chromatic number induce $3k$-cycles
|
13 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Answering a question of Kalai and Meshulam, we prove that graphs without
induced cycles of length $3k$ have bounded chromatic number. This implies the
very first case of a much broader question asserting that every graph with
large chromatic number induces a graph $H$ such that the sum of the Betti
numbers of the independence complex of $H$ is also large.
|
[
{
"version": "v1",
"created": "Sun, 10 Aug 2014 01:58:12 GMT"
}
] | 2014-08-12T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Charbit",
"Pierre",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.984497 |
1408.2279
|
Tsvi Kopelowitz
|
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
|
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of
Independent Sets
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce and examine the {\em Holiday Gathering Problem} which models the
difficulty that couples have when trying to decide with which parents should
they spend the holiday. Our goal is to schedule the family gatherings so that
the parents that will be {\em happy}, i.e.\ all their children will be home
{\em simultaneously} for the holiday festivities, while minimizing the number
of consecutive holidays in which parents are not happy.
The holiday gathering problem is closely related to several classical
problems in computer science, such as the {\em dining philosophers problem} on
a general graph and periodic scheduling,and has applications in scheduling of
transmissions made by cellular radios. We also show interesting connections
between periodic scheduling, coloring, and universal prefix free encodings.
The combinatorial definition of the Holiday Gathering Problem is: given a
graph $G$, find an infinite sequence of independent-sets of $G$. The objective
function is to minimize, for every node $v$, the maximal gap between two
appearances of $v$. In good solutions this gap depends on local properties of
the node (i.e., its degree) and the the solution should be periodic, i.e.\ a
node appears every fixed number of periods. We show a coloring-based
construction where the period of each node colored with the $c$ is at most
$2^{1+\log^*c}\cdot\prod_{i=0}^{\log^*c} \log^{(i)}c$ (where $\log^{(i)}$ means
iterating the $\log$ function $i$ times). This is achieved via a connection
with {\it prefix-free encodings}. We prove that this is the best possible for
coloring-based solutions. We also show a construction with period at most $2d$
for a node of degree $d$.
|
[
{
"version": "v1",
"created": "Sun, 10 Aug 2014 23:04:15 GMT"
}
] | 2014-08-12T00:00:00 |
[
[
"Amir",
"Amihood",
""
],
[
"Kapah",
"Oren",
""
],
[
"Kopelowitz",
"Tsvi",
""
],
[
"Naor",
"Moni",
""
],
[
"Porat",
"Ely",
""
]
] |
new_dataset
| 0.99413 |
1403.5462
|
John Baillieul
|
John Baillieul and Zhaodan Kong
|
Saliency Based Control in Random Feature Networks
|
9 pages, 2 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to rapidly focus attention and react to salient environmental
features enables animals to move agiley through their habitats. To replicate
this kind of high-performance control of movement in synthetic systems, we
propose a new approach to feedback control that bases control actions on
randomly perceived features. Connections will be made with recent work
incorporating communication protocols into networked control systems. The
concepts of {\em random channel controllability} and {\em random channel
observability} for LTI control systems are introduced and studied.
|
[
{
"version": "v1",
"created": "Fri, 21 Mar 2014 13:59:03 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Aug 2014 01:43:24 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Baillieul",
"John",
""
],
[
"Kong",
"Zhaodan",
""
]
] |
new_dataset
| 0.993255 |
1406.2507
|
Tim Taylor
|
Tim Taylor
|
WebAL-1: Workshop on Artificial Life and the Web 2014 Proceedings
|
Editors: Tim Taylor, Josh Auerbach, Josh Bongard, Jeff Clune, Simon
Hickinbotham, Greg Hornby
| null | null | null |
cs.NE cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Proceedings of WebAL-1: Workshop on Artificial Life and the Web 2014, held at
the 14th International Conference on the Synthesis and Simulation of Living
Systems (ALIFE 14), New York, NY, 31 July 2014.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2014 11:00:54 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jul 2014 03:18:05 GMT"
},
{
"version": "v3",
"created": "Sat, 26 Jul 2014 01:05:30 GMT"
},
{
"version": "v4",
"created": "Thu, 7 Aug 2014 05:17:20 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Taylor",
"Tim",
""
]
] |
new_dataset
| 0.982958 |
1408.1416
|
Gabi Nakibly
|
Hristo Bojinov, Yan Michalevsky, Gabi Nakibly, Dan Boneh
|
Mobile Device Identification via Sensor Fingerprinting
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate how the multitude of sensors on a smartphone can be used to
construct a reliable hardware fingerprint of the phone. Such a fingerprint can
be used to de-anonymize mobile devices as they connect to web sites, and as a
second factor in identifying legitimate users to a remote server. We present
two implementations: one based on analyzing the frequency response of the
speakerphone-microphone system, and another based on analyzing device-specific
accelerometer calibration errors. Our accelerometer-based fingerprint is
especially interesting because the accelerometer is accessible via JavaScript
running in a mobile web browser without requesting any permissions or notifying
the user. We present the results of the most extensive sensor fingerprinting
experiment done to date, which measured sensor properties from over 10,000
mobile devices. We show that the entropy from sensor fingerprinting is
sufficient to uniquely identify a device among thousands of devices, with low
probability of collision.
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2014 20:37:56 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Bojinov",
"Hristo",
""
],
[
"Michalevsky",
"Yan",
""
],
[
"Nakibly",
"Gabi",
""
],
[
"Boneh",
"Dan",
""
]
] |
new_dataset
| 0.996164 |
1408.1456
|
EPTCS
|
Christoph Wagner (TU Berlin), Uwe Nestmann (TU Berlin)
|
States in Process Calculi
|
In Proceedings EXPRESS/SOS 2014, arXiv:1408.1271
|
EPTCS 160, 2014, pp. 48-62
|
10.4204/EPTCS.160.6
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Formal reasoning about distributed algorithms (like Consensus) typically
requires to analyze global states in a traditional state-based style. This is
in contrast to the traditional action-based reasoning of process calculi.
Nevertheless, we use domain-specific variants of the latter, as they are
convenient modeling languages in which the local code of processes can be
programmed explicitly, with the local state information usually managed via
parameter lists of process constants. However, domain-specific process calculi
are often equipped with (unlabeled) reduction semantics, building upon a rich
and convenient notion of structural congruence. Unfortunately, the price for
this convenience is that the analysis is cumbersome: the set of reachable
states is modulo structural congruence, and the processes' state information is
very hard to identify. We extract from congruence classes of reachable states
individual state-informative representatives that we supply with a proper
formal semantics. As a result, we can now freely switch between the process
calculus terms and their representatives, and we can use the stateful
representatives to perform assertional reasoning on process calculus models.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 01:56:59 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Wagner",
"Christoph",
"",
"TU Berlin"
],
[
"Nestmann",
"Uwe",
"",
"TU Berlin"
]
] |
new_dataset
| 0.99492 |
1408.1459
|
EPTCS
|
Simon J. Gay (School of Computing Science, University of Glasgow),
Nils Gesbert (Grenoble INP - Ensimag), Ant\'onio Ravara (CITI and Dep de
Inform\'atica, FCT, Universidade Nova de Lisboa)
|
Session Types as Generic Process Types
|
In Proceedings EXPRESS/SOS 2014, arXiv:1408.1271
|
EPTCS 160, 2014, pp. 94-110
|
10.4204/EPTCS.160.9
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Behavioural type systems ensure more than the usual safety guarantees of
static analysis. They are based on the idea of "types-as-processes", providing
dedicated type algebras for particular properties, ranging from protocol
compatibility to race-freedom, lock-freedom, or even responsiveness. Two
successful, although rather different, approaches, are session types and
process types. The former allows to specify and verify (distributed)
communication protocols using specific type (proof) systems; the latter allows
to infer from a system specification a process abstraction on which it is
simpler to verify properties, using a generic type (proof) system. What is the
relationship between these approaches? Can the generic one subsume the specific
one? At what price? And can the former be used as a compiler for the latter?
The work presented herein is a step towards answers to such questions.
Concretely, we define a stepwise encoding of a pi-calculus with sessions and
session types (the system of Gay and Hole) into a pi-calculus with process
types (the Generic Type System of Igarashi and Kobayashi). We encode session
type environments, polarities (which distinguish session channels end-points),
and labelled sums. We show forward and reverse operational correspondences for
the encodings, as well as typing correspondences. To faithfully encode session
subtyping in process types subtyping, one needs to add to the target language
record constructors and new subtyping rules. In conclusion, the programming
convenience of session types as protocol abstractions can be combined with the
simplicity and power of the pi-calculus, taking advantage in particular of the
framework provided by the Generic Type System.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 01:57:27 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Gay",
"Simon J.",
"",
"School of Computing Science, University of Glasgow"
],
[
"Gesbert",
"Nils",
"",
"Grenoble INP - Ensimag"
],
[
"Ravara",
"António",
"",
"CITI and Dep de\n Informática, FCT, Universidade Nova de Lisboa"
]
] |
new_dataset
| 0.972464 |
1408.1534
|
Anupama Aggarwal
|
Anupama Aggarwal, Ponnurangam Kumaraguru
|
Followers or Phantoms? An Anatomy of Purchased Twitter Followers
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online Social Media (OSM) is extensively used by contemporary Internet users
to communicate, socialize and disseminate information. This has led to the
creation of a distinct online social identity which in turn has created the
need of online social reputation management techniques. A significant
percentage of OSM users utilize various methods to drive and manage their
reputation on OSM. This has given rise to underground markets which buy/sell
fraudulent accounts, `likes', `comments' (Facebook, Instagram) and `followers'
(Twitter) to artificially boost their social reputation. In this study, we
present an anatomy of purchased followers on Twitter and their behaviour. We
illustrate in detail the profile characteristics, content sharing and
behavioural patterns of purchased follower accounts.
Previous studies have analyzed the purchased follower markets and customers.
Ours is the first study which analyzes the anatomy of purchased followers
accounts. Some of the key insights of our study show that purchased followers
have a very high unfollow entropy rate and low social engagement with their
friends. In addition, we noticed that purchased follower accounts have
significant difference in their interaction and content sharing patterns in
comparison to random Twitter users. We also found that underground markets do
not follow their service policies and guarantees they provide to customer. Our
study highlights the key identifiers for suspicious follow behaviour. We then
built a supervised learning mechanism to predict suspicious follower behaviour
with 88.2% accuracy. We believe that understanding the anatomy and
characteristics of purchased followers can help detect suspicious follower
behaviour and fraudulent accounts to a larger extent.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 10:39:52 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Aggarwal",
"Anupama",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.970731 |
1408.1546
|
F. J. Lobillo
|
Jos\'e G\'omez-Torrecillas, F. J. Lobillo, Gabriel Navarro
|
Ideal codes over separable ring extensions
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the application of the theoretical algebraic notion
of a separable ring extension, in the realm of cyclic convolutional codes or,
more generally, ideal codes. We work under very mild conditions, that cover all
previously known as well as new non trivial examples. It is proved that ideal
codes are direct summands as left ideals of the underlying non-commutative
algebra, in analogy with cyclic block codes. This implies, in particular, that
they are generated by an idempotent element. Hence, by using a suitable
separability element, we design an efficient algorithm for computing one of
such idempotents.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 11:25:11 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Gómez-Torrecillas",
"José",
""
],
[
"Lobillo",
"F. J.",
""
],
[
"Navarro",
"Gabriel",
""
]
] |
new_dataset
| 0.99079 |
1408.1549
|
Reza Azad
|
Reza Azad, Babak Azad, Nabil Belhaj Khalifa, Shahram Jamali
|
Real-Time Human-Computer Interaction Based on Face and Hand Gesture
Recognition
| null |
International Journal in Foundations of Computer Science &
Technology 07/2014; 4(4):37-48
|
10.5121/ijfcst.2014.4403
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At the present time, hand gestures recognition system could be used as a more
expected and useable approach for human computer interaction. Automatic hand
gesture recognition system provides us a new tactic for interactive with the
virtual environment. In this paper, a face and hand gesture recognition system
which is able to control computer media player is offered. Hand gesture and
human face are the key element to interact with the smart system. We used the
face recognition scheme for viewer verification and the hand gesture
recognition in mechanism of computer media player, for instance, volume
down/up, next music and etc. In the proposed technique, first, the hand gesture
and face location is extracted from the main image by combination of skin and
cascade detector and then is sent to recognition stage. In recognition stage,
first, the threshold condition is inspected then the extracted face and gesture
will be recognized. In the result stage, the proposed technique is applied on
the video dataset and the high precision ratio acquired. Additional the
recommended hand gesture recognition method is applied on static American Sign
Language (ASL) database and the correctness rate achieved nearby 99.40%. also
the planned method could be used in gesture based computer games and virtual
reality.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 11:38:20 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Azad",
"Reza",
""
],
[
"Azad",
"Babak",
""
],
[
"Khalifa",
"Nabil Belhaj",
""
],
[
"Jamali",
"Shahram",
""
]
] |
new_dataset
| 0.996036 |
1408.1560
|
Seda Akbiyik
|
A. Seda, S. Vedat
|
MacWilliams identities for poset level weight enumerators of linear
codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have
been considered. Recently, codes over poset metrics have been studied. Poset
metric is a great generalization of many metrics especially the well-known ones
such as the RT and the Hamming metrics. Poset metric can be realized on the
channels with localized error occurrences. It has been shown that MacWilliams
identities are not admissible for codes over poset metrics in general [Kim and
Oh, 2005]. Lately, to overcome this problem some further studies on MacWilliams
identities over poset metrics has been presented. In this paper, we introduce
new poset level weight enumerators of linear codes over Frobenius commutative
rings. We derive MacWilliams-type identities for each of the given enumerators
which generalize in great deal the previous results discussed in the
literature. Most of the weight enumerators in the literature such as Hamming,
Rosenbloom-Tsfasman and complete m-spotty weight enumerators follow as
corollaries to these identities especially.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 12:32:38 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Seda",
"A.",
""
],
[
"Vedat",
"S.",
""
]
] |
new_dataset
| 0.988197 |
1408.1602
|
Theodor Borsche
|
Xiangkun Li, Theodor Borsche and G\"oran Andersson
|
PV Integration in Low-Voltage Feeders with Demand Response
|
Working Paper, to be submitted at PowerTech 2015
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increased distributed Photo-Voltaic (PV) generation leads to an increase in
voltages and unwarranted backflows into the grid. This paper investigates
Demand Response (DR) with Electric Water Heaters (EWHs) as a way to increase
the PV hosting capacity of a low-voltage feeder. A control strategy relying
only on power measurements at the transformer is proposed. Flexible loads are
optimally dispatched considering energy acquisition costs, a PV shedding
penalty, and power and energy constraints. Furthermore, grouping of loads and
PV plants is investigated, and switching penalties are used to reduce the
unnecessary switching of loads. It is shown that this strategy can
substantially increase the PV hosting capacity of a Low-Voltage (LV) feeder,
even when only basic controllability is available.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 14:19:12 GMT"
}
] | 2014-08-08T00:00:00 |
[
[
"Li",
"Xiangkun",
""
],
[
"Borsche",
"Theodor",
""
],
[
"Andersson",
"Göran",
""
]
] |
new_dataset
| 0.961422 |
1204.0833
|
Holger Petersen
|
Holger Petersen
|
Bounded Counter Languages
| null | null |
10.1007/978-3-642-31623-4_21
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that deterministic finite automata equipped with $k$ two-way heads
are equivalent to deterministic machines with a single two-way input head and
$k-1$ linearly bounded counters if the accepted language is strictly bounded,
i.e., a subset of $a_1^*a_2^*... a_m^*$ for a fixed sequence of symbols $a_1,
a_2,..., a_m$. Then we investigate linear speed-up for counter machines. Lower
and upper time bounds for concrete recognition problems are shown, implying
that in general linear speed-up does not hold for counter machines. For bounded
languages we develop a technique for speeding up computations by any constant
factor at the expense of adding a fixed number of counters.
|
[
{
"version": "v1",
"created": "Tue, 3 Apr 2012 23:29:49 GMT"
}
] | 2014-08-07T00:00:00 |
[
[
"Petersen",
"Holger",
""
]
] |
new_dataset
| 0.995108 |
1408.1260
|
Maxim Kolchin Mr.
|
Maxim Kolchin, Fedor Kozlov
|
Unstable markup: A template-based information extraction from web sites
with unstable markup
|
ESWC 2014 Semantic Publishing Challenge, Task 1
| null | null | null |
cs.IR cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents results of a work on crawling CEUR Workshop proceedings
web site to a Linked Open Data (LOD) dataset in the framework of ESWC 2014
Semantic Publishing Challenge 2014. Our approach is based on using an
extensible template-dependent crawler and DBpedia for linking extracted
entities, such as the names of universities and countries.
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2014 12:36:23 GMT"
}
] | 2014-08-07T00:00:00 |
[
[
"Kolchin",
"Maxim",
""
],
[
"Kozlov",
"Fedor",
""
]
] |
new_dataset
| 0.99197 |
1408.1295
|
Kui Xu
|
Kui Xu, Youyun Xu, Dongmei Zhang, Wenfeng Ma
|
Max-SINR Receiver for HMCT Systems over Non-Stationary Doubly Dispersive
Channel
|
This paper has been accepted by URSI GASS 2014 and will be presented
in the proceeding of URSI GASS 2014
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, a maximizing Signal-to-Interference plus-Noise Ratio
(Max-SINR) receiver for Hexagonal Multicarrier Transmission (HMCT) system over
non-stationary doubly dispersive (NSDD) channel is proposed. The closed-form
timing offset expression of the prototype pulse for the proposed Max-SINR HMCT
receiver over NSDD channel is derived. Simulation results show that the
proposed Max-SINR receiver outperforms traditional projection scheme and
obtains an approximation to the theoretical upper bound SINR performance within
all the local stationarity regions (LSRs). Meanwhile, the SINR performance of
the proposed Max-SINR HMCT receiver is robust to the estimation error between
the estimated value and the real value of root mean square (RMS) delay spread.
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2014 14:36:38 GMT"
}
] | 2014-08-07T00:00:00 |
[
[
"Xu",
"Kui",
""
],
[
"Xu",
"Youyun",
""
],
[
"Zhang",
"Dongmei",
""
],
[
"Ma",
"Wenfeng",
""
]
] |
new_dataset
| 0.994669 |
1408.0689
|
Gong Yue-Jiao
|
Yue-Jiao Gong and Jun Zhang
|
Real-Time Traffic Signal Control for Modern Roundabouts by Using
Particle Swarm Optimization-Based Fuzzy Controller
| null | null | null |
SYSU -- 201103
|
cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Due to that the existing traffic facilities can hardly be extended,
developing traffic signal control methods is the most important way to improve
the traffic efficiency of modern roundabouts. This paper proposes a novel
traffic signal controller with two fuzzy layers for signalizing the roundabout.
The outer layer of the controller computes urgency degrees of all the phase
subsets and then activates the most urgent subset. This mechanism helps to
instantly respond to the current traffic condition of the roundabout so as to
improve real-timeness. The inner layer of the controller computes extension
time of the current phase. If the extension value is larger than a threshold
value, the current phase is maintained; otherwise the next phase in the running
phase subset (selected by the outer layer) is activated. The inner layer adopts
well-designed phase sequences, which helps to smooth the traffic flows and to
avoid traffic jam. In general, the proposed traffic signal controller is
capable of improving real-timeness as well as reducing traffic congestion.
Moreover, an offline particle swarm optimization (PSO) algorithm is developed
to optimize the membership functions adopted in the proposed controller. By
using optimal membership functions, the performance of the controller can be
further improved. Simulation results demonstrate that the proposed controller
outperforms previous traffic signal controllers in terms of improving the
traffic efficiency of modern roundabouts.
|
[
{
"version": "v1",
"created": "Mon, 4 Aug 2014 14:08:53 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Aug 2014 07:23:58 GMT"
}
] | 2014-08-06T00:00:00 |
[
[
"Gong",
"Yue-Jiao",
""
],
[
"Zhang",
"Jun",
""
]
] |
new_dataset
| 0.984674 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.