• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.6
• /
• pp.558-565
• /
• 2021

The Republic of Korea Navy has deployed naval fleets in the East, West, and South seas to effectively respond to threats from North Korea and its neighbors. However, it is difficult to allocate proper missions due to high uncertainties, such as the year of introduction for the ship, the number of mission days completed, arms capabilities, crew shift times, and the failure rate of the ship. For this reason, there is an increasing proportion of expenses, or mission alerts with high fatigue in the number of workers and traps. In this paper, we present a simulation model that can optimize the assignment of naval vessels' missions by using a continuous time absorbing Markov chain that is easy to model and that can analyze complex phenomena with varying event rates over time. A numerical analysis model allows us to determine the optimal mission durations and warship quantities to maintain the target operating rates, and we find that allocating optimal warships for each mission reduces unnecessary alerts and reduces crew fatigue and failures. This model is significant in that it can be expanded to various fields, not only for assignment of duties but also for calculation of appropriate requirements and for inventory analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.11
• /
• pp.497-508
• /
• 2008

Mobile Multimedia File System, MNFS, is a file system which extensively exploits NAND FLASH Memory, Since general Flash file systems does not precisely meet the criteria of mobile devices such as MP3 Player, PMP, Digital Camcorder, MNFS is designed to guarantee the optimal performance of FLASH Memory file system. Among many features MNFS provides, there are three distinguishable characteristics. MNFS guarantees, first, constant response time in sequential write requests of the file system, second, fast file system mounting time, and lastly least memory footprint. MNFS implements four schemes to provide such features, Hybrid mapping scheme to map file system metadata and user data, manipulation of user data allocation to fit allocation unit of file data into allocation unit of NAND FLASH Memory, iBAT (in core only Block Allocation Table) to minimize the metadata, and bottom-up representation of directory. Prototype implementation of MNFS was tested and measured its performance on ARM9 processor and 1Gbit NAND FLASH Memory environment. Its performance was compared with YAFFS, NAND FLASH File system, and FAT file system which use FTL. This enables to observe constant request time for sequential write request. It shows 30 times faster mounting time to YAFFS, and reduces 95% of HEAP memory consumption compared to YAFFS.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.263-271
• /
• 2016

On account of population aging and increasing cardiovascular disorders, acute cardiac arrest cases are escalating each year. In order to increase the survival rate of the patients, rapid cardiopulmonary resuscitation is necessary. For this reason, the government is expanding the supply of Automated External Defibrillators(AED). However, the AEDs cannot be effectively deployed to the incident cases that occur outdoors, for the installed AEDs are mostly located indoors. After analyzing the distribution of incident cases within the study area, about 11% of cardiac arrest incidents occurred in open spaces including sidewalks and residential areas. This study was conducted to increase the survival rate of the patients by allocating 41 additional AEDs in the study area using a GIS based location-allocation method. To conduct a feasibility study, the density of a senior floating population covered by the same number of AEDs placed at random and the density covered by the experiment were compared. In conclusion, having excluded outliers caused by geological and social factors, results showed that AEDs placed through GIS based location-allocation covered 5% more of the senior floating population density.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.272-285
• /
• 2008

In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

• Journal of Korean Society of Transportation
• /
• v.29 no.2
• /
• pp.91-100
• /
• 2011

Hub network design for freight transportation is a decision process that determines hub locations together with freight transportation routes among shippers so as to ultimately minimize total logistics cost. This study presents the optimal location of hubs by strict hub network design policy with single allocation, which overcomes the limitation of Kim et al. (2008) that does not allow direct transportation among shippers. The greedy-interchange algorithm is employed for hub location decision process, and EMME/2 is adopted for the route searching process. Application of the processes to the nationwide highway network shows that the best hub locations in order are Seoul metropolitan, GyeongNam, Chung-nam, Jeon-Nam, Gyeong-Buk, Chung-Buk, and the locations are concentrated on the Seoul-Busan corridor. The strict hubnetwork design policy with single allocation increases the transportation distance but decreases the transportation cost by passing through the hubs instead of direct transportation. The reduction in total transportation cost can be achieved as the number of hubs increases, but the amount of the reduction gradually decreases because the cost reduction from the decrease in detour transportation distance between non-hubs and hubs becomes less than the discount reduction from dispersion of inter-hubs transportation volumes.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.3 no.1
• /
• pp.31-46
• /
• 1978

