• IE interfaces
• /
• v.23 no.2
• /
• pp.147-155
• /
• 2010

Reliability allocation is defined as a problem of determination of the reliability for subsystems and components to achieve target system reliability. The determination of both optimal component reliability and the number of component redundancy allowing mixed components to maximize the system reliability under resource constraints is called reliability-redundancy allocation problem(RAP). The main objective of this study is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for reliability-redundancy allocation problem that decides both optimal component reliability and the number of component redundancy to maximize the system reliability under cost and weight constraints. The global optimal solutions of each example are obtained by using CPLEX 11.1. The component structure, reliability, cost, and weight were computed by using HPGA and compared the results of existing metaheuristic such as Genetic Algoritm(GA), Tabu Search(TS), Ant Colony Optimization(ACO), Immune Algorithm(IA) and also evaluated performance of HPGA. The result of suggested algorithm gives the same or better solutions when compared with existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improve solution through swap, 2-opt, and interchange processes. In order to calculate the improvement of reliability for existing studies and suggested algorithm, a maximum possible improvement(MPI) was applied in this study.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.2
• /
• pp.48-55
• /
• 2010

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.2
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• Publications of The Korean Astronomical Society
• /
• v.19 no.1
• /
• pp.83-92
• /
• 2004

In this paper, we introduce the development of the large storage system in order to record the observed space radio signal in the Korean VLBI Network(KVN) with high-speed. The KVN is the Very Long Baseline Interferometery(VLBI) to observe the birth of star, the structure of space by constructing radio telescope with diameter 21m at the Seoul, Ulsan, Jeju from 2001 to 2007 years. To do this, Korea Astronomy Observatory joined the international consortium for developing the high-speed large storage system(Mark 5), which is developed by MIT Haystack observatory. The Mark 5 system based on hard disk has to record up to 1 Gbps the observed space radio signal. The main features of Mark 5 system are as follows; First it is able to directly record the input data to the hard disk without PC1(Peripheral Component Interconnect) internal bus, and the second, it has two hard disk banks, which are able to hot-swap ATA/IDE type very cheap up to 1 Gbps recording and playback. The third is that it follows the international VLBI standard interface hardware(VSI-H). Therefore it can be connect directly the VSI-H type system at the input/output. Finally it also supports e- VLBI(Electronic-VLBI) through the standard Gigabits Ethernet connection.

• IE interfaces
• /
• v.13 no.3
• /
• pp.471-478
• /
• 2000

One of the most important problems encountered by parcel transportation firms or LTL (Less-than-truckload) firms is the planning of daily linehaul operations. The transportation firm's goal is to determine the most efficient way to move all freight from its originating terminal to its destination terminal after each shipment is picked up from the shipping dock. The purpose of this study is to design a transportation system and develop an efficient scheduling algorithm for linehaul operations carrying small amount of shipment. This paper presents three approaches for efficient linehaul operations. The first approach examines drivers using the roundtrips which start from a terminal, visit several terminals, and return to the starting terminal. The second approach uses a freight assembly center where drivers take freight for a number of destination terminals which they then swap for freight for their starting terminal. The third approach is similar to the second approach in that it uses a transshipment point like a freight assembly terminal for shipment, but it has several transshipment points since each shipment may have a different transshipment point. In this study, we developed a mathematical formulation and algorithm for each approach. The experimental results using data of a LTL firm show that the third approach is more efficient than the other two. Mileage and overnight stays of the third approach are reduced by 10% and 30%, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.31-36
• /
• 2024

Recently, mobile apps that utilize AI technologies are increasing. In the personal mobile environment, performance degradation may occur during the training phase of large AI workload due to limitations in memory capacity. In this paper, we extract memory reference traces of AI workloads and analyze their characteristics. From this analysis, we observe that AI workloads can cause frequent storage access due to weak temporal locality and irregular popularity bias during memory write operations, which can degrade the performance of mobile devices. Based on this observation, we discuss ways to efficiently manage memory write operations of AI workloads using persistent memory-based swap devices. Through simulation experiments, we show that the system architecture proposed in this paper can improve the I/O time of mobile systems by more than 80%.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.391-406
• /
• 2002

