• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.109-118
• /
• 2007

Recently, flash memory is used to store data in mobile computing devices such as PDAs, SmartCards, mobile phones and MP3 players. These devices need index structures like the B-tree to efficiently support some operations like insertion, deletion and search. The BFTL(B-tree Flash Translation Layer) technique was first introduced which is for implementing the B-tree on flash memory. Flash memory has characteristics that a write operation is more costly than a read operation and an overwrite operation is impossible. Therefore, the BFTL method focuses on minimizing the number of write operations resulting from building the B-tree. However, we indicate in this paper that there are many rooms of improving the performance of the I/O cost in building the B-tree using this method and it is not practical since it increases highly the usage of the SRAM memory storage. In this paper, we propose a BOF(the B-tree On Flash memory) approach for implementing the B-tree on flash memory efficiently. The core of this approach is to store index units belonging to the same B-tree node to the same sector on flash memory in case of the replacement of the buffer used to build the B-tree. In this paper, we show that our BOF technique outperforms the BFTL or other techniques.

• The KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.459-468
• /
• 2004

Sharing XML trees on mobile devices has become more and more popular. Optimistic replication of XML trees for mobile devices raises the need for reconciliation of concurrently modified data. Especially for reconciling the modified tree structures, we have to compare trees by node mapping which takes O($n^2$) time. Also, using semantic based conflict resolving policy is often discussed in the literature. In this research, we focused on an efficient reconciliation method for mobile environments, using edit scripts of XML data sent from each device. To get a simple model for mobile devices, we use the XML list data sharing model, which allows inserting/deleting subtrees only for the repetitive parts of the tree, based on the document type. Also, we use keys for repetitive part subtrees, keys are unique between nodes with a same parent. This model not only guarantees that the edit action always results a valid tree but also allows a linear time reconciliation algorithm due to key based list reconciliation. The algorithm proposed in this paper takes linear time to the length of edit scripts, if we can assume that there is no insertion key conflict. Since the previous methods take a linear time to the size of the tree, the proposed method is expected to provide a more efficient reconciliation model in the mobile environment.

• Journal of Chest Surgery
• /
• v.29 no.7
• /
• pp.769-776
• /
• 1996

The application of video-assisted thoracic surgery (VATS) in the examination of the thoracic cavity can be a new option in patients with mediastinal tumor because it provides outstanding visibility of the structures of the mediastinum. By clear viewing through the thoracoscope, a mediastinal tumor can be biopsied or resected, depending on the findings during an operation. We reviewed all patients who underwent curative or diagnostic operations from March 1990 to August 1995 under the impression of a mediastinal mass. The total number of patients were 113 with 59 males and 54 females. Group A underwent resection of tu or by thoracotomy(38 patients: 18 males, 20 females), and group B underwent resection of tumor by VATS (36 patients : 20 males and 16 females). Seven patients in group B were excluded because they underwent thoracotomy due to pleural adhesion or intra-operative bleeding ; therefore, the true VATS group numbered 29 cases. Group C underwent Iymph node biopsy by VATS(33 patients'16 males, 17 females), and group D(6 patients: 5 males, 1 female) underwent Iymph node biopsy through anterior mediastinotomy. The mean age in group A was 36.2 years compared to 41.3 years In group B. We compared operation time, frequency of injection for pain control, duration of chest tube insertion, postoperative hospital stay, and diagnostic yield. In group A, they were 164 minutes, 3.4 times, 5.2 days, and 11.3 days, respectively, in comparison to 152 minutes, 2 times, 4.7 days, and 8.3 days, respectively, in group B. These data revealed that the day of discharge was significantly shorter in group B (p valu : 0.03). In group C, the mean age was 45.8 years (range 1 ∼70). The operation time was from 30 to 335 minutes (mean 105), pain control was required from 0 to 15 times(mean 3.2), and a chest tube was needed for 1 to 36 days (mean 6.1). In group D, mean age was 53.3 years, operation time 121 minutes, pall control injec- tion frequency 2.6 times, and mean chest tube duration 10.5 days. The diagnostic yield in group C was 8 oyo compared to 100 oyo in group D although the number of patients in group D is small.

• Korean Journal of Cognitive Science
• /
• v.16 no.4
• /
• pp.305-322
• /
• 2005

Watermarking is a widely employed method tn protecting copyright of a digital image, the owner's unique image is embedded into the original image. Strengthened level of watermark insertion would help enhance its resilience in the process of extraction even from various distortions of transformation on the image size or resolution. However, its level, at the same time, should be moderated enough not to reach human visibility. Finding a balance between these two is crucial in watermarking. For the algorithm for watermarking, the predefined strength of a watermark, computed from the physical difference between the original and embedded images, is applied to all images uniformal. The mean brightness or contrast of the surrounding images, other than the absolute brightness of an object, could affect human sensitivity for object detection. In the present study, we examined whether the detectability for watermark noise might be attired by image statistics: mean brightness and contrast of the image. As the first step to examine their effect, we made rune fundamental images with varied brightness and control of the original image. For each fundamental image, detectability for watermark noise was measured. The results showed that the strength ot watermark node for detection increased as tile brightness and contrast of the fundamental image were increased. We have fitted the data to a regression line which can be used to estimate the strength of watermark of a given image with a certain brightness and contrast. Although we need to take other required factors into consideration in directly applying this formula to actual watermarking algorithm, an adaptive watermarking algorithm could be built on this formula with image statistics, such as brightness and contrast.