期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到1,005篇文章
< 1 2 … 51 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Neurodynamic Optimization Approaches With Fixed-Time Convergence for Nash Equilibrium Seeking:Theory and Hardware Experiment 认领 引用
1
作者 Xingxing Ju Xinsong Yang +2 位作者 Chuandong Li Gang Feng Daniel W.C.Ho 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第3期704-714,共11页
The convergence rate is one of the key performance measures for Nash equilibrium(NE)seeking strategies.In this work,we present several novel fast decoupled/coupled time-varying neurodynamic optimization approaches wit... The convergence rate is one of the key performance measures for Nash equilibrium(NE)seeking strategies.In this work,we present several novel fast decoupled/coupled time-varying neurodynamic optimization approaches with fixed-time(FT)convergence to Nash equilibrium seeking in non-cooperative games.The dynamics trajectories are demonstrated to converge to the NE solution within a fixed time from any initial states.The proposed neurodynamic networks exhibit a faster convergence rate with appropriately selected time-varying coefficients.Additionally,the upper bounds of the convergence time of the proposed NE seeking networks are smaller than those for strategies with constant coefficients.The robustness of the proposed NE seeking neurodynamic approaches under bounded perturbations is further studied.The efficacy and practicality of the proposed NE seeking approaches are validated through simulations and field-programmable gate array(FPGA)experiments on duopoly market games. 展开更多
关键词 Fixed-time(FT)convergence hardware implementation Nash equilibrium(NE) neurodynamic optimization approaches
暂未订购 下载PDF
Maximizing pediatric stem cell harvest:A novel two-step digestion approach for adipose tissue 认领 引用
2
作者 Asad Mushtaq Mahmood S Choudhery +2 位作者 Taqdees Arif Ahmad Niaz Asim Pervaiz 《World Journal of Stem Cells》 SCIE 2026年第3期131-143,共13页
BACKGROUND Stromal vascular fraction(SVF)derived from adipose tissue(AT)is a heterogeneous cell mixture.SVF is commonly prepared via enzymatic digestion of AT.Typically,only the initial SVF(SVF1)is harvested,and the r... BACKGROUND Stromal vascular fraction(SVF)derived from adipose tissue(AT)is a heterogeneous cell mixture.SVF is commonly prepared via enzymatic digestion of AT.Typically,only the initial SVF(SVF1)is harvested,and the remaining AT is discarded.However,residual AT may contain viable regenerative cells.AIM To explore a novel approach involving a second enzymatic digestion to maximize stem cell yield,particularly relevant for pediatric patients or those with limited adipose reserves.METHODS AT samples obtained via liposuction were digested twice using collagenase type Ⅳ to yield SVF1 and SVF2(after 1st and 2nd digestions,respectively).Both fractions were assessed for cell viability,mononuclear cell count,plating efficiency,and the expression of surface markers via flow cytometry.Gene expression analysis of vascular endothelial growth factor,stromal cell-derived factor,nitric oxide synthase-3,CD14,matrix metalloproteinase 3,interleukin-4 receptor,P16,and P53 was performed using quantitative reverse transcription polymerase chain reaction.Histology was performed on AT samples to assess structural integrity and cellular composition across different digestion stages.RESULTS Results demonstrated that SVF2 contained a significant number of mononuclear cells and exhibited a high plating efficiency.Flow cytometry and gene expression analyses further confirmed that SVF2 retained regenerative cells.Furthermore,histological evaluation using hematoxylin and eosin staining revealed the presence of intact cells within the residual tissue post-first digestion.CONCLUSION In conclusion,secondary digestion of AT(typically discarded after 1st digestion),can yield additional regenerative cells.This method enhances stem cell number for stem cell-based therapies and is particularly valuable for pediatric patients and those with low-AT reserves. 展开更多
关键词 Stromal vascular fraction Adipose tissue derived stem cells Adipose tissue Regenerative medicine Two-step digestion approach
暂未订购 下载PDF
Optimization of defoaming-flocculation-dewatering indices of earth pressure balance(EPB)shield muck using response surface methodology and desirability approach 认领 引用 被引量：2
3
作者 Yao Lu Ming Huang +3 位作者 Chengzhao Zhang Bingnan Wang Liqian Peng Wei Wei 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2025年第2期1134-1148,共15页
In situ recycling is one of the most effective methods to dispose of earth pressure balance(EPB)shield waste muck with residual foaming agents with high moisture content.In this context,response surface methodology(RS... In situ recycling is one of the most effective methods to dispose of earth pressure balance(EPB)shield waste muck with residual foaming agents with high moisture content.In this context,response surface methodology(RSM)was employed to quantify the effects of independent variables,including flocculant dosage,defoamer dosage,and muck drying mass(MDM)and their interactions on defoaming-flocculation-dewatering indices.The polymeric aluminum chloride(PACL)and hydroxy silicone oil-glycerol polypropylene ether(H-G)were selected as the flocculant and defoamer.The contents of surfactants and foam stabilizers in residual foaming agents were determined using the proposed empirical equation.The defoaming ratio,antifoaming ratio,turbidity,moisture content,filtration loss ratio,and fall cone penetration depth were considered as dependent variables.The accuracy of developed RSM models was verified by the analysis results of variance,residuals,and paired t-test.Combined with the desirability approach,an optimal mixing ratio of 0.078 wt%PACL,0.016 wt%H-G,and 27.882 wt%MDM was recommended,leading to a defoaming ratio of 98.34 vol%for residual foams and a moisture content of 56.72 wt%for pressure-filtration cakes.Our findings were demonstrated to be able to provide useful guidance for prediction and optimization of the in situ recycling indicators of EPB shield waste muck in metro tunnel construction sites. 展开更多
关键词 Desirability approach EPB shield Muck recycling Multiobjective optimization Response surface methodology(RSM)
暂未订购 下载PDF
A Stochastic Optimal Control for a Class of LTI Systems With a State-Dependent Wiener Process:An Algebraic Approach 认领 引用
4
作者 Kento Fujita Daisuke Tsubakino Shiuji Hara 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第2期489-491,共3页
Dear Editor,In this letter,we focus on the algebraic relationship between the coefficient matrices and the solution of the stochastic algebraic Riccati equation.It is revealed that,if the coefficient matrices are in a... Dear Editor,In this letter,we focus on the algebraic relationship between the coefficient matrices and the solution of the stochastic algebraic Riccati equation.It is revealed that,if the coefficient matrices are in an algebra,then the solution(and also the control gain in many cases)is also in the same algebra.The main result is verified by a numerical simulation. 展开更多
关键词 stochastic optimal control algebraic relationship algebraic approach state dependent Wiener process coefficient matrices stochastic algebraic Riccati equation numerical simulation stochastic algebraic riccati equationit
暂未订购 下载PDF
Robust Pose Graph Optimization Against Outliers Using Consistency Credibility Factor 认领 引用
5
作者 Jie Cai Guoliang Wei +1 位作者 Wangyan Li Yaolei Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第5期1044-1046,共3页
Dear Editor,Pose graph optimization(PGO)is a popular optimization approach that plays a crucial role in the simultaneous localization and mapping(SLAM)back-end.However,when incorrect loop closure constraints(referred ... Dear Editor,Pose graph optimization(PGO)is a popular optimization approach that plays a crucial role in the simultaneous localization and mapping(SLAM)back-end.However,when incorrect loop closure constraints(referred to as outliers)are present in the SLAM front-end,the standard PGO algorithm fails catastrophically and can not return an accurate map.To address this issue,this letter proposes a novel algorithm that leverages classical optimization methods to effectively handle outliers.The proposed algorithm introduces a new formulation that incorporates a credibility factor model,which improves the robustness of the optimization process.Additionally,an innovative consistency classification algorithm is developed to detect outliers.Extensive experiments are conducted on multiple benchmark datasets to evaluate the consistency and accuracy of the proposed algorithm. 展开更多
关键词 graph optimization pgo pose graph optimization outliers consistency classification robustness optimization approach credibility factor classical optimization methods
暂未订购 下载PDF
Optimization of Fermentation Medium for Epothilones Production with Sequential Statistical Approach 认领 引用 被引量：7
6
作者 MENG Fan-xin LI You-xin +3 位作者 GUO Wei-liang LU Jia-hui DU Lin-na TENG Li-rong 《Chemical Research in Chinese Universities》 SCIE CAS 2010年第1期86-91,共6页
A sequential statistical approach was applied to optimizing the fermentation medium of epothilones(Epos)production by means of a mutant which was obtained by treating polyangium cellulosum ATCC 15384 with nitrite and ... A sequential statistical approach was applied to optimizing the fermentation medium of epothilones(Epos)production by means of a mutant which was obtained by treating polyangium cellulosum ATCC 15384 with nitrite and ultraviolet.The effects of different carbon sources and nitrogen sources on the fermentation medium were tested,and the suitable ones were selected.Then a uniform design was employed to design the experiments.A linear model was developed for identifying the significant components in fermentation medium,while a third degree polynomial model was used for studying the relationship between the concentration of the components in fermentation medium and the yield of Epos(YEPs).A pattern search method was used for searching the optimum fermentation medium in the test space,which was as follows(g/L):potassium nitrate 8.00,soybean peptone 17.60,potassium hydrogen phos-phate 1.00,beef extraction 6.46,yeast extraction 1.00,calcium chloride 0.25,sodium chloride 1.00 and ferric chloride 0.02.The optimum fermentation medium was expected to result in a yield of Epos(YEPs)of 2.48 mg/L.The validation experiments with the optimum medium were performed in triplicate and the average yield of Epos was 2.45 mg/L which was 7.78 times higher than that of Epos prepared without optimization. 展开更多
关键词 Statistical approach Epothilones Uniform design Optimization of fermentation medium
暂未订购 下载PDF
A Comparison of Arithmetic Operations for Dynamic Process Optimization Approach 认领 引用 被引量：4
7
作者 洪伟荣 谭鹏程 +1 位作者 王树青 Pu Li 《Chinese Journal of Chemical Engineering》 SCIE EI CAS 2010年第1期80-85,共6页
A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality co... A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems. 展开更多
关键词 dynamic optimization arithmetic operation comparison quasi-sequential approach simultaneous approach
暂未订购 下载PDF
Organic cathode materials for rechargeable magnesium-ion batteries:Fundamentals, recent advances, and approaches to optimization 认领 引用 被引量：4
8
作者 Xiaoqian He Ruiqi Cheng +6 位作者 Xinyu Sun Hao Xu Zhao Li Fengzhan Sun Yang Zhan Jianxin Zou Richard M.Laine 《Journal of Magnesium and Alloys》 SCIE EI CAS CSCD 2023年第12期4359-4389,共31页
Rechargeable magnesium-ion batteries(MIBs) are favorable substitutes for conventional lithium-ion batteries(LIBs) because of abundant magnesium reserves, a high theoretical energy density, and great inherent safety. O... Rechargeable magnesium-ion batteries(MIBs) are favorable substitutes for conventional lithium-ion batteries(LIBs) because of abundant magnesium reserves, a high theoretical energy density, and great inherent safety. Organic electrode materials with excellent structural tunability,unique coordination reaction mechanisms, and environmental friendliness offer great potential to promote the electrochemical performance of MIBs. However, research on organic magnesium battery cathode materials is still preliminary with many significant challenges to be resolved including low electrical conductivity and unwanted but severe dissolution in useful electrolytes. Herein, we provide a detailed overview of reported organic cathode materials for MIBs. We begin with basic properties such as charge storage mechanisms(e.g., n-, p-, and bipolartype), moving to recent advances in various types of organic cathodes including carbonyl-, nitrogen-, and sulfur-based materials. To shed light on the diverse strategies targeting high-performance Mg-organic batteries, elaborate summaries of various approaches are presented.Generally, these strategies include molecular design, polymerization, mixing with carbon, nanosizing and electrolyte/separator optimization.This review provides insights on exploring high-performance organic cathodes in rechargeable MIBs. 展开更多
关键词 Mg-organic batteries Organic cathode materials Energy storage Charge storage mechanism Electrochemical optimization approaches
暂未订购 下载PDF
Airfoil design optimization based on lattice Boltzmann method and adjoint approach 认领 引用 被引量：1
9
作者 Xiaowei LI Liang FANG Yan PENG 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2018年第6期891-904,共14页
We present a new aerodynamic design method based on the lattice Boltzmann method （LBM） and the adjoint approach. The flow field and the adjoint equation are numerically simulated by the GILBM （generalized form of i... We present a new aerodynamic design method based on the lattice Boltzmann method （LBM） and the adjoint approach. The flow field and the adjoint equation are numerically simulated by the GILBM （generalized form of interpolation supplemented LBM） on non-uniform meshes. The first-order approximation for the equilibrium dis- tribution function on the boundary is proposed to diminish the singularity of boundary conditions. Further, a new treatment of the solid boundary in the LBM is described par- ticularly for the airfoil optimization design problem. For a given objective function, the adjoint equation and its boundary conditions are derived analytically. The feasibility and accuracy of the new approach have been perfectly validated by the design optimization of NACA0012 airfoil. 展开更多
关键词 lattice Boltzmann method （LBM） adjoint approach boundary treatment aerodynamic design optimization
暂未订购 下载PDF
EPSILON-CONTINUATION APPROACH FOR TRUSS TOPOLOGY OPTIMIZATION 认领 引用 被引量：2
10
作者 郭旭 程耿东 《Acta Mechanica Sinica》 SCIE EI CAS 2004年第5期526-533,共8页
In the present paper,a so-called epsilon-continuation approach is proposed for the solution of singular optimum in truss topology optimization problems.This approach is an improved version of the epsilon-relaxed appro... In the present paper,a so-called epsilon-continuation approach is proposed for the solution of singular optimum in truss topology optimization problems.This approach is an improved version of the epsilon-relaxed approach developed by the authors previously.In the proposed approach, we start the optimization process from a relaxation parameter with a relatively large value and obtain a solution by applying the epsilon-relaxed approach.Then we decrease the value of the relaxation parameter by a small amount and choose the optimal solution found from the previous optimization process as the initial design for the next optimization.This continuation process is continued until a small termination value of the relaxation parameter is reached.Convergence analysis of the proposed approach is also presented.Numerical examples show that this approach can alleviate the dependence of the final solution on the initial choice of the design variable and enhance the probability of finding the singular optimum from rather arbitrary initial designs. 展开更多
关键词 topology optimization singular optimum epsilon-relaxed approach
暂未订购 下载PDF
ADAPT:A Model-Free Adaptive Optimal Control for Continuum Robots 认领 引用
11
作者 Haiyang Fang Sishen Yuan +2 位作者 Hongliang Ren Shuping He Shing Shin Cheng 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第1期205-217,共13页
Realizing optimal control performance for continuum robots(CRs) poses huge challenges on traditional modelbased optimal control approaches due to their high degrees of freedom,complex nonlinear dynamics and soft conti... Realizing optimal control performance for continuum robots(CRs) poses huge challenges on traditional modelbased optimal control approaches due to their high degrees of freedom,complex nonlinear dynamics and soft continuum morphologies which are difficult to explicitly model.This paper proposes a model-free adaptive optimal control algorithm(ADAPT)for CRs.In our strategy,we consider CRs as a class of nonlinear continuous-time dynamical systems in the state space,wherein the position of the end-effector is considered as the state and the input torque is mapped as the control input.Then,the optimized Hamilton-Jacobi-Bellman(HJB) equation is derived by optimal control principles,and subsequently solved by the proposed ADAPT algorithm without requiring knowledge of the original system dynamics.Under some mild assumptions,the global stability and convergence of the closed-loop control approach are guaranteed.Several simulation experiments are conducted on a magnetic CR(MCR) to demonstrate the practicality and effectiveness of the ADAPT algorithm. 展开更多
关键词 Adaptive optimal control continuum robots(CRs) Hamilton-Jacobi-Bellman(HJB)equation model-free approach
暂未订购 下载PDF
SSA*-PDWA:A Hierarchical Path Planning Framework with Enhanced A*Algorithm and Dynamic Window Approach for Mobile Robots 认领 引用
12
作者 Lishu Qin Yu Gao Xinyuan Lu 《Computers, Materials & Continua》 SCIE EI 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
Vertex Cover Optimization Using a Novel Graph Decomposition Approach 认领 引用
13
作者 Abdul Manan Shahida Bashir Abdul Majid 《Computers, Materials & Continua》 SCIE EI 2022年第10期701-717,共17页
The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with... The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs. 展开更多
关键词 Combinatorial optimization graph theory minimum vertex cover problem maximum independent set maximum degree greedy approach approximation algorithms benchmark instances
暂未订购 下载PDF
Optimization of safflower oil transesterification using the Taguchi approach 认领 引用 被引量：4
14
作者 N.Kumar S.K.Mohapatra +2 位作者 S.S.Ragit K.Kundu R.Karmakar 《Petroleum Science》 SCIE CAS CSCD 2017年第4期798-805,共8页
Biodiesel is an alternative renewable fuel which is produced by using biomass resources. Its physicochemical properties are close to those of the petroleum diesel fuel. This study highlights biodiesel production from ... Biodiesel is an alternative renewable fuel which is produced by using biomass resources. Its physicochemical properties are close to those of the petroleum diesel fuel. This study highlights biodiesel production from safflower seed oil. The main aim of this experimental work is to optimize the process parameters, namely the methanolto-oil molar ratio, catalyst concentration, reaction time and reaction temperature for biodiesel production. The Taguchi robust design approach was used with an L9 orthogonal array to analyze the influence of process factors on performance parameters. The results showed that the optimum yield of biodiesel was 93.8% with viscosity 5.60 c St, with a methanol-to-oil molar ratio of 4:1, catalyst concentration of 1.5 wt%, reaction time of 90 min and reaction temperature of 60 ℃. The catalyst concentration was found to be the most influencing parameter which contributed 51.1% and 50.8% of the total effect on the yield of biodiesel, Y;, and viscosity of biodiesel, Y;, respectively. 展开更多
关键词 ANOVA Biodiesel Optimization Taguchi approach Transesterification
暂未订购 下载PDF
A MODIFIED INTERPOLATION APPROACH FOR TOPOLOGY OPTIMIZATION 认领 引用 被引量：3
15
作者 Yixian Du Shuangqiao Yan +2 位作者 Yan Zhang Huanghai Xie Qihua Tian 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2015年第4期420-430,共11页
In view of the fact that the follow-up search for an optimal topology is affected by deleting a large number of high-relative-density elements. When the typical density interpolation approach, namely, solid isotropic ... In view of the fact that the follow-up search for an optimal topology is affected by deleting a large number of high-relative-density elements. When the typical density interpolation approach, namely, solid isotropic microstructures with penalization （SIMP）, is employed in the continuum structural topology optimization, a new density interpolation approach based on the logistic function is proposed in this paper. This method can weaken low-relative-density elements while enhancing high-relative-density elements by polarization, and then rationally realize polarization of the intermediate density elements. It can reduce the number of gray-scale elements as much as possible to get the optimal topology with distinct boundaries in conjunction with the sensitivity filtering method based on particle swarm optimization （PSO）. Several typical numerical examples are given to demonstrate this method. 展开更多
关键词 topology optimization density interpolation approach logistic function gray-scaleelement
暂未订购 下载PDF
Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems 认领 引用 被引量：4
16
作者 You Zhao Xing He +1 位作者 Mingliang Zhou Tingwen Huang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第6期1485-1498,共14页
The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on... The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments. 展开更多
关键词 Accelerated projection neurodynamic approach lin-ear and set constraints projection operators smooth and nonsmooth convex optimization time scaling.
暂未订购 下载PDF
Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO): A Metaheuristic Approach for Allocating Dynamic Virtual Machine (VM) in Fog Computing Architecture 认领 引用 被引量：1
17
作者 Prasanna Kumar Kannughatta Ranganna Siddesh Gaddadevara Matt +2 位作者 Chin-Ling Chen Ananda Babu Jayachandra Yong-Yuan Deng 《Computers, Materials & Continua》 SCIE EI 2024年第8期2557-2578,共22页
In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow tasks.In cloud data centers,fog computing takes more time to run workflow applications... In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow tasks.In cloud data centers,fog computing takes more time to run workflow applications.Therefore,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing environments.Effective task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog nodes.This process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource bottlenecks.In this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local exploitation.This balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization algorithms.The FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response time.In relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks. 展开更多
关键词 Fog computing fractional selectivity approach particle swarm optimization algorithm task scheduling virtual machine allocation
暂未订购 下载PDF
Topology Optimization of Compliant Mechanisms with Geometrical Nonlinearities Using the Ground Structure Approach 认领 引用 被引量：7
18
作者 ZHAN Jinqing ZHANG Xianmin 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2011年第2期257-263,共7页
The majority of topology optimization of compliant mechanisms uses linear finite element models to find the structure responses.Because the displacements of compliant mechanisms are intrinsically large,the topological... The majority of topology optimization of compliant mechanisms uses linear finite element models to find the structure responses.Because the displacements of compliant mechanisms are intrinsically large,the topological design can not provide quantitatively accurate result.Thus,topological design of these mechanisms considering geometrical nonlinearities is essential.A new methodology for geometrical nonlinear topology optimization of compliant mechanisms under displacement loading is presented.Frame elements are chosen to represent the design domain because they are capable of capturing the bending modes.Geometrically nonlinear structural response is obtained by using the co-rotational total Lagrange finite element formulation,and the equilibrium is solved by using the incremental scheme combined with Newton-Raphson iteration.The multi-objective function is developed by the minimum strain energy and maximum geometric advantage to design the mechanism which meets both stiffness and flexibility requirements,respectively.The adjoint method and the direct differentiation method are applied to obtain the sensitivities of the objective functions.The method of moving asymptotes(MMA)is employed as optimizer.The numerical example is simulated to show that the optimal mechanism based on geometrically nonlinear formulation not only has more flexibility and stiffness than that based on linear formulation,but also has better stress distribution than the one.It is necessary to design compliant mechanisms using geometrically nonlinear topology optimization.Compared with linear formulation,the formulation for geometrically nonlinear topology optimization of compliant mechanisms can give the compliant mechanism that has better mechanical performance.A new method is provided for topological design of large displacement compliant mechanisms. 展开更多
关键词 compliant mechanisms topology optimization geometrical nonlinearities the ground structure approach displacement loading
暂未订购 下载PDF
A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS 认领 引用 被引量：1
19
作者 N.HOSEINPOOR M.GHAZNAVI 《Acta Mathematica Scientia》 SCIE CSCD 2024年第2期702-720,共19页
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr... In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems. 展开更多
关键词 multiobjective optimization Pareto front scalarization objective-constraint approach proper efficient solution
暂未订购 下载PDF
Provisioning Intelligent Water Wave Optimization Approach for Underwater Acoustic Wireless Sensor Networks 认领 引用
20
作者 M.Manikandan A.Rajiv Kannan 《Computer Systems Science & Engineering》 SCIE EI 2022年第11期625-641,共17页
In the Acoustics channel,it is incredibly challenging to offer data transfer for time-sourced applications in an energy-efficient manner due to higher error rate and propagation delay.Subsequently,conventional re-tran... In the Acoustics channel,it is incredibly challenging to offer data transfer for time-sourced applications in an energy-efficient manner due to higher error rate and propagation delay.Subsequently,conventional re-transmission over any failure generally initiates significantly larger end-to-end delay,and therefore it is not probable for time-based services.Moreover,standard techniques without any re-transmission consume enormous energy.This investigation proposes a novel multi-hop energy-aware transmission-based intelligent water wave optimization strategy.It ensures reduced end-to-end while attaining potential amongst overall energy efficiency end-to-end packet delay.It merges a naturally inspired meta-heuristic approach with multi-hop routing for data packets to reach the destination.The appropriate design of this Meta heuristic-based energy-aware scheme consumes lesser energy than the conventional one-hop transmission strategy without re-transmission.However,there is no hop-by-hop re-transmission facilitated.The proposed model shows only lesser delay than conventional methods with re-transmission.This work facilitates extensive work to carry out the proposed model performance with the MATLAB simulation environment.The results illustrate that the model is exceptionally energyefficient with lesser packet delays.With 500 nodes,the packet delivery ratio of proposed model is 100%,average delay is reduced by 2%,total energy consumption is 8 J,average packet redundancy is 1.856,and idle energy is 6.9Mwh.The proposed model outperforms existing approaches like OSF,AOR,and DMR respectively. 展开更多
关键词 Acoustic applications energy efficiency network communications underwater sensor networks meta-heuristic approach intelligent water wave optimization
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 51 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