• Korean Journal of Logic
• /
• v.22 no.1
• /
• pp.43-86
• /
• 2019

If 1st order ZFC is consistent(has a model($M_1$)) it has a transitive denumerable model($M_2$). This leads to a paradoxical situation called 'Skolem paradox'. This can be easily resolved by Skolem's typical resolution. but In the process, we must accept the model theoretic relativity for the concept of set. This relativity can generate a situation where the meaning of the set concept, for example, is given differently depending on the two models. The problem is next. because the sentence '¬denu(PN)' which indicate that PN is not denumerable is equally true in two models, A indistinguishability problem that the concept <¬denu> is not formally indistinguishable in ZFC arise. First, I will give a detail analysis of what the nature of this problem is. And I will provide three ways of responding to this problem from the standpoint of supporting ZFC. First, I will argue that <¬denu> concept, which can be relative to the different models, can be 'almost' distinguished in ZFC by using the formalization of model theory in ZFC. Second, I will show that <¬denu> can change its meaning intrinsically or naturally, by its contextual dependency from the semantic considerations about quantifier that plays a key role in the relativity of <¬denu>. Thus, I will show the model-relative meaning change of <¬denu> concept is a natural phenomenon external to the language, not a matter of responsible for ZFC.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.1-7
• /
• 2008

Magnetic Tunneling Junction (MTJ) has been used as a nonvolatile universal storage element mainly in memory technology. However, according to several recent studies, magneto-logic using MTJ elements show much potential in substitution for the transistor-based logic device. Magneto-logic based on MTJ can maintain the data during the power-off mode, since an MTJ element can store the result data in itself. Moreover, just by changing input signals, the full logic functions can be realized. Because of its programmability, it can embody the reconfigurable magneto-logic circuit in the rigid physical architecture. In this paper, we propose a novel 3-bit arbitrary magneto-logic circuit beyond the simple combinational logic or the short sequential one. We design the 3-bit magneto-logic which has the most complexity using MTJ elements and verify its functionality. The simulation results are presented with the HSPICE macro-model of MTJ that we have developed in our previous work. This novel magneto-logic based on MTJ can realize the most complex logic function. What is more, 3-bit arbitrary logic operations can be implemented by changing gate signals of the current drivel circuit.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.2
• /
• pp.16-24
• /
• 2010

This paper is proposed a novel fuzzy disturbance observer based on backstepping method for nonlinear systems with unknown disturbance. Using fuzzy logic systems, a fuzzy disturbance observer with the disturbance observation input is introduced for unknown disturbance. To guarantee that the proposed disturbance observer estimates the unknown disturbance, the disturbance observation error dynamic system is employed. Under the framework of the backstepping design, the fuzzy disturbance observer is constructed recursively and an adaptive laws and the disturbance observation input are derived. Numerical examples are given to demonstrate the validity of our proposed disturbance observer for nonlinear systems.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1994.12a
• /
• pp.15-18
• /
• 1994

본 연구에서는 불논리검색의 단점을 보완하기 위한 가장 강력한 검색 모형인 퍼지검색과 확률검색의 효율을 불논리검색과 상호비교하였다. 실험데이터로 정보학 분야의 한국어 test collection인 KT Test Set을 이용하였고 색인어와 색인어의 문헌내 출현빈도를 바탕으로 퍼지시소러스를 생성하여 시소러스의 NT, BT로 탐색식을 확장한 다음 각각에 대해 3가지 검색을 행하고 검색효율을 평균재현율과 평균정확률로 측정하였다. 실험결과 검색효율은 재현율에서는 확률검색, 불논리검색, 퍼지검색 순으로. 정확률에서는 퍼지검색, 확률검색, 불논리검색 순으로 나타났다.

• Review of KIISC
• /
• v.5 no.2
• /
• pp.90-96
• /
• 1995

Gollmann이 제안한 Cascade 생성기는 비선형성, 발생되는 수열의 난수특성, 주기성등 암호 알고리즘으로서 필요한 제반 특성을 보장하기 때문에 그동안 스트림 암호의 핵심 논리로 널리 사용되어 왔다. 그러나 최근 생성기 내부의 각 단계별로 시각 제어 수열과 출력 수열 사이에 암호 알고리즘으로는 부적당한 상관관계 특성이 존재함이 입증되었다. 본 고에서는 이러한 상관관계 특성을 이용하여,. 단순 순환 쉬프트 래지스터로 구성된 Cascade 생성기에 대한 기지 평문 공격 방식을 제안한다. 기존의 Lock-in effect 공격방식에 대하여 $10^{21}$ 정도의 안전성을 보장하는 8단계 11-cycle Cascade 생성기에 본 방식을 적용한 결과 불과 88,000 출력 비트만을 사용하여 공격이 성공함을 실험적으로 입증하였다.

• 월간 기계설비
• /
• s.251
• /
• pp.51-55
• /
• 2011

대한설비건설협회는 기계설비공사업인 열배관공사의 분리발주확대를 위해 지난 20여년간 지속적으로 건의하고 홍보한 결과, 한국지역난방공사가 올해 1월부터 50억원 미만에서 300억원 미만까지 확대하여 발주함으로써 사실상 모든 열배관 공사를 기계설비공사업으로 발주하게 됐다. 이에 대해 대한건설협회는 한국지역난방공사와 관계 요로에 기계설비공사 분리발주를 철회하여 줄 것을 강력히 건의하고 언론을 통해 수차례에 걸쳐 불만을 표시했다. 그러나 대한설비건설협회는 한국지역난방공사에 "열배관공사는 기계설비공사로 발주하는 것이 타당하다"는 논리로 강력히 대응했다.

• Journal of the Korean Society for information Management
• /
• v.20 no.4 s.50
• /
• pp.23-48
• /
• 2003

In this study an information filtering system was implemented and a series of relevance feedback experiments were conducted using the system. For the relevance feedback, the original queries were searched against the database and the results were reviewed by the researchers. Based on users' online relevance judgements a pair of 17 refined queries were generated using two methods called 'co-occurrence exclusion method' and 'lower frequencies exclusion method,' In order to generate them, the original queries, the descriptors and category codes appeared in either relevant or irrelevant document sets were applied as elements. Users' relevance judgments on the search results of the refined queries were compared and analyzed against those of the original queries.

• Korean Journal of Logic
• /
• v.18 no.3
• /
• pp.307-335
• /
• 2015

An important component in Prawitz's and Dummett's proof-theoretic accounts of validity is the condition for validity of open arguments. According to their accounts, roughly, an open argument is valid if there is an effective method for transforming valid arguments for its premises into a valid argument for its conclusion. Although their conditions look similar to the proof condition for implication in the BHK explanation, their conditions differ from the BHK account in an important respect. If the premises of an open argument are undecidable in an appropriate sense, then that argument is trivially valid according to Prawitz's and Dummett's definitions. I call this 'the triviality problem'. After a brief exposition of their accounts of proof-theoretic validity, I discuss triviality problems raised by undecidable atomic sentences and by Godel sentence. On this basis, I suggest an emendation of Prawitz's definition of validity of argument.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.10-17
• /
• 2007

It opens a new horizon on spintronics for the potential application of MTJ as a universal logic element, to employ the magneto-logic in substitution for the transistor-based logic device. The magneto-logic based on the MTJ element shows many potential advantages, such as high density, and nonvolatility. Moreover, the MTJ element has programmability and can therefore realize the full logic functions just by changing the input signals. This magneto-logic using MTJ elements can embody the reconfigurable circuit to overcome the rigid architecture. The established magneto-logic element has been designed and fabricated on a triple-layer MTJ. We present a novel magneto-logic structure that consists of a single layer MTJ and a current driver, which requires less processing steps with enhanced functional flexibility and uniformity. A 4-bit gray counter is designed to verify the magneto-logic functionality of the proposed single-layer MTJ and the simulation results are presented with the HSPICE macro-model of MTJ that we have developed.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1025-1034
• /
• 1997

Inference process of resolution-based automated reasoning easily consumes the memory of computer without giving any useful result by priducing lots of fruioless information which are not necessary for the conslusion. This paper suggests a control strategy for saving the space of computer memory and reducing the inference time. The strategy uses a restriction that comparatively irrelevant axioms do mot take pare in the resoluition. In order to analyze and determine the priorities of the input axioms of joning the inference process, the system employs the fuzzy relational products.