• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.02a
• /
• pp.520-520
• /
• 2013

Lateral 구조를 갖는 탄소나노튜브 에미터 캐소드의 금속전극 선폭과 간격은 탄소나노튜브 에미터 밀도와 게이트에 인가되는 전계의 크기에 밀접한 관계가 있어 전계방출특성에 큰 영향을 나타내므로 조속한 상업화를 위해서는 최적화 연구가 요구된다. 따라서 본 연구에서는 금속전극의 선폭과 간격을 110/30, 80/30, 40/30과 120/20, 90/20, 20/20 ${\mu}m$로 각각 변화시켜 4.6인치 탄소나노튜브 에미터 기반 flat light lamp 개발연구를 진행하였다. 이때 사용한 금속전극은 2 mm 두께를 갖는 4.6인치 소다라임 글라스 위에 패턴 된 PR에 Ag를 sputtering하여 증착 후 PR을 lift-off하여 형성하였다. 이와 같이 형성된 금속전극은 ~1 ${\mu}m$와 12 nm의 두께와 표면단차를 각각 가지고 있었다. 형성된 금속전극 위에 유전체와 탄소나노튜브 에미터를 각각의 페이스트를 사용하여 스크린 인쇄와 소성과정을 통해 형성하였다. 이때 레이저 빔을 전극사이의 빈 공간에 조사하여 탄소나노튜브 에미터를 금속전극 위에 정밀하게 정렬하였으며 잔존하는 유기물과 유기용매를 없애기 위해 대기압 공기분위기의 $410^{\circ}C$에서 10분간 소성과정을 거친 후 접착테이프를 사용하여 잔탄 속에 있는 탄소나노튜브 에미터를 물리적 힘으로 수직하게 노출시켜 캐소드를 준비하였다. 애노드는 전계에 의해 방출된 전자의 측정과 전계방출 이미지를 얻기 위해서 P22 형광체와 Al박막이 증착된 2 mm 두께의 소다라임 글라스를 사용하였다. 캐소드와 애노드 사이의 간격은 6~10 mm로 유지하였고, 진공챔버의 기본 압력을 $5{\times}10^{-6}$ Torr 이하로 유지하였다. 캐소드와 게이트 전극에 1, 4 kHz와 3% duty를 갖는 bipolar 형태의 DC 사각펄스파를, 애노드에 ~18 kV의 DC 고전압을 각각 인가하여 평가하였으며 추후, 이렇게 제작된 다양한 선폭과 간격을 갖는 탄소나노튜브 에미터 기반 flat light lamp의 전계방출특성과 효율에 대한 비교 연구를 진행할 계획이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.326-333
• /
• 2008

In wireless sensor networks, a sensor node with in-network aggregation adjusts the timeout which is a waiting time to receive messages from child nodes. This paper proposes a novel timeout scheduling scheme for data aggregation in wireless sensor networks, which adaptively configures its timeout according to changing data patterns in order to improve energy efficiency and data accuracy during data aggregation. The proposed scheme decreases the timeout when the temporal difference of collected data(data variation) from children is lower than a pre-defined threshold because there is no occurrence of critical events. Conversely, it increases the timeout when the data variation is higher than the pre-defined threshold in order to fulfill more accurate data aggregation. Extensive simulation reveals that the proposed scheme outperforms the cascading-based scheme in terms of energy consumption and data accuracy.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.351-360
• /
• 2004

Most mobile agents are migrated to many mobile agent systems by the sequential node migration method. However. in this case, if some problems such as host's fault or obstacle etc. happened, mobile agent falls infinity walt or orphan states. Therefore, it is difficult to get an expectation effect as use of other distribution technologies because the required time for networking between nodes increases. And so, many researches have been performed to solve this problems. However, most of methods decide node migration based on passive routing table or detour hosts which have some problems. Actually, the researches for reducing the total required time for networking are insufficient yet. In this paper, to reduce the required time for networking of mobile agent we design an active routing table based on the information of implemented objects which are registered in the meta-table of naming agent. And also, for user's keyword, we propose an replication model that replicates many agent object according to the information and number of object references corresponding to meta-table. Replicated objects are migrated to mobile agent systems in parallel and it provides minimized required time for networking.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.39-57
• /
• 2018

