• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• Journal of Chest Surgery
• /
• v.21 no.5
• /
• pp.856-862
• /
• 1988

The survival rate after resectional operation for carcinoma of the esophagus is still very low and many factors contribute to these poor results. We analyze the clinical results of 56 operated patients among 62 esophageal cancer patients between March, 1974 and July, 1988. Among the 62 patients, 52 patients were squamous cell carcinoma and 8 were adenocarcinoma, one was leiomyosarcoma and one was adenosquamous cell carcinoma. The classification of esophageal cancer was based on TNM classification of American Joint Committee on cancer". Among the operated patients, stage I was 5[9.6%], stage II was 13[25%], stage III was 26[50%], stage IV was 8[15.4%]. And its one year survival rate was 80%, 69%, 11.5%, 0% for each stages. The rate of resectability was 30.3% and resection of esophagus with esophagogastrostomy and extended lymph node dissection was performed on 17 patients without distant metastasis or adjacent organ invasion. Substernal esophago-colono-gastrostomy, Celestine tube insertion and feeding gastrostomy was performed on remained 39 patients. The analysis of postoperative survival duration revealed the superiority of esophagectomy with extended lymph node dissection over other palliative operation. [1 year survival rate: 79% versus 21%] We concluded that the survival rate of esophageal resection with lymph node dissection group was superior to nonresective palliative operation group. And transthoracic approach was superior to extrathoracic approach in involved lymph node dissection and esophageal resection in locally invaded cases.ases.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.583-586
• /
• 2009

A 14.1" XGA (1024${\times}$768) LCD panel with Integrated Black Data Insertion (IBDI) has been world first developed successfully based on the integrated amorphous Silicon TFT gate driver which we previously introduced. The notable features compared with the conventional integrated a-Si TFT gate driver circuit are that the circuit consists of Dual buffer, Carry buffer structure, and Q-node cross charging for stable signal scanning characteristic and prevention of coupling between signal lines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.281-290
• /
• 1996

In this paper we suggest an OFDM star network based on carrier distribution and homodyne detection in which all optical carriers generated and stabilized in a specific node are distributed to each node. We studied ASK and PSK modulation schemes and calculated rspective SNRs and BERs for this network. We also discussed on the optical power requirement on the light sources for 200 Mb/s transmission speed. As a result, we found tht ASK and PSK respectively require 13 dBm and 10 dBm for 32 nodes and the nmber of nodes can be expanded to 73 with only 0 dBm of power and minimum insertion losses of components. The proposed network is more reliable than the conventional ones due to the centralized carrier maintenance andthe network is suitable for the adverse environment of the nodes.

• Korean Journal of Veterinary Research
• /
• v.39 no.2
• /
• pp.353-358
• /
• 1999

New emerging post weaning multisystemic wasting syndrome (PMWS) threatening swine industry worldwide and investigation of the etiological agent is underway. The porcine circovirus (PCV) consistently identified from PMWS pigs and research result indicate that there is strong relationship between PCV and PMWS. Fauns with PMWS submitted pigs suffered from various PMWS typical signs and necropsy finding showed lymph node anomalies. The PCV DNA was amplified from inguinal lymph node collected from pigs with PMWS. PCV specific primers were successfully amplified PCV DNAs and were able to differentiate PCV type I and II. We have identified noble PCV virus with genetic variation. The virus showed insertion of the nucleic acid at the 5' of the genome but did not have PCR product with primer set corresponding to PCV type II virus.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.61-68
• /
• 1995

The performance of event-driven logic simulation frequently used for VLSI design verification depends on the data structures for event queues. This paper improves the existing Timing Wheel as a data structure for an event queue. In case of the use of B+ tree, an efficient node degree is also presented based on the experiment results. A new Timing Wheel index structure, which eliminates the insertion and deletion overhead of B+ tree, is proposed and analyzed.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.739-742
• /
• 2006

In this paper, we propose a method for automatic generation of equivalent circuit for unit cell of LCDTV. In order to extract a circuit model, computer program generates electrical connectivity of resistors and capacitors from the layout through pattern analysis with electrode and port information. For combining two types of independent equivalent circuits, we propose a node insertion algorithm. As a consequence, we can generate an equivalent RC circuit without increasing the capacitive elements.

• Tuberculosis and Respiratory Diseases
• /
• v.78 no.3
• /
• pp.276-280
• /
• 2015

Cryptococcal pneumonia usually occurs in immunocompromised patients with malignancy, acquired immune deficiency syndrome, organ transplantations, immunosuppressive chemotherapies, catheter insertion, or dialysis. It can be diagnosed by gaining tissues in lung parenchyma or detecting antigen in blood or bronchoalveolar lavage fluid. Here we report an immunocompetent 32-year-old male patient with diabetes mellitus diagnosed with cryptococcal pneumonia after a ultrasound-guided percutaneous supraclavicular lymph node core needle biopsy. We treated him with fluconazole at 400 mg/day for 9 months according to the guideline. This is the first case that cryptococcal pneumonia was diagnosed from a percutaneous lymph node biopsy in South Korea.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2869-2885
• /
• 1996

There werer many researches on the switch system for high speed netowrk such as B-ISDN and the server system for the multimedia services respectively. But, in case of simple connection of these two systems, we have to suffer the bottlenck problem of data transmission, and pay the wasteful expenditure because of duplicated architecture of both systems such as interconnecting network at the switch and the server. Therefore, we propse the unified architecture of switehces and servers, which can be used as switches and servers simultaneously. This is based on the hybercube structure. The links are used iterconnection network of switch system, and each node has the subscriber subsystem and the server subsystem. The proposed architecure has the benifits as follows; the easy espansion of capacity due to the scalability,the simple system development and maintenance because of the equivalance of each nodes, the high reliability against the fault of nodes and links due to the existence of the many alternative links between nodes, the easy flow and QoS managment due to the non-blocking data transmission between any two nodes, the flexible adaptation for additional new services owing to simple insertion server board to node. In this paper, we present overal configuration and node component of proposed architecture, and the procesing flow for the various services.