http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
정태만(鄭泰萬) 한국일본문화학회 2017 日本文化學報 Vol.0 No.72
In interpreting treaties, the interpretation in accordance with the ordinary meaning of the terms of the treaty in their context is a fundamental principle, which is also specified in the Vienna Convention on the Law of Treaties. In this paper, each of the terms in Article 2 (a) of the San Francisco Peace Treaty is interpreted in accordance with its ordinary meaning, and made clear to which country the Dokdo"s sovereignty belongs. The emphasis is on the ordinary meaning of ‘Korea’, because Japan is required to renounce all right, title and claim to Korea. Not only by SCAPIN 677 of Contracting States, the Allied Powers, but also by Ministry of Finance"s Decree No. 4(1951.2.13) and Prime Minister"s Decree No. 24(1951.6.6) of the other Contracting State, Japan, "Korea" means Korea including Dokdo. These are also visually proven by the "SCAP Administrative Areas: Japan and South Korea" of February 1946 and the "The Japanese Domain Reference Map"(日本領域参考図) of August 1951 respectively. In addition, I argue that criticisms are common in the previous studies of Korean scholars as well as Japanese scholars in the interpretation of Article 2 (a) of the San Francisco Peace Treaty on the terms such as "recognizing the independence" and "including".
정태의 서경대학교 산업기술연구소 1997 産業技術硏究所論文集 Vol.2 No.-
Graph languages are used for describing graphs, minimizing the complexities graphs can have such that it helps to better figure out, and making it easy to modify them. Graph languages are generated by repeatedly applying derivation steps of graph grammars, and graph grammars effectively regenerate the same structure by such derivations that it is possible toderive the other similar structures. Graph grammars provide a way to control system's structure and the system's complexity is hidden inside the system. This way graph languages themselvels include the concepts of abstraction and inheirtance which are the central concept of object-oriented systems,
Improving Efficiency of Minimum Dominating Set Problem using Simulated Annealing Algorithms
정태의,Jeong, Tae-Eui Korea Information Processing Society 2011 정보처리학회논문지 A Vol.18 No.2
그래프 G의 최소 dominating set 문제는 G의 dominating set들 중 가장 작은 크기의 dominating set을 찾는 문제이며, NP-complete class에 속해 polynomial time안에 해결할 수 없는 문제로 잘 알려져 있다. 그러나, heuristic한 방법 혹은 approximation 방법을 이용해 특정한 분야에 적용이 가능하다. 본 논문에서는 세 개의 서로 다른 simulated annealing 알고리즘을 제시하여, 이들 알고리즘을 DIMACS에서 제시한 그래프들에 적용한 경우 효율성 증가가 이루어지는 것을 실험적으로 보이고자 한다. The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.