Identification and U-control of a state-space system with time-delay

This article presents a state-space model with time-delay to map the relationship between known input-output data for discrete systems. For the given input-output data, a model identification algorithm combining parameter estimation and state estimation is proposed in line with the causality constraints. Consequently, this article proposes a least squares parameter estimation algorithm, and analyzes its convergence for the studied systems to prove that the parameter estimation errors converge to zero under the persistent excitation conditions. In control system design, the U-model based control is introduced to provide a unilateral platform to improve the design efficiency and generality. A simulation portfolio from modeling to control is provided with computational experiments to validate the derived results.     

Applications of sketches in network traffic measurement: A survey

Accurate and timely network traffic measurement is essential for network status monitoring, network fault analysis, network intrusion detection, and network security management. With the rapid development of the network, massive network traffic brings severe challenges to network traffic measurement. However, existing measurement methods suffer from many limitations for effectively recording and accurately analyzing big-volume traffic. Recently, sketches, a family of probabilistic data structures that employ hashing technology for summarizing traffic data, have been widely used to solve these problems. However, current literature still lacks a thorough review on sketch-based traffic measurement methods to offer a comprehensive insight on how to apply sketches for fulfilling various traffic measurement tasks. In this paper, we provide a detailed and comprehensive review on the applications of sketches in network traffic measurement. To this end, we classify the network traffic measurement tasks into four categories based on the target of traffic measurement, namely cardinality estimation, flow size estimation, change anomaly detection, and persistent spreader identification. First, we briefly introduce these four types of traffic measurement tasks and discuss the advantages of applying sketches. Then, we propose a series of requirements with regard to the applications of sketches in network traffic measurement. After that, we perform a fine-grained classification for each sketch-based measurement category according to the technologies applied on sketches. During the review, we evaluate the performance, advantages and disadvantages of current sketch-based traffic measurement methods based on the proposed requirements. Through the thorough review, we gain a number of valuable implications that can guide us to choose and design proper traffic measurement methods based on sketches. We also review a number of general sketches that are highly expected in modern network systems to simultaneously perform multiple traffic measurement tasks and discuss their performance based on the proposed requirements. Finally, through our serious review, we summarize a number of open issues and identify several promising research directions.     

Re-evaluation of Radiation-Energy Transfer to an Extraction Solvent in a Minor-Actinide-Separation Process Based on Consideration of Radiation Permeability

ABSTRACT

Absorbed-dose estimation is essential for evaluation of the radiation tolerance of minor-actinide-separation processes. We propose a dose-evaluation method based on radiation permeability, with comparisons of heterogeneous structures seen in the solvent-extraction process, such as emulsions forming in the mixture of the organic and aqueous phases. A demonstration of radiation-energy-transfer simulation is performed with a focus on the minor-actinide-recovery process from high-level liquid waste with the aid of the Monte Carlo radiation-transport code PHITS. The simulation results indicate that the dose absorbed by the extraction solvent from alpha radiation depends upon the emulsion structure, and that from beta and gamma radiation depends upon the mixer-settler-apparatus size. Non-negligible contributions of well-permeable gamma rays were indicated in terms of the plant operation of the minor-actinide-separation process.     

Maximum likelihood-based adaptive differential evolution identification algorithm for multivariable systems in the state-space form

Parameter estimation plays an important role in the field of system control. This article is concerned with the parameter estimation methods for multivariable systems in the state-space form. For the sake of solving the identification complexity caused by a large number of parameters in multivariable systems, we decompose the original multivariable system into some subsystems containing fewer parameters and study identification algorithms to estimate the parameters of each subsystem. By taking the maximum likelihood criterion function as the fitness function of the differential evolution algorithm, we present a maximum likelihood-based differential evolution (ML-DE) algorithm for parameter estimation. To improve the parameter estimation accuracy, we introduce the adaptive mutation factor and the adaptive crossover factor into the ML-DE algorithm and propose a maximum likelihood-based adaptive differential evolution algorithm. The simulation study indicates the efficiency of the proposed algorithms.     

F-OFDM仿真系统设计与时频同步算法

针对新一代5G波形的F-OFDM技术开展了研究,通过把一个宽带分为若干个子带,对每个子带进行滤波处理以实现更好的通信效能。基于Simulink平台进行了F-OFDM仿真系统的搭建,重点对F-OFDM符号同步方法和频偏估计方法进行了研究与仿真分析。实验结果表明,基于Chu序列相比采用PN序列可以获得更好的同步效果,基于导频的Classen频偏估计算法相比基于CP的CFO估计算法和基于训练序列的Moose估计方法可以获得更好的频偏估计效果。     

干扰条件下的“北斗”信号解扩重构DOA估计

在干扰条件下，卫星导航抗干扰波束形成算法往往需要卫星信号波达方向（Direction-of-Arrival，DOA）的先验信息。但当存在低信噪比信号或主动干扰源时，常规的DOA估计算法性能急剧下降甚至失效。针对此问题，提出了一种被干扰信号压制的低信噪比“北斗”信号的DOA估计算法。该算法首先通过对接收信号进行子空间投影抑制干扰信号，然后对抑制干扰后的信号进行解扩重构处理，最后通过多重信号分类算法完成对“北斗”信号的DOA估计。仿真结果表明，在干扰信号干信比80 dB条件下，“北斗”信号DOA估计误差在5°以内，为下一步进行波束形成计算提供了高精度的入射角信息。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

A lightweight autonomous MAV for indoor search and rescue

Micro Aerial Vehicles (MAVs) have great potentials to be applied for indoor search and rescue missions. In this paper, we propose a modular lightweight design of an autonomous MAV with integrated hardware and software. The MAV is equipped with the 2D laser scanner, camera, mission computer and flight controller, running all the computation onboard in real time. The onboard perception system includes a laser‐based SLAM module and a custom‐designed visual detection module. A dual Kalman filter design provides robust state estimation by multiple sensor fusion. Specifically, the fusion module provides robust altitude measurement in the circumstance of surface changing. In addition, indoor‐outdoor transition is explicitly handled by the fusion module. In order to efficiently navigate through obstacles and adapt to multiple tasks, a task tree‐based mission planning method is seamlessly integrated with path planning and control modules. The MAV is capable of searching and rescuing victims from unknown indoor environments effectively. It was validated by our award‐winning performance at the 2017 International Micro Air Vehicle Competition (IMAV 2017), held in Toulouse, France. The performance video is available on https://youtu.be/8H19ppS_VXM .     

Parameter estimation for a morphochemical reaction-diffusion model of electrochemical pattern formation

The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.     

Nonuniform linear array DOA estimation using EM criterion

In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources.