• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 2004.11a
• /
• pp.207-212
• /
• 2004

• Proceedings of the Korean Nuclear Society Conference
• /
• 1999.10a
• /
• pp.182.1-182
• /
• 1999

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.855-861
• /
• 2017

Gordon & Loeb[1] suggested that the optimal level of investment decision of an enterprise is the point that the marginal benefit(MB) of information security investment is equal to the marginal cost(MC). However, many companies suffering from information security incidents are not aware of the fact that they are experiencing information security accidents and can not measure how much they are affected. In this paper, I propose a model of information security investment decision making under the incomplete information situation by modifying the Gordon & Loeb[1] model and compare the differences in investment level. Under the incomplete information situation the expected return from the information security investment tends to be lower than that of actual information security investment, and the level of investment is also less. This shows that if a third party such as the government gives accurate information such as the rate of incidents of information security accidents and the amount of damages, companies can expand their investment in information security.

• Korean Journal of Logic
• /
• v.5 no.2
• /
• pp.39-66
• /
• 2002

일반적으로 엄밀한 방법을 통하여 증명되었다고 말해지는 괴델의 불완전성 정리는 일련의 전제와 배경지식이 요구된다고 하겠다. 이들 중에서 무엇보다도 중요한 것은 정리의 증명에 사용되는 메타언어상의 수학적 참에 대한 개념이다. 일단 확인할 수 있는 것은 "증명도, 반증도 되지 않지만 참인 산수문장의 존재"라는 불완전성 정리의 내용에서 괴델이 가정하고 있는 수학적 참의 개념이 구문론적인 증명개념으로부터 완전히 독립되어야 한다는 점이다. 문제는 그가 가정하고 있는 수학적 참의 개념이 도대체 무엇이어야만 하겠는가라는 점이다. 이 논문은 이 질문과 관련하여 내용적으로 3부분으로 나누어 질 수 있다. I. 괴델의 정리의 증명에 필요한 전제들 및 표의 도움을 얻어 자세히 제시되는 증명과정의 개략도를 통해 문제의 지형도를 조감하였다. II, III. 비트겐슈타인의 괴델비판을 중심으로, "일련의 글자꼴이 산수문장이다"라는 주장의 의미에 대한 상식적 비판 및 해석에 바탕을 둔 모형이론에 대한 대안제시를 통하여 괴델의 정리를 증명하기 위해 필요한 산수적 참에 관한 전제가 결코 "확보된 것이 아니다"라는 점을 밝혔다. IV. 괴델의 정리에 대한 앞의 비판이 초수학적 전제에 대한 것이라면, 3번째 부분에서는 공리체계에서 생성 가능한 표현의 증명여부와 관련된 쌍조건문이 그 도입에 필수적인 괴델화가 갖는 임의성으로 인해 양쪽의 문장의 참, 거짓 여부가 서로 독립적으로 판단 가능하여야만 한다는 점에(외재적 관계!) 착안하여 궁극적으로 자기 자신의 증명여부를 판단하게 되는 한계상황에 도달할 경우(대각화와 관련된 표 참조) 그 독립성이 상실됨으로 인해 사실상 기능이 정지되어야만 한다는 점, 그럼에도 불구하고 이 한계상황을 간파할 경우(내재적 관계로 바뀜!)항상 순환논법을 피할 수 없다는 점을 밝혔다. 비유적으로 거울이 모든 것을 비출 수 있어도 자기 스스로를 비출 수 없다는 점과 같으며, 공리체계 내 표현의 증명여부를 그 체계내의 표현으로 판별하는 괴델의 거울 역시 스스로를 비출 수는 없다는 점을 밝혔다. 따라서 괴델문장이 산수문장에 속한다는 믿음은, 그 문장의 증명, 반증 여부도 아니고 또 그 문장의 사용에서 오는 것도 아니고, 플라톤적 수의 세계에 대한 그 어떤 직관에서 나오는 것도 아니다. 사실상 구문론적 측면을 제외하고는 그 어떤 것으로부터도 괴델문장이 산수문장이라는 근거는 없다. 그럼에도 불구하고 괴델문장을 산수문장으로 볼 경우(괴델의 정리의 증명과정이라는 마술을 통해!), 그것은 확보된 구성요소로부터 조합된 문장이 아니라 전체가 서로 분리불가능한 하나의 그림이라고 보아야한다. 이것은 비트겐슈타인이 공리를 그림이라고 본 것과 완전히 일치하는 맥락이다. 바론 그런 점에서 괴델문장은 새로운 공리로 도입된 것과 사실은 다름이 없다.

