• 대한전자공학회논문지
• /
• 제27권4호
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• 대한안전경영과학회지
• /
• 제8권5호
• /
• pp.167-180
• /
• 2006

This study expands limitation of OASIS(Optimal Allocation of Spares for Initial Supports) program, which calculates CSP(Concurrent Spare Part), not only availability but also cost, and developed the program enabling run in WINDOW OS. By considering multi-step repair and logistics support system, repairing capability at the time of deployment, and procurement period, this model is the first local model reflecting circumstances of the armed forces of the Republic of Korea. Furthermore, the programmed model was selected as the military standard software and has being essentially used for CSP calculation.

• Journal of Communications and Networks
• /
• 제14권2호
• /
• pp.151-161
• /
• 2012

This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional water-filling interpretations. Next, stochastic data arrivals are addressed. Finally, online and/or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.1-8
• /
• 2010

A vendor selection problem consists of two different kinds of decision making. First one is to choose the best suppliers among all possible suppliers and the next is to allocate the optimal quantities of orders among the selected vendors. In this study, an integration of the technique for order preference by similarity to ideal solution (TOPSIS) and a multi-objective mixed integer programming (MOMIP) is developed to account for all qualitative and quantitative factors which are used to evaluate and choose the best group of vendors and to decide the optimal order quantity for each vendor. A solution methodology for the vendor selection model of multiple-vendor, multiple-item with multiple decision criteria and in respect to finite vendor capacity is presented.

• Journal of Communications and Networks
• /
• 제18권4호
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 추계학술대회 논문집 전력기술부문
• /
• pp.151-153
• /
• 2003

This paper proposes determining a optimal number, size and allocation of DGs(Distributed Generations) needed to minimize operation cost of distribution system, obtains economic benefit in operation planning of DG and improves system reliability. System reliability is assessed whether DG install and reliability cost consider. DG optimal allocations are determined to minimize total cost with power buying cost, operation cost of DG, loss cost and outage cost using GA(Genetic Algorithm). And it was determined installed load-point and order.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1379-1397
• /
• 2013

We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

• International Journal of Quality Innovation
• /
• 제9권2호
• /
• pp.57-77
• /
• 2008

The $21^{st}$ century is a new century of environmental protection. Environmental protection is one of the most important subject matters yet to come. Moreover, as the public pays more attention to environmental problems, enterprises should increase their investment in environmental management. Therefore, determining the investment level for environmental management and allocating the investment to associated environmental management activities has become a major task. The principal and agent theory and sales response functions are used for analysis in this research. The allocation of capital investment in environmental management is found to have significant impact on the aggregate sales response, aggregate profit and investment level. Therefore, in preparing the budget for environmental management, enterprises should focus on investment allocation decisions, determine the investment level and allocation method using integrated means, and apply submarket data in the allocation decision-making process. In other words, in setting the investment level, executive management should take managers' willingness into consideration. In allocating capital investment, managers should identify the optimal allocation method based on submarket characteristics.

• 대한전자공학회논문지TC
• /
• 제45권1호
• /
• pp.59-65
• /
• 2008

본 논문에서는 직교 주파수 분할 다중 접속 방식(OFDMA, Orthogonal frequency Division Multiple Access)에서 전송률의 비율적 제한 조건(Constraint)이 고려된 자원 할당 방식에 대해 논의한다. 제안된 자원 할당 방식은 비트 오율, 전송 전력 및 전송 비율 등에 관한 제한 조건 하에서 사용자들이 요구하는 다양한 서비스를 만족하면서 최대의 시스템 전송률을 얻기 위한 최적화 문제를 다룬다. 본 문제에 관한 최적의 해(optimal solution)는 상당히 복잡하므로 부 채널 할당과 전력 할당을 나누어 복잡도를 낮춘 부 최적 해(Suboptimal solution)를 제안한다. 먼저, 각 사용자에게 할당될 부 채널의 수를 사용자들의 평균 신호 대 잡음비와 전송률 비율을 기반으로 결정한다. 이어서 사용자에게 할당될 부 채널은 변형된 max-min 알고리즘에 따라 결정되고 이를 기반으로 최적화 문제에 대한 Lagrange dual 문제의 해를 구하는 최적의 전력 할당 방식을 제안한다. 또한 보다 낮은 복잡도를 갖는 전력 할당을 위해 반복적 전송 비율 검출 알고리즘을 제안한다. 마지막으로 모의실험을 통해 본 논문에서는 제안하는 알고리즘이 사용자 간의 전송률에 관한 공평성(fairness)을 정확히 만족하면서 시스템의 전송률을 극대화할 수 있음을 분석한다.

• 인터넷정보학회논문지
• /
• 제11권3호
• /
• pp.43-51
• /
• 2010

본 논문에서는OFDMA-TDD 구조를 갖는 IEEE802.16j 기반의 2-홉 셀룰러 중계시스템에서 non-transparent 방식의 무선 중계기를 이용하여 서비스 영역을 확장할 때, 시스템 전송률 및 하향링크 접근영역(Access zone)과 중계영역(Relay zone)에 대한 최적 무선자원 할당방법을 연구한다. 분석을 위해 먼저 non-transparent 방식의 MAC (Media Access Control) 프레임 구조를 알아보고, 접근영역과 중계영역에서 단말과 중계기 등의 네트워크 구성요소들에 대한 간섭요소들을 조사한다. 모의실험을 통하여 기지국과 중계기의 거리에 따라 확장되는 2-홉 셀 커버리지 크기와 전송률을 분석하고, 분석된 결과를 이용하여 하향링크 접근영역과 중계영역에 대한 최적 무선자원 할당량을 제시한다.