• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.27-30
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases of header re-elected problem, decreases of header re-elected problem and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header because the remaining energy level goes low, it sends a beacon message to neighbor member nodes and the second header will serve as the cluster header.

• Journal of Practical Engineering Education
• /
• v.12 no.1
• /
• pp.117-125
• /
• 2020

According to the government's smart factory promotion project for small and medium-sized enterprises, more than 10,000 intelligent factories are scheduled or already built in the country and the government-led goal is to nurture 100,000 skilled workers by 2022. Smart Factory introduces numerous types of education and training courses from the supplier's point of view, such as training institutions belonging to local governments, some universities, and public organizations, in the form of an efficient resource management system and ICT technology convergence in the automated manufacturing equipment. The lack of linkage with the NCS, the standard for training, seems to have room for rethinking and direction. Results of survey is provided for the family companies of K-University in the metropolitan area and Chungnam area, and analyzes job demands by identifying whether or not they want to introduce smart factories. Defining the practitioners who will serve as a window for the introduction of smart factory technology within the company, setting up a training goal in consideration of the career path, and including the level of training required competency units, optional competency units, and training time suitable for introducing and operating smart factories. Author would like to present an NCS-based qualification design plan.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• The Journal of Engineering Geology
• /
• v.23 no.3
• /
• pp.293-304
• /
• 2013

Because the present groundwater law broadly regulates a simple and impractical guideline ignoring aquifer characters and geology, general purpose facilities for protection of groundwater contamination is still considered unsatisfactory to ensure groundwater resources. In recent, there have been growing attempts in the packer development as crucial techniques and devices for groundwater protection. This study investigated the application of packer grouting techniques to contaminated groundwaters of two well sites in the Andong and Yeongi areas, both of which revealed a satisfactory effect with improved water quality: 94% decrease in turbidity at the Andong area and 60% decrease in $NO_3$-N, respectively. Based on aquifer characters including geology, weathering depth, fracture pattern, hydraulic gradient, and the flow path of contaminants, the integrated properties of groundwater contamination should be evaluated and treated with the help of accurate analyses such as bore hole imaging and monitoring data. Packer grouting and casing on well to ensure the useful aquifer free of contaminant are expected to play important role in inhibiting the inflow of contaminants when adequately applied. Therefore it is concluded that these can serve as reliable tools in remediation and protection of contaminated groundwater as well as efficient utilization of groundwater.

• 한국벤처창업학회:학술대회논문집
• /
• 2010.08a
• /
• pp.71-89
• /
• 2010

It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

• Geophysics and Geophysical Exploration
• /
• v.19 no.3
• /
• pp.111-120
• /
• 2016

In order to enhance the connectivity of fracture network as fluid path in enhanced/engineered geothermal system (EGS), the exact locating of hydraulic fractured zone is very important. Hydraulic fractures can be tracked by locating of microseismic events which are occurred during hydraulic fracture stimulation at each stage. However, since the subsurface velocity is changed due to hydraulic fracturing at each stage, in order to find out the exact location of microseismic events, we have to consider the velocity change due to hydraulic fracturing at previous stage when we perform the mapping of microseimic events at the next stage. In this study, we have modified 3D locating algorithm of microseismic data which was developed by Kim et al. (2015) and have developed 3D velocity update algorithm using occurred microseismic data. Eikonal equation which can efficiently calculate traveltime for complex velocity model at anywhere without shadow zone is used as forward engine in our inversion. Computational cost is dramatically reduced by using Fresnel volume approach to construct Jacobian matrix in velocity inversion. Through the numerical test which simulates the geothermal survey geometry, we demonstrated that the initial velocity model was updated by using microseismic data. In addition, we confirmed that relocation results of microseismic events by using updated velocity model became closer to true locations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.11-18
• /
• 2014

Most of the energy efficient MAC protocols for wireless sensor networks (WSNs) are based on duty cycling in a single channel and show competitive performances in a small number of traffic flows; however, under concurrent multiple flows, they result in significant performance degradation due to contention and collision. We propose a multi-channel pipelining (MCP) method for convergecast WSN in order to address these problems. In MCP, a staggered dynamic phase shift (SDPS) algorithms devised to minimize end-to-end latency by dynamically staggering wake-up schedule of nodes on a multi-hop path. Also, a phase-locking identification (PLI) algorithm is proposed to optimize energy efficiency. Based on these algorithms, multiple flows can be dynamically pipelined in one of multiple channels and successively handled by sink switched to each channel. We present an analytical model to compute the duty cycle and the latency of MCP and validate the model by simulation. Simulation evaluation shows that our proposal is superior to existing protocols: X-MAC and DPS-MAC in terms of duty cycle, end-to-end latency, delivery ratio, and aggregate throughput.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of Korean Home Economics Education Association
• /
• v.21 no.4
• /
• pp.105-125
• /
• 2009

This study attempts to extract the necessary criteria as a secondary school home economics teacher through the factor analysis, and to analysis the teacher's and student's perceptions for the requirement criteria of home economics teacher(RCHET) thereof to confirm the necessary criteria as a secondary school home economics teachers. This research was based on the requirement criteria of home economics teacher developed by Korea Institute for Curriculum and Evaluation(KICE) Korean Home Economics Education Association(2008)(KHEEA) collected from secondary, upper secondary school home economics teachers and students in Jeollabuk-do. RCHET encompasses the six areas : (l)'Expert of lesson related to evaluation' (2)'Efficient manager of diverse materials for study', (3)'Student advisor equipped with a teaching sense of duty and sound humanity', (4)'Curriculum expert equipped with a expertise knowledge', (5)'A fair and democratic schoolroom environment promoter'. (6)'Career path counselling expert understanding student's characteristics and environments'. Through the factor analysis, six RCHET factors are more important to teachers than students. According to importance perception for RCHET, home economics teachers' qualification for minor second subject and participation of training program showed similar differences statistically in all RCHET factors. Thus, effort for expertise improvement of teacher had important influence on expertise improvement of teacher. As a result of examining the differences from importance evaluation for RCHET, similar differences from frequence of home project, preference of home economics teacher, manual training and home economics score, interest of home economics showed statistically.