In many fields of engineering and science, it is necessary to solve nonlinear equation systems (NESs). When using multiobjective optimization to solve NESs, there are two problems: 1) how to transform an NES into a mu...
详细信息
Data-driven evolutionary algorithms (DDEAs) have attracted much attention in recent years, due to their effectiveness and advantages in solving expensive and complex optimization problems. In an offline data-driven ev...
详细信息
This paper proposes a fog weather data augmentation method for the unmanned surface vessels(USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided g...
This paper proposes a fog weather data augmentation method for the unmanned surface vessels(USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided generation of the atmospheric scattering model in this paper. A Laplacian Pyramid Based Depth Residuals model is added to the generator which reduces the difficulty of generating fog images caused by the degradation of water surface image and improves the quality of generated images. Finally, fog images are generated from sunny weather images collected with HUST-12C by LPBDR-GAN model and experiments show that generated images are very close to real fog images.
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization ***, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved...
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization ***, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved ant colony algorithm named ACO-SA is put forward afterwards to effectively solve the problem. The algorithm is a combination of ACO algorithm(ant colony algorithm) and SA algorithm(simulated annealing algorithm), which has three improments: change the initial distribution of pheromone to guide the search when the algorithm has just started running;change the heuristic function and state transition probability taking three factors into consideration;change the pheromone update rule and make the ants compete for the right to update pheromone by simulated annealing algorithm, and update the best solution by the same ***, simulation experiment and field experiment are conducted to check the validity of ACO-SA algorithm.
Few-shot learning (FSL) as a data-scarce method, aims to recognize instances of unseen classes solely based on very few examples. However, the model can easily become overfitted due to the biased distribution formed w...
详细信息
作者:
Xiang HuangHai-Tao ZhangSchool of Artificial Intelligence and Automation
the Engineering Research Center of Autonomous Intelligent Unmanned Systems the Key Laboratory of Image Processing and Intelligent Control and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this chal...
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this challenging issue, this work develops a Koopman model predict control(Koopman-MPC) framework for the piezoelectric actuator. Specifically, the Koopman operator theory is adapted for modeling the piezoelectric actuator dynamics. A simple yet powerful linear model spanned in a high-dimensional space is thus constructed to characterize the hysteresis dynamics. Subsequently, upon the established Koopman model, an MPC scheme is put forward for tracking control of piezoelectric actuators. Therein, by sustained optimizing a cost function containing future outputs and control increments, the control input is obtained. Moreover, extensive tracking simulations are carried out on a simulated piezoelectric actuator for verifying the feasibility and effectiveness of the Koopman-MPC scheme.
作者:
Yumei WangChuancong TangHai-Tao ZhangSchool of Artificial Intelligence and Automation
the Engineering Research Center of Autonomous Intelligent Unmanned Systemsthe Key Laboratory of Image Processing and Intelligent Controland the State Key Laboratory of Digital Manufacturing Equipment and TechnologyHuazhong University of Science and Technology
There are always some "key" nodes in a big complex network,which can joint the most connected *** to identify these nodes,finding a minimum set of nodes to attack for reducing the size of residual network...
There are always some "key" nodes in a big complex network,which can joint the most connected *** to identify these nodes,finding a minimum set of nodes to attack for reducing the size of residual network's Largest Connected Component(LCC) to break up the original network,has become a research ***,a method for determining the"key" nodes based on reinforcement learning framework and supervised learning model is *** algorithm can not only utilize the dynamic exploration ability of reinforcement learning to collect a rich training dataset,but also take advantage of the characteristics that supervised learning is adaptive and has strong generalization ability to possess high efficiency and strong *** order to further improve the algorithm's performance,-greedy mechanism is used to explore more network *** experiment results show that given the same fraction of removed nodes,our algorithm can make the residual LCC smaller in various networks which is superior to the state-of-the-art algorithms in terms of effectiveness and generalization.
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learnin...
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learning, do not fully consider the characteristics of water environment, resulting in severe error depths in weak textures(sky, calm lake) and water reflections regions, that increases the risk of running aground or collision. What is worse that there is not a public dataset for depth estimation in the water environment. Therefore, this work proposes a self-supervised model for depth estimation named Water Depth Perception Network(WDNet) to address these problems. The decoder of this network has a wider receptive field and can effectively handle the depth error in the weak texture region. Besides, the WDNet is trained with a novel and effective loss function which assist the network to reduce errors in sky and water region, and some indexes are proposed to evaluate the model's performances in sky and water region. Finally, our proposed WDNet achieves a 0.1056 absolute relative error in ranging, the average number of error pixels in the sky area drops from 15803.87 to 580.91, which only accounted for 0.29% of the image,and the error in water region drops from 51.04 to 6.75, all of them are superior to the performance of baseline model.
RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full...
详细信息
ISBN:
(数字)9798350386226
ISBN:
(纸本)9798350386233
RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions.
This paper develops a data-driven deterministic identification architecture for discovering stochastic differential equations (SDEs) directly from data. The architecture first generates deterministic data for stochast...
This paper develops a data-driven deterministic identification architecture for discovering stochastic differential equations (SDEs) directly from data. The architecture first generates deterministic data for stochastic processes using the Feynman–Kac formula, and gives a parabolic partial differential equation (PDE) associated with the SDE. Then, a sparse regression model is proposed to discover drift and diffusion terms in SDEs using PDE data-driven techniques, where a large candidate library of potential terms only for the drift and diffusion coefficients in SDEs need be constructed. To simultaneously infer the drift and diffusion terms, we proposed a sequential thresholded reweighted least-squares algorithm to solve the constructed sparse regression model. The main advantage of the proposed method is that on the one hand, theoretical and numerical identification results of PDEs can be used for SDEs, on the score, our SDE identification problem is translated into the parameter estimation problem of PDEs, on the other hand, the proposed algorithm is easily executed and can enhance the sparsity and accuracy. Through several classical SDEs and ordinary differential equations, the effectiveness of the proposed data-driven method is demonstrated, and several comparison experiments with state-of-the-art approaches is provided to illustrate the superiority of the developed algorithm.
暂无评论