• Journal of Species Research
• /
• v.4 no.spc
• /
• pp.1-112
• /
• 2015

The 2015 version of the bibliographic checklist of Korean spiders from the first checklist by Paik and Kim (1956) is presented, together with a complete bibliography of relevant Korean araneological literature. A total of 620 publications during 1907-2015 including original description on the Korean spiders and records of taxonomic description were critically reviewed. Records only from locations within the present borders of South Korea are listed. A total of 748 spider species of 271 genera belonging to 46 families are confirmed to exist in Korea. Twenty one species, whose distribution or existence within the Korean border are uncertain and lacked valid records, are excluded from the present list pending critical validation. Four spider species endemic to North Korean are listed separately from the present list. One genus, Joopilia Chae and Sohn, 2013 and 2 species, Joopilia jooplis Chae and Sohn, 2013 and Dolomedes jirisanensis Kim and Chae, 2012, which had no designated type species and no diagnosis, are cited as nomina nuda. New synonyms of 15 previously described spider species are proposed. Based on their zoogeographical distribution, the Korean spider fauna was found to be influenced by the northern species, including 36 Holarctic and 72 Palearctic species (14.5% of the total species). Korean endemic species include 160 species (21.5% of the total species). Korean indigenous spiders are also distributed in neighboring countries: 318 species in Russia (42.7%), 460 in China (61.7%), and 488 in Japan (65.5%).

• Journal of the Korean housing association
• /
• v.26 no.3
• /
• pp.77-84
• /
• 2015

The purpose of this study is to analyze the aesthetic factors in color combinations of house exteriors in hillside villages, Busan. The so-called 'Hillside renaissance' is a representative urban regeneration project in Busan. The towns in hillside area in Busan have developed colorful sceneries. But all the colorful sceneries are not the same. Each town has own color characters and different aesthetic color effects. This study is to determine the unique aesthetic components in color combination of Gamcheon and Daecheong. This study is based on the traditional color harmony theories. The analysis focuses, inter alia, on Moon-Spencer's 'Aesthetic Measure'. A house exterior color has relations with two neighboring colors in array. And those three colors with next two houses have again each three hue, value and chroma relations. This analysis is first to determine whether each sample color combination is harmonized, and if harmonized, next step to list which aesthetic factor is dominantly contributing to color harmony. And at last, to study the subcategorized sectors of each color components of the hue, value and chroma.

• Journal of Species Research
• /
• v.8 no.4
• /
• pp.395-406
• /
• 2019

The aim of this study was to compile a species list of endemic water beetles of Mongolia and determine their distribution patterns. A total of 1,179 individuals of endemic water beetles were collected from nine different sub-basins (123 sample points) throughout the country. Currently, 21 endemic and sub-endemic species have been recorded in Mongolia. Eight of these species were strictly endemic. The endemic and sub-endemic species were found only among four families: Dytiscidae (10 out 99 spp.), Gyrinidae (1 out 7 spp.), Helophoridae (5 out 16 spp.), and Hydraenidae (5 out 13 spp.). The rate of endemism was higher in Hydraenidae than other families (38.4%). Endemic beetle fauna was most similar between the Onon and Kherlen River Basins (80%). Helophorus parajacutus Angus, 1970 was common in five sub-basins, but Agabus kaszabi $Gu{\acute{e}}orguiev$, 1972, Gyrinus sugunurensis Nilsson, 2001 and Ochthebius mongolicus Janssens, 1967 were recorded from only one sub-basin. In terms of sub-endemic species, Mongolia was mostly similar to the fauna of Eastern Siberia, Russia (73.7%) than other neighboring regions. Due to Mongolia's vast territory and different natural zones, endemism was exceptionally low (12.4%), but these data provide baseline information of endemic and rare species for their further conservation.

• Korean Journal of Plant Taxonomy
• /
• v.52 no.1
• /
• pp.24-28
• /
• 2022

Pteris griffithii Hook., one of the rarest fern species on the Indian subcontinent, is reported from Bhutan for the first time. The identity of this species was confirmed through morphological determination at the National Herbarium (THIM) of the National Biodiversity Centre (NBC) of Bhutan. It was found only in one location, in Gyelpozhing in eastern Bhutan, at an elevation of 521 m a.s.l. on 10 January 2016. Given that a very limited study of this species was conducted, the knowledge baseline with regard to its distribution is poor. It is also reported that this species has not been found for several years. The species is also considered to be very rare or critically endangered in some countries; however, there are no assessments on the International Union for Conservation of Nature (IUCN) Red List for this particular species. This paper attempts to provide baseline information considering its rarity and data deficiency. This species is also reported from the adjacent neighboring Indian state of Arunachal Pradesh as very rare, and also from Myanmar; however, confirmation of its presence in China is not clear at this time. Therefore, considering its data deficient status, we attempt to document it scientifically to create a knowledgebase pertaining to this particular species. Concurrently, this species merits further research to understand its distribution patterns in Bhutan and any related anthropogenic threats.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.3
• /
• pp.332-337
• /
• 2016

The rapid reconstruction of a transfer path is caused by frequent secession of nodes in many applications using overlay multicast. For this, however, many studies have been proposed, but a study of fast path recovery is required. This paper proposes a new method for fast path recovery to improve the path reconstruction time and for stable path maintain caused by the sudden secession of the parent node on overlay multicast. The proposed method uses the virtual transfer path and the candidate parent node for the fast path recovery. All nodes exchange periodically the RTT (Round Trip Time) information between the other nodes of similar position itself and neighboring node. All nodes have a candidate parent node list, and each node stores the exchanged RTT information on the list. Each node constructs the virtual transfer path to reduce the recovery time after deciding a candidate parent node that is one of them by the RTT order. In this way, when the parent node is seceded, all nodes can recover the transfer path quickly using the virtual transfer path. The simulation result showed that the recovery time of the proposed method is an average 30% faster than the known method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.35-45
• /
• 2009

In an open environment such as Home Network, ZigBee Cluster comprising a plurality of Ato-cells is required to provide intense security over the movement of collected, measured data. Against this setting, various security issues are currently under discussion concerning master key control policies, Access Control List (ACL), and device sources, which all involve authentication between ZigBee devices. A variety of authentication methods including Hash Chain Method, token-key method, and public key infrastructure, have been previously studied, and some of them have been reflected in standard methods. In this context, this paper aims to explore whether a new method for searching for neighboring devices in order to detect device replications and Sybil attacks can be applied and extended to the field of security. The neighbor detection applied method is a method of authentication in which ACL information of new devices and that of neighbor devices are included and compared, using information on peripheral devices. Accordingly, this new method is designed to implement detection of malicious device attacks such as Sybil attacks and device replications as well as prevention of hacking. In addition, in reference to ITU-T SG17 and ZigBee Pro, the home network equipment, configured to classify the labels and rules into four categories including user's access rights, time, date, and day, is implemented. In closing, the results demonstrates that the proposed method performs significantly well compared to other existing methods in detecting malicious devices in terms of success rate and time taken.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.10
• /
• pp.556-564
• /
• 2004

This paper presents an application of parallel Genetic Algorithm-Tabu Search(GA-TS) algorithm to search an optimal solution of a reconfiguration in distribution system. The aim of the reconfiguration of distribution systems is to determine switch position to be opened for loss minimization in the radial distribution systems, which is a discrete optimization problem. This problem has many constraints and very difficult to solve the optimal switch position because it has many local minima. This paper develops parallel GA-TS algorithm for reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10% of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node aster predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium Ⅳ CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution systems in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution qualify. speedup. efficiency and computation time.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.116-124
• /
• 2005

This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.