• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.421-426
• /
• 2013

We give a series of discrete random variables which converges to a random variable whose distribution function is the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs (RNT) distribution. We show this using the correspondence theorem that if the moments coincide then their corresponding distribution functions also coincide.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.676-678
• /
• 2003

본 논문은 이산 복사조도-곡률 척도를 이용하여 간략화된 자유곡면을 스무딩하는 알고리즘을 제안한다. 이산 복사조도-곡률이란 형상의 기하학 조건인 이산 곡률뿐만 아니라 렌더링을 위해 설정된 라이팅 조건인 복사조도를 고려한 이산 척도이다. 즉 광원과 정점 사이에서 계산된 복사조도값과 메쉬 곡면의 이산 표면에서 정의되는 이산곡률값을 이용하여 각 점정의 가중치를 계산하고, 이를 기반으로 간략화된 분할곡면의 형상을 스무딩한다. 결국 제안된 이산 복사조도-곡률 척도를 고려한 스무딩 알고리즘으로 간략화된 메쉬 곡면의 형상과 렌더링 결과를 향상시키고자 한다.

• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1421-1431
• /
• 2021

In this paper we study the preservation of various notions of expansivity in discrete dynamical systems and the induced map for n-fold symmetric products and hyperspaces. Then we give a characterization of a compact metric space admitting hyper N-expansive homeomorphisms via the topological dimension. More precisely, we show that C⁰-generically, any homeomorphism on a compact manifold is not hyper N-expansive for any N ∈ ℕ. Also we give some examples to illustrate our results.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.1-16
• /
• 1995

The performance of a computer system depends on the system architecture and workload, and the high performance required in many applications can be achieved by the scalability of the system architecture and workload. This paper presents scalable workload, a performance metric of scalable speedup and hierarchical modeling for the scalable computer system as well as the development of the object-oriented simulator spmplC++ Which is an advanced C++ version of the discrete event-driven simulation environment smplE. In addition, this paper presents two examples of applying scalable speedup, hierarchical modeling and simulator smplC++ to analyze the performance effect of the sclcbility in a multiprocessor system and a network-based client/server system.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.127-138
• /
• 1999

For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.762-772
• /
• 2006

Instance based learning algorithm is the best known lazy learner and has been successfully used in many areas such as pattern analysis, medical analysis, bioinformatics and internet applications. However, its feature weighting scheme is too naive that many other extensions are proposed. Our version of IB3 named as eXtended IBL (XIBL) improves feature weighting scheme by backward stepwise regression and its distance function by VDM family that avoids overestimating discrete valued attributes. Also, XIBL adopts leave-one-out as its noise filtering scheme. Experiments with common artificial domains show that XIBL is better than the original IBL in terms of accuracy and noise tolerance. XIBL is applied to two important applications - intrusion detection and spam mail filtering and the results are promising.

• Korean Journal of Geomatics
• /
• v.4 no.1
• /
• pp.9-16
• /
• 2004

An object-oriented design was carried out for the digital photogrammetric processes. Classes were identified and implemented to develop an integrated digital photogrammetry system using a 3 dimensional self-calibration model for CCD cameras. This integrated system is deemed to be a significant progress from the conventional photogrammetric system which is a series of discrete processes. Object oriented methodology was selected for the implementation of the integrated photogrammetric system because it would be a very complex task to get the same result using a procedural programming language. Besides the simplification of development effort, object oriented methodology has further benefits of better management of program in case when updates to parts of the program are necessary. Using the classes designed in this study, a 3 dimensional self-calibration model was developed for a CCD camera. Classes for data input and image handling as well as classes for bundle adjustment were implemented. The bundle adjustment system was further enhanced with member functions to handle additional parameters for principal point coordinates and focal length, thereby, enabling the application to non-metric CCD cameras.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1734-1745
• /
• 1996

In this paper, a modified fixed-delay tree search with decision feedback(FDTS/DF) for compensation of non-linear distortion in digital magnetic recording channels is discussed. Since the nonlinear distortion, which becomes significant as recording density increases, is generally well modeled by the discrete Volterra series, the proposed equlizer is composed of a nolinear feedforward filter, a linear feedback filter, and a nonlinear distorton table, the values of which are determined by considering the effect of nonlinear distortion due to future data as well as the previous and current one. At the decision stage of FDTS, a path minimizing the branch metric is chosen by using the previously detected values, current predicted value, and future predicted value. We compare the performance of the linear FDTS/DF, the previous nonlinear FDTS/DF, and the proposed nonlinear FDTS/DF by computer simulation, and confirm that the proposed one chieves the best performance at high-density recording.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

• Korean Journal of Remote Sensing
• /
• v.30 no.5
• /
• pp.547-557
• /
• 2014

This paper presents a method for designing circular template used in similarity measurement for image registration. Circular template has translation and rotation invariant property, which results in correct matching of control points for image registration under the condition of translation and rotation between reference and sensed images. Circular template consisting of the pixels located on the multiple circumferences of the circles whose radii vary from zero to a certain distance, is converted to two-dimensional Discrete Polar Coordinate Matrix (DPCM), whose elements are the pixels of the circular template. For sensed image, the same type of circular template and DPCM are created by rotating the circular template repeatedly by a certain degree in the range between 0 and 360 degrees and then similarity is calculated using mutual information of the two DPCMs. The best match is determined when the mutual information for each rotation angle at each pixel in search area is maximum. The proposed algorithm was tested using KOMPSAT-2 images acquired at two different times and the results indicate high accurate matching performance under image rotation.