• Journal of Life Science
• /
• v.17 no.7 s.87
• /
• pp.882-888
• /
• 2007

Enzyme electrophoresis was used to estimate genetic diversity and population genetic structure of Pseudobagrus fulvidraco in Korea. Nine of the 14 loci (64.3%) showed detectable polymorphism. Genetic diversity at the population and species levels were 0.286 and 0.277, respectively. Analysis of fixation indices, calculated for all polymorphic loci in each population, showed a substantial deficit of hetero-zygotes relative to Hardy-Weinberg expectations. This deficit is expected that it is due to a limited effective number of individuals per population. The average $G_{ST}$ for polymorphic loci was 0.064, indicating that most (93.6%) of the genetic diversity occurred within populations. The indirect estimate of gene flow based on mean $G_{ST}$ was 3.67. Given limited gene flow is expected to diverge genetically due to drift and reduced populations. Most populations in our study experience annual, severe demo-graphic bottlenecks due to drought and floods.

• Journal of The Korean Astronomical Society
• /
• v.47 no.2
• /
• pp.43-47
• /
• 2014

Many advanced ground-based solar telescopes improve the spatial resolution of observation images using an adaptive optics (AO) system. As any AO correction remains only partial, it is necessary to use post-processing image reconstruction techniques such as speckle masking or shift-and-add (SAA) to reconstruct a high-spatial-resolution image from atmospherically degraded solar images. In the New Vacuum Solar Telescope (NVST), the spatial resolution in solar images is improved by frame selection and SAA. In order to overcome the burden of massive speckle data processing, we investigate the possibility of using the speckle reconstruction program in a real-time application at the telescope site. The code has been written in the C programming language and optimized for parallel processing in a multi-processor environment. We analyze the scalability of the code to identify possible bottlenecks, and we conclude that the presented code is capable of being run in real-time reconstruction applications at NVST and future large aperture solar telescopes if care is taken that the multi-processor environment has low latencies between the computation nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.69-70
• /
• 2017

As the industry develops, the size of buildings and ships are getting bigger and more complicated. In such a complex space, emergency evacuation systems are required because of the possibility of casualties when an accident situation occurs. However, because present systems are composed of basic devices, such as alarms, emergency exit signs, and announcement regarding the situation and inform only the least information to evacuees, evacuees are not able to judge objectively. To solve these problems, various evacuation algorithms have been proposed. However, these studies aim to search evacuation routes based on specific risk factors or to model the effects of bottlenecks in evacuation situations. Therefore, there is a limit to apply to real systems. Therefore, we propose algorithms to search the optimal evacuation route considering various risk factors such as fire and bottleneck in evacuation situations and to be applicable in actual situation in this paper. Performance evaluation using computer simulations showed that the proposed scheme is effective.

• The Journal of Fisheries Business Administration
• /
• v.15 no.2
• /
• pp.1-23
• /
• 1984

In fisheries financing before the liberation of Korea, the accommodation of funds through modern monetary facilities was hardly benefited to most of small-scale Korean fishermen except Japanese fishermen living in Korea and some large-scale Korean fishermen. In fact, since Korean economy was only in the beginning stage of capitalism free from natural economy in the end of Yi Dynasty, it was natural that the supply of funds should be lacked. But after the opening of ports in Korea, the external shapes in Korean society were slowly changed according as heteronomous modernization was pushed forward by means of western capitalism and the intentional invasion of Japanese was gradually weighed. Thus all kinds of fishing equipments and technique were developed by dint of modernization, and modern monetary facilities also came into being. But most of Korean fishermen were hardly benefited by modern monetary facilities. Fishermen who were faced with destitution of funds were forced to rely upon high interest loans in order to make a living or maintain fisheries, and they were severely exploited by usurers. The situation was the same in the period of Japanese imperialism. Japanese felt the necessity of advancement of Korean fisheries and established fisheries institution suitable for all kinds of colonial fisheries policy toward Korea so that they could build up the foundation according to the development of capitalism and carry out the Russo-Japanese War and the Sino-Japanese War. There were a series of bottlenecks in financing on account of the deficiency of fisheries institution in the beginning of Japanese imperialism, but the financial pressure was lightened because the arrangement of institution greatly contributed to the smoothness of fisheries financing in the latter part of it. Despite such improvement of financing, the benefit of funds could not equally reach to all the fishermen. It only reached to Japanese fishermen living in Korea and some large scale Korean fishermen. Thus most of korean fishermen could not free themselves from destitution of financing and the pressure of high interest loans. This phenomenon took place because Korean fisheries had the antinomic characteristics that financial restriction was excessive owing to the industrial speciality of fisheries, on the other hand there was a large financial demand in fisheries in the character of industry.

• The Journal of Information Systems
• /
• v.29 no.2
• /
• pp.131-147
• /
• 2020

