• 한국경영과학회지
• /
• 제25권1호
• /
• pp.27-36
• /
• 2000

We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.225-228
• /
• 1992

The purpose of this project is the presentation of new method for selection of a scalar control of linear time-periodic system. The approach has been proposed by Radziszewski and Zaleski [4] and utilizes the quadratic form of Lyapunov function. The system under consideration is assigned either in closed-loop state or in modal variables as in Calico, Wiesel [1]. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T, each element being represented by a Fourier series. As the optimal gain matrix we consider the matrix ensuring the minimum value of the larger real part of the two Poincare exponents of the system. The method, based on two-step optimization procedure, allows to find the approximate optimal gain matrix. At present state of art determination of the gain matrix for this case has been done by systematic numerical search procedure, at each step of which the Floquet solution must be found.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 춘계학술대회
• /
• pp.417-428
• /
• 2008

Designers have to consider voice of customer, process capability, manufacturing standards & condition, manufacturing method, characteristics of products to decide tolerances. Especially, in case of position of hole and pin, designers have to consider process capability to decide tolerances. The traditional position tolerances used in a drawing are theoretical values which are allocated to position under the worst case assembling condition that both hole and pin are the maximum material condition(MMC). However, When the process capability is high, more exact product size can be produced under stable manufacturing condition. larger clearance of hole and pin can be allocated. In this point of view, manufacturer could increase the yield by allocating larger position tolerance than theoretical position tolerance of hole and pin considering process capability.

• 대한안전경영과학회지
• /
• 제11권1호
• /
• pp.75-85
• /
• 2009

Designers have to consider voice of customer, process capability, manufacturing standards & condition, manufacturing method and characteristics of products to decide tolerances. Especially, in case of position of hole and pin, designers have to consider process capability to decide tolerances. The traditional position tolerances used in a drawing are theoretical values which are allocated to position under the worst case assembling condition that both hole and pin are the maximum material condition(MMC). However, when the process capability is high, more exact product size can be produced under stable manufacturing condition. Larger clearance of hole and pin can be allocated. In this point of view, manufacturer could increase the yield by allocating larger position tolerance than theoretical position tolerance of hole and pin considering process capability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5712-5728
• /
• 2017

Recently, there are many studies, that considering green wireless cellular networks, have taken the energy consumption of the base station (BS) into consideration. In this work, we first introduce an energy consumption model of multi-mode sharing BS powered by multiple energy sources including renewable energy, local storage and power grid. Then communication load requests of the BS are transformed to energy demand queues, and battery energy level and worst-case delay constraints are considered into the virtual queue to ensure the network QoS when our objective is to minimize the long term electricity cost of BSs. Lyapunov optimization method is applied to work out the optimization objective without knowing the future information of the communication load, real-time electricity market price and renewable energy availability. Finally, linear programming is used, and the corresponding energy efficient scheduling policy is obtained. The performance analysis of our proposed online algorithm based on real-world traces demonstrates that it can greatly reduce one day's electricity cost of individual BS.

• 전기학회논문지
• /
• 제66권3호
• /
• pp.513-521
• /
• 2017

Robust optimal operation of a microgrid is required since the increase of the penetration level of renewable generators in the microgrid raises uncertainty due to their intermittent power output. In this paper, an application of probabilistic optimization method to economical operation of a microgrid is studied. To simplify the treatment of the uncertainties of renewable generations and load, the new 'band of virtual equivalent load variation' is introduced considering their uncertainties. A simplified robust optimization methodology to generate the scenarios within the band of virtual equivalent load variation and to obtain the optimal solution for the worst scenario is presented based on Monte Carlo method. The microgrid to be studied here is composed of distributed generation system(DGs), battery systems and loads. The distributed generation systems include combined heat and power(CHP) and small generators such as diesel generators and the renewable energy generators such as photovoltaic(PV) systems and wind power systems. The modeling of the objective function for considering interruption cost by the penalty function is presented. Through the case study for a microgrid with uncertainties, the validity of proposed robust optimization methodology is evaluated.

• International Journal of Aeronautical and Space Sciences
• /
• 제13권1호
• /
• pp.43-57
• /
• 2012

In a modern aircraft, there are many variations in its mass, stiffness, and aerodynamic characteristics. Recently, an analytical approach was proposed, and this approach uses the idea of uncertainty to find out the most critical flight flutter boundary due to the variations in such aerodynamic characteristics. An analytical method that has been suggested to predict robust stability is the mu method. We previously analyzed the robust flutter boundary by using the mu method, and in that study, aerodynamic variations in the Mach number, atmospheric density, and flight speed were taken into consideration. The authors' previous attempt and the results are currently quoted as varying Mach number mu analysis. In the author's previous method, when the initial flight conditions were located far from the nominal flutter boundary, conservative predictions were obtained. However, relationships among those aerodynamic parameters were not applied. Thus, the varying Mach number mu analysis results required validation. Using an optimization approach, the varying Mach number mu analysis was found out to be capable of capturing a reasonable robust flutter boundary, i.e., with a low percentage difference from boundaries that were obtained by optimization. Regarding the optimization approach, a discrete nominal flutter boundary is to be obtained in advance, and based on that boundary, an interpolated function was established. Thus, the optimization approach required more computational effort for a larger number of uncertainty variables. And, this produced results similar to those from the mu method which had lower computational complexity. Thus, during the estimation of robust aeroelastic stability, the mu method was regarded as more efficient than the optimization method was. The mu method predicts reasonable results when an initial condition is located near the nominal flutter boundary, but it does not consider the relationships that are among the aerodynamic parameters, and its predictions are not very accurate when the initial condition is located far from the nominal flutter boundary. In order to provide predictions that are more accurate, the relationships among the uncertainties should also be included in the mu method.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• 전자공학회논문지
• /
• 제50권7호
• /
• pp.131-139
• /
• 2013

기존 전기적 상호 연결을 사용한 네트워크-온-칩(Network-on-Chip, NoC)의 전력 및 성능 한계를 보완하고자 광학적 상호연결을 이용하는 하이브리드 광학 네트워크-온-칩(HONoC)이 등장하였다. 하지만 HONoC에서는 광학적 소자 특성으로 인해 서킷 스위칭을 사용함으로써 경로 충돌이 빈번하게 발생하며 이로 인해 지연 시간 불균형의 문제가 심화되어 전체적인 시스템 성능에 악영향을 미치게 된다. 본 논문에서는 경로 충돌을 최소화 시켜 지연 시간을 최적화 할 수 있는 새로운 태스크 매핑 알고리즘을 제안하였다. HONoC 환경에서 태스크를 각 Processing Element (PE)에 할당하고 경로 충돌을 최소화하며, 부득이한 경로 충돌의 경우 워스트 케이스 (worst case) 지연 시간을 최소화 할 수 있도록 하였다. 모의실험 결과를 통해 무작위 매핑 방식, 대역폭 제한 매핑 방식과 비교하여, 제안된 알고리즘이 $4{\times}4$ 메시 토폴로지에서는 평균 43%, $8{\times}8$ 메시 토폴로지에서는 평균 61%의 지연 시간 단축 효과가 있음을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.