In order to realize a practical VOD system, it is necessary for a high-capacity and cost-effective hierarchical VOD server based on tertiary storages such as DVD jukebox. In such a system, it is possible to transfer multiple streams to users by alternatively swapping DVDs using the fixed number of drives. But it takes a long time for loading DVD to a drive. In this paper, we propose a primitive pipelined loading mechanism for hiding the loading time to swap DVDs in a hierarchical VOD server based on DVD jukebox. We also propose a enhanced pipelined loading mechanism for increasing the maximum admittable streams with the fixed number of drives. The enhanced mechanism caches the initial segment of each stream on a disk storage allowing faster data transfer. The performance analysis shows that the proposed mechanisms can admit the maximum allowed stream capacity under the fixed number of disk drives.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.535-546
• /
• 2019

Recently, there have been a lot of researches on the whole face replacement system, but it is not easy to obtain stable results due to various attitudes, angles and facial diversity. To produce a natural synthesis result when replacing the face shown in the video image, technologies such as face area detection, feature extraction, face alignment, face area segmentation, 3D attitude adjustment and facial transposition should all operate at a precise level. And each technology must be able to be interdependently combined. The results of our analysis show that the difficulty of implementing the technology and contribution to the system in facial replacement technology has increased in facial feature point extraction and facial alignment technology. On the other hand, the difficulty of the facial transposition technique and the three-dimensional posture adjustment technique were low, but showed the need for development. In this paper, we propose four facial replacement models such as 2-D Faceswap, OpenPose, Deekfake, and Cycle GAN, which are suitable for the Cox platform. These models have the following features; i.e. these models include a suitable model for front face pose image conversion, face pose image with active body movement, and face movement with right and left side by 15 degrees, Generative Adversarial Network.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.59-65
• /
• 2007

Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without a need for hardware customization. Multicast tree reconstruction is required when a non-leaf node leaves or fails. However frequent multicast tree reconstruction introduces serious degradation in performance. In this paper, we propose a tree performance optimization algorithm to solve this defect by using information(RTCP-probing) that becomes a periodic feedback to a source node from each child node. The proposed model is a mechanism performed when a parent node seems to cause deterioration in the tree performance. We have improved the performance of the whole service tree using the mechanism and hence composing an optimization tree. The simulation results show that our proposal stands to be an effective method that can be applied to not only the proposed model but also to existing techniques.

• KDI Journal of Economic Policy
• /
• v.13 no.1
• /
• pp.35-63
• /
• 1991

Currently, Korea's banking industry holds a sizable amount of non-performing loans which stem from the government-led bailout of many troubled firms in the 1980s. Although this burden was somewhat relieved with the aid of banks' recapitalization in the booming securities market between 1986-88, the insolvent credits still resulted in low profitability in the banking sector and have been detrimental to the progress of financial liberalization and internationalization. This paper surveys the corporate bailout experiences of major advanced countries and Korea in the past and derives a rationale for readjustment measures against non-performing loans, in which rescue plans depend on the nature of the financial system. Considering the features of Korea's financial system and the banking sector's recent performance, it discusses possible means of liquidation in keeping with the rationale. The conflict of interests among parties involved in non-performing loans is widely known as one of the major constraints in writing off the loans. Specifically, in the case of Korea, the government's excessive intervention in allocating credits has preempted the legitimate role of the banking sector, which now only passively manages its past loans, and has implicitly confused private with public risk. This paper argues that to minimize the incidence of insolvent loan readjustment, the government's role should be reduced and that the correspondent banks should be more active in the liquidation process, through the market mechanism, reflecting their access to detailed information on the troubled firms. One solution is that banks, after classifying the insolvent loans by the lateness or possibility of repayment, would swap the relatively sound loans for preferred stock and gradually write off the bad ones by expanding the banks' retained earnings and revaluing the banks' assets. Specifically, the debt-equity swap can benefit both creditors and debtors in the sense that it raises the liquidity and profitability of bank assets and strengthens the debtor's financial structure by easing the debt service burden. Such a creditor-led or market-led solution improves the financial strength and autonomy of the banking sector, thereby fostering more efficient resource allocation and risk sharing.