Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
A complete mesh free adaptive algorithm (MFAA), with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in s...A complete mesh free adaptive algorithm (MFAA), with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.展开更多
A new algorithm for pass adaptation in plate rolling is developedto improve thickness accuracy of plate products. The feature of thealgorithm is that it uses the measured data rather than the schedulecalculated data i...A new algorithm for pass adaptation in plate rolling is developedto improve thickness accuracy of plate products. The feature of thealgorithm is that it uses the measured data rather than the schedulecalculated data in adaptation, which leads to notable improvem- entin prediction accuracy of the rolling parameters and thicknessaccuracy of products can be improved according. Results show thatthis adaptive algorithm is effective in practice.展开更多
The Reynolds stress model(RSM)outperforms the eddy viscosity model(EVM)when simulating complex flows and has increased demand for high-order discretization.However,the complexity of the RSM equations results in poor n...The Reynolds stress model(RSM)outperforms the eddy viscosity model(EVM)when simulating complex flows and has increased demand for high-order discretization.However,the complexity of the RSM equations results in poor numerical stability and weak convergence performance.One of the reasons is that the properties of Reynolds stresses are not fully considered in the design of the numerical scheme.In response to this issue,this study develops an adaptive algorithm to adjustεβvalues(an empirical parameter in nonlinear weights)according to the magnitude and smoothness of the Reynolds stresses.This algorithm is introduced into the fifth-order weighted compact nonlinear scheme(WCNS)and is applied to the high-order discretization of the RSM.Three aeronautic test cases are simulated to investigate the performance of the algorithm.The numerical results show that,the adaptive algorithm can reduce the residual by up to 3 orders of magnitude and predict the correct weights for gradient reversals.These results confirm that the application of theεβ-adaptive algorithm to the high-order discretization of the RSM is beneficial both for enhancing convergence and improving resolution.展开更多
Direct isosurface volume rendering is the most prominent modern method for medical data visualization.It is based on finding intersection points between the rays corresponding to pixels on the screen and isosurface. T...Direct isosurface volume rendering is the most prominent modern method for medical data visualization.It is based on finding intersection points between the rays corresponding to pixels on the screen and isosurface. This article describes a two-pass algorithm for accelerating the method on the graphic processing unit(GPU). On the first pass, the intersections with the isosurface are found only for a small number of rays, which is done by rendering into a lower-resolution texture. On the second pass, the obtained information is used to efficiently calculate the intersection points of all the other. The number of rays to use during the first pass is determined by using an adaptive algorithm, which runs on the central processing unit(CPU) in parallel with the second pass of the rendering. The proposed approach allows to significantly speed up isosurface visualization without quality loss. Experiments show acceleration up to 10 times in comparison with a common ray casting method implemented on GPU. To the authors’ knowledge, this is the fastest approach for ray casting which does not require any preprocessing and could be run on common GPUs.展开更多
This paper describes an innovative adaptive algorithmic modeling approach, for solving a wide class of e-business and strategic management problems under uncertainty conditions. The proposed methodology is based on ba...This paper describes an innovative adaptive algorithmic modeling approach, for solving a wide class of e-business and strategic management problems under uncertainty conditions. The proposed methodology is based on basic ideas and concepts of four key-field interrelated sciences, i.e., computing science, applied mathematics, management sciences and economic sciences. Furthermore, the fundamental scientific concepts of adaptability and uncertainty are shown to play a critical role of major importance for a (near) optimum solution of a class of complex e-business/services and strategic management problems. Two characteristic case studies, namely measuring e-business performance under certain environmental pressures and organizational constraints and describing the relationships between technology, innovation and firm performance, are considered as effective applications of the proposed adaptive algorithmic modeling approach. A theoretical time-dependent model for the evaluation of firm e-business performances is also proposed.展开更多
This paper provides a modified fast adaptive algorithm for digital beamforming. It is analgorithm with strict constraint minimum power sampling matrix gradient (CSMG). It has merits ofboth traditional sampling mains g...This paper provides a modified fast adaptive algorithm for digital beamforming. It is analgorithm with strict constraint minimum power sampling matrix gradient (CSMG). It has merits ofboth traditional sampling mains gradient (SMG) and strictly constrained minimum power adaptivealgorithm. 16-element uniform circular array is selected. Some results of computer simulation aregiven. The results indicate that the beam direction will change with constraint angle and can beadaptable to adjust zero very well. The algorithm is fast convergent.展开更多
A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex...A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.展开更多
In this paper,we propose an adaptive algorithm for L1-fidelity color image restoration by using saturation-value total variation.The main contribution of this paper is to employ the generalized cross validation method...In this paper,we propose an adaptive algorithm for L1-fidelity color image restoration by using saturation-value total variation.The main contribution of this paper is to employ the generalized cross validation method efficiently and automatically to estimate the regularization parameter in a saturation-value total variation plus L1-fidelity color image restoration model.We consider Poisson noise and mixed noise in this paper,and the experimental results show that the visual quality and the SSIM/PSNR/SAM values of the restored images by using the proposed algorithm are competitive with other tested existing methods,which makes the proposed algorithm to be comparable both quantitatively and qualitatively.展开更多
Approximate linear methods and nonlinear methods were adopted usually for solving models of nonlinear surveying and mapping parameters adjustment.But,these iterative algorithms need to compare harsh initial value.A ki...Approximate linear methods and nonlinear methods were adopted usually for solving models of nonlinear surveying and mapping parameters adjustment.But,these iterative algorithms need to compare harsh initial value.A kind of new algorithm-adaptive algorithm based on analyzing the general methods was put forward.The new algorithm has quick rate of convergence and low dependence for initial value,so it can avoid calculating complex second derivative of the target function.The results indicate that its performance is better than those of the others.展开更多
Meshing temperature analyses of polymer gears reported in the literature mainly concern the effects of various material combinations and loading conditions,as their impacts could be seen in the first few meshing cycle...Meshing temperature analyses of polymer gears reported in the literature mainly concern the effects of various material combinations and loading conditions,as their impacts could be seen in the first few meshing cycles.However,the effects of tooth geometry parameters could manifest as the meshing cycles increase.This study investigated the effects of tooth geometry parameters on the multi-cycle meshing temperature of polyoxymethylene(POM)worm gears,aiming to control the meshing temperature elevation by tuning the tooth geometry.Firstly,a finite element(FE)model capable of separately calculating the heat generation and simulating the heat propagation was established.Moreover,an adaptive iteration algorithm was proposed within the FE framework to capture the influence of the heat generation variation from cycle to cycle.This algorithm proved to be feasible and highly efficient compared with experimental results from the literature and simulated results via the full-iteration algorithm.Multi-cycle meshing temperature analyses were conducted on a series of POM worm gears with different tooth geometry parameters.The results reveal that,within the range of 14.5°to 25°,a pressure angle of 25°is favorable for reducing the peak surface temperature and overall body temperature of POM worm gears,which influence flank wear and load-carrying capability,respectively.However,addendum modification should be weighed because it helps with load bearing but increases the risk of severe flank wear.This paper proposes an efficient iteration algorithm for multi-cycle meshing temperature analysis of polymer gears and proves the feasibility of controlling the meshing temperature elevation during multiple cycles by tuning tooth geometry.展开更多
The control of traffic flows on urban roads intersections through the traffic control signals is very important,not only does the jammed traffic statement valuably relieve and the ratio of the traffic availability inc...The control of traffic flows on urban roads intersections through the traffic control signals is very important,not only does the jammed traffic statement valuably relieve and the ratio of the traffic availability increase,but also the traffic accidents evidently decrease.In this paper,an adaptive algorithm of traffic control signals on the urban roads intersections is designed in,this new algorithm can actively adjust the concrete control times of the traffic control signals based on the perceiving information of the waiting vehicles in real time,then the dynamic balance between the traffic control signals and the traffic flows can be realized.Furthermore,through experiment testing and demonstrating,this adaptive algorithm expresses some fine performances,it also shows good application prospect in the field of smart city.展开更多
The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is in...The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is introduced,which is the variable projection order Ekblom norm-promoted adaptive algorithm(VPO-EPAA).The method begins by examining the mean squared deviation(MSD)of the EPAA,deriving a formula for its MSD.Next,it compares the MSD of EPAA at two different projection orders and selects the one that minimizes the MSD as the parameter for the current iteration.Furthermore,the algorithm’s computational complexity is analyzed theoretically.Simulation results from system identification and self-interference cancellation show that the proposed algorithm performs exceptionally well in airborne radar signal self-interference cancellation,even under various noise intensities and types of interference.展开更多
The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit na...The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit natural tapering,with diameters decreasing from the base to the top,and surface irregularities such as artificial cuts,cracks,and knots.Both the intrinsic geometric characteristics and surface defects reduce the precision of coordinate acquisition and the reliability of inclination estimation.To overcome these limitations,this study proposes a novel inclination measurement method for wooden columns in traditional timber buildings based on multi-section measurement and spatial line fitting.An adaptive random sample consensus algorithm is employed to effectively remove outliers induced by surface damage and measurement noise.Subsequently,principal component analysis is used to fit a three-dimensional spatial line through the center points of multiple cross-sections,enabling accurate computation of the inclination angle while accounting for structural imperfections.Moreover,the effects of damage defects,the number of measuring points,the measurement range,and the number of selected cross-sections on measurement accuracy are systematically investigated through statistical analysis,and corresponding recommended values for engineering practice are provided.The proposed method offers an efficient and reliable solution for inclination measurement,supporting the inspection and structural safety assessment of traditional timber columns.展开更多
Due to its low hardware cost and ease of deployment,WiFi fingerprinting has become a prominent research direction in indoor positioning.However,traditional methods based on Received Signal Strength(RSS)still face thre...Due to its low hardware cost and ease of deployment,WiFi fingerprinting has become a prominent research direction in indoor positioning.However,traditional methods based on Received Signal Strength(RSS)still face three critical challenges:susceptibility to noise interference,lowretrieval efficiency as fingerprint databases scale up,and trajectory instability in dynamic environments.These challenges are inherently rooted in the stochastic fluctuation of RSS signals,the high-dimensional and non-Euclidean nature of fingerprint space,and the unpredictability of user movement patterns.To address these limitations,an adaptive trajectory-assisted dynamic indoor positioning algorithm based on RSS fingerprinting,termed AT-WKNN(Adaptive Trajectory-assisted Weighted K-Nearest Neighbor),is proposed.Specifically,a hybrid distance metric incorporating adaptive distance constraints is first designed to identify high-quality neighboring fingerprints while filtering out noisy samples,thereby improving positioning accuracy.Subsequently,aHierarchicalNavigable Small-World(HNSW)structure is employed to enable efficient fingerprint retrieval.In addition,a Kalman filter is utilized to smooth trajectory estimation and suppress dynamic noise.Experimental results demonstrate that the proposed AT-WKNN algorithm achieves a 43.0%improvement in positioning accuracy and a 6.90×increase in retrieval efficiency compared with the baseline WKNN method.Furthermore,validation on the large-scale UJIIndoorLoc benchmark dataset confirms the scalability and generalization capability of the proposed method.展开更多
This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy al...This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P(., Ψ). This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.展开更多
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm co...To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.展开更多
A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal i...A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal is used to update the step-size, leading to a considerably improved convergence rate in a low SNR situation and reduced steady-state bias and MSE. The theoretical expression for steady-state bounds on the step-size is derived, and the influence factors on the stable performance of the algorithm theoretically are analyzed. A normalized power factor is then introduced to control variation of step-size in its steady-state bounds. This technique prevents divergence due to the influence of large power input signal and improves robustness. Numerical experiments are performed to demonstrate superiority of the proposed method.展开更多
On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in t...On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in the adaptive filter in the AANC system, derives the recursive formulas of LMS algorithm. and obtains the LMS algorithm in computer simulation using FIR and IIR filters in AANC system. By means of simulation, we compare the attenuation levels with various input signals in AANC system and discuss the effects of step factor, order of filters and sound delay on the algorithm's convergence rate and attenuation level.We also discuss the attenuation levels with sound feedback using are and IIR filters in AANC system.展开更多
Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of un...Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of unsteady flows.To enhance computational efficiency,we propose the Implicit-Explicit Two-Step Runge-Kutta(IMEX-TSRK)time-stepping discretization methods for unsteady flows,and develop a novel adaptive algorithm that correctly partitions spatial regions to apply implicit or explicit methods.The novel adaptive IMEX-TSRK schemes effectively handle the numerical stiffness of the small grid size and improve computational efficiency.Compared to implicit and explicit Runge-Kutta(RK)schemes,the IMEX-TSRK methods achieve the same order of accuracy with fewer first derivative calculations.Numerical case tests demonstrate that the IMEX-TSRK methods maintain numerical stability while enhancing computational efficiency.Specifically,in high Reynolds number flows,the computational efficiency of the IMEX-TSRK methods surpasses that of explicit RK schemes by more than one order of magnitude,and that of implicit RK schemes several times over.展开更多
摘要Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
摘要A complete mesh free adaptive algorithm (MFAA), with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.
摘要A new algorithm for pass adaptation in plate rolling is developedto improve thickness accuracy of plate products. The feature of thealgorithm is that it uses the measured data rather than the schedulecalculated data in adaptation, which leads to notable improvem- entin prediction accuracy of the rolling parameters and thicknessaccuracy of products can be improved according. Results show thatthis adaptive algorithm is effective in practice.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.12002379 and 11972370)the National Key Project(Grant No.GJXM92579).
摘要The Reynolds stress model(RSM)outperforms the eddy viscosity model(EVM)when simulating complex flows and has increased demand for high-order discretization.However,the complexity of the RSM equations results in poor numerical stability and weak convergence performance.One of the reasons is that the properties of Reynolds stresses are not fully considered in the design of the numerical scheme.In response to this issue,this study develops an adaptive algorithm to adjustεβvalues(an empirical parameter in nonlinear weights)according to the magnitude and smoothness of the Reynolds stresses.This algorithm is introduced into the fifth-order weighted compact nonlinear scheme(WCNS)and is applied to the high-order discretization of the RSM.Three aeronautic test cases are simulated to investigate the performance of the algorithm.The numerical results show that,the adaptive algorithm can reduce the residual by up to 3 orders of magnitude and predict the correct weights for gradient reversals.These results confirm that the application of theεβ-adaptive algorithm to the high-order discretization of the RSM is beneficial both for enhancing convergence and improving resolution.
摘要Direct isosurface volume rendering is the most prominent modern method for medical data visualization.It is based on finding intersection points between the rays corresponding to pixels on the screen and isosurface. This article describes a two-pass algorithm for accelerating the method on the graphic processing unit(GPU). On the first pass, the intersections with the isosurface are found only for a small number of rays, which is done by rendering into a lower-resolution texture. On the second pass, the obtained information is used to efficiently calculate the intersection points of all the other. The number of rays to use during the first pass is determined by using an adaptive algorithm, which runs on the central processing unit(CPU) in parallel with the second pass of the rendering. The proposed approach allows to significantly speed up isosurface visualization without quality loss. Experiments show acceleration up to 10 times in comparison with a common ray casting method implemented on GPU. To the authors’ knowledge, this is the fastest approach for ray casting which does not require any preprocessing and could be run on common GPUs.
摘要This paper describes an innovative adaptive algorithmic modeling approach, for solving a wide class of e-business and strategic management problems under uncertainty conditions. The proposed methodology is based on basic ideas and concepts of four key-field interrelated sciences, i.e., computing science, applied mathematics, management sciences and economic sciences. Furthermore, the fundamental scientific concepts of adaptability and uncertainty are shown to play a critical role of major importance for a (near) optimum solution of a class of complex e-business/services and strategic management problems. Two characteristic case studies, namely measuring e-business performance under certain environmental pressures and organizational constraints and describing the relationships between technology, innovation and firm performance, are considered as effective applications of the proposed adaptive algorithmic modeling approach. A theoretical time-dependent model for the evaluation of firm e-business performances is also proposed.
摘要This paper provides a modified fast adaptive algorithm for digital beamforming. It is analgorithm with strict constraint minimum power sampling matrix gradient (CSMG). It has merits ofboth traditional sampling mains gradient (SMG) and strictly constrained minimum power adaptivealgorithm. 16-element uniform circular array is selected. Some results of computer simulation aregiven. The results indicate that the beam direction will change with constraint angle and can beadaptable to adjust zero very well. The algorithm is fast convergent.
摘要A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.
基金supported by the Natural Science Foundation of Shanghai(Grant No.22ZR1465300).
摘要In this paper,we propose an adaptive algorithm for L1-fidelity color image restoration by using saturation-value total variation.The main contribution of this paper is to employ the generalized cross validation method efficiently and automatically to estimate the regularization parameter in a saturation-value total variation plus L1-fidelity color image restoration model.We consider Poisson noise and mixed noise in this paper,and the experimental results show that the visual quality and the SSIM/PSNR/SAM values of the restored images by using the proposed algorithm are competitive with other tested existing methods,which makes the proposed algorithm to be comparable both quantitatively and qualitatively.
基金Project(40174003)supported by the National Natural Science Foundation of China
摘要Approximate linear methods and nonlinear methods were adopted usually for solving models of nonlinear surveying and mapping parameters adjustment.But,these iterative algorithms need to compare harsh initial value.A kind of new algorithm-adaptive algorithm based on analyzing the general methods was put forward.The new algorithm has quick rate of convergence and low dependence for initial value,so it can avoid calculating complex second derivative of the target function.The results indicate that its performance is better than those of the others.
基金Supported by National Key R&D Program of China(Grant No.2019YFE0121300)。
摘要Meshing temperature analyses of polymer gears reported in the literature mainly concern the effects of various material combinations and loading conditions,as their impacts could be seen in the first few meshing cycles.However,the effects of tooth geometry parameters could manifest as the meshing cycles increase.This study investigated the effects of tooth geometry parameters on the multi-cycle meshing temperature of polyoxymethylene(POM)worm gears,aiming to control the meshing temperature elevation by tuning the tooth geometry.Firstly,a finite element(FE)model capable of separately calculating the heat generation and simulating the heat propagation was established.Moreover,an adaptive iteration algorithm was proposed within the FE framework to capture the influence of the heat generation variation from cycle to cycle.This algorithm proved to be feasible and highly efficient compared with experimental results from the literature and simulated results via the full-iteration algorithm.Multi-cycle meshing temperature analyses were conducted on a series of POM worm gears with different tooth geometry parameters.The results reveal that,within the range of 14.5°to 25°,a pressure angle of 25°is favorable for reducing the peak surface temperature and overall body temperature of POM worm gears,which influence flank wear and load-carrying capability,respectively.However,addendum modification should be weighed because it helps with load bearing but increases the risk of severe flank wear.This paper proposes an efficient iteration algorithm for multi-cycle meshing temperature analysis of polymer gears and proves the feasibility of controlling the meshing temperature elevation during multiple cycles by tuning tooth geometry.
摘要The control of traffic flows on urban roads intersections through the traffic control signals is very important,not only does the jammed traffic statement valuably relieve and the ratio of the traffic availability increase,but also the traffic accidents evidently decrease.In this paper,an adaptive algorithm of traffic control signals on the urban roads intersections is designed in,this new algorithm can actively adjust the concrete control times of the traffic control signals based on the perceiving information of the waiting vehicles in real time,then the dynamic balance between the traffic control signals and the traffic flows can be realized.Furthermore,through experiment testing and demonstrating,this adaptive algorithm expresses some fine performances,it also shows good application prospect in the field of smart city.
基金supported by the Shan⁃dong Provincial Natural Science Foundation(No.ZR2022MF314).
摘要The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is introduced,which is the variable projection order Ekblom norm-promoted adaptive algorithm(VPO-EPAA).The method begins by examining the mean squared deviation(MSD)of the EPAA,deriving a formula for its MSD.Next,it compares the MSD of EPAA at two different projection orders and selects the one that minimizes the MSD as the parameter for the current iteration.Furthermore,the algorithm’s computational complexity is analyzed theoretically.Simulation results from system identification and self-interference cancellation show that the proposed algorithm performs exceptionally well in airborne radar signal self-interference cancellation,even under various noise intensities and types of interference.
基金supported by Funding statement as follows:TheGuiding(Key)Project Funding for Social Development in Fujian Province(2021J011063)Fujian Education and Research Project for Young and Middle-aged Teachers(Science and Technology category)(JAT220227)Science and Technology Project of Fujian University of Technology(GY-Z220226).
摘要The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit natural tapering,with diameters decreasing from the base to the top,and surface irregularities such as artificial cuts,cracks,and knots.Both the intrinsic geometric characteristics and surface defects reduce the precision of coordinate acquisition and the reliability of inclination estimation.To overcome these limitations,this study proposes a novel inclination measurement method for wooden columns in traditional timber buildings based on multi-section measurement and spatial line fitting.An adaptive random sample consensus algorithm is employed to effectively remove outliers induced by surface damage and measurement noise.Subsequently,principal component analysis is used to fit a three-dimensional spatial line through the center points of multiple cross-sections,enabling accurate computation of the inclination angle while accounting for structural imperfections.Moreover,the effects of damage defects,the number of measuring points,the measurement range,and the number of selected cross-sections on measurement accuracy are systematically investigated through statistical analysis,and corresponding recommended values for engineering practice are provided.The proposed method offers an efficient and reliable solution for inclination measurement,supporting the inspection and structural safety assessment of traditional timber columns.
基金supported by the National Natural Science Foundation of China(Grant No.62361010)the Key Laboratory of Interior Layout Optimization and Security,Institutions of Higher Education of Sichuan Province,Chengdu Normal University,China(Research on Intelligent Pedestrian Positioning Methods for Multi-Storey Buildings,Grant No.SNKJ202504)+2 种基金the General Project of Guizhou Provincial Basic Research Program(Grant No.Qian-ke-he Foundation MS[2026]159)the Scientific and Technological Innovation Platform Research Project of Guizhou Province(Grant No.CXPTXM[2025]No.024)the Scientific and Technological Innovation Talent Team of Guizhou Province for Cybersecurity Protection of Computing Power Network(Grant No.Qiankehe Talent CXTD[2025]029).
摘要Due to its low hardware cost and ease of deployment,WiFi fingerprinting has become a prominent research direction in indoor positioning.However,traditional methods based on Received Signal Strength(RSS)still face three critical challenges:susceptibility to noise interference,lowretrieval efficiency as fingerprint databases scale up,and trajectory instability in dynamic environments.These challenges are inherently rooted in the stochastic fluctuation of RSS signals,the high-dimensional and non-Euclidean nature of fingerprint space,and the unpredictability of user movement patterns.To address these limitations,an adaptive trajectory-assisted dynamic indoor positioning algorithm based on RSS fingerprinting,termed AT-WKNN(Adaptive Trajectory-assisted Weighted K-Nearest Neighbor),is proposed.Specifically,a hybrid distance metric incorporating adaptive distance constraints is first designed to identify high-quality neighboring fingerprints while filtering out noisy samples,thereby improving positioning accuracy.Subsequently,aHierarchicalNavigable Small-World(HNSW)structure is employed to enable efficient fingerprint retrieval.In addition,a Kalman filter is utilized to smooth trajectory estimation and suppress dynamic noise.Experimental results demonstrate that the proposed AT-WKNN algorithm achieves a 43.0%improvement in positioning accuracy and a 6.90×increase in retrieval efficiency compared with the baseline WKNN method.Furthermore,validation on the large-scale UJIIndoorLoc benchmark dataset confirms the scalability and generalization capability of the proposed method.
基金the foundation under the program of"One Hundred Outstanding Young Chinese Scientists"of the Chinese Academy of Sciencesthe Graduate Innovation Foundation of the Chinese Academy of Sciences
摘要This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P(., Ψ). This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.
基金supported by the National Natural Science Foundation of China (Grant No. 61471138, 50909029 and 61531012)Program of International S\&T Cooperation (Grant No. 2013DFR20050)+1 种基金the Defense Industrial Technology Development Program (Grant No. B2420132004)the Acoustic Science and Technology Laboratory (2014)
摘要To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.
摘要A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal is used to update the step-size, leading to a considerably improved convergence rate in a low SNR situation and reduced steady-state bias and MSE. The theoretical expression for steady-state bounds on the step-size is derived, and the influence factors on the stable performance of the algorithm theoretically are analyzed. A normalized power factor is then introduced to control variation of step-size in its steady-state bounds. This technique prevents divergence due to the influence of large power input signal and improves robustness. Numerical experiments are performed to demonstrate superiority of the proposed method.
摘要On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in the adaptive filter in the AANC system, derives the recursive formulas of LMS algorithm. and obtains the LMS algorithm in computer simulation using FIR and IIR filters in AANC system. By means of simulation, we compare the attenuation levels with various input signals in AANC system and discuss the effects of step factor, order of filters and sound delay on the algorithm's convergence rate and attenuation level.We also discuss the attenuation levels with sound feedback using are and IIR filters in AANC system.
基金supported by the National Natural Science Foundation of China(No.92252201)the Fundamental Research Funds for the Central Universitiesthe Academic Excellence Foundation of Beihang University(BUAA)for PhD Students。
摘要Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of unsteady flows.To enhance computational efficiency,we propose the Implicit-Explicit Two-Step Runge-Kutta(IMEX-TSRK)time-stepping discretization methods for unsteady flows,and develop a novel adaptive algorithm that correctly partitions spatial regions to apply implicit or explicit methods.The novel adaptive IMEX-TSRK schemes effectively handle the numerical stiffness of the small grid size and improve computational efficiency.Compared to implicit and explicit Runge-Kutta(RK)schemes,the IMEX-TSRK methods achieve the same order of accuracy with fewer first derivative calculations.Numerical case tests demonstrate that the IMEX-TSRK methods maintain numerical stability while enhancing computational efficiency.Specifically,in high Reynolds number flows,the computational efficiency of the IMEX-TSRK methods surpasses that of explicit RK schemes by more than one order of magnitude,and that of implicit RK schemes several times over.