• 대한수학회논문집
• /
• 제12권3호
• /
• pp.513-519
• /
• 1997

We show that each orthomodular lattice containing only atomic nonpath-connected blocks is a full subalgebra of an irreducible path-connected orthomodular lattice and there is a path-connected orthomodualr lattice L containing a weakly path-connected full subalgebra C(x) for some element x in L.

• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.155-163
• /
• 2021

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.

• 대한수학회논문집
• /
• 제10권2호
• /
• pp.285-292
• /
• 1995

Some nonpath-connected orthomodular lattices are given : Every infinite direct product of othomodular lattices containing infinitely many non-Boolean factors is a nonpath-connected orthomodular lattice. The orthomodular lattice of all closed subspaces of an infinite dimensional Hilbert space is a nonpath-connected orthomodular lattice.

• Korean Journal of Mathematics
• /
• 제29권2호
• /
• pp.355-360
• /
• 2021

In this paper, we introduce the definition of sequentially g-connected components and sequentially locally g-connected by using sequentially g-closed sets. Moreover, we investigate some characterization of sequentially g-connected components and sequentially locally g-connected.

• Annals of Fuzzy Mathematics and Informatics
• /
• 제16권3호
• /
• pp.301-316
• /
• 2018

In this paper, the concept of connected geodesic number, $gn_c(G)$, of a fuzzy graph G is introduced and its limiting bounds are identified. It is proved that all extreme nodes of G and all cut-nodes of the underlying crisp graph $G^*$ belong to every connected geodesic cover of G. The connected geodesic number of complete fuzzy graphs, fuzzy cycles, fuzzy trees and of complete bipartite fuzzy graphs are obtained. It is proved that for any pair k, n of integers with $3{\leq}k{\leq}n$, there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) on n nodes such that $gn_c(G)=k$. Also, for any positive integers $2{\leq}a<b{\leq}c$, it is proved that there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) such that the geodesic number gn(G) = a and the connected geodesic number $gn_c(G)=b$.

• 전력전자학회논문지
• /
• 제14권1호
• /
• pp.1-7
• /
• 2009

삼상 계통 연계 인버터에서 LCL 필터를 연결시키는 두 가지 방법이 존재한다. 하나는 일반적으로 사용하는 Y-결선 LCL 필터가 있고 다른 형태로 $\Delta$-결선 LCL 필터가 있다. Y-결선 LCL 필터를 사용하는 시스템의 모델은 계산되어 있는 반면에, $\Delta$-결선 LCL 필터를 사용하는 시스템의 모델은 공식화되어져 있지 않다. 그리하여 $\Delta$-결선 LCL 필터를 사용하는 시스템의 수학적인 모델을 제안한다. 또한 Y-결선 LCL 필터와 $\Delta$-결선 LCL 필터 각각의 커패시터에 흐르는 전류 고조파에 대한 비교를 포함한다. $\Delta$-결선 LCL 필터를 사용하는 시스템이 계통전류를 제어하는데 더 유리함을 실험을 통해 입증한다.

• Journal of Information Processing Systems
• /
• 제20권2호
• /
• pp.173-184
• /
• 2024

The connected car services are one of the most widely used services in the Internet of Things environment, and they provide numerous services to existing vehicles by connecting them through networks inside and outside the vehicle. However, although vehicle manufacturers are developing services considering the means to secure the connected car services, concerns about the security of the connected car services are growing due to the increasing number of attack cases. In this study, we reviewed the research related to the connected car services that have been announced so far, and we identified the threats that may exist in the connected car services through security threat modeling to improve the fundamental security level of the connected car services. As a result of performing the test to the applications for connected car services developed by four manufacturers, we found that all four companies' applications excessively requested unnecessary permissions for application operation, and the apps did not obfuscate the source code. Additionally, we found that there were still vulnerabilities in application items such as exposing error messages and debugging information.

• 대한수학회지
• /
• 제36권6호
• /
• pp.1047-1059
• /
• 1999

Let $C(X)(C_{K}(X))$ denote the hyperspace of all nonempty closed connected subsets (subcontinua) of a locally compact Haus-dorff space X with the Fell topology. We prove that the following statements are equivalent: (1) X is locally connected. (2) C(X) is locally connected,. (3) C(X) is locally connected at each $E{\in}C_{k}(X).(4) C_{k}(X)$ is locally connected.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제20권1호
• /
• pp.71-78
• /
• 2013

Let X be a space and $2^X$(C(X);K(X);$C_K$(X)) denote the hyperspace of nonempty closed subsets(connected closed subsets, compact subsets, subcontinua) of X with the Vietoris topology. We investigate the relationships between the space X and its hyperspaces concerning the properties of connectedness im kleinen. We obtained the following : Let X be a locally compact Hausdorff space. Let $x{\in}X$. Then the following statements are equivalent: (1) X is connected im kleinen at $x$. (2) $2^X$ is arcwise connected im kleinen at {$x$}. (3) K(X) is arcwise connected im kleinen at {$x$}. (4) $C_K$(X) is arcwise connected im kleinen at {$x$}. (5) C(X) is arcwise connected im kleinen at {$x$}.

• 한국IT서비스학회지
• /
• 제11권2호
• /
• pp.131-146
• /
• 2012

The purpose of this research is two-fold : (1) we propose the paradigm to construct a connected information society according to a judgment where a coming information society will evolve into highly-connected information society having "seamlessness" as a keyword, and (2) we draw guidelines to construct infrastructures and establish systems and business models of highly-connected information society based on suggested paradigm. To achieve this, this research conducts the followings. First, we suggest reasons why a coming information society can be appropriate to be considered as highly-connected information society by examining two perspectives on the coming information society. Second, we explain the definition and characteristics of highly-connected information society and propose the SPB paradigm. Third, we analyze the utility of SPB paradigm by evaluating practices. Finally, we suggest four strategies to construct highly-connected information society based on advanced research findings and future research directions.