• Structural Engineering and Mechanics
• /
• v.78 no.1
• /
• pp.53-66
• /
• 2021

The determination of the damage index to reveal the performance level of a structure can constitute the seismic risk generalization approach based on the parametric analysis. This study implemented this concept to one kind of civil engineering structure that is the concrete gravity dam. Different cases of the structure exhibit their individual responses, which constitute different considerations. Therefore, this approach allows the parametric study of concrete as well as soil for evaluating the seismic nature in the generalized case. To ensure that the target algorithm applicable to most of the concrete gravity dams, a very simple procedure has been considered. In order to develop a correlated algorithm (by response surface methodology; RSM) between the ground motion and the structural property, randomized sampling was adopted through a stochastic method called half-fractional central composite design. The responses in the case of fluid-foundation-dam interaction (FFDI) make it more reliable by introducing the foundation as being bounded by infinite elements. To evaluate the seismic generalization of FFDI models, incremental dynamic analysis (IDA) was carried out under the impacts of various earthquake records, which have been selected from the Pacific Earthquake Engineering Research Center data. Here, the displacement-based damage indexed fragility curves have been generated to show the variation in the seismic pattern of the dam. The responses to the sensitivity analysis of the various parameters presented here are the most effective controlling factors for the concrete gravity dam. Finally, to establish the accuracy of the proposed approach, reliable verification was adopted in this study.

• ETRI Journal
• /
• v.22 no.2
• /
• pp.1-10
• /
• 2000

Pattern recognition is one of the most common problems encountered in engineering and scientific disciplines, which involves developing prediction or classification models from historic data or training samples. This paper introduces a new approach, called the Representational Capability (RC) algorithm, to handle pattern recognition problems using radial basis function (RBF) models. The RC algorithm has been developed based on the mathematical properties of the interpolation and design matrices of RBF models. The model development process based on this algorithm not only yields the best model in the sense of balancing its parsimony and generalization ability, but also provides insights into the design process by employing a design parameter (${\delta}$). We discuss the RC algorithm and its use at length via an illustrative example. In addition, RBF classification models are developed for heart disease diagnosis.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.70-81
• /
• 1997

In this paper, we propose HMCNN(hybrid multiple component neural networks) that enhance performance of MCNN by adapting new pattern partitioning algorithm which can cluster many input patterns efficiently. Added neural network performs similar learning procedure that of kohonen network. But it dynamically determine it's number of output neurons using algorithms that decide self-organized number of clusters and patterns in a cluster. The proposed network can effectively be applied to problems of large data as well as huge networks size. As a sresutl, proposed pattern partitioning network can enhance performance results and solve weakness of MCNN like generalization capability. In addition, we can get more fast speed by performing parallel learning than that of other supervised learning networks.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.10
• /
• pp.446-452
• /
• 2002

For most of pattern recognition applications, it is required to correctly recognize patterns even if they have translation variations. In this paper, to achieve the goal of translation invariant pattern recognition, we propose a new generalized translation invariant second-order neural network using a constraint on the weights. The weight constraint is implemented using generalized translation invariant features which are accumulated sums of pixel combinations. Simulation results will be given to demonstrate that the proposed second-order neural network has the generalized translation invariant property.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.529-541
• /
• 2013

We study 132 avoiding permutations that also avoid $(2r+1)(2r+2){\cdots}12$ but contain $(2r-1)(2r){\cdots}12$ pattern. We find an identity between the number of these permutations and the Narayana number. We also present relations between 132 avoiding permutations and polygon dissections. Finally, a generalization of these permutations is obtained.

• Journal of the Korean Statistical Society
• /
• v.14 no.1
• /
• pp.29-38
• /
• 1985

Cyclic Factorial Association Scheme (CFAS) for incomplete block designs in a factorial experiment is defined. It is a generalization of EGD/($2^n-1$)-PBIB designs defined by Hinkelmann (1964) or Binary Number Association Scheme (BNAS) named by Paik and Federer (1973). A property of PBIB designs having CFAS is investigated and it is shown that the structural matrix NN' of such designs has a pattern of multi-nested block circulant matrix. The generalized inverse of (rI-NN'/k) is obtained. Generalized Cyclic incomplete block designs for factorial experiments introduced by John (1973) are presented as the examples of CFAS-PBIB designs. Finally, the relationship between CFAS and BNAS in block designs is briefly discussed.

• Journal of the Korean School Mathematics Society
• /
• v.15 no.3
• /
• pp.565-584
• /
• 2012

This study investigates how the GSP helps gifted and talented students understand geometric principles and concepts during the inquiry process in the generalization of the internal triangle, and how the students logically proceeded to visualize the content during the process of generalization. Four mathematically gifted students were chosen for the study. They investigated the pattern between the area of the original triangle and the area of the internal triangle with the ratio of each sides on m:n respectively. Digital audio, video and written data were collected and analyzed. From the analysis the researcher found four results. First, the visualization used the GSP helps the students to understand the geometric principles and concepts intuitively. Second, the GSP helps the students to develop their inductive reasoning skills by proving the various cases. Third, the lessons used GSP increases interest in apathetic students and improves their mathematical communication and self-efficiency.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1760-1766
• /
• 2010

The linearized suffix tree (LST) is an array data structure supporting traversals on suffix trees. We apply this LST to two dimensional (2D) suffix trees and obtain a space-efficient substitution of 2D suffix trees. Given an $n{\times}n$ text matrix and an $m{\times}m$ pattern matrix over an alphabet ${\Sigma}$, our 2D-LST provides pattern matching in $O(m^2log{\mid}{\Sigma}{\mid})$ time and $O(n^2)$ space.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.790-800
• /
• 2018

The simplified neutrosophic set (SNS) is a generalization of fuzzy set that is designed for some practical situations in which each element has truth membership function, indeterminacy membership function and falsity membership function. In this paper, we propose a new method to construct similarity measures of single valued neutrosophic sets (SVNSs) and interval valued neutrosophic sets (IVNSs), respectively. Then we prove that the proposed formulas satisfy the axiomatic definition of the similarity measure. At last, we apply them to pattern recognition under the single valued neutrosophic environment and multi-criteria decision-making problems under the interval valued neutrosophic environment. The results show that our methods are effective and reasonable.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.4
• /
• pp.2752-2759
• /
• 1996

This paper presents crack growth analysis approach on the basis of neural networks, a branch of cognitive science to high temperature low cycle fatigue that shows strong nonlinearity in material behavior. As the number of data patterns on crack growth increase, pattern classification occurs well and two point representation scheme with gradient of crack growth curve simulates crack growth rate better than one point representation scheme. Optimal number of learning data exists and excessive number of learning data increases estimated mean error with remarkable learning time J-da/dt relation predicted by neural networks shows that test condition with unlearned data is simulated well within estimated mean error(5%).