http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
IMTAR: Incremental Mining of General Temporal Association Rules
Dafa-Alla, Anour F.A.,Shon, Ho-Sun,Saeed, Khalid E.K.,Piao, Minghao,Yun, Un-Il,Cheoi, Kyung-Joo,Ryu, Keun-Ho Korea Information Processing Society 2010 Journal of information processing systems Vol.6 No.2
Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these databases has to be maintained, and an incremental updating technique needs to be developed for maintaining the discovered association rules from these databases. The concept of Temporal Association Rules has been introduced to solve the problem of handling time series by including time expressions into association rules. In this paper we introduce a novel algorithm for Incremental Mining of General Temporal Association Rules (IMTAR) using an extended TFP-tree. The main benefits introduced by our algorithm are that it offers significant advantages in terms of storage and running time and it can handle the problem of mining general temporal association rules in incremental databases by building TFP-trees incrementally. It can be utilized and applied to real life application domains. We demonstrate our algorithm and its advantages in this paper.
Robust Finite Field Arithmetic for Fault-Tolerant Tate Pairing
손교용,이상혁,Anour F. A. Dafa-Alla 장전수학회 2010 Proceedings of the Jangjeon mathematical society Vol.13 No.1
Protecting against side channel attacks is a very important issue when constructing hardware and software implementations of pairing-based crypto-graphic algorithms. To detect these attacks, in this paper we present a scheme for constructing strong error detection in the Tate pairing which is based upon robust nonlinear systematic error-detecting codes. We also provide not only the explicit formulas for robust ¯eld operations on an arbitrary ¯nite extension ¯eld but also the mathematical analysis behind them.
An analogue to the Erdös-Ko-Rado theorem on q-ary Hamming code
황경원,김태균,Anour F.A. Dafa-Alla 장전수학회 2009 Proceedings of the Jangjeon mathematical society Vol.12 No.2
We prove an anologue to the Erdos-Ko-Rado Theorem on q-ary Hamming code. Let C be a subset of [수식] and all codewords of C have weight k. Let the Hamming distance d(a, b) be in {1,2,...,2Κ} for every a, b in C. If n ≥ 2k - 1, then [수식]