• Nuclear Engineering and Technology
• /
• v.24 no.1
• /
• pp.14-29
• /
• 1992

COMCAF, a computer code for the common-cause failure analysis, is developed to treat the common-cause failures in nuclear power plants. In the treatment of common-cause failures, the minimal cut sets of the system are obtained first without changing the fault-tree structure. The occurrence probabilities of the minimal cut sets are then calculated accounting for the common-cause failures among components in the same minimal cut set or in different minimal cut sets. The basic parameter model is used to model the common-cause failures between similar or identical components. For dissimilar components, the assumption of symmetry used in the basic parameter model is applied to the basic events affecting two or more components. The top event probability is evaluated using the inclusion-exclusion method. In addition to the common-cause failures of components in the same minimal cut sets, failures of components in the different minimal cut sets are also easily accounted for by this method. This study applied this common-cause failure analysis to the PWR auxiliary feedwater system. The results in the top event probability for the system are compared with those of no common-cause failures.

• Journal of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.1-12
• /
• 2022

We introduce the notion of a minimal synchronizing word; that is a synchronizing word whose proper subwords are not synchronized. This has been used to give a new shorter proof for a theorem in [6]. Also, the common synchronized components of a subshift and its derived set have been characterized.

• Journal of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.289-297
• /
• 2010

By using as main tool the theory of prime submodules this article is devoted to describing the structure of the minimal prime ideals of the equidimensional symmetric algebra of a finitely generated module.

• Journal of the Korean Society of Safety
• /
• v.32 no.1
• /
• pp.41-46
• /
• 2017

In this paper, from making an electrical fire which is thought to be the most damaging among potential dangers as a top event, minimal cut sets (MCS) about it were analyzed. For this, components of a power substation were classified into 15 items. Failure rates and modes were extracted based on Korea Electrical Safety Corporation, IEEE Gold Book, and RAC. To analyze the top event (an electrical fire), main events were assorted into "safety devices for overcurrent" and "ampere meter of detecter". Failure of components was divided into failure of VCB, COS, and MCCB. A fault tree was composed of 3 AND gate, 5 OR gates and 17 basic events. Overlapped events among the basic events are things which occur from relevant components. They were attached to the tree by distinguishing identifiers. In case of FT, two minimal cut sets of "IO_METER", "MF_METER", "DO_MCCB" and "IO_METER", "MF_METER", "DO_VCB" take 46% of electrical fires. Therefore, about basic events which are included in the top two minimum cut sets, strict control is necessary.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.1
• /
• pp.27-32
• /
• 2009

A technical system generally comprise a number of subsystems and components that are interconnected in such a way that the system is able to perform a set of required function. Because of the complex system structure with serial, parallel and bridged connections, some certain subsystems or components are more critical than the others. The main concern of a reliability engineer is to identify potential failures and to prevent these failures from occurring. In order to prevent fatal failures, proper inspections and maintenance actions for each component are required Considering above objectives of reliability engineers and characteristics of a practical system, several practical method for evaluating system and component reliabilities have developed namely Birnbaum's and Fussell & Vesely's measures. However there are several critical weaknesses in traditional calculation process as the target system gets larger. In this paper, a new technique for calculating component's structural importance is proposed and compared to Birnbaum's with representative system examples (serial, parallel. k out of n, and bridge type).

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.18 no.1
• /
• pp.19-29
• /
• 2020

This paper gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. Formal arguments are given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.637-640
• /
• 2011

A novel bumping material, which is composed of a resin and Sn3Ag0.5Cu (SAC305) solder power, has been developed for the maskless solder-on-pad technology of the fine-pitch flip-chip bonding. The functions of the resin are carrying solder powder and deoxidizing the oxide layer on the solder power for the bumping on the pad on the substrate. At the same time, it was designed to have minimal chemical reactions within the resin so that the cleaning process after the bumping on the pad can be achieved. With this material, the solder bump array was successfully formed with pitch of 150 ${\mu}m$ in one direction.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1173-1246
• /
• 2019

We find all P-resolutions of quotient surface singularities (especially, tetrahedral, octahedral, and icosahedral singularities) together with their dual graphs, which reproduces (a corrected version of) Jan Steven's list [Manuscripta Math. 1993] of the numbers of P-resolutions of each singularities. We then compute the dimensions and Milnor numbers of the corresponding irreducible components of the reduced base spaces of versal deformations of each singularities. Furthermore we realize Milnor fibers as complements of certain divisors (depending only on the singularities) in rational surfaces via the semi-stable minimal model program for 3-folds. Then we compare Milnor fibers with minimal symplectic fillings, where the latter are classified by Bhupal and Ono [Nagoya Math. J. 2012]. As an application, we show that there are 6 pairs of entries in the list of Bhupal and Ono [Nagoya Math. J. 2012] such that two entries in each pairs represent diffeomorphic minimal symplectic fillings.

• Research in Mathematical Education
• /
• v.15 no.4
• /
• pp.327-340
• /
• 2011

In this paper we propose an inquiry task on the subject of congruent triangles. The task deals with conditions that are sufficient for congruency, and conditions that are insufficient. The aim of the task is to find the minimal number of identical components in two triangles that is sufficient to ensure congruency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.