• 한국경영과학회지
• /
• 제29권4호
• /
• pp.61-72
• /
• 2004

In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Particularly, we extend Kim(2003) by introducing the fixed cost of providing services. We show that, due to the fixed cost considered, the cost function of a product is no longer linear or convex in terms of the level of service provision, and the total inspection is prefered to the small level of service capacity which results in high burden of the fixed cost. And we develop a simple framework to deal with this joint design problem for a product. Also we consider the problem of allocating the given number of the total service capacities among products. A dynamic programming algorithm is developed to determine the optimal allocation which minimizes the overall total cost of the system and the optimal allocation can be obtained with the considerably smaller computations than the total number of possible allocations. The results can be used to support planning decisions and to aid the joint design of inspections and service capacities for products.

• International Journal of Contents
• /
• 제8권4호
• /
• pp.7-11
• /
• 2012

Cloud Computing can be viewed as a dynamically-scalable pool of resources. Virtualization is one of the key technologies enabling Cloud Computing functionalities. Virtual machines (VMs) scheduling and allocation is essential in Cloud Computing environment. In this paper, two dynamic VMs scheduling and allocating schemes are presented and compared. One dynamically on-demand allocates VMs while the other deploys optimal threshold to control the scheduling and allocating of VMs. The aim is to dynamically allocate the virtual resources among the Cloud Computing applications based on their load changes to improve resource utilization and reduce the user usage cost. The schemes are implemented by using SimPy, and the simulation results show that the proposed adaptive scheme with one threshold can be effectively applied in a Cloud Computing environment both performance-wise and cost-wise.

• ETRI Journal
• /
• 제25권4호
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.130-145
• /
• 1998

This paper is concerned with the optimization of a system reliability. Two kinds of the reliability model for optimal allocation of parallel redundancy are considered. The algorithm for solving the optimal redundancy problem is proposed by the use of dynamic programming(DP) method. The problem is approached with a standard DP formulation and the DP algorithm is applied to the model and then the optimal solution is found by the backtracking method. The method is applicable to the models having no constraints or having a cost constraint subject to a specified minimum requirement of the system reliability. A consequence of this study is that the developed computer program package are implemental for the optimization of the system reliability.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.50-64
• /
• 2016

Nowadays, smart meter (SM) technology is widely effectively used. In addition, power allocation (PA) and channel selection (CS) are considered problems with many proposed approaches. In this paper, we will suggest a specific scenario for an SM configuration system and show how to solve the optimization problem for transmission between SMs and the data concentrator unit (DCU), the center that collects the data from several SMs, via simulation. An efficient CS with PA scheme is proposed in the TV white space system, which uses the TV band spectrum. On the basic of the optimal configuration requirements, SMs can have a transmission schedule and channel selection to obtain the optimal efficiency of using spectrum resources when transmitting data to the DCU. The optimal goals discussed in this paper are the maximum capacity or maximum channel efficiency and the maximum allowable power of the SMs used to satisfy the quality of service without harm to another wireless system. In addition, minimization of the interference to the digital television system and other SMs is also important and needs to be considered when the solving coexistence scenario. Further, we propose a process that performs an interference analysis scheme by using the spectrum engineering advanced Monte Carlo analysis tool (SEAMCAT), which is an integrated software tool based on a Monte-Carlo simulation method. Briefly, the process is as follows: The optimization process implemented by genetic evolution optimization engines, i.e., a genetic algorithm, will calculate the best configuration for the SM system on the basis of the interference limitation for each SM by SEAMCAT in a specific configuration, which reaches the solution with the best defined optimal goal satisfaction.

• 지능정보연구
• /
• 제12권2호
• /
• pp.99-123
• /
• 2006

본 연구는 최적의 공급사슬을 구성하기 위해 다수의 주문을 다수의 참여자에게 할당하기 위한 방법으로 에이전트 협상을 이용하였다. 본 에이전트 협상은 투명한 정보공유를 바탕으로 참여자간의 전략적 협력관계를 형성하기 위한 조정 메커니즘을 제공하고 있으며, 모든 참여자(주문자, 제조자, 공급자)가 자신의 이득을 달성하고, 공급사슬 전체 관점에서도 파레토 최적해가 달성됨을 보여주고 있다. SET 모델기반의 스케줄링에서 지연생산비용과 조기생산비용이 발생되고, 경쟁적 관계에 놓인 다수의 참여자를 고려하였다. 이러한 동적공급사슬 환경에서 에이전트 협상의 결과가 파레토 최적해임을 증명하고, 성능을 검증하기 위해 수리적 모형을 수립하고, 휴리스틱 방법론과 비교하는 실험을 진행하였다.

