• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• 제어로봇시스템학회논문지
• /
• 제9권8호
• /
• pp.610-615
• /
• 2003

This paper proposes a nonlinear virtual coupling fur haptic interface, which offers better performance while maintaining stability of the system. The nonlinear virtual coupling is designed based on a human response model. This human response model exploits delay between the human Intention and the actual change of arm impedance. The proposed approach provides with less conservative constraints for the design of stable haptic interface, compared with the traditional passivity condition. This allows increased performance that is verified through experiments.

• Structural Engineering and Mechanics
• /
• 제26권6호
• /
• pp.725-739
• /
• 2007

In recent years there are many plate bending elements that emerged for solving both thin and thick plates. The main features of these elements are that they are based on mix formulation interpolation with discrete collocation constraints. These elements passed the patch test for mix formulation and performed well for linear analysis of thin and thick plates. In this paper a member of this family of elements, namely, the Discrete Reissner-Mindlin (DRM) is further extended and developed to analyze both thin and thick plates with geometric nonlinearity. The Von K$\acute{a}$rm$\acute{a}$n's large displacement plate theory based on Lagrangian coordinate system is used. The Hu-Washizu variational principle is employed to formulate the stiffness matrix of the geometrically Nonlinear Discrete Reissner-Mindlin (NDRM). An iterative-incremental procedure is implemented to solve the nonlinear equations. The element is then tested for plates with simply supported and clamped edges under uniformly distributed transverse loads. The results obtained using the geometrically NDRM element is then compared with the results of available analytical solutions. It has been observed that the NDRM results agreed well with the analytical solutions results. Therefore, it is concluded that the NDRM element is both reliable and efficient in analyzing thin and thick plates with geometric non-linearity.

• Structural Engineering and Mechanics
• /
• 제53권4호
• /
• pp.833-845
• /
• 2015

Natural frequencies of the structural systems should be far away from the excitation frequency in order to avoid or reduce the destructive effects of dynamic loads on structures. To accomplish this goal, a structural optimization on size and shape has been performed considering frequency constraints. Such an optimization problem has highly nonlinear property. Thus, the quality of the solution is not independent of the optimization technique to be applied. This study presents the performance evaluation of the recently proposed meta-heuristic algorithm called Teaching Learning Based Optimization (TLBO) as an optimization engine in the weight optimization of the truss structures under frequency constraints. Some examples regarding the optimization of trusses on shape and size with frequency constraints are solved. Also, the results obtained are tabulated for comparison. The results demonstrated that the performance of the TLBO is satisfactory. Additionally, TLBO is better than other methods in some cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.60-63
• /
• 1996

This study deals with the nonlinear H$_{\infty}$ control problem of linear system using nonlinear weight. Generally the solvable condition of nonlinear H$_{\infty}$ control problem is given by the Hamilton Jacobi equality or inequality, but it is very difficult to solve. In this study, some constraints of nonlinear weight reduce the solvable condition to linear Riccati equation. Some examples of the control system design using nonlinear weight are shown.n.

• 한국통신학회논문지
• /
• 제30권3C호
• /
• pp.141-146
• /
• 2005

The authors investigate the convergence speed problem of nonlinear adaptive equalization. Convergence constraints and time constant of radial basis function network using stochastic gradient (RBF-SG) algorithm is analyzed and a method of making time constant independent of hidden-node output power by using sample-by-sample node output power estimation is derived. The method for estimating the node power is to use a single-pole low-pass filter. It is shown by simulation that the proposed algorithm gives faster convergence and lower minimum MSE than the RBF-SG algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.279-282
• /
• 1995

In this paper, a moving horizon control algorithm, which can be applied for a wide class of nonlinear systems with control and state constraints, is considered. In a neighborhood of the origin, a linear feedback controller is applied. Outside this neighborhood, a moving horizon control law is applied. The time taken to solve an optimal control problem is considered in the algorithm so that the proposed control law can be applied as an on-line controller.

• Journal of applied mathematics & informatics
• /
• 제7권3호
• /
• pp.719-738
• /
• 2000

A dual algorithm based on the smooth function proposed by Polyak (1988) is constructed for solving nonlinear programming problems with inequality constraints. It generates a sequence of points converging locally to a Kuhn-Tucker point by solving an unconstrained minimizer of a smooth potential function with a parameter. We study the relationship between eigenvalues of the Hessian of this smooth potential function and the parameter, which is useful for analyzing the effectiveness of the dual algorithm.

• 경영과학
• /
• 제32권1호
• /
• pp.15-33
• /
• 2015

Under complete information, introducing additional constraints to a portfolio will have a negative impact on performance. However, real-life investments inevitably involve use of error-prone estimations, such as expected stock returns. In addition to the reality of incomplete data, investments of most Korean domestic equity funds are regulated externally by the government, as well as internally, resulting in limited maximum investment allocation to single stocks and risk free assets. This paper presents an investment framework, which takes such real-life situations into account, based on a newly developed portfolio selection model considering realistic constraints under incomplete information. Additionally, we examined the effects of additional constraints on portfolio's performance under incomplete information, taking the well-known Samsung and SK group stocks as performance benchmarks during the period beginning from the launch of each commercial fund, 2005 and 2007 respectively, up to 2013. The empirical study shows that an investment model, built under incomplete information with additional constraints, outperformed a model built without any constraints, and benchmarks, in terms of rate of return, standard deviation of returns, and Sharpe ratio.

• 대한교통학회지
• /
• 제18권1호
• /
• pp.61-73
• /
• 2000

이 논문은 변동부등식을 제약조건으로 하는 연속형 변수의 가로망 설계 문제를 풀기 위한 해석 알고리즘을 제시하는 것을 목적으로 한다. 가로망 설계 문제는 문제의 특성상 비선형의 목적함수와 비선형. 비볼록한 제약식으로 인해 다수의 국지해를 갖으며, 이러한 여러 국지해 중 가장 최적의 해를 구하는 것에 관심이 모아지고 있다. 전역 최적해를 찾을 수 있는 기존의 방법들은 확률적 최적화 방법에 속하는데 이 논문에서는 유전자 알고리즘의 접근법을 사용하여 2개의 다른 예제 가로망에서 5개의 서로 다른 해석 알고리즘에 대한 비교를 행하였으며. 그 해석결과를 기술하였다. 이 논문에서 사용된 정책결정자의 설계 변수는 가로망상 링크의 용량 변수이며, 연속형 변수의 어떤 설계 변수에도 적절한 변환과정을 거쳐 사용이 가능하다.