• The Pure and Applied Mathematics
• /
• v.18 no.2
• /
• pp.157-160
• /
• 2011

Main purpose of this note is to construct an example of a continuous one-to-one function f : ${\mathbb{Q}}^*{\rightarrow}{\mathbb{R}}$ whose inverse is nowhere continuous, and to show that the completeness is not necessary for the continuous inverse theorem.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.113-117
• /
• 2003

네트워크에서 보안 기능을 전개하는데 있어 정책 기반 전개 방법이 널리 사용되고 있다. 본 논문에서는 정책 기반 보안 기능 전개에 있어 정책을 설정하고 검증하기 위한 프레임을 제시한다 정책 기반 기능 전개에 있어 중요하고도 어려운 문제는 설정한 정책의 정확성(correctness)과 완전성(completeness)을 검증하는 것이지만 이에 관한 기존의 방법은 주로 경험이나 혹은 감시에 의한 끊임없는 정책 갱신이다. 본 연구에서는 기존의 제안된 여러 보안 모델들을 검토해보고 이 모델들로부터 공통적으로 적용할 수 있는 정책의 정확성과 완전성을 위한 제어 프레임을 설계한다.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2005.10a
• /
• pp.201-204
• /
• 2005

In this building, we never use the existing construction methods such as disassembly, destruction and newly construction to ensure the eco-friendly building and to decrease of waste disposal. We make customers feel newly by using minimum materials, pursuing the 'Best Design Using Lower Material' slogan and remodeling the building partially. The line is the most informal type one which is lack of intention. This line formation is harmonized with self-efficiency and completeness that are not required for unnecessary things, and simple unification which has not alternatives or obstacles.

• Proceedings of the KSPS conference
• /
• 2003.05a
• /
• pp.131-134
• /
• 2003

This paper describes an efficient algorithm to generate compact and complete prompts lists for connected spoken digits database. In building a connected spoken digit recognizer, we have to acquire speech data in various contexts. However, in many speech databases the lists are made by using random generators. We provide an efficient algorithm that can generate compact and complete lists of digits in various contexts. This paper includes the proof of optimality and completeness of the algorithm.

• Communications of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.237-251
• /
• 2011

In this paper, we determine some stability results concerning the 2-dimensional vector variable quadratic functional equation f(x+y, z+w) + f(x-y, z-w) = 2f(x, z) + 2f(y, w) in intuitionistic fuzzy normed spaces (IFNS). We dene the intuitionistic fuzzy continuity of the 2-dimensional vector variable quadratic mappings and prove that the existence of a solution for any approximately 2-dimensional vector variable quadratic mapping implies the completeness of IFNS.

• Journal of Chest Surgery
• /
• v.54 no.4
• /
• pp.258-262
• /
• 2021

Mediastinal lymph node dissection is an important part of lung cancer surgery that provides accurate nodal staging and may improve survival outcomes. The minimally invasive approach, such as video-assisted thoracic surgery (VATS) lobectomy for patients with non-small cell lung cancer, has become a standard operation worldwide. VATS mediastinal lymph node dissection should be thorough and accurate to ensure the completeness of lung cancer surgery. Herein, the author describes techniques for VATS mediastinal lymph node dissection.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.707-722
• /
• 2019

For any non-negative real number ${\epsilon}_0$, we shall introduce a concept of the ${\epsilon}_0$-Cauchy sequence in a normed linear space V and also introduce a concept of the ${\epsilon}_0$-completeness in those spaces. Finally we introduce a concept of the generalized Banach spaces with these concepts.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.8 no.2
• /
• pp.3-12
• /
• 1998

블럭암호의 비도는 S-box의 비도와 운영방식에 의존된다. S-box 의 비도는 이 한수의 성분함수인 Book함수의 비선형성, 상관면역위수, SAS, 균형성 등에 의존되며, S-box자체의 비선형성, 입력성부(또는 입력비트)에 대한 출력성분(또는 출력비트)의 독립성 등에 의존된다. 이와 같은 출력 성분의 독립성에 관한 개념의 하나가 완비성이다. 본 논문에서는 Galois 체 GF(2)위해 n차원 벡터공간 GF(2)$^{n}$ 에서 완비함수의 존재성에 관한 몇 가지 알고리즘과 완비함수가 만족하는 성질들을 조사하였다.

• Korean Journal of Logic
• /
• v.5 no.2
• /
• pp.1-21
• /
• 2002

A semantics for logical necessity, based on Carnap's criterion of adequacy, is given with respect to the ontology of logical atomism. A calculus for sentential (propositional) modal logic is described and shown to be complete with respect to this semantics. The semantics is then modified in terms of a restricted notion of 'all possible worlds' in the interpretation of necessity and shown to yield a completeness theorem for the modal logic S5. Such a restricted notion introduces material content into the meaning of necessity so that, in addition to atomic facts, there are "modal facts" that distinguish one world from another.

• Journal of Applied and Pure Mathematics
• /
• v.6 no.1_2
• /
• pp.71-96
• /
• 2024

In this paper we present many interesting results such as completeness and composition theorems in the 𝛼 norm. Moreover, under some conditions, we establish the existence and uniqueness of Cⁿ-(𝜇, 𝜈) pseudo-almost automorphic solutions of class r in the 𝛼-norm for some partial functional differential equations in Banach space when the delay is distributed. An example is given to illustrate our results.