• Korean Journal of Mathematics
• /
• 제10권1호
• /
• pp.45-51
• /
• 2002

Observing that a realcompactification Y of a space X is Wallman if and only if for any non-empty zero-set Z in Y, $Z{\cap}Y{\neq}{\emptyset}$, we will show that for any pseudo-Lindel$\ddot{o}$f space X, the minimal quasi-F $QF({\upsilon}X)$ of ${\upsilon}X$ is Wallman and that if X is weakly Lindel$\ddot{o}$, then $QF({\upsilon}X)={\upsilon}QF(X)$.

• 대한수학회보
• /
• 제47권5호
• /
• pp.951-960
• /
• 2010

We provide the set of left-invariant minimal unit vector fields on the semi-direct product $\mathbb{R}^n\;{\rtimes}_p\mathbb{R}$, where P is a nonsingular diagonal matrix and on the 7 classes of 4-dimensional solvable Lie groups of the form $\mathbb{R}^3\;{\rtimes}_p\mathbb{R}$ which are unimodular and of type (R).

• East Asian mathematical journal
• /
• 제40권3호
• /
• pp.287-293
• /
• 2024

For a nondegenerate irreducible projective variety, it is a classical problem to describe its defining equations and the syzygies among them. In this paper, we precisely determine a minimal generating set and the minimal free resolution of defining ideals of some rational curves of maximal genus in ℙ³.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.743-749
• /
• 2021

The purpose of this article is to study few properties of fuzzy mean open and fuzzy mean closed sets in fuzzy topological spaces. Further, the idea of fuzzy mean clopen set is introduced. It is observed that a fuzzy mean clopen set is both fuzzy mean open and fuzzy mean closed but the converse is not true.

• 대한수학회보
• /
• 제52권3호
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• 대한안전경영과학회지
• /
• 제14권1호
• /
• pp.225-233
• /
• 2012

The research discusses interrelationship of structural and reliability importance measures which used in the probabilistic safety assessment. The most frequently used component importance measures, such as Birnbaum's Importance (BI), Risk Reduction (RR), Risk Reduction Worth (RRW), RA (Risk Achievement), Risk Achievement Worth (RAW), Fussel Vesely (FV) and Critically Importance (CI) can be derived from two structure importance measures that are developed based on the size and the number of Minimal Path Set (MPS) and Minimal Cut Set (MCS). In order to show an effectiveness of importance measures which is developed in this paper, the three representative functional structures, such as series-parallel, k out of n and bridge are used to compare with Birnbaum's Importance measure. In addition, the study presents the implementation examples of Total Productive Maintenance (TPM) metrics and alternating renewal process models with exponential distribution to calculate the availability and unavailability of component facility for improving system performances. System state structure functions in terms of component states can be converted into the system availability (unavailability) functions by substituting the component reliabilities (unavailabilities) for the component states. The applicable examples are presented in order to help the understanding of practitioners.

• 한국안전학회지
• /
• 제3권2호
• /
• pp.5-16
• /
• 1988

This study is conducted to evaluate the explosion of tolune storage tank in the petrochemical plant by Fault Tree Analysis. The conclusions are as follows; 1) Fault Tree diagram and the required computer program for evaluation of explosion accident is developed. 2) The probability of the top event, explosion accident, is $1.5\;{\times}\;10^{-8}$ per year, so there is almost no possibility of explosion during the life cycle of tank. However, the probability of Gate 6 and Gate 7 is 8.8 per month, therefore, attention should be paid to them for accident prevention. 3) The number of minimal cut sets is 67 sets which are not calculated the probability of each set, because of the lack of computer capacity. All the minimal cut sets should be examined case by case. However, it is necessary to be paid attention to COM1, 126, 131, and COM4 in minimal cut sets, because the number of appearance is so high. 4) The number path sets is 70 sets which are not calculated the probability of each set, because of the lack of computer capacity. It is very useful to prepare safety checklist by using this minimal path sets. Also, the events which appear many times, 123, COM5, 139, 127 and 128, are very high in reliability.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제23권4호
• /
• pp.377-383
• /
• 2016

The set of priors in the representation of coherent risk measure is expressed in terms of quantile function and increasing concave function. We show that the set of prior, $\mathcal{Q}_c$ in (1.2) is equal to the set of $\mathcal{Q}_m$ in (1.6), as maximal representing set $\mathcal{Q}_{max}$ defined in (1.7).

• 대한수학회보
• /
• 제54권3호
• /
• pp.875-894
• /
• 2017

Let $[n]=\{1,2,{\ldots},n\}$. A set ${\mathbf{A}}=\{A_1,A_2,{\ldots},A_l\}$ is a minimal cover of [n] if ${\cup}_{1{\leq}i{\leq}l}A_i=[n]$ and $$\bigcup_{{1{\leq}i{\leq}l,}\\{i{\neq}j_0}}A_i{\neq}[n]\text{ for all }j_0{\in}[l]$$. Let ${\mathcal{C}}(n)$ denote the collection of all minimal covers of [n], and write $C_n={\mid}{\mathcal{C}}(n){\mid}$. Let ${\mathbf{A}}{\in}{\mathcal{C}}(n)$. An element $u{\in}[n]$ is critical in ${\mathbf{A}}$ if it appears exactly once in ${\mathbf{A}}$. Two minimal covers ${\mathbf{A}},{\mathbf{B}}{\in}{\mathcal{C}}(n)$ are said to be restricted t-intersecting if they share at least t sets each containing an element which is critical in both ${\mathbf{A}}$ and ${\mathbf{B}}$. A family ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is said to be restricted t-intersecting if every pair of distinct elements in ${\mathcal{A}}$ are restricted t-intersecting. In this paper, we prove that there exists a constant $n_0=n_0(t)$ depending on t, such that for all $n{\geq}n_0$, if ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is restricted t-intersecting, then ${\mid}{\mathcal{A}}{\mid}{\leq}{\mathcal{C}}_{n-t}$. Moreover, the bound is attained if and only if ${\mathcal{A}}$ is isomorphic to the family ${\mathcal{D}}_0(t)$ consisting of all minimal covers which contain the singleton parts $\{1\},{\ldots},\{t\}$. A similar result also holds for restricted r-cross intersecting families of minimal covers.

• 전기학회논문지P
• /
• 제58권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).