|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Characterization and evaluation of rice blast resistance of Chinese indica hybrid rice parental lines显示文摘The development of resistant varieties and hybrid combinations has been the most effective and economical strategy to control blast disease caused by Magnaporthe oryzae.However, the distribution of major R genes and blast resistance characterization in hybrid rice parents has not been well investigated, resulting in their limited use in hybrid rice blast-resistance breeding. In the present study, 88 elite indica hybrid rice parental lines were evaluated with 30 isolates of M. oryzae collected from the main planting area of indica hybrid rice in China and were characterized for the presence of 11 major resistance genes using molecular markers. The pathogenicity assays showed that four types of hybrid rice parent line showed some resistance to M. oryzae. However, the proportions of highly resistant lines and the mean resistance frequency(RF) varied among the four types, with resistance in decreasing order shown by three-line restorer lines, three-line maintainer lines, two-line sterile lines, and two-line restorer lines. All 88 hybrid rice parental lines carried more than one R gene, but none carried the R genes Pi1 and Pi2. Although Pid3 and Pi9 were present only in three-line restorer lines and Pigm only in three-line maintainer lines, the remaining six R genes(Pib, Pid2, Pi5, Pia, Pi54, and Pita) were present in the four types of hybrid rice parent with significantly different distribution frequencies. The correlation between R genes and resistance reactions was investigated. The results are expected to provide useful information for rational utilization of major R genes in hybrid rice breeding programs. | Yunyu Wu Ling Yu Ning Xiao Zhengyuan Dai Yuhong Li Cunhong Pan Xiaoxiang Zhang Guangqing Liu Aihong Li | 2017 | The Crop Journal2017，5，6： | 10 |
| 2 | A NEW FAMILY OF TRUST REGION ALGORITHMS FOR UNCONSTRAINED OPTIMIZATION显示文摘Trust region(TR)algorithms are a class of recently developed alogrthms for nonlinear optimization.A new family of TR algorithms for unconstrained optimization,which is the extension of the usual TR method,is pressented in this paper.When the objective function is bounded below and continuously differentiable,and the norm of the Hesse approximations increases at most linearly with the iteration number,we prove the global convergence of the algorithms.Limited numerical results are repoted,which indicate that our new TR algorithm is competitive. | Yuhong Dai Dachuan Xu(State Key Laboratory of Scientific/Engineering Computing, Institute of Computational Mathematicsand Scientific/Engineering Computing, Academy of Mathematics and System Sciences, ChineseAcademy of Sciences, P.O. Box 2719, Beijing 100080, China) | 2003 | Journal of Computational Mathematics2003，21，2： | 5 |
| 3 | A Barzilai-Borwein conjugate gradient method显示文摘The linear conjugate gradient method is an optimal method for convex quadratic minimization due to the Krylov subspace minimization property. The proposition of limited-memory BFGS method and Barzilai-Borwein gradient method, however, heavily restricted the use of conjugate gradient method for largescale nonlinear optimization. This is, to the great extent, due to the requirement of a relatively exact line search at each iteration and the loss of conjugacy property of the search directions in various occasions. On the contrary, the limited-memory BFGS method and the Barzilai-Bowein gradient method share the so-called asymptotical one stepsize per line-search property, namely, the trial stepsize in the method will asymptotically be accepted by the line search when the iteration is close to the solution. This paper will focus on the analysis of the subspace minimization conjugate gradient method by Yuan and Stoer(1995). Specifically, if choosing the parameter in the method by combining the Barzilai-Borwein idea, we will be able to provide some efficient Barzilai-Borwein conjugate gradient(BBCG) methods. The initial numerical experiments show that one of the variants, BBCG3, is specially efficient among many others without line searches. This variant of the BBCG method might enjoy the asymptotical one stepsize per line-search property and become a strong candidate for large-scale nonlinear optimization. | DAI YuHong KOU CaiXia | 2016 | Science China Mathematics2016，59，8： | 4 |
| 4 | Achievement of a near-perfect smooth silicon surface显示文摘During the ultra large scale integration(ULSI)process,the surface roughness of the polished silicon wafer plays an important role in the quality and rate of production of devices.In this work,the effects of oxidizer,surfactant,polyurethane pad and slurry additives on the surface roughness and topography of chemical-mechanical planarization(CMP)for silicon have been investigated.A standard atomic force microscopy(AFM)test method for the atomic scale smooth surface was proposed and used to measure the polished silicon surfaces.Finally,compared with the theoretical calculated Ra value of 0.0276 nm,a near-perfect silicon surface with the surface roughness at an atomic scale(0.5)was achieved based on an optimized CMP process. | LI Jing LIU YuHong DAI YuanJing YUE DaChuan LU XinChun LUO JianBin | 2013 | Science China(Technological Sciences)2013，56，11： | 3 |
| 5 | Efficient projected gradient methods for cardinality constrained optimization显示文摘Sparse optimization has attracted increasing attention in numerous areas such as compressed sensing, financial optimization and image processing. In this paper, we first consider a special class of cardinality constrained optimization problems, which involves box constraints and a singly linear constraint. An efficient approach is provided for calculating the projection over the feasibility set after a careful analysis on the projection subproblem. Then we present several types of projected gradient methods for a general class of cardinality constrained optimization problems. Global convergence of the methods is established under suitable assumptions. Finally, we illustrate some applications of the proposed methods for signal recovery and index tracking.Especially for index tracking, we propose a new model subject to an adaptive upper bound on the sparse portfolio weights. The computational results demonstrate that the proposed projected gradient methods are efficient in terms of solution quality. | Fengmin Xu Yuhong Dai Zhihu Zhao Zongben Xu | 2019 | Science China Mathematics2019，62，2： | 2 |
| 6 | Monotone projected gradient methods for large-scale box-constrained quadratic programming显示文摘Inspired by the success of the projected Barzilai-Borwein (PBB) method for largescale box-constrained quadratic programming, we propose and analyze the monotone projected gradient methods in this paper. We show by experiments and analyses that for the new methods,it is generally a bad option to compute steplengths based on the negative gradients. Thus in our algorithms, some continuous or discontinuous projected gradients are used instead to compute the steplengths. Numerical experiments on a wide variety of test problems are presented, indicating that the new methods usually outperform the PBB method. | ZHOU Bin, GAO Li & DAI Yuhong School of Mathematical Sciences and LMAM, Peking University, Beijing 100871, China State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China | 2006 | Science China Mathematics2006，49，5： | 2 |
| 7 | Composite silicone rubber of high piezoresistance repeatability filled with nanoparticles显示文摘The ruthenium oxide nanoparticles with size less than 20 nm were fabricated by annealing the metallic ruthenium nanoparticles in air,which were synthesized by using the thermal reduction in the polyol solution.The rutile structure of the ruthenium oxide was proved by using transmission electron microscopy(TEM)and X-ray photoelectron spectroscopy(XPS).The oxide has good electron conductivity. The surface of the ruthenium oxide was modified by a vinyl silane coupling agent.The assembling of the silane to the oxide surface was proved by Infrared(IR)absorption spectroscopy.By mixing the nanoparticles with poly(methylvinylsiloxane)(PMVS)silicone rubber,a composite filled with dispersive conducting phase was fabricated.The temperature dependent conductivity shows that the electron transportation through composite is mainly dominated by tunneling.The measurement of piezoresistance shows that the composite at low strain has high piezoresistance repeatability.The 3D reconstruction images of the composite filled with carbon black or ruthenium oxide show that the aggregation of the nanoparticles differs much for two composites.The narrow distribution range of the particle size was thought to be the main factor for the high piezoresistance recurrence. | WU JuYing ZHOU ChengXi ZHU QingWen LI EnRong DAI Ge BA Long HUANG YuHong Mei Jun | 2009 | Science China(Technological Sciences)2009，52，12： | 1 |
| 8 | New conjugate condi- tions and related nonlinear conjugategradient methods 显示文摘 | DAI YUHONG LIAO LIZHI | 2001 | Applied Mathematics and Optimization2001，43，： | 1 |
| 9 | STABILIZED BARZILAI-BORWEIN METHOD显示文摘The Barzilai-Borwein(BB)method is a popular and efficient tool for solving large-scale unconstrained optimization problems.Its search direction is the same as for the steepest descent(Cauchy)method,but its stepsize rule is different.Owing to this,it converges much faster than the Cauchy method.A feature of the BB method is that it may generate too long steps,which throw the iterates too far away from the solution.Moreover,it may not converge,even when the objective function is strongly convex.In this paper,a stabilization technique is introduced.It consists in bounding the distance between each pair of successive iterates,which often allows for decreasing the number of BB iterations.When the BB met hod does not converge,our simple modification of this method makes it convergent.For strongly convex functions with Lipsch计s gradients,we prove its global convergence,despite the fact that no line search is involved,and only gradient values are used.Since the number of stabilization steps is proved to be finite,the stabilized version inherits the fast local convergence of the BB met hod.The presented results of extensive numerical experiments show that our stabilization technique often allows the BB method to solve problems in a fewer计erations,or even to solve problems where the latter fails. | Oleg Burdakov Yuhong Dai Na Huang | 2019 | Journal of Computational Mathematics2019，37，6： | 1 |
| 10 | A Nonlinear Conjugate Gradient Method with a Strong Global Convergebce Property显示文摘 | DAI Yuhong YUAN Yaxiang | 1999 | SIAM Journal on Optimization1999，10，1： | 1 |
| 11 | A nonlinear conjugate gradient method with a strong global convergence prop- erty显示文摘 | DAI Yuhong YUAN Yaxiang | 1999 | SIAM Journal on Optimization1999，9，8： | 1 |
| 12 | An efficient hybrid conjugate gradient method for unconstrained optimization显示文摘 | Dai Yuhong Yuan Yaxiang | 2001 | Annals of Operations Research2001，103，： | 1 |
| 13 | A nonlinear conjugate gradient method with a strong global convergence property显示文摘 | Dai Yuhong Yuan Yaxiang | 1999 | SIAM Optim1999，10，： | 1 |
| 14 | Grey incidence clustering method based on multidimensional dynamic time warping distance显示文摘The traditional grey incidence degree is mainly based on the distance analysis methods, which is measured by the displacement difference between corresponding points between sequences. When some data of sequences are missing(inconsistency in the length of the sequences), the only way is to delete the longer sequences or to fill the shorter sequences. Therefore,some uncertainty is introduced. To solve this problem, by introducing three-dimensional grey incidence degree(3 D-GID), a novel GID based on the multidimensional dynamic time warping distance(MDDTW distance-GID) is proposed. On the basis of it, the corresponding grey incidence clustering(MDDTW distance-GIC)method is constructed. It not only has the simpler computation process, but also can be applied to the incidence comparison between uncertain multidimensional sequences directly. The experiment shows that MDDTW distance-GIC is more accurate when dealing with the uncertain sequences. Compared with the traditional GIC method, the precision of the MDDTW distance-GIC method has increased nearly 30%. | Jin Dai Yi Yan Yuhong He | 2017 | Journal of Systems Engineering and Electronics2017，28，5： | 1 |
| 15 | Cryptotanshinone induces cell cycle arrest and apoptosis of multidrug resistant human chronic myeloid leukemia cells by inhibiting the activity of eukaryotic initiation factor 4E显示文摘 | Yuqing Ge Rubin Cheng Yuhong Zhou Jianping Shen Laijun Peng Xiaofeng Xu Qun Dai Pei Liu Haibing Wang Xiaoqiong Ma Jia Jia Zhe Chen | 2012 | Molecular and Cellular Biochemistry2012，，1： | 1 |
| 16 | Projected barzilai-borwein methods for large-scale box-constrained quadratic pro- gramming显示文摘 | Dai Yuhong Fletcher R | 2005 | Numerical Math2005，100，1： | 1 |
| 17 | Convergence properties of nonlinear conjugate gradient method显示文摘 | Yuhong Dai Jiye Han Guanghui Liu | 2000 | SIAM Joumal of Optimization2000，10，： | 1 |
| 18 | An adaptive two-point stepsize gradient al- gorithm 显示文摘 | Dai Yuhong | 2001 | Numerical Algorithms2001，27，4： | 1 |
| 19 | Convergence properties of the BFGS algorithm显示文摘 | Dai Yuhong | 2002 | SIAM Journal on Optimization2002，13，3： | 1 |
| 20 | Convergence Properties of the BFGS Algorithm显示文摘 | Dai Yuhong | 2002 | SIAM Journal on Optimization2002，13，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员