• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.915-920
• /
• 2002

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 from 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 yon that it makes out about the characteristics of actual data traffic more easily.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.173-178
• /
• 2001

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 from 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3098-3103
• /
• 2009

In this paper, self-similar characteristics over statistical approaches and real-time Ethernet network traffic measurements are estimated. It is also shown that the self-similar traffic reflects real Ethernet traffic chareacteristics by comparing TCP-MT source model which is exactly self-similar model to the traditional Poisson model.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1503-1516
• /
• 2019

In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.454-459
• /
• 2001

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 from 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.468-471
• /
• 2001

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 from 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.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.221-226
• /
• 2015

The natural projection of a parameter lower (upper) distribution set for a self-similar measure on a self-similar set satisfying the open set condition is the cylindrical lower or upper local dimension set for the Legendre self-similarmeasure which is derived from the self-similar measure and the self-similar set.

• Journal of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.383-399
• /
• 2020

Following Matsumoto's definition of continuous orbit equivalence for one-sided subshifts of finite type, we introduce the notion of orbit equivalence to canonically associated dynamical systems, called the limit dynamical systems, of self-similar groups. We show that the limit dynamical systems of two self-similar groups are orbit equivalent if and only if their associated Deaconu groupoids are isomorphic as topological groupoids. We also show that the equivalence class of Cuntz-Pimsner groupoids and the stably isomorphism class of Cuntz-Pimsner algebras of self-similar groups are invariants for orbit equivalence of limit dynamical systems.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.2071-2093
• /
• 2015

In this paper, we investigate the similarity transformations in the Minkowski n-space. We study the geometric invariants of non-null curves under the similarity transformations. Besides, we extend the fundamental theorem for a non-null curve according to a similarity motion of ${\mathbb{E}}_1^n$. We determine the parametrizations of non-null self-similar curves in ${\mathbb{E}}_1^n$.

• The Pure and Applied Mathematics
• /
• v.14 no.1 s.35
• /
• pp.1-5
• /
• 2007

We study the topological magnitude of a special subset from the distribution subsets in a self-similar Cantor set. The special subset whose every element has no accumulation point of a frequency sequence as some number related to the similarity dimension of the self-similar Cantor set is of the first category in the self-similar Cantor set.