• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.

• Journal of the Korean Solar Energy Society
• /
• v.31 no.6
• /
• pp.72-77
• /
• 2011

The purpose for installation of offshore weather station is a measurement of wind resources and so on. If weather station is operated, it will be possible to analysis for wind resource and arrangement of wind farm by using measured data. In this paper, we carried out the development of offshore wind resource measurement system for measuring offshore wind resource. Also, In order to monitor for real-time wind data with 1 Hz, we installed the wireless transmission system. All wind characteristic data are sent to the server PC through the this system is connected outport of DataLogger. Transmitted wind data were used in order to look at in the Web-page and tablet PC on a real time basis in a graph. In this paper, we will introduce about the wind resource measurement and remote monitoring system that is the result of study.

• Communications of Mathematical Education
• /
• v.24 no.3
• /
• pp.709-730
• /
• 2010

The inverse function of a one-to-one correspondence is explained with a graph, a numerical formula or other useful expressions. The purpose of this paper is to know how low achieving students understand the learning contents needed reversible thinking about irrational functions. Low achieving students in this study took paper-pencil test and their written answers were collected. They made various mistakes in solving problems. Their error types were grouped into several classes and identified in this analysis. Most students did not connected concepts that they learned in the lower achieving students to think in reverse order in case of and to visualize concepts of functions. This paper implies that it is very important to take into account students' accommodation and reversible thinking activity.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.2
• /
• pp.55-64
• /
• 2000

In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{［2］}$, the proposed algorithm gives similar results with much less computation time.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.26-51
• /
• 2003

Large scale protein interaction maps provide a new, global perspective with which to analyse protein function. PSIMAP, the Protein Structural Interactome Map, is a database of all the structurally observed interactions between superfamilies of protein domains with known three-dimensional structure in thePDB. PSIMAP incorporates both functional and evolutionary information into a single network. It makes it possible to age protein domains in terms of taxonomic diversity, interaction and function. One consequence of it is to predict the most important protein domain structure in evolution. We present a global analysis of PSIMAP using several distinct network measures relating to centrality, interactivity, fault-tolerance, and taxonomic diversity. We found the following results: ${\bullet}$ Centrality: we show that the center and barycenter of PSIMAP do not coincide, and that the superfamilies forming the barycenter relate to very general functions, while those constituting the center relate to enzymatic activity. ${\bullet}$ Interactivity: we identify the P-loop and immunoglobulin superfamilies as the most highly interactive. We successfully use connectivity and cluster index, which characterise the connectivity of a superfamily's neighbourhood, to discover superfamilies of complex I and II. This is particularly significant as the structure of complex I is not yet solved. ${\bullet}$ Taxonomic diversity: we found that highly interactive superfamilies are in general taxonomically very diverse and are thus amongst the oldest. This led to the prediction of the oldest and most important protein domain in evolution of lift. ${\bullet}$ Fault-tolerance: we found that the network is very robust as for the majority of superfamilies removal from the network will not break up the network. Overall, we can single out the P-loop containing nucleotide triphosphate hydrolases superfamily as it is the most highly connected and has the highest taxonomic diversity. In addition, this superfamily has the highest interaction rank, is the barycenter of the network (it has the shortest average path to every other superfamily in the network), and is an articulation vertex, whose removal will disconnect the network. More generally, we conclude that the graph-theoretic and taxonomic analysis of PSIMAP is an important step towards the understanding of protein function and could be an important tool for tracing the evolution of life at the molecular level.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.16 no.2
• /
• pp.93-102
• /
• 2014

This quantitative research aims to examine the connectivity of forest networks in seven metropolitan cities of South Korea using a graph-theoretical approach. We first estimated an overall network connectivity at multi-scales (i.e., dispersal distances), ranging from 100 m to 20 km, and quantified the contribution of small forest patches (less than 10 ha) to the overall network connectivity by comparing networks according to the presence and absence of small ones. As a result, the cities were divided into two groups depending on the network connectivity; one group of cities with high connectivity such as Daegu, Daejeon, and Ulsan and the other group of cities with low connectivity including Gwangju, Busan, Seoul, and Incheon. The result showed that small forest patches, especially in the cities with low connectivity, played a key role as stepping stones that connect large forested patches, thereby contributing to maintaining connectivity. This study also suggests that large and well-connected forest areas may be the key factor to preserve the connectivity in the cities with high connectivity, while the cites with low connectivity are in need of some complementary strategies. Through the study, we suggest that the creation of new forest patches in the areas where a gap in connectivity presents is needed in order to improve connectivity; and that the conservation of the existing small forest patches is essential in order to maintain the current connectivity level.

• Journal of Korean Society of Rural Planning
• /
• v.21 no.4
• /
• pp.177-186
• /
• 2015

The main objective of this study was to assess the applicability of IoT (Internet of Things)-based flood management under climate change by developing intelligent water level monitoring platform based on IoT. In this study, Arduino Uno was selected as the development board, which is an open-source electronic platform. Arduino Uno was designed to connect the ultrasonic sensor, temperature sensor, and data logger shield for implementing IoT. Arduino IDE (Integrated Development Environment) was selected as the Arduino software and used to develop the intelligent algorithm to measure and calibrate the real-time water level automatically. The intelligent water level monitoring platform consists of water level measurement, temperature calibration, data calibration, stage-discharge relationship, and data logger algorithms. Water level measurement and temperature calibration algorithm corrected the bias inherent in the ultrasonic sensor. Data calibration algorithm analyzed and corrected the outliers during the measurement process. The verification of the intelligent water level measurement algorithm was performed by comparing water levels using the tape and ultrasonic sensor, which was generated by measuring water levels at regular intervals up to the maximum level. The statistics of the slope of the regression line and $R^2$ were 1.00 and 0.99, respectively which were considered acceptable. The error was 0.0575 cm. The verification of data calibration algorithm was performed by analyzing water levels containing all error codes in a time series graph. The intelligent platform developed in this study may contribute to the public IoT service, which is applicable to intelligent flood management under climate change.

• Journal of Navigation and Port Research
• /
• v.29 no.8 s.104
• /
• pp.723-733
• /
• 2005

This paper presents a deadlock avoidance method for AGVs in automated container terminals. For a more efficient use of AGV traveling area, we divided the area into small-sized grids not enough to cover a whole AGV. Our deadlock avoidance method controls AGVs by identifying strongly connected components(SCCs) in a graph derived from the paths of AGVs on the grids. Also in this paper we suggest a route selection scheme which selects a route by predicting and comparing travel times of candidate routes by using a regression formula. Simulation experiments have shown that the proposed method can control AGVs for 48 hours without deadlocks and the count of AGV visits per QC is increased by $2\~10$ an hour.