• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1119-1133
• /
• 2020

In this paper, we derive an upper bound for the distance from a point in the immediate basin of a root of a complex polynomial to the root itself. We establish that if z is a point in the immediate basin of a root α of a polynomial p of degree d ≥ 12, then ${\mid}z-{\alpha}{\mid}{\leq}{\frac{3}{\sqrt{d}}\(6{\sqrt{310}}/35\)^d{\mid}N_p(z)-z{\mid}$, where N_p is the Newton map induced by p. This bound leads to a new bound of the expected total number of iterations of Newton's method required to reach all roots of every polynomial p within a given precision, where p is normalized so that its roots are in the unit disk.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.51
• /
• pp.55-78
• /
• 2011

This paper has derived some problems relating to the use of letters of intent which are common occurrence in the international contracts after considering its nature and legal issues. As reviewed before, some problems may occur when a party has documented a stage in the negotiations by letters of intent. Such documents may well explicitly spell out if, and to what extent, the parties should be bound by what they have already agreed or to carry on negotiations in order to reach the final contract. But if the documents are silent, some problems would arise. Contracting parties are therefore well advised to spell out if, and to what extent, they should be bound by such preliminary agreements. Here again, it might be prudent to explicitly set forth that the parties should not be bound until there is a final written contract signed by authorized representatives of the parties but that they shall abstain from such measures which may defeat their stated objective to reach final agreement, for example, by diminishing the value of performance under the contemplated contract.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.138-141
• /
• 2006

This paper considers a two-machine flow-shop scheduling problem for minimizing mean flow time. Each job has three non-preemptive operations, where the first and third operations must be Processed on the first and second machines, respectively, but the second operation can be processed on either machine. A lower bound based on SPT rule is derived, which is then used to develop a branch-and-bound algorithm. Also, an efficient simple heuristic algorithm is developed to generate a near-optimal schedule. Numerical experiments are performed to evaluate the performances of the proposed branch-and-bound and the heuristic algorithm

• Journal of the Korean Magnetic Resonance Society
• /
• v.15 no.2
• /
• pp.104-114
• /
• 2011

Rapid exchange and hydrolysis of the tubulin-bound guanine nucleotides have been known to govern the dynamics of microtubules. However, the instability and low concentration have made it difficult for the microtubule-bound GTP to be observed directly. In this study, we circumvent these problems by lyophilization and using cross-polarization techniques. $^{31}P$ NMR signals were detected from the tubulin-bound GTP in microtubules for the first time. Analysis of the $^{31}P$ CPMAS NMR spectrum indicates that GTP hydrolysis was delayed by the presence of taxol.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.933-943
• /
• 2020

Let M be a Fano manifold, and H^🟉(M; ℂ) be the quantum cohomology ring of M with the quantum product 🟉. For 𝜎 ∈ H^🟉(M; ℂ), denote by [𝜎] the quantum multiplication operator 𝜎🟉 on H^🟉(M; ℂ). It was conjectured several years ago [7,8] and has been proved for many Fano manifolds [1,2,10,14], including our cases, that the operator [c₁(M)] has a real valued eigenvalue 𝛿₀ which is maximal among eigenvalues of [c₁(M)]. Galkin's lower bound conjecture [6] states that for a Fano manifold M, 𝛿₀ ≥ dim M + 1, and the equality holds if and only if M is the projective space ℙⁿ. In this note, we show that Galkin's lower bound conjecture holds for Lagrangian and orthogonal Grassmannians, modulo some exceptions for the equality.

• Journal of the Korean Magnetic Resonance Society
• /
• v.16 no.1
• /
• pp.67-77
• /
• 2012

The small molecule binding to the c-Jun N-terminal kinase 3 (JNK3) was examined by the measurements of saturation transfer difference (STD) NMR experiments. The STD NMR experiment of ATP added to JNK3 clearly showed the binding of the nucleotide to the kinase. The STD NMR spectrum of dNTPs added to JNK3 discriminated the kinase-bound nucleotide from the unbound ones. After the five-fold addition of ATP to the dNTPs and JNK3 mixture, only signals of the cognate substrate of JNK3, ATP, were observed from the STD NMR experiment. These results signify that by the STD NMR the small molecules bound to JNK3 can be discriminated from the pool of the unbound molecules. Furthermore the binding mode of the small molecule to JNK3 can be determined by the competition experiments with ATP.

• Communications for Statistical Applications and Methods
• /
• v.6 no.2
• /
• pp.443-456
• /
• 1999

The estimation of mean lifetimes in presence of interval censoring with mixed replacement procedure are examined when the distribution s of lifetimes are exponential. it is assumed that due to physical restrictions and/or economic constraints the number of failures is investigated only at several inspection times during the lifetime test; thus there is interval censoring. Comparisons of mixed replacement designs are made with those with and without replacement The maximum likelihood estimator is found in an implicit form. The Cramer-Rao lower bound which is the asymptotic variance of the estimator is derived. The test conditions for minimizing the Cramer-Rao lower bound and minimizing the test costs within a desired width of the Cramer-Rao bound have been studied.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.188-193
• /
• 2009

본 논문은 조립과 분리시스템이 혼합된 Fork-and-Join 시스템에서의 일정계획문제를 고려하고 있다. 최초 단계에서는 구성품단위로 분리가 발생하고 두 번째 단계에서는 부품생산단계에서 각 부품 또는 구성품이 서로 다른 설비와 경로를 통해 독립적으로 생산된 후 최종 조립단계로 이동하게 되고, 그곳에서 조립공정을 통해 제품으로 완성된다. 본 논문에서는 이러한 Fork-and-Join 시스템에서 최종완료시간(makespan)을 최소화 할 수 있는 발견적 해법을 제안하고 이 해법의 최악오차한계(worst-case error bound)가 2라는 것을 증명한다. 또한, 제안된 문제의 효과적인 3가지 하한값(lower bound)을 제시하고 다양한 수치실험을 통해 제안된 발견적 해법의 결과와 하한값과의 비교를 통해 제안된 해법이 성능이 우수함을 증명한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.498-503
• /
• 1993

In this paper, a robust and reliable H$_{\infty}$ control problem is considered for linear uncertain systems with time-varying norm-bounded uncertainty in the state matrix, which performs well despite of actuator outages. Using linear static state feedback and the quadratic stabilization with H$_{\infty}$-norm bound, a robust and reliable H$_{\infty}$ controller is obtained that stabilizes the plant and guarantees an H$_{\infty}$-norm bound constraint on disturbance attenuation for all admissible uncertainties and normal state as well as faulty state of actuators. It provides a sufficient condition for robust and reliable stabilization with H$_{\infty}$-norm bound. Reliability is guaranteed provided actuator outages only occur within a prespecified subset of actuators.tors.