• Journal of Korean Society of Steel Construction
• /
• v.22 no.1
• /
• pp.33-42
• /
• 2010

Patterning with a geodesic line is essential for economical or efficient usage of membrane materialsin fabric tension membrane structural engineering and analysis. The numerical algorithm to determine the geodesic line for membrane structures is generally classified into two. The first algorithm finds a non-linear shape using a fictitious geodesic element with an initial pre-stress, and the other algorithm is the geodesic line cutting or searching algorithm for arbitrarily curved 3D surface shapes. These two algorithms are still being used only for the three-node plane stress membrane element, and not for the four-node element. The lack of a numerical algorithm for geodesic lines with four-node membrane elements is the main reason for the infrequent use of the four-node membrane element in membrane structural engineering and design. In this paper, a modified numerical algorithm is proposed for the generation of a geodesic line that can be applied to three- or four-node elements at the same time. The explicit non-linear static Dynamic Relaxation Method (DRM) was applied to the non-linear geodesic shape-finding analysis by introducing the fictitiously tensioned 'strings' along the desired seams with the three- or four-node membrane element. The proposed algorithm was used for the numerical example for the non-linear geodesic shape-finding and patterning analysis to demonstrate the accuracy and efficiency, and thus, the potential, of the algorithm. The proposed geodesic shape-finding algorithm may improve the applicability of the four-node membrane element for membrane structural engineering and design analysis simultaneously in terms of the shape-finding analysis, the stress analysis, and the patterning analysis.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.1-11
• /
• 2008

Stiffness estimation of a shear building due to local damages is usually achieved though structural analysis based on the assumed material properties and idealized numerical modeling of structure. Conventional numerical modeling, however, frequently causes an inevitable error in the structural response and this makes it difficult to exactly predict the damage state in structure. To solve this problem, this paper introduces a damage detection technique for shear building using genetic algorithm. The introduced algorithm evaluates the damage in structure using a flexibility matrix since the flexibility matrix can exactly be obtained from the field test in spite of using a few lower dynamic modes of structure. The introduced algorithm is expected to be more effectively used in damage detection of structures rather than conventional method using the stiffness matrix. Moreover, even in cases when an accurate measurement of structural stiffness cannot be expected, the proposed technique makes it possible to estimate the absolute change in stiffness of the structure on the basis of genetic algorithm. The validity of the proposed technique is demonstrated though numerical analysis using OPENSEES.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.305-320
• /
• 2017

The selection of subset size is of great importance to the accuracy of digital image correlation (DIC). In the traditional DIC, a constant subset size is used for computing the entire image, which overlooks the differences among local speckle patterns of the image. Besides, it is very laborious to find the optimal global subset size of a speckle image. In this paper, a self-adaptive and bidirectional dynamic subset selection (SBDSS) algorithm is proposed to make the subset sizes vary according to their local speckle patterns, which ensures that every subset size is suitable and optimal. The sum of subset intensity variation (${\eta}$) is defined as the assessment criterion to quantify the subset information. Both the threshold and initial guess of subset size in the SBDSS algorithm are self-adaptive to different images. To analyze the performance of the proposed algorithm, both numerical and laboratory experiments were performed. In the numerical experiments, images with different speckle distribution, different deformation and noise were calculated by both the traditional DIC and the proposed algorithm. The results demonstrate that the proposed algorithm achieves higher accuracy than the traditional DIC. Laboratory experiments performed on a substrate also demonstrate that the proposed algorithm is effective in selecting appropriate subset size for each point.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.4
• /
• pp.1-9
• /
• 2012

The NCF control algorithm for an active suspension system was proposed and investigated. The NCF algorithm using spring dynamic variation force and suspension relative velocity was applied to the 1/4 vehicle model and numerical analysis was performed. Vehicle's performances such as vehicle displacement, vehicle acceleration, suspension deflection, tire deflection and absorbed power were calculated and compared with those of the passive, semi-active and LQR active suspension system that use full state feedback. Numerical results show that the proposed NCF active suspension system has superior performance compared with the passive and semi-active suspension system and has very similar performance compared with the LQR active suspension system. So the proposed NCF algorithm is considered as a highly practical algorithm because it requires only one displacement sensor in a 1/4 vehicle model.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.5 s.236
• /
• pp.609-616
• /
• 2005

While the SIMPLE algorithm is most widely used for the simulations of flow phenomena that take place in the industrial equipments or the manufacturing processes, it is less adopted for the simulations of the free surface flow. Though the SIMPLE algorithm is free from the limitation of time step, the free surface behavior imposes the restriction on the time step. As a result, the explicit schemes are faster than the implicit scheme in terms of computation time when the same time step is applied to, since the implicit scheme includes the numerical method to solve the simultaneous equations in its procedure. If the computation time of SIMPLE algorithm can be reduced when it is applied to the unsteady free surface flow problems, the calculation can be carried out in the more stable way and, in the design process, the process variables can be controlled based on the more accurate data base. In this study, a modified SIMPLE algorithm is presented fur the free surface flow. The broken water column problem is adopted for the validation of the modified algorithm (MoSIMPLE) and for comparison to the conventional SIMPLE algorithm.

• Journal of Astronomy and Space Sciences
• /
• v.35 no.4
• /
• pp.263-277
• /
• 2018

This paper presents a vision-based relative pose estimation algorithm and its validation through both numerical and hardware experiments. The algorithm and the hardware system were simultaneously designed considering actual experimental conditions. Two estimation techniques were utilized to estimate relative pose; one was a nonlinear least square method for initial estimation, and the other was an extended Kalman Filter for subsequent on-line estimation. A measurement model of the vision sensor and equations of motion including nonlinear perturbations were utilized in the estimation process. Numerical simulations were performed and analyzed for both the autonomous docking and formation flying scenarios. A configuration of LED-based beacons was designed to avoid measurement singularity, and its structural information was implemented in the estimation algorithm. The proposed algorithm was verified again in the experimental environment by using the Autonomous Spacecraft Test Environment for Rendezvous In proXimity (ASTERIX) facility. Additionally, a laser distance meter was added to the estimation algorithm to improve the relative position estimation accuracy. Throughout this study, the performance required for autonomous docking could be presented by confirming the change in estimation accuracy with respect to the level of measurement error. In addition, hardware experiments confirmed the effectiveness of the suggested algorithm and its applicability to actual tasks in the real world.

• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.128-134
• /
• 2012

In this manuscript, we consider electromagnetic imaging of perfectly conducting cracks completely hidden in a homogeneous material via boundary measurements. For this purpose, we carefully derive a topological derivative formula based on the asymptotic expansion formula for the existence of a perfectly conducting inclusion with a small radius. With this, we introduce a topological derivative based imaging algorithm and discuss its properties. Various numerical examples with noisy data show the effectiveness and limitations of the imaging algorithm.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.131-138
• /
• 1998

We derive a back-propagation learning algorithm of fuzzy neural networks using fuzzy operations, which preserves the shapes of fuzzy numbers, in order to utilize fuzzy if-then rules as well as numerical data in the learning of neural networks for classification problems and for fuzzy control problems. By introducing the shape preseving fuzzy operation into a neural network, the proposed network simplifies fuzzy arithmetic operations of fuzzy numbers with exact result in learning the network. And we illustrate our approach by computer simulations on numerical examples.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.