• Honam Mathematical Journal
• /
• v.33 no.4
• /
• pp.467-485
• /
• 2011

We consider the Hyers-Ulam-Rassias stability problem $${\parallel}u{\circ}A-{\upsilon}{\circ}P_1-w{\circ}P_2{\parallel}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$$ for the Schwartz distributions u, ${\upsilon}$, w, which is a distributional version of the Pexider generalization of the Hyers-Ulam-Rassias stability problem ${\mid}(x+y)-g(x)-h(y){\mid}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$, x, $y{\in}\mathbb{R}^n$, for the functions f, g, h : $\mathbb{R}^n{\rightarrow}\mathbb{C}$.

• Communications of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.261-271
• /
• 2011

We consider the Hyers-Ulam-Rassias stability problem ${\parallel}2u{\circ}\frac{A}{2}-u{\circ}P_1-u{\circ}P_2{\parallel}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$, $x,y{\in}{\mathbb{R}}^n$ for the Schwartz distributions u, which is a distributional version of the Hyers-Ulam-Rassias stability problem of the Jensen functional equation ${\mid}2f(\frac{x+y}{2})-f(x)-F(y){\mid}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$, $x,y{\in}{\mathbb{R}}^n$ for the function f : ${\mathbb{R}}^n{\rightarrow}{\mathbb{C}}$.

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.337-346
• /
• 1999

Simple correspondence analysis is a technique for giving a joint display of points representing both the rows and columns of an n$\times$p two-way contigency table. In simple correspondence analysis, the singular value decomposition is the main algebraic tool. But, Choi and Huh(1996) pointed out the singular value decomposition is not robust. Instead, they developed a robust singular value decomposition and provided applications in principal component analysis and biplots. In this article, by using the analogous procedures of Choi and Huh(1996), we derive a robust version of simple correspondence analysis.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.49-66
• /
• 1996

The singular value decomposition is one of the most useful methods in the area of matrix computation. It gives dimension reduction which is the centeral idea in many multivariate analyses. But this method is not resistant, i.e., it is very sensitive to small changes in the input data. In this article, we derive the resistant version of singular value decomposition for principal component analysis. And we give its statistical applications to biplot which is similar to principal component analysis in aspects of the dimension reduction of an n x p data matrix. Therefore, we derive the resistant principal component analysis and biplot based on the resistant singular value decomposition. They provide graphical multivariate data analyses relatively little influenced by outlying observations.

• Asia pacific journal of information systems
• /
• v.14 no.1
• /
• pp.79-100
• /
• 2004

As a part of ebXML(Electronic Business using eXtensible Markup Language) framework, BPSS(Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPS,' is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification fails to specify formal semantic constraints completely. In this study, we propose a constraint classification scheme for the BPSS specification and describe how to formally represent those semantic constraints using OCL(Object Constraint Language). As a way to validate p Business Process Specification(BPS) with the formal semantic constraints, we suggest a rule-based approach to represent the formal constraints and demonstrate its detailed mechanism for applying the rule-based constraints to the BPS with a prototype implementation.

• Advances in nano research
• /
• v.4 no.3
• /
• pp.157-165
• /
• 2016

The photocatalytic (PC) activity of anatase titania nanoparticles can be improved through codoping with transition metals and nitrogen. In addition, the PC activity can also be improved by creating monodisperse, mesoporous nanoparticles of titania. The question naturally arose as to whether combining these two characteristics would result in further improvement in the PC activity or not. Herein, we describe the synthesis and photocatalytic characteristics of codoped, monodisperse anatase titania. The transition metals tested in the polydisperse and the monodisperse forms were Mn, Co, Ni, and Cu. In each case, it was found that the monodisperse version had a higher PC activity compared to the corresponding polydisperse version.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1996.04a
• /
• pp.62-69
• /
• 1996

In this study, an equivalent domain integral (EDI) method is presented to estimate the track-till integral parameter, J-value, for two dimensional cracked elastic bodies which may quantify the severity of the crack-tit) stress fields. The conventional J-integral method based on line integral has been converted to equivalent area or domain integrals by using the divergence theorem. It is noted that the EDI method is very attractive because all the quantities necessary for computation of the domain integrals are readily available in a finite element analysis. The details and its implementation are extened to both h-version finite element model with 8-node isoparametric element and p-version finite element model with high order hierarchic element using Legendre type shape fuctions. The variations with respect to the different path of domain integrals from the crack-tip front and the choice of 5-function have been tested by several examples.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.6
• /
• pp.607-613
• /
• 2010

FRANC3D is a program for simulating arbitrary three-dimensional crack growth. Recently, a completely new version of the program, FRANC3D/NG, has been created. Unlike previous versions, which relied largely on boundary element analysis, the new version of the program works with finite element analysis exclusively and is designed to work with general-purpose commercial finite element packages. This paper presents the theoretical underpinnings of the procedures to adaptively modify the geometry and mesh of a model to simulate crack growth.

• Women's Health Nursing
• /
• v.12 no.3
• /
• pp.204-209
• /
• 2006

Purpose: The Edinbergh Postnatal Depression Scale (EPDS) has seen widespread use in epidemiological and clinical studies. The objective of this research was to translate and to test the reliability and validity of the 10-item EDPS in Korea. Methods: Subjects were 145 women who were 6 to 10 weeks post delivery. To test reliability, the internal consistency was assessed by Cronbach's alpha coefficient. Validity testing was performed using convergent validity by Pearson's correlation. Data was gathered at 3 hospitals during Oct. 2005 after obtaining an informed consent. Result: The mean age of the subjects was 29.9 years. and the mean parity was 1.46 times. The mean EPDS score was 18.4. Reliability analysis showed a satisfactory result (Cronbach's alpha coefficient=.84). There were significant positive correlations between EPDS and Mills postnatal depression and anxiety check list scores as expected(r=.69, p<.001) and thus supported convergent validity. Conclusion: The study findings showed that the Korean version of the EPDS-10 is a reliable and valid instrument that can be used for measuring postnatal depression in Korea.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1279-1300
• /
• 2021

Let P be a finite point set in ℝ² with the set of distance n-chains defined as ∆_n(P) = {(|p₁ - p₂|, |p₂ - p₃|, …, |p_n - p_n+1|) : p_i ∈ P}. We show that for 2 ⩽ n = O_|P|(1) we have ${\mid}{\Delta}_n(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^n}{{\log}^{\frac{13}{2}(n-1)}{\mid}P{\mid}}}$. Our argument uses the energy construction of Elekes and a general version of Rudnev's rich-line bound implicit in [28], which allows one to iterate efficiently on intersecting nested subsets of Guth-Katz lines. Let G is a simple connected graph on m = O(1) vertices with m ⩾ 2. Define the graph-distance set ∆_G(P) as ∆_G(P) = {(|p_i - p_j|)_{i,j}∈E(G) : p_i, p_j ∈ P}. Combining with results of Guth and Katz [17] and Rudnev [28] with the above, if G has a Hamiltonian path we have ${\mid}{\Delta}_G(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^{m-1}}{\text{polylog}{\mid}P{\mid}}}$.