• Archives of Plastic Surgery
• /
• v.49 no.4
• /
• pp.549-553
• /
• 2022

Chylothorax is a rare disease and massive lymph fluid loss can cause life-threatening condition such as severe malnutrition, weight loss, and impaired immune system. If untreated, mortality rate of chylothorax can be up to 50%. This is a case report of a 3-year-old child with iatrogenic chylothorax. Despite conservative treatment and procedures, like perm catheter insertion, the patient failed to improve the respiratory symptoms over 3 months of period. As an alternative to surgical option, such as pleurodesis and thoracic duct ligation which has high complication rate, the patient underwent lymphovenous anastomosis (LVA) and lymph node to vein anastomosis (LNVA). Follow-up at fourth month showed clear lungs without breathing difficulty despite perm catheter removal. This is the first report to show the effectiveness of LVA and LNVA against iatrogenic chylothorax.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.23-32
• /
• 2006

In this paper, we propose indexing method to manage large amount of XML documents efficiently, using the range of node and Pre-Oder List. The most of XML indexing methods are based on path or numbering method. However, the method of path-based indexing method shows disadvantages of performance degradation for join operations of ancestor-descendent relationships, and searching for middle and lower nodes. The method of numbers-scheme based indexing has to number all nodes of XML documents, since search overhead increased and the disk space for indexes was wasted. Therefore, in this paper, we propose a novel indexing method using node ranges and Preorder-Lists to overcome these problems. The proposed method more efficiently stores similar structured XML documents. In addition, our method supports flexible insertion and deletion of XML documents.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1828-1834
• /
• 2004

With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

• Journal of Intelligence and Information Systems
• /
• v.15 no.3
• /
• pp.137-150
• /
• 2009

This paper proposes the hybrid heuristic method to apply the opportunity time to solve the vehicle routing and scheduling problem with time constraints(VRSPTW). The opportunity time indicates the idle time which remains after the vehicle performs the unloading service required by each customer's node. In this proposed heuristic, we add the constraints to VRSPTW model for the opportunity time. We also obtain the initial solution by applying the cost evaluation function to the insertion strategy considering the opportunity time. In addition, we improve the former result by applying the opportunity time to the tabu search strategy by swapping the customer's node. Finally, we suggest the construction strategies of initial routing which can efficiently acquire the nearest optimal solution from various types of data in terms of geographical condition, scheduling horizon and vehicle capacity. Our experiment show that our heuristic can get the nearest optimal solution more efficiently than the Solomon's I1 heuristic.

• Archives of Plastic Surgery
• /
• v.46 no.1
• /
• pp.79-83
• /
• 2019

Robotic surgery facilitates surgical procedures by employing flexible arms with multiple degrees of freedom and providing high-quality 3-dimensional imaging. Robot-assisted nipple-sparing mastectomy with immediate reconstruction is currently performed to avoid breast scars. Four patients with invasive ductal carcinoma underwent robot-assisted nipple-sparing mastectomy and immediate robot-assisted expander insertion. Through a 6-cm incision along the anterior axillary line, sentinel lymph node biopsy and nipple-sparing mastectomy were performed by oncologic surgeons. The pectoralis major muscle was elevated, an acellular dermal matrix (ADM) sling was created with robotic assistance, and an expander was inserted into the subpectoral, sub-ADM pocket. No patients had major complications such as hematoma, seroma, infection, capsular contracture, or nipple-areolar necrosis. The mean operation time for expander insertion was 1 hour and 20 minutes, and it became shorter with more experience. The first patient completed 2-stage prosthetic reconstruction and was highly satisfied with the unnoticeable scar and symmetric reconstruction. We describe several cases of immediate robot-assisted prosthetic breast reconstruction. This procedure is a feasible surgical option for patients who want to conceal surgical scars.

• Archives of Plastic Surgery
• /
• v.41 no.3
• /
• pp.258-263
• /
• 2014

Background For early breast cancer patients, skin-sparing mastectomy or nipple-sparing mastectomy with sentinel lymph node biopsy has become the mainstream treatment for immediate breast reconstruction in possible cases. However, a few cases of skin necrosis caused by methylene blue dye (MBD) used for sentinel lymph node localization have been reported. Methods Immediate breast reconstruction using a silicone implant was performed on 35 breasts of 34 patients after mastectomy. For sentinel lymph node localization, 1% MBD (3 mL) was injected into the subareolar area. The operation site was inspected in the postoperative evaluation. Results Six cases of immediate breast reconstruction using implants were complicated by methylene blue dye. One case of local infection was improved by conservative treatment. In two cases, partial necrosis and wound dehiscence of the incision areas were observed; thus, debridement and closure were performed. Of the three cases of wide skin necrosis, two cases underwent removal of the dead tissue and implants, followed by primary closure. In the other case, the breast implant was salvaged using latissimus dorsi musculocutaneous flap reconstruction. Conclusions The complications were caused by MBD toxicity, which aggravated blood disturbance and skin tension after implant insertion. When planning immediate breast reconstruction using silicone implants, complications of MBD should be discussed in detail prior to surgery, and appropriate management in the event of complications is required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.796-804
• /
• 1992

This paper presents a design of a backbone network which uses a rigister-Insertion ring structure, The introduction of a high speed register in sertton backbone ring enables high performance inter-network 4ommunicatlons In a simple and modular structure at low cost and Its concurrent communications.. Two or more bridge nodes can be used to construct a register Insertion backbone ring network. The high bandwidth of the backbone ring sup ports heavy traffic for Inter-segment Eornrnunicatlons. The bridge node does both local address filtering to block data entering the ring and remote address filtering to block data entering the local LAN segment . Title local address greatly reduces the rate on the backbone ring and the remote address filterlng greatly reduces the traffic rate on each LAN segment. An feature makes the network the network reconflguratlon simpler and transparent to users. A throughput analysis Is used to deterrune the bandwidth of the backbone rlr)g transmission medium.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.432-446
• /
• 2008

Queries for tracing tag locations are among the most challenging requirements in RFID based applications, including automated manufacturing, inventory tracking and supply chain management. For efficient query processing, a previous study proposed the index scheme for storing tag objects, based on the moving object index, in 3-dimensional domain with the axes being the tag identifier, the reader identifier, and the time. In a different way of a moving object index, the ranges of coordinates for each domain are quite different so that the distribution of query regions is skewed to the reader identifier domain. Previous indexes for tags, however, do not consider the skewed distribution for query regions. This results in producing many overlaps between index nodes and query regions and then causes the problem of traversing many index nodes. To solve this problem, we propose a new disproportional insertion and split policy of the index for RFID tags which is based on the R*-tree. For efficient insertion of tag data, our method derives the weighted margin for each node by using weights of each axis and margin of nodes. Based the weighted margin, we can choose the subtree and the split method in order to insert tag data with the minimum cost. Proposed insertion method also reduces the cost of region query by reducing overlapped area of query region and MBRs. Our experiments show that the index based on the proposed insertion and split method considerably improves the performance of queries than the index based on the previous methods.