• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.698-701
• /
• 2005

This paper examines that is extracted certain information in forest areas within high resolution imagery based on wavelet transformation. First of all, study areas are selected one more species distributed spots refer to forest type map. Next, study area is cut 256 x 256 pixels size because of image processing problem in large volume data. Prior to wavelet transformation, five texture parameters (contrast, dissimilarity, entropy, homogeneity, Angular Second Moment (ASM≫ calculated by using Gray Level Co-occurrence Matrix (GLCM). Five texture images are set that shifting window size is 3x3, distance .is 1 pixel, and angle is 45 degrees used. Wavelet function is selected Daubechies 4 wavelet basis functions. Result is summarized 3 points; First, Wavelet transformation images derived from contrast, dissimilarity (texture parameters) have on effect on edge elements detection and will have probability used forest road detection. Second, Wavelet fusion images derived from texture parameters and original image can apply to forest area classification because of clustering in Homogeneous forest type structure. Third, for grading evaluation in forest fire damaged area, if data fusion of established classification method, GLCM texture extraction concept and wavelet transformation technique effectively applied forest areas (also other areas), will obtain high accuracy result.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• Journal of Korean Neurosurgical Society
• /
• v.42 no.3
• /
• pp.205-210
• /
• 2007

Objective : Hyperpolarization-activated cyclic nucleotide-gated (HCN) channels mediate the hyperpolarization-activated currents (Ih) that participate in regulating neuronal membrane potential and contribute critically to pacemaker activity, promoting synchronization of neuronal networks. However, distinct regional and cellular localization of HCN channels in the brain have not been precisely defined. Aim of this study was to verify the precise cellular location of HCN1 channels in rat cerebellum to better understand the physiological role these channels play in synaptic transmission between CNS neurons. Methods : HCN1 expression in rat brain was analyzed using immunohistochemistry and electron-microscopic observations. Postsynaptic density-95 (PSD-95), otherwise known as locating and clustering protein, was also examined to clarify its role in the subcellular location of HCN1 channels. In addition, to presume the binding of HCN1 channels with PSD-95, putative binding motifs in these channels were investigated using software-searching method. Results : HCN1 channels were locally distributed at the presynaptic terminal of basket cell and exactly corresponded with the location of PSD-95. Moreover, nine putative SH3 domain of PSD-95 binding motifs were discovered in HCN1 channels from motif analysis. Conclusion : Distinct localization of HCN1 channels in rat cerebellum is possible, especially when analyzed in conjunction with the SH3 domain of PSD-95. Considering that HCN1 channels contribute to spontaneous rhythmic action potentials, it is suggested that HCN1 channels located at the presynaptic terminal of neurons may play an important role in synaptic plasticity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.413-416
• /
• 2007

날이 갈수록 네트워크와 클라이언트 컴퓨터의 성능이 계속 진보되고 있다. 고성능 클라이언트의 증가함에 따라 실시간으로 고품질의 동영상 서비스를 대중적으로 요구되고 있고, 서비스 제공자는 그에 맞는 고비용의 하드웨어 장비를 구축해야 하는 어려움에 직면하고 있다. 하나의 서버에 수백, 수천 개의 클라이언트를 수용할 수 있도록 설계를 하는 경우에, 그 비용은 늘어나고, 시간과 노력 또한 많이 들게 된다. 그럼에도 불구하고, 클라이언트의 수요가 늘어남에 따라 서버의 부담은 급격히 늘어나게 되어, 서비스의 양과 질이 제한을 받게 된다. 우리는 이러한 제한을 극복하고, 서비스 제공자의 부담을 줄이고자 분산 클러스터링이라는 개념을 사용하였다. 이 방법으로 우리는 서버의 부담을 클라이언트에 나누어주어, 서비스를 받고 있는 각 클라이언트도 서버의 기능을 가지게 하였다. 클라이언트가 다른 클라이언트에게 스트리밍 서비스를 가능하도록 한 것이다. 클라이언트에게 서버의 기능이 주어져, 스트리밍 서버의 부담은 클라이언트 수에 영향을 받지 않게 된다. 그로 인해 서버의 비용 및 장비 면에서 이익이 기대되는 연구를 수행하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.964-973
• /
• 2015

Ship Area Network(SAN) can monitor the status of ship in real time and minimize the maintenance costs by connecting various devices to the network. In particular, among researches on SAN, Wireless Sensor Network using sensor nodes that is low-cost, low-power, and multifunctional has a number of advantages. In this paper, we propose cluster-based multi-channel algorithm considering the energy efficiency in wireless sensor network in a ship. The proposed algorithm shows the result of improvement of throughput and energy efficiency, because it reduces interference between clusters by using channel allocation algorithm that is distributed and dynamic.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.580-588
• /
• 2016

Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.608-614
• /
• 2009

In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.547-550
• /
• 2008

Recently, changes in the environment of user-centric internet service such as blog, UCC and IPTV and ubiquitous computing based on web service are needed to high availability system platform. High availability system is to provide safe service continuously even if system failure occurs in clustering system at the network. And it is necessary to synchronize data for reliable service in high availability system. In this paper, I implement DRBD(Disk Replicated Block Device) which is synchronization technique for data of local disks in high availability system.

• Korean Journal of Metals and Materials
• /
• v.48 no.7
• /
• pp.683-689
• /
• 2010

In this study, FeAl based intermetallic matrix composites reinforced with in-situ synthesized TiC particles were fabricated by an in-situ liquid mixing process. The microstructures, mechanical properties and fracture behaviors of the in-situ liquid mixing processed composite were investigated and compared with the vacuum suction casting processed composite. The results showed that the in-situ formed TiC particles exhibited fine and uniform dispersion in the liquid mixing processed composite, while significant grain boundary clustering and coarsening of TiC particles were obtained by the vacuum suction process. It was also shown in both types of composites that the hardness and bending strength were increased with the increase of the TiC volume fractions. Through the study of fractography in the bending test, it was considered that the TiC particles prohibited brittle intergranular fracture of FeAl intermetallic matrix by crack deflections. Because of the uniformly distributed fine TiC particles, the bending strength of the liquid mixing processed composite was superior to that of the casting processed composite.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.29-30
• /
• 2019

본 논문에서는 다중 컨트롤러가 존재하는 분산 SDN 환경에서 과도한 제어 메시지로 인한 과부하된 컨트롤러의 부하를 줄이기 위하여 이주할 스위치를 K-means 군집화와 Harmony Search(HS)를 기반으로 선정 하는 기법을 제안하였다. 기존에 HS를 이용하여 이주할 스위치를 선택하는 기법이 제시되었으나, 시간 소모에 비하여 정확도가 부족한 단점이 있다. 또한 Harmony Memory(HM) 구축을 위해 메모리 소모 또한 크다. 이를 해결하기 위하여 본 논문에서는 유클리드 거리를 기반으로 하는 K-means 군집화를 이용하여 이주할 스위치를 골라내어 HM의 크기를 줄이고 이주 효율을 향상 시킨다.