• Computers and Concrete
• /
• 제9권5호
• /
• pp.327-340
• /
• 2012

The search for a design that meets both performance and safety, with minimal cost and lesser environmental impact was always the goal of structural engineers. In general, the design of conventional reinforced concrete structures is an iterative process based on rules of thumb established from the personal experience and intuition of the designer. However, such procedure makes the design process exhaustive and only occasionally leads to the best solution. In such context, this work presents the development and implementation of a mathematical formulation for obtaining optimal sections of reinforced concrete columns subjected to uniaxial flexural compression, based on the verification of strength proposed by the Brazilian standard NBR 6118 (ABNT 2007). To minimize the cost of the reinforced concrete columns, the Simulated Annealing optimization method was used, in which the amount and diameters of the reinforcement bars and the dimensions of the columns cross sections were considered as discrete variables. The results obtained were compared to those obtained from the conventional design procedure and other optimization methods, in an attempt to verify the influence of resistance class, variations in the magnitudes of bending moment and axial force, and material costs on the optimal design of reinforced concrete columns subjected to uniaxial flexural compression.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.159-167
• /
• 2023

Objective: • To detect black hole and warm hole attacks in wireless sensor networks. • To give a solution for energy depletion and security breach in wireless sensor networks. • To address the security problem using strategic decision support system. Methods: The proposed stackelberg game is used to make the spirited relations between multi leaders and multi followers. In this game, all cluster heads are acts as leaders, whereas agent nodes are acts as followers. The game is initially modeled as Quadratic Programming and also use backtracking search optimization algorithm for getting threshold value to determine the optimal strategies of both defender and attacker. Findings: To find optimal payoffs of multi leaders and multi followers are based on their utility functions. The attacks are easily detected based on some defined rules and optimum results of the game. Finally, the simulations are executed in matlab and the impacts of detection of black hole and warm hole attacks are also presented in this paper. Novelty: The novelty of this study is to considering the stackelberg game with backtracking search optimization algorithm (BSOA). BSOA is based on iterative process which tries to minimize the objective function. Thus we obtain the better optimization results than the earlier approaches.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• pp.159-167
• /
• 2000

In optimization problems, computationally intensive or expensive simulations hinder the use of standard optimization techniques because the computational expense is too heavy to implement them at each iteration of the optimization algorithm. Therefore, those expensive simulations are often replaced with approximation models which can be evaluated nearly free. However, because of the limited accuracy of the approximation models, it is practically impossible to find an exact optimal point of the original problem. Significant efforts have been made to overcome this problem. The approximation models are sequentially updated during the iterative optimization process such that interesting design points are included. The interesting points have a strong influence on making the approximation model capture an overall trend of the original function or improving the accuracy of the approximation in the vicinity of a minimizer. They are successively determined at each iteration by utilizing the predictive ability of the approximation model. This paper will focuses on those approaches and introduces various approximation methods.

• Journal of applied mathematics & informatics
• /
• 제34권5_6호
• /
• pp.383-395
• /
• 2016

The convergence rate of a numerical procedure based on Schwarz Alternating Method (SAM) for solving elliptic boundary value problems depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It has been observed that the Robin condition (mixed interface condition), controlled by a parameter, can optimize SAM's convergence rate. In [8], one formulated the twolayer multi-parameterized SAM and determined the optimal values of the multi-parameters to produce the best convergence rate for one-dimensional elliptic boundary value problems. Two-dimensional implementation was presented in [10]. In this paper, we present an implementation for threedimensional problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.988-991
• /
• 1996

The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.33-44
• /
• 2015

The convergence rate of a numerical procedure based on Schwarz Alternating Method(SAM) for solving elliptic boundary value problems depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It has been observed that the Robin condition (mixed interface condition), controlled by a parameter, can optimize SAM's convergence rate. In [7], one formulated the multi-parameterized SAM and determined the optimal values of the multi-parameters to produce the best convergence rate for one-dimensional elliptic boundary value problems. Two-dimensional implementation was presented in [8]. In this paper, we present an implementation for three-dimensional problem.

• 한국CDE학회논문집
• /
• 제5권3호
• /
• pp.285-292
• /
• 2000

A new method for the 3D automatic registration of the multiple range images has been developed for the 3D scanners(non-contact coordinates measurement systems). In the existing methods, the user usually has to input more than 3 pairs of corresponding points for the iterative registration process. The major difficulty of the existing systems lies in that the input corresponding points must be selected very carefully because the optimal searching process and the registration results mostly depend upon the accuracy of the selected points. In the proposed method, this kind of difficulty is greatly mitigated even though it needs only 2 pairs of the corresponding input points. Several registration examples on the 3D measured data have been presented and discussed with the introduction to the proposed algorithm.

• 대한전기학회논문지
• /
• 제37권5호
• /
• pp.282-288
• /
• 1988

A Multi-grid method is introduced to Finite Element Analysis of electromagnetic field problems in order to reduce the computational time. The puropse of this work is to study how to intermix discretization and solving process, thereby making the process more effective and to find the optimal factors of Multi-grid method. Several numerical experiments with linear models of uniform and nonuniform grids confirm that the proposed algorithm can reduce the computational time very effectively as compared with con ventional iterative methods. The best results are obtained with V cycle and S.O.R. with the acce leration factor of 1.3-1.4 for smoothing.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.101-124
• /
• 2002

The convergence rate of a numerical procedure barred on Schwarz Alternating Method (SAM) for solving elliptic boundary value problems (BVP's) depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It hee been observed that the Robin condition(mixed interface condition), controlled by a parameter, can optimize SAM's convergence rate. Since the convergence rate is very sensitive to the parameter, Tang[17] suggested another interface condition called over-determined interface condition. Based on the over-determined interface condition, we formulate the two-layer multi-parameterized SAM. For the SAM and the one-dimensional elliptic model BVP's, we determine analytically the optimal values of the parameters. For the two-dimensional elliptic BVP's , we also formulate the two-layer multi-parameterized SAM and suggest a choice of multi-parameter to produce good convergence rate .