85,485 research outputs found
Performance Metrics for Systems with Soft-Decision FEC and Probabilistic Shaping
High-throughput optical communication systems utilize binary soft-decision
forward error correction (SD-FEC) with bit interleaving over the bit channels.
The generalized mutual information (GMI) is an achievable information rate
(AIR) in such systems and is known to be a good predictor of the bit error rate
after SD-FEC decoding (post-FEC BER) for uniform signaling. However, for
probabilistically shaped (nonuniform) signaling, we find that the normalized
AIR, defined as the AIR divided by the signal entropy, is less correlated with
the post-FEC BER. We show that the information quantity based on the
distribution of the single bit signal, and its asymmetric loglikelihood ratio,
are better predictors of the post-FEC BER. In simulations over the Gaussian
channel, we find that the prediction accuracy, quantified as the peak-to-peak
deviation of the post-FEC BER within a set of different modulation formats and
distributions, can be improved more than 10 times compared with the normalized
AIR.Comment: 4 pages, 3 figure
A Probabilistic Approach to Robust Optimal Experiment Design with Chance Constraints
Accurate estimation of parameters is paramount in developing high-fidelity
models for complex dynamical systems. Model-based optimal experiment design
(OED) approaches enable systematic design of dynamic experiments to generate
input-output data sets with high information content for parameter estimation.
Standard OED approaches however face two challenges: (i) experiment design
under incomplete system information due to unknown true parameters, which
usually requires many iterations of OED; (ii) incapability of systematically
accounting for the inherent uncertainties of complex systems, which can lead to
diminished effectiveness of the designed optimal excitation signal as well as
violation of system constraints. This paper presents a robust OED approach for
nonlinear systems with arbitrarily-shaped time-invariant probabilistic
uncertainties. Polynomial chaos is used for efficient uncertainty propagation.
The distinct feature of the robust OED approach is the inclusion of chance
constraints to ensure constraint satisfaction in a stochastic setting. The
presented approach is demonstrated by optimal experimental design for the
JAK-STAT5 signaling pathway that regulates various cellular processes in a
biological cell.Comment: Submitted to ADCHEM 201
An Accuracy-Assured Privacy-Preserving Recommender System for Internet Commerce
Recommender systems, tool for predicting users' potential preferences by
computing history data and users' interests, show an increasing importance in
various Internet applications such as online shopping. As a well-known
recommendation method, neighbourhood-based collaborative filtering has
attracted considerable attention recently. The risk of revealing users' private
information during the process of filtering has attracted noticeable research
interests. Among the current solutions, the probabilistic techniques have shown
a powerful privacy preserving effect. When facing Nearest Neighbour attack,
all the existing methods provide no data utility guarantee, for the
introduction of global randomness. In this paper, to overcome the problem of
recommendation accuracy loss, we propose a novel approach, Partitioned
Probabilistic Neighbour Selection, to ensure a required prediction accuracy
while maintaining high security against NN attack. We define the sum of
neighbours' similarity as the accuracy metric alpha, the number of user
partitions, across which we select the neighbours, as the security metric
beta. We generalise the Nearest Neighbour attack to beta k Nearest
Neighbours attack. Differing from the existing approach that selects neighbours
across the entire candidate list randomly, our method selects neighbours from
each exclusive partition of size with a decreasing probability. Theoretical
and experimental analysis show that to provide an accuracy-assured
recommendation, our Partitioned Probabilistic Neighbour Selection method yields
a better trade-off between the recommendation accuracy and system security.Comment: replacement for the previous versio
Scalable Approach to Uncertainty Quantification and Robust Design of Interconnected Dynamical Systems
Development of robust dynamical systems and networks such as autonomous
aircraft systems capable of accomplishing complex missions faces challenges due
to the dynamically evolving uncertainties coming from model uncertainties,
necessity to operate in a hostile cluttered urban environment, and the
distributed and dynamic nature of the communication and computation resources.
Model-based robust design is difficult because of the complexity of the hybrid
dynamic models including continuous vehicle dynamics, the discrete models of
computations and communications, and the size of the problem. We will overview
recent advances in methodology and tools to model, analyze, and design robust
autonomous aerospace systems operating in uncertain environment, with stress on
efficient uncertainty quantification and robust design using the case studies
of the mission including model-based target tracking and search, and trajectory
planning in uncertain urban environment. To show that the methodology is
generally applicable to uncertain dynamical systems, we will also show examples
of application of the new methods to efficient uncertainty quantification of
energy usage in buildings, and stability assessment of interconnected power
networks
Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Age
Simultaneous Localization and Mapping (SLAM)consists in the concurrent
construction of a model of the environment (the map), and the estimation of the
state of the robot moving within it. The SLAM community has made astonishing
progress over the last 30 years, enabling large-scale real-world applications,
and witnessing a steady transition of this technology to industry. We survey
the current state of SLAM. We start by presenting what is now the de-facto
standard formulation for SLAM. We then review related work, covering a broad
set of topics including robustness and scalability in long-term mapping, metric
and semantic representations for mapping, theoretical performance guarantees,
active SLAM and exploration, and other new frontiers. This paper simultaneously
serves as a position paper and tutorial to those who are users of SLAM. By
looking at the published research with a critical eye, we delineate open
challenges and new research issues, that still deserve careful scientific
investigation. The paper also contains the authors' take on two questions that
often animate discussions during robotics conferences: Do robots need SLAM? and
Is SLAM solved
- …