| Title | Spam Traffic Characterization |
| Author | *Jung-Yoon Kim, Hyoung-Kee Choi (Sungkyunkwan University, Republic of Korea) |
| Page | pp. 961 - 964 |
| Keyword | Spam Traffic, Traffic Characterization, Spam, Email |
| Abstract | In recent years, email traffic has increased in the Internet. However, as the usage of emails has increased dramatically, the amount of spam traffic has increased tremendously too. There are many filters for spam detection and prevention, but most of them are not sufficiently efficient or accurate for use in practical filtering systems. To enhance the efficiency and accuracy of spam filtering, we first need to characterize and analyze the spam traffic. To accomplish this, we first collected spam traffic by capturing the email traffic on the backbone network of Sungkyunkwan University over a period of 24 hours and then classifying it into several categories using various approach levels in order to discover the characteristics and patterns within it. This study forms the basis for research into efficient and accurate spam filtering techniques. |
| Title | SIDS Monitoring System using the LVQ |
| Author | *Kyung Kwon Jung (Hallym University, Republic of Korea), Kyo Hwan Hyun, Joo Woong Kim, Jung Hoon Oh, Hyung Gook Joh, Ki Hwan Eom (Dongguk University, Republic of Korea) |
| Page | pp. 965 - 968 |
| Keyword | SIDS, tri-axis accelerometer, LVQ |
| Abstract | Sudden infant death syndrome (SIDS) is the leading cause of unexplained death of an apparently healthy infant aged one month to one year. This paper presents an infant monitoring system which detects the movement of infants to prevent SIDS. The proposed system is composed of a movement sensing part and a motion detecting part. The movement sensing part uses a tri-axis accelerometer. The motion detecting part is based on the LVQ algorithm. The proposed monitoring system connects to an alarm for alerting a parent when an infant is in a predetermined position. We evaluated the performance of the monitoring system through experiments. |
| Title | On Verification of Marking-Dependent Terminacy for Data-Flow Program Nets |
| Author | Shingo Yamaguchi, *Keisuke Komiya, Qi-Wei Ge, Minoru Tanaka (Yamaguchi University, Japan) |
| Page | pp. 973 - 976 |
| Keyword | data-flow program, program net, terminacy, dead, verification |
| Abstract | In this paper, we discuss terminacy at the initial marking for (data-flow) program nets.
Ge et al. have proposed an algorithm to verify terminacy at any marking, i.e. structurally terminacy.
However, there is no algorithm to verify terminacy at the initial marking.
In this paper, we give a necessary and sufficient condition to verify the terminacy.
Using this condition, we construct a polynomial time algorithm for
a subclass of program nets.
We also show that the problem to verify the terminacy for general program nets is undecidable. |
| Title | Construction of Petri Nets and Calculation of Elementary T-invariants for Multi-stage-Encryptions Public-Key Cryptography: MEPKC |
| Author | *Ryo Yamaguchi, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi University, Japan) |
| Page | pp. 977 - 980 |
| Keyword | public-key cryptography, MEPKC, key generator, Petri net, elementary T-invariant |
| Abstract | This paper aims at automatically generating Petri
nets that are used as key generator of a public-key cryptography
MEPKC. MEPKC is different from general public-key
cryptography, which opens a key-generator to the public and
uses the elementary T-invariants as the encryption keys to repeatedly
encrypt a plain text stage by stage, and so that the its
security can be as strong as expected. The Petri net used as
a key generator must include a lot of elementary T-invariants,
and the creator of the Petri net must be able to grasp all the elementary T-invariants. In this paper, we propose a method of
generating Petri nets whose complexity is enough to be a key
generator and obtaining all its the elementary T-invariants. |