• Journal of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.245-251
• /
• 2000

Assume that two boundaries of worm domains, which are parpametrizd by harmonic functions, are CR equivalent. Then we determine the Taylor expansion of CR equivalence mapping and get a relation of harmonic functions.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.04a
• /
• pp.99-104
• /
• 2012

This paper analyzes the pitting's cause of elevator's worm gear type traction machine. To find a cause of pitting problem, we analyzed vibration, a proper design allowance and lubrication. We brought a conclusion that the cause of pitting is not a simple vibration problem, such as misalignment of worm reducer and rail, but mostly related to a designed allowance. In this case, the allowance is tight. In general, the allowance of traction machine and lubrication is varied by manufacturers. When the allowance is tight, a proper lubrication can diminish the pitting problem.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.1
• /
• pp.77-84
• /
• 2014

The worm gear is used in the motor drive system of automotive CVVL because of its compactness and self-locking ability. A ZK worm and an involute helical gear can be meshed in order to reduce production cost. However, the gearing is not suitable for the reliability and the NVH problem. To improve the dynamic performances, an optimal design process is considered. The transmission error is calculated theoretically and minimized with the several gear design parameters. An inequality condition such as the teeth interference elimination is added.

• Journal of Information Processing Systems
• /
• v.5 no.1
• /
• pp.33-40
• /
• 2009

Ever since the network-based malicious code commonly known as a 'worm' surfaced in the early part of the 1980's, its prevalence has grown more and more. The RCS (Random Constant Spreading) worm has become a dominant, malicious virus in recent computer networking circles. The worm retards the availability of an overall network by exhausting resources such as CPU capacity, network peripherals and transfer bandwidth, causing damage to an uninfected system as well as an infected system. The generation and spreading cycle of these worms progress rapidly. The existing studies to counter malicious code have studied the Microscopic Model for detecting worm generation based on some specific pattern or sign of attack, thus preventing its spread by countering the worm directly on detection. However, due to zero-day threat actualization, rapid spreading of the RCS worm and reduction of survival time, securing a security model to ensure the survivability of the network became an urgent problem that the existing solution-oriented security measures did not address. This paper analyzes the recently studied efficient dynamic network. Essentially, this paper suggests a model that dynamically controls the RCS worm using the characteristics of Power-Law and depth distribution of the delivery node, which is commonly seen in preferential growth networks. Moreover, we suggest a model that dynamically controls the spread of the worm using information about the depth distribution of delivery. We also verified via simulation that the load for each node was minimized at an optimal depth to effectively restrain the spread of the worm.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.39-48
• /
• 2005

A convex region covers a family of curves if it contains a congruent copy of each curve in the family, and a 'worm problem' for that family is to find the convex region of smallest area. In this paper, we find the smallest triangular cover of any prescribed shape for the family S of all triangles of diameter 1.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.675-684
• /
• 2009

Internet worm can cause a traffic problem through DDoS(Distributed Denial of Services) or other kind of attacks. In those manners, it can compromise the internet infrastructure. In addition to this, it can intrude to important server and expose personal information to attacker. However, current detection and response mechanisms to worm have many vulnerabilities, because they only use local characteristic of worm or can treat known worms. In this paper, we propose a new framework to detect unknown worms. It uses macroscopic characteristic of worm to detect unknown worm early. In proposed idea, we define the macroscopic behavior of worm, propose a worm detection method to detect worm flow directly in IP packet networks, and show the performance of our system with simulations. In IP based method, we implement the proposed system and measure the time overhead to execute our system. The measurement shows our system is not too heavy to normal host users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.212-218
• /
• 2012

An Internet worm is a self-replicating malware program which uses a computer network. As the network connectivity among computers increases, Internet worms have become widespread and are still big threats. There are many approaches to model the propagation of Internet worms such as Code Red, Nimda, and Slammer to get the insight of their behaviors and to devise possible defense methods to suppress worms' propagation activities. The influence of the network characteristics on the worm propagation has usually been modeled by medical epidemic model, named SI model, due to its simplicity and the similarity of propagation patterns. So far, SI model is still dominant and new variations of the SI model, called SI-style models, are being proposed for the modeling of new Internet worms. In this paper, we elaborate the problems of SI-style models and then propose a new accurate stochastic model using an occupancy problem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.93-103
• /
• 2006

Network solutions for protecting against worm attacks that complement partial end system patch deployment is a pressing problem. In the content-based worm filtering, the challenges focus on the detection accuracy and its performance enhancement problem. We present a worm filter architecture using the bloom filter for deployment at high-speed transit points on the Internet, including firewalls and gateways. Content-based packet filtering at multi-gigabit line rates, in general, is a challenging problem due to the signature explosion problem that curtails performance. We show that for worm malware, in particular, buffer overflow worms which comprise a large segment of recent outbreaks, scalable -- accurate, cut-through, and extensible -- filtering performance is feasible. We demonstrate the efficacy of the design by implementing it on an Intel IXP network processor platform with gigabit interfaces. We benchmark the worm filter network appliance on a suite of current/past worms, showing multi-gigabit line speed filtering prowess with minimal footprint on end-to-end network performance.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.11
• /
• pp.1064-1070
• /
• 2012

This paper analyzes the pitting's cause of elevator's worm gear type traction machine. To find a cause of pitting problem, we analyzed vibration, a proper design allowance and lubrication. We brought a conclusion that the cause of pitting is not a simple vibration problem, such as misalignment of worm reducer and rail, but mostly related to a designed allowance. In this case, the allowance is tight. In general, the allowance of traction machine and lubrication is varied by manufacturers. When the allowance is tight, a proper lubrication can diminish the pitting problem.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.89-102
• /
• 2008

Internet becomes more and more popular, and most companies and institutes use web services for e-business and many other purposes. With the explosion of Internet, the attack of internet worm has grown. Simulation is one of the most widely used method to study internet worms. But, it is quite challenging to simulate very large-scale worm attacks because of various reasons. By this reason, we often use the modeling network simulation technique. But, it also has problem that it difficult to apply each worm attacks to simulation. In this paper, we propose worm attack representation and mapping methods for apply worm attack to simulation. The proposed method assist to achieve the simulation efficiency. And we can express each worm attacks more detail. Consequently, the simulation of worm attacks has the time-efficiency and the minuteness.