• Journal of Korean Society for Quality Management
• /
• v.32 no.2
• /
• pp.191-200
• /
• 2004

Using the p chart is not adequate in case that there are lots of data and it is difficult to divide into products conforming or nonconforming because of obscurity of binary classification. So we need to design a new control chart which represents obscure situation efficiently. This study deals with the method to performing arithmetic operation representing fuzzy data into fuzzy set by applying fuzzy set theory and designs a new control chart taking account of a concept of classification on the term set and membership function associated with term set.

• Journal of the Korean housing association
• /
• v.3 no.1
• /
• pp.69-84
• /
• 1992

This study is a trial to syustematize the types of Minga(house of the lower class) that is distributed in the whole Korean penninsula. It is thought that, it can be systematised by using the method of five step' assortment shich is able to divide the types of Minga. Five steps are as follows: 1. The system of appearance and evolution of floor 2. The system of forms 3. Areal distribution of forms 4. State of gathering of living spaces 5. Variety of forms

• Proceedings of the Korea Concrete Institute Conference
• /
• 2006.05b
• /
• pp.429-432
• /
• 2006

The shrinkage mechanism of high strength concrete is different from that of normal concrete. The shrinkage of normal concrete is subjected to evaporate moisture in concrete, but most shrinkage in high strength concrete is caused by chemical reaction. To analyze shrinkage of concrete exactly, it is necessary to divide drying shrinkage with autogenous shrinkage in terms of degree of hydration, especially in concrete with low W/C ratio. The proposed method can provide a rational basis for prediction of shrinkage in high strength concrete structure.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.132.3-132
• /
• 2001

In this paper, we focus on the analysis of the scheduling problem in FMS after slicing off some sub-nets using the transitive matrix. This class of Time Petri nets is obtained by merging subnets based on the machine's operations. We can divide original system into some subnets based on machine's operations using Time Petri nets slice and analyze the feasibility time in each schedules. In this paper, we show the usefulness of transitive matrix to slice off some subnets from the original net, and explain on an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.117.1-117
• /
• 2001

A motion handling technique that transforms existing animation motion data to a mathematically well-defined form. The transformed data can be utilized in any kind of autonomous motion creation process that handles such cases as changed environment, structure (kinematic / dynamic) modification, or changed constraints. To overcome the computational burden of traditional spacetime optimization, we divide full motion data frame into several parts, and we applied the transformation technique to each part using an optimizing tool(CFSQP). To show Ire feasibility of the proposed method, a comparison study results with traditional technique is included.

• International journal of advanced smart convergence
• /
• v.7 no.2
• /
• pp.1-6
• /
• 2018

In this paper, we propose an automatic left ventricle segmentation method in computed tomography angiography (CTA) using separating energy function. First, we smooth the images by applying anisotropic diffusion filter to remove noise. Secondly, the volume of interest (VOI) is detected by using k-means clustering. Thirdly, we divide the left and right heart with split energy function. Finally, we extract only left ventricle from left and right heart with optimizing cost function including orientation term.

• Journal of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1213-1222
• /
• 2013

This paper deals with sufficiency conditions for irreducibility of certain induced modules. We also construct irreducible representations for a group G over a field $\mathbb{K}$ where the group G is a semidirect product of a normal abelian subgroup N and a subgroup H. The main results are proved with the assumption that char $\mathbb{K}$ does not divide |G| but there is no assumption made of $\mathbb{K}$ being algebraically closed.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.665-668
• /
• 2000

In this paper, we are focused on the analysis of Petri nets model using the subnet. Specially, we are proposes a divide-conquer method of Petri nets under the condition of one-boundedness for all the Petri nets. The usefulness of the approach is shown by applying the proposed techniques to a illustration model.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.1-6
• /
• 1999

In this paper We propose the new lossless compression method which use Huffman Coding using the preprocessing to compress the still image. The proposed methode divide into two parts according to activity of the image. If activities are high, the original Huffman Coding method was used directly. IF activities are low, the nibble run-length coding and the bit dividing method was used. The experimental results show that compression rate of the proposed method was better than the general Huffman Coding method.

• Transactions of Materials Processing
• /
• v.9 no.3
• /
• pp.274-283
• /
• 2000

A dynamic explicit finite element code for simulating sheet forming processes has been developed. The code utilizes the discrete Kirchhoff shell element and contact force is treated by a conventional penalty method. In order to reduce the computational cost, a new and robust contact searching algorithm has been developed and implemented into the code. In the method, a hierarchical structure of tool segments is built for each tool at the initial stage of the analysis. hierarchical structure is built in a way to divide a box to 8 sub-boxes, 2 in each direction, until the lowest level of the hierarchical structure contains exactly one segment of the tool or empty. Then at each time step, contact is checked from the box to sub-boxes hierarchically for each node. Comparisons of computational results of various examples with the existing ones show the validity of the method.