Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disruptin...Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disrupting the neural connections that allow communication between the brain and the rest of the body, which results in varying degrees of motor and sensory impairment. Disconnection in the spinal tracts is an irreversible condition owing to the poor capacity for spontaneous axonal regeneration in the affected neurons.展开更多
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
To establish the optimal reference trajectory for a near-space vehicle under free terminal time,a time-optimal model predictive static programming method is proposed with adaptive fish swarm optimization.First,the mod...To establish the optimal reference trajectory for a near-space vehicle under free terminal time,a time-optimal model predictive static programming method is proposed with adaptive fish swarm optimization.First,the model predictive static programming method is developed by incorporating neighboring terms and trust region,enabling rapid generation of precise optimal solutions.Next,an adaptive fish swarm optimization technique is employed to identify a sub-optimal solution,while a momentum gradient descent method with learning rate decay ensures the convergence to the global optimal solution.To validate the feasibility and accuracy of the proposed method,a near-space vehicle example is analyzed and simulated during its glide phase.The simulation results demonstrate that the proposed method aligns with theoretical derivations and outperforms existing methods in terms of convergence speed and accuracy.Therefore,the proposed method offers significant practical value for solving the fast trajectory optimization problem in near-space vehicle applications.展开更多
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
This paper presents an adaptive path planner for unmanned aerial vehicles （UAVs） to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory cap...This paper presents an adaptive path planner for unmanned aerial vehicles （UAVs） to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming （BLP） and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles （SAMs） are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.展开更多
This paper presents a new design approach to achieve decentralized optimal control of high-dimension complex singular systems with dynamic uncertainties. Based on robust adaptive dynamic programming(robust ADP) method...This paper presents a new design approach to achieve decentralized optimal control of high-dimension complex singular systems with dynamic uncertainties. Based on robust adaptive dynamic programming(robust ADP) method, controllers for solving the singular systems optimal control problem are designed. The proposed algorithm can work well when the system model is not exactly known but the input and output data can be measured. The policy iteration of each controller only uses their own states and input information for learning,and do not need to know the whole system dynamics. Simulation results on the New England 10-machine 39-bus test system show the effectiveness of the designed controller.展开更多
The aim of this work is to develop an improved region based active contour and dynamic programming based method for accurate segmentation of left ventricle （LV） from multi-slice cine short axis cardiac magnetic reso...The aim of this work is to develop an improved region based active contour and dynamic programming based method for accurate segmentation of left ventricle （LV） from multi-slice cine short axis cardiac magnetic resonance （MR） images. Intensity inhomogeneity and weak object boundaries present in MR images hinder the segmentation accuracy. The proposed active contour model driven by a local Gaussian distribution fitting （LGDF） energy and an auxiliary global intensity fitting energy improves the accuracy of endocardial boundary detection. The weightage of the global energy fitting term is dynamically adjusted using a spatially varying weight function. Dynamic programming scheme proposed for the segmentation of epicardium considers the myocardium probability map and a distance weighted edge map in the cost matrix. Radial distance weighted technique and conical geometry are employed for segmenting the basal slices with left ventricle outflow tract （LVOT） and most apical slices. The proposed method is validated on a public dataset comprising 45 subjects from medical image computing and computer assisted interventions （MICCAI） 2009 segmentation challenge. The average percentage of good endocardial and epicardial contours detected is about 99%, average perpendicular distance of the detected good contours from the manual reference contours is 1.95 mm, and the dice similarity coefficient between the detected contours and the reference contours is 0.91. Correlation coefficient and the coefficient of determination between the ejection fraction measurements from manual segmentation and the automated method are respectively 0.9781 and 0.9567, for LV mass these values are 0.9249 and 0.8554. Statistical analysis of the results reveals a good agreement between the clinical parameters determined manually and those estimated using the automated method.展开更多
BACKGROUND Breast cancer(BC)continues to occupy a leading position in terms of morbidity and mortality from malignant neoplasms among the female population.One of the promising markers associated with BC progression i...BACKGROUND Breast cancer(BC)continues to occupy a leading position in terms of morbidity and mortality from malignant neoplasms among the female population.One of the promising markers associated with BC progression is programmed death ligand 1(PD-L1).Previously,we investigated PD-L1 expression in BC via a new antibody against programmed cell death protein 1 ligand 1(PDCD1 LG1)and reported that high PDCD1 LG1 expression in tumor cells is an independent factor for a high risk of regional metastasis in patients with BC.However,the prognostic significance of PDCD1 LG1 expression in BC stromal cells has not been adequately studied.AIM To study the features of PDCD1 LG1 expression in BC stromal cells and its relationship with BC clinicopathological characteristics.METHODS In a prospective single-center observational study,tumor samples from 148 patients with newly diagnosed BC were examined.The tumor sections were immunohistochemically stained with antibodies against PDCD1 LG1.In the tumor samples,the PDCD1 LG1-positive lymphocyte(PDCD1 LG1+LF)score,presence of nuclear PDCD1 LG1 expression in the LFs,PDCD1 LG1 expression in polymorphic cell infiltrates(PDCD1 LG1+polymorphic cell infiltrates[PCIs]),and cells of the fibroblastic stroma and endothelial cells of the tumor microvessels were assessed.Statistical analyses were performed using Statistica 10.0 software.RESULTS A PDCD1 LG1+LF score≥3 was detected more often at stages N0 and N3 than at N1 and N2(P=0.03).Moderate and pronounced PDCD1 LG1+PCIs and the presence of PDCD1 LG1+fibroblastic stroma were associated with negative estrogen receptor status(P=0.0008 and P=0.03,respectively),human epidermal growth factor receptor 2-positive(HER2+)BC(P<0.00001 and P=0.0005),and luminal B HER2+,non-luminal HER2+and triple-negative BC(P<0.00001 and P=0.004).The risk of metastasis to regional lymph nodes(RLNs)depend on lymphovascular invasion(LVI)and the PDCD1 LG1+LF score.In the absence of LVI and a PDCD1 LG1+LF score<3 or≥3,metastases in RLNs were absent in 66.6%and 93.9%of patients with BC,respectively.In the presence of LVI and a PDCD1 LG1+LF score<3 or≥3,metastases in RLNs were detected in 82.6%and 92.7%of patients with BC,respectively.CONCLUSION The results indicated that the combined assessment of the PDCD1 LG1+LF score and LVI can improve the accuracy of predicting the risk of metastasis to RLNs in patients with BC.展开更多
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c...Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.展开更多
The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear progr...The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming （LP） based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming （OSIP） algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model （IMM） algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises.展开更多
In this paper, a class of augmented Lagrangiaus of Di Pillo and Grippo （DGALs） was considered, for solving equality-constrained problems via unconstrained minimization techniques. The relationship was further discus...In this paper, a class of augmented Lagrangiaus of Di Pillo and Grippo （DGALs） was considered, for solving equality-constrained problems via unconstrained minimization techniques. The relationship was further discussed between the uneonstrained minimizers of DGALs on the product space of problem variables and multipliers, and the solutions of the eonstrained problem and the corresponding values of the Lagrange multipliers. The resulting properties indicate more precisely that this class of DGALs is exact multiplier penalty functions. Therefore, a solution of the equslity-constralned problem and the corresponding values of the Lagrange multipliers can be found by performing a single unconstrained minimization of a DGAL on the product space of problem variables and multipliers.展开更多
The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functio...The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functioning(Soles et al.,2023).Synthesized by neural and glial cells,the brain's ECM regulates a myriad of homeostatic cellular processes,including neuronal plasticity and firing(Miyata et al.,2012),cation buffering(Moraws ki et al.,2015),and glia-neuron interactions(Anderson et al.,2016).Considering the diversity of functions,dynamic remodeling of the brain's ECM indicates that this understudied medium is an active participant in both normal physiology and neurological diseases.展开更多
Due to the nonlinearity and uncertainty, the precise control of underwater vehicles in some intelligent operations hasn’t been solved very well yet. A novel method of control based on desired state programming was pr...Due to the nonlinearity and uncertainty, the precise control of underwater vehicles in some intelligent operations hasn’t been solved very well yet. A novel method of control based on desired state programming was presented, which used the technique of fuzzy neural network. The structure of fuzzy neural network was constructed according to the moving characters and the back propagation algorithm was deduced. Simulation experiments were conducted on general detection remotely operated vehicle. The results show that there is a great improvement in response and precision over traditional control, and good robustness to the model’s uncertainty and external disturbance, which has theoretical and practical value.展开更多
Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based traje...Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based trajectories with smooth control histories for dynamic soaring maneuvers exploiting wind gradients.The desired smoothness is achieved by introducing a trigonometric series parameterization for the controls,which are formulated with respect to the normalized time.Specifically,the periodicity of the trigonometric functions is leveraged to facilitate the connection of cycles and streamline the problem formulation.Without relying on a specified wind profile,a freefinal-time quadratic programming-based control strategy is developed for the online correction of the flight trajectory,which requires only the instant wind information.Offline and online numerical studies show the trade-off to achieve the smoothness and demonstrate the effectiveness of the proposed method in a varying wind field.展开更多
Combined cycle plants (CCs) are broadly used all over the world. The inclusion of CCs into the optimal resource scheduling causes difficulties because they can be operated in different operating configuration modes ba...Combined cycle plants (CCs) are broadly used all over the world. The inclusion of CCs into the optimal resource scheduling causes difficulties because they can be operated in different operating configuration modes based on the number of combustion and steam turbines. In this paper a model CCs based on a mixed integer linear programming approach to be included into an optimal short term resource optimization problem is presented. The proposed method allows modeling of CCs in different modes of operation taking into account the non convex operating costs for the different combined cycle mode of operation.展开更多
Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environm...Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environment instead of dynamic one,and also can not solve the inherent constraints arising from the robot body and the exterior environment.To address these difficulties,this research aims to provide a feasible trajectory based on quadratic programming（QP） for path planning in three-dimensional space where an autonomous vehicle is requested to pursue a target while avoiding static or dynamic obstacles.First,the objective function is derived from the pursuit task which is defined in terms of the relative distance to the target,as well as the angle between the velocity and the position in the relative velocity coordinates（RVCs）.The optimization is in quadratic polynomial form according to QP formulation.Then,the avoidance task is modeled with linear constraints in RVCs.Some other constraints,such as kinematics,dynamics,and sensor range,are included.Last,simulations with typical multiple obstacles are carried out,including in static and dynamic environments and one of human-in-the-loop.The results indicate that the optimal trajectories of the autonomous robot in three-dimensional space satisfy the required performances.Therefore,the QP model proposed in this paper not only adapts to dynamic environment with uncertainty,but also can satisfy all kinds of constraints,and it provides an efficient approach to solve the problems of path planning in three-dimensional space.展开更多
This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators ...This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.展开更多
In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on t...In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on the output redefinition method and Adaptive Dynamic Programming(ADP).The intelligent FTC scheme consists of two main parts:a basic fault-tolerant and stable controller and an ADP-based supplementary controller.In the basic FTC part,an output redefinition approach is designed to make zero-dynamics stable with respect to the new output.Then,Ideal Internal Dynamic(IID)is obtained using an optimal bounded inversion approach,and a tracking controller is designed for the new output to realize output tracking of the nonminimum phase HSV system.For the ADP-based compensation control part,an ActionDependent Heuristic Dynamic Programming(ADHDP)adopting an actor-critic learning structure is utilized to further optimize the tracking performance of the HSV control system.Finally,simulation results are provided to verify the effectiveness and efficiency of the proposed FTC algorithm.展开更多
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent...Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.展开更多
基金financially supported by Ministerio de Ciencia e Innovación projects SAF2017-82736-C2-1-R to MTMFin Universidad Autónoma de Madrid and by Fundación Universidad Francisco de Vitoria to JS+2 种基金a predoctoral scholarship from Fundación Universidad Francisco de Vitoriafinancial support from a 6-month contract from Universidad Autónoma de Madrida 3-month contract from the School of Medicine of Universidad Francisco de Vitoria。
文摘Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disrupting the neural connections that allow communication between the brain and the rest of the body, which results in varying degrees of motor and sensory impairment. Disconnection in the spinal tracts is an irreversible condition owing to the poor capacity for spontaneous axonal regeneration in the affected neurons.
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
基金supported by the National Science Foundation for Distinguished Young Scholars of China(No.52425212)National Key Research and Development Program of China(No.2021YFA0717100)National Natural Science Foundation of China(Nos.12072270,U2013206,and 52442214).
文摘To establish the optimal reference trajectory for a near-space vehicle under free terminal time,a time-optimal model predictive static programming method is proposed with adaptive fish swarm optimization.First,the model predictive static programming method is developed by incorporating neighboring terms and trust region,enabling rapid generation of precise optimal solutions.Next,an adaptive fish swarm optimization technique is employed to identify a sub-optimal solution,while a momentum gradient descent method with learning rate decay ensures the convergence to the global optimal solution.To validate the feasibility and accuracy of the proposed method,a near-space vehicle example is analyzed and simulated during its glide phase.The simulation results demonstrate that the proposed method aligns with theoretical derivations and outperforms existing methods in terms of convergence speed and accuracy.Therefore,the proposed method offers significant practical value for solving the fast trajectory optimization problem in near-space vehicle applications.
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
基金the National Natural Science Foundation of China(No.60904066)
文摘This paper presents an adaptive path planner for unmanned aerial vehicles （UAVs） to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming （BLP） and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles （SAMs） are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.
基金supported in part by the National Natural Science Foundation of China(61473070,61433004,61627809)SAPI Fundamental Research Funds(2018ZCX22)
文摘This paper presents a new design approach to achieve decentralized optimal control of high-dimension complex singular systems with dynamic uncertainties. Based on robust adaptive dynamic programming(robust ADP) method, controllers for solving the singular systems optimal control problem are designed. The proposed algorithm can work well when the system model is not exactly known but the input and output data can be measured. The policy iteration of each controller only uses their own states and input information for learning,and do not need to know the whole system dynamics. Simulation results on the New England 10-machine 39-bus test system show the effectiveness of the designed controller.
基金supported by Department of Science and Technology, Ministry of Science and Technology, India (No. DST/TSG/ICT/2010/08)
文摘The aim of this work is to develop an improved region based active contour and dynamic programming based method for accurate segmentation of left ventricle （LV） from multi-slice cine short axis cardiac magnetic resonance （MR） images. Intensity inhomogeneity and weak object boundaries present in MR images hinder the segmentation accuracy. The proposed active contour model driven by a local Gaussian distribution fitting （LGDF） energy and an auxiliary global intensity fitting energy improves the accuracy of endocardial boundary detection. The weightage of the global energy fitting term is dynamically adjusted using a spatially varying weight function. Dynamic programming scheme proposed for the segmentation of epicardium considers the myocardium probability map and a distance weighted edge map in the cost matrix. Radial distance weighted technique and conical geometry are employed for segmenting the basal slices with left ventricle outflow tract （LVOT） and most apical slices. The proposed method is validated on a public dataset comprising 45 subjects from medical image computing and computer assisted interventions （MICCAI） 2009 segmentation challenge. The average percentage of good endocardial and epicardial contours detected is about 99%, average perpendicular distance of the detected good contours from the manual reference contours is 1.95 mm, and the dice similarity coefficient between the detected contours and the reference contours is 0.91. Correlation coefficient and the coefficient of determination between the ejection fraction measurements from manual segmentation and the automated method are respectively 0.9781 and 0.9567, for LV mass these values are 0.9249 and 0.8554. Statistical analysis of the results reveals a good agreement between the clinical parameters determined manually and those estimated using the automated method.
基金Supported by Russian Science Foundation,No.23-25-00183.
文摘BACKGROUND Breast cancer(BC)continues to occupy a leading position in terms of morbidity and mortality from malignant neoplasms among the female population.One of the promising markers associated with BC progression is programmed death ligand 1(PD-L1).Previously,we investigated PD-L1 expression in BC via a new antibody against programmed cell death protein 1 ligand 1(PDCD1 LG1)and reported that high PDCD1 LG1 expression in tumor cells is an independent factor for a high risk of regional metastasis in patients with BC.However,the prognostic significance of PDCD1 LG1 expression in BC stromal cells has not been adequately studied.AIM To study the features of PDCD1 LG1 expression in BC stromal cells and its relationship with BC clinicopathological characteristics.METHODS In a prospective single-center observational study,tumor samples from 148 patients with newly diagnosed BC were examined.The tumor sections were immunohistochemically stained with antibodies against PDCD1 LG1.In the tumor samples,the PDCD1 LG1-positive lymphocyte(PDCD1 LG1+LF)score,presence of nuclear PDCD1 LG1 expression in the LFs,PDCD1 LG1 expression in polymorphic cell infiltrates(PDCD1 LG1+polymorphic cell infiltrates[PCIs]),and cells of the fibroblastic stroma and endothelial cells of the tumor microvessels were assessed.Statistical analyses were performed using Statistica 10.0 software.RESULTS A PDCD1 LG1+LF score≥3 was detected more often at stages N0 and N3 than at N1 and N2(P=0.03).Moderate and pronounced PDCD1 LG1+PCIs and the presence of PDCD1 LG1+fibroblastic stroma were associated with negative estrogen receptor status(P=0.0008 and P=0.03,respectively),human epidermal growth factor receptor 2-positive(HER2+)BC(P<0.00001 and P=0.0005),and luminal B HER2+,non-luminal HER2+and triple-negative BC(P<0.00001 and P=0.004).The risk of metastasis to regional lymph nodes(RLNs)depend on lymphovascular invasion(LVI)and the PDCD1 LG1+LF score.In the absence of LVI and a PDCD1 LG1+LF score<3 or≥3,metastases in RLNs were absent in 66.6%and 93.9%of patients with BC,respectively.In the presence of LVI and a PDCD1 LG1+LF score<3 or≥3,metastases in RLNs were detected in 82.6%and 92.7%of patients with BC,respectively.CONCLUSION The results indicated that the combined assessment of the PDCD1 LG1+LF score and LVI can improve the accuracy of predicting the risk of metastasis to RLNs in patients with BC.
基金supported by Canada First Research Excellence Fund,Medicine by Design(to CMM)。
文摘Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.
基金supported by the National Natural Science Fundation of China (61203238 61134005+5 种基金 60921001 90916024 91116016)the National Basic Research Program of China (973 Program) (2012CB8212002012CB821201)the National Science Foundation for Postdoctoral Scientists of China (2012M520140)
文摘The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming （LP） based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming （OSIP） algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model （IMM） algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises.
文摘In this paper, a class of augmented Lagrangiaus of Di Pillo and Grippo （DGALs） was considered, for solving equality-constrained problems via unconstrained minimization techniques. The relationship was further discussed between the uneonstrained minimizers of DGALs on the product space of problem variables and multipliers, and the solutions of the eonstrained problem and the corresponding values of the Lagrange multipliers. The resulting properties indicate more precisely that this class of DGALs is exact multiplier penalty functions. Therefore, a solution of the equslity-constralned problem and the corresponding values of the Lagrange multipliers can be found by performing a single unconstrained minimization of a DGAL on the product space of problem variables and multipliers.
基金supported by National Institute on Aging(NIH-NIA)R21 AG074152(to KMA)National Institute of Allergy and Infectious Diseases(NIAID)grant DP2 AI171150(to KMA)Department of Defense(DoD)grant AZ210089(to KMA)。
文摘The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functioning(Soles et al.,2023).Synthesized by neural and glial cells,the brain's ECM regulates a myriad of homeostatic cellular processes,including neuronal plasticity and firing(Miyata et al.,2012),cation buffering(Moraws ki et al.,2015),and glia-neuron interactions(Anderson et al.,2016).Considering the diversity of functions,dynamic remodeling of the brain's ECM indicates that this understudied medium is an active participant in both normal physiology and neurological diseases.
基金Supported by the National High Technology and Development Program Foundation of China under Grant No. 2002AA420090.
文摘Due to the nonlinearity and uncertainty, the precise control of underwater vehicles in some intelligent operations hasn’t been solved very well yet. A novel method of control based on desired state programming was presented, which used the technique of fuzzy neural network. The structure of fuzzy neural network was constructed according to the moving characters and the back propagation algorithm was deduced. Simulation experiments were conducted on general detection remotely operated vehicle. The results show that there is a great improvement in response and precision over traditional control, and good robustness to the model’s uncertainty and external disturbance, which has theoretical and practical value.
基金supported in part by the TUM University Foundation Fellowshipin part by the German Federal Ministry for Economic Affairs and Energy(BMWi)within the Federal Aeronautical Research Program LuFo VI-1through Project“RAUDY”(No.20E1910B)。
文摘Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based trajectories with smooth control histories for dynamic soaring maneuvers exploiting wind gradients.The desired smoothness is achieved by introducing a trigonometric series parameterization for the controls,which are formulated with respect to the normalized time.Specifically,the periodicity of the trigonometric functions is leveraged to facilitate the connection of cycles and streamline the problem formulation.Without relying on a specified wind profile,a freefinal-time quadratic programming-based control strategy is developed for the online correction of the flight trajectory,which requires only the instant wind information.Offline and online numerical studies show the trade-off to achieve the smoothness and demonstrate the effectiveness of the proposed method in a varying wind field.
文摘Combined cycle plants (CCs) are broadly used all over the world. The inclusion of CCs into the optimal resource scheduling causes difficulties because they can be operated in different operating configuration modes based on the number of combustion and steam turbines. In this paper a model CCs based on a mixed integer linear programming approach to be included into an optimal short term resource optimization problem is presented. The proposed method allows modeling of CCs in different modes of operation taking into account the non convex operating costs for the different combined cycle mode of operation.
基金supported by National Natural Science Foundation of China (Grant Nos. 61035005,61075087)Hubei Provincial Natural Science Foundation of China (Grant No. 2010CDA005)Hubei Provincial Education Department Foundation of China (Grant No.Q20111105)
文摘Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environment instead of dynamic one,and also can not solve the inherent constraints arising from the robot body and the exterior environment.To address these difficulties,this research aims to provide a feasible trajectory based on quadratic programming（QP） for path planning in three-dimensional space where an autonomous vehicle is requested to pursue a target while avoiding static or dynamic obstacles.First,the objective function is derived from the pursuit task which is defined in terms of the relative distance to the target,as well as the angle between the velocity and the position in the relative velocity coordinates（RVCs）.The optimization is in quadratic polynomial form according to QP formulation.Then,the avoidance task is modeled with linear constraints in RVCs.Some other constraints,such as kinematics,dynamics,and sensor range,are included.Last,simulations with typical multiple obstacles are carried out,including in static and dynamic environments and one of human-in-the-loop.The results indicate that the optimal trajectories of the autonomous robot in three-dimensional space satisfy the required performances.Therefore,the QP model proposed in this paper not only adapts to dynamic environment with uncertainty,but also can satisfy all kinds of constraints,and it provides an efficient approach to solve the problems of path planning in three-dimensional space.
基金Supported by Chongqing Key Lab. of Operations Research and System Engineering
文摘This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.
基金supported in part by the Science Center Program of National Natural Science Foundation of China(62373189,62188101,62020106003)the Research Fund of State Key Laboratory of Mechanics and Control for Aerospace Structures,China。
文摘In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on the output redefinition method and Adaptive Dynamic Programming(ADP).The intelligent FTC scheme consists of two main parts:a basic fault-tolerant and stable controller and an ADP-based supplementary controller.In the basic FTC part,an output redefinition approach is designed to make zero-dynamics stable with respect to the new output.Then,Ideal Internal Dynamic(IID)is obtained using an optimal bounded inversion approach,and a tracking controller is designed for the new output to realize output tracking of the nonminimum phase HSV system.For the ADP-based compensation control part,an ActionDependent Heuristic Dynamic Programming(ADHDP)adopting an actor-critic learning structure is utilized to further optimize the tracking performance of the HSV control system.Finally,simulation results are provided to verify the effectiveness and efficiency of the proposed FTC algorithm.
基金supported by the National Natural Science Foundation of China(No.62203256)。
文摘Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.
