• 한국농공학회지
• /
• 제39권2호
• /
• pp.74-85
• /
• 1997

This study aims at the development of a mathematical approach for the optimal water allocation in the river basin where available water is not in sufficient. Its optimal allocation model is determined from the comparison and analysis of mathematical programming techniques such as transportation programming and dynamic programming models at its optimal allocation models. The water allocation system used in this study is designed to be the optimal water allocation which can satisfy the water deficit in each district through inter-basin water transfer between Kumho river basin which is a tributary catchment of Nakdong river basin, and the adjacent Hyungsan river basin, Milyang river basin and Nakdong upstream river basin. A general rule of water allocation is obtained for each district in the basins as the result of analysis of the optimal water allocation in the water allocation system. Also a comparison of the developed models proves that there is no big difference between the models Therefore transportation programming model indicates most adequate to the complex water allocation system in terms of its characteristics It can be seen, however, that dynamic programming model shows water allocation effect which produces greater net benefit more or less.

• ETRI Journal
• /
• 제37권1호
• /
• pp.11-20
• /
• 2015

This paper deals with optimal power allocation for channel estimation of orthogonal frequency-division multiplexing uplinks in time-varying channels. In the existing literature, the estimation of time-varying channel response in an uplink environment can be accomplished by estimating the corresponding channel parameters. Accordingly, the optimal power allocation studied in the literature has been in terms of minimizing the mean square error of the channel estimation. However, the final goal for channel estimation is to enable the application of coherent detection, which usually means high spectral efficiency. Therefore, it is more meaningful to optimize the power allocation in terms of capacity. In this paper, we investigate capacity with imperfect channel estimation. By exploiting the derived capacity expression, an optimal power allocation strategy is developed. With this developed power allocation strategy, improved performance can be observed, as demonstrated by the numerical results.

• East Asian Economic Review
• /
• 제25권3호
• /
• pp.310-336
• /
• 2021

We use iterative numerical procedures combined with analytical methods due to Rapach and Wohar (2009) to solve for the dynamic asset allocation strategy for optimal portfolio demand. We compare different optimal portfolio demands when investors in each country have different access to overseas and domestic investment opportunities. The optimal dynamic asset allocation strategy without foreign investment opportunities leads domestic investors in Korea, Hong Kong, and Singapore to allocate more funds to domestic bonds than to domestic stocks. However, the U.S. investors allocate more wealth to domestic stocks than to domestic bonds. Investors in all countries short bills at a low level of risk aversion. Next, we investigate dynamic asset allocation strategy when domestic investors in Korea have access to foreign markets. The optimal portfolio demand leads investors in Korea to allocate most resources to domestic bonds and foreign stocks. On the other hand, the portfolio weights on foreign bonds and domestic stocks are relatively low. We also analyze dynamic asset allocation strategy for the investors in the U.S., Hong Kong, and Singapore when they have access to the Korean markets as overseas investment opportunities. Compared to the results when the investors only have access to domestic markets, the investors in the U.S. and Singapore increase the portfolio weights on domestic stocks in spite of the overseas investment opportunities in the Korean markets. The investors in the U.S., Hong Kong, and Singapore short domestic bills to invest more than initial funds in risky assets with a varying degree of relative risk aversion coefficients without exception.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.48-69
• /
• 2004

An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.302-305
• /
• 2000

This paper proposed an optimal register resource allocation algorithm using graph coloring for minimal register at high level synthesis. The proposed algorithm constructed interference graph consist of the intermediated representation CFG to description VHDL. and at interference graph fur the minimal select color selected a position node at stack, the next inserted spill code and the graph coloring process executes for optimal register allocation. The proposed algorithm proves to effect that result compare another allocation techniques through experiments of bench mark.

• 응용통계연구
• /
• 제34권5호
• /
• pp.671-683
• /
• 2021

멱배정의 전체 효율은 최적배정보다 감소하지만, 층별 표본을 골고루 배정하는 기법이며 조사 현장에서는 제곱근 비례배정으로 많이 사용된다. 그리고 실제조사에서는 무응답을 고려하여 이론적 공식에서 나오는 것보다 더 많은 표본크기를 추출한다. 본 연구에서는 층별 표본크기를 결정함에 있어서 멱배정 방법에 층별 응답률의 정보를 추가하여 배정하는 기법을 연구한다. 제안된 배정기법들을 비례,최적,제곱근 비례 배정과 비교하며 응답률이 추가된 비례, 최적배정과도 비교하는 것을 모의실험을 통해 살펴봄으로써 배정방법들의 장단점을 살펴본다.

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

In this paper, we consider broadband satellite systems using MF-TDMA(Multi-Frequency Time Division Multiple Access) scheme. First, we analyze return link, superframe structure, and QoS( Quality of Service) parameters in broadband satellite systems, and mathematically formulate the QoS-based optimal timeslot allocation problem as a nonlinear integer programming problem for broadband satellite systems with clear-sky and rain-fade satellite terminals, and multiple data classes. Next, we modify the proposed problem to solve it within in a fast time, and suggest the QoS-based optimal timeslot allocation scheme. Extensive simulation results show that the proposed scheme finds an optimal solution or a near optimal solution within 5ms at Pentium IV PC.

• Journal of Power Electronics
• /
• 제19권5호
• /
• pp.1289-1302
• /
• 2019

In this paper, an optimal allocation method of a hybrid active power filter in an active distribution network is designed based on the differential evolution algorithm to resolve the harmonic generation problem when a distributed generation system is connected to the grid. A distributed generation system model in the calculation of power flow is established. An improved back/forward sweep algorithm and a decoupling algorithm are proposed for fundamental power flow and harmonic power flow. On this basis, a multi-objective optimization allocation model of the location and capacity of a hybrid filter in an active distribution network is built, and an optimal allocation scheme of the hybrid active power filter based on the differential evolution algorithm is proposed. To verify the effect of the harmonic suppression of the designed scheme, simulation analysis in an IEEE-33 nodes model and an experimental analysis on a test platform of a microgrid are adopted.

• Communications for Statistical Applications and Methods
• /
• 제16권4호
• /
• pp.595-603
• /
• 2009

통상적으로 표준적인 최적배분은 층별 조사비용을 고려하여 표본을 배분한다. 만일 조사단위당 비용이 서로 다를 경우 보다 현실적인 배분방법을 고려할 필요가 있다. 즉, 개별 조사단위의 특성에 따라 이익비용비를 최대로 하는 단위를 먼저 표본으로 고려하는 동적배분을 고려하였다. 이러한 관점에서 층별 표본수를 배분하고, 배분된 표본규모에 따라 임의로 표본을 선정하는 방식인 표준적인 최적배분과는 차이가 있다. 이 논문은 약물오용, 낙태, 알콜중독 등과 같은 민감한 특성을 조사하는 층화확률화 응답기법에 대해 각 층별로 표본을 배분할 경우 최적 동적배분을 고려하여 보다 현실적인 문제를 해결하고자 하였으며, 수치적 예제를 통해 동적배분 방법의 효과성을 증명하였다.

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

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.