객체지향 시스템 설계를 위한 하이퍼그래프 언어

정태의 서경대학교 산업기술연구소 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.

매크로 어셈블러의 객체화

정태의 서경대학교 산업기술연구소 1998 産業技術硏究所論文集 Vol.5 No.-

The object-oriented methods are being rapidly accepted as the solution for the software crisis. Object-oriented systems are composed of the integration of independent object modules; their merits are such that it is possible to reuse objects already developed, and that, when changes are required, modifications are restricted to some independent objects such that their affects to other objects are so little. In this paper, we deal with the macro assembler for next-generation microprocessors which has the merits of object methods. Whenever a microprocessor is newly developed, new assembler should be developed or the existing assembler be modified. In the former, it leads to the loss of time and money by the repeated developments, and, in the latter, it causes the problem of inefficient productivity since other modules are to be analyzed for the affections followed by modifications of one module, especially in the existing assemblers. To resolve these problems, the object-oriented macro assembler suggested in this paper consists of independent objects separable such that it shows reusability and reduces the inefficient productivity by minimizing the affects to other objects. Moreover, the object-oriented macro assembler integrates a macro pre-processor into an assembler, and uses automata for analyzing input streams to reduce the compile time.

샌프란시스코 평화조약의 문언적 해석

정태만(鄭泰萬) 한국일본문화학회 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".

HPi망에서의 착신서비스를 위한 IP페이징 기법

정태의,나지현,김영진,송병권,Jeong Tae Eui,Na Jee Hyeon,Kim Yeong Jin,Song Byung Kwon 한국정보처리학회 2005 정보처리학회논문지 C : 정보통신,정보보안 Vol.12 No.2

As the demands in a wireless network are recently increasing, it is necessary to promote the power efficiency of a wireless terminal, and to reduce the overhead of a network. To resolve such problems, we propose the paging technology and the structure of paging area with the joint access point in HPi (High-speed Portable Internet) network, which is being studied as the domestic next-generation IP packet data network. The application of the paging technology to the HPi network possesses the advantage of reducing the registration cost while a terminal in dormant state moves around, and the reporting cost of the terminal's location by the joint access point. The technology suggested in this paper causes the advantages that it promotes the power efficiency in user's point of view while it reduces the network overhead and makes the easy rearrangement of joint APs according to the changes of users' moving pattern in the network manager's point of view. 최근 무선망 수요가 급증함에 따라 무선 단말기의 전원 효율을 높이고 망의 오버헤드를 줄여야 하는 문제가 대두 되었다. 이를 위해 국내의 차세대 IP 패킷 무선망으로써 연구되고 있는 HPi(High Speed Portable Internet) 망에서의 페이징 기법 및 공유 AP를 갖는 페이징 영역 구조를 제안한다. HPi 망에서의 페이징 기법 적용은 dormant 상태 단말의 지역적 이동에 따른 등록 절차 비용 감소 및 공유 AP 설치로 인한 단말의 위치보고 비용의 감소라는 이점을 얻을 수 있다. 본 논문에서 제안한 기법은 단말 사용자 측면에서의 전원 효율을 높이는 장점과 관리자 측면에서의 망 오버헤드 감소 및 단말 이동패턴 변경에 따른 공유 AP의 손쉬운 재설정 이라는 이점을 가져온다.

이중모드 기지국에서의 핸드오버 기법

정태의,신영승,주상돈,송병권,Jeong Tae-Eui,Shin Yeon-Seung,Ju Sang-Don,Song Byung-Kwon 한국정보처리학회 2006 정보처리학회논문지 C : 정보통신,정보보안 Vol.13 No.2

핸드오버는 이동통신 단말기가 기지국과 기지국 사이를 이동해도 끊김없이 데이터 송수신이 가능하도록 해주는 기술이다 핸드오버 종류는 크게 두 가지로 구분되는데 네트워크 링크의 변경 없이 라디오 링크 연결만 변경되는 것을 수평(horizontal) 핸드오버라 하고, 서로 다른 네트워크 환경을 이동하는 것을 수직(vertical) 핸드오버로 정의할 수 있다. 본 논문은 SDR(Software Defined Radio)을 기반으로 W-CDMA망과 WiBro망을 동시에 지원하는 기지국내에서의 수직 핸드오프 프로토콜을 제안하고, 제안된 프로토콜을 상태천이도 및 페트리 넷을 이용하여 검증하고 또한 NS-2 시뮬레이터를 이용하여 제안된 프로토콜의 성능을 평가하였다 A handover is a technology that enables data transmission and receipt seamlessly while a mobile station moves from the current base station to another base station. The handover is basically classified into two types; a horizontal handover which changes a radio link only without changing a network link, and a vertical handover which changes both in heterogeneous networks. In this paper, we propose a vertical handover protocol in a dual base station which supports both of W-CDMA and WiBro networks based on SDR (Software Defined Radio), verify the rightness using a state transition diagram and a Petri-net, and evaluate the performance of the proposed protocol using NS-2 simulator.

SDR에서의 링크계층 Trigger기반 핸드오버 관리 및 전략

정태의 서경대학교 산업기술연구소 2006 産業技術硏究所論文集 Vol.17 No.-

The handover in a change that is relevant to services and applications used on the Mobile Station is called a vertical handover. The handover begins at an L2-Trigger event occurred by the weakness of radio signal strength of a wireless interface with which a mobile station is currently communicating. Since each wireless standard has its own radio frequency and protocol, it brings a compatibility problem. To resolve such a problem, SDR (Software Defined Radio) technologies are studied such that we present the related studies of handover management and policies based on Trigger of link layer in SDR.

SDR에서의 커플링 구조 및 핸드오버 시나리오

정태의 서경대학교 산업기술연구소 2006 産業技術硏究所論文集 Vol.17 No.-

The handover in a change that is relevant to services and applications used on the Mobile Station is called a vertical handover. The handover begins at an L2-Trigger event occurred by the weakness of radio signal strength of a wireless interface with which a mobile station is currently communicating. In this paper we study the coupling schemes and handover scenarios for each coupling scheme based on handover on SDR.

코달 및 순열 그래프의 레이블링 번호 상한에 대한 연구

정태의,한근희,Jeong, Tae-Ui,Han, Geun-Hui 한국정보처리학회 1999 정보처리논문지 Vol.6 No.8

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

정책논단-적정 관세차등화가 이뤄져야 하는 이유

정태오,Jeong, Tae-O 대한석유협회 2002 석유와 에너지 Vol.2002 No.11