Entity

Time filter

Source Type


Truong T.-T.,University of science | Tran M.-T.,University of science | Duong A.-D.,University of Information Technology
Lecture Notes in Electrical Engineering | Year: 2014

Password is one of the simple and efficient methods to protect the transactions in insecure network environments. There are many authors researching in this area to suggest the protocols preventing illegitimate users from accessing the systems. In 2013, Y-H An proposed the scheme to isolate some problems which exist in Khan et al.'s scheme. In this paper, we demonstrate that Y-H An's scheme is vulnerable to server forgery attack and cannot provide user's anonymity. Furthermore, we also propose the modified scheme to overcome these limitations. © Springer-Verlag Berlin Heidelberg 2014.


Nguyen D.,University of Information Technology | Vo B.,Ton Duc Thang University
Advances in Intelligent Systems and Computing | Year: 2014

Numerous fast algorithms for mining class-association rules (CARs) have been developed recently. However, in the real world, end-users are often interested in a subset of class-association rules. Particularly, they may consider only rules that contain a specific item or a specific set of items. The nave strategy is to apply such item constraints into the post-processing step. However, such approaches require much effort and time. This paper proposes an effective method for integrating constraints that express the presence of user-defined items (for example (Bread AND Milk)) into the class-association rule mining process. First, we design a tree structure in that each node contains the constrained itemset. Second, we develop a theorem and a proposition for quickly pruning infrequent nodes and weak rules. Final, an efficient algorithm for mining CARs with item constraints is proposed. Experiments show that the proposed algorithm outperforms the post-processing approach. © Springer International Publishing Switzerland 2014.


Nguyen D.T.,University of Information Technology | Doan H.,EnterSoft Software Solution Joint Stock Company
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

When clustering a dataset, the right number k of clusters is not often obvious. And choosing k automatically is a complex problem. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Then, an improved algorithm is presented for learning k while clustering. The algorithm is based on coefficients α, β that affect this selection. Meanwhile, a new measure is suggested to confirm the member of clusters. Finally, we evaluate the computational complexity of the algorithm, apply to real datasets and results show its efficiency. © 2012 Springer-Verlag.


Truong H.B.,University of Information Technology | Nguyen N.T.,Wroclaw University of Technology
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

Fuzzy ontology are often more useful than non-fuzzy ontologies in knowledge modeling owing to the possibility for representing the incompleteness and uncertainty. In this paper we present an approach to fuzzification on the instance level of ontology using multi-value and multi-attribute structure. A consensus-based method for fuzzy ontology integration is proposed. © 2012 Springer-Verlag.


Truong T.-T.,University of science | Tran M.-T.,University of science | Duong A.-D.,University of Information Technology
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Communication is necessary operations in wireless environments. Therefore, we must have a secure remote authentication to defend transactions against illegitimate adversaries in such risky channel. Smart card is one of methods that many schemes used due to its convenience. Recently, Khurram Khan has proposed an enhancement scheme using smart card to recover some pitfalls in Wang et al.'s scheme. They claimed that their scheme remedy those security flaws. Nevertheless, we point out that Khan et al.'s scheme cannot protect user's anonymity. Besides, it does not achieve secret key forward secrecy and cannot resist denial of service attack due to values stored in server's database. Consequently, we present an improvement to their scheme to isolate such problems. © 2013 Springer-Verlag.

Discover hidden collaborations