• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.

• 한국산학기술학회논문지
• /
• 제19권5호
• /
• pp.17-26
• /
• 2018

최근, 대용량의 태양광전원이 연계된 배전계통은 기존의 단방향과 달리 양방향의 조류가 발생하고, 태양광전원의 연계위치 및 고장위치에 따라 사고전류의 크기와 방향이 변하여, 보호기기간의 협조시간차가 충분히 확보되지 않는 문제점이 발생할 수 있다. 또한, 태양광전원을 고려하지 않은 기존의 보호기기 정정치를 그대로 적용하고 있어 보호기기간의 협조시간차를 확보하기 어려운 상황이 발생하고 있다. 따라서 본 논문에서는 태양광전원이 연계된 선로에서 고려할 수 있는 3가지 Case의 보호기기 정정치 운용모드를 제시하고, 이를 바탕으로 태양광전원의 용량에 따른 최적의 보호협조 시간을 도출할 수 있는 알고리즘을 제안한다. 한편, 이를 바탕으로 보호협조 전용소프트웨어인 Off-DAS를 이용하여, 태양광전원이 연계된 배전계통을 모델링하고, 보호기기(변전소 계전기, 리클로저(Recloser), 고객계전기, 태양광전원 고객계전기)간의 협조시간차 특성을 분석한다. 실 계통을 대상으로 시뮬레이션을 수행한 결과, 본 논문에서 제시한 보호기기의 정정치 운용 모드와 정정치 산정 방식이 태양광 전원이 연계된 배전계통 보호기기간의 협조시간을 안정적으로 확보할 수 있음을 알 수 있었다.

• 디지털융복합연구
• /
• 제14권6호
• /
• pp.9-19
• /
• 2016

지속적인 R&D 예산 확대 및 수행기관 수 증가에 따른 부처간 산발적이고 경쟁적인 사업추진으로 인한 투자 비효율성을 해소하고자 다부처사업이 기획되어 추진 중이다. 그러나 다부처사업 내 실질적인 부처간 협력체계 미비로 인해 다부처R&D사업 추진의 실효성이 저하되고 있다는 지적이 빈번하다. 본 연구에서는 해외 다부처R&D사업의 추진체계 및 국내 다부처R&D사업의 추진현황을 분석한 결과를 통해 향후 다부처R&D사업을 추진함에 있어서 필요한 개선사항을 R&D사업의 전주기적 관점(기획, 예산배분 조정, 집행, 평가)에서 도출하였다. 분석결과, 다부처 R&D사업의 기획단계 이후에 개별부처로 나누어서 각각 집행 운영되고 있는 점, 예산요구 시 부처간 협력 조정 과정이 전무하다는 점, 다부처사업의 특성을 반영한 사업평가체계가 마련되지 않고 있는 점이 주요 문제점으로 나타났다. 동 연구에서는 분석결과를 바탕으로 전략적 예산배분 및 실효성 강화를 위한 개선방안으로부터 다부처R&D사업의 전주기적 추진체계를 새롭게 제시하였다는 것에서 의의를 가진다.

• 수산해양교육연구
• /
• 제15권1호
• /
• pp.57-66
• /
• 2003

The purpose of the present study was to investigate physicochemical changes in olive flounder and korean rockfish muscle subjected to the cold brine, and to find the optimal immersion condition. Effects of various immersion conditions in a sliced raw fish quality were investigated in the rigor index, breaking strength, ATP related compounds, and lactate accumulation in the muscle. The onset of rigor-mortis was accelerated by the increase of immersion time. Also, the time reaching full rigor was shortened remarkably too. However, the rigor index of samples immersed in the cold brine decreased more than that of samples killed instantly. Rigor index was the highest in samples killed instantly, followed by 2.5 min, 5min, 7.5 min, 10 min and 15 min in order. Breaking strength of all samples immersed in the cold brine decreased significantly after reaching the maximum values. The content of ATP related compounds in olive flounder, korean rockfish were $12.0{\mu}mole/g$ and $8.3{\mu}mole/g$, respectively. However, ATP decreased in the samples immersed in the cold brine. The content of ATP was lower, at the optimal condition and then it was increased. Also, lactates increased, at the optimal condition and then it decreased, in contrast with the ATP. The results suggested that the optimal immersion condition of olive flounder and korean rockfish was at -${12.5}^{\circ}C$ for 5min.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• Industrial Engineering and Management Systems
• /
• 제10권2호
• /
• pp.115-122
• /
• 2011

