• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.2
• /
• pp.107-114
• /
• 2007

This paper focuses on the performance evaluation of various control allocation methods applied on DURUMI-II UAV system. In order to implement control allocation scheme to aircraft control system, control system can be designed through two step design procedure. The first step is to design a baseline control system for an aircraft without consideration of control surface failure. The second step is to design a control allocator that maps the total control command on the individual control surfaces. In this paper, several control allocation methods such as Psuedo-Inverse CA method, Direct CA method, and Optimization CA method are implemented and integrated to the baseline flight control system of DURUMI-II UAV. The performance of these control allocation methods is evaluated by nonlinear simulation under the flight scenario of control surface failure.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1072-1081
• /
• 2008

We can categorize the network address allocation mechanism into two types. One is to assign a unique network address using the address allocation server and the other is to make a random address by itself and process the DAD(Duplicate Address Detection) procedure. In this paper we suggest a new address allocation mechanism based on the signal strength for the PLC-based home network. As the combined mechanism of two types this mechanism allocates a unique address for the new node from one of the existing nodes with the simple equation and with the priority based on the signal strength from the new node to the existing nodes. We can use this mechanism for the self-healing function when the packet from the source node may not be delivered to the destination node directly. We developed the simulator for our mechanism using the C# programming and verified the network address assigned uniquely based on the signal strength.

• Journal of Arbitration Studies
• /
• v.10 no.1
• /
• pp.26-46
• /
• 2000

International arbitration has been recognized as an effective dispute resolution method. Among the arbitration institutions, the ICC(International Chamber of Commerce) international court of arbitration is one of the most well-known and frequently chosen organizations to which international claimants have resorted, when they were confronted with international disputes. In this paper, costs in the ICC arbitration are compared with those in the KCAB(Korean Commercial Arbitration Board) arbitration. seeking efficient ways to reduce the costs while maximizing the quality of arbitral awards. Three main points about costs in the ICC arbitration and the KCAB arbitration are discussed and analysed, First, the cost structures are analysed and decomposed into manageable units. Second, the cost allocation is discussed to clarify its proportional responsibility among the arbitration parties. Third, how advances in arbitration costs are conducted is examined to explore a well established procedure of arbitration. In conclusion, the KCAB arbitration procedure has been found faster and cheaper than the ICC arbitration procedure in terms of time and costs, respectively. However, it can be cautiously suggested that the quality of arbitral awards made by the KCAB is not necessarily higher than that made by the ICC.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.19-26
• /
• 1996

A solution procedure to minimize the number of storage carousels has been developed under the carousel throughput rate and total storage capacity requirements. The number of carousels can be reduced by increasing the throughput rate of carousels which depends upon the size of carousels, the storage item allocation to carousels, and the item position assignments in each carousel. Since the problem is very complicated and hard to solve optimally, the following solution procedure to solve the problem hierarchically is proposed: With a given number of carousels, the storage items are allocated to carousels so that the slowest average transaction time among carousels may be minimized, and then the position of each item is assigned in the allocated carousel so that the throughput of the carousel can be maximized.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.126-133
• /
• 2023

Recent advancements in cloud service virtualization technologies have witnessed a shift from a Virtual Machine-centric approach to a container-centric paradigm, offering advantages such as faster deployment and enhanced portability. Container orchestration has emerged as a key technology for efficient management and scheduling of these containers. However, with the increasing complexity and diversity of heterogeneous workloads and service types, resource scheduling has become a challenging task. Various research endeavors are underway to address the challenges posed by diverse workloads and services. Yet, a systematic approach to container orchestration for effective cloud management has not been clearly defined. This paper proposes the DRA-Engine (Dynamic Resource Allocation Engine) for resource scheduling in container orchestration. The proposed engine comprises the Request Load Procedure, Required Resource Measurement Procedure, and Resource Provision Decision Procedure. Through these components, the DRA-Engine dynamically allocates resources according to the application's requirements, presenting a solution to the challenges of resource scheduling in container orchestration.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.05a
• /
• pp.283-291
• /
• 2005

The development of mobile applications is fast in recent years. However, nearly all applications are for messaging, financial, locating services based on simple interactions with mobile users because of the limited screen size, narrow network bandwidth, and low computing power. Processing an algorithm for supporting a group decision process on mobile devices becomes impossible. In this paper, we introduce the mobile-oriented simple interactive procedure for support a group decision making process. The interactive procedure is developed for multiple objective linear programming problems to help the group select a compromising solution in the mobile Internet environment. Our procedure lessens the burden of group decision makers, which is one of necessary conditions of the mobile environment. Only the partial weak order preferences of variables and objectives from group decision makers are enough for searching the best compromising solution. The methodology is designed to avoid any assumption about the shape or existence of the decision makers's utility function. For the purpose of the experimental study of the procedure, we developed a group decision support system in the mobile Internet environment, MOBIGSS　and applied to an allocation problem of investor assets.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.54-64
• /
• 2011

The purpose of this study is to optimally allocate the human resources to tasks while minimizing the total daily human resource costs and smoothing the human resource usage. The human resource allocation problem (hRAP) under consideration contains two kinds of special constraints, i.e. operational precedence and skill constraints in addition to the ordinary constraints. To deal with the multiple objectives and the special constraints, first we designed this hRAP as a network problem and then proposed a Pareto multistage decisionbased genetic algorithm (P-mdGA). During the evolutionary process of P-mdGA, a Pareto evaluation procedure called generalized Pareto-based scale-independent fitness function approach is used to evaluate the solutions. Additionally, in order to improve the performance of P-mdGA, we use fuzzy logic controller for fine-tuning of genetic parameters. Finally, in order to demonstrate the applicability and to evaluate the performance of the proposed approach, P-mdGA is applied to solve a case study in a hotel, where the managers usually need helpful automatic support for effectively allocating hotel staff to hotel tasks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.282-287
• /
• 2005

The space time block code(STBC) can not provide simultaneously both full diversity and full transmission rate in a transmit diversity system having more than two transmit antennas.. There are a quasi orthogonal STBC for four transmit antennas that provides full transmission rate and minimized interference. Recently, a simple correlation canceling algorithm is introduced to achieve full diversity from STBC considering four transmit antennas. In this paper, we propose a new decoding procedure using the power allocation at the transmitter and subtraction interference process at the receiver to achieve a better performance without noise enhancement.

• ETRI Journal
• /
• v.41 no.5
• /
• pp.626-636
• /
• 2019

A novel algorithm for joint user selection and optimal power allocation for Stackelberg game-based revenue maximization in a downlink non-orthogonal multiple access (NOMA) network is proposed in this study. The condition for the existence of optimal solution is derived by assuming perfect channel state information (CSI) at the transmitter. The Lagrange multiplier method is used to convert the revenue maximization problem into a set of quadratic equations that are reduced to a regular chain of expressions. The optimal solution is obtained via a univariate iterative procedure. A simple algorithm for joint optimal user selection and power calculation is presented and exhibits extremely low complexity. Furthermore, an outage analysis is presented to evaluate the performance degradation when perfect CSI is not available. The simulation results indicate that at 5-dB signal-to-noise ratio (SNR), revenue of the base station improves by at least 15.2% for the proposed algorithm when compared to suboptimal schemes. Other performance metrics of NOMA, such as individual user-rates, fairness index, and outage probability, approach near-optimal values at moderate to high SNRs.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.6 no.2
• /
• pp.347-360
• /
• 2014

The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system non-linearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.