• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.133-145
• /
• 2006

We study Riemannian or pseudo-Riemannian manifolds which admit a closed conformal vector field. Subject to the condition that at each point $p{\in}M^n$ the set of conformal gradient vector fields spans a non-degenerate subspace of TpM, using a warped product structure theorem we give a complete description of the space of conformal vector fields on arbitrary non-Ricci flat Einstein spaces.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.715-723
• /
• 2009

The aim of this paper is to present an explicit iteration method for finding a common fixed point of a finite family of strictly pseudocon-tractive mappings defined on q-uniformly smooth and uniformly convex Banach spaces.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.146-153
• /
• 2009

Thanks to computer graphic technology development, graphic design programming is easily accessible by any home computer user today since it is free from the burdens of complicated 알고리듬 or the expensive graphic tools that were required in the past. The term 알고리듬 2.5 is commonly used by computer graphic designers to refer to 2D, a form of pseudo-3D. In this study, by using 2.5D, which was previously utilized for strengthening visual effects and engine efficiency, together with Adobe Photoshop along with After Effects, I will incorporate these into motion graphics. Today, motion graphics dominate the advertisement and image markets. Since viewers have developed higher expectations, a more dynamic 3D space graphic technology is preferred over the outdated 2D basis. In this study, I will produce a 2.5D image which is generated through a vanishing point filter of Adobe Photoshop and After Effects based on still image information and captured at an angle of Axonometric Projection. Also, I will compare the effectiveness of the production process and camera angle flexibility between the previous 3D process and new 2.5 D process.

• Proceedings of the KSRS Conference
• /
• 2001.03a
• /
• pp.140-148
• /
• 2001

The satellite sensor model is typically established using ground control points acquired by ground survey Of existing topographic maps. In some cases where the targeted area can't be accessed and the topographic maps are not available, it is difficult to obtain ground control points so that geospatial information could not be obtained from satellite image. The paper presents several satellite sensor models and satellite image decomposition methods for non-accessible area where ground control points can hardly acquired in conventional ways. First, 10 different satellite sensor models, which were extended from collinearity condition equations, were developed and then the behavior of each sensor model was investigated. Secondly, satellite images were decomposed and also pseudo images were generated. The satellite sensor model extended from collinearity equations was represented by the six exterior orientation parameters in 1$^{st}$, 2$^{nd}$ and 3$^{rd}$ order function of satellite image row. Among them, the rotational angle parameters such as $\omega$(omega) and $\phi$(phi) correlated highly with positional parameters could be assigned to constant values. For non-accessible area, satellite images were decomposed, which means that two consecutive images were combined as one image. The combined image consists of one satellite image with ground control points and the other without ground control points. In addition, a pseudo image which is an imaginary image, was prepared from one satellite image with ground control points and the other without ground control points. In other words, the pseudo image is an arbitrary image bridging two consecutive images. For the experiments, SPOT satellite images exposed to the similar area in different pass were used. Conclusively, it was found that 10 different satellite sensor models and 5 different decomposed methods delivered different levels of accuracy. Among them, the satellite camera model with 1$^{st}$ order function of image row for positional orientation parameters and rotational angle parameter of kappa, and constant rotational angle parameter omega and phi provided the best 60m maximum error at check point with pseudo images arrangement.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.21 no.2
• /
• pp.77-85
• /
• 2017

Pseudo-static approach has been conventionally applied for the design of gravity quay walls. In this method, the decision to select an appropriate seismic coefficient ($k_h$) is an important one, since $k_h$ is a key variable for computing an equivalent pseudo-static inertia force. Nonetheless, there is no unified standard for defining $k_h$. Likewise, port structure designers in Korea have a difficulty in choosing an appropriate $k_h$ definition, as there are conflicts in how $k_h$ is defined between the existing seismic code of port structures and the proposed new one. In this research, various seismic design codes for port structures were analyzed to compare the definitions of the seismic coefficient. The results were used for the proposing a unified seismic coefficient definition. Further, two dynamic centrifuge tests were performed with different wall heights (5 m, 15 m) to clarify the reference point of peak acceleration used in determination of $k_h$ according to the wall height. Results from dynamic centrifuge experiments showed that correction factors for the peak ground acceleration considering both the wall height and allowable displacement are needed to calculate $k_h$.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.2
• /
• pp.544-556
• /
• 1991

The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.63-74
• /
• 1996

Ordering plays an important role in solving an LP problem with sparse matrix by the interior point method. Since ordering is NP-complete, we try to find an efficient method. The objective of this paper is to present an efficient heuristic ordering method for implementation of the minimum deficiency method. Both the ordering method and the data structure play important roles in implementation. First we define a new heuristic pseudo-deficiency ordering method and a data structure for the method-quotient graph and cliqued storage. Next we show an experimental result in terms of time and nonzero numbers by NETLIB problems.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.105-110
• /
• 2008

The aim of this paper is to prove convergence of implicit iteration process to a common fixed point for a finite family of strong successive $\Phi$-pseudocontractive mappings. The results presented in this paper extend and improve the corresponding results of S. S. Chang [On the convergence of implicit iteration process with error for a finite family of asymptotically nonexpansive mappings, J. Math. Anal. Appl. 313(2006), 273-283], M. O. Osilike[Implicit iteration process for common fixed points of a finite finite family of strictly pseudocontractive maps, Appl. Math. Comput. 189(2) (2007), 1058-1065].

• The Korean Journal of Pain
• /
• v.9 no.1
• /
• pp.109-113
• /
• 1996

Even in the absence of any specific abnormal pathologic findings of the gastrointestinal tract, many patients still suffer from : fullness, anorexia and postprandial abdominal pain. As these symptoms are similar to visceral origin pain, many physicians focus on the discovery of pathologic abnormality of the gastrointestinal tract. At our Yoido Pain Clinic, after diagnosing myofascial pain syndrome, we treated 64 patients by trigger point injection and physical therapy on abnormal abdominal muscle, from June 1993 to April 1995. Most patients' conditions improved after these treatments.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.322-329
• /
• 2000

BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.