• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.2
• /
• pp.1-10
• /
• 2003

We compare a self-similar measure on a self-similar Cantor set with a quasi-self-similar measure on a deranged Cantor set. Further we study some properties of a self-similar measure on a self-similar Cantor set.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.695-702
• /
• 2005

We study the transformed measures with respect to the real parameters of a self-similar measure on a self-similar Can­tor set to give a simple proof for some result of its multifractal spectrum. A transformed measure with respect to a real parameter of a self-similar measure on a self-similar Cantor set is also a self­similar measure on the self-similar Cantor set and it gives a better information for multifractals than the original self-similar measure. A transformed measure with respect to an optimal parameter deter­mines Hausdorff and packing dimensions of a set of the points which has same local dimension for a self-similar measure. We compute the values of the transformed measures with respect to the real parameters for a set of the points which has same local dimension for a self-similar measure. Finally we investigate the magnitude of the local dimensions of a self-similar measure and give some correlation between the local dimensions.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.899-914
• /
• 2003

It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.51-61
• /
• 2004

We find an easier formula to compute Hausdorff and packing dimensions of a subset composing a spectral class by local dimension of a self-similar measure on a self-similar Cantor set than that of Olsen. While we cannot apply this formula to computing the dimensions of a subset composing a spectral class by local dimension of a quasi-self-similar measure on a self-similar set on the way to a perturbed Cantor set, we have a set theoretical relationship between some distribution sets. Finally we compare the behaviour of a quasi-self-similar measure on a self-similar Cantor set with that on a self-similar set on the way to a perturbed Cantor set.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.281-288
• /
• 2005

It is generally accepted that self-similar (or fractal) Processes may provide better models for teletraffic in modem computer networks than Poisson processes. f this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.621-632
• /
• 2004

Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.4
• /
• pp.59-65
• /
• 2017

XML has established itself as the format for data exchange on the internet and the volume of its instance is large scale. Therefore, to extract similar information from XML instance is one of research topics but is insufficient. In this paper, we extract similar information from various kind of XML instances according to the same goal. Also we use only the structure information of XML instance for information extraction because some of XML instance is described without its schema. In order to efficiently extract similar information, we propose a minimum unit of processing and two approaches for finding the unit. The one is a structure-based method which uses only the structure information of XML instance and another is a measure-based method which finds a unit by numerical formula. Our two approaches can be applied to any application that needs the extraction of similar information based on XML data. Also the approach can be used for HTML instance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2809-2821
• /
• 2023

Effective recommendation of similar business groups is a critical factor in obtaining market information for companies. In this study, we propose a novel method for enhancing similar business group recommendation by incorporating derivative criteria and web crawling. We use employment announcements, employment incentives, and corporate vocational training information to derive additional criteria for similar business group selection. Web crawling is employed to collect data related to the derived criteria from 'credit jobs' and 'worknet' sites. We compare the efficiency of different datasets and machine learning methods, including XGBoost, LGBM, Adaboost, Linear Regression, K-NN, and SVM. The proposed model extracts derivatives that reflect the financial and scale characteristics of the company, which are then incorporated into a new set of recommendation criteria. Similar business groups are selected using a Euclidean distance-based model. Our experimental results show that the proposed method improves the accuracy of similar business group recommendation. Overall, this study demonstrates the potential of incorporating derivative criteria and web crawling to enhance similar business group recommendation and obtain market information more efficiently.

• The Korean Society of Law and Medicine
• /
• v.10 no.2
• /
• pp.427-453
• /
• 2009

This study aims to review legal problems of similar medical practice and suggest methods of improvement. Similar medical practice refers to all medical practices conducted in the state that human qualification is not fulfilled. It may cause serious damages on health and lives of national people. Currently, similar medical practices are recognized as unlicensed medical practices and prohibited based on the Medical law and additionally punished by then special law in Korea. However, the current Medical Law does not provide clear and accurate concept of medical practices so that it is difficult to regulate similar medical practices. The issue of complementary and alternative therapy related to similar medical practices is also in special state different from other countries. In addition, since similar medical practices lack of evidences in terms of safety, the dangerousness of accidents is high and it may affect badly on health of national people and health care policies. Methods of improvement in order to resolve problems regarding similar medical practices are: first, concept and scope of medical practice should be clear, accurate and concrete. Second, complementary and alternative therapies related to similar medical practices need to be strictly examined and the supervisory right should be given to doctors should be given even though a part of it is allowed. Third, research institutes specialized in the field should be established for scientific examination of complementary and alternative therapy and objective research results should be open to the public. Finally, since damage cases caused by similar medical practices by non-medical personnel, national management and supervision for similar medical practices should be reinforced.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.272-277
• /
• 2000

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction, However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially hem the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.