• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.157-163
• /
• 1995

This paper presents an algorithm to deternine the tool path height for rough machining of sculptured surface. To minimize rough machining of sculptured surface, it is necessary to determine the tool path heights of contour planes. the proposed algorithm searches for the height at which maximum metal removal rate is obtained. This bisection method is accomplished until all shoulder heights are within roughing tolerance. The machining experiment demonstrates the superiority of the algorithm presented in this thesis.

• Journal of Embryo Transfer
• /
• v.12 no.1
• /
• pp.21-27
• /
• 1997

The studies were carried out to investigate the effects of bisection method and with and without-zona pellucida of embryos on in vitro developmental rate bisected embryos by micromanipulator, micropipette and pipetting. The ovaries were obtained from slaughtered Korean native cows. The follicular oocytes were cultured in TCM-199 mediurn containing 10 IU /ml의 PMSG(Sigma, USA), 10 IU /ml의 hCG, 1$\mu$g /ml의 $\beta$-estradiol(Sigma, USA) and 10% FCS for 24~48 hrs in incubator with 5% $CO_2$ in air at 38.5$^{\circ}C$ and then, matured oocytes were again cultured for 12~ 18 hrs with motile capacitated sperm by preincubation of heparin. Bisected embryos cultured for 1~5 days in 20% FCS + TCM-199 medium. Survival rate was defined as developmental rate on in vitro culture or FDA-test. The results are summarized as follows :1. The survival rates of bisected bovine embryos by micromanipulator and micropipett were 29.2% and 19.1%, respectively. The rates of non-bisection embryos(46.7%) were significantly higher than those of bisection embryos. 2. The in vitro developmental rates of bisected bovine embryos by micromanipulator, micropipett and pipetting method were 32.4%, 19.4% and 25.6%, respectively.3. The in vitro developmental rates of with and without-zona pellucida of bisected bovine embryos by raicromanipulator were 30.8% and 25.0%, respectively. The rates of nonbisection embryos(53.1%) were significantly higher than those of bisection embryos.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.9
• /
• pp.921-927
• /
• 1990

This paper presents a mesh refinement scheme for 3-D adaptive finite element method. Firstly, the refinement of triangular meshes based on the bisection of triangles is discussed. And a new method to refine tetrahedral meshes employing the bisection method is presented. In two dimensional cases, it has been noted that all angles in the triangular meshes refined by the bisection method are greater than or equal to half the smallest angle in the original meshes. Through the examples where the newly proposed method is applied to three dimensional cases, it is shown that regarding the solid angles, the method gives nearly the same result as that in the two dimensional case. Accordingly, it can be concluded that the proposed method will be useful in the mesh refinements for 3-D adaptive finite element method.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2162-2176
• /
• 2018

Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• 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.

• Geomechanics and Engineering
• /
• v.22 no.1
• /
• pp.35-48
• /
• 2020

This paper provides methods for the deterministic and reliability-based design of the support pressures necessary to prevent tunnel face collapse. The deterministic method is developed by extending the use of the unique load multiplier, which is embedded within OptumG2/G3 with the intention of determining the maximum load that can be supported by a system. Both two-dimensional and three-dimensional examples are presented to illustrate the applications. The obtained solutions are validated according to those derived from the existing methods. The reliability-based method is developed by incorporating the Response Surface Method and the advanced first-order second-moment reliability method into the bisection algorithm, which continuously updates the support pressure within previously determined brackets until the difference between the computed reliability index and the user-defined value is less than a specified tolerance. Two-dimensional reliability-based support pressure is compared and validated via Monte Carlo simulations, whereas the three-dimensional solution is compared with the relationship between the support pressure and the resulting reliability index provided in the existing literature. Finally, a parametric study is carried out to investigate the influences of factors on the required support pressure.