http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Márcio de Oliveira Marques,Fábio Morotti,Camila Bizarro da Silva,Mario Ribeiro Júnior,Rubens César Pinto da Silva,Pietro Sampaio Baruselli,Marcelo Marcondes Seneda 대한수의학회 2015 Journal of Veterinary Science Vol.16 No.3
This study was conducted to evaluate the influence of category (heifers, primiparous or multiparous cows) on pregnancy rates in a large scaleresynchronization ovulation program. Nelore heifers (n = 903), primiparous lactating cows (n = 338) and multiparous lactating cows (n =1,223) were synchronized using a conventional protocol of estradiol/P4-based fixed-time artificial insemination (FTAI). Thirty days afterultrasonography, females who failed the first FTAI were resynchronized with the same hormonal protocol prior to a second FTAI. Thepregnancy status of each cohort was evaluated by ultrasonography 30 days after each FTAI. The average conception rate after the first FTAIand resynchronization was 80.5%. Heifers had a higher conception rate (85%) than primiparous (76%) or multiparous cows (78%; p = 0.0001). The conception rate after the first FTAI was similar among heifers (57%), primiparous cows (51%) and multiparous cows (56%; p = 0.193). After the second FTAI, heifers exhibited a higher conception rate (66%) than primiparous or multiparous cows (51%; p = 0.0001). These resultsdemonstrate the feasibility of resynchronization in large beef herds for providing consistent pregnancy rates in a short period of time. We alsodemonstrated that ovulation resynchronization 30 days after FTAI is particularly effective for heifers, providing a conception rate of up to66%.
Polynomial complexity of primal-dual interior-point methods for convex quadratic programming
Zhongyi Liu,Wenyu Sun,Raimundo J.B. de Sampaio,J.B. DE SAMPAIO 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.3
Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O(n<수식> log <수식>). In this paper we use this search direction to propose a primal-dual interior-point method for con- vex quadratic programming (QP). We overcome the difficulty in analyz- ing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial O(n<수식> log <수식>) for convex quadratic programming. Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O(n<수식> log <수식>). In this paper we use this search direction to propose a primal-dual interior-point method for con- vex quadratic programming (QP). We overcome the difficulty in analyz- ing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial O(n<수식> log <수식>) for convex quadratic programming.
AN ADAPTIVE APPROACH OF CONIC TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS
FU, JINHUA,SUN, WENYU,SAMPAIO, RAIMUNDO J. B. DE 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1
In this paper, an adaptive trust region method based on the conic model for unconstrained optimization problems is proposed and analyzed. We establish the global and super linear convergence results of the method. Numerical tests are reported that confirm the efficiency of the new method.
POLYNOMIAL COMPLEXITY OF PRIMAL-DUAL INTERIOR-POINT METHODS FOR CONVEX QUADRATIC PROGRAMMING
Liu, Zhongyi,Sun, Wenyu,De Sampaio, Raimundo J.B. The Korean Society for Computational and Applied M 2009 Journal of applied mathematics & informatics Vol.27 No.3
Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.
An adaptive approach of conic trust-region method for unconstrained optimization problems
Jinhua Fu,Wenyu Sun,Raimundo J. B. de Sampaio 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1-2
In this paper, an adaptive trust region method based on the conic model for unconstrained optimization problems is proposed and analyzed. We establish the global and superlinear convergence results of the method. Numerical tests are reported that confirm the efficiency of the new method.