• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.387-419
• /
• 2019

A fullness conjecture of Kuznetsov says that if a smooth projective variety X admits a full exceptional collection of line bundles of length l, then any exceptional collection of line bundles of length l is full. In this paper, we show that this conjecture holds for X as the blow-up of ${\mathbb{P}}^3$ at a point, a line, or a twisted cubic curve, i.e., any exceptional collection of line bundles of length 6 on X is full. Moreover, we obtain an explicit classification of full exceptional collections of line bundles on such X.

• IE interfaces
• /
• v.12 no.1
• /
• pp.10-18
• /
• 1999

Job shop manufacturing environments are using the concept of cellular manufacturing systems(CMS) which has several advantages in reducing production lead times, setup times, work-in-process, etc. Utilizing the similarities between cell-machine, part-machine, and the shape/size of parts, CMS can group machines and parts resulting in improved efficiency of this system. However, when grouping machines and parts in machine cells, there inevitably occurs exceptional elements(EEs), which can not operate in the same machine cell. Minimizing these EEs in CMS is a critical point that improving production efficiency. Constraints in machine duplication cost, machining process technology, machining capability, and factory space limitations are main problems that prevent achiving the goal of maintaining an ideal CMS environment. This paper presents an algorithm that minimizes EEs under the constraints of machine duplication cost and factory space limitation. Developing exceptional operation similarity(EOS) by cell-machine incidence matrix and part-machine incidence matrix, it brings the machine cells that operate the parts or not. A mathematical model to minimize machine duplication is developed by EOS, followed by a heuristic algorithm in order to reflect dynamic situation resulting from minimizing exceptional elements process and the mathematical model. A numerical example is provided to illustrate the algorithm.

• MALSORI
• /
• no.57
• /
• pp.123-137
• /
• 2006

This paper aims to propose a method of detecting irregular pronunciations for Korean POI data adopting the notion of the Prosodic Word based on the Prosodic Phonology (Selkirk 1984, Nespor and Vogel 1986) and Intonational Phonology (Jun 1996). In order to show the performance of the proposed method, the detection experiment was conducted on the 250,000 POI data. When all the data were trained, 99.99% of the exceptional prosodic words were detected, which shows the stability of the system. The results show that similar ratio of exceptional prosodic words (22.4% on average) were detected on each stage where a certain amount of the training data were added. Being intended to be an example of an interdisciplinary study of linguistics and computer science, this study will, on the one hand, provide an understanding of Korean language from the phonological point of view, and, on the other hand, enable a systematic development of a multiple pronunciation lexicon for Korean TTS or ASR systems of high performance.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.10a
• /
• pp.44-45
• /
• 2009

• Proceedings of the Polymer Society of Korea Conference
• /
• 2006.10a
• /
• pp.144-145
• /
• 2006

It is well known that the aromatic polycarbonate of bisphenol A (hereafter BPA polycarbonate) possesses superior transparency, exceptional toughness, high heat resistance and mechanical properties, which allow it to be diversely used for automotive, electrical, electronic, appliance and optical industries. In this paper, polycarbonate is reviewed on not only prospects of technology but market trend from the industrial point of view. It also demonstrates the diverse applications of polycarbonates with respect to its development history.

• Korean Journal of Human Ecology
• /
• v.15 no.1
• /
• pp.107-128
• /
• 2006

The purposes of this study are to explore the consumption expenditure and consumption-cultural meaning in the process of marriage and to provide consumer education programs for premarital couples. For the purpose, this study uses a qualitative analysis including an in-depth interview and a participant observation. Major findings are as follows: Consumers preparing for their marriage experienced quite a different consumption context, which should be said an exceptional practice from the economic point of view. As the agency businesses for marriage becomes one of the fast growing industries, the marriage of Korea is now under the rule of popular consumption culture. Thus, the exceptional consumption abuse during a marriage process brings about the imbalance in consumers' daily life after wedding ceremony. In this point of view, we can see the importance of consumer education programs for the marriage process. The latter half of this study is devoted to propose the desirable model of the consumer education program for premarital couples.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.955-964
• /
• 2015

Let K be a number field and let S be a finite set of primes of K containing all the infinite ones. Let ${\alpha}_0{\in}{\mathbb{A}}^1(K){\subset}{\mathbb{P}}^1(K)$ and let ${\Gamma}_0$ be the set of the images of ${\alpha}_0$ under especially all Chebyshev morphisms. Then for any ${\alpha}{\in}{\mathbb{A}}^1(K)$, we show that there are only a finite number of elements in ${\Gamma}_0$ which are S-integral on ${\mathbb{P}}^1$ relative to (${\alpha}$). In the light of a theorem of Silverman we also propose a conjecture on the finiteness of integral points on an arbitrary dynamical system on ${\mathbb{P}}^1$, which generalizes the above finiteness result for Chebyshev morphisms.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.385-390
• /
• 1996

Let X be a smooth projective threefold whose anticanonical division $-K_X$ is ample, i.e., Fano threefold. In this paper, we studied the linear system $$\mid$-nK_X$\mid$$ for a positive integer n. In Theorem 4, we studied the cases that $\-nK_X$\mid$$ has no base-points and the cases that $$\mid$-nK_X$\mid$$ generate the birational map. In Proposition 5, we studied the possible exceptional cases given in Theorem 4. Some results in this paper are already known, but we have gave brief proofs for those results.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.