HRNCE 문법의 언어 생성력

정태의(Jeong Tae Eui),박동선(Park Dong Sun) 한국정보처리학회 1996 정보처리학회논문지 Vol.3 No.7

Graph grammars generate graph languages while string grammars generate string languages which are the subset of graph languages. One of the most successful graph grammars models is the NLC grammars. which generate graphs by replacing a node by a graph through node labels. For grammars generating hypergraphs which are the superset of graph, there are CFHG grammars, which replace a hyperedge by a hypergraph through their preidentified gluing points, an extension of CFGH grammars called HH grammars, which replace a handle by a hypergraph through the rewriting mechanism that can also duplicate of delete the hyperedges surrounding the replaced handle, and finally HRNCE grammars, which replace a handle by a hypergraph through an eNCE way of rewriting. In this paper, we compare the language-generating power of HRNCE grammars with that of graph grammars mentioned above by comparing graph languages generated by them, respectively.

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

정태의(Jeong Tae Eui),한근희(Han Keun Hee) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.8

Given a graph G=(V, E), Ld = (2, 1)-labeling of G is a function f : V(G) -> [0, ∞) such that, if v1,v2%u2208V are adjacent, f(x) - f(y) ≥ 2d, and if the distance between v1 and v2 is two, f(x) - f(y) ≥ d, where dG(v1, v2) is the shortest distance between v1 and v2 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∈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 λ(G) for a chordal graph G and that of λ(G') for a permutation graph G'.

통풍의 임상적 고찰

정태기(Tae Gi Chung),김형곤(Hyung Gon Kim),송영수(Young Soo Song),한성훈(Seong Hoon Han),김정수(Jeong Soo Kim),김현대(Hyeon Dae Kim),남경재(Kyung Jae Nam),정성광(Sung Kwang Chung),이윤우(Yun Woo Lee) 대한내과학회 1997 대한내과학회지 Vol.53 No.1

N/A Objectives: The clinical manifestations of gout in Korea would be changed lately according to the rapid economical development and the development of diagnostic methods. This study was done to reveal the late clinical features of gout in Korea. Methods: A retrospective study was done for the 90 gout patients who had been treated in Seoul Paik Hospital from March 1974 to August 1994. Age of onset, sex, duration of disease, serum uric acid level, uric acid concentration of 24 hour urine, joint of first attack, recurrently involved joints, X-ray of involved joint, frequency of tophi, renal ultrasonography, and associated diseases were analyzed. The uric acid levels of the 808 civilians who visited our hospital for the periodic health examination were used as a control value. Results: 1) The serum uric acid level in Korean adults was 5.2±1.1mg/dL in male, 3.8±0.7mg/dL in female, and 4.7mg/dL in general. The serum uric acid concentration of the gout patients was 8.6±2.2mg/dL in male, 6.1±2.1mg/dL in female, and 8.5±2.3mg/dL in general. The age of onset was 46.4±12.9 years old and male to female ratio was 44: 1 2) The renal excretion of uric acid was 470±173 mg/day in gout patients. 3) The sites of first attack were first MTP joint(76%), tarsal joint(13%), knee(5%), and other MTP joints(5%) 4) The involved joints during the repeated attacks were first MTP joint(84%), tarsal joint(23%), and fingers(23%), The duration of disease was significantly longer and the serum uric acid concentration was higher in the patients with tophi than they are in the patients without. 5) The 4l% of patients showed hone change in X-ray. 6) The renal ultrasound examinations were abnormal in 42% of the patients and the serum uric acid concentrations were significantly higher. 7) Obesity was found in 68% of patients, hypertension in 39%, hyperlipidemia in 16%, and chronic renal disease in 12%. Conclusion: The clinical features of gout in our study were similar to those of others done in and out of Korea, except that the frequency of hypertringlyceridemia was much lower than that of the foreign countries.

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

정태의,신영승,주상돈,송병권,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.

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.

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-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

Voice XML

강선미,정태의,Gang, Seon-Mi,Jeong, Tae-Ui 한국과학기술정보연구원 2001 지식정보인프라 Vol.6 No.-

현재 진행되고 있는 XML 응용분야의 표준은 각 분야별로 구체적으로 진행되고 있으며 이러한 시점에서 AT&T, 루슨트 테크놀로지스, 모토롤러 등 3사는 전화와 인터넷 서버와의 연동을 음성 처리 기술을 바탕으로 하여 기존 인터넷의 다양한 정보를 검색 처리할 수 있는 VXML(Voice Extensible Markup Language)이라는 인터넷 음성처리 표준안을 마련하고 있다.

직접 인쇄 기법 모사

이정휴(Jeong Hyou Lee),정태의(Tae Eui Jeong),한혜철(Hyea Chul Han),김남수(Nam Soo Kim) 대한기계학회 2010 대한기계학회 춘추학술대회 Vol.2010 No.4