• Journal of Energy Engineering
• /
• v.13 no.3
• /
• pp.173-180
• /
• 2004

A technique of the heat rate allocation was devised to monitor the performance of Combined Cycle Power Plant. This calculates the expected heat rate of current conditions and compares it with actual values. Loss allocation in heat rate is reconciled by calculating the magnitude of the deficiency contributed by major components, such as the gas turbine, heat recovery steam generator (HRSG), steam turbine and condenser. Expected power output is determined by a detailed model and correction curves of the plant.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.3 s.309
• /
• pp.50-58
• /
• 2006

This paper describes the implementation of an efficient Rate-Distortion Optimization algerian to speed up rate control in JPEG2000. While the conventional algorithm determines the rate constant by averaging maximum R-D slope and minimum R-D slope for entire image, the proposed algorithm determines it by using R-D slopes of coding passes located near truncation point. Moreover, the rate allocation in proposed algorithm is conducted about only coding passes excluded from the previous rate allocation. As a result, it can reduce the number of operations required for rate-distortion optimization. The proposed algorithm was implemented in C programing language and was executed on the Altera Excalibur(EPXA4) development board.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.627-638
• /
• 2014

In this paper, we study the joint price and power allocation in spectrum sharing macro-femtocell networks. The proposed game theoretic framework is based on bi-level Stackelberg game where macro base station (MBS) works as a leader and underlaid femto base stations (FBSs) work as followers. MBS has fixed data rate and imposes interference price on FBSs for maintaining its data rate and earns revenue while FBSs jointly adjust their power for maximizing their data rates and utility functions. Since the interference from FBSs to macro user equipment is kept under a given threshold and FBSs compete against each other for power allocation, there is a need to determine a power allocation strategy which converges to Stackelberg equilibrium. We consider two cases for MBS power allocation, i.e., fixed and dynamic power. MBS can adjust its power in case of dynamic power allocation according to its minimum data rate requirement and number of FBSs willing to share the spectrum. For both cases we consider uniform and non-uniform pricing where MBS charges same price to all FBSs for uniform pricing and different price to each FBS for non-uniform pricing according to its induced interference. We obtain unique closed form solution for each case if the co-interference at FBSs is assumed fixed. And an iterative algorithm which converges rapidly is also proposed to take into account the effect of co-tier interference on interference price and power allocation strategy. The results are explained with numerical simulation examples which validate the effectiveness of our proposed solutions.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.316-322
• /
• 2002

In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6A
• /
• pp.617-626
• /
• 2006

In this paper, we propose an ASA(Aggressive Subchannel Allocation) algorithm, which is an effective dynamic channel allocation algorithm considering all user's channel state to maximize downlink sector throughput in OFDMA system. We compare an ASA algorithm with Round Robin, ACG(Amplitude Craving Greedy), RCG(Rate Craving Greedy) and GPF(General Proportional Fair) in the 2-tier environment of FRF(Frequency Reuse Factor) 1 and then analyze the performance of each algorithms, through compute simulation. Simulation results show that the proposed ASA algorithm gets 58 %, 190 %, 130 % and 8.5 % better sector throughput compared with the Round Robin, ACG, RCG and GPF respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.512-518
• /
• 2013

A resource allocation algorithm has a high impact on user satisfaction as well as the ability to accommodate and process services in a distributed cloud computing. In other words, service rejections, which occur when datacenters have no enough resources, degrade the user satisfaction level. Therefore, in this paper, we propose a resource allocation algorithm considering the cloud domain's remaining resources to minimize the number of service rejections. The resource allocation rate based on Q-Learning increases when the remaining resources are sufficient to allocate the maximum allocation rate otherwise and avoids the service rejection. To demonstrate, We compare the proposed algorithm with two previous works and show that the proposed algorithm has the smaller number of the service rejections.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1407-1413
• /
• 2019

In this paper, we assume that another transmitter can transmit its data signal in the same frequency band in order to maximize the frequency efficiency of non-orthogonal multiple access(NOMA) systems. We also focus on the improvement in fairness performance of receiver's data rates, not the maximization of sum data rate for NOMA systems. Thus, in this paper, we propose a power allocation scheme to enhance the fairness performance of average data rates of receivers considering the NOMA systems in the presence of interference. Assuming Rayleigh fading channels, the average data rates of receivers are defined, and the power allocation coefficients to improve the data-rate fairness are derived by using high signal-to-noise power ratio approximation. In addition, through simulations, it is shown that the proposed power allocation scheme can improve the data-rate fairness in the NOMA system with interference.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3134-3155
• /
• 2020

In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

• Journal of Chest Surgery
• /
• v.55 no.4
• /
• pp.274-276
• /
• 2022

The expansion of indications for lung transplantation, the growth of the waiting list, and donor shortages are increasing the waiting list mortality rate in Korea. The current lung allocation system in Korea is based mainly on urgency, but outcomes should also be considered to avoid futile transplantation. This review describes the current status of, and issues with, the lung allocation system in Korea including donors, the waiting list, and transplant outcomes in the context of an aging society, in which the frequency of end-stage pulmonary disease is increasing.

• Journal of Fisheries and Marine Sciences Education
• /
• v.26 no.2
• /
• pp.444-454
• /
• 2014

The range of optimization problem in aquaculture is very wide, resulting from the range of species, mode of operation. Quite a few studies focus marine net-cages, but studies on land based culture farm are few or no. This paper considers a allocation problem to meet production planning in land based aquaculture system. A water pool allocation model in land based aquaculture system was developed. The solution finds the value of decision variable to minimize yearly production costs that sums up the water pool usage cost and sorting cost. The model inputs were (1) the fish growth rate (2) critical standing corp (3) number of water pool (4) number of fish. The model outputs were (5) number of water pool in growing phase (6) cost of cultivation (6) optimal facility allocation(number of water pool for each growing phase). To solve the problem, an efficient heuristic algorithm based on a greedy manner is developed. Branch and bound and heuristic is evaluated through numerical examples.