• 지역연구
• /
• 제13권2호
• /
• pp.75-92
• /
• 1997

This paper is concerned with an estimation of optimal investment of road sector in 1996-2005. The main method is a Computable General Equilibrium (CGE) Model for Korea in which the optimal solution is derived in a recursively dynamic path. The model is composed of three main modules: the supply, the demand and the price. In this paper, the investment demand for the road is optimized with subject to national economic growth and price inflation. If the annual inflation level and the economic growth rate during 1996-2005 are set to 4.5%-5.0% and 6.0%-6.5% respectively, the optimal demand for the road investment is estimated as 155.1-180.1 trillion Won or 3.33%-3.89% of the GDP for ten years. It implies that the additional increase of the road investment by 0.61%-1.15% of the GDP is required for sustainable economic development, since the share of the road investment in the GDP of the latest 5 years has stayed around 2.27%. However, it is necessary to reduce construction investments on housing as well as to promote private financing of the road in order to maximize an efficiency of resource allocation.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.207-210
• /
• 2009

An efficient algorithm to compress high dynamic range (HDR) videos is proposed in this work. We separate an HDR video sequence into a tone-mapped low dynamic range (LDR) sequence and a ratio sequence. Then, we encode those two sequences using the standard H.264/AVC codec. During the encoding, we allocate a limited amount of bit budget to the LDR sequence and the ratio sequence adaptively to maximize the qualities of both the LDR and HDR sequences. While a conventional LDR decoder uses only the LDR stream, an HDR decoder can reconstruct the HDR video using the LDR stream and the ratio stream. Simulation results demonstrate that the proposed algorithm provides higher performance than the conventional methods.

• 한국통신학회논문지
• /
• 제34권1A호
• /
• pp.58-64
• /
• 2009

본 논문에서는 최적화된 $\beta$개로 최소 랜덤 채널 RCH(Random CHannels) 개수를 제한함으로써, 단말이 채널 경쟁 구간에서 채널을 획득할 확률을 높이고 지연시간을 줄이는 알고리즘을 제안한다. HIPERLAN/2의 MAC 프로토콜은 TDMA/TDD 기반으로 동작하며, 단말은 RCH 구간을 통해 채널 경쟁에서 성공함으로써 트래픽 전송기회를 획득한다. 그러므로 AP는 각 RCH에서의 단말들의 채널 요청 메시지의 충돌 여부에 따라, 다음 프레임에서 최적의 RCH 개수를 동적으로 할당할 수 있다. 따라서 본 논문에서는 최소 RCH 개수를 $\beta$개로 제한하는 동적 랜덤채널할당 기법을 통해 채널 경쟁에서의 최소 성공률을 보장함으로써 HIPERLAN/2의 시스템 성능을 향상시킨다. 또한 실제 인터넷 트래픽에 기반한 이더넷 분포와 배치 도착을 적용한 시뮬레이션을 통해 최적의 $\beta$ 값을 찾아내며, 제안하는 알고리즘이 기존 알고리즘과 비교하여 처리율이 향상되고 최대 19%의 지연시간이 감소됨을 보여준다.

• 한국컴퓨터정보학회논문지
• /
• 제16권4호
• /
• pp.127-135
• /
• 2011

백트래킹을 이용한 깊이우선탐색에서 해를 빨리 찾기 위한 방법 중 하나는 결정변수의 순서를 효과적으로 배열하는 것이다. 이 때 문제의 동적 및 정적 특성을 고려한 변수 순서화 알고리즘 개발은 매우 중요한 문제이다. 그러나 문제에 적합한 최적의 변수 순서화 알고리즘을 개발하는 것은 어려운 문제이다. 본 논문에서는 변수의 속성에 기반을 두어 문제의 형태를 규정하는 문제분류규칙을 제안하고 이 규칙을 이용하여 문제에 적합한 변수 순서화 알고리즘의 형태를 예측할 수 있게 한다. 결정변수가 동적 및 정적 특성을 갖는 DS-type 문제로서 주파수 할당문제를 선택하여 최적의 변수 순서화 알고리즘을 예측한다. 또한 문제분류규칙에 의해 생성되지 않는 특별한 형태의 문제인 기지국 위치문제를 적용하여 제안하는 문제분류규칙의 효용성을 입증한다.