期刊文献+
共找到577,540篇文章
< 1 2 250 >
每页显示 20 50 100
SSA*-PDWA:A Hierarchical Path Planning Framework with Enhanced A*Algorithm and Dynamic Window Approach for Mobile Robots
1
作者 Lishu Qin Yu Gao Xinyuan Lu 《Computers, Materials & Continua》 2026年第4期2069-2094,共26页
With the rapid development of intelligent navigation technology,efficient and safe path planning for mobile robots has become a core requirement.To address the challenges of complex dynamic environments,this paper pro... With the rapid development of intelligent navigation technology,efficient and safe path planning for mobile robots has become a core requirement.To address the challenges of complex dynamic environments,this paper proposes an intelligent path planning framework based on grid map modeling.First,an improved Safe and Smooth A*(SSA*)algorithm is employed for global path planning.By incorporating obstacle expansion and cornerpoint optimization,the proposed SSA*enhances the safety and smoothness of the planned path.Then,a Partitioned Dynamic Window Approach(PDWA)is integrated for local planning,which is triggered when dynamic or sudden static obstacles appear,enabling real-time obstacle avoidance and path adjustment.A unified objective function is constructed,considering path length,safety,and smoothness comprehensively.Multiple simulation experiments are conducted on typical port grid maps.The results demonstrate that the improved SSA*significantly reduces the number of expanded nodes and computation time in static environmentswhile generating smoother and safer paths.Meanwhile,the PDWA exhibits strong real-time performance and robustness in dynamic scenarios,achieving shorter paths and lower planning times compared to other graph search algorithms.The proposedmethodmaintains stable performance across maps of different scales and various port scenarios,verifying its practicality and potential for wider application. 展开更多
关键词 dynamic window approach improved a*algorithm dynamic path planning trajectory optimization
在线阅读 下载PDF
Research on Dynamic Scheduling Method for Hybrid Flow Shop Order Disturbance Based on IMOGWO Algorithm
2
作者 Feng Lv Huili Chu +1 位作者 Cheng Yang Jiajie Zhang 《Computers, Materials & Continua》 2026年第3期1199-1221,共23页
To address the issue that hybrid flow shop production struggles to handle order disturbance events,a dynamic scheduling model was constructed.The model takes minimizing the maximum makespan,delivery time deviation,and... To address the issue that hybrid flow shop production struggles to handle order disturbance events,a dynamic scheduling model was constructed.The model takes minimizing the maximum makespan,delivery time deviation,and scheme deviation degree as the optimization objectives.An adaptive dynamic scheduling strategy based on the degree of order disturbance is proposed.An improved multi-objective Grey Wolf(IMOGWO)optimization algorithm is designed by combining the“job-machine”two-layer encoding strategy,the timing-driven two-stage decoding strategy,the opposition-based learning initialization population strategy,the POX crossover strategy,the dualoperation dynamic mutation strategy,and the variable neighborhood search strategy for problem solving.A variety of test cases with different scales were designed,and ablation experiments were conducted to verify the effectiveness of the improved strategies.The results show that each improved strategy can effectively enhance the performance of the IMOGWO.Additionally,performance analysis was conducted by comparing the proposed algorithm with three mature and classical algorithms.The results demonstrate that the proposed algorithm exhibits superior performance in solving the hybrid flow-shop scheduling problem(HFSP).Case validations were conducted for different types of order disturbance scenarios.The results demonstrate that the proposed adaptive dynamic scheduling strategy and the IMOGWO algorithm can effectively address order disturbance events.They enable rapid response to order disturbance while ensuring the stability of the production system. 展开更多
关键词 Hybrid flow shop order disturbance dynamic scheduling improved multi-objective Grey Wolf optimization
在线阅读 下载PDF
DDQN-Based 3D Path Planning Algorithm for UAVs in Dynamic Dense Obstacle Environments
3
作者 Wenjie Zhang Meng Yu Yin Wang 《Journal of Beijing Institute of Technology》 2026年第1期84-96,共13页
Online three-dimensional(3D)path planning in dynamic environments is a fundamental problem for achieving autonomous navigation of unmanned aerial vehicles(UAVs).However,existing methods struggle to model traversable d... Online three-dimensional(3D)path planning in dynamic environments is a fundamental problem for achieving autonomous navigation of unmanned aerial vehicles(UAVs).However,existing methods struggle to model traversable dynamic gaps,resulting in conservative and suboptimal trajectories.To address these challenges,this paper proposes a hierarchical reinforcement learning(RL)framework that integrates global path guidance,local trajectory generation,predictive safety evaluation,and neural network-based decision-making.Specifically,the global planner provides long-term navigation guidance,and the local module then utilizes an improved 3D dynamic window approach(DWA)to generate dynamically feasible candidate trajectories.To enhance safety in dense dynamic scenarios,the algorithm introduces a predictive axis-aligned bounding box(AABB)strategy to model the future occupancy of obstacles,combined with convex hull verification for efficient trajectory safety assessment.Furthermore,a double deep Q-network(DDQN)is employed with structured feature encoding,enabling the neural network to reliably select the optimal trajectory from the candidate set,thereby improving robustness and generalization.Comparative experiments conducted in a high-fidelity simulation environment show that the algorithm outperforms existing algorithms,reducing the average number of collisions to 0.2 while shortening the average task completion time by approximately 15%,and achieving a success rate of 97%. 展开更多
关键词 unmanned aerial vehicle(UaV)three-dimensional(3D)path planning 3D dynamic window approach(DWa) predictive axis-aligned bounding box(aaBB) double deep Q-network(DDQN) autonomous navigation
在线阅读 下载PDF
An Eulerian-Lagrangian parallel algorithm for simulation of particle-laden turbulent flows 被引量:1
4
作者 Harshal P.Mahamure Deekshith I.Poojary +1 位作者 Vagesh D.Narasimhamurthy Lihao Zhao 《Acta Mechanica Sinica》 2026年第1期15-34,共20页
This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in ... This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in turbulent carrier flow.The Eulerian framework numerically resolves turbulent carrier flow using a parallelized,finite-volume DNS solver on a staggered Cartesian grid.Particles are tracked using a point-particle method utilizing a Lagrangian particle tracking(LPT)algorithm.The proposed Eulerian-Lagrangian algorithm is validated using an inertial particle-laden turbulent channel flow for different Stokes number cases.The particle concentration profiles and higher-order statistics of the carrier and dispersed phases agree well with the benchmark results.We investigated the effect of fluid velocity interpolation and numerical integration schemes of particle tracking algorithms on particle dispersion statistics.The suitability of fluid velocity interpolation schemes for predicting the particle dispersion statistics is discussed in the framework of the particle tracking algorithm coupled to the finite-volume solver.In addition,we present parallelization strategies implemented in the algorithm and evaluate their parallel performance. 展开更多
关键词 DNS Eulerian-Lagrangian Particle tracking algorithm Point-particle Parallel software
原文传递
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm
5
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
在线阅读 下载PDF
A Joint Optimization Model for Device Selection and Power Allocation under Dynamic Uncertain Environments
6
作者 Bohui Li Bin Wang +2 位作者 Linjie Wu Xingjuan Cai Maoqing Zhang 《Computers, Materials & Continua》 2026年第2期1059-1086,共28页
Federated Learning(FL)provides an effective framework for efficient processing in vehicular edge computing.However,the dynamic and uncertain communication environment,along with the performance variations of vehicular... Federated Learning(FL)provides an effective framework for efficient processing in vehicular edge computing.However,the dynamic and uncertain communication environment,along with the performance variations of vehicular devices,affect the distribution and uploading processes of model parameters.In FL-assisted Internet of Vehicles(IoV)scenarios,challenges such as data heterogeneity,limited device resources,and unstable communication environments become increasingly prominent.These issues necessitate intelligent vehicle selection schemes to enhance training efficiency.Given this context,we propose a new scenario involving FL-assisted IoV systems under dynamic and uncertain communication conditions,and develop a dynamic interval multi-objective optimization algorithm to jointly optimize various factors including training experiments,system energy consumption,and bandwidth utilization to meet multi-criteria resource optimization requirements.For the problem at hand,we design a dynamic interval multi-objective optimization algorithm based on interval overlap detection.Simulation results demonstrate that our method outperforms other solutions in terms of accuracy,training cost,and server utilization.It effectively enhances training efficiency under wireless channel environments while rationally utilizing bandwidth resources,thus possessing significant scientific value and application potential in the field of IoV. 展开更多
关键词 Internet of vehicles edge computing dynamic uncertain environments device selection power allocation dynamic interval multi-objective algorithm
在线阅读 下载PDF
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints
7
作者 Sanjog Chhetri Sapkota Liborio Cavaleri +3 位作者 Ajaya Khatri Siddhi Pandey Satish Paudel Panagiotis G.Asteris 《Computer Modeling in Engineering & Sciences》 2026年第1期436-464,共29页
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru... Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior. 展开更多
关键词 OPTIMIZaTION truss structures nature-inspired algorithms meta-heuristic algorithms red kite opti-mization algorithm secretary bird optimization algorithm
在线阅读 下载PDF
RRT^(*)-GSQ:A hybrid sampling path planning algorithm for complex orchard scenarios
8
作者 ZHU Qingzhen ZHAO Jiamuyang +1 位作者 DAI Xu YU Yang 《农业工程学报》 北大核心 2026年第3期13-25,共13页
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr... Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications. 展开更多
关键词 ROBOT path planning ORCHaRD improved RRT^(*)algorithm Gaussian sampling autonomous navigation
在线阅读 下载PDF
TWO PARALLEL ALGORITHMS FOR A CLASS OF SPLIT COMMON SOLUTION PROBLEMS
9
作者 Truong Minh TUYEN Nguyen Thi TRANG Tran Thi HUONG 《Acta Mathematica Scientia》 2026年第1期505-518,共14页
We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theor... We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second. 展开更多
关键词 iterative algorithm Hilbert space metric projection proximal point algorithm
在线阅读 下载PDF
Dynamic Integration of Q-Learning and A-APF for Efficient Path Planning in Complex Underground Mining Environments
10
作者 Chang Su Liangliang Zhao Dongbing Xiang 《Computers, Materials & Continua》 2026年第2期1017-1040,共24页
To address low learning efficiency and inadequate path safety in spraying robot navigation within complex obstacle-rich environments—with dense,dynamic,unpredictable obstacles challenging conventional methods—this p... To address low learning efficiency and inadequate path safety in spraying robot navigation within complex obstacle-rich environments—with dense,dynamic,unpredictable obstacles challenging conventional methods—this paper proposes a hybrid algorithm integrating Q-learning and improved A*-Artificial Potential Field(A-APF).Centered on theQ-learning framework,the algorithmleverages safety-oriented guidance generated byA-APF and employs a dynamic coordination mechanism that adaptively balances exploration and exploitation.The proposed system comprises four core modules:(1)an environment modeling module that constructs grid-based obstacle maps;(2)an A-APF module that combines heuristic search from A*algorithm with repulsive force strategies from APF to generate guidance;(3)a Q-learning module that learns optimal state-action values(Q-values)through spraying robot-environment interaction and a reward function emphasizing path optimality and safety;and(4)a dynamic optimization module that ensures adaptive cooperation between Q-learning and A-APF through exploration rate control and environment-aware constraints.Simulation results demonstrate that the proposed method significantly enhances path safety in complex underground mining environments.Quantitative results indicate that,compared to the traditional Q-learning algorithm,the proposed method shortens training time by 42.95% and achieves a reduction in training failures from 78 to just 3.Compared to the static fusion algorithm,it further reduces both training time(by 10.78%)and training failures(by 50%),thereby improving overall training efficiency. 展开更多
关键词 Q-LEaRNING a*algorithm artificial potential field path planning hybrid algorithm
在线阅读 下载PDF
Molecular Simulations of Dynamic Heterogeneity of Segment Motion and Bond Exchange in Polymer Vitrimers
11
作者 Lang Shuai Jiang-Long Li +4 位作者 Jian-Long Wen Ying-Ying Xu Shui Yu Bo-Yu Ding Yi-Jing Nie 《Chinese Journal of Polymer Science》 2026年第1期242-255,I0017,共15页
Vitrimers belong to a class of polymeric materials capable of bond exchange reactions,showing great promise for environmental protection and sustainable development.However,studies on the coupling mechanism between th... Vitrimers belong to a class of polymeric materials capable of bond exchange reactions,showing great promise for environmental protection and sustainable development.However,studies on the coupling mechanism between the bond exchange kinetics and segmental dynamics near the glass transition temperature(T_(g))remain scarce.Herein,we employed molecular dynamics simulations to investigate the dynamic heterogeneity of the segment motion and bond exchange in vitrimers.The simulation results revealed that the bond exchange energy barrier exerts a much stronger influence on the bond exchange kinetics than on the segmental dynamics.At lower temperatures,slower segmental relaxation further constraind the bond exchange rate.Additionally,increasing the bond exchange energy barrier markedly enhanced the dynamic heterogeneity of segment motion.A close correlation was observed between heterogeneity and bond exchange.This study elucidated the coupling mechanism between bond exchange and segmental dynamics at the molecular scale,thereby providing a theoretical basis for designing vitrimer materials with tunable dynamic properties. 展开更多
关键词 Molecular dynamics simulations Vitrimers dynamic heterogeneity
原文传递
Gekko Japonicus Algorithm:A Novel Nature-inspired Algorithm for Engineering Problems and Path Planning
12
作者 Ke Zhang Hongyang Zhao +2 位作者 Xingdong Li Chengjin Fu Jing Jin 《Journal of Bionic Engineering》 2026年第1期431-471,共41页
This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japo... This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm. 展开更多
关键词 Gekko japonicus algorithm Metaheuristic algorithm Exploration and exploitation Engineering optimization Path planning
在线阅读 下载PDF
A Quantum-Inspired Algorithm for Clustering and Intrusion Detection
13
作者 Gang Xu Lefeng Wang +5 位作者 Yuwei Huang Yong Lu Xin Liu Weijie Tan Zongpeng Li Xiu-Bo Chen 《Computers, Materials & Continua》 2026年第4期1180-1215,共36页
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention... The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications. 展开更多
关键词 Intrusion detection CLUSTERING quantum artificial bee colony algorithm K-MEaNS quantum genetic algorithm
在线阅读 下载PDF
Information Diffusion Models and Fuzzing Algorithms for a Privacy-Aware Data Transmission Scheduling in 6G Heterogeneous ad hoc Networks
14
作者 Borja Bordel Sánchez Ramón Alcarria Tomás Robles 《Computer Modeling in Engineering & Sciences》 2026年第2期1214-1234,共21页
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h... In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services. 展开更多
关键词 6G networks ad hoc networks PRIVaCY scheduling algorithms diffusion models fuzzing algorithms
在线阅读 下载PDF
Fluid migration in calcite nanopores under salinity gradients:Insights from molecular dynamics
15
作者 Yi Chen Yan Zhang +1 位作者 Run-Sheng Han Lei Wang 《Acta Geochimica》 2026年第1期185-203,共19页
The migration mechanisms of ore-forming fluids have long been a focus in the field of ore deposit studies.Calcite is ubiquitously present in various types of rocks in the lithosphere,and the underlying mechanisms of i... The migration mechanisms of ore-forming fluids have long been a focus in the field of ore deposit studies.Calcite is ubiquitously present in various types of rocks in the lithosphere,and the underlying mechanisms of its influence on fluid migration are of crucial importance.While previous studies have revealed that salinity changes can modulate fluid migration,the underlying mechanisms remain poorly understood.We employ molecular dynamics simulations to elucidate how salinity variations in ore-forming fluids modulate the adsorption onto calcite nanopore walls,thereby revealing the microscopic mechanisms governing ore fluid transport through calcite nano-fractures.The results show that the adsorption energy Eint of the solution on the calcite surface increased from -14,948.84±182.48 kcal/mol to -12,144.08±118.2 kcal/mol as salinity increased,which is conducive to the long-range transport of the fluid in the calcite nanopore. 展开更多
关键词 Fluid transport dynamics Salinity gradient regulation Calcite nanopores Molecular dynamics simulation
在线阅读 下载PDF
Short-chain Length Dependence of Equilibrium Dynamics and Nonlinear Rheology in Unentangled Long-chain/Short-chain Polymer Blends
16
作者 Xiao-Yang Wang Bo Liu +2 位作者 Li-Jia An Zhen-Hua Wang Yu-Yuan Lu 《Chinese Journal of Polymer Science》 2026年第2期525-535,I0016,共12页
The equilibrium dynamics and nonlinear rheology of unentangled polymer blends remain inadequately understood,especially regarding the influence of short-chain matrix length N_(S) on the structure and rheological behav... The equilibrium dynamics and nonlinear rheology of unentangled polymer blends remain inadequately understood,especially regarding the influence of short-chain matrix length N_(S) on the structure and rheological behavior of dispersed long chains.Using molecular dynamics simulations based on the Kremer-Grest model,we systematically explore the N_(S)-dependence of static conformations,equilibrium dynamics,and nonlinear shear responses in unentangled long-chain/short-chain polymer blends.Our results demonstrate a decoupling between the static and dynamic sensitivity to N_(S):while the static chain size,R_g,follows Flory theory with slight swelling at small N_(S) due to incomplete excluded volume screening,the diffusion coefficient,D,and the relaxation time,τ_(0),exhibit a strong,non-monotonic N_(S)-dependence,transitioning from monomeric friction dominance at small N_(S) to collective segmental rearrangement at large N_(S).Additionally,we observe partial decoupling between the viscous and normal stress responses:while the zero-shear viscosity,η,is strongly N_(S)-dependent,the first and second normal stress coefficients,Ψ_(1) and Ψ_(2),collapse onto universal curves when scaled by the dimensionless shear rate,γτ_(0),suggesting a common mechanism of orientation and stretching.Under shear,long chains compress in the vorticity direction λ_(z)~Wi^(-0.2),which reduces collision frequency and contributes to shear thinning,while the scaling of weaker orientation resistance m_(G)~Wi^(0.35)reflects hydrodynamic screening by the short-chain matrix.These findings highlight the limitations of single-chain models and emphasize the necessity of considering N_(S)-dependent matrix dynamics and flow-induced structural changes in understanding the rheology of unentangled polymer blends. 展开更多
关键词 Unentangled polymer blend Nonlinear rheology Equilibrium dynamics Hydrodynamic interaction screening Molecular dynamics simulation
原文传递
Integrated diagnosis of abnormal energy consumption in converter steelmaking using GWO-SVM-K-means algorithms
17
作者 Fei-Xiang Dai Xiang-Jun Bao +2 位作者 Lu Zhang Xiao-Jing Yang Guang Chen 《Journal of Iron and Steel Research International》 2026年第1期458-468,共11页
To address the issue of abnormal energy consumption fluctuations in the converter steelmaking process,an integrated diagnostic method combining the gray wolf optimization(GWO)algorithm,support vector machine(SVM),and ... To address the issue of abnormal energy consumption fluctuations in the converter steelmaking process,an integrated diagnostic method combining the gray wolf optimization(GWO)algorithm,support vector machine(SVM),and K-means clustering was proposed.Eight input parameters—derived from molten iron conditions and external factors—were selected as feature variables.A GWO-SVM model was developed to accurately predict the energy consumption of individual heats.Based on the prediction results,the mean absolute percentage error and maximum relative error of the test set were employed as criteria to identify heats with abnormal energy usage.For these heats,the K-means clustering algorithm was used to determine benchmark values of influencing factors from similar steel grades,enabling root-cause diagnosis of excessive energy consumption.The proposed method was applied to real production data from a converter in a steel plant.The analysis reveals that heat sample No.44 exhibits abnormal energy consumption,due to gas recovery being 1430.28 kg of standard coal below the benchmark level.A secondary contributing factor is a steam recovery shortfall of 237.99 kg of standard coal.This integrated approach offers a scientifically grounded tool for energy management in converter operations and provides valuable guidance for optimizing process parameters and enhancing energy efficiency. 展开更多
关键词 Converter smelting process abnormal energy diagnosis Gray wolf optimization algorithm Support vector machine K-means clustering algorithm
原文传递
MDGET-MER:Multi-Level Dynamic Gating and Emotion Transfer for Multi-Modal Emotion Recognition
18
作者 Musheng Chen Qiang Wen +2 位作者 Xiaohong Qiu Junhua Wu Wenqing Fu 《Computers, Materials & Continua》 2026年第3期872-893,共22页
In multi-modal emotion recognition,excessive reliance on historical context often impedes the detection of emotional shifts,while modality heterogeneity and unimodal noise limit recognition performance.Existing method... In multi-modal emotion recognition,excessive reliance on historical context often impedes the detection of emotional shifts,while modality heterogeneity and unimodal noise limit recognition performance.Existing methods struggle to dynamically adjust cross-modal complementary strength to optimize fusion quality and lack effective mechanisms to model the dynamic evolution of emotions.To address these issues,we propose a multi-level dynamic gating and emotion transfer framework for multi-modal emotion recognition.A dynamic gating mechanism is applied across unimodal encoding,cross-modal alignment,and emotion transfer modeling,substantially improving noise robustness and feature alignment.First,we construct a unimodal encoder based on gated recurrent units and feature-selection gating to suppress intra-modal noise and enhance contextual representation.Second,we design a gated-attention crossmodal encoder that dynamically calibrates the complementary contributions of visual and audio modalities to the dominant textual features and eliminates redundant information.Finally,we introduce a gated enhanced emotion transfer module that explicitly models the temporal dependence of emotional evolution in dialogues via transfer gating and optimizes continuity modeling with a comparative learning loss.Experimental results demonstrate that the proposed method outperforms state-of-the-art models on the public MELD and IEMOCAP datasets. 展开更多
关键词 Multi-modal emotion recognition dynamic gating emotion transfer module cross-modal dynamic alignment noise robustness
在线阅读 下载PDF
Dynamic behavior of steel post/wood panel railway noise barriers under aerodynamic loads induced by high-speed trains
19
作者 Dongyun Liu Chao Wang +3 位作者 Jaime Gonzalez-Libreros Andréas Andersson Lennart Elfgren Gabriel Sas 《Railway Engineering Science》 2026年第1期55-84,共30页
Railway noise barriers are an essential piece of infrastructure for reducing noise propagation.However,these barriers experience aerodynamic loads generated by high-speed trains,leading to dynamic effects that may com... Railway noise barriers are an essential piece of infrastructure for reducing noise propagation.However,these barriers experience aerodynamic loads generated by high-speed trains,leading to dynamic effects that may compromise their fatigue capacity.The most common structural design for railway noise barriers consists of vertical configurations of posts and panels.However,there have been few dynamic analyses of steel post/wood panel noise barriers under train-induced aerodynamic loads.This study used dynamic finite element analysis to assess the dynamic behavior of such noise barriers.Analysis of a 40-m-long noise barrier model and a triangular simplified load model,the latter of which effectively represented the detailed aerodynamic load,were first used to establish the model and input of the moving load during dynamic simulation.Then,the effects of different parameters on the dynamic response of the noise barrier were evaluated,including the damping ratio,the profile of the steel post,the span length of the panel,the barrier height,and the train speed.Gray relational analysis indicated that barrier height exhibited the highest correlations with the dynamic responses,followed by train speed,post profile,span length,and damping ratio.A reduction in the natural frequency and an increase in the train speed result in a higher peak response and more pronounced fluctuations between the nose and tail waves.The dynamic amplification factor(DAF)was found to be related to both the natural frequency and train speed.A model was proposed showing that the DAF significantly increases as the square of the natural frequency decreases and the cube of the train speed rises. 展开更多
关键词 aerodynamic load dynamic amplification factor dynamic behavior Finite element analysis High-speed train Railway noise barrier
在线阅读 下载PDF
Processability and Structure of Dynamically Modified Linear Low-density Polyethylene with Different Branching Contents Using a High Peroxide Content
20
作者 Jun-Jin Duan Yan-Qin Huang +3 位作者 Fu-Qing Wei Yan Gao Fu-Shan Wang Jia-Chun Feng 《Chinese Journal of Polymer Science》 2026年第1期87-99,I0011,共14页
Dynamic melt modification of polyethylene via the direct grafting of peroxide fragments shows promise for the development of processable functionalized materials.In this study,four linear low-density polyethylenes(LLD... Dynamic melt modification of polyethylene via the direct grafting of peroxide fragments shows promise for the development of processable functionalized materials.In this study,four linear low-density polyethylenes(LLDPEs)with comparable molecular weights but different short-chain branch(SCB)contents(ranging of 5-66 per 1000 carbon atoms)were modified via dynamic melt mixing using 2 wt% benzoyl peroxide at 145℃ and 50 r/min for 30 min.The influence of SCB content on the processability and structure of the resulting products was systematically investigated.All modified products exhibited good melt processability with melt flow rates(MFR)ranging from 0.46 g/10min to 1.07 g/10min.Products derived from low-SCB LLDPEs showed a lower MFR,higher cross-linking content,a larger number of long-chain branches,and a higher degree of benzoyl grafting.In contrast,those produced from high-SCB LLDPEs exhibited improved processability,reduced cross-linking,fewer long-chain branches,and lower benzoyl grafting levels.A detailed structural investigation of the soluble and insoluble fractions,which were separated using trichlorobenzene fractionation,was conducted to analyze the structural features of various modified products and demonstrate that the SCB content(i.e.,tertiary carbon density)significantly influences radical coupling during dynamic modification.Elevated tertiary carbon density,by introducing greater steric hindrance,suppresses radical coupling during dynamic modification,thereby reducing the efficiency of both crosslinking and peroxide fragment grafting.These findings provide new insights into the structure-reactivity relationships in peroxide-induced polyethylene modification and lay the foundation for tailoring material properties via dynamic processing. 展开更多
关键词 POLYETHYLENE PEROXIDE Short-chain branching dynamical modification PROCESSaBILITY
原文传递
上一页 1 2 250 下一页 到第
使用帮助 返回顶部