• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.6
• /
• pp.350-356
• /
• 2013

Single Carrier Frequency Domain Multiple Access (SC-FDMA) has proven to be the best long term evolution for uplink multiple access because of its low Peak to Average Power Ratio (PAPR), a feature that leads to low power consumption. This is achievable only if the resource allocation is performed in a contiguous manner. This paper proposes a new approach with an improvement in the global resources allocation. The new approach presented utilizes the gain function, which adopts some of the procedures deduced from the older Recursive Maximum Expansion (RME) algorithm. The experiment proved that the new approach is better than the original RME algorithms and in most cases, is closer to the optimal solution.

• International Journal of Aerospace System Engineering
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2017

This paper proposes the load distribution control allocation technique. The proposed method is designed by combining a conventional control allocation method with load distribution ability in order to reduce the stress acting on ailerons. By designing the weighting matrix as a function of the load distribution rule, the optimal deflection angles of each surface to satisfy both control goal and load distribution can be achieved. Moreover, rule based fault-tolerant control technique is also proposed. The rules are generated by considering both dominant control surfaces and the ratio of load distribution among surfaces. The performance of the proposed method is evaluated through numerical simulations.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• IE interfaces
• /
• v.13 no.3
• /
• pp.479-485
• /
• 2000

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Recently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research shows that GA has efficiency for finding good solution. Our main motive of this research is developing of a package for LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We built a database constructed by zipcode, latitude, longitude, administrative address and posted land price. This database enables any real field problem to be coded into a mathematical location problem. We developed a package for a class of multi-location problem at PC. The package allows for an interactive interface between user and computer so that user can generate various solutions easily.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.97-109
• /
• 2010

In this paper, we study a joint design problem of sampling inspections and service capacities for multi-products. Products are supplied in batches after rectifying inspections, that is, rejected lots are 100% inspected and defective products are reworked to good ones. When supplied, all defective products are uncovered through total inspection and returned to service. By exploiting the first and second order properties of the objective function, we identify the optimal inspection policies and service capacities for individual products, and develop allocation algorithms to obtain an optimal allocation of the limited total service capacity to products with the small number of computations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.53-63
• /
• 1997

In this paper, we present a new macroblock-based bit allocation scheme in multiple MPEG-1 video encoders system and a single multiplexer over a single channel. The proposed scheme models the relations between fate(Bits/MB) and distortion(MSE/MB), rate and quantizer parameter(QP), distortion and quantizer parameter, respectively, in the same form. By using these relations, we minimize the Larangian cost function to obtain a bit allocation scheme based on macroblock unit. Experimental results show that the proposed scheme can reduce MSE compared to other conventional buffer-based rate control methods, i.e. independent buffer control method and shared common buffer control one. And we confirmed, through computer simulation, that the proposed scheme can be effectively modified to maintain the objective quality of a specific video service at a constant level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4025-4041
• /
• 2020

Mobile edge computing (MEC) is capable of providing services to smart devices nearby through radio access networks and thus improving service experience of users. In this paper, an offloading strategy for the joint optimization of computing and communication resources in multi-user and multi-MEC overlapping scene was proposed. In addition, under the condition that wireless transmission resources and MEC computing resources were limited and task completion delay was within the maximum tolerance time, the optimization problem of minimizing energy consumption of all users was created, which was then further divided into two subproblems, i.e. offloading strategy and resource allocation. These two subproblems were then solved by the game theory and Lagrangian function to obtain the optimal task offloading strategy and resource allocation plan, and the Nash equilibrium of user offloading strategy games and convex optimization of resource allocation were proved. The simulation results showed that the proposed algorithm could effectively reduce the energy consumption of users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.675-683
• /
• 1996

CAC, UPC, NPC, cell level QoS and congestion control is required to assign efficiently channels's BW and to prevent networks from congestion. In the CAC algorithm, each user defines characteristics of input traffic when channels are set up and network based on this parameters determines the acception or rejection of the required BW. The CAC control mechanism is classified into the centralized BW allocation mechanism and the distributed BW Allocation mechanism according to the function and position of CAC processor allocating BW. In this paper, in contrast with esisted the distributed BW allocation mechanism which assumes the required BW of input traffic as constant, we assume input traffic & serices as bulk probability distribution in order to analyze performance more precisely.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.39-44
• /
• 2003

As one of many design variables, the role of dimension tolerances is to restrict the amount of size variation in a manufactured feature while ensuring functionality. In this study, a nonlinear integer model has been modeled to allocate the optimal tolerance to each individual feature at a minimum manufacturing cost. While a normal distribution determines statistically worst tolerances with its symmetrical property in many previous tolerance allocation studies, a asymmetrical distribution is more realistic because its mean is not always coincident with a process center. A nonlinear integer model is modeled to allocate the optimal tolerance to a feature based on a beta distribution at a minimum total cost. The total cost as a function of tolerances is defined by machining cost and quality loss. After the convexity of manufacturing cost is checked by the Hessian matrix, the model is solved by the Complex Method. Finally, a numerical example is presented demonstrating successful model implementation for a nonlinear design case.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.81-87
• /
• 1999

This paper discusses a bicriterion approach to sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach, which produces an efficient flintier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the m allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.