A 1 kbit antifuse one time programmable(OTP) memory IP,which is one of the non-volatile memory IPs,was designed and used for power management integrated circuits(ICs).A conventional antifuse OTP cell using a single po...A 1 kbit antifuse one time programmable(OTP) memory IP,which is one of the non-volatile memory IPs,was designed and used for power management integrated circuits(ICs).A conventional antifuse OTP cell using a single positive program voltage(VPP) has a problem when applying a higher voltage than the breakdown voltage of the thin gate oxides and at the same time,securing the reliability of medium voltage(VM) devices that are thick gate transistors.A new antifuse OTP cell using a dual program voltage was proposed to prevent the possibility for failures in a qualification test or the yield drop.For the newly proposed cell,a stable sensing is secured from the post-program resistances of several ten thousand ohms or below due to the voltage higher than the hard breakdown voltage applied to the terminals of the antifuse.The layout size of the designed 1 kbit antifuse OTP memory IP with Dongbu HiTek's 0.18 μm Bipolar-CMOS-DMOS(BCD) process is 567.9 μm×205.135 μm and the post-program resistance of an antifuse is predicted to be several ten thousand ohms.展开更多
The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is signifi...The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.展开更多
The stochastic dual dynamic programming (SDDP) algorithm is becoming increasingly used. In this paper we present analysis of different methods of lattice construction for SDDP exemplifying a realistic variant of the n...The stochastic dual dynamic programming (SDDP) algorithm is becoming increasingly used. In this paper we present analysis of different methods of lattice construction for SDDP exemplifying a realistic variant of the newsvendor problem, incorporating storage of production. We model several days of work and compare the profits realized using different methods of the lattice construction and the corresponding computer time spent in lattice construction. Our case differs from the known one because we consider not only a multidimensional but also a multistage case with stage dependence. We construct scenario lattice for different Markov processes which play a crucial role in stochastic modeling. The novelty of our work is comparing different methods of scenario lattice construction. We considered a realistic variant of the newsvendor problem. The results presented in this article show that the Voronoi method slightly outperforms others, but the k-means method is much faster overall.展开更多
The optimality criteria （OC） method and mathematical programming （MP） were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constrai...The optimality criteria （OC） method and mathematical programming （MP） were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constraints. The stress constraints as local constraints were approached by zero-order approximation and transformed into movable sectional lower limits with the full stress criterion. The displacement constraints as global constraints were transformed into explicit expressions with the unit virtual load method. Thus an approximate explicit model for the sectional optimization of frame structures was built with stress and displacement constraints. To improve the resolution efficiency, the dual-quadratic programming was adopted to transform the original optimization model into a dual problem according to the dual theory and solved iteratively in its dual space. A method called approximate scaling step was adopted to reduce computations and smooth the iterative process. Negative constraints were deleted to reduce the size of the optimization model. With MSC/Nastran software as structural solver and MSC/Patran software as developing platform, the sectional optimization software of frame structures was accomplished, considering stress and displacement constraints. The examples show that the efficiency and accuracy are improved.展开更多
Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simpl...Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.展开更多
In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local ...In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local maximum, we utilize a merit function to guide the iterates toward a local minimum. Especially, we add the parameter ε to the Newton system when calculating the decrease directions. The global convergence is achieved by the decrease of a merit function. Furthermore, the numerical results confirm that the algorithm can solve this kind of problems in an efficient way.展开更多
In this paper, a class of nonsmooth multiobjective programming problems is considered. We introduce the new concept of invex of order??type II for nondifferentiable locally Lipschitz functions using the tools of Clark...In this paper, a class of nonsmooth multiobjective programming problems is considered. We introduce the new concept of invex of order??type II for nondifferentiable locally Lipschitz functions using the tools of Clarke subdifferential. The new functions are used to derive the sufficient optimality condition for a class of nonsmooth multiobjective programming problems. Utilizing the sufficient optimality conditions, weak and strong duality theorems are established for Wolfe type duality model.展开更多
目的评价免疫检查点抑制剂(ICIs)一线治疗晚期胃癌的有效性及安全性。方法检索PubMed、Web of Science、Embase、The Cochrane Library、万方数据、中国知网、维普网,收集ICIs一线治疗晚期胃癌的Ⅲ期临床随机对照试验(RCT)及相关肿瘤学...目的评价免疫检查点抑制剂(ICIs)一线治疗晚期胃癌的有效性及安全性。方法检索PubMed、Web of Science、Embase、The Cochrane Library、万方数据、中国知网、维普网,收集ICIs一线治疗晚期胃癌的Ⅲ期临床随机对照试验(RCT)及相关肿瘤学术年会的会议摘要,检索时限为建库起至2025年6月1日。筛选文献、提取数据、评价文献质量后,采用R语言软件4.3.2版进行网状Meta分析。结果共纳入8项研究,共计7801例患者。网状Meta分析结果显示,在有效性方面,与化疗(Chemo)比较,SHR-1701_Chemo、卡度尼利单抗+化疗(Cadoni_Chemo)、信迪利单抗+化疗、帕博利珠单抗+化疗和替雷利珠单抗+化疗均能显著延长患者的中位总生存期(OS)和中位无进展生存期(PFS)(P<0.05);而纳武利尤单抗+化疗仅显著延长了患者的中位PFS(P<0.05)。累积排名曲线下面积(SUCRA)结果显示,中位OS排名前2位的干预措施为SHR-1701_Chemo和Cadoni_Chemo;中位PFS排名前2位的干预措施为Cadoni_Chemo和SHR-1701_Chemo。对于程序性死亡受体配体1(PD-L1)综合阳性评分(CPS)≥5分患者,Cadoni_Chemo和SHR-1701_Chemo同样展现出最优的OS和PFS获益(P<0.05)。在安全性方面,各干预措施的任意不良事件(AEs)发生率及≥3级AEs发生率比较,差异均无统计学意义(P>0.05)。任意AEs发生率SUCRA排名前2位的为SHR-1701_Chemo和Chemo;≥3级AEs发生率SUCRA排名前2位的为Chemo和舒格利单抗+化疗。结论对于晚期胃癌患者,Cadoni_Chemo和SHR-1701_Chemo展现出最佳的OS和PFS获益,且在PD-L1 CPS≥5分的患者中优势依然明确;在安全性方面,Chemo引起的任意AEs及≥3级AEs的发生风险相对较低。展开更多
为实现交叉口时空资源的高效利用,对交叉口车道布局与信号控制协同优化问题进行了研究。首先,基于美国国家电气制造商协会(National Electric Manufacturers Association,NEMA)的双环标准相位,考虑饱和流量随车道数增加的递减效应,以信...为实现交叉口时空资源的高效利用,对交叉口车道布局与信号控制协同优化问题进行了研究。首先,基于美国国家电气制造商协会(National Electric Manufacturers Association,NEMA)的双环标准相位,考虑饱和流量随车道数增加的递减效应,以信号周期最小化为模型的目标,以车道布局、相位时长、饱和流量、交通流量、流量比、饱和度为模型的约束条件,建立了交叉口车道布局与信号控制方案协同优化的0-1混合整数线性规划(binary-mix-integer-linear-program,BMILP)模型。其次,使用分支定界法,快速得到模型的全局最优解。最后,选取南京市的北京东路-丹凤街交叉口,设定了3组不同的流量组合,对模型进行了实例验证。结果表明:模型可根据交叉口交通流量的分布特征,生成相应的车道布局和信号配时方案,无须预设特定的车道布局模式,且能灵活配置共享车道和右转相位;同时,对模型的最大可接受饱和度参数进行了敏感性分析,讨论了该参数和信号周期、相位饱和度等优化结果的关系。展开更多
This paper summarizes recent progress by the authors in developing two solution frameworks for dual control. The first solution framework considers a class of dual control problems where there exists a parameter uncer...This paper summarizes recent progress by the authors in developing two solution frameworks for dual control. The first solution framework considers a class of dual control problems where there exists a parameter uncertainty in the observation equation of the LQG problem. An analytical active dual control law is derived by a variance minimization approach. The issue of how to determine an optimal degree of active learning is then addressed, thus achieving an optimality for this class of dual control problems. The second solution framework considers a general class of discrete-time LQG problems with unknown parameters in both state and observation equations. The best possible (partial) closed-loop feedback control law is derived by exploring the future nominal posterior probabilities, thus taking into account the effect of future learning when constructing the optimal nominal dual control.展开更多
A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equ...A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.展开更多
In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed li...In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.展开更多
This study introduced a dual model on an original linear programming to obtain those shadow prices of resources that take part in optimizing. Of feed formulation, the shadow prices of nutrient resources show their inf...This study introduced a dual model on an original linear programming to obtain those shadow prices of resources that take part in optimizing. Of feed formulation, the shadow prices of nutrient resources show their influencing degree on a diet last cost when increasing or decreasing expected diet nutrient values. The higher the shadow price of one nutrient resource, the more obvious its influencing action on a diet last cost. When the shadow price of a kind of resource equals 'zero', it means that reaching of this nutrient value does not have influence on a special diet last cost within a particular value range. At the same time, this paper discussed the future development direction of feed formulation optimizing techniques in China.展开更多
基金Work supported by the Second Stage of Brain Korea 21 Projectssupported by Changwon National University in 2009-2010
文摘A 1 kbit antifuse one time programmable(OTP) memory IP,which is one of the non-volatile memory IPs,was designed and used for power management integrated circuits(ICs).A conventional antifuse OTP cell using a single positive program voltage(VPP) has a problem when applying a higher voltage than the breakdown voltage of the thin gate oxides and at the same time,securing the reliability of medium voltage(VM) devices that are thick gate transistors.A new antifuse OTP cell using a dual program voltage was proposed to prevent the possibility for failures in a qualification test or the yield drop.For the newly proposed cell,a stable sensing is secured from the post-program resistances of several ten thousand ohms or below due to the voltage higher than the hard breakdown voltage applied to the terminals of the antifuse.The layout size of the designed 1 kbit antifuse OTP memory IP with Dongbu HiTek's 0.18 μm Bipolar-CMOS-DMOS(BCD) process is 567.9 μm×205.135 μm and the post-program resistance of an antifuse is predicted to be several ten thousand ohms.
基金supported by the National Science Foundation of China (70771080)Social Science Foundation of Ministry of Education (10YJC630233)
文摘The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.
文摘The stochastic dual dynamic programming (SDDP) algorithm is becoming increasingly used. In this paper we present analysis of different methods of lattice construction for SDDP exemplifying a realistic variant of the newsvendor problem, incorporating storage of production. We model several days of work and compare the profits realized using different methods of the lattice construction and the corresponding computer time spent in lattice construction. Our case differs from the known one because we consider not only a multidimensional but also a multistage case with stage dependence. We construct scenario lattice for different Markov processes which play a crucial role in stochastic modeling. The novelty of our work is comparing different methods of scenario lattice construction. We considered a realistic variant of the newsvendor problem. The results presented in this article show that the Voronoi method slightly outperforms others, but the k-means method is much faster overall.
基金Project supported by the National Natural Science Foundation of China(No. 10472003) the Natural Science Foundation of Beijing(No.3002002) the Science Foundation of Beijing Municipal Commission of Education(No.KM200410005019)
文摘The optimality criteria （OC） method and mathematical programming （MP） were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constraints. The stress constraints as local constraints were approached by zero-order approximation and transformed into movable sectional lower limits with the full stress criterion. The displacement constraints as global constraints were transformed into explicit expressions with the unit virtual load method. Thus an approximate explicit model for the sectional optimization of frame structures was built with stress and displacement constraints. To improve the resolution efficiency, the dual-quadratic programming was adopted to transform the original optimization model into a dual problem according to the dual theory and solved iteratively in its dual space. A method called approximate scaling step was adopted to reduce computations and smooth the iterative process. Negative constraints were deleted to reduce the size of the optimization model. With MSC/Nastran software as structural solver and MSC/Patran software as developing platform, the sectional optimization software of frame structures was accomplished, considering stress and displacement constraints. The examples show that the efficiency and accuracy are improved.
文摘Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.
文摘In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local maximum, we utilize a merit function to guide the iterates toward a local minimum. Especially, we add the parameter ε to the Newton system when calculating the decrease directions. The global convergence is achieved by the decrease of a merit function. Furthermore, the numerical results confirm that the algorithm can solve this kind of problems in an efficient way.
文摘In this paper, a class of nonsmooth multiobjective programming problems is considered. We introduce the new concept of invex of order??type II for nondifferentiable locally Lipschitz functions using the tools of Clarke subdifferential. The new functions are used to derive the sufficient optimality condition for a class of nonsmooth multiobjective programming problems. Utilizing the sufficient optimality conditions, weak and strong duality theorems are established for Wolfe type duality model.
文摘为实现交叉口时空资源的高效利用,对交叉口车道布局与信号控制协同优化问题进行了研究。首先,基于美国国家电气制造商协会(National Electric Manufacturers Association,NEMA)的双环标准相位,考虑饱和流量随车道数增加的递减效应,以信号周期最小化为模型的目标,以车道布局、相位时长、饱和流量、交通流量、流量比、饱和度为模型的约束条件,建立了交叉口车道布局与信号控制方案协同优化的0-1混合整数线性规划(binary-mix-integer-linear-program,BMILP)模型。其次,使用分支定界法,快速得到模型的全局最优解。最后,选取南京市的北京东路-丹凤街交叉口,设定了3组不同的流量组合,对模型进行了实例验证。结果表明:模型可根据交叉口交通流量的分布特征,生成相应的车道布局和信号配时方案,无须预设特定的车道布局模式,且能灵活配置共享车道和右转相位;同时,对模型的最大可接受饱和度参数进行了敏感性分析,讨论了该参数和信号周期、相位饱和度等优化结果的关系。
基金the Research Grants Council of Hong Kong, P.R.China under Grant CUHK 4180/03E
文摘This paper summarizes recent progress by the authors in developing two solution frameworks for dual control. The first solution framework considers a class of dual control problems where there exists a parameter uncertainty in the observation equation of the LQG problem. An analytical active dual control law is derived by a variance minimization approach. The issue of how to determine an optimal degree of active learning is then addressed, thus achieving an optimality for this class of dual control problems. The second solution framework considers a general class of discrete-time LQG problems with unknown parameters in both state and observation equations. The best possible (partial) closed-loop feedback control law is derived by exploring the future nominal posterior probabilities, thus taking into account the effect of future learning when constructing the optimal nominal dual control.
基金supported by the National Natural Science Foundation of China(70771080)the Special Fund for Basic Scientific Research of Central Colleges+2 种基金China University of Geosciences(Wuhan) (CUG090113)the Research Foundation for Outstanding Young TeachersChina University of Geosciences(Wuhan)(CUGQNW0801)
文摘A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.
文摘In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.
基金The study was supported by“Tenth Five Year”National Science and Technology Plan of China(2001 BA513B04-01).
文摘This study introduced a dual model on an original linear programming to obtain those shadow prices of resources that take part in optimizing. Of feed formulation, the shadow prices of nutrient resources show their influencing degree on a diet last cost when increasing or decreasing expected diet nutrient values. The higher the shadow price of one nutrient resource, the more obvious its influencing action on a diet last cost. When the shadow price of a kind of resource equals 'zero', it means that reaching of this nutrient value does not have influence on a special diet last cost within a particular value range. At the same time, this paper discussed the future development direction of feed formulation optimizing techniques in China.
