• Communications of the Korean Mathematical Society
• /
• v.18 no.2
• /
• pp.251-261
• /
• 2003

The purpose of this paper is to establish the necessary and sufficient conditions which ensure the strong convergence of the Ishikawa iterative schemes with errors to the unique fixed point of a $\Phi$-hemicontractive mapping defined on a nonempty convex subset of a normed linear space. The results of this paper extend substantially most of the recent results.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• Geomechanics and Engineering
• /
• v.31 no.5
• /
• pp.519-527
• /
• 2022

Shear failure in soil is the primary cause of most geotechnical structure failures or instability. Soil water content is a significant factor affecting soil shear strength. In this study, the shear strength of samples with different water contents was tested. The shear strength, cohesion, and internal friction angle decreased with increasing water content. Based on the variation of cohesion and internal friction angle, the water content zone was divided into a high-water content zone and low-water content zone with a threshold water content of 15.05%. Cohesion and internal friction angle have a good linear relationship with water content in both zones. Environmental Scanning Electron Microscopy (ESEM) test presented that the aggregates size of the compacted loess gradually increases with increasing water content. Meanwhile, the clay in the compacted loess forms a matric that envelops around the surface of the aggregates and fills the inter-aggregates pores. A quantitative analysis of bound water and free water under different water contents using a nuclear magnetic resonance (NMR) test was carried out. The threshold water content between bound water and free water was slightly below the plastic limit, which is consistent with the results of shear strength parameters. Combined with the T2 distributions obtained by NMR, one can define a T2 relaxation time of 1.58 ms as the boundary point for bound water distribution without free water. Finally, the effects of bound water and free water on shear strength parameters were analyzed using linear regression analysis.

• Honam Mathematical Journal
• /
• v.34 no.1
• /
• pp.55-62
• /
• 2012

In this article, we take account of stability for ring Jordan left derivations and ring left derivations and we also deal with problems for the radical ranges of linear Jordan left derivations and linear left derivations.

• The Pure and Applied Mathematics
• /
• v.6 no.1
• /
• pp.27-32
• /
• 1999

In this paper, we show that the existence of the solutions to the variational-type inequalities for set-valued mappings on normed linear spaces using Fan's section theorem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.805-807
• /
• 2018

본 논문은 인공 대역 확장에서 스펙트럼 포락선 확장 시 발생하는 스펙트럼 왜곡을 줄이는 개선된 조합 매핑(Improved combined mapping) 알고리즘을 제안한다. 벡터양자화를 기반으로 하는 코드북 매핑(Codebook mapping)과 스펙트럼 포락선(Spectrum Envelope)의 선형 의존도를 이용한 선형 매핑(Linear mapping)을 사용하여 각각 확장된 광대역 LSP(Line Spectrum Pair)를 추론하고, 연판정(Soft-decision)을 통해 최적화된 LSP를 추론한다. 제안된 알고리즘으로 합성된 음성신호의 스펙트럼 왜곡(Spectrum Distortion)이 기존 조합매핑으로 얻은 음성 신호의 스펙트럼 왜곡보다 더 적은 왜곡을 갖는 결과를 나타내었다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.303-307
• /
• 1999

Let A and B be two strictly dense Banach Algebras on X and Y respectively where X and Y are Banach space. We give some conditions under which full spectrum preserving linear mappings from A into B Jordan morphisms and X is homomorphic to Y.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.361-369
• /
• 2023

Achieving realistic visual quality while maintaining optimal real-time rendering performance is a major challenge in evolving computer graphics and interactive 3D applications. Normal mapping, as a core technology in 3D, has matured through continuous optimization and iteration. Hybrid normal mapping as a new mapping model has also made significant progress and has been applied in the 3D asset production pipeline. This study comprehensively explores the hybrid normal techniques, analyzing Linear Blending, Overlay Blending, Whiteout Blending, UDN Blending, and Reoriented Normal Mapping, and focuses on how the various hybrid normal techniques can be used to achieve rendering performance and visual fidelity. performance and visual fidelity. Under the consideration of computational efficiency, visual coherence, and adaptability in different 3D production scenes, we design comparative experiments to explore the optimal solutions of the hybrid normal techniques by analyzing and researching the code, the performance of different hybrid normal mapping in the engine, and analyzing and comparing the data. The purpose of the research and summary of the hybrid normal technology is to find out the most suitable choice for the mainstream workflow based on the objective reality. Provide an understanding of the hybrid normal mapping technique, so that practitioners can choose how to apply different hybrid normal techniques to the corresponding projects. The purpose of our research and summary of mixed normal technology is to find the most suitable choice for mainstream workflows based on objective reality. We summarized the hybrid normal mapping technology and experimentally obtained the advantages and disadvantages of different technologies, so that practitioners can choose to apply different hybrid normal mapping technologies to corresponding projects in a reasonable manner.

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.249-271
• /
• 2008

We prove the Hyers-Ulam stability of linear d-isometries in linear d-normed Banach modules over a unital $C^*-algebra$ and of linear isometries in Banach modules over a unital $C^*-algebra$. The main purpose of this paper is to investigate d-isometric $C^*-algebra$ isomor-phisms between linear d-normed $C^*-algebras$ and isometric $C^*-algebra$ isomorphisms between $C^*-algebras$, and d-isometric Poisson $C^*-algebra$ isomorphisms between linear d-normed Poisson $C^*-algebras$ and isometric Poisson $C^*-algebra$ isomorphisms between Poisson $C^*-algebras$. We moreover prove the Hyers-Ulam stability of their d-isometric homomorphisms and of their isometric homomorphisms.