This research considers a system containing a manufacturing firm who generates waste material during manufacturing process, and a disposal firm who collects and disposes the waste material. Identification of the optimal number of pick ups and the amount of waste to be disposed at certain period of time in terms of cost minimization is studied. Two types of waste accumulation rates, constant and linearly increasing, are discussed and mathematical models are developed. It can be shown that the results for these two different types of waste accumulation differ in a wide range because of the difference in the way of how waste is accumulated, which disturbs the storage cost. An integrated model is also developed and discussed in which both the manufacturing firm and the disposal firm benefit from the coordination between the two parties. It is shown that the optimal policy adopted by the integrated approach can provide a strong and consistent cost-minimizing effect for both the manufacturing firm and the disposal firm over the existing approach. Finally, all the models are verified by a numerical example and the results are compared.

• 한국경영과학회지
• /
• 제35권1호
• /
• pp.83-95
• /
• 2010

This paper considers a firm that operates make-to-stock and make-to-order facilities in successive stages. The make-to-stock facility produces components which are consumed by the external market demand as well as the internal make-to-order operation. The make-to-order facility processes customer orders with the option of acceptance or rejection. In this paper, we address the problem of coordinating how to allocate the capacity of the make-to-stock facility to internal and external demands and how to control incoming customer orders at the make-to-order facility so as to maximize the firm's profit subject to the system costs. To deal with this issue, we formulate the problem as a Markov decision process and characterize the structure of the optimal inventory allocation and customer order control. In a numerical experiment, we compare the performance of the optimal policy to the heuristic with static inventory allocation and admission control under different operating conditions of the system.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.267-274
• /
• 2015

Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.

• Journal of Electrical Engineering and Technology
• /
• 제4권1호
• /
• pp.1-12
• /
• 2009

In recent years, integration of new distributed generation (DG) technology in distribution networks has become one of the major management concerns for professional engineers. This paper presents a dynamic methodology of optimal allocation and sizing of DG units for a given practical distribution network, so that the cost of active power can be minimized. The approach proposed is based on a combined Genetic/Fuzzy Rules. The genetic algorithm generates and optimizes combinations of distributed power generation for integration into the network in order to minimize power losses, and in second step simple fuzzy rules designs based upon practical expertise rules to control the reactive power of a multi dynamic shunt FACTS Compensator (SVC, STATCOM) in order to improve the system loadability. This proposed approach is implemented with the Matlab program and is applied to small case studies, IEEE 25-Bus and IEEE 30-Bus. The results obtained confirm the effectiveness in sizing and integration of an assigned number of DG units.

• 한국군사과학기술학회지
• /
• 제21권2호
• /
• pp.225-234
• /
• 2018

In this paper, we consider a problem of partitioning a search area into smaller rectangular regions, so that multiple platforms can conduct search operations independently without requiring unnecessary coordination among themselves. The search area consists of cells where each cell has some prior information regarding the probability of target existence. The detection probability in particular cell is evaluated by multiplying the observation probability of the platform and the target existence probability in that cell. The total detection probability within the search area is defined as the cumulative detection probability for each cell. However, since this search area partitioning problem is NP-Hard, we decompose the problem into three sequential phases to solve this computationally intractable problem. Additionally, we discuss a special case of this problem, which can provide an optimal analytic solution. We also examine the performance of the proposed approach by comparing our results with the optimal analytic solution.