• Steel and Composite Structures
• /
• v.46 no.3
• /
• pp.435-449
• /
• 2023

Time domain method and frequency domain method are commonly used in the current fatigue life calculation theory. The time domain method has complicated procedures and needs a large amount of calculation, while the frequency domain method has poor applicability to different materials and different spectrum, and improper selection of spectrum model will lead to large errors. Considering that artificial neural network has strong ability of nonlinear mapping and generalization, this paper applied this technique to random fatigue life prediction, and the effect of average stress was taken into account, thereby achieving more accurate prediction result of random fatigue life.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.4
• /
• pp.180-187
• /
• 2001

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.192-202
• /
• 2004

This paper introduces an approach to semantic mapping using Product ontology for CPC environment. In CPC environment, it is necessary that the participants in a product life cycle should share the same understanding about the semantic of product terms. For example, they should know that although 'COMPONENT' and 'ITEM' are different word-expressions, they could have the same meaning. In order to handle such terms in the information system, it is desirable that the system automatically recognizes that the terms have the same semantics. Serving this purpose, we described an ontology design methodology using first order logic, knowledge interchange format, and knowledge engineering process. In our approach, we investigated domain knowledge of the Bill Of Material, and then designed Product ontology of it. Based on the ontology, we described syntactic translation, semantic translation, and semantic mapping procedure with an example.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.82-89
• /
• 1995

In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

• Journal of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.245-251
• /
• 2000

Assume that two boundaries of worm domains, which are parpametrizd by harmonic functions, are CR equivalent. Then we determine the Taylor expansion of CR equivalence mapping and get a relation of harmonic functions.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.262-266
• /
• 1993

The development of COPS(Computer aided Operation Planning System) needs data mapping paradigm which provides intelligent determonation of cutting conditions from the requirements of process planning side. We proposed the idea of multi-level mapping by the combination of heuristics of domain experts and mathematical abstraction of cutting condition and requirements. Mathematical mathods for the generalization of heuristics were constructed by multi-layer perceptron. DBMS for determination of cutting conditions was constructed by classification and combination of best fitted models. Triangular fuzzy number was used to process the uncertainties in heuristics of experts.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1377-1387
• /
• 2013

Let $f$ be a harmonic mapping on the unit disc ${\Delta}$ in $\mathbb{C}$. We give some condition for $f$ to be a quasiconformal homeomorphism on ${\Delta}$ and to have a quasiconformal extension to the whole plane $\bar{\mathbb{C}}$. We also obtain quasiconformal extension results for starlike harmonic mappings of order ${\alpha}{\in}(0,1)$.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.899-907
• /
• 2001

Complex variable methods are used to solve the first and the second fundamental problems for infinite plate with two holes having arbitrary shapes which are conformally mapped on the domain outside of the unit circle by means of rational mapping function. Some applications are investigated and some special cases are derived.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.293-294
• /
• 2006

Interscale dependency and Liptschitz regularity of the wavelet coefficients imply the existence of functional mapping between scales. In this paper, the neural networks are exploited to learn an intercale mapping. We apply a phase-shifting filter for effective learning of the neural networks.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.4
• /
• pp.31-39
• /
• 1990

A systematic methodology for efficient implementation of processor arrays from regular iterative algorithms is proposed. One of the modern parallel processing array architectures is the Systolic arrays and we use it for processor arrays on this paper. On designing the systolic arrays, there are plenty of mapping functions which satisfy necessary conditions for its implementation to the time-space domain. In this paper, we sue a few conditions to reduce the total number of computable mapping functions efficiently. As a results of applying this methodology, efficient designs of systolic arrays could be done with considerable saving on design time and efforts.