Purpose The purpose of this study is to develop intelligent vehicle parking distribution system based on LoRa network at the circumstance of traffic congestion during cultural festival in a local city. This paper proposes a parking dispatch and distribution system using a Q-learning algorithm to rapidly disperse traffics that increases suddenly because of in-bound traffics from the outside of a city in the real-time base as well as to increase parking probability in a parking lot which is widely located in a city. Design/methodology/approach The system get information on realtime-base from the sensor network of IoT (LoRa network). It will contribute to solve the sudden increase in traffic and parking bottlenecks during local cultural festival. We applied the simulation system with Queuing model to the Yudeung Festival in Jinju, Korea. We proposed a Q-learning algorithm that could change the learning policy by setting the acceptability value of each parking lot as a threshold from the Jinju highway IC (Interchange) to the 7 parking lots. LoRa Network platform supports to browse parking resource information to each vehicle in realtime. The system updates Q-table periodically using Q-learning algorithm as soon as get information from parking lots. The Queuing Theory with Poisson arrival distribution is used to get probability distribution function. The Dijkstra algorithm is used to find the shortest distance. Findings This paper suggest a simulation test to verify the efficiency of Q-learning algorithm at the circumstance of high traffic jam in a city during local festival. As a result of the simulation, the proposed algorithm performed well even when each parking lot was somewhat saturated. When an intelligent learning system such as an O-learning algorithm is applied, it is possible to more effectively distribute the vehicle to a lot with a high parking probability when the vehicle inflow from the outside rapidly increases at a specific time, such as a local city cultural festival.

• Korean Business Review
• /
• v.13
• /
• pp.263-273
• /
• 2000

Mercedes-Benz United States International (MBUSI) built a manufacturing facility for the production of the new M-Class All Activity Vehicle (AAV). This plant consists of three large sequential shops: the Body Shop, the Paint Shop, and the Assembly Shop. When the plant reaches full production, 270 vehicles will be produced each day by two shifts. A finished vehicle is intended to leave the end of the assembly line every 3.6 minutes. The main objective of this study is to simulate the design and operational policies of the AAV assembly facility and to verify that the daily throughput requirements can be met. The simulation study also answered the following questions: What is the maximum throughput (capacity) of the facility? What is the daily distribution of throughput? Does the current design produce the required throughput of 270 cars per day? How do the buffers behave in terms of quantity fluctuations? What are the possible bottlenecks to the desired throughput? This paper provides a description of the integrated simulation model to analyze the capability of the production facilities at MBUSI. This paper includes the inputs used for the development of each of the three individual models: the Body Shop, the Paint Shop, and the Assembly Shop. Additionally, it includes descriptions of the model features and the assumptions that were made.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.178-188
• /
• 2016

The traffic in the wired and wireless networks has increased exponentially because of increase of smart phone and improvement of PC performance. Multimedia services and file transmission such as Facebook, Youtube occupy a large part of the traffic. CDN is a technique that duplicates the contents on a remote web server of content provider to local CDN servers near clients and chooses the optimal CDN server for providing the content to the client in the event of a content request. In this paper, the content request message between CDN servers and the client used the SCRP algorithm utilizing the MST algorithm and the traffic throughput was optimized. The average response time for the content request is reduced by employing HC_LRU cache algorithm that improves the cache hit ratio. The proposed SCRP and HC_LRU algorithm may build a scalable content delivery network system that efficiently utilizes network resources, achieves traffic localization and prevents bottlenecks.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.114-121
• /
• 2015

Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.543-548
• /
• 2015

Recently, volume of data has been growing dramatically along with the growth of social media and digital devices. However, the existing disk-based distributed file systems have limits to their performance of data processing or data access, due to I/O processing costs and bottlenecks. To solve this problem, the caching technique is being used to manage data in the memory. In this paper, we propose a cache management scheme to handle load balancing in a distributed memory environment. The proposed scheme distributes the data according to the memory size, n distributed environments with different memory sizes. If overloaded nodes occur, it redistributes the the access time of the caching data. In order to show the superiority of the proposed scheme, we compare it with an existing distributed cache management scheme through performance evaluation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.4
• /
• pp.205-212
• /
• 2007

In this paper, we present a prototype of view-switchable high-definition (HD) multi-view video transmission system. One of the major bottlenecks for the multi-view broadcasting system has been the hardware cost and transmission bandwidth. The proposed system focuses on software-based design, transmission over IP multicast networks, and flexible system configuration to address aforementioned problems. In the proposed system, we implement software stereo HD multiplexing, demultipiexing and decoding, and take advantage of high-speed broadband convergence networks to deliver HD video in real-time. Moreover, the proposed system can be scalable and flexible in terms of the number of views. Furthermore, in order to display any multiview video on 3D display monitor, a face tracking system is integrated to our system. Therefore, users can watch the different stereoscopic video at its related locations.