• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2342-2348
• /
• 1999

DCT-based codebook design using binary tree was proposed to reduce computation time and to solve the initial codebook problem. In this method, DCT coefficient of training vectors that has maximum variance is to be a split key and the mean of coefficients at the location is used as split threshold, then balanced binary tree for final codebook is formed. However edge degradation appears in the reconstructed image, since the blocks of shade region are frequently selected for codevector. In this paper, we propose DCT-based vector quantization codebook design using unbalanced binary tree. Above all, the node that has the largest split key is splited. So the number of edge codevector can be increased. From the simulation results, this method reconstructs the edge region sincerely and shows higher PSNR than previous methods.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.395-400
• /
• 2005

The IEEE 802.11b WLAN supports multiple transmission rates and the rate is chosen in an adaptive manner by an auto rate control algorithm. This auto rate control algorithm deeply affects the total system performance of the IEEE 802.11b WLAN. In this paper, we examine the WLAN performance with regard to the auto rate control algorithm especially the ARF scheme. The experimental results indicate that the ARF scheme works well in the face of signal noise due to node location. However, the ARF scheme severely degrades system performance when multiple nodes contend to obtain the wireless channel and the packet is lost due to signal collision. In addition, TCP prevent the performance degradation due to ARF scheme by retaining number of active nodes. However, some applications, such as transporting multimedia data, adopt the UDP. Therefore, the TCP cannot be an optimal solution for all WLAN applications.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.325-336
• /
• 2006

For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper. design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.771-775
• /
• 2008

Concerns related to protecting, identifying, and isolating of subsystems of a water distribution network have led to the realization of the increased importance of valves in the system. The most important purpose of valves in water distribution systems is to isolate subsystems due to breakage, maintenance activities, or contamination. A subsystem called segment is isolated by the closure of adjacent valves and an efficient algorithm should identify the adjacent valves to minimize the pipe failure impact. In this paper, an algorithm to identify adjacent valves to be closed to isolate a subsystem from the remainder of a network in case of a pipe failure is presented. An application to the water distribution system in Ottawa, Canada demonstrates the developed algorithm efficiently locates the adjacent valves for the isolation of a broken pipe.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.428-437
• /
• 2006

Wireless ad-hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad-hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called Geographic Landmark Routing(GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.438-450
• /
• 2006

Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.6
• /
• pp.2781-2785
• /
• 2016

Background: Matric metalloproteinase (MMP) 13 gene expression is increased in esophageal squamous cell carcinomas (ESCCs) and associated with increasing tumor invasion, lymph node involvement and decreased survival rates. Levels of the circulating enzyme may be elevated and used as a marker of tumor progression. In this study, clinical application of MMP-13 serum levels was evaluated for early detection, prediction of prognosis and survival time of ESCC patients. Materials and Methods: Serum levels of MMP13 were determined by ELISA in 66 ESCC patients prior of any treatment and 54 healthy controls for comparison with clinicopathological data through statistical analysis with Man Whitney U and Log-Rank tests. In addition, clinical value of MMP13 levels for diagnosis was evaluated by receiver operating characteristic (ROC) test. Results: The serum level of MMP-13 in patients (>250 pg/ml) was significantly higher than in the control group (<100 pg/ml) (p value=0.004). Also the results showed a significant correlation between MMP-13 serum levels with tumor stage (p value = 0.003), depth of tumor invasion (p value=0.008), involvement of lymph nodes (p value = 0.011), tumor size (p value = 0.018) and survival time. While there were no significant correlation with grade and location of tumors. ROC analysis showed that MMP-13 level is an accurate diagnostic marker especially to differentiate pre-invasive/ invasive lesions from normal controls (sensitivity and specificity: 100%). Conclusions: These findings indicate a potential clinical significance of serum MMP13 measurement for early detection and prognostic assessment in ESCC patients.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.57-67
• /
• 2015

A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.

• Korean Circulation Journal
• /
• v.48 no.12
• /
• pp.1081-1096
• /
• 2018

We reviewed the anatomical characteristics of the conduction system in the ventricles of human and ungulate hearts and then raised some questions to be answered by clinical and anatomical studies in the future. The ventricular conduction system is a 3-dimensional structure as compared to the 2-dimensional character of the atrial conduction system. The proximal part consisting of the atrioventricular node, the bundle of His and fascicles are groups of conducting cells surrounded by fibrous connective tissue so as to insulate from the underlying myocardium. Their location and morphological characters are well established. The bundle of His is a cord like structure but the left and right fascicles are broad at the proximal and branching at the distal part. The more distal part of fascicles and Purkinje system are linear networks of conducting cells at the immediate subendocardium but the intra-mural network is detected at the inner half of the ventricular wall. The papillary muscle also harbors Purkinje system not in the deeper part. It is hard to recognize histologically in human hearts but conducting cells as well as Purkinje cells are easily recognized in ungulate hearts. Further observation on human and ungulate hearts with myocardial infarct, we could find preserved Purkinje system at the subendocardium in contrast to the damaged system at the deeper myocardium. Further studies are necessary on the anatomical characteristics of this peripheral conduction system so as to correlate the clinical data on hearts with ventricular arrhythmias.