• Journal of the Korean Association of Oral and Maxillofacial Surgeons
• /
• v.34 no.2
• /
• pp.135-140
• /
• 2008

Loss of E-cadherin (E-cad) expression has been found in multiple cancers and is postulated to facilitate tumor cell dissociation and metastais. Promotor methylation may provides an alternative pathway for loss of gene function. This study evaluated the role of hypermethylation in the down-regulation of E-cad in oral squamous cell carcinoma (OSCC). We examined the E-cad expression by immunohistochemical staining and detected methylation status by methylation-specific polymerase chain reaction (MSP) in 20 OSCC tissues. Overally, 12 (60%) cases of hypermethylation of E-cad were detected and we found there were no correlation between methylation and age, histologic grade, lympn node metastasis, tumor size and clinical stage. However, Eleven (73.3%) of 15 samples which was negative for E-cad staining showed hypermethylation of E-cad promotor region. On the other hand, only one (20%) of 5 E-cad positive sample was observed with methylated status. The underexpression of E-cad was found to be related to promotor hypermethylation (p=0.035). In conclusion, we suggest that hypermethylation play a role in inactivation of E-cad gene and may be a appreciable biomarker for diagnosis and treatment of OSCC.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.817-826
• /
• 2005

BcN(Broadband convergence Network) is being developed in order to support a variety of network applications, with enhanced capabilities of QoS(Quality of Service) provisioning and security, and IPv6. In a high-speed network environment such as BcN, it if more likely for the network resources to be exposed to various intrusion activities. The propagation speed of intrusion is alto expected to be much faster than in the existing Internet In this paper, we present a multi-domain security management framework which my be used for a global intrusion detection at multiple domains of BcN and describe its characteristics. For the performance evaluation, we first present test results for the security node and compare with other products. Then we design and Implement an OPNET simulator for the proposed framework, and present some simulation results. In the simulation model, we focus on the performance of alert information in the security overlay network.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.28 no.4
• /
• pp.9-20
• /
• 2000

The purpose of thus paper is to provide the knowledge on preparing for the planting soil and planting method, and maintenance at the reclaimed seaside. Based on the collected data from the field work, the soil environment, the growth of height, inter-node, tree ring and roots of the two species had been analyzed. The determinant of soil factors, affecting the growth of trees, turned out to be six elements such as soil hardness, soil acidity, potassium, calcium, magnesium and total nitrogen. Because the variances of both growth of tree height and tree ring are greater than that of root, the growth characteristics of ground parts of the species by the individual tree species is more dynamical than those of underground parts. From the mean difference test the growth of height, root between Pinus thunbergii and Zelkova serrata, have been turned out to be statistically significant at 5 percent level. Pinus thunbergii is a sapling, so it grows faster than Zelkova serrata while Pinus thunbergii has better roots system than Zelkova serrata. From the correlation analysis, it showed the very strong correlation between tree height growth and potassim, while the lowest correlation coefficient was between soil hardness and potassim as 0.744. From the multiple regression analysis, both soil hardness and magnesium affect to the tree growth, soil hardness and potassium to the tree growth, potassium and calcium to the rot growth, respectively. Using this research results, we can be use the planting plan including revegetation, construction and maintenance of the reclaimed seaside. In the future, the planting method including the ground preparation and tree species selection for the reclaimed seaside should be accompanied in advanced through the soil survey and relevant analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2245-2252
• /
• 1999

Since DSM provides a user a simple shared memory abstraction, the user does not have to be concerned with data movement between hosts. Each node in DSM systems has processor, memory, and connection to a network. Memory is divided into pages, and a page can have multiple copies in different nodes. To maintain data consistency between nodes, two conventional protocols are used : write-update protocol and invalidate protocol. The performance of these protocols depends on the system parameters and the memory access patterns. for adapting to memory access patterns, competitive update protocol updates those copies of a page that are expected to be used in the near future, while selectively invalidating other copies. We present weighted competitive update protocols that consider different communication bandwidth for each connection a of two nodes. Test result by simulation show that the weighted competitive update protocol improves performance.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.45-54
• /
• 2007

As one of the most threatening attacks, DDoS attack makes distributed multiple agents consume some critical resources at the target within the short time, thus the extent and scope of damage is serious. Against the problems, the existing defenses focus on detection, traceback (identification), and filtering. Especially, in the hierarchical networks, the traffic congestion of a specific node could incur the normal traffic congestion of overall lower nodes, and also block the control traffic for notifying the attack detection and identifying the attack agents. In this paper, we introduce a DDoS attack tolerant network structure using a hierarchical overlay for hierarchical networks, which can convey the control traffic for defense such as the notification for attack detection and identification, and detour the normal traffic before getting rid of attack agents. Lastly, we analyze the overhead of overlay construction, the possibility of speedy detection notification, and the extent of normal traffic transmission in the attack case through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.217-224
• /
• 2010

In this paper, we propose a hard handover algorithm for a base station's self-optimization, one of the automatic operational technologies for the 3GPP LTE systems. The proposed algorithm simultaneously considers a mixed target sell selection method for optimal selection and a multiple parameter based active hysteresis method with the received signal strength from adjacent cells and the cell load information of the candidate target cells from information exchanges between eNBs through X2 interface. The active hysteresis method chooses optimal handover hysteresis value considering the costs of the various environmental parameters effect to handover performance. The algorithm works on the optimal target cell and the hysteresis value selections for a base station's automatic operational optimization of the LTE system with the gathered informaton effects to the handover performance. The simulation results show distinguished handover performances in terms of the most important performance indexes of handover, handover failure rate and load balancing.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.358-370
• /
• 2007

Software simulations have been widely used for the design and application development of a wireless sensor network that is an infrastructure of ubiquitous computing. In this study, we develop a sensor network simulator that can verify the behavior of sensor network applications, estimate execution time and power consumption, and simulate a large-scale sensor network. To implement the simulator, we use an instruction-level parallel discrete-event simulation method. Instruction-level simulation uses executable images loaded into a real sensor board as workload, such that it results in the high degree of details. Parallel simulation makes simulation of a large-scale sensor network possible by distributing workload into multiple computers. The simulator can predict the amount of power consumption based on operating time of modules in a sensor node and counting the number of executed instructions by kind. Also it can simulate ubiquitous applications with various scenarios and debug programs. Instruction traces used as workload for simulations are executable images produced by the cross-compiler for ATmega128L microcontroller.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.177-185
• /
• 2014

It has been occurred many times that wireless sensor networks (WSNs) had congested areas because all the sensing data collected by multiple sensor nodes are delivered to one sink node. Typically, in order to control congested areas, it used to reduce the traffic by increasing the sensing period or discarding packets. However, those schemes have a disadvantage that it loses the reliability when delivering sensing data. Moreover, there are no schemes considering case of having poor quality of links between nodes in practical terms. In this paper, we suggest a scheme not to reduce the traffic but to distribute the traffic by changing routing paths depends on the traffic and the quality of links. Also, it can be seen that the reliability of delivering of the sensing data is improved with the experiments improving collection rates and shortening end-to-end delay.