• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1807-1813
• /
• 2018

In this paper, the fault line selection and location problems of single line-to-ground (SLG) fault in distribution network are addressed. Firstly, the adaptive filtering property for empirical mode decomposition is formulated. Then in view of the different characteristics showed by the intrinsic mode functions(IMF) under different fault inception angles obtained by empirical mode decomposition, the sign of peak value about the low-frequency IMF and the capacitance transient energy is chosen as the fault line selection criteria according to the different proportion occupied by the low-frequency components. Finally, the fault location is determined based upon the comparison result with adjacent fault passage indicators' (FPI) waveform on the strength of the interaction between the distribution terminal unit(DTU) and the FPI. Moreover, the logic nodes regarding to fault line selection and location are newly expanded according to IEC61850, which also provides reference to acquaint the DTU or FPI's function and monitoring. The simulation results validate the effectiveness of the proposed fault line selection and location methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1201-1206
• /
• 2007

In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering algorithm. The collected sensing information by sensor nodes in each cluster are transferred to sink node using inter-cluster communications method. Cluster head (CH) that located nearby sink node spend much more energy than those of far from sink node, because nearer CH forwards more data, so network lifetime has a tendency to decrease. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster size, and improve CH lifetime by distributing transmission paths. As a result of mathematical analysis, the proposed algorithm shows longer network lifetime in WSN.

• Korean Journal of Remote Sensing
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2002

A hybrid image segmentation algorithm is proposed which integrates edge-based and region-based techniques through the watershed algorithm. First, by using mean curvature diffusion coupled to min/max flow, noise is eliminated and thin edges are preserved. After images are segmented by watershed algorithm, the segmented regions are combined with neighbor regions. Region adjacency graph (RAG) is employed to analyze the relationship among the segmented regions. The graph nodes and edge costs in RAG correspond to segmented regions and dissimilarities between two adjacent regions respectively. After the most similar pair of regions is determined by searching minimum cost RAG edge, regions are merged and the RAG is updated. The proposed method efficiently reduces noise and provides one-pixel wide, closed contours.

• Journal of the Korean Institute of Educational Facilities
• /
• v.28 no.6
• /
• pp.15-28
• /
• 2021

This study aims to propose a hypothetical urban neighborhood, HanGyo-dong, which is a model for understanding the relationship between the neighborhood change and educational facilities. Three issue layers of the model derived from preceding case studies are: establishment, relocation and redevelopment of educational facilities; formation and redevelopment of adjacent residential areas; and growth of neighborhood commercial cores. The neighborhood changes observed through HanGyo-dong include (1) the formation of educational base and commercial activities along the stream, (2) the growth of student and intellectual community and the installment of public transportation nodes, and (3) the relocation of schools and hospitals followed by a series of redevelopments of single family house into multi-family housing of low-rise residence and high rise apartment complex. The findings call for the collaborative practice of educational administration and neighborhood planning regarding how educational facilities, which were the tool for urban expansion policy, will contribute to the development of the neighborhood's identity as a localized hub.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.163-172
• /
• 2022

The interconnection of an enormous number of devices into the Internet at a massive scale is a consequence of the Internet of Things (IoT). As a result, tasks offloading from these IoT devices to remote cloud data centers become expensive and inefficient as their number and amount of its emitted data increase exponentially. It is also a challenge to optimize IoT device energy consumption while meeting its application time deadline and data delivery constraints. Consequently, Fog Computing was proposed to support efficient IoT tasks processing as it has a feature of lower service delay, being adjacent to IoT nodes. However, cloud task offloading is still performed frequently as Fog computing has less resources compared to remote cloud. Thus, optimized schemes are required to correctly characterize and distribute IoT devices tasks offloading in a hybrid IoT, Fog, and cloud paradigm. In this paper, we present a detailed survey and classification of of recently published research articles that address the energy efficiency of task offloading schemes in IoT-Fog-Cloud paradigm. Moreover, we also developed a taxonomy for the classification of these schemes and provided a comparative study of different schemes: by identifying achieved advantage and disadvantage of each scheme, as well its related drawbacks and limitations. Moreover, we also state open research issues in the development of energy efficient, scalable, optimized task offloading schemes for Fog computing.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.sup3
• /
• pp.179-183
• /
• 2016

Breast cancer is the most prevalent type of cancer among women around the world, and mortality is primarily caused by micro-metastatic disease. The complex mechanisms of breast cancer invasion and metastasis are intrinsically related to the malignant cell type so that early detection of micro-metastases can help prolongation of survival for patient. The aim of the present research work was evaluation of the expression status of mammoglobin protein as a candidate molecular marker in the negative sentinel lymph node (SLN). Fifty tumor specimens, and 50 normal adjacent breast tissue samples from the same patients were selected on the basis of having more than 10% tumor content for RNA extraction from SLNs. Tumor samples and normal adjacent breast tissue were archived in the form of frozen fresh tissue in liquid nitrogen. Real-time PCR was performed on a Bioner life express gradient thermal cycler system. Mammoglobin gene overexpression in breast cancer metastasis was investigated. Single marker results were mammaglobin 66.7% and CK19 50.0%, with 58.3% for the two in combination. Due to improved outcome with at least 3 genes (83.3%), it seems, triple marker evaluation will be most likely useful for detecting micro-metastases instead of studying separate genes.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.27 no.3
• /
• pp.38-46
• /
• 1990

A numerical solution method of the boundary integral equation for axisymmetric potential flows is presented. Those are represented by ring source and ring vorticity distribution. Strengths of ring source and ring vorticity are approximated by linear functions of a parameter $\zeta$ on a segment. The geometry of the body is represented by a cubic B-spline. Limiting integral expressions as the field point tends to the surface having ring source and ring vorticity distribution are derived upto the order of ${\zeta}ln{\zeta}$. In numerical calculations, the principal value integrals over the adjacent segments cancel each other exactly. Thus the singular part proportional to $\(\frac{1}{\zeta}\)$ can be subtracted off in the calculation of the induced velocity by singularities. And the terms proportional to $ln{\zeta}$ and ${\zeta}ln{\zeta}$ can be integrated analytically. Thus those are subtracted off in the numerical calculations and the numerical value obtained from the analytic integrations for $ln{\zeta}$ and ${\zeta}ln{\zeta}$ are added to the induced velocity. The four point Gaussian Quadrature formula was used to evaluate the higher order terms than ${\zeta}ln{\zeta}$ in the integration over the adjacent segments to the field points and the integral over the segments off the field points. The root mean square errors, $E_2$, are examined as a function of the number of nodes to determine convergence rates. The convergence rate of this method approaches 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.459-468
• /
• 2006

Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.23-33
• /
• 2013

W ith the recent advancement of IoT (Internet of Things) technology, there has been much interest in the spatial query processing which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. Therefore, various kinds of spatial query processing algorithms and distributed spatial indexing methods have been proposed. They can minimize energy consumption of sensor nodes by reducing wireless communication among them using in-network spatial filtering technology. However, they cannot optimize multiple spatial queries which w ill be w idely used in IoT, because most of them have focused on a single spatial query optimization. Therefore, we propose a new multiple spatial query optimization algorithm which can energy-efficiently process multiple spatial queries in a sensor network. The algorithm uses a concept of 'query merging' that performs the merged set after merging multiple spatial queries located at adjacent area. Here, our algorithm makes a decision on which is better between the merged and the separate execution of queries. For such the decision making, we additionally propose the cost estimation method on the spatial query execution. Finally, we analyze and clarify our algorithm's distinguished features using the spatial indexing methods of GR-tree, SPIX, CPS.