• ETRI Journal
• /
• v.41 no.5
• /
• pp.619-625
• /
• 2019

In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank-one constraint is generated inevitably and relaxed via semidefinite relaxation. If the solution to the relaxed SDP problem is not of rank one, then conventional SDP-based array pattern synthesis approaches fail to obtain optimal solutions because the additional rank-one constraint is not handled appropriately. To overcome this drawback, we adopted a bisection technique combined with a penalty function method. Numerical applications are presented to demonstrate the validity of the proposed scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.551-556
• /
• 1991

This paper deal with the solution of kinematics and inverse kinematics of industrial FANUC robot by the bisection method with IBM PC 386. The inverse kinematics of FANUC robot cannot be solved by the algebraical method, because arm matrix T$_{6}$ is very complex and 6-joint angles are associated with the position and the approach of end-effector. Instead we found other 5-joint angle by an algebraical method after finding .theta.$_{4}$ value by a bisection method.d.

• Journal of Embryo Transfer
• /
• v.12 no.2
• /
• pp.151-159
• /
• 1997

In vitro fertilization(IVF) derived morula and blastocyst embryos were bisected by a simple method and cultured in vitro without zona pellucida And also bisected embryos were frozen-thawed and cultured in vitro) to evaluate the survival rate. The results obtained were as follows : The average number of grade I or II immature follicular oocytes recovered by slicing method per ovary was 11.9 from 142 ovaries. Following in vitro fertilization, the rates of cleavage and in vitro development to morula and blatocyst were 61.7 and 32.2% respectively. The successful bisection rate of IVE embryos was 67.51%, and the embryos of blastocyst stage were bisected successfully at significantly(P

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.1
• /
• pp.1-21
• /
• 2015

This paper presents two algorithms based on the Jamshidian equation which is from the Black-Scholes partial differential equation. The first algorithm is for American call options and the second one is for American put options. They compute numerically free boundary and then option price, iteratively, because the free boundary and the option price are coupled implicitly. By the upwind finite-difference scheme, we discretize the Jamshidian equation with respect to asset variable s and set up a linear system whose solution is an approximation to the option value. Using the property that the coefficient matrix of this linear system is an M-matrix, we prove several theorems in order to formulate a bisection method, which generates a sequence of intervals converging to the fixed interval containing the free boundary value with error bound h. These algorithms have the accuracy of O(k + h), where k and h are step sizes of variables t and s, respectively. We prove that they are unconditionally stable. We applied our algorithms for a series of numerical experiments and compared them with other algorithms. Our algorithms are efficient and applicable to options with such constraints as r > d, $r{\leq}d$, long-time or short-time maturity T.

• Korean Journal of Animal Reproduction
• /
• v.21 no.3
• /
• pp.275-280
• /
• 1997

This study was carried out to investigate on the survival and in vitro developmental rates of bisected bovine embryos by microblade, micropipette and pronase methods. Bisected embryos cultured for 1∼7 days in TCM-199 media with 10 FCS＋hormones. Survival and in vitro developmental rates was defined on in vitro culture or FDA-test. The results are summarized as follows ; 1. The survival and in vitro developmental rates of bisected bovine embryos by microblade, micropipette and pronase methods were 22.2, 16.7, 15.0% and 22.2, 23.3, 18.8%, respectively. In vitro developmental rate of bisected bovine embryos was significantly lower than that of non-bisection embryos(27.8% and 25.0%). 2. In vitro developmental rates of bovine embryos bisected for 1, 2, 4, 8, 16 cells stages during in vitro culture in 10% FCS＋TCM-199 media were 25.0, 20.0, 20.0, 15.0 and 6.7%, respectively. 3. In vitro developmental rates of intact and free-zona pellucida of bisected demi-embryos during in vitro culture in 10% FCS＋TCM-199 media were 25.6, 16.7%, respectively. 4. In vitro developmental rates of biopsied embryos and biopsied blastomeres during in vitro culture in 10% FCS＋TCM-199 media were 20.0, 11.1%, respectively.

• Korean Journal of Animal Reproduction
• /
• v.13 no.3
• /
• pp.164-170
• /
• 1989

These experiments were carried out to develop the practical technique for the production of identical twins in cattle. Morula and blastocyst stage embryos collected from superovulated donors were bisected into halves by micromanipulation. The resulting demi-embryos were transferred to the uterine horn ipsilateral to the corpus luteum of synchronous recipients. The viability of demi-embryos after splitting was also evaluated by culturing demi-embryos with and without a zona-pellucida. The results obtained in these experiments were summarized as follows : 1. Of total 132 embryos collected by superovulation from 29 donors, 37 embryos were morular and 30 at blastocyst stages. 2. Total 111 demi-embryos were produced from 67 embryos by bisection and 98% of those were normal in morphology. 3. The viability of the demi-embryos cultured with zona-pellucida ranged from 70 to 76.5% and that of the demi-embryos without from 53.8 to 69.2%. 4. The viability of demi-embryos obtained from morula was 63.6% and that of demi-embryos from blastocyst was 73.3%, respectively. 5. 35 demi-embryos were transferred to 21 recipients, 7 of which were confirmed to be pregnant by rectal palpation at 55∼60 days after embryo transfer. One of them produced a calf and 6 are still on pregnancy.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.499-506
• /
• 2005

Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.108-113
• /
• 1998

By using an equivalent network based on Floquet's theorem and bisection principle, the optical properties of planar DFB guiding structure are evaluated. The optical parameters, such as Bragg condition and the reflectivity as a function of grating period, are numerically calculated. The numerical results reveal that this method offers a simple and convenient algorithm to analyze the optical characteristics of DFB configurations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.263-272
• /
• 2008

We propose and analyze a new interconnection network, called petersen-torus(PT) network based on well-known petersen graph. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same number of nodes. In this paper, we propose optimal routing algorithm and hamiltonian cycle algorithm. We derive diameter, network cost and bisection width.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.444-448
• /
• 2010

RCR network[1] is a topology for interconnection networks having many desirable properties for building scalable parallel machines. This had been analyzed by Hu and Cao[2] to deal with problems of disconnected graph, bisection width and diameter. We analyze some properties of RCR again and revise the condition for connected graph and network diameter. And we present an efficient algorithm for finding next node on a shortest path.