University of Information Technology

Vietnam

University of Information Technology

Vietnam
SEARCH FILTERS
Time filter
Source Type

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.


Nguyen M.,University of Information Technology | Ho T.,University of Information Technology | Do P.,University of Information Technology
Proceedings - 2013 RIVF International Conference on Computing and Communication Technologies: Research, Innovation, and Vision for Future, RIVF 2013 | Year: 2013

Understanding the discussed content in social networks is an uneasy problem but brings a lot of advantages for different fields, such as marketing, education, social trends, security. To build up the system for supporting products marketing in social networks, we develop models of content-based social networks analysis in order to find out the discussed topics. The system consists of steps, such as extracting messages, discovering and automatically labeling the discussed topics, in which we pay attention to time factor. Experimented with the Enron corpus containing 11,945 e-mails discussed by 147 users and estimated 50 topics, the system has found out many useful topics and opened new research and application directions © 2013 IEEE.


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.


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.


Truong N.-V.,Vietnam Academy of Science and Technology | Vu D.-L.,University of Information Technology
2012 International Conference on Control, Automation and Information Sciences, ICCAIS 2012 | Year: 2012

Recent advancement and dominance of Android devices in smart phone market makes them promising candidates for a number of industrial applications. This paper describes the development of a Android based platform for remote manufacturing monitoring and control, with an example of a CNC machine via wireless network. Here, such a device accesses the CNC machine in a server-client approach which combines SOAP web service, socket programming and TCP/IPv4 protocols. © 2012 IEEE.


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.


Van Sang L.,University of Information Technology
European Physical Journal Plus | Year: 2016

In this paper, we use molecular dynamics (MD) simulations to relax the initially random system into a triangular lattice. The initial system contains 900 atoms that interact with each other via the interaction potential established by Rechtsman et al. (Phys. Rev. Lett. 95, 228301 (2005)). Our results show that the targeted lattice is stable via relaxation time at low to high temperature, i.e.T = 0.1 , T = 1.0 and T = 2.0 , instead of zero temperature in previous results. Seeking targeted structures at high temperatures is a vital demand of materials applications. We also find that quality of the obtained lattice depends on relaxation temperature of the system. © 2016, Società Italiana di Fisica and Springer-Verlag Berlin Heidelberg.


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

Dynamic ID based authentication scheme is more and more important in wireless environments such as GSM, CDPD, 3G and 4G. One of important properties of such authentication scheme is anonymity. It must be guaranteed to defend the privacy of mobile users against outside attacks, and the scheme of Cheng-Chi Lee, Tsung-Hung Lin and Rui-Xiang Chang satisfies that requirement. However, another important property that should be considered is impersonation. The scheme must have capability to resist this kind of attack to protect legal users from illegal adversaries. In this paper, we demonstrate that Lee et al.'s scheme is still vulnerable to masquerade attack and session key attack with stolen smart card. Then we present an improvement of their scheme in order to isolate such problems. © 2013 Springer-Verlag Berlin Heidelberg.


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.


Huynh T.,University of Information Technology | Luong H.,University of Arkansas | Hoang K.,University of Information Technology
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

In this paper we proposed and developed a system to integrate the bibliographical data of publications in the computer science domain from various online sources into a unified database based on the focused crawling approach. In order to build this system, there are two phases to carry on. The first phase deals with importing bibliographic data from DBLP (Digital Bibliography and Library Project) into our database. The second phase the system will automatically crawl new publications from online digital libraries such as Microsoft Academic Search, ACM, IEEEXplore, CiteSeer and extract bibliographical information (one kind of publication metadata) to update, enrich the existing database, which have been built at the first phase. This system serves effectively in services relating to academic activities such as searching literatures, ranking publications, ranking experts, ranking conferences or journals, reviewing articles, identifying the research trends, mining the linking of articles, stating of the art for a specified research domain, and other related works base on these bibliographical data. © 2012 Springer-Verlag.

Loading University of Information Technology collaborators
Loading University of Information Technology collaborators