Consider a time interval during which the demand for trips is fixed (e.g. the rush hour period). The traveller has a choice between various public modes, whose travel times and fares are fixed, and the automobile mode, for which travel time and cost depend on the volume of traffic flow on those roads, which are subject to congestion. We consider the equilibrium in terms of a representative travellerm, who choses for any trip the mode and route with the least combined money and time cost. When several (parallel) model or routes are chosen, then the combined cost of money and time must be equal among these. Our problem is first, to find the optimal flows of cars and of public mode carriers on the various links of their networks and second the optimal fares for trips by the variousmodes. The object is to minimize the total operating costs of the carriers and car plus the total time costs to travellers. The optimal fares are related to, but not identical with the dual variables of the underlying Nonlinear Program. They are equal to these dual variables only in the case, when congestion tolls on trips or on the use of specific roads are collected from automobile users. When such tolls are not collected, they must be passed on as subsidies to travellers using competing modes. The optimal fares of public modes are then reduced by the amounts of these subsidies. Note that subsidies are not a flat payment to public carriers, but are calculated on the basis of tickets sold. Fares and subsidies depend in general on tile period considered. They will be higher during periods of higher demand. When the assumption of fixed trip demand is relaxed, this tare system is no longer best, but only second best since too much traffic will, in general, be generated. The Free Rider Theorem states the following : Suppose road tolls can be charged, so that a best pricing system for public modes is posssible. Then there may exist free rides on some routes and modes, but never on a complete round trip.

• Journal of Korean Society of Forest Science
• /
• v.79 no.3
• /
• pp.231-244
• /
• 1990

As the complexity of society increases, the demand for the forest-based recreational site is also increased. This, in turn. makes congestion an ubiquitous type of externality in forest-based recreational site. Efficient resource allocation requires this congestion effect to be accounted and considered in the decision making process. In this content, this study was conducted to suggest a process which can be used to measure the congestion and determine the optimal number of users. Willigness to pay(WTP) function obtained from Book Han San National Park users suggested that every 20.000 users increased decrease the satisfaction of users obtained from the site visit be 27.3%. For the purpose of demonstration this WTP function is applied tit determine the optimal number of users which is estimated as about 73,000 persons per day.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.188-194
• /
• 2012

Cognitive networks (CNs) are capable of enabling dynamic spectrum allocation, and thus constitute a promising technology for future wireless communication. Whereas, the implementation of CN will lead to the requirement of an increased energy-arrival rate, which is a significant parameter in energy harvesting design of a cognitive user (CU) device. A well-designed spectrum-sensing scheme will lower the energy-arrival rate that is required and enable CNs to self-sustain, which will also help alleviate global warming. In this paper, spectrum sensing in a multi-user cognitive ad hoc network with a wide-band spectrum is considered. Based on the prospective spectrum sensing, we classify CN operation into two modes: Distributed and centralized. In a distributed network, each CU conducts spectrum sensing for its own data transmission, while in a centralized network, there is only one cognitive cluster header which performs spectrum sensing and broadcasts its sensing results to other CUs. Thus, a wide-band spectrum that is divided into multiple sub-channels can be sensed simultaneously in a distributed manner or sequentially in a centralized manner. We consider the energy consumption for spectrum sensing only of an analog-to-digital convertor (ADC). By formulating energy consumption for spectrum sensing in terms of the sub-channel sampling rate and whole-band sensing time, the sampling rate and whole-band sensing time that are optimal for minimizing the total energy consumption within sensing reliability constraints are obtained. A power dissipation model of an ADC, which plays an important role in formulating the energy efficiency problem, is presented. Using AD9051 as an ADC example, our numerical results show that the optimal sensing parameters will achieve a reduction in the energy-arrival rate of up to 97.7% and 50% in a distributed and a centralized network, respectively, when comparing the optimal and worst-case energy consumption for given system settings.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.265-275
• /
• 2023

The purpose of this paper is to devise an optimal route allocation algorithm for automated vehicle(AV) in monitoring quality of road infrastructure to support the road safety. The tasks of an AV in this paper include visiting node-links at least once during its operation and checking status of road infrastructure, and coming back to its depot.. In selecting optimal route, its priority goal is visiting the node-links with higher risks while reducing costs caused by operation. To deal with the problem, authors devised reward maximizing algorithm for AVs. To check its validity, the authors developed simple toy network that mimic node-link networks and assigned costs and rewards for each node-link. With the toy network, the reward maximizing algorithm worked well as it visited the node-link with higher risks earlier then chinese postman route algorithm (Eiselt, Gendreau, Laporte, 1995). For further research, the reward maximizing algorithm should be tested its validity in a more complex network that mimic the real-life.