The purpose of this study was to construct an artificial intelligence model that learns and estimates the relationship between vehicle queue length and link travel time in urban areas. The vehicle queue length estimation model is modeled by three models. First of all, classify whether vehicle queue is a link overflow and estimate the vehicle queue length in the link overflow and non-overflow situations. Deep learning model is implemented as Tensorflow. All models are based DNN structure, and network structure which shows minimum error after learning and testing is selected by diversifying hidden layer and node number. The accuracy of the vehicle queue link overflow classification model was 98%, and the error of the vehicle queue estimation model in case of non-overflow and overflow situation was less than 15% and less than 5%, respectively. The average error per link was about 12%. Compared with the detecting data-based method, the error was reduced by about 39%.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.2
• /
• pp.144-151
• /
• 2022

In this paper, a 1.5V 256kb eFlash memory IP with low area DC-DC converter is designed for battery application. Therefore, in this paper, 5V NMOS precharging transistor is used instead of cross-coupled 5V NMOS transistor, which is a circuit that precharges the voltage of the pumping node to VIN voltage in the unit charge pump circuit for the design of a low-area DC-DC converter. A 5V cross-coupled PMOS transistor is used as a transistor that transfers the boosted voltage to the VOUT node. In addition, the gate node of the 5V NMOS precharging transistor is made to swing between VIN voltage and VIN+VDD voltage using a boost-clock generator. Furthermore, to swing the clock signal, which is one node of the pumping capacitor, to full VDD during a small ring oscillation period in the multi-stage charge pump circuit, a local inverter is added to each unit charge pump circuit. And when exiting from erase mode and program mode and staying at stand-by state, HV NMOS transistor is used to precharge to VDD voltage instead of using a circuit that precharges the boosted voltage to VDD voltage. Since the proposed circuit is applied to the DC-DC converter circuit, the layout area of the 256kb eFLASH memory IP is reduced by about 6.5% compared to the case of using the conventional DC-DC converter circuit.

• Annual Conference of KIPS
• /
• 2003.05b
• /
• pp.1169-1172
• /
• 2003

무선 네트워크에서의 데이터 손실과 일관성 없는 지연, 그리고 전송 속도의 저하 등의 많은 문제점들로 인해 무선 네트워크에서의 QoS의 보장은 필수적이다. 본 논문에서는 Mobile IPv6 에서 제시되었던 AAA 와 MAP, QoS Object등의 솔루션들을 이용하여 MR이동 시 Binding Update로 인한 대기시간을 줄여주고, MR내의 각 노드들의 QoS 경로를 보장해주는 무선 네트워크 내의 네트워크 이동성을 고려한 메커니즘을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1335-1345
• /
• 1994

In this paper, the performance analysis of Inter-Processor Communication Network(IPCN) in a large-capacity digital switching system, TDX-10, is presented. The simulation model of IPCN is developed using discrete event model of SLAM II. The simulation results of maximum buffer length and mean waiting times at each node, and utilization of D-bus are derived. Finally, the maximum call handling capacity of IPCN is obtained by taking link speed into consideration.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.510-512
• /
• 1999

컴퓨터통신 분야 및 개인이동통신 분야 등에서 먼저 도입된 멀티미디어 데이터의 사용이 큰 호응을 얻으면서, 최근 디지털 텔레비전 환경에서 멀티미디어 데이터 방송서비스를 시행하려는 노력들이 이루어지고 있다. 이는 다수의 사용자를 겨냥한 방송서비스로 데이터가 개별 사용자의 요구에 의해서가 아닌 정해진 방송 순서에 의해 제공된다. 따라서 사용자들은 원하는 정보를 수신할때까지 대기하게 된다. 이러한 응답시간 (response time)을 감소시키기 위해서, 문맥인지 캐슁(context-aware caching) 정책과 캐쉬 점유 우선순위 결정에 핵심이 되는 두 노드사이의 거리 산출을 위한 방법을 제안한다. 또한 선입산출(first-in-first-out) 정책과의 비교 모의실험(simulation)을 통해, 제안한 문맥인지 캐슁 정책이 응답시간 감소효과가 좋음을 확인하고, 이를 분석한다.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.