• The Korean Journal of Mycology
• /
• v.21 no.4
• /
• pp.247-272
• /
• 1993

Forty-eight fungal isolates were collected from the Korean traditional maejus and twenty-eight isolates of them were identified to be a hyphomycetous fungus(three genera and 20 species) Aspergillus flavus, A. flavus var columnaris, A. oryzae, A, oryzae var effusus, A. terreus, Scopula­riosis brevicaulis, Penicillium botryosum, P. gorlenkoanum, P. griseo-purpureum, P. citrinum, P. miczynskii, P. gaditanum, P. turolense, P. funiculosum, P. rubicundum, P. godlewskii, P. jensenii, P. roqueforti, P. volguense, P. verrucosum. Various 14 species of Penicillium were isolated from maejus, but all of them were not considered to be involved in the maeju fermentation. Otherwise, S. brevicaulis was especially collected from the maejus of various located areas, but were also related to the good quality of maejus under labratory conditions. A. flavus, A. oryzae P. tulolense, and P. funiculosum were also observed to be involved in the process of maeju.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1163-1168
• /
• 1999

This paper proposes a wireless positioning method using the CDMA mobile communicaton network. The proposed method is time-based positioning method that uses mobile-station arrival time of forward link signal from base-stations. In this mehtod there are TDOA and TOA methods that use time-difference-of-arrival and time-of-arrival, respectively. Error characteristics and implementation simplicity of the two methods are compared and analyzed each other. As a results, it showed that TDOA has advantage of less sensitivity to the time error compared to TOA but has disadantage of more sensitivity to the spatial error. Also, from architecture of the CDMA system that is time synchronized to only active base-station it is analyzed that adoption of TDOA method is more advantageous than TOA because time difference of signal arrival from the neighbor base-stations against the active base-station can be measured more easily. Therefore, conclusion is made that TDOA is beat suit to the time-based positioning method for the present CDMA mobile communication networkgorithm performs block-by-block coherent decoding with the aid of pilot symbols. It is shown that the complexity of the algorithm grows linearly as a function of sequence length. The performance of the algorithm is shown to better than that of the conventional pilot symbol aided (PSI) algorithm. Simulation results are presented to assess the performance of the algorithm and the results are compared with that of the conventional PSI alforithm.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.79-90
• /
• 2016

Recently, many researchers have paid attention to the improved generation of AI agent in the area of game industry. Monte-Carlo Tree Search(MCTS) is one of the algorithms to search an optimal solution through random search with perfect information, and it is suitable for the purpose of calculating an approximate value to the solution of an equation which cannot be expressed explicitly. Games in Trading Card Game(TCG) genre such as the heartstone has imperfect information because the cards and play of an opponent are not predictable. In this study, MCTS is suggested in imperfect information card games so as to generate AI agents. In addition, the practicality of MCTS algorithm is verified by applying to heartstone game which is currently used.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.3
• /
• pp.471-491
• /
• 2016

Traditional limit equilibrium method needs an assumption of the failure surface to calculate the bearing capapcity of the shallow foundation. From the viewpoint of the mechanics of granular materials, however, the failure of the soil mass is initated by the local buckling of the contact force chains. In this study we observed the directional distribution of the contact force chains in the granular assembly stacked by model particles subjected to the model shallow foundation during loading. Two sets of the assemblies with a regular structure and initially local imperfection were prepared for tests. Existence of the initial local imperfection has a significant effect on the directional distribution of the contact force chains. The bearing capacity of the assembly with local imperfection is only 67% the capacity of the assembly with the regular structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.365-377
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

• Communications for Statistical Applications and Methods
• /
• v.18 no.6
• /
• pp.741-750
• /
• 2011

In this paper, we derive an software mixed debugging model based on a Markov process, assuming that the length of time to perform the debugging is random and its distribution may depend on the fault type causing the failure. We assume that the debugging process starts as soon as a software failure occurs, and either a perfect debugging or an imperfect debugging is performed upon each fault type. One type is caused by a fault that is easily corrected and in this case, the perfect debugging process is performed. An Imperfect debugging process is performed to fix the failure caused by a fault that is difficult to correct. Distribution of the first passage time and working probability of the software system are obtained; in addition, an availability function of a software system which is the probability that the software is in working at a given time, is derived. Numerical examples are provided for illustrative purposes.