• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.744-761
• /
• 2016

For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.9
• /
• pp.691-701
• /
• 2020

An actuator mixer design using convex optimization technique situation where the propulsion system of an electric VTOL UAV during vertical take-off and landing maneuvers is proposed. The attainable control set to analyze the impact from failure of each motor and propeller can be calculated and illustrated using the properties of the convex function. The control allocation can be defined as a convex function optimization problem to obtain an optimal solution in real time. The mixer is implemented using a convex optimization solver, and the performance of the control allocation methods is compared to the attainable control set. Finally, the proposed mixer is compared with other techniques with nonlinear sux degree-of-freedom simulation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.1
• /
• pp.153-181
• /
• 2013

Weather is an influential factor to sales of companies. There have been growing attempts with which companies apply weather to developing their strategic marketing plans. By executing weather marketing activities, companies minimize risks (or negative impacts) of weather to their business and increase sales revenues. In spite of managerial importance of weather management, there are scarce empirical studies that comprehensively investigate its impact and present an efficient method that optimally allocates marketing budget. Our research was conducted in two parts. In the first part, we investigated influences of weather on sales based on real-world daily sales data. We specifically focused on the contextual factors that were less focused in the weather related research. In the second part, we propose an optimization model that can be utilized to efficiently allocate weather marketing budget across various regions (or branches) and show how it can be applied to real industry cases. The results of our study are as follow. Study 1 investigated the impact of weather on sales using store sales data of a family restaurant company and an outdoor fashion company. Results represented that the impacts of weather are context-dependent. The impact of weather on store sales varies across their regional and location characteristics when it rains. Based on the results derived from Study 1, Study 2 proposes a method on how optimally companies allocate their weather marketing budgets across each region.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.187-198
• /
• 2008

This paper develops a framework for efficient resource management within the grid service environment. Resource management is the core element of the grid service; therefore, GridRMF(Grid Resource Management Framework) is modeled and developed in order to respond to such variable characteristics of resources as accordingly as possible. GridRMF uses the participation level of grid resource as a basis of its hierarchical management. This hierarchical management divides managing domains into two parts: VMS(Virtual Organization Management System) for virtual organization management and RMS(Resource Management System) for metadata management. VMS mediates resources according to optimal virtual organization selection mechanism, and responds to malfunctions of the virtual organization by LRM(Local Resource Manager) automatic recovery mechanism. RMS, on the other hand, responds to load balance and fault by applying resource status monitoring information into adaptive performance-based task allocation algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.88-102
• /
• 2016

This paper considers the allocation and engagement scheduling problem of interceptor missiles, and the problem was formulated by using MIP (mixed integer programming) in the previous research. The objective of the model is the maximization of total intercept altitude instead of the more conventional objective such as the minimization of surviving target value. The concept of the time window was used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. The MIP formulation of the problem is very complex due to the complexity of the real problem itself. Hence, the finding of an efficient optimal solution procedure seems to be difficult. In this paper, an efficient genetic algorithm is developed by improving a general genetic algorithm. The improvement is achieved by carefully analyzing the structure of the formulation. Specifically, the new algorithm includes an enhanced repair process and a crossover operation which utilizes the idea of the PSO (particle swarm optimization). Then, the algorithm is throughly tested on 50 randomly generated engagement scenarios, and its performance is compared with that of a commercial package and a more general genetic algorithm, respectively. The results indicate that the new algorithm consistently performs better than a general genetic algorithm. Also, the new algorithm generates much better results than those by the commercial package on several test cases when the execution time of the commercial package is limited to 8,000 seconds, which is about two hours and 13 minutes. Moreover, it obtains a solution within 0.13~33.34 seconds depending on the size of scenarios.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.145-148
• /
• 2012

In a distributed streaming system using an advanced coding scheme that encodes a video into multiple substreams, the capacity of the system depends on the amount of contribution of participating peers. Thus, an incentive mechanism for peers to contribute voluntarily is needed to increase system capacity. In addition, since peers are not only a provider but also a consumer in the system (i.e. prosumer), the overall capacity of the system must be allocated fairly among the peers while it must be allocated in a way that can maximize the net quality of experience of peers to increase system efficiency. In this paper, we propose a substream allocation method to solve the problems taking an optimization approach. Unlike the other optimization approaches, the proposed method is verified quantitatively in a simulation study that it can use the capacity of video streaming system efficiently while allocating fair amount of substreams among peers because it considers explicitly the prosumer characteristics of peers.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.37 no.1
• /
• pp.105-110
• /
• 2017

In this paper, the current financial resource allocation principle and issues are studied in the beginning for the metropolitan transfer centers and connection transport facility. In addition to this, foreign cases for this matter are performed for the USA and Japan. Based on the foreign cases, the optimal subsidy ratio of central government is suggested. For the metropolitan transfer centers, at least 50% of subsidy is required from 30% at present and from "necessary costs" to "total costs." For connection transport facility, 50% for road facility and 70% for railway facility are proposed, which is not supported at all at present. As far as connection transport facility are concerned, resources allocation scheme between local governments has also been proposed in the proportional to the length of connection transport facility of each local government.

• Journal of the Korean Society for Railway
• /
• v.17 no.6
• /
• pp.466-473
• /
• 2014

Recently, there is has been significant interest in the allocation systems of rail track capacities with considerations of the multiple train operating companies. The system indicates both a well-defined procedure and an algorithmic method to allocate the rail track capacities. Among them, this study considers the algorithmic method to derive the optimal timetable for the trains, which the companies propose together with their arrival and departure times at each station. However, most studies have focused on the adjustment of the departure and arrival times without conflicts, which could result in incompatible allocations with the line plan, which would result in an insufficient number of trains on each line to satisfy the demands. Our study presents a new optimization model and algorithm for the allocation problem in order to reflect the predetermined line plan. Furthermore, we provide the experimental results that were applied to the Korean high-speed railway network including the Suseo lines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

• The Korean Journal of Applied Statistics
• /
• v.26 no.2
• /
• pp.209-222
• /
• 2013

We apply stratified cluster sampling to a replicated systematic unrelated question model for a large scale survey in which the population is comprised of several strata developed by several clusters and with sensitive parameters. We first present a replicated systematic unrelated question model using an unrelated question model to procure sensitive information from the population of clusters and then develop a suggested model to an unrelated question by a stratified cluster replicated systematic sampling that can be used in large population of strata. We cover the proportional and optimum allocation for the suggested model. Finally, we compare and analyze the efficiency of the suggested model with the replicated systematic unrelated question model.