This study examines the bidirectional shaping mechanism between short-video algorithms and film narratives within the attention economy.It investigates how algorithmic logic influences cinematic storytelling and how f...This study examines the bidirectional shaping mechanism between short-video algorithms and film narratives within the attention economy.It investigates how algorithmic logic influences cinematic storytelling and how films,in turn,contribute to the aesthetic enhancement of short-video content.Drawing on Communication Accommodation Theory and Berry’s Acculturation Theory,along with case analyses and industry data,this research demonstrates that algorithms push films toward high-stimulus,fast-paced narrative patterns—characterized by increased shot density and structural fragmentation—to capture and retain viewer attention.Conversely,films counter this influence by supplying narratively deep and artistically refined content that elevates short-video aesthetics and encourages critical audience engagement.This dynamic reflects a process of mutual adaptation rather than one-sided dominance.The study concludes that such interaction signifies a broader restructuring of cultural production logic,facilitating cross-media convergence while simultaneously posing risks to cultural diversity due to the prioritization of high-traffic content.Balancing this relationship will require policy support,algorithmic transparency,and strengthened industry self-regulation to preserve artistic integrity and cultural ecosystem diversity.展开更多
In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional R...In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.展开更多
Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The alg...Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.展开更多
To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The...To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.展开更多
According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the r...According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.展开更多
The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,wh...The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transport...Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transportation capabilities,allowing them tomove in the opposite directionwithout turning around,which helps reduce transportation time.This paper aims at the problem of AGV scheduling and bidirectional conflict-free routing with battery swapping in automated terminals.A bi-level mixed integer programming(MIP)model is proposed,taking into account task assignment,bidirectional conflict-free routing,and battery swapping.The upper model focuses on container task assignment and AGV battery swapping planning,while the lower model ensures conflict-free movement of AGVs.A double-threshold battery swapping strategy is introduced,allowing AGVs to utilize waiting time for loading for battery swapping.An improved differential evolution variable neighborhood search(IDE-VNS)algorithm is developed to solve the bi-level MIP model,aiming to minimize the completion time of all jobs.Experimental results demonstrate that compared to the differential evolution(DE)algorithm and the genetic algorithm(GA),the IDEVNS algorithmreduces fitness values by 44.49% and 45.22%,though it does increase computation time by 56.28% and 62.03%,respectively.Bidirectional transportation reduces the fitness value by an average of 10.97% when the container scale is small.As the container scale increases,the fitness value of bidirectional transportation gradually approaches that of unidirectional transportation.The results further show that the double-threshold battery swapping strategy enhances AGV utilization and reduces the fitness value.展开更多
Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process ...Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process more complex.The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM.As a consequence of high complexity,the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder,leading inevitably to buffer overflows and information erasures.In this paper,we propose a bidirectional Viterbi algorithm(BVA)based on the bidirectional sequence decoding for OvTDM.With the BVA,the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis.The simulation results show that compared with Viterbi algorithm(VA),the decoding time of BVA can be reduced by about half.And the memory space of two decoders in BVA are about half of that in VA,which means that the BVA has lower memory requirements for decoder.And the decoding performance of BVA is almost the same as VA.展开更多
Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a ...Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a Convolutional Neural Network(CNN)with a Bidirectional Long Short-Term Memory(BiLSTM)architecture,optimized using the Firefly Optimization algorithm(FO).The proposed CNN-BiLSTM-FO model is tailored for structured biomedical data,capturing both local patterns and sequential dependencies in diagnostic features,while the Firefly Algorithm fine-tunes key hyperparameters to maximize predictive performance.The approach is evaluated on two benchmark biomedical datasets:one comprising diagnostic data for bone cancer detection and another for identifying marrow cell abnormalities.Experimental results demonstrate that the proposed method outperforms standard deep learning models,including CNN,LSTM,BiLSTM,and CNN-LSTM hybrids,significantly.The CNNBiLSTM-FO model achieves an accuracy of 98.55%for bone cancer detection and 96.04%for marrow abnormality classification.The paper also presents a detailed complexity analysis of the proposed algorithm and compares its performance across multiple evaluation metrics such as precision,recall,F1-score,and AUC.The results confirm the effectiveness of the firefly-based optimization strategy in improving classification accuracy and model robustness.This work introduces a scalable and accurate diagnostic solution that holds strong potential for integration into intelligent clinical decision-support systems.展开更多
A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirement...A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method.展开更多
The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlighte...The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlightened by the fundamental idea of MCS, the ensemble is introduced into the quick learning for bidirectional associative memory （QLBAM） to construct a BAM ensemble, for improving the storage capacity and the error-correction capability without destroying the simple structure of the component BAM. Simulations show that, with an appropriate ＂overproduce and choose＂ strategy or ＂thinning＂ algorithm, the proposed BAM ensemble significantly outperforms the single QLBAM in both storage capacity and noise-tolerance capability.展开更多
The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot sprea...The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.展开更多
Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in thes...Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.展开更多
In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values i...In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values in the microwave band by using the method of moments, and the relationship between the bistatic scattering coefficient and the BRDF of a rough surface is expressed. From the theory of the parameters of the rough surface BRDF, the parameters of the BRDF are obtained using a genetic algorithm. The BRDF of a rough surface is calculated using the obtained parameter values. Further, the fitting values and theoretical calculations of the BRDF are compared, and the optimization results are in agreement with the theoretical calculation results. Finally, a reference for BRDF modeling of a Gaussian rough surface in the microwave band is provided by the proposed method.展开更多
文摘This study examines the bidirectional shaping mechanism between short-video algorithms and film narratives within the attention economy.It investigates how algorithmic logic influences cinematic storytelling and how films,in turn,contribute to the aesthetic enhancement of short-video content.Drawing on Communication Accommodation Theory and Berry’s Acculturation Theory,along with case analyses and industry data,this research demonstrates that algorithms push films toward high-stimulus,fast-paced narrative patterns—characterized by increased shot density and structural fragmentation—to capture and retain viewer attention.Conversely,films counter this influence by supplying narratively deep and artistically refined content that elevates short-video aesthetics and encourages critical audience engagement.This dynamic reflects a process of mutual adaptation rather than one-sided dominance.The study concludes that such interaction signifies a broader restructuring of cultural production logic,facilitating cross-media convergence while simultaneously posing risks to cultural diversity due to the prioritization of high-traffic content.Balancing this relationship will require policy support,algorithmic transparency,and strengthened industry self-regulation to preserve artistic integrity and cultural ecosystem diversity.
基金supported by Gansu Provincial Science and Technology Program Project(No.23JRRA868)Lanzhou Municipal Talent Innovation and Entrepreneurship Project(No.2019-RC-103)。
文摘In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.
文摘Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
文摘To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.
基金supported by the National Natural Science Foundation of China(61102130)the Innovative Program of the Academy of Opto-Electtronics,Chinese Academy of Sciences(Y12414A01Y)
文摘According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.
基金Supported by the EDD of China(No.80912020104)the Science and Technology Commission of Shanghai Municipality(No.22ZR1427700 and No.23692106900).
文摘The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
基金supported by National Natural Science Foundation of China(No.62073212)Shanghai Science and Technology Commission(No.23ZR1426600).
文摘Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transportation capabilities,allowing them tomove in the opposite directionwithout turning around,which helps reduce transportation time.This paper aims at the problem of AGV scheduling and bidirectional conflict-free routing with battery swapping in automated terminals.A bi-level mixed integer programming(MIP)model is proposed,taking into account task assignment,bidirectional conflict-free routing,and battery swapping.The upper model focuses on container task assignment and AGV battery swapping planning,while the lower model ensures conflict-free movement of AGVs.A double-threshold battery swapping strategy is introduced,allowing AGVs to utilize waiting time for loading for battery swapping.An improved differential evolution variable neighborhood search(IDE-VNS)algorithm is developed to solve the bi-level MIP model,aiming to minimize the completion time of all jobs.Experimental results demonstrate that compared to the differential evolution(DE)algorithm and the genetic algorithm(GA),the IDEVNS algorithmreduces fitness values by 44.49% and 45.22%,though it does increase computation time by 56.28% and 62.03%,respectively.Bidirectional transportation reduces the fitness value by an average of 10.97% when the container scale is small.As the container scale increases,the fitness value of bidirectional transportation gradually approaches that of unidirectional transportation.The results further show that the double-threshold battery swapping strategy enhances AGV utilization and reduces the fitness value.
文摘Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process more complex.The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM.As a consequence of high complexity,the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder,leading inevitably to buffer overflows and information erasures.In this paper,we propose a bidirectional Viterbi algorithm(BVA)based on the bidirectional sequence decoding for OvTDM.With the BVA,the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis.The simulation results show that compared with Viterbi algorithm(VA),the decoding time of BVA can be reduced by about half.And the memory space of two decoders in BVA are about half of that in VA,which means that the BVA has lower memory requirements for decoder.And the decoding performance of BVA is almost the same as VA.
文摘Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a Convolutional Neural Network(CNN)with a Bidirectional Long Short-Term Memory(BiLSTM)architecture,optimized using the Firefly Optimization algorithm(FO).The proposed CNN-BiLSTM-FO model is tailored for structured biomedical data,capturing both local patterns and sequential dependencies in diagnostic features,while the Firefly Algorithm fine-tunes key hyperparameters to maximize predictive performance.The approach is evaluated on two benchmark biomedical datasets:one comprising diagnostic data for bone cancer detection and another for identifying marrow cell abnormalities.Experimental results demonstrate that the proposed method outperforms standard deep learning models,including CNN,LSTM,BiLSTM,and CNN-LSTM hybrids,significantly.The CNNBiLSTM-FO model achieves an accuracy of 98.55%for bone cancer detection and 96.04%for marrow abnormality classification.The paper also presents a detailed complexity analysis of the proposed algorithm and compares its performance across multiple evaluation metrics such as precision,recall,F1-score,and AUC.The results confirm the effectiveness of the firefly-based optimization strategy in improving classification accuracy and model robustness.This work introduces a scalable and accurate diagnostic solution that holds strong potential for integration into intelligent clinical decision-support systems.
基金supported by the National Nature Science Foundation of China(62203299,62373246,62388101)the Research Fund of State Key Laboratory of Deep-Sea Manned Vehicles(2024SKLDMV04)+1 种基金the Oceanic Interdisciplinary Program of Shanghai Jiao Tong University(SL2023MS007)the Startup Fund for Young Faculty at SJTU(24X010502929)。
文摘A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method.
文摘The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlightened by the fundamental idea of MCS, the ensemble is introduced into the quick learning for bidirectional associative memory （QLBAM） to construct a BAM ensemble, for improving the storage capacity and the error-correction capability without destroying the simple structure of the component BAM. Simulations show that, with an appropriate ＂overproduce and choose＂ strategy or ＂thinning＂ algorithm, the proposed BAM ensemble significantly outperforms the single QLBAM in both storage capacity and noise-tolerance capability.
文摘The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.
基金Supported by the Natural Science Foundation of Jiangsu Province (BK20211037)the Science and Technology Development Fund of Wuxi (N20201011)the Nanjing University of Information Science and Technology Wuxi Campus District graduate innovation Project。
文摘Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.
基金Project supported by the National Natural Science Foundation for Distinguished Young Scholars of China （Grant No. 61225002）, the Aeronautical Science Fund and Aviation Key Laboratory of Science and Technology on Avionics Integrated Sensor System Simulation, China （Grant No. 20132081015）, and the Fundamental Research Funds for the Central Universities, China （Grant No. SPSZ031403）
文摘In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values in the microwave band by using the method of moments, and the relationship between the bistatic scattering coefficient and the BRDF of a rough surface is expressed. From the theory of the parameters of the rough surface BRDF, the parameters of the BRDF are obtained using a genetic algorithm. The BRDF of a rough surface is calculated using the obtained parameter values. Further, the fitting values and theoretical calculations of the BRDF are compared, and the optimization results are in agreement with the theoretical calculation results. Finally, a reference for BRDF modeling of a Gaussian rough surface in the microwave band is provided by the proposed method.
