=====================================
GoAhead WebServer 2.1.8 Release Notes
=====================================
.. NOTES:
.. This document is maintained using the reStructuredText markup system.
.. You may download this from <http://docutils.sf.net>. Also note that running
.. the docutils code requires that a version of Python version 2.1 or later
.. be installed on the machine. Since the GoAhead release procedure itself
.. runs in Python, this should not be a problem.
..
.. To add new entries to the release notes, follow the markup shown below
.. (releases should be underlined with a row of '=' characters, each item
.. noted within a release should be underlined with '-' characters.
=====================================
GoAhead WebServer 2.1.8 Release Notes
=====================================
.. NOTES:
.. This document is maintained using the reStructuredText markup system.
.. You may download this from <http://docutils.sf.net>. Also note that running
.. the docutils code requires that a version of Python version 2.1 or later
.. be installed on the machine. Since the GoAhead release procedure itself
.. runs in Python, this should not be a problem.
..
.. To add new entries to the release notes, follow the markup shown below
.. (releases should be underlined with a row of '=' characters, each item
.. noted within a release should be underlined with '-' characters.
We consider the problem of target localization by a
network of passive sensors. When an unknown target emits an
acoustic or a radio signal, its position can be localized with multiple
sensors using the time difference of arrival (TDOA) information.
In this paper, we consider the maximum likelihood formulation
of this target localization problem and provide efficient convex
relaxations for this nonconvex optimization problem.We also propose
a formulation for robust target localization in the presence of
sensor location errors. Two Cramer-Rao bounds are derived corresponding
to situations with and without sensor node location errors.
Simulation results confirm the efficiency and superior performance
of the convex relaxation approach as compared to the
existing least squares based approach when large sensor node location
errors are present.
Lithium–sulfur batteries are a promising energy-storage technology due to their relatively low cost and high theoretical energy density. However, one of their major technical problems is the shuttling of soluble polysulfides between electrodes, resulting in rapid capacity fading. Here, we present a metal–organic framework (MOF)-based battery separator to mitigate the shuttling problem. We show that the MOF-based separator acts as an ionic sieve in lithium–sulfur batteries, which selectively sieves Li+ ions while e ciently suppressing undesired polysulfides migrating to the anode side. When a sulfur-containing mesoporous carbon material (approximately 70 wt% sulfur content) is used as a cathode composite without elaborate synthesis or surface modification, a lithium–sulfur battery with a MOF-based separator exhibits a low capacity decay rate (0.019% per cycle over 1,500 cycles). Moreover, there is almost no capacity fading after the initial 100 cycles. Our approach demonstrates the potential for MOF-based materials as separators for energy-storage applications.
Accurate pose estimation plays an important role in solution of simultaneous localization and mapping (SLAM) problem, required for many robotic applications. This paper presents a new approach called R-SLAM, primarily to overcome systematic and non-systematic odometry errors which are generally caused by uneven floors, unexpected objects on the floor or wheel-slippage due to skidding or fast turns.The hybrid approach presented here combines the strengths of feature based and grid based methods to produce globally consistent high resolution maps within various types of environments.
Without conceding a blemish in the first edition, I think I had best come clean
and admit that I embarked on a second edition largely to adopt a more geometric
approach to the detection of signals in white Gaussian noise. Equally rigorous, yet
more intuitive, this approach is not only student-friendly, but also extends more
easily to the detection problem with random parameters and to the radar problem
In this paper, we consider the channel estimation
problem in Millimeter wave (mmWave) wireless systems with
large antenna arrays. By exploiting the inherent sparse nature of
the mmWave channel, we develop a novel rate-adaptive channel
estimation (RACE) algorithm, which can adaptively adjust the
number of required channel measurements based on an expected
probability of estimation error (PEE).
In cellular networks, it is estimated that
2
3
of calls and over 90% of data services occur
indoors. However, some surveys show that many households and businesses experience
a poor indoor coverage problem. It has been identified that poor coverage is the main
reason for churn, which is very costly for operators in saturated markets. How to provide
good indoor coverage cost effectively is thus a demanding challenge for operators.
The recent developments in full duplex (FD) commu-
nication promise doubling the capacity of cellular networks using
self interference cancellation (SIC) techniques. FD small cells
with device-to-device (D2D) communication links could achieve
the expected capacity of the future cellular networks (5G). In
this work, we consider joint scheduling and dynamic power
algorithm (DPA) for a single cell FD small cell network with
D2D links (D2DLs). We formulate the optimal user selection and
power control as a non-linear programming (NLP) optimization
problem to get the optimal user scheduling and transmission
power in a given TTI. Our numerical results show that using
DPA gives better overall throughput performance than full power
transmission algorithm (FPA). Also, simultaneous transmissions
(combination of uplink (UL), downlink (DL), and D2D occur
80% of the time thereby increasing the spectral efficiency and
network capacity
