For optimal design of mechanical clinching steel-aluminum joints,the back propagation(BP)neural network is used to research the mapping relationship between joining technique parameters including sheet thickness,sheet...For optimal design of mechanical clinching steel-aluminum joints,the back propagation(BP)neural network is used to research the mapping relationship between joining technique parameters including sheet thickness,sheet hardness,joint bottom diameter etc.,and mechanical properties of shearing and peeling in order to investigate joining technology between various material plates in the steel-aluminum hybrid structure car body.Genetic algorithm(GA)is adopted to optimize the back-propagation neural network connection weights.The training and validating samples are made by the BTM Tog-L-Loc system with different technologic parameters.The training samples'parameters and the corresponding joints'mechanical properties are supplied to the artificial neural network(ANN)for training.The validating samples'experimental data is used for checking up the prediction outputs.The calculation results show that GA can improve the model's prediction precision and generalization ability of BP neural network.The comparative analysis between the experimental data and the prediction outputs shows that ANN prediction models after training can effectively predict the mechanical properties of mechanical clinching joints and prove the feasibility and reliability of the intelligent neural networks system when used in the mechanical properties prediction of mechanical clinching joints.The prediction results can be used for a reference in the design of mechanical clinching steel-aluminum joints.展开更多
This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increas...This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increase the spectrum efficiency,an improved preamble structure without guard symbols is derived at first. On this basis, instead of deriving the log likelihood function of power spectral density, joint estimation of the symbol timing offset and carrier frequency offset based on the preamble proposed is formulated into a bivariate optimization problem. After that, an improved genetic algorithm is used to find its global optimum solution. Conclusions can be drawn from simulation results that the proposed method has advantages in the joint estimation of synchronization.展开更多
A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE...A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE）- based space-alternating generalized expectation-maximization （SAGE） algorithm. In the proposed algorithm, every sub-frame of the MIMO-OFDM system is divided into some OFDM sub-blocks and the LMMSE-based SAGE algorithm in each sub-block is used. At the head of each sub-flame, we insert training symbols which are used in the initial estimation at the beginning. Channel estimation of the previous sub-block is applied to the initial estimation in the current sub-block by the maximum-likelihood （ML） detection to update channel estimatjon and data detection by iteration until converge. Then all the sub-blocks can be finished in turn. Simulation results show that the proposed algorithm can improve the bit error rate （BER） performance.展开更多
Impact dynamics of multi-rigid-body systems with joint friction is considered. Based on the traditional approximate assumption dealing with impact problem, a general numerical method called the sliding state stepping ...Impact dynamics of multi-rigid-body systems with joint friction is considered. Based on the traditional approximate assumption dealing with impact problem, a general numerical method called the sliding state stepping algorithm is introduced. This method can avoid difficulties in solving differential equations with variable scale and its result can avoid energy inconsistency before and after impact from considering complexily of tangential sliding mode. An example is given to describe details using this algorithm.展开更多
Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process o...Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.展开更多
To achieve much efficient multimedia transmission over an error-prone wireless network, there are still some problem must to be solved, especially in energy limited wireless sensor network. In this paper, we propose a...To achieve much efficient multimedia transmission over an error-prone wireless network, there are still some problem must to be solved, especially in energy limited wireless sensor network. In this paper, we propose a joint detection based on Schur Algorithm for image wireless transmission over wireless sensor network. To eliminate error transmissions and save transmission energy, we combine Schur algorithm with joint dynamic detection for wireless transmission of JPEG 2000 encoded image which we proposed in [1]. Schur algorithm is used to computing the decomposition of system matrix to decrease the computational complexity. We de-scribe our transmission protocol, and report on its performance evaluation using a simulation testbed we have designed for this purpose. Our results clearly indicate that our method could approach efficient images transmission in wireless sensor network and the transmission errors are significantly reduced when compared to regular transmissions.展开更多
Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tas...Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tasks effectively meet the deadline,it means the system is working in pristine order.However,missing the deadline means a systemic fault due to which the system can crash(hard RTS)or degrade inclusive performance(soft RTS).To fine-tune the RTS,tolerance is the critical issue and must be handled with extreme care.This article explains the context of fault tolerance with improvised Joint EDF-RMS algorithm in RTS.The backup method has been derived to prevent the system from being recursively migrating the same task.If any task migrates three times,this migrated task will get shifted to the backup queue.This backup queue assigns the task to a backup processor and is destined for final execution.For performance evaluation purposes,a relative graph between fault and failure rates,failure and total processor utilization along with other averages have been evaluated.Furthermore,these archived results are compared with fault-tolerant Earliest Deadline First(EDF)and Rate Monotonic Scheduling(RMS)algorithms independently in relatively similar conditions.These comparisons show better performance against overloading conditions.展开更多
Semantic secure communication is an emerging field that combines the principles of source-channel coding with the need for secure data transmission.It is of great significance in modern communications to protect the c...Semantic secure communication is an emerging field that combines the principles of source-channel coding with the need for secure data transmission.It is of great significance in modern communications to protect the confidentiality and privacy of sensitive information and prevent information leaks and malicious attacks.This paper presents a novel approach to semantic secure communication through the utilization of joint source-channel coding,which is based on the design of an automated joint source-channel coding algorithm and an encryption and decryption algorithm based on semantic security.The traditional and state-of-the-art joint source-channel coding algorithms are selected as two baselines for different comparison purposes.Experimental results demonstrate that our proposed algorithm outperforms the first baseline algorithm,the traditional source-channel coding,by 61.21%in efficiency under identical channel conditions(SNR=15 dB).In security,our proposed method can resist 2 more types of attacks compared to the two baselines,exhibiting nearly no increases in time consumption and error rate compared to the state-of-the-art joint source-channel coding algorithm while the secure semantic communication is supported.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
针对在现场可编程门阵列(Field Programmable Gate Array,FPGA)上实现基于极化敏感阵列的多重信号分类(Multiple Signal Classification,MUSIC)算法进行二维波达方向(Direction of Arrival,DOA)和二维极化参数联合估计时,硬件资源占用...针对在现场可编程门阵列(Field Programmable Gate Array,FPGA)上实现基于极化敏感阵列的多重信号分类(Multiple Signal Classification,MUSIC)算法进行二维波达方向(Direction of Arrival,DOA)和二维极化参数联合估计时,硬件资源占用大、运行时间长的问题,提出了一种基于极化MUSIC算法的四维参数联合估计FPGA实现架构。该架构包括信号协方差矩阵计算模块、Jacobi旋转模块、噪声子空间提取模块、两级空间谱搜索模块和极化参数计算模块。Jacobi旋转模块被拆分为多个可复用模块,并采用查找表模块生成旋转矩阵。一级空间谱搜索模块通过二维DOA搜索初步确定信源的角度信息。二级空间谱搜索模块根据一级搜索的角度结果确定二级搜索区域各点的极化信息,并计算该区域的四维空间谱,区域内最小值对应的四维参数信息即为最终估计的信源方向角、俯仰角、极化辅助角和极化相位角。仿真结果表明,与传统极化MUSIC算法的四维搜索算法相比,该架构避免了大量四维空间谱计算,同时保证了四维参数估计的精度,显著减少了运行时间和硬件资源消耗。展开更多
To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical mode...To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.展开更多
The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur d...The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.展开更多
基金supported by Guangdong Provincial Technology Planning of China(Grant No.2007B010400052)State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body of China(Grant No.30715006)Guangdong Provincial Key Laboratory of Automotive Engineering,China(Grant No.2007A03012)
文摘For optimal design of mechanical clinching steel-aluminum joints,the back propagation(BP)neural network is used to research the mapping relationship between joining technique parameters including sheet thickness,sheet hardness,joint bottom diameter etc.,and mechanical properties of shearing and peeling in order to investigate joining technology between various material plates in the steel-aluminum hybrid structure car body.Genetic algorithm(GA)is adopted to optimize the back-propagation neural network connection weights.The training and validating samples are made by the BTM Tog-L-Loc system with different technologic parameters.The training samples'parameters and the corresponding joints'mechanical properties are supplied to the artificial neural network(ANN)for training.The validating samples'experimental data is used for checking up the prediction outputs.The calculation results show that GA can improve the model's prediction precision and generalization ability of BP neural network.The comparative analysis between the experimental data and the prediction outputs shows that ANN prediction models after training can effectively predict the mechanical properties of mechanical clinching joints and prove the feasibility and reliability of the intelligent neural networks system when used in the mechanical properties prediction of mechanical clinching joints.The prediction results can be used for a reference in the design of mechanical clinching steel-aluminum joints.
基金supported by the National Natural Science Foundation of China(61671468)。
文摘This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increase the spectrum efficiency,an improved preamble structure without guard symbols is derived at first. On this basis, instead of deriving the log likelihood function of power spectral density, joint estimation of the symbol timing offset and carrier frequency offset based on the preamble proposed is formulated into a bivariate optimization problem. After that, an improved genetic algorithm is used to find its global optimum solution. Conclusions can be drawn from simulation results that the proposed method has advantages in the joint estimation of synchronization.
基金Supported by the National Natural Science Foundation of China （No. 61001105）, the National Science and Technology Major Projects （No. 2011ZX03001- 007- 03） and Beijing Natural Science Foundation （No. 4102043）.
文摘A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE）- based space-alternating generalized expectation-maximization （SAGE） algorithm. In the proposed algorithm, every sub-frame of the MIMO-OFDM system is divided into some OFDM sub-blocks and the LMMSE-based SAGE algorithm in each sub-block is used. At the head of each sub-flame, we insert training symbols which are used in the initial estimation at the beginning. Channel estimation of the previous sub-block is applied to the initial estimation in the current sub-block by the maximum-likelihood （ML） detection to update channel estimatjon and data detection by iteration until converge. Then all the sub-blocks can be finished in turn. Simulation results show that the proposed algorithm can improve the bit error rate （BER） performance.
基金the National Natural Science Foundation of China(No.10532050)the Na-tional Science Fund for Distinguished Young Scholars(No.10625211)the Science Development Foundation of Shandong University of Science and Techonogy(No.05g017)
文摘Impact dynamics of multi-rigid-body systems with joint friction is considered. Based on the traditional approximate assumption dealing with impact problem, a general numerical method called the sliding state stepping algorithm is introduced. This method can avoid difficulties in solving differential equations with variable scale and its result can avoid energy inconsistency before and after impact from considering complexily of tangential sliding mode. An example is given to describe details using this algorithm.
基金supported by the Natural Science Foundation of Hainan Province, China (Grant No. 613155)
文摘Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.
文摘To achieve much efficient multimedia transmission over an error-prone wireless network, there are still some problem must to be solved, especially in energy limited wireless sensor network. In this paper, we propose a joint detection based on Schur Algorithm for image wireless transmission over wireless sensor network. To eliminate error transmissions and save transmission energy, we combine Schur algorithm with joint dynamic detection for wireless transmission of JPEG 2000 encoded image which we proposed in [1]. Schur algorithm is used to computing the decomposition of system matrix to decrease the computational complexity. We de-scribe our transmission protocol, and report on its performance evaluation using a simulation testbed we have designed for this purpose. Our results clearly indicate that our method could approach efficient images transmission in wireless sensor network and the transmission errors are significantly reduced when compared to regular transmissions.
基金Deepak Dahiya would like to thank Deanship of Scientific Research at Majmaah University for supporting this work under Project No.R-2022-56.
文摘Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tasks effectively meet the deadline,it means the system is working in pristine order.However,missing the deadline means a systemic fault due to which the system can crash(hard RTS)or degrade inclusive performance(soft RTS).To fine-tune the RTS,tolerance is the critical issue and must be handled with extreme care.This article explains the context of fault tolerance with improvised Joint EDF-RMS algorithm in RTS.The backup method has been derived to prevent the system from being recursively migrating the same task.If any task migrates three times,this migrated task will get shifted to the backup queue.This backup queue assigns the task to a backup processor and is destined for final execution.For performance evaluation purposes,a relative graph between fault and failure rates,failure and total processor utilization along with other averages have been evaluated.Furthermore,these archived results are compared with fault-tolerant Earliest Deadline First(EDF)and Rate Monotonic Scheduling(RMS)algorithms independently in relatively similar conditions.These comparisons show better performance against overloading conditions.
基金supported in part by the National Key R&D Program of China under Grant 2022YFB3103500in part by the National Natural Science Foundation of China under Grant 62302195.
文摘Semantic secure communication is an emerging field that combines the principles of source-channel coding with the need for secure data transmission.It is of great significance in modern communications to protect the confidentiality and privacy of sensitive information and prevent information leaks and malicious attacks.This paper presents a novel approach to semantic secure communication through the utilization of joint source-channel coding,which is based on the design of an automated joint source-channel coding algorithm and an encryption and decryption algorithm based on semantic security.The traditional and state-of-the-art joint source-channel coding algorithms are selected as two baselines for different comparison purposes.Experimental results demonstrate that our proposed algorithm outperforms the first baseline algorithm,the traditional source-channel coding,by 61.21%in efficiency under identical channel conditions(SNR=15 dB).In security,our proposed method can resist 2 more types of attacks compared to the two baselines,exhibiting nearly no increases in time consumption and error rate compared to the state-of-the-art joint source-channel coding algorithm while the secure semantic communication is supported.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
文摘针对在现场可编程门阵列(Field Programmable Gate Array,FPGA)上实现基于极化敏感阵列的多重信号分类(Multiple Signal Classification,MUSIC)算法进行二维波达方向(Direction of Arrival,DOA)和二维极化参数联合估计时,硬件资源占用大、运行时间长的问题,提出了一种基于极化MUSIC算法的四维参数联合估计FPGA实现架构。该架构包括信号协方差矩阵计算模块、Jacobi旋转模块、噪声子空间提取模块、两级空间谱搜索模块和极化参数计算模块。Jacobi旋转模块被拆分为多个可复用模块,并采用查找表模块生成旋转矩阵。一级空间谱搜索模块通过二维DOA搜索初步确定信源的角度信息。二级空间谱搜索模块根据一级搜索的角度结果确定二级搜索区域各点的极化信息,并计算该区域的四维空间谱,区域内最小值对应的四维参数信息即为最终估计的信源方向角、俯仰角、极化辅助角和极化相位角。仿真结果表明,与传统极化MUSIC算法的四维搜索算法相比,该架构避免了大量四维空间谱计算,同时保证了四维参数估计的精度,显著减少了运行时间和硬件资源消耗。
文摘To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.
基金The National Natural Science Foundation of China(No.60572072,60496311),the National High Technology Researchand Development Program of China (863Program ) ( No.2003AA123310),the International Cooperation Project on Beyond 3G Mobile of China (No.2005DFA10360).
文摘The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.
