• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.04a
• /
• pp.128-136
• /
• 2001

This paper presents an optimum deck and girder system design for minimizing the life-cycle cost (LU) of steel box girder bridges. The problem of optimum LCC design of steel box girder bridges is formulated as that of minimization of the expected total LCC that consists of initial cost, maintenance cost, expected retrofit costs for strength, deflection, and crack. To demonstrate the effect of LCC optimum design of steel box girder bridges, the LCC optimum design is compared with conventional design method for steel box girder bridges design. From the numerical investigations, it may be positively stated that the optimum design of steel box girder bridges based on LCC will lead to more rational, economical and safer design.

• Computational Structural Engineering : An International Journal
• /
• v.1 no.1
• /
• pp.59-69
• /
• 2001

This study is intended to propose a systematic approach for reliability-based assessment of life cycle cost (LCC) effectiveness and economic efficiency for cost-effective seismic upgrading of existing bridges. The LCC function is expressed as the sum of the upgrading cost and all the discounted life cycle damage costs, which is formulated as a function of the Park-Ang damage index and structural damage probability. The damage costs are expressed in terms of direct damage costs such as repair/replacement costs, human losses and property damage costs, and indirect damage costs such as road user costs and indirect regional economic losses. For dealing with a variety of uncertainties associated with earthquake loads and capacities, a simulation-based reliability approach is used. The SMART-DRAIN-2DX, which is a modified version of the well-known DRAIN-2DX, is extended by incor-porating LCC analysis based on the LCC function developed in the study. Economic efficiencies for optimal seismic upgradings of the continuous PC segmental bridges are assessed using the proposed LCC functions and benefit-cost ratio.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.699-717
• /
• 2012

In this paper, we deal with the robust mixed $H_2/H_{\infty}$ guaranteed-cost control problem involving uncertain neutral stochastic distributed delay systems. More precisely, the aim of this problem is to design a robust mixed $H_2/H_{\infty}$ guaranteed-cost controller such that the close-loop system is stochastic mean-square exponentially stable, and an $H_2$ performance measure upper bound is guaranteed, for a prescribed $H_{\infty}$ attenuation level ${\gamma}$. Therefore, the fast convergence can be fulfilled and the proposed controller is more appealing in engineering practice. Based on the Lyapunov-Krasovskii functional theory, new delay-dependent sufficient criteria are proposed to guarantee the existence of a desired robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which are derived in terms of linear matrix inequalities(LMIs). Furthermore, the design problem of the optimal robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which minimized an $H_2$ performance measure upper bound, is transformed into a convex optimization problem with LMIs constraints. Finally, two simulation examples illustrate the design procedure and verify the expected control performance.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.70-77
• /
• 2002

Since our physical world cannot be modeled as rigid body, deformable object models are important. For real-time simulation of elastic object, it must be guaranteed by its exact solution and low-latency computational cost. In this paper, we describe the boundary integral equation formulation of linear elastic body and related boundary element method(BEM). The deformation of elastic body can be effectively solved with 1ow run-time computational costs, using precomputed Green Function and fast low-rank updates based on Capacitance Matrix Algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.138-141
• /
• 1997

In this study, a simulation model is developed to analyze the effects of routing and scale-economy of transmission facilities on the traffic network topology and investment cost changes in a metropolitan telephone network. Computational experiments showed that the wide deployment of bifurcated routing in a dual-homing configuration reduces significantly the traffic network connectivity and the investment cost. Its enhanced version, when combined with the subscriber network cost model, can be used as a prototype cost proxy model for figuring out the access charges in a multi-operator environment.

• Structural Engineering and Mechanics
• /
• v.52 no.6
• /
• pp.1121-1134
• /
• 2014

Structural design is usually an optimization process. Numerous parameters such as the member shapes and sizes, the elasticity modulus of material, the locations of nodes and the support constraints can be selected as design variables. These variables are progressively revised in order to obtain a satisfactory structure. Each modification requires a fresh analysis for the displacements and stresses, and reanalysis can be employed to reduce the computational cost. This paper is focused on static reanalysis problem with modification of deleting some supports. An efficient reanalysis method is proposed. The method makes full use of the initial information and preserves the ease of implementation. Numerical examples show that the calculated results of the proposed method are the identical as those of the direct analysis, while the computational time is remarkably reduced.

• Structural Engineering and Mechanics
• /
• v.62 no.3
• /
• pp.297-302
• /
• 2017

Structural reanalysis is frequently utilized to reduce the computational cost so that the process of design or optimization can be accelerated. The supports can be regarded as the design variables and may be modified in various types of structural optimization problems. The location, number, and type of supports can make a great impact on the performance of the structure. This paper presents a unified method for structural static reanalysis with imposition or relaxation of some support constraints. The information from the initial analysis has been fully utilized and the computational time can be significantly reduced. Numerical examples are used to validate the effectiveness of the proposed method.

• Structural Engineering and Mechanics
• /
• v.43 no.3
• /
• pp.273-285
• /
• 2012

Structural reanalysis is frequently used to reduce the computational cost during the process of design or optimization. The supports can be regarded as the design variables in various types of structural optimization problems. The location, number, and type of supports may be varied in order to yield a more effective design. The paper is focused on structural static reanalysis problem with added supports where some node displacements along axes of the global coordinate system are specified. A new approach is proposed and exact solutions can be provided by the approach. Thus, it belongs to the direct reanalysis methods. The information from the initial analysis has been fully exploited. Numerical examples show that the exact results can be achieved and the computational time can be significantly reduced by the proposed method.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.83-108
• /
• 1997

Chebysheff-Halley methods are probably the best known cubically convergent iterative procedures for solving nonlinear equa-tions. These methods however require an evaluation of the second Frechet-derivative at each step which means a number of function eval-uations proportional to the cube of the dimension of the space. To re-duce the computational cost we replace the second Frechet derivative with a fixed bounded bilinear operator. Using the majorant method and Newton-Kantorovich type hypotheses we provide sufficient condi-tions for the convergence of our method to a locally unique solution of a nonlinear equation in Banach space. Our method is shown to be faster than Newton's method under the same computational cost. Finally we apply our results to solve nonlinear integral equations appearing in radiative transfer in connection with the problem of determination of the angular distribution of the radiant-flux emerging from a plane radiation field.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.4
• /
• pp.314-322
• /
• 2021

Skeleton-based action recognition has attracted considerable attention in human action recognition. Recent methods for skeleton-based action recognition employ spatiotemporal graph convolutional networks (GCNs) and have remarkable performance. However, most of them have heavy computational complexity for robust action recognition. To solve this problem, we propose a shuffle graph convolutional network (SGCN) which is a lightweight graph convolutional network using pointwise group convolution rather than pointwise convolution to reduce computational cost. Our SGCN is composed of spatial and temporal GCN. The spatial shuffle GCN contains pointwise group convolution and part shuffle module which enhances local and global information between correlated joints. In addition, the temporal shuffle GCN contains depthwise convolution to maintain a large receptive field. Our model achieves comparable performance with lowest computational cost and exceeds the performance of baseline at 0.3% and 1.2% on NTU RGB+D and NTU RGB+D 120 datasets, respectively.