TY - BOOK CY - Bhubaneswar, India ID - SisLab4607 UR - https://link.springer.com/book/10.1007%2F978-3-030-65621-8 IS - 12582 Y1 - 2021/01/07/ N2 - This volume contains the papers selected for presentation at the 17th International Conference on Distributed Computing and Internet Technology (ICDCIT 2021) held during January 7?10, 2021, in Bhubaneswar, India. PB - Springer T3 - Lecture Notes in Computer Science SN - 978-3-030-65621-8 ED - Diganta, Goswami ED - Truong, Hoang TI - ICDCIT: International Conference on Distributed Computing and Internet Technology AV - public EP - 309 ER - TY - BOOK ID - SisLab2938 UR - https://doi.org/10.1007/978-3-319-76081-0 IS - 769 N2 - Introduction This book offers a unique blend of reports on both theoretical models and their applications in the area of Intelligent Information and Database Systems. The reports cover a broad range of research topics, including advanced learning techniques, knowledge engineering, Natural Language Processing (NLP), decision support systems, Internet of things (IoT), computer vision, and tools and techniques for Intelligent Information Systems. They are extended versions of papers presented at the ACIIDS 2018 conference (10th Asian Conference on Intelligent Information and Database Systems), which was held in Dong Hoi City, Vietnam on 19?21 March 2018. What all researchers and students of computer science need is a state-of-the-art report on the latest trends in their respective areas of interest. Over the years, researchers have proposed increasingly complex theoretical models, which provide the theoretical basis for numerous applications. The applications, in turn, have a profound influence on virtually every aspect of human activities, while also allowing us to validate the underlying theoretical concepts. PB - Springer, Cham T3 - Studies in Computational Intelligence book series (SCI, volume 769) SN - 1860-9503 ED - Sieminski, Andrzej ED - Kozierkiewicz, Adrianna ED - Nunez, Manuel ED - Ha, Quang Thuy TI - Modern Approaches for Intelligent Information and Database Systems AV - public ER - TY - INPR ID - SisLab4655 UR - https://link.springer.com/book/9783030925246 A1 - Abdallah, Abderazek Ben A1 - Dang, Nam Khanh Y1 - 2022/// N2 - his book focuses on neuromorphic computing principles and organization and how to build fault-tolerant scalable hardware for large and medium scale spiking neural networks with learning capabilities. In addition, the book describes in a comprehensive way the organization and how to design a spike-based neuromorphic system to perform network of spiking neurons communication, computing, and adaptive learning for emerging AI applications. The book begins with an overview of neuromorphic computing systems and explores the fundamental concepts of artificial neural networks. Next, we discuss artificial neurons and how they have evolved in their representation of biological neuronal dynamics. Afterward, we discuss implementing these neural networks in neuron models, storage technologies, inter-neuron communication networks, learning, and various design approaches. Then, comes the fundamental design principle to build an efficient neuromorphic system in hardware. The challenges that need to be solved toward building a spiking neural network architecture with many synapses are discussed. Learning in neuromorphic computing systems and the major emerging memory technologies that promise neuromorphic computing are then given. A particular chapter of this book is dedicated to the circuits and architectures used for communication in neuromorphic systems. In particular, the Network-on-Chip fabric is introduced for receiving and transmitting spikes following the Address Event Representation (AER) protocol and the memory accessing method. In addition, the interconnect design principle is covered to help understand the overall concept of on-chip and off-chip communication. Advanced on-chip interconnect technologies, including si-photonic three-dimensional interconnects and fault-tolerant routing algorithms, are also given. The book also covers the main threats of reliability and discusses several recovery methods for multicore neuromorphic systems. This is important for reliable processing in several embedded neuromorphic applications. A reconfigurable design approach that supports multiple target applications via dynamic reconfigurability, network topology independence, and network expandability is also described in the subsequent chapters. The book ends with a case study about a real hardware-software design of a reliable three-dimensional digital neuromorphic processor geared explicitly toward the 3D-ICs biological brain?s three-dimensional structure. The platform enables high integration density and slight spike delay of spiking networks and features a scalable design. We present methods for fault detection and recovery in a neuromorphic system as well. Neuromorphic Computing Principles and Organization is an excellent resource for researchers, scientists, graduate students, and hardware-software engineers dealing with the ever-increasing demands on fault-tolerance, scalability, and low power consumption. It is also an excellent resource for teaching advanced undergraduate and graduate students about the fundamentals concepts, organization, and actual hardware-software design of reliable neuromorphic systems with learning and fault-tolerance capabilities. PB - Springer International Publishing SN - 3030925242 TI - Neuromorphic Computing Principles and Organization AV - none ER - TY - INPR ID - SisLab4456 UR - https://www.frontiersin.org/articles/10.3389/fnins.2021.690208/abstract A1 - Abdallah, Abderazek Ben A1 - Dang, Nam Khanh N2 - Spiking Neuromorphic systems have been introduced as promising platforms for energy-efficient spiking neural network (SNNs) execution. SNNs incorporate neuronal and synaptic states in addition to the variant time scale into their computational model. Since each neuron in these networks is connected to many others, high bandwidth is required. Moreover, since the spike times are used to encode information in SNN, a precise communication latency is also needed, although SNN is tolerant to the spike delay variation in some limits when it is seen as a whole. The two-dimensional packet-switched network-on-chip was proposed as a solution to provide a scalable interconnect fabric in large-scale spike-based neural networks. The 3D-ICs have also attracted a lot of attention as a potential solution to resolve the interconnect bottleneck. Combining these two emerging technologies provides a new horizon for IC design to satisfy the high requirements of low power and small footprint in emerging AI applications. Moreover, although fault-tolerance is a natural feature of biological systems, integrating many computation and memory units into neuromorphic chips confronts the reliability issue, where a defective part can affect the overall system's performance. This paper presents R-NASH - a reliable three-dimensional digital neuromorphic system geared explicitly toward the 3D-ICs biological brain's three-dimensional structure, where information in the network is represented by sparse patterns of spike timing and learning is based on the local spike-timing-dependent plasticity rule. Our platform enables high integration density and small spike delay of spiking networks and features a scalable design. R-NASH is a design based on the Through-Silicon-Via technology, facilitating spiking neural network implementation on clustered neurons based on Network-on-Chip. We provide a memory interface with the host CPU, allowing for online training and inference of spiking neural networks. Moreover, R-NASH supports fault recovery with graceful performance degradation. PB - Frontiers JF - Frontiers in Neuroscience TI - Towards Robust Cognitive 3D Brain-inspired Cross-paradigm System AV - none ER - TY - INPR ID - SisLab4459 UR - https://www.frontiersin.org/articles/10.3389/fnins.2021.690208/abstract A1 - Abdallah, Abderazek Ben A1 - Dang, Nam Khanh Y1 - 2021/// N2 - Spiking Neuromorphic systems have been introduced as promising platforms for energy-efficient spiking neural network (SNNs) execution. SNNs incorporate neuronal and synaptic states in addition to the variant time scale into their computational model. Since each neuron in these networks is connected to many others, high bandwidth is required. Moreover, since the spike times are used to encode information in SNN, a precise communication latency is also needed, although SNN is tolerant to the spike delay variation in some limits when it is seen as a whole. The two-dimensional packet-switched network-on-chip was proposed as a solution to provide a scalable interconnect fabric in large-scale spike-based neural networks. The 3D-ICs have also attracted a lot of attention as a potential solution to resolve the interconnect bottleneck. Combining these two emerging technologies provides a new horizon for IC design to satisfy the high requirements of low power and small footprint in emerging AI applications. Moreover, although fault-tolerance is a natural feature of biological systems, integrating many computation and memory units into neuromorphic chips confronts the reliability issue, where a defective part can affect the overall system's performance. This paper presents R-NASH - a reliable three-dimensional digital neuromorphic system geared explicitly toward the 3D-ICs biological brain's three-dimensional structure, where information in the network is represented by sparse patterns of spike timing and learning is based on the local spike-timing-dependent plasticity rule. Our platform enables high integration density and small spike delay of spiking networks and features a scalable design. R-NASH is a design based on the Through-Silicon-Via technology, facilitating spiking neural network implementation on clustered neurons based on Network-on-Chip. We provide a memory interface with the host CPU, allowing for online training and inference of spiking neural networks. Moreover, R-NASH supports fault recovery with graceful performance degradation. PB - Frontiers JF - Frontiers in Neuroscience TI - Towards Robust Cognitive 3D Brain-inspired Cross-paradigm System AV - none ER - TY - CONF ID - SisLab3045 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3045/ A1 - Abdelmoutia, Telli A1 - Ma, Thi Chau A1 - Mustapha, Bourahla A1 - Karim, Tabia A1 - Salem, Benferhat Y1 - 2018/07// N2 - This paper proposes an OWL ontology called \AniAge", to define taxonomy of dance movement classes and their relationships for the traditional Vietnamese dance taking into account the semantics of its art and its cultural anthropologists. The \AniAge" terminology can be used to describe elementary movements (poses) as a dataset ontology importing \AniAge". These poses are results of dance sequences segmentation (using segmentation techniques). The ontolgy \AniAge" is supported by classification rules, which are developed with the OWL complementary language SWRL (Semantic Web Rule Language) to entail movement phrases, which are basic movements with complete meaning. The dataset ontology containing poses descriptions can be queried using the query language SQWRL (Semantic Query Webenhanced Rule Language), which is extension of SWRL to retrieve implicit dance knowledge. Then, the query answers can be used for computer animation. TI - AniAge Ontology for Movement Classification in Vietnamese Dance M2 - Montréal, Canada AV - public T2 - The International Conference on Pattern Recognition and Artificial Intelligence ER - TY - CHAP ID - SisLab3524 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3524/ A1 - Bourahla, Mustapha A1 - Telli, Abdelmoutia A1 - Benferhat, Salem A1 - Ma, Thi Chau Y1 - 2019/// N2 - This paper proposes a method to classify non-elementary movements in Vietnamese dances. This classification method uses an OWL ontology called VDM (Vietnamese Dance Movements) recently developed by the authors. The VDM defines a taxonomy of dance move- ment classes and their relationships for the traditional Vietnamese dances taking into account the semantics of its art and its cultural anthropol- ogists. The VDM terminology describes elementary movements (poses) as a dataset ontology importing the ontology VDM. These poses are results of dance sequences segmentation (using segmentation techniques). In this paper, we support the initial ontology VDM by complex classification rules written with SWRL (Semantic Web Rule Language, which is the OWL complementary language) to classify non-elementary movements. The objective is to entail classes of movement phrases, which are non-elementary basic movements with complete meaning and illustrated using M ?o dances. The classification result is the initial dataset VDM ontology augmented with class descriptions of non-elementary movements, which can be queried using the query language SQWRL (Semantic Query Web-enhanced Rule Language). PB - Springer Nature Switzerland AG TI - Classifying Non-elementary Movements in Vietnamese Mo Dances AV - public EP - 13 T2 - Digital Human Modeling and Applications in Health, Safety, Ergonomics and Risk Management: Modelling the Human Body and Motion ER - TY - CONF ID - SisLab2657 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2657/ A1 - Bui, Anh Tu A1 - Le, Hong Anh A1 - Truong, Ninh Thuan Y1 - 2017/11/23/ TI - Generation of Power State Machine for Android devices AV - none M2 - Quy Nhon T2 - 6th EAI International Conference on Context-Aware Systems and Applications (ICCASA) ER - TY - CONF ID - SisLab4097 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4097/ A1 - Bui, Anh Tu A1 - Nguyen, Van Viet A1 - Truong, Ninh Thuan Y1 - 2020/// N2 - In recent years, mobile software has been rapidly developing. The key requirement of mobile software is to ensure optimum power throughout its run. Unlike testing other software properties, energy testing is usually done on real devices to check actual energy consumption. As such, testers need to have optimal test data to save time and effort in testing. In this paper, we propose an approach to automatically generating test data in mobile software testing, concentrate on energy properties. The approach, firstly, builds CFGs (Control Flow Graph) from the source code of the application. We then propose algorithms to select testable paths from CFG such that the mobile applications consume more energy. Finally, test data are generated from the testable paths. TI - Generating test data for energy property in mobile applications AV - none T2 - 2020 7th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab1517 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1517/ A1 - Bui, Anh Tu A1 - Truong, Ninh Thuan Y1 - 2016/03/26/ N2 - Vi?c phát tri?n ph?n m?m yêu c?u các b??c th?c hi?n ch?t ch?, ?? chính xác cao nh?m ?áp ?ng ?úng, ?? yêu c?u ng??i s? d?ng. Tuy nhiên ??i ng? phát tri?n ph?n m?m c?ng không th? ki?m soát h?t các l?i, các v?n ?? phát sinh khi ph?n m?m ??a vào s? d?ng. ?? tài t?p trung vào vi?c nghiên c?u các ph??ng pháp nh?m phân tích m?t s? thu?c tính c?a ch??ng trình, t? ?ó xây d?ng các công c? phân tích ch??ng trình t? nhi?u khía c?nh khác nhau, ??a ra thông tin cho ng??i phát tri?n ph?n m?m ??m b?o tính ?úng ??n cho ch??ng trình. TI - Ki?m ch?ng ph?n m?m d?a trên phân tích ch??ng trình M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab4349 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4349/ A1 - Bui, Ba Nam A1 - Phan, Anh A1 - Nguyen, Thi Nhat Thanh N2 - Over the past decade, satellite image processing is an overwhelming bulk of work. Recently, with rapid development in information technology, Google released Google Earth Engine (GEE), which is a powerful cloud computing platform, to help to improve the performance of geospatial big data archives and processing. In this study, we deployed a machine learning model to evaluate the capability of time series Sentinel imagery (Sentinel 2 A/B and Sentinel 1A) in landcover mapping for Hanoi in 2019. First, we evaluated several traditional machine learning models, as a result, XGBoost classifier stands out as the best model with 86% overall accuracy (OA). As Hanoi is a frequent cloud-covered area, the combination of optical data and radar data helps to improve the quality of the landcover map in 2019. The use of GEE has made it easier and faster through the provided JavaScript API when ensuring high accuracy. TI - Land-Cover Mapping from Sentinel Time-Series Imagery on the Google Earth Engine: A Case Study for Hanoi AV - public T2 - 2020 7th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab1304 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1304/ A1 - Bui, Dinh Luyen A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2014/// VL - 282 TI - Measuring the Influence of Bloggers in Their Community Based on the H-Index Family SP - 313 M2 - Budapest, Hungary AV - none EP - 324 T2 - 2014: the 2nd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA) ER - TY - CONF ID - SisLab3264 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3264/ A1 - Bui, Duc Thinh A1 - Nguyen, Do Van A1 - Nguyen, Thi Thu Thuy A1 - Tran, Quoc Long A1 - Le, Thanh Ha Y1 - 2018/11/19/ N2 - In remote sensing data analysis and computer vision, aerial image segmentation is a crucial research topic, which has many appli- cations in environmental and urban planning. Recently, deep learning is using to tackle many computer vision problem, including aerial image segmentation. Results have shown that deep learning gains much higher accuracy than other methods on many benchmark data sets. In this work, we propose a neural network called NASNet-FCN, which based on Fully Convolutional Network - a frame work for solving semantic segmenta- tion problem and image feature extractor derived from state-of-the-art object recognition network called Neural Search Network Architecture. Our networks are trained and judged by using benchmark dataset from ISPRS Vaihingen challenge. Results show that our methods achieved state-of-the-art accuracy with potential improvements. TI - Aerial Image Semantic Segmentation Using Neural Search Network Architecture M2 - Hanoi, Vietnam AV - public T2 - (MIWAI 2018) 12th Multi-disciplinary International Conference on Artificial Intelligence ER - TY - JOUR ID - SisLab2817 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2817/ A1 - Bui, Hong Nhung A1 - Ha, Quang Thuy A1 - Nguyen, Tri Thanh Y1 - 2017/// N2 - In trace clustering, a problem of process mining, traditional distance measures only focus on the local relationship between trace pairs. In this paper, we propose a new method to measure the global relationship of the traces based on the Normalized Google Distance. Experimental results show that our method not only outperforms alternatives but also helps to speed up the trace clustering JF - Journal of Electronics and Communications SN - 0973-7006 TI - A novel similarity measure for trace clustering based on normalized google distance AV - none ER - TY - JOUR ID - SisLab3160 UR - http://www.pphmj.com/abstract/11903.htm IS - 3 A1 - Bui, Hong Nhung A1 - Ha, Quang Thuy A1 - Nguyen, Tri Thanh Y1 - 2018/08// N2 - In trace clustering, a problem of process mining, traditional distance measures only focus on the local relationship between trace pairs. In this paper, we propose a new method to measure the global relationship of the traces based on the Normalized Google Distance. Experimental results show that our method not only outperforms alternatives but also helps to speed up the trace clustering. PB - The Pushpa Publishing House JF - JP Journal of Heat and Mass Transfer VL - Specia SN - ISSN: 0973-5763 TI - A novel similarity measure for trace clustering based on normalized google distance. SP - 341 AV - public EP - 346 ER - TY - CHAP ID - SisLab3159 UR - https://link.springer.com/chapter/10.1007%2F978-3-319-99368-3_50 A1 - Bui, Hong Nhung A1 - Nguyen, Tri Thanh A1 - Nguyen, Thi Cham A1 - Ha, Quang Thuy Y1 - 2018/08// N2 - In process mining, trace clustering is an important technique that at-tracts the attention of researchers to solve the large and complex volume of event logs. Traditional trace clustering often uses available data mining algorithms which do not exploit the characteristic of processes. In this study, we propose a new trace clustering algorithm, especially for the process mining, based on the using trace context. The proposed clustering algorithm can automatic detects the number of clusters, and it does not need a convergence iteration like traditional ones like K-means. The algorithm takes two loops over the input to generate the clusters, thus the complexity is greatly reduced. Experimental results show that our method also has good results when compared to traditional methods. PB - Springer T3 - Lecture Notes in Computer Science SN - ISBN 978-3-319-76080-3 ED - Nguyen, Hung Son ED - Ha, Quang Thuy ED - li, Tianrui ED - Ma?gorzata, Przyby?a-Kasperek TI - A New Trace Clustering Algorithm Based on Context in Process Mining SP - 644 AV - public EP - 657 T2 - International Joint Conference on Rough Sets (IJCRS 2018) ER - TY - CONF ID - SisLab3711 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3711/ A1 - Bui, Hong Nhung A1 - Vu, Trong-Sinh A1 - Nguyen, Tri Thanh A1 - Nguyen, Thi Cham A1 - Ha, Quang Thuy Y1 - 2019/10/24/ N2 - ? In process mining, trace representation has a significant effect on the process discovery problem, the challenge is to get highly informative but low-dimensional of the vector space from event logs. This is required to improve the quality of the trace clustering problem and generate the process models that are easy to understand. Though traditional trace representation methods have specific good effects, their vector space often has a lot of dimensions. In this paper, we address this problem by proposing a new trace representation method based on the deep neural networks. Experimental results show that our method not only outperforms alternatives but also helps significantly reduce the dimension of feature representation. TI - A Compact Trace Representation Using Deep Neural Networks for Process Mining M2 - Da Nang, Vietnam AV - none T2 - The 11th IEEE International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab4042 UR - http://dx.doi.org/10.1007/978-981-15-3380-8_4 A1 - Bui, Hong-Nhung A1 - Vu, Trong-Sinh A1 - Nguyen, Hien-Hanh A1 - Nguyen, Tri-Thanh A1 - Ha, Quang-Thuy Y1 - 2020/03/03/ N2 - In the field of process mining, one of the challenges of the trace representation problem is to exploit a lot of potentially useful information within the traces while keeping a low dimension of the corresponding vector space. Motivated by the initial results of applying the deep neural networks for producing trace representation, in this paper, we continue to study and apply two more advanced models of deep learning, i.e., Continuous Bag of Words and Long short-term memory, for generating the trace representation. The experimental results have achieved significant improvement, i.e., not only showing the close relationship between the activities in a trace but also helping to reduce the dimension of trace representation. VL - 1178 SN - 1865-0929 TI - Exploiting CBOW and LSTM Models to Generate Trace Representation for Process Mining SP - 35 M2 - Phuket, Thailand AV - none EP - 46 T2 - Asian Conference on Intelligent Information and Database Systems ER - TY - INPR ID - SisLab3838 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3838/ A1 - Bui, Ngoc Dung A1 - Hoang, Xuan Tung Y1 - 2019/12/19/ N2 - Vehicles detection and tracking have become an important role to traffic management systems. Recently, many vehicles tracking approaches have already been proposed. However, these approaches were unable to adequately distinguish vehicles from each other when those vehicles look similar and involve in complex transportation conditions. In this paper, a method for tracking vehicles in surveillance cameras is presented. In our method, Convolutional Neural Networks is used to detect vehicles. Also, multiple Kalman filters are used to track those vehicles. The proposed method is designed for distinguishing and tracking multiple vehicles simultaneously. Our experiments show that the proposed mechanism achieves high accuracy even with real time constraints. TI - Multiple Vehicles Tracking in Intelligent Transportation System using Convolutional Neural Network and Kalman Filter M2 - Chiang Mai, Thailand AV - public T2 - The 5th International Conference on Next Generation Computing 2019 ER - TY - CONF ID - SisLab1190 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1190/ A1 - Bui, Ngoc Thang Y1 - 2014/// N2 - Short interfering RNA sequences (siRNAs) can knockdown target genes and thus have an immense impact on biology and pharmacy research. The key question of which siRNAs have high knockdown ability in siRNA research remains challenging as current known results are still far from expectation. This work aims to develop a generic framework to enhance siRNA knockdown efficacy prediction. The key idea is first to enrich siRNA sequences by incorporating them with rules found for designing effective siRNAs and representing them as transformed matrices, then to employ the bilinear tensor regression to do prediction on those matrices. Experiments show that the proposed method achieves results better than existing models in most cases. VL - 8444 TI - A Novel Framework to Improve siRNA Efficacy Prediction SP - 400 M2 - Taiwan AV - none EP - 412 T2 - 2014: The 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2014) ER - TY - JOUR ID - SisLab1468 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1468/ IS - 80 A1 - Bui, Ngoc Thang A1 - Ho, Tu Bao A1 - Kanda, T.A. Y1 - 2015/// N2 - Short interfering RNAs (siRNAs) can knockdown target genes and thus have an immense impact on biology and pharmacy research. The key question of which siRNAs have high knockdown ability in siRNA research remains challenging as current known results are still far from expectation. This work aims to develop a generic framework to enhance siRNA knockdown efficacy prediction. The key idea is first to enrich siRNA sequences by incorporating them with rules found for designing effective siRNAs and representing them as enriched matrices, then to employ the bilinear tensor regression to predict knockdown efficacy of those matrices. Experiments show that the proposed method achieves better results than existing models in most cases. Our model not only provides a suitable siRNA representation but also can predict siRNA efficacy more accurate and stable than most of state?of?the?art models. Source codes are freely available on the web at: http://?www.?jaist.?ac.?jp/?\~bao/?BiLTR/ JF - BMC Bioinformatics VL - 16 SN - 1471-2105 TI - Semi-supervised Tensor Regression Model for siRNA Efficacy Prediction AV - public ER - TY - CONF ID - SisLab1632 UR - http://dx.doi.org/10.1109/KSE.2015.29 A1 - Bui, Ngoc Thang A1 - Le, Sy Vinh A1 - Ho, Tu Bao Y1 - 2015/// N2 - The discovery of RNA interference (RNAi) leads to design novel drugs for different diseases. Selecting short interfering RNAs (siRNAs) that can knockdown target genes efficiently is one of the key tasks in studying RNAi. A number of predictive models have been proposed to predict knockdown efficacy of siRNAs, however, their performance is still far from the expectation. This work aims to develop a predictive model to enhance siRNA knockdown efficacy prediction. The key idea is to combine both the rule -- based and the model -- based approaches. To this end, views of siRNAs that integrate available siRNA design rules are first learned using an adaptive Fuzzy C Means (FCM) algorithm. The learned views and other properties of siRNAs are combined to final representations of siRNAs. The elastic net regression method is employed to learn a predictive model from these final representations. Experiments on benchmark datasets showed that the proposed method achieved stable and accurate results in comparison with other methods. TI - MVRM: A Hybrid Approach to Predict siRNA Efficacy SP - 120 M2 - Ho Chi Minh city, Vietnam AV - none EP - 125 T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab1595 UR - http://dl.acm.org/citation.cfm?id=2542091&dl=ACM&coll=DL A1 - Bui, Phi Diep A1 - Nguyen, Trong Khanh A1 - Nguyen, Viet Ha Y1 - 2013/// N2 - In the era of information explosion, a program is necessary to be scalable. Therefore, scalability analysis becomes very important in software verification and validation. However, current approaches to empirical scalability analysis remain limitations related to the number of supported models and performance. In this paper, we propose a runtime approach for estimating the program resource usage with two aims: evaluating the program scalability and revealing potential errors. In this approach, the resource usage of a program is first observed when it is executed on inputs with different scales, the observed results are then fitted on a model of the usage according to the program's input. Comparing to other approaches, ours supports diverse models to illustrate the resource usage, i.e., linear-log, power-law, polynomial, etc. We currently focus on the computation cost and stack frames usage as two representatives of resource usage, but the approach can be extended to other kinds of resource. The experimental result shows that our approach achieves more precise estimation and better performance than other state-of-the-art approaches. TI - A runtime approach for estimating resource usage SP - 261 M2 - Danang, Vietnam AV - none EP - 266 T2 - SoICT: the 2013 Symposium on Information and Communication Technology ER - TY - INPR ID - SisLab3202 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3202/ A1 - Bui, Quang Cuong A1 - Dinh, Tien Loc A1 - Luu, Anh Viet A1 - Nguyen, Viet Hoa A1 - Pham, Ngoc Quy A1 - Pham, Ngoc Hung Y1 - 2018/// PB - Vietnam National University Hanoi TI - A Toolchain for Source Code Quality Assurance of Java EE Applications M1 - technical_report AV - public ER - TY - CONF ID - SisLab2104 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2104/ A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh A1 - Nguyen, Hai Chau Y1 - 2016/// TI - Field Informatics: Application of ICT to environment management and monitoring SP - 125 M2 - Hanoi, Vietnam AV - none EP - 130 T2 - The 2nd International Joint Conference (IJCC) ER - TY - JOUR ID - SisLab3509 UR - https://link.springer.com/journal/10898 IS - 1 A1 - Bui, Quoc Trung A1 - Vidal, Thibaut A1 - Ha, Minh Hoang Y1 - 2019/05// N2 - We investigate how to partition a rectangular region of length L1 and height L2 into n rectangles of given areas (a1,?,an) using two-stage guillotine cuts, so as to minimize either (i) the sum of the perimeters, (ii) the largest perimeter, or (iii) the maximum aspect ratio of the rectangles. These problems play an important role in the ongoing Vietnamese land-allocation reform, as well as in the optimization of matrix multiplication algorithms. We show that the first problem can be solved to optimality in O(nlogn) , while the two others are NP-hard. We propose mixed integer linear programming formulations and a binary search-based approach for solving the NP-hard problems. Experimental analyses are conducted to compare the solution approaches in terms of computational efficiency and solution quality, for different objectives. PB - Springer JF - Journal of global optimization VL - 74 SN - 0925-5001 TI - On three soft rectangle packing problems with guillotine constraints SP - 45 AV - public EP - 62 ER - TY - UNPB ID - SisLab2916 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2916/ A1 - Bui, Thang Y1 - 2017/12// PB - VNU-UET Technical Report VL - TR2017-FIT-005 M1 - technical_report TI - Predictive models to predict knockdown efficacy of siRNAs AV - public ER - TY - JOUR ID - SisLab201 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/201/ IS - 5 A1 - Bui, The Duy A1 - Nguyen, Thang Long Y1 - 2007/05// N2 - In this paper, we discuss the application of microelectronic mechanical system (MEMS) accelerometers for recognizing postures in Vietnamese Sign Language (VSL). We develop a similar device to the Accele Glove for the recognition of VSL. In addition to the five sensors as in the Accele Glove, we placed one more sensor on the back of the hand to improve the recognition process. In addition, we use a completely different method for the classification process leading to very promising results. This paper concentrates on signing with postures, in which the user spells each word with finger signs corresponding to the letters of the alphabet. Therefore, we focus on the recognition of postures that represent the 23 Vietnamese-based letters together with two postures for ``space'' and ``punctuation''. The data obtained from the sensing device is transformed to relative angles between fingers and the palm. Each character is recognized by a fuzzy rule-based classification system, which allows the concept of vagueness in recognition. In addition, a set of Vietnamese spelling rules has been applied to improve the classification results. The recognition rate is high even when the postures are not performed perfectly, e.g., the finger is not bended completely or the palm is not straight JF - Sensors Journal, IEEE VL - 7 KW - Accelerometers;Application software;Character recognition;Fingers;Handicapped aids;Mechanical sensors;Mechanical systems;Microelectronics;Micromechanical devices;Shape;accelerometers;biocommunications;fuzzy systems;gesture recognition;handicapped aids;knowledge based systems;microsensors;natural language processing;pattern classification;MEMS accelerometers;Vietnamese sign language;Vietnamese spelling rules;Vietnamese-based letters;finger signs;fuzzy rule-based classification system;microelectronic mechanical system accelerometers;posture recognition;Human computer interaction;Vietnamese sign language (VSL);microelectronic mechanical system (MEMS) sensors;sign language recognition; TI - Recognizing Postures in Vietnamese Sign Language With MEMS Accelerometers SP - 707 AV - none EP - 712 ER - TY - JOUR ID - SisLab1481 UR - http://www.journals.elsevier.com/neurocomputing A1 - Bui, The Duy A1 - Nong, Thi-Hoa A1 - Dang, Trung Kien Y1 - 2015/// PB - Elsevier JF - Neurocomputing VL - 149 SN - 0925-2312 TI - Improving Learning Rule for Fuzzy Associative Memory with Combination of Content and Association SP - 59 AV - none EP - 64 ER - TY - CONF ID - SisLab3407 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3407/ A1 - Bui, Van Tan A1 - Nguyen, Phuong Thai Y1 - 2018/11/15/ N2 - The lexical entailment recognition problem aims to identify the is-a relation between words. The problem has recently been receiving research attention in the natural language processing field. In this study, we propose a novel method (VLER) for this problem on Vietnamese. For this purpose, we first exploit such lexical structure information of words as a feature, then combine this feature with vectors representation of words such as a unique feature for recognizing the relation. Moreover, we applied a number of methods based on word embedding and supervised learning, experimental results showed that our method achieves the best performance in the hypernymy detection task than other methods in terms of accuracy. TI - Enhancing Performance of Lexical Entailment Recognition for Vietnamese based on Exploiting Lexical Structure Features M2 - Ho Chi Minh city, Vietnam AV - public T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE) (KSE'18) ER - TY - CONF ID - SisLab3412 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3412/ A1 - Bui, Van Tan A1 - Nguyen, Phuong Thai A1 - Dinh, Khac Quy Y1 - 2018/// N2 - ?o l??ng ?? t??ng t? ng? ngh?a gi?a các t? là m?t bài toán nghiên c?u c?t lõi và có nhi?u ?ng d?ng trong x? lý ngôn ng? t? nhiên. Nh?ng nghiên c?u ???c công b? g?n ?ây th??ng gi?i quy?t bài toán này cho ??n ng?. G?n ?ây, ch?ng ki?n s? gia t?ng không ng?ng s? l??ng nh?ng ?ng d?ng x? lý t? nhiên ?a ngôn ng?, ??t ra yêu c?u c?n có các k? thu?t ?o l??ng ?? t??ng t? ng? ngh?a song ng? m?t cách hi?u qu?. Trong bài vi?t này, chúng tôi trình bày m?t s? k? thu?t ?o ?? t??ng t? ng? ngh?a song ng? theo ti?p c?n nhúng t? song ng?; ?? xu?t m?t mô hình m?ng n?ron xây d?ng không gian vector bi?u di?n ng? ngh?a song ng?; xây d?ng b? d? li?u chu?n cho bài toán ?o ?? t??ng t? ng? ngh?a song ng? Vi?t-Anh. Cu?i cùng, chúng tôi th?c nghi?m và ?ánh giá các k? thu?t trên b? d? li?u ?ã xây d?ng. TI - ?O ?? T??NG T? NG?A NGH?A C?A C?P NGÔN NG? ANH-VI?T THEO MÔ HÌNH PHÂN Ph?I NG? NGH?A SONG NG? AV - public T2 - Fundamental and Applied IT Research Conference (Fair), 2018 ER - TY - CONF ID - SisLab3411 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3411/ A1 - Bui, Van Tan A1 - Nguyen, Phuong Thai A1 - Pham, Van Lam Y1 - 2018/// N2 - The hypernymy detection problem aims to identify the "is-a" relation between words. The problem has recently been receiving attention from researchers in the field of natural language processing. So far, fairly-effective methods for hypernymy detection in English have been reported. Studies of hypernymy detection in Vietnamese have not been reported yet. In this study, we applied a number of hypernymy detection methods based on word embeddings and supervised learning for Vietnamese. We propose an improvement on the method given by Luu Tuan Anh et al. (2016) by weighting context words proportionally to the semantic similarity between them and the hypernym. Based on Vietnamese WordNet, three datasets for hypernymy detection were built. Experimental results showed that our proposal can increase the efficiency from 8% to 10% in terms of accuracy compared to the original method. TI - Hypernymy Detection for Vietnamese Using Dynamic Weighting Neural Network AV - public T2 - International Conference on Computational Linguistics and Intelligent Text Processing ER - TY - CONF ID - SisLab4001 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4001/ A1 - Bui Minh, Tuan A1 - Ta Duc, Tuyen A1 - Nguyen Linh, Trung A1 - Nguyen Viet, Ha Y1 - 2020/05// N2 - Physical layer security (PLS) provides lightweight security solutions in which security is achieved based on the inherent random characteristics of the wireless medium. In this paper, we consider the PLS approach called friendly jamming (FJ), which is more practical thanks to its low computational complexity. State-of-the-art methods require that legitimate users have full channel state information(CSI)of their channel.Thanks to the recent promising application of the autoencoder (AE) in communication, we propose a new FJ method for PLS using AE without prior knowledge of the CSI. The proposed AE-based FJ method can provide good secrecy performance while avoiding explicit CSI estimation. We also apply the recently proposed tool for mutual information neural estimation (MINE) to evaluate the secrecy capacity. Moreover, we leverage MINE to avoid end-to-end learning in AE-based FJ. TI - Autoencoder based friendly jamming M2 - Seoul, South Korea AV - none T2 - IEEE Wireless Communications and Networking Conference (WCNC) ER - TY - INPR ID - SisLab2574 UR - http://www.sciencedirect.com/science/article/pii/S0377221717307580 A1 - Bulhões, Teobaldo A1 - Ha, Minh Hoang A1 - Martinelli, Rafael A1 - Vidal, Thibaut Y1 - 2017/// N2 - We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems. PB - Elsevier JF - European Journal of Operational Research SN - 0377-2217 TI - The vehicle routing problem with service level constraints AV - public ER - TY - RPRT ID - SisLab3983 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3983/ A1 - Can, Duy Cat Y1 - 2020/// N2 - Background: Most previous relation extraction (RE) studies have focused on intra-sentence relations and haveignored relations that span sentences, i.e. inter-sentence relations. Such relations connect entities at thedocument level rather than as relational facts in a single sentence. Extracting facts that are expressed acrosssentences leads to some challenges and requires different approaches than those usually applied in recentintra-sentence relation extraction. Despite recent results, there are still limitations to be overcome.Results:We present a novel representation for a sequence of consecutive sentences, namely documentsub-graph, to extract inter-sentence relations. Experiments on the BioCreative V Chemical-Disease Relationcorpus demonstrate the advantages and robustness of our novel system to extract both intra- andinter-sentence relations in biomedical literature abstracts. The experimental results are comparable tostate-of-the-art approaches and show the potential by demonstrating the effectiveness of graphs, deeplearning-based model and other processing techniques. Experiments were also carried out to verify therationality and impact of various additional information and model components.Conclusions:Our proposed graph-based representation helps to extract?50% of inter-sentence relations andboosts the model performance on both precision and recall compared to the baseline model. PB - BMC Journal of Biomedical Semantics M1 - technical_report TI - Exploiting document graphs for inter-sentence relation extraction AV - restricted ER - TY - INPR ID - SisLab3169 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3169/ A1 - Can, Duy Cat A1 - Ho, Thi Nga A1 - Chng, Eng Siong Y1 - 2018/11// N2 - Automatic speech recognition systems currently deliver an unpunctuated sequence of words which is hard to peruse for human and degrades the performance of the downstream natural language processing tasks. In this paper, we propose a hybrid approach for Sentence Unit Detection, in which the focus is on adding the full stop [.] to the unstructured text. Our model profits from the advantage of two dominant deep learning architectures: (i) the ability to learn the long dependencies in both directions of a bidirectional Long Short-Term Memory; (ii) the ability to capture the local context with Convolutional Neural Networks. We also empirically study the training objective of our networks using extra-loss and further investigate the impacts of each model component on the overall result. Experiments conducted on two large-scale datasets demonstrated that the proposed architecture outperforms previous separated methods by a substantial margin of 1.82-1.91% of F1. TI - A Hybrid Deep Learning Architecture for Sentence Unit Detection M2 - Bandung, Indonesia AV - restricted T2 - International Conference on Asian Language Processing (IALP 2018 ) ER - TY - CHAP ID - SisLab4485 UR - https://link.springer.com/chapter/10.1007%2F978-3-030-73280-6_31 A1 - Can, Duy Cat A1 - Le, Hoang Quynh A1 - Ha, Quang Thuy Y1 - 2021/04/07/ N2 - With the development of technology, the highly accessible internet service is the biggest demand for most people. Online network, however, has been suffering from malicious attempts to disrupt essential web technologies, resulting in service failures. In this work, we introduced a model to detect and classify Distributed Denial of Service attacks based on neural networks that take advantage of a proposed automatic feature selection component. The experimental results on CIC-DDoS 2019 dataset have demonstrated that our proposed model outperformed other machine learning-based model by large margin. We also investigated the effectiveness of weighted loss and hinge loss on handling the class imbalance problem. PB - Springer TI - Detection of Distributed Denial of Service Attacks Using Automatic Feature Selection with Enhancement for Imbalance Dataset SP - 386 AV - none EP - 398 T2 - ACIIDS 2021: Intelligent Information and Database Systems ER - TY - INPR ID - SisLab4289 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4289/ A1 - Can, Duy Cat A1 - Le, Hoang Quynh A1 - Ha, Quang Thuy Y1 - 2021/04/07/ N2 - Abstract: With the development of technology, the highly accessible internet service is the biggest demand for most people. Online network, however, has been suffering from malicious attempts to disrupt essential web technologies, resulting in service failures. In this work, we introduced a model to detect and classify Distributed Denial of Service attacks based on neural networks that take advantage of a proposed automatic feature selection component. The experimental results on CIC-DDoS 2019dataset have demonstrated that our proposed model outperformed other machine learning-based model by large margin. We also investigated the effectiveness of weighted loss and hinge loss on handling the class imbalance problem. PB - ACIIDS 2021 TI - Detection of Distributed Denial of Service Attacks using Automatic Feature Selection with Enhancement for Imbalance Dataset AV - public T2 - ACIIDS-2021 ER - TY - CONF ID - SisLab3441 UR - https://link.springer.com/chapter/10.1007/978-3-030-14799-0_12 A1 - Can, Duy Cat A1 - Le, Hoang Quynh A1 - Ha, Quang Thuy Y1 - 2019/04/08/ N2 - Experimental performance on the task of relation extraction/classification has generally improved using deep neural network architectures. In which, data representation has been proven to be one of the most influential factors to the model's performance but still has many limitations. In this work, we take advantage of compressed information in the shortest dependency path (SDP) between two corresponding entities to classify the relation between them. We propose (i) a compositional embedding that combines several dominant linguistic as well as architectural features and (ii) dependency tree normalization techniques for generating rich representations for both words and dependency relations in the SDP. We also present a Convolutional Neural Network (CNN) model to process the proposed SDP enriched representation. Experimental results for both general and biomedical data demonstrate the effectiveness of compositional embedding, dependency tree normalization technique as well as the suitability of the CNN model. TI - Improving Semantic Relation Extraction System with Compositional Dependency Unit on Enriched Shortest Dependency Path SP - 140 M2 - Yogyakarta, Indonesia AV - restricted EP - 152 T2 - 2019 11th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - JOUR ID - SisLab3296 UR - https://www.mdpi.com/2073-431X/7/3/44 A1 - Cao, Thinh A1 - Yamada, Koichi A1 - Unehara, Muneyuki A1 - Suzuki, Izumi A1 - Nguyen, Do Van Y1 - 2018/// N2 - The paper discusses the use of parallel computation to obtain rough set approximations from large-scale information systems where missing data exist in both condition and decision attributes. To date, many studies have focused on missing condition data, but very few have accounted for missing decision data, especially in enlarging datasets. One of the approaches for dealing with missing data in condition attributes is named twofold rough approximations. The paper aims to extend the approach to deal with missing data in the decision attribute. In addition, computing twofold rough approximations is very intensive, thus the approach is not suitable when input datasets are large. We propose parallel algorithms to compute twofold rough approximations in large-scale datasets. Our method is based on MapReduce, a distributed programming model for processing large-scale data. We introduce the original sequential algorithm first and then the parallel version is introduced. Comparison between the two approaches through experiments shows that our proposed parallel algorithms are suitable for and perform efficiently on large-scale datasets that have missing data in condition and decision attributes. JF - Computers TI - Parallel Computation of Rough Set Approximations in Information Systems with Missing Decision Data AV - none ER - TY - JOUR ID - SisLab3358 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3358/ A1 - Christopher, D. Elvidge A1 - Tilottama, Ghosh A1 - Kimberly, Baugh A1 - Mikhail, Zhizhin A1 - Feng-Chi, Hsu A1 - Nilo, Selim Katada A1 - Wilmon, Penalosa A1 - Bui, Quang Hung Y1 - 2018/// N2 - Fishery closures are widely used to promote the sustainability of fish stocks. Fishery agencies typically have very little data relevant to planning closure enforcement actions and evaluating the effectiveness of closures, due in part to the vast expanse and remote nature of many closures. In some cases the effectiveness of closures can be evaluated using data from GPS based beacons, such as Automatic Identification System (AIS) or Vessel Monitoring Systems (VMS) installed on fishing boats. In fisheries where few boats are equipped with AIS or VMS, the rating of closures relies on other data sources capable of detecting or inferring fishing activity. One such source comes from low light imaging data collected by the NASA/NOAA Visible Infrared Imaging Radiometer Suite (VIIRS), which can detect fishing boats using lights to attract catch. This is a widely used practice in Asia and several other regions. NOAA has developed an automatic system for reporting the locations of VIIRS boat detections with a nominal 4 h temporal latency. VIIRS boat detection alerts are running for more than 900 fishery closures in the Philippines, with email and SMS transmission modes. These alerts are being actively used in the Philippines to plan enforcement actions and there is a growing list of apprehensions that occurred based on tip-offs from VIIRS. The VIIRS boat detection archive extends back to April 2012. A VIIRS closure index (VCI) has been developed to rate the effectiveness of closures on monthly increments in terms of a percentage. The VCI analysis was performed on three types of closures: an ad hoc fishery closure associated with a toxic industrial discharge, a seasonal fishery closure and a permanent closure in restricted coastal waters. The VCI results indicate that it is possible to rank the effectiveness of different closure, year-to-year differences in compliance levels, and to identify closure encroachments which may warrant additional enforcement effort. JF - Frontiers in Marine Science SN - 2296-7745 TI - Rating the Effectiveness of Fishery Closures With Visible Infrared Imaging Radiometer Suite Boat Detection Data AV - none ER - TY - CONF ID - SisLab4517 UR - https://ieeexplore.ieee.org/document/9287702 A1 - Chu, Minh Hue A1 - Dang, Duc Hanh Y1 - 2020/// TI - Automatic Extraction of Analysis Classes from Use Cases SP - 109 AV - none EP - 114 T2 - Proc. 12nd Int. Conf. Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab1973 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1973/ IS - 16 A1 - Chu, Minh Hue A1 - Dang, Duc Hanh Y1 - 2011/// JF - T?p chí Nghiên c?u Khoa h?c & Công ngh? Quân s? VL - 12 SN - 1859-1043 TI - A Domain Specific Language for the RBAC Domain SP - 163 AV - none EP - 168 ER - TY - CONF ID - SisLab1971 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1971/ A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh Y1 - 2015/// TI - A Method to Generate Test Cases from Use Cases SP - 590 M2 - Hanoi, Vietnam AV - none EP - 599 T2 - 8th National Conference on Fundamental and Applied Information Technology Research (FAIR) ER - TY - CONF ID - SisLab1970 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1970/ A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh Y1 - 2016/// TI - A Method to Specify Software Functional Requirements for System Test Case Generation SP - 1 M2 - Can Tho, Vietnam AV - none EP - 8 T2 - The 9th National Conference on Fundamental and Applied Information Technology Research (FAIR) ER - TY - CONF ID - SisLab3142 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3142/ A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh Y1 - 2018/11// TI - A Transformation-Based Method for Test Case Automatic Generation from Use Cases SP - 252 M2 - Vietnam AV - none EP - 257 T2 - KSE: the 2018 International Conference on Knowledge and Systems Engineering ER - TY - JOUR ID - SisLab3139 UR - http://www.informatica.si/index.php/informatica/index IS - 3 A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh A1 - Le, Minh Duc Y1 - 2018/// N2 - A use case model is often represented by a UML use case diagram and loosely structured textual descriptions. The use case model expressed in such a form contains ambiguous and imprecise parts. This prevents integrating it into model-driven approaches, where use case models are often taken as the source of transformations. In this paper, we introduce a domain-specific language named the Use case Specification Language (USL) to precisely specify use cases. We define the abstract syntax of USL using a metamodel together with OCL wellformedness rules and then provide a graphical concrete syntax for the usability goal. We also define a precise semantics for USL by mapping USL models to Labelled Transition Systems (LTSs). It opens a possibility to transform USL models to software artifacts such as test cases and design models. We focus on a transformation from a USL model to a template-based use case description in order to illustrate our method. A language evaluation of USL is also performed in this paper. PB - Slovensko Drustvo Informatika JF - Informatica - Journal of Computing and Informatics VL - 42 SN - 0350-5596 TI - USL: A Domain-Specific Language for Precise Specification of Use Cases and Its Transformations SP - 325 AV - none EP - 343 ER - TY - CONF ID - SisLab2673 UR - http://www.soict.org/ A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh A1 - Le, Minh Duc A1 - Nguyen, Thi Hanh Y1 - 2017/// TI - USL: Towards Precise Specification of Use Cases for Model-Driven Development SP - 1 M2 - Nha Trang AV - none EP - 8 T2 - 8th International Symposium on Information and Communications (SoICT) ER - TY - JOUR ID - SisLab3580 UR - https://www.worldscientific.com/doi/abs/10.1142/S0218194019500414 IS - 9 A1 - Chu, Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh A1 - Truong, Anh Hoang Y1 - 2019/10// N2 - This paper proposes a transformation-based method to automatically generate functional test cases from use cases named USLTG (USL-based Test Generation). We first focus on developing a modeling language named Test Case Specification Language (TCSL) in order to express test cases. Test cases in TCSL can contain detailed information including test steps, test objects within steps, actions of test objects, and test data. Such information is often ignored in currently available test case specifications. We then aim to generate test cases in a TCSL model by a transformation from use cases that are represented by a Use case Specification Language (USL). The USLTG transformation includes three main steps, in generating: (1) scenarios, (2) test data, and (3) a TCSL model. Within our transformation, the OCL solver is employed in order to build system snapshots as the part of test cases and to identify other test data. We applied our method to two case studies and evaluated our method by comparing with other recent works. PB - World Scientific Publishing JF - International journal of software engineering and knowledge engineering (IJSEKE) VL - 29 SN - 0218-1940 TI - USLTG: Test Case Automatic Generation by Transforming Use Cases SP - 1313 AV - none EP - 1345 ER - TY - CONF ID - SisLab1737 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1737/ A1 - Chu, Thi Minh Hue A1 - Dang, Duc Hanh A1 - Nguyen, Ngoc Binh Y1 - 2015/07// TI - Ph??ng pháp sinh t? ??ng ca ki?m th? t? mô hình ca s? d?ng(Automatic Generation of Test Cases based on Use Cases Model) AV - none M2 - Hanoi, Vietnam T2 - H?i ngh? khoa h?c qu?c gia l?n th? VIII ?Nghiên c?u c? b?n và ?ng d?ng Công ngh? Thông tin? n?m 2015 (FAIR 2015) ER - TY - CONF ID - SisLab1515 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1515/ A1 - Chu, Thi Minh Hue A1 - Nguyen, Ngoc Binh A1 - Dang, Duc Hanh Y1 - 2016/03/26/ N2 - Trong phát tri?n ph?n m?m, ki?m th? là m?t quy trình quan trong và không th? thi?u ?? phát tri?n m?t h? th?ng ph?n m?m tin c?y và có ch?t l??ng cao. ?? có th? gi?m chi phí, t?ng ch?t l??ng cho ho?t ??ng ki?m th? m?t h??ng ti?p c?n cho ki?m th? ph?n m?m là k? thu?t ki?m th? d?a trên mô hình (Model-Based Tesing - MBT). K? thu?t này cho phép sinh t? ??ng các ca ki?m th? và th?c thi t? ??ng các ca ki?m th? t? mô hình. Trong nghiên c?u này, chúng tôi t?p trung vào nghiên c?u quy trình sinh t? ??ng (Automated Test Cases Generation) các ca ki?m th? t? mô hình v?i h??ng ti?p c?n mô hình hóa mi?n chuyên bi?t (Domain-Specific Modeling - DSM) cho v?n ?? sinh các ca ki?m th? t? ??c t? ca s? d?ng (Use Case Specification). ??c t? ca s? d?ng ???c vi?t trong tài li?u ??c t? ph?n m?m b?ng ngôn ng? t? nhiên vì v?y mà vi?c sinh t? ??ng các ca ki?m th? t? ??c t? này v?n còn nhi?u thách th?c. Ch?t l??ng sinh các ca ki?m th? ph? thu?c vào tiêu chí ph? các ca ki?m th?. Nghiên c?u này c?a chúng tôi t?p chung vào nghiên c?u và ?? xu?t ph??ng pháp sinh t? ??ng các ca ki?m th? t? ??c t? ca s? d?ng v?i ?? ph? các ca ki?m th? ??t ???c các tiêu chí ph? ki?m th? TI - Ki?m th? d?a trên mô hình v?i cách ti?p c?n mô hình hóa mi?n chuyên bi?t M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab2140 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2140/ A1 - Chung, Jae Du A1 - Lee, Yang Koo A1 - Vu, Thi Hong Nhan Y1 - 2006/// TI - A Spatiotemporal Data Management and Mining System Architecture AV - none T2 - Korea Spatial Information System Society ER - TY - CONF ID - SisLab1308 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1308/ A1 - Collier, Nigel A1 - Paster, Ferdinand A1 - Tran, Mai Vu Y1 - 2014/// TI - The Impact of Near Domain Transfer on Biomedical Named Entity Recognition SP - 11 M2 - Gothenburg, Sweden AV - none EP - 20 T2 - 2014: the 5th International Workshop on Health Text Mining and Information Analysis (EACL) ER - TY - JOUR ID - SisLab188 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/188/ A1 - Collier, Nigel A1 - Tran, Mai Vu A1 - Le, Hoang Quynh A1 - Ha, Quang Thuy A1 - Oellrich, Anika A1 - Rebholz-Schuhmann, Dietrich Y1 - 2013/// JF - PLOS ONE SN - 1932-6203 TI - Mining Phenotype Candidates from the Scientific Literature with Diverse Hypothesis Resolution Strategies AV - none ER - TY - CONF ID - SisLab102 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/102/ A1 - Cuong, Le Ba A1 - Pham, Ngoc Hung Y1 - 2012/08/17/ N2 - The model-based approaches are difficult to be applied in practice due to the lack of formal models describing behaviors of systems. This paper proposes a method for generating accurate models of components in order to solve this issue in the context of the component-based systems. The key idea of this method is to generate minimal deterministic finite automata as the accurate models of the corresponding components. For this purpose, the proposed method first computes a set of traces as a regular language of a given component by executing all possible experiments over the alphabet of the component. This method then constructs a regular expression to represent this set. After that, a minimal deterministic finite automaton as an accurate model of the component is generated by applying the Thompson algorithm and some optimized activities. The generated models are useful for the existing model-based approaches, e.g., model checking and model-based testing in improving quality of component-based software. An implemented tool supporting the method and experimental results are also presented. KW - Adaptation models;Automata;Doped fiber amplifiers;Modeling;Software;Unified modeling language;deterministic automata;finite automata;formal verification;object-oriented programming;software quality;Thompson algorithm;black-box components;component alphabet;component-based software quality;component-based systems;formal models;minimal deterministic finite automaton;model checking;model generation;model-based approaches;model-based testing;Thompson algorithm;black-box components;model generation;model-based approaches; TI - A Method for Generating Models of Black-Box Components SP - 217 M2 - Danang, Vietnam AV - none EP - 222 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab3656 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3656/ A1 - Dam, Dinh Hiep A1 - Le, Hoai Nam A1 - Bui, Duy Toan A1 - Nguyen, Ngoc Linh Y1 - 2019/10// N2 - A 3d printing technique is an additive manufacturing technique where 3D objects and parts are made by the addition of multiple layers of material.[1] It is a type of rapid prototyping. The layers are stacked up in a variety of ways depending on the technology being used. It can use a wide range of materials such as ABS, PLA, and composites as well. This technology allows the design of complex components, therefore, avoiding assembly requirements at no additional cost. This paper presents research on 3D printer design with a conveyor belt, which can be applied in industrial applications. Firstly, a CAD model of a 3d printer has been created using SolidWorks. In this step, all the parts of the model are designed and then are assembled in the SolidWorks workbench to create the 3D printer assembly. Then, the electronics board which controls the entire printing process is studied and integrated into the mechanical structure. The electronics board compiles the STL file to a suitable form to carry out the printing process and is connected to the PC using a USB-to-serial converter. Finally, a portable 3D printer is built and tested with various types of models. TI - A Research on Conveyor Belt 3D Printer in Industrial Applications M2 - Hanoi, Vietnam AV - public T2 - International Conference on Engineering Mechanics and Automation (ICEMA) ER - TY - JOUR ID - SisLab2578 UR - http://www.biomedcentral.com/1471-2148/10/99/abstract IS - 1 A1 - Dang, Cao Cuong A1 - Le, Si Quang A1 - Gascuel, Olivier A1 - Le, Sy Vinh Y1 - 2010/04/01/ N2 - The amino acid substitution model is the core component of many protein analysis systems such as sequence similarity search, sequence alignment, and phylogenetic inference. Although several general amino acid substitution models have been estimated from large and diverse protein databases, they remain inappropriate for analyzing specific species, e.g., viruses. Emerging epidemics of influenza viruses raise the need for comprehensive studies of these dangerous viruses. We propose an influenza-specific amino acid substitution model to enhance the understanding of the evolution of influenza viruses. JF - BMC Evolutionary Biology VL - 10 TI - FLU, an Amino Acid Substitution Model for Influenza Proteins SP - subjects AV - none EP - IT ER - TY - JOUR ID - SisLab1298 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1298/ A1 - Dang, Cao Cuong A1 - Le, Sy Vinh A1 - Gascuel, Oliver A1 - Hazes, Bart A1 - Le, Si Quang Y1 - 2014/10/24/ N2 - Amino acid replacement rate matrices are a crucial component of many protein analysis systems such as sequence similarity search, sequence alignment, and phylogenetic inference. Ideally, the rate matrix reflects the mutational behavior of the actual data under study; however, estimating amino acid replacement rate matrices requires large protein alignments and is computationally expensive and complex. As a compromise, sub-optimal pre-calculated generic matrices are typically used for protein-based phylogeny. Sequence availability has now grown to a point where problem-specific rate matrices can often be calculated if the computational cost can be controlled. JF - BMC Bioinformatics SN - 1471-2105 TI - FastMG: a simple, fast, and accurate maximum likelihood procedure to estimate amino acid replacement rate matrices from large data sets AV - none ER - TY - CONF ID - SisLab67 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/67/ A1 - Dang, Cao Cuong A1 - Le, Sy Vinh A1 - Le, Si Quang Y1 - 2009/10// N2 - Amino acid substitution model is a crucial component in protein sequence comparative systems such as protein sequence similarity searching, protein sequence alignment, and protein phylogenetic analysis. Although several general amino acid substitution models have been estimated from large protein databases, they might not be appropriate for analyzing specific species. In this paper, we apply the maximum likelihood approach to all influenza protein sequences to estimate an amino acid substitution model of so-called I09 for influenza viruses. Comparing I09 with fourteen other widely used models, we achieve remarkable results: (1) a likelihood improvement of phylogenetic trees based on I09 compared with other models. Precisely, I09 results in the best likelihood in 436 out of 489 cases tested; (2) tree topologies constructed with I09 and other models are frequently different indicating that the impact of I09 is not only on the likelihood improvement but also in tree topologies; (3) marked differences between I09 and other models revealing that existing models are not be able to capture the amino acid substitution process of influenza viruses. KW - biology computing KW - influenza-specific amino acid substitution model KW - maximum likelihood approach KW - maximum likelihood estimation KW - phylogenetic trees KW - protein databases KW - protein phylogenetic analysis KW - protein sequence alignment KW - protein sequence comparative systems KW - protein sequence similarity searching KW - Proteins KW - tree topologies KW - trees (mathematics) TI - Influenza-specific Amino Acid Substitution Model SP - 19 AV - none EP - 25 T2 - International Conference on Knowledge and Systems Engineering, 2009. KSE '09 ER - TY - JOUR ID - SisLab72 UR - http://bioinformatics.oxfordjournals.org/content/27/19/2758 IS - 19 A1 - Dang, Cao Cuong A1 - Lefort, Vincent A1 - Le, Sy Vinh A1 - Le, Si Quang A1 - Gascuel, Olivier Y1 - 2011/10/01/ N2 - Amino acid replacement rate matrices are an essential basis of protein studies (e.g. in phylogenetics and alignment). A number of general purpose matrices have been proposed (e.g. JTT, WAG, LG) since the seminal work of Margaret Dayhoff and co-workers. However, it has been shown that matrices specific to certain protein groups (e.g. mitochondrial) or life domains (e.g. viruses) differ significantly from general average matrices, and thus perform better when applied to the data to which they are dedicated. This Web server implements the maximum-likelihood estimation procedure that was used to estimate LG, and provides a number of tools and facilities. Users upload a set of multiple protein alignments from their domain of interest and receive the resulting matrix by email, along with statistics and comparisons with other matrices. A non-parametric bootstrap is performed optionally to assess the variability of replacement rate estimates. Maximum-likelihood trees, inferred using the estimated rate matrix, are also computed optionally for each input alignment. Finely tuned procedures and up-to-date ML software (PhyML 3.0, XRATE) are combined to perform all these heavy calculations on our clusters. JF - Bioinformatics VL - 27 TI - ReplacementMatrix: a Web Server for Maximum-Likelihood Estimation of Amino Acid Replacement Rate Matrices SP - 2758 AV - public EP - 2760 ER - TY - JOUR ID - SisLab2958 UR - https://doi.org/10.1186/s12920-018-0336-z IS - 1 A1 - Dang, Cao Cuong A1 - Peón, Antonio A1 - Ballester, Pedro Y1 - 2018/02// N2 - Oncology drugs are only effective in a small proportion of cancer patients. Our current ability to identify these responsive patients before treatment is still poor in most cases. Thus, there is a pressing need to discover response markers for marketed and research oncology drugs. Screening these drugs against a large panel of cancer cell lines has led to the discovery of new genomic markers of in vitro drug response. However, while the identification of such markers among thousands of candidate drug-gene associations in the data is error-prone, an appraisal of the effectiveness of such detection task is currently lacking. JF - BMC Medical Genomics VL - 11 TI - Unearthing new genomic markers of drug response by improved measurement of discriminative power SP - subjects AV - public EP - IT ER - TY - THES ID - SisLab1961 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1961/ A1 - Dang, Duc Hanh Y1 - 2009/// PB - University of Bremen TI - On Integrating Triple Graph Grammars and OCL for Model-Driven Development M1 - phd AV - none ER - TY - CONF ID - SisLab1964 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1964/ A1 - Dang, Duc Hanh Y1 - 2008/// PB - Springer T3 - LNCS VL - 5214 TI - Triple Graph Grammars and OCL for Validating System Behavior SP - 481 AV - none EP - 483 T2 - The 4th International Conference on Graph Transformations (ICGT) ER - TY - CONF ID - SisLab1968 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1968/ A1 - Dang, Duc Hanh Y1 - 2007/// PB - CEUR-WS.org VL - 262 TI - Validation of System Behavior from an Integrated Semantics of Use Case and Design Models SP - 1 AV - none EP - 5 T2 - The 10th International Conference on Model-Driven Engineering Languages and Systems (MoDELS/Doctoral Symposium) ER - TY - CONF ID - SisLab771 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/771/ A1 - Dang, Duc Hanh A1 - Cabot, Jordi Y1 - 2013/// TI - Automating Inference of OCL Business Rules from User Scenarios AV - none M2 - Bangkok, Thailand T2 - 2013: the 20th Asia-Pacific Software Engineering Conference (APSEC 2013) ER - TY - CONF ID - SisLab441 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_18 A1 - Dang, Duc Hanh A1 - Cabot, Jordi Y1 - 2014/10/09/ TI - On Automating Inference of OCL Constraints from Counterexamples and Examples SP - 219 M2 - Hanoi, Vietnam AV - none EP - 231 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab103 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/103/ A1 - Dang, Duc Hanh A1 - Gogolla, M. Y1 - 2012/08/17/ N2 - Model transformation is an important building block for model-driven approaches. It puts forward a necessity as well as a challenge for validating and verifying transformations. This paper proposes a specification method and an OCL-based framework for model transformations. The approach is based on an integration of Triple Graph Grammars and the Object Constraint Language (OCL) as a formal foundation. The OCL-based transformation framework offers an on-the-fly verification of model transformations and means for transformation quality assurance. KW - Automata;Computational modeling;Grammar;Quality assurance;Strontium;Unified modeling language;formal specification;graph grammars;program verification;software quality;OCL-based framework;model transformation;model-driven approach;object constraint language;on-the-fly verification;specification method;transformation quality assurance;transformation validation;transformation verification;triple graph grammar;Graph Transformation;Invariant;Model Transformation;OCL;Pre- and Postcondition;Validation and Verification; TI - An Approach for Quality Assurance of Model Transformations SP - 223 M2 - Danang, Vietnam AV - none EP - 230 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab1952 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1952/ IS - 1 A1 - Dang, Duc Hanh A1 - Gogolla, Martin Y1 - 2016/// PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - An OCL-based Framework for Model Transformations SP - 42 AV - none EP - 57 ER - TY - CONF ID - SisLab1965 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1965/ A1 - Dang, Duc Hanh A1 - Gogolla, Martin Y1 - 2008/// PB - Springer T3 - LNCS VL - 5421 TI - On Integrating OCL and Triple Graph Grammars SP - 124 AV - none EP - 137 T2 - International Conference on Models in Software Engineering (MODELS) ER - TY - CONF ID - SisLab1962 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1962/ A1 - Dang, Duc Hanh A1 - Gogolla, Martin Y1 - 2009/// PB - IEEE Computer Society TI - Precise Model-Driven Transformations Based on Graphs and Metamodels SP - 307 AV - none EP - 316 T2 - The 7th International Conference on Software Engineering and Formal Methods (SEFM) ER - TY - CONF ID - SisLab1955 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1955/ A1 - Dang, Duc Hanh A1 - Truong, Anh Hoang A1 - Dang, Van Hung Y1 - 2016/// PB - IOS Press T3 - FAIA VL - 286 TI - On Model Finding with Constraint Patterns SP - 279 AV - none EP - 290 T2 - Proc. 5th Int. Conf. on New Trends in Software Methodologies, Tools and Technique (SoMeT) ER - TY - JOUR ID - SisLab1959 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1959/ IS - 17 A1 - Dang, Duc Hanh A1 - Truong, Anh Hoang A1 - Gogolla, Martin Y1 - 2010/// JF - Journal of Universal Computer Science VL - 16 SN - 0948-695x TI - Checking the Conformance between Models Based on Scenario Synchronization SP - 2293 AV - none EP - 2312 ER - TY - CONF ID - SisLab1960 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1960/ A1 - Dang, Duc Hanh A1 - Truong, Anh Hoang A1 - Gogolla, Martin Y1 - 2010/// PB - Springer T3 - LNCS VL - 6252 TI - On Scenario Synchronization SP - 97 AV - none EP - 111 T2 - 8th International Conference on Automated Technology for Verification and Analysis (ATVA) ER - TY - JOUR ID - SisLab2531 UR - http://www.jcsce.vnu.edu.vn/index.php/jcsce/article/view/45 IS - 3 A1 - Dang, Hai A1 - Nguyen, Thanh A1 - Pham, Minh Trang A1 - Dang, Cuong A1 - Hoang, Phuc A1 - Pham, Son A1 - Le, Vinh A1 - Le, Quang A1 - Phan, Hang A1 - Do, Dong A1 - Nguyen, Duc Y1 - 2014/// N2 - We present some preliminary results on the whole genome analysis of an anonymous Kinh Vietnamese (KHV) individual that was deeply sequenced to 34-fold using the Illumina sequencing technology. The sequenced genome covered 99.85 of the human reference genome (GRCh37). We discovered (1) 3408825 single polymorphism nucleotides (SNPs) of which 41396 (1.2) were novel, (2) 654024 short indels of which 35263 (5.4) were novel, i.e. not present in the dbSNP and 1000 genomes project databases. We also detected 10611 large SVs (the length ? 100bp) of four types, i.e. large indels (90.6), the inter-chromosomal translocations (3.1), the inversions (3.4) and the intra-chromosomal translocations (2.9). This study is our initial step toward large-scale projects on Vietnamese population. JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 30 TI - Preliminary results on the whole genome analysis of a Vietnamese individual AV - none ER - TY - CONF ID - SisLab3655 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3655/ A1 - Dang, Hai Ninh A1 - Nguyen, Quang Tan A1 - Nguyen, Ngoc Linh Y1 - 2019/10// N2 - Today, brushless DC motors (BLDCM) have been used in many applications replacing to brushed DC motors. Compared to brushed DC motors, BLDCM offer improved reliability, longer life, smaller size, and lower weight. Besides, BLDCM have become more popular in applications where efficiency is a critical concern and, generally speaking, a BLDCM is considered to be a high-performance motor capable of providing large amounts of torque over a wide speed range. In this paper, a research on sensorless control method which can drive a BLDCM smoothly from standstill to high speeds without position or speed sensors is carried out. Initial rotor position as well as speed of motor at a low speed range is estimated based on the inductance variation principle while at higher speed, the back EMF technique is applied. This sensorless control algorithm is modeled and simulated with MATLAB/SIMULINK software to verify the abilities of the method. The drive control scheme has been implemented on a single-chip controller (STM32F103) and experimental results reveal that the control procedure can work smoothly. TI - A Research on Sensorless Control of Brushless DC Motor using Inductance Variation Technique M2 - Hanoi, Vietnam AV - public T2 - International Conference on Engineering Mechanics and Automation (ICEMA5) ER - TY - JOUR ID - SisLab4049 UR - https://ieeexplore.ieee.org/document/9189765 A1 - Dang, Nam Khanh A1 - Ahmed, Akram Ben A1 - Abdallah, Abderazek Ben A1 - Tran, Xuan Tu Y1 - 2020/09// N2 - Through-Silicon-Via (TSV) based 3D Integrated Circuits (3D-IC) are one of the most advanced architectures by providing low power consumption, shorter wire length and smaller footprint. However, 3D-ICs confront lifetime reliability due to high operating temperature and interconnect reliability, especially the Through-Silicon-Via (TSV), which can significantly affect the accuracy of the applications. In this paper, we present an online method that supports the detection and correction of lifetime TSV failures, named IaSiG. By reusing the conventional recovery method and analyzing the output syndromes, IaSiG can determine and correct the defective TSVs. Results show that within a group, $R$ redundant TSVs can fully localize and correct $R$ defects and support the detection of $R+1$ defects. Moreover, by using $G$ groups, it can localize up to GxR and detect up to Gx(R+1) defects. An implementation of IaSiG for 32-bit data in eight groups and two redundancies has a worst-case execution time (WCET) of 5,152 cycles while supporting at most 16 defective TSVs (50\% localization). By integrating IaSiG onto a 3D Network-on-Chip, we also perform a grid-search based empirical method to insert suitable numbers of redundancies into TSV groups. The empirical method takes the operating temperature as the factor of accelerated fault due to the fact that temperature is one of the major issues of 3D-ICs. The results show that the proposed method can reduce the number of redundancies from the uniform method while still maintaining the required Mean Time to Failure. PB - IEEE JF - IEEE Access VL - 8 SN - 2169-3536 TI - A thermal-aware on-line fault tolerance method for TSV lifetime reliability in 3D-NoC systems SP - 166642 AV - restricted EP - 166657 ER - TY - JOUR ID - SisLab3940 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3940/ A1 - Dang, Nam Khanh A1 - Ahmed, Akram Ben A1 - Okuyama, Yuichi A1 - Abdallah, Abderazek Ben Y1 - 2017/10// N2 - 3D-Network-on-Chips exploit the benefits of Network-on-Chips and 3D-Integrated Circuits allowing them to be considered as one of the most advanced and auspicious communication methodologies. On the other hand, the reliability of 3D-NoCs, due to the vulnerability of Through Silicon Vias, still remains as a major problem. Most of the existing techniques rely on correcting the TSV defects by using redundancies or employing routing algorithms. Nevertheless, they are not suitable for TSV-cluster defects as they can either lead to costly area and power consumption overheads or they may result in non-minimal routing paths; thus, posing serious threats to the system reliability and overall performance. In this work, we present a scalable and low-overhead TSV usage and design method for 3D-NoC systems where the TSVs of a router can be utilized by its neighbors to deal with the cluster open defects. An adaptive online algorithm is also introduced to assist the proposed system to immediately work around the newly detected defects without using redundancies. The experimental results show the proposal ensure less than 2% of the routers being disabled, even with 50% of the TSV clusters defects. The performance evaluations also demonstrate unchanged performances for real applications under 5% of cluster defects. PB - IEEE JF - IEEE Transactions on Emerging Topics in Computing SN - 2168-6750 TI - Scalable design methodology and online algorithm for TSV-cluster defects recovery in highly reliable 3D-NoC systems AV - public ER - TY - INPR ID - SisLab3557 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3557/ A1 - Dang, Nam Khanh A1 - Ahmed, Akram Ben A1 - Tran, Xuan Tu Y1 - 2019/10/01/ N2 - This paper presents ?On Communication Through- Silicon-Via Test? (OCTT), an ECC-based method to localize faults without halting the operation of TSV-based 3D-IC systems. OCTT consists of two major parts named Statistical Detector and Isolation and Check. While Statistical Detector could detect open and short defects in TSVs that work without interrupting data transactions, the Isolation and Check algorithm enhances the ability to localize fault position. The Monte-Carlo simulations of Statistical Detector show x2 increment in the number of detected faults when compared to conventional ECC-based techniques. While Isolation and Ch eck helps localize the number of defects up to x4 and x5 higher. In addition, the worst case execution time is below 65,000 cycles with no performance degradation for testing which could be easily integrated into real-time applications. TI - An on-communication multiple-TSV defects detection and localization for real-time 3D-ICs M2 - Singapore AV - none T2 - 2019 IEEE 13th International Symposium on embedded Multicore/Manycore Systems-on-Chip (IEEE MCSoC-2019) ER - TY - JOUR ID - SisLab3947 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3947/ IS - 1-2 A1 - Dang, Nam Khanh A1 - Meyer, Michael A1 - Ahmed, Akram Ben A1 - Abdallah, Abderazek Ben A1 - Tran, Xuan Tu Y1 - 2020/04/23/ N2 - Through-Silicon-Via (TSV) is one of the most promising technologies to realize 3D Integrated Circuits (3D-ICs).However, the reliability issues due to the low yield rates and the sensitivity to thermal hotspots and stress issues arepreventing TSV-based 3D-ICs from being widely and efficiently used. To enhance the reliability of TSV connections, usingerror correction code to detect and correct faults automatically has been demonstrated as a viable solution. This paperpresents a 2D Parity Product Code (2D-PPC) for TSV fault-tolerance with the ability to correct one fault and detect, at least,two faults. In an implementation of 64-bit data and 81-bit code-word, 2D-PPC can detect over 71 faults, on average. Itsencoder and decoder decrease the overall latency by 38.33% when compared to the Single Error Correction Double ErrorDetection code. In addition to the high detection rates, the encoder can detect 100% of its gate failures, and the decodercan detect and correct around 40% of its individual gate failures. The squared 2D-PPC could be extended using orthogonalLatin square to support extra bit correction JF - REV Journal on Electronics and Communications VL - 10 TI - 2D Parity Product Code for TSV Online Fault Correction and Detection SP - 11 AV - public EP - 21 ER - TY - JOUR ID - SisLab3942 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3942/ A1 - Dang, Nam Khanh A1 - Meyer, Michael A1 - Ahmed, Akram Ben A1 - Abdallah, Abderazek Ben A1 - Tran, Xuan Tu Y1 - 2020/// N2 - As one of the most promising technologies to realize 3D Integrated Circuits (3D-ICs), Through-Silicon-Via (TSV) acts as the inter-layer link inside 3D Networks-on-Chip. However, the reliability issues due to the low yield rates and the sensitivity to thermal hotspots and stress issues are preventing TSV-based 3D-ICs from being widely and efficiently used. To ensure the correctness of TSV connections at run-time, detecting multiple (clustering) defects is an important feature. While Error Correction Codes are limited by a certain number of detectable faults, using Built-In-Self-Test (BIST) prevents the system from operating normally during the test time. This paper first presents a Parity Product Code (PPC) with the ability to correct one fault and detect, at least, two faults. Second, we present extended PPC (EPPC) to detect multiple defects within the links of Networks-on-Chip by using two or more additional matrices. Furthermore, we present the distance-aware version of EPPC to detect multiple defects by using only one extra matrix. The results show that the distance-aware EPPC can detect 100% of clustering defects and multiple random defects within two and three cycles, respectively. The performance evaluation for Network-on-Chip testing also shows no degradation while providing an extremely short response time (2-3 cycles). JF - IEEE Access VL - 8 SN - 2169-3536 TI - A non-blocking non-degrading multiple defects link testing method for 3D-Networks-on-Chip SP - 59571 AV - public EP - 59589 ER - TY - INPR ID - SisLab3668 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3668/ A1 - Dang, Thanh Hai Y1 - 2019/// PB - VNU University of Engineering and Technology TI - SKIPHOS: non-kinase specific phosphorylation site prediction with random forests and amino acid skip-gram embeddings M1 - technical_report AV - public ER - TY - CONF ID - SisLab2077 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2077/ A1 - Dang, Thanh Hai A1 - Engelen, Kristof A1 - Meysman, Pieter A1 - Marchal, Kathleen A1 - Verschoren, Alain A1 - Laukens, Kris Y1 - 2009/// TI - Conditional Random Fields feature subset selection based on Genetic Algorithms for phosphorylation site prediction SP - 7 AV - none EP - 12 T2 - The 2009 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab2970 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2970/ A1 - Dang, Thanh Hai A1 - Le, Hoang Quynh A1 - Nguyen, Minh Trang A1 - Vu, Tien Sinh Y1 - 2018/// PB - Oxford University Press JF - Bioinformatics SN - 1460-2059 TI - D3NER: Biomedical named entity recognition using CRF-biLSTM improved with fine-tuned embeddings of various linguistic information AV - none ER - TY - CONF ID - SisLab2079 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2079/ A1 - Dang, Thanh Hai A1 - Lee, Wonjun A1 - Ha, Quang Thuy Y1 - 2008/// TI - A pageranking based method for identifying characteristic genes of a disease SP - 1496 AV - none EP - 1499 T2 - IEEE International Conference on Networking, Sensing and Control (ICNSC) ER - TY - JOUR ID - SisLab2086 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2086/ IS - 3 A1 - Dang, Thanh Hai A1 - Nguyen, Dai Thanh A1 - Pham, Thi Minh Trang A1 - Dang, Cao Cuong A1 - Hoang, Kim Phuc A1 - Pham, Bao Son A1 - Le, Sy Vinh A1 - Le, Si Quang A1 - Phan, Thi Thu Hang A1 - Do, Duc Dong Y1 - 2014/// N2 - We present some preliminary results on the whole genome analysis of an anonymous Kinh Vietnamese (KHV) individual that was deeply sequenced to 34-fold using the Illumina sequencing technology. The sequenced genome covered 99.85% of the human reference genome (GRCh37). We discovered (1) 3408825 single polymorphism nucleotides (SNPs) of which 41396 (1.2%) were novel, (2) 654024 short indels of which 35263 (5.4%) were novel, i.e. not present in the dbSNP and 1000 genomes project databases. We also detected 10611 large SVs (the length ? 100bp) of four types, i.e. large indels (90.6%), the inter-chromosomal translocations (3.1%), the inversions (3.4%) and the intra-chromosomal translocations (2.9%). This study is our initial step toward large-scale projects on Vietnamese population. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 30 SN - 0866-8612 TI - Preliminary results on the whole genome analysis of a Vietnamese individual SP - 31 AV - none EP - 35 ER - TY - JOUR ID - SisLab1476 UR - http://www.springer.com/life+sciences/journal/12038 IS - 1 A1 - Dang, Thanh Hai A1 - Nguyen, Dai Thanh A1 - Pham, Thi Minh Trang A1 - Le, Si Quang A1 - Phan, Thi Thu Hang A1 - Dang, Cao Cuong A1 - Hoang, Kim Phuc A1 - Nguyen, Huu Duc A1 - Do, Duc Dong A1 - Bui, Quang Minh A1 - Pham, Bao Son A1 - Le, Sy Vinh Y1 - 2015/03/01/ N2 - We here present the first whole genome analysis of an anonymous Kinh Vietnamese (KHV) trio whose genomes were deeply sequenced to 30-fold average coverage. The resulting short reads covered 99.91% of the human reference genome (GRCh37d5). We identified 4,719,412 SNPs and 827,385 short indels that satisfied the Mendelian inheritance law. Among them, 109,914 (2.3%) SNPs and 59,119 (7.1%) short indels were novel. We also detected 30,171 structural variants of which 27,604 (91.5%) were large indels. There were 6,681 large indels in the range 0.1?100 kbp occurring in the child genome that were also confirmed in either the father or mother genome. We compared these large indels against the DGV database and found that 1,499 (22.44%) were KHV specific. De novo assembly of high-quality unmapped reads yielded 789 contigs with the length ?300 bp. There were 235 contigs from the child genome of which 199 (84.7%) were significantly matched with at least one contig from the father or mother genome. Blasting these 199 contigs against other alternative human genomes revealed 4 novel contigs. The novel variants identified from our study demonstrated the necessity of conducting more genome-wide studies not only for Kinh but also for other ethnic groups in Vietnam. PB - Springer JF - Journal of Bioscience VL - 40 SN - 0250-5991 TI - Whole Genome Analysis of a Vietnamese Trio SP - 114 AV - none EP - 123 ER - TY - JOUR ID - SisLab2073 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2073/ IS - 24 A1 - Dang, Thanh Hai A1 - Van Leemput, Koenraad A1 - Verschoren, Alain A1 - Laukens, Kris Y1 - 2008/// PB - Oxford University Press JF - Bioinformatics VL - 24 SN - 1460-2059 TI - Prediction of kinase-specific phosphorylation sites using conditional random fields SP - 2857 AV - none EP - 2864 ER - TY - INPR ID - SisLab3245 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3245/ A1 - Dang, Thi Huong Giang A1 - Vuong, Quang Huy A1 - Pham, Minh Trien Y1 - 2018/12/14/ N2 - Máy bay không ng??i lái ???c s? quan tâm l?n trong các ?ng d?ng nông nghi?p thông minh, giám sát ch?t l??ng công trình, h? tr? tìm ki?m c?u h? c?u n?n... và ??c bi?t là ?ng d?ng trong quân s?. Trong bài báo cáo này, chúng tôi t?p trung nghiên c?u v?n ?? l?p k? ho?ch bay cho UAV trong không gian 3-D bi?t tr??c. Chúng tôi s? d?ng gi?i thu?t là t?i ?u b?y ?àn (PSO) c?i ti?n ?? t?i ?u qu? ??o chuy?n ??ng c?a UAV, ??ng th?i, so sánh v?i gi?i thu?t PSO truy?n th?ng và gi?i thu?t di truy?n GA ?? th?y ???c tính ?u vi?t c?a PSO c?i ti?n. Qu? ??o t?i ?u c?a UAV có cánh c? ??nh ???c ??nh ngh?a nh? m?t hàm ?a m?c tiêu bao g?m các ?o?n th?ng, ???ng cong và ?? cao. Các gi?i thu?t ???c phát tri?n và so sánh thông qua b?n ?? th?c t? c?a m?t s? t?nh ? Vi?t Nam. K?t qu? ban ??u cho th?y ti?m n?ng áp d?ng các gi?i thu?t này trong vi?c t?i ?u qu? ??o bay cho UAV. V? t??ng lai, các gi?i thu?t này s? ti?p t?c ???c c?i ti?n nh?m gi?m th?i gian t?i ?u h??ng ??n bài toán l?p qu? ??o bay th?i gian th?c cho UAV TI - C?i Ti?n Thu?t Toán T?i ?u Hoá B?y ?àn Cho Bài Toán L?p Qu? ??o Bay C?a UAV Trong Không Gian Ba Chi?u SP - 32 M2 - Hanoi, Vietnam AV - public EP - 37 T2 - 2018 REV-ECIT: National Conference on Electronics, Communications and Information Technology ER - TY - CONF ID - SisLab448 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_50 A1 - Dang, Tran Thai A1 - Nguyen, Thi Xuan Huong A1 - Le, Anh Cuong A1 - Huynh, Van Nam Y1 - 2014/10/09/ TI - Automatically Learning Patterns in Subjectivity Classification for Vietnamese SP - 629 M2 - Hanoi, Vietnam AV - none EP - 640 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - JOUR ID - SisLab1490 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1490/ IS - 13 A1 - Dang, Trung Kien A1 - Worring, Marcel A1 - Bui, The Duy Y1 - 2015/// N2 - In scene investigation, creating a video log captured using a handheld camera is more convenient and more complete than taking photos and notes. By introducing video analysis and computer vision techniques, it is possible to build a spatio-temporal representation of the investigation. Such a representation gives a better overview than a set of photos and makes an investigation more accessible. We develop such methods and present an interface for navigating the result. The processing includes (i) segmenting a log into events using novel structure and motion features making the log easier to access in the time dimension, and (ii) mapping video frames to a 3D model of the scene so the log can be navigated in space. Our results show that, using our proposed features, we can recognize more than 70 percent of all frames correctly, and more importantly find all the events. From there we provide a method to semi-interactively map those events to a 3D model of the scene. With this we can map more than 80 percent of the events. The result is a 3D event log that captures the investigation and supports applications such as revisiting the scene, examining the investigation itself, or hypothesis testing. PB - Springer JF - Multimedia Tools and Applications VL - 74 SN - 1380-7501 TI - Building 3D Event Logs for Video Investigation SP - 4617 AV - none EP - 4639 ER - TY - CONF ID - SisLab4251 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4251/ A1 - Dang, Van Do A1 - Hoang, Xuan Tung A1 - Kim-Khoa, Nguyen Y1 - 2020/08// N2 - Recently, fog computing, which can be done in proximity to data sources, has emerged as a solution to provide low-latency Quality-of-Service (QoS) for IoT services in complement to centralized cloud with unlimited computing resources. Optimized service deployment on both cloud and fog environments is challenging due to their heterogeneity. Prior works mainly focus on mapping service functions and dependencies directly to physical network. In this paper, we propose a multi-layer mapping mechanism that efficiently deploys multiple IoT services to the appropriate virtual networks in physical infrastructure. We design greedy-based algorithms for solving this NP-hard problem with two phases executed sequentially. Experimental results show our proposed solution can reduce upto 80% of the total service cost compared to the state-of-the-art solutions. TI - Optimization of IoT Service Deployment In Multi-Layered Cloud-Fog Environment AV - public T2 - IEEE Globecom 2020 ER - TY - CONF ID - SisLab4211 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4211/ A1 - Dang, Van Do A1 - Hoang, Xuan Tung A1 - Tran, Mai A1 - Nguyen, Kim Khoa Y1 - 2020/// TI - Optimization of IoT Service Deployment In Multi-Layered Cloud-Fog Environment AV - none T2 - IEEE Global Communications Conference ER - TY - JOUR ID - SisLab209 UR - http://stacks.iop.org/2043-6262/1/i=1/a=013001 IS - 1 A1 - Dao, Dzung Viet A1 - Nakamura, Koichi A1 - Tung, Bui Thanh A1 - Sugiyama, Susumu Y1 - 2010/// N2 - MEMS (micro-electro-mechanical systems) technology has undergone almost 40 years of development, with significant technology advancement and successful commercialization of single-functional MEMS devices, such as pressure sensors, accelerometers, gyroscopes, microphones, micro-mirrors, etc. In this context of MEMS technology, this paper introduces our studies and developments of novel micro/nano-mechanical sensors and actuators based on silicon- on-insulator (SOI)-MEMS technology, as well as fundamental research on piezoresistive effects in single-crystal silicon nanowires (SiNWs). In the first area, novel mechanical sensors, such as 6-DOF micro-force moment sensors, multi-axis inertial sensors and micro-electrostatic actuators developed with SOI-MEMS technology will be presented. In the second area, we have combined atomic-level simulation and experimental evaluation methods to explain the giant piezoresistive effect in single crystalline SiNWs along different crystallographic orientations. This discovery is significant for developing more highly sensitive and miniaturized mechanical sensors in the near future. JF - Advances in Natural Sciences: Nanoscience and Nanotechnology VL - 1 TI - Micro/nano-Mechanical Sensors and Actuators based on SOI-MEMS Technology SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab1518 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1518/ A1 - Dao, Ngoc Thanh A1 - Bui, Quang Hung A1 - Nguyen, Hai Chau A1 - Nguyen, Van Vuong Y1 - 2016/03/26/ N2 - National Spatial Data Infrastructure (NSDI) is the backbone of the development of e-government for a country. Since 2011, Vietnam began to pay attention to NSDI. Till now, the is no significant progress in implementation of NSDI except a common research between World Bank and Ministry of Natural Resources and Environment on strategic planning of NSDI and another research on making policy for building NSDI. In this paper, we present our research on the construction of the Local SDI (LSDI) for the Northeast and the Northwest of Vietnam. Our hypothesis is that the success of this LSDI will be a good lesson for building NSDI in the future. The reason why we selected the Northeast and Northwest because it is a large area with a total area of approximately 115,700km2 that is nearly 1/3 of Vietnam. Moreover, the Northeast and the Northwest comprehensively contain of topographical and morphological characteristics of nature, economics and society of Vietnam. NSDI is considered consisting of seven components: (i) spatial data; (ii) standards; (iii) Access to data; (iv) technology; (v) policy ? legislation; (vi) organization ? institution; (vii) partnership. In this research we only focused on four technical components which are spatial data, standards, access to data and technology. We collected spatial data from three sources: (i) existing spatial data and framework spatial data from Government and Local Government; (ii) existing remote sensing data from the NASA, USGS; (iii) Update remote sensing data from MODIS/NPP ground station at our university. We used open source platforms for building LSDI. Regarding to the access to data, we have organized spatial data in a data warehouse architecture to develop BI (Business Intelligence) tools. A pilot tool is for automatically generating annual reports on 43 indicators of sustainable development issued by the Prime Minister. For the future work, we will evaluate this LSDI from the viewpoints of end-users from government, local government and citizens. TI - Building the Local Spatial Data Infrastructure for the Northeast and Northwest of Vietnam M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1902 UR - http://iccasa.org/2016/show/program-final A1 - Dao, Thi Huong A1 - Le, Hong Anh A1 - Truong, Ninh Thuan Y1 - 2016/11/25/ TI - An approach to analyzing execution preservation in Java program refactoring AV - none M2 - Vietnam T2 - 5th EAI International Conference on Context-Aware Systems and Applications ER - TY - CONF ID - SisLab1519 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1519/ A1 - Dao, Thi Huong A1 - Le, Hong Anh A1 - Truong, Ninh Thuan Y1 - 2016/03/26/ N2 - In software development, refactoring is a process that improves the system internal structure without altering its external behavior. Applying design patterns, which is the common reusable solution of several kinds of problems, is widely adopted in refactoring. And, the combination of refactoring and design patterns has established a revolution approach in software re-engineering. It, however, raises a challenged issue that the software model may not preserve some cer- tain behavioral properties. In this paper, we propose a new approach to checking the consistency between original model and its evolution (the model after applying design pattern). To this aim, we employ Unified Modeling Language (UML) to modeling system, and Object Constraint Language (OCL) to represent the system requirement. In additional, we construct a set of consistent rule which uses to checking whether the system can preserve its behavior or not. We also illus- trate the checking approach in a case study of Adaptive Road Traffic Control System. TI - An approach to verifying consistency of software refactoring process M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1465 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1465/ A1 - Dao, Thi Huong A1 - To, Van Khanh A1 - Truong, Ninh Thuan A1 - Chu, Quang Ton A1 - Nguyen, Viet Ha Y1 - 2015/09// N2 - Encapsulation in object oriented models refers to the bundling of data with the methods that operate on that data, it is used to hide the values or state of a structured data objects and preventing unauthorized parties' direct access to them. Access control mechanism in information systems is the process of mediating every request to resources and determining whether the request should be granted or denied. This paper proposes an approach allowing us to integrate access control mechanisms in object oriented paradigm. More detail, we define the access permissions between methods of classes in a UML model and providing a prototype to verify if the program implementation satisfied their access permission constraints. KW - Unified Modeling Language;authorisation;data encapsulation;object-oriented methods;UML model;access control mechanisms;access permission constraints;encapsulation;object oriented models;structured data objects;Access control;Encapsulation;Medical services;Object oriented modeling;Software;Unified modeling language;Access control;UML class diagram;specification;verification TI - Integrating and Checking Access Permissions in Object Oriented Models SP - 49 M2 - Ho Chi Minh city, Vietnam AV - none EP - 53 T2 - NICS: 2nd National Foundation for Science and Technology Development Conference on Information and Computer Science ER - TY - CONF ID - SisLab2655 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2655/ A1 - Dao, Thi Huong A1 - Trinh, Thanh Binh A1 - Truong, Ninh Thuan Y1 - 2017/10// N2 - Refactoring is a technique that transforms a software to new one in order to improve the internal structure without affect its external behaviors. Although its benefits, refactoring is not widely adopted in practice as it is attainable. One of the biggest challenges to refactoring has been the hapless lack of tool support that may be raised some issues such as tedious, time-consuming and error-prone. We present in this paper a tool called CVT (Consistency Validator Tool) that used to support to checking consistency in model refactoring. The CVT is composed of three essential functions which are well-formedness checking, translate OCL to FOL and behavioral consistency checking. We are most interested in OCL to FOL translation process that make use of Abstract Syntax Tree (AST) as an intermediate syntax. We have also carried out some experimental studies in order to evaluate the effectiveness of this tool. TI - A Tool Support for Checking Consistency in Model Refactoring M2 - Hue, Vietnam AV - none T2 - KSE: the 2017 International Conference on Knowledge and Systems Engineering ER - TY - INPR ID - SisLab4662 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4662/ A1 - Dinh, Bao Minh A1 - Duong, Van Minh A1 - Nguyen, Quoc Bao A1 - Ngo, Sy Trung A1 - Nguyen, Truong Son N2 - Robot ngày càng tr? nên ph? bi?n trong ngành d?ch v? và du l?ch. ??c bi?t, trong b?i c?nh c?a d?ch COVID-19, robot ti?p tân ?ã tr? thành gi?i pháp giúp h?n ch? ti?p xúc và gi?m nguy c? lây nhi?m. Là d?ch v? t? v?n và h??ng d?n khách hàng, công vi?c ti?p tân ?òi h?i robot ph?i có kh? n?ng t??ng tác linh ho?t v?i khách hàng. Bài báo trình bày m?t tr? lý ?o h? tr? robot ti?p tân khách s?n t??ng tác v?i khách hàng d?a trên c? s? lý thuy?t ?Service Robot Acceptance Model" (sRAM). Tr? lý ?o ???c xây d?ng trên n?n t?ng Dialogflow c?a Google. K?t qu? ki?m th? v?i nhi?u k?ch b?n h?i tho?i cho th?y h? th?ng có ?? chính xác cao, có ?? tr? th?p và có th? áp d?ng trong th?c t?. M?t ph?n k?t qu? th?c nghi?m ???c ghi hình và trình bày t?i: K?t qu? th?c nghi?m TI - Tr? lý ?o cho Robot ti?p tân Khách s?n D?a trên Lý thuy?t sRAM và n?n t?ng Dialogflow AV - public T2 - H?i ngh? Qu?c gia l?n th? XXIV v? ?i?n t?, Truy?n thông và Công ngh? Thông tin ER - TY - INPR ID - SisLab4661 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4661/ A1 - Dinh, Bao Minh A1 - Tran, Duc Son A1 - Nguyen, The Huong A1 - Do, Nam A1 - Le, Minh Hoang A1 - Hoang, Van Xiem N2 - Các h? th?ng robot tay máy ?óng m?t vai trò r?t quan tr?ng trong s?n xu?t công nghi?p hi?n ??i. Vi?c ?ng d?ng robot tay máy trong ??i s?ng hàng ngày s? giúp ích con ng??i r?t nhi?u, ví d? nh? t? ??ng hóa hoàn toàn quy trình phân phát thu?c và th?c ph?m cho b?nh nhân nhi?m COVID-19. ?ng d?ng robot tay máy trong ??i s?ng ?òi h?i m?t cách th?c giúp ng??i dùng d? dàng t??ng tác v?i robot. Trong bài báo này, m?t ph??ng pháp t??ng tác v?i robot tay máy s? d?ng trí tu? nhân t?o ?a th? th?c k?t h?p gi?ng nói-hình ?nh ???c xây d?ng. Bài báo c?ng ?? xu?t ph??ng pháp Chessboard Calibration giúp nâng cao ?? chính xác trong vi?c xác ??nh v? trí th?c thi c?a robot tay máy. M?t robot tay máy 4 b?c t? do (4-DOF) ch? t?o b?ng ph??ng pháp in 3D s? ???c s? d?ng ?? th?c thi và ?ánh giá mô hình trí tu? nhân t?o ?a th? th?c xây d?ng ???c. K?t qu? th?c thi h? th?ng ???c ghi hình và trình bày t?i: https://youtu.be/RHgAyHXMH6I TI - MAI_ARM: Robot Tay Máy Thông Minh s? d?ng Trí tu? nhân t?o ?a th? th?c AV - public T2 - H?i ngh? Qu?c gia l?n th? XXIV v? ?i?n t?, Truy?n thông và Công ngh? Thông tin ER - TY - CONF CY - Cham ID - SisLab2501 UR - http://dx.doi.org/10.1007/978-3-319-56660-3_43 A1 - Dinh, Ngoc Thi A1 - Vo, Dinh Hieu A1 - Vu, Thi Dao A1 - Nguyen, Viet Ha Y1 - 2017/// PB - Springer International Publishing TI - Generation of Test Data Using Genetic Algorithm and Constraint Solver SP - 499 M2 - Kanazawa, Japan AV - none EP - 513 T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab112 UR - http://10.1109/rivf.2012.6169827 A1 - Dinh, Phu Hung A1 - Nguyen, Ngoc Khuong A1 - Le, Anh Cuong Y1 - 2012/03/01/ N2 - Word Sense Disambiguation (WSD) is the task of determining the right sense of a word depending on the context it appears. Among various approaches developed for this task, statistical machine learning methods have been showing their advantages in comparison with others. However, there are some cases which cannot be solved by a general statistical model. This paper proposes a novel framework, in which we use the rules generated by transformation based learning (TBL) to improve the performance of a statistical machine learning model. This framework can be considered as a combination of a rule-based method and statistical based method. We have developed this method for the problem of Vietnamese WSD and achieved some promising results. KW - Accuracy;Context;Data models;Learning systems;Machine learning;Niobium;Training;learning (artificial intelligence);natural language processing;statistical analysis;Vietnamese word sense disambiguation;general statistical model;statistical machine learning model;transformation based learning;transformation rule learning; TI - Combining Statistical Machine Learning with Transformation Rule Learning for Vietnamese Word Sense Disambiguation SP - 1 M2 - Ho Chi Minh city AV - none EP - 6 T2 - 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) ER - TY - CHAP ID - SisLab2653 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2653/ A1 - Dinh, Quang Huy A1 - Ma, Thi Chau A1 - Bui, The Duy A1 - Nguyen, Trong Toan A1 - Nguyen, Dinh Tu Y1 - 2011/// N2 - Predicting the face of an unidentified individual from its skeletal remains is a difficult matter. Obviously, if the soft tissue thicknesses at every location at the skull are known, we can easily rebuild the face from the skull model. Thus, the problem turns out to be predicting the soft tissue thicknesses for any given skull. With the rapid development of the computer, different techniques are being used in the community for prediction tasks and in recent years the concept of neural networks has emerged as one of them. The principal strength of the neural network is its ability to find patterns and irregularities as well as detecting multi-dimensional non-linear connections in data. In this paper, we propose a method of applying neural networks to predict the soft tissue thicknesses for facial reconstruction. We use the distances between anthropometric locations at the skull as input, and the soft tissue thicknesses as output, as this format is suitable for many machine learning mechanisms. These data is collected and measured from candidates using the Computed Tomography (CT) technique. PB - SpringerLink TI - Facial soft tissue thicknesses prediction using anthropometric distances SP - 117 AV - none EP - 126 T2 - New Challenges for Intelligent Information and Database Systems ER - TY - CONF ID - SisLab2061 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2061/ A1 - Dinh, Thi Ngoc A1 - Vo, Dinh Hieu A1 - Nguyen, Viet Ha Y1 - 2016/// TI - A Technique for Generating Test Data using Genetic Algorithm AV - none M2 - Vietnam T2 - The 2016 International Conference on Advanced Computing and Applications ER - TY - JOUR ID - SisLab4775 UR - https://ieeexplore.ieee.org/abstract/document/9828233 A1 - Dinh, Tran Hiep A1 - Nguyen, Linh Trung Y1 - 2022/07/18/ N2 - Mask mandate has been applied in many countries in the last two years as a simple but effective way to limit the Covid-19 transmission. Besides the guidance from authorities regarding mask use in public, numerous vision-based approaches have been developed to aid with the monitoring of face mask wearing. Despite promising results have been obtained, several challenges in vision-based masked face detection still remain, primarily due to the insufficient of a quality dataset covering adequate variations in lighting conditions, object scales, mask types, or occlusion levels. In this paper, we investigate the effectiveness of a lightweight masked face detection system under different lighting conditions and the possibility of enhancing its performance with the employment of an image enhancement algorithm and an illumination awareness classifier. A dataset of human subjects with and without face masks in different lighting conditions is first introduced. An illumination awareness classifier is then trained on the collected dataset, the labeling of which is processed automatically based on the difference in detection accuracy when an image enhancement algorithm is taken into account. Experimental results have shown that the combination of the masked face detection system with the illumination awareness and an image enhancement algorithm can boost the system performance to up to 8.6%, 7.4%, and 8.5% in terms of Accuracy, F1-score, and AP-M, respectively. PB - IEEE JF - 2022 IEEE 16th International Symposium on Medical Information and Communication Technology (ISMICT) SN - 978-1-6654-7251-7 TI - Masked Face Detection with Illumination Awareness SP - 1 AV - public EP - 6 ER - TY - JOUR ID - SisLab3454 UR - http://www.ieiespc.org/ A1 - Dinh, Trieu Duong A1 - Le Dinh, Minh A1 - Byeungwoo, Jeon A1 - Hoang, Van Xiem Y1 - 2019/// N2 - View synthesis like Depth-image-based-rendering (DIBR) plays a significant role in 3D content creation for 3D-TV. However, perceptual errors introduced by current view synthesis often result in severe distortions in synthesized images. In this paper, we propose a novel view synthesis fusion (VSF) method which adaptively exploits temporal and disparity correlations to improve the quality of the synthesized picture. The proposed VSF method defines a robust correlation assessment metric for fusing several pre-created virtual view candidates. Unlike conventional methods, the proposed fusion algorithm is applied for both hole and non-hole areas. Experimental results show significantly outperforming peak signal-to noise ratio (PSNR) and subjective visual quality by the proposed method compared to other conventional methods. PB - The Institute of Electronics and Information Engineers (IEIE) JF - IEIE Trans. on Smart Processing and Computing SN - 2287-5255 TI - A Novel Fusion Method for 3D-TV View Synthesis Using Temporal and Disparity Correlations AV - public ER - TY - JOUR ID - SisLab3455 UR - https://www.mdpi.com/journal/algorithms/indexing A1 - Dinh, Trieu Duong A1 - Phi, Cong Huy A1 - Hoang, Van Xiem Y1 - 2019/// N2 - Distributed video coding (DVC) is an attractive and promising solution for low complexity constrained video applications, such as wireless sensor networks or wireless surveillance systems. In DVC, the visual quality consistency is one of the most important issues to evaluate the performance of a DVC codec. However, it is the fact that the quality of the decoded frames achieved in most recent DVC codecs is not consistent and it is varied with high quality fluctuation. To solve the problem, in this paper, we propose a novel DVC solution named JEM based DVC (JEM-DVC), which can provide not only higher performance compared to the traditional DVC solutions but also effective scheme for the quality consistency control. In the proposed JEM-DVC solution, we first employ several advanced techniques provided in the Joint exploration model (JEM) of the future video coding standard (FVC) to effectively improve the performance of JEM-DVC codec. Then, for consistent quality control, we propose two novel methods named key frame quantization (KF-Q) and Wyner-Zip frame quantization (WZF-Q) which determine the optimal values of quantization parametter (QP) and quantization matrix (QM) applied for the key and WZ frame coding, respectively. Unlike the conventional approaches, the optimal values of QP and QM are adaptively controlled and updated for every key and WZ frames to guarantee the consistent video quality for the proposed codec. Our proposed JEM-DVC is the first DVC codec in literature employing JEM coding technique, then all results presented in this paper are new. Experimental results show that the proposed JEM-DVC significantly outperforms the relevant DVC benchmarks, notably the DISCOVER DVC and the recent H.265/HEVC based DVC, in terms of both Peak signal-to-noise ratio (PSNR) performance and consistent visual quality. PB - MDPI JF - MDPI algorithms SN - 1999-4893 TI - A Novel Consistent Quality Driven for JEM based Distributed Video Coding SP - 1 AV - public EP - 10 ER - TY - JOUR ID - SisLab2638 UR - https://doi.org/10.1007/s40595-017-0094-4 A1 - Divrood, Ali Rezaei A1 - Ha, Quang Thuy A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son Y1 - 2017/02/15/ N2 - It is well known that any Boolean function in classical propositional calculus can be learned correctly if the training information system is good enough. In this paper, we extend that result for description logics. We prove that any concept in any description logic that extends ALCALC with some features amongst I (inverse roles), QkQk (qualified number restrictions with numbers bounded by a constant k), and SelfSelf (local reflexivity of a role) can be learned correctly if the training information system (specified as a finite interpretation) is good enough. That is, there exists a learning algorithm such that, for every concept C of those logics, there exists a training information system such that applying the learning algorithm to it results in a concept equivalent to C. For this result, we introduce universal interpretations and bounded bisimulation in description logics and develop an appropriate learning algorithm. We also generalize common types of queries for description logics, introduce interpretation queries, and present some consequences. PB - Springer Berlin Heidelberg JF - Vietnam Journal of Computer Science VL - 2017 SN - 2196-8888; Online 2196-8896 TI - On the possibility of correct concept learning in description logics SP - 1 AV - public EP - 12 ER - TY - CONF ID - SisLab80 UR - http://link.springer.com/chapter/10.1007%2F978-3-642-34630-9_24 A1 - Divroodi, Ali Rezaei A1 - Ha, Quang Thuy A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son Y1 - 2012/11/28/ TI - On C-Learnability in Description Logics SP - 230 M2 - Ho Chi Minh, Vietnam AV - public EP - 238 T2 - The 4th International Conference on Computational Collective Intelligence (ICCCI 2012) ER - TY - JOUR ID - SisLab3154 UR - https://link.springer.com/article/10.1007%2Fs40595-017-0094-4 IS - 1 A1 - Divroodi, Ali Rezaei A1 - Ha, Quang Thuy A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son Y1 - 2018/02// N2 - It is well known that any Boolean function in classical propositional calculus can be learned correctly if the training information system is good enough. In this paper, we extend that result for description logics. We prove that any concept in any description logic that extends ALC with some features amongst I (inverse roles), Qk (qualified number restrictions with numbers bounded by a constant k), and Self (local reflexivity of a role) can be learned correctly if the training information system (specified as a finite interpretation) is good enough. That is, there exists a learning algorithm such that, for every concept C of those logics, there exists a training information system such that applying the learning algorithm to it results in a concept equivalent to C. For this result, we introduce universal interpretations and bounded bisimulation in description logics and develop an appropriate learning algorithm. We also generalize common types of queries for description logics, introduce interpretation queries, and present some consequences. PB - Vietnam Journal of Computer Science JF - Vietnam Journal of Computer Science VL - 5 SN - 2196-8888 TI - On the possibility of correct concept learning in description logics SP - 3 AV - public EP - 14 ER - TY - JOUR ID - SisLab1981 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1981/ IS - 2 A1 - Do, Anh Tuan A1 - Ngo, Thi Duyen A1 - Bui, The Duy Y1 - 2016/// N2 - One of the most challenge tasks in building a face recognition system is how to represent and extract good quality features from face images. The difficulties come from variations in head poses, illumination conditions, and facial expression. Although many researches have been done, most were carried on under constrained environments. Most researches concentrated on dealing with frontal faces. Processing non-frontal faces encounters more challenge because some features on faces become occluded dramatically. In this paper, we propose two models to extract features from non-frontal faces in the range of 30o to 90o. First, we use the Viola-Jones detection method to identify the pose of face images. Then, we use Active Appearance Model (AAM) to interpret face images. Lastly, the models are trained to know how to fit new images. To improve the efficiency of fitting, we apply a nonlinear parameter update method. Experimental results show that using nonlinear fitting for non-frontal can increase the accuracy of the AAM fitting, compared with some previous methods. JF - Journal of Automation and Control Engineering VL - 4 SN - 2301-3702 TI - Feature Extraction for Non-frontal Faces SP - 171 AV - public EP - 176 ER - TY - RPRT ID - SisLab2894 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2894/ A1 - Do, Duc Dong Y1 - 2017/// N2 - Protein structure prediction (PSP) is considered as one of the most long-standing and challenging problem in bioinformatic. In this paper, we present an efficient ant colony optimization algorithm to predict the protein structure on three-dimensional face-centered cubic lattice coordinates, using hydrophobic-polar (HP) model and MiyazawaJernigan (MJ) model to calculate the free energy. The reinforcement learning information is expressed in the k-order Markov model, the heuristic information is determined based on the increase of the total energy. On a set of benchmark proteins, the results show a remarkable efficiency of our algorithm by comparing with the state-of-the-art algorithms. PB - VNU-UET Technical Report VL - TR2017-FIT-002 M1 - technical_report TI - A Novel and Efficient Ant Colony Optimization Algorithm for Protein 3D Structure Prediction AV - public EP - 7 ER - TY - CONF ID - SisLab2080 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2080/ A1 - Do, Duc Dong A1 - Dinh, Quang Huy A1 - Dang, Thanh Hai A1 - Laukens, Kris A1 - Hoang, Xuan Huan Y1 - 2012/// TI - AcoSeeD: An ant colony optimization for finding optimal spaced seeds in biological sequence search SP - 204 AV - none EP - 211 T2 - International Conference on Swarm Intelligence ER - TY - CONF ID - SisLab2948 UR - http://www.ismict2018.org A1 - Do, Duc Dong A1 - Thai Dinh, Phuc A1 - Vu, Thi Ngoc Anh A1 - Nguyen, Linh Trung Y1 - 2018/03/26/ N2 - Protein structure prediction is considered as one of the most long-standing and challenging problem in bioinformatics. In this paper, we present an ef?cient ant colony optimization algorithm to predict the protein structure on three-dimensional face-centered cubic lattice coordinates, using the hydrophobic?polar model and the Miyazawa-Jernigan model to calculate the free energy. The reinforcement learning information is expressed in the k-order Markov model, and the heuristic information is determined based on the increase of the total energy. On a set of benchmark proteins, the results show a remarkable ef?ciency of our algorithm in comparison with several state-of-the-art algorithms. TI - An Ef?cient Ant Colony Optimization Algorithm for Protein Structure Prediction SP - 28 M2 - Sydney, Australia AV - public EP - 33 T2 - 12th International Symposium on Medical Information and Communication Technology (ISMICT) ER - TY - CONF ID - SisLab1597 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1597/ A1 - Do, Duc Dong A1 - Tran, Ngoc Ha A1 - Dang, Thanh Hai A1 - Dang, Cao Cuong A1 - Hoang, Xuan Huan Y1 - 2015/10// N2 - Global aligning two protein-protein interaction networks is an essentially important task in bioinformatics computational biology field of study. It is a challenging and widely studied research topic in recent years. Accurately aligned networks allow us to identify functional modules of proteins and/ororthologous proteins from which unknown functions of a protein can be inferred. We here introduce a novel efficient heuristic global network alignment algorithm called FASTAn, including two phases: the first to construct an initial alignment and the second to improve such alignment by exerting a local optimization repeated procedure. The experimental results demonstrated that FASTAn outperformed the stateof-the-art global network alignment algorithmnamely SPINAL in terms of both commonly used objective scoresand the run-time. Keywords: FASTAn, Heuristic algorithm, Biological network alignment, Protein-protein interaction networks TI - An efficient algorithm for global alignment of protein-protein interaction networks SP - subjects M2 - Ho Chi Minh city, Vietnam AV - none EP - IT T2 - The 2015 International Conference Advanced Technologies for Communications (ATC) ER - TY - CONF ID - SisLab3122 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3122/ A1 - Do, Khac Phong A1 - Ma, Thi Chau A1 - Cao, Hoang Giang A1 - Nguyen, Thi Thu An Y1 - 2018/10/23/ N2 - Mesh deformation is a fundamental technique for geometric modeling which is applied successfully in a wide range of applications from shape design to computer animation. Normally, the deformation transferred from one actor to another actor is based on all vertices and triangles of a mesh, leading to timeconsuming in terms of a 3D sequential model. To address this problem, we propose a region-based deformation transfer that automatically identifies several regions with the largest displacement in time series, and then exploits those deformations of such regions. Our experimental results demonstrate that we can obtain the similar deformed mesh in spite of using approximately 50% ? 60% of the facial area, therefore the time decrease significantly for deformation transfer step. TI - Region-based deformation transfer M2 - Ho Chi Minh city, Vietnam AV - public T2 - 2018 The 5th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - JOUR ID - SisLab1480 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1480/ A1 - Do, Khac Phong A1 - Nguyen, Ba Tung A1 - Nguyen, Xuan Thanh A1 - Bui, Quang Hung A1 - Tran, Nguyen Le A1 - Nguyen, Thi Nhat Thanh A1 - Vuong, Van Quynh A1 - Le, Thanh Ha Y1 - 2015/// PB - KIPS JF - Journal of Information Processing Systems SN - 1976-913X TI - Spatial Interpolation and Assimilation Methods for Satellite and Ground Meteorological Data in Vietnam AV - none ER - TY - CONF ID - SisLab2761 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2761/ A1 - Do, Thuy A1 - Pham, Hoang Giang A1 - Tran, Xuan Khoi A1 - Ha, Minh Hoang A1 - Do, Bach Y1 - 2017/11// N2 - This article studies the complex staff rescheduling problem arising in the context of Lai Chau hydropower station. Currently, rescheduling task is implemented manually by agreement of switching shifts among workers or by a scheduler. It is a complex and time-consuming operation but obtained schedules have been far below the expectation of the staff as they in general violate working rules and contract agreements. In this research, we propose an approach based on Mixed Integer Programming to support the scheduler solving the problem. Our model includes multiple objectives which minimize the number of changed shifts and the number of affected employees. Experimental results show the effectiveness of our method. TI - Solving the staff rescheduling problem in Lai Chau hydropower station M2 - Hanoi, Vietnam AV - public T2 - The 4th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab1501 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1501/ A1 - Do, Van Duy A1 - To, Van Khanh Y1 - 2016/04/29/ TI - SAT Encoding d?a trên m?u tìm ki?m gi?i trò ch?i Loogic Hitori AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - JOUR ID - SisLab186 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/186/ IS - 1 A1 - Do Duc, Dong A1 - Le, Sy Vinh A1 - Hoang, Xuan-Huan Y1 - 2013/// JF - Swarm Intelligence VL - 7 SN - 1935-3812 TI - ACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony Problem SP - 63 AV - none EP - 77 ER - TY - JOUR ID - SisLab184 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/184/ IS - 1 A1 - Do Duc, Dong A1 - Le, Sy Vinh A1 - Hoang, Xuan-Huan Y1 - 2013/// JF - Swarm Intelligence VL - 7 TI - ACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony Problem SP - 63 AV - none EP - 77 ER - TY - JOUR ID - SisLab4817 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4817/ A1 - Doan, Quang Manh A1 - Dinh, Tran Hiep A1 - Nguyen, Linh Trung A1 - Nguyen N, Diep A1 - Singh, Avinash Kumar A1 - Lin, Chin-Teng N2 - Smoothing filters are widely used in EEG signal processing for noise removal while preserving important features. Unlike common approaches in the time domain, a recent effective algorithm using the Upscale and Downscale Representation (UDR) technique has been introduced to process the signal in the image domain. The idea of UDR is to visualize the input with an appropriate line width, convert it to a binary image, and then smooth it by skeletonizing the signal object to a unit width and projecting it back to the time domain. We propose in this paper a cascaded UDR (CUDR) where the interested signal is filtered twice. CUDR?s performance is verified on simulated data with added white Gaussian noise and compared with the cascaded arrangement of some conventional techniques. Experimental results have demonstrated the outperformance of CUDR in terms of the fitting error when dealing with noisy signals, especially at a low signal-to-noise ratio. JF - To appear in the 2023 IEEE Statistical Signal Processing Workshop (SSP) proceedings TI - Extended Upscale and Downscale Representation with Cascade Arrangement AV - public ER - TY - CONF ID - SisLab3263 UR - http://scis2018.j-soft.org/program.html A1 - Doan, Van Viet A1 - Nguyen, Duy Hung A1 - Tran, Quoc Long A1 - Nguyen, Do Van A1 - Le, Thanh Ha Y1 - 2018/12/05/ N2 - ?Semantic image segmentation plays a key role in obtaining pixel-level understanding of images. In recent years, researchers have tackled this problem by using deep learning methods instead of traditional computer vision methods (eg [25]). Because of the development of technologies like autonomous vehicles and indoor robots, segmentation techniques, that have not only high accuracy but also the capability of running in real-time on embedded platform and mobile devices, are in high demand. In this work, we have proposed a new convolutional module, named Residual depth-wise separable, and a fast and efficient convolutional neural network for segmentation. The proposed method is compared against other state of the art real-time models. The experiment results illustrate that our method is efficient in computation while achieves state of the art performance in term of accuracy TI - Real-time Image Semantic Segmentation Networks with Residual Depth-wise Separable Blocks M2 - Toyama, Japan AV - public T2 - 2018 Joint 10th International Conference on Soft Computing and Intelligent Systems and 19th International Symposium on Advanced Intelligent Systems in conjunction with Intelligent Systems Workshop ER - TY - CONF ID - SisLab3293 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3293/ A1 - Doan, Van Viet A1 - Nguyen, Duy Hung A1 - Tran, Quoc Long A1 - Nguyen, Do Van A1 - Le, Thanh Ha Y1 - 2018/// TI - Real-time Image Semantic Segmentation Networks with Residual Depth-wise Separable Blocks AV - none T2 - Joint 10th International Conference on Soft Computing and Intelligent Systems and 19th International Symposium on Advanced Intelligent Systems in conjunction with Intelligent Systems Workshop 2018 (SCIS&ISIS2018) ER - TY - JOUR ID - SisLab3990 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3990/ IS - 2 A1 - Du, Phuong Hanh A1 - Duong, Ngoc Son A1 - Nguyen, Ngoc Cuong A1 - Nguyen, Ngoc Hoa Y1 - 2020/03// PB - Research Trend JF - International Journal on Emerging Technologies VL - 11 SN - 2249 ? 8958 TI - A Fast Computation of the Betweenness Centrality in Social Networks SP - 370 AV - none EP - 377 ER - TY - CONF ID - SisLab3479 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3479/ A1 - Du, Phuong Hanh A1 - Nguyen, Hai Chau A1 - Nguyen, Kim Khoa A1 - Nguyen, Ngoc Hoa Y1 - 2018/09// N2 - Closeness centrality is an substantial metric used in large-scale network analysis, in particular social networks. Determining closeness centrality from a vertex to all other vertices in the graph is a high complexity problem. Prior work has a strong focuses on the algorithmic aspect of the problem, and little attention has been paid to the definition of the data structure supporting the implementation of the algorithm. Thus, we present in this paper an efficient algorithm to compute the closeness centrality of all nodes in a social network. Our algorithm is based on (i) an appropriate data structure for increasing the cache hit rate, and then reducing amount of time accessing the main memory for the graph data, and (ii) an efficient and parallel complete BFS search to reduce the execution time. We tested performance of our algorithm, namely BigGraph, with five different real-world social networks and compare the performance to that of current approaches including TeexGraph and NetworKit. Experiment results show that BigGraph is faster than TeexGraph and NetworKit 1.27-2.12 and 14.78-68.21 times, respectively. TI - An Efficient Parallel Algorithm for Computing the Closeness Centrality in Social Network M2 - Da Nang City, Viet Nam AV - public T2 - 2018 the 9th International Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab1520 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1520/ A1 - Du, Phuong Hanh A1 - Nguyen, Hai Chau A1 - Nguyen, Kim Thoa Y1 - 2016/03/26/ N2 - Các h? qu?n tr? c? s? d? li?u (CSDL) truy?n th?ng ch? y?u ???c xây d?ng d?a trên vi?c khai thác các máy tính ??n nhân CPU và thi?t b? l?u tr? ki?u t? tính. Các mô hình này ch?a khai thác ???c h?t nh?ng th? m?nh công ngh? c?a các chip ?a nhân hay nh?ng h? th?ng máy tính c?m và dung l??ng càng ngày càng l?n c?a b? nh? chính. ?? có th? nâng cao ???c hi?u n?ng x? lý truy v?n, nhi?u mô hình x? lý m?i ?ã ???c ??a ra nh? H-Store v?i t? t??ng d?a trên mô hình d? li?u trong b? nh? chính; Map-Reduce k?t h?p Hadoop FileSystem ?? x? lý phân tán, ? T? th?c tr?ng ?ó, lu?n án này h??ng ??n m?c tiêu nghiên c?u, c?i thi?n mô hình x? lý truy v?n v?i lo?i d? li?u không gian chuyên bi?t theo hai h??ng k?t h?p: khai thác t?i ?a không gian b? nh? chính kh? d?ng và phân rã các truy v?n ?? có th? ti?n hành song song trên nhi?u lõi/chip khác nhau. Mô hình th? nghi?m s? ???c ti?n hành d?a trên nh?ng bài toán kinh ?i?n nh? tìm l? trình t?i ?u gi?a hai v? trí ??a lý khác nhau, các truy v?n trên m?ng xã h?i, m?ng IoT, ? TI - Nâng cao hi?u n?ng x? lý truy v?n v?i mô hình d? li?u trong b? nh? M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab2959 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2959/ A1 - Du, Phuong Hanh A1 - Pham, Hai Dang A1 - Nguyen, Ngoc Hoa Y1 - 2018/04// N2 - This paper presents our approach to optimize the performance of both reading and writing concurrent operations on large-scale social network. Here, we focus on the directed, unweighted relationships among members in a social network. It can then be illustrated as a directed, unweighted graph. And determining the relationship between any two members is similar to finding the shortest path between two vertices. With such a large-scale dynamic social network, we face the problem of having concurrent operations from adding or removing edges dynamically while one may ask to determine the relationship between two members. To solve this issue, we propose an efficient parallel method based on (i) utilizing an appropriate data structure, (ii) parallelizing the updating actions and (iii) improving the performance of query processing by both reducing the searching space and computing in multi-threaded parallel. Our method was validated by the datasets from SigMod Contest 2016 and SNAP DataSet Collections with good experimental results compared to other solutions PB - Springer JF - Transactions on Computational Collective Intelligence VL - 29 SN - 2190-9288 TI - An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks SP - 182 AV - none EP - 199 ER - TY - CONF ID - SisLab2676 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2676/ A1 - Du, Phuong Hanh A1 - Pham, Hai Dang A1 - Nguyen, Ngoc Hoa N2 - This paper presents our approach to optimize the concurrent operations on a large-scale social network. Here, we focus on the directed, unweighted relationships among members in a social network. It can then be illustrated as a directed, unweighted graph. With such a large-scale dynamic social network, we face the problem of having concurrent operations from adding or removing edges dynamically while one may ask to determine the relationship between two members. To solve this challenge, we propose an efficient parallel method based on (i) utilizing an appropriate data structure, (ii) optimizing the updating actions and (iii) improving the performance of query processing by both reducing the searching space and computing in multi-threaded parallel. Our method was validated by the datasets from SigMod Contest 2016 and SNAP DataSet Collections with the good experimental results compared to other solutions. VL - 10448 ED - George, A. Papadopoulos ED - Nguyen, Ngoc Thanh TI - An Efficient Parallel Method for Performing Concurrent Operations on Social Networks AV - none EP - 159 Y1 - 2017/06// PB - Springer T3 - Lecture Notes in Artificial Intelligence SN - 978-3-319-67073-7 SP - 148 T2 - ICCCI: Conference on Computational Collective Intelligence Technologies and Applications ER - TY - CONF ID - SisLab2261 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2261/ A1 - Du, Phuong Hanh A1 - Pham, Hai Dang A1 - Nguyen, Ngoc Hoa Y1 - 2016/12/10/ TI - Optimizing the Shortest Path Query on Large-Scale Dynamic Directed Graph SP - 210 AV - none EP - 216 T2 - The 3rd IEEE/ACM International Conference on Big Data Computing, Applications and Technologies ER - TY - JOUR ID - SisLab1727 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1727/ A1 - Du, Phuong Hanh A1 - Pham, Hai Dang A1 - Vu, Ba Duy Y1 - 2015/// PB - Vietnam National University Hanoi JF - VNU Journal of Science SN - 0866-8612 TI - Tr?c quan hoá d? li?u l?n trong ?ng d?ng giám sát và ?i?u khi?n t?p trung AV - none ER - TY - CONF ID - SisLab1841 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1841/ A1 - Du, Phuong Hanh A1 - Vu, Ba Duy A1 - Nguyen, Ngoc Hoa Y1 - 2016/// TI - Tr?c quan hoá d? li?u tr?ng thái giao thông trên n?n Web AV - none M2 - Can Tho, Vietnam T2 - K? y?u H?i th?o Qu?c gia l?n th? 9 v? Nghiên c?u c? b?n và ?ng d?ng công ngh? thông tin (FAIR) ER - TY - CONF ID - SisLab113 UR - http://dx.doi.org/10.1109/rivf.2012.6169861 A1 - Duc, Dong Do A1 - Le, Tri-Thanh A1 - Vu, Trung-Nghia A1 - Dinh, H.Q. A1 - Hoang, Xuan-Huan Y1 - 2012/03/01/ N2 - Gene regulatory activity prediction problem is one of the important steps to understand the significant factors for gene regulation in biology. The advents of recent sequencing technologies allow us to deal with this task efficiently. Amongst these, Support Vector Machine (SVM) has been applied successfully up to more than 80 accuracy in the case of predicting gene regulatory activity in Drosophila embryonic development. In this paper, we introduce a metaheuristic based on genetic algorithm (GA) to select the best parameters for regulatory prediction from transcriptional factor binding profiles. Our approach helps to improve more than 10 accuracy compared to the traditional grid search. The improvements are also significantly supported by biological experimental data. Thus, the proposed method helps boosting not only the prediction performance but also the potentially biological insights. KW - Accuracy;Biological cells;Genetic algorithms;Kernel;Optimization;Support vector machines;biology computing;genetic algorithms;support vector machines;Drosophila embryonic development;GA-SVM;biological experimental data;gene regulation;gene regulatory activity prediction improvement;genetic algorithm;parameter selection;sequencing technologies;support vector machine;transcriptional factor binding profiles; TI - GASVM: A Genetic Algorithm for Improving Gene Regulatory Activity Prediction SP - 1 M2 - Ho Chi Minh city AV - none EP - 4 T2 - 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) ER - TY - JOUR ID - SisLab2762 UR - http://www.jcsce.vnu.edu.vn/index.php/jcsce/article/view/136 IS - 1 A1 - Duong, Duc Tran A1 - Pham, Son Bao A1 - Tan, Hanh Y1 - 2017/08// N2 - In this paper, we investigate the author profiling task for Vietnamese forum posts to predict demographic attributes, such as gender, age, occupation, and location of the author. Although we conducted the experiments on different types of features, including style-based and content-based features, we focus more on analysis the effects of content-based features. We used machine learning approaches to perform classification tasks on datasets we collected from popular forums in Vietnamese. The results show that these kinds of features work well on such a kind of short and free style messages as forum posts, in which, content-based features achieved much better results than style-based features. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 33 SN - 2588-1086 TI - Author Profiling of Vietnamese Forum Posts - An Investigation on Content-based Features AV - public ER - TY - RPRT ID - SisLab2896 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2896/ A1 - Duong, Le Minh A1 - Tran, Van Truong Y1 - 2017/12// N2 - Hi?u su?t c?a các giao th?c t?ng giao v?n trong m?ng không dây ?a b??c (Multihop Wirless Network - MHWN) d?a trên chu?n IEEE 802.11 nh?n ???c nhi?u s? quan tâm c?a các nhà nghiên c?u. R?t nhi?u công trình nghiên c?u ?ã ch? ra r?ng các giao th?c này có hi?u su?t không cao trong MHWN, ??c bi?t là TCP. Ra ??i sau các giao th?c ???c s? d?ng cho m?ng có dây nh? TCP, UDP, giao th?c SCTP ?ã k? th?a ???c nh?ng ?u ?i?m và kh?c ph?c m?t s? nh??c ?i?m c?a các giao th?c truy?n th?ng trên. M?t s? tính n?ng ?i?n hình c?a SCTP có th? k? ??n là multi-homing và congestion control. ?ây là các tính n?ng ???c trang b? nh?m nâng cao hi?u n?ng ho?t ??ng c?a giao th?c. Trong bài báo này, chúng tôi t?p trung vào ?? xu?t gi?i pháp c?i ti?n cho tính n?ng multi-homing và congestion control theo cách ti?p c?n liên t?ng nh?m nâng cao hi?u qu? ho?t ??ng c?a SCTP trong m?ng MHWN. Th? nghi?m mô ph?ng cho th?y SCTP v?i tính n?ng c?i ti?n ho?t ??ng hi?u qu? h?n giao th?c nguyên b?n. PB - VNU-UET Technical Report VL - TR2017-FIT-003 M1 - technical_report TI - C?i ti?n tính n?ng multi-homming và congestion control cho giao th?c SCTP trong m?ng không dây ?a b??c AV - public ER - TY - CONF ID - SisLab2278 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2278/ A1 - Duong, Le Minh A1 - Veque, Veronique A1 - Zitoune, L. Y1 - 2011/04/20/ N2 - Our work concentrates on improving the performance of transport protocols in multihop wireless networks. We present different metrics from link and physic layers to improve the performance of TCP congestion control. This paper introduces a classification of cross layer metrics used to improve the transport level. TI - Cross layer metrics for improving transport protocols in multihop wireless networks M2 - France AV - public T2 - CFIP 2011 - Colloque Francophone sur l Ingénierie des Protocoles (2011) ER - TY - CONF ID - SisLab2280 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2280/ A1 - Duong, Le Minh A1 - Veque, Veronique A1 - Zitoune, L. Y1 - 2012/09// N2 - Transport layer performance in IEEE 802.11 multihop wireless networks (MHWNs) has been greatly challenged by wireless medium characteristics and multihop nature which are the sources of several types of packet loss including collision, random channel errors and route failures. Rate control transport protocols, the candidates for multimedia streaming applications suffer from high loss rates and end-to-end delay in MHWNs. A common research direction is that the rate control mechanisms at transport layer should be aware of MAC layer contention to keep the network load at a reasonable ;evel. In this paper, we introduce a new MAC metric which reflects the contention and congestion levels more accurately. The metric is then used to improve the rate control mechanism of a rate-based transport protocol in MHWNs. The simulation results show that the adapted mechanism introduces significant performance improvement in MHWNs. KW - access protocols;multimedia communication;telecommunication congestion control;transport protocols;wireless LAN;wireless channels;IEEE 802.11 multihop wireless networks;MAC metric;MAC-aware rate control;MHWN;collision;congestion level;multimedia streaming applications;network load;packet loss;random channel errors;rate control transport protocols;route failures;transport layer performance;wireless medium characteristics;Delay;IEEE 802.11 Standards;Receivers;Throughput;Topology;Transport protocols TI - MAC-aware rate control for transport protocol in multihop wireless networks SP - 1436 AV - public EP - 1441 T2 - 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC) ER - TY - CONF ID - SisLab2279 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2279/ A1 - Duong, Le Minh A1 - Veque, Veronique A1 - Zitoune, L. Y1 - 2012/08// N2 - Internet predominant transport protocols, such as TCP and TFRC, face performance degradation in Multihop Wireless Networks (MHWNs) because of the high loss and link failure rates. Many solutions have been proposed to improve the transport layer operation. These solutions are either based on network state estimation or use information from MAC layer (called MAC metrics) in a cross-layer manner to better comprehend the network state. In this paper, we define a new MAC metric called Medium Access Delay (MAD) to better reflect the network state, and provide a comparative study of MAD over other pertinent MAC metrics, their expected usage and measurement methods at MAC layer. We also investigate the behaviors of MAC metrics through several experiments in order to reveal their effectiveness in reflecting network events such as contention, collision and loss. TI - A Medium Access Delay MAC aware Metric for Multihop Wireless Networks AV - public T2 - Wireless Communications and Mobile Computing Conference (IWCMC) ER - TY - CONF ID - SisLab2281 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2281/ A1 - Duong, Le Minh A1 - Zitoune, L. A1 - Veque, Veronique Y1 - 2013/09// N2 - Transport layer performance in IEEE 802.11 multihop wireless networks (MHWNs) has been greatly challenged by wireless medium characteristics and multihop nature which induce several types of packet loss including collision, random channel errors and route failures. In this paper, we propose a novel rate control scheme, called Bi-Metric Rate Control (BMRC), which regulates efficiently the source rate in MHWNs. BMRC?s design is based on two MAC metrics: the Medium Access Delay used to detect the network contention level, and the Average Transmission Time used to estimate the effective packet sending rate by which the network will not be overloaded. The simulation results show that the adapted mechanism introduces significant performance improvement in terms of fairness, packet loss rate and delay in MHWNs. KW - protocols;telecommunication control;telecommunication standards;wireless LAN;BMRC;IEEE 802.11;MHWN;average transmission time;bimetric rate control;effective packet sending rate estimation;medium access delay;multihop wireless networks;network contention level;packet loss rate;random channel errors;rate-based protocols;route failures;transport layer performance;Delays;Network topology;Packet loss;Throughput;Topology TI - Improvement for Rate-Based Protocols in Multihop Wireless Networks SP - 1 AV - public EP - 6 T2 - 2013 IEEE 78th Vehicular Technology Conference (VTC Fall) ER - TY - INPR ID - SisLab4530 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4530/ A1 - Duong, Ngoc Son A1 - Du, Phuong Hanh A1 - Nguyen, Ngoc Cuong A1 - Nguyen, Ngoc Hoa Y1 - 2021/08// PB - Science and Information (SAI) JF - International Journal of Advanced Computer Science and Applications (IJACSA) SN - 2156-5570 TI - A Graph Reduction Method for Improving the Computation of Betweenness Centrality in Large-Scale Graphs AV - none ER - TY - CHAP ID - SisLab2257 UR - http://dx.doi.org/10.1007/978-3-319-31277-4_25 A1 - Duong, Tran Duc A1 - Pham, Bao Son A1 - Tan, Hanh Y1 - 2016/02/27/ N2 - This paper reports the results of author profiling task for Vietnamese forum posts to identify the personal traits, such as gender, age, occupation, and location of the author using content-based features. Experiments were conducted on the different types of features, including stylometric features (such as lexical, syntactic, structural features) as well as content-based features (the most important words) to compare the performance and on the data sets we collected from the various forums in Vietnamese. Three learning methods, consisting of Decision Tree, Bayes Network, Support Vector Machine (SVM), were tested and the SVM achieved the best results. The results show that these kinds of features work well on such a kind of short and free style messages as forum posts, in which, content-based features yielded much better results than stylometric features. PB - Springer International Publishing M1 - 642 TI - Using Content-Based Features for Author Profiling of Vietnamese Forum Posts SP - 287 AV - none EP - 296 T2 - Recent Developments in Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1498 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1498/ A1 - Duong, Tuan Anh A1 - Sam, Duc Vu A1 - Pham, Ngoc Hung Y1 - 2016/04/29/ TI - Ph??ng pháp và công c? ki?m th? t? ??ng cho các ?ng d?ng C/C++ AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab2681 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2681/ A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2017/07/21/ N2 - Wireless sensor networks are composed of many sensor nodes limited to residual energy. The sensor nodes are randomly scattered within in the ranger monitoring and sending - receiving data by radio waves. The measured data often contains the same information, and sending to base station causes the waste of energy of sensor nodes and the risk of congestion. According to the statistics, the energy consumed by transceiver radio signals is many times greater than the energy consumes to process other tasks of sensor node including the calculation on the sensor node. In this paper, we propose algorithms installed on the sensor nodes to monitor non-cyclical target fixed, which base on the fluctuation of the target when it exceeds the threshold. Moreover, algorithm control sensor nodes measures just in time fluctuations exceeded targets need to measure. Keywords? adaptive tracking, data fusion, ATTS-DF, WSNs TI - ATTS-DF: Adaptive Tracking Solution to the Target for Data Fusion in Wireless Sensor Networks SP - 526 M2 - Ho Chi Minh City, Vietnam AV - public EP - 531 T2 - IEEE International Conference on System Science and Engineering, ICSSE2017 ER - TY - CONF ID - SisLab1612 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1612/ A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2015/10// N2 - When using multiple sensor nodes in wireless sensor networks (WSNs) for monitoring (measuring) parameters of the target and sending the result to the base station (BS), data redundancy is an inevitable problem. The measured data often contains the same information, and sending redundant data to BS causes the waste of energy of sensor nodes and the risk of congestion. Multi-sensor data fusion in WSNs is a technology of gathering and processing data applied from node to BS. It improves the performance of surveillance systems by allowing the obtained sensed information from multiple sensor nodes aggregated to one unified format data packet to send to BS to make decision. In this paper, we propose a solution namely DF-AMS (Data Fusion - Average Median Sampling) for sampling and fusing data from the sensor nodes in the cluster to optimize the energy conservation of sensor nodes in clusters and cluster head node. TI - DF-AMS: Proposed solutions for multi-sensor data fusion in wireless sensor networks SP - 1 M2 - Ho Chi Minh city, Vietnam AV - none EP - 6 T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab2682 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2682/ A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2017/10/19/ N2 - Abstract? When using multiple sensor nodes in wireless sensor networks (WSNs) for monitoring (or measuring) parameters of the target and sending the result to the base station (BS), data redundancy is an inevitable problem. The measured data often contains the same information, and sending redundant data to BS causes the waste of energy of sensor nodes and the risk of congestion. Multi-sensor data fusion in WSNs is a technology of gathering and processing data applied from node to BS. It improves the performance of surveillance systems by allowing the obtained sensed information from multiple sensor nodes aggregated to one unified format data packet to send to BS to make decision. In this paper, we propose a solution namely DF-SWin for sampling sensor node in the cluster to optimize the energy conservation of sensor nodes in clusters and cluster head. Keywords? DF-SWin, sliding window, data fusion, WSNs TI - DF-SWin: Sliding Windows for Multi-Sensor Data Fusion in Wireless Sensor Networks SP - 62 M2 - Hue, Vietnam AV - public EP - 67 T2 - The 9th International Conference, Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab2224 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2224/ IS - 2 A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2016/// N2 - Wireless sensor networks are often composed of many sensor nodes, they are powered by batteries with limited capacity . The sensor nodes are randomly scattered within in the ranger monitoring and send ? receiver data using radio waves. Many research projects had demonstrated the consumption of battery power by the data transceiver occupy large compared to the calculation on the sensor node. In this paper, we propose energy saving solutions of nodes in a cluster by only choosing some nodes in the cluster to track the target and transmit this data to cluster head nodes. We based on the location of the sensor nodes in the cluster compare with the location of target and cluster head nodes to perform this selection. The effectiveness of the proposed solutions will be evaluated based on the number of sensor nodes are selected considering the number of nodes in the cluster, this is the base for the effectiveness of energy saving as well as the cluster nodes. Keywords: Target tracking; multi-sensor data fusion, WSNs, ETR-DF. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - Target tracking solution for multi-sensor data fusion in wireless sensor networks SP - 63 AV - public EP - 71 ER - TY - CONF ID - SisLab1613 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1613/ A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2015/// TI - ?? xu?t gi?i pháp ti?n x? lý ?? t?ng h?p d? li?u nhi?u c?m bi?n trong m?ng c?m bi?n không dây AV - none T2 - the 8th National Conference on Fundamental and Applied IT Research ER - TY - CONF ID - SisLab2982 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2982/ A1 - Duong, Viet Huy A1 - Nguyen, Dinh Viet Y1 - 2014/10/30/ N2 - Hi?n nay, ??i v?i m?ng c?m bi?n không dây (Wireless Sensor Networks) k? thu?t phân c?m và s? d?ng nút ch? c?m (cluster head) ?? tham gia ??nh tuy?n ???c xem là m?t trong nh?ng gi?i pháp t?i ?u n?ng l??ng cho m?ng. Tuy nhiên, k?t h?p phân nhóm trong ??nh tuy?n v?i gi?i pháp t?ng h?p d? li?u (data fusion ho?c data aggregation) nhi?u nút c?m bi?n trong nhóm ?ó có th? ??t hi?u qu? t?t h?n n?a v? ti?t ki?m n?ng l??ng. Trong bài báo này, chúng tôi ?? xu?t gi?i pháp DF-Tab ?? t?ng h?p d? li?u nhi?u c?m bi?n trong m?ng c?m bi?n không dây có phân c?m và mô ph?ng b?ng NS2 gi?i thu?t DF-Tab v?i c?u hình m?ng c?m bi?n t??ng t? gi?i thu?t LEACH. Theo k?t qu? mô ph?ng, so v?i k? thu?t LEACH, gi?i pháp DF-Tab ?ã ti?t ki?m ???c 25%-40% n?ng l??ng c?a nút CH. TI - ?? xu?t gi?i pháp t?ng h?p d? li?u nhi?u c?m bi?n trong m?ng c?m bi?n không dây. SP - 50 M2 - Vi?t Nam AV - none EP - 55 T2 - H?i th?o Qu?c gia l?n th? XVII M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông ER - TY - CONF ID - SisLab2237 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2237/ A1 - Duong, Viet Huy A1 - Nguyen, Duy Tan A1 - Ho, Duc Ai A1 - Nguyen, Dinh Viet Y1 - 2014/// N2 - M?ng c?m bi?n không dây bao g?m nhi?u nút c?m bi?n s? d?ng ???ng truy?n không dây, th??ng ???c r?i ng?u nhiên trong vùng c?n giám sát, th?i gian ho?t ??ng c?a m?i nút ph? thu?c vào dung l??ng ngu?n pin d? tr?. D? li?u mà các nút c?m bi?n thu th?p ???c c?n ???c truy?n ??n m?t nút ?ích; có th? có nhi?u nút c?m bi?n cùng g?i v? nút ?ích d? li?u liên quan ??n m?t tham s? c?a ??i t??ng c?n giám sát. ?? tr?m ?ích nh?n ???c thông tin ph?n ánh ?úng b?n ch?t s? ki?n x?y ra t? các nút c?m bi?n ??ng th?i h?n ch? t?i ?a các d? li?u d? th?a (do cùng thông tin) truy?n ?i trong m?ng gây tiêu t?n n?ng l??ng vô ích và nguy c? ngh?n m?ng, t?ng h?p d? li?u là m?t trong nh?ng l?a ch?n ?? gi?i quy?t v?n ?? ?ó. Trong bài báo này, chúng tôi ?? xu?t quy trình và mô hình ?ng d?ng l ý thuy?t t?p thô ?? t?ng h?p d? li?u nhi?u c?m bi?n trong m?ng c?m bi?n không dây. VL - 4 SN - 978-604-913-300-8 TI - Ti?p c?n ph??ng pháp t?ng h?p d? li?u nhi?u c?m bi?n trong m?ng c?m bi?n không dây b?ng lý thuy?t t?p thô SP - 668 AV - none EP - 677 T2 - H?i ngh? Khoa h?c Công ngh? Qu?c gia l?n th? VII v? Nghiên c?u c? b?n và ?ng d?ng Công ngh? thông tin (FAIR) ER - TY - CONF ID - SisLab3278 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3278/ A1 - Fernandez, Facundo A1 - Gaul, David A1 - Jones, Christina A1 - Monge, Maria Eugenia A1 - Paine, Martin A1 - Tran, Quoc Long A1 - McDonald, John Y1 - 2015/// VL - 250 TI - Phenotyping of early stage ovarian cancer by mass spectrometry imaging and untargeted metabolomics AV - none T2 - ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY ER - TY - JOUR ID - SisLab1469 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1469/ IS - 16351 A1 - Gaul, David A1 - Mezencev, Roman A1 - Tran, Quoc Long A1 - Jones, Christina M. A1 - Benigno, Benedict A1 - Gray, Alexander A1 - Fernandez, Facundo A1 - McDonald, John F. Y1 - 2015/// PB - Nature Publishing Group JF - Scientific Reports VL - 5 SN - 2045-2322 TI - Highly-Accurate Metabolomic Detection of Early-Stage Ovarian Cancer AV - none ER - TY - CONF ID - SisLab1521 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1521/ A1 - Giang, Thanh Trung A1 - Tran, Dang Hung Y1 - 2016/03/26/ N2 - M?c dù các nghiên c?u v? ung th? ?ang di?n ra nh?ng các ph??ng pháp ?i?u tr? hi?n có là r?t h?n ch? v? s? l??ng và hi?u qu?, ngoài ra quy?t ??nh ?i?u tr? cho các b?nh nhân v?n là m?t v?n ?? khó kh?n. Vi?c thành l?p các phân nhóm giúp tr? giúp ra quy?t ??nh ch? y?u v?n d?a trên các lo?i d? li?u riêng bi?t. Tuy nhiên, vi?c phân tích d? li?u b?nh nhân ?a chi?u d?a trên nhi?u s? ?o ??c tr?ng phân t? khác nhau nh?: bi?u th?c Gene, DNA Methylation, bi?u th?c miRNA có th? giúp phát hi?n các ??c ?i?m n?i t?i c?a các kh?i u chính xác h?n. M?t ph??ng pháp giúp tích h?p d? li?u t? nhi?u d?ng ??c t? khác nhau d?a trên ph??ng pháp h?c ?a nhân ??ng th?i k?t h?p v?i vi?c gi?m chi?u d? li?u ???c chúng tôi s? d?ng trong báo cáo này nh?m t?o nên m?t b? d? li?u có tính t?ng quát cao h?n t? nhi?u lo?i bi?u di?n d? li?u khác nhau. Sau khi tích h?p d? li?u, chúng tôi ti?n hành phân c?m b?nh nhân ung th? d?a trên d? li?u ?ã tích h?p và ?ánh giá k?t qu? phân c?m thu ???c. Ngoài ra chúng tôi c?ng ??a ra các g?i ý v? m?t l?a ch?n hàm nhân cho các lo?i d? li?u c?ng nh? các tham s? ?? ??t ???c k?t qu? phân c?m t?t nh?t cho mô hình này. TI - Tích h?p d? li?u s? d?ng h?c ?a nhân k?t h?p v?i gi?m chi?u d? li?u th?c hi?n phân c?m các b?nh nhân ung th?. M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1967 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1967/ A1 - Gogolla, Martin A1 - Dang, Duc Hanh A1 - Fabian, Buttner Y1 - 2007/// PB - Springer T3 - LNCS VL - 5088 TI - From Graph Transformation to OCL Using USE SP - 585 AV - none EP - 586 T2 - The 3rd International Conference on Applications of Graph Transformations with Industrial Relevance (AGTIVE) ER - TY - JOUR ID - SisLab4061 UR - https://www.sciencedirect.com/journal/computers-and-operations-research A1 - Ha, Minh Hoang A1 - Nguyen, Tat Dat A1 - Nguyen, Duy Thinh A1 - Pham, Hoang Giang A1 - Do, Thuy A1 - Rousseau, Louis-Martin Y1 - 2020/// N2 - We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles? services, whose service start times at the customer are synchronized. Despite its important real-world application, this problem has rarely been studied in the literature. To solve the problem, we propose a Constraint Programming (CP) model and an Adaptive Large Neighborhood Search (ALNS) in which the design of insertion operators is based on solving linear programming (LP) models to check the insertion feasibility. A number of acceleration techniques is also proposed to significantly reduce the computational time. The computational experiments show that our new CP model finds better solutions than an existing CP-based ALNS, when used on small instances with 25 customers and with a much shorter running time. Our LP-based ALNS dominates the CP-based ALNS, in terms of solution quality, when it provides solutions with better objective values, on average, for all instance classes. This demonstrates the advantage of using linear programming instead of constraint programming when dealing with a variant of vehicle routing problems with relatively tight constraints, which is often considered to be more favorable for CP-based methods. We also adapt our algorithm to solve a well-studied variant of the problem, and the obtained results show that the algorithm provides good solutions as state-of-the-art approaches and improves four best known solutions. PB - Elsevier JF - Computers & Operations Research VL - 124 SN - 0305-0548 TI - A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints AV - public ER - TY - CONF ID - SisLab3674 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3674/ A1 - Ha, Minh Hoang A1 - Vu, Duy Manh A1 - Zinder, Yakov A1 - Nguyen, Trung Thanh Y1 - 2019/// N2 - The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments. TI - On The Capacitated Scheduling Problem with Conflict Jobs M2 - Da Nang AV - public T2 - KSE 2019 ER - TY - INPR ID - SisLab3671 UR - https://link.springer.com/article/10.1007/s10732-019-09431-y A1 - Ha, Quang Minh A1 - Deville, Yves A1 - Pham, Quang Dung A1 - Ha, Minh Hoang Y1 - 2019/// N2 - This paper addresses the traveling salesman problem with drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the completion time for the truck and drone (min-time TSP-D). This problem has gained a lot of attention in the last few years reflecting the recent trends in a new delivery method among logistics companies. To solve the TSP-D, we propose a hybrid genetic search with dynamic population management and adaptive diversity control based on a split algorithm, problem-tailored crossover and local search operators, a new restore method to advance the convergence and an adaptive penalization mechanism to dynamically balance the search between feasible/infeasible solutions. The computational results show that the proposed algorithm outperforms two existing methods in terms of solution quality and improves many best known solutions found in the literature. Moreover, various analyses on the impacts of crossover choice and heuristic components have been conducted to investigate their sensitivity to the performance of our method. PB - Springer JF - Journal of Heuristics TI - A hybrid genetic algorithm for the traveling salesman problem with drone AV - public ER - TY - INPR ID - SisLab1868 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1868/ A1 - Ha, Quang Thuy A1 - Bui, Hong Nhung A1 - Nguyen, Tri Thanh Y1 - 2016/// TI - A trace clustering solution based on using the distance graph model AV - none M2 - Halkidiki, Greece T2 - The 8th International Conference on Computational Collective Intelligence (ICCCI) ER - TY - CONF ID - SisLab79 UR - http://link.springer.com/chapter/10.1007%2F978-3-642-34707-8_34 A1 - Ha, Quang Thuy A1 - Ha, Thi Oanh A1 - Nguyen, Thi Dung A1 - Nguyen, Thuy Linh Y1 - 2012/11/28/ TI - Refining the Judgement Threshold to Improve Recognizing Textual Entailment Using Similarity SP - 335 M2 - Ho Chi Minh, Vietnam AV - none EP - 344 T2 - The 4th International Conference on Computational Collective Intelligence (ICCCI 2012) ER - TY - CONF ID - SisLab82 UR - http://dl.acm.org/citation.cfm?id=2350753 A1 - Ha, Quang Thuy A1 - Hoang, Thi Lan Giao A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son A1 - Szalas, Andrzej A1 - Tran, Thanh-Luong Y1 - 2012/08/23/ TI - A Bisimulation-based Method of Concept Learning for Knowledge Bases in Description Logics SP - 241 M2 - Ha Long, Vietnam AV - none EP - 249 T2 - 2012: the 3rd International Symposium on Information and Communication Technology (SoIC) ER - TY - CHAP ID - SisLab3156 UR - https://link.springer.com/chapter/10.1007%2F978-3-319-99368-3_44 A1 - Ha, Quang Thuy A1 - Nguyen, Linh Anh A1 - Nguyen, Thi Hong Khanh A1 - Tran, Thanh Luong Y1 - 2018/// N2 - Description logics (DLs) are a suitable formalism for representing knowledge about domains in which objects are described not only by attributes but also by binary relations between objects. Fuzzy DLs can be used for such domains when data and knowledge about them are vague. One of the possible ways to specify classes of objects in such domains is to use concepts in fuzzy DLs. As DLs are variants of modal logics, indiscernibility in DLs is characterized by bisimilarity. The bisimilarity relation of an interpretation is the largest auto-bisimulation of that interpretation. In (fuzzy) DLs, it can be used for concept learning. In this paper, for the first time, we define fuzzy bisimulation and (crisp) bisimilarity for fuzzy DLs under the Gödel semantics. The considered logics are fuzzy extensions of the DL ALCreg with additional features among inverse roles, nominals, qualified number restrictions, the universal role and local reflexivity of a role. We give results on invariance of concepts as well as conditional invariance of TBoxes and ABoxes for bisimilarity in fuzzy DLs under the Gödel semantics. We also provide a theorem on the Hennessy-Milner property for fuzzy bisimulations in fuzzy DLs under the Gödel semantics. PB - Springer T3 - Lecture Notes in Computer Science SN - ISBN 978-3-319-99367-6 ED - Nguyen, Hung Son ED - Ha, Quang-Thuy ED - Li, Tianrui ED - Malgorzata, Przybyla-Kasperek TI - Fuzzy Bisimulations in Fuzzy Description Logics Under the Gödel Semantics SP - 559 AV - public EP - 571 T2 - International Joint Conference on Rough Sets (IJCRS 2018) ER - TY - JOUR ID - SisLab4038 UR - http://vjst.vn/ A1 - Ha, Quang Thuy A1 - Nguyen, Thanh Thuy A1 - Pham, Bao Son A1 - Phan, Xuan Hieu A1 - Tran, Trong Hieu A1 - Tran, Mai Vu A1 - Tran, Quoc Long A1 - Nguyen, Tri Thanh A1 - Ly, Hoang Tung Y1 - 2020/05/27/ N2 - Trí tu? nhân t?o (TTNT) ?ã t?o ra nh?ng chuy?n ??i l?n v? kinh t?, xã h?i, ??i s?ng c?a con ng??i, và nhi?u n??c ?ã xây d?ng chi?n l??c qu?c gia v? TTNT. Phân tích môi tr??ng và xây d?ng chi?n l??c qu?c gia v? TTNT là m?t công vi?c ??y thách th?c ??i v?i nhi?u qu?c gia, trong ?ó có Vi?t Nam. Bài báo tìm hi?u m?t s? nghiên c?u phân tích v? môi tr??ng và xây d?ng chi?n l??c qu?c gia v? TTNT. T? ?ó ??a ra gi?i pháp ??nh h??ng cho chi?n l??c qu?c gia v? TTNT c?a Vi?t Nam PB - B? Khoa h?c và Công ngh? JF - T?p chí Khoa h?c và Công ngh? Vi?t Nam SN - 1859-4794 TI - Môi tr??ng và gi?i pháp cho chi?n l??c qu?c gia v? trí tu? nhân t?o c?a Vi?t Nam AV - public ER - TY - JOUR ID - SisLab2956 UR - http://admin.tapchicongthuong.vn//Images/Uploaded/Share/2018/04/13/NCKH-So-3-OK.pdf A1 - Ha, Quang Thuy A1 - Nguyen, Tri Thanh Y1 - 2018/03// JF - T?p chí Công Th??ng - Các k?t qu? nghiên c?u khoa h?c và ?ng d?ng công ngh? VL - 3 SN - 0866-7756 TI - Khoa h?c d? li?u, ti?n hóa d? li?u và kh? n?ng th?c thi t?i Vi?t Nam SP - 160 AV - public EP - 165 ER - TY - JOUR ID - SisLab4084 UR - https://vjst.vn/vn/ A1 - Ha, Quang Thuy A1 - Pham, Bao Son A1 - Phan, Xuan Hieu A1 - Tran, Trong Hieu A1 - Tran, Mai Vu A1 - Nguyen, Tri Thanh A1 - Pham, Van Dung A1 - Tran, The Hiep Y1 - 2020/10/30/ N2 - Chuy?n ??i s? và trí tu? nhân t?o (TTNT) là các quá trình t?t y?u, song c?ng r?t ph?c t?p ??i v?i các t? ch?c và các qu?c gia. Nhóm tác gi? ?ã ch? ra 3 y?u t? (tr??ng thành s?, ki?n trúc t? ch?c chuy?n ??i cân ??i - C?C?, tài n?ng con ng??i v? TTNT) ?óng vai trò quan tr?ng ??c bi?t trong chi?n l??c qu?c gia v? TTNT, trong chi?n l??c và sáng ki?n chuy?n ??i s? và TTNT c?a t? ch?c. PB - B? Khoa h?c và Công ngh? JF - Khoa h?c và Công ngh? Vi?t Nam SN - 2615-9759 TI - Nh?ng y?u t? quan tr?ng trong Chi?n l??c qu?c gia v? trí tu? nhân t?o AV - restricted ER - TY - CONF ID - SisLab2960 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2960/ A1 - Ha, Quang Thuy A1 - Pham, Thi Ngan A1 - Nguyen, Van Quang A1 - Nguyen, Minh Chau A1 - Pham, Thanh Huyen A1 - Nguyen, Tri Thanh Y1 - 2018/09/05/ N2 - Multi-label learning has become popular and omnipresent in many real-world problems, especially in text classification applications, in which an instance could belong to different classes simultaneously. Due to these label constraints, there are some challenges occurring in building multi-label data. Semi-supervised learning is one possible approach to exploit abundantly unlabeled data for enhancing the classification performance with a small labeled dataset. In this paper, we propose a solution to select the most influential label based on using the relations among the labels and features to a semi-supervised multi-label classification algorithm on texts. Experiments on two datasets of Vietnamese reviews and English emails of Enron show the positive effects of the proposal. TI - o A new text semi-supervised multi-label learning model based on using the label-feature relations M2 - Bristol, United Kingdom AV - none T2 - 10th International Conference on Computational Collective Intelligence (ICCCI 2018) ER - TY - CONF ID - SisLab2750 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2750/ A1 - Ha, Quang Thuy A1 - Pham, Thi Ngan A1 - Nguyen, Van Quang A1 - Vuong, Thi Hong A1 - Tran, Minh Tuoi A1 - Nguyen, Thi Cham A1 - Nguyen, Tri Thanh Y1 - 2018/// N2 - Lifelong machine learning is emerging in recent years thanks to its ability to use past knowledge for current problem. Lifelong topic modeling algorithms, such as LTM and AMC, are proposed and they are very useful. However, these algorithms focus on learning bias on the topic level not the domain level. This paper proposes a lifelong topic modeling method, which focuses on learning bias on the domain level based on a proposed domain closeness measure, and an application framework for multi-label classification on Vietnamese texts. Experimental results on three previously solved Vietnamese texts, and five different current Vietnamese text datasets in combination with different topic set sizes showed that our proposed method is better than AMC method for all cases TI - A New Lifelong Topic Modeling Method and Its Application to Vietnamese Text Multi-label Classification AV - none T2 - 10th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - JOUR ID - SisLab4489 UR - https://vjst.vn/vjsta/tin-tuc/4315/mo-hinh-quan-tri-dai-hoc-chau-au-va-lien-he-voi-viet-nam.aspx A1 - Ha, Quang Thuy A1 - Phan, Xuan Hieu A1 - Nguyen, Tri Thanh A1 - Tran, Trong Hieu A1 - Tran, Mai Vu A1 - Lê, ??c-Tr?ng Y1 - 2021/02/01/ N2 - Qua kh?o sát mô hình qu?n tr? tr??ng ??i h?c (QT?H) thu?c 29 h? th?ng giáo d?c ??i h?c châu Âu, các tác gi? ?ã liên h? v?i Vi?t Nam và cho th?y, các nhà c?i cách giáo d?c Vi?t Nam ch?a ??t c?i cách vào b?i c?nh ph?c t?p v?i r?t nhi?u tác ??ng và m?i quan h? c?a hàng lo?t y?u t? ?a d?ng liên quan ??n d?y và h?c, ??c bi?t, ?ã b? qua m?i quan h? ph? thu?c bi?n ch?ng c?a ba c?t tr? là nhà ho?ch ??nh chính sách, gi?ng viên và sinh viên. T? ?ó, các tác gi? ?ã ??a ra m?t s? khuy?n ngh? nh?m thúc ??y s? phát tri?n h? th?ng ??i h?c c?a Vi?t Nam. PB - B? Khoa h?c và Công ngh? JF - T?p chí Khoa h?c và Công ngh? Vi?t Nam SN - 1859-4794 TI - Mô hình qu?n tr? ??i h?c châu Âu và liên h? v?i Vi?t Nam AV - none ER - TY - JOUR ID - SisLab4039 UR - http://www.tapchicongthuong.vn/ A1 - Ha, Quang Thuy A1 - Phan, Xuan Hieu A1 - Nguyen, Tri Thanh A1 - Tran, Trong Hieu A1 - Tran, Mai Vu A1 - Nguyen, Huu Duc Y1 - 2020/04/01/ N2 - S? phát tri?n m?nh m? song hành gi?a các công ngh? s? hóa (?i?n hình là Internet v?n v?t) và kinh t? s? (?i?n hình là s? xu?t hi?n và phát tri?n c?a nhi?u hình th?c kinh doanh sáng t?o và ?a d?ng) ?ã t?o nên s? bi?n ??i to l?n và nhanh chóng ??i v?i kinh t?, xã h?i và m?i m?t c?a ??i s?ng con ng??i. Kinh t? s? ?ã tr? thành m?t thành ph?n kinh t? ?óng góp m?t t? tr?ng ?áng k? v?i xu th? ngày càng t?ng trong toàn b? n?n kinh t? qu?c dân. ??ng th?i, kinh t? s? c?ng làm phát sinh không ít các thách th?c ?áng quan tâm v? khái ni?m kinh t? s?, mô hình phát tri?n kinh t? s? và ?o l??ng kinh t? s?. Vi?c tìm ra các mô hình (khái ni?m, phát tri?n, ?o l??ng) kinh t? s? nh?n ???c s? quan tâm ??c bi?t c?a nhi?u qu?c gia và các t? ch?c qu?c t?, nh?: T? ch?c h?p tác và phát tri?n kinh t? th? gi?i, Ngân hàng th? gi?i,... Bài báo này cung c?p m?t s? tìm hi?u b??c ??u v? kinh t? s?, v? m?t s? c? h?i và thách th?c t? kinh t? s?, c?ng nh? mô hình ?o l??ng. Bài báo c?ng ??a ra m?t vài trao ??i s? b? v? kinh t? s? t?i Vi?t Nam, ?ó là: t?ng c??ng nh?n th?c ?úng ??n và toàn di?n v? kinh t? s?, phát tri?n ngu?n nhân l?c chuyên nghi?p kinh t? s? (??c bi?t là l?c l??ng chuyên gia cao c?p v? kinh t? s?) và h? sinh thái kinh t? s? t?i Vi?t Nam s? góp ph?n ??y nhanh phát tri?n kinh t? s? c?a Vi?t Nam. PB - B? Công th??ng JF - T?p chí Công Th??ng - Các k?t qu? nghiên c?u khoa h?c và ?ng d?ng công ngh? SN - 0866-7756 TI - Kinh t? s?: B?i c?nh th? gi?i và liên h? v?i Vi?t Nam AV - public ER - TY - CONF ID - SisLab4173 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4173/ A1 - Ha, Quang Thuy A1 - Vo, Dinh Hieu A1 - Phan, Xuan Hieu A1 - Nguyen, Tri Thanh A1 - Nguyen, Huu Duc Y1 - 2020/11/27/ N2 - ?o l??ng công b? khoa h?c c?a cá nhân nhà khoa h?c, t? ch?c khoa h?c là m?t ch? ?? h?p d?n theo các khía c?nh khoa h?c, kinh t? và qu?n lý. Tuy nhiên, ?o l??ng công b? khoa h?c c?ng g?p không ít thách th?c, vì v?y, vi?c tìm hi?u m?t cách toàn di?n v? ?o l??ng công b? khoa h?c là m?t công vi?c c?n thi?t. Bài vi?t này cung c?p m?t kh?o sát b??c ??u song ?? khái quát v? ?o l??ng công b? khoa h?c, m?t s? thách th?c chính và xu h??ng ho?t ??ng này trong th?i ??i s?. M?t s? trao ??i v? ho?t ??ng ?o l??ng công b? khoa h?c t?i Vi?t Nam c?ng ???c trình bày. TI - ?o l??ng công b? khoa h?c: b?i c?nh th? gi?i và liên h? v?i Vi?t Nam SP - 132 M2 - ??i h?c Qu?c gia Hà N?i AV - public EP - 145 T2 - Phát tri?n mô hình trung tâm tri th?c s? cho các th? vi?n Vi?t Nam ER - TY - JOUR ID - SisLab2114 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2114/ A1 - Ha, Su Wook A1 - Lee, Yang Koo A1 - Vu, Thi Hong Nhan A1 - Jung, Young Jin A1 - Keun, Ho Ryu Y1 - 2012/03// PB - Hindawi JF - Journal of Sensors SN - 1687-7268 TI - An Environmental Monitoring System for Managing Spatiotemporal Sensor Data over Sensor Networks AV - none ER - TY - CONF ID - SisLab2130 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2130/ A1 - Ha, Su Wook A1 - Lee, Yang Koo A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2011/12// TI - Spatiotemporal Data Stream Management over Sensor Network Application AV - none M2 - Korea T2 - 6th International Conference on Computer Sciences and Convergence Information Technology, IEEE ER - TY - CONF ID - SisLab1522 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1522/ A1 - Ha, Van Sang Y1 - 2016/03/26/ N2 - Phân l?p là m?t trong nh?ng bài toán c? b?n trong khai phá tri th?c và d? li?u. M?t thách th?c c?a bài toán phân l?p là s? l??ng thu?c tính th??ng r?t l?n, vi?c phân l?p sao cho chính xác và hi?u qu? hi?n v?n là m?t nghiên c?u thú v? cho các nhà khoa h?c trong l?nh v?c khoa h?c máy tính. Bài báo ?i sâu vào nghiên c?u gi?i thu?t phân l?p random forest (RF). ?ây là m?t gi?i thu?t ?ã ???c nhi?u nghiên c?u ch?ng minh là r?t hi?u qu? trong phân l?p ??i v?i b? d? li?u có s? l??ng thu?c tính l?n. Trên c? s? ?ó chúng tôi ?? xu?t m?t ph??ng pháp h?c máy cho gi?i thu?t phân l?p này nh?m t?ng hi?u qu? phân l?p c?a thu?t toán. Cách ti?p c?n này v? c? b?n ?ã làm t?ng kh? n?ng phân l?p c?a gi?i thu?t RF, ph??ng pháp ?? xu?t còn cho th?y kh? n?ng phân l?p t?t h?n m?t s? ph??ng pháp trích ch?n ?ã ???c công b?. Nh? v?y, h??ng c?i ti?n mà chúng tôi ?? xu?t là có kh? thi và thu ???c k?t qu? t??ng ??i cao. TI - Ph??ng pháp trích tr?n ??c tr?ng hi?u qu? cho d? li?u có s? chi?u l?n M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CHAP ID - SisLab1941 UR - http://link.springer.com/chapter/10.1007/978-3-319-41920-6_36 A1 - Ha, Van Sang A1 - Nguyen, Ha Nam Y1 - 2016/07// N2 - Abstract Principal component analysis (PCA) is an effective and well-known method for reducing high-dimensional data sets. Recently, KPCA (Kernel PCA), a nonlinear form of PCA, has been introduced into many fields. In this paper, we propose a new gene selection, namely Custom Kernel principal component analysis (C-KPCA). The new kernel function for KPCA is created by combining a set of kernel functions. First, Singular Value Decomposition (SVD) is used to reduce the dimension of microarray data. Input space is then mapped to ... PB - Springer International Publishing SN - 978-3-319-41919-0 TI - C-KPCA: Custom Kernel PCA for Cancer Classification SP - 459 AV - none EP - 467 T2 - Machine Learning and Data Mining in Pattern Recognition ER - TY - CONF ID - SisLab1939 UR - http://link.springer.com/chapter/10.1007/978-3-319-46909-6_13 A1 - Ha, Van Sang A1 - Nguyen, Ha Nam Y1 - 2016/10// N2 - Abstract Credit scoring is one of the most important issues in financial decision-making. The use of data mining techniques to build models for credit scoring has been a hot topic in recent years. Classification problems often have a large number of features, but not all of them are useful for classification. Irrelevant and redundant features in credit data may even reduce the classification accuracy. Feature selection is a process of selecting a subset of relevant features, which can decrease the dimensionality, reduce the running time, and ... TI - FRFE: Fast Recursive Feature Elimination for Credit Scoring SP - 133 AV - none EP - 142 T2 - International Conference on Nature of Computation and Communication ER - TY - JOUR ID - SisLab1942 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1942/ IS - 20 A1 - Ha, Van Sang A1 - Nguyen, Ha Nam A1 - Nguyen, Duc Nhan Y1 - 2016/05// N2 - Background/Objectives: This article presents a method of feature selection to improve the accuracy and the computation speed of credit scoring models. Methods/Analysis: In this paper, we proposed a credit scoring model based on parallel Random Forest classifier and feature selection method to evaluate the credit risks of applicants. By integration of Random Forest into feature selection process, the importance of features can be accurately evaluated to remove irrelevant and redundant features. Findings: In this research, an algorithm to ... JF - Indian Journal of Science and Technology VL - 9 TI - A Novel Credit Scoring Prediction Model based on Feature Selection Approach and Parallel Random Forest AV - none ER - TY - JOUR ID - SisLab1634 UR - http://dx.doi.org/10.4018/IJORIS.2015100104 IS - 4 A1 - Hien, Dang Thi Thu A1 - Huan, Hoang Xuan A1 - Hoang, Le Xuan Minh Y1 - 2015/// N2 - Radial Basis Function RBF neuron network is being applied widely in multivariate function regression. However, selection of neuron number for hidden layer and definition of suitable centre in order to produce a good regression network are still open problems which have been researched by many people. This article proposes to apply grid equally space nodes as the centre of hidden layer. Then, the authors use k-nearest neighbour method to define the value of regression function at the center and an interpolation RBF network training algorithm with equally spaced nodes to train the network. The experiments show the outstanding efficiency of regression function when the training data has Gauss white noise. JF - International Journal of Operations Research and Information Systems VL - 6 SN - 1947-9328 TI - An Effective Solution to Regression Problem by RBF Neuron Network SP - 57 AV - none EP - 74 ER - TY - CONF ID - SisLab2746 UR - http://ieeexplore.ieee.org/document/8108064/ A1 - Ho, Huy Hung A1 - Nguyen, Ngoc Sinh A1 - Bui, Duy Hieu A1 - Tran, Xuan Tu Y1 - 2017/11/24/ N2 - Histogram of Oriented Gradient (HOG) is a popular feature description for the purpose of object detection. However, HOG algorithm requires a performance system because of its complex operation set. Especially, the cell histogram generation is one of the most complex part, it uses inverse tangent, square, square root, floating point multiplication. In this paper, we propose an accurate and low complex cell histogram generation by bypass the gradient of pixel computation. It employs the bin?s boundary angle method to determine the two quantized angles. However, instead of choosing an approximate value of tan, the nearest greater and the nearest smaller of each tan values from ratio between pixel?s derivative in y and x direction are used. Magnitude of two bins are solutions of a system of two equations, which represent the equality of the gradient of a pixel and its two bins in both vertical and horizontal direction. The proposed method spends only 30 addition and 40 shift operations to identify two bins of a pixel. Simulation results show that the percentage error when reconstructing the difference in x and y direction are always less than 2% with 8-bit length of the fractional part. Additionally, manipulating the precision of gradient magnitude is very simple by pre-defined sine and cosine values of quantized angles. Synthesizing the hardware implementation presents that its area cost is 3.57 KGates with 45nm NanGate standard cell library. The hardware module runs at the maximum frequency of 400 MHz, and the throughput is 0.4 (pixel/ns) for a single module. It is able to support about 48 fps with 4K UHD resolution. TI - Accurate and Low Complex Cell Histogram Generation by Bypass the Gradient of Pixel Computation SP - 201 M2 - Hanoi, Vietnam AV - public EP - 206 T2 - The 4th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - RPRT ID - SisLab2800 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2800/ A1 - Ho, Phuong Y1 - 2017/12/20/ N2 - Da?y sô? Catalan la? mô?t trong nh??ng da?y sô? quan tro?ng trong Tô? h??p. Ba?i viê?t na?y tri?nh ba?y mô?t sô? ba?i toa?n liên quan ?ê?n da?y sô? Catalan va? ca?ch ch??ng minh mô?t sô? la? sô? Catalan. H? th?ng nh?ng bài t?p này ???c s? d?ng trong vi?c hu?n luy?n các ??i tuy?n thi IOI, ACM. PB - VNU-UET Technical Report VL - TR2017-FIT-001 M1 - technical_report TI - Catalan Number AV - public EP - 7 ER - TY - INPR ID - SisLab3170 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3170/ A1 - Ho, Thi Nga A1 - Can, Duy Cat A1 - Chng, Eng Siong Y1 - 2018/11// N2 - This work investigates the effectiveness of using the word based and sub-word based embedding representations as input for a deep bidirectional Long Short-Term Memory Network for Sentence Unit Detection in Automatic Speech Recognition transcription. Our experimental results show that using sub-word based embedding can significantly improve the SUD performance when a limited text is used to train both the word embedding and the SUD model. The SUD model using the sub-word based embedding gains up to 2.07% absolute improvement in F1-score as compared to the best model trained with the word-based embedding. When tested on a domain-mismatch condition, the SUD model with sub-word based embedding trained from the in-domain data gives an approximate 2% and 1% improvement over the best model using out-of-domain embedding with reference and ASR transcription with 29.5% Word Error Rate respectively. TI - An Investigation of Word Embeddings with Deep Bidirectional LSTM for Sentence Unit Detection in Automatic Speech Transcription M2 - Bandung, Indonesia AV - restricted T2 - International Conference on Asian Language Processing (IALP 2018) ER - TY - CONF ID - SisLab784 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/784/ A1 - Hoa, Nong Thi A1 - Bui, The Duy A1 - Dang, Trung Kien Y1 - 2013/// VL - 2951 TI - Efficiency improvements for fuzzy associative memory AV - none T2 - 10th International Symposium on Neural Networks (ISNN 2013), LNCS Springer ER - TY - CONF ID - SisLab114 UR - http://dx.doi.org/10.1109/rivf.2012.6169833 A1 - Hoang, Cuong A1 - Le, Anh Cuong A1 - Nguyen, Phuong Thai A1 - Ho, Tu Bao Y1 - 2012/03/01/ N2 - Constructing a corpus of parallel sentence pairs is an important work in building a Statistical Machine Translation system. It impacts deeply how the quality of a Statistical Machine Translation could achieve. The more parallel sentence pairs we use to train the system, the better translation's quality it is. Nowadays, comparable non-parallel corpora become important resources to alleviate scarcity of parallel corpora. The problem here is how to extract parallel sentence pairs automatically but accurately from comparable non-parallel corpora, which are usually very "noisy". This paper presents how we can apply the reinforcement-learning scheme with our new proposed algorithm for detecting parallel sentence pairs. We specify that from an initial set of parallel sentences in a domain, the proposed model can extract a large number of new parallel sentence pairs from non-parallel corpora resources in different domains, concurrently increasing the system's translation ability gradually. KW - Electronic publishing;Encyclopedias;Error analysis;Internet;Length measurement;Training;language translation;learning (artificial intelligence);nonparallel corpora;parallel sentence pair detection;reinforcement learning scheme;statistical machine translation system; TI - Exploiting Non-Parallel Corpora for Statistical Machine Translation SP - 1 M2 - Ho Chi Minh city AV - none EP - 6 T2 - 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) ER - TY - JOUR ID - SisLab1180 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1180/ A1 - Hoang, Cuong A1 - Le, Anh Cuong A1 - Nguyen, Phuong Thai A1 - Pham, Bao Son A1 - Ho, Tu Bao Y1 - 2014/// JF - Fundamenta Informaticae VL - 130 TI - An Efficient Framework for Extracting Parallel Sentences from Non-Parallel Corpora SP - 179 AV - none EP - 199 ER - TY - CONF ID - SisLab98 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/98/ A1 - Hoang, Cuong A1 - Le, Anh Cuong A1 - Pham, Bao Son Y1 - 2012/08/17/ N2 - In statistical phrase-based machine translation, the step of phrase learning heavily relies on word alignments. This paper provides a systematic comparison of applying various statistical alignment models for statistical English-Vietnamese phrase-based machine translation. We will also invest a heuristic method for elevating the translation quality of using higher word-alignment models by improving the quality of lexical modelling. In detail, we will experimentally show that taking up the lexical translation seems to be an appropriate approach to force "higher" word-based translation models be able to efficiently "boost" their merits. We hope this work will be a reliable comparison benchmark for other studies on using and improving the statistical alignment models for English-Vietnamese machine translation systems. KW - Analytical models;Educational institutions;Hidden Markov models;Mathematical model;Systematics;Training;computational linguistics;language translation;natural language processing;statistical analysis;word processing;heuristic method;lexical modelling;lexical translation;phrase learning;statistical English-Vietnamese phrase-based translation;statistical alignment model;statistical phrase-based machine translation;word alignment model;word-based translation model; TI - A Systematic Comparison between Various Statistical Alignment Models for Statistical English-Vietnamese Phrase-Based Translation SP - 143 M2 - Danang, Vietnam AV - none EP - 150 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab4690 UR - https://atc-conf.org/ A1 - Hoang, Dang Kien A1 - Nguyen, Dai Tho A1 - Nguyen, Thi Thu Trang N2 - Malware is growing rapidly in number and become more and more sophisticated. To prevent them we need to collect samples continuously and update them to the classifier. In this paper, we will propose a method to update new labeled samples of malware to the classifier easily without re-training everything. The classifier can be updated by both labeled malware samples of an existing class or a new class. Our method also has the ability to detect samples of unknown families. Experiments are performed over the traditional computer malware dataset and the IoT malware dataset. The results have shown that our method can reach the macro F1-score almost the same re-train everything but take significantly less time. PB - IEEE JF - 2021 International Conference on Advanced Technologies for Communications (ATC) SN - 2162-1039 TI - Efficient Incremental Instance-based Learning Algorithms for Open World Malware Classification AV - none ER - TY - INPR ID - SisLab3987 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3987/ A1 - Hoang, Dang Kien A1 - Nguyen, Dai Tho A1 - Vu, Duy Loi Y1 - 2020/// N2 - IoT devices play an important role in the industrial revolution 4.0. However, this type of device may exhibit specific security vulnerabilities that can be easily exploited to cause botnet attacks and other malicious activities. In this paper, we introduce a new method for classification and clustering of IoT malware behaviors through system call monitoring. Our method is constructed from multiple one-class SVM classifiers and has the ability to classify known malware with F1-Score over 98% and probability to detect unknown malware up to 97%. Unknown malware instances with similar behaviors can also be grouped together so new classes of malware will be discovered. TI - IoT Malware Classification Based on System Calls M2 - Ho Chi Minh AV - none T2 - The 2020 IEEE-RIVF International Conference on Computing and Communications Technologies ER - TY - CONF ID - SisLab3548 UR - https://hoithaoquocgiacntt.ac.vn/ A1 - Hoang, Dang Kien A1 - Nguyen, Dai Tho A1 - Vu, Duy Loi Y1 - 2019/06/29/ N2 - Ph?n m?m ??c h?i t? lâu ?ã là m?t trong các m?i nguy h?i l?n nh?t ??i v?i các h? th?ng máy tính, nay ?ã chuy?n sang c? các thi?t b? IoT. Trong bài báo này chúng tôi ?? xu?t s? d?ng thu?t toán FRNN ?? thay th? cho thu?t toán 1-NN trong quy trình ?? xu?t b?i Rieck và các c?ng s? [2]. K?t qu? th?c nghi?m cho th?y ph??ng pháp c?a chúng tôi ?? xu?t mang l?i hi?u qu? phân l?p cao ??i v?i các mã ??c ?ã bi?t v?i ?? ?o micro-F_1 lên t?i trên 98% trong khi v?n duy trì kh? n?ng phát hi?n các lo?i mã ??c m?i lên t?i 97%, kh? n?ng ch?ng l?i ?nh h??ng c?a d? li?u nhi?u so v?i ph??ng pháp g?c ???c t?ng lên ?áng k?. TI - Phân lo?i hành vi ph?n m?m ??c h?i trên các thi?t b? IoT d?a vào system call SP - 211 M2 - Thái Bình AV - public EP - 215 T2 - H?i th?o Qu?c gia l?n th? XXII M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông ER - TY - CONF ID - SisLab1606 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1606/ A1 - Hoang, Duc Tam A1 - Nguyen, Le Minh A1 - Pham, Bao Son Y1 - 2015/// N2 - The reliability of a question answering system is bounded by the availability of resources and linguistic tools. In this paper, we introduce a hybrid approach to transforming natural language questions into structured queries. It alleviates the lack of experts in domain observation and the deficient performance of linguistic tools. Specifically, we exploit the semantic information for mapping natural language terminologies to structured query and bipartite graph model for the matching phase. Experimental results on the Vietnam national university entrance exam dataset and the Geoqueries880 dataset achieve accuracies of 91.14% and 87.55%, respectively. TI - L2S: Transforming natural language questions into SQL queries M2 - Ho Chi Minh city, Vietnam AV - none T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab768 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/768/ A1 - Hoang, Minh Duong A1 - Le, Khanh Trinh A1 - Pham, Ngoc Hung Y1 - 2013/11// TI - An Assume-Guarantee Model Checker for Component-Based Systems SP - 22 M2 - Hanoi, VIETNAM AV - none EP - 26 T2 - 2013: IEEE RIVF International Conference on Computing and Communication Technologies (RIVF2013) ER - TY - JOUR ID - SisLab2069 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2069/ IS - 49 A1 - Hoang, Phuc A1 - Teo, Tze Min A1 - Ho, Thien Xuan A1 - Vinh, Le Sy Y1 - 2016/// N2 - Background: More effective mosquito control strategies are urgently required due to the increasing prevalence of insecticide resistance. The sterile insect technique (SIT) and the release of insects carrying a dominant lethal allele (RIDL) are two proposed methods for environmentally-friendly, species-targeted population control. These methods may be more suitable for developing countries if producers reduce the cost of rearing insects. The cost of control programs could be reduced by producing all-male mosquito populations to circumvent the isolation of females before release without reducing male mating competitiveness caused by transgenes. Results: An RNAi construct targeting the RNA recognition motif of the Aedes aegypti transformer-2 (tra-2) gene does not trigger female-to-male sex conversion as commonly observed among dipterous insects. Instead, homozygous insects show greater mortality among m-chromosome-bearing sperm and mm zygotes, yielding up to 100 % males in the subsequent generations. The performance of transgenic males was not significantly different to wild-type males in narrow-cage competitive mating experiments. Conclusion: Our data provide preliminary evidence that the knockdown of Ae. aegypti tra-2 gene expression causes segregation distortion acting at the level of gametic function, which is reinforced by sex-specific zygotic lethality. This finding could promote the development of new synthetic sex distorter systems for the production of genetic sexing mosquito strains. Keywords: Aedes aegypti, Sex determination, Transformer-2, Meiotic drive, Spermatogenesis, Culicinae PB - BioMed JF - Parasites & Vectors VL - 9 SN - 1756-3305 TI - Mechanisms of sex determination and transmission ratio distortion in Aedes aegypti AV - none ER - TY - CONF ID - SisLab1189 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1189/ A1 - Hoang, Thi Diep A1 - Arndt, von Haesele A1 - Bui, Quang Minh Y1 - 2014/// TI - Ultrafast Parsimony Bootstrap AV - none M2 - Germany T2 - 1st Greifswald Phylogenetics Meeting ER - TY - JOUR ID - SisLab3437 UR - https://dx.doi.org/10.1093/molbev/msx281 IS - 2 A1 - Hoang, Thi Diep A1 - Chernomor, Olga A1 - Arndt, von Haeseler A1 - Bui, Quang Minh A1 - Le, Sy Vinh Y1 - 2018/02/01/ N2 - Abstract The standard bootstrap (SBS), despite being computationally intensive, is widely used in maximum likelihood phylogenetic analyses. We recently proposed the ultrafast bootstrap approximation (UFBoot) to reduce computing time while achieving more unbiased branch supports than SBS under mild model violations. UFBoot has been steadily adopted as an efficient alternative to SBS and other bootstrap approaches. Here, we present UFBoot2, which substantially accelerates UFBoot and reduces the risk of overestimating branch supports due to polytomies or severe model violations. Additionally, UFBoot2 provides suitable bootstrap resampling strategies for phylogenomic data. UFBoot2 is 778 times (median) faster than SBS and 8.4 times (median) faster than RAxML rapid bootstrap on tested data sets. UFBoot2 is implemented in the IQ-TREE software package version 1.6 and freely available at http://www.iqtree.org. PB - Oxford University Press JF - Molecular Biology and Evolution VL - 35 SN - 0737-4038 TI - UFBoot2: Improving the Ultrafast Bootstrap Approximation SP - 518 AV - public EP - 522 ER - TY - CONF ID - SisLab2356 UR - http://journal.webscience.org/321/2/websci10_submission_107.pdf A1 - Hoang, Thi Diep A1 - Kaur, Jasleen A1 - Menczer, Filippo Y1 - 2010/04// TI - Crowdsourcing Scholarly Data AV - none M2 - 26-27 April 2010 T2 - WebSci10: Extending the Frontiers of Society On-Line ER - TY - JOUR ID - SisLab2955 UR - https://bmcevolbiol.biomedcentral.com/articles/10.1186/s12862-018-1131-3 A1 - Hoang, Thi Diep A1 - Le, Sy Vinh A1 - Flouri, Tomas A1 - Stamatakis, Alexandros A1 - von Haeseler, Arndt A1 - Bui, Quang Minh Y1 - 2018/02/02/ N2 - BACKGROUND: The nonparametric bootstrap is widely used to measure the branch support of phylogenetic trees. However, bootstrapping is computationally expensive and remains a bottleneck in phylogenetic analyses. Recently, an ultrafast bootstrap approximation (UFBoot) approach was proposed for maximum likelihood analyses. However, such an approach is still missing for maximum parsimony. RESULTS: To close this gap we present MPBoot, an adaptation and extension of UFBoot to compute branch supports under the maximum parsimony principle. MPBoot works for both uniform and non-uniform cost matrices. Our analyses on biological DNA and protein showed that under uniform cost matrices, MPBoot runs on average 4.7 (DNA) to 7 times (protein data) (range: 1.2-20.7) faster than the standard parsimony bootstrap implemented in PAUP*; but 1.6 (DNA) to 4.1 times (protein data) slower than the standard bootstrap with a fast search routine in TNT (fast-TNT). However, for non-uniform cost matrices MPBoot is 5 (DNA) to 13 times (protein data) (range:0.3-63.9) faster than fast-TNT. We note that MPBoot achieves better scores more frequently than PAUP* and fast-TNT. However, this effect is less pronounced if an intensive but slower search in TNT is invoked. Moreover, experiments on large-scale simulated data show that while both PAUP* and TNT bootstrap estimates are too conservative, MPBoot bootstrap estimates appear more unbiased. CONCLUSIONS: MPBoot provides an efficient alternative to the standard maximum parsimony bootstrap procedure. It shows favorable performance in terms of run time, the capability of finding a maximum parsimony tree, and high bootstrap accuracy on simulated as well as empirical data sets. MPBoot is easy-to-use, open-source and available at http://www.cibiv.at/software/mpboot . JF - BMC Evolutionary Biology VL - 18 SN - 1471-2148 TI - MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation AV - none ER - TY - JOUR ID - SisLab3310 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3310/ IS - 18 A1 - Hoang, Thi Diep A1 - Le, Sy Vinh A1 - Tomas, Flouri A1 - Alexandros, Stamatakis A1 - Arndt, von Haeseler A1 - Minh, Bui Y1 - 2018/// N2 - Background: The nonparametric bootstrap is widely used to measure the branch support of phylogenetic trees. However, bootstrapping is computationally expensive and remains a bottleneck in phylogenetic analyses. Recently, an ultrafast bootstrap approximation (UFBoot) approach was proposed for maximum likelihood analyses. However, such an approach is still missing for maximum parsimony. Results: To close this gap we present MPBoot, an adaptation and extension of UFBoot to compute branch supports under the maximum parsimony principle. MPBoot works for both uniform and non-uniform cost matrices. Our analyses on biological DNA and protein showed that under uniform cost matrices, MPBoot runs on average 4.7 (DNA) to 7 times (protein data) (range: 1.2?20.7) faster than the standard parsimony bootstrap implemented in PAUP*; but 1.6 (DNA) to 4.1 times (protein data) slower than the standard bootstrap with a fast search routine in TNT (fast-TNT). However, for non-uniform cost matrices MPBoot is 5 (DNA) to 13 times (protein data) (range:0.3?63. 9) faster than fast-TNT. We note that MPBoot achieves better scores more frequently than PAUP* and fast-TNT. However, this effect is less pronounced if an intensive but slower search in TNT is invoked. Moreover, experiments on large-scale simulated data show that while both PAUP* and TNT bootstrap estimates are too conservative, MPBoot bootstrap estimates appear more unbiased. Conclusions: MPBoot provides an efficient alternative to the standard maximum parsimony bootstrap procedure. It shows favorable performance in terms of run time, the capability of finding a maximum parsimony tree, and high bootstrap accuracy on simulated as well as empirical data sets. MPBoot is easy-to-use, open-source and available at http://www.cibiv.at/software/mpboot. JF - BMC Evolutionary Biology, 18:11 TI - Fast phylogenetic maximum parsimony tree inference and bootstrap approximation SP - subjects AV - public EP - IT ER - TY - CONF ID - SisLab2357 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2357/ A1 - Hoang, Thi Diep A1 - Menczer, Filippo Y1 - 2010/// TI - Building interdisciplinary collaboration networks from a social citation analysis tool AV - none M2 - Riva del Garda Fiere Congressi Riva del Garda (TN), Italy T2 - SUNBELT XXX ER - TY - CONF ID - SisLab2154 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2154/ A1 - Hoang, Thi Diep A1 - Pham, Hong Nguyen A1 - Dinh, Ngoc Thang A1 - Le, Hai Yen Y1 - 2005/08// TI - Evaluating Approaches to Word Segmentation for Vietnamese Text AV - none T2 - The 8th National Conference on Communication and Information Technology ER - TY - CONF ID - SisLab2155 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2155/ A1 - Hoang, Thi Diep A1 - Tran, Ke A1 - Nguyen, Le Minh Y1 - 2008/08// TI - Revision Rules Combine with MST Method for Vietnamese Dependency Parsing AV - none T2 - ITC.rda?08 National Symposium on Research, Development and Application of Information and Communication ER - TY - CONF ID - SisLab2355 UR - http://doi.org/10.1109/KSE.2016.7758020 A1 - Hoang, Thi Diep A1 - Vinh, Le Sy A1 - Flouri, Tomas A1 - Stamatakis, Alexandros A1 - von Haeseler, Arndt A1 - Minh, Bui Quang Y1 - 2016/// N2 - Reconstructing maximum parsimony (MP) trees along with bootstrap for large multiple sequence alignments is a computationally challenging task. In this paper, we present MPBoot, a new method for approximating MP bootstrap based on the idea of a previously introduced method for maximum likelihood bootstrap. MPBoot economizes the computations by only sampling trees on the original alignment and simultaneously calculating exact parsimony scores for all bootstrap alignments. Preliminary experiments on simulated data showed that MPBoot is about 2-3.5 times faster and yields better parsimony scores than a fast bootstrap procedure implemented in TNT. MPBoot also produced less biased support value than TNT for small simulated data sets (<;= 200 sequences). However, for large number of sequences (>=500) MPBoot overestimates the probability that a clade is true, i.e., results in likely high false positive rates. As MPBoot is currently a proof-of-concept implementation, more work is to understand the limitations of the method. TI - A new phylogenetic tree sampling method for maximum parsimony bootstrapping and proof-of-concept implementation SP - 1 AV - none EP - 6 T2 - 2016 Eighth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab2358 UR - http://stubber.math-inf.uni-greifswald.de/~spillner/gpm-2014/gpm-2014.html A1 - Hoang, Thi Diep A1 - von Haeseler, Arndt A1 - Bui, Quang Minh Y1 - 2014/// TI - Ultrafast Parsimony Bootstrap AV - none M2 - Greifswald Germany T2 - Greifswald Phylogenetics Meeting 2014 ER - TY - INPR ID - SisLab4688 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4688/ A1 - Hoang, Thi Linh A1 - Pham, Tuan Dung A1 - Ta, Viet Cuong Y1 - 2021/11/11/ N2 - With the emergence of online social networks, social-based items recommendation has become a popular research direction. Recently, Graph Convolutional Networks have shown promising results by modeling the information diffusion process in graphs. It provides a unified framework for graph embedding that can leverage both the social graph structure and node features information. In this paper, we improve the embedding output of the graph-based convolution layer by adding a number of transformer layers. The transformer layers with attention architecture help discover frequent patterns in the embedding space which increase the predictive power of the model in the downstream tasks. Our approach is tested on two social-based items recommendation dataset, Ciao and Epinions and our model outperforms other graph-based recommendation baselines. TI - Improving Graph Convolutional Networks with Transformer Layer in social-based items recommendation M2 - Bangkok, Thailand AV - public T2 - The 13th International Conference on KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2021) ER - TY - INPR ID - SisLab4776 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4776/ A1 - Hoang, Thi Linh A1 - Ta, Viet Cuong N2 - Graph Transformer Networks (GTN) use attention mechanism to learn the node representation in a static graph and can achieve state-of-the-art results on several graph learning tasks. However, due to the computation complexity of the attention operation, these models are not applicable to dynamic graphs. In this paper, we propose the Dynamic-GTN model which is designed to learn the node embedding in a continous-time dynamic graph. The Dynamic-GTN extends the attention mechanism in a standard GTN to include temporal information of recent node interaction. Based on temporal patterns interaction between nodes, an node sampling step is added to reduce the number of attention connections in the dynamic graph. We evaluate our model on three benchmark datasets for learning node embedding in dynamic graphs. The results show that the Dynamic-GTN has better accuracy than the state-of-the-art of graph neural networks on both transductive and inductive graph learning tasks. TI - Dynamic-GTN: Learning an Node Efficient Embedding in Dynamic Graph with Transformer AV - public T2 - 19th Pacific Rim International Conference on Artificial Intelligence ER - TY - CONF ID - SisLab3123 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3123/ A1 - Hoang, Tieu Binh A1 - Ma, Thi Chau A1 - Akihiro, Sugimoto A1 - Bui, The Duy Y1 - 2018/09// N2 - Recent applications of Convolutional Neural Networks, especially 3-Dimensional Convoltutional Neural Networks (3DCNNs) for human action recognition (HAR) in videos have widely used. In this paper, we use a multi-stream framework which is a combination from separated networks with different kind of input generated from unique video dataset. To achieve the high results, firstly, we proposed a method to extract the active frames (called Selected Active Frames - SAF) from a videos to build datasets for 3DCNNs in video classifying problem. Second, we deploy a new approach called Vote fusion which considered as an effective fusion method for ensembling multi-stream networks. From the various datasets generated from videos, we extract frames by our method and feed into 3DCNNs for feature extraction, then we carry out training and then fuse the results of softmax layers of these streams. We evaluate the proposed methods on solving action recognition problem. These method are carried on three well-known datasets (HMFB51, UCF101, and KTH). The results are also compared to the state-of-the-art results to illustrate the efficiency and effectiveness in our approach TI - Selecting active frames for action recognition with 3D convolutional network M2 - Malaysia AV - public T2 - 2018 the 7th International Conference on Computer and Communication Engineering (ICCCE) ER - TY - CONF ID - SisLab2648 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2648/ A1 - Hoang, Trung Kien A1 - Nguyen, Kim Hung A1 - Ma, Thi Chau A1 - Ngo, Thi Duyen A1 - Nguyen, Xuan Thanh Y1 - 2017/10// TI - Single View Image Based ? 3D Human Pose Reconstruction AV - none M2 - Hue, Vietnam T2 - The 2017 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab2478 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2478/ A1 - Hoang, Trung Kien A1 - Nguyen, Kim Hung A1 - Nguyen, Xuan Thanh A1 - Ma, Thi Chau A1 - Ngo, Thi Duyen Y1 - 2017/10/19/ TI - Single View Image Based - 3D Human Pose Reconstruction AV - none M2 - Hue, Vietnam T2 - The 2017 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab4741 UR - https://link.springer.com/chapter/10.1007/978-3-030-99666-6_107 A1 - Hoang, Van Truong A1 - Phung, Manh Duong Y1 - 2022/04/02/ N2 - This paper introduces a new path planning algorithm for unmanned aerial vehicles (UAVs) based on the teaching-learning-based optimization (TLBO) technique. We first define an objective function that incorporates requirements on the path length and constraints on the movement and safe operation of UAVs to convert the path planning into an optimization problem. The optimization algorithm named Multi-subject TLBO is then proposed to minimize the formulated objective function. The algorithm is developed based on TLBO but enhanced with new operations including mutation, elite selection and multi-subject training to improve the solution quality and speed up the convergence rate. Comparison with state-of-the-art algorithms and experiments with real UAVs have been conducted to evaluate the performance of the proposed algorithm. The results confirm its validity and effectiveness in generating optimal, collision-free and flyable paths for UAVs in complex operating environments. TI - Enhanced Teaching-Learning-based Optimization for 3D Path Planning of Multicopter UAVs SP - 743 AV - public EP - 753 T2 - The International Conference on Advanced Mechanical Engineering, Automation, and Sustainable Development 2021 (AMAS2021) ER - TY - CONF ID - SisLab1992 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1992/ A1 - Hoang, Van Xiem A1 - Dinh, Trieu Duong A1 - Le, Thanh Ha Y1 - 2016/10/12/ N2 - Frame rate up conversion (FRUC) has been playing an important role in the recent development of advanced television systems due to its benefits on both increasing the viewing quality experiences and reducing the cost of video transmission. However, with the increasing of video resolutions, notably from Standard Definition (SD) to High Definition (HD), FRUC is now asked to provide not only better interpolated frames quality but also lower time processing. Therefore, in this paper, we propose a novel spatial ? temporal feature extraction based adaptive search range for effective FRUC. In the proposed adaptive search range scheme, a set of temporal and spatial features are carefully defined and exploited to adaptively assign an appropriate search range value to each considered block; thus, directly reducing the FRUC time processing. Moreover, since the optimal search range can be employed; the quality of interpolated frames is significantly improved. Experimental results conducted for a rich set of video test sequences shown the advantages of the proposed FRUC scheme, notably in both subjective objective image quality improvement and time processing reduction. TI - Spatial-Temporal Feature Extraction based Adaptive Search Range for Effective Frame Rate-Up Conversion SP - 1 M2 - Hanoi, Vietnam AV - none EP - 6 T2 - the 2016 International Conference Advanced Technologies for Communications (ATC) ER - TY - JOUR ID - SisLab3456 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3456/ IS - 1 A1 - Hoang, Van Xiem A1 - duong, thi Hang A1 - Trinh, Anh Vu A1 - Vu, Xuan Thang Y1 - 2019/// N2 - Caching has received much attention as a promising technique to overcome high data rate and stringent latency requirements in the future wireless networks. The premise of caching technique is to prefetch most popular contents closer to end users in local cache of edge nodes, e.g., base station (BS). When a user requests a content that is available in the cache, it can be served directly without being sent from the core network. In this paper, we investigate the performance of hierarchical caching systems, in which both BS and end users are equipped with a storage memory. In particular, we propose a novel cooperative caching scheme that jointly optimizes the content placement at the BS?s and users? caches. The proposed caching scheme is analytically shown to achieve a larger global caching gain than the reference in both uncoded ? and coded caching strategies. Finally, numerical results are presented to demonstrate the effectiveness of our proposed caching algorithm. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 35 SN - 0866-8612 TI - Cooperative Caching in Two-Layer Hierarchical Cache aided Systems SP - 1 AV - public EP - 9 ER - TY - JOUR ID - SisLab4073 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4073/ IS - 8 (183 A1 - Hoang, Xuan Huan A1 - Pham, Van Canh A1 - Ha, K.T. Dung A1 - Vu, C Quang A1 - Nguyen, Su Anh Y1 - 2020/// N2 - The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in information propagation and social network analysis. However, previous studies ignored the constraint of priority that led to inefficient seed collections. In some real situations, companies or organizations often prioritize influencing potential users during their influence diffusion campaigns. With a new approach to these existing works, we propose a new problem called Influence Maximization with Priority (IMP) which finds out a set seed of k nodes in a social network to be able to influence the largest number of nodes subject to the influence spread to a specific set of nodes U (called priority set) at least a given threshold T in this paper. We show that the problem is NP-hard under well-known IC model. To find the solution, we propose two efficient algorithms, called Integrated Greedy (IG) and Integrated Greedy Sampling (IGS) with provable theoretical guarantees. IG provides a ? 1 ? (1 ? 1 k ) t ? -approximation solution with t is an outcome of algorithm and t ? 1. The worst-case approximation ratio is obtained when t = 1 and it is equal to 1/k. In addition, IGS is an efficient randomized approximation algorithm based on sampling method that provides a ? 1 ? (1 ? 1 k ) t ? e ? -approximation solution with probability at least 1 ? ? with e > 0, ? ? (0, 1) as input parameters of the problem. We conduct extensive experiments on various real networks to compare our IGS algorithm to the state-of-the-art algorithms in IM problem. The results indicate that our algorithm provides better solutions interns of influence on the priority sets when approximately give twice to ten times higher than threshold T while running time, memory usage and the influence spread also give considerable results compared to the others. PB - MDPI JF - MDPI algorithms VL - 13 SN - 1999-4893 TI - Influence Maximization with Priority in Online Social Networks SP - 1 AV - public EP - 23 ER - TY - RPRT ID - SisLab3343 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3343/ A1 - Hoang, Xuan Tung Y1 - 2018/// N2 - As the web expands overwhelmingly in our daily lives, the pressure to improve the performance of web servers increases. A significant optimization technique that enables scalable web servers to serve clients more efficiently and with lower resource demands consists in caching requested web objects on intermediate cache servers. At the core of the cache server operation is the replacement algorithm, which is responsible for selecting, according to a cache replacement policy, the cached pages that should be removed in order to make space for new pages. Traditional replacement policies used in practice take advantage of temporal reference locality by removing the least recently/frequently requested pages from the cache. Lately, due to the properties of semantic content in of web page, there are some new attempts to implement cache replacement based on multiple parameters including semantic content. This report presents a semantic-aware caching policy enhanced with the use of function-based cache value. Our algorithm is believed to outperform traditional methods in terms of hit rate, which can be useful for website with many small and equal-size web objects. PB - VNU University of Engineering and Technology VL - UET-FIT-2018xyz M1 - technical_report TI - Function-based Semantic-ware Cache Replacement Algorithm for Web Systems AV - public ER - TY - CONF ID - SisLab3837 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3837/ A1 - Hoang, Xuan Tung A1 - Bui, Ngoc Dung Y1 - 2019/03/20/ N2 - As Web traffics is increasing on the Internet, caching solutions for Web systems are becoming more important since they can greatly expand system scalability. An important part of a caching solution is cache replacement policy, which is responsible for selecting victim items that should be removed in order to make space for new objects. Typical replacement policies used in practice only take advantage of temporal reference locality by removing the least recently/frequently requested items from the cache. Although those policies work well in memory or filesystem cache, they are inefficient for Web systems since they do not exploit semantic relationship between Web items. This paper presents a semantic-aware caching policy that can be used in Web systems to enhance scalability. The proposed caching mechanism defines semantic distance from a web page to a set of pivot pages and use the semantic distances as a metric for choosing victims. Also, it use a function-based metric that combines access frequency and cache item size for tie-breaking. Our simulations show that out enhancements outperform traditional methods in terms of hit rate, which can be useful for websites with many small and similar-in-size web objects. TI - An Enhanced Semantic-based Cache Replacement Algorithm for Web Systems SP - 142 M2 - Da Nang, Vietnam AV - public EP - 147 T2 - RIVF: the 2019 IEEE-RIVF International Conference on Computing and Communication Technologies ER - TY - CONF ID - SisLab446 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_47 A1 - Hoang, Xuan-Huan A1 - Duong, T.A. Tuyet A1 - Doan, T.T. Ha A1 - Nguyen, T. Hung Y1 - 2014/10/09/ TI - An Efficient Ant Colony Algorithm for DNA Motif Finding SP - 589 M2 - Hanoi, Vietnam AV - none EP - 601 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab3344 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3344/ A1 - Hoang, Xuan-Tung Y1 - 2018/// N2 - ?ô?ng b?? hoa? co? s?? d?? li??u la? m??t trong nh??ng ti?nh na?ng quan tro?ng trong ca?c h?? thô?ng ti?nh toa?n pha?n ta?n. ?ô?ng b?? hoa? lie?n lu???c ?ô? (cross-schema) cho phe?p vi??c ?ô?ng b?? hoa? co? thê? th??c hi??n ?u???c trong mo?i tru???ng co? s?? d?? li??u kho?ng ?ô?ng nhâ?t no?i ma? ca?c co? s?? d?? li??u co? câ?u tru?c kha?c nhau vâ?n th??c hi??n ?ô?ng b?? d?? li??u ?u???c v??i nhau. Trong ba?i ba?o na?y, chu?ng to?i gi??i thi??u XSync, m??t middleware ?u???c thiê?t kê? nh??m phu?c vu? th??c hi??n vi??c ?ô?ng b?? hoa? lie?n lu???c ?ô? m??t ca?ch hi??u qua? cho ca?c h?? thô?ng s?? du?ng co? s?? d?? li??u. V??i XSync, nha? pha?t triê?n phâ?n mê?m co? thê? dê? da?ng ti?ch h??p kha? na?ng ?ô?ng b?? d?? li??u va?o h?? thô?ng IT cu?a mi?nh m??t ca?ch linh hoa?t v??i chi phi? pha?t triê?n thâ?p nhu?ng vâ?n ?em la?i nhiê?u l??i i?ch l??n vê? m??t ti?nh na?ng cu?ng nhu? hi??u na?ng. TI - C? ch? ??ng b? hoá liên l??c ?? cho các ?ng d?ng c? s? d? li?u phân tán M2 - Hanoi AV - public T2 - H??I THA?O KHOA HO?C MA?Y TI?NH VA? CA?C H?? THÔ?NG THO?NG MINH ER - TY - JOUR ID - SisLab2631 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2631/ IS - 14 A1 - Hoang Nhu, Dong A1 - Nguyen Nam, Hoang A1 - Hoang Trong, Minh A1 - Saba, Takahiko Y1 - 2017/09// N2 - Femtocell networks have been proposed for indoor communications as the extension of cellular networks for enhancing coverage performance. Because femtocells have small coverage radius, typically from 15 to 30 meters, a femtocell user (FU) walking at low speed can still make several femtocell-to-femtocell handovers during its connection. When performing a femtocell-to-femtocell handover, femtocell selection used to select the target handover femtocell has to be able not only to reduce unnecessary handovers and but also to support FU?s quality of service (QoS). In the paper, we propose a femtocell selection scheme for femtocell-tofemtocell handover, named Mobility Prediction and Capacity Estimation based scheme (MPCE-based scheme), which has the advantages of the mobility prediction and femtocell?s available capacity estimation methods. Performance results obtained by computer simulation show that the proposed MPCE-based scheme can reduce unnecessary femtocell-tofemtocell handovers, maintain low data delay and improve the throughput of femtocell users. JF - the Research and Development on Information and Communication Technology Journal VL - E3 TI - Femtocell Selection Scheme for Reducing Unnecessary Handover and Enhancing Downlink QoS in Cognitive Femtocell Networks SP - 45 AV - public EP - 51 ER - TY - CONF ID - SisLab2659 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2659/ A1 - Hussein, Shamsul Faisal Mohd A1 - Bakar, Mohd Anuar Abu A1 - Makino, Yoshiki A1 - Nguyen, Hoai Son A1 - Abdullah, Shahrum Shah A1 - Yuto, Lim A1 - Yasuo, Tan Y1 - 2017/08// N2 - Modelling and simulation is an alternative way of testing the dynamic behaviour of a real system ? in some situation, testing the real system are expensive, time consuming, not comfortable, and dangerous. Mathematical model describing the dynamic behaviour of a system can be represented by using white, black, or grey box model. This study focuses on developing a simplified Auto Regressive Moving Average (ARMA) model (a type of linear black model) to represent the dynamic thermal behaviour of iHouse ? simpli- fication is done based on the theoretical knowledge of the building. The per- formance of the simplified ARMA model developed in this study is compared with the performance of the models developed in previous studies, which are: (1) House Thermal Simulator; (2) and ARMA model. Result shows that the simplified ARMA model developed in this study consists of simpler set of mathematical equations, but can still simulate the dynamic thermal behaviour of iHouse with the accuracy that is almost on par with the models developed in previous studies. TI - Simplifying the Auto Regressive and Moving Average (ARMA) Model - Representing the Dynamic Thermal Behaviour of iHouse Based on Theoretical Knowledge M2 - Malaysia AV - public T2 - 17th Asia Simulation Conference (AsiaSim) ER - TY - JOUR ID - SisLab1906 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1906/ IS - 1 A1 - Hwang, Min-Cheol A1 - Le, Thanh Ha A1 - Kim, Nam-hyeong A1 - Park, Chun-Su A1 - Ko, Sung-Jea Y1 - 2007/// PB - IEEE JF - IEEE Transactions on Consumer Electronics VL - 53 SN - 0098-3063 TI - Person identification system for future digital TV with intelligence SP - 218 AV - none EP - 226 ER - TY - INPR ID - SisLab4618 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4618/ A1 - Ikechukwu, Ogbodo Mark A1 - Dang, Nam Khanh A1 - Abdallah, Abderazek Ben Y1 - 2021/// TI - Energy-efficient Spike-based Scalable Architecture for Next-generation Cognitive AI Computing Systems AV - none T2 - International Symposium on Ubiquitous Networking 2021 ER - TY - CONF ID - SisLab3793 UR - https://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS18/paper/download/17659/16826 A1 - Ivanov\', Marika A1 - Surynek, Pavel A1 - Nguyen, Diep Thi Ngoc Y1 - 2017/// N2 - We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most one agent can occupy a vertex; and they can move into adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim of one team - attackers - is to invade into given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers by occupying selected vertices. The team of defenders need to maintain connectivity of vertices occupied by its own agents in a visibility graph. The visibility graph models possibility of communication between pairs of vertices. We study strategies for allocating vertices to be occupied by the team of defenders to block attacking agents where connectivity is maintained at the same time. To do this we reserve a subset of defending agents that do not try to block the attackers but instead are placed to support connectivity of the team. The performance of strategies is tested in multiple benchmarks. The success of a strategy is heavily dependent on the type of the instance, and so one of the contributions of this work is that we identify suitable strategies for diverse instance types. VL - abs/17 TI - Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents SP - 348 AV - public EP - 353 T2 - the Thirty-First International Flairs Conference ER - TY - JOUR ID - SisLab2159 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2159/ A1 - Kaur, Jasleen A1 - Hoang, Thi Diep Y1 - 2012/// JF - PLOS ONE SN - 1932-6203 TI - Scholarometer: A Social Framework for Analyzing Impact across Disciplines AV - none ER - TY - CONF ID - SisLab3125 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3125/ A1 - Khuat, Thanh Son A1 - Nguyen, Tr??ng Thang A1 - Tran, Hung A1 - Nguyen, Ha Thanh Y1 - 2018/// N2 - Báo cáo này ti?p c?n tìm hi?u công ngh? Blockchain ? m?t công ngh? ?ang phát tri?n m?nh m? và b??c ??u ?ng d?ng trong nhi?u l?nh v?c. D?a trên b?n ch?t b?o m?t d? li?u c?a Blockchain, chúng tôi ?? xu?t ?ng d?ng cho bài toán b?o v? tính toàn v?n và minh b?ch cho d? li?u và c? th? ? ?ây là các d? li?u v?n b?n. Tr??c h?t, báo cáo trình bày khái quát v? công ngh? thành ph?n trong Blockchain và s? phù h?p c?a nó ??i v?i bài toán xác th?c/b?o v? d? li?u. Ti?p theo, báo cáo ?ê xu?t gi?i pháp ?ng d?ng Blockchain trong bài toán th?c t? liên quan t?i tính toàn v?n và tính minh b?ch c?a tài li?u, ?ánh giá m?c ?? an toàn c?a vi?c áp d?ng. TI - Công ngh? Blockchain trong v?n ?? ??m b?o tính toàn v?n và minh b?ch c?a d? li?u M2 - Thanh Hoa, Vietnam AV - none T2 - H?i th?o Qu?c gia th??ng niên "M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông" ER - TY - INPR ID - SisLab1523 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1523/ A1 - Kieu, Minh Viet A1 - Nguyen, Dai Tho A1 - Nguyen, Thanh Thuy Y1 - 2016/03/26/ N2 - T?n công t? ch?i d?ch v? t?c ?? th?p vào giao th?c TCP (LDoS) là hình th?c t?n công t? ch?i d?ch v? phân tán (DDoS) m?i hi?n nay, ?ã ???c gi?i thi?u l?n ??u tiên b?i Aleksandar Kuzmanovic và Edward W. Knightly n?m 2003. LDoS khai thác ?i?m y?u c?a giao th?c TCP ?ó là s? d?ng giá tr? th?i gian ch? phát l?i gói tin nh? nh?t minRTO là h?ng s? b?ng 1 giây. Ch?ng LDoS tr? nên khó kh?n h?n so v?i ch?ng DDoS thông th??ng vì LDoS g?i gói tin v?i t?c ?? trung bình th?p nên nó tránh ???c s? phát hi?n c?a các b? giám sát m?ng (ch? y?u phát hi?n b?t th??ng d?a trên s? bùng n? gói tin vào m?ng). Nghiên c?u ??a ra ?? ?o m?i Congestion Participation Rate (CPR) ?? phân bi?t dòng TCP thông th??ng và dòng t?n công LDoS, c?i ti?n thu?t toán qu?n lý hàng ??i RED (Random Early Detection) ?? ch?ng LDoS. K?t qu? mô ph?ng b?ng ph?n m?m NS-2 cho th?y ch? s? CPR c?a dòng TCP th??ng nh? h?n so v?i ch? s? CPR c?a dòng t?n công LDoS; trên c? s? ?ó, thu?t toán lo?i b? gói tin c?a các dòng có ch? s? CPR cao và cho ?i qua gói tin c?a các dòng có ch? s? CPR th?p. TI - Ch?ng t?n công t? ch?i d?ch v? t?c ?? th?p vào giao th?c TCP b?ng các c?i ti?n c? ch? qu?n lý hàng ??i tích c?c. M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3378 UR - http://dl.acm.org/citation.cfm?id=3287921 A1 - Kieu, Minh Viet A1 - Nguyen, Dai Tho A1 - Nguyen, Thanh Thuy Y1 - 2018/// N2 - TCP-targeted low-rate distributed denial-of-service (LDDoS) attacks have created an opportunity for attackers to reduce their total attaking rate (and hence, the detection probability of the attacks) while inflicting the same damage to TCP flows as traditional flooding-based DDoS attacks. CPR-based approach has been proposed by Zhang et al. to detect and filter this kind of DDoS attacks,but its performance in terms of TCP throughput under attack is shown to be limited by the way it calculates CPR for each flow. In this paper, we will propose some modifications to the CPR-based approach in order to increase its performance. Simulation results show that the modifications can increase performance significantly TI - Techniques for Improving Performance of the CPR-Based Approach SP - 163 M2 - Da Nang AV - public EP - 168 T2 - SoICT 2018: 9th International Symposium on Information and Communications ER - TY - CONF ID - SisLab2752 UR - http://soict.org/ A1 - Kieu, Minh Viet A1 - Nguyen, Dai Tho A1 - Nguyen, Thanh Thuy Y1 - 2017/12/07/ N2 - TCP-targeted low-rate distributed denial-of-service (LDDoS) attacks pose a serious challenge to the reliability and security of the Internet. Among various proposed solutions, we are particularly interested in the Congestion Participation Rate (CPR) metric and the CPR-based approach. Through a simulation study, we show that the existing algorithm cannot simultaneously achieve high TCP throughput while under attack and good fairness performance for new legitimate TCP flows in normal times. We then propose a new version of the CPR-based approach to overcome the tradeoff. Simulation results show that it preserves TCP throughput while under attack fairly well, yet maintains fairness for new TCP flows in normal times. TI - Using CPR Metric to Detect and Filter Low-Rate DDoS Flows M2 - Nha Trang, Vietnam AV - public T2 - The Eighth International Symposium on Information and Communication Technology (SoICT 2017) ER - TY - INPR ID - SisLab3999 UR - https://rivf2020.rmit.edu.vn/ A1 - Kieu, Minh Viet A1 - Nguyen, Dai Tho A1 - Nguyen, Thanh Thuy Y1 - 2002/// N2 - TCP-targeted low-rate distributed denial-of-service (LDDoS) attacks were first introduced by A. Kuzmanovic and E. Knightly in 2003. The authors also proposed a simple model to quantify TCP throughput under LDDoS attacks. Since then, there have been many researchers attemping to estimate the throughput, such as Luo et al. We agree with them upon the sketch of TCP congestion window under a successful LDDoS attack but we find out that there are more cases than what has been specified. Moreover, the relative error of Luo?s estimation method is still high. Our goal in this paper is to propose a simple but more accurate method to estimate TCP throughput of a single TCP flow under such DDoS attacks. Our estimation values in various scenarios are compared with the results of simulations performed with NS-2 simulator, so that the effectiveness of our method is illustrated. TI - A Way to Estimate TCP Throughput under Low-Rate DDoS Attacks: One TCP Flow M2 - Ho Chi Minh City, Vietnam AV - public T2 - The 2020 RIVF International Conference on Computing and Communication Technologies (RIVF 2020) ER - TY - CONF ID - SisLab3639 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3639/ A1 - Kieu, Thanh Binh A1 - Pham, Bao Son A1 - Phan, Xuan Hieu A1 - Piccardi, Massimo Y1 - 2019/10/11/ N2 - Choosing appropriate references for a given topic is an important, yet challenging task. The pool of potential candidates is typically very large, in the order of tens of thousands, and growing by the day. For this reason, this paper proposes an approach for automatically providing a reference list for a given abstract. The approach is based on an original submodular inference function which balances relevance, coverage and diversity in the reference list. Experiments are carried out using an ACL corpus as a source for the references and evaluated in terms of precision-recall, MAP and MRR. The results show the remarkable comparative performance of the proposed approach. TI - A Submodular Approach for Reference Recommendation M2 - Hanoi, Vietnam AV - none T2 - The 16th International Conference of the Pacific Association for Computational Linguistics (PACLING 2019) ER - TY - CONF ID - SisLab4216 UR - https://www.micc.unifi.it/icpr2020/ A1 - Kieu, Thanh Binh A1 - Unanue, Inigo Jauregi A1 - Pham, Bao Son A1 - Phan, Xuan Hieu A1 - Piccardi, Massimo Y1 - 2020/// N2 - With the rapid growth of the scientific literature, manually selecting appropriate citations for a paper is becoming increasingly challenging and time-consuming. While several approaches for automated citation recommendation have been proposed in the recent years, effective document representations for citation recommendation are still elusive to a large extent. For this reason, in this paper we propose a novel approach to citation recommendation which leverages a deep sequential representation of the documents (Sentence-BERT) cascaded with Siamese and triplet networks in a submodular scoring function. To the best of our knowledge, this is the first approach to combine deep representations and submodular selection for a task of citation recommendation. Experiments have been carried out using a popular benchmark dataset - the ACL Anthology Network corpus - and evaluated against baselines and a state-of-the-art approach using metrics such as the MRR and F1-at-k score. The results show that the proposed approach has been able to outperform all the compared approaches in every measured metric. TI - Learning Neural Textual Representations for Citation Recommendation M2 - Milan, Italy AV - none T2 - The 25th International Conference on Pattern Recognition ER - TY - INPR ID - SisLab4158 UR - https://www.micc.unifi.it/icpr2020/ A1 - Kieu, Thanh Binh Thanh Binh A1 - Unanue, Inigo Jauregi A1 - Pham, Bao Son A1 - Phan, Xuan Hieu A1 - Piccardi, Massimo Y1 - 2020/// N2 - With the rapid growth of the scientific literature, manually selecting appropriate citations for a paper is becoming increasingly challenging and time-consuming. While several approaches for automated citation recommendation have been proposed in the recent years, effective document representations for citation recommendation are still elusive to a large extent. For this reason, in this paper we propose a novel approach to citation recommendation which leverages a deep sequential representation of the documents (Sentence-BERT) cascaded with Siamese and triplet networks in a submodular scoring function. To the best of our knowledge, this is the first approach to combine deep representations and submodular selection for a task of citation recommendation. Experiments have been carried out using a popular benchmark dataset - the ACL Anthology Network corpus - and evaluated against baselines and a state-of-the-art approach using metrics such as the MRR and F1-at-k score. The results show that the proposed approach has been able to outperform all the compared approaches in every measured metric. TI - Learning Neural Textual Representations for Citation Recommendation M2 - Milan, Italy AV - none T2 - The 25th International Conference on Pattern Recognition ER - TY - CHAP ID - SisLab3823 UR - http://dx.doi.org/10.1007/978-3-642-28279-9_21 A1 - Kiyoki, Yasushi A1 - Sasaki, Shiori A1 - Nguyen, Nhung Trang A1 - Nguyen, Diep Thi Ngoc Y1 - 2012/// N2 - Over the past decade, the rapid progress of multimedia data management technology has realized the large scale of media data transfer and resource-accumulation in the world. The multimedia computing technology has also been creating new information provision environments in the world-wide scope. Innovative integrations of large scale multimedia data management and computing technology will lead to a new information society. In the design of multimedia systems, one of the most important issues is how to search and analyze media data (images, music, movies and documents), according to impressions and contexts. We have proposed and introduced a "Kansei" and semantic associative search method based on our ?Mathematical Model of Meaning (MMM) [11], [13], [14]?. The concept of "Kansei" includes several meanings on sensitive recognition, such as "impression", "human senses", "feelings", "sensitivity", "psychological reaction" and "physiological reaction". This model realizes "Kansei" processing and semantic associative search for media data, according to user?s impressions and contexts. This model is applied to compute semantic correlations between keywords, images, music and documents dynamically in a context-dependent way. The main feature of this model is to realize semantic associative search in the 2000 dimensional orthogonal semantic space with semantic projection functions. This space is created for dynamically computing semantic equivalence or similarity between keywords and media data. We have constructed "Cross-Cultural Multimedia Computing Systems? for sharing and analyzing different cultures with semantic associative functions applied to ?cultural & multimedia data,? as a new platform of cross-cultural collaborative environments. This environment enables to create a remote, interactive and real-time cultural and academic research exchange among different countries and cultures. PB - Springer SN - 0302-9743 M1 - 7260 TI - Cross-Cultural Multimedia Computing with Impression-Based Semantic Spaces SP - 316 AV - public EP - 328 T2 - Conceptual Modelling and Its Theoretical Foundations ER - TY - CONF ID - SisLab1617 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1617/ A1 - Konlakorn, Wongpatikaseree A1 - Nguyen, Hoai Son A1 - Yasuo, Tan Y1 - 2015/// TI - Thermal simulation for evaluation of thermal comfort in real houses AV - none T2 - SGSH 2015: Smart Grid and Smart Home ER - TY - CONF ID - SisLab3818 UR - http://dx.doi.org/10.1145/2684200.2684313 A1 - Kosugi, Naoko A1 - Shimizu, Sachiko A1 - Sasaki, Shiori A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2014/12/04/ N2 - To maintain and uplift the motivation for doing exercise which is tend to be too simple in rehabilitation and ergotherapy, doing exercise with music is one of the good solutions. In this paper, we confirm that doing exercise with music is fun. Next, we design five types of musical features which relate to exercises. These features are evaluated by doing five types of exercises with listening to the tunes. Based on the results obtained from the experiments, we found many new things, for example, tempo has the adjustment limitation based on how well the user knows the tune. In this paper, we report the latest results from the experiments and explain the way to progress of this research. TI - Music Retrieval and Adjustment Technique to Support and Motivate Ergotherapy and Daily Exercises SP - 385 M2 - Hanoi Vietnam AV - public EP - 394 T2 - iiWAS '14 Proceedings of the 16th International Conference on Information Integration and Web-based Applications & Services ER - TY - INPR ID - SisLab4234 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4234/ A1 - Kubo, Masatoshi A1 - Nguyen, Hai Chau A1 - Brik, Sergey A1 - Yamamoto, Tomoyuki Y1 - 2020/12/09/ N2 - Garnet structured compounds have been widely utilized as the host materials of phosphors. Due to their complicated structures with numerous atoms in a unit cell of the garnet structure, it is difficult to predict their crystal structures accurately by the first principles calculation, especially when they include magnetic elements. It was proposed to predict the structural parameters for spinel compounds by the empirical model employing ionic radii and electronegativities, which reproduced the experimental structural parameters of spinels successfully. In the present work, we propose a comprehensive and reliable model to explain and/or predict the structural parameters of the garnet structured materials using the machine learning. The lattice parameters of 182 garnet compounds reported in the database are compiled in our dataset to train the model. Using the ionic radii and electronegativities of the constituent elements of considered garnet compounds, we constructed the linear regression model fitted to the garnets' lattice constants in the dataset. The predicted values obtained as a result of the training of the model exhibited high correlation with the actual lattice constants, having the correlation coefficient of 0.988. For each composition in our dataset, the relative error between experimental and calculated lattice constants was less than 1.60%. TI - Modelling of Lattice Constants of the Garnet Structured Compounds Using Machine Learning M2 - online AV - none T2 - 30th annual meeting of Material Research Society of Japan, 2020 (MRS-J 2020) ER - TY - JOUR ID - SisLab3566 UR - http://dx.doi.org/10.1017/S0263574717000601 IS - 5 A1 - La, Hung Manh A1 - Dinh, Tran Hiep A1 - Pham, Nhan Huu A1 - Ha, Quang Phuc A1 - Pham, Anh Quyen Y1 - 2019/05// JF - Robotica VL - 37 SN - 0263-5747 TI - Automated robotic monitoring and inspection of steel structures and bridges SP - 947 AV - none EP - 967 ER - TY - JOUR ID - SisLab3128 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3128/ IS - 5 A1 - Lasko, Kristofer A1 - Vadrevu, Krishna Prasad A1 - Nguyen, Thi Nhat Thanh Y1 - 2018/// N2 - Air pollution is one of the major environmental concerns in Vietnam. In this study, we assess the current status of air pollution over Hanoi, Vietnam using multiple different satellite datasets and weather information, and assess the potential to capture rice residue burning emissions with satellite data in a cloud-covered region. We used a timeseries of Ozone Monitoring Instrument (OMI) Ultraviolet Aerosol Index (UVAI) satellite data to characterize absorbing aerosols related to biomass burning. We also tested a timeseries of 3-hourly MERRA-2 reanalysis Black Carbon (BC) concentration data for 5 years from 2012?2016 and explored pollution trends over time. We then used MODIS active fires, and synoptic wind patterns to attribute variability in Hanoi pollution to different sources. Because Hanoi is within the Red River Delta where rice residue burning is prominent, we explored trends to see if the residue burning signal is evident in the UVAI or BC data. Further, as the region experiences monsoon-influenced rainfall patterns, we adjusted the BC data based on daily rainfall amounts. Results indicated forest biomass burning from Northwest Vietnam and Laos impacts Hanoi air quality during the peak UVAI months of March and April. Whereas, during local rice residue burning months of June and October, no increase in UVAI is observed, with slight BC increase in October only. During the peak BC months of December and January, wind patterns indicated pollutant transport from southern China megacity areas. Results also indicated severe pollution episodes during December 2013 and January 2014. We observed significantly higher BC concentrations during nighttime than daytime with peaks generally between 2130 and 0030 local time. Our results highlight the need for better air pollution monitoring systems to capture episodic pollution events and their surface-level impacts, such as rice residue burning in cloud-prone regions in general and Hanoi, Vietnam in particular. JF - PLOS ONE VL - 13 SN - 1932-6203 TI - Analysis of air pollution over Hanoi, Vietnam using multi-satellite and MERRA reanalysis datasets AV - none ER - TY - JOUR ID - SisLab2078 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2078/ IS - 1 A1 - Laukens, Kris A1 - Hollunder, Jens A1 - Dang, Thanh Hai A1 - De Jaeger, Geert A1 - Kuiper, Martin A1 - Witters, Erwin A1 - Verschoren, Alain A1 - Van Leemput, Koenraad Y1 - 2010/// JF - BMC Bioinformatics VL - 11 SN - 1471-2105 TI - Flexible network reconstruction from relational databases with Cytoscape and CytoSQL SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab3266 UR - http://kse-conf.org/ A1 - Le, Anh Cuong A1 - Nguyen, Tuan Phong A1 - Tran, Quoc Long A1 - Dao, Bao Linh Y1 - 2018/11/01/ N2 - Wordalignmentmodelsareusedtogenerate word-aligned parallel text which is used in statistical machine translation systems. Currently, the most popular word alignment models are IBM models which have been widely applied in a large number of translation systems. The parameters of IBM models are estimated by using Maximum Likelihood principle, i.e. by counting the cooccurrence of words in the parallel text. This way of parameter estimation leads to the ?ambiguity? problem when some words stand together in many sentence pairs but each of them is not translation of any other. Additionally, this method requires large amount of training data to achieve good results. However, parallel text which is used to train the IBM models is usually limited for low-resource languages. In this work, we try to solve these two problems by adding semantic information to the models. Our semantic information is derived from word embeddings which only need monolingual data to train. We deploy evaluation on a language pair that has great differences in grammar structure, English-Vietnamese. Even with this challenged task, our proposed models gain signi?cant improvements in word alignment result and help increasing translation quality. TI - Integrating Word Embeddings into IBM Word Alignment Models SP - 79 M2 - Ho Chi Minh city, Vietnam AV - public EP - 84 T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab2467 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2467/ A1 - Le, Ba Cuong A1 - Nguyen, Van Son A1 - Nguyen, Duc Anh A1 - Pham, Ngoc Hung A1 - Vo, Dinh Hieu Y1 - 2017/05/15/ N2 - This paper presents a novel tool for change impact analysis of Java EE applications named JCIA. Analyzing the source code of the Java EE applications is a big challenge because of complexity and large scale of the applications. Moreover, components in Java EE applications are not only in Java language but also in different languages such as XHTML, XML, JSP, etc. This tool analyses source code of Java EE applications for building the dependency graphs (called JDG). The main idea for generating JDG is based on developing the source code analyzers for the typical technologies of Java EE such as Java Server Faces, Context and Dependency Injection, Web services, etc. Based on the obtained JDG and the given change sets, JCIA calculates the corresponding impact sets by applying the change impact analysis (CIA) based on change types and Wave-CIA method. The calculated impact sets help managers planning and estimating changes, developers implementing changes, and testers with regression testing. TI - JCIA: A Tool for Change Impact Analysis of Java EE Applications M2 - Danang, Vietnam AV - none T2 - 4th International Conference on Information Systems Design and Intelligent Applications ER - TY - CONF ID - SisLab1524 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1524/ A1 - Le, Ba Cuong A1 - Pham, Ngoc Hung A1 - Vo, Dinh Hieu Y1 - 2016/03/26/ N2 - B?o trì ph?n m?m hi?n nay ???c ?ánh giá là m?t trong nh?ng giai ?o?n khó kh?n nh?t, t?n kém nh?t và ?òi h?i k? thu?t cao trong su?t quá trình phát tri?n ph?n m?m. Các s?n ph?m ph?n m?m th??ng xuyên có nh?ng thay ??i nh? thêm m?i yêu c?u, s?a l?i ph?n m?m trong khi l?p trình viên th??ng ch? có mã ngu?n, không có ho?c thi?u tài li?u phát tri?n ph?n m?m. M?i s? thay ??i có th? tác ??ng ??n r?t nhi?u ph?n khác nhau c?a ch??ng trình. Phân tích s? ?nh h??ng khi thay ??i ph?n m?m (Software change impact analysis - CIA) là các k? thu?t nh?m xác ??nh nh?ng tác ??ng này, ?óng vai trò quan tr?ng trong vi?c hi?u v? ch??ng trình, d? ?oán nh?ng tác ??ng, ?ánh giá chi phí, l?a ch?n các ca ki?m th? ?? ki?m th? l?i c?ng nh? th?c hi?n chi?n l??c s?a ??i. Các k? thu?t CIA ???c quan tâm c?a r?t nhi?u chuyên gia, t? ti?p c?n theo h??ng phân tích t?nh c?ng nh? phân tích ??ng ch??ng trình. Tuy nhiên nh?ng k?t qu? hi?n t?i ch?a ?? m?nh ?? áp d?ng trong th?c ti?n khi ?? chính xác c?a các k? thu?t này còn th?p, t?p các thành ph?n b? ?nh h??ng b?i thay ??i tìm ???c th??ng quá l?n. Bên c?nh ?ó các k? thu?t CIA cho các ?ng d?ng ph?c t?p (kh?i l??ng mã ngu?n l?n, ch?a nhi?u lo?i ngôn ng? l?p trình, ?) ch?a thu ???c k?t qu? kh? quan. Chính vì v?y chúng tôi d? ki?n phát tri?n các k? thu?t CIA ?áp ?ng nh?ng v?n ?? trên v?i các m?c tiêu c? th?: ? ?? xu?t k? thu?t CIA m?i c?i ti?n ?? chính xác c?a t?p IS d?a trên s? k?t h?p m?t s? k? thu?t truy?n th?ng v?i các k? thu?t d?a trên l?ch s? phiên b?n ph?n m?m ? Nghiên c?u kh? n?ng ?ng d?ng trong vi?c l?a ch?n ca ki?m th? ?? ki?m th? l?i và l?a ch?n k? ho?ch s?a ??i ph?n m?m khi có yêu c?u nâng c?p, d?a trên vi?c phân h?ng các ph?n t? trong t?p IS ? Phát tri?n các công c? h? tr? các ph??ng pháp ?? xu?t và th?c nghi?m v?i nh?ng ph?n m?m kích th??c l?n, ?? ph?c t?p cao M?t s? k?t qu? d? ki?n: ? 01 bài báo ??ng trên t?p chí khoa h?c qu?c t?. ? 02 bài báo ??ng trên t?p chí khoa h?c có uy tín ? trong n??c. ? 02 bài báo cáo trên h?i ngh? qu?c t?. ? ?? xu?t ph??ng pháp m?i v?i ?? chính xác cao h?n các ph??ng pháp tr??c ?ây ? Xây d?ng công c? h? tr? có th? ?ng d?ng trong th?c t? ? ?? xu?t ??nh h??ng ?ng d?ng các k?t qu? c?a k? thu?t CIA trong b?o trì, ki?m th? l?i ph?n m?m. TI - M?t s? ph??ng pháp phân tích s? ?nh h??ng khi thay ??i mã ngu?n ph?n m?m M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab1980 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1980/ IS - 2 A1 - Le, Chi Luan A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung Y1 - 2016/// N2 - This paper introduces a framework for modeling and verifying safety properties of component-based systems (CBS) by extracting their models from designs in form of UML 2.0 sequence diagrams. Given UML 2.0 sequence diagrams of CBS, the framework extracts regular expressions exactly describing behaviors of the system. From these expressions, the proposed framework then generates accurate models represented by labeled transition systems (LTSs). After that, these models are used to modular check whether given designs satisfy required safety properties by using the assume-guarantee reasoning paradigm. This framework is not only useful for modeling and verifying designs at design phase, but also for e?ectively rechecking CBS in the context of software evolution. Implemented tools and experimental results are also presented in order to show the feasibilities and e?ectiveness of the proposed framework. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - A Framework for Modeling and Modular Verifying of Component-Based System Designs SP - 31 AV - public EP - 42 ER - TY - CONF ID - SisLab2699 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2699/ A1 - Le, Chi Luan A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung Y1 - 2017/04// N2 - The assume-guarantee veri?cation has been recognized as a promising method for solving the state space explosion in modular model checking of component-based software. However, the counterexample analysis technique used in this method has huge complexity and the computational cost for generating assumptions is very high. As a result, the method is di?cult to be applied in practice. Therefore, this paper presents two improvements of the assume-guarantee veri?cation method in order to solve the above problems. The ?rst one is a counterexample analysis method that is simple to implement but e?ective enough to prevent the veri?cation process from in?nite loops when considering the last action of counterexample as su?x in implementation. This is done by ?nding a su?x that can make the observation table not closed when being added to the su?x set of the table and use that su?x for the learning process. The second one is a reduction of the number of membership queries to be asked to teacher when learning assumptions. This results in a signi?cantly faster speed in generating assumption than that of the original algorithm. An implemented tool and experimental results are also described to show the e?ectiveness of the improvements. TI - On Implementation of the Assumption Generation Method for Component-Based Software Verification SP - 549 M2 - Kanazawa, Japan AV - public EP - 558 T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab2298 UR - http://doi.org/10.1109/WIIAT.2008.180 A1 - Le, Dieu Thu A1 - Nguyen, Cam Tu A1 - Ha, Quang Thuy A1 - Phan, Xuan Hieu A1 - Horiguchi, Susumu Y1 - 2008/12/09/ TI - Matching and Ranking with Hidden Topics towards Online Contextual Advertising SP - 888 M2 - Sydney, Australia AV - none EP - 891 T2 - The 2008 IEEE/WIC/ACM International Conference on Web Intelligence ER - TY - CONF ID - SisLab1998 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1998/ A1 - Le, Dinh Minh A1 - Vuong, Tung Long A1 - Hoang, Van Xiem A1 - Dinh, Trieu Duong A1 - Le, Thanh Ha Y1 - 2016/10/13/ N2 - Nowadays, the development of three-dimension (3D) video applications such as three-dimensional television (3D-TV) and free-viewpoint television (FTV) has greatly increased human experiences. View synthesis method like depth-image-based-rendering (DIBR), plays a significant role in 3D content creation, 3D transmission, and has been integrated into video coding standards such as 3D-High efficiency video coding (3D-HEVC). However, the current DIBR method employs only the disparity correlation between views to create a so-called synthesized view; thus, unable to take full advantages of available synthesized information. In this paper, we propose a novel view synthesis method which takes advantages of not only the disparity correlation but also the temporal correlation between views. In the proposed method, an effective motion compensation based frame interpolation is employed to generate a temporal prediction view which is then combined with the DIBR rendered view to obtain the final synthesized view. Experimental results show that the proposed method can achieve the synthesized view with significantly outperforming other conventional techniques in terms of both peak signal-to noise ratio (PSNR) and subjective visual quality. TI - Improving 3D-TV View Synthesis Using Motion Compensated Temporal Interpolation SP - 1 M2 - Hanoi, Vietnam AV - public EP - 6 T2 - the 2016 International Conference Advanced Technologies for Communications (ATC) ER - TY - JOUR ID - SisLab1899 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1899/ IS - 3 A1 - Le, Dinh Thanh Y1 - 2009/// JF - International Journal of Information Processing Systems VL - 5 TI - Topological boundary detection in wireless sensor networks SP - 145 AV - none EP - 150 ER - TY - CONF ID - SisLab131 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/131/ A1 - Le, Dinh Thanh A1 - Ho, Thuan A1 - Nguyen, Dai Tho Y1 - 2012/// TI - More Efficient Path Optimization for Greedy Geography Routing in Wireless Sensor Networks SP - 49 M2 - Hanoi AV - none EP - 54 T2 - H?i ngh? Khoa h?c v? Công ngh? thông tin Tr??ng ??i h?c S? ph?m Hà N?i ER - TY - CONF ID - SisLab2377 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2377/ A1 - Le, Dinh Thanh A1 - Nguyen, Dai Tho Y1 - 2010/// N2 - In this paper, we propose Greedy with Path Optimization Routing (GPOR), a novel geographic routing protocol for wireless sensor networks. GPOR finds initial routing paths by following a greedy with recovery strategy, then uses a follow-up technique to optimize the paths. An attempt is also made to create routing entries applicable to destination areas rather than individual nodes. Main advantages of GPOR are path optimization and void avoidance capacities. We implement GPOR in ns-2 and present simulation results. TI - Greedy Geographic Routing with Path Optimization in Wireless Sensor Networks SP - 148 M2 - Hanoi, Vietnam AV - public EP - 153 T2 - 2010 IEEE-RIVF International Conference on Computing and Communication Technologies ER - TY - CONF ID - SisLab2375 UR - http://soict.hust.edu.vn/~soict2011/ A1 - Le, Dinh Thanh A1 - Nguyen, Dai Tho A1 - Ho, Thuan Y1 - 2011/// N2 - Beaconless and contention-based geographic routing is an attractive approach to resource-constrained wireless sensor networks. Aggressive contention is the most cost-efficient form of contention-based geographic routing since it uses no control packet. Nevertheless, to avoid duplicated data packets, aggressive contention must set restriction on the contention area. Consequently, its packet delivery rate is limited. On the other hand, non-aggressive contention maximizes packet delivery rate by making use of full contention area. As the compensation, control packets have to be used and additional delay is introduced. In this paper, we propose Hybrid Contention-Based Geographic Routing (HCGR) - a protocol that takes full aggressive contention and uses non-aggressive contention for recovering aggressive contention from failure. If aggressive contention succeeds, non-aggressive contention is suppressed. In cases where aggressive contention fails, non-aggressive contention is taken place to deliver data packets. Thus, HCGR can maximize packet delivery rate while keeping its overheads reasonably low. We implement HCGR and single-form protocols in the network simulator ns-2, conduct extensive simulations and present simulation results. TI - Hybrid Contention-Based Geographic Routing in Wireless Sensor Networks SP - 86 M2 - Hanoi, Vietnam AV - public EP - 91 T2 - Second International Symposium on Information and Communication Technology (SoICT 2011) ER - TY - CONF ID - SisLab2639 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2639/ A1 - Le, Dinh Thanh A1 - Phan, Xuan Tien Y1 - 2017/// N2 - Character distribution has been extensively used in literature to build models for the detection of web attacks. This paper explores that character distribution models should be built at attribute level in order to achieve a reasonable accuracy. However, attaching detection models to every single attribute leads to high memory and time complexities, which make attribute-specific models less practical. To remove these barriers, a simple yet effective solution has been proposed. In more details, by exploiting the language function of characters, character distribution can be reduced in size and rearranged in an intentional manner so that both time and memory complexities are reduced significantly. Detection models that use minimized and rearranged character distribution are, therefore, highly efficient and practical, especially suitable to large, high-traffic web applications. TI - On the usage of character distribution for the detection of web attacks M2 - Hue, Vietnam AV - none T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - RPRT ID - SisLab3724 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3724/ A1 - Le, Duc-Trong Y1 - 2019/10/30/ N2 - Constructing and maintaining open source projects is not an easy work. Developers usually need to tackle a lot of bugs reported by users. The first step of the fixing progress is to find all relevant files respect to given reports. This step takes time and human resources. Motivating from this context, various learning-to-rank models were proposed in order to automatically rank files and generate suggestions for developers. The actual related files are expected to be appeared in high positions of the ranking. In the scope of this paper, a mean reciprocal rank optimization approach is investigated for the learning-to-rank relevant files for bug re- ports task. Given a bug report, the ranking of a source file is approximated by a function aggregating features which represent their relationship. The weights of these features are learned previously to maximize the mean reciprocal rank of known relevant files on training bug reports. In the ex- perimental section, the introduced model is evaluated on three Java open source projects namely Tomcat, AspectJ and SWT. The three different versions of the model are also explored and compared to a recent state-of-the-art method in recommending related files for bug reports. PB - Springer M1 - technical_report TI - Finding Relevant Files for Bug Reports Based on Mean Reciprocal Rank Maximization Approach AV - public EP - 7 ER - TY - CONF ID - SisLab3709 UR - https://www.ijcai.org/proceedings/2017/286 A1 - Le, Duc-Trong A1 - Lauw, Hady W. A1 - Fang, Yuan Y1 - 2017/08/19/ N2 - Personalized item recommendation is useful in narrowing down the list of options provided to a user. In this paper, we address the problem scenario where the user is currently holding a basket of items, and the task is to recommend an item to be added to the basket. Here, we assume that items currently in a basket share some association based on an underlying latent need, e.g., ingredients to prepare some dish, spare parts of some device. Thus, it is important that a recommended item is relevant not only to the user, but also to the existing items in the basket. Towards this goal, we propose two approaches. First, we explore a factorization-based model called BFM that incorporates various types of associations involving the user, the target item to be recommended, and the items currently in the basket. Second, based on our observation that various recommendations towards constructing the same basket should have similar likelihoods, we propose another model called CBFM that further incorporates basket-level constraints. Experiments on three real-life datasets from different domains empirically validate these models against baselines based on matrix factorization and association rules. TI - Basket-Sensitive Personalized Item Recommendation M2 - Melbourne, Australia AV - public T2 - the Twenty-Sixth International Joint Conference on Artificial Intelligence ER - TY - CONF ID - SisLab3707 UR - https://www.ijcai.org/proceedings/2019/389 A1 - Le, Duc-Trong A1 - Lauw, Hady W. A1 - Fang, Yuan Y1 - 2019/08/10/ N2 - Items adopted by a user over time are indicative of the underlying preferences. We are concerned with learning such preferences from observed sequences of adoptions for recommendation. As multiple items are commonly adopted concurrently, e.g., a basket of grocery items or a sitting of media consumption, we deal with a sequence of baskets as input, and seek to recommend the next basket. Intuitively, a basket tends to contain groups of related items that support particular needs. Instead of recommending items independently for the next basket, we hypothesize that incorporating information on pairwise correlations among items would help to arrive at more coherent basket recommendations. Towards this objective, we develop a hierarchical network architecture codenamed Beacon to model basket sequences. Each basket is encoded taking into account the relative importance of items and correlations among item pairs. This encoding is utilized to infer sequential associations along the basket sequence. Extensive experiments on three public real-life datasets showcase the effectiveness of our approach for the next-basket recommendation problem. TI - Correlation-Sensitive Next-Basket Recommendation M2 - Macau, China AV - public T2 - the Twenty-Eighth International Joint Conference on Artificial Intelligence ER - TY - CONF ID - SisLab3708 UR - https://www.ijcai.org/proceedings/2018/474 A1 - Le, Duc-Trong A1 - Lauw, Hady W. A1 - Fang, Yuan Y1 - 2018/07/13/ N2 - Our interactions with an application frequently leave a heterogeneous and contemporaneous trail of actions and adoptions (e.g., clicks, bookmarks, purchases). Given a sequence of a particular type (e.g., purchases)-- referred to as the target sequence, we seek to predict the next item expected to appear beyond this sequence. This task is known as next-item recommendation. We hypothesize two means for improvement. First, within each time step, a user may interact with multiple items (a basket), with potential latent associations among them. Second, predicting the next item in the target sequence may be helped by also learning from another supporting sequence (e.g., clicks). We develop three twin network structures modeling the generation of both target and support basket sequences. One based on "Siamese networks" facilitates full sharing of parameters between the two sequence types. The other two based on "fraternal networks" facilitate partial sharing of parameters. Experiments on real-world datasets show significant improvements upon baselines relying on one sequence type. TI - Modeling Contemporaneous Basket Sequences with Twin Networks for Next-Item Recommendation M2 - Stockholm, Sweden AV - none T2 - the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18) ER - TY - CONF ID - SisLab3710 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3710/ A1 - Le, Duc-Trong A1 - Lauw, Hady W. A1 - Fang, Yuan Y1 - 2016/09// N2 - Users express their preferences for items in diverse forms, through their liking for items, as well as through the sequence in which they consume items. The latter, referred to as ?sequential preference?, manifests itself in scenarios such as song or video playlists, topics one reads or writes about in social media, etc. The current approach to modeling sequential preferences relies primarily on the sequence information, i.e., which item follows another item. However, there are other important factors, due to either the user or the context, which may dynamically a?ect the way a sequence unfolds. In this work, we develop generative modeling of sequences, incorporating dynamic user-biased emission and context-biased transition for sequential preference. Experiments on publicly-available real-life datasets as well as synthetic data show significant improvements in accuracy at predicting the next item in a sequence. TI - Modeling sequential preferences with dynamic user and context factors M2 - Rivar De Garda, Italy AV - public T2 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery ER - TY - CONF ID - SisLab2707 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2707/ A1 - Le, Hoang Quynh A1 - Can, Duy Cat A1 - Dang, Thanh Hai A1 - Tran, Mai Vu A1 - Ha, Quang Thuy A1 - Collier, Nigel Y1 - 2017/11/23/ N2 - There have been an increasing number of various machine learning-based models successfully proposed and applied for automatic chemical-induced disease (CID) relation extraction. They, however, usually require carefully handcrafted rich feature sets, which rely on expert knowledge, thus require expensive human labor but normally still cannot generalize data well enough. In this paper, we propose a CID relation extraction model that learns features automatically through a Convolutional Neural Network (CNN) instead of traditional handcrafted features. We exploit the shortest dependency path between a disease and a chemical for identifying their CID relation. Dependency relations, with and without their direction information, are further investigated. Experimental results on benchmark datasets (namely the BioCreative V dataset) are very potential, demonstrating the effectiveness of our proposed model for CID relation extraction. TI - Improving Chemical-induced Disease Relation Extraction with Learned Features Based on Convolutional Neural Network SP - 300 M2 - Hue, Vietnam AV - public EP - 305 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab3477 UR - https://www.aclweb.org/anthology/N19-1298 A1 - Le, Hoang Quynh A1 - Can, Duy Cat A1 - Ha, Quang Thuy A1 - Collier, Nigel Y1 - 2019/06/02/ N2 - To extract the relationship between two entities in a sentence, two common approaches are (1) using their shortest dependency path (SDP) and (2) using an attention model to capture a context-based representation of the sentence. Each approach suffers from its own disadvantage of either missing or redundant information. In this work, we propose a novel model that combines the advantages of these two approaches. This is based on the basic information in the SDP enhanced with information selected by several attention mechanisms with kernel filters, namely RbSP (Richer-but- Smarter SDP). To exploit the representation behind the RbSP structure effectively, we develop a combined deep neural model with a LSTM network on word sequences and a CNN on RbSP. Experimental results on the SemEval-2010 dataset demonstrate improved performance over competitive baselines. The data and source code are available at https: //github.com/catcd/RbSP. PB - Association for Computational Linguistics JF - 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics VL - 1 TI - A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction SP - 2902 AV - public EP - 2912 ER - TY - CONF ID - SisLab3171 UR - http://www.aclweb.org/anthology/D18-1250 A1 - Le, Hoang Quynh A1 - Can, Duy Cat A1 - Vu, Tien Sinh A1 - Dang, Thanh Hai A1 - Pilehvar, Mohammad Taher A1 - Collier, Nigel Y1 - 2018/// N2 - Experimental performance on the task of relation classification has generally improved using deep neural network architectures. One major drawback of reported studies is that individual models have been evaluated on a very narrow range of datasets, raising questions about the adaptability of the architectures, while making comparisons between approaches difficult. In this work, we present a systematic large-scale analysis of neural relation classification architectures on six benchmark datasets with widely varying characteristics. We propose a novel multi-channel LSTM model combined with a CNN that takes advantage of all currently popular linguistic and architectural features. Our ?Man for All Seasons? approach achieves state-of-the-art performance on two datasets. More importantly, in our view, the model allowed us to obtain direct insights into the continued challenges faced by neural language models on this task. Example data and source code are available at: https://github. com/aidantee/MASS. TI - Large-scale Exploration of Neural Relation Classification Architectures SP - 2266 M2 - Brussels, Belgium AV - public EP - 2277 T2 - Conference on Empirical Methods in Natural Language Processing (EMNLP 2018) ER - TY - CONF ID - SisLab3342 UR - http://www.aclweb.org/anthology/D18-1250 A1 - Le, Hoang Quynh A1 - Can, Duy Cat A1 - Vu, Tien Sinh A1 - Dang, Thanh Hai A1 - Pilehvar, Mohammad Taher A1 - Collier, Nigel Y1 - 2018/11// TI - Large-scale Exploration of Neural Relation Classification Architectures AV - none M2 - Brussels, Belgium T2 - The 2018 Conference on Empirical Methods in Natural Language Processing ER - TY - CONF ID - SisLab1725 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1725/ A1 - Le, Hoang Quynh A1 - Tran, Mai Vu A1 - Dang, Thanh Hai A1 - Collier, Nigel Y1 - 2015/// N2 - Hoang-Quynh Le, Mai-Vu Tran, Thanh-Hai Dang, and Nigel Collier TI - The UET-CAM System in the BioCreAtIvE V CDR Task M2 - Spain AV - none T2 - The 5th BioCreative Challenge Evaluation ER - TY - JOUR ID - SisLab2472 UR - http://doi.org/10.1093/database/baw102 A1 - Le, Hoang Quynh A1 - Tran, Mai Vu A1 - Dang, Thanh Hai A1 - Ha, Quang Thuy A1 - Collier, Nigel Y1 - 2016/// N2 - The BioCreative V chemical-disease relation (CDR) track was proposed to accelerate progress of text mining in facilitating integrative understanding ofchemical substances, diseases and their relations. In this article, we describe an extension of the UET-CAM system for mining chemical-disease relations from text data, of which performance was ranked 4th among 18 participating corresponding systems by the BioCreative CDR track committee. In Disease Named Entity Recognition and Normalization (DNER) phase, our system employs joint learning with a perceptron-based named entity recognizer (NER) and a back-off model with Semantic Supervised Indexing (SSI) and Skip-gram for named entity normalization (NEN). Crucially, for solving the chemical-induced disease (CID) sub-task, we propose a pipeline that includes a coreference resolution module and a SVM intra-sentence relations extraction model. The former module utilizes a multi-pass sieve to identify inter-sentence references for entities while the latter is trained on both the CDR data and our silverCID corpus with a rich feature set. SilverCID is the silver standard corpus contains more than 50 thousands sentences which are automatically built based on the CTD database in order to provide evidence for the CID relation extraction. We critically evaluated our method on the CDR test set in order to clarify the contribution of our system components. Results show an F1 of 82.44 for the DNER task, and a best performance of F1 58.90 on the CID task. The comparisons also demonstrate the significant contribution of the multi-pass sieve coreference resolution method and the silverCID corpus. JF - Database VL - 2016 SN - 1758-0463 TI - Sieve-based coreference resolution enhances semi-supervised learning model for chemical-induced disease relation extraction SP - subjects AV - public EP - IT ER - TY - CONF ID - SisLab1525 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1525/ A1 - Le, Hoang Quynh A1 - Tran, Mai Vu A1 - Dang, Thanh Hai A1 - Ha, Quang Thuy A1 - Nigel, Collier Y1 - 2016/03/26/ N2 - The BioCreative V chemical-disease relation (CDR) track was proposed to accelerate progress of text mining in facilitating integrative understanding of chemical substances, diseases and their relations. In this article, we describe an extension of the UET-CAM system for mining chemical- disease relations from text data, of which performance was ranked 4th among 18 participating corresponding systems by the BioCreative CDR track committee. In Disease Named Entity Recognition and Normalization (DNER) phase, our system employs joint learning with a perceptron-based named entity recognizer (NER) and a back-off model with Semantic Supervised Indexing (SSI) and Skip-gram for named entity normalization (NEN). Crucially, for solving the chemical-induced disease (CID) sub-task, we propose a pipeline that includes a coreference resolution module and a SVM intra-sentence relations extraction model. The former module utilizes a multi-pass sieve to identify inter-sentence references for entities while the latter is trained on both the CDR data and our silverCID corpus with a rich feature set. SilverCID is the silver standard corpus contains more than 50 thousands sentences which are automatically built based on the CTD database in order to provide evidence for the CID relation extraction. We critically evaluated our method on the CDR test set in order to clarify the contribution of our system components. Results show an F1 of 82.44 for the DNER task, and a best performance of F1 58.90 on the CID task. The comparisons also demonstrate the significant contribution of the multi-pass sieve coreference resolution method and the silverCID corpus. TI - Sieve-based coreference resolution enhances semi-supervised learning model for chemical-induced disease relations extraction M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1610 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1610/ A1 - Le, Hoang Quynh A1 - Tran, Mai Vu A1 - Dang, Thanh Hai A1 - Nigel, Collier Y1 - 2015/// N2 - In this paper, we describe a system developed for the BioCreative Vchemical-disease relation (CDR) task. The Disease Named Entity Recognition and Normalization (DNER) model employs joint learning using a perceptronbased named entity recognizer (NER) and a back-off model for named entity normalization (NEN). In order to maximize both precision and recall, our NEN adopts a sequential back-off ensemble approach based on Semantic Supervised Indexing (SSI) - a supervised Word Embedding (WE) method- giving results by inference from training data, and Skip-gram - an unsupervised WE methodtaking advantage of large unlabeled data. In the Chemical-induced diseases relation extraction (CID) model, we firstly resolve co-references by using a multipass sieve to identify cross-sentence references for entities, thus enabling intrasentence relations to be discovered more easily. Following this we extract CID relations using a support vector machine model trained on supervised sentence data from the CDR training and development dataset. We evaluated our method on both the DNER test set and the CID test set. Results show an F1 of 76.44 for the DNER tas TI - The UET-CAM System in the BioCreAtIvE V CDR Task SP - 208 M2 - Sevilla, Spain AV - none EP - 214 T2 - 2015: the 5th BioCreative challenge evaluation workshop ER - TY - JOUR ID - SisLab2481 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2481/ IS - 2 A1 - Le, Hong Anh A1 - Dao, Thi Huong A1 - Truong, Ninh Thuan Y1 - 2017/04// N2 - In software development, refactoring is a process that improves the system internal structure without altering its external behavior. Applying design patterns, which are common reusable solutions of several kinds of problems is widely adopted. This technique, however, raises a challenging issue that after applying design patterns the software system may not preserve some certain behavioral properties. This paper proposes a new approach to checking consistency between original software system and its evolution at both design and implementation phases. First, we formalize elements of software designs and programs. Methods, based on these formalizations, are proposed for verifying the design and implementation of the system. Finally, the paper presents a case study of Adaptive Road Traffic Control system to illustrate the proposed approach in detail. PB - Springer JF - Mobile networks and Applications VL - 22 SN - 1383-469X TI - A formal approach to checking consistency in software refactoring SP - 356 AV - public EP - 366 ER - TY - JOUR ID - SisLab1900 UR - https://springerplus.springeropen.com/articles/10.1186/s40064-016-2657-8 IS - 1000 A1 - Le, Hong Anh A1 - Shin, Nakajima A1 - Truong, Ninh Thuan Y1 - 2016/07/07/ N2 - Formal analysis of functional properties of system requirements needs precise descriptions. However, the stakeholders sometimes describe the system with ambiguous, vague or fuzzy terms, hence formal frameworks for modeling and verifying such requirements are desirable. The Fuzzy If?Then rules have been used for imprecise requirements representation, but verifying their functional properties still needs new methods. In this paper, we propose a refinement-based modeling approach for specification and verification of such requirements. First, we introduce a representation of imprecise requirements in the set theory. Then we make use of Event-B refinement providing a set of translation rules from Fuzzy If?Then rules to Event-B notations. After that, we show how to verify both safety and eventuality properties with RODIN/EventB. Finally, we illustrate the proposed method on the example of Crane Controller. PB - Springer JF - SpringerPlus VL - 5 TI - Formal analysis of imprecise system requirements with Event?B AV - public ER - TY - CONF ID - SisLab1296 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1296/ A1 - Le, Hong Anh A1 - Truong, Ninh Thuan Y1 - 2014/04// N2 - Context awareness is a computing paradigm that makes applications responsive and adaptive with their environment. Formal modeling and verification of context-aware systems are challenging issues in the development as they are complex and uncertain. In this paper, we propose an approach to use a formal method Event-B to model and verify such systems. First, we specify a context aware system?s components such as context data entities, context rules, context relations by Event-B notions. In the next step, we use the Rodin platform to verify the system?s desired properties such as safety properties. It aims to benefit from natural representation of context awareness concepts in Event-B and proof obligations generated by refinement mechanism to ensure the correctness of systems. We illustrate the use of our approach on a simple example. TI - Formal Modeling and Verification of Context-Aware Systems using Event-B SP - 250 M2 - Phu Quoc, Vietnam AV - none EP - 259 T2 - 2014: the 2nd International Conference on Context-Aware Systems and Applications (ICCASA) ER - TY - CONF ID - SisLab1901 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1901/ A1 - Le, Hong Anh A1 - Truong, Ninh Thuan Y1 - 2016/// N2 - In recent years, the number of Android smartphones increase dramatically and new applications are added numerously in Google store. Android developers usually have to deal with the difficulties such as limited capacity battery, screen design, and limited resources. Among them, specifying graphical user interfaces (GUI) of an application is one of the most important issues. This paper presents a new method to analyze GUI specifications of an Android application. We employ Event-B formal method and its refinement mechanism to formalize the specifications and to check if the constraints are satisfied. A running example of a Note application is given to illustrate the proposed method in detail. TI - A New Method to Analyze Graphical User Interfaces of Android Applications M2 - Viet Nam AV - none T2 - 5th EAI International Conference on Context-Aware Systems and Applications (ICCASA) ER - TY - CONF ID - SisLab1647 UR - http://dx.doi.org/10.1145/2695664.2696038 A1 - Le, Hong Anh A1 - Truong, Ninh Thuan A1 - Nakajima, Shin Y1 - 2015/// TI - Verifying eventuality properties of imprecise system requirements using event-B SP - 1651 AV - none EP - 1653 T2 - SAC 2015 ER - TY - CONF ID - SisLab1526 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1526/ A1 - Le, Hong Hai Y1 - 2016/03/26/ N2 - Fingerprints are most used biometrics features for identification. Although state-of-the-art algorithms are very accurate, but the need for processing speed for databases with millions fingerprints are very demanding. GPU devices are used widely in parallel computing tasks for their efficiency and low-cost. Most approaches make use of GPU for the filtering process in a multi-stage matching system. In this paper, we present a complete fingerprint matching algorithm on GPU. Our approach uses minutia cylinder-code (MCC) representation with a global consolidation stage and a careful design to make it suitable for the architecture of GPU. The result tested with GTX- 680 device shows that the proposed algorithm can perform 1.8 millions matches per second, making it applicable for real time identification systems with databases of millions fingerprints. TI - Fingerprint Matching on GPU for a Large Scale Identification System M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab2250 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2250/ A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa Y1 - 2016/// N2 - Vân tay la? ???c tr?ng sinh tr??c ho?c ????c s?? du?ng phô? biê?n rô?ng ra?i trong ca?c ??ng du?ng dân s?? cu?ng nh? pha?p ly?. Hiê?n nay ca?c kê?t qua? nghiên c??u ?a?t ????c ca?c kê?t qua? t??ng ?ô?i tô?t vê? ?ô? chi?nh xa?c va? tô?c ?ô? x?? ly?, nh?ng nhu câ?u vê? ca?c hê? thô?ng nhâ?n da?ng nhanh, chi?nh xa?c, ???c biê?t trên ca?c CSDL l??n ha?ng triê?u vân tay vâ?n la? ba?i toa?n nhâ?n ????c nhiê?u quan tâm nghiên c??u hiê?n nay. Trong ba?i ba?o na?y, chu?ng tôi kha?o sa?t tô?ng quan vê? mô?t sô? thuâ?t toa?n ?ô?i sa?nh vân tay hiê?n ta?i, chu? tro?ng ?ê?n ph??ng pha?p ?ô?i sa?nh d??a trên ma? tru?c ca?c ?iê?m tra?c MCC. T?? ?o?, chu?ng tôi ?a? ?ê? xuâ?t ky? thuâ?t ca?i tiê?n MCC d??a trên b???c gia cô?. Ky? thuâ?t na?y ?a? ????c tiê?n ha?nh th??c nghiê?m trên bô? CSDL vân tay chuâ?n FVC 2002. Kê?t qua? ?a?nh gia? chu?ng tôi thu ????c co? ca? ba ?ô? ?o EER, FMR100, FMR1000 chi?nh xa?c h?n so v??i gia?i thuâ?t MCC chuâ?n trong khi tô?c ?ô? so kh??p gâ?n nh? ????c gi?? nguyên. TI - Nâng cao thu?t toán ??i sánh mã tr? MCC M2 - Ho Chi Minh city, Vietnam AV - none T2 - The 7th International Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab2251 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2251/ A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa Y1 - 2013/// N2 - Consolidation stage is a component of fingerprint matching algorithms. It aims to check whether the local matching minutiae pairs still satisfy at the global alignment level of two fingerprints. In this paper, we review some consolidation methods used in the consolidation stage and propose a verification step to improve the quality of the consolidation methods by removing unmatched minutiae pairs. We carry out our proposal on two popular fingerprint matching algorithms: K-plet based and m-Triplet based one. The results of our experiments on FVC 2002-DB1 database show that the modified algorithms get better accuracy and not affect to the speed of the original one. TI - Toward an approach to improving the consolidation stage of fingerprint matching M2 - Hanoi, Vietnam AV - none T2 - The 2013 IEEE RIVF International Conference on Computing and Communication Technologies (RIVF) ER - TY - CONF ID - SisLab2323 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2323/ A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa A1 - Nguyen, Tri Thanh Y1 - 2017/// N2 - Minutiae based matching, the most popular approach used in fingerprint matching algorithms, is to calculate the similarity by finding the maximum number of matched minutiae pairs in two given fingerprints. With no prior knowledge about anchor/clue to match, this becomes a combinatorial problem. Global features of the fingerprints (e.g., singular core and delta points) can be used as the anchor to speed up the matching process. Most approaches using the conventional Poincare Index method with additional techniques to improve the detection of the core and delta points. Our approach uses Convolution Neural Networks which gained state-of-the-art results in many computer vision tasks to automatically detect those points. With the experimental results on FVC2002 database, we achieved the accuracy and false alarm of (96%, 7.5%) and (90%, 6%) for detecting core, and delta points, correspondingly. These results are comparative to those of the detection algorithms with human knowledge. TI - Automatic Detection of Singular Points in Fingerprint Images using Convolution Neural Networks M2 - Kanazawa, Japan AV - none T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1871 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1871/ A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa A1 - Nguyen, Tri Thanh Y1 - 2016/// PB - Springer TI - Exploiting GPU for Large Scale Fingerprint Identification SP - 688 M2 - Danang, Vietnam AV - none EP - 697 T2 - 8th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - JOUR ID - SisLab3361 UR - https://doi.org/10.1080/24751839.2017.1404712 A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa A1 - Nguyen, Tri Thanh Y1 - 2018/05/26/ N2 - Fingerprint identification is one of the most common biometric feature problems which is used in many applications. Although state-of-the-art algorithms are very accurate, the need for fast processing a big database of millions of fingerprints is highly demanding. In this paper, we propose to adapt the fingerprint matching algorithm based on minutia cylinder-code (MCC) on Graphics Processing Units (GPUs) to speed up the matching. Another contribution of this paper is to add a consolidation stage after matching to enhance the precision. The experimental results on a GTX-680 and a K40 tesla devices with standard datasets prove the proposed algorithm can be comparable with the state-of-the-art approach, and suitable for a real time identification application. PB - Taylor & Francis JF - Journal of Information and Telecommunication SN - 2475-1839 TI - Speeding up and enhancing a large-scale fingerprint identification system on GPU SP - 1 AV - public EP - 16 ER - TY - CONF ID - SisLab1869 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1869/ A1 - Le, Hong Hai A1 - Nguyen, Ngoc Hoa A1 - Nguyen, Tri Thanh Y1 - 2016/// PB - Springer TI - A complete fingerprint matching algorithm on GPU for a large scale identification system SP - 679 M2 - Ho Chi Minh city, Vietnam AV - none EP - 688 T2 - the 7th International Conference on Information Science and Application (ICISA) ER - TY - CONF ID - SisLab1885 UR - http://doi.org/10.1007/978-3-319-11680-8_52 A1 - Le, Hong Phuong A1 - Phan, Xuan Hieu A1 - Nguyen, Tien Dung Y1 - 2014/10// N2 - Question classification is a first necessary task of automatic question answering systems. Linguistic features play an important role in developing an accurate question classifier. This paper proposes to use typed dependencies which are extracted automatically from dependency parses of questions to improve accuracy of classification. Experiment results show that with only surface typed dependencies, one can improve the accuracy of a discriminative question classifier by over 8.0% on two benchmark datasets. VL - 326 SN - 2194-5357 TI - Using Dependency Analysis to Improve Question Classification SP - 653 M2 - Hanoi, Vietnam AV - restricted EP - 665 T2 - The 8th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1886 UR - http://doi.org/10.1109/RIVF.2013.6719875 A1 - Le, Hong Phuong A1 - Phan, Xuan Hieu A1 - Tran, The Trung Y1 - 2013/11// N2 - This paper investigates the effect of the label bias problem of maximum entropy Markov models for part-of-speech tagging, a typical sequence prediction task in natural language processing. This problem has been underexploited and underappreciated. The investigation reveals useful information about the entropy of local transition probability distributions of the tagging model which enables us to exploit and quantify the label bias effect of part-of-speech tagging. Experiments on a Vietnamese treebank and on a French treebank show a significant effect of the label bias problem in both of the languages. TI - On the effect of the label bias problem in part-of-speech tagging SP - 103 M2 - Hanoi, Vietnam AV - none EP - 108 T2 - The 2013 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) ER - TY - INPR ID - SisLab2965 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2965/ A1 - Le, Khanh Trinh Y1 - 2018/05/06/ N2 - AUTOSAR OS is a standard for automotive operating systems, which provides a specification that consists ofu nctionalities such as scheduling services, timing services, and memory protection. In this paper, we focus on memory protection features among them. As the AUTOSAR OS specification is described in natural language, its ambiguity may confuse developers as well as cause the contradiction of the specification, then eventually lead to serious problems of automotive systems such as bugs and errors. These problems in automotive systems relate directly to the safety of human being. Thus, it is very important to ensure the unambiguity and consistency of the specification. Our solution for the problems is formalizing the AUTOSAR OS specification using Event-B specification language which allows us to formally specify the functionalities of AUTOSAR OS and reduce the ambiguity of natural language. We developed a formal specification of the memory protection of AUTOSAR OS and verified its consistency. In this verification, we found the inconsistency of the specification during discharging proof obligations generated by RODIN which is a tool for Event-B. This inconsistency comes from the ambiguity of the original specification, and finding it by reviewing based on natural language description is very hard. In this paper, we explain how we found the inconsistency existed in the AUTOSAR OS standard after showing our approach to formalize and verify it with Event-B. TI - Formalization and Verification of AUTOSAR OS Standard's Memory Protection SP - 1 M2 - Guangzhou, China AV - public EP - 8 T2 - The 12th International Symposium on Theoretical Aspects of Software Engineering ER - TY - JOUR ID - SisLab1743 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1743/ IS - 8 A1 - Le, Khanh Trinh A1 - Vo, Dinh Hieu A1 - Pham, Ngoc Hung Y1 - 2015/// JF - Research, Development and Application on Information Technology and Communication Technology VL - E3 TI - A Method for Automated User Interaction Testing of Web Applications SP - 28 AV - none EP - 37 ER - TY - CONF ID - SisLab3279 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3279/ A1 - Le, Kim Thu A1 - Dang, Cao Cuong A1 - Le, Sy Vinh Y1 - 2018/11// N2 - Phylogenetic trees inferred from protein sequences are strongly affected by amino acid substitution models. Although different amino acid substitution models have been proposed, only a few were estimated for specific species such as the FLU model for influenza viruses. Among the most dangerous viruses for human health, dengue is always on top and the cause of dengue fever up to 100 million people per year. In this study, we built a specific amino acid substitution model for dengue protein sequences, called DEN. The dengue protein sequences were obtained from the NCBI dengue database and the model was estimated using the maximum likelihood method. Experiments showed that the new model DEN helped to build better phylogenetic trees than other existing models. We strongly recommend researchers to use the DEN model for analyzing dengue protein data. TI - Building a specific amino acid substitution model for dengue viruses SP - 242 AV - public EP - 246 T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE) (KSE'18) ER - TY - CONF ID - SisLab1950 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1950/ A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Nguyen, Viet Ha Y1 - 2016/// PB - IEEE TI - Domain-Driven Design Patterns: A Metadata-Based Approach SP - 247 M2 - Hanoi, Vietnam AV - none EP - 252 T2 - 12th International Conference on Computing and Communication Technologies (RIVF) ER - TY - CONF ID - SisLab1951 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1951/ A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Nguyen, Viet Ha Y1 - 2016/10// PB - IEEE TI - Domain-Driven Design Using Meta-Attributes: A DSL-Based Approach SP - subjects M2 - Hanoi, Vietnam AV - none EP - IT T2 - The 8th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab4146 UR - https://www.sciencedirect.com/science/article/abs/pii/S0950584919302563 A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Nguyen, Viet Ha Y1 - 2020/04// PB - Elsevier JF - Information and Software Technology VL - 120 SN - 0950-5849 TI - Generative Software Module Development for Domain-Driven Design with Annotation-Based Domain Specific Language SP - 1 AV - none EP - 32 ER - TY - INPR ID - SisLab2671 UR - http://kse2017.dhsphue.edu.vn/ A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Nguyen, Viet Ha Y1 - 2017/// TI - Generative Software Module Development: A Domain-Driven Design Perspective SP - 1 M2 - Hue, Vietnam AV - none EP - 7 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab3140 UR - https://www.journals.elsevier.com/computer-languages-systems-and-structures/ A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Nguyen, Viet Ha Y1 - 2018/12// N2 - The aim of object-oriented domain-driven design (DDD) is to iteratively develop software around a realistic domain model. Recent work in DDD use an annotation-based extension of object-oriented programming language to build the domain model. This model becomes the basis for a ubiquitous language and is used as input to generate software. However, the annotation-based extensions of these work do not adequately address the primitive and essential structural and behavioural modelling requirements of practical software. Further, they do not precisely characterise the software that is generated from the domain model. In this paper, we propose a DSL-based DDD method to address these limitations. We make four contributions: (1) An annotation-based domain-specific language (DSL) named DCSL, whose annotation extension expresses a set of essential structural constraints and the essential behaviour of a domain class. (2) A structural mapping between the state and behaviour spaces of a domain class. This mapping enables a technique for generating the behavioural specification. (3) A technique that uses DCSL to support behavioural modelling with UML activity diagram. (4) A 4-property characterisation of the software generated from the domain model. We demonstrate our method with a Java software tool and evaluate DCSL in the context of DDD. PB - Elsevier JF - Computer Languages, Systems and Structures VL - 54 SN - 1477-8424 TI - On Domain Driven Design Using Annotation-Based Domain Specific Language SP - 199 AV - none EP - 235 ER - TY - CONF ID - SisLab3581 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3581/ A1 - Le, Minh Duc A1 - Dang, Duc Hanh A1 - Vu, Thanh Ha Y1 - 2019/// N2 - Object-oriented domain-driven design (DDD) has been advocated to be the most common form of DDD, thanks to the popularity of object-oriented development methodologies and languages. Although the DDD method prescribes a set of design patterns for the domain model, it provides no languages or tools that realize these patterns. There have been several software frameworks developed to address this gap. However, these frameworks have not tackled two important software construction issues: generative, module-based software construction and development environment integration. In this paper, we propose a framework, named jDomainApp, and an Eclipse IDE plugin to address these issues. In particular, we extend our recent works on DDD to propose a software configuration language that expresses the software configuration, needed to automatically generate software from a set of modules. The modules are automatically generated using a module configuration language that we defined in a previous work. We demonstrate the framework and plug-in using a real-world software example. Further, we evaluate the performance of software construction to show that it is scalable to handle large software. TI - jDomainApp: A Module-Based Domain-Driven Software Framework M2 - Ha Long Bay AV - none T2 - SoICT 2019: 10th International Symposium on Information and Communications ER - TY - CONF ID - SisLab4059 UR - https://dl.acm.org/doi/10.1145/3404709.3404711 A1 - Le, Minh Duc A1 - Nguyen, Hoa Huy A1 - Nguyen, Duc Loc A1 - Nguyen, Viet Anh Y1 - 2020/06// N2 - This paper summarizes the research results of identifying the influencing factors in the online learning phase of a blended learning course. From such factors, we propose a model for predicting student outcomes. In our study, we have conducted several models in order to predict the student's learning outcomes, using a course of 231 participants. Obtained data from the logs file of an LMS system is analyzed using learning analytics and machine learning techniques, and the results propose that the four factors are the number of views, the number of posts, the number of forum views, and the number of on-time submitted assignments impact on the student's learning outcomes. For the forecast of the final exam grade based on the results of the formative assessment tests, Bayesian Ridge is the most accurate among the four conducted models (Linear Regression, KNR, SVM, Bayesian Ridge). Our study can be a useful material for lecturers and course designers in effectively organizing blended learning courses. TI - How to Forecast the Students' Learning Outcomes Based on Factors of Interactive Activities in a Blended Learning Course M2 - Tokyo Japan AV - none T2 - Proceedings of the 2020 The 6th International Conference on Frontiers of Educational Technologies ER - TY - INPR ID - SisLab2059 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2059/ A1 - Le, Minh Khoi A1 - Chang, Hsien-Tsung A1 - Chang, Yi-Min A1 - Hu, Yi-Hao A1 - Chen, Huan-Ting Y1 - 2016/12/20/ N2 - Nowadays, we can find part of people into the suboptimal health status. However, most of them have not enough time for health examinations regularly. Smart clothes which are wearable and convenient devices for monitoring physiological signals solve this problem. In this study, we develop an efficient multilevel healthy cloud system to analyzing data collected from CGU smart clothes. The cloud system classifies the raw data into three types: normal data, continuous data, and multimedia data. After that, the cloud system analyzes data and predict diseases using Apache Spark. And then, the system will transfer final results to smartphones. The experimental result shows that the cloud system achieves very high-speed performance. Moreover, the system has friendly health information presentation and effective authorization process to help doctors and patients contact each other. KW - cloud database; smart clothes; Spark; TI - An efficient multilevel healthy cloud system using Spark for smart clothes M2 - Chiayi, Taiwan AV - restricted T2 - 2016 International Computer Symposium ER - TY - JOUR ID - SisLab2330 UR - http://www.jcsce.vnu.edu.vn/index.php/jcsce IS - 1 A1 - Le, Nguyen Khoi A1 - Landa-Silva, Dario Y1 - 2016/01// N2 - We propose a multi-objective evolutionary algorithm (MOEA), named the Hyper-volume Evolutionary Algorithm (HVEA). The algorithm is characterised by three components. First, individual fitness evaluation depends on the current Pareto front, specifically on the ratio of its dominated hyper-volume to the current Pareto front hyper-volume, hence giving an indication of how close the individual is to the current Pareto front. Second, a ranking strategy classifies individuals based on their fitness instead of Pareto dominance, individuals within the same rank are non guaranteed to be mutually non-dominated. Third, a crowding assignment mechanism that adapts according to the individual's neighbouring area, controlled by the neighbouring area radius parameter, and the archive of non-dominated solutions. We perform extensive experiments on the multiple 0/1 knapsack problem using different greedy repair methods to compare the performance of HVEA to other MOEAs including NSGA2, SEAMO2, SPEA2, IBEA and MOEA/D. This paper shows that by tuning the neighbouring area radius parameter, the performance of the proposed HVEA can be pushed towards better convergence, diversity or coverage and this could be beneficial to different types of problems. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - Hyper-volume Evolutionary Algorithm SP - 10 AV - public EP - 32 ER - TY - CHAP CY - Boca Raton, FL, USA ID - SisLab4374 UR - https://doi.org/10.1201/9781003048855 A1 - Le, Nguyen Tuan Thanh A1 - Pham, Manh Linh N2 - The concept of ?Big data? was mentioned for the first time by Roger Mougalas in 2005. Volume hints to the size and/or scale of datasets. Until now, there is no universal threshold for data volume to be considered as big data, because of the time and diversity of datasets. Velocity indicates the speed of processing data. It can fall into three categories: streaming processing, real-time processing, or batch processing. Value alludes to the usefulness of data for decision making. Veracity denotes the quality and trustworthiness of datasets. Parallelization allows one to improve computation time by dividing big problems into smaller instances, distributing smaller tasks across multiple threads and then performing them simultaneously. Feature selection is useful for preparing high scale datasets. Sampling is a method for data reducing that helps to derive patterns in big datasets by generating, manipulating, and analyzing subsets of the original data. ED - Rajesh, G. ED - X. Mercilin, Raajini ED - Dang, Thi Thu Hien TI - Big Data Analytics and Machine Learning for Industry 4.0: An Overview AV - public EP - 11 Y1 - 2021/01/31/ PB - CRC Press - Taylor & Francis Group, LLC KW - Big Data Analytics KW - Industry 4.0 KW - Machine Learning KW - Deep Learning T3 - Big Data for Industry 4.0: Challenges and Applications SN - 9781003048855 SP - 1 T2 - Industry 4.0 Interoperability, Analytics, Security, and Case studies ER - TY - CONF ID - SisLab4220 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4220/ A1 - Le, Pham Van Linh A1 - Tran, Quang Bach A1 - Pham, Tien Lam A1 - Tran, Quoc Long Y1 - 2020/10// N2 - Molecular property prediction is a challenging task which aims to solve various issues of science namely drug discovery, materials discovery. It focuses on understanding the structure-property relationship between atoms in a molecule. Previous approaches have to face difficulties dealing with the various structure of the molecule as well as heavy computational time. Our model, in particular, utilizes the idea of message passing neural network and Schnet on the molecular graph with enhancement by adding the Node-aware Convolution and Edge Update layer in order to acquire the local information of the graph and to propagate interaction between atoms. Through experiments, our model has been shown the outperformance with previous deep learning methods in predicting quantum mechanical, calculated molecular properties in the QM9 dataset and magnetic interaction of two atoms in molecules approaches. TI - Node-aware convolution in Graph Neural Networks for Predicting molecular properties AV - public T2 - KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2020) ER - TY - CONF ID - SisLab2751 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2751/ A1 - Le, Phe Do Y1 - 2017/12/02/ N2 - H? mã xác th?c nh? ACORN là các h? mã xác th?c t?t, tuy nhiên nó v?n có nh?ng ?i?m y?u nh?t ??nh. Trong báo cáo này, chúng tôi t?ng h?p m?t s? ph??ng pháp t?n công lên h? ACORN: ph??ng pháp t?n công kh?i c?a Itai Dinur và Adi Shamir và các cu?c t?n công ph?c h?i tr?ng thái. T?n công kh?i là m?t d?ng t?n công ??i s? cho phép ??i ph??ng h? b?c c?a ph??ng trình ?a th?c t? nguyên th?y m?t mã. Các chuyên gia Md Iftekhar Salam, Harry Bartlett, Ed Dawson, Josef Pieprzyk, Leonie Simpson, and Kenneth Koon-Ho Wong ?ã s? d?ng t?n công kh?i ?? rút ng?n vòng c?a ACORN. T?n công kh?i trên 477 vòng kh?i t?o c?a ACORN có th? khôi ph?c 128 bit khóa v?i ?? ph?c t?p kho?ng 235. Các chuyên gia ch? ra, h? ph??ng trình tuy?n tính liên quan ??n tr?ng thái ban ??u c?a phiên b?n ??y ?? c?a ACORN có th? d? dàng t?o ra ?? th?c hi?n cu?c t?n công khôi ph?c tr?ng thái v?i ?? ph?c t?p 227:8. T?n công ph?c h?i tr?ng thái d?a vào tính ch?t tr??t ???c các chuyên gia Meicheng và Dongdai Lin nghiên c?u. Các chuyên gia ch? ra r?ng, ??i v?i m?i c?p (Key, IV) có c?p khác cùng t?o ra m?t tr?ng thái t?i các th?i ?i?m khác nhau v?i xác su?t 1. ?? kh?c ph?c các nh??c ?i?m c?a h? ACORN ? 128 hi?n nay, chúng tôi ?? xu?t thay các thanh ghi d?ch tuy?n tính b?i các thanh ghi d?ch phi tuy?n, t?ng ?? dài khóa, ?? dài véc t? kh?i t?o và m?i khóa, m?i véc t? kh?i t?o ch? s? d?ng m?t l?n. Các ph??ng pháp này ???c d?n ch?ng và minh h?a c? th?. Hy v?ng, nh?ng thông tin ??a l?i b? ích cho các chuyên gia l?p mã ?? t?o ra h? mã xác th?c nh? tôt h?n ?? s? d?ng hi?u qu? trong IoT. Keywords-Mã dòng, Mã dòng nh?, Mã dòng nh? xác th?c, ACORN, Ph??ng pháp t?n công kh?i, Ph??ng pháp t?n công d?a vào tính ch?t tr??t, ... TI - Các ph??ng pháp t?n công h? mã dòng xác th?c h?ng nh? ACORN?128 và ?? xu?t c?i ti?n ?? t?ng ?? an toàn AV - public T2 - H?i th?o l?n th? II M?t s? v?n ?? ch?n l?c v? An toàn, an ninh thông tin ER - TY - CONF ID - SisLab2058 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2058/ A1 - Le, Phe Do Y1 - 2016/11// N2 - Các gi?ng viên c?a Tr??ng ?HCN - ?HQG HN b?t ??u nghiên c?u và ?ào t?o v? An toàn thông tin t? r?t s?m v?i nh?ng cây ??i th? nh? GS. TSKH Phan ?ình Di?u, PGS. TS Tr?nh Nh?t Ti?n. Trong th?i gian qua, tr??ng ?HCN - ?HQG HN ?ã có nhi?u ?? tài Lu?n án Ti?n s?, Lu?n v?n Th?c s? và Khóa lu?n t?t nghi?p c?a sinh viên v? An tòn thông tin. ?HQG HN ?ã cho phép Tr??ng ?HCN m? chuyên ngành ?ào t?o v? An toàn thông tin. Côn g tác nghiên c?u và ?ào t?o v? ATTT ? Tr??ng ?HCN - ?HQG HN ngày càng phát tri?n, ngày càng có s? k?t n?i gi?a CNTT và ?T - VT và các khoa khác trong tr??ng, các ??n v? khác trong và ngoài n??c. TI - Tr??ng ??i h?c Công ngh?-?HQGHN, ngôi tr??ng tiên phong trong nghiên c?u và ?ào t?o v? an toàn thông tin M2 - Hanoi, Vietnam AV - public T2 - K? y?u H?i th?o l?n I: M?t s? v?n ?? ch?n l?c v? an toàn, an ninh thông tin ER - TY - CONF ID - SisLab2749 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2749/ A1 - Le, Phe Do A1 - Le, Trung Thuc A1 - Mai, Manh Trung A1 - Le, Thi Len A1 - Nguyen, Khac Hung A1 - Nguyen, Thi Hang A1 - Tran, Van Manh Y1 - 2017/11/23/ N2 - H? mã kh?i Neokeon ???c ?? xu?t vào n?m 2000 b?i b?n nhà khoa h?c Daemen, Peeters, Van Assche và Rijme. Môt trong các ?u ?i?m c?a Neokeon ?ó là nh? g?n, nhanh chóng tri?n khai trên ph?n c?ng chuyên d?ng, ngoài ra nó còn yêu c?u v? b? nh? RAM r?t th?p và ho?t ??ng hi?u qu? trên ?a n?n t?ng. Nh?ng trong thu?t toán h? Neokeon s? d?ng r?t nhi?u các ánh x? tuy?n tính và s? d?ng khóa tr?c ti?p trong khi mã hóa mà không thông qua nh?ng phép bi?n ??i làm vi?c tr??c v?i khóa. Do ?ó, Neokeon d??ng nh? khá mong manh tr??c nh?ng d?ng thám mã tuy?n tính. LED là thu?t toán ???c thi?t k? và ?? xu?t b?i Guo, Peyrin, Poschmann và Robshaw vào n?m 2011, là m?t trong nh?ng thu?t toán mã hóa nh? khá m?i. Kích th??c kh?i tin 64-bit v?i hai bi?n th? c?a khóa l?n l??t là 64-bit và 128-bit. Thi?t k? c?a LED có nhi?u ?i?m t??ng ??ng v?i thu?t toán AES. Trong bài báo này, chúng tôi th?c hi?n c?i ti?n thu?t toán LED và Neokeon, ??i v?i Neokeon chúng tôi ng?u nhiên hóa d? li?u t?i nh?ng ánh x? tuy?n tính và thao tác làm vi?c v?i khóa, nh?m m?c ?ích nâng cao ?? an toàn c?a Neokeon tr??c các thám mã tuy?n tính nh?ng không làm thay ??i nhi?u nh?ng ?u ?i?m s?n có c?a Neokeon, ??i v?i LED chúng tôi th?c hi?n c?i ti?n x? lý d? li?u trong kh?i step c?a thu?t toán này. Keywords-mã kh?i h?ng nh?; led; neokeon; tuy?n tính TI - C?i ti?n mã kh?i h?ng nh? h? LED và Neokeon AV - public T2 - H?i th?o Qu?c gia l?n th? XX: M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và truy?n thông - Quy Nh?n, 23 - 24/11/2017 ER - TY - CONF ID - SisLab1618 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1618/ A1 - Le, Phe Do A1 - Le, Trung Truc A1 - Mai, Manh Trung A1 - Le, Thi Thu Thao A1 - LêLe, Thi Len A1 - Do, Dang Thuan A1 - Nguyen, Van Thang A1 - Do, Cong Thanh Y1 - 2015/10/30/ TI - H? m?t mã kép an toàn SP - 88 M2 - Dac Lac AV - none EP - 94 T2 - K? y?u H?i th?o Qu?c gia l?n th? 17 "M?t s? v?n ?? ch?n l?c c?a CNTT & TT" ER - TY - JOUR ID - SisLab2757 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2757/ A1 - Le, Phe Do A1 - Mai, Manh Trung A1 - Le, Trung Truc A1 - Nguyen, Thi Hang A1 - Vuong, Thi Hanh A1 - Nguyen, Khac Hung A1 - Dinh, Thi Thuy A1 - Le, Thi Len Y1 - 2017/05/01/ N2 - Ng??i ta ??c tính ??n n?m 2020 s? có h?n 50 t? thi?t b? k?t n?i internet, ngh?a là m?i ng??i trên trái ??t trung bình s? có 6,6 ?? v?t tr?c tuy?n. Trái ??t s? ???c che ph? b?i hàng tri?u c?m bi?n thu th?p thông tin và t?i lên internet. ?? ??m b?o các k?t n?i ???c an ninh và an toàn các thi?t b? ?ó c?n có các h? m?t v?a có ?? m?t c?n thi?t, tiêu t?n ít n?ng l??ng, b? nh? và các c?ng logic. ?ó là các h? m?t mã nh?, g?m mã kh?i h?ng nh?, mã dòng h?ng nh? và các mã xác th?c h?ng nh?. Trong báo cáo này chúng tôi gi?i thi?u m?t s? h? m?t trong m?t mã nh?, ??a ra nh?ng ?i?m m?nh và ?i?m y?u c?a chúng. Các h? mã kh?i h?ng nh? ???c nghiên c?u g?m Klein, Led, Present, Mini ? AES, Mcrypyon và Katan. H? mã dòng ???c chúng tôi gi?i thi?u là Grain. K?t qu? có th? dùng làm tài li?u tham kh?o cho các nhà chuyên môn v? m?t mã nh? và IoT. JF - T?p chí Nghiên c?u Khoa h?c & Công ngh? Quân s? SN - 1859-1043 TI - Nghiên c?u m?t s? h? m?t mã nh? và ?ng d?ng trong IoT AV - public ER - TY - JOUR ID - SisLab2551 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2551/ A1 - Le, Phe Do A1 - Mai, Manh Trung A1 - Le, Trung Truc A1 - Nguyen, Thi Hang A1 - Vuong, Thi Hanh A1 - Nguyen, Khac Hung A1 - Dinh, Thi Thuy A1 - Le, Thi Len Y1 - 2017/03// N2 - Ng??i ta ??c tính ??n n?m 2020 s? có h?n 50 t? thi?t b? k?t n?i internet, ngh?a là m?i ng??i trên trái ??t trung bình s? có 6,6 ?? v?t tr?c tuy?n. Trái ??t s? ???c che ph? b?i hàng tri?u c?m bi?n thu th?p thông tin và t?i lên internet. ?? ??m b?o các k?t n?i ???c an ninh và an toàn các thi?t b? ?ó c?n có các h? m?t v?a có ?? m?t c?n thi?t, tiêu t?n ít n?ng l??ng, b? nh? và các c?ng logic. ?ó là các h? m?t mã nh?, g?m mã kh?i h?ng nh?, mã dòng h?ng nh? và các mã xác th?c h?ng nh?. Trong báo cáo này chúng tôi gi?i thi?u m?t s? h? m?t trong m?t mã nh?, ??a ra nh?ng ?i?m m?nh và ?i?m y?u c?a chúng. Các h? mã kh?i h?ng nh? ???c nghiên c?u g?m Klein, Led, Present, Mini ? AES, Mcrypyon và Katan. H? mã dòng ???c chúng tôi gi?i thi?u là Grain. K?t qu? có th? dùng làm tài li?u tham kh?o cho các nhà chuyên môn v? m?t mã nh? và IoT. JF - T?p chí Nghiên c?u Khoa h?c & Công ngh? Quân s? VL - 5 SN - 1859-1043 TI - Nghiên c?u m?t s? h? m?t mã nh? và ?ng d?ng vào IoT SP - 134 AV - public EP - 147 ER - TY - CONF ID - SisLab1620 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1620/ A1 - Le, Phe Do A1 - Nguyen, Canh Hoang Y1 - 2015/11/15/ TI - Entropy và ng??ng an toàn trong l?u tr? và truy?n thông tin AV - none M2 - Ho Chi Minh city T2 - H?i th?o Qu?c gia l?n th? 18 "M?t s? v?n ?? ch?n l?c c?a CNTT & TT" ER - TY - CONF ID - SisLab1619 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1619/ A1 - Le, Phe Do A1 - Nguyen, Canh Hoang Y1 - 2015/03/21/ TI - Phân tích h?i quy và ?ánh giá ch?t l??ng cu?c s?ng AV - none M2 - Danang, Vietnam T2 - H?i ngh? toàn qu?c l?n th? 4 v? Xác su?t - th?ng kê ER - TY - CONF ID - SisLab4101 UR - https://easychair.org/conferences/profile.cgi?track=260607;a=24818524 A1 - Le, Quang Dao A1 - Nguyen, Nhat Nam A1 - Luu, Quang Thang A1 - Ha, Duc Van A1 - Ha, Minh Cuong A1 - Pham, Bao Son A1 - Bui, Quang Hung Y1 - 2020/12// N2 - In this paper, we have outlined the need for solving the road detection problem, from which to compare and find the type of data to be used as Worldview-3 satellite images, to find out the method of success. Very good achievement in the DeepGlobe contest is D-LinkNet. This thesis has collected Worldview-3 and yandex image data for preprocessing data. We have collected and pre-processed Worldview-3 data, deployed and installed D-LinkNet. Application of evaluation method of IoU point of DeepGlobe. In addition, learn how to develop a realistic assessment method rather than a long-distance evaluation. D-LinkNet works well in sparsely populated areas, big roads such as suburbs or new urban areas, resettlement areas. In densely populated urban areas, small alleys are obscured by houses and trees, making it difficult and difficult to detect roads. Some areas with the same spectrum as the road are also mislabeled. PB - Tr??ng ??i h?c Ba?ch Khoa ? ?HQG-HCM TI - Research and application of D-LINKNET network to solve the problem of detecting road from WorldView-3 satellite image in Cau Giay district, Hanoi AV - public T2 - H?i th?o GIS toàn qu?c 2020 ER - TY - CONF ID - SisLab755 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/755/ A1 - Le, Quang Hung A1 - Le, Anh Cuong A1 - Huynh, Van Nam Y1 - 2013/11// TI - Parallel Phrase Extraction from English-Vienamese Parllel Corpora SP - 175 M2 - Hanoi, VIETNAM AV - none EP - 179 T2 - 2013: ER - TY - CONF ID - SisLab754 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/754/ A1 - Le, Quang Hung A1 - Nguyen, Duy Cuong A1 - Pham, Duc Hong A1 - Le, Anh Cuong Y1 - 2013/10// VL - 2 TI - Paragraph Alignment for English-Vietnamese Parallel E-books SP - 251 M2 - Hanoi, Vietnam AV - none EP - 260 T2 - 2013: The Fifth International Conference on Knowledge and Systems Engineering (KSE 2013) ER - TY - JOUR ID - SisLab786 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/786/ IS - 3 A1 - Le, Quoc Khanh A1 - Nguyen, Sy Tan A1 - Nguyen, Thi Nhat Thanh A1 - Le, Thanh Ha Y1 - 2013/06/30/ JF - IEIE Transactions on Smart Processing & Computing VL - 2 TI - Burned Area Detection After Wildfire Using Landsat 7 ETM+ SLC-off Images SP - 117 AV - none EP - 129 ER - TY - JOUR ID - SisLab1923 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1923/ IS - 1 A1 - Le, Quoc Khanh A1 - Pham, Chinh Huu A1 - Le, Thanh Ha Y1 - 2012/// JF - IEIE Transactions on Smart Processing & Computing VL - 1 TI - Road traffic control gesture recognition using depth images SP - 1 AV - none EP - 7 ER - TY - JOUR ID - SisLab69 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/69/ IS - 10 A1 - Le, Si Quang A1 - Dang, Cao Cuong A1 - Gascuel, Olivier N2 - Most protein substitution models use a single amino acid replacement matrix summarizing the biochemical properties of amino acids. However, site evolution is highly heterogeneous and depends on many factors that influence the substitution patterns. In this paper, we investigate the use of different substitution matrices for different site evolutionary rates. Indeed, the variability of evolutionary rates corresponds to one of the most apparent heterogeneity factors among sites, and there is no reason to assume that the substitution patterns remain identical regardless of the evolutionary rate. We first introduce LG4M, which is composed of four matrices, each corresponding to one discrete gamma rate category (of four). These matrices differ in their amino acid equilibrium distributions and in their exchangeabilities, contrary to the standard gamma model where only the global rate differs from one category to another. Next, we present LG4X, which also uses four different matrices, but leaves aside the gamma distribution and follows a distribution-free scheme for the site rates. All these matrices are estimated from a very large alignment database, and our two models are tested using a large sample of independent alignments. Detailed analysis of resulting matrices and models shows the complexity of amino acid substitutions and the advantage of flexible models such as LG4M and LG4X. Both significantly outperform single-matrix models, providing gains of dozens to hundreds of log-likelihood units for most data sets. LG4X obtains substantial gains compared with LG4M, thanks to its distribution-free scheme for site rates. Since LG4M and LG4X display such advantages but require the same memory space and have comparable running times to standard models, we believe that LG4M and LG4X are relevant alternatives to single replacement matrices. Our models, data, and software are available from http://www.atgc-montpellier.fr/models/lg4x. VL - 29 TI - Modeling Protein Evolution with Several Amino Acid Replacement Matrices Depending on Site Rates AV - none EP - 2936 Y1 - 2012/10/01/ PB - Oxford Journals JF - Molecular Biology and Evolution KW - amino acid substitutions SN - 1537-1719 SP - 2921 ER - TY - JOUR ID - SisLab2519 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2519/ IS - 136 A1 - Le, Sy Vinh A1 - Dang, Cuong A1 - Le, Quang Y1 - 2017/// N2 - Background: Amino acid substitution models play an essential role in inferring phylogenies from mitochondrial protein data. However, only few empirical models have been estimated from restricted mitochondrial protein data of a hundred species. The existing models are unlikely to represent appropriately the amino acid substitutions from hundred thousands metazoan mitochondrial protein sequences. Results: We selected 125,935 mitochondrial protein sequences from 34,448 species in the metazoan kingdom to estimate new amino acid substitution models targeting metazoa, vertebrates and invertebrate groups. The new models help to find significantly better likelihood phylogenies in comparison with the existing models. We noted remarkable distances from phylogenies with the existing models to the maximum likelihood phylogenies that indicate a considerable number of incorrect bipartitions in phylogenies with the existing models. Finally, we used the new models and mitochondrial protein data to certify that Testudines, Aves, and Crocodylia form one separated clade within amniotes. Conclusions: We introduced new mitochondrial amino acid substitution models for metazoan mitochondrial proteins. The new models outperform the existing models in inferring phylogenies from metazoan mitochondrial protein data. We strongly recommend researchers to use the new models in analysing metazoan mitochondrial protein data. JF - BMC Mol Evol VL - 17 TI - Improved mitochondrial amino acid substitution models for metazoan evolutionary studies AV - public ER - TY - JOUR ID - SisLab2518 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2518/ A1 - Le, Sy Vinh A1 - Le, Truc A1 - Le, Van Khanh A1 - Kieu, Huynh A1 - Do, Hang Y1 - 2017/// N2 - Dravet syndrome is a rare and severe type of epilepsy in infants. Approximately, 70?80% of patients with Dravet syndrome have mutations in SCN1A, the gene encoding the alpha-1 subunit of the sodium channel, while some simplex patients have variants in one of several other genes, including but not limited to GABRA1, SCN2A, STXBP1, GABRG2, and SCN1B. In this study, we performed exome sequencing in six patients with SCN1A-negative Dravet syndrome to identify other genes related to this disorder. In one affected individual, we detected a novel de novo heterozygous missense variant, c.695G>A, p.(Arg232Gln), in GABRB3, the gene encoding the ?3-subunit of the gamma-aminobutyric acid type A (GABAA) receptor, which mediates inhibitory signaling within the central nervous system. In summary, the data in this study identify GABRB3 as a candidate gene for Dravet syndrome. PB - Wiley JF - American Journal of Medical Genetics Part A VL - 9999 SN - 1552-4833 TI - A mutation in GABRB3 associated with Dravet syndrome SP - 1 AV - public EP - 6 ER - TY - CONF ID - SisLab2688 UR - http://ieeexplore.ieee.org/document/8119449/ A1 - Le, Sy Vinh A1 - Nguyen, Duc Canh A1 - Bui, Ngoc Thang A1 - Do, Thi Thu Hang A1 - Duong, Quoc Chinh A1 - Tran, Cong Hoang A1 - Le, Ba Hong Minh A1 - Pham, Thi Dieu Linh Y1 - 2017/11/23/ N2 - Whole exome sequencing (WES) is a widely used technique in both medical studies and clinical practice. However, a number of studies show that the results produced by different WES analysis pipelines are not always homogeneous. To this end, we propose a method (called Genomedics) using a consensus approach to expand the list of variants by combining results called from six separate pipelines with sensitive options. To evaluate the performance of the proposed method, Gemomedics was compared to seven existing methods when they were tested on two datasets and F1-score was used as an indicator of accuracy. The results showed that Genomedics has the highest score among seven methods. We also applied Genomedics to analyze whole exomes from Multiple Myeloma and Dravet syndrome patients and found interesting results. The results demonstrate the promising applications of Genomedics in clinical studies. PB - IEEE TI - Genomedics: Whole exome analysis system for clinical studies SP - 142 M2 - Hue, Vietnam AV - public EP - 147 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - PAT ID - SisLab4222 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4222/ IS - 1-2020-01334 A1 - Le, Thanh Ha A1 - Bui, The Duy A1 - Ngo, Thi Duyen A1 - Nguyen, Van Tung A1 - Nguyen, The Hoang Anh A1 - Nguyen, Minh Hoa Y1 - 2020/// TI - PH??NG PHÁP VÀ H? TH?NG NH?P LI?U D?A TRÊN BÀN PHÍM ?O VÀ CHUY?N THÀNH ÂM THANH AV - none ER - TY - CONF ID - SisLab789 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/789/ A1 - Le, Thanh Ha A1 - Cho, Jae-Young A1 - Kim, Hyun-Ji A1 - Ko, Sung-Jea Y1 - 2013/// TI - Ilumination-Adaptive Color Reproduction Method for Daylight Condition AV - none T2 - 2013: International Conference on Electronics, Information and Communication (ICEIC) ER - TY - JOUR ID - SisLab1905 UR - http://doi.org/10.4218/etrij.11.0110.0205 IS - 2 A1 - Le, Thanh Ha A1 - Jung, Seung Won A1 - Baek, Seung Jin A1 - Ko, Sung Jea Y1 - 2011/// JF - ETRI Journal VL - 33 SN - 1225-6463 TI - Improved Method for the Macroblock-Level Deblocking Scheme SP - 194 AV - none EP - 200 ER - TY - JOUR ID - SisLab1918 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1918/ IS - 16 A1 - Le, Thanh Ha A1 - Jung, Seung Won A1 - Choi, Kang Sun A1 - Ko, Sung Jea Y1 - 2010/// PB - IET JF - Electronics letters VL - 46 TI - Image segmentation based on modified graph-cut algorithm SP - 1121 AV - none EP - 1123 ER - TY - CONF ID - SisLab1929 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1929/ A1 - Le, Thanh Ha A1 - Jung, Seung-Won A1 - Bui, The Duy A1 - Dinh, Trieu Duong A1 - Ko, Sung-Jea Y1 - 2011/// PB - Springer TI - Motion vector refinement algorithm for the high definition video coding SP - 357 M2 - Jeju Island, Korea AV - none EP - 363 T2 - International Conferences, CA and CES3 2011 ER - TY - JOUR ID - SisLab1913 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1913/ IS - 2 A1 - Le, Thanh Ha A1 - Jung, Seung-Won A1 - Park, Chun-Su A1 - Ko, Sung-Jea Y1 - 2010/// PB - Electronics and Telecommunications Research Institute JF - ETRI journal VL - 32 TI - Macroblock-level deblocking method to improve coding efficiency for H. 264/AVC SP - 336 AV - none EP - 338 ER - TY - CONF ID - SisLab1421 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1421/ A1 - Le, Thanh Ha A1 - Nguyen, Hai Chau A1 - Nguyen, Nam Hoang A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh A1 - Nguyen, Thanh Thuy A1 - Nguyen, Ba Tung A1 - Do, Khac Phong A1 - Nguyen, Van Duong A1 - Phan, Van Trong A1 - Pham, Thanh Tung A1 - Nguyen, Danh Thanh Hai A1 - Vuong, Van Quynh A1 - Pham, Van Cu Y1 - 2014/// TI - A Review of Forest Fire Information Technologies in Vietnam AV - public M2 - Hanoi, Vietnam T2 - BESETOHA ER - TY - JOUR ID - SisLab1419 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1419/ IS - 75 A1 - Le, Thanh Ha A1 - Nguyen, Thi Nhat Thanh A1 - Lasko, Kristofer A1 - Ilavajhala, Shriram A1 - Vadrevu, Krishna Prasad A1 - Justice, Chris Y1 - 2014/12/07/ N2 - Forest fires are a significant source of air pollution in Asia. In this study, we integrate satellite remote sensing data and ground-based measurements to infer fire-air pollution relationships in selected regions of Vietnam. We first characterized the active fires and burnt areas at a regional scale from MODIS satellite data. We then used satellite-derived active fire data to correlate the resulting atmospheric pollution. Further, we analyzed the relationship between satellite atmospheric variables and ground-based air pollutant parameters. Our results show peak fire activity during March in Vietnam, with hotspots in the Northwest and Central Highlands. Active fires were significantly correlated with UV Aerosol Index (UVAI), aerosol extinction absorption optical depth (AAOD), and Carbon Monoxide. The use of satellite aerosol optical thickness improved the prediction of Particulate Matter (PM) concentration significantly. JF - Environmental Pollution SN - 0269-7491 TI - Vegetation Fires and Air Pollution in Vietnam SP - 195 AV - none EP - 267 ER - TY - PAT ID - SisLab4177 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4177/ IS - 25669 A1 - Le, Thanh Ha A1 - Nguyen, Th? Th?y A1 - Tran, Quoc Long A1 - Nguyen, Do Van A1 - Nguyen, Chi Thanh A1 - Nguyen, Viet Anh A1 - Nguyen, Cong Thanh Y1 - 2020/// TI - Ph??ng pháp và thi?t b? phân tích n?i dung vi?eo ?? phát hi?n s? ki?n ng??i ngã AV - none ER - TY - JOUR ID - SisLab1599 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1599/ A1 - Le, Thanh Ha A1 - Seung, Won Jung A1 - Chee, Sun Won Y1 - 2015/// N2 - In this paper, a new quality metric for depth images is proposed. Unlike the conventional depth metrics which require the additional information such as the ground truth depth image or a stereo image pair, the proposed quality metric demands only a single camera image and its corresponding depth image. In this work, we first empirically observe that the depth distortion is closely related to the local image characteristics. Based on the observation, we introduce a method to assess the local depth distortion for the edge and non-edge regions. Then, the local distortion is adaptively weighted by the Gabor filter and added up to the quality metric for the depth image. JF - Advanced Multimedia and Ubiquitous Engineering, Lecture Notes in Electrical Engineering VL - Volume SN - 1876-1100 TI - Reduced Reference Quality Metric for Depth Images SP - 117 AV - none EP - 122 ER - TY - JOUR ID - SisLab4085 UR - http://www.jcsce.vnu.edu.vn/index.php/jcsce/article/view/156 IS - 2 A1 - Le, Thanh Xuyen A1 - Le, Trung Thanh A1 - Dinh, Van Viet A1 - Tran, Quoc Long A1 - Nguyen, Linh Trung A1 - Nguyen, Duc Thuan Y1 - 2018/03/03/ N2 - In the clinical diagnosis of epilepsy using electroencephalogram (EEG) data, an accurate automatic epileptic spikes detection system is highly useful and meaningful in that the conventional manual process is not only very tedious and time-consuming, but also subjective since it depends on the knowledge and experience of the doctors. In this paper, motivated by significant advantages and lots of achieved successes of deep learning in data mining, we apply Deep Belief Network (DBN), which is one of the breakthrough models laid the foundation for deep learning, to detect epileptic spikes in EEG data. It is really useful in practice because the promising quality evaluation of the spike detection system is higher than $90$\%. In particular, to construct accurate detection model for non-spikes and spikes, a new set of detailed features of epileptic spikes is proposed. These features were then fed to the DBN which is modified from a generative model into a discriminative model to aim at classification accuracy. The experiment results indicate that it is possible to use deep learning models for epileptic spike detection with very high performance in item of sensitivity, selectivity, specificity and accuracy 92.82%, 97.83% , 96.41%, and 96.87%, respectively. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 33 SN - 2588-1086 TI - Deep Learning for Epileptic Spike Detection SP - 1 AV - public EP - 13 ER - TY - CONF ID - SisLab3700 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3700/ A1 - Le, Thanh Xuyen A1 - Le, Trung Thanh A1 - Nguyen, Linh Trung A1 - Tran, Thi Thuy Quynh A1 - Nguyen, Duc Thuan Y1 - 2019/11/21/ N2 - To help analyze electroencephalography (EEG) data for epilepsy, we propose a temporal?spatial?spectral tensor tensor representation for epileptic spikes via graph signal processing. Instead of using the temporal behavior of the sources, we apply the graph wavelet transform to the spatial variable for constructing the new representation of the epilepsy tensor, in order to exploit latent information of the spatial domain. To illustrate the usefulness of the proposed method for EEG tensor representation, we decompose this tensor to separate EEG sources. Simulation results on real EEG data of a patient diagnosed of epilepsy indicated that our proposed method of representation is promising in estimating the epileptic sources. TI - EEG tensor representation using graph signal processing M2 - Hanoi, Vietnam AV - none T2 - 2019 KICS Korea-Vietnam International Joint Workshop on Communications and Information Sciences ER - TY - CONF ID - SisLab4223 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4223/ A1 - Le, Thu A1 - Le, Sy Vinh Y1 - 2020/// TI - A protein alignment partitioning method for protein phylogenetic inference AV - public T2 - RIVF 2020 ER - TY - CONF ID - SisLab4225 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4225/ A1 - Le, Thu A1 - Le, Sy Vinh A1 - Do Duc, Dong A1 - Bui, Thang A1 - Nguyen, Thao Y1 - 2020/// TI - iK-means: an improvement of the iterative k-means partitioning algorithm SP - 300 M2 - Can Tho AV - none EP - 305 T2 - KSE 2020 ER - TY - CONF ID - SisLab4217 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4217/ A1 - Le, Thu Hong A1 - Nguyen, Chi Thanh A1 - Tran, Quoc Long Y1 - 2020/10// N2 - Automatic polyp detection and segmentation are highly desirable for colon screening due to polyp miss rate by physicians during colonoscopy, which is about 25%. Diagnosis of polyps in colonoscopy videos is a challenging task due to variations in the size and shape of polyps. In this paper, we adapt U-net and evaluate its performance with different modern convolutional neural networks as its encoder for polyp segmentation. One of the major challenges in training networks for polyp segmentation raises when the data are unbalanced, polyp pixels are often much lower in numbers than non-polyp pixels. A trained network with unbalanced data may make predictions with high precision and low recall, being severely biased toward the non-polyp class which is particularly undesired because false negatives are more important than false positives. We propose an asymmetric similarity loss function to address this problem and achieve a much better tradeoff between precision and recall. Finally, we propose an ensemble method for further performance improvement. We evaluate the performance of well-known polyp datasets CVC-ColonDB and ETIS-Larib PolypDB. The best results are 89.13% dice, 79.77% IOU, 90.15% recall, and 86.28% precision. Our proposed method outperforms the state-of-the-art polyp segmentation methods. TI - Polyp Segmentation in Colonoscopy Images Using Ensembles of U-Nets with EfficientNet and Asymmetric Similarity Loss Function AV - public T2 - 2020 RIVF International Conference on Computing and Communication Technologies (RIVF) ER - TY - CONF ID - SisLab3034 UR - https://doi.org/10.1109/NAFOSTED.2017.8108055 A1 - Le, Trung Thanh A1 - Nguyen, Linh Trung A1 - Nguyen, Viet Dung A1 - Abed-Meraim, Karim Y1 - 2017/11/24/ N2 - Many practical networks can be mathematically modeled as graphs. Graph signal processing (GSP), intersecting graph theory and computational harmonic analysis, can be used to analyze graph signals. Just as short-time Fourier transform (STFT) for time-frequency analysis in classical signal processing, we have windowed graph Fourier transform (WGFT) for vertex-frequency analysis in GSP. In this paper, we introduced a new graph modulation operator that satisfies the property of spectral conservation, and a new graph translation operator with interesting properties. Based on these operators, we presented a new method to obtain the WGFT with a tight vertex-frequency frame. These GSP tools were developed based on the graph adjacency matrix. Using time-series graph, USA graph and random graph as examples, we showed by simulation the advantages of our proposed GSP tools over the state-of-the-arts. TI - A New Windowed Graph Fourier Transform SP - 150 M2 - Hanoi, Vietnam AV - public EP - 155 T2 - The 4th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - RPRT CY - Hanoi, Vietnam N1 - UET-AVITECH-2019001 ID - SisLab3443 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3443/ A1 - Le, Trung Thanh A1 - Nguyen, Linh Trung A1 - Nguyen, Viet Dung A1 - Abed-Meraim, Karim Y1 - 2019/04/18/ N2 - Signal processing on graphs is an emerging topic of signal processing, considering graphs as signals. Hence, similar concepts and tools in signal processing can be extended, for understanding graph signals, such as graph frequency, graph operators, graph Fourier transform. In this report, we focus on the joint relationship of vertex-frequency representation of graphs. Motivated by the existing relationship between the incidence matrix and the Laplacian matrix for undirected graphs, we define a generalized Laplacian matrix for directed graphs. This allows us to propose a unified framework for the graph Fourier transform, graph modulation and graph translation. Then, built upon the graph modulation and translation operators, we propose a new windowed graph Fourier transform which a tight vertex-frequency frame. The experimental results indicate that our proposed methods are better than state-of-the-art methods and beneficial for analyzing various different types of graphs, including directed, undirected, weighted, unweighted and connected graphs. PB - University of Engineering and Technology, Vietnam National University VL - UET-AVITECH-2019001 M1 - technical_report TI - A new windowed digraph Fourier transform AV - restricted EP - 27 ER - TY - RPRT CY - Hanoi, Vietnam N1 - UET-AVITECH-2019002 ID - SisLab3444 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3444/ A1 - Le, Trung Thanh A1 - Nguyen, Thi Anh Dao A1 - Nguyen, Viet Dung A1 - Nguyen, Linh Trung A1 - Abed-Meraim, Karim Y1 - 2019/04/18/ N2 - Objective: Epilepsy is one of the most common brain disorders. For epilepsy diagnosis or treatment, the neurologist needs to observe epileptic spikes from electroencephalography (EEG) data. Since multi-channel EEG records can be naturally represented by multi-way tensors, it is of interest to see whether tensor decomposition is able to analyze EEG epileptic spikes. Approach: In this report, we first proposed the problem of simultaneous multilinear low-rank approximation of tensors (SMLRAT) and proved that SMLRAT can obtain local optimum solutions by using two well-known tensor decomposition algorithms (HOSVD and Tucker-ALS). Second, we presented a new system for automatic epileptic spike detection based on SMLRAT. Main results: We compared the proposed tensor analysis method with other common tensor methods in analyzing EEG signal and compared the proposed feature extraction method with Phan?s method. Experimental results indicated that our proposed method is able to detect epileptic spikes with good performance. Significance: To suitably deal with EEG spikes, we developed a local solution for nonnegative SMLRAT. For practical implementation, we proposed the generalized SMLRAT algorithm to effectively solve the SMLRAT and nonnegative SMLRAT problems. An efficient EEG feature extraction framework was proposed, based on estimating the ?eigenspikes? from the nonnegative generalized SMLRAT algorithm. PB - University of Engineering and Technology, Vietnam National University VL - UET-AVITECH-2019002 M1 - technical_report TI - Simultaneous tensor decomposition for EEG epileptic spike detection AV - restricted EP - 43 ER - TY - CONF ID - SisLab3703 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3703/ A1 - Le, Trung Thanh A1 - Nguyen, Viet Dung A1 - Nguyen, Linh Trung A1 - Karim, Abed Meraim Y1 - 2019/09// N2 - Robust subspace tracking is crucial when dealing with data in the presence of both outliers and missing observations. In this paper, we propose a new algorithm, namely PETRELS-ADMM, to improve performance of subspace tracking in such scenarios. Outliers residing in the observed data are first detected in an efficient way and removed by the alternating direction method of multipliers (ADMM) solver. The underlying subspace is then updated by the algorithm of parallel estimation and tracking by recursive least squares (PETRELS) in which each row of the subspace matrix was estimated in parallel. Based on PETRELS-ADMM, we also derive an efficient way for robust matrix completion. Performance studies show the superiority of PETRELS-ADMM as compared to the state-ofthe-art algorithms. We also illustrate its effectiveness for the application of background-foreground separation. TI - Robust subspace tracking with missing data and outliers via ADMM M2 - Coruna, Spain AV - none T2 - 27th European Signal Processing Conference (EUSIPCO) ER - TY - RPRT CY - Vietnam N1 - UET-AVITECH-2019003 ID - SisLab3702 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3702/ A1 - Le, Trung Thanh A1 - Nguyen, Viet Dung A1 - Nguyen, Linh Trung A1 - Karim, Abed Meraim Y1 - 2019/05// N2 - Subspace tracking, which is refered to online PCA, is a classical problem in signal processing with various applications in wireless communications, rada and image/video processing. Since outliers and missing data are ubiquitous and more common in big data regime, robust variants of subspace tracking (RST) are crucial. In this paper, we propose a novel algorithm, namely PETRELSADMM, to improve RST performance in such scenario. The proposed approach consists of two main stages, including outlier rejection and subspace estimation. In the first stage, alternating direction method of multipliers (ADMM) solver is used to detect outliers residing in the observed data in an efficient way. In the second stage, we propose a modification of the parallel estimation and tracking by recursive least squares (PETRELS) algorithm to update the underlying subspace. A theoretical convegence analysis is provided, i.e., we prove that PETRELS-ADMM can generate a sequence of subspace solutions converging to the optimum of its batch counterpart. Performance studies show the superiority of our algorithms as compared to the state-of-the-art algorithms on both synthesis data and real data. PB - VNU University of Engineering and Technology, Vietnam National University, Hanoi VL - UET-AVITECH-2019003 M1 - technical_report TI - Robust subspace tracking: Novel algorithm and performance guarantee AV - none EP - 39 ER - TY - JOUR ID - SisLab4004 UR - https://iopscience.iop.org/article/10.1088/1741-2552/ab5247/meta A1 - Le, Trung Thanh A1 - Nguyen Thi Anh, Dao A1 - Nguyen, Viet Dung A1 - Nguyen, Linh Trung A1 - Karim, Abed-Meraim Y1 - 2020/01/01/ N2 - Objective. Epilepsy is one of the most common brain disorders. For epilepsy diagnosis or treatment, the neurologist needs to observe epileptic spikes from electroencephalography (EEG) data. Since multi-channel EEG records can be naturally represented by multi-way tensors, it is of interest to see whether tensor decomposition is able to analyze EEG epileptic spikes. Approach. In this paper, we first proposed the problem of simultaneous multilinear low-rank approximation of tensors (SMLRAT) and proved that SMLRAT can obtain local optimum solutions by using two well-known tensor decomposition algorithms (HOSVD and Tucker-ALS). Second, we presented a new system for automatic epileptic spike detection based on SMLRAT. Main results. We propose to formulate the problem of feature extraction from a set of EEG segments, represented by tensors, as the SMLRAT problem. Efficient EEG features were obtained, based on estimating the ?eigenspikes? derived from nonnegative GSMLRAT. We compared the proposed tensor analysis method with other common tensor methods in analyzing EEG signal and compared the proposed feature extraction method with the state-of-the-art methods. Experimental results indicated that our proposed method is able to detect epileptic spikes with high accuracy. Significance. Our method, for the first time, makes a step forward for automatic detection EEG epileptic spikes based on tensor decomposition. The method can provide a practical solution to distinguish epileptic spikes from artifacts in real-life EEG datasets. PB - IOP JF - Journal of Neural Engineering SN - 1741-2552 TI - Multi-channel EEG epileptic spike detection by a new method of tensor decomposition AV - public ER - TY - CONF ID - SisLab70 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/70/ A1 - Le, Van Dat A1 - Dang, Cao Cuong A1 - Le, Si Quang A1 - Le, Sy Vinh Y1 - 2011/10// N2 - Amino acid substitution models (matrices) play important role for protein phylogenetics analysis and protein sequence alignment. Different approaches have been proposed to estimate amino acid substitution matrices since the time of Day Hoff in 1972. Currently, maximum likelihood approaches have been widely used to estimate popular matrices such as WAG, LG, FLU, etc. Although maximum likelihood approaches result in high quality matrices, they are slow and not applicable to very large datasets. The most time consuming step in estimating matrices is building phylogenetics trees from protein alignments. In this paper, we propose new methods to overcome the obstacle by splitting large alignments into small ones which still contain enough evolutionary information for estimating matrices. Experiments with both Pfam and FLU datasets showed that proposed methods were about three to nine times faster than the best current method while the quality of estimated matrices are nearly the same. Thus, our methods will enable researchers to estimate matrices from very large datasets. KW - amino acid substitution models KW - biology computing KW - evolution (biological) KW - evolutionary information KW - genetics KW - maximum likelihood approaches KW - maximum likelihood estimation KW - phylogenetics trees KW - protein phylogenetics analysis KW - protein sequence alignment KW - Proteins KW - trees (mathematics) TI - A Fast and Efficient Method for Estimating Amino Acid Substitution Models SP - 85 AV - none EP - 91 T2 - 2011 Third International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CHAP ID - SisLab2042 UR - http://doi.org/10.1007/978-3-319-45243-2_34 A1 - Le, Van Giap A1 - Nguyen, Huu Tung A1 - Lu, Dang Nhac A1 - Nguyen, Ngoc Hoa Y1 - 2016/09// PB - Springer T3 - Lecture Notes in Computer Science SN - 0302-9743 M1 - 9875 TI - A Solution for Automatically Malicious Web Shell and Web Application Vulnerability Detection SP - 367 AV - none EP - 378 T2 - Computational Collective Intelligence ER - TY - JOUR ID - SisLab3375 UR - https://link.springer.com/chapter/10.1007/978-3-662-58611-2_5 IS - XXXII A1 - Le, Van Giap A1 - Nguyen, Huu Tung A1 - Pham, Duy Phuc A1 - Nguyen, Ngoc Hoa Y1 - 2018/12/19/ N2 - Web application/service is now omnipresent but its security risks, such as malware and vulnerabilities, are indeed underestimated. In this paper, we propose a protective, extensible and hybrid platform, named GuruWS, for automatically detecting both web application vulnerabilities and malicious web shells. Based on the original PHP vulnerability scanner THAPS, we propose E-THAPS which implements a novel detection mechanism, an improved SQL injection, Cross-site Scripting and vulnerability detection capabilities. For malicious web shell detection, taint analysis and pattern matching methods are chosen to be implemented in GuruWS. A number of extensive experiments are carried out to prove the outstanding performance of our proposed platform in comparison with several existing solutions in detecting either web application vulnerabilities or malicious web shells. PB - Springer JF - Transactions on Computational Collective Intelligence VL - 11370 SN - 2190-9288 TI - GuruWS: A Hybrid Platform for Detecting Malicious Web Shells and Web Application Vulnerabilities SP - 182 AV - none EP - 208 ER - TY - JOUR ID - SisLab3991 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3991/ IS - 6 A1 - Le, Viet Ha A1 - Phung, Van On A1 - Nguyen, Ngoc Hoa Y1 - 2020/07// N2 - Information security risk management is one of the essential tasks currently in ensuring information security. In particular, for e-Government information systems, the assessment and management of security risks through the exploitation of software vulnerabilities, network equipment, etc., allow us to minimize the loss of data and essential information of organizations in e-Government. In this paper, we introduce a holistic approach to assessing information security risks based on both qualitative and quantitative methods for the Vietnamese e-Government. Our model of security risk management is built according to both international standards (ISO 27005-2018, NIST SP800-30r1, SP800-39, SP800-53r4) and Vietnamese standard (TCVN). For the quantitative risk method, we use both CVSS and OWASP scoring standards to quantify information system risks. Besides, the information security risks of the system can also be determined through vulnerability scanners. We also implemented the proposed model in a Web application, called SoC.UET. The experiments we conducted with UET.SoC allowed proving the ability to manage the information security risks holistically for a Ministry or a Province in the Vietnamese e-Governmen JF - IJCSNS International Journal of Computer Science and Network Security VL - 20 SN - 1738-7906 TI - Information Security Risk Management by a Holistic Approach: a Case Study for Vietnamese e-Government SP - 72 AV - none EP - 82 ER - TY - JOUR ID - SisLab3525 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3525/ IS - 14 A1 - Le, Vinh Y1 - 2019/05// N2 - The advent of genomic technologies have led to the genomic era. The human genome consists of more than 3 billions of nucleotides and the large scale human genome projects resulted in a huge amount of genomic data. Analyzing human genomes is a challenging computational procedure including a number of key steps from aligning short reads, calling variants, and annotating variants. This paper describes a framework to analyze human genomes from the raw data to final results that can be used for diagnosing diseases in clinical tests. We also analyzed 101 Vietnamese human genomes to propose a list of nucleotide sites that might result in false positive results when calling variants from single or few genomes. PB - Vietnam Academy of Science & Technology JF - Journal of Computer Science and Cybernetics VL - 35 SN - 1813-9663 TI - A computational framework to analyze human genomes SP - 105 AV - public EP - 118 ER - TY - JOUR ID - SisLab3733 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3733/ IS - 10 A1 - Le, Vinh A1 - Tran, Kien A1 - Bui, Hoa A1 - Le, Huong A1 - Nguyen, Canh A1 - Do, Duong A1 - Ly, Ha A1 - Pham, Ly A1 - Dao, Lan A1 - Nguyen, Liem Y1 - 2019/10// N2 - Large scale human genome projects have created tremendous human genome databases for some well?studied populations. Vietnam has about 95 million people (the 14th largest country by population in the world) of which more than 86% are Kinh people. To date, genetic studies for Vietnamese people mostly rely on genetic information from other populations. Building a Vietnamese human genetic variation database is a must for properly interpreting Vietnamese genetic variants. To this end, we sequenced 105 whole genomes and 200 whole exomes of 305 unrelated Kinh Vietnamese (KHV) people. We also included 101 other previously published KHV genomes to build a Vietnamese human genetic variation database of 406 KHV people. The KHV database contains 24.81 million variants (22.47 million single nucleotide polymorphisms (SNPs) and 2.34 million indels) of which 0.71 million variants are novel. It includes more than 99.3% of variants with a frequency of >1% in the KHV population. Noticeably, the KHV database revealed 107 variants reported in the human genome mutation database as pathological mutations with a frequency above 1% in the KHV population. The KHV database (available at https://genomes.vn) would be beneficial for genetic studies and medical applications not only for the Vietnamese population but also for other closely related populations. PB - Wiley JF - Human Mutation VL - 40 SN - 1098-1004 TI - A Vietnamese human genetic variation database SP - 1664 AV - public EP - 1675 ER - TY - CONF ID - SisLab1851 UR - http://doi.org/10.1109/ICIP.2004.1421463 A1 - Le, Vu Ha Y1 - 2004/10// VL - 3 TI - A structure-from-motion method for 3-D reconstruction of moving objects from multiple-view image sequences SP - 1955 M2 - Singapore AV - none EP - 1958 T2 - IEEE International Conference on Image Processing ER - TY - BOOK CY - Hanoi ID - SisLab2708 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2708/ A1 - Le, Vu Ha A1 - Dang, Minh Quy Y1 - 2014/// PB - VNU Publisher ED - Le, Vu Ha TI - A Guidebook to Principles of Emerging Information and Communication Technologies AV - none EP - 150 ER - TY - CONF ID - SisLab2364 UR - http://doi.org/10.1117/12.733533 A1 - Le, Vu Ha A1 - Gouiffes, Michele A1 - Parrain, Fabien A1 - Bosseboeuf, Alain A1 - Zavidovique, Bertrand Y1 - 2007/08// VL - 6696 SN - 0277786X TI - Image blur analysis for the subpixel-level measurement of in-plane vibration parameters of MEMS resonators SP - 66962D M2 - San Diego, CA, USA AV - none EP - 66962D T2 - SPIE Optical Engineering + Applications ER - TY - JOUR ID - SisLab1845 UR - http://doi.org/10.1007/s11265-005-4167-8 IS - 1 A1 - Le, Vu Ha A1 - Seetharaman, Guna Y1 - 2006/01// JF - Journal of VLSI signal processing systems for signal, image and video technology VL - 42 SN - 0922-5773 TI - A Super-Resolution Imaging Method Based on Dense Subpixel-Accurate Motion Fields SP - 79 AV - none EP - 89 ER - TY - CONF ID - SisLab1854 UR - http://doi.org/10.1109/DCV.2002.1218741 A1 - Le, Vu Ha A1 - Seetharaman, Guna Y1 - 2002/// TI - A superresolution imaging method based on dense subpixel-accurate motion fields SP - 35 M2 - Clearwater Beach, FL, USA AV - none EP - 42 T2 - International Workshop on Digital and Computational Video ER - TY - CONF ID - SisLab1852 UR - http://doi.org/10.1109/CAMP.2003.1598167 A1 - Le, Vu Ha A1 - Seetharaman, Guna A1 - Zavidovique, Bertrand Y1 - 2003/05// TI - A Multiscale Technique for Optical Flow Computation Using Piecewise Affine Approximation SP - 221 M2 - New Orleans, LA, USA AV - none EP - 230 T2 - IEEE International Workshop on Computer Architectures for Machine Perception ER - TY - JOUR ID - SisLab782 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/782/ A1 - Le, Dinh Thanh Y1 - 2013/// JF - Journal of Science of HNUE VL - 58 TI - More Efficient Path Optimization for Greedy Geographic Routing in Wireless Sensor Networks AV - none ER - TY - JOUR ID - SisLab2007 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2007/ IS - 13 A1 - Le Dinh, Thanh A1 - Nguyen, Dai Tho Y1 - 2016/// N2 - In this paper, we propose an algorithm for early detection of indoor fire based on temperature and light data collected by wireless sensor networks. Our goal is to develop an affordable, acceptable, detection method based on wireless sensor networks with cheap and highly available sensors. Experimental results show that our proposed algorithm is able to detect fire quickly and accurately. JF - Research, Development and Application on Information & Communication Technology VL - 3 TI - Indoor Fire Detection using Wireless Sensor Networks AV - none ER - TY - BOOK CY - Hanoi, Vietnam ID - SisLab3079 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3079/ A1 - Le Dinh, Thanh A1 - Nguyen, Viet Anh Y1 - 2018/// PB - VNU Publishing House TI - Phát tri?n ?ng d?ng web AV - none EP - 220 ER - TY - INPR ID - SisLab4003 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4003/ A1 - Le Trung, Thanh A1 - Karim, Abed-Meraim A1 - Nguyen Linh, Trung A1 - Remy, Boyer Y1 - 2021/01// N2 - Tensor-train (TT) decomposition has been an ef?cient tool to ?nd low order approximation of large-scale, high-order tensors. Existing TT decomposition algorithms are either of high computational complexity or operating in batch-mode, hence quite inef?cient for (near) real-time processing. In this paper, we propose a novel adaptive algorithm for TT decomposition of streaming tensors whose slices are serially acquired over time. By leveraging the alternating minimization framework, our estimator minimizes an exponentially weighted least-squares cost function in an ef?cient way. The proposed method can yield an estimation accuracy very close to the error bound. Numerical experiments show that the proposed algorithm is capable of adaptive TT decomposition with a competitive performance evaluation on both synthetic and real data. TI - Adaptive Algorithms for Tracking Tensor-Train Decomposition of Streaming Tensors M2 - Amsterdam, The Netherlands AV - none T2 - 28th European Signal Processing Conference (EUSIPCO) ER - TY - JOUR ID - SisLab1477 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1477/ IS - 2 A1 - Lee, Yang Koo A1 - Vu, Thi Hong Nhan A1 - Le, Thanh Ha Y1 - 2015/04/01/ PB - ETRI JF - ETRI Journal VL - 37 SN - 1225-6463 TI - Dual-phase approach to Improve Prediction of Heart Disease in Mobile Environment SP - 222 AV - none EP - 232 ER - TY - JOUR ID - SisLab4155 UR - https://ieeeaccess.ieee.org/ A1 - Li, Zhuorong A1 - Yu, Hongchuan A1 - Kieu, Hai Dang A1 - Vuong, Tung Long A1 - Zhang, Jian Jun Y1 - 2020/// N2 - Human motion tracking is a prevalent technique in many fields. A common difficulty encountered in motion tracking is the corrupted data is caused by detachment of markers in 3D motion data or occlusion in 2D tracking data. Most methods for missing markers problem may quickly become ineffective when gaps exist in the trajectories of multiple markers for an extended duration. In this paper, we propose the principal component eigenspace based gap filling methods that leverage a training sample set for estimation. The proposed method is especially beneficial in the scenario of motion data with less predictable or repeated movement patterns, and that of even missing entire frames within an interval of a sequence. To highlight algorithm robustness, we perform algorithms on twenty test samples for comparison. The experimental results show that our methods are numerical stable and fast to work. PB - IEEE JF - IEEE Access SN - 2169-3536 TI - PCA-Based Robust Motion Data Recovery AV - public ER - TY - CONF ID - SisLab2133 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2133/ A1 - Lim, Kwang Hyeon A1 - Lee, Yang Koo A1 - Vu, Thi Hong Nhan A1 - Bae, Kyong Ho A1 - Heo, Min Y1 - 2011/05// TI - Query Processing Algorithm for Spatiotemporal Sensor Data Stream AV - none M2 - Korea T2 - 4th International Conference FITAT/DBMI 2011 ER - TY - CONF ID - SisLab2584 UR - https://link.springer.com/chapter/10.1007/978-981-10-4154-9_4 A1 - Lu, Dang Nhac A1 - Ngo, Thi Thu Trang A1 - Nguyen, Duc Nhan A1 - Nguyen, Thi Hau A1 - Nguyen, Ha Nam Y1 - 2017/03/18/ N2 - In this paper, we proposed an efficient method with flexible framework for vehicle status awareness using smartphone sensors, so called Mobile Online Vehicle Status Awareness System (MOVSAS). The system deployed while users to put their smartphones in any position and at any direction. In our proposed framework, principal component analysis (PCA) algorithm is used to selected suitable features from set of combining features on time-base, power-based and frequency-based domain, which extracted from accelerometer sensor data. The classification model using Random Forest (RF), Naïve Bayes (NB), K-Nearest Neighbor (KNN), and Support Vector Machine (SVM) algorithms to deploy for awareness issues of vehicle status. The refining model is proposed using Artificial Neural Network (ANN) algorithm aim to improved accuracy prediction vehicle status results before. Training data sets, which are collected and the dynamic feedback also helping improved accuracy of system. A number of experiments are shown that the high accuracy of MOVSAS with vehicle kinds as bicycle, motorbike and car. TI - A Novel Mobile Online Vehicle Status Awareness Method Using Smartphone Sensors AV - none T2 - 2017 International Conference on Information Science and Applications ER - TY - JOUR ID - SisLab2929 UR - http://www.mdpi.com/1424-8220/18/4/1036 IS - 1036 A1 - Lu, Dang Nhac A1 - Nguyen, Duc Nhan A1 - Nguyen, Thi Hau A1 - Nguyen, Ha Nam Y1 - 2018/03/29/ N2 - In this paper, we present a flexible combined system, namely the Vehicle mode-driving Activity Detection System (VADS), that is capable of detecting either the current vehicle mode or the current driving activity of travelers. Our proposed system is designed to be lightweight in computation and very fast in response to the changes of travelers? vehicle modes or driving events. The vehicle mode detection module is responsible for recognizing both motorized vehicles, such as cars, buses, and motorbikes, and non-motorized ones, for instance, walking, and bikes. It relies only on accelerometer data in order to minimize the energy consumption of smartphones. By contrast, the driving activity detection module uses the data collected from the accelerometer, gyroscope, and magnetometer of a smartphone to detect various driving activities, i.e., stopping, going straight, turning left, and turning right. Furthermore, we propose a method to compute the optimized data window size and the optimized overlapping ratio for each vehicle mode and each driving event from the training datasets. The experimental results show that this strategy significantly increases the overall prediction accuracy. Additionally, numerous experiments are carried out to compare the impact of different feature sets (time domain features, frequency domain features, Hjorth features) as well as the impact of various classification algorithms (Random Forest, Naïve Bayes, Decision tree J48, K Nearest Neighbor, Support Vector Machine) contributing to the prediction accuracy. Our system achieves an average accuracy of 98.33% in detecting the vehicle modes and an average accuracy of 98.95% in recognizing the driving events of motorcyclists when using the Random Forest classifier and a feature set containing time domain features, frequency domain features, and Hjorth features. Moreover, on a public dataset of HTC company in New Taipei, Taiwan, our framework obtains the overall accuracy of 97.33% that is considerably higher than that of the state-of the art. PB - MDPI JF - Sensors VL - 18 SN - 1424-8220 TI - Vehicle Mode and Driving Activity Detection Based on Analyzing Sensor Data of Smartphones AV - none ER - TY - CONF ID - SisLab2487 UR - http://doi.org/10.1109/ICOIN.2017.7899563 A1 - Lu, Dang Nhac A1 - Nguyen, Thi Hau A1 - Ngo, Thi Thu Trang A1 - Nguyen, Duc Nhan A1 - Nguyen, Ha Nam Y1 - 2017/// TI - A novel traffic routing method using hybrid Ant Colony System based on genetic algorithm SP - 584 AV - none EP - 589 T2 - 2017 International Conference on Information Networking (ICOIN) ER - TY - JOUR ID - SisLab1897 UR - http://doi.org/10.1007/978-3-319-49073-1_39 A1 - Lu, Dang Nhac A1 - Nguyen, Thu Trang A1 - Ngo, Thi Thu Trang A1 - Nguyen, Thi Hau A1 - Nguyen, Ha Nam Y1 - 2016/// N2 - In this paper, we propose an efficient and flexible framework for activity recognition based on smartphone sensors. We develop a mobile application that integrates data collection, training and recognition, feedback monitoring. This system allows user smartphones are randomly placed in any position and at any direction. In the proposed framework, a set of power based and frequency-based features is extracted from sensor data. Then, we deploy Random Forest, Naïve Bayes, K-Nearest Neighbor (KNN), Support Vector Ma-chine (SVM) classification algorithms for recognizing a set of user activities. Our framework dynamically takes into account real-time user feedbacks to increase the prediction accuracy. Our framework will be able to apply for intelligent mo-bile applications. A number of experiments were carried out to show the high ac-curacy of the proposed framework for detecting user activities when walking or driving a motorbike. JF - Advances in Information and Communication Technology VL - 538 SN - 2194-5357 TI - Mobile Online Activity Recognition System Based on Smartphone Sensors SP - 357 AV - none EP - 366 ER - TY - JOUR ID - SisLab1729 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1729/ IS - 1 A1 - Lu, Dang Nhac A1 - Nguyen, Thu Trang A1 - Nguyen, Thi Hau A1 - Nguyen, Ha Nam A1 - Choi, Gyoo Seok Y1 - 2015/// JF - International Journal of Internet, Broadcasting and Communication VL - 7 TI - Detecting smartphone user habits using sequential pattern analysis SP - 20 AV - none EP - 22 ER - TY - CONF ID - SisLab2696 UR - http://ictcc.org/2017/show/home A1 - Lu, Dang Nhac A1 - Tran, Thuy Binh A1 - Nguyen, Duc Nhan A1 - Nguyen, Thi Hau A1 - Nguyen, Ha Nam Y1 - 2017/11/23/ N2 - There are a lot of applications were developed to take advance of smartphone sensors for utilizing the personal services such as health-care, walk-counting, routing etc. Users behavior analysis is attracted a lot of researches in-terested with various approaches. We proposed a novel framework to detect the abnormal driving behavior using smartphone sensors. It named Abnormal Be-havior Detection System (ABDS). The system keep track the driver activities during he?s trip based on smartphone sensors. The Practice Swarm Optimiza-tion (PSO) algorithm is used to automatically select suitable features extracted from sensors data. The oriented accelerometer is used to detect activity. The abnormal behavior is collected and labeled then detection by Artificial Neural Network (ANN). The implementation shown the promising results in case of seven activities (stop, moving, acceleration, deceleration, turn left, turn right and U-turn) with 86.71% accuracy. TI - Abnormal Behavior Detection Based on Smartphone Sensors AV - none T2 - 3rd EAI International Conference on Nature of Computation and Communication 2017 ER - TY - CONF ID - SisLab2594 UR - http://kse2017.dhsphue.edu.vn A1 - Luong, Thai Le A1 - Cao, Minh Son A1 - Le, Duc Thang A1 - Phan, Xuan Hieu Y1 - 2017/10/19/ N2 - Nowadays, users are much more willing to share their daily activities, their thoughts or feelings, and even their intentions (e.g., buy an apartment, rent a car, travel to somewhere, etc.) on online social media channels. Understanding intents of online users, therefore, has become a crucial need in many different business areas like production, finance/banking, real estate, tourism, e-commerce, and online marketing. In this paper, we will present our solutions to extract intent information from online social media texts. This can be seen as an information extraction or sequential segmentation task. In order to perform this task, we have built our machine learning models based on conditional random fields (CRFs), an advanced statistical graphical model for sequence data, and bidirectional long short?term memory (Bi?LSTM), a well-known deep learning model. To evaluate our methods, we have defined two intent extraction tasks in two domains: real estate and cosmetics & beauty. For each task, we have defined the tag set as well as prepared the labeled data set that consists of Vietnamese social media text posts with the annotation of intent words/phrases. Experimental results showed that the proposed methods can effectively extract intent information from online texts with significantly high accuracy. TI - Intent Extraction from Social Media Texts Using Sequential Segmentation and Deep Learning Models SP - 215 M2 - Hue city, Vietnam AV - none EP - 220 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE 2017) ER - TY - JOUR ID - SisLab3677 UR - https://www.cys.cic.ipn.mx/ojs/index.php/CyS/article/view/3158 IS - 1 A1 - Luong, Thai Le A1 - Tran, Nhu Thuat A1 - Dang, Tien Son A1 - Tran, Quoc Long A1 - Phan, Xuan Hieu Y1 - 2020/03// N2 - Identifying user?s intents from texts on online channels has a wide range of applications from entrepreneurship, banking to e-commerce. However, intent identification is not a simple task due to the intent and its attributes are various and strongly depend on the domain of data. If the number of intent domains increases, the number of intent?s attributes will get bigger. As a result, the complexity of intent extraction task grows up significantly. Additionally, when a new domain comes, it involves considerable physical efforts to define specific labels for intent and attributes for that domain. Hence, it would be much better to come up with a new method for extracting user?s intents which is not dependent on a specific domain. In our research, we study the problem of domain-independent intent identification from posts and comments crawled from social networks and discussion forums. We present ten general labels, i.e. labels do not depend on a specific domain, and utilize them when extracting intent and its related information. We also propose a map between general labels and domain-specific labels. We extensively conduct experiments to explore the efficiency of using general labels compared to specific labels in extracting user?s intents when the number of intent domains increases. Our study is conducted on a medium-sized dataset from three selected domains: Tourism, Real Estate and Transportation. In term of accuracy, when the number of domains grows, our proposal achieves significantly better results than domain-specific method in identifying user's intent. JF - Computacion y Sistemas VL - 24 SN - 1405-5546 TI - Domain-independent intent extraction from online texts AV - none ER - TY - CONF ID - SisLab3642 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3642/ A1 - Luong, Thai Le A1 - Tran, Nhu Thuat A1 - Phan, Xuan Hieu Y1 - 2019/09/25/ N2 - User intent extraction from social media texts is aimed at identifying user intent keyword and its related information. This topic has attracted a lot of researches since its various applications in online marketing, e-commerce and business services. One of such studies is to model this problem as a sequence labeling task and apply state-of-the-art sequential tagging models such as BiLSTM [12] and BiLSTM-CRFs [12]. In this paper, we take a further step to enhance intent extraction results based on tri-training [23] and ensemble learning [2]. Specifically, we simultaneously use three BiLSTM-CRFs models, each of them is different from others by the type of word embeddings, and apply majority voting scheme over their predicted labels when decoding final labels. Extensive experiments on data from three domains Real Estate, Tourism and Transportation show that our proposed methods enjoy a better performance compared to single model based approach. TI - Improving Intent Extraction Using Ensemble Neural Network SP - 58 M2 - Ho Chi Minh City, Vietnam AV - none EP - 63 T2 - The 19th International Symposium on Communications and Information Technologies (ISCIT 2019) ER - TY - CONF ID - SisLab1883 UR - http://doi.org/10.1007/978-3-662-49390-8_2 A1 - Luong, Thai Le A1 - Tran, Thi Hanh A1 - Truong, Quoc Tuan A1 - Truong, Thi Minh Ngoc A1 - Phi, Thi Thu A1 - Phan, Xuan Hieu Y1 - 2016/03/14/ N2 - Today, Internet users are much more willing to express themselves on online social media channels. They commonly share their daily activities, their thoughts or feelings, and even their intention (e.g., buy a camera, rent an apartment, borrow a loan, etc.) about what they plan to do on blogs, forums, and especially online social networks. Understanding intents of online users, therefore, has become a crucial need for many enterprises operating in different business areas like production, banking, retail, e?commerce, and online advertising. In this paper, we will present a machine learning approach to analyze users? posts and comments on online social media to filter posts or comments containing user plans or intents. Fully understanding user intent in social media texts is a complicated process including three major stages: user intent filtering, intent domain identification, and intent parsing and extraction. In the scope of this study, we will propose a solution to the first one, that is, building a binary classification model to determine whether a post or comment carries an intent or not. We carefully conducted an empirical evaluation for our model on a medium-sized collection of posts in Vietnamese and achieved promising results with an average accuracy of more than 90%. VL - 9622 SN - 0302-9743 TI - Learning to Filter User Explicit Intents in Online Vietnamese Social Media Texts SP - 14 M2 - Da Nang, Vietnam AV - restricted EP - 16 T2 - The 8th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - CONF ID - SisLab1527 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1527/ A1 - Luong, Thai Le A1 - Trang, Thi Hanh A1 - Truong, Quoc Tuan A1 - Truong, Thi Minh Ngoc A1 - Phi, Thi Thu A1 - Phan, Xuan Hieu Y1 - 2016/03/26/ N2 - Today, Internet users are much more willing to express them- selves on online social media channels. They commonly share their daily activities, their thoughts or feelings, and even their intention (e.g., buy a camera, rent an apartment, borrow a loan, etc.) about what they plan to do on blogs, forums, and especially online social networks. Understand- ing intents of online users, therefore, has become a crucial need for many enterprises operating in different business areas like production, banking, retail, e?commerce, and online advertising. In this paper, we will present a machine learning approach to analyze users? posts and comments on online social media to filter posts or comments containing user plans or intents. Fully understanding user intent in social media texts is a compli- cated process including three major stages: user intent filtering, intent domain identification, and intent parsing and extraction. In the scope of this study, we will propose a solution to the first one, that is, building a binary classification model to determine whether a post or comment carries an intent or not. We carefully conducted an empirical evaluation for our model on a medium?sized collection of posts in Vietnamese and achieved promising results with an average accuracy of more than 90%. Keywords: Intention mining, user intent identification, social media text understanding, content filtering, text classification TI - Learning to Filter User Explicit Intents in Online Vietnamese Social Media Texts M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab2292 UR - http://doi.org/10.1145/3011077.3011134 A1 - Luong, Thai Le A1 - Truong, Quoc Tuan A1 - Dang, Hai Trieu A1 - Phan, Xuan Hieu Y1 - 2016/12/08/ TI - Domain identification for intention posts on online social media SP - 52 M2 - Ho Chi Minh City, Viet Nam AV - none EP - 57 T2 - The 7th Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab2541 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2541/ A1 - Luong, Thanh Nhan A1 - To, Van Khanh A1 - Truong, Ninh Thuan Y1 - 2017/04// PB - Springer TI - Checking Compliance of Program with Secure UML Model SP - 489 M2 - Kanazawa, Japan AV - none EP - 498 T2 - 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1528 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1528/ A1 - Luong, Thanh Nhan A1 - Truong, Ninh Thuan Y1 - 2016/03/26/ N2 - Trong giai ?o?n k? thu?t công ngh? phát tri?n nh? hi?n nay, an ninh là yêu c?u quan tr?ng ??i v?i h? th?ng ch?m sóc s?c kh?e vì nhu c?u c?n b?o v? các thông tin riêng t? c?a b?nh nhân. Vi?c tích h?p các chính sách an ninh vào h? th?ng ph?n m?m này là r?t c?n thi?t ?? gi?m thi?u các vi ph?m an ninh. Ki?m soát truy c?p d?a trên vai trò là ph??ng pháp hi?u qu? ?? th?c hi?n các tính ch?t an ninh c? b?n c?a m?t ph?n m?m an toàn. Nghiên c?u trình bày m?t ph??ng pháp ?? ??c t? các yêu c?u an ninh trong h? th?ng khám ch?a b?nh. Bên c?nh vi?c ?? xu?t m?t ph??ng pháp ch?ng minh s? ?áp ?ng c?a các yêu c?u an ninh v?i m?t h? th?ng ph?n m?m này, m?t công c? ki?m ch?ng c?ng ???c gi?i thi?u. TI - Ph??ng pháp ki?m ch?ng các tính ch?t an ninh c?a ph?n m?m M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab3308 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3308/ A1 - Luong, Thanh Nhan A1 - Vo, Dinh Hieu A1 - To, Van Khanh A1 - Truong, Ninh Thuan Y1 - 2018/// TI - On The Compliance Of Access Control Policies In Web Applications AV - none M2 - Vietnam T2 - ICCASA 2018 - 7th EAI International Conference on Context-Aware Systems and Applications ER - TY - INPR ID - SisLab3637 UR - https://edas.info/listConferencesAuthor.php?c=26598 A1 - Luong, Thanh Nhan A1 - Vo, Dinh Hieu A1 - Truong, Ninh Thuan Y1 - 2019/12/12/ N2 - Security has been a crucial aspect of most applications especially, critical-safety softwares. In fact, losing or leaking of sensitive data can lead to huge losses for organizations so software developers must always ?nd ways to ensure the security properties for their products. In practice, attribute-based access control (ABAC) has been an e?ective, ?exible and popular method to mitigate the risks of unauthorized accesses to resources in large and complex systems. Therefore, we introduce an approach for checking ABAC rules from source code of an application software against to its requirement speci?cation. Our work includes of a formal de?nition about ABAC policy, method to implement ABAC into application as well as analyze access rules from the source code, and a algorithm to check analyzed ABAC rules against to its speci?cation. The proposed approach can help programmers to detect the inconsistency between speci?cation and implementation. We also illustrate our approach with an example in a medical information management system. TI - An Approach to Analyze Software Security Requirements in ABAC Mode AV - none T2 - The NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab3247 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3247/ A1 - Luong, Thi Thuy A1 - Nguyen, Viet Thang A1 - Pham, Minh Trien Y1 - 2018/12/14/ N2 - Chúng tôi ti?n hành m?t nghiên c?u hành vi con ng??i mà chúng tôi ?ã c? tình l?p trình hành vi l?i cho robot. M?c ?ích c?a nghiên c?u ?? khám phá s? khác nhau trong ?ánh giá c?a ng??i dùng v? giá tr? c?a giao ti?p trong t??ng tác v?i robot. Nh?ng ng??i tham gia nghiên c?u ???c h??ng d?n b?i m?t robot gi? ??nh l?p trình trên máy vi tính ?? th?c hi?n nhi?m v? n?u m?t món ?n trong 3 k?ch b?n có s?n. K?ch b?n th? nh?t h??ng d?n ng??i tham gia n?u ?n trong ?i?u ki?n không có l?i nh?ng robot ch? h??ng d?n mà không giao ti?p. K?ch b?n th? hai robot h??ng d?n ng??i tham gia trong ?i?u ki?n có l?i. K?ch b?n th? ba robot h??ng d?n ng??i tham gia trong ?i?u ki?n có l?i nh?ng s? d?ng các y?u t? giao ti?p trong quá trình h??ng d?n. Sau t??ng tác, chúng tôi yêu c?u nh?ng ng??i tham gia ?ánh giá ?? khó c?a nhi?m v? và m?c ?? hài lòng c?a h?. K?t qu? cho th?y m?c dù có l?i nh?ng m?t robot bi?t giao ti?p ???c ?ánh giá cao h?n so v?i robot bình th??ng. TI - ?nh H??ng C?a Giao Ti?p ??n ?ánh Giá L?i Robot Trong T??ng Tác Ng??i ? Robot SP - 38 M2 - Hanoi, Vietnam AV - public EP - 42 T2 - 2018 REV-ECIT: National Conference on Electronics, Communications and Information Technology ER - TY - CONF ID - SisLab1552 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1552/ A1 - Luong, Viet Nguyen A1 - Ho, Van Canh A1 - Trinh, Nhat Tien Y1 - 2016/03/26/ N2 - Nghiên c?u ?? xu?t ph??ng pháp ???c phát tri?n trong ?ó m?t hình ?nh th?y vân xu?t hi?n trong m?t b?n in và sau ?ó có th? ???c trích xu?t b?ng cách s? d?ng máy quét ?? quét b?n in và m?t ph?n m?m ?? khai thác th?y vân. Trong tr??ng h?p này, ph??ng pháp nhúng ph?i ???c thi?t k? c?n th?n b?i vì c? hai quá trình in ?n và ch?p xu?t hi?n nguyên nhân bi?n d?ng mà làm cho khai thác th?y vân là m?t thách th?c. Tr?ng tâm c?a nghiên c?u là k? thu?t th?y vân mù, thông tin ???c nhúng là nhi?u bít, ?ánh giá s? b?n v?ng c?a các thu?t toán ???c th? nghi?m trong m?t môi tr??ng v?n phòng, s? d?ng thi?t b? v?n phòng. TI - Nghiên c?u và ?? xu?t m?t ph??ng pháp b?o v? b?n quy?n tài li?u s? M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab2106 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2106/ IS - 2 A1 - Luong, Viet Nguyen A1 - Trinh, Nhat Tien A1 - Ho, Van Canh Y1 - 2016/// N2 - In this paper, a robust method to the ability of the watermark to resist against attacks is proposed for hiding information into images. The proposed method is blind because the original image is not required at the decoder to recover the embedded data. The robustness of the watermarking scheme is inspired by using a PJND (Pyramidal Just Noticeable Difference) model and the message is inserted into these DoG (Difference of Gaussians) [1, 2]. Our proposal takes into account three main characteristics of Human Visual System, namely: contrast sensitivity, luminance adaptation and contrast marking. Therefore, it not only provides an invisible and robust watermarking but also optimizes watermarking capacity. The performance of the proposed technique is evaluated by a series of experiments with different input images. In terms of transparency, besides using the subjective experiments, eight objective metrics are calculated in comparison with other methods such as PSNR, MSSIM, SVDm, etc. Our approach always presents the outperform values. In terms of robustness, many kinds of attacks from global transformation (rotation, scaling, etc) to local transformation (stirmark, checkmark benchmarks, de-synchronization attacks) are implemented. Many image processing tools are applied to simulate the attacks such as Print-Screen, Using Photo editing software, Camcorder, Print-Scan, etc. The experimental results show an outstanding robustness in resisting these attacks. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - A Watermark Algorithm Against De-Synchronization Attacks SP - 49 AV - public EP - 62 ER - TY - JOUR ID - SisLab4765 UR - https://www.sciencedirect.com/science/article/abs/pii/S1361841522000731 A1 - Luu, Manh Ha A1 - Walsum, Theo van A1 - Mai, Hong Son A1 - Franklin, Daniel A1 - Nguyen, Thi Thu Thao A1 - Le, Thi My A1 - Moelker, Adraan A1 - Le, Van Khang A1 - Vu, Dang Luu A1 - Le, Ngoc Ha A1 - Tran, Quoc Long A1 - Chu, Duc Trinh A1 - Nguyen, Linh Trung Y1 - 2022/// N2 - Multiphase CT scanning of the liver is performed for several clinical applications; however, radiation exposure from CT scanning poses a nontrivial cancer risk to the patients. The radiation dose may be reduced by determining the scan range of the subsequent scans by the location of the target of interest in the first scan phase. The purpose of this study is to present and assess an automatic method for determining the scan range for multiphase CT scans. Our strategy is to first apply a CNN-based method for detecting the liver in 2D slices, and to use a liver range search algorithm for detecting the liver range in the scout volume. The target liver scan range for subsequent scans can be obtained by adding safety margins achieved from Gaussian liver motion models to the scan range determined from the scout. Experiments were performed on 657 multiphase CT volumes obtained from multiple hospitals. The experiment shows that the proposed liver detection method can detect the liver in 223 out of a total of 224 3D volumes on average within one second, with mean intersection of union, wall distance and centroid distance of 85.5%, 5.7 mm and 9.7 mm, respectively. In addition, the performance of the proposed liver detection method is comparable to the best of the state-of-the-art 3D liver detectors in the liver detection accuracy while it requires less processing time. Furthermore, we apply the liver scan range generation method on the liver CT images acquired from radiofrequency ablation and Y-90 transarterial radioembolization (selective internal radiation therapy) interventions of 46 patients from two hospitals. The result shows that the automatic scan range generation can significantly reduce the effective radiation dose by an average of 14.5% (2.56 mSv) compared to manual performance by the radiographer from Y-90 transarterial radioembolization, while no statistically significant difference in performance was found with the CT images from intra RFA intervention ( = 0.81). Finally, three radiologists assess both the original and the range-reduced images for evaluating the effect of the range reduction method on their clinical decisions. We conclude that the automatic liver scan range generation method is able to reduce excess radiation compared to the manual performance with a high accuracy and without penalizing the clinical decision. JF - Medical Image Analysis TI - Automatic scan range for dose-reduced multiphase CT imaging of the liver utilizing CNNs and Gaussian models AV - none ER - TY - CONF ID - SisLab2775 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2775/ A1 - Luu, Quang Thang A1 - Nguyen, Thi Nhat Thanh A1 - Nguyen, Thanh Thuy A1 - Bui, Quang Hung Y1 - 2017/// TI - TMACT: A Thematic Map Automatically Creating Tool For Maintaining WebGIS Systems AV - none M2 - Hue, Vietnam T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab2773 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2773/ A1 - Luu, Quang Thang A1 - Phan, Anh A1 - Luu, Viet Hung A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung Y1 - 2017/// TI - S? d?ng công ngh? Hadoop và Spark ?? l?u tr? và x? lý phân tán ?nh v? tinh VNREDSat-1 SP - 883 AV - none EP - 892 T2 - H?i th?o khoa h?c ?ng d?ng GIS toàn qu?c 2017 ER - TY - CONF ID - SisLab2774 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2774/ A1 - Luu, Quang Thang A1 - Phan, Anh A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung Y1 - 2017/// TI - SEAP: n?n t?ng m?i cho vi?c khai thác và phân tích d? li?u không gian l?n SP - 874 M2 - Quy Nh?n, Viet Nam AV - none EP - 882 T2 - H?i th?o khoa h?c ?ng d?ng GIS toàn qu?c 2017 ER - TY - CONF ID - SisLab3582 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3582/ A1 - Luu, Viet Hung A1 - Dao, Minh Son A1 - Nguyen, Thi Nhat Thanh A1 - Perry, Stuart A1 - Zettsu, Koji Y1 - 2019/12// N2 - When floods hit populated areas, quick detection of flooded areas is crucial for initial response by local government, residents, and volunteers. Space-borne polarimetric synthetic aperture radar (PolSAR) is an authoritative data sources for flood mapping since it can be acquired immediately after a disaster even at night time or cloudy weather. Conventionally, a lot of domain specific heuristic knowledge has been applied for PolSAR flood mapping, but their performance still suffers from confusing pixels caused by irregular reflections of radar waves. Optical images are another data source that can be used to detect flooded areas due to their high spectral correlation with the open water surface. However, they are often affected by day, night, or severe weather conditions (i.e., cloud). This paper presents a convolution neural network (CNN) based multimodal approach utilizing the advantages of both PolSAR and optical images for flood mapping. First, reference training data is retrieved from optical images by manual annotation. Since clouds may appear in the optical image, only areas with a clear view of flooded or non-flooded are annotated. Then, a semisupervised polarimetric features-aided CNN is utilized for flood mapping using PolSAR data. The proposed model not only can handle the issue of learning with incomplete ground truth but also can leverage a large portion of unlabelled pixels for learning. Moreover, our model takes the advantages of expert knowledge on scattering interpretation to incorporate polarimetric-features as the input. Experiments results are given for the flood event that occurred in Sendai, Japan, on 12th March 2011. The experiments show that our framework can map flooded area with high accuracy (F1=96.12) and outperform conventional flood mapping methods. TI - Semi-supervised Convolutional Neural Networks for Flood Mapping using Multi-modal Remote Sensing Data M2 - Hanoi AV - public T2 - 6th NAFOSTED Conference on Information and Computer Science ER - TY - JOUR ID - SisLab3449 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3449/ IS - 9 A1 - Luu, Viet Hung A1 - Dinh, Van Kiet A1 - Luong, Nguyen Hoang Hoa A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2019/// N2 - In this letter, we investigate fine-grained classification of arbitrary-oriented ships in very high resolution optical imagery using Bag of Word model with Spatial Pyramid (SP-BoW). Given that based on ?spatial pyramid? of the histogram of local features, the final feature vectors not only count the multiplicity of ?words? but also represent their spatial topology. We attempt to improve the performance of this model by introducing augmented data for training phase. Our aim is to make the dataset big enough to be able to capture holistic variation of ship orientation. Three data augmentation operations are used including random rotate by an angle of modulo 90°, random flip-left-right, and random flip-top-bottom. Through this procedure, our trained SP-BoW model is able to get better generalization. The proposed approach is validated on the High-Resolution Ship Collections 2016 (HRSC2016) ship dataset. The results indicate that training on augmented data can significantly improve the performance of SP-BoW. Beside, compared to other state-of-the-art convolutional neural network-based approaches, the approach proposed in this research has yielded competitive results and could make it a good baseline for evaluating more sophisticated CNN architecture in the future. PB - Taylor & Francis JF - Remote Sensing Letters VL - 10 SN - 2150-704X TI - Improving the Bag-of-Words model with Spatial Pyramid matching using data augmentation for fine-grained arbitrary-oriented ship classification SP - 826 AV - none EP - 834 ER - TY - CONF ID - SisLab2105 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2105/ A1 - Luu, Viet Hung A1 - Man, Duc Chuc A1 - Luong, Chinh Ke A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2016/// TI - Air pollution mapping from high spatial resolution satellite images: a case study in Hanoi SP - 130 M2 - Hanoi, Vietnam AV - none EP - 135 T2 - The 2nd International Joint Conference (IJCC) ER - TY - JOUR ID - SisLab2097 UR - http://www.earticle.net/article.aspx?sn=278787 IS - 2 A1 - Luu, Viet Hung A1 - Pham, Van Manh A1 - Man, Duc Chuc A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2016/06// N2 - Impervious surfaces are important indicators for urban development monitoring. Accurate mapping of urban impervious surfaces with observational satellites, such as VNREDSat-1, remains challenging due to the spectral diversity not captured by an individual PAN image. In this article, five multi-resolution image fusion techniques were compared for the task of classifting urban impervious surfaces. The result shows that for VNREDSat-1 dataset, UNB and Wavelet tranformation methods are the best techniques in reserving spatial and spectral information of original MS image, respectively. However, the UNB technique gives the best results when it comes to impervious surface classification, especially in the case of shadow areas included in non-impervious surface group. PB - The International Promotion Agency of Culture Technology JF - International Journal of Advanced Culture Technology (IJACT) VL - 4 TI - Comparison of Various Image Fusion Methods for Impervious Surface Classification from VNREDSat-1 SP - 1 AV - public EP - 6 ER - TY - CONF ID - SisLab104 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/104/ A1 - Ma, Thi Chau A1 - Bui, The Duy A1 - Dang, Trung Kien Y1 - 2012/08/17/ N2 - 3D skull is crucial in skull-based 3D facial reconstruction. In 3D reconstruction, especially in skull-based 3D facial reconstruction, features usually play an important role. Because, the accuracy in feature detection strongly affects the accuracy of the 3D final model. In this paper, we concentrate on accuracy of 3D reconstructed skull, one important part in skull-based 3D facial reconstruction. We discuss a cause of errors called shift errors when taking sequence of skull images. In addition, we analysis the effect of shift error in 3D reconstruction and propose solution to limit the effect. KW - Accuracy;Biological tissues;Cameras;Face;Feature extraction;Image reconstruction;Shape;computer graphics;image reconstruction;3D final model;image based 3D skull feature reconstruction;shift error analysis;shift errors;skull images;skull-based 3D facial reconstruction;3D facial reconstruction;accuracy;feature detection; TI - Shift Error Analysis in Image Based 3D Skull Feature Reconstruction SP - 4 M2 - Danang, Vietnam AV - none EP - 10 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab2646 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2646/ A1 - Ma, Thi Chau A1 - Chetcuti-Sperandiox, Nathalie A1 - Lagruex, Sylvain A1 - Nguyen, Thanh Thuy A1 - Bui, The Duy Y1 - 2017/03// N2 - In this paper we propose the first steps for building a Vietnamese water puppetry ontology. The creation of the puppetry ontology would allow not only a more informed and productive professional training, but also the capability of preserving and promoting water puppetry. Gathering water puppetry expert knowledge requires a deep study of puppetry history, background knowledge and performance. Hence, we analyze stories, background knowledge and performance of the water puppetry in the context of the Vietnamese general culture and legends. Especially, we emphasize on the issue of inconsistencies - a key challenge in ontology building. We also present a specific case study using DL-Lite for representation, reasoning and querying in presence of inconsistencies. TI - Towards an Ontology for Vietnamese Water Puppetry M2 - Chiengmai, Thailand AV - public T2 - International Conference on Digital Arts, Media and Technology (ICDAMT) ER - TY - JOUR ID - SisLab2028 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2028/ IS - 2 A1 - Ma, Thi Chau A1 - Hoang, Minh Duong Y1 - 2016/// PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - Kinect based character navigation in VR Game SP - 23 AV - none EP - 30 ER - TY - CONF ID - SisLab2652 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2652/ A1 - Ma, Thi Chau A1 - Nguyen, Dinh Tu A1 - Dinh, Quang Huy A1 - Bui, The Duy Y1 - 2011/// TI - 3D facial reconstruction system from skull for Vietnamese AV - none M2 - Vietnam T2 - KSE: the 2011 International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab3044 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3044/ A1 - Ma, Thi Chau A1 - Nguyen, Thanh Thuy Y1 - 2018/03// N2 - This paper aims at designing and constructing an ontology, representing and allowing Vietnamese folk dances annotation. An effective approach proposed is based on movement analysis. It is possible to divide Vietnamese folk dances into basic units, then movement phrases, movement primitives and dance poses. Studying deeply Vietnamese folk dances features and characteristics allows to find out 5 different types of relationships between main dance components. Typical relationships could be written in the form of logical predicates. For enriching ontologies, a formal encoding of the ontology expertise knowledge in the domain is performed by DL-Lite. The paper uses OWL-2 for building, organizing and visualizing ontologies. A case study ? Mo folk dance with a knowledge base, is structured simply but effectively, with reasoning in DL-Lite and answering queries in SPARQL. TI - A Labanotation based ontology for representing Vietnamese folk dances M2 - Chieng Rai, Thailand AV - none T2 - International Conference on Digital Arts, Media and Technology. ER - TY - CONF ID - SisLab2651 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2651/ A1 - Ma Thi, Chau A1 - Park, Chang-soo A1 - Suthunyatanakit, Kittichai A1 - Oh, Min-jae A1 - Kim, Tae-wan A1 - Kang, Myung-joo A1 - Bui, The Duy Y1 - 2012/// N2 - To detect features are significantly important for reconstructing a model in reverse engineering. In general, it is too difficult to find the features from the original industrial 3D CT data because the data have many noises. So it is necessary to reduce the noises for detecting features. This paper proposes a new method for detecting corner features and edge features from noisy 3D CT scanned data. First, we applied the level set method[18] to CT scanned image in order to segment the data. Next, in order to reduce noises, we exploited nonlocal means method[19] to the segmented surface. This helps to detect the edges and corners more accurately. Finally, corners and sharp edges are detected and extracted from the boundary of the shape. The corners are detected based on Sobel-like mask convolution processing with a marching cube. The sharp edges are detected based on Canny-like mask convolution with SUSAN method[13], which is for noises removal. In the paper, the result of detecting both features is presented. TI - Features Detection from Industrial Noisy 3D CT Data for Reverse Engineering SP - 89 AV - none EP - 101 T2 - Multimedia, Computer Graphics and Broadcasting ER - TY - CONF ID - SisLab3750 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3750/ A1 - Ma Thi, Chau A1 - Sylvain, Lagrue A1 - Nathalie, Chetcuti-Sperandio A1 - Ngo, Thi Duyen A1 - Fabien, Delorme A1 - Karim, Tabia A1 - Salem, Benferhat Y1 - 2019/10// N2 - Collecting dance videos, preserving and promoting them after enriching the collected data has been significant actions in preserving Intangible culture heritage in South-East Asia. Whereas techniques for the conceptual modeling of the expressive semantics of dance videos are very complex, they are crucial to exploit effectively the video semantics. This paper proposes an ontology web-based dance video annotation system for representing the semantics of dance videos at different granularity levels. Especially, the system incorporates both syntactic and semantic features of pre-built dance ontology system in order to not only use the available semantic web system but also to create unity for users when annotating videos to minimize conflicts. TI - An Ontology Web Application-based Annotation Tool for Intangible Culture Heritage Dance Videos M2 - Nice, France AV - public T2 - The 1st workshop on Structuring and Understanding of Multimedia heritAge Contents ER - TY - CONF ID - SisLab2647 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2647/ A1 - Ma Thi, Chau A1 - Tabia, Karim A1 - Sylvain, Lagrue A1 - Nguyen, Thanh Thuy A1 - Le, Thanh Ha A1 - Bui, The Duy Y1 - 2017/06// N2 - This paper aims at the annotation of movement phrases in Vietnamese folk dance videos that were mainly gathered, stored and used in teaching at art schools and in preserving cultural intangible heritages (performed by different famous folk dance masters). We propose a framework of automatic movement phrase annotation, in which the motion vectors are used as movement phrase features. Movement phrase classification can be carried out, based on dancer?s trajectories. A deep investigation of Vietnamese folk dance gives an idea of using optical flow as movement phrase features in movement phrase detection and classification. For the richness and usefulness in annotation of Vietnamese folk dance, a lookup table of movement phrase descriptions is defined. In initial experiments, a sample movement phrase dataset is built up to train k-NN classification model. Experiments have shown the effectiveness of the proposed framework of automatic movement phrase annotation with classification accuracy at least 88%. TI - Annotating movement phrases in Vietnamese folk dance videos SP - 3 M2 - Arras, France AV - none EP - 11 T2 - International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems IEA/AIE 2017: Advances in Artificial Intelligence: From Theory to Practice ER - TY - INPR ID - SisLab3166 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3166/ A1 - Mac, Hieu A1 - Truong, Dung A1 - Nguyen, Lam A1 - Nguyen, Ngoc Hoa A1 - Tran, Hai Anh A1 - Tran, Quang Duc Y1 - 2018/12// N2 - Web attacks have become a real threat to the Internet. This paper proposes the use of autoencoder to detect malicious pattern in the HTTP/HTTPS requests. The autoencoder is able to operate on the raw data and thus, does not require the hand-crafted features to be extracted. We evaluate the original autoencoder and its variants and end up with the Regularized Deep Autoencoder, which can achieve an F1-score of 0.9463 on the CSIC 2010 dataset. It also produces a better performance with respect to OWASP Core Rule Set and other one-class methods, reported in the literature. The Regularized Deep Autoencoder is then combined with Modsecurity in order to protect a website in real time. This algorithm proves to be comparable to the original Modsecurity in terms of computation time and is ready to be deployed in practice. TI - Detecting Atacks on Web Applications using Autoencoder M2 - Da Nang AV - none T2 - The Ninth International Symposium on Information and Communication Technology (SoICT 2018) ER - TY - JOUR ID - SisLab4028 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4028/ IS - 3 A1 - Mai, Manh Trung A1 - Le, Phe Do A1 - Le, Trung Thuc A1 - Dao, Thi Phuong Anh Y1 - 2020/05// N2 - The article describes the basic idea of Elliptic curve cryptography (ECC). Elliptic curve arithmetic can be used to develop Elliptic curve coding schemes, including key exchange, encryption, and digital signature. The main attraction of Elliptic curve cryptography compared to RSA is that it provides equivalent security for a smaller key size, which reduces processing costs. To encode the Vietnamese text, we are based on the sound of Vietnamese characters to make a table of these characters? order. We are also based on the algorithm to create the data sequence as the basis of building an encryption algorithm by using Elliptic curves on finite fields with symmetric keys to encrypt this Vietnamese text JF - International Journal of Advanced Trends in Computer Science and Engineering VL - 9 SN - ISSN 2278-3091 TI - Proposing an Elliptic Curve Cryptosystem with the Symmetric Key for Vietnamese Text Encryption and Decryption SP - 4158 AV - public EP - 4162 ER - TY - CONF ID - SisLab2754 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2754/ A1 - Mai, Manh Trung A1 - Le, Phe Do A1 - Le, Trung Thuc A1 - Tran, Van Manh A1 - Le, Thi Len A1 - Nguyen, Khac Hung A1 - Nguyen, Thi Hang Y1 - 2017/12/02/ N2 - PRESENT là m?t trong nh?ng h? m?t mã kh?i h?ng nh? có kích th??c kh?i tin 64-bit v?i hai bi?n th? c?a khóa l?n l??t là 64-bit và 128- bit. Thi?t k? c?a PRESENT s? d?ng nhi?u các ánh x? tuy?n tính và s? d?ng khóa tr?c ti?p trong khi mã hóa mà không thông qua nh?ng phép bi?n ??i làm vi?c tr??c v?i khóa. Do ?ó, PRESENT d??ng nh? khá mong manh tr??c nh?ng d?ng t?n công thám mã nh?: t?n công ??i s?, t?n công khôi ph?c khóa... Trong bài báo này, chúng tôi th?c hi?n ?? xu?t nâng cao thu?t toán PRESENT b?ng cách nâng cao S-Box nh?m m?c ?ích nâng cao ?? an toàn c?a thu?t toán tr??c nh?ng nhà thám mã. Keywords-M?t mã nh?, mã kh?i, PRESENT Lightweight, Attack Present TI - Nghiên c?u các cu?c t?n công h? m?t mã nh? PRESENT AV - public T2 - M?t s? v?n ?? ch?n l?c v? an toàn thông tin ER - TY - CONF ID - SisLab1975 UR - http://doi.org/10.1109/ICTEmSys.2016.7467120 A1 - Makino, Yoshiki A1 - Wongpatikaseree, Konlakorn A1 - Okada, Takashi A1 - Nguyen, Hoai Son A1 - Lim, Yuto A1 - Tan, Yasuo Y1 - 2016/// N2 - Energy management systems have been developed in order to achieve goal of energy efficiency in the focused areas. Home simulation is one of the tools that can simulate electricity consumption based on the home appliances usage. However, several elements were ignored in traditional home simulation. In this paper, we introduce the home simulation, which can simulate not only the electric power and its consumption, but also the thermal energy consumption. Relationships among five elements are considered in the home simulation. To validate the performance of the proposed home simulation, a real experimental house is used to conduct the experiment. The results showed the ability of the proposed home simulation to simulate the thermal energy and estimate the temperature of various rooms with an error of 1.2 degrees Celsius. Furthermore, the electricity consumption is also simulated based on the human activity schedule and home appliances usage. TI - Development of home simulation with thermal environment and electricity consumption SP - 45 AV - public EP - 50 T2 - 7th International Conference on Information Communication Technology for Embedded Systems 2016 (IC-ICTES 2016) ER - TY - CONF ID - SisLab443 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_20 A1 - Man, Duc Chuc A1 - Luu, Viet Hung A1 - Hoang, Van Thang A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2014/10/09/ TI - Cloud Detection Algorithm for LandSat 8 Image Using Multispectral Rules and Spatial Variability SP - 247 M2 - Hanoi, Vietnam AV - none EP - 259 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab2768 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2768/ A1 - Man, Duc Chuc A1 - Nguyen, Hoang Anh A1 - Nguyen, Thanh Thuy A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2017/// TI - Paddy Rice Mapping in Red River Delta region Using Landsat 8 Images: Preliminary results AV - none T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE 2017), 19-21 October 2017, Hue City, Vietnam. ER - TY - JOUR ID - SisLab3275 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3275/ A1 - McDonald, John F A1 - Mezencev, Roman A1 - Tran, Quoc Long A1 - Benigno, Benedict A1 - Bonta, Ioana A1 - Del Priore, Giuseppe Y1 - 2015/// PB - American Society of Clinical Oncology JF - Journal of Clinical Oncology TI - Accurate prediction of optimal cancer drug therapies from molecular profiles by a machine-learning algorithm. AV - none ER - TY - JOUR ID - SisLab2075 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2075/ IS - 2 A1 - Meysman, Pieter A1 - Dang, Thanh Hai A1 - Laukens, Kris A1 - De Smet, Riet A1 - Wu, Yan A1 - Marchal, Kathleen A1 - Engelen, Kristof Y1 - 2011/// PB - Oxford Univ Press JF - Nucleic Acids Research VL - 39 TI - Use of structural DNA properties for the prediction of transcription-factor binding sites in Escherichia coli SP - subjects AV - none EP - IT ER - TY - JOUR ID - SisLab4533 UR - http://dx.doi.org/10.1093/sysbio/syab010 A1 - Minh, Bui Quang A1 - Dang, Cao Cuong A1 - Vinh, Le Sy A1 - Lanfear, Robert Y1 - 2021/02/22/ N2 - Amino acid substitution models play a crucial role in phylogenetic analyses. Maximum likelihood (ML) methods have been proposed to estimate amino acid substitution models; however, they are typically complicated and slow. In this article, we propose QMaker, a new ML method to estimate a general time-reversible Q matrix from a large protein data set consisting of multiple sequence alignments. QMaker combines an efficient ML tree search algorithm, a model selection for handling the model heterogeneity among alignments, and the consideration of rate mixture models among sites. We provide QMaker as a user-friendly function in the IQ-TREE software package (http://www.iqtree.org) supporting the use of multiple CPU cores so that biologists can easily estimate amino acid substitution models from their own protein alignments. We used QMaker to estimate new empirical general amino acid substitution models from the current Pfam database as well as five clade-specific models for mammals, birds, insects, yeasts, and plants. Our results show that the new models considerably improve the fit between model and data and in some cases influence the inference of phylogenetic tree topologies.[Amino acid replacement matrices; amino acid substitution models; maximum likelihood estimation; phylogenetic inferences. PB - Oxford University Press JF - Systematic Biology SN - 1063-5157 TI - QMaker: Fast and Accurate Method to Estimate Empirical Models of Protein Evolution AV - public ER - TY - JOUR ID - SisLab2294 UR - http://doi.org/10.1371/journal.pone.0009535 IS - 3 A1 - Mokrousov, Igor A1 - Sintchenko, Vitali A1 - Anthony, Stephen A1 - Phan, Xuan Hieu A1 - Lin, Frank A1 - Coiera, Enrico W. Y1 - 2010/03/10/ JF - PLoS ONE VL - 5 SN - 1932-6203 TI - A PubMed-Wide Associational Study of Infectious Diseases SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab2405 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2405/ A1 - Monge, ME A1 - Zang, X A1 - Jones, CM A1 - Tran, Quoc Long A1 - Zhou, Manshui A1 - Walker L., DeEtte A1 - Mezencev, Roman A1 - Gray, Alexander A1 - McDonald, John F. A1 - Fernandez, Facundo Y1 - 2016/10// N2 - Prostate cancer (PCa) represents the second leading cause of cancer mortality in many western countries. Although the Prostate-Specific Antigen (PSA) test is widely used to screen for PCa, certain advisory groups recommend against its use because it suffers from false positive results and over-treatment. These drawbacks have led to the increased interest of using metabolite profiling to discover new differential biomarkers that could improve the specificity of PCa diagnosis.1 In this work,2 untargeted metabolomic profiling of age-matched serum samples from PCa patients and healthy individuals was performed using ultraperformance liquid chromatography coupled to high-resolution tandem mass spectrometry and machine learning methods. PCa was detected in serum samples with 92.1% sensitivity, 94.3% specificity, and 93.0% accuracy by means of a metabolite-based in vitro diagnostic multivariate index assay, which outperformed the prevalent PSA test. Within the panel of 40 metabolic spectral features that was found to be differential, 31 metabolites were identified by MS and MS/MS, with 10 further confirmed by standards. Numerous discriminant metabolites were mapped in the steroid hormone biosynthesis pathway. The identification of fatty acids, amino acids, lysophospholipids, and bile acids provided further insights into the metabolite alterations associated with the disease. Our current work involves the prospective analysis of a larger sample cohort (n=500) that includes samples from PCa patients before and after undergoing surgery, patients with benign prostatitis, and healthy individuals with measured PSA values, in order to evaluate the influence of ethnicity and cohort size on the robustness of the metabolic biomarker panel that we have previously found, and to discover biomarkers useful for follow-up care. TI - High Accuracy Prostate Cancer Detection Using Human Blood Serum Metabolomic Profiling AV - public T2 - 2nd Latin American Metabolic Profiling Symposium ER - TY - JOUR ID - SisLab1963 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1963/ A1 - Mustafa, Tanveer A1 - Sohr, Karsten A1 - Dang, Duc Hanh A1 - Drouineaud, Michael A1 - Kowski, Stefan Y1 - 2008/// JF - ECEASST VL - 15 SN - 1863-2122 TI - Implementing Advanced RBAC Administration Functionality with USE AV - none ER - TY - JOUR ID - SisLab3989 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3989/ IS - 2 A1 - NGUYEN, Kim Sao A1 - Nguyen, Ngoc Hoa A1 - PHAM, Van At Y1 - 2020/02// N2 - This paper presents a new effective reversible data hiding method based on pixel-value-ordering (iGePVO-K) which is improvement of a recent GePVO-K method that recently is considered as a PVO-used method having highest embedding capacity. In comparison with GePVO-K method, iGePVO-K has the following advantages. First, the embedding capacity of the new method is higher than that of GePVO-K method by using data embedding formulas reasonably and reducing the location map size. Second, for embedding data, in the new method, each pixel value is modified at most by one, while in GePVO-K method, each pixel value may be modified by two. In fact, in the GePVO-K method, the largest pixels are modified by two for embedding bits 1 and by one for bits 0. This is also true for the smallest pixels. Meanwhile, in the proposed method, the largest pixels are modified by one for embedding bits 1 and are unchanged if embedding bits 0. Therefore, the stego-image quality in proposed method is better than that in GePVO-K method. Theoretical analysis and experiment results show that the proposed method has higher embedding capacity and better stego image quality than GePVO-K method. JF - Journal of Computer Science and Cybernetics VL - 36 SN - 1813-9663 TI - An effective reversible data hiding method based on pixel-value-ordering SP - 139 AV - none EP - 158 ER - TY - JOUR ID - SisLab2582 UR - http://www.impactjournals.com/oncotarget/index.php?journal=oncotarget&page=article&op=view&path[]=20923 A1 - Naulaerts, Stefan A1 - Dang, Cao Cuong A1 - Ballester, Pedro Y1 - 2017/09/15/ N2 - Cancer drug therapies are only effective in a small proportion of patients. To make things worse, our ability to identify these responsive patients before administering a treatment is generally very limited. The recent arrival of large-scale pharmacogenomic data sets, which measure the sensitivity of molecularly profiled cancer cell lines to a panel of drugs, has boosted research on the discovery of drug sensitivity markers. However, no systematic comparison of widely-used single-gene markers with multi-gene machine-learning markers exploiting genomic data has been so far conducted. We therefore assessed the performance offered by these two types of models in discriminating between sensitive and resistant cell lines to a given drug. This was carried out for each of 127 considered drugs using genomic data characterising the cell lines. We found that the proportion of cell lines predicted to be sensitive that are actually sensitive (precision) varies strongly with the drug and type of model used. Furthermore, the proportion of sensitive cell lines that are correctly predicted as sensitive (recall) of the best single-gene marker was lower than that of the multi-gene marker in 118 of the 127 tested drugs. We conclude that single-gene markers are only able to identify those drug-sensitive cell lines with the considered actionable mutation, unlike multi-gene markers that can in principle combine multiple gene mutations to identify additional sensitive cell lines. We also found that cell line sensitivities to some drugs (e.g. Temsirolimus, 17-AAG or Methotrexate) are better predicted by these machine-learning models. PB - Impact journals JF - Oncotarget SN - 1949-2553 TI - Precision and recall oncology: combining multiple gene mutations for improved identification of drug-sensitive tumours AV - public ER - TY - CONF ID - SisLab4523 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4523/ A1 - Ngo, Kien Tuan A1 - Nguyen, Thu Trang A1 - Nguyen, Van Son A1 - Vo, Dinh Hieu N2 - Software fault localization is one of the most expensive, tedious, and time-consuming activities in program debugging. This activity becomes even much more challenging in Software Product Line (SPL) systems due to the variability of failures in SPL systems. These unexpected behaviors are caused by variability faults which can only be exposed under some combinations of system features. Although localizing bugs in non-configurable code has been investigated in-depth, variability fault localization in SPL systems still remains mostly unexplored. To approach this challenge, we propose a benchmark for variability fault localization with a large set of 1,773 buggy versions of six SPL systems and baseline variability fault localization performance results. Our hope is to engage the community to propose new and better approaches to the problem of variability fault localization in SPL systems. TI - Variability Fault Localization: A Benchmark AV - none M2 - Leicester, UK T2 - 25th ACM International Systems and Software Product Line Conference (SPLC 2021) ER - TY - JOUR ID - SisLab4077 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4077/ A1 - Ngo, Kien Tuan A1 - Vo, Dinh Hieu A1 - Bui, Ngoc Thang A1 - Pham, Le Viet Anh A1 - Pham, Khanh Ly A1 - Phan, Hai Y1 - 2020/// N2 - Today, bibliometric databases are indispensable sources for researchers and research institutions. The main role of these databases is to find research articles and estimate the performance of researchers and institutions. Regarding the evaluation of the research performance of an organization, the accuracy in determining institutions of authors of articles is decisive. However, current popular bibliometric databases such as Scopus and Web of Science have not addressed this point e?ciently. To this end, we propose an approach to revise the authors? a?liation information of articles in bibliometric databases. We build a model to classify articles to institutions with high accuracy by assembling the bag of words and n-grams techniques for extracting features of a?liation strings. After that, these features are weighted to determine their importance to each institution. A?liation strings of articles are transformed into the new feature space by integrating weights of features and local characteristics of words and phrases contributing to the sequences. Finally, on the feature space, the support vector classifier method is applied to learn a predictive model. Our experimental result shows that the proposed model?s accuracy is about 99.1%. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering SN - 2588-1086 TI - On Rectifying the Mapping between Articles and Institutions in Bibliometric Databases AV - none ER - TY - CONF ID - SisLab2066 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2066/ A1 - Ngo, Le Minh Y1 - 2006/// N2 - The rapid development ofmobile computing has dramatically changed the way users view and use computers. With mobile computing technologies, we can acquire, deliver and process information at every place. Appearing in many forms such as the PalmOS, Pocket PC and Mobile Phone with increasingly diverse functions, and equipped with advanced peripheral devices such as GPS, camera and wireless adapter, mobile devices is becoming a very powerful all-in-one Personal Digital Assistant (PDA). PDAs have increased the effectiveness, brought people closer and made people more dynamic and flexible. In this paper, we present our research on setting up an m-World with various activities on PDAs. Our research focuses on three categories: education activities (mlearning), commerce activities (m-commerce) and service activities (m-service). In the first category, we have built a PDA-based m-learning system which allows the students to access the learning resources and allows the students and lecturers to exchange ideas from anywhere and at any time. In the category of commerce activities, we have developed experimental system which allows the user to do his/her shopping with mobile phones. There are various of systems which we have developed in the category of service activities including tourist assistant and traffic jam warning system. Our initial results have shown that such an m-World we are looking forward to is not very far from real. TI - Towards building up an m-World M2 - Hanoi, Vietnam AV - public T2 - Japan-Vietnam Workshop on Software Engineering ER - TY - CONF ID - SisLab2064 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2064/ A1 - Ngo, Le Minh Y1 - 2006/// N2 - This paper studies the implosion problem in multicast. The result explained in this paper is a part of the work on analyzing the scalability of a reliable multicast protocol. The paper describes a method proposed to determine the backoff time for multicast clients to avoid packet loss due to the implosion problem. The proposed method has been implemented and the output data is shown. The flow of acknowledgment packets from clients to the server has been studied. Random multicast networks are generated and backoff times are calculated in order to show the impact of the implosion problem on the transmission delay in reliable multicast. It is proved by analysis that the backoff interval is proportional to the number of users which is large enough. Linear increase in transmission delay is equivalent to that a reliable multicast protocol fails to work for a large number of users. TI - The impact of the implosion problem on the backoff time for a reliable multicast protocol M2 - Hanoi, Vietnam AV - public T2 - International Conference on Computer Sciences dedicated to Research, Innovation and Vision for the Future ER - TY - CONF ID - SisLab3607 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3607/ A1 - Ngo, Minh Hoang A1 - Nguyen, Xuan Viet Cuong A1 - Duong, Quang Khai A1 - Nguyen, Hoai Son Y1 - 2019/11// N2 - Smart lighting system plays an important role in smart homes because of its convenience comparing with boring and tedious on/off switches. With conventional smart lighting systems, users can easily change the lighting level of a room with a smart phone or voice control device. However, design an automated lighting system with energy saving is still a challenge. In this paper, we propose an adaptive smart lighting system using a control algorithm based on Genetic Algorithm (GA). Our system turns on and off lights that match the user?s desire brightness and utilizes nature illuminance efficiently to save as much electric energy as possible. The control algorithm based on GA provides the optimized light turning pattern to the system and can adapt with the change of lighting environment and user requirement. Our evaluation results showed that the execution time of our algorithm is short enough to be used in real environment. TI - Adaptive Smart Lighting Control based on Genetic Algorithm SP - 320 M2 - Ho Chi Minh city, Vietnam AV - public EP - 325 T2 - 2019 25th Asia-Pacific Conference on Communications (APCC) ER - TY - THES ID - SisLab1984 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1984/ A1 - Ngo, Thi Duyen Y1 - 2016/// PB - Tr??ng ?H Công ngh? - ?HQGHN TI - Nghiên c?u mô hình nhân v?t ?o bi?u c?m trên khuôn m?t ba chi?u nói ti?ng Vi?t M1 - phd AV - none ER - TY - CONF ID - SisLab1416 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1416/ A1 - Ngo, Thi Duyen A1 - Akagi, Masato A1 - Bui, The Duy Y1 - 2014/// TI - Towards a Rule-Based Synthesis of Vietnamese Emotional Speech AV - none M2 - Hanoi, Vietnam T2 - KSE: the 6th International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab99 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/99/ A1 - Ngo, Thi Duyen A1 - Bui, The Duy Y1 - 2012/08// N2 - This paper describes the analyses of the prosody of Vietnamese emotional speech, accomplished to find the relations between prosodic variations and emotional states in Vietnamese speech. These relations were obtained by investigating the variations of prosodic features in Vietnamese emotional speech in comparison with prosodic features of neutral speech. The analyses were performed on a multi-style emotional speech database which consisted of Vietnamese sentences uttered in different styles. Specifically, four emotional styles were considered: happiness, sadness, cold anger, and hot anger. Speech data in the neutral style were also collected, and prosodic differences of each style with respect to this neutral baseline were quantified. The acoustic features related to prosody which were investigated were fundamental frequency, power, and duration. According to the analysis results, for each speaker of the database, a set of prosodic variation coefficients was produced for each emotional style. This will help for bringing emotions into Vietnamese synthesized speech, making them more natural. KW - Acoustics;Compounds;Databases;Feature extraction;Humans;Speech;Stress;acoustic signal processing;emotion recognition;speech synthesis;Vietnamese emotional speech prosody;Vietnamese sentence;Vietnamese synthesized speech;acoustic feature;cold anger;emotional style;happiness;hot anger;multistyle emotional speech database;neutral baseline;prosodic difference;prosodic variation;sadness;Acoustic Feature;Emotional Speech;Prosody;Vietnamese; TI - A Study on Prosody of Vietnamese Emotional Speech SP - 151 M2 - Danang, Vietnam AV - none EP - 155 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1462 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1462/ A1 - Ngo, Thi Duyen A1 - Bui, The Duy Y1 - 2015/01// N2 - Conversational agents are receiving significant attention from multi-agent and human computer interaction research societies. Many techniques have been developed to enable these agents to behave in a human-like manner. In order to do so, they are simulated with similar communicative channels as humans. Moreover, they are also simulated with emotion and personality. In this work, we focus on issue of expressing emotions for embodied-agents. We present a three dimensional face with ability to speak emotional Vietnamese speech and naturally express emotions while talking. Our face can represent lip movements during emotionally pronouncing Vietnamese words, and at the same time it can show emotional facial expressions while speaking. The face's architecture consists of three parts: Vietnamese Emotional Speech Synthesis module, Emotions to Facial Expressions module, and Combination module which creates lip movements when pronouncing Vietnamese emotional speech and combines these movements with emotional facial expressions. We have tested the face in the football supporter domain in order to confirm its naturalness. The face is simulated as the face of a football supporter agent which experiences emotions and expresses emotional expressions in his voice as well as on his face. KW - emotion recognition;human computer interaction;multi-agent systems;natural language processing;signal representation;speech synthesis;sport;Vietnamese 3D talking face;Vietnamese emotional speech synthesis module;combination module;communicative channels;embodied conversational agents;emotion-facial expressions module;emotional facial expressions;football supporter agent;football supporter domain;human computer interaction research societies;lip movement representation;multiagent;personality;three dimensional face;Acoustics;Databases;Face;Feature extraction;Lips;Speech;Three-dimensional displays;Conversational Agent;Emotional Facial Expression;Emotional Speech;Vietnamese 3D Talking Face TI - A Vietnamese 3D Taking Face for Embodied Conversational Agents SP - 94 M2 - Can Tho, Vietnam AV - none EP - 99 T2 - RIVF: 2015 IEEE RIVF International Conference on Computing Communication Technologies - Research, Innovation, and Vision for the Future ER - TY - CONF ID - SisLab1600 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1600/ A1 - Ngo, Thi Duyen A1 - Bui, The Duy Y1 - 2015/// N2 - Conversational agents are receiving significant attention from multi-agent and human computer interaction research societies. Many techniques have been developed to enable these agents to behave in a human-like manner. In order to do so, they are simulated with similar communicative channels as humans. Moreover, they are also simulated with emotion and personality. In this work, we focus on issue of expressing emotions for embodied-agents. We present a three dimensional face with ability to speak emotional Vietnamese speech and naturally express emotions while talking. Our face can represent lip movements during emotionally pronouncing Vietnamese words, and at the same time it can show emotional facial expressions while speaking. The face's architecture consists of three parts: Vietnamese Emotional Speech Synthesis module, Emotions to Facial Expressions module, and Combination module which creates lip movements when pronouncing Vietnamese emotional speech and combines these movements with emotional facial expressions. We have tested the face in the football supporter domain in order to confirm its naturalness. The face is simulated as the face of a football supporter agent which experiences emotions and expresses emotional expressions in his voice as well as on his face. TI - A Vietnamese 3D Taking Face for Embodied Conversational Agents SP - 94 M2 - Can Tho, Vietnam AV - none EP - 99 T2 - RIVF: the 2015 IEEE-RIVF International Conference on Computing and Communication Technologies ER - TY - CONF ID - SisLab2992 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2992/ A1 - Ngo, Thi Duyen A1 - Le, Thi Hoi A1 - Vu, Duy Loi A1 - Nguyen, Dinh Viet Y1 - 2005/05// N2 - Báo cáo này trình bày các k?t qu? nghiên c?u c?a chúng tôi v? RED (Random Early Detection of congestion) b?ng b? mô ph?ng m?ng NS. Chúng tôi c?ng th?c hi?n các mô ph?ng hàng ??i ki?u Tail-Drop ?? so sánh v?i RED. Vì l?u l??ng trên Internet có ??c tính bùng n? nên hàng ??i (b? ??m) t?i các nút m?ng (router) ph?i có kích th??c ?? l?n, ?? ??m b?o cho các nút th?c hi?n ch?c n?ng store-and-forward m?t cách hi?u qu?. Tuy nhiên, n?u thi hành chính sách ph?c v? t?i hàng ??i ki?u FIFO (Tail-Drop Queue) thì hàng ??i s? th??ng xuyên ? tr?ng thái ??y, làm t?ng ?áng k? th?i gian tr? trung bình c?a các gói tin trong m?ng. Do v?y, ?i?u quan tr?ng là ph?i có các k? thu?t ?? ??m b?o cho m?ng ??t ???c thông l??ng cao và th?i gian tr? trung bình nh?. RED là m?t chi?n l??c qu?n lý hàng ??i ??ng, c?ng tác v?i chi?n l??c tránh t?c ngh?n t?i ngu?n c?a TCP; RED ?áp ?ng ???c các yêu c?u nêu trên. RED phát hi?n s?m s? t?c ngh?n m?ng ngay khi nó có d?u hi?u s?p xu?t hi?n và ph?n ?ng m?t cách tích c?c ?? ng?n ch?n. TI - ?ÁNH GIÁ HI?U SU?T CHI?N L??C QU?N LÝ HÀNG ??I RED B?NG B? MÔ PH?NG M?NG NS SP - 394 M2 - Hà N?i, Vi?t Nam AV - none EP - 403 T2 - H?i th?o Khoa h?c Qu?c gia l?n th? hai v? Nghiên c?u, Phát tri?n và ?ng d?ng Công ngh? Thông tin và Truy?n thông (ICT.rda'04) ER - TY - CONF ID - SisLab444 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_39 A1 - Ngo, Thi Duyen A1 - Ma, Thi Chau A1 - Bui, The Duy Y1 - 2014/10/09/ N2 - Emotions have been studied for a long time and results show that they play an important role in human cognitive functions. In fact, emotions play an extremely important role during the communication between people. And the human face is the most communicative part of the body for expressing emotions; it is recognized that a link exists between facial activity and emotional states. In order to make computer applications more believable and friendly, giving them the ability to recognize and/or express emotions are research fields which have been much focused on. Being able to perform these tasks, firstly, we need to have knowledge about the relationship between emotion and facial activity. Up to now, there have been proposed researches on this relationship. However, almost all these researches focused on analyzing the relationship without taking into account time factors. They analyzed the relationship but did not examined it in the time domain. In this paper, we propose a work on analyzing the relationship between emotions and facial activity in the time domain. Our goal is finding the temporal patterns of facial activity of six basic emotions (happy, sad, angry, fear, surprise, disgust). To perform this task, we analyzed a spontaneous video database in order to consider how facial activities which are related to the six basic emotions happen temporally. From there, we bring out the general temporal patterns for facial expressions of each of the six emotions. TI - Emotional Facial Expression Analysis in the Time Domain SP - 487 M2 - Hanoi, Vietnam AV - none EP - 498 T2 - The 6th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab3760 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3760/ A1 - Ngo, Thi Duyen A1 - Tran, Thi Minh A1 - Ma, Thi Chau A1 - Nguyen, Xuan Hung A1 - Le, Thanh Ha Y1 - 2019/11// JF - International Association for Printing Woodblocks (IAPW) TI - Royal printing woodblocks of Nguyen Dynasty: 3D reconstruction for digital preversation SP - 333 AV - none EP - 348 ER - TY - CONF ID - SisLab1427 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1427/ A1 - Ngo, Thi Duyen A1 - Vu, Thi Hong Nhan A1 - Nguyen, Viet Ha A1 - Bui, The Duy Y1 - 2014/12// TI - Improving Simulation of Continuous Emotional Expressions by Analyzing Video of Human Facial Activities SP - 222 M2 - Queensland, Australia AV - none EP - 237 T2 - 2014: the 17th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA) ER - TY - CONF ID - SisLab1417 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1417/ A1 - Ngo, Thi Duyen A1 - Vu, Thi Hong Nhan A1 - Nguyen, Viet Ha A1 - Bui, The Duy Y1 - 2014/// TI - Improving Simulation of Continuous Emotional Facial Expressions by Analyzing Videos of Human Facial Activities AV - none M2 - Queensland, Australia T2 - PRIMA: the 17th International Conference on Principles and Practice of Multi-Agent Systems ER - TY - CONF ID - SisLab2293 UR - http://doi.org/10.1145/3011077.3011119 A1 - Ngo, Thi Lan A1 - Duong, Quang Vu A1 - Pham, Son Bao A1 - Phan, Xuan Hieu Y1 - 2016/12/08/ TI - Speech act classification in Vietnamese Utterance and its application in smart mobile voice interaction SP - 396 M2 - Ho Chi Minh City, Viet Nam AV - none EP - 402 T2 - Proceedings of the Seventh Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab1640 UR - http://dx.doi.org/10.1007/978-3-662-49381-6_19 A1 - Ngo, Thi Lan A1 - Nguyen, Van Hop A1 - Vuong, Thi Hai Yen A1 - Nguyen, Thac Thong A1 - Nguyen, Thi Thua A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2016/// VL - 9621 SN - 0302-9743 TI - Identifying User Intents in Vietnamese Spoken Language Commands and Its Application in Smart Mobile Voice Interaction SP - 190 M2 - Da Nang, Vietnam AV - none EP - 201 T2 - ACIIDS 2016: the 8th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab2687 UR - http://kse2017.dhsphue.edu.vn A1 - Ngo, Thi Lan A1 - Pham, Bao Son A1 - Pham, Khac Linh A1 - Phan, Xuan Hieu A1 - Cao, Minh Son Y1 - 2017/10/19/ N2 - Dialog act identification plays an important role in understanding conversations. It has been widely applied in many fields such as dialogue systems, automatic machine translation, automatic speech recognition, and especially useful in systems with human-computer natural language dialogue interfaces such as virtual assistants and chatbots. The first step of identifying dialog act is identifying the boundary of the dialog act in utterances. In this paper, we focus on segmenting the utterance according to the dialog act boundaries, i.e. functional segments identification, for Vietnamese utterances. We investigate carefully functional segment identification in two approaches: (1) machine learning approach using maximum entropy (ME) and conditional random fields (CRFs); (2) deep learning approach using bidirectional Long Short-Term Memory (LSTM) with a CRF layer (Bi-LSTM-CRF) on two different conversational datasets: (1) Facebook messages (Message data); (2) transcription from phone conversations (Phone data). To the best of our knowledge, this is the first work that applies deep learning based approach to dialog act segmentation. As the results show, deep learning approach performs appreciably better as to compare with traditional machine learning approaches. Moreover, it is also the first study that tackles dialog act and functional segment identification for Vietnamese. TI - Dialogue act segmentation for Vietnamese human-human conversational texts SP - 203 M2 - Hue city, Vietnam AV - none EP - 208 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE 2017) ER - TY - CONF ID - SisLab1529 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1529/ A1 - Ngo, Thi Lan A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2016/03/26/ N2 - This paper presents a lightweight machine learning model and a fast conjunction matching method to the problem of identifying user intents behind their spoken text commands. These model and method were integrated into a mobile virtual assistant for Vietnamese (VAV) to understand what mobile users mean to carry out on their smartphones via their commands. User intent, in the scope of our work, is an action associated with a particular mobile application. Given an input spoken command, its application will be identified by an accurate classifier while the action will be determined by a flexible conjunction matching algorithm. Our classifier and conjunction matcher are very compact in order that we can store and execute them right on mobile devices. To evaluate the classifier and the matcher, we annotated a medium?sized data set, conducting various experiments with different settings, and achieving impressive accuracy for both the application and action identification. TI - Identifying User Intents in Vietnamese Spoken Language Commands and Its Application in Smart Mobile Voice Interaction M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab2692 UR - http://www.soict.org A1 - Ngo, Thi Lan A1 - Pham, Khac Linh A1 - Hideaki, Takeda A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2017/12/07/ N2 - Suggestion intents mining from texts is an emerging research topic in recent years. Fully understanding suggestion intents in conversational texts is a complicated process that includes three major stages: user suggestion intents filtering, suggestion domain identification, and arguments extraction of suggestion intents. In the scope of this paper, we study the first phase, that is, building a binary classification model to determine whether a text unit carries suggestion intents or not. We come up with a new text unit to analysis suggestion, that is functional segment. According to the ISO 24617-2 standard, a functional segment is ?minimal stretch of communicative behavior that has one or more communicative functions?. We investigate two approaches to filter functional segment containing suggestion intents: machine learning using maximum entropy (Maxent) model and deep learning using convolutional neural networks (CNN) model. The results of these experiments on Vietnamese online media texts are very promising. To the best of our knowledge, this is the first study to analyze suggestion at functional segment unit. TI - On the Identification of Suggestion Intents from Vietnamese Conversational Texts M2 - Nha Trang AV - none T2 - The Eighth International Symposium on Information and Communication Technology (SoICT 2017) ER - TY - CONF ID - SisLab2980 UR - https://www.cicling.org/2018/accepted.html A1 - Ngo, Thi Lan A1 - Vu, Van Tu A1 - Hideaki, Takeda A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2018/03// N2 - Suggestion analysis of opinion data is classifying a given utterance into one of two classes: suggestion and non-suggestion. In this paper, we introduce a new method, called LLMaxent, to cross-domain suggestion classification. LLMaxent is an approach to lifelong machine learning using maximum entropy (Maxent) method. Based on the main idea of lifelong learning, that is retaining the knowledge learned from past tasks and using it to help future learning, we build a classifier can use labeled data in existed domains for suggestion classification in a new domain. The experimental results show that the proposed novel model can improve the performance of cross-domain suggestion classification. This is the first study of lifelong machine learning using Maxent and our method is not only useful for suggestion classification but also for cross-domain text classification in general. TI - Lifelong Learning MaxEnt for Suggestion Classification M2 - Hanoi, Vietnam AV - none T2 - 19th International Conference on Computational Linguistics and Intelligent Text Processing ER - TY - CONF ID - SisLab1495 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1495/ A1 - Ngo, Thi Oanh A1 - Chu, Chi Quang A1 - Lai, Thi Huyen Trang A1 - Nguyen, Thi Dung A1 - Ha, Quang Thuy A1 - Le, Hoang Quynh Y1 - 2016/04/29/ TI - Xây d?ng mô hình và h? th?ng d? báo d?ch t? khu v?c Hà N?i d?a trên k? thu?t khai phá d? li?u AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab440 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_11 A1 - Ngo, Thi-Duyen A1 - Akagi, Masato A1 - Bui, The Duy Y1 - 2014/10/09/ TI - Toward a Rule-Based Synthesis of Vietnamese Emotional Speech SP - 129 M2 - Hanoi, Vietnam AV - none EP - 142 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - JOUR ID - SisLab4536 UR - https://doi.org/10.1080/01431161.2021.1934911 IS - 16 A1 - Ngo, Truong X. A1 - Do, Ngoc T.N. A1 - Phan, Hieu D.T. A1 - Tran, Vinh T. A1 - Mac, Tra T.M. A1 - Le, Anh H. A1 - Do, Nguyet V. A1 - Bui, Hung Q. A1 - Nguyen, Thanh T.N. Y1 - 2021/// PB - Taylor & Francis JF - International Journal of Remote Sensing VL - 42 TI - Air pollution in Vietnam during the COVID-19 social isolation, evidence of reduction in human activities SP - 6128 AV - none EP - 6154 ER - TY - CONF ID - SisLab1777 UR - http://dx.doi.org/10.1109/ALPIT.2008.73 A1 - Ngo, Xuan Bach A1 - Le, Anh Cuong A1 - Nguyen, Viet Ha A1 - Nguyen, Ngoc Binh Y1 - 2008/// N2 - Part of speech (POS) tagging is an important problem and is one of the first steps included in many tasks in natural language processing. It affects directly on the accuracy of many other problems such as Syntax Parsing, WordSense Disambiguation, and Machine Translation. Stochastic models solve this problem relatively well, but they still make mistakes. Transformation-based learning (TBL) is a solution which can be used to improve stochastic taggers by learning a set of transformation rules. However, its rule learning algorithm has the disadvantages that rule templates must be prepared by hand and only rules are instances of rule templates can be generated. In this paper, we propose a model to learn transformation rules without rule templates. This model considers the rule learning problem as a feature selection problem. Experiments on PennTree Bank showed that the proposal model reduces errors of stochastic taggers with some tags. TI - Transformation Rule Learning without Rule Templates: A Case Study in Part of Speech Tagging SP - 9 AV - none EP - 14 T2 - Advanced Language Processing and Web Information Technology ER - TY - CONF ID - SisLab3325 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3325/ A1 - Ngo, Xuan Truong A1 - Nguyen, Van Hai A1 - Tran, Trung Kien A1 - Do, Thanh Cong A1 - Ha, Duc Van A1 - Luu, Quang Thang A1 - Luu, Viet Hung A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2018/12// N2 - Ngày nay, v? tinh ?ã và ?ang vai trò quan tr?ng trong nhi?u l?nh v?c cu?c s?ng. V? tinh có nhi?u lo?i, nhi?u kích th??c ???c s? d?ng cho cácm?c ?ích khác nhau. CANSAT là m?t lo?i v? tinh c? nh? có kích th??c b?ng lon n??c ???c s? d?ng cho m?c ?ích giáo d?c. Trong bài báo này, chu?ng tôi se? tri?nh bày ph??ng pháp thi?t k? và ch? t?o v?tinh FIMO CANSAT,quá tri?nh ki?m th? và phóng v? tinh.V?tinh FIMO CANSAT ???c ch? t?o v?i m?c ?ích giám sát ch?t l??ng không khí, m?t trong nh?ng v?n ?? c?p thi?t và ?ang ???c quan tâm hi?n nay. Các c?m bi?n trong v? tinh ???c ki?m th? trong các ?i?u ki?n môi tr??ng khác nhau. V? tinh có kh? n?ng ?o nhi?t ?? , ?? ?m, b?i m?n (PM1/2.5/10), CO và truy?n thông t?t v?i tr?m m?t ??t trong kho?ng cách 300m. Trong th?c nghi?m, v? tinh ?ã ho?t ??ng ô?n ??nh t?? lu?c phóng tên l?a mô hi?nh ??n khi v? tinh r?i ch?m ??t, d? li?u thu ???c t?? v? tinh có ?? chính xác t??ng ??i, ph?n ánh s? thay ?ô?i môi tr??ng th?c t? theo ?? cao. Ngoài ra, phâ?n m?m giám sát ho?t ??ng CANSAT cu?ng se? ???c gi?i thi?u trong bài báo. TI - Thiê?t kê? và chê? ta?o vê? tinh FIMO CANSAT SP - 60 M2 - Hà N?i, Vi?t Nam AV - none EP - 67 T2 - H?i ngh? Qu?c gia l?n th? XXI v? ?i?n t?, Truy?n thông và Công ngh? Thông tin ER - TY - CHAP ID - SisLab3288 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3288/ A1 - Nguyen, Ba Tung A1 - Do, Khac Phong A1 - Tran, Nguyen Le A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh A1 - Vuong, Van Quynh A1 - Le, Thanh Ha Y1 - 2018/// PB - Springer, Cham TI - Enhancement of Fire Early Warning System in Vietnam Using Spatial Data and Assimilation AV - none T2 - Land-Atmospheric Research Applications in South and Southeast Asia. Springer Remote Sensing/Photogrammetry ER - TY - CONF ID - SisLab2295 UR - http://doi.org/10.1145/1871437.1871652 A1 - Nguyen, Cam Tu A1 - Kaothanthong, Natsuda A1 - Phan, Xuan Hieu A1 - Tokuyama, Takeshi Y1 - 2010/10/26/ TI - A feature-word-topic model for image annotation SP - 1481 M2 - Toronto, Canada AV - none EP - 1484 T2 - The 19th ACM Conference on Information and Knowledge Management (ACM CIKM) ER - TY - JOUR ID - SisLab1889 UR - http://doi.org/10.1145/2516633.2516634 IS - 3 A1 - Nguyen, Cam Tu A1 - Kaothanthong, Natsuda A1 - Tokuyama, Takeshi A1 - Phan, Xuan Hieu Y1 - 2013/// N2 - Image annotation is a process of finding appropriate semantic labels for images in order to obtain a more convenient way for indexing and searching images on the Web. This article proposes a novel method for image annotation based on combining feature-word distributions, which map from visual space to word space, and word-topic distributions, which form a structure to capture label relationships for annotation. We refer to this type of model as Feature-Word-Topic models. The introduction of topics allows us to efficiently take word associations, such as {ocean, fish, coral} or {desert, sand, cactus}, into account for image annotation. Unlike previous topic-based methods, we do not consider topics as joint distributions of words and visual features, but as distributions of words only. Feature-word distributions are utilized to define weights in computation of topic distributions for annotation. By doing so, topic models in text mining can be applied directly in our method. Our Feature-word-topic model, which exploits Gaussian Mixtures for feature-word distributions, and probabilistic Latent Semantic Analysis (pLSA) for word-topic distributions, shows that our method is able to obtain promising results in image annotation and retrieval. JF - ACM Transactions on the Web VL - 7 SN - 1559-1131 TI - A feature-word-topic model for image annotation and retrieval SP - 1 AV - none EP - 24 ER - TY - CONF ID - SisLab1848 UR - http://doi.org/10.5220/0003634400140023 A1 - Nguyen, Cam Tu A1 - Le, Vu Ha A1 - Tokuyama, Takeshi Y1 - 2011/// TI - Cascade of Multi-level Multi-instance Classifiers for Image Annotation SP - 14 M2 - Paris, France AV - none EP - 23 T2 - International Conference on Knowledge Discovery and Information Retrieval ER - TY - CONF ID - SisLab2305 UR - http://www.aclweb.org/anthology/Y/Y06/ A1 - Nguyen, Cam Tu A1 - Nguyen, Trung Kien A1 - Phan, Xuan Hieu A1 - Nguyen, Le Minh A1 - Ha, Quang Thuy Y1 - 2006/11/01/ TI - Vietnamese Word Segmentation with CRFs and SVMs: An Investigation SP - 215 M2 - Wuhan, China AV - none EP - 222 T2 - The 20st Pacific Asia Conference on Language, Information and Computation (PACLIC) ER - TY - JOUR ID - SisLab2296 UR - http://doi.org/10.1145/1568292.1568295 IS - 3 A1 - Nguyen, Cam Tu A1 - Phan, Xuan Hieu A1 - Horiguchi, Susumu A1 - Nguyen, Thu Trang A1 - Ha, Quang Thuy Y1 - 2009/08// JF - ACM Transactions on Asian Language Information Processing (ACM TALIP) VL - 8 SN - 15300226 TI - Web Search Clustering and Labeling with Hidden Topics SP - 1 AV - none EP - 40 ER - TY - CONF ID - SisLab1302 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1302/ A1 - Nguyen, Cam-Tu A1 - Wang, Xiaoliang A1 - Liu, Jing A1 - Zhou, Zhi-Hua Y1 - 2014/07// TI - Multi-View Multi-Instance Multi-Label Learning AV - none M2 - Québec, Canada T2 - 2014: the 28th Conference on Artificial Intelligence (AAAI) ER - TY - CONF ID - SisLab190 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/190/ A1 - Nguyen, Cam-Tu A1 - Zhan, D.-C. A1 - Zhou, Z.-H. Y1 - 2013/08/03/ TI - Multi-Modal Image Annotation with Multi-Instance Multi-Label LDA AV - none M2 - Beijing, China T2 - 2013 the 23rd International Joint Conference on Artificial Intelligence (IJCAI'13) ER - TY - RPRT ID - SisLab3719 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3719/ A1 - Nguyen, Cam-Van Thi Y1 - 2019/// N2 - Multi-label Learning (MLL) is a supervised learning model that hasattracted much attention of the research community in recent yearsbecause of its wide variety applicability. In this paper, we built amulti-label classification model using Latent Dirichlet Allocationwith Topic-in-set Knowlegde (z-Label LDA) on the Vietnamesedata domain. z-Label LDA is a variant of LDA which is intended toprovide additional supervised information as a hidden topic into theLDA called "z-label". We also have experimented on the dataset inthe field of Education collected from Vietnamese online newspapers.Parallel, we applied the hidden topic model LDA to generate aprior-knowledge dataset comprising topics and typical keywordsrepresenting each topic. The supervised information also makesthe topic assignment more consistent. With this approach, theeffectiveness of the model has been demonstrated experimentally,this paper has obtained initial positive results. PB - UET-VNU M1 - technical_report TI - A Large Scale Multi-label Text Classification Methodusing Z-Label LDA AV - public EP - 6 ER - TY - CONF ID - SisLab1499 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1499/ A1 - Nguyen, Cong Hung A1 - Nguyen, Quynh Mai A1 - Pham, Ngoc Hung A1 - Vo, Dinh Hieu Y1 - 2016/04/29/ TI - Ph??ng pháp và công c? phân tích ?nh h??ng c?a s? thay ??i mã ngu?n cho các ?ng d?ng J2EE6 AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab1608 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1608/ A1 - Nguyen, Dai Thanh A1 - Pham, Thi Minh Trang A1 - Dang, Thanh HaI A1 - Nguyen, Ha Anh Tuan A1 - Le, Si Quang A1 - Bui, Quang Minh A1 - Dao, Quang Minh A1 - Pham, Bao Son A1 - Le, Sy Vinh Y1 - 2015/10/08/ N2 - The human reference genome is an essential tool for studying human genomes. The standard reference genome is constructed from genomes of a few donors. The 1000 genomes project has revealed a huge amount of genetic differences between diverse populations. It is therefore naturally questioned whether the standard reference genome can work well for all human genome studies or population-specific reference genomes are needed accordingly. In this paper, we present a pipeline for constructing and evaluating a population-specific reference genome. The pipeline was examined on building the Vietnamese reference genome from 100 Kinh Vietnamese genomes obtained from the 1000 genomes project. Experiments showed that the resulting Vietnamese reference genome was better than the standard reference genome at analyzing Vietnamese genomic data. It helped improve the quality of short reads mapping and genotype calling for Vietnamese genomes. The pipeline is applicable for building and evaluating other population-specific reference genomes. For the first time the Vietnamese reference genome, which is now available for further Vietnamese genome studies, was successfully built. TI - Building population-specific reference genomes: A case study of Vietnamese reference genome SP - 97 M2 - Ho Chi Minh city, Vietnam AV - none EP - 102 T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - JOUR ID - SisLab2083 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2083/ IS - Suppl A1 - Nguyen, Dai Thanh A1 - Pham, Thi Minh Trang A1 - Dang, Thanh Hai A1 - Nguyen, Ha Anh Tuan A1 - Le, Si Quang A1 - Bui, Quang Minh A1 - Dao, Quang Minh A1 - Pham, Bao Son A1 - Le, Sy Vinh Y1 - 2015/// PB - AME Publications JF - Annals of translational medicine VL - 3 SN - 2305-5839 TI - AB050. Building population-specific reference genomes: a case study of Vietnamese reference genome AV - none ER - TY - CONF ID - SisLab2368 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2368/ A1 - Nguyen, Dai Tho A1 - Ho, Thuan A1 - Le, Dinh Thanh Y1 - 2013/// N2 - In this paper, we suggest some modifications to a protocol proposed by Awerbuch and Schulman in [3] for the maintenance of common data in distributed systems so that both its time and communication complexities are reduced. The first change that makes Awerbuch-Schulman protocol better is to eliminate unnecessary messages used in the original version. The second change that also improves the protocol is to reduce the size of process messages. In addition, we suggest a self-stabilizing version of the Awerbuch-Schulman protocol as well. TI - Improvements to a Protocol for the Maintenance of Common Data in Distributed Systems SP - 122 M2 - Hanoi, Vietnam AV - public EP - 126 T2 - H?i th?o qu?c gia l?n th? XV: M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và truy?n thông ER - TY - CONF ID - SisLab1414 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1414/ A1 - Nguyen, Dai Tho A1 - Le, Dinh Thanh A1 - Nguyen, Binh Minh Y1 - 2014/// TI - Efficient Core Selection for Multicast Routing in Mobile Ad Hoc Networks SP - 415 M2 - Budapest, Hungary AV - none EP - 426 T2 - ICCSAMA: the 2nd International Conference on Computer Science, Applied Mathematics and Applications ER - TY - JOUR ID - SisLab4647 UR - http://dx.doi.org/10.1186/s12859-021-04418-8 IS - 1 A1 - Nguyen, Dat Thanh A1 - Trac, Quang Thinh A1 - Nguyen, Thi-Hau A1 - Nguyen, Ha-Nam A1 - Ohad, Nir A1 - Pawitan, Yudi A1 - Vu, Trung Nghia Y1 - 2021/// JF - BMC Bioinformatics VL - 22 SN - 1471-2105 TI - Circall: fast and accurate methodology for discovery of circular RNAs from paired-end RNA-sequencing data AV - none ER - TY - CONF ID - SisLab3813 UR - http://openaccess.thecvf.com/content_ICCVW_2019/papers/RLQ/Nguyen_State-of-the-Art_in_Action_Unconstrained_Text_Detection_ICCVW_2019_paper.pdf A1 - Nguyen, Diep Thi Ngoc Y1 - 2019/10/27/ N2 - In this paper, we stage five real-world scenarios for six state-of-the-art text detection methods in order to evaluate how competent they are with new data without any training process. Moreover, this paper analyzes the architecture design of those methods to reveal the influence of pipeline choices on the detection quality. The setup of experimental studies are straight-forward: we collect and manually annotate test data, we reimplement the pretrained models of the state-of-the-art methods, then we evaluate and analyze how well each method achieve in each of our collected datasets. We found that most of the state-of-the-art methods are competent at detecting textual information in unseen data, however, some are more readily used for real-world applications. Surprisingly, we also found that the choice of a post-processing algorithm correlates strongly with the performance of the corresponding method. We expect this paper would serve as a reference for researchers as well as application developers in the field. All collected data with ground truth annotation and their detected results is publicly available at our Github repository: https://github.com/chupibk/ HBlab-rlq19. TI - State-of-the-Art in Action: Unconstrained Text Detection M2 - Seoul, Republic of Korea AV - public T2 - ICCV 2019 - The international Workshop and Challenge on Real-world Recognition from Low-quality images and videos ER - TY - JOUR ID - SisLab3816 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3816/ A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2014/// N2 - Multimedia retrieval task is faced with increasingly large datasets and variously changing preferences of users in every query. We realize that the high dimensional representation of physical data which previously challenges search algorithms now brings chances to cope with dynamic contexts. In this paper, we introduce a method of building a large-scale video frame retrieval environment with a fast search algorithm that handles user's dynamic contexts of querying by imagination and controlling response time. The search algorithm quickly finds an initial candidate, which has highest-match possibility, and then iteratively traverses along feature indexes to find other neighbor candidates until the input time bound is elapsed. The experimental studies based on the video frame retrieval system show the feasibility and effectiveness of our proposed search algorithm that can return results in a fraction of a second with a high success rate and small deviation to the expected ones. Moreover, its potential is clear that it can scale to large dataset while preserving its search performance. PB - IOS Press JF - Frontiers in Artificial Intelligence and Applications VL - 272 TI - An Adaptive Search Path Traverse for Large-scale Video Frame Retrieval SP - 324 AV - none EP - 342 ER - TY - CONF ID - SisLab3814 UR - http://dx.doi.org/10.1109/ELECSYM.2016.7861031 A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2016/09/21/ N2 - The beauty of thinking resides not only in finding answers but also in challenging already existing ones and creating intelligible networks of thoughts and ideas of many different perspectives. Understanding that the essence of critical thinking presents in the flows of questions and answers and aiming at a tool of augmenting it, we propose a new knowledge representation model based on bipartite graphs and a set of functions aided to explore those graphs. A bipartite graph has two disjoint vertex sets that are question and answer sets. Every edge connects a question to an answer holds an evidence for the answer and every edge connects an answer to a question holds an argument raised from the answer. The directional search mechanism is particularly designed to reuse reasoning flows in the debate graphs by a projecting function between the question and answer sets. We also introduce a framework placing the model and the search mechanism altogether in collaborative applications. Many philosophical debates are collected to demonstrate the advantages of the bigraph model besides its simplicity. The analysis and experiments on optimizing semantic search show a sufficient performance for a real-time application. TI - A bigraph representation model and directional search mechanism for debates SP - 357 M2 - Denpasar, Indonesia AV - public EP - 362 T2 - 2016 International Electronics Symposium ER - TY - JOUR ID - SisLab3815 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3815/ A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2014/// N2 - Multimedia retrieval task is faced with increasingly large datasets and variously changing preferences of users in every query. We realize that the high dimensional representation of physical data which previously challenges search algorithms now brings chances to cope with dynamic contexts. In this paper, we introduce a method of building a large-scale video frame retrieval environment with a fast search algorithm that handles user's dynamic contexts of querying by imagination and controlling response time. The search algorithm quickly finds an initial candidate, which has highest-match possibility, and then iteratively traverses along feature indexes to find other neighbor candidates until the input time bound is elapsed. The experimental studies based on the video frame retrieval system show the feasibility and effectiveness of our proposed search algorithm that can return results in a fraction of a second with a high success rate and small deviation to the expected ones. Moreover, its potential is clear that it can scale to large dataset while preserving its search performance. PB - IOS press JF - Frontiers in Artificial Intelligence and Applications VL - 272 TI - http://ebooks.iospress.nl/publication/38509 SP - 324 AV - none EP - 342 ER - TY - JOUR ID - SisLab3819 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3819/ A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2013/// N2 - Our imagination-based query creation method is a new approach to image-recall functions reflecting color-based imaginations in human brains. This method dynamically represents user's imaginations and creates queries for image retrieval. The important aim of this method is to express user's abstract intentions in a computable objects and to recall those imaginations from image databases with color-analytical image retrieval. The main features of this method are: (1) a hierarchical model for color indexing to express image contexts, (2) color zooming for context-dependent color histogram generation by utilizing color names as contextual words, (3) integrating several histograms by using five histogram-combining operations and dynamic semantic weighting, and (4) threshold controlling for semantic correlation. This method exploits color information to retrieve intended images expressing a user's imagination. This paper also represents a ?Database for Imagination Expression? (DBIE), which stores, shares and reuses created queries. Additionally, several qualitative experiments are also represented to examine the effectiveness and the feasibility of our method. JF - Frontiers in Artificial Intelligence and Applications VL - 251 TI - An imagination-based query creation method for image retrieval SP - 201 AV - none EP - 220 ER - TY - CONF ID - SisLab3788 UR - http://dx.doi.org/10.1145/3240508.3240711 A1 - Nguyen, Diep Thi Ngoc A1 - Nakayama, Hideki A1 - Okazaki, Naoaki A1 - Sakaeda, Tatsuya Y1 - 2018/// N2 - Aiming to develop of computational grammar system for visual information, we design a 4-tier framework that consists of four levels of 'visual grammar of images.' As a first step of realization, we propose a new dataset, named the PoB dataset, in which each image is annotated with multiple labels of armature patterns that compose the pictorial scene. The PoB dataset includes of a 10,000-painting dataset for art and a 4,959-image dataset for photography. In this paper, we discuss the consistency analysis of our dataset and its applicability. We also demonstrate how the armature patterns in the PoB dataset are useful in assessing aesthetic quality of images, and how well a deep learning algorithm can recognize these patterns. This paper seeks to set a new direction in image understanding with a more holistic approach beyond discrete objects and in aesthetic reasoning with a more interpretative way. TI - PoB SP - 1786 M2 - Seoul, Korea AV - public EP - 1793 T2 - The 26th ACM international conference on Multimedia ER - TY - CONF ID - SisLab3790 UR - http://dx.doi.org/10.1145/3240508.3240711 A1 - Nguyen, Diep Thi Ngoc A1 - Nakayama, Hideki A1 - Okazaki, Naoaki A1 - Sakaeda, Tatsuya Y1 - 2018/// N2 - Aiming to develop of computational grammar system for visual information, we design a 4-tier framework that consists of four levels of 'visual grammar of images.' As a first step of realization, we propose a new dataset, named the PoB dataset, in which each image is annotated with multiple labels of armature patterns that compose the pictorial scene. The PoB dataset includes of a 10,000-painting dataset for art and a 4,959-image dataset for photography. In this paper, we discuss the consistency analysis of our dataset and its applicability. We also demonstrate how the armature patterns in the PoB dataset are useful in assessing aesthetic quality of images, and how well a deep learning algorithm can recognize these patterns. This paper seeks to set a new direction in image understanding with a more holistic approach beyond discrete objects and in aesthetic reasoning with a more interpretative way. TI - PoB: Toward Reasoning Patterns of Beauty in Image Data SP - 1786 M2 - Seoul, Republic of Korea AV - public EP - 1793 T2 - The 26th ACM international conference on Multimedia ER - TY - CONF ID - SisLab3820 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3820/ A1 - Nguyen, Diep Thi Ngoc A1 - Sasaki, Shiori A1 - Kiyoki, Sasushi Y1 - 2013/02/13/ N2 - The aim of this research is to construct a new collaborative mashup system, named Web-based Environmental Education (WEE), for global environmental monitoring research and education in which all participants could associatively organize multimedia data about physical environments and visually monitor various environmental topics based on time-series multi-geographical views. The main features of this system are: (1) collaborative multimedia database creation using "social sensors", (2) information aggregation from Web resources, (3) content-based image and document retrieval, and (4) big-picture visualization with spatiotemporal view controllers and content-based image, document retrieval. In this paper, a new designed usage of social network services as an educational tool and a new method for gathering environmental information from Web resources are presented. We also present three promising educational scenarios to examine the applicability of the system. TI - WEE: A Mashup System Using Social Networks For Collaborative Environmental Monitoring Education With Spatiotemporal Analysis And Visualization SP - 909 M2 - Innsbruck, Austria AV - none EP - 916 T2 - IASTED Multiconferences - Proceedings of the IASTED International Conference on Web-Based Education, WBE 2013 ER - TY - CONF ID - SisLab3824 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3824/ A1 - Nguyen, Diep Thi Ngoc A1 - Sasaki, Shiori A1 - Kiyoki, Yasushi Y1 - 2011/// TI - 5DPicMap: Imagination-based I mage Search System with Spatiotemporal Analyzers SP - 272 M2 - Spain AV - none EP - 278 T2 - IADIS International Conference (e-Society 2011) ER - TY - CONF ID - SisLab3825 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3825/ A1 - Nguyen, Diep Thi Ngoc A1 - Sasaki, Shiori A1 - Kiyoki, Yasushi Y1 - 2010/// TI - Imagination-based Image Search System with Dynamic Query Creation and Its Application SP - 435 M2 - USA AV - none EP - 442 T2 - 13th IASTED International Conference on Software Engineering and Applications (SEA 2010) ER - TY - CONF ID - SisLab3822 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3822/ A1 - Nguyen, Diep Thi Ngoc A1 - Sasaki, Shiori A1 - Kiyoki, Yasushi Y1 - 2012/03/13/ TI - Imagination-based Travel Designing System with 5D World PicMap AV - none M2 - Surabaya, Indonesia T2 - the First Indonesian-Japanese Conference on Knowledge Creation and Intelligent Computing (KCIC 2012) ER - TY - JOUR ID - SisLab3786 UR - http://dx.doi.org/10.1007/s13735-017-0122-2 IS - 2 A1 - Nguyen, Diep Thi-Ngoc A1 - Kiyoki, Yasushi Y1 - 2017/// N2 - Many multimedia retrieval tasks are faced with increasingly large-scale datasets and variously changing preferences of users in each query. There are at least three distinctive contextual aspects comprised to form a set of preferences of a user at each query time: content, intention, and response time. A content preference refers to the low-level or semantic representations of the data that a user is interested in. An intention preference refers to how the content should be regarded as relevant. And a response time preference refers to the ability to control a reasonable wait time. This paper features the dynamic adaptability of a multimedia search system to the contexts of its users and proposes a multicontext-adaptive indexing and search system for video data. The main contribution is the integration of context-based query creation functions with high-performance search algorithms into a unified search system. The indexing method modifies inverted list data structure in order to construct disk-resident databases for large-scale data and efficiently enables a dynamic pruning search mechanism on those indices. We implement a frame-wise video navigation system as an application of the indexing and search system using the a 2.14 TB movie dataset. Experimental studies on this system show the effectiveness of the proposed pruning search method when dealing with dynamic contexts and its comparative high search performance. JF - International Journal of Multimedia Information Retrieval VL - 6 SN - 2192-6611 TI - Multicontext-adaptive indexing and search for large-scale video navigation SP - 175 AV - public EP - 188 ER - TY - JOUR ID - SisLab4246 UR - https://www.sciencedirect.com/science/article/pii/S1746809420304699 A1 - Nguyen, Dinh Chinh A1 - Luu, Manh Ha A1 - Guanghao, Sun A1 - Le, Quoc Anh A1 - Pham, Thi Viet Huong A1 - Tran, Anh Vu A1 - Tran, Trong Hieu A1 - Tran, Duc Tan A1 - Nguyen, Vu Trung A1 - Koichiro, Ishibashi A1 - Nguyen, Linh Trung Y1 - 2020/// PB - ELSEVIER JF - Biomedical Signal Processing and Control TI - Short time cardio-vascular pulses estimation for dengue fever screening via continuous-wave Doppler radar using empirical mode decomposition and continuous wavelet transform AV - none ER - TY - JOUR ID - SisLab3091 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3091/ IS - 2 A1 - Nguyen, Dinh Nghia A1 - Nguyen, Hoai Son Y1 - 2018/// N2 - In structured peer-to-peer (P2P) networks, every node must perform message routing to deliver query messages to destination nodes. Therefore, they often have to process a large number of query messages quickly and efficiently. When the number of query messages sending to a node exceeds its routing capacity, a local congestion on the node occurs and reduces the information pro- cessing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process. PB - Vietnam Academy of Science and Technology JF - Journal of Computer Science and Cybernetics VL - 34 SN - 1813-9663 TI - Congestion Control Algorithm for Message Routing in Structured Peer-to-Peer Networks SP - 145 AV - public EP - 159 ER - TY - JOUR ID - SisLab2227 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2227/ IS - 4 A1 - Nguyen, Dinh Viet Y1 - 2002/// N2 - TCP is a transport protocol designed and tuned to work well in fixed networks, however TCP performance is degraded severely in a network with wireless links. To enhance TCP performance in such networks, some proposals have been made in the last several years. Among them Snoop TCP proposal is one of the most important ones. Our paper investigates the effect of various error rates of wireless link on the performance of snoop TCP; normal TCP is also put to our investigation to make a comparison. We use the network simulator ns-2, version 2.1b9 extensively. Our simulation results show that in comparison with normal TCP, snoop TCP enhances normalized throughput of LAN and WAN with wireless link 137% and 427% respectively. JF - Journal of Computer Science and Cybernetics SN - 1813-9663 TI - Simulation-based Evaluation of Performance of a Snoop TCP Scheme over Networks with Wireless Links SP - 339 AV - none EP - 346 ER - TY - JOUR ID - SisLab2228 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2228/ IS - 1 A1 - Nguyen, Dinh Viet Y1 - 2002/// N2 - This paper analyzes quantitatively link-by-link and end-to-end error control schemes in computer communication networks. Two measures used for performance evaluations are mean packet delay time and throughput of the networks. With two specific examples, performance comparisons are made for two cases: traditional computer networks (low-speed) and high-speed (gigabit/sec) computer networks. The results is that: link-by-link error control scheme is superior than end-to-end error control scheme for low-speed computer networks, by contrast, for high-speed computer networks end-to-end scheme is superior than link-by-link scheme. JF - Journal of Computer Science and Cybernetics SN - 1813-9663 TI - So sánh hi?u su?t c?a các k? ho?ch ki?m soát l?i trong m?ng truy?n thông máy tính SP - 87 AV - none EP - 96 ER - TY - JOUR ID - SisLab2229 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2229/ IS - 2 A1 - Nguyen, Dinh Viet Y1 - 2002/// N2 - Transmission Control Protocol (TCP) uses end-to-end flow, congestion, and error control mechanisms to provide reliable delivery over the Internet. During many years of extensive use in inter-networks, all weak-points of TCP are discovered and tuned, so that it performs very well in traditional network (wired network). However, inter-networks growth explosively and may consist of networks with wireless links characterized by high and sporadic bit error rate and intermittent connectivity due to handoff. TCP performance is degraded severely in such networks. Many studies have been carrying out to improve the performance of TCP in networks with wireless links. Some solutions are proposed and implemented. This paper presents four main issues: Congestion avoidance and control mechanisms implemented in traditional TCP protocol; Step-by-step enhancements in traditional TCP; Characteristics of wireless links degrade TCP performance severely; and mechanisms to enhance TCP performance over network with wireless links. JF - Journal of Computer Science and Cybernetics SN - 1813-9663 TI - TCP Enhancements and Performance over Networks with Wireless Links SP - 187 AV - none EP - 200 ER - TY - CONF ID - SisLab2996 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2996/ A1 - Nguyen, Dinh Viet Y1 - 1998/04// N2 - At present, most of information resources are on computer's memory, and computers communicate with each other via computer networks. Those communication channels are insecure in the sense that, when a sender A sends a message to receiver B, an enemy could receive the message physically. The most important role of a cryptosystem is to make the enemy unable to know the content of the message - to guarantee the Secrety and the Authenticity of information. The cryptosystems based on symmetric algorithms use the same key for both encryption and decryption process, so the key must be kept secret. A sender and a receiver have to agree about the secret key before communication or have to use a secure channel to send secret key from the sender to the receiver. It is a matter of fact that it is not always possible. The cryptosystems based on asymmetric algorithms use one key - KB for encryption and another key - kB for decryption. A Key generator generates a pair (KB, kB) basing on the initial conditions. When B wants to send A a message, he/she uses Key generator to generate a pair (KB, kB) then sends KB (it is called Public-Key) to A, so A can use it to encrypt the message. When receiving encrypted message, B uses the secret key kB to decrypt it. The asymmetric cryptosystems must guarantee that, if the enemy receives the encrypted message and the key KB associated with it, it is not practically possible for him to calculate the secret key kB to decrypt the message. In other word, that is an intractable problem for him. The name Public-Key comes from that sense. TI - V? h? mã m?t khoá công khai SP - 23 M2 - Hà N?i, Vi?t Nam AV - none EP - 30 T2 - H?i ngh? Khoa h?c Tr??ng ??i h?c Khoa h?c T? nhiên, ?HQGHN ER - TY - CONF ID - SisLab2986 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2986/ A1 - Nguyen, Dinh Viet A1 - Le, Dinh Danh Y1 - 2008/12// N2 - ?? ??m b?o ch?t l??ng d?ch v? (QoS) truy?n thông ?a ph??ng ti?n trên Internet, trên t?t c? các nút m?ng (router) mà các lu?ng thông tin ?i qua c?n áp d?ng các chính sách qu?n lý hàng ??i và chính sách ph?c v? phù h?p. Các chính sách này ??m b?o cho các lu?ng thông tin ?a ph??ng ti?n có th? ??t ???c thông l??ng ?? l?n, th?i gian tr? trung bình và th?ng giáng c?a th?i gian tr? (jitter) c?a các gói tin ?? nh?. Ngoài ra c?n ??m b?o s? ph?c v? v?i các m?c ?u tiên khác nhau cho các lu?ng thông tin ?a ph??ng ti?n khác nhau. Ng??i ta ?ã nghiên c?u và áp d?ng vào th?c t? nhi?u chi?n l??c qu?n lý hàng ??i ??ng (AQM) ?áp ?ng ???c các yêu c?u nói trên, ?ó là RED và các c?i ti?n c?a nó là A-RED, RIO và A-RIO... Báo cáo này trình bày các k?t qu? nghiên c?u c?a chúng tôi v? A-RIO b?ng b? mô ph?ng m?ng NS. TI - ?ÁNH GIÁ HI?U SU?T CHI?N L??C QU?N LÝ HÀNG ??I A-RIO B?NG B? MÔ PH?NG M?NG NS SP - 239 M2 - Hue, Viet Nam AV - none EP - 248 T2 - H?i th?o Qu?c gia l?n th? XI: ?M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông? ER - TY - CONF ID - SisLab2983 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2983/ A1 - Nguyen, Dinh Viet A1 - Le, Minh Khoi A1 - Le, Thi Thuy A1 - Do, Thi Bac A1 - Nguyen, The Cong Y1 - 2012/12/03/ N2 - One of the main limitations of Ad hoc networks is limited capacity; This is mainly due to interference which limits the spatial reuse of wireless channels. It acts as a problem to the deployment of Ad hoc networks. Evaluation of the Capacity of Ad hoc networks is difficult because of the complexity of routing and MAC protocols, etc. Until now, many methods for Ad hoc network capacity evaluation have been developed. However, most of them have flaws, since some simplification assumptions must be made to make capacity evaluation problem tractable. This paper introduces some approximation algorithms to evaluate the capacity of Ad hoc Network, and presents our capacity evaluation results obtained by simulating ad hoc network in various scenarios with the use of NS-2 network simulator. TI - Capacity Evaluation of Mobile Ad Hoc Networks SP - 52 M2 - Vi?t Nam AV - none EP - 59 T2 - H?i th?o Qu?c gia l?n th? XV M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông ER - TY - CONF ID - SisLab2985 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2985/ A1 - Nguyen, Dinh Viet A1 - Nguyen, Manh Ha Y1 - 2010/06// N2 - ?? ??m b?o ch?t l??ng d?ch v? (QoS) truy?n thông ?a ph??ng ti?n trên Internet, c?n áp d?ng các chính sách qu?n lý hàng ??i và chính sách ph?c v? phù h?p t?i t?t c? các nút m?ng (router) mà các lu?ng thông tin ?i qua. Các chính sách này ??m b?o cho các lu?ng thông tin ?a ph??ng ti?n có th? ??t ???c thông l??ng ?? l?n, th?i gian tr? trung bình và th?ng giáng c?a th?i gian tr? (jitter) c?a các gói tin ?? nh?. Ngoài ra c?n ??m b?o s? ph?c v? v?i các m?c ?u tiên khác nhau cho các lu?ng thông tin ?a ph??ng ti?n khác nhau. Nhi?u chi?n l??c qu?n lý hàng ??i ??ng (AQM) ?ã ???c nghiên c?u và áp d?ng vào th?c t?, ?áp ?ng ???c các yêu c?u nói trên, ?ó là RED và các c?i ti?n c?a nó là A-RED, RIO và A-RIO. M?i chi?n l??c nói trên ??u ph?i d?a vào kích th??c hàng ??i trung bình mà nó tính ???c ?? ho?t ??ng m?t cách có hi?u qu? nh?t. Báo cáo này trình bày các k?t qu? nghiên c?u c?a chúng tôi v? ?nh h??ng c?a tr?ng s? hàng ??i ??n hi?u su?t c?a chi?n l??c qu?n lý hàng ??i A-RIO b?ng b? mô ph?ng m?ng NS-2. ?ây là s? phát tri?n ti?p theo và sâu h?n các nghiên c?u ?ã ???c báo cáo t?i H?i th?o Qu?c gia v? CNTT và Truy?n thông, ???c t? ch?c t?i Hu?, tháng 6/2008 và ?ã ???c ??ng toàn v?n trong K? y?u c?a H?i th?o. TI - ?ÁNH GIÁ ?NH H??NG C?A TR?NG S? HÀNG ??I ??N HI?U SU?T C?A CHI?N L??C QU?N LÝ HÀNG ??I A-RIO SP - 93 M2 - Bien Hoa, Viet Nam AV - none EP - 106 T2 - H?i th?o Qu?c gia l?n th? XII: ?M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông? ER - TY - CONF ID - SisLab2993 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2993/ A1 - Nguyen, Dinh Viet A1 - Nguyen, Manh Ha A1 - Nguyen, Minh Nguyet Y1 - 2005/01// N2 - The break out of the Internet has made the World Wide Web become ?world wide wait? due to dramatically increased load on the network infrastructure and on individual web servers. To ameliorate these burdens, web caching, a technology that hold any retrieved object can reduce network, server load and the latency of response substantially. However, there is a serious disadvantage that the object returned to client by cache maybe stale and inconsistence with the one on server. This paper discusses several caching algorithms and architectures to limit the degree of staleness. We also propose an integrated web cache solution providing fairly tight bounds on the staleness and evaluate this design based on simulation experiences compared to that of some other solutions. TI - A comparison of caching solutions to improve web cache consistency in scalable network SP - 484 M2 - Thái Nguyên, Vi?t Nam AV - none EP - 491 T2 - H?i th?o Qu?c gia l?n th? sáu: M?t s? v?n ?? ch?n l?c c?a Công ngh? Thông tin ER - TY - CONF ID - SisLab2984 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2984/ A1 - Nguyen, Dinh Viet A1 - Phan, Huu Dung A1 - Doan, Cao Thanh A1 - Ho, Duc Ai Y1 - 2012/// N2 - MANET (Mobile wireless Ad hoc NETwork) là m?t lo?i m?ng bao g?m các nút m?ng có th? di ??ng, chúng s? d?ng ???ng truy?n không dây ?? truy?n thông v?i nhau m?t cách tr?c ti?p ho?c thông qua m?t s? nút trung gian ?óng vai trò chuy?n ti?p gói tin nh? các router, mà không c?n d?a trên c? s? h? t?ng m?ng có dây và các ??n v? qu?n tr? trung tâm. V?i MANET, vì các nút m?ng ??u có th? di chuy?n tu? ý, nên không th? s? d?ng các giao th?c và thu?t toán ??nh tuy?n v?n ???c s? d?ng ph? bi?n trên m?ng có dây. Th?c hi?n ???c vi?c ??nh tuy?n m?t cách có hi?u qu? là bài toán quan tr?ng và nhi?u thách th?c nh?t ??i v?i nh?ng ng??i nghiên c?u MANET. Trong bài báo này chúng tôi trình bày các k?t qu? nghiên c?u, ?ánh giá và so sánh hi?u su?t c?a các giao th?c ??nh tuy?n AODV, DSR, DSDV và OLSR theo m?c ?? linh ??ng c?a các nút m?ng; hai tham s? hi?u su?t ???c chúng tôi s? d?ng là chi phí tìm ???ng và t? l? phân phát gói tin thành công. Các th?c nghi?m b?ng b? mô ph?ng NS2 ???c th?c hi?n v?i hai mô hình chuy?n ??ng là Random Waypoint và Random Walk. Các k?t qu? thu ???c c?a chúng tôi cho th?y rõ hi?u qu? ho?t ??ng c?a AODV, DSR, DSDV và OLSR theo các m?c ?? linh ??ng khác nhau c?a các nút m?ng. Nh?n xét c?a chúng tôi v? các k?t qu? thu ???c c?ng chính là khuy?n ngh? v? vi?c áp d?ng các giao th?c ??nh tuy?n c? th?. TI - ?ÁNH GIÁ HI?U N?NG C?A CÁC GIAO TH?C ??NH TUY?N TRONG M?NG MANET SP - 64 M2 - Can Tho, Viet Nam AV - none EP - 80 T2 - H?i th?o Qu?c gia l?n th? XIV: ?M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông ER - TY - CONF ID - SisLab2995 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2995/ A1 - Nguyen, Dinh Viet A1 - Vu, Duy Loi Y1 - 2003/07// N2 - Bài báo này trình bày các k?t qu? nghiên c?u c?a chúng tôi v? ?ánh giá b?ng mô ph?ng hi?u su?t c?a Snoop TCP trong m?ng không ??ng nh?t, g?m các m?ng có dây và không dây. ??u tiên, chúng tôi tóm t?t m?t s? k?t qu? nghiên c?u c?i ti?n hi?u su?t TCP trong m?ng có ???ng truy?n không dây; sau ?ó, mô t? các ch?c n?ng c? b?n c?a Snoop TCP và c?u hình c?a m?ng mô ph?ng. Chúng tôi ?ã th?c hi?n nhi?u thí nghi?m mô ph?ng b?ng b? mô ph?ng m?ng NS-2 ?? nghiên c?u k? ?nh h??ng c?a ?? dài trung bình tr?ng thái x?u c?a ???ng truy?n không dây c?ng nh? ??n v? th?i gian c?a ??ng h? phát l?i c?c b? (SnoopTick) ??i v?i hi?u su?t c?a Snoop TCP; ?? so sánh, chúng tôi c?ng ?ã nghiên c?u TCP truy?n th?ng. Các k?t qu? nghiên c?u b?ng mô ph?ng c?a chúng tôi cho th?y r?ng: Snoop TCP t?t h?n TCP thông th??ng còn Snoop TCP s? d?ng giá tr? SnoopTick mà chúng tôi ?? xu?t ??t ???c hi?u su?t cao h?n Snoop TCP ?ã ???c công b? là 150%. TI - ?ÁNH GIÁ HI?U SU?T HO?T ??NG C?A SNOOP TCP TRONG M?NG KHÔNG ??NG NH?T B?NG PH??NG PHÁP MÔ PH?NG SP - 429 M2 - Hà N?i, Vi?t Nam AV - none EP - 436 T2 - H?i th?o Khoa h?c Qu?c gia l?n th? nh?t v? Nghiên c?u, Phát tri?n và ?ng d?ng Công ngh? Thông tin và Truy?n thông (ICT.rda) ER - TY - CONF ID - SisLab2989 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2989/ A1 - Nguyen, Dinh Viet A1 - Vu, Duy Loi A1 - Vu, Duc Trung Y1 - 2006/07// N2 - Khác v?i các ?ng d?ng truy?n th?ng trên Internet th??ng là thu?n v?n b?n, các ?ng d?ng truy?n thông ?a ph??ng ti?n truy?n t?i nhi?u lo?i d? li?u khác nhau nh? âm thanh, hình ?nh, v?n b?n,...??c ?i?m c?a các ?ng d?ng này là có th? ch?p nh?n s? m?t mát thông tin trong m?t gi?i h?n nh?t ??nh, nh?ng ?òi h?i tính th?i gian th?c (real-time), ngh?a là yêu c?u ?? tr? (delay) và th?ng giáng ?? tr? (jitter) nh?. Vi?c ??m b?o ch?t l??ng d?ch v? (QoS) là v?n ?? h?t s?c khó kh?n và mang tính quy?t ??nh ??n s? t?n t?i, phát tri?n c?a các ?ng d?ng truy?n thông ?a ph??ng ti?n, vì v?y r?t nhi?u nghiên c?u ?ã ???c ti?n hành nh?m tìm ra các gi?i pháp h?u hi?u ?? ??m b?o QoS nh? IntServ, Diffserv.... Trong báo cáo này, chúng tôi s? trình bày các v?n ?? sau: (1) Các ?ng d?ng truy?n thông ?a ph??ng ti?n, (2) Yêu c?u QoS ??i v?i truy?n thông ?a ph??ng ti?n, (3) Các ph??ng pháp ??m b?o QoS IntServ (Integrated Services) và DiffServ (Differentiated Services) trong ?ó ch? y?u trình bày v? DiffServ, và (4) các k?t qu? nghiên c?u c?a chúng tôi, s? d?ng b? mô ph?ng m?ng NS ?? ?ánh giá hi?u qu? c?a ph??ng pháp DiffServ ??n QoS c?a truy?n thông ?a ph??ng ti?n. TI - ??M B?O CH?T L??NG D?CH V? CHO TRUY?N THÔNG ?A PH??NG TI?N THEO KI?N TRÚC DIFFSERV SP - 62 M2 - Thành ph? H? Chí Minh, Vi?t Nam AV - none EP - 73 T2 - H?i th?o khoa h?c Qu?c gia l?n th? II: Nghiên c?u c? b?n và ?ng d?ng Công ngh? Thông tin" (FAIR) ER - TY - CONF ID - SisLab3294 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3294/ A1 - Nguyen, Do Van A1 - Vuong, Tung Long A1 - Kieu, Hai Dang A1 - Pham, Linh A1 - Le, Thanh Ha Y1 - 2018/// TI - Vision Memory for Target Object Navigation using Deep Reinforcement Learning: An Emperical Study AV - none T2 - IEEE International Conference on Systems, Man, and Cybernetic (IEEE SMC2018) ER - TY - CONF ID - SisLab4277 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4277/ A1 - Nguyen, Dong Dong A1 - Bui, Ngoc Dung A1 - Hoang, Xuan Tung A1 - Tran, Nguyen Cac Y1 - 2020/12/11/ N2 - Face recognition has become popular in security surveillance systems. These systems work well only when the face is in frontal and the system itself has considerable training data. This paper proposes a method of face recognition with various view using Generative Adversarial Networks (GAN). In this method, a pre-trained model of face is used to generate the training data of different pose variations from several frontal faces using GAN. These faces will be used as input of the FaceNet and Support Vector Machine to be trained to perform the task of face recognition. The experiment results demonstrate the accuracy of the proposed method in the case of lacking the training data. This paper focus on the applicability of Generative Adversarial Network in Face Recognition System by applying the GAN-based method in Face Recognition System to increase the number of training samples and detect the faces of different poses that was not possible with the conventional Face Recognition System. The comparison between Face Recognition System using GAN and conventional Face Recognition System was presented. TI - POSE INVARIANT FACE RECOGNITION SYSTEM SP - 33 AV - public EP - 40 T2 - INTERNATIONAL CONFERENCE ON APPLICATIONS OF ARTIFICIAL INTELLIGENCE IN TRANSPORTATION ER - TY - INPR ID - SisLab4468 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4468/ A1 - Nguyen, Duc Anh A1 - Do, Minh Kha A1 - Pham, Thi To Nga A1 - Pham, Ngoc Hung Y1 - 2021/// TI - An Autoencoder-based Method for Targeted Attack on Deep Neural Network Models AV - public M2 - Hanoi T2 - 2021 IEEE International Conference on Research, Innovation and Vision for the Future (RIVF 2021) ER - TY - INPR ID - SisLab2636 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2636/ A1 - Nguyen, Duc Anh A1 - Pham, Ngoc Hung Y1 - 2017/// N2 - This research proposes an automated test data generation method for C/C++ projects to generate the lower number of test data while gaining higher code coverage in comparison with KLEE, CAUT, PathCrawler, and CREST. In order to do that, the proposed method contributes an algorithm named loop depth frst search by combining both static testing and concolic testing together. Besides, the paper also provides an improvement symbolic execution for avoiding the initial test data problem in the concolic testing. Currently, a tool supporting the proposed method has been developed and applied to test on di?erent C/C++ projects in several software companies. The experimental results show the higher coverage with the lower number of test data compared with the existing methods. The experimental results display the e?ectiveness and practical usefulness of the proposed method for automated test data generation in practice TI - A Test Data Generation Method for C/C++ Projects M2 - Nha Trang AV - none T2 - The Eighth International Symposium on Information and Communication Technology (SoICT 2017) ER - TY - CONF ID - SisLab2002 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2002/ A1 - Nguyen, Duc Anh A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2016/10/14/ N2 - This research proposes an automated test case generation method for C functions. In this method, the source code is transformed into a control flow graph corresponding to the given coverage criterion. After that, a list of feasible test paths is discovered by traversing the control flow graph using backtracking algorithm, symbolic execution, and Z3 solver. We also generate test cases for functions containing one loop or two-nested loop. A tool supporting the proposed method has been developed and applied to test on some C functions. The experimental results show the high coverage with the minimum number of test cases, the ability to improve the total time of the test case generation with a specified coverage criterion, and the increasing precision of checking the feasibility of test paths if comparing with the random technique. The experimental results display the potential usefulness of this tool for automated test case generation in practice. TI - A Method for Automated Unit Testing of C Programs M2 - Da Nang city, Viet Nam AV - public T2 - NICS: 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science ER - TY - JOUR ID - SisLab3734 UR - https://www.worldscientific.com/doi/10.1142/S0218194019500402 IS - 9 A1 - Nguyen, Duc Anh A1 - Pham, Ngoc Hung A1 - Vo, Dinh Hieu A1 - Tran, Nguyen Huong Y1 - 2019/// N2 - This paper improves the breadth-¯rst search strategy in directed automated random testing (DART) to generate a fewer number of test data while gaining higher branch coverage, namely Static DART or SDART for short. In addition, the paper extends the test data compilation mechanism in DART, which currently only supports the projects written in C, to generate test data for C++ projects. The main idea of SDART is when it is less likely to increase code coverage with the current path selection strategies, the static test data generation will be applied with the expectation that more branches are covered earlier. Furthermore, in order to extend the test data compilation of DART for C++ context, the paper suggests a general test driver technique for C++ which supports various types of parameters including basic types, arrays, pointers, and derived types. Currently, an experimental tool has been implemented based on the proposal in order to demonstrate its e±cacy in practice. The results have shown that SDART achieves higher branch coverage with a fewer number of test data in comparison with that of DART in practice. PB - World Scientic Publishing Company JF - International Journal of Software Engineering and Knowledge Engineering VL - 29 SN - 10.1142/S0218194019500402 TI - Improvements of Directed Automated Random Testingin Test Data Generation for C++ Projects SP - 1279 AV - public EP - 1312 ER - TY - INPR ID - SisLab3502 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3502/ A1 - Nguyen, Duc Anh A1 - Tran, Nguyen Huong A1 - Vo, Dinh Hieu A1 - Pham, Ngoc Hung Y1 - 2019/// N2 - This paper improves the breadth-?rst search strategy in directed automated random testing (DART) to generate a fewer number of test data while gaining higher branch coverage, namely Static DART or SDART for short. In addition, the paper extends the test data compilation mechanism in DART, which currently only supports the projects written in C, to generate test data for C++ projects. The main idea of SDART is when it is less likely to increase code coverage with the current path selection strategies, the static test data generation will be applied with the expectation that more branches are covered earlier. Furthermore, in order to extend the test data compilation of DART for C++ context, the paper suggests a general test driver technique for C++ which supports various types of parameters including basic types, arrays, pointers, and derived types. Currently, an experimental tool has been implemented based on the proposal in order to demonstrate its e?cacy in practice. The results have shown that SDART achieves higher branch coverage with a fewer number of test data in comparison with that of DART in practice. PB - IJSEKE JF - International journal of software engineering and knowledge engineering (IJSEKE) SN - 0218-1940 TI - ON IMPROVEMENTS OF DIRECTED AUTOMATED RANDOM TESTING IN TEST DATA GENERATION FOR C++ PROJECTS AV - none ER - TY - JOUR ID - SisLab4478 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4478/ A1 - Nguyen, Duc Bach A1 - Chu, Duc Ha A1 - Vu, Le Dieu Huong A1 - Phi, Thi Cam Mien TI - ??NH DANH VÀ XÁC ??NH ??C ?I?M SINH TR??NG C?A CH?NG VI KHU?N LAM Arthrospira platensis PHÂN L?P T? H? V?N QUÁN AV - public JF - Ta?p chi? Khoa ho?c Nông nghiê?p Viê?t Nam ER - TY - CONF ID - SisLab4215 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4215/ A1 - Nguyen, Duc Canh A1 - Dang, Cao Cuong A1 - Le, Sy Vinh A1 - Bui, Quang Minh A1 - Hoang, Thi Diep Y1 - 2020/11/14/ N2 - Amino acid substitution matrices are central to the model-based methods for reconstructing evolutionary trees from amino acid sequences. QMaker is an efficient method for estimating general time-reversible amino acid substitution matrices from a large biological dataset containing thousands of protein alignments using maximum likelihood principle. It allows researchers to build an amino acid substitution model on their own to best fit their subsequent phylogenetic analyses. In this work, we propose an approach to parallelize computation in QMaker, named pQMaker. Moreover, we provide an open-source message passing interface implementation for pQMaker (https://github.com/canhnd58/IQ-TREE/tree/pqmaker) built upon the latest IQ-TREE package. Experiments on benchmark data sets show that our implementation has significant speed gains compared with the original QMaker. TI - pQMaker: empirically estimating amino acid substitution models in a parallel environment SP - 324 M2 - Can Tho Viet Nam AV - none EP - 329 T2 - 2020 12th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab2776 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2776/ A1 - Nguyen, Duc Linh A1 - Man, Duc Chuc A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2016/12// N2 - In Vietnam, environmental data collected from ground-based stations may contain abnormal or missing values due to several problems during operation, i.e. sensor's problems. This paper proposes a standardization procedure which try to detect unusual values and fill in missing data. Experiments were conducted for PM10 data. Two datasets measured in 01/2011 and 01/2012 at Nguyen Van Cu station in Hanoi, Vietnam is used for experiments. For the abnormal detection process, unusual data can be informed to the data analyzers at ground stations for judging. For the missing filling process, the first dataset is used as training dataset to construct regression models for predicting missing data, the second dataset is used as testing data. In the worst case, suppose 100% PM10 is missing, Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE) are 51 µg/m3 and 45% respectively. Correlation coefficient (R) between original PM10 data and predicted PM10 data is 0.56. In addition, different scenarios taking account of percentage of missing data of the whole testing dataset are also considered. Experimental results showed that it is best to perform missing filling process on datasets that contain 10% to 30% of missing data. For this case, RMSE ranges from 15?25 µg/m3 and MAPE varies from 5 to 13%. KW - Atmospheric measurements;Correlation;Data models;Filling;Monitoring;Pollution measurement;Training;PM10;abnormal detection;environmental data;missing filling TI - Standardization procedure for automatic environmental data: A case study in Hanoi, Vietnam SP - 321 M2 - Hanoi, Vietnam AV - none EP - 326 T2 - The 8th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab4480 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4480/ IS - 1 A1 - Nguyen, Duc Thao A1 - Nguyen, Viet Anh A1 - Le, Thanh Ha A1 - Ngo, Thi Duyen Y1 - 2021/// N2 - With the development of virtual reality (VR) technology and its applications in many fields, creating simulated hands in the virtual environment is an e ective way to replace the controller as well as to enhance user experience in interactive processes. Therefore, hand tracking problem is gaining a lot of research attention, making an important contribution in recognizing hand postures as well as tracking hand motions for VR?s input or human machine interaction applications. In order to create a markerless real-time hand tracking system suitable for natural human machine interaction, we propose a new method that combines generative and discriminative methods to solve the hand tracking problem using a single RGBD camera. Our system removes the requirement of the user having to wear to color wrist band and robustifies the hand localization even in di cult tracking scenarios. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 37 SN - 2588-1086 TI - Robustify Hand Tracking by Fusing Generative and Discriminative Methods AV - none ER - TY - CONF ID - SisLab3821 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3821/ A1 - Nguyen, Duc Trung A1 - Nguyen, Diep Thi Ngoc A1 - Kiyoki, Yasushi Y1 - 2013/10/21/ N2 - Automatically detecting food's taste is a non-trivial part. However, we realize that the taste of food can be extracted by directly analyzing recipes by the ingredients and the amount of them in the recipes. In this paper, we present a food analysis system to discover the taste of foods and to better understand the featured ingredients in each specific geographical region. The main features of this system are (1) to extract dominant ingredients and tastes in a region by analyzing the ingredients' frequency and its uniqueness, and (2) to transform user's existing materials or original recipe to a new recipe according to a targeted taste. To examine the feasibility and applicability of the algorithm, we have developed a web-based application with a recipe database collected from approximately 200 recipes in over 7 regions of Japan: Hokkaido-Tohoku, Kanto, Kansai, Shikoku, Tyubu, Kyusyu-Okinawa and Tyugoku. TI - A Regional Food's Features Extraction Algorithm and Its Application SP - 15 M2 - Barcelona, Spain AV - none EP - 20 T2 - 5th Workshop on Multimedia for Cooking and Eating Activities (ACMM CEA2013), ACM 2013 ER - TY - CONF ID - SisLab4665 UR - https://ieeexplore.ieee.org/document/9538430 A1 - Nguyen, Duc-Hieu A1 - Le, Van-Vinh A1 - Nguyen, Thi-Hanh A1 - Dang, Duc Hanh Y1 - 2021/// TI - A Method to Ensure Compliance with Attribute and Role Based Access Control Policy for Executing BPMN Models SP - 360 AV - none EP - 366 T2 - ICSSE: the 2021 International Conference on System Science and Engineering ER - TY - CONF ID - SisLab756 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/756/ A1 - Nguyen, Duy Khuong A1 - Than, Khoat A1 - Ho, Tu Bao Y1 - 2013/11// TI - Siplicial Nonnegative Matrix Factorization SP - 47 M2 - Hanoi, VIETNAM AV - none EP - 52 T2 - 2013: IEEE RIVF International Conference on Computing and Communication Technologies (RIVF2013) ER - TY - JOUR ID - SisLab2225 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2225/ IS - 5 A1 - Nguyen, Duy Tan A1 - Longzhe, Han A1 - Nguyen, Dinh Viet A1 - Minho, Jo Y1 - 2012/// N2 - A wireless sensor network (WSN) is a wireless network consisting of a base station (BS) and multiple micro-sensor nodes. The micro-sensor nodes run on batteries that are not recharged during the network?s lifetime. Therefore, prolonging WSN lifetime is a significant problem. There are some energy-efficient hierarchical routing protocols designed especially for WSNs, such as sensor protocols for information negotiation (SPIN), low-energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C). In this article, we propose an improvement on the LEACH routing protocol to decrease energy consumption and prolong network lifetime. LEACH-Distance Energy (LEACH-DE) selects a cluster head node not only by considering residual energy of the node greater than the average residual energy level of nodes in network, but also by examining the geometric distance between the candidate node to the BS as a key parameter. The results of simulation show our proposed algorithm outperforms LEACH and LEACH-C in terms of conserving energy and prolonging WSN lifetime. JF - Smart Computing Review VL - 2 SN - 2234-4624 TI - An Improved LEACH Routing Protocol for Energy-Efficiency of Wireless Sensor Networks SP - 360 AV - none EP - 369 ER - TY - CONF ID - SisLab2232 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2232/ A1 - Nguyen, Duy Tan A1 - Nguyen, Dinh Viet Y1 - 2015/// N2 - One of the main challenging factors for designing routing protocols in cognitive radio ad-hoc network (CRAHNs) is how to select route for which can save energy battery for devices and avoid interference to primary users (PU). To solve this problem. In this paper, we propose channel assignment and energy-efficient routing (CAEER) protocol in multi-hop and multi-channel CRAHNs. The proposed routing scheme suggests an intelligent multi-channel selection function, which is used to assign an appropriate channel for link to build route based on interference avoidance to PUs. Moreover, our routing metrics also consider necessarily the path which reduces energy consumption and control overhead. Our simulation results show that CAEER performs better than weighted cumulative expected transmission time (WCETT) and Multi-radio Multichannel Ad-Hoc on-Demand Distance Vector (MM-AODV) protocols in term of energy consumption and the control overhead. VL - 2 SN - 978-604-913-397-8 TI - CAEER: Channel Assignment and Energy-Efficient Routing Protocol in Cognitive Radio Adhoc Networks SP - 61 AV - restricted EP - 71 T2 - K? y?u H?i ngh? Khoa h?c Công ngh? Qu?c gia l?n th? VIII v? Nghiên c?u c? b?n và ?ng d?ng Công ngh? thông tin (FAIR'8) ER - TY - CONF ID - SisLab1314 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1314/ A1 - Nguyen, Duy Tan A1 - Nguyen, Dinh Viet Y1 - 2014/// TI - DFCB: Data Fusion and Chain-Based Routing Protocol for Energy-Efficient in Wireless Sensor Network AV - none M2 - Thai Nguyen, Vietnam T2 - 2014: H?i ngh? qu?c gia l?n th? VII Nghiên c?u c? b?n và ?ng d?ng Công ngh? thông tin (FAIR 2014) ER - TY - CONF ID - SisLab438 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_6 A1 - Nguyen, Duy Tan A1 - Nguyen, Dinh Viet Y1 - 2014/10/09/ TI - DFTBC: Data Fusion and Tree-Based Clustering Routing Protocol for Energy-Efficient in Wireless Sensor Networks SP - 61 M2 - Hanoi, Vietnam AV - none EP - 77 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF N1 - IEEE ATC 2015 Conference Proceedings ID - SisLab1614 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1614/ A1 - Nguyen, Duy Tan A1 - Nguyen, Dinh Viet Y1 - 2015/// N2 - One of the most important challenges in heterogeneous wireless sensor network (WSN) is to design a routing protocol that use energy efficiently to prolong the lifetime of the entire network due to the limited battery power of sensor nodes. To solve this problem, in this paper, we propose Sector-Chain Based Clustering (SCBC) Routing Protocol, in which, entire network area is divided into sectors (clusters), which balance to the number of nodes. SCBC further reduces energy dissipation of communication in network by constructing chain for each cluster with the chain leader as the cluster head (CH) or secondary cluster head (SCH) that has high residual energy and the shortest distance between candidate nodes and base station (BS) in network. In addition, SCBC improves energy efficiency by calculating the time length of each round in the steady data transmission phase for CHs or SCHs but still guarantee that it is alive in next round. Our simulation results show that the network lifetime of our proposed protocol can be improved about 70% and 20% in comparison with PEGASIS (Power-Efficient Gathering in Sensor Information System) and IEEPB (An Improved Energy-Efficient PEGASIS-Based) protocols, respectively. TI - SCBC: Sector-Chain Based Clustering Routing Protocol for Energy Efficiency in Heterogeneous Wireless Sensor Network SP - 314 M2 - Ho Chi Minh city, Vietnam AV - none EP - 319 T2 - ATC: the 2015 International Conference Advanced Technologies for Communications ER - TY - CONF ID - SisLab1311 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1311/ A1 - Nguyen, Duy Tan A1 - Nguyen, Dinh Viet Y1 - 2014/// TI - SSTBC: Sleep Scheduled and Tree-Based Clustering Routing Protocol for Energy-Efficient in Wireless Sensor Networks AV - none M2 - Can Tho, Vietnam T2 - 2015: The 11th IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF 2015) ER - TY - CONF ID - SisLab106 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/106/ A1 - Nguyen, Ha Anh Tuan A1 - Le, Sy Vinh A1 - Le, Si Quang Y1 - 2012/08/17/ N2 - Genotype data provide crucial information to understand effects of genetic variation to human health. Current microarray technologies are able to generate raw genotype data from thousands of samples across million of SNP sites. These raw data are processed by computational methods, called genotype caller, to obtain genotypes. Genotype calls of different callers might not be consistent due to noise of bad samples or SNPs. This requires a manual quality control step conducted by experts to remove bad samples or bad SNP sites. In this paper, we propose a maximum likelihood method to detect bad samples to improve the reliability of the results. Experiments with real data demonstrate the usefulness of our method in the quality control process. Thus, our method has the ability to reduce the number of samples that are requested to manually check by experts. KW - Clustering algorithms;Educational institutions;Genetics;Maximum likelihood detection;Probability;Process control;Quality control;genetics;genomics;maximum likelihood detection;quality control;sampling methods;Illumina BeadChips data;bad SNP sites;bad samples detection;computational methods;genetic variation;genotype caller;genotype data;human health;manual quality control;maximum likelihood method;microarray technologies;quality control process;raw genotype data generation;SNP;bad samples;genotype;quality control; TI - A Maximum Likelihood Method for Detecting Bad Samples from Illumina BeadChips Data SP - 26 M2 - Danang, Vietnam AV - none EP - 33 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab2909 UR - DOI: 10.5296/npa.v9i1-2 IS - 1-2 A1 - Nguyen, Ha Huy Cuong A1 - Vijender Kumar, Solanki A1 - Doan, Van Thang A1 - Nguyen, Thanh Thuy Y1 - 2017/08/09/ PB - DOI: 10.5296/npa.v9i1-2 JF - International Journal Network Protocols and Algorithms VL - 9 SN - 1943-3581 TI - Resource Allocation for Heterogeneous Cloud Computing SP - 71 AV - none EP - 84 ER - TY - JOUR ID - SisLab1472 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1472/ IS - 7 A1 - Nguyen, Ha Nam A1 - Choi, Gyoo-Seok Y1 - 2015/// PB - International Information Institute JF - Information Journal VL - 18 SN - 1344-8994 TI - Smartphones Behavior Analysis based on Sequential Pattern Approaches SP - 3245 AV - none EP - 3252 ER - TY - CONF ID - SisLab2703 UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?reload=true&punumber=8110729 A1 - Nguyen, Ha Thanh A1 - Nguyen, Viet Ha A1 - Vu, Viet Anh Y1 - 2017/10/19/ N2 - Legal documents play an important role in the legal systems of every nation. In order to process information automatically and make use of knowledge from legal documents, we need an appropriate knowledge representation for them. In this research, we investigate properties of the Vietnamese legal document system and propose a representation for the documents and their interrelationships. The main challenges for this task are their unstability, limited validity period and complicated interrelationships. Properties and relationships which we design to represent in our knowlege base are selective in order to make use of information within legal documents. In order to represent our knowlege base, we compare three methods: Semantic Network, Production Rules, Frame Language and make use of their advantages in our representation. Moreover, we implement a service-oriented system providing knowledge querying service for other application systems based on our research result. TI - A Knowledge Representation for Vietnamese Legal Document System SP - 30 M2 - Hue, Vietnam AV - none EP - 35 T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab2532 UR - http://cyprusconferences.org/iccci2017/ A1 - Nguyen, Hai Chau Y1 - 2017/09/27/ N2 - A solar term is an ancient Chinese concept to indicate a point of season change in lunisolar calendars. Solar terms are currently in use in China and nearby countries including Vietnam. In this paper we propose a new solution to increase performance of cholera outbreaks prediction in Hanoi, Vietnam. The new solution is a combination of solar terms, training data resampling and classification methods. Experimental results show that using solar terms in combination with ROSE resampling and random forests method delivers high area under the Receiver Operating Characteristic curve (AUC), balanced sensitivity and specificity. Without interaction effects the solar terms help increasing mean of AUC by 12.66%. The most important predictor in the solution is Sun?s ecliptical longitude corresponding to solar terms. Among the solar terms, "frost descent" and "start of summer" are the most important. PB - Springer JF - 9th International Conference on Computational Collective Intelligence TI - Enhancing Cholera Outbreaks Prediction Performance in Hanoi, Vietnam Using Solar Terms and Resampling Data AV - public ER - TY - JOUR ID - SisLab3613 UR - https://doi.org/10.1080/24751839.2019.1634869 IS - 4 A1 - Nguyen, Hai Chau Y1 - 2019/06// N2 - Measuring air temperature at a high spatial resolution is very important for many applications including detection of urban heat islands. However, air temperature is currently measured by weather stations those are very sparse spatially. In this paper, we propose a new approach to estimate air temperature using smartphones in different contexts. Most of the smartphones are not equipped with air temperature sensors but they are all equipped with battery temperature sensors. When a smartphone is in idle state, its battery temperature is stable and correlated with ambient air temperature. Furthermore, it is often carried close to human body, e.g. in pockets of coats, trousers and in hand. Therefore we developed a new approach of using two linear regression models to estimate air temperature from the idle smartphones battery temperature given their in-pocket or out-of-pocket positions. Lab test results show that the new approach is better than an existing one in mean absolute error and coefficient of determination metrics. Advantages of the new approach include the simplicity of implementation on smartphones and the ability for creating maps of temperature distribution. However, this approach needs field tests on more smartphone models to achieve its robustness. PB - Taylor & Francis JF - Journal of Information and Telecommunication VL - 3 SN - 2475-1839 TI - Estimation of Air Temperature Using Smartphones in Different Contexts SP - 494 AV - public EP - 507 ER - TY - CONF ID - SisLab3217 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3217/ A1 - Nguyen, Hai Chau Y1 - 2018/03// N2 - Measuring urban air temperature at a high spatial resolution is very important for many applications including detection of urban heat islands. However air temperature is currently measured by professional weather stations those are very sparse at 50 km spatial resolution or more. In this paper, we propose a new approach to estimate air temperature from smartphones. Most of the smartphones are not equipped with air temperature sensors. However they are all equipped with battery temperature sensors. When a smartphone is in idle state, its battery temperature is stable and correlated with air temperature around the smartphone. Therefore we have developed a linear regression model to estimate air temperature from the idle smartphones battery temperature. Experiment results show that the new approach is statistically comparable to an existing one using mean error, mean absolute error and coefficient of determination metrics. Advantages of the new approach include simplicity of implementation on smartphones and ability of creating maps of temperature distribution. TI - A New Approach to Estimate Urban Air Temperature Using Smartphones SP - 633 M2 - Dong Hoi, Quang Binh AV - none EP - 641 T2 - 10th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - JOUR ID - SisLab189 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/189/ A1 - Nguyen, Hai Chau Y1 - 2013/// JF - Advanced Computational Methods for Knowledge Engineering Studies in Computational Intelligence VL - 479 SN - 1860-949X TI - Parallelization of the Fast Multipole Method for Molecular Dynamics Simulations on Multicore Computers SP - 209 AV - none EP - 224 ER - TY - INPR N1 - Title and abstract of the paper will probably changed upon reviewers' recommendation. Latest version will be updated soon. ID - SisLab4389 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4389/ A1 - Nguyen, Hai Chau A1 - Kubo, Masatoshi A1 - Le, Viet Hai A1 - Yamamoto, Tomoyuki Y1 - 2021/04// N2 - Designing new materials with desired properties is a complex and time-consuming process. One of the challenging factors of the design process is the huge search space of possible materials. Machine learning methods such as k-nearest neighbours, support vector machine (SVM) and artificial neural network (ANN) can contribute to this process by predicting materials properties accurately. Properties of multi-principal element alloys (MPEAs) highly depend on alloys? phase. Thus, accurate prediction of the alloy?s phase is important to narrow down the search space. In this paper, we propose a solution of employing support vector machine method with hyperparameters tuning and the use of weights values for prediction of the alloy?s phase. Using the dataset consisting of the experimental results of 118 MPEAs, our solution achieves the cross-validation accuracy of 90.2%. We confirm the superiority of this score over the performance of ANN statistically. On the other dataset containing 401 MPEAs, our SVM model is comparable to ANN and exhibits 70.6% cross-validation accuracy. TI - Phase Prediction of Multi-principal Element Alloys Using Support Vector Machine and Bayesian Optimization M2 - Phuket, Thailand AV - none T2 - 13th Asian Conference on Intelligent Information and Database Systems 2021 (ACIIDS 2021) ER - TY - INPR ID - SisLab4742 UR - https://www.worldscientific.com/worldscinet/vjcs A1 - Nguyen, Hai Chau A1 - Kubo, Masatoshi A1 - Le, Viet Hai A1 - Yamamoto, Tomoyuki Y1 - 2022/// N2 - Designing new materials with desired properties is a complex and time-consuming process. One of the most challenging factors of the design process is the huge search space of possible materials. Machine learning methods such as k-nearest neighbours, support vector machine (SVM) and artificial neural network (ANN) can contribute to this process by predicting materials properties accurately. Properties of multi-principal element alloys (MPEAs) highly depend on alloys? phase. Thus, accurate prediction of the alloy?s phase is important to narrow down the search space. In this paper, we propose a solution of employing support vector machine method with hyperparameters tuning and the use of weighted values for prediction of the alloy?s phase. Using the dataset consisting of the experimental results of 118 MPEAs, our solution achieves a cross-validation accuracy of 90.2%. We confirm the superiority of this score over the performance of ANN statistically. On the other dataset containing 401 MPEAs, our SVM model is comparable to ANN and exhibits 70.6% cross-validation accuracy. We also found that additional variables, including average melting temperature and standard deviation of melting temperature, increase prediction accuracy by 3.34% in the best case. PB - World Scientific JF - Vietnam Journal of Computer Science SN - 2196-8888 TI - Support Vector Machine-based Phase Prediction of Multi-principal Element Alloys AV - none ER - TY - JOUR ID - SisLab1838 UR - http://doi.org/10.1007/978-3-319-38884-7_15 A1 - Nguyen, Hai Chau A1 - Le, Thi Ngoc Anh Y1 - 2016/// N2 - In 2007, repeated outbreaks of cholera in Hanoi have raised the need to have up-to-date evidence on the impact of factors on cholera epidemic, which is essential for developing an early warning system. We have successfully built models to predict cholera outbreaks in Hanoi from 2001 to 2012 using Random Forests method. We found that geographical factors - the number of cholera cases of a district of interest and its neighbours - are very important to predict accurately cholera cases besides the weather factors. Among weather factors, temperature and relative humidity are the most important. We also found that prediction accuracy of our models, measured in adjusted coefficient of determination, will decrease by 0.0076 if prediction length increases by one day. PB - Springer JF - Advanced Computational Methods for Knowledge Engineering Volume 453 of the series Advances in Intelligent Systems and Computing VL - 453 SN - 2194-5357 TI - Using Local Weather and Geographical Information to Predict Cholera Outbreaks in Hanoi, Vietnam SP - 195 AV - public EP - 212 ER - TY - CONF ID - SisLab1531 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1531/ A1 - Nguyen, Hanh Phuc A1 - Truong, Ninh Thuan Y1 - 2016/03/26/ N2 - Trong thi?t k? nói chung, tùy thu?c vào m?c ?? quan tr?ng, tính ch?t s?ng còn c?a h? th?ng ?òi h?i ng??i thi?t k? ph?i ??m b?o tính liên t?c trong ho?t ??ng c?a h? th?ng. Ví d? nh? h? th?ng ?i?u khi?n bay, h? th?ng c? s? d? li?u c?a các ngân hàng,?H? th?ng th? l?i (fault tolerance systems) là kh? n?ng ??m b?o cho h? th?ng ti?p t?c th?c hi?n các ch?c n?ng c?a mình khi m?t ph?n c?a h? th?ng g?p s? c?. Nói cách khác, h? th?ng có th? cung c?p các d?ch v? trong khi v?n t?n t?i l?i. Nghiên c?u trình bày m?t ph??ng pháp ?? mô hình hóa và ki?m ch?ng tính ch?t c?a h? th?ng ch?u l?i và cân b?ng t?i. Bên c?nh ?ó vi?c xây d?ng và th? nghi?m công c? ki?m ch?ng tính ch?t c?a h? th?ng ch?u l?i và cân b?ng t?i c?ng s? ???c gi?i thi?u. TI - Mô hình hóa và ki?m ch?ng các h? th?ng th? l?i và cân b?ng t?i M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3348 UR - http://iccasa.org/call-for-papers/ A1 - Nguyen, Hanh Phuc A1 - Truong, Ninh Thuan A1 - Le, Hong Anh Y1 - 2018/11// N2 - Web technologies have developed rapidly because web application is currently leading the trends of software development. A webbased application is a program that is accessed over a network connection, rather than existing within a device?s memory, hence detecting its failures is di?erent from other software systems. Many approaches and tools have been proposed for web testing, however, introducing new frameworks is still an emerging topic in this ?eld. This paper proposes an automation framework running in Java platform for web testing, called jFAT, which integrates with Selenium and TestNG. The paper also illustrates the use of framework with the Bank application case study. TI - jFAT: An automation framework for web application testing M2 - Vietnam AV - none T2 - 7th EAI International Conference on Context-Aware Systems and Applications (ICCASA 2018) ER - TY - CHAP ID - SisLab3448 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3448/ A1 - Nguyen, Hoai Son Y1 - 2019/04// N2 - Since the deployment of IP multicast remains restricted due to many practical and political issues, researchers have shifted focus to exploiting application-layer multicast for multicast data delivery. Recently there has been considerable interest in applying DHT routing algorithms to application-level multicast. However, early DHT-based multicast protocols are insufficient in addressing a number of technical issues such as heterogeneous capacity of nodes or node churn. In this chapter, the author describes a solution called BAM-Chord (i.e., Bandwidth Adaptive Multicast over Chord) that optimizes the topology of a multicast tree based on node bandwidth. In the proposed solution, node position (i.e., node identifier) on a BAM-Chord ring will be decided based on node bandwidth capacity such that it can build a wide and balanced multicast tree rooted at the source node. As a result, BAM-Chord protocol can utilize network resources of every node to reduce the depth of the multicast tree and take advantages of DHTs in maintaining the multicast tree. PB - IGI global SN - 9781522582953 TI - Topology Optimization for Heterogeneous DHT- Based Multicast SP - 134 AV - restricted EP - 155 T2 - Applying Integration Techniques and Methods in Distributed Systems and Technologies ER - TY - INPR ID - SisLab3976 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3976/ A1 - Nguyen, Hoai Son A1 - Do, Xuan Anh A1 - Le, Hoang A1 - Nguyen, Van Hoang A1 - Duong, Quang Khai A1 - Nguyen, Xuan Viet Cuong A1 - Ngo, Minh Hoang Y1 - 2020/10// N2 - In this paper, we introduce an ECHONET Lite based IoT platform which allows households to set up smart home environment with ease as well as allows service providers to deploy their IoT applications easily and securely. Our proposed platform is fully implemented with three main features: a simple process for integrating new IoT devices into smart home environment, a seamless data transfer mechanism between IoT devices and service providers, and a RESTful API for verifying and supporting service providers to deploy their IoT applications into our platform. The experimental results verified the practicability of our proposed IoT platform. TI - ECHONET Lite-based IoT Platform for Smart Homes M2 - Ho Chi Minh city, Vietnam AV - public T2 - The 2020 RIVF International Conference on Computing and Communication Technologies ER - TY - CHAP ID - SisLab778 UR - http://dx.doi.org/10.1007/978-3-642-39470-6_20 A1 - Nguyen, Hoai Son A1 - Makino, Yoshiki A1 - Lim, Azman Osman A1 - Tan, Yasuo A1 - Shinoda, Yoichi Y1 - 2013/// PB - Springer Science \mathplus Business Media M1 - 7910 TI - Building High-Accuracy Thermal Simulation for Evaluation of Thermal Comfort in Real Houses SP - 159 AV - none EP - 166 T2 - Lecture Notes in Computer Science ER - TY - CONF ID - SisLab2678 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2678/ A1 - Nguyen, Hoai Son A1 - Makino, Yoshiki A1 - Lim, Yuto A1 - Tan, Yasuo Y1 - 2017/11/24/ N2 - In residential houses, air conditioners consume a lot of electrical energy. In order to improve energy efficiency for residential houses, short-term prediction of energy consumption of air conditioners is required. In this paper, we propose the use of our thermal simulation to simulate the change of room temperature based on weather forecast information and predict the energy consumption of an air conditioner in a residential house. In order to calculate solar radiation heat flux, which contributes a lot to the change of room temperature, we utilize a neural network model to predict global solar radiation using training data obtained from weather stations. We also utilize a PID control model to simulate the operation of air conditioners. The accuracy of our simulation is verified by experiments carried out at a real testbed house. TI - Short-term prediction of energy consumption of air conditioners based on weather forecast M2 - Hanoi, Vietnam AV - public T2 - 2017 4th NAFOSTED Conference on Information and Computer Science (NICS 2017) ER - TY - JOUR ID - SisLab3447 UR - http://search.ieice.org/bin/summary.php?id=e102-b_3_545&category=B&year=2019&lang=E&abst= IS - 3 A1 - Nguyen, Hoai Son A1 - Nguyen, Dinh Nghia A1 - Sugawara, Shinji Y1 - 2019/03// N2 - DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes. JF - IEICE Transactions on Communications VL - E102-B SN - 0916-8516 TI - A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems SP - 545 AV - public EP - 556 ER - TY - CONF ID - SisLab1892 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1892/ A1 - Nguyen, Hoai Son A1 - Nguyen, Dinh Nghia A1 - Tran, Xuan Hoang Y1 - 2016/// N2 - DHT-based file backup systems can provide efficient mechanisms for resource placement and lookup. However, these systems must deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes. This paper presents an efficient file replication scheme based on DHT identifier space clustering in order to guarantee data availability and support load balancing for DHT-based file backup systems. The main idea of our method is to divide a DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability for backup data files even in the case of node churn occurred in the network. Further, backup nodes are selected among high-capacity nodes in clusters to achieve a good degree of load balancing. Simulation results demonstrate the effectiveness of our proposed scheme in comparison with other file replication schemes. TI - A Cluster-based File Replication Scheme for DHT-based File Backup Systems M2 - Hanoi, Vietnam AV - restricted T2 - the 2016 International Conference Advanced Technologies for Communications (ATC) ER - TY - CONF ID - SisLab2679 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2679/ A1 - Nguyen, Hoai Son A1 - Nguyen, Viet Bac Y1 - 2017/12/14/ N2 - ?? xây d?ng các ?ng d?ng Internet of Things trong nhà thông minh thì các thi?t b? c?n ???c k?t n?i và truy c?p m?t cách d? dàng d?a trên chu?n giao th?c chung. Trong bài báo này, chúng tôi ?? xu?t m?t IoT platform giúp cho các thi?t b? trong nhà thông minh có th? giao ti?p v?i nhau thông qua giao th?c Echonet Lite, m?t giao th?c ???c h? tr? b?i nhi?u công ty s?n xu?t thi?t b? ?i?n dân d?ng, ??ng th?i cho phép các thi?t b? trong nhà giao ti?p v?i các máy tính trên m?ng Internet thông qua m?t Home gateway s? d?ng giao th?c MQTT (Message Queue Telemetry Transport). IoT platform c?a chúng tôi cung c?p các ch?c n?ng giao ti?p v?i các thi?t b? c?ng nh? l?u tr? thông tin tr?ng thái và c?p nh?t tr?ng thái c?a các thi?t b? cho các ?ng d?ng IoT trong nhà thông minh. Chúng tôi ?ã cài ??t thành công IoT platform ?? xu?t và tri?n khai th? nghi?m m?t ?ng d?ng giám sát và ?i?u khi?n thi?t b? và m?t ?ng d?ng v? ? ?i?n thông minh trên IoT platform này. TI - Xây D?ng IoT Platform Cho Nhà Thông Minh T??ng Thích Chu?n Echonet Lite M2 - Ho Chi Minh city, Vietnam AV - public T2 - H?i ngh? Qu?c gia v? ?i?n t?, Truy?n thông và Công ngh? Thông tin ER - TY - INPR ID - SisLab3446 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3446/ A1 - Nguyen, Hoai Son A1 - Yasuo, Tan Y1 - 2018/// N2 - In this paper, we propose a simple model predictive control (MPC) scheme for Heating, ventilation, and air conditioning (HVAC) systems in residential houses. Our control scheme utilizes fitted thermal simulation to achieve precise prediction of room temperature and energy consumption in each prediction period. The set points of HVAC systems are selected to minimize the amount of energy consumption while maintaining room temperature within a desirable range to satisfy user comfort. Our control system is simple enough to implement in residential houses and is more efficient comparing with rule-based control methods. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering SN - 0866-8612 TI - Simulation-based Short-term Model Predictive Control for HVAC Systems of Residential Houses AV - public ER - TY - JOUR ID - SisLab776 UR - http://dx.doi.org/10.4018/jdst.2013010104 IS - 1 A1 - Nguyen, Hoai-Son A1 - Nguyen, Ngoc Anh A1 - Bui, Thi Huong Lan Y1 - 2013/// PB - IGI Global JF - International Journal of Distributed Systems and Technologies VL - 4 SN - 1947-3532 TI - BAM-Chord: DHT-based Bandwidth Adaptive Multicast System SP - 43 AV - none EP - 55 ER - TY - JOUR ID - SisLab777 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/777/ A1 - Nguyen, Hoai-Son A1 - Tan, Yasuo Y1 - 2013/// JF - IEICE Transactions on Communications SN - 0916-8516 TI - D-AVTree: A DHT-based Search System Supporting Scalable Multi-Attribute Query AV - none ER - TY - CONF ID - SisLab115 UR - http://dx.doi.org/10.1109/AINA.2012.98 A1 - Nguyen, Hoai-Son A1 - Tan, Yasuo A1 - Shinoda, Y. Y1 - 2012/03/26/ N2 - Today, when a huge number of information resources appear in the Internet, one problem arising is how to search and exploit these information resources efficiently and flexibly with high scalability. We believe that the realization of multiple-attribute searching in a distributed manner is an important solution for this problem. In this paper, we propose a solution of building a distributed attribute-value tree (AV tree) on DHT-based networks to realize multiple-attribute searching. Each resource is named by an AV tree and DHT keys are created from each AV branch of a resource name. Resource information is distributed to a DHT-based network by the use of these DHT keys. Our solution keeps the locality of resource names in the key space of DHT networks such that AV branches that share a number of attribute/value pairs (AV pairs) will be mapped to a continuous portion of the key space. Therefore, multiple-attribute searching can be achieved efficiently by querying nodes responsible for a continuous portion of the key space. Our system can achieve both efficiency and a good degree of load balancing even when the distribution of AV pairs in resource names is skewed. Our simulation result shows the efficiency of our solution in respects of query success ratio and the degree of load balancing, comparing with conventional approaches. KW - Buildings;Indexes;Information services;Load management;Routing;Routing protocols;Search problems;Internet;cryptography;file organisation;information resources;query processing;trees (mathematics);AV tree;DHT-based networks;Internet;distributed attribute-value trees;information resources;multiple-attribute searching;query processing;DHT;Load balancing;Multiple Attribute/Value Searching; TI - Building Distributed Attribute-Value Trees on DHT-based Networks SP - 795 M2 - Fukuoka, Japan AV - none EP - 802 T2 - 2012 IEEE 26th International Conference on Advanced Information Networking and Applications (AINA) ER - TY - CONF ID - SisLab3583 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3583/ A1 - Nguyen, Hoang Anh A1 - Luu, Viet Hung A1 - Phan, Anh A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2019/12// N2 - One of the major topics in photogrammetry is the automated extraction of building from data acquired by airborne sensors. What makes this task challenging is the very heterogeneous appearance and dense distribution of buildings in urban areas. While many dataset have been established, none of them pay attention to developing cities where buildings are not well planned. To complement the development of building extraction algorithms, a dataset of high resolution satellite image is constructed in this paper covering Cau Giay district, Hanoi, Vietnam. The dataset consists of 2100 images of size 1024 x 1024 pixels extracted from Google Earth. Shape, size, and construction material differ greatly from building to building, thus make it challenging for state-of-the-art algorithm to accurately extract building location. Some baselines are provided using Convolutional Neural Networks (CNNs). Experimental results show that U-Net model trained with Mean Square Error loss is able to achieve comparable results (OA=92.04). TI - Cau Giay: A Dataset for Very Dense Building Extraction from Google Earth Imagery M2 - Hanoi, Vietnam AV - public T2 - 6th NAFOSTED Conference on Information and Computer Science ER - TY - CONF ID - SisLab1532 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1532/ A1 - Nguyen, Hong Quan A1 - Nguyen, Phuong Thai A1 - Dang, Thanh Quyen A1 - Nguyen, Van Hiep Y1 - 2016/03/26/ N2 - Viet Treebank is an annotated corpus newly published in 2009. In this paper, we applied automated methods to detect errors in Viet Treebank based on the concept of equivalence classes proposed by Dickinson. On this basis, we propose an improved method of error detection by transforming the syntax tree based on vertical markovization. Our experimental results on Viet Treebank showed that the scope of error detection extended more than 2 times and improved the precision more than 18.07% in comparison with the base line methods. TI - Automatic Detection of Problematic Rules in Vietnamese Treebank M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1594 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1594/ A1 - Nguyen, Hong Quan A1 - Nguyen, Phuong Thai A1 - Dang, Thanh Quyen A1 - Nguyen, Van Hiep Y1 - 2015/01// N2 - Vietnamese Treebank is a syntactically annotated corpus newly published in 2009. In this paper, we applied automated methods to detect errors in Vietnammese Treebank based on the concept of equivalence classes proposed by Dickinson. On this basis, we propose an improved method of error detection by transforming syntax trees based on vertical markovization. Our experimental results on Vietnamese Treebank showed that the scope of error detection was extended more than 2 times and the precision was improved more than 18.07% in comparison with the base line methods. KW - Markov processes;equivalence classes;natural language processing;trees (mathematics);Vietnamese Treebank;automatic detection;equivalence classes;problematic rules;syntax trees;vertical Markovization;Abstracts;Accuracy;Buildings;Educational institutions;Natural language processing;Reliability;Syntactics;VTB;ad hoc;auto;detect;equipvalence;error;markovization;treebank TI - Automatic detection of problematic rules in Vietnamese Treebank SP - 13 M2 - Can Tho, Vietnam AV - none EP - 18 T2 - RIVF: 2015 IEEE RIVF International Conference on Computing Communication Technologies - Research, Innovation, and Vision for the Future ER - TY - INPR ID - SisLab2340 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2340/ A1 - Nguyen, Hong Thinh A1 - Le, Vu Ha A1 - Cecile, Barat A1 - Christophe, Ducottet Y1 - 2016/01// TI - String Distance For Automatic Image Classification AV - none M2 - Vietnam T2 - International Joint Conference on Convergence ER - TY - CONF ID - SisLab1849 UR - http://doi.org/10.1109/ATC.2010.5672692 A1 - Nguyen, Hong Thinh A1 - Nguyen, Viet Dung A1 - Le, Vu Ha Y1 - 2010/10// TI - Super-resolution image construction from high-speed camera sequences SP - 152 M2 - HoChiMinh city, Vietnam AV - none EP - 157 T2 - International Conference on Advanced Technologies for Communications ER - TY - CONF ID - SisLab1185 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1185/ A1 - Nguyen, Hong-Quan A1 - Nguyen, Phuong-Thai A1 - Dang, Thanh-Quyen A1 - Nguyen, Van Hiep Y1 - 2015/// TI - Automatic Detection of Problematic Rules in Vietnamese Treebank AV - none M2 - Can Tho, Vietnam T2 - 2015: The 11th IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF 2015) ER - TY - BOOK ID - SisLab3157 UR - https://link.springer.com/book/10.1007%2F978-3-319-99368-3 IS - 11103 A1 - Nguyen, Hung Son A1 - Ha, Quang Thuy A1 - Li, Tianrui A1 - Ma?gorzata, Przyby?a-Kasperek Y1 - 2018/08// PB - Springer T3 - Lecture Notes in Computer Science ED - Nguyen, Hung Son ED - Ha, Quang Thuy ED - Li, Tianrui ED - Ma?gorzata, Przyby?a-Kasperek TI - International Joint Conference on Rough Sets AV - public EP - 50 ER - TY - RPRT ID - SisLab3197 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3197/ A1 - Nguyen, Huu Nhat Minh A1 - Phan, Xuan Hieu A1 - Tran, Quoc Long Y1 - 2018/12// N2 - With the growth of Artificial intelligence and Machine learning, the amount of research for autonomous vehicle is also growing nonstop. But a self-driving system is far too complex with the hardware integration, LiDAR and RADAR involvement, how exactly are these machine learning algorithms being applied, where can a machine learning researcher start to research self-driving car. This report will cover how traditional machine learning methods and state of the are deep learning (semantic segmentation, convolutional neural network - CNN) are being applied to build autonomous cars. The algorithm uses image processing techniques to label lane pixels, classical machine learning and Histogram of Oriented Gradient (HOG) to label vehicle and street sign pixels. Then the data is used to train a semantic segmentation network to extract features for a final CNN to combine with the original image and predict driving command. PB - VNU-UET VL - TR2018-FIT-05 M1 - technical_report TI - Deep learning based detection of vehicles, lane and street sign for behavior cloning in autonomous car AV - public EP - 8 ER - TY - INPR ID - SisLab3450 UR - https://www.bmsb2019.org/main.do A1 - Nguyen, Huu Thuc A1 - Nguyen, Canh Thuong A1 - Hoang, Van Xiem A1 - Byeungwoo, Jeon Y1 - 2019/06/07/ N2 - Scalable High Efficiency Video Coding (SHVC), is the most recent video coding solution mainly designed for network adaptive or device adaptive applications. SHVC follows a layered coding structure with one base layer (BL) and one or several enhancement layers (ELs) which can be unequally protected. However, SHVC is often sensitive to the packet loss in unreliable networks, especially in case of ELs. In this paper, we propose a novel error concealment method for the SHVC EL with an assumption that the BL is well protected. First, we recover the partitioning and resample the motion data from collocated BL frame. Following, we remove outliers of motion field by a motion vector refinement algorithm. Lastly, we conceal loss frame by using motion compensation and deblocking filter. Experiments conducted with a rich set of test sequences and for the spatial-scalable SHVC standard have shown that our proposed method significantly outperforms the relevant error concealment methods, e.g., BL Reconstruction Up-sampling (RU) and BL-SKIP in both subjective and objective quality assessments. TI - A Frame Loss Concealment Solution for Spatial Scalable HEVC using Base Layer Motion SP - 1 M2 - Jeju Island, Korea AV - public EP - 4 T2 - IEEE International Symposium on Broadband Multimedia Systems and Broadcasting 2019 ER - TY - CONF ID - SisLab1502 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1502/ A1 - Nguyen, Huu Tung A1 - Le, Van Giap A1 - Nguyen, Ngoc Hoa Y1 - 2016/04/29/ TI - A solution for automatically scanning web vulnerability AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab1295 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1295/ A1 - Nguyen, Khoa Hai A1 - Dang, Duc Hanh Y1 - 2014/// TI - RTL: A Tool for Precise Model Transformations AV - none M2 - Ho Chi Minh City, Vietnam T2 - 2014: International Conference on Advanced Computing and Applications (ACOMP) ER - TY - JOUR ID - SisLab1972 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1972/ IS - 4A A1 - Nguyen, Khoa Hai A1 - Dang, Duc Hanh Y1 - 2014/// PB - Hanoi University of Industry JF - Journal of Science and Technology VL - 52 SN - 1859-3585 TI - RTL: A Tool for Precise Model Transformations SP - 230 AV - none EP - 239 ER - TY - CONF ID - SisLab1533 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1533/ A1 - Nguyen, Kim Sao A1 - Le, Quang Hoa A1 - Pham, Van At Y1 - 2016/03/26/ N2 - Bài báo ?? xu?t m?t ph??ng pháp th?y vân thu?n ngh?ch m?i d?a trên d?ch chuy?n histogram (DCH). Trong khi h?u h?t các ph??ng pháp th?y vân d?a trên DCH không có kh? n?ng ?óng gói m?i thông tin c?n thi?t v? ?nh g?c vào ?nh th?y vân, nên ? giai ?o?n khôi ph?c chúng ph?i s? d?ng m?t s? thông tin ph? v? ?nh g?c, thì ph??ng pháp ?? xu?t ?ã kh?c ph?c ???c nh??c ?i?m trên và không c?n s? d?ng b?t k? thông tin ph? nào v? ?nh g?c ?? khôi ph?c d?u th?y vân c?ng nh? ?nh g?c. Các ph??ng pháp th?y vân nh? v?y g?i là có tính ?óng gói ho?c ??c l?p thông tin ph?. Gi?i pháp ?óng gói ???c s? d?ng ? ?ây là k?t h?p k? thu?t chèn bít th?p và d?ch chuy?n histogram. ?nh g?c ???c chia thành hai mi?n: mi?n ??u g?m m?t s? ít ?i?m ?nh ???c s? d?ng ?? nhúng thông tin ph? b?ng k? thu?t chèn bít th?p, mi?n th? hai g?m ph?n còn l?i c?a ?nh, dùng ?? nhúng d?u th?y vân theo ph??ng pháp DCH. So sánh v?i các ph??ng pháp ??c l?p thông tin ph? khác, ph??ng pháp ?? xu?t có kh? n?ng nhúng cao h?n và ?? ph?c t?p tính toán th?p h?n. ?u ?i?m c?a gi?i pháp ?óng gói ?? xu?t là ??n gi?n, hi?u qu? và có th? d? dàng áp d?ng ??i v?i h?u h?t các ph??ng pháp th?y vân DCH khác. TI - M?t ph??ng pháp th?y vân thu?n ngh?ch m?i d?a trên d?ch chuy?n histogram M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab2302 UR - http://doi.org/10.1142/S0218213007003242 IS - 01 A1 - Nguyen, Le Minh A1 - Phan, Xuan Hieu A1 - Horiguchi, Susumu A1 - Shimazu, Akira Y1 - 2007/02// JF - International Journal on Artificial Intelligence Tools VL - 16 SN - 0218-2130 TI - A new sentence reduction technique based on a decision tree model SP - 129 AV - none EP - 137 ER - TY - CONF ID - SisLab2304 UR - http://www.aclweb.org/anthology/D/D07/ A1 - Nguyen, Le Minh A1 - Shimazu, Akira A1 - Nguyen, Phuong Thai A1 - Phan, Xuan Hieu Y1 - 2007/06/28/ TI - A Multilingual Dependency Analysis System Using Online Passive-Aggressive Learning SP - 1149 M2 - Prague, Czech Republic AV - none EP - 1155 T2 - Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL) ER - TY - CONF ID - SisLab2299 UR - http://doi.org/10.1109/ICTAI.2008.96 A1 - Nguyen, Le Minh A1 - Shimazu, Akira A1 - Phan, Xuan Hieu A1 - Nguyen, Phuong Thai Y1 - 2008/11/03/ TI - Online Structured Learning for Semantic Parsing with Synchronous and lambda-Synchronous Context Free Grammars SP - 135 M2 - Dayton, Ohio, USA AV - none EP - 142 T2 - The 20th IEEE International Conference on Tools with Artificial Intelligence (IEEE ICTAI) ER - TY - JOUR ID - SisLab3551 UR - https://www.journals.elsevier.com/fuzzy-sets-and-systems A1 - Nguyen, Linh Anh A1 - Ha, Quang Thuy A1 - Nguyen, Ngoc Thanh A1 - Nguyen, Thi Hong Khanh A1 - Tran, Thanh Luong Y1 - 2019/08/12/ N2 - Description logics (DLs) are a suitable formalism for representing knowledge about domains in which objects are described not only by attributes but also by binary relations between objects. Fuzzy extensions of DLs can be used for such domains when data and knowledge about them are vague and imprecise. One of the possible ways to specify classes of objects in such domains is to use concepts in fuzzy DLs. As DLs are variants of modal logics, indiscernibility in DLs is characterized by bisimilarity. The bisimilarity relation of an interpretation is the largest auto-bisimulation of that interpretation. In DLs and their fuzzy extensions, such equivalence relations can be used for concept learning. In this paper, we define and study fuzzy bisimulation and bisimilarity for fuzzy DLs under the Gödel semantics, as well as crisp bisimulation and strong bisimilarity for such logics extended with involutive negation. The considered logics are fuzzy extensions of the DL (a variant of PDL) with additional features among inverse roles, nominals, (qualified or unqualified) number restrictions, the universal role, local reflexivity of a role and involutive negation. We formulate and prove results on invariance of concepts under fuzzy (resp. crisp) bisimulation, conditional invariance of fuzzy TBoxes/ABoxes under bisimilarity (resp. strong bisimilarity), and the Hennessy-Milner property of fuzzy (resp. crisp) bisimulation for fuzzy DLs without (resp. with) involutive negation under the Gödel semantics. Apart from these fundamental results, we also provide results on using fuzzy bisimulation to separate the expressive powers of fuzzy DLs, as well as results on using strong bisimilarity to minimize fuzzy interpretations. PB - Elsevier JF - Fuzzy Sets and Systems SN - 0165-0114 TI - Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics AV - none ER - TY - JOUR ID - SisLab4068 UR - https://arxiv.org/ A1 - Nguyen, Linh Anh A1 - Ha, Quang Thuy A1 - Nguyen, Ngoc Thanh A1 - Nguyen, Thi Hong Khanh A1 - Tran, Thanh Luong Y1 - 2020/08/06/ N2 - Description logics (DLs) are a suitable formalism for representing knowledge about domains in which objects are described not only by attributes but also by binary relations between objects. Fuzzy extensions of DLs can be used for such domains when data and knowledge about them are vague and imprecise. One of the possible ways to specify classes of objects in such domains is to use concepts in fuzzy DLs. As DLs are variants of modal logics, indiscernibility in DLs is characterized by bisimilarity. The bisimilarity relation of an interpretation is the largest auto-bisimulation of that interpretation. In DLs and their fuzzy extensions, such equivalence relations can be used for concept learning. In this paper, we define and study fuzzy bisimulation and bisimilarity for fuzzy DLs under the Gödel semantics, as well as crisp bisimulation and strong bisimilarity for such logics extended with involutive negation. The considered logics are fuzzy extensions of the DL ALCreg (a variant of PDL) with additional features among inverse roles, nominals, (qualified or unqualified) number restrictions, the universal role, local reflexivity of a role and involutive negation. We formulate and prove results on invariance of concepts under fuzzy (resp. crisp) bisimulation, conditional invariance of fuzzy TBoxex/ABoxes under bisimilarity (resp. strong bisimilarity), and the Hennessy-Milner property of fuzzy (resp. crisp) bisimulation for fuzzy DLs without (resp. with) involutive negation under the Gödel semantics. Apart from these fundamental results, we also provide results on using fuzzy bisimulation to separate the expressive powers of fuzzy DLs, as well as results on using strong bisimilarity to minimize fuzzy interpretations. JF - arXiv.org TI - Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics AV - public ER - TY - CONF ID - SisLab2537 UR - http://doi.org/10.1109/SMC.2016.7844972 A1 - Nguyen, Linh Anh A1 - Nguyen, Thi Hong Khanh A1 - Nguyen, Ngoc Thanh A1 - Ha, Quang Thuy Y1 - 2016/// N2 - We introduce comparisons with respect to information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. As bisimilarity is a natural notion for characterizing indiscernibility in modal and description logics, it is useful for concept learning in description logics also when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons with respect to information in paraconsistent description logics. As consequences, we also obtain invariance results and the Hennessy-Milner property for bisimilarity in paraconsistent description logics. TI - Bisimilarity for paraconsistent description logics SP - 004694 AV - none EP - 004699 T2 - 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC) ER - TY - JOUR ID - SisLab2473 UR - http://doi.org/10.3233/JIFS-169120 IS - 2 A1 - Nguyen, Linh Anh A1 - Nguyen, Thi Hong Khanh A1 - Nguyen, Ngoc Thanh A1 - Ha, Quang Thuy A1 - Nguyen, Ngoc Thanh A1 - Núñez, Manuel A1 - Trawi?ski, Bogdan Y1 - 2017/// N2 - We introduce comparisons w.r.t. information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. This notion is useful for concept learning in description logics when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons w.r.t. information in paraconsistent description logics. As consequences, we obtain also invariance results and the Hennessy-Milner property for bisimilarity in paraconsistent description logics. JF - Journal of Intelligent & Fuzzy Systems VL - 32 SN - 1064-1246 TI - Bisimilarity for paraconsistent description logics SP - 1203 AV - public EP - 1215 ER - TY - JOUR N1 - Early access ID - SisLab3317 UR - https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4200690 A1 - Nguyen, Linh Trung A1 - Nguyen, Viet Dung A1 - Thameri, Messaoud A1 - Truong, Minh Chinh A1 - Abed-Meraim, Karim Y1 - 2018/10/22/ N2 - This paper introduces new, low-complexity, adaptive algorithms for robust subspace tracking in certain adverse scenarios of noisy data. First, an adequate weighted least-squares criterion is considered for the design of a robust subspace tracker that is most efficient in the burst noise case. Second, by using data pre-processing and robust statistics estimate, we introduce a second method that is shown to be the most efficient for subspace tracking in the case of impulsive noise (e.g. ?-stable noise). Finally, a ?detect-and-skip? approach is adopted where the corrupted measurements are detected and treated as ?missing? data. The resulting algorithm is particularly effective in the case where the data is affected by sparse ?outliers?. All these approaches were analyzed and their convergence properties were investigated. Moreover, the proposed subspace tracking algorithms were compared by simulated experiments to some state-of-the-art methods, in different noise/outliers contexts. PB - IEEE JF - IEEE Journal of Selected Topics in Signal Processing SN - 1932-4553 TI - Low-complexity adaptive algorithms for robust subspace tracking AV - none ER - TY - CONF ID - SisLab2947 UR - http://www.ismict2018.org/ A1 - Nguyen, Linh Trung A1 - Truong, Minh Chinh A1 - Nguyen, Viet Dung A1 - Abed-Meraim, Karim Y1 - 2018/03/26/ N2 - Tensor decomposition is a popular tool to analyse and process data which can be represented by a higher-order tensor structure. In this paper, we consider tensor tracking in challenging situations where the observed data are streaming and incomplete. Specifically, we proposed a non-linear formulation of the PETRELS cost function and based on which we proposed NL-PETRELS subspace and tensor tracking algorithms. The non-linear function allows us to improve the convergence rate. We also illustrated the use of our proposed tensor tracking for incomplete multi-channel electroencephalogram (EEG) data in a real-life experiment in which the data can be represented by a third-order tensor. TI - A Non-Linear Tensor Tracking Algorithm for Analysis of Incomplete Multi-Channel EEG Data SP - 114 M2 - Sydney, Australia AV - public EP - 119 T2 - 12th International Symposium on Medical Information and Communication Technology (ISMICT) ER - TY - CONF ID - SisLab2991 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2991/ A1 - Nguyen, Manh Ha A1 - Nguyen, Dinh Viet Y1 - 2005/// N2 - The development of gigabit and satellite networking is driving TCP congestion control outside of its natural operating regime. The reason is that AIMD algorithm [2] provides poor utilization of the bottleneck link and long RTT flows are often unable to get a fair allocation of bottleneck bandwidth [3] in those kinds of network. Therefore, this topic is immediately becoming one of universal interests in network performance research community. However, it is difficult to estimate the demand and supply of network resources in dynamic network environment. Although many approaches are used, feedback-based scheme [1], [4] is still the most favorite and prospective one. Some implementations of this approach have been carried out but the detail performance comparison has not been known. This report discusses some advanced approaches and figures out the both advantages and disadvantages of each one; especially BIC-TCP, a new approach based on binary increase congestion control mechanism aimed to solve the TCP friendliness and bandwidth scalability problems. Finally, we inform a number of performance evaluations and parameters which will, in turn, be analyzed after in order to get a better result in various network environments based on ns-2 network simulator. TI - PERFORMANCE EVALUATION OF RECENT DEVELOPMENT IN TRANSPORT PROTOCOL FOR HIGH BANDWIDTH-DELAY NETWORKS SP - 499 M2 - ?à N?ng, Vi?t Nam AV - none EP - 508 T2 - H?i th?o Qu?c gia l?n th? VII, M?t s? v?n ?? ch?n l?c c?a Công ngh? Thông tin và Truy?n thông ER - TY - CONF ID - SisLab2988 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2988/ A1 - Nguyen, Manh Ha A1 - Nguyen, Dinh Viet Y1 - 2006/07// N2 - A multi-hop mobile ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the usage of any existing network infrastructure or centralized administration. They are self-organized and used in disaster relief, conference, and battlefield environments where infrastructure had been destroyed or does not exist. Because of the unpredictable dynamically moving nature of mobile nodes, the overhead of routing traffic in an ad hoc network is likely to be higher than that in a wire-line network. Consequently,routing protocol have been playing crucial role in the efficiency of overall network operation. There are numerous proposals have been submitted, however many aspects of them needed more investigation and evaluation especially performance and QoS. In this paper, we will evaluate recent development in ad hoc network routing protocols and gateway discovery for Internet access within data intensive environment as well as present quantitative analysis base on simulation by ns-2 network simulator. TI - PERFORMANCE EVALUATION OF ROUTING PROTOCOLS AND INTERNET ACCESS IN MULTI-HOP MOBILE AD HOC NETWORKS SP - 239 M2 - Thành ph? H? Chí Minh AV - none EP - 250 T2 - H?i th?o khoa h?c Qu?c gia l?n th? II: Nghiên c?u c? b?n và ?ng d?ng Công ngh? Thông tin" (FAIR2005) ER - TY - JOUR ID - SisLab4567 UR - http://dx.doi.org/10.1016/j.ejor.2021.07.008 A1 - Nguyen, Minh Anh A1 - Dang, Giang Thi-Huong A1 - Hà, Minh Hoàng A1 - Pham, Minh Trien Y1 - 2021/// N2 - Adopting unmanned aerial vehicles (UAV), also known as drones, into the last-mile-delivery sector and having them work alongside trucks with the aim of improving service quality and reducing the transportation cost gives rise to a new class of Vehicle Routing Problems (VRPs). In this paper, we introduce a new optimization problem called the min-cost Parallel Drone Scheduling Vehicle Routing Problem (PDSVRP). This problem is a variant of the well-known Parallel Drone Scheduling Traveling Salesman Problem (PDSTSP) recently introduced in the literature in which we allow multiple trucks and consider the objective of minimizing the total transportation costs. We formulate the problem as a Mixed Integer Linear Program and then develop a Ruin and Recreate (R&R) algorithm. Exploiting PDSVRP solution characteristics in an effective manner, our heuristic manages to introduce \sufficient" rooms to a solution via new removal operators during the ruin phase. It is expected to enhance the possibilities for improving solutions later in the recreate phase. Multiple experiments on a new set of randomly generated instances confirm the performance of our approach. To explore the benefits of drone delivery as well as the insight into the impact of related factors on the contribution of drones? use to operational cost, a sensitivity analysis is conducted. We also adapt the proposed algorithm to solve the PDSTSP and validate it via benchmarks available in the literature. It is shown that our algorithm outperforms state-of-the-art algorithms in terms of solution quality. Out of 90 considered instances, it finds 26 new best known solutions. JF - European Journal of Operational Research SN - 03772217 TI - The min-cost parallel drone scheduling vehicle routing problem AV - public ER - TY - CONF ID - SisLab3673 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3673/ A1 - Nguyen, Minh Hai A1 - Ha, Minh Hoang A1 - Dinh, Thai Hoang A1 - Diep, Nguyen A1 - Dutkiewicz, Eryk A1 - Tran, The Trung Y1 - 2019/// N2 - The minimum dominating set problem (MDSP) aims to construct the minimum-size subset D?V of a graph G=(V,E) such that every vertex has at least one neighbor in D. The problem is proved to be NP-hard [5]. In a recent industrial application, we encountered a more general variant of MDSP that extends the neighborhood relationship as follows: a vertex is a k-neighbor of another if there exists a linking path through no more than k edges between them. This problem is called the minimum k-dominating set problem (MkDSP) and the dominating set is denoted as D_k. The MkDSP can be used to model applications in social networks [2] and design of wireless sensor networks [3]. In our case, a telecommunication company uses the problem model to supervise a large social network up to 17 millions nodes via a dominating subset in which k is set to 3. TI - An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks M2 - Ho Chi Minh AV - public T2 - CSoNet 2019 ER - TY - JOUR ID - SisLab4060 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4060/ IS - 7 A1 - Nguyen, Minh Hai A1 - Ha, Minh Hoang A1 - Nguyen N, Diep A1 - Tran, The Trung Y1 - 2020/// N2 - The well-known minimum dominating set problem (MDSP) aims to construct the minimum-size subset of vertices in a graph such that every other vertex has at least one neighbor in the subset. In this article, we study a general version of the problem that extends the neighborhood relationship: two vertices are called neighbors of each other if there exists a path through no more than k edges between them. The problem called ?minimum k-dominating set problem? (MkDSP) becomes the classical dominating set problem if k is 1 and has important applications in monitoring large-scale social networks. We propose an efficient heuristic algorithm that can handle real-world instances with up to 17 million vertices and 33 million edges. This is the first time such large graphs are solved for the minimum k-dominating set problem PB - Springer JF - Computational Social Networks TI - Solving the k-dominating set problem on very large-scale networks AV - public ER - TY - CONF ID - SisLab2753 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2753/ A1 - Nguyen, Minh Hoa A1 - Vuong, Tung Long A1 - Le, Thanh Ha A1 - Nguyen, Thi Thuy A1 - Nguyen, Do Van A1 - Nguyen, Dinh Nam Y1 - 2017/// TI - Moving object detection in compressed domain for high resolution videos AV - none M2 - Nha Trang T2 - The 8th International Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab2990 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2990/ A1 - Nguyen, Minh Nguyet A1 - Nguyen, Dinh Viet Y1 - 2005/// N2 - A mobile ad hoc network (MANET) is a group of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A mobile node acts both as a host and a router forwarding packets to other nodes. Because of the nature of ad hoc networks, there are special demands for ad hoc routing protocols. Certainly, the performance is the most desired issue. This paper presents our efforts in measuring and comparing the performance of ad hoc routing protocols by simulating with the use of NS2 (Network Simulator version 2) package. Three major protocols are considered (DSDV, DSR and AODV). The simulation results show the performance of the protocols and allow us to make conclusions of each one and to compare one with the others. TI - ?ÁNH GIÁ HI?U SU?T CÁC GIAO TH?C ??NH TUY?N TRONG M?NG KHÔNG DÂY AD HOC SP - 295 M2 - ?à N?ng, Vi?t Nam AV - none EP - 305 T2 - H?i th?o Qu?c gia l?n th? VII: M?t s? v?n ?? ch?n l?c c?a CNTT và Truy?n thông ER - TY - CONF ID - SisLab3413 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3413/ A1 - Nguyen, Minh Thuan A1 - Bui, Van Tan A1 - Vu, Huy Hien A1 - Nguyen, Phuong Thai A1 - Luong, Chi Mai Y1 - 2018/// N2 - The phrase-table plays an important role in traditional phrase-based statistical machine translation (SMT) system. During translation, a phrase-based SMT system relies heavily on phrase-table to generate outputs. In this paper, we propose two methods for enhancing the quality of phrase-table. The first method is to recompute phrasetable weights by using vector representations similarity. The remaining method is to enrich the phrase-table by integrating new phrase-pairs from an extended dictionary and projections of word vector presentations on the target language space. Our methods produce an attainment of up to 0.21 and 0.44 BLEU scores on in-domain and cross-domain (Asian Language Treebank - ALT) English - Vietnamese datasets respectively. TI - Enhancing the quality of Phrase-table in Statistical Machine Translation for Less-Common and Low-Resource Languages AV - public T2 - International Association of Logopedics and Phoniatrics ER - TY - JOUR ID - SisLab4604 UR - https://aclanthology.org/2020.paclic-1.24 A1 - Nguyen, Minh Thuan A1 - Nguyen, Phuong Thai A1 - Nguyen, Van Vinh A1 - Nguyen Hoang, Minh Cong Y1 - 2020/10// N2 - Research on providing machine translation systems for unseen language pairs is gaining increasing attention in recent years. However, the quality of their systems is poor for most language pairs, especially for less-common pairs such as Khmer-Vietnamese. In this paper, we show a simple iterative traininggenerating-filtering-training process that utilizes all available pivot parallel data to generate synthetic data for unseen directions. In addition, we propose a filtering method based on word alignments and the longest parallel phrase to filter out noise sentence pairs in the synthetic data. Experiment results on zero-shot Khmer?Vietnamese and Indonesian?Vietnamese directions show that our proposed model outperforms some strong baselines and achieves a promising result under the zero-resource condition on ALT benchmarks. Besides, the results also indicate that our model can easily improve their quality with a small amount of real parallel data. PB - Association for Computational Linguistics JF - Proceedings of the 34th Pacific Asia Conference on Language, Information and Computation TI - Iterative Multilingual Neural Machine Translation for Less-Common and Zero-Resource Language Pairs SP - 207 AV - public EP - 215 ER - TY - CONF ID - SisLab1643 UR - http://dx.doi.org/10.1109/KSE.2015.23 A1 - Nguyen, Minh Tien A1 - Ha, Quang Thuy A1 - Nguyen, Thi Dung A1 - Nguyen, Tri Thanh A1 - Nguyen, Le Minh Y1 - 2015/// TI - Recognizing Textual Entailment in Vietnamese Text: An Experimental Study SP - 108 M2 - Ho Chi Minh city, Vietnam AV - none EP - 113 T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab1644 UR - http://dx.doi.org/10.1007/978-3-319-18032-8_6 A1 - Nguyen, Minh Tien A1 - Kitamoto, Asanobu A1 - Nguyen, Tri Thanh Y1 - 2015/// VL - 9078 SN - 0302-9743 TI - TSum4act: A Framework for Retrieving and Summarizing Actionable Tweets During a Disaster for Reaction SP - 64 M2 - Ho Chi Minh City, Vietnam AV - none EP - 75 T2 - 19th Pacific-Asia Conference, PAKDD ER - TY - JOUR ID - SisLab4550 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4550/ A1 - Nguyen, Minh Tien A1 - Nguyen, Tri Thanh A1 - Asanobu, Kitamoto A1 - Nguyen, Van-Hau TI - Exploiting Social Networks as a Live Mass Media Channel During Disasters for Reactions AV - none JF - International Journal on Artificial Intelligence Tools @ World Scientific Publishing Company ER - TY - INPR ID - SisLab2979 UR - https://tkdd.acm.org A1 - Nguyen, Minh Tien A1 - Tran, Duc Vu A1 - Nguyen, Le Minh A1 - Phan, Xuan Hieu Y1 - 2018/// N2 - Relevant user posts such as comments or tweets of a Web document provide additional valuable information to enrich the content of this document. When creating user posts, readers tend to borrow salient words or phrases in sentences. This can be considered as word variation. This paper proposes a framework which models the word variation aspect to enhance the quality of Web document summarization. Technically, the framework consists of two steps: scoring and selection. In the first step, the social information of a Web document such as user posts is exploited to model intra-relations and inter-relations in lexical and semantic levels. These relations are denoted by a mutual reinforcement similarity graph used to score each sentence and user post. After scoring, summaries are extracted by using a ranking approach or concept-based method formulated in the form of Integer Linear Programming. To confirm the efficiency of our framework, sentence and story highlight extraction tasks were taken as a case study on three datasets in two languages, English and Vietnamese. Experimental results show that: (i) the framework can improve ROUGE-scores compared to state-of-the-art baselines of social context summarization and (ii) the combination of the two relations benefits the sentence extraction of single Web documents. PB - ACM JF - ACM Transactions on Knowledge Discovery from Data SN - 1556-4681 TI - Exploiting User Posts for Web Document Summarization AV - none ER - TY - CONF ID - SisLab4603 UR - https://www.scitepress.org/PublicationsDetail.aspx?ID=K0au0RVNUe8=&t=1 A1 - Nguyen, Minh Trang A1 - Pham, Van Long A1 - Nguyen, Chu Chien A1 - Nguyen, Van Vinh Y1 - 2021/02/10/ N2 - In this digital transformation era, the demand for automatic pattern extraction from printed materials has never been higher, making it one of the most eminent problems nowadays. In this paper, we propose a new method for pattern recognition in highly complex technical drawings. Our method is a pipeline system that includes two phases: (1) detecting the objects that contain the patterns of interest with improvements of processing large-scale image, and (2) performing character recognition on the objects if they are text patterns with improvements of post-processing task. Our experiments on nearly five thousand real technical drawings show promising results and the capability to reduce manual labeling effort to a great extent. TI - Object detection and text recognition in large-scale technical drawings SP - 612 AV - public EP - 619 T2 - ICPRAM 2021 ER - TY - CONF ID - SisLab3511 UR - https://dl.acm.org/citation.cfm?id=3310999 A1 - Nguyen, Minh Trang A1 - Tran, Van Lien A1 - Can, Duy Cat A1 - Ha, Quang Thuy A1 - Vu, Thi Ly A1 - Chng, Eng-Siong Y1 - 2019/01/25/ N2 - For information consumers, being able to obtain a short and accurate answer for a query is one of the most desirable features. This motivation, along with the rise of deep learning, has led to a boom in open-domain Question Answering (QA) research. While the problem of machine comprehension has received multiple success with the help of large training corpora and the emergence of attention mechanism, the development of document retrieval in open-domain QA is lagged behind. In this work, we propose a novel encoding method for learning question-aware self-attentive document representations. By applying pair-wise ranking approach to these encodings, we build a Document Retriever, called QASA, which is then integrated with a machine reader to form a complete open-domain QA system. Our system is thoroughly evaluated using QUASAR-T dataset and shows surpassing results compared to other state-of-the-art methods. PB - ACM New York, NY, USA ©2019 SN - 978-1-4503-6612-0 doi>10.1145/3310986.3310999 TI - QASA: Advanced Document Retriever for Open-Domain Question Answering by Learning to Rank Question-Aware Self-Attentive Document Representations M2 - Da Lat, Vietnam AV - restricted EP - 5 T2 - The 3rd International Conference on Machine Learning and Soft Computing ER - TY - JOUR ID - SisLab1470 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1470/ IS - 3 A1 - Nguyen, Minh-Tien A1 - Nguyen, Tri Thanh Y1 - 2015/// PB - InderScience JF - International Journal of Computational Vision and Robotics (IJCVR) VL - 5 SN - 1752-914X TI - DESRM: a Disease Extraction System for Real-time Monitoring SP - 282 AV - none EP - 301 ER - TY - CONF ID - SisLab1773 UR - http://www.worldscientific.com/worldscibooks/10.1142/6267 A1 - Nguyen, Ngoc Bao A1 - Nguyen, Viet Ha Y1 - 2006/// TI - An Approach to Estimate Software Cost within a Narrow Context SP - 203 AV - none EP - 214 T2 - ICTACS 2006 ER - TY - JOUR ID - SisLab1475 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1475/ IS - 6 A1 - Nguyen, Ngoc Binh A1 - Pham, Van Huong A1 - Bui, Ngoc Hai Y1 - 2015/// PB - IEICE JF - IEICE Transactions on Information and Systems VL - E98-D SN - 0916-8532 TI - An Approach to Embedded Software Optimization Based on Reverse Engineering SP - 1166 AV - none EP - 1175 ER - TY - CONF ID - SisLab55 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/55/ A1 - Nguyen, Ngoc Binh A1 - Tran, Xuan Tu Y1 - 2010/08/16/ N2 - The talk addresses the current status of electronic design (ED) activities in Vietnam, including those in higher education and training programs and in the industry. We also give an overview of ED human resource and R&D activities in Vietnam. The talk then analyzes some challenges and issues to make some proposals and solutions to meet the needs and requirements of ICT and Electronic Industries in Vietnam, including the overseas electronic companies and manufactures and their academic-industrial collaboration with Vietnamese Institutions and Partners. TI - Needs and Challenges in Human Resource Development for Electronic Design in Vietnam M2 - Ho Chi Minh city AV - none T2 - The 2010 IEICE International Conference on Integrated Circuits Design in Vietnam (ICDV) ER - TY - INPR ID - SisLab3949 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3949/ A1 - Nguyen, Ngoc Hoa Y1 - 2019/// PB - MOST TI - Nghiên c?u, xây d?ng h? th?ng ?ánh giá, qu?n lý r?i ro và h? tr? x? lý s? c? an toàn thông tin trong chính ph? ?i?n t? AV - none ER - TY - PAT ID - SisLab4461 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4461/ IS - 1-2021-00205 A1 - Nguyen, Ngoc Hoa Y1 - 2021/04/28/ TI - Ph??ng pháp phát hi?n ?o?n mã ??c trong mã ngu?n ?ng d?ng Web s? d?ng ngôn ng? ASP EP - 29 AV - none ER - TY - PAT ID - SisLab4464 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4464/ IS - 1-2020-06834 A1 - Nguyen, Ngoc Hoa Y1 - 2021/01/29/ TI - Ph??ng pháp phát hi?n ?o?n mã ??c trong mã ngu?n ?ng d?ng Web s? d?ng ngôn ng? PHP EP - 24 AV - none ER - TY - PAT ID - SisLab4668 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4668/ IS - 1-2021-00205 A1 - Nguyen, Ngoc Hoa A1 - Du, Phuong Hanh Y1 - 2021/10// TI - Ph??ng pháp và h? th?ng phát hi?n và ng?n ch?n xâm nh?p m?ng s? d?ng lu?t và mô hình h?c sâu EP - 29 AV - none ER - TY - CONF ID - SisLab3666 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3666/ A1 - Nguyen, Ngoc Hoa A1 - Le, Viet Ha A1 - Phung, Van On A1 - Du, Phuong Hanh Y1 - 2019/12/05/ TI - Toward a Deep Learning Approach for Detecting PHP Webshell AV - none M2 - Vietnam T2 - The Tenth International Symposium on Information and Communication Technology (SoICT 2019) ER - TY - INPR ID - SisLab4006 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4006/ A1 - Nguyen, Ngoc Hoa A1 - Nguyen, Binh Minh A1 - Dao, Thanh Chung A1 - Do, Ba Lam Y1 - 2020/11// TI - Towards Blockchainizing Land Valuation Certificate Management Procedures in Vietnam AV - none T2 - 2020 14th International Conference on Computing and Communication Technologies (RIVF) ER - TY - CONF ID - SisLab2712 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2712/ A1 - Nguyen, Ngoc Khai A1 - Truong, Anh Hoang Y1 - 2017/// TI - A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs AV - none M2 - Nha Trang T2 - SoICT 2017: 8th International Symposium on Information and Communications ER - TY - JOUR ID - SisLab2969 UR - http://fit.mta.edu.vn/chuyensan/ A1 - Nguyen, Ngoc Khai A1 - Truong, Anh Hoang Y1 - 2018/// N2 - Trong nghiên c?u tr??c ?ây, chúng tôi ?ã xây d?ng m?t h? th?ng ki?u ?? tính tài nguyên t?i ?a c?n s? d?ng c?a m?t ch??ng trình giao d?ch ?a lu?ng. Tuy nhiên, tài nguyên này ???c tính toán d?a trên các tham s? là tài nguyên mà m?i giao d?ch c?n s? d?ng. Nh?ng tham s? này do ng??i l?p trình ph?i t? tính toán th? công d?a trên mã ngu?n c?a ch??ng trình. Vì v?y, k?t qu? ?ó v?n mang tính ph??ng pháp và bán t? ??ng, ch?a thu?n ti?n cho ng??i l?p trình. Trong nghiên c?u này, chúng tôi c?i ti?n h? th?ng ki?u ?? tính ???c tài nguyên t?i ?a c?n s? d?ng c?a ch??ng trình giao d?ch ?a lu?ng m?t cách hoàn toàn t? ??ng. Ng??i l?p trình không c?n th?c hi?n b??c tính toán th? công các tham s? nh? trong nghiên c?u tr??c. Tài nguyên trong nghiên c?u này ???c c? th? hóa là b? nh? log c?a các giao d?ch. ?? th?c hi?n ???c công vi?c này, ngôn ng? c?ng ?ã ???c c?i ti?n, b? sung và chúng c?ng g?n v?i ngôn ng? th?c t? h?n. PB - H?c vi?n K? thu?t Quân s? JF - Chuyên san Công ngh? thông tin và Truy?n thông (JICT) VL - 11 SN - 1859-0209 TI - H? TH?NG KI?U ?? TÍNH B? NH? LOG C?A CH??NG TRÌNH GIAO D?CH T? BI?N DÙNG CHUNG AV - public ER - TY - JOUR ID - SisLab4666 UR - https://jcsce.vnu.edu.vn/index.php/jcsce/issue/view/24 IS - 2 A1 - Nguyen, Ngoc Khai A1 - Truong, Anh Hoang A1 - Dang, Duc Hanh Y1 - 2021/// PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 37 SN - 2588-1086 TI - Estimate the memory bounds required by shared variables in software transactional memory programs SP - 1 AV - public EP - 19 ER - TY - JOUR ID - SisLab4608 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4608/ A1 - Nguyen, Ngoc Khai A1 - Truong, Anh Hoang A1 - Dang, Duc Hanh PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering SN - 2588-1086 TI - Estimate the memory bounds required by shared variables in software transactional memory programs", ID 280. AV - none ER - TY - CONF ID - SisLab1530 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1530/ A1 - Nguyen, Ngoc Khai A1 - Truong, Anh Hoang A1 - Dang, Van Hung Y1 - 2016/03/26/ N2 - We developed a type system for estimating an upper bound of memory that multi-threaded and nested transactional programs may require for their transaction logs. In our previous works, we only esti- mated the maximum number of logs that can coexist by static type and effect systems. This work extends our previous language that allows ones to specify also the size of logs in a transaction, and then develop a type system that can infer the memory bound required by the transaction logs. TI - A type system for calculating the maximum log memory used by transactional programs M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3041 UR - https://link.springer.com/chapter/10.1007%2F978-3-319-75429-1_14 A1 - Nguyen, Ngoc Khuong A1 - Le, Anh Cuong A1 - Nguyen, Viet Ha Y1 - 2018/// N2 - Neural network based sequence-to-sequence models have shown to be the effective approach for paraphrase generation. In the problem of paraphrase generation, there are some words which should be ignored in the target text generation. The current models do not pay enough attention to this problem. To overcome this limitation, in this paper we propose a new model which is a penalty coefficient attention-based Residual Long-Short-Term-Memory (PCA-RLSTM) neural network for forming an end-to-end paraphrase generation model. Extensive experiments on the two most popular corpora (PPDB and WikiAnswers) show that our proposed model?s performance is better than the state-of-the-art models for paragraph generation problem. TI - An Attention-Based Long-Short-Term-Memory Model for Paraphrase Generation SP - 166 AV - none EP - 178 T2 - IUKM 2018 ER - TY - CONF ID - SisLab3353 UR - https://www.researchgate.net/publication/328507160_A_Hierarchical_Conditional_Attention-Based_Neural_Networks_for_Paraphrase_Generation_12th_International_Conference_MIWAI_2018_Hanoi_Vietnam_November_18-20_2018_Proceedings A1 - Nguyen, Ngoc Khuong A1 - Le, Anh Cuong A1 - Nguyen, Viet Ha Y1 - 2018/11// TI - A Hierarchical Conditional Attention-Based Neural Networks for Paraphrase Generation SP - 161 M2 - Hanoi AV - none EP - 175 T2 - 2018 12th Multi-disciplinary International Conference on Artificial Intelligence (MIWAI) ER - TY - CONF ID - SisLab1534 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1534/ A1 - Nguyen, Ngoc Khuong A1 - Pham, Duc Hong A1 - Le, Anh Cuong A1 - Pham, Hong Thai Y1 - 2016/03/26/ N2 - As well know, part-of-Speech (POS) tagging is basic and central problem of natural language processing branch. Development of a POS tagger will influence several pipelined modules of natural language understanding system including information extraction and retrieval; machine translation; partial parsing and word sense disambiguation. In recent years, there has been a growing interest in data-driven machine learning disambiguation methods for POS tagging with results be very close state-of-art of this problem. Improvement performance of these methods has been posed challenges for researchers. In this paper, we use one of the best machine learning method (Maximum Entropy Model - MEM) to do automatic annotation of part-of-speech in basedline then improve accuracy by using Transformation Based Learning (TBL). Our approach based on an incremental knowledge acquisition method where rules are stored in an exception structure and new rules are only selected to correct the errors are positive on courpus. Experimental results on English Peen Treebank show that our method greatly improve accuracy than the naive baseline model with state-of-the-art accuracy(97.14%). Special, we also do experiments on Vietnamese Viet TreeBank corpus and experimental results show that the proposed Vietnamese POS tagging system outperforms the other state-of-the-art Vietnamese taggers with 93.50% overall accuracy. TI - Improving Maximum Entropy Part-of-Speech Tagger with Transformation Based Learning Model M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab787 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/787/ A1 - Nguyen, Ngoc Tuan A1 - Nguyen, Thi Nhat Thanh A1 - Le, Thanh Ha Y1 - 2013/// TI - Text Recognition Method for Trademark Images SP - 201 AV - none EP - 203 T2 - 2013: International Conference on Electronics, Information and Communication (ICEIC) ER - TY - CONF ID - SisLab3575 UR - https://link.springer.com/chapter/10.1007%2F978-3-030-30149-1_13 A1 - Nguyen, Ngoc Vu A1 - Bui, Hong Son A1 - Ha, Quang Thuy Y1 - 2019/08/17/ N2 - Semantic search helps the user queries to be understandable for electric agents searching. In this way, ontology plays the main role to define the semantic and the relations between user queries. The national database of natural resources and environment is a very large database system. Therefore, building a search engine software for the system with high accuracy and fast speed is very important for sharing information in the field of natural resources and environment. However, the existing search engine software in the national database needs to be improved to better meet user?s needs. We proposed the architecture of ontology-based semantic search for the national database of natural resources and environment. Based on the proposed architecture, we have built semantic search software (VnNRESS) to demonstrate better results than the existing search software (NRESearch). TI - Ontology-Based Semantic Search for National Database of Natural Resources and Environment M2 - Ho Chi Minh City, Vietnam AV - public T2 - 5th EAI International Conference, INISCOM 2019 ER - TY - CONF ID - SisLab4235 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4235/ A1 - Nguyen, Ngoc Vu A1 - Nguyen, Hai Chau A1 - Ha, Quang Thuy Y1 - 2019/12// N2 - Semantic search helps the user queries to be understandable for electric agents searching. In this way, ontology plays the main role to define the semantic and the relations between user queries. Ontologies provide features like a common vocabulary, reusability, machine-readable content, and also allows for semantic search, facilitate agent interaction and ordering and structuring of knowledge for the Semantic Web (Web 3.0) application. Ministry of Natural Resources and Environment is currently managing a large amount of data for 9 areas: land, mineral geology, water resources, environment, seas and islands, hydrometeorology, climate change, survey and mapping and remote sensing. Therefore, the need for data management, data integration and semantic search is essential and developing a domain ontology for natural resources and environment helps to solve these problems. In this paper, we propose a methodology for constructing a domain ontology for natural resources and environment based on integrating some existing ontologies (in English) and extending them using reliable resources in Vietnam. The ontology has been built is an important input for further researches on ontology learning, natural language processing, automated question answering and semantic search. TI - Developing a Domain Ontology for Natural Resources and Environment SP - 12 M2 - Hanoi, Vietnam AV - none EP - 13 T2 - Proceedings of 6th NAFOSTED Con- ference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab3471 UR - https://link.springer.com/chapter/10.1007%2F978-3-030-14799-0_8 A1 - Nguyen, Ngoc Vu A1 - Nguyen, Thi Lan A1 - Nguyen, Thi Cam Van A1 - Tran, Mai Vu A1 - Ha, Quang Thuy Y1 - 2019/04/08/ N2 - Lifelong Machine Learning (LML) is a continuous learning process, in which the knowledge learned from previous tasks is accumulated in the knowledge base, then the knowledge will be used to support future learning tasks, for which it may be only a few of samples exists. However, there is a little of studies on LML based on deep neural networks for Named Entity Recognition (NER), especial in Vietnamese. We propose DeepLML-NER model, a lifelong learning model based on using deep learning methods with a CRFs layer, for NER in Vietnamese text. DeepLML-NER includes an algorithm to extract the knowledge of ?prefix-features? of Named Entities in previous domains. Then the model uses the knowledge stored in the knowledge base to solve a new NER task. The effect of the model was demonstrated by in-domain and cross-domain experiments, achieving promising results. TI - A Character-Level Deep Lifelong Learning Model for Named Entity Recognition in Vietnamese Text SP - 90 M2 - Yogyakarta, Indonesia AV - none EP - 102 T2 - ACIIDS 2019: Intelligent Information and Database Systems ER - TY - JOUR ID - SisLab3590 UR - https://www.worldscientific.com/doi/abs/10.1142/S219688881950026X IS - 4 A1 - Nguyen, Ngoc Vu A1 - Nguyen, Thi Lan A1 - Nguyen, Thi Cam Van A1 - Tran, Mai Vu A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2019/10/18/ N2 - Named entity recognition (NER) is a fundamental task which affects the performance of its dependent task, e.g. machine translation. Lifelong machine learning (LML) is a continuous learning process, in which the knowledge base accumulated from previous tasks will be used to improve future learning tasks having few samples. Since there are a few studies on LML based on deep neural networks for NER, especially in Vietnamese, we propose a lifelong learning model based on deep learning with a CRFs layer, named DeepLML?NER, for NER in Vietnamese texts. DeepLML?NER includes an algorithm to extract the knowledge of ?prefix-features? of named entities in previous domains. Then the model uses the knowledge in the knowledge base to solve the current NER task. Preprocessing and model parameter tuning are also investigated to improve the performance. The effect of the model was demonstrated by in-domain and cross-domain experiments, achieving promising results. PB - Springer JF - Vietnam J. Computer Science VL - 6 SN - 2196-8888 TI - Improving Named Entity Recognition in Vietnamese Texts by a Character-Level Deep Lifelong Learning Model SP - 471 AV - none EP - 487 ER - TY - INPR ID - SisLab4175 UR - https://icatse.org/icisa2020/ A1 - Nguyen, Ngoc Vu A1 - Tran, Mai Vu A1 - Nguyen, Hai Chau A1 - Ha, Quang Thuy Y1 - 2020/12/16/ N2 - Building domain ontology is a challenging problem, and there are many different approaches for domain ontology construction. However, most of these approaches are still mainly using manual methods [1]. Ontology enrichment is a fairly standard approach in domain ontology construction, in which semi-automated methods and automated methods of ontology learning from a derived ontology. Relation extraction is one of the ways for ontology enrichment. Relation extraction techniques include law-based techniques, machine learning-based techniques with three typical methods: supervised learning, semi-supervised learning, and unsupervised learning. This paper proposes a word + character embedding-based relation extraction frame for the Vietnamese domain ontology of natural resources and environment. The model's effect was demonstrated by experiments in the domain of natural resources and the envi-ronment and achieving promising results. TI - A Word + Character Embedding based Relation Extraction Frame for Domain Ontology of Natural Resources and Environment M2 - Virtual Conference AV - public T2 - 11th International Conference on Information Science and Applications 2020 (ICISA2020) ER - TY - CONF ID - SisLab757 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/757/ A1 - Nguyen, Pham Xuan A1 - Le, Quang Hieu Y1 - 2013/10// VL - 1 TI - A New Improved Term Weighting Scheme for Text Categorization SP - 261 M2 - Hanoi, Vietnam AV - none EP - 270 T2 - 2013: The Fifth International Conference on Knowledge and Systems Engineering (KSE 2013) ER - TY - JOUR ID - SisLab1467 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1467/ IS - 3 A1 - Nguyen, Phuong Thai A1 - Le, Anh Cuong A1 - Ho, Tu Bao A1 - Nguyen, Van Hiep Y1 - 2015/// PB - Springer JF - Language Resources and Evaluation VL - 49 SN - 1574-0218 TI - Vietnamese Treebank Construction and Entropy-based Error Detection SP - 487 AV - none EP - 519 ER - TY - JOUR ID - SisLab1592 UR - http://dx.doi.org/10.1007/s10579-015-9308-5 IS - 3 A1 - Nguyen, Phuong Thai A1 - Le, Anh Cuong A1 - Ho, Tu Bao A1 - Nguyen, Van Hiep Y1 - 2015/// N2 - Treebanks, especially the Penn treebank for natural language processing (NLP) in English, play an essential role in both research into and the application of NLP. However, many languages still lack treebanks and building a treebank can be very complicated and difficult. This work has a twofold objective. Firstly, to share our results in constructing a large Vietnamese treebank (VTB) with three levels of annotation including word segmentation, part-of-speech tagging, and syntactic analysis. Major steps in the treebank construction process are described with particular regard to specific Vietnamese properties such as lack of word delimiter and isolation. Those properties make sentences highly syntactically ambiguous, and therefore it is difficult to ensure a high level of agreement among annotators. Various studies of Vietnamese syntax were employed not only to define annotations but also to systematically deal with ambiguities. Annotators were supported by automatic labelling tools, which are based on statistical machine learning methods, for sentence pre-processing and a tree editor for supporting manual annotation. As a result, an annotation agreement of around 90 % was achieved. Our second objective is to present our method for automatically finding errors and inconsistencies in treebank corpora and its application to the construction of the VTB. This method employs the Shannon entropy measure in a manner that the more reduced entropy the more corrected errors in a treebank. The method ranks error candidates by using a scoring function based on conditional entropy. Our experiments showed that this method detected high-error-density subsets of original error candidate sets, and that the corpus entropy was significantly reduced after error correction. The size of these subsets was only about one third of the whole set, while these subsets contained 80?90 % of the total errors. This method can also be applied to languages similar to Vietnamese. PB - Springer JF - Language Resources and Evaluation VL - 49 SN - 1574-0218 TI - Vietnamese treebank construction and entropy-based error detection SP - 487 AV - none EP - 519 ER - TY - JOUR ID - SisLab1184 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1184/ A1 - Nguyen, Phuong Thai A1 - Pham, Van Lam A1 - Nguyen, Hoang Trung A1 - Tran, Ngoc Anh A1 - Truong, Thi Thu Ha A1 - Nguyen, Van Hiep Y1 - 2014/// JF - T?p chí T? ?i?n h?c và Bách khoa th? TI - T?ng quan v? xây d?ng m?ng t? ti?ng Vi?t AV - none ER - TY - CONF ID - SisLab1535 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1535/ A1 - Nguyen, Quang Huy A1 - Nguyen, Van Vinh A1 - Nguyen, Phu Binh Y1 - 2016/03/26/ N2 - Gán nhãn vai ngh?a (Semantic Role Labeling - SRL) là bài toán xác ??nh vai ngh?a cho các thành ph?n trong câu, làm rõ c?u trúc, m?i quan h? gi?a v? t? và các tham ??i c?u thành câu. V? b?n ch?t, gán nhãn vai ngh?a ch? là m?t bài toán trung chuy?n, ch? không th?t s? là n?n t?ng c?a m?t ?ng d?ng x? lý ngôn ng? t? nhiên c? th? nào. Tuy nhiên, ?ây l?i là m?t b??c c?n thi?t không th? b? qua trong các ?ng d?ng liên quan ??n ngôn ng? t? nhiên. Vi?c xác ??nh ?úng vai ngh?a c?a các thành ph?n trong câu là m?t v?n ?? trung tâm c?a m?i h? x? lý ngôn ng? t? nhiên. Gán nhãn vai ngh?a th?c ch?t là m?t d?ng phân tích ng? ngh?a nông, xác ??nh và gán nhãn vai ngh?a cho các thành ph?n trong câu ??i v?i m?t v? t? c? th?, thông th??ng là ??ng t?. Trong các nghiên c?u c?a mình, chúng tôi ti?n hành ??nh ngh?a m?t s? vai ngh?a thông d?ng, xây d?ng kho ng? li?u ti?ng Vi?t có gán nhãn vai ngh?a. B??c ??u áp d?ng ph??ng pháp phân tích cú pháp ??y ?? ?? xây d?ng công c? gán nhãn vai ngh?a t? ??ng cho ti?ng Vi?t. Các th? nghi?m v?i ti?ng Vi?t cho k?t qu? t??ng ??i kh? quan và ?áng tin c?y. TI - Nghiên c?u v? gán nhãn vai ngh?a cho ti?ng Vi?t M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1464 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1464/ A1 - Nguyen, Quang Trung A1 - Bui, The Duy A1 - Ma, Thi Chau Y1 - 2015/09// N2 - Classification of speech signal is one of the most vital problems in speech perception and spoken word recognition. Although, there have been many studies on the classification of speech signals but the results are still limited. In this paper, we propose an image based approach for speech signal classification based on the combination of Local Nai?ve Bayes Nearest Neighbor (LNBNN) and Scale-invariant Feature Transform (SIFT) features. The proposed approach allows training feature vectors to have different sizes and no re-training is needed for additional training data after training phase. With this approach, achieved classification results are very satisfactory. They are 72.8, 100 and 95.0 on the ISOLET, Digits and Places databases, respectively. KW - Bayes methods;signal classification;speech recognition;transforms;vectors;ISOLET;LNBNN;SIFT features;digits;feature vectors;image based approach;local naive Bayes nearest neighbor;places databases;scale-invariant feature transform;speech perception;speech signal classification;spoken word recognition;training data;training phase;Databases;Feature extraction;Hidden Markov models;Mel frequency cepstral coefficient;Speech;Speech recognition;Training;lnbnn;sift;speech classification;speech perception TI - An Image based Approach for Speech Perception SP - 208 M2 - Ho Chi Minh city, Vietnam AV - none EP - 213 T2 - NICS: 2nd National Foundation for Science and Technology Development Conference on Information and Computer Science ER - TY - CONF ID - SisLab770 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/770/ A1 - Nguyen, Quang-Trung A1 - Pham, Ngoc Hung Y1 - 2013/// TI - An Efficient Method for Automated Control Flow Testing of Programs AV - none M2 - Phu Quoc, Vietnam T2 - 2013: 2nd International Conference on Context-Aware Systems and Applications (ICCASA 2013) ER - TY - JOUR ID - SisLab1491 UR - http://www.iospress.nl/journal/semantic-web/ A1 - Nguyen, Quoc Dat A1 - Nguyen, Quoc Dai A1 - Pham, Bao Son Y1 - 2015/// N2 - Recent years have witnessed a new trend on building ontology-based question answering systems, that is to use semantic web information to provide more precise answers to users' queries. However, these systems are mostly designed for English, therefore, we introduce in this paper such a system for Vietnamese, that is, to the best of our knowledge, the first one made for Vietnamese. Different from most of previous works, we propose an approach that systematically builds a knowledge base of grammar rules for processing each input question into an intermediate representation element. Then we take this element with respect to a target ontology by applying concept-matching techniques for returning an answer. Experimental results show that the performance of the system on a wide range of Vietnamese questions is promising with accuracies of 84.1% and 82.4% for analyzing question and retrieving answer, respectively. Furthermore, our approach to the question analysis can easily be applied to new domains and new languages, thus saving time and human effort. PB - IOS Press JF - Semantic Web Journal SN - 1570-0844 TI - Ripple Down Rules for Question Answering AV - public ER - TY - JOUR ID - SisLab2254 UR - http://dx.doi.org/10.3233/AIC-150698 IS - 3 A1 - Nguyen, Quoc Dat A1 - Nguyen, Quoc Dai A1 - Pham, Duc Dang A1 - Pham, Bao Son Y1 - 2016/// JF - AI Communications VL - 29 TI - A robust transformation-based learning approach using ripple down rules for part-of-speech tagging SP - 409 AV - none EP - 422 ER - TY - CONF ID - SisLab1423 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1423/ A1 - Nguyen, Quoc Huy A1 - Pham, Huu Bang A1 - Nguyen, Thi Nhat Thanh A1 - Pham, Van Cu A1 - Bui, Quang Hung Y1 - 2014/// VL - 2 TI - Xây d?ng h? th?ng WebGIS h? tr? qu?n lý và chia s? d? li?u ?nh vi?n thám mã ngu?n m?: Áp d?ng cho d? li?u ?nh MODIS SP - 855 AV - none EP - 863 T2 - 2014: H?i th?o ?ng d?ng GIS toàn qu?c ER - TY - CONF ID - SisLab1742 UR - http://doi.acm.org/10.1145/2833258.2833264 A1 - Nguyen, Son A1 - Vo, Hieu A1 - Pham, Ngoc Hung Y1 - 2015/// TI - A Correlation-aware Negotiation Approach for Service Composition AV - none M2 - Hue, Vietnam T2 - The 2015 Symposium on Information and Communication Technology ER - TY - CONF ID - SisLab105 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/105/ A1 - Nguyen, Son Hoang A1 - Le, Sy Vinh A1 - Le, Si Quang Y1 - 2012/08/17/ N2 - Current microarray technologies are able to assay thousands of samples over million of SNPs simultaneously. Computational approaches have been developed to analyse a huge amount of data from microarray chips to understand sophisticated human genomes. The data from microarray chips might contain errors due to bad samples or bad SNPs. In this paper, we propose a method to detect bad SNPs from the probe intensities data of Illumina Beadchips. This approach measures the difference among results determined by three software Illuminus, GenoSNP and Gencall to detect the unstable SNPs. Experiment with SNP data in chromosome 20 of Kenyan people demonstrates the usefulness of our method. This approach reduces the number of SNPs that are needed to check manually. Furthermore, it has the ability in detecting bad SNPs that have not been recognized by other criteria. KW - Accuracy;Approximation methods;Entropy;Gaussian distribution;Genomics;Humans;biology computing;cellular biophysics;genomics;lab-on-a-chip;Gencall;GenoSNP;Illumina BeadChips;Jeffreys distance;Kenyan people;bad SNP detection;chromosome;human genomes;microarray chips;probe intensities data;single nucleotide polymorphisms;software Illuminus;unstable SNP detection;SNP genotype;bad SNPs;quality control;relative entropy; TI - Detecting Bad SNPs from Illumina BeadChips Using Jeffreys Distance SP - 18 M2 - Danang, Vietnam AV - none EP - 25 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab1747 UR - http://www.ijcce.org/ IS - 4 A1 - Nguyen, Thac Huy A1 - Do, The Chuan A1 - Nguyen, Viet Anh Y1 - 2016/// N2 - The appearance of a vast array of online newspapers makes appropriate news recommendation for users become critically important. A number of researches in this area have been conducted in recent years. This paper presents the Vietnamese content-based news recommender system. Based on information about news stories that users have read and given feedback, the system can automatically determine news stories that users may want to read later. The center of the system is a hybrid user profile which can diversely model news reading features of individual users thanks to a combination of short-term and long-term information models along with self-description. The paper also introduces and evaluates a mechanism for implicit feedback. After installing the system and conducting several experiments, as well as collecting feedback from users, it is shown that the system is relatively adaptable to users and can recommend appropriate news with a high degree of accuracy, which significantly increases the effectiveness of gathering information compared to traditional news reading. JF - International Journal of Computer and Communication Engineering VL - 5 SN - 2010-3743 TI - Implicit Feedback Mechanism to Manage User Profile Applied in Vietnamese News Recommender System SP - 276 AV - public EP - 285 ER - TY - RPRT ID - SisLab3281 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3281/ A1 - Nguyen, Thanh Cong A1 - Nguyen, Dinh Tuan A1 - Tran, Quoc Long Y1 - 2018/// N2 - An identity card is a type of identify documents of each Vietnamese citizen to prove his/her identity. In this modern information technology era, automatically extracting information from identity cards is applied in telecommunications, healthcare, hotels, and more. This report works on the use of computer vision techniques to build a system which extracts information from identity cards. There are three main steps: Identifying identity cards, locating information and extracting information. In particular, identifying indentity cards and locating information are accomplished by basic image processing techniques to increase the speed of the entire system. At the information extraction step, the achievements in text recognition on complex background are used to increase accuracy. After development and experimentation, the system has achieved a relatively high degree of accuracy. The accuracy of the whole system is 95.28%, which makes it possible to be put into practice PB - VNU University of Engineering and Technology M1 - technical_report TI - INFORMATION EXTRACTION FROM ID CARD VIA COMPUTER VISION TECHNIQUES AV - public EP - 0 ER - TY - JOUR ID - SisLab4333 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4333/ A1 - Nguyen, Thanh Cong A1 - Yuris Mulya, Saputra A1 - Huynh, Van Nguyen A1 - Nguyen, Ngoc Tan A1 - Tran, Viet Khoa A1 - Bui Minh, Tuan A1 - Diep, Nguyen A1 - Dinh, Thai Hoang A1 - Vu, Xuan Thang A1 - Eryk, Dutkiewicz A1 - Symeon, Chatzinotas A1 - Bjorn, Ottersten N2 - This two-part paper aims to provide a comprehensive survey on how emerging technologies, e.g., wireless and networking, artificial intelligence (AI) can enable, encourage, and even enforce social distancing practice. In Part I, an extensive background of social distancing is provided, and enabling wireless technologies are thoroughly surveyed. In this Part II, emerging technologies such as machine learning, computer vision, thermal, ultrasound, etc., are introduced. These technologies open many new solutions and directions to deal with problems in social distancing, e.g., symptom prediction, detection and monitoring quarantined people, and contact tracing. Finally, we discuss open issues and challenges (e.g., privacy-preserving, scheduling, and incentive mechanisms) in implementing social distancing in practice. As an example, instead of reacting with ad-hoc responses to COVID-19-like pandemics in the future, smart infrastructures (e.g., next-generation wireless systems like 6G, smart home/building, smart city, intelligent transportation systems) should incorporate a pandemic mode in their standard architectures/designs. PB - IEEE JF - IEEE Access SN - 2169-3536 TI - A Comprehensive Survey of Enabling and Emerging Technologies for Social Distancing??Part II: Emerging Technologies and Open Issues AV - public ER - TY - JOUR ID - SisLab4332 UR - https://ieeexplore.ieee.org/abstract/document/9172058/ A1 - Nguyen, Thanh Cong A1 - Yuris Mulya, Saputra A1 - Nguyen, Ngoc Tan A1 - Tran, Viet Khoa A1 - Bui, Minh Tuan A1 - Diep, Nguyen A1 - Dinh, Thai Hoang A1 - Vu, Xuan Thang A1 - Eryk, Dutkiewicz A1 - Symeon, Chatzinotas A1 - Bjorn, Ottersten Y1 - 2020/09/01/ N2 - Social distancing plays a pivotal role in preventing the spread of viral diseases illnesses such as COVID-19. By minimizing the close physical contact among people, we can reduce the chances of catching the virus and spreading it across the community. This two-part paper aims to provide a comprehensive survey on how emerging technologies, e.g., wireless and networking, artificial intelligence (AI) can enable, encourage, and even enforce social distancing practice. In this Part I, we provide a comprehensive background of social distancing including basic concepts, measurements, models, and propose various practical social distancing scenarios. We then discuss enabling wireless technologies which are especially effectin social distancing, e.g., symptom prediction, detection and monitoring quarantined people, and contact tracing. The companion paper Part II surveys other emerging and related technologies, such as machine learning, computer vision, thermal, ultrasound, etc., and discusses open issues and challenges (e.g., privacypreserving, scheduling, and incentive mechanisms) in implementing social distancing in practice. PB - IEEE JF - IEEE Access VL - 8 SN - 2169-3536 TI - A Comprehensive Survey of Enabling and Emerging Technologies for Social Distancing?Part I: Fundamentals and Enabling Technologies SP - 153479 AV - public EP - 153507 ER - TY - RPRT ID - SisLab3200 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3200/ A1 - Nguyen, Thanh Ngan A1 - Nguyen, Minh Trang A1 - Dang, Thanh Hai Y1 - 2018/// PB - VNU University of Engineering and Technology VL - UET-FIT-2018xyz M1 - technical_report TI - Disease Named Entity Normalization Using Pairwise Learning To Rank and Deep Learning AV - public ER - TY - JOUR ID - SisLab3161 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3161/ A1 - Nguyen, Thanh Thuy A1 - Ha, Quang Thuy A1 - Phan, Xuan Hieu A1 - Nguyen, Tri Thanh Y1 - 2018/// N2 - Trí tu? nhân t?o hi?n ?ang phát tri?n v?i t?c ?? ?hàm m??, có nhi?u ?óng góp quan tr?ng vào s?n xu?t, kinh doanh, d?ch v? và ??i s?ng con ng??i. Tuy nhiên, Trí tu? nhân t?o là m?t l?nh v?c r?t ph?c t?p và c?ng t?o ra nhi?u thách th?c r?t ?áng lo ng?i. Hi?u bi?t ?úng v? Trí tu? nhân t?o ?? n?m b?t ?úng và k?p th?i các c? h?i và thách th?c t? Trí tu? nhân t?o là r?t c?n thi?t ??i v?i m?i con ng??i, m?i t? ch?c và m?i qu?c gia. Bài vi?t này cung c?p m?t khái quát chung v? Trí tu? nhân t?o, s? phát tri?n v??t b?c c?a Trí tu? nhân t?o trong th?i ??i s? và các thách th?c l?n t? Trí tu? nhân t?o. Bài vi?t c?ng ?? c?p t?i tình hình nghiên c?u, tri?n khai Trí tu? nhân t?o t?i Vi?t Nam. Trên c? s? kh?o sát n?i dung c? b?n các chi?n l??c phát tri?n Trí tu? nhân t?o qu?c gia c?a m?t s? n??c trên th? gi?i, chúng tôi có m?t vài trao ??i v? chi?n l??c phát tri?n Trí tu? nhân t?o qu?c gia c?a Vi?t Nam. Xây d?ng và th?c hi?n thành công chi?n l??c phát tri?n Trí tu? nhân t?o qu?c gia s? góp ph?n t?o ??ng l?c cho s? nghi?p phát tri?n kinh t? - xã h?i c?a Vi?t Nam. JF - T?p chí Công Th??ng - Các k?t qu? nghiên c?u khoa h?c và ?ng d?ng công ngh? SN - 0866-7756 TI - Trí tu? nhân t?o trong th?i ??i s?: B?i c?nh th? gi?i và liên h? v?i Vi?t Nam AV - public ER - TY - JOUR ID - SisLab3697 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3697/ IS - 3-4 A1 - Nguyen, Thanh Trung A1 - Trinh, Dinh Hoan A1 - Nguyen, Linh Trung A1 - Marie, Luong Y1 - 2019/12/01/ N2 - X-ray computed tomography (CT) is now a widely used imaging modality for numerous medical purposes. The risk of high X-ray radiation may induce genetic, cancerous and other diseases, demanding the development of new image processing methods that are able to enhance the quality of low-dose CT images. However, lowering the radiation dose increases the noise in acquired images and hence affects important diagnostic information. This paper contributes an efficient denoising method for low-dose CT images. A noisy image is decomposed into three component images of low, medium and high frequency bands; noise is mainly presented in the medium and high component images. Then, by exploiting the fact that a small image patch of the noisy image can be approximated by a linear combination of several elements in a given dictionary of noise-free image patches generated from noise-free images taken at nearly the same position with the noisy image, noise in these medium and high component images are effectively eliminated. Specifically, we give new solutions for image decomposition to easily control the filter parameters, for dictionary construction to improve the effectiveness and reduce the running-time. Instead of using a large dataset of patches, only a structured small part of patches extracted from the raw data is used to form a dictionary, to be used in sparse coding. In addition, we illustrate the effectiveness of the proposed method in preserving image details which are subtle but clinically important. Experimental results conducted on both synthetic and real noise data demonstrate that the proposed method is competitive with the state-of-the-art methods. PB - REV JF - REV Journal on Electronics and Communications VL - 9 SN - 1859-387X TI - Low-dose CT image denoising using image decomposition and sparse representation SP - 78 AV - none EP - 88 ER - TY - CHAP CY - Berlin ID - SisLab2374 UR - http://link.springer.com/book/10.1007/978-3-642-36642-0/page/1 A1 - Nguyen, Thanh Tung A1 - Nguyen, Van Duc A1 - Nguyen, Hai Thanh A1 - Phan, Cong Vinh A1 - Nguyen, Dai Tho N2 - Sensor networks are deployed in numerous military and civil applications, such as remote target detection, weather monitoring, weather forecast, natural resource exploration and disaster management. Despite having many potential applications, wireless sensor networks still face a number of challenges due to their particular characteristics that other wireless networks, like cellular networks or mobile ad hoc networks do not have. The most difficult challenge of the design of wireless sensor networks is the limited energy resource of the battery of the sensors. This limited resource restricts the operational time that wireless sensor networks can function in their applications. Routing protocols play a major part in the energy efficiency of wireless sensor networks because data communication dissipates most of the energy resource of the networks. In many situations, a base station only needs a summary of the gathered information. For example, the base station might only require the maximum temperature of all sub-regions, each covered by a sensor or the average temperature of all sensors in the network. For similar types of application, data aggregation can be applied at all sensor nodes before the data is forwarded to the base station. The above discussions imply a new family of protocols called chain-based protocols. In the protocols, all sensor nodes sense and gather data in an energy efficient manner by cooperating with their closest neighbors. The gathering process can be done until an elected node calculates the final data and sends the data to the base station. M1 - 109 TI - Power Save Protocol Using Chain Based Routing AV - public EP - 191 Y1 - 2013/// PB - Springer T3 - Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering SN - 978-3-642-36641-3 SP - 183 T2 - Proceedings of the International Conference on Context-Aware Systems and Applications (ICCASA 2012), ER - TY - CONF ID - SisLab1977 UR - http://doi.org/10.1109/CCE.2016.7562605 A1 - Nguyen, ThanhDat A1 - Kifor, Claudiu Vasile A1 - Nguyen, Hoai Son Y1 - 2016/// N2 - DHT (Distributed Hash Table) such as CHORD or PARTRY facilitates information searching in scalable systems. Two popular DHT-based approaches for range or multi-attribute search are to rely on attribute-value tree and a combination of attributes and values. However, tradeoff between a load balancing mechanism and query efficiency is a challenging task for such information searching systems. In this paper, we propose improved algorithms for a system called DSMAV in which information resources are distributed fairly among nodes and found based on multi-attribute queries in a small number of hop counts. Our system creates identifiers from resource names, each of which is a combination of attribute-value pairs (AV pairs). In order to overcome problem of load imbalance among nodes because of frequent appearance of AV pairs in many resource names, we control the quantity of information resources distributed to a node based on load capacity of each node. Moreover, periodical updating processes on a node enable our load balancing mechanism to be maintained accurately. As a result, our improvement evaluated by simulated results depicts a good degree of load balance as well as query efficiency. TI - DSMAV: An improved solution for multi-attribute search based on load capacities SP - 7 M2 - Ha Long, Vietnam AV - public EP - 12 T2 - 6th IEEE International Conference on Communications and Electronics (ICCE) ER - TY - CONF ID - SisLab3526 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3526/ A1 - Nguyen, Thao A1 - Le, Sy Vinh Y1 - 2019/// N2 - Building ancestral recombination graphs (ARG) with minimum number of recombination events for large datasets is a challenging problem. We have proposed ARG4WG and REARG heuristic algorithm for constructing ARGs with thousands of whole genome sequences. However, these algorithms do not result in ARGs with minimal number of recombination events. In this work, we propose GAMARG algorithm, an improvement of ARG4WG, to optimize the number of recombination events in ARG building process. Experiment with different datasets showed that GAMARG algorithm outperforms other heuristic algorithms in building ARGs for large datasets. It also is much better than other heuristic algorithms and comparable to exhaustive search methods for small datasets. TI - A Hybrid Approach to Optimize the Number of Recombinations in Ancestral Recombination Graphs SP - 36 AV - public EP - 42 T2 - ICBBB ER - TY - INPR ID - SisLab2071 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2071/ A1 - Nguyen, Thao A1 - Le, Sy Vinh A1 - Ho, Hai A1 - Le, Si Quang Y1 - 2016/// N2 - Abstract? The Ancestral Recombination Graph (ARG) plays an important role in human population genetics. Nevertheless, most current ARG inference algorithms are only applicable to small data sets due to their computational burden. Margarita by Minichiello and Durbin [1] can handle larger data sets; however, it is still not feasible at genome scale. We hereby propose a heuristic algorithm, called ARG4WG, to construct plausible ARGs from thousands of whole chromosome samples, in which the so-called longest shared end, i.e. the longest match between left or right ends of sequences, is used for recombination in the building process. This strategy allows ARG4WG to significantly reduce the computational cost, by working hundreds to thousands times faster than Margarita. ARG4WG leads to ARGs with fewer numbers of recombination events on real data sets. Margarita is slightly better than ARG4WG in reconstructing tree topology on simulated data. The ARGs resulted from our algorithm also performed reasonably well in an association study with 5560 haplotypes across a whole Chromosome 11 of the Gambia dataset. These results indicate that ARG4WG is a good candidate for genome-wide association study from large data sets. PB - IEEE JF - IEEE/ACM Transactions on Computational Biology and Bioinformatics SN - 1545-5963 TI - Building ancestral recombination graphs for whole genomes AV - none ER - TY - INPR ID - SisLab3745 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3745/ A1 - Nguyen, The Hoang Anh A1 - Bui, Quyen A1 - Nguyen, Truong Thang A1 - Le, Thanh Ha Y1 - 2019/// JF - Journal of Informatics and Mathematical Sciences TI - A Robust PCA-SURE Thresholding Deep Neural Network Approach for Mental Task Brain Computer Interface AV - none ER - TY - JOUR ID - SisLab4176 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4176/ A1 - Nguyen, The Hoang Anh A1 - Bui, The Duy A1 - Le, Thanh Ha Y1 - 2020/// JF - Neural Computing and Applications TI - A Deep Wavelet Sparse Autoencoder Method for Online and Automatic Electrooculographical Artifact Removal AV - none ER - TY - CONF ID - SisLab3743 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3743/ A1 - Nguyen, The Hoang Anh A1 - Do, Anh Tuan A1 - Le, Thanh Ha A1 - Bui, The Duy Y1 - 2019/// TI - A deep sparse autoencoder method for automatic EOG artifact removal AV - none T2 - Control, Automation and Systems (ICCAS), 2019 19th International Conference on ER - TY - CONF ID - SisLab3744 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3744/ A1 - Nguyen, The Hoang Anh A1 - Le, Thanh Ha A1 - Bui, The Duy Y1 - 2019/// TI - A Stacking Ensemble Learning Model for Mental State Recognition towards Implementation of Brain Computer Interface AV - none T2 - In Proceedings of 6th NAFOSTED Conference on Information and Computer Science (NICS), 2019 ER - TY - JOUR ID - SisLab2797 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2797/ A1 - Nguyen, The Hung A1 - Hoang, Xuan Huan A1 - Nguyen, P. Nam A1 - Nguyen, Vu Tam A1 - Dinh, Ngoc Thang Y1 - 2017/03/01/ N2 - In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network?s structure and function under unexpected structural perturbations of nodes and edges removal. Speci?cally, we want to identify vital nodes and edges whose failure (either random or intentional) will break the most number of connected triples(or triangles)in the network. This problem is extremely important, because connected triples form the foundation of strong connections in many real-world systems, such as mutual relationships in social networks, reliable data transmission in communication networks, and stable routing strategies in mobile networks. Disconnected triples, analog to broken mutual connections, can greatly affect the network?s structure and disrupt its normal function, which can further lead to the corruption of the entire system. The analysis of such crucial elements will shed light on key factors behind the resilience and robustness of many complex systems in practice. We formulate the analysis under multiple optimization problems and show their intractability. We next propose ef?cient approximation algorithms, namely, DAK-n and DAK-e, which guarantee an (1 ? 1/e)-approximate ratio (compared with the overall optimal solutions) while having the same time complexity as the best triangle counting and listing algorithm on power-lawnetworks.Thisadvantagemakes ouralgorithmsscaleextremelywellevenforverylargenetworks.Inanapplicationperspective,we perform comprehensive experiments on real social traces with millions of nodes and billions of edges. Empirical results indicate that our approaches achieve comparably better solution quality while are up to 100×faster than the current state-of-the-art methods. JF - IEEE Access VL - 5 SN - ISSN: 2169-3536 TI - Transitivity Demolition and the Fall of Social Networks SP - 15913 AV - public EP - 15926 ER - TY - CONF ID - SisLab1492 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1492/ A1 - Nguyen, The Huy A1 - Nguyen, Duc Thinh A1 - Nguyen, Nam Phong A1 - Phung, Nguyen Ngoc A1 - Truong, Anh Hoang Y1 - 2016/04/29/ TI - Meboo-the health & medical services management application AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab3219 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3219/ A1 - Nguyen, Thi Anh Dao A1 - Le, Trung Thanh A1 - Nguyen, Linh Trung A1 - Le, Vu Ha Y1 - 2018/11/24/ TI - Nonnegative Tensor Decomposition for EEG Epileptic Spike Detection AV - none M2 - Ho Chi Minh city, Vietnam T2 - 2018 The 5th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - INPR ID - SisLab3696 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3696/ A1 - Nguyen, Thi Anh Dao A1 - Le, Trung Thanh A1 - Nguyen, Viet Dung A1 - Nguyen, Linh Trung A1 - Le, Vu Ha Y1 - 2019/12/01/ N2 - Epilepsy is one of the most common and severe brain disorders. Electroencephalogram (EEG) is widely used in epilepsy diagnosis and treatment, with it the epileptic spikes can be observed. Tensor decomposition-based feature extraction has been proposed to facilitate automatic detection of EEG epileptic spikes. However, tensor decomposition may still result in a large number of features which are considered negligible in determining expected output performance. We proposed a new feature selection method that combines the Fisher score and p-value feature selection methods to rank the features by using the longest common sequences (LCS) to separate epileptic and non-epileptic spikes. The proposed method significantly outperformed several state-of-the-art feature selection methods. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering SN - 2588-1086 TI - New feature selection method for multi-channel EEG epileptic spike detection system AV - none ER - TY - CONF ID - SisLab4043 UR - http://dx.doi.org/10.1007/978-3-030-41964-6_50 A1 - Nguyen, Thi Cham A1 - Pham, Thi Ngan A1 - Nguyen, Minh Chau A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2020/03/04/ N2 - In lifelong machine learning, the determination of the hypotheses related to the current task is very meaningful thanks to the reduction of the space to look for the knowledge patterns supporting for solving the current task. However, there are few studies for this problem. In this paper, we propose the definitions for measuring the ?close domains to the current domain?, and a lifelong sentiment classification method based on using the close domains for topic modeling the current domain. Experimental results on sentiment datasets of product reviews from Amazon.com show the promising performance of system and the effectiveness of our approach. VL - 12033 SN - 0302-9743 TI - A Lifelong Sentiment Classification Framework Based on a Close Domain Lifelong Topic Modeling Method SP - 575 M2 - Phuket, Thailand AV - none EP - 585 T2 - Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab3151 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3151/ A1 - Nguyen, Thi Hanh A1 - Dang, Duc Hanh Y1 - 2018/// TI - An Approach for Testing Model Transformations SP - 264 M2 - Vietnam AV - none EP - 269 T2 - The 2018 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab3578 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3578/ A1 - Nguyen, Thi Hanh A1 - Dang, Duc Hanh A1 - Nguyen, Quang Trung Y1 - 2019/// N2 - Quality model transformations play a key role in the successful realization of Model Driven Engineering in practice. In the relational model transformations, rule dependency relations directly impact quality properties such as correctness, completeness, and information preservation. The analysis of rule dependencies from the declarative specification is expected to bring advantages for testing transformation properties. In this paper, we proposed a black-box approach for testing relational model transformations based on the analysis of the declarative specification using Triple Graph Grammar (TGG) rules. We exploit declarative TGG rules to capture the rule dependencies. Then, rule dependencies are combined together using the t-way testing technique to create test case descriptions. We transform patterns representing the input test condition and the oracle function of a test case description into OCL (Object Constraint Language) constraints to facilitate automatically generating input test models by solving constraints and querying interesting properties on the output models. TI - On Analyzing Rule-Dependencies to Generate Test Cases for Model Transformations M2 - Vietnam AV - none T2 - KSE: the 2019 International Conference on Knowledge and Systems Engineering ER - TY - JOUR ID - SisLab1861 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1861/ A1 - Nguyen, Thi Hau A1 - Berry, Vincent A1 - Ranwez, Vincent A1 - Scornavacca, Celine Y1 - 2013/10// N2 - The genome content of extant species is derived from that of ancestral genomes, distorted by evolutionary events such as gene duplications, transfers and losses. Reconciliation methods aim at recovering such events and at localizing them in the species history, by comparing gene family trees to species trees. These methods play an important role in studying genome evolution as well as in inferring orthology relationships. A major issue with reconciliation methods is that the reliability of predicted evolutionary events may be questioned for various reasons: Firstly, there may be multiple equally optimal reconciliations for a given species tree?gene tree pair. Secondly, reconciliation methods can be misled by inaccurate gene or species trees. Thirdly, predicted events may fluctuate with method parameters such as the cost or rate of elementary events. For all of these reasons, confidence values for predicted evolutionary events are sorely needed. It was recently suggested that the frequency of each event in the set of all optimal reconciliations could be used as a support measure. We put this proposition to the test here and also consider a variant where the support measure is obtained by additionally accounting for suboptimal reconciliations. Experiments on simulated data show the relevance of event supports computed by both methods, while resorting to suboptimal sampling was shown to be more effective. Unfortunately, we also show that, unlike the majority-rule consensus tree for phylogenies, there is no guarantee that a single reconciliation can contain all events having above 50% support. In this paper, we detail how to rely on the reconciliation graph to efficiently identify the median reconciliation. Such median reconciliation can be found in polynomial time within the potentially exponential set of most parsimonious reconciliations. JF - PLOS ONE SN - 1932-6203 TI - Support Measures to Estimate the Reliability of Evolutionary Events Predicted by Reconciliation Methods AV - none ER - TY - JOUR ID - SisLab1858 UR - http://doi.org/10.1007/978-3-642-33122-0_10 A1 - Nguyen, Thi Hau A1 - Doyon, Jean-Philippe A1 - Pointet, Stéphanie A1 - Arigon Chifolleau, Anne-Muriel A1 - Ranwez, Vincent A1 - Berry, Vincent Y1 - 2012/// N2 - We propose a reconciliation heuristic accounting for gene duplications, losses and horizontal transfers that specifically takes into account the uncertainties in the gene tree. Rearrangements are tried for gene tree edges that are weakly supported, and are accepted whenever they improve the reconciliation cost. We prove useful properties on the dynamic programming matrix used to compute reconciliations, which allows to speed-up the tree space exploration when rearrangements are generated by Nearest Neighbor Interchanges (NNI) edit operations. Experimental results on simulated and real data confirm that running times are greatly reduced when considering the above-mentioned optimization in comparison to the naïve rearrangement procedure. Results also show that gene trees modified by such NNI rearrangements are closer to the correct (simulated) trees and lead to more correct event predictions on average. The program is available at http://www.atgc-montpellier.fr/ Mowgli/ JF - Lecture Notes in Computer Science VL - 7534 SN - 0302-9743 TI - Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference SP - 123 AV - none EP - 134 ER - TY - JOUR ID - SisLab3928 UR - https://www.mdpi.com/2079-9292/9/2/217 IS - 2 A1 - Nguyen, Thi Hau A1 - Lu, Dang Nhac A1 - Nguyen, Duc Nhan A1 - Nguyen, Ha Nam Y1 - 2020/01/27/ N2 - In this work, we present a novel method, namely dynamic basic activity sequence matching (DAS), a combination of machine learning methods and flexible threshold based methods for distinguishing normal and abnormal driving patterns. Indeed, DAS relies on the activity detection module (ADM) presented in our previous work to analyze each driving pattern as a sequence of basic activities?stopping (S), going straight (G), turning left (L), and turning right (R). In fact, the threshold value and other parameters like the duration of long and short activities are iteratively induced from the collected dataset. Hence, DAS is flexible and independent of driving contexts such as vehicle modes and road conditions. Experimental results, on the dataset collected from numerous motorcyclists, show the outperformance of our proposed method against dynamic time warping and the two popular machine learning methods?random forest and neural network?in distinguishing the normal and abnormal driving patterns. Moreover, we propose an efficient framework composing of two phases: in the first phase, the normal and abnormal driving patterns are distinguished by relying on DAS. In the second phase, the detected abnormal patterns are further classified into various specific abnormal driving patterns?weaving, sudden braking, etc. This fusion framework again achieves the highest overall accuracy of 97.94%. PB - MDPI JF - Electronics VL - 9 TI - Dynamic Basic Activity Sequence Matching Method in Abnormal Driving Pattern Detection Using Smartphone Sensors AV - none ER - TY - JOUR ID - SisLab1859 UR - http://doi.org/10.1186/1748-7188-8-12 IS - 1 A1 - Nguyen, Thi Hau A1 - Ranwez, Vincent A1 - Pointet, Stéphanie A1 - Chifolleau, Anne-Muriel A1 - Doyon, Jean-Philippe A1 - Berry, Vincent Y1 - 2013/// N2 - Reconciliation methods compare gene trees and species trees to recover evolutionary events such as duplications, transfers and losses explaining the history and composition of genomes. It is well-known that gene trees inferred from molecular sequences can be partly erroneous due to incorrect sequence alignments as well as phylogenetic reconstruction artifacts such as long branch attraction. In practice, this leads reconciliation methods to overestimate the number of evolutionary events. Several methods have been proposed to circumvent this problem, by collapsing the unsupported edges and then resolving the obtained multifurcating nodes, or by directly rearranging the binary gene trees. Yet these methods have been defined for models of evolution accounting only for duplications and losses, i.e. can not be applied to handle prokaryotic gene families. Results We propose a reconciliation method accounting for gene duplications, losses and horizontal transfers, that specifically takes into account the uncertainties in gene trees by rearranging their weakly supported edges. Rearrangements are performed on edges having a low confidence value, and are accepted whenever they improve the reconciliation cost. We prove useful properties on the dynamic programming matrix used to compute reconciliations, which allows to speed-up the tree space exploration when rearrangements are generated by Nearest Neighbor Interchanges (NNI) edit operations. Experiments on synthetic data show that gene trees modified by such NNI rearrangements are closer to the correct simulated trees and lead to better event predictions on average. Experiments on real data demonstrate that the proposed method leads to a decrease in the reconciliation cost and the number of inferred events. Finally on a dataset of 30 k?gene families, this reconciliation method shows a ranking of prokaryotic phyla by transfer rates identical to that proposed by a different approach dedicated to transfer detection [BMCBIOINF 11:324, 2010, PNAS 109(13):4962?4967, 2012]. Conclusions Prokaryotic gene trees can now be reconciled with their species phylogeny while accounting for the uncertainty of the gene tree. More accurate and more precise reconciliations are obtained with respect to previous parsimony algorithms not accounting for such uncertainties [LNCS 6398:93?108, 2010, BIOINF 28(12): i283?i291, 2012]. A software implementing the method is freely available at http://www.atgc-montpellier.fr/Mowgli/. JF - Algorithms for Molecular Biology VL - 8 SN - 1748-7188 TI - Reconciliation and local gene tree rearrangement can be of mutual profit SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab2596 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2596/ A1 - Nguyen, Thi Hoai Thu A1 - Le, Trung Thanh A1 - Chu, Thi Phuong Dung A1 - Nguyen, Linh Trung A1 - Le, Vu Ha Y1 - 2017/10/18/ N2 - Bike sharing systems (BSSs) have become common in many cities worldwide, providing a new transportation mode for residents? commutes. However, the management of these systems gives rise to many problems. As the bike pick-up demands at different places are unbalanced at times, the systems have to be rebalanced frequently. Rebalancing the bike availability effectively, however, is very challenging as it demands accurate prediction for inventory target level determination. In this work, we propose two types of regression models using multi-source data to predict the hourly bike pick-up demand at cluster level: Similarity Weighted K-Nearest-Neighbor (SWK) based regression and Artificial Neural Network (ANN). SWK-based regression models learn the weights of several meteorological factors and/or taxi usage and use the correlation between consecutive time slots to predict the bike pick-up demand. The ANN is trained by using historical trip records of BSS, meteorological data, and taxi trip records. Our proposed methods are tested with real data from a New York City BSS: Citi Bike NYC. Performance comparison between SWK-based and ANN-based methods is provided. Experimental results indicate the high accuracy of ANN-based prediction for bike pick-up demand using multi-source data. TI - Multi-source Data Analysis for Bike Sharing Systems M2 - Quy Nhon, Viet Nam AV - public T2 - 2017 International Conference on Advanced Technologies for Communications (ATC) ER - TY - INPR ID - SisLab3300 UR - https://controls.papercept.net/conferences/conferences/ICARCV18/program/ICARCV18_ContentListWeb_1.html A1 - Nguyen, Thi Hong Khanh A1 - Ha, Quang Thuy Y1 - 2018/11/19/ N2 - Inconsistencies may naturally occur in the considered application domains in Artificial Intelligence, for example as a result of data mining works in distributed sources. In order to solve inconsistent knowledge, several paraconsistent description logics have been proposed. In this paper, we face the problem of concept learning for an inconsistent knowledge base system based on bisimulation. This algorithm allows learning a concept from a training information system in a paraconsistent descriptive logic system with a set of positive items, negative items, and inconsistent items. Here, we present a system for learning concept in an inconsistent knowledge base and discuss preliminary experimental results obtained in the electronic application domain. TI - A Learning Method based on Bisimulation in the Inconsistent Knowledge Systems M2 - Marina Bay Sands Expo and Convention Centre, Singapore AV - public T2 - 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV) ER - TY - CONF ID - SisLab1536 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1536/ A1 - Nguyen, Thi Hong Khanh A1 - Ha, Quang Thuy A1 - Nguyen, Anh Linh Y1 - 2016/03/26/ N2 - Working out representation methods for inconsistent knowledge is one of the most important tasks in the Knowledge Integration field. It is the representation structures, which decide the way how a knowledge system collects and processes the conflict knowledge, and thus it influences directly the ability and effectiveness of the system. One effective way to present inconsistent knowledge is using paraconsistent logics. In this paper, I present a case study of several paraconsistent logics that allow representing inconsistency and processing it. In each of these logics I will present the semantic, the proof theory and the applicability. With the aim to develop the representation of inconsistent information in a distributed system, I propose a model of paraconsistent logic for distributed system. TI - Logic-used Methods Solving Uncertainty and Inconsistency in Knowledge Intergration and Applications M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3436 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3436/ A1 - Nguyen, Thi Hong Khanh A1 - Tran, Trong Hieu A1 - Ha, Quang Thuy Y1 - 2018/11// N2 - Inconsistencies may naturally occur in the considered application domains in Arti?cial Intelligence, for example as a result of data mining works in distributed sources. In order to solve inconsistent knowledge, several paraconsistent description logics have been proposed. In this paper, we face the problem of learning concept for inconsistent knowledge base system based on bisimulation. This algorithm allows learning a concept from a training information system in paraconsistent descriptive logic system with a set of positive items, negative items and inconsistent items. Here, we present a system for learning concept in inconsistent knowledge base and discuss preliminary experimental results obtained in the electronic application domain. TI - A Learning Method based on Bisimulation in Inconsistent Knowledge Systems SP - 430 M2 - Singapore AV - none EP - 435 T2 - 15th International Conference on Control, Automation, Robotics and Vision, ICARCV 2018 ER - TY - CONF ID - SisLab2036 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2036/ A1 - Nguyen, Thi Huong Thao A1 - Vu, Huu Tien A1 - Vu, Van San A1 - Hoang, Van Xiem A1 - Le, Thanh Ha A1 - Dinh, Trieu Duong Y1 - 2016/10/12/ TI - Side information creation using adaptive block size for distributed video coding AV - none M2 - Hanoi, Vietnam T2 - the 2016 International Conference Advanced Technologies for Communications (ATC) ER - TY - CONF ID - SisLab135 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/135/ A1 - Nguyen, Thi Huong Thuy A1 - Hoang, Xuan-Huan A1 - Nguyen, Ngoc Ky Y1 - 2013/01/21/ N2 - This paper proposes a fingerprint matching method based on local Thin-Plate-Spline (TPS) deformation model, a warping technique, to deal with non-linear distorted fingerprints. After determining the set of corresponding minutiae pairs between two fingerprints by using an affine transformation, a set of corresponding pseudo-minutiae pairs are created based on their local ridge-valley structure comparison. These points are associated with the known corresponding point pairs to select a suitable landmark point set for using Local Thin Plate Spline deformation model over 9 partial areas of fingerprint images in order to find new corresponding minutiae pairs. This procedure is repeated until no more new corresponding minutiae pairs are distinguished or the number of corresponding point pairs is large enough. The experimental results on the database FVC2004 show that the proposed method significantly improves matching performance compared to the global TPS warping method. KW - Correlation;Databases;Deformable models;Fingerprint recognition;Fingers;Image matching;Nonlinear distortion;Elastic deformations;Fingerprint verification;Local deformation models;Minutiae matching;Thin-Plate-Spline models TI - An Efficient Method for Fingerprint Matching based on Local Point Model SP - 334 M2 - HoChiMinh city AV - none EP - 339 T2 - 2013 International Conference on Computing, Management and Telecommunications (ComManTel) ER - TY - JOUR ID - SisLab1474 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1474/ IS - 7 A1 - Nguyen, Thi Huyen Chau A1 - Richard, Pascal A1 - Grolleau, Emmanuel Y1 - 2015/// PB - IEEE JF - IEEE Transactions on Computers VL - 64 SN - ?0018-9340 TI - An FTPAS for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation SP - 1805 AV - none EP - 1818 ER - TY - CONF ID - SisLab774 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/774/ A1 - Nguyen, Thi Huyen Chau A1 - Tran, N.S. A1 - Le, V.H. A1 - Richard, Pascal Y1 - 2013/// TI - Approximation Scheme for Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption SP - 265 AV - none EP - 274 T2 - 2013: the 21st International conference on Real-Time Networks and Systems ER - TY - CONF ID - SisLab3474 UR - https://dl.acm.org/citation.cfm?id=3310999 A1 - Nguyen, Thi Minh Trang A1 - Tran, Van Lien A1 - Can, Duy Cat A1 - Ha, Quang Thuy A1 - Vu, Thi Ly A1 - Chng, Eng Siong Y1 - 2019/01// N2 - For information consumers, being able to obtain a short and accurate answer for a query is one of the most desirable features. This motivation, along with the rise of deep learning, has led to a boom in open-domain Question Answering (QA) research. While the problem of machine comprehension has received multiple success with the help of large training corpora and the emergence of attention mechanism, the development of document retrieval in open-domain QA is lagged behind. In this work, we propose a novel encoding method for learning question-aware self-attentive document representations. By applying pair-wise ranking approach to these encodings, we build a Document Retriever, called QASA, which is then integrated with a machine reader to form a complete open-domain QA system. Our system is thoroughly evaluated using QUASAR-T dataset and shows surpassing results compared to other state-of-the-art methods. TI - QASA: Advanced Document Retriever for Open-Domain Question Answering by Learning to Rank Question-Aware Self-Attentive Document Representations SP - 221 M2 - Da Lat, Viet Nam AV - none EP - 225 T2 - ICMLSC 2019: the 3rd International Conference on Machine Learning and Soft Computing ER - TY - CONF ID - SisLab3791 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3791/ A1 - Nguyen, Thi Ngoc Diep Y1 - 2019/10/27/ N2 - In this paper, we stage five real-world scenarios for six state-of-the-art text detection methods in order to evaluate how competent they are with new data without any training process. Moreover, this paper analyzes the architecture design of those methods to reveal the influence of pipeline choices on the detection quality. The setup of experimental studies are straight-forward: we collect and manually annotate test data, we reimplement the pretrained models of the state-of-the-art methods, then we evaluate and analyze how well each method achieve in each of our collected datasets. We found that most of the state-of-the-art methods are competent at detecting textual information in unseen data, however, some are more readily used for real-world applications. Surprisingly, we also found that the choice of a post-processing algorithm correlates strongly with the performance of the corresponding method. We expect this paper would serve as a reference for researchers as well as application developers in the field. All collected data with ground truth annotation and their detected results is publicly available at our Github repository: https://github.com/chupibk/ HBlab-rlq19. TI - State-of-the-Art in Action: Unconstrained Text Detection M2 - Seoul, Republic of Korea AV - public T2 - the IEEE Conference on Computer Vision and Pattern Recognition Workshops, Real-World Recognition from Low-Quality images and Video (RLQ@ICCV?19) ER - TY - CONF ID - SisLab4279 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4279/ A1 - Nguyen, Thi Nhan A1 - Hoang, Xuan Tung A1 - Bui, Ngoc Dung Y1 - 2020/11/15/ N2 - Di?ch vu? cha?m so?c kha?ch ha?ng tr??c tuyê?n tre?n ca?c trang web ?ang la? m??t tha?nh phâ?n quan tro?ng ?ê? duy tri? hoa?t ???ng kinh doanh tre?n mo?i tru???ng ma?ng. Ca?c h??p thoa?i nh??n tin tr??c tuyê?n ?u???c nhu?ng va?o ca?c trang web cung câ?p kha? na?ng lie?n la?c gi??a ngu???i truy c??p va? qua?n tri? vie?n trang web. Trong ba?i ba?o na?y na?y, chu?ng to?i gi?i thi??u module mei-chat xa?y d??ng b??ng ca?c co?ng ngh?? Web tie?n tiê?n nhâ?t nhu? NodeJS, AngularJS, SocketIO. Mei-chat gô?m ba tha?nh chi?nh la? meiChatCustomer, meiChatAdmin va? meiChatBackend. MeiChatBackend ?u???c xa?y d??ng b??ng Nodejs ti?ch h??p SocketIO v?i câ?u tru?c ca?n b??ng ta?i nh??m ?a?m ba?o sô? lu???ng l?n ngu???i kê?t nô?i. MeiChatAdmin cho phe?p qua?n tri? vie?n nh??n tin, xem li?ch s?? tin nh??n cu?a ngu???i truy c??p trang web. MeiChatCustomer la? h??p thoa?i tin nh??n co? thê? dê? da?ng ti?ch h??p va?o ca?c trang web, cho phe?p ngu???i truy c??p nh??n tin v?i qua?n tri? vie?n. TI - MO? HI?NH H?? THÔ?NG QUA?N TRI? TIN NH??N D??A TRE?N MODULE MEI-CHAT CHO CA?C TRANG WEB CO? SÔ? LU???NG NGU???I DU?NG L??N SP - 276 M2 - Ha noi AV - public EP - 280 T2 - H?i ngh? Khoa h?c công ngh? l?n th? XXII - Tr??ng ??i h?c Giao Thông V?n T?i ER - TY - CONF ID - SisLab1420 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1420/ A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Luong, Chinh Ke A1 - Luu, Viet Hung A1 - Pham, Van Ha A1 - Dao, Ngoc Thanh A1 - Pham, Huu Bang A1 - Man, Duc Chuc A1 - Le, Thanh Ha A1 - Nguyen, Nam Hoang A1 - Nguyen, Hai Chau A1 - Nguyen, Thanh Thuy Y1 - 2014/// N2 - Nowaday, remote sensing images have provided a large dataset with geospatial information at global scale at different resolutions, which is widely using in various domains. The usage of satellite technology for air pollution monitoring applications has been recently increasing especially to provide global-to-local distribution of aerosol and its properties for deriving Particulate Matter concentration (PM). The paper investigates aerosol retrieval for multi- resolution satellite images. After that, PM is estimated from aerosol products and meteorological parameters in order to provide dust observations at different spatial scales. A geographic information system for air pollution monitoring and warning is developed based on these research results. TI - Air Pollution Monitoring and Warning System M2 - Ha Noi, Viet Nam AV - public T2 - BESETOHA ER - TY - CONF ID - SisLab1422 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1422/ A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Luong, Chinh Ke A1 - Luu, Viet Hung A1 - Pham, Van Ha A1 - Dao, Ngoc Thanh A1 - Pham, Huu Bang A1 - Man, Duc Chuc A1 - Le, Thanh Ha A1 - Nguyen, Nam Hoang A1 - Nguyen, Hai Chau A1 - Nguyen, Thanh Thuy Y1 - 2014/// VL - 2 TI - Nghiên c?u và phát tri?n h? th?ng giám sát và c?nh báo m?c ?? ô nhi?m không khí t?i Vi?t Nam SP - 863 AV - none EP - 871 T2 - 2014: H?i th?o ?ng d?ng GIS toàn qu?c 2014 ER - TY - JOUR ID - SisLab1609 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1609/ A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Pham, Van Hung A1 - Luu, Viet Hung A1 - Chu, Duc Man Y1 - 2015/// N2 - Particulate Matter (PM) pollution is one of the most important air quality concerns in Vietnam. In this study, we integrate ground-based measurements, meteorological and satellite data to map temporal PM concentrations at a 10 × 10 km grid for the entire of Vietnam. We specifically used MODIS Aqua and Terra data and developed statistically-significant regression models to map and extend the ground-based PM concentrations. We validated our models over diverse geographic provinces i.e., North East, Red River Delta, North Central Coast and South Central Coast in Vietnam. Validation suggested good results for satellite-derived PM2.5 data compared to ground-based PM2.5 (n = 285, r2 = 0.411, RMSE = 20.299 ?g m?3 and RE = 39.789%). Further, validation of satellite-derived PM2.5 on two independent datasets for North East and South Central Coast suggested similar results (n = 40, r2 = 0.455, RMSE = 21.512 ?g m?3, RE = 45.236% and n = 45, r2 = 0.444, RMSE = 8.551 ?g m?3, RE = 46.446% respectively). Also, our satellite-derived PM2.5 maps were able to replicate seasonal and spatial trends of ground-based measurements in four different regions. Our results highlight the potential use of MODIS datasets for PM estimation at a regional scale in Vietnam. However, model limitation in capturing maximal or minimal PM2.5 peaks needs further investigations on ground data, atmospheric conditions and physical aspects. JF - Environmental Research Letters VL - 9-10 SN - ?1748-9326 TI - Particulate matter concentration mapping from MODIS satellite data: a Vietnamese case study AV - none ER - TY - CONF ID - SisLab3499 UR - https://iopscience.iop.org/article/10.1088/1755-1315/266/1/012017 A1 - Nguyen, Thi Nhat Thanh A1 - Ha, Duc Van A1 - Do, Thi Nhu Ngoc A1 - Nguyen, Van Hai A1 - Ngo, Xuan Truong A1 - Pham, Van Ha A1 - Nguyen, Ngoc Duc A1 - Bui, Quang Hung Y1 - 2019/05// N2 - Air pollution is a serious problem in Vietnam, especially in urban areas with high pressures of population, traffic, construction, and industrial development. Besides high accurate measurements from automatic and continuous monitoring ground stations and high-cost sensor devices, low-cost sensors have recently utilized to extent air pollution monitoring networks although their data quality is still argumentative. In this paper, we present a low-cost device, named FAirKit, which measured 6 basic air pollutants including PM2.5, PM10, CO, O3, NO2, and SO2, and temperature and relative humidity. The sensors are calibrated with standard devices to improve their data quality. FAirKits are installed and transferred data in real-time to servers where an information system based on Sensor Web Enablement (SWE) standard of Open Geospatial Consortium (OGC) has been developed to store, process, and visualize real-time air pollution information. Currently, the low-cost sensors network has been deploying in Hanoi, Vietnam to enhance public awareness and alert local people to air pollution. TI - Air pollution monitoring network using low-cost sensors, a case study in Hanoi, Vietnam M2 - Pan Pacific Hanoi, Vietnam AV - none T2 - 4th International Forum on Sustainable Future in Asia / 4th NIES International Forum ER - TY - INPR ID - SisLab3129 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3129/ IS - 1&2 A1 - Nguyen, Thi Nhat Thanh A1 - Le, Hoang Anh A1 - Mac, Thi Minh Tra A1 - Nguyen, Thi Trang Nhung A1 - Pham, Van Ha A1 - Bui, Quang Hung Y1 - 2018/// N2 - Vietnam is experiencing serious fine particulate matter (PM2.5) pollution as a result of local activities and long-range transport (LRT) pollutants. In this article, we summarize and analyze PM2.5 data from ground stations and manual measurements showing PM2.5 status, characteristics and emission sources in the period from 1996 to 2017 in Vietnam. In addition, we provide a brief impact assessment of PM2.5 pollution on public health regarding diseases and deaths. Conscious of PM2.5's harmful effects, Vietnam has been taking steps to mitigate PM2.5 pollution in various forms through efforts by the government, non-governmental organizations, media, communities and individuals, and has obtained initial results. This article presents a comprehensive review of current PM2.5 pollution and its mitigation in Vietnam. PB - Association of International Research Initiatives for Environmental Studies (AIRIES), Japan JF - Global Environmental Research VL - 22 SN - 1343-8808 TI - Current Status of PM2.5 Pollution and its Mitigation in Vietnam AV - none ER - TY - CHAP ID - SisLab4320 UR - http://dx.doi.org/10.1002/9781119720522.ch5 A1 - Nguyen, Thi Nhat Thanh A1 - Luu, Viet Hung A1 - Pham, Van Ha A1 - Bui, Quang Hung A1 - Nguyen, Thi Kim Oanh Y1 - 2020/// PB - ISTE Ltd 2020. Published by ISTE Ltd and John Wiley & Sons, Inc TI - Particulate Matter Concentration Mapping from Satellite Imagery SP - 103 AV - none EP - 130 T2 - TORUS 3 ? Toward an Open Resource Using Services ER - TY - JOUR ID - SisLab3798 UR - http://dx.doi.org/10.1016/j.envpol.2019.113106 A1 - Nguyen, Thi Nhat Thanh A1 - Pham, Ha V. A1 - Lasko, Kristofer A1 - Bui, Mai T. A1 - Laffly, Dominique A1 - Jourdan, Astrid A1 - Bui, Quang Hung Y1 - 2019/// N2 - Satellite observations for regional air quality assessment rely on comprehensive spatial coverage, and daily monitoring with reliable, cloud-free data quality. We investigated spatiotemporal variation and data quality of two global satellite Aerosol Optical Depth (AOD) products derived from MODIS and VIIRS imagery. AOD is considered an essential atmospheric parameter strongly related to ground Particulate Matter (PM) in Southeast Asia (SEA). We analyze seasonal variation, urban/rural area influence, and biomass burning effects on atmospheric pollution. Validation indicated a strong relationship between AERONET ground AOD and both MODIS AOD (R2?=?0.81) and VIIRS AOD (R2?=?0.68). The monthly variation of satellite AOD and AERONET AOD reflects two seasonal trends of air quality separately for mainland countries including Myanmar, Laos, Cambodia, Thailand, Vietnam, and Taiwan, Hong Kong, and for maritime countries consisting of Indonesia, Philippines, Malaysia, Brunei, Singapore, and Timor Leste. The mainland SEA has a pattern of monthly AOD variation in which AODs peak in March/April, decreasing during wet season from May?September, and increasing to the second peak in October. However, in maritime SEA, AOD concentration peaks in October. The three countries with the highest annual satellite AODs are Singapore, Hong Kong, and Vietnam. High urban population proportions in Singapore (40.7%) and Hong Kong (21.6%) were associated with high AOD concentrations as expected. AOD values in SEA urban areas were a factor of 1.4 higher than in rural areas, with respective averages of 0.477 and 0.336. The AOD values varied proportionately to the frequency of biomass burning in which both active fires and AOD peak in March/April and September/October. Peak AOD in September/October in some countries could be related to pollutant transport of Indonesia forest fires. This study analyzed satellite aerosol product quality in relation to AERONET in SEA countries and highlighted framework of air quality assessment over a large, complicated region. JF - Environmental Pollution VL - 255 SN - 0269-7491 TI - Spatiotemporal analysis of ground and satellite-based aerosol for air quality assessment in the Southeast Asia region SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab788 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/788/ A1 - Nguyen, Thi Nhat Thanh A1 - Ta, Viet Cuong A1 - Le, Thanh Ha A1 - Mantovani, Simone Y1 - 2013/10// VL - 1 TI - Particulate Matter Concentration Estimation from Satellite Aerosol and Meteorological Parametters: Data-Driven Aproaches SP - 351 M2 - Hanoi, Vietnam AV - none EP - 362 T2 - 2013: The Fifth International Conference on Knowledge and Systems Engineering (KSE 2013) ER - TY - CONF ID - SisLab1911 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1911/ A1 - Nguyen, Thi Nhat Thanh A1 - Ta, Viet Cuong A1 - Le, Thanh Ha A1 - Mantovani, Simone Y1 - 2014/// PB - Springer TI - Particulate matter concentration estimation from satellite aerosol and meteorological parameters: data-driven approaches SP - 351 M2 - Hanoi, Vietnam AV - none EP - 362 T2 - KSE: the 6th International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab3291 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3291/ A1 - Nguyen, Thi Nhung A1 - Perry, Stuart A1 - Le, Thanh Ha A1 - Nguyen, Thi Thuy Y1 - 2018/// TI - Pavement Crack Detection using Convolutional Neural Network AV - none T2 - The 9th International Symposium On Information And Communication Technology (SoICT2018) ER - TY - CONF ID - SisLab2684 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2684/ A1 - Nguyen, Thi Phuong Thao A1 - Le, Sy Vinh Y1 - 2017/11/24/ N2 - Building ancestral recombination graphs (ARGs) with the minimum number of recombination events is an essential problem in genomic population studies. Exhaustive search methods have been proposed to solve the problem with few sequences and markers. Recently, we introduced ARG4WG algorithm [1] to build plausible ARGs for whole genomes of thousand samples. However, the ARG4WG algorithm was not designed to optimize the number of recombination events. In this work, we propose a new design of the ARG4WG algorithm to optimize the number of recombination events. The key idea is to analyze and combine different criteria (i.e., the longest shared ends, the maximum similarity between sequences, and the length of sequences) to select the best candidates for recombinations. The experiments on different data sets showed that our new algorithms produced ARGs with smaller number of recombination events in comparison to other methods. The methods allow us to build minimum recombination ARGs from whole genome data sets. TI - Building minimum recombination ancestral recombination graphs for whole genomes SP - 248 M2 - Hanoi, Vietnam AV - public EP - 253 T2 - 2017 4th NAFOSTED Conference on Information and Computer Science (NICS 2017) ER - TY - CONF ID - SisLab1537 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1537/ A1 - Nguyen, Thi Phuong Thao A1 - Le, Sy Vinh A1 - Ho, Bich Hai A1 - Le, Si Quang Y1 - 2016/03/26/ N2 - Ancestral Recombination Graph (ARG) plays an important role in human population genetics. Nevertheless, most of current ARG inference algorithms are only applicable to small data sets due to their computational burden. Margarita by Minichiello and Durbin [1] can handle larger data sets; however, it is still not feasible at genome scale. We hereby propose a heuristic algorithm, called ARG4WG, to construct plausible ARGs from thousands of whole chromosome samples, in which the so-called longest shared end, i.e. the longest match between left or right ends of sequences, is used for recombination in the building process. This strategy not only allows ARG4WG to significantly reduce the computational cost, by hundreds to thousands times faster than Margarita but also leads to ARGs with fewer number of recombination events. The ARGs resulted from our algorithm also perform reasonably well in association study with 5560 haplotypes across whole chromosome 11 of Gambia dataset. These results indicate that ARG4WG is a good candidate for genome-wide association study from large data sets. TI - Building ancestral recombination graphs for whole genomes M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab4445 UR - http://rivf.net A1 - Nguyen, Thi Thu Trang A1 - Nguyen, Dai Tho A1 - Vu, Duy Loi Y1 - 2021/06/05/ N2 - Malware attacks have been among the most serious threats to cyber security in the last decade. Anti-malware software can help safeguard information systems and minimize their exposure to the malware. Most of anti-malware programs detect malware instances based on signature or pattern matching. Data mining and machine learning techniques can be used to automatically detect models and patterns behind different types of malware variants. However, traditional machine-based learning techniques such as SVM, decision trees and naive Bayes seem to be only suitable for detecting malicious code, not effective enough for complex problems such as classification. In this article, we propose a new prototype extraction method for non-traditional prototype-based machine learning classification. The prototypes are extracted using hypercuboids. Each hypercuboid covers all training data points of a malware family. Then we choose the data points nearest to the hyperplanes as the prototypes. Malware samples will be classified based on the distances to the prototypes. Experiments results show that our proposition leads to F1 score of 96.5% for classification of known malware and 97.7% for classification of unknown malware, both better than the original prototype-based classification method. KW - Malware classification KW - machine learning KW - k-nearest neighbors algorithms KW - prototype-based learning KW - hypercuboids TI - A Hypercuboid-Based Machine Learning Algorithm for Malware Classification M2 - Hanoi, Vietnam AV - public T2 - The 15th IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF 2021) ER - TY - INPR ID - SisLab3755 UR - http://jstic.ptit.edu.vn/index.php/jstic/index A1 - Nguyen, Thi Thu Trang A1 - Nguyen, Dai Tho A1 - Vu, Duy Loi Y1 - 2019/// N2 - Mã ??c ?ang là m?i ?e d?a l?n ??n an ninh c?a các h? th?ng máy tính. Vì v?y phân lo?i mã ??c ?? có nh?ng bi?n pháp ??i phó thích h?p là m?t ph?n quan tr?ng trong l?nh v?c an toàn thông tin. Trong bài báo này chúng tôi c?i ti?n gi?i thu?t trích rút ?i?m m?u trong quy trình phân lo?i m? mã ??c d?a trên ?i?m m?u ???c ?? xu?t b?i Rieck và các công s? [1]. Chúng tôi áp d?ng t? t??ng c?a hai ph??ng pháp phân lo?i d?a trên ?i?m ??c tr?ng là Dendroid [2] và ph??ng pháp ???c ?? xu?t b?i P. Shrestha và các c?ng s? [3], trích rút các ?i?m m?u trên t?ng h? mã ??c thay vì d?a trên toàn b? các h? mã ??c. Th?c nghi?m cho th?y ph??ng pháp c?a chúng tôi cho k?t qu? phân lo?i t?t v?i kh? n?ng nh?n bi?t mã ??c là 0.981% và phát hi?n mã ??c m?i là 0.988% cao h?n phiên b?n g?c c?a ph??ng pháp d?a trên ?i?m m?u [1]. PB - Posts and Telecommunications Institute of Technology JF - Journal of Science and Technology on Information and Communications SN - 2525-2224 TI - Phân tích mã ??c d?a trên các k? thu?t n-gram và h?c máy AV - public ER - TY - CONF ID - SisLab4218 UR - https://kse-conference.org/ A1 - Nguyen, Thi Thu Trang A1 - Vuong, Thi Hai Yen A1 - Tran, Van Lien A1 - Nguyen, Le Minh A1 - Phan, Xuan Hieu Y1 - 2020/11// TI - Key phrase Generation for Vietnamese Administrative Documents: A Collaborative Approach AV - none M2 - Can Tho, Vietnam T2 - The 12th IEEE International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1181 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1181/ A1 - Nguyen, Thi Xuan Huong A1 - Dang, Tran Thai A1 - Le, Anh Cuong Y1 - 2014/// TI - Adapting Vietnamese Word Segmentation for Microblogs-Style Data AV - none M2 - Nha Trang, Viet Nam T2 - 2014: The Third Asian Conference on Information Systems (ACIS 2014) ER - TY - CONF ID - SisLab447 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_49 A1 - Nguyen, Thi Xuan Huong A1 - Nguyen, The Tung A1 - Le, Anh Cuong A1 - Dang, Tran Thai Y1 - 2014/10/09/ TI - Using Large N-gram for Vietnamese Spell Checking SP - 617 M2 - Hanoi, Vietnam AV - none EP - 627 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - INPR ID - SisLab4667 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4667/ A1 - Nguyen, Thi-Hanh A1 - Dang, Duc Hanh Y1 - 2021/// TI - A Graph Analysis Based Approach for Specification-Driven Testing of Model Transformations SP - 1 AV - none EP - 6 T2 - The 8th NAFOSTED Conference on Information and Computer Science (NICS 2021) ER - TY - JOUR ID - SisLab3978 UR - http://www.jcsce.vnu.edu.vn/index.php/jcsce/article/view/236 IS - 1 A1 - Nguyen, Thi-Hau A1 - Do, Trung-Tuan A1 - Nguyen, Duc-Nhan A1 - Lu, Dang Nhac A1 - Nguyen, Ha Nam Y1 - 2020/// N2 - This paper presents a hybrid method that combines the genetic algorithm (GA) and the ant colony system algorithm (ACS), namely GACS, to solve the traffic routing problem. In the proposed framework, we use the genetic algorithm to optimize the ACS parameters in order to attain the best trips and travelling time through several novel functions to help ants to update the global and local pheromones. The GACS framework is implemented using the VANETsim package and the real city maps from the open street map project. The experimental results show that our framework achieves a considerably higher performance than A-Star and the classical ACS algorithms in terms of the length of the global best path and the time for trips. Moreover, the GACS framework is also efficient in solving the congestion problem by online monitoring the conditions of traffic light systems. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 36 SN - 2588-1086 TI - A Hybrid Method Based on Genetic Algorithm and Ant Colony System for Traffic Routing Optimization AV - none ER - TY - JOUR ID - SisLab4791 UR - https://link.springer.com/article/10.1007/s10922-022-09708-x IS - 18 A1 - Nguyen, Thi-Thuy-Lien A1 - Pham, Tuan-Minh A1 - Pham, Manh Linh Y1 - 2023/// N2 - Ensuring the high reliability of service function chains (SFCs) in Edge Computing, in which several distributed edge servers are available, is a challenging issue. Previous studies on reliable SFCs ignore the impact of physical hardware failures when multiple virtual network functions (VNFs) are deployed on the same server, resulting in inaccurate reliability estimates. In this paper, we first propose an optimization model and approximation algorithm, considering both hardware and software reliability, to maximize the reliability of SFCs in each service demand. We then develop an algorithm to increase the reliability of SFCs to a given requirement. The evaluation results show that our algorithms achieve a near-optimal solution with a significant reduction in the computational time for finding the placement of redundant VNFs. We also observe that our proposed redundancy VNF allocation can efficiently save the backup cost to achieve a given SFC reliability requirement. PB - Springer Nature JF - Journal of Network and Systems Management VL - 31 SN - 1573-7705 TI - Efficient Redundancy Allocation for Reliable Service Function Chains in Edge Computing AV - public ER - TY - JOUR ID - SisLab4619 UR - https://ieeexplore.ieee.org/document/9541004 A1 - Nguyen, Thu Trang A1 - Ngo, Kien Tuan A1 - Nguyen, Van Son A1 - Vo, Dinh Hieu N2 - Software fault localization is one of the most expensive, tedious, and time-consuming activities in program debugging. This activity becomes even much more challenging in Software Product Line (SPL) systems due to variability of failures. These unexpected behaviors are induced by variability faults which can only be exposed under some combinations of system features. The interaction among these features causes the failures of the system. Although localizing bugs in single-system engineering has been studied in-depth, variability fault localization in SPL systems still remains mostly unexplored. In this article, we present VarCop, a novel and effective variability fault localization approach. For an SPL system failed by variability bugs, VarCop isolates suspicious code statements by analyzing the overall test results of the sampled products and their source code. The isolated suspicious statements are the statements related to the interaction among the features which are necessary for the visibility of the bugs in the system. In VarCop, the suspiciousness of each isolated statement is assessed based on both the overall test results of the products containing the statement as well as the detailed results of the test cases executed by the statement in these products. On a large public dataset of buggy SPL systems, our empirical evaluation shows that VarCop significantly improves two state-of-the-art fault localization techniques by 33% and 50% in ranking the incorrect statements in the systems containing a single bug each. In about two-thirds of the cases, VarCop correctly ranks the buggy statements at the top-3 positions in the resulting lists. Moreover, for the cases containing multiple bugs, VarCop outperforms the state-of-the-art approaches 2 times and 10 times in the proportion of bugs localized at the top-1 positions. Especially, in 22% and 65% of the buggy versions, VarCop correctly ranks at least one bug in a system at the top-1 and top-5 positions. JF - IEEE Transactions on Software Engineering TI - A Variability Fault Localization Approach for Software Product Lines AV - none ER - TY - CONF ID - SisLab4083 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4083/ A1 - Nguyen, Thu Trang A1 - Nguyen, Hue A1 - Bui, Quang Cuong A1 - Pham, Ngoc Hung A1 - Vo, Dinh Hieu A1 - Takeuchi, Shigeki Y1 - 2020/11/25/ N2 - Global variables may have a significant impact on preventing programs from automatic parallelism. This paper introduces a practical approach to measure the effect of global variables on program parallelism. First, we conduct static data dependence analysis among program variables and represent such dependencies by a Variable Dependence Graph. Then, we analyze this graph for measuring and identifying which global variables have a significant impact on program parallelism. To evaluate this approach, we conduct experiments on 20 benchmark programs and an industrial application. The experimental results show that half of the studied programs contain large impact variables which may be the cause of preventing programs from parallel execution. TI - Practical approach to access the impact of global variables on program parallelism SP - 6 AV - public EP - 8 T2 - 14th International Conference on Advanced COMPuting and Applications ER - TY - JOUR ID - SisLab116 UR - http://www.worldscientific.com/doi/abs/10.1142/S0218194011005281 IS - 04 A1 - Nguyen, Thu Trang A1 - Truong, Ninh Thuan A1 - Nguyen, Viet Ha Y1 - 2011/06/01/ N2 - An object invariant consisting of a set of properties that must hold for all instances of a class at any time is usually used in object-oriented design. However, verifying object invariants at runtime is always a challenging task in software verification. This paper proposes a method for verifying invariants of Java objects at runtime using AOP. Suppose that a software application is designed using UML models and its constraints are specified in OCL expressions, the software is then implemented, by default, using the UML design. They propose to construct verifiable aspects which are automatically generated from OCL constraints. These aspects can be woven into Java code to check whether object invariants are violated at runtime. Benefiting from AOP in separation of crosscutting concerns and weaving mechanisms, generated aspects can do the verification task whenever values of objects' attributes are changed. A Verification Aspect Generator (VAG) tool has been developed allowing the automatic generation of verifying aspects from the UML/OCL constraints. Read More: http://www.worldscientific.com/doi/abs/10.1142/S0218194011005281 JF - International Journal of Software Engineering and Knowledge Engineering VL - 21 TI - Verifying Java Object Invariants at Runtime SP - 605 AV - none EP - 619 ER - TY - JOUR ID - SisLab1862 UR - http://doi.org/10.17703/IJACT.2016.4.1.28 IS - 1 A1 - Nguyen, Thu-Trang A1 - Nguyen, Thi-Hau A1 - Nguyen, Ha-Nam A1 - Nguyen, Duc-Nhan A1 - Choi, GyooSeok Y1 - 2016/// N2 - Due to the high increment in usage and built-in advanced technology of smartphones, human activity recognition relying on smartphone sensor data has become a focused research area. In order to reduce noise of collected data, most of previous studies assume that smartphones are fixed at certain positions. This strategy is impractical for real life applications. To overcome this issue, we here investigate a framework that allows detecting the status of a traveller as idle or moving regardless the position and the direction of smartphones. The application of our work is to estimate the total energy consumption of a traveller during a trip. A number of experiments have been carried out to show the effectiveness of our framework when travellers are not only walking but also using primitive vehicles like motorbikes. JF - The International Journal of Advanced Culture Technology VL - 4 SN - 2288-7202 TI - Detecting user status from smartphone sensor data SP - 28 AV - none EP - 30 ER - TY - CONF ID - SisLab790 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/790/ A1 - Nguyen, Tien Dung A1 - Nguyen, Huu Hiep Hai A1 - Le, Thanh Ha Y1 - 2013/11// TI - Trademark Image Retieval Based on Scale, Rotation, Translation Invariant Features SP - 282 M2 - Hanoi, VIETNAM AV - none EP - 285 T2 - 2013: IEEE RIVF International Conference on Computing and Communication Technologies (RIVF2013) ER - TY - CONF ID - SisLab1931 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1931/ A1 - Nguyen, Tien Dung A1 - Nguyen, Huu Hiep Hai A1 - Le, Thanh Ha Y1 - 2013/// TI - Trademark image retrieval based on scale, rotation, translation invariant features SP - 282 AV - none EP - 285 T2 - Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2013 IEEE RIVF International Conference on ER - TY - CONF ID - SisLab1303 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1303/ A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2014/// VL - 282 TI - Novel Operations for FP-tree Data Structure and Their Applications SP - 229 M2 - Budapest, Hungary AV - none EP - 242 T2 - 2014: the 2nd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA) ER - TY - CONF ID - SisLab2714 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2714/ A1 - Nguyen, Trinh Dong A1 - Truong, Anh Hoang Y1 - 2017/11// TI - A formal contract-based model for component-based real-time systems AV - none M2 - Hanoi, Vietnam T2 - 2017 4th NAFOSTED Conference on Information and Computer Science (NICS 2017) ER - TY - CONF ID - SisLab1187 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1187/ A1 - Nguyen, Trung Duc A1 - Hoang, Xuan-Huan Y1 - 2014/// PB - Nhà xu?t b?n Khoa h?c và K? thu?t TI - M?t ch? s? ?ánh giá s? c?m m?i cho thu?t toán C-means m? SP - 182 AV - none EP - 187 T2 - 2014: H?i th?o các ch? ?? ch?n l?c c?a CNTT ER - TY - CONF ID - SisLab2376 UR - http://rev-conf.org/atc2011/ A1 - Nguyen, Trung Hai A1 - Nguyen, Dai Tho Y1 - 2011/// N2 - This paper presents a novel protocol for multicasting in mobile ad-hoc networks named Spanning Tree for Multicasting (STM), which establishes and maintains the spanning tree for each multicast group using optimal control packets, without requiring any underlying unicast routing protocol or any pre-configured state of group. Based on the original idea of optimal maintenance of a spanning tree (OMST), we improve this algorithm considerably and propose our multicast protocol, as well as implement it as an extension of simulator NS-2. We compare STM with MAODV and PUMA using NS-2 through various scenarios, the results show that STM attains top packet delivery ratio, while keeping less overhead than others. As far as we know, our implementation is the very first implementation inspired by OMST in practice. TI - An Efficient and Message-Optimal Multicast Routing Protocol in Mobile Ad-Hoc Networks SP - 169 M2 - Danang City, Vietnam AV - public EP - 173 T2 - 2011 International Conference on Advanced Technologies for Communications ER - TY - CONF ID - SisLab2401 UR - http://doi.org/10.1109/RIVF.2016.7800279 A1 - Nguyen, Tuan Phong A1 - Le, Anh Cuong Y1 - 2016/11/07/ N2 - Word segmentation is the very first task for Vietnamese language processing. Word-segmented text is the input of almost other NLP tasks. This task faces some challenges due to specific characteristics of the language. As in many other Asian languages such as Japanese, Korean and Chinese, white spaces in Vietnamese are not always used as word separators and a word may contain one or more syllables. In this paper, we propose an efficient hybrid approach to detect word boundary for Vietnamese texts using logistic regression as a binary classifier combining with longest matching algorithm. First, longest matching algorithm is used to catch words that contain more than two syllables in input sentence. Next, the system utilizes the classifier to determine the boundary of 2-syllable words and proper names. Then, the predictions having low confidence conducted by the classifier are verified by a dictionary to get the final result. Our system can achieve an F-measure of 98.82% which is the most accurate result for Vietnamese word segmentation to the best of our knowledge. Moreover, the system also has a high speed. It can run word segmentation for nearly 34k tokens per second. TI - A hybrid approach to Vietnamese word segmentation SP - 114 M2 - Hanoi, Vietnam AV - none EP - 119 T2 - The 2016 IEEE RIVF International Conference on Computing and Communication Technologies ER - TY - CONF ID - SisLab1496 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1496/ A1 - Nguyen, Tuan Phong A1 - Le, Anh Cuong A1 - Le, Nguyen Khoi Y1 - 2016/04/29/ TI - A hybrid approach for Vietnamese word segmentation AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab1497 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1497/ A1 - Nguyen, Van Giap A1 - Vu, Viet Anh A1 - Le, Dinh Minh A1 - Phan, Xuan Hieu Y1 - 2016/04/29/ TI - Healthkee: a symptom checker and personalized health information service AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - RPRT ID - SisLab2781 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2781/ A1 - Nguyen, Van Nam Y1 - 2017/12// N2 - This paper surveys the fundamental software designs of high performance web servers that are widely used today for communication networks. Given the fast growing demands of the Internet and wide-ranging intranets, it is essentially to fully and deeply understand which factors that mainly a?ect the web servers and how these systems can be designed to satisfy a maximum number of requests per second from multiple users. The paper presents empirical analysis of several popular webservers including Apache,NodeJSandNginXtoprecisely?gureoutthe trade-o? of di?erent software design to tackle the performance bottleneck and resource consuming problems. PB - VNU-UET Technical Report VL - TR2017-FIT-004 M1 - technical_report TI - A comparative performance evaluation of web servers AV - public EP - 7 ER - TY - JOUR ID - SisLab1994 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1994/ IS - 2 A1 - Nguyen, Van Nam A1 - Tran, Van Cuong Y1 - 2016/// N2 - Server monitoring is really necessary because this can help administrators to track users? activities in order to improve user management ability, load balancing as well as to detect DDoS attacks. Usually, server monitoring is based on logging. However, logging system is always considered to be expensive in term of storage, data collection, data searching and analysis. In this paper, we introduce eLMS, an efficient and scalable log management system. In our system, the log files can be collected from multiple servers, stored in a scalable manner, appropriately indexed and fast analysed. eLMS acts both in online and off-line modes and provides a practical web-based monitoring interface. eLMS is based on a famous open-source core called ELK including three main modules: ElasticSearch, LogStash and Kibana. However, by using queue and streaming technique instead of uploading technique used in LogStash, eLMS is tested to be at least ten times faster than existing ELK PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 32 SN - 0866-8612 TI - An Efficient Log Management System SP - 43 AV - public EP - 48 ER - TY - CONF ID - SisLab3176 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3176/ A1 - Nguyen, Van Nhat A1 - Nguyen, Ha Thanh A1 - Vo, Dinh Hieu A1 - Nguyen, Le Minh Y1 - 2018/11/22/ N2 - With the explosion of information technology, the Internet now contains enormous amounts of data, so the role of information extraction systems becomes very important. Relation Extraction is a sub-task of Information Extraction, which focuses on classifying the relationship between the entity pairs mentioned in the text. In recent years, despite the many new methods have been introduced, Relation Extraction still receives attention from researchers for languages in general and Vietnamese in particular. Relation Extraction can be addressed in a variety of ways, including supervised learning methods, unsupervised and semi-supervised methods. Recent studies in the English language have shown that Relation Extraction using deep learning method in the supervised or semi-supervised domains is achieving optimal and superior results over traditional non-deep learning methods. However, researches in Vietnamese are few and in the process of searching documents, the results of deep learning applying for Relation Extraction in Vietnamese are not found. Therefore, the research focuses on studying and research the method of using deep learning to solve Relation Extraction task in Vietnamese. In order to solve the Relation Extraction task, the research proposes and constructs a deep learning model named Piecewise Convolution Neural Network with Word-Level Attention. TI - Relation Extraction in Vietnamese Text via Piecewise Convolution Neural Network with Word-Level Attention M2 - Ho Chi Minh city, Vietnam AV - none T2 - 2018 The 5th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab3476 UR - https://doi.org/10.1007/978-3-030-14799-0\_1 A1 - Nguyen, Van Tham A1 - Nguyen, Ngoc Thanh A1 - Tran, Trong Hieu Y1 - 2019/// TI - Algorithms for Merging Probabilistic Knowledge Bases SP - 3 M2 - Yogyakarta, Indonesia AV - none EP - 15 T2 - Intelligent Information and Database Systems - 11th Asian Conference, ACIIDS 2019, Proceedings, Part I ER - TY - CONF ID - SisLab3188 UR - https://doi.org/10.1007/978-3-319-98443-8\_4 A1 - Nguyen, Van Tham A1 - Nguyen, Ngoc Thanh A1 - Tran, Trong Hieu Y1 - 2018/// TI - Framework for Merging Probabilistic Knowledge Bases SP - 31 M2 - Bristol, UK AV - none EP - 42 T2 - 2018 10th International Conference on Computational Collective Intelligence ER - TY - JOUR ID - SisLab3670 UR - https://content.iospress.com/articles/journal-of-intelligent-and-fuzzy-systems/ifs179337 A1 - Nguyen, Van Tham A1 - Nguyen, Ngoc Thanh A1 - Tran, Trong Hieu Y1 - 2019/07// N2 - In the stages of development of probabilistic expert systems, knowledge merging is a major concern. To deal with knowledge merging problems, several approaches have been put forward. However, in the proposed models, each original probabilistic knowledge base (PKB) is represented by a set of probabilistic functions fulfilling such knowledge base. The drawbacks of the solutions are that the output of model is also a set of probabilistic functions satisfying the resulting PKB and there is no algorithm for implementing the merging process of PKBs in which each of them consists of probabilistic constraints. In this paper, distance-based approach is utilized to propose a new method of merging PKBs to ensure that both the input and output of methods are represented by sets of probabilistic constraints. To this aim, the relationship between the probability rules and the probabilistic constraints, and the several transformation methods for the representation of the original PKB are presented, a set of merging operators (MOs) is proposed, and several desirable logical properties are investigated and discussed. Several algorithms for merging PKBs are presented and the computational complexities of these algorithms are also analyzed and evaluated. PB - IOS Press JF - Journal of Intelligent & Fuzzy Systems SN - 10641246 TI - A distance-based approach for merging probabilistic knowledge bases SP - 1 AV - none EP - 14 ER - TY - JOUR ID - SisLab4288 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4288/ A1 - Nguyen, Van Tham A1 - Nguyen, Ngoc Thanh A1 - Tran, Trong Hieu N2 - The knowledge-based systems (KBSs) in general and solving the knowledge merging problem in particular have seen a great surge of research activity in recent years. However, there still exist two main shortcomings that need to be addressed in the probabilistic framework. Firstly, the current methods only deal with the problems in which original probabilistic knowledge bases (PKBs) are required to be consistent and formed in the same structure. It is a very strong requirement and difficult to apply in practice. Secondly, only a few measures of distance between probability distributions have been studied to apply in existing models. To overcome these disadvantages, in this paper, we introduce a novel framework for merging PKBs. To this end, a theoretical model is introduced and several experiments are implemented. In theoretical model, some theorems are pointed out and proved to provide mathematical background to construct the merging model. Moreover, a deep survey on how to employ divergence distance functions (DDFs) between probability distributions to carry out the merging process are performed. In experimental aspect, a consistency recovery algorithm and some merging algorithms based on DDFs are proposed. Through the results of conducted experiments, issues about the time cost of merging process, the number of iterations, and CPU Time Elapsed parameter to solve the class of optimization problems in the merging process are analyzed, compared, and evaluated. PB - Elsevier JF - Expert Systems with Applications SN - 0957-4174 TI - A model for building probabilistic knowledge-based systems using divergence distances AV - none ER - TY - JOUR ID - SisLab3192 UR - https://doi.org/10.1080/01969722.2017.1418674 IS - 5-6 A1 - Nguyen, Van Tham A1 - Nguyen, Ngoc Thanh A1 - Tran, Trong Hieu A1 - Nguyen, Do Kieu Loan Y1 - 2018/// PB - Taylor & Francis JF - Cybernetics and Systems VL - 49 TI - Method for Restoring Consistency in Probabilistic Knowledge Bases SP - 317 AV - none EP - 338 ER - TY - CONF ID - SisLab2889 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2889/ A1 - Nguyen, Van Tham A1 - Tran, Trong Hieu Y1 - 2017/// N2 - One of the major concerns in knowledge integration is inconsistencies in knowledge bases. An inconsistency measure is a tool that helps analyzing inconsistency knowledge bases and resolving inconsistencies. In recent years, a wide range of measures with desirable properties have been proposed, however, these measures often correspond to logical, or probabilistic-logical framework. In this paper, we investigate several inconsistency measures and their properties for the knowledge bases represented by probabilistic framework. PB - IEEE TI - Inconsistency measures for probabilistic knowledge bases M2 - Hue, Vietnam AV - public T2 - The 2017 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab3199 UR - https://doi.org/10.1109/KSE.2017.8119450 A1 - Nguyen, Van Tham A1 - Tran, Trong Hieu Y1 - 2017/// TI - Inconsistency measures for probabilistic knowledge bases SP - 148 M2 - Hue, Vietnam AV - none EP - 153 T2 - 9th International Conference on Knowledge and Systems Engineering ER - TY - CONF ID - SisLab3191 UR - https://doi.org/10.1007/978-3-319-75417-8\_1 A1 - Nguyen, Van Tham A1 - Tran, Trong Hieu Y1 - 2018/// TI - Solving Inconsistencies in Probabilistic Knowledge Bases via Inconsistency Measures SP - 3 M2 - Dong Hoi, Vietnam AV - none EP - 14 T2 - 2018 10th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - CONF ID - SisLab1539 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1539/ A1 - Nguyen, Van Toi A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2016/03/26/ N2 - Ngày nay, m?ng internet cung c?p cho ng??i dùng m?t l??ng l?n thông tin và tri th?c. ??c bi?t, trong nh?ng n?m g?n ?ây, s? l??ng ng??i dùng m?ng xã h?i (social network) ngày càng t?ng. B?i s? ti?n l?i, d? dàng c?a nó mà nh?ng thông tin, s? ki?n c?a th? gi?i th?c th??ng ???c ??ng t?i trên các m?ng xã h?i ngay khi nó x?y ra. Trong khi ?ó các trang tin t?c khác trên m?ng th??ng ??ng t?i các thông tin này ch?m h?n. Th?m chí, nhi?u thông tin ???c ??ng t?i trên các trang m?ng xã h?i nh?ng không ???c ??ng t?i qua các trang tin t?c khác. Tin t?c, thông tin, s? ki?n s? có giá tr? cao khi nó ???c truy?n t?i ??n ng??i dùng nhanh và chính xác. V?y làm th? nào ?? t? ??ng phát hi?n, t?p h?p nhanh các s? ki?n ?ó và tr? l?i ???c các câu h?i ?s? ki?n gì, x?y ra ? ?âu? th?i gian nào? di?n bi?n c?a s? ki?n ?ó nh? th? nào?...? cho ng??i dùng? Trong nghiên c?u này, chúng tôi mu?n xây d?ng m?t h? th?ng phát hi?n và theo dõi các s? ki?n thông qua vi?c s? d?ng d? li?u là các tin t?c (news) trên các trang m?ng, các bình lu?n (comment), các bài (post) trên m?ng xã h?i Facebook và ngôn ng? c?a các d? li?u này là ti?ng Vi?t. TI - Phát hi?n và theo dõi các s? ki?n truy?n thông xã h?i tr?c tuy?n cho ti?ng Vi?t M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1538 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1538/ A1 - Nguyen, Van Tu A1 - Le, Anh Cuong A1 - Nguyen, Ha Nam Y1 - 2016/03/26/ N2 - Phân lo?i câu h?i là m?t thành ph?n quan tr?ng trong các h? th?ng h?i ?áp t? ??ng. Nhi?m v? chính c?a phân lo?i câu h?i là d? báo ki?u th?c th? c?a câu tr? l?i c?a các câu h?i vi?t b?ng ngôn ng? t? nhiên. Phân lo?i câu h?i có th? ???c th?c hi?n b?ng các ti?p c?n khác nhau nh?: ti?p c?n d?a trên lu?t, ti?p c?n d?a trên h?c máy. Các ??c tr?ng khác nhau v? t? v?ng, cú pháp và ng? ngh?a có th? ???c trích xu?t t? ??ng t? các câu h?i ?? ph?c v? vi?c phân lo?i. Trong nghiên c?u này chúng tôi k?t h?p các ??c tr?ng v? t? v?ng, cú pháp, ng? ngh?a trong phân lo?i câu h?i. Chúng tôi ?? xu?t s? d?ng m?u câu h?i (Question pattern) nh? là m?t ??c tr?ng m?i ?? k?t h?p v?i các ??c tr?ng khác trong phân lo?i câu h?i. Chúng tôi c?ng ?? xu?t s? d?ng các t?p ??c tr?ng khác nhau cho m?i nhóm câu h?i v?i các t? ?? h?i khác nhau. Chúng tôi nh?n th?y r?ng khi s? d?ng m?u câu h?i nh? là m?t ??c tr?ng và k?t h?p v?i các ??c tr?ng t? v?ng, cú pháp, ng? ngh?a khác có th? c?i thi?n ?áng k? ?? chính xác c?a phân lo?i câu h?i. Chúng tôi ?ã ki?m tra nh?ng ?? xu?t c?a mình b?ng cách s? d?ng b? phân lo?i Support Vector Machine trên b? d? li?u TREC và ?ã ??t ???c ?? chính xác phân lo?i câu h?i cao h?n so v?i nh?ng nghiên c?u tr??c ?ó trên cùng nguyên t?c phân lo?i và t?p d? li?u. TI - Phân lo?i câu h?i s? d?ng nhi?u lo?i ??c tr?ng M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab1428 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1428/ A1 - Nguyen, Van Vuong A1 - Mai, Trong Nhuan A1 - Nguyen, Ngoc Thach A1 - Nguyen, Hai Chau A1 - Bui, Quang Hung A1 - Dao, Ngoc Thanh Y1 - 2014/// JF - T?p chí Khoa h?c, ??i h?c Qu?c gia Hà N?i TI - Khung c?u trúc h? th?ng c? s? d? li?u liên ngành ph?c v? phát tri?n b?n v?ng vùng Tây B?c, Vi?t Nam AV - none ER - TY - CONF ID - SisLab1969 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1969/ A1 - Nguyen, Van Vy A1 - Dang, Duc Hanh Y1 - 2003/// TI - A Design Pattern of the Layer Interacting with Relational Databases in Object-Oriented Systems SP - 500 M2 - Vietnam AV - none EP - 507 T2 - National Conference on Information Technology ER - TY - CONF ID - SisLab2393 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2393/ A1 - Nguyen, Viet Anh Y1 - 2016/// TI - Examining student?s satisfaction with online learning activities in blended learning course: a case study AV - public M2 - Seville, Spain T2 - ICERI 2016 Conference ER - TY - JOUR ID - SisLab2598 UR - http://www.worldscientific.com/doi/abs/10.1142/S021964921750040X IS - 4 A1 - Nguyen, Viet Anh Y1 - 2017/12// N2 - The aim of the study was to determine the impact of online learning activities to the learning outcomes of students who participated in the blended learning course. Interactive activities are considered, in this study, include teacher - student interaction, student - student interaction, student - content interaction, and student - technology interaction. The undergraduate student participated in the blended learning course which using formative assessment to evaluate student learning outcomes by the combination of different learning activities through a learning management system. The quantitative results obtained when implementing learning analytics data from the system through using regression analysis showed that the students interact effectively with learning activities in the course have better results. Quantitative analytical results indicate that student ? student interaction has a greater impact on student learning outcomes. These learning activities used for interactive activities as suggestions for teachers to design and implement learning activities for blended learning courses PB - World Scientific JF - Journal of Information & Knowledge Management VL - 16 SN - 0219-6492 TI - The Impact of Online Learning Activities on Student Learning Outcome in Blended Learning Course SP - subjects AV - public EP - IT ER - TY - JOUR ID - SisLab2396 UR - http://www.emeraldinsight.com/doi/abs/10.1108/IJILT-08-2016-0031 IS - 1 A1 - Nguyen, Viet Anh Y1 - 2017/01/03/ PB - emeraldinsight JF - International Journal of Information and Learning Technology VL - 34 SN - 2056-4880 TI - Towards the implenmentation of an assessment-centered blended learning framework at the course level: a case study in a Vietnamese national university SP - 10 AV - none EP - 20 ER - TY - INPR ID - SisLab4749 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4749/ A1 - Nguyen, Viet Anh N2 - Recently, personalized learning is becoming more and more popular, especially in blended learning courses. The student learning style is one of several factors to personalize content and appropriate learning activities for each learner. This article proposes a model to detect learning styles in blended learning courses to classify learners for personalization. The proposed model focuses on two phases: the online and face-to-face learning phases of the learning process. Besides, we also present several parameters to map resources and activities in a blended-learning course to a learning style model. Based on the identified criteria, the experimental results with 205 students' data when classifying learning styles by the Support Vector Machine method give an accuracy of 76.7% - 83.2% in the 04 dimensions of the Felder and Silverman model. Experimental results when applying two approaches: literature-based and driven-based, show that learners' styles are similar up to 83%. Findings show that the student's learning style does not change much in the learning process. As for course design implications, we also propose suggestions for developing content and designing learning activities. TI - A model to detect student?s learning styles in the blended learning course AV - public M2 - Yokohama, Japan T2 - The 8th International Conference on Frontiers of Educational Technologies ER - TY - INPR ID - SisLab2395 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2395/ A1 - Nguyen, Viet Anh Y1 - 2016/// N2 - This article presents a model using peer assessment to evaluate students taking part in blended - learning courses (BL). In these courses, teaching activities are carried out in the form of traditional face-to-face (F2F) and learning activities are performed online via the learning management system Moodle. In the model, the topics of courses are built as a set of projects and case studies for the attending students divided into groups. The result of the implementation of projects is evaluated and ranked by all course participants and is one of the course evaluation criteria for lecturers. To assess learners more precisely, we propose a multi-phase assessment model in evaluating all groups and the group members. The result of each student in the group based on himself evaluation, evaluations of the team members, the tearcher and all students in the course. There are 107 students, who participated in the course entitled ``web application development'', are divided into 20 groups conducting the course in the field of information technology is deployed in the form of blended learning through peer assessment. The results of student's feedback suggested that the usage of various peer assessment created positive learning effectiveness and more interesting learning attitude for students. The survey was conducted with the students through the questionnaire, each question with scale 5-point Likert scale that ranged from 1 (very unsatisfied) to 5 (very statisfied) to investigate the factors: Collaboration, Assessment, Technology showed that students were satisfied with our approach. PB - Springer JF - Education and Information Technologies SN - 1360-2357 TI - A peer assessment approach to project based blended learning course in a Vietnamese higher education AV - public ER - TY - JOUR ID - SisLab1760 UR - http://stdb.hnue.edu.vn/portal/journals.php?articleid=3990 IS - 4 A1 - Nguyen, Viet Anh A1 - Hoang, Manh Tien A1 - Nguyen, Hoa Huy Y1 - 2016/// N2 - Bài báo gi?i thi?u mô hình chia s? tài nguyên tr?c tuy?n cho phép c?ng ??ng ng??i s? d?ng t?o l?p và chia s? các tài li?u h?c t?p và gi?ng d?y, t? ?ó hình thành m?t kho h?c li?u m? v?i h?c li?u tuân th? chu?n scorm, d? dàng tích h?p vào các h? th?ng Learning Management System. Bên c?nh ?ó, chúng tôi c?ng trình bày m?t s? ch?c n?ng chính c?a ph?n m?m ConnectData do chúng tôi xây d?ng ?? th? nghi?m mô hình. K?t qu? th?m dò khi tri?n khai ph?n m?m ConnectData ?? th? nghi?m mô hình ?ã nh?n ???c ý ki?n ph?n h?i tích c?c t? phía ng??i s? d?ng. PB - Tr??ng ??i h?c S? ph?m Hà n?i JF - Journal of Science of HNUE VL - 61 SN - 2354-1059 TI - Mô hình chia s? tài nguyên h?c li?u tr?c tuy?n SP - 172 AV - public EP - 176 ER - TY - CONF ID - SisLab2038 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2038/ A1 - Nguyen, Viet Anh A1 - Le, Thanh Ha A1 - Nguyen, Thi Thuy Y1 - 2016/12// TI - Single Camera Based Fall Detection Using Motion and Human Shape Features AV - none M2 - Ho Chi Minh city, Vietnam T2 - The 7th International Symposium on Information and Communication Technology (SoICT) ER - TY - JOUR ID - SisLab4571 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4571/ A1 - Nguyen, Viet Anh A1 - Nguyen, Hoa-Huy A1 - Nguyen, Duc-Loc A1 - Le, Minh-Duc Y1 - 2021/// N2 - How to choose the most appropriate courses to study throughout the learning process remains a question interested in by many students. Students often choose suitable courses according to their interests, needs, and advice from supporting staff, etc. This paper presents the results in developing a course recommendation system that will select appropriate courses for each student studying a major in the following semesters based on his/her current academic performance. We have applied several techniques based on data mining and learning analytics to predict students? learning outcomes in the next semester and developed a model to select the appropriate courses based on such a recommendation system. Besides, our study has focused on comparing the effectiveness of predictive learning methods based on collaborative filtering. Experiments analyzed the learning results of 510 students who enrolled in the courses from 2015 to 2019 and showed that the Matrix Factorization method is the most effective. Also, the paper has proposed procedures and constraints applicable to different training curricula. JF - Education and Information Technologies TI - A course recommendation model for students based on learning outcome AV - public ER - TY - INPR ID - SisLab3029 UR - http://www.ijlt.org/ IS - 3 A1 - Nguyen, Viet Anh A1 - Nguyen, Manh Duy Y1 - 2018/// N2 - Student-teacher interaction plays a major role in teaching and learning in blended learning courses. During each lesson, students often do not have time to ask the instructor about the relevant issues of the subject that they want to answer. In addition, students often hesitate to talk directly with teachers about issues related to the content of the subject. The Question Answering (Q&A) system, therefore, is a useful tool to assist students and teachers to engage in interactive activities, especially in online courses. This research focuses on reviewing the state of the art of two respects as methods and techniques for developing question and answer systems, including issues of question classification, retrieval of information and extraction of answers as core components of the Q&A system. In addition, the paper proposes a model of an online questionnaire system for blended interactive learning activities which are being tested at a university training institution. Initially, the test results show that students are interested in this form of online question and answer. JF - International Journal of Learning and Teaching VL - 4 SN - 2377-2891 TI - An online question and answering system for support teacher-student interaction in the blended learning course SP - 178 AV - public EP - 184 ER - TY - CONF ID - SisLab3163 UR - http://doi.org/10.1145/3268808.3268827 A1 - Nguyen, Viet Anh A1 - Nguyen, Quang Bach A1 - Nguyen, Vuong Thinh Y1 - 2018/// TI - A Model to Forecast Learning Outcomes for Students in Blended Learning Courses Based On Learning Analytics SP - 35 AV - none EP - 41 T2 - The 2nd International Conference on E-Society, E-Education and E-Technology ER - TY - CONF ID - SisLab1769 UR - http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5488620 A1 - Nguyen, Viet Ha A1 - Bui, The Duy A1 - Vu, Quang Dung A1 - Nguyen, Thi Thu Hien Y1 - 2010/// N2 - The increasing development of the Internet requires highly scalable, available, and reliable web servers in order to provide rapid response and high throughput to requests from hundreds millions users occurring at any time. The disadvantage of old fashioned approach which uses single-alone web servers is the problem of bottle-neck and overload on the server side as well as many additional problems for the network such as network traffic and routing overload. The load balancing problem of web servers can be solved with replicated web servers. However, the problems on the network are still left out. In this paper, we propose a framework to reallocate jobs from web servers to proxy servers that are close to the clients. By delivering certain jobs from requested web servers to designated proxy servers with mobile agents and executing these jobs at the proxy servers, our approach can reduce the load for web servers as well as reduce the traffic for the overall network. TI - Towards scalable agent based web service systems SP - 210 M2 - Gyeongju, Korea AV - none EP - 213 T2 - 4th International Conference on New Trends in Information Science and Service Science ER - TY - JOUR ID - SisLab758 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/758/ A1 - Nguyen, Viet Tan Y1 - 2013/// JF - T?p chí khoa h?c và công ngh? c?a Vi?n Khoa h?c và Công ngh? Vi?t Nam TI - L?c c?ng tác b?ng ph??ng pháp ??ng hu?n luy?n AV - none ER - TY - JOUR ID - SisLab1182 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1182/ A1 - Nguyen, Viet Tan A1 - Hoang, Vu A1 - Dang, Vu Tung A1 - Tu, Minh Phuong Y1 - 2014/// JF - T?p chí Khoa h?c ??i h?c Qu?c gia Hà N?i TI - Phân lo?i d? li?u có liên k?t s? d?ng ph??ng pháp ??ng hu?n luy?n AV - none ER - TY - CONF ID - SisLab1514 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1514/ A1 - Nguyen, Xuan Duc A1 - Le, Hong Quang A1 - Le, Viet Quan Trong A1 - Nguyen, Duc Nam A1 - Tran, Le Minh Nhat A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2016/04/29/ TI - An automated system for monitoring online social media in educational area AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab1503 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1503/ A1 - Nguyen, Xuan Duc A1 - Le, Hong Quang A1 - Le, Viet Quan Trong A1 - Nguyen, Duc Nam A1 - Tran, Le Minh Nhat A1 - Pham, Bao Son A1 - Phan, Xuan Hieu Y1 - 2016/04/29/ TI - An automated system for monitoring online social media in educational area AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab2690 UR - http://nafosted-nics.org A1 - Nguyen, Xuan Duc A1 - Nguyen, Minh Duc A1 - Tran, Mai Vu A1 - Phan, Xuan Hieu A1 - Pham, Bao Son Y1 - 2017/11/24/ N2 - The exponential growth of social media has created informative content, which leads to the emersion of social listening tools, in order to serve the need of companies and organizations. These tools are developed mainly in English language and for those which deal with Vietnamese, they lack the analysis capabilities to capture insightful information. In our research, we propose a framework to automatically extract and analyze information from social media, including online news and social networks. Our framework consists of multiple modules: data crawler, analysis module (topic analysis, sentiment analysis, event detection), visualization module. The results for analysis modules are promising: F1-score for topic analysis is 53%, average accuracy for sentiment analysis (using Maximum Entropy with three classes) is 62% and F1-score for event detection is 88.36%. TI - VNU-SMM: A social media monitoring framework on vietnamese online news SP - 269 M2 - Hanoi, Vietnam AV - none EP - 274 T2 - 2017 4th NAFOSTED Conference on Information and Computer Science (NICS 2017) ER - TY - INPR N1 - Bài báo này ?ã giành ???c gi?i th??ng "Best Paper Award" t?i h?i th?o SOIS 2017. ID - SisLab2759 UR - http://sois2017.uit.edu.vn/ A1 - Nguyen, Xuan Nam A1 - Nguyen, Dai Tho Y1 - 2017/12/02/ N2 - In this paper, we proposed a method to extract more general features of data for payload-based anomaly IDS. However, because of the significant rise in the number of features, there are numerous redundancies, leading to the rise in the complexity and the decrease in the accuracy of the classification. To that end, we apply Chi square [9] feature selection method to pick up the best features in the feature set. We have done many experiments on real world dataset of HTTP-based attacks to evaluate the performance of our classifier using our feature extraction method. The results show that our classifier can quickly detect the attack packets with very high true positive rate while keeping the false positive rate at a very low level. Besides, the results also indicate that our classifier outperforms other classifiers such as McPAD [10], and PAY [12, 13]. TI - Intrusion Detection Using a More General Feature Extraction Method for Payload-based Anomaly One-Class Classifier M2 - Ho Chi Minh City, Vietnam AV - public T2 - H?i th?o l?n th? II M?t s? v?n ?? ch?n l?c v? an toàn an ninh thông tin ER - TY - INPR N1 - Phiên b?n ti?ng Anh c?a bài báo này "Intrusion Detection Using a More General Feature Extraction Method for Payload-based Anomaly One-Class Classifier" ?ã ???c trình bày t?i h?i th?o l?n th? II M?t s? v?n ?? ch?n l?c v? an toàn thông tin (SOIS 2017), qua ph?n bi?n ???c gi?i th??ng "Best Paper Award", ???c C?c An toàn thông tin c?a B? Thông tin và Truy?n thông l?a ch?n ?? d?ch sang ti?ng Vi?t ??a vào chuyên san Khoa h?c Công ngh? c?a B? Thông tin và Truy?n thông s? cu?i n?m 2017. ID - SisLab2756 UR - http://ictvietnam.vn/BaoIn.htm?volid=c2705338-0fc3-42dd-916d-4664b5071aec A1 - Nguyen, Xuan Nam A1 - Nguyen, Dai Tho Y1 - 2017/12// N2 - Bài báo này ?? xu?t m?t ph??ng pháp trích rút ??c tr?ng trong phân l?p d? li?u t?ng quát h?n so v?i m?t h? th?ng phát hi?n thâm nh?p m?ng d?a trên b?t th??ng có tên là McPAD ?ã ???c ?? xu?t tr??c ?ây. V?n ?? ??t ra là s? ??c tr?ng ???c trích rút t?ng lên có th? làm t?ng ?? ph?c t?p và gi?m ?? chính xác c?a ph??ng pháp phân l?p t?ng quát hóa. Vì v?y, ph??ng pháp l?a ch?n ??c tr?ng Chi-Square ???c s? d?ng ?? l?c ra ch? nh?ng ??c tr?ng t?t nh?t. Chúng tôi ?ã làm nhi?u thí nghi?m v?i b? d? li?u là các t?n công HTTP th?t ?? ?ánh giá hi?u n?ng c?a ph??ng pháp trích rút ??c tr?ng t?ng quát hóa k?t h?p l?c Chi-Square. K?t qu? cho th?y b? phân l?p c?a chúng tôi có th? nhanh chóng phát hi?n các gói tin t?n công v?i t? l? d??ng tính th?t r?t cao trong khi duy trì t? l? d??ng tính gi? ? m?c r?t th?p. Ngoài ra, k?t qu? c?ng cho th?y hi?u n?ng b? phân l?p c?a chúng tôi v??t tr?i h?n so v?i McPAD. PB - B? Thông tin và Truy?n thông JF - Chuyên san Các công trình nghiên c?u, phát tri?n và ?ng d?ng Công ngh? thông tin và Truy?n thông TI - M?t ph??ng pháp trích rút ??c tr?ng t?ng quát hóa trong phát hi?n thâm nh?p m?ng d?a trên b?t th??ng AV - public ER - TY - CONF ID - SisLab2361 UR - http://www.nafosted-nics.org A1 - Nguyen, Xuan Nam A1 - Nguyen, Dai Tho A1 - Vu, Hai Long Y1 - 2016/// N2 - In this paper, we propose a novel Payload-based One-class Classifier for Anomaly Detection called POCAD, which combines a generalized 2v-gram feature extractor and a one-class SVM classifier to effectively detect network intrusion attacks. We extensively evaluate POCAD with real-world datasets of HTTP-based attacks. Our experiment results show that POCAD can quickly detect malicious payload and achieves a high detection rate as well as a low false positive rate. The experiment results also show that POCAD outperforms state of the art payload-based detection schemes such as McPAD [8] and PAYL [5]. TI - POCAD: a Novel Payload-based One-Class Classifier for Anomaly Detection SP - 74 M2 - Danang City, Vietnam AV - public EP - 79 T2 - 2016 3rd National Foundation for Science and Technology Development (NAFOSTED) Conference on Information and Computer Science (NICS) ER - TY - JOUR ID - SisLab3213 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3213/ A1 - Nguyen, Xuan Thanh A1 - Ngo, Thi Duyen A1 - Le, Thanh Ha Y1 - 2018/// N2 - 3D human pose reconstruction from single-view camera is a difficult and challenging topic. Many approaches have been proposed, but almost focus on frame-by-frame independently while inter-frames are highly correlated in a pose sequence. In contrast, we introduce a novel spatial-temporal 3D reconstruction framework that leverages both intra and inter frame relationships in consecutive 2D pose sequences. Orthogonal Matching Pursuit (OMP) algorithm, pre-trained Pose-angle Limits and Temporal Models have been implemented. We quantitatively compare our framework with recent works on CMU motion capture dataset and Vietnamese traditional dance sequences. Our method outperforms others with 10 percent lower of Euclidean reconstruction error and robustness against Gaussian noise. Additionally, it is also important to mention that our reconstructed 3D pose sequences are smoother and more natural than others PB - KIPS JF - Journal of Information Processing Systems SN - 1976-913X TI - A Spatial-temporal 3D Human Pose Reconstruction Framework AV - none ER - TY - JOUR ID - SisLab1478 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1478/ IS - 1 A1 - Nguyen, Xuan Thanh A1 - Nguyen, Ba Tung A1 - Do, Khac Phong A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh A1 - Vuong, Van Quynh A1 - Le, Thanh Ha Y1 - 2015/// PB - KIPS JF - Journal of Information Processing Systems VL - 11 SN - 1976-913X TI - Spatial Interpolation of Meteorologic Variables in Vietnam using the Kriging Method SP - 134 AV - none EP - 147 ER - TY - CONF ID - SisLab4790 UR - http://fat.uet.vnu.edu.vn/proceeding-of-apfita-wcca-2022-conference A1 - Nguyen, Xuan Truong A1 - Pham, Manh Linh Y1 - 2022/11/25/ KW - Precision Livestock Farming KW - Precision Feeding System KW - health KW - cloud simulation TI - Cloud-Based Simulation of Precision Feeding System for Pig Health Management SP - 109 M2 - Hanoi, Vietnam AV - none EP - 115 T2 - The 13th International Conference on Application of Information Technology in Agriculture Asia-Pacific Region (APFITA 2022) ER - TY - JOUR ID - SisLab4789 UR - https://ijetae.com/files/Volume12Issue12/IJETAE_1222_15.pdf IS - 12 A1 - Nguyen, Xuan Truong A1 - Pham, Manh Linh Y1 - 2022/12// JF - International Journal of Emerging Technology and Advanced Engineering VL - 12 KW - Precision feeding system KW - Simulation KW - Swine KW - Perturbations KW - Internet of Things SN - 2250-2459 TI - Detecting Multiple Perturbations on Swine using Data from Simulation of Precision Feeding Systems SP - 136 AV - none EP - 145 ER - TY - UNPB ID - SisLab3350 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3350/ A1 - Nguyen Binh, Nguyen A1 - Nguyen Van, Vinh Y1 - 2018/// N2 - Nowadays, along with the development of Natural Language Processing, there are a lot of research which use Statistical Machine Translation for grammatical error correction. Despite the fact that, there are a few researches which can be applied to Vietnamese. As a result, our purpose is to implement grammatical error correction in Vietnamese. The problem can easily describe like this: you have a wrong sentence as input, after being processed by the model, you will have the right sentence as output. In this research, we focus on applying Statistical Machine Translation to Vietnamese. This is a part of Machine Learning approach in order to solve the grammatical error correction problem. At first, we will try to create a list of all kind of Vietnamese?s error. Then, we aim for correcting simple error, like spelling error, then we develop the system step by step to handle and correct complex error. To do that, the model need lots of data to train, so we collect as much Vietnamese sentences as possible, and turn them into wrong to make parallel data. The data will be divided into three parts, which are used for training, tuning, and testing, respectively. After all, the model achieved some results, where the sentences with spelling mistake is corrected better than others. The result is not too good, but it can be seen that we can apply Statistical Machine Translation for the Grammatical error correction problem. PB - Conference M1 - technical_report TI - Statistical Machine Translation For Vietnamese Grammatical Error Correction AV - public ER - TY - JOUR ID - SisLab4609 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4609/ IS - 2 A1 - Nguyen-Duc, Anh A1 - Do, Manh-Viet A1 - Luong-Hong, Quan A1 - Nguyen-Khac, Kiem A1 - Truong-Anh, Hoang Y1 - 2021/04// N2 - Static Application Security Testing (SAST) is a popular quality assurance technique in software engineering. However, integrating SAST tools into industry-level product development and security assessment poses various technical and managerial challenges. In this work, we reported a longitudinal case study of adopting SAST as a part of a human-driven security assessment for an open-source e-government project. We described how SASTs are selected, evaluated, and combined into a novel approach for software security assessment. The approach was preliminarily evaluated using semi-structured interviews. Our result shows that (1) while some SAST tools outperform others, it is possible to achieve better performance by combining more than one SAST tools and (2) SAST tools should be used towards a practical performance and in the combination with triangulated approaches for human-driven vulnerability assessment in real-world projects. JF - Advances in Science, Technology and Engineering Systems Journal (ASTESJ) VL - 6 SN - 2415-6698 TI - On the Combination of Static Analysis for Software Security Assessment ? A Case Study of an Open-Source e-Government Project SP - 921 AV - public EP - 932 ER - TY - JOUR ID - SisLab772 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/772/ A1 - Nguy?n, Duy Ph??ng A1 - Nguyen, Viet Tan A1 - Tu, Minh Phuong Y1 - 2013/// JF - T?p chí Khoa h?c và Công ngh?, Vi?n Khoa h?c và Công ngh? Vi?t Nam VL - 1A TI - Collaborative Filtering by CO-TRAINING Method AV - none ER - TY - INPR ID - SisLab3243 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3243/ A1 - Nguy?n, V?n Hùng A1 - Nguy?n, Ng?c Linh Y1 - 2018/12// N2 - Hi?n nay, trên th? gi?i có r?t nhi?u chu?n không dây (wireless) ?? truy?n d? li?u v?i t?c ?? cao gi?a các thi?t b? v?i nhau nh? BlueTooth hay Wifi. Nh?ng ??i v?i nh?ng m?ng qu?n lý các c?m bi?n trong các ?ng d?ng ?i?u khi?n - t? ??ng hóa c?a các thi?t b? trong nhà hay b?nh vi?n thì Wifi hay BlueTooth l?i không th? ?áp ?ng ???c. Chúng có nhi?u khuy?t ?i?m nh? s? d?ng b?ng thông r?ng làm tiêu hao nhi?u ?i?n n?ng không c?n thi?t, s? d?ng các ngu?n ?i?n tr?c ti?p, ít s? d?ng pin, ph?m vi k?t n?i nh? h?p, ?? tr? cao, c? ch? b?o m?t ??n gi?n (BlueTooth), yêu c?u v? các thi?t b? ph?n c?ng cao, chi phí l?n. Nh? ch?c n?ng ?i?u khi?n t? xa không dây, truy?n d? li?u ?n ??nh, tiêu th? n?ng l??ng c?c th?p, công ngh? m? ?ã giúp công ngh? ZigBee tr? nên h?p d?n s? d?ng cho các ?ng d?ng m?ng không dây Trong nghiên c?u này, m?t m?ng c?m bi?n không dây v?i công ngh? Zigbee ?ng d?ng trong nông nghi?p thông minh ???c tích h?p th? nghi?m v?i các ??n v? nh? nh?t là các nút c?m bi?n có ch?c n?ng thu th?p các thông s? v? môi tr??ng, g?i ??n tr?m ki?m soát trung tâm và sau ?ó d? li?u s? ???c g?i lên Database ?? qu?n lý và l?u tr?. Ng??i dùng có th? theo dõi nh?ng thông s? ?ó qua trang web ho?c ?i?n tho?i di ??ng Android, t? ?ó ??a ra nh?ng quy?t ??nh phù h?p v?i cây tr?ng. Nhóm nghiên c?u ?ã thi?t k? giao di?n sao cho tr?c quan, d? dàng s? d?ng nh?t ?? b?t c? ai c?ng có th? ti?p c?n ???c. ?ây s? là m?t s?n ph?m có th? ???c nhân r?ng trên m?t vùng r?ng l?n ho?c ph?m vi t?nh, th?m chí qu?c gia, liên k?t các vùng nông nghi?p tr?ng tr?t l?i v?i nhau, ??a n?n nông nghi?p thông minh tr? nên ph? bi?n và phát tri?n m?nh ? Vi?t Nam. JF - T?p chí KH&CN, Tr??ng ??i h?c Công nghi?p VL - 49 TI - NGHIÊN C??U TÍCH H?P M?NG C?M BI?N KHÔNG DÂY D?A TRÊN CÔNG NGH? ZIGBEE INTEGRATED SENSORS NETWORK RESEARCH BASE ON ZIGBEE TECHNOLOGY AV - public ER - TY - CONF ID - SisLab3657 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3657/ A1 - Nho, Minh Tu A1 - Nguyen, Hoa-Huy A1 - Ton, Quang Cuong A1 - Nguyen, Viet Anh Y1 - 2019/// N2 - This paper presents a model for forecasting the learning outcomes and suggesting the recommend courses for undergraduate students. In this research, we propose methods based on machine learning techniques and recommender systems to answer three research questions of forecasting student?s outcomes problem: 1) How to forecast the course?s grade for the next subject. 2) How to predict the final grade point average basing on the subjects students have studied. 3) How to suggest a list of subjects that students should learn in the next semester. The model has been tested with the grade data in 22-course subjects with the participation of 580 students. The results, in the best case, for predicting the missing subject grades with the tested data set were 0.656, a good result for scores in the range [0, 10]. Assessing the user?s satisfaction of the model through the survey, the results show that 68.2% of students think that the system is useful for them. TI - A Model to Forecast the Student's Grade and Course Recommendation: A Case Vietnamese Students M2 - Istanbul, Turkey AV - none T2 - First International Conference on Innovative Computing and Cutting-edge Technologies (ICICCT 2019) ER - TY - JOUR ID - SisLab1489 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1489/ IS - 3 A1 - Nong, Thi Hoa A1 - Bui, The Duy Y1 - 2015/// PB - Institute of Information Science, Academia Sinica JF - Journal of Information Science and Engineering VL - 30 SN - 1016-2364 TI - An Improved Learning Rule for Fuzzy ART SP - 713 AV - none EP - 726 ER - TY - CONF ID - SisLab783 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/783/ A1 - Nong, Thi-Hoa A1 - Bui, The Duy Y1 - 2013/11// N2 - Fuzzy Adaptive Resonance Theory (Fuzzy ART) is an unsupervised neural network, which clusters data effectively based on learning from training data. In the learning process, Fuzzy ARTs update the weight vector of the wining category based on the current input pattern from training data. Fuzzy ARTs, however, only learn from patterns whose values are smaller than values of stored patterns. In this paper, we propose a max-min learning rule of Fuzzy ART that learns all patterns of training data and reduces effect of abnormal training patterns. Our learning rule changes the weight vector of the wining category based on the minimal difference between the current input pattern and the old weight vector of the wining category. We have also conducted experiments on seven benchmark datasets to prove the effectiveness of the proposed learning rule. Experiment results show that clustering results of Fuzzy ART with our learning rule (Max-min Fuzzy ART) is significantly higher than that of other models in complex datasets. TI - A Max-Min Learning Rule for Fuzzy ART SP - 53 M2 - Hanoi, VIETNAM AV - none EP - 57 T2 - 2013: IEEE RIVF International Conference on Computing and Communication Technologies (RIVF2013) ER - TY - CONF ID - SisLab773 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/773/ A1 - Ogawa, Mizuhito A1 - To, Van Khanh Y1 - 2013/// TI - SAT and SMT: Their algorithm Designs and Applications AV - none M2 - Bangkok, Thailand T2 - 2013: the 20th Asia-Pacific Software Engineering Conference (APSEC 2013) ER - TY - CONF ID - SisLab3955 UR - https://www.shs-conferences.org/articles/shsconf/abs/2020/05/shsconf_etltc2020_04003/shsconf_etltc2020_04003.html A1 - Ogbodo, Mark A1 - Dang, Nam Khanh A1 - Tomohide, Fukuchi A1 - Abdallah, Abderazek Ben Y1 - 2020/01// N2 - Neuromorphic computing tries to model in hardware the biological brain which is adept at operating in a rapid, real-time, parallel, low power, adaptive and fault-tolerant manner within a volume of 2 liters. Leveraging the event driven nature of Spiking Neural Network (SNN), neuromorphic systems have been able to demonstrate low power consumption by power gating sections of the network not driven by an event at any point in time. However, further exploration in this field towards the building of edge application friendly agents and efficient scalable neuromorphic systems with large number of synapses necessitates the building of small-sized low power spiking neuron processor core with efficient neuro-coding scheme and fault tolerance. This paper presents a spiking neuron processor core suitable for an event-driven Three-Dimensional Network on Chip (3D-NoC) SNN based neuromorphic systems. The spiking neuron Processor core houses an array of leaky integrate and fire (LIF) neurons, and utilizes a crossbar memory in modelling the synapses, all within a chip area of 0.12mm2 and was able to achieves an accuracy of 95.15% on MNIST dataset inference. TI - Architecture and Design of a Spiking Neuron Processor Core Towards the Design of a Large-scale Event-Driven 3D-NoC-based Neuromorphic Processor AV - restricted T2 - The 2nd ACM Chapter International Conference on Educational Technology, Language and Technical Communication (ETLTC2020) ER - TY - CONF ID - SisLab3272 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3272/ A1 - Ouyang, Hua A1 - He, Niao A1 - Tran, Quoc Long A1 - Gray, Alexander Y1 - 2013/// TI - Stochastic alternating direction method of multipliers SP - 80 AV - public EP - 88 T2 - International Conference on Machine Learning (ICML 2013) ER - TY - JOUR ID - SisLab3934 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3934/ IS - 5 A1 - Parlavantzas, Nikos A1 - Pham, Manh Linh A1 - Morin, Christine A1 - Arnoux, Sandie A1 - Beaunée, Gaël A1 - Qi, Luyuan A1 - Gontier, Philippe A1 - Ezanno, Pauline N2 - The cloud has emerged as an attractive platform for resource-intensive scientific applications, such as epidemic simulators. However, building and executing such applications in the cloud presents multiple challenges, including exploiting elasticity, handling failures, and simplifying multi-cloud deployment. To address these challenges, this paper proposes a novel service-based framework called DiFFuSE that enables simulation applications with a bag-of-tasks structure to fully exploit cloud platforms. This paper describes how the framework is applied to restructure two legacy applications, simulating the spread of bovine viral diarrhea virus and Mycobacterium avium subspecies paratuberculosis, into elastic cloud-native applications. Experimental results show that the framework enhances application performance and allows exploring different cost-performance trade-offs while supporting automatic failure handling and elastic resource acquisition from multiple clouds. VL - 32 TI - A Service-based Framework for Building and Executing Epidemic Simulation Applications in the Cloud AV - public EP - 16 Y1 - 2020/03/10/ PB - John Wiley & Sons Inc JF - Concurrency and Computation: Practice and Experience KW - Cloud computing; Epidemic simulation; High Performance Computing; Simulation models SN - 1532-0626 SP - 1 ER - TY - CONF ID - SisLab2975 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2975/ A1 - Pascal, Fontain A1 - Mizuhito, Ogawa A1 - Thomas, Sturm A1 - To, Van Khanh A1 - Vu, Xuan Tung Y1 - 2018/// N2 - We report on a prototypical tool for Satisfiability Modulo Theory solving for quantifier-free formulas in Non-linear Real Arithmetic or, more precisely,real closed fields, which uses a computer algebra system as the main component. This is complemented with two heuristic techniques, also stemming from computer algebra, viz. interval constraint propagation and subtropical satisfiability. Our key idea is to make optimal use of existing knowledge and work in the symbolic computation community, reusing available methods and implementations to the most possible extent. Experimental results show that our approach is surprisingly efficient in practice. TI - EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT M2 - United Kingdom AV - none T2 - Satisfiability Checking and Symbolic Computation ER - TY - JOUR ID - SisLab2577 UR - http://journal.frontiersin.org A1 - Peon, Antonio A1 - Dang, Cao Cuong A1 - Ballester, Pedro Y1 - 2016/04/14/ N2 - Computational methods for Target Fishing (TF), also known as Target Prediction or Polypharmacology Prediction, can be used to discover new targets for small-molecule drugs. This may result in repositioning the drug in a new indication or improving our current understanding of its efficacy and side effects. While there is a substantial body of research on TF methods, there is still a need to improve their validation, which is often limited to a small part of the available targets and not easily interpretable by the user. Here we discuss how target-centric TF methods are inherently limited by the number of targets that can possibly predict (this number is by construction much larger in ligand-centric techniques). We also propose a new benchmark to validate TF methods, which is particularly suited to analyse how predictive performance varies with the query molecule. On average over approved drugs, we estimate that only five predicted targets will have to be tested to find two true targets with submicromolar potency (a strong variability in performance is however observed). In addition, we find that an approved drug has currently an average of eight known targets, which reinforces the notion that polypharmacology is a common and strong event. Furthermore, with the assistance of a control group of randomly-selected molecules, we show that the targets of approved drugs are generally harder to predict. JF - Frontiers in Chemistry VL - 4 SN - 1663-4365 TI - How Reliable Are Ligand-Centric Methods for Target Fishing? SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab2764 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2764/ A1 - Pham, Canh V. A1 - Hoang, Xuan Huan Y1 - 2017/10/07/ N2 - In this paper, we investigate the problem of limiting the spread of epidemics on online social networks (OSNs) with the aim to seek a set nodes of size at most k to remove from the networks such that the number of saved nodes is maximal for cases where we already know the set of infected nodes on the networks. The problem is proved to be NP-hard and it is NP-hard to approximate the problem with ratio nexp(1??), for 0 < ? < 1. Besides, we also suggest two algorithms to solve the problem. Experimental results show that our proposed outperform baseline algorithms. TI - Limiting the Spread of Epidemics within Time Constraint on Online Social Networks SP - 262 M2 - Nha Trang, Viet Nam AV - public EP - 269 T2 - SoICT 2017 ER - TY - CONF ID - SisLab2790 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2790/ A1 - Pham, Canh V. A1 - Phu, Quat V. A1 - Hoang, Xuan Huan Y1 - 2018/03/19/ N2 - In this paper, we investigate a problem of ?nding smallest set of nodes to remove from a social network so that in?uence reduction of misinformation sources at least given threshold ?, called Targeted Misinformation Blocking (TMB) problem. We prove that TBM is #P-hard under LT model. For any parameter ? ? (0,?), we designed Greedy algorithm which return the solution A with the expected in?uence reduction greater than ???, and the size of A is within factor 1+ln(?/?) of the optimal size. To speed-up Greedy algorithm, we designed an e?cient heuristic algorithm, called STBM algorithm. Experiments were conducted on real world networks which showed the e?ectiveness of proposed algorithms in term of both e?ectiveness and e?ciency. TI - Targeted Misinformation Blocking on Online Social Networks M2 - Dong Hoi City, Vietnam AV - public T2 - 10th Asian Conference on Intelligent Information and Database Systems (AIIDS) ER - TY - CONF ID - SisLab2505 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2505/ A1 - Pham, Chi Cong A1 - Trinh, Hai Thai A1 - Nguyen, Ngoc Hoa Y1 - 2016/12// N2 - Trong các h? th?ng ?i?u khi?n giám sát và thu th?p d? li?u (SCADA), bài toán qu?n lý truy?n thông ph?i ??i m?t v?i nh?ng thách th?c v? s? ?a d?ng trong s? truy?n thông d? li?u gi?a các thi?t b? công nghi?p. Ch?ng h?n, t? vi?c h? tr? k?t n?i t?i các RTU (Remote Terminal Unit) theo chu?n truy?n thông công nghi?p Modbus TCP/IP, OPC, ? ??n vi?c h? tr? các chu?n m?i nh? OPC-UA, Industrial IoT, ? Ngoài ra, v?i s? ?a d?ng và ph?c t?p trong các nhà máy s?n xu?t công nghi?p, c?ng c?n ph?i có s? linh ho?t trong vi?c h? tr? các mô hình k?t n?i khác nhau, ch?ng h?n nh? MultiClient, MultiServer, Redundancy. T? th?c tr?ng ?ó, nhóm nghiên c?u ?ã ti?n hành kh?o sát, ?ánh giá và ?? xu?t mô hình ki?n trúc phân t?ng và s? d?ng chu?n OPC-UA cho vi?c trao ??i d? li?u trong các h? th?ng thu th?p và giám sát d? li?u ?? phù h?p v?i yêu c?u trên. Mô hình này ?ã cho phép nâng cao kh? n?ng qu?n lý truy?n thông, cho phép m? r?ng k?t n?i ch? liên quan t?i m? r?ng giao di?n t?ng d??i mà không làm thay ??i c?u trúc các t?ng phía trên. Th?c nghi?m chúng tôi ti?n hành trong khuôn kh? ?? tài KC.03.26/11-15 ?ã cho phép minh ch?ng và kh?ng ??nh tính linh ho?t và hi?u qu? c?a ph??ng th?c qu?n lý truy?n thông ?ó c?a chúng tôi. TI - Ph??ng th?c qu?n lý truy?n thông trong các h? th?ng ?i?u khi?n và giám sát t?p trung M2 - Hanoi, Vietnam AV - none T2 - REV National Conference on Electronics, Communications and Information Technology ER - TY - JOUR ID - SisLab1915 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1915/ IS - 3 A1 - Pham, Chinh Huu A1 - Le, Quoc Khanh A1 - Le, Thanh Ha Y1 - 2014/// PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 30 SN - 0866-8612 TI - Human action recognition using dynamic time warping and voting algorithm AV - none ER - TY - CONF ID - SisLab1541 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1541/ A1 - Pham, Dinh Chinh A1 - Miaomiao, Zhang A1 - Dang, Van Hung Y1 - 2016/03/26/ N2 - In this paper, we consider a subclass of Probabilistic Duration Cal- culus formula called Simple Probabilistic Duration Calculus (SPDC) as a language for specifying dependability requirements for real-time systems, and address the two problems: to decide if a probabilistic timed automaton satisfies a SPDC formula, and to decide if there is a strategy to choose an execution of a given automaton that satisfies a SPDC formula. We prove that the both problems are decidable for a class of SPDC called probabilistic linear duration invariants, and provide a model checking algorithm for solving these problems. TI - On Model-Checking Probabilistic Timed Automata against Probabilistic Duration Properties M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1542 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1542/ A1 - Pham, Dinh Phong Y1 - 2016/03/26/ N2 - H? phân l?p d?a trên lu?t m? ???c nghiên c?u r?ng rãi do ng??i dùng cu?i có th? s? d?ng nh?ng tri th?c d?ng lu?t ???c trích rút t? d? li?u có tính d? hi?u, d? s? d?ng ??i v?i con ng??i nh? là nh?ng tri th?c c?a h?. Gi?i bài toán phân l?p d?a trên lu?t m? là xây d?ng bài toán trích rút t? ??ng h? d?a trên lu?t m? t? d? li?u sao cho h? lu?t thu ???c ph?i d? hi?u, t?c là s? lu?t và s? ?i?u ki?n t?o nên lu?t ph?i ?? nh?, các giá tr? ngôn ng? c?a các t? ngôn ng? xu?t hi?n trong h? lu?t ph?i ph?n ánh ???c ?úng ng? ngh?a c?a b?n thân chúng nh?ng v?n ?áp ?ng ???c yêu c?u ??t ra c?a bài toán. ??i s? gia t? (?SGT) là m?t cách ti?p c?n m?i cho vi?c x? lý mi?n giá tr? c?a bi?n ngôn ng?, khai thác tính ch?t sánh ???c c?a các giá tr? ngôn ng?, là c? s? xác ??nh ng? ngh?a ??nh l??ng t? ng? ngh?a ??nh tính, ?ã cho phép t?o ra các ràng bu?c v? ng? ngh?a và ?ã ???c ?ng d?ng hi?u qu? trong quá trình tìm ki?m, thi?t k? t?p giá tr? ngôn ng? cùng v?i ng? ngh?a d?a trên t?p m? c?a chúng cho bài toán xây d?ng t? ??ng c? s? lu?t cho h? phân l?p d?a trên lu?t m?. Tuy nhiên, v?i ti?p c?n ?SGT hi?n t?i, ng? ngh?a lõi và ng? ngh?a d?a trên t?p m? hình thang c?a các t? ngôn ng? ch?a ???c mô hình hóa. Nghiên c?u này ?? xu?t m? r?ng lý thuy?t ?SGT bi?u di?n ???c ng? ngh?a c?a các t? ngôn ng? ph? thu?c ng? c?nh và ?? xu?t thay ??i ph??ng pháp l??ng hóa ?SGT ?? mô hình hóa ng? ngh?a ??nh tính c?a các t? ngôn ng? phù h?p v?i ng? c?nh m?i nh?m cung c?p m?t c? ch? hình th?c cho vi?c sinh lõi ng? ngh?a và ng? ngh?a tính toán d?a trên t?p m? hình thang c?a khung nh?n th?c ngôn ng?. Nghiên c?u này c?ng ch?ng t? kh? n?ng ?ng d?ng hi?u qu? c?a ?SGT m? r?ng trong thi?t k? t? ??ng h? phân l?p d?a trên lu?t m?. TI - Thi?t k? ng? ngh?a hình thang cho h? phân l?p d?a trên lu?t m? M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1543 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1543/ A1 - Pham, Duc Hong A1 - Le, Anh Cuong Y1 - 2016/03/26/ N2 - In recent years, opinion mining and sentiment analysis has been one of the attracting topics of knowledge mining and natural language processing. The problem of rating aspects from textual reviews is an important task in this field. In this paper we propose a new method for rating product aspects as well as for identifying important aspects in general. Our proposed model is based on the least square method and the QR decomposition technique. In our experiment, we use a dataset of 594810 reviews of 3775 hotels collected from the very famous website in tourism tripadvisor.com with five common aspects including cleanliness, location, service, room and value. Experimental result shows that our proposed method outperforms some well known studies for the same problem. TI - A Least Square based Model for Rating Aspects and Identifying Important Aspects on Review Text Data M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - JOUR ID - SisLab1710 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1710/ A1 - Pham, Duc Hong A1 - Le, Anh Cuong A1 - Le, Hoan Y1 - 2015/// PB - H?c vi?n K? thu?t Quân s? JF - T?p chí Khoa h?c và K? thu?t VL - 16 TI - M?t mô hình hi?u qu? ?ánh giá quan ?i?m ng??i dùng ??i v?i các thu?c tính s?n ph?m s? d?ng m?ng N?ron AV - none ER - TY - CONF ID - SisLab1461 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1461/ A1 - Pham, Duc Hong A1 - Le, Anh Cuong A1 - Le, Thi Kim Chung Y1 - 2015/09// N2 - Opinion mining and sentiment analysis has been one of the attracting topics of knowledge mining and natural language processing in recent years. The problem of rating aspects from textual reviews is an important task in this field. In this paper we propose a new method for rating product aspects as well as for identifying important aspects in general. Our proposed model is based on the least square method. The experiments are carried out on the data collected from hotel services with the aspects including the cleanliness, location, service, room, and value. We have obtained more accurate results than some well-known previous studies. KW - data mining;least squares approximations;natural language processing;text analysis;cleanliness;hotel services;knowledge mining;least square based model;location;natural language processing;opinion mining;rating product aspects;review text data;room;sentiment analysis;service;value;Algorithm design and analysis;Computer science;Dictionaries;Hidden Markov models;Mathematical model;Prediction algorithms;Training TI - A Least Square based Model for Rating Aspects and Identifying Important Aspects on Review Text Data SP - 265 M2 - Ho Chi Minh city, Vietnam AV - none EP - 270 T2 - NICS: 2nd National Foundation for Science and Technology Development Conference on Information and Computer Science ER - TY - CONF ID - SisLab2161 UR - http://doi.org/10.1109/APSCC.2011.48 A1 - Pham, Huyen Trang A1 - Vu, Tien Thanh A1 - Tran, Mai Vu A1 - Ha, Quang Thuy Y1 - 2011/// TI - A Solution for Grouping Vietnamese Synonym Feature Words in Product Reviews SP - 503 AV - none EP - 508 T2 - Asia-Pacific Conference on Services Computing ER - TY - CONF ID - SisLab101 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/101/ A1 - Pham, Lien Vi A1 - Pham, Son Bao Y1 - 2012/08/17/ N2 - Advertising has appeared in almost all areas of life. The large number of advertisements, especially in real estate domain, has raised a need for an effective way to search and find useful information for users. In this paper, we propose a rule-based approach to build an Information Extraction system for Vietnamese online real estate advertisements. Experimental results shows that our approach is very promising with an overall F-measure of 91 on a collection of data collected from popular Vietnamese real estate websites. KW - Data mining;Electronic mail;HTML;Information retrieval;Logic gates;Transducers;Internet;Web sites;advertising;information retrieval;real estate data processing;F-measure;Vietnamese online real estate advertisements;Vietnamese real estate Websites;information extraction;rule-based approach;information extraction;information extraction system;online real-estate advertising;real-estate;real-estate advertising; TI - Information Extraction for Vietnamese Real Estate Advertisements SP - 181 M2 - Danang, Vietnam AV - none EP - 186 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab4443 UR - https://ictmag.vn/ict/article/view/953/474 IS - 2 A1 - Pham, Manh Linh A1 - Hoang, Tien Quang A1 - Nguyen, Xuan Truong N2 - Many domains of human life are more and more impacted by applications of the Internet of Things (i.e., IoT). The embedded devices produce masses of data day after day requiring a strong network infrastructure. The inclusion of messaging protocols like MQTT is important to ensure as few errors as possible in sending millions of IoT messages. This protocol is a great component of the IoT universe due to its lightweight design and low power consumption. Distributed MQTT systems are typically needed in actual application environments because centralized MQTT methods cannot accommodate a massive volume of data. Although being scalable decentralized MQTT systems, they are not suited to traffic workload variability. IoT service providers may incur expense because the computing resources are overestimated. This points to the need for a new approach to adapt workload fluctuation. Through proposing a modular MQTT framework, this article provides such an elasticity approach. In order to guarantee elasticity of MQTT server cluster while maintaining intact IoT implementation, the MQTT framework used off-the-shelf components. The elasticity feature of our framework is verified by various experiments. VL - 2020 TI - Elasticity for MQTT Brokers in IoT Applications AV - none EP - 73 Y1 - 2021/04/27/ PB - Vietnam Ministry of Information and Communications JF - Journal of Research and Development on Information and Communication Technology KW - Elasticity KW - MQTT broker KW - Cloud computing KW - Internetof Things SN - 1859-3534 SP - 61 ER - TY - JOUR ID - SisLab4434 UR - https://doi.org/10.25073/2588-1086/vnucsce.267 IS - 1 A1 - Pham, Manh Linh A1 - Hoang, Xuan Tung Y1 - 2021/04// N2 - Internet of Things (IoT) applications are increasingly making impact in all areas of human life. Day by day, its chatty embedded devices have been generating tons of data requiring effective network infrastructure. To deliver millions of IoT messages back and forth with as few faults as possible, participation of communication protocols like Message Queuing Telemetry Transport (i.e., MQTT) is a must. Lightweight blueprint and battery friendly design are just two of many advantages of this protocol making it become a dominant in IoT world. In real application scenarios, distributed MQTT solutions are usually required since centralized MQTT approach is incapable of dealing with huge amount of data. Although distributed MQTT solutions are scalable, they do not adapt to fluctuations of traffic workload. This might cost IoT service providers because of redundant computation resources. This leads to the need of a novel approach that can adapt its volume changes in workload. This article proposes such an elastic solution by proposing a flexible MQTT framework. Our MQTT framework uses off-the-shelf components to obtain server?s elasticity while keeping IoT applications intact. Experiments are conducted to validate elasticity function provided by an implementation of our framework. JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 37 KW - MQTT broker KW - Elasticity KW - Internet of Things KW - Cloud computing SN - 2588-1086 TI - An Elasticity Framework for Distributed Message Queuing Telemetry Transport Brokers SP - 1 AV - public EP - 14 ER - TY - JOUR ID - SisLab4743 UR - https://link.springer.com/article/10.1007/s10586-022-03636-w A1 - Pham, Manh Linh A1 - Le, Nguyen Tuan Thanh A1 - Nguyen, Xuan Truong Y1 - 2022/06/06/ N2 - Applications for the Internet of Things (IoT) are rapidly having an impact on all areas of daily life. Every day, its embedded devices generate loads of data that requires efficient network infrastructure. The integration of lightweight communication protocols such as Message Queuing Telemetry Transport (MQTT) is to send millions of IoT messages back and forth with as few errors as possible. In practice, IoT big data analytic systems are often deployed with highly regarded MQTT solutions to handle huge amounts of dynamic data and achieve scalability. However, these solutions do not adapt well to fluctuations in workload, so they are not elastic yet. This article introduces a novel framework that provides just-enough elasticity for MQTT brokers with multiple levels of virtualization and its implementation using EMQX MQTT broker, Kubernetes container-orchestration system and OpenStack cloud environment. Various experiments based on a real life IoT application are conducted to validate our proposed framework and its elastic functionality. PB - Springer Nature JF - Cluster Computing KW - Elasticity MQTT broker Internet of Things Cloud computing Smart homes SN - 1573-7543 TI - Multi-level just-enough elasticity for MQTT brokers of Internet of Things applications AV - public ER - TY - INPR ID - SisLab4648 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4648/ A1 - Pham, Manh Linh A1 - Nguyen, Ba Hieu A1 - Nguyen, Hoai Son A1 - Lê, Huy Hàm Y1 - 2021/11/11/ N2 - Precision livestock farming has become an inevitable trend for agricultural industry in the world. In that field, precision feeding is widely acknowledged because of its potential to reduce feed costs, environmental footprint and to improve animal health and welfare. Precision feeding involves modern multidisciplinary technologies such as information technology, mechanics, electronics, automation, etc. Such a system consists of automatic troughs linked to a computer system to exploit data collected from the individual animals (e.g. body weight, feed intake and feeding behaviour), and/or from ambient sensors. Data is processed and analysed based on mathematical models to make predictions, warnings for farmers or to formulate diets that fit requirements of each individual animal at each production period. However, implementing such a system often requires high investment, which may go beyond the capabilities of smallholders and small/medium laboratories. Furthermore, the risk of implementing by design but not conforming to reality is very high. To avoid this problem, we introduce an agent-based modelling approach to simulate precision feeding systems for swine. Two simulation experiments were conducted to provide predictions about the growth of individual pigs and the usefulness of precision feeding systems over classic feeding models. KW - precision feeding system KW - simulation KW - agentbased modelling KW - swine KW - efficiency TI - Simulation of precision feeding systems for swine M2 - Bangkok, Thailand AV - public T2 - The 13th International Conference on KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2021) ER - TY - JOUR ID - SisLab3442 UR - http://dx.doi.org/10.3837/tiis.2019.03.002 IS - 3 A1 - Pham, Manh Linh A1 - Nguyen, Truong Thang Y1 - 2019/03/31/ N2 - In an effort to minimize operational expenses and supply users with more scalable services, distributed applications are actually going towards the Cloud. These applications, sent out over multiple environments and machines, are composed by inter-connecting independently developed services and components. The implementation of such programs on the Cloud is difficult and generally carried out either by hand or perhaps by composing personalized scripts. This is extremely error prone plus it has been found that misconfiguration may be the root of huge mistakes. We introduce AutoBot, a flexible platform for modeling, installing and (re)configuring complex distributed cloud-based applications which evolve dynamically in time. AutoBot includes three modules: A simple and new model describing the configuration properties and interdependencies of components; a dynamic protocol for the deployment and configuration ensuring appropriate resolution of these interdependencies; a runtime system that guarantee the proper configuration of the program on many virtual machines and, if necessary, the reconfiguration of the deployed system. This reduces the manual application deployment process that is monotonous and prone to errors. Some validation experiments were conducted on AutoBot in order to ensure that the proposed system works as expected. We also discuss the opportunity of reusing the platform in the transition of applications from Cloud to Fog computing. JF - KSII Transactions on Internet and Information Systems VL - 13 KW - Application deployment KW - dynamic reconfiguration KW - distributed application KW - cloud computing KW - fog computing SN - 1976-7277 TI - Flexible deployment of component-based distributed applications on the Cloud and beyond SP - 1141 AV - public EP - 1163 ER - TY - JOUR ID - SisLab4605 UR - https://www.hindawi.com/journals/wcmc/2021/3833644/ IS - 383364 A1 - Pham, Manh Linh A1 - Nguyen, Truong Thang A1 - Hoang, Tien Quang N2 - IoT applications have been being moved to the cloud during the last decade in order to reduce operating costs and provide more scalable services to users. However, IoT latency-sensitive big data streaming systems (e.g., smart home application) is not suitable with the cloud and needs another model to fit in. Fog computing, aiming at bringing computation, communication, and storage resources from ?cloud to ground? closest to smart end-devices, seems to be a complementary appropriate proposal for such type of application. Although there are various research efforts and solutions for deploying and conducting elasticity of IoT big data analytics applications on the cloud, similar work on fog computing is not many. This article firstly introduces AutoFog, a fog-computing framework, which provides holistic deployment and an elasticity solution for fog-based IoT big data analytics applications including a novel mechanism for elasticity provision. Secondly, the article also points out requirements that a framework of IoT big data analytics application on fog environment should support. Finally, through a realistic smart home use case, extensive experiments were conducted to validate typical aspects of our proposed framework. VL - 2021 TI - Towards an Elastic Fog Computing Framework for IoT Big Data Analytics Applications AV - public EP - 16 Y1 - 2021/08/15/ PB - Hindawi JF - Wireless Communications and Mobile Computing KW - fog computing KW - Internet of Things KW - elasticity KW - big data analytics KW - smart home SN - 1530-8677 SP - 1 ER - TY - JOUR ID - SisLab3588 UR - http://www.sciencepublishinggroup.com/journal/paperinfo?journalid=517&doi=10.11648/j.ijics.20190404.11 IS - 4 A1 - Pham, Manh Linh A1 - Nguyen, Truong Thang A1 - Tran, Manh Dong N2 - Cloud computing is an evolution in IT consumption and delivery which makes available self-management on the Internet with a flexible, pay-as-you-go business model. Within the context of Internet of Things, the MQTT (Message Queuing Telemetry Transport) protocol that is implemented broadly by the applications of ?Publish-Subscribe? paradigm has a vital role. However, MQTT brokers are saturated easily if they have to cope with huge and speedy data generated by IoT ?chatty? devices. With capability of provisioning/deprovisioning granular virtual resources, Cloud computing empowered MQTT brokers by enabling its elasticity feature. Elasticity helps the brokers deal with a very large variety of data integrated into the IoT every single day. However, there was lack of sturdy benchmarking tools that judge all the aspects of MQTT brokers in order to advocate correct elastic decision-making. This article focuses on the work of benchmarking MQTT by introducing a new developed tool called MQTTBrokerBench. With this tool, users not only can benchmark MQTT brokers but also can specify saturation points where the IoT load makes the brokers be saturated. Those saturation points can be used to set thresholds for elastic decision-making. Furthermore, the article also demonstrates the results acquired by this tool through the experiments on Windows Azure Cloud Platform. VL - 4 TI - A Benchmarking Tool for Elastic MQTT Brokers in IoT Applications AV - public EP - 78 Y1 - 2019/12/01/ PB - Science Publishing Group JF - International Journal of Information and Communication Sciences KW - Benchmarking KW - MQTT KW - Cloud Computing KW - Internet of Things SN - 2575-1719 SP - 70 ER - TY - JOUR ID - SisLab4617 UR - https://www.mdpi.com/2076-2615/11/9/2743 IS - 9 A1 - Pham, Manh Linh A1 - Parlavantzas, Nikos A1 - Lê, Huy Hàm A1 - Bui, Quang Hung N2 - The spread of disease in livestock is an important research topic of veterinary epidemiology because it provides warnings or advice to organizations responsible for the protection of animal health in particular and public health in general. Disease transmission simulation programs are often deployed with different species, disease types, or epidemiological models, and each research team manages its own set of parameters relevant to their target diseases and concerns, resulting in limited cooperation and reuse of research results. Furthermore, these simulation and decision support tools often require a large amount of computational power, especially for models involving tens of thousands of herds with millions of individuals spread over a large geographical area such as a region or a country. It is a matter of fact that epidemic simulation programs are often heterogeneous, but they often share some common workflows including processing of input data and execution of simulation, as well as storage, analysis, and visualization of results. In this article, we propose a novel architectural framework for simultaneously deploying any epidemic simulation program both on premises and on the cloud to improve performance and scalability. We also conduct some experiments to evaluate the proposed architectural framework on some aspects when applying it to simulate the spread of African swine fever in Vietnam. VL - 11 TI - Towards a Framework for High-Performance Simulation of Livestock Disease Outbreak: A Case Study of Spread of African Swine Fever in Vietnam AV - public EP - IT Y1 - 2021/09// PB - MDPI JF - Animals KW - veterinary epidemiology; African swine fever; high-performance simulation; modeling; transmission and spread SN - 2076-2615 SP - subjects ER - TY - CONF ID - SisLab3478 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3478/ A1 - Pham, Manh Linh A1 - Tran, Manh Dong A1 - Nguyen, Truong Thang Y1 - 2019/06/28/ N2 - Trong s? phát tri?n c?a Internet v?n v?t (IoT), giao th?c MQTT (Message Queuing Telemetry Transport) có m?t vai trò r?t quan tr?ng b?i l? nó ???c s? d?ng r?ng rãi b?i nh?ng ?ng d?ng IoT th??ng ???c tri?n khai theo mô hình "Xu?t b?n-??ng ký". V?i kh? n?ng cung ?ng và gi?i phóng nh?ng tài nguyên ?o và m?n (ch?c n?ng co dãn - elasticity), ?i?n toán ?ám mây có kh? n?ng làm gia t?ng s?c m?nh cho nh?ng máy ch? môi gi?i MQTT. Kh? n?ng co dãn giúp các máy ch? môi gi?i MQTT có th? ???ng ??u v?i m?t kh?i l??ng l?n d? li?u ?ang t?ng ngày ???c tích h?p vào IoT. Tuy nhiên v?n có s? thi?u v?ng c?a các công c? ?o ki?m có th? ?ánh giá ??y ?? t?t c? các khía c?nh c?a MQTT ?? h? tr? vi?c ra nh?ng quy?t ??nh co dãn tài nguyên h?p lý và chính xác. Bài báo này t?p trung vào ch? ?? ?o ki?m MQTT thông qua vi?c gi?i thi?u MQTTBench m?t công c? ki?m th? m?i ???c chúng tôi phát tri?n cùng v?i nh?ng k?t qu? ban ??u có ???c t? vi?c áp d?ng công c? ?o ki?m ?ó trên m?t ?ng d?ng ?i?n toán ?ám mây gi? l?p. KW - ?o ki?m; ?i?n toán ?ám mây; Internet v?n v?t; MQTT TI - M?t công c? ?o ki?m giao th?c MQTT cho nh?ng ?ng d?ng IoT ph?c v? cho vi?c ra quy?t ??nh co dãn tài nguyên trên ?ám mây M2 - Thái Bình, Vi?t Nam AV - public T2 - H?i th?o qu?c gia l?n th? XXII: M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và truy?n thông ER - TY - CONF ID - SisLab2640 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2640/ A1 - Pham, Minh Duc A1 - Ly, Van Tuan A1 - Le, Dinh Thanh Y1 - 2017/11/24/ N2 - Attribute-specific models are quite effective in the detection of web attacks. Nevertheless, none of existing attribute-specific models can be applied directly to modern web applica-tions, which are dominant today and which use RESTful URLs. The barrier is that paths and parameters are mixed in URLs so that detection systems cannot identify which programs and attributes are which. To remove this barrier, this paper is the first one dealing with the identification of paths and parameters in RESTful URLs. The problem is raised, then a simple yet effective method to solve the problem is proposed. We validate our method via experiments. TI - Identification of Paths and Parameters in RESTful URLs for the Detection of Web Attacks M2 - Hanoi, Vietnam AV - none T2 - The 4th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - JOUR ID - SisLab1659 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1659/ A1 - Pham, Nam Thanh A1 - Vu, Khuong Duy A1 - Dinh, Trieu Duong A1 - Le, Thanh Ha Y1 - 2015/// N2 - Due to characteristics of human visual system (HVS), people usually focus more on a specific region named region-of-interest (ROI) of a video frame, rather than watch the whole frame. In addition, ROI-based video coding can also help to effectively reduce the number of encoding bitrates required for video transmission over networks, especially for the 3D-TV transmissions. Therefore, in this work, we propose a novel ROI-based bit allocation (BA) method which can adaptively extract and increase the visual quality of ROI while saving a huge number of encoding bitrates for video data. In the proposed method, we first detect and extract ROI based on the depth information obtained from 3D-TV video coding sequences. Then, based on the extracted ROI, a novel BA scheme is performed to solve the rate-distortion (R-D) optimization problem, in which the higher priority bitrates are adaptively assigned to ROI while the total encoding bitrates of video frames are kept satisfying all constraints required by the R-D optimization. Experimental results show that the proposed method provides much better higher peak signal-to-noise ratio (PSNR) as compared to other conventional BA methods. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering SN - 0866-8612 TI - Efficient Region-of-Interest Based Adaptive Bit Allocation for 3D-TV Video Transmission over Networks AV - none ER - TY - CONF ID - SisLab3870 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3870/ A1 - Pham, Nghia Luan A1 - Nguyen, Van Vinh Y1 - 2019/// N2 - In this paper, we propose a method to better leveraging monolingual data by exploiting the advantages of GNMT system. Our method for adapting a general neural machine translation system to a specific domain, by exploiting Back-translation technique using targetside monolingual data. This solution requires no changes to the model architecture from a standard NMT system. Experiment results show that our method can improve translation quality, results significantly outperforming strong baseline systems, our method improves translation quality in legal domain up to 13.65 BLEU points over the baseline system for English-Vietnamese pair language. TI - Adapting Neural Machine Translation for English-Vietnamese using Google Translate system for Back-translation AV - public T2 - Paclic 2019 ER - TY - CONF ID - SisLab3876 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3876/ A1 - Pham, Nghia Luan A1 - Nguyen, Van Vinh A1 - Nguyen, Huy Hoang Y1 - 2019/// N2 - Trong bài báo này, chúng tôi ?? xu?t m?t ph??ng pháp thích ?ng mi?n m?i cho d?ch máy n? ron, áp d?ng cho c?p ngôn ng? Anh - Vi?t. Ý t??ng chính c?a bài báo là k?t h?p d? li?u ??n ng? ngoài mi?n ? ngôn ng? ngu?n (ti?ng Anh) v?i b?n d?ch c?a nó ? ngôn ng? ?ích (ti?ng Vi?t) ?? làm d? li?u hu?n luy?n h? d?ch. Các th?c nghi?m ?ã ch?ng minh r?ng ph??ng pháp chúng tôi ?? xu?t d? th?c hi?n, khai thác ???c nh?ng ?u ?i?m c?a d? li?u ??n ng? nh? luôn có s?n, chi phí xây d?ng th?p và ??c bi?t là ch?t l??ng c?a h? d?ch ???c và t?ng 2,21 ?i?m BLEU trong th? nghi?m c?a chúng tôi TI - THÍCH ?NG MI?N TRONG D?CH MÁY N? RON CHO C?P NGÔN NG? ANH - VI?T M2 - ?H Khoa h?c - ?H Hu? AV - public T2 - K? y?u H?i ngh? Qu?c gia l?n th? XII v? Nghiên c?u c? b?n và ?ng d?ng Công Ngh? thông tin (FAIR) ER - TY - CONF ID - SisLab2788 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2788/ A1 - Pham, Nghia Luan A1 - Nguyen, Van Vinh A1 - Nguyen, Quang Huy Y1 - 2017/// TI - Translation model adaptation for Statistical Machine Translation with domain classifier AV - none T2 - The 31st Pacific Asia Conference on Language, Information and Computation PACLIC 31 (2017) ER - TY - CONF ID - SisLab34 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/34/ A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha A1 - Aoki, Toshiaki A1 - Katayama, T. Y1 - 2012/03/01/ KW - assume-guarantee verification KW - complexity KW - component-based software verification KW - computational cost KW - consumption memory KW - depth-limited search strategy KW - minimized assumption generation KW - model checking KW - object-oriented programming KW - optimization KW - program verification KW - search tree KW - software evolution KW - software maintenance KW - state space explosion problem KW - subtree KW - system rechecking KW - tree searching TI - An Improvement of Minimized Assumption Generation Method for Component-Based Software Verification SP - 1 AV - none EP - 6 T2 - 2012 IEEE RIVF International Conference on Computing and Communication Technologies ER - TY - CONF ID - SisLab111 UR - http://10.1109/rivf.2012.6169862 A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha A1 - Aoki, Toshiaki A1 - Katayama, T. Y1 - 2012/03/01/ N2 - The minimized assumption generation has been recognized as an improved method of the assume-guarantee verification for generating minimal assumptions. This method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. However, the computational cost for generating the minimal assumption is very high so the method is difficult to be applied in practice. This paper presents an optimization as a continuous work of the minimized assumption generation method in order to reduce the complexity of the method. The key idea of this method is to find a smaller assumption in a sub-tree of the search tree containing the candidate assumptions using the depth-limited search strategy. With this approach, the improved method can generate smaller assumptions with a lower computational cost and consumption memory than the minimized method. The generated assumptions are also effective for rechecking the systems at much lower computational cost in the context of software evolution. We have implemented a tool supporting the improved method. Experimental results are also presented and discussed. KW - Complexity theory;Computational efficiency;Context;Memory management;Search problems;Software;Software algorithms;object-oriented programming;program verification;software maintenance;tree searching;assume-guarantee verification;complexity;component-based software verification;computational cost;consumption memory;depth-limited search strategy;minimized assumption generation;model checking;optimization;search tree;software evolution;state space explosion problem;subtree;system rechecking; TI - An Improvement of Minimized Assumption Generation Method for Component-Based Software Verification SP - 1 M2 - Ho Chi Minh city AV - none EP - 6 T2 - 2012 IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) ER - TY - JOUR ID - SisLab2039 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2039/ IS - 8 A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha A1 - Toshiaki, Aoki A1 - Takuya, Katayama Y1 - 2010/08// PB - IEICE JF - IEICE Transactions on Information and Systems VL - E93-D SN - 0916-8532 TI - A Minimized Assumption Generation Method for Component-Based Software Verification SP - 2172 AV - none EP - 2181 ER - TY - JOUR ID - SisLab2041 UR - http://search.ieice.org/bin/summary.php?id=e95-a_9_1451 IS - 9 A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha A1 - Toshiaki, Aoki A1 - Takuya, Katayama Y1 - 2012/// PB - IEICE JF - IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer VL - 95-A SN - 0916-8508 TI - On Optimization of Minimized Assumption Generation Method for Component-Based Software Verification SP - 1451 AV - none EP - 1460 ER - TY - JOUR ID - SisLab2040 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2040/ IS - 11 A1 - Pham, Ngoc Hung A1 - toshiaki, aoki A1 - takuya, katayama Y1 - 2009/11// PB - IEICE JF - IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer VL - E92-A SN - 0916-8508 TI - Modular Conformance Testing and Assume-Guarantee Verification for Evolving Component-Based Software SP - 2772 AV - none EP - 2780 ER - TY - RPRT ID - SisLab3198 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3198/ A1 - Pham, Nguyen Hoang A1 - Luong, Ngoc Huyen A1 - Nguyen, Thi Hanh A1 - Dang, Duc Hanh Y1 - 2018/// PB - VNU University of Engineering and Technology VL - TR2018-FIT-11 M1 - technical_report TI - Integrating a Testing Technique into the RTL Tool AV - public EP - 10 ER - TY - CONF ID - SisLab1544 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1544/ A1 - Pham, Quoc Thang A1 - Nguyen, Duc Dung A1 - Nguyen, Thanh Thuy Y1 - 2016/03/26/ N2 - Human gesture recognition is a rather new field and many challenges, especial when motion capture devices become more popular. Sign language recognition is a concrete example of gesture recognition. Various studies have shown that the vector machine methods with Gaussian kernels are among the most prominent models for an accurate gesture classification. In this study, we present the application of vector machine learning methods to sign language recognition problem. We demonstrate that the vector machines (VMs) could also achieve the state-of-the-art predictive performance. The experimental results on the Auslan data set show the feasibility and effectiveness of these methods. TI - The vector machine learning methods on sign language recognition problem M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3712 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3712/ A1 - Pham, Thanh Huyen A1 - Ho, Thuan A1 - Ha, Quang Thuy A1 - Nguyen, Tri Thanh A1 - Nguyen, Xuan Bach Y1 - 2020/// N2 - Lý thuy?t t?p thô và các m? r?ng c?a nó nh? tính toán h?t d?a trên t?p thô, t?p thô ph?, tâp thô m?,... ngày càng ???c phát tri?n và áp d?ng hi?u qu? trong nhi?u l?nh v?c. Bài báo t?p trung gi?i thi?u khái ni?m b?ng quy?t ??nh ph?, m?t ví d? và phân tích v? vi?c xây d?ng b?ng quy?t ??nh ph?. Bài báo c?ng ??a ra m?t g?i ý v? vi?cc ?ng d?ng b?ng quy?t ??nh ph? trong h? t? v?n. TI - M?t m? r?ng t?p thô ph? và ?ng d?ng AV - none T2 - CH??NG TRÌNH H?I TH?O QU?C GIA L?N TH? XXIII - M?T S? V?N ?? CH?N L?C C?A CÔNG NGH? THÔNG TIN VÀ TRUY?N THÔNG ER - TY - INPR ID - SisLab4174 UR - https://icatse.org/icisa2020/ A1 - Pham, Thanh Huyen A1 - Nguyen, Thi Cam Van A1 - Vuong, Thi Hong A1 - Ho, Thuan A1 - Ha, Quang Thuy A1 - Nguyen, Tri Thanh Y1 - 2020/12/16/ N2 - Covering based rough set, an extension of the traditional rough set theory, which uses the cover set of the universe set instead of the partition of the universe, has proven to be both theoretical and attractive in terms of applications. Corresponding to the decision table in traditional rough set theory, the concept of covering decision system has been defined. In this paper, we propose a decision table type based on covers, including the condition lattice of covers, and the decision lattice of covers. Two tasks on covering based decision table are also introduced. We also demonstrate the applications of the covering based decision table in collaborative filtering that corresponds to the classification in the traditional decision table, and in constraint based association rule mining to indicate this covering decision table concept has a potential application TI - A Definition of Covering Based Decision Table and Its Sample Applications M2 - Virtual Conference AV - public T2 - 11th International Conference on Information Science and Applications 2020 (ICISA2020) ER - TY - CONF ID - SisLab4549 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4549/ A1 - Pham, Thanh Huyen A1 - Pham, Thi Ngan A1 - Ho, Thuan A1 - Vuong, Thi Hong A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy N2 - Covering based rough set is an important extension of Paw-lak's traditional rough set. Reduction is a typical application of rough sets, including traditional, cover-ing based and other rough set extensions. Although this task has several pro-posals, it is still an open problem to decision systems (tables) in covering based rough set. This paper focuses on the reduction problem for the condition lattice, and fitting problem for the decision lattice in the decision table based on cover lat-tice. A corresponding algorithm is proposed for each problem. Two examples to illustrate a covering based decision table and two related problems show the ap-plications of these concepts and problems TI - Solving reduction problems in cover lattice based decision tables AV - none T2 - ACIIDS 2021: Intelligent Information and Database Systems ER - TY - CONF ID - SisLab3290 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3290/ A1 - Pham, Thanh Tung A1 - Dinh, Trieu Duong A1 - Hoang, Van Xiem A1 - Vu, Huu Tien A1 - Le, Thanh Ha Y1 - 2018/// TI - Coding distortion modelling method for local image perception AV - none T2 - The 10th International Conference on Knowledge and Systems Engineering (KSE2018) ER - TY - INPR ID - SisLab3457 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3457/ A1 - Pham, Thanh Tung A1 - Dinh, Trieu Duong A1 - Hoang, Van Xiem A1 - Vu Huu, Tien A1 - Le, Thanh Ha Y1 - 2019/06/13/ N2 - As humans are the ultimate receivers of the majority of visual signals being processed, the most accurate way of assessing image quality is to ask humans for their opinions of an image?s quality, known as the subjective visual quality assessment (VQA). The subjective image quality scores gathered from all subjects are processed to be the mean opinion score (MOS), which is regarded as the ground truth of image quality. Due to the fact that the human visual system (HVS) is differently sensitive to features of image patch, a novel coding distortion modelling method for local image perception is proposed in this paper. An experimental quality assessment to approach database for image patch has been developed. Mean opinion score is regarded as an essential parameter meanwhile the QP-MOS sigmoid curve is determined by local image content. TI - Distortion Model based on Perceptual of Local Image Content SP - 1 M2 - Bangkok, Thailand AV - public EP - 4 T2 - http://www.icce-asia2019.org/ ER - TY - INPR ID - SisLab4751 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4751/ A1 - Pham, Thanh-Huyen A1 - Van-Tuan, Phan A1 - Thi-Ngan, Pham A1 - Thi-Hong, Vuong A1 - Tri-Thanh, Nguyen A1 - Quang-Thuy, Ha N2 - Multi-label classification (MLC) has recently drawn much attention thanks to its usefulness and omnipresence in real-world applications, in which objects may be characterized by more than one labels. One of the challenges in MLC is to deter-mine the relationship between the labels due to the fact that there is not any as-sumptions of the independence between labels, and there is not any information and knowledge about these relationships in a training dataset. Recently, many re-searches have focused on exploiting these label relationships to enhance the per-formance of the classification, however there have not many of them using the covering rough set. This paper propose a multi-label classification algorithm named CDTML, based on ML-KNN algorithm, using covering based decision table which exploits the relationship between labels to enhance the performance of the multi-label classifier. The experimental results on serveral dataset of Enron, Medical and a Vietnamese dataset of hotel reviews shown the effectiveness of the proposed algorithm. TI - A multi-label classification framework using the covering based decision table AV - none M2 - Ho Chi Minh City, Vietnam T2 - 14th Asian Conference on Intelligent Information and Database Systems ER - TY - JOUR ID - SisLab2903 UR - https://www.ncbi.nlm.nih.gov/pubmed/29231145 A1 - Pham, The Hai/V A1 - Nguyen, Hai Nam A1 - Doan, Viet Nga A1 - Dang, Thanh Hai A1 - Dieguez-Santana, Karel A1 - Marrero-Poncee, Yovani A1 - Castillo-Garit, Juan/A A1 - Casanola-Martin, Gerardo/M A1 - Le, Thi Thu Huong Y1 - 2017/// N2 - Quantitative Structure - Activity Relationship (QSAR) modeling has been widely used in medicinal chemistry and computational toxicology for many years. Today, as the amount of data on chemicals is increasing dramatically, QSAR methods have become pivotal for the purpose of handling the data, identifying a decision, and gathering useful information from data processing. The advances in this field have paved a way for numerous alternative approaches that require deep mathematics in order to enhance the learning capability of QSAR models. One of these directions is the use of Multiple Classifier Systems (MCSs) that potentially provide a means to exploit the advantages of manifold learning through decomposition frameworks, while improving generalization and predictive performance. In the present paper, we present MCS as a next generation of QSAR modeling techniques and discuss the chance to mining the vast number of models already published in the literature. We systematically revisited the theoretical frameworks of MCS as well as current advances in MCS application for QSAR practice. Furthermore, we illustrate our idea by describing ensemble approaches on modeling histone deacetylase (HDACs) inhibitors. We expect that our analysis would contribute to a better understanding about MCS application and its future perspectives for improving the decision making of QSAR models. PB - Bentham Science JF - Current Topics in Medicinal Chemistry VL - 18 SN - 1873-4294 TI - Learning from Multiple Classifier Systems: Perspectives for Improving Decision Making of QSAR Models in Medicinal Chemistry SP - 1 AV - none EP - 20 ER - TY - CONF ID - SisLab1648 UR - http://dx.doi.org/10.4204/EPTCS.182.4 A1 - Pham, Thi Kim Dung A1 - Dubois, Catherine A1 - Levy, Nicole Y1 - 2015/// VL - 182 SN - 2075-2180 TI - Towards correct-by-construction product variants of a software product line: GFML, a formal language for feature modules SP - 44 M2 - London, United Kingdom AV - none EP - 55 T2 - FMSPLE: the 6th Workshop on Formal Methods and Analysis in SPL Engineering ER - TY - CONF ID - SisLab3633 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3633/ A1 - Pham, Thi Ngan A1 - Ha, Quang Thuy A1 - Nguyen, Minh Chau A1 - Nguyen, Tri Thanh Y1 - 2019/// N2 - Lifelong machine learning has recently become a hot topic attracting the re-searchers all over the world by its effectiveness in dealing with current problem by exploiting the past knowledge. The combination of topic modeling on pre-vious domain knowledge (such as topic modeling with Automatically generat-ed Must-links and Cannot-links, which exploits must-link and cannot-link of two terms), and lifelong topic modeling (which employs the modeling of previous tasks) is widely used to produce better topics. This paper proposes a close domain metric based on probability to choose reliable (prior) knowledge learnt from the past to generate more coherent topics on the current domain. This knowledge is, then, used to enrich features for multi-label classifier. Several experiments performed on review dataset of hotel show that the proposed approach leads to an improvement in performance over the baseline. TI - A probability-based close domain metric in lifelong learning for multi-label classification AV - none T2 - The 6th International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA 2019) ER - TY - CONF ID - SisLab81 UR - http://www.mica.edu.vn/IALP-2012/ A1 - Pham, Thi Ngan A1 - Nguyen, Le Minh A1 - Ha, Quang Thuy Y1 - 2012/11/13/ TI - Named Entity Recognition for Vietnamese Documents Using Semi-supervised Learning Method of CRFs with Generalized Expectation Criteria SP - 85 M2 - Hanoi AV - none EP - 89 T2 - IALP: International Conference on Asian Language Processing ER - TY - CONF ID - SisLab2316 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2316/ A1 - Pham, Thi Ngan A1 - Nguyen, Van Quang A1 - Dinh, Duc Trong A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2017/04// N2 - Multi-Label Classification (MLC), which, recently, has attracted several attentions, aims at building classification models for objects assigned with multiple class labels simultaneously. Existing approaches for MLC mainly focus on improving supervised learning which needs a relatively large amount of labeled training data. In this paper, we propose a semi-supervised algorithm to exploit unlabeled data for MLC for enhancing the performance. In the training process, our algorithm exploits the specific features per prominent class label chosen by a greedy approach as an extension of LIFT algorithm, and unlabeled data consumption mechanism from TESC. In classification, the 1-Nearest-Neighbor (1NN) is applied to select appropriate class labels for a new data instance. Our experimental results on a data set of hotel (for tourism) reviews indicate that a reasonable amount of unlabelled data helps to increase the F1 score. Interestingly, with a small amount of labelled data, our algorithm can reach comparative performance to a larger amount of labelled data. PB - Springer TI - MASS: a semi-supervised multi-label classification algorithm with specific features M2 - Kanazawa, Japan AV - none T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - JOUR ID - SisLab2504 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2504/ A1 - Pham, Thi Ngan A1 - Nguyen, Van Quang A1 - Tran, Van Hien A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2017/// N2 - Multi-label classification has drawn much attention thanks to its usefulness and omnipresence in real-world applications in which objects may be char-acterized by more than one label as in the traditional approach. Getting mul-ti-label examples is costly and time-consuming therefore semi-supervised learning approach should be considered to take advantages of both labeled and unlabeled data. In this work, we propose a semi-supervised multi-label classification algorithm exploiting the specific features of the prominent class label(s) chosen by a greedy approach as an extension of the LIFT algo-rithm, and unlabeled data consumption mechanism from the TESC algo-rithm. We also make a semi-supervised multi-label classification application framework for Vietnamese texts with several feature enrichment steps in-cluding a) a stage of enriching features by adding hidden topic features; b) a stage of dimensional reduction for subtracting irrelevant features. Experi-mental results on a dataset of hotel reviews (for tourism) indicate that a rea-sonable amount of unlabeled data helps to increase the F1 score. Interesting-ly, with a small amount of labeled data, our algorithm can reach a compara-tive performance to the case of using a larger amount of labeled data. JF - Journal of Information and Telecommunication TI - A semi-supervised multi-label classification framework with feature reduction and enrichment AV - none ER - TY - UNPB ID - SisLab159 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/159/ A1 - Pham, Thi Ngan A1 - Phan, Thi Thom A1 - Nguyen, Phuoc Thao A1 - Ha, Quang Thuy Y1 - 2013/09/11/ TI - Hidden Topic Models for Multi-Label Review Classification: An Experimental Study AV - none M2 - Romania T2 - 2013 The 5th International Conference on Computational Collective Intelligence Technologies and Applications (ICCCI 2013) ER - TY - CONF ID - SisLab1545 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1545/ A1 - Pham, Thi Ngan A1 - Phan, Thi Thom A1 - Nguyen, Phuoc Thao A1 - Ha, Quang Thuy Y1 - 2016/03/26/ N2 - In recent years, Multi-Label Classification (MLC) has become an important task in the field of Supervised Learning. The MLC tasks are omnipresent in real-world problems in which an instance could belong to different classes simultaneously. In this paper, we presented a method for MLC using the hidden topic method to enrich the data features and using mutual information for feature selection. Our experiments on classifying user reviews about one thousand Vietnamese hotels showed the efficacy of the proposed approach. TI - Hidden Topic Models for Multi-Label Review Classification: An Experimental Study M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab2320 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2320/ A1 - Pham, Thi Ngan A1 - Tran, Van Hien A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2017/04// N2 - Hidden topic models, the method to automatically detect the topics which are (hidden in a text) represented by words, have been successfully in many text mining tasks including text classification. They help to get the semantics of text by abstracting the words in text into topics. Another new method for text representation is distance graph model, which has the ability of preserving the local order of words in text, thus, enhancing the text semantics. This paper proposes a method to combine both hidden topic and distance graph models for opinion mining in hotel review domain using multi-label classification approach. Experiments show the efficiency of the proposed model provides a better performance of 4% than that of the baseline. TI - Exploiting Distance graph and Hidden Topic Models for Multi-label Text Classification M2 - Kanazawa, Japan AV - none T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1638 UR - http://dx.doi.org/10.1007/978-981-10-0557-2_109 A1 - Pham, Thi Ngan A1 - Vuong, Thi Hong A1 - Thai, Thi Hoai A1 - Tran, Mai Vu A1 - Ha, Quang Thuy Y1 - 2016/// VL - 376 SN - 1876-1100 TI - Sentiment Analysis and User Similarity for Social Recommender System: An Experimental Study SP - 1147 M2 - Ho Chi Minh city, Vietnam AV - none EP - 1156 T2 - ICISA: the 2016 International Conference on Information Science and Application ER - TY - INPR ID - SisLab3729 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3729/ A1 - Pham, Thi Quynh Trang Y1 - 2019/// PB - VNU University of Engineering and Technology TI - Predicting chemical-induced disease relation from literature with CNN on single concatenated input M1 - technical_report AV - public ER - TY - JOUR ID - SisLab4204 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4204/ IS - 1 A1 - Pham, Thi Quynh Trang A1 - Bui, Manh Thang A1 - Dang, Thanh Hai Y1 - 2020/05// N2 - Chemical compounds (drugs) and diseases are among top searched keywords on the PubMed database of biomedical literature by biomedical researchers all over the world (according to a study in 2009). Working with PubMed is essential for researchers to get insights into drugs? side effects (chemical-induced disease relations (CDR), which is essential for drug safety and toxicity. It is, however, a catastrophic burden for them as PubMed is a huge database of unstructured texts, growing steadily very fast (~28 millions scientific articles currently, approximately two deposited per minute). As a result, biomedical text mining has been empirically demonstrated its great implications in biomedical research communities. Biomedical text has its own distinct challenging properties, attracting much attetion from natural language processing communities. A large-scale study recently in 2018 showed that incorporating information into indenpendent multiple-input layers outperforms concatenating them into a single input layer (for biLSTM), producing better performance when compared to state-of-the-art CDR classifying models. This paper demonstrates that for a CNN it is vice-versa, in which concatenation is better for CDR classification. To this end, we develop a CNN based model with multiple input concatenated for CDR classification. Experimental results on the benchmark dataset demonstrate its outperformance over other recent state-of-the-art CDR classification models. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 36 SN - 2588-1086 TI - Single Concatenated Input is Better than Indenpendent Multiple-input for CNNs to Predict Chemical-induced Disease Relation from Literature SP - 11 AV - none EP - 16 ER - TY - CONF ID - SisLab1546 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1546/ A1 - Pham, Thi Thuong A1 - Nguyen, Xuan Hoai A1 - Nguyen, Tri Thanh Y1 - 2016/03/26/ N2 - Develop adaptive learning algorithms for Evolving Data Streams is one of the major challenges that we face today. In this research, we propose improved methods aim at answering three main research questions includes (1) What to remember or forget?,(2) When to do the model upgrade? And (3) How to do the model upgrade? These proposed methods are based on Meta Heuristic, Statistic and Nonparametric Learning. TI - Research and development of methods for Data Stream Mining based on Meta Heuristic, Statistics and Nonparametric Learning M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab1867 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1867/ A1 - Pham, Thi Thuong A1 - Nguyen, Xuan Hoai A1 - Nguyen, Tri Thanh Y1 - 2016/// TI - A study on fitness representation in Genetic Programming AV - none M2 - Thai Nguyen, Vietnam T2 - The Advanced of International Conference on Advances in Information and Communication Technology (ICTA) ER - TY - JOUR ID - SisLab2573 UR - http://www.sciencedirect.com/science/article/pii/S0305054817301958 A1 - Pham, Tuan Anh A1 - Ha, Minh Hoang A1 - Nguyen, Xuan Hoai Y1 - 2017/12// N2 - The well-known multi-vehicle covering tour problem (m-CTP) involves finding a minimum-length set of vehicle routes passing through a subset of vertices, subject to constraints on the length of each route and the number of vertices that it contains, such that each vertex not included in any route is covered. Here, a vertex is considered as covered if it lies within a given distance of at least a vertex of a route. This article introduces a generalized variant of the m-CTP that we called the multi-vehicle multi-covering Tour Problem (mm-CTP). In the mm-CTP, a vertex must be covered at least not only once but several times. Three variants of the problem are considered. The binary mm-CTP where a vertex is visited at most once, the mm-CTP without overnight where revisiting a vertex is allowed only after passing through another vertex and the mm-CTP with overnight where revisiting a vertex is permitted without any restrictions. We first propose graph transformations to convert the last two variants into the binary one and focus mostly on solving this variant. A special case of the problem is then formulated as an integer linear program and a branch-and-cut algorithm is developed. We also develop a Genetic Algorithm (GA) that provides high-quality solutions for the problem. Extensive computational results on the new problem mm-CTP as well as its other special cases show the performance of our methods. In particular, our GA outperforms the current best metaheuristics proposed for a wide class of CTP problems. PB - Elsevier JF - Computers & Operations Research VL - 88 SN - 0305-0548 TI - Solving the multi-vehicle multi-covering tour problem SP - 258 AV - public EP - 278 ER - TY - INPR ID - SisLab3130 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3130/ A1 - Pham, Tuan Dung A1 - Man, Duc Chuc A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Doan, Minh Chung Y1 - 2018/// N2 - Remotely-sensed data for urban classification is very diverse in data type, acquisition time and spatial resolution. Therefore, preprocessing is needed for input data, in which the spatial resolution must be changed by different resampling methods. However, during resampling progress, data transformations have many effects on classification results. In this research, resampling methods are evaluated; as a result, mean aggregation and bicubic interpolation methods had better results for a variety of data types. Besides, the highest overall accuracy and F1 score for urban classification maps are 98.47% and 0.9842, respectively. JF - Journal of Research, Development, and Application on Information and Communication Theory SN - 1859-3534 TI - Comparison of resampling methods on different remote sensing images for Vietnam's urban classification AV - none ER - TY - CONF ID - SisLab2777 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2777/ A1 - Pham, Tuan Dung A1 - Man, Duc Chuc A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Doan, Minh Chung Y1 - 2016/12// N2 - No global scale land cover classification method performs with high accuracy at local scale. This study tries to develop a classification algorithm for urban area in Vietnam. This is the first assessment of the Global Land Cover by National Mapping Organizations (GLCNMO) version 2 method for producing global urban map in 2008. An improved and optimized algorithm is then developed based on the GLCNMO method for Vietnam taking into account of local natural and social conditions. Improving method is then applied to produce urban maps of Vietnam for the years of 2008 and 2015. Accuracy assessment showed that the improved method can achieve up to 13% higher precision and 10% higher F1 measure as compared to the global GNCNMO method. Also, an increasing trend was observed in population density in urban area in the period from 2008 to 2015 in Vietnam which may correspond to fast urbanization process in the country. The cities also tend to become less green in 2015 than 2008 as indicated by comparing the Normalized Difference Vegetation Index (NDVI) between the two years. KW - Remote sensing;Satellites;Sociology;Spatial resolution;Statistics;Urban areas;Vegetation mapping;GLCNMO version2;Vietnam's urban map;optimizing;urban expansion;urbanization TI - Optimizing GLCNMO version 2 method to detect Vietnam's urban expansion SP - 309 M2 - Hanoi, Vietnam AV - none EP - 314 T2 - The 8th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab3498 UR - https://iopscience.iop.org/article/10.1088/1755-1315/266/1/012008 A1 - Pham, Tuan Dung A1 - Pham, Van Ha A1 - Luu, Quang Thang A1 - Ngo, Xuan Truong A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung Y1 - 2019/05// N2 - The relationship between urbanization and air pollution was discovered in many studies. In this study, we analyzed the impacts of urban expansion on air pollution in Vietnam using remotely-sensed data from 2004 to 2015. In this period of time, Vietnam urban square was increased from 4623 km2 in 2004 to 5094 km2 in 2015. Besides, there is a clear difference between the average PM2.5 concentration value of urban areas and non-urban areas in Vietnam, urban PM2.5 values are generally higher than in rural areas for years. In this study, we use the SEAP (big Spatial data Exploration and Analysis Platform) platform to analyze and store data. TI - Analyzing the impacts of urban expansion on air pollution in Vietnam using the SEAP platform M2 - Pan Pacific Hanoi, Vietnam AV - none T2 - 4th International Forum on Sustainable Future in Asia / 4th NIES International Forum ER - TY - CONF ID - SisLab4153 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4153/ A1 - Pham, Tuan Dung A1 - Ta, Viet Cuong A1 - Pham, Thi Thanh Thuy A1 - Le, Thanh Ha Y1 - 2020/11// N2 - Our work improves the encoded image quality from HiDDeN framework, an end-to-end image steganography based on deep convolution neural network. In the encoding phase of HiDDeN framework, to embed a message in a cover image, it is required to split the cover image into smaller image blocks and embed the message bits in each block in parallel. These embedded blocks are then combined to form an encoded image that has the same size as the cover image. This image reconstruction process causes artifacts that appear on the boundaries of the blocks. This can be explained by the fact that when message bits are embedded in the image blocks, the pixel-level information of each image block is unequally alternated. In order to reduce block artifacts, in this work we propose a blocking loss as an additional objective function in HiDDeN framework. This loss measures the difference between encoded images and modified versions of the cover images. The proposed method is evaluated on COCO 2014 and BOSS datasets and the experimental results show the effectiveness in reducing the block artifacts that appeared in the encoded images of HiDDeN framework. This has an important impact on increasing the invisibility or transparency of the steganography system. In addition, the experimental result on secrecy of the proposed method also indicates the same performance as the HiDDeN pipeline. TI - Reducing Blocking Artifacts in CNN-Based Image Steganography by Additional Loss Functions SP - 61 M2 - Can Tho AV - public EP - 66 T2 - KSE 2020 ER - TY - CONF ID - SisLab4663 UR - https://iisi.siit.tu.ac.th/KSE2021 A1 - Pham, Tuan Nghia A1 - Hoang, Thi Diep Y1 - 2021/11// N2 - Accelerating phylogenetic tree reconstruction and bootstrapping is critical, especially to support the study of the evolution of dangerous viruses. In this paper, we propose the MPBoot-MPI, a distributed algorithm efficiently implementing the idea of bootstrap approximation in MPBoot for a parallel computing environment of multiple computational nodes. MPBoot-MPI employs the master-worker paradigm and divides the work in MPBoot into three phases, each with a separate strategy to distribute computing among processes. Since the bootstrap trees are not calculated independently, processes must share results throughout task execution. We propose that when arriving at a checkpoint to report their results to the master process, worker processes apply a stochastic strategy to determine whether to perform the sending, thereby reducing the effect of latency caused by the large size of the message sent. Experiments on simulation and real benchmark datasets showed that MPBoot-MPI on multiple processes obtained MP scores and bootstrap accuracy comparable to MPBoot while achieving a promising speedup ratio. We implemented the proposed method in the MPBoot-MPI program, which is publicly accessible at https://github.com/diepthihoang/mpboot/tree/mpboot-mpi-dev. TI - A Distributed Algorithm for the Parsimony Bootstrap Approximation M2 - Bangkok, Thailand & Online AV - none T2 - The 13th IEEE International Conference on Knowledge and Systems Engineering (KSE 2021) ER - TY - CONF ID - SisLab2373 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2373/ A1 - Pham, Van Canh A1 - Ha, Kim Dung A1 - Ngo, Quang Dung A1 - Vu, Quang Cao A1 - Hoang, Xuan Huan Y1 - 2016/// N2 - The problem of Influence Maximization (IM) on social networks proposed firstly by Kempe et al. (2003) has been researched and developed with many cases. However, the IM in limited time while unwanted users are restricted is still a new potential subject. In this paper, we conducted research the problem on the model of information diffusion name Locally Bounded Diffusion and tested some useful heuristic algorithms. The results of the experiment on some real datasets of social networks show that the algorithm meta-heuristic generated better output than the others. TI - A new viral marketing strategy with the competition in the large-scale Online Social Networks AV - public T2 - RIVF 2016 ER - TY - CONF ID - SisLab1718 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1718/ A1 - Pham, Van Canh A1 - Hoang, Xuan Huan A1 - Vu, Minh Manh Y1 - 2015/// TI - Preventing and detecting infiltration on Online Social Networks AV - none M2 - Beijing, China T2 - The 4th Conference on Computational Social Networks ER - TY - CONF ID - SisLab2372 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2372/ A1 - Pham, Van Canh A1 - Thai, Tra My A1 - Ha, Kim Dung A1 - Ngo, Quang Dung A1 - Hoang, Xuan Huan Y1 - 2016/// TI - Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks AV - public T2 - Computational Social Networks ER - TY - CHAP ID - SisLab4318 UR - http://dx.doi.org/10.1002/9781119720553.ch4 A1 - Pham, Van Ha A1 - Luu, Viet Hung A1 - Phan, Anh A1 - Laffly, Dominique A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2020/// PB - ISTE Ltd 2020. Published by ISTE Ltd and John Wiley & Sons, Inc TI - Remote Sensing Products SP - 95 AV - none EP - 161 T2 - TORUS 2 ? Toward an Open Resource Using Services ER - TY - CONF ID - SisLab3799 UR - http://dx.doi.org/10.1109/KSE.2019.8919417 A1 - Pham, Van Ha A1 - Ngo, Xuan Truong A1 - Laffly, Dominique A1 - Jourdan, Astrid A1 - Nguyen, Thi Nhat Thanh Y1 - 2019/// N2 - This paper applied different data fusion methods including Maximum Likelihood Estimation (MLE) and Linear Regression methods on satellite images over Vietnam areas from Moderate Resolution Imaging Spectroradiometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) sensors. In comparison with ground station Aerosol Robotic Network (AERONET), the regression method is better than Maximum Likelihood Estimator (MLE). Our results show that the fusion methods can improve both data coverage and quality of satellite aerosol optical depth (AOD). Strong correlations were observed between fused AOD and AERONET AOD (R 2 = 0.8118, 0.7511 for Terra regression and MLE method, respectively). This paper presented the evaluation of data fusion algorithm and highlighted its importance on the satellite AOD data coverage and quality methods from multiple sensors. TI - Evaluation of Maximum Likelihood Estimation and regression methods for fusion of multiple satellite Aerosol Optical Depth data over Vietnam SP - 1 AV - none EP - 6 T2 - 2019 11th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1547 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1547/ A1 - Pham, Van Ha A1 - Nguyen, Thi Nhat Thanh Y1 - 2016/03/26/ N2 - Vi?c s? d?ng d? li?u ?nh sol khí trong giám sát ô nhi?m b?i là m?t h??ng ti?p c?n m?i và h?a h?n [1, 3, 5 - 8]. Các ?nh sol khí có th? ???c tích h?p v?i d? li?u quan tr?c b?i trong các mô hình ??c tính m?c ?? ô nhi?m nh?m t?ng ch?t l??ng tính toán và d? ?oán c?a các mô hình này. T?i Vi?t Nam, vi?c ki?m soát và tính toán l??ng b?i và ch?t l??ng không khí t? các tham s? ?o ??c trên các vùng thí ?i?m c?ng ?ã ???c ?? c?p ??n trong nhi?u nghiên c?u. Tuy nhiên, vi?c s? d?ng và khai thác các thông tin t? v? tinh cho bài toán mô hình hoá ho?c ??c l??ng m?c ?? ô nhi?m không khí ch?a ???c quan tâm và nghiên c?u r?ng rãi t?i Vi?t Nam. ?? tài ?Mô hình hóa n?ng ?? b?i s? d?ng ?nh v? tinh? ???c nghiên c?u nh?m k? th?a và áp d?ng ph??ng pháp s? d?ng ?nh v? tinh cho bài toán Ô nhi?m không khí còn r?t h?n ch? ? Vi?t Nam. ?? tài t?p trung vào gi?i quy?t các n?i dung chính nh? sau: ? N?i dung 1: Các k? thu?t nâng cao ch?t l??ng s?n ph?m sol khí: Các ph??ng pháp, k? thu?t nh? Merging (SAA, MLE, WPC), N?i suy IO, Kriging, Ph??ng pháp bi?n ?? 3D-Var, 4D-Var, b? l?c Kalman ???c s? d?ng nh?m nâng cao ch?t l??ng s?n ph?m sol khí. ? N?i dung 2: Xây d?ng mô hình ??c tính n?ng ?? Ô nhi?m b?i t? ?nh v? tinh: Các mô hình ??c tính nh? h?i quy, SVM, Neural Network? ???c th?c nghi?m và ?ánh giá ?? tìm ra mô hình ??c tính t?t nh?t cho d? li?u trên vùng nghiên c?u. ? N?i dung 3: Phân tích và ?ánh giá ?nh h??ng c?a Ô nhi?m b?i: B?n ?? n?ng ?? b?i PM ???c ??c tính t? mô hình ???c s? d?ng cho các bài toán ?ánh giá ?nh h??ng c?a Ô nhi?m không khí ?? các l?nh v?c khác nh? s?c kh?e c?ng ??ng [2, 4, 9] (T? l? t? vong, s? l??ng b?nh nhân tim m?ch, ?ng th??), ?nh h??ng ??n nông nghi?p, bi?n ??i khí h?u. TI - Mô hình hóa n?ng ?? b?i s? d?ng ?nh v? tinh M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab3132 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3132/ A1 - Pham, Van Ha A1 - Nguyen, Thi Nhat Thanh A1 - Bui, Quang Hung A1 - Klein, Pascal A1 - Astrid, Jourdan A1 - Dominique, Laffly Y1 - 2018/// N2 - In this study, several georeferencing methods such as Polynomial, Thin Plate Spline (TPS) and geolocation transformations are applied on satellite images over Vietnam areas from Moderate Resolution Imaging Spectroradiometer (MODIS) sensor aboard Terra/Aqua satellites and Visible Infrared Imaging Radiometer Suite (VIIRS) sensor aboard the Suomi National Polar-orbiting Partnership (NPP) satellite. In comparison with global administrative areas data, the georeferenced images of TPS function have a better fitting than Polynomial function. In addition, the experimental results highlighted the effect of georeferencing methods on satellite aerosol optical depth (AOD) data in which TPS function produce a higher quality than Polynomial function on both MODIS Terra/Aqua and VIIRS AOD images. Validation results indicated strong correlation between AERONET AOD and TPS georeferenced images (R2 = 0.739, 0.537 and 0.596 for MODIS Terra, MODIS Aqua and VIIRS AOD, respectively) meanwhile these correlations of Polynomial are lower (R2 = 0.596, 0.443 and 0.475 for MODIS Terra, MODIS Aqua and VIIRS AOD, respectively). The correlations between MODIS AOD and VIIRS AOD images are also affected by georeferencing methods. The average of these correlations on TPS georeferenced images is 0.72 meanwhile mean correlation of Polynomial is 0.51. This study focused on the assessment of georeferencing methods and highlighted the effect of these methods on the quality and correlation of satellite AOD images. TI - Assessment of georeferencing methods on MODIS Terra/Aqua and VIIRS NPP satellite images in Vietnam M2 - Ho Chi Minh city, Vietnam AV - none T2 - 2018 the 10th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CHAP ID - SisLab4316 UR - http://dx.doi.org/10.1002/9781119720553.ch7 A1 - Pham, Van Ha A1 - Nguyen, Thi Nhat Thanh A1 - Laffly, Dominique Y1 - 2020/// PB - ISTE Ltd 2020. Published by ISTE Ltd and John Wiley & Sons, Inc TI - Remote Sensing Case Studies SP - 191 AV - none EP - 224 T2 - TORUS 2 ? Toward an Open Resource Using Services ER - TY - CONF ID - SisLab1192 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1192/ A1 - Pham, Van Huong A1 - Bui, Ngoc Hai A1 - Nguyen, Ngoc-Binh Y1 - 2014/10// TI - An Approach to Instruction Scheduling at the Processor Architecture Level for Optimizing Embedded Software AV - none M2 - Bali, Indonesia T2 - 2014: The 11th IEEE International Conference on Autonomic and Trusted Computing (ATC-2014) ER - TY - CONF ID - SisLab122 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/122/ A1 - Pham, Van Huong A1 - Nguyen, Ngoc-Binh Y1 - 2012/10/10/ N2 - Embedded system design and optimization play an important role in the development trend of embedded technology. This paper presents a new approach to design and optimize embedded systems in the design phase based on Pareto multi-objective optimization. We defined two Domain Specific Languages and developed the framework that is to design the architecture model and the component diagram of embedded systems. And we integrated the code generation technology called Text Template Transformation Toolkit to this framework to generate parameters from models automatically. Then we also do multi-objective optimization to select the best trade-off configuration of the embedded system architecture and the best hardware-software partition based on the Pareto principle and Genetic Algorithm. KW - DSL;Embedded systems;Genetic algorithms;Linear programming;Optimization;Unified modeling language;DSL - Domain Specific Language;Embedded system;GA - Genetic Algorithm;Pareto principle;T4 - Text Template Transformation Toolkit;embedded system design;hardware-software partitioning;multi-objective optimization; TI - An Approach to Design Embedded Systems by Multi-Objective Optimization SP - 165 M2 - Hanoi, Vietnam AV - none EP - 169 T2 - 2012 International Conference on Advanced Technologies for Communications (ATC 2012) ER - TY - CONF ID - SisLab1178 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1178/ A1 - Pham, Van Huong A1 - Nguyen, Ngoc-Binh A1 - Bui, Ngoc Hai A1 - Vu, Van Phuc Y1 - 2012/// TI - Hardware-Software Co-Design to Optimize Embedded Systems by using the Pareto Principle and DSL SP - 52 M2 - Danang, Vietnam AV - none EP - 57 T2 - 2012: The 2012 International Conference on Integrated Circuits and Devices (ICDV 2012) ER - TY - CONF ID - SisLab1193 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1193/ A1 - Pham, Van Huong A1 - Nguyen, Ngoc-Binh A1 - Vu, Van Phuc Y1 - 2014/11/11/ TI - A New Approach to Optimizing the Power Consumption of Existed Embedded Systems Based on the Combination of Hardware and Software AV - none M2 - Hanoi, Vietnam T2 - 2014: The 5th International Conference on Integrated Circuits, Design, and Verification (ICDV 2014) ER - TY - CONF ID - SisLab769 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/769/ A1 - Pham, Van-Cuong A1 - Pham, Ngoc Hung Y1 - 2013/// TI - A Method and Tool Support for Automated Data Flow Testing of Java Programs AV - none M2 - Phu Quoc, Vietnam T2 - 2013: 2nd International Conference on Context-Aware Systems and Applications (ICCASA 2013) ER - TY - CONF ID - SisLab3875 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3875/ A1 - Pham Nghia, Luan A1 - Nguyen Tien, Ha A1 - Nguyen Van, Vinh Y1 - 2019/// N2 - Correction of Vietnamese grammatical errors plays an important role in Natural Language Processing. In this paper, we propose a new method using Machine Translation. We consider the grammatical error correction problem like machine translation problem with source language as grammatical wrong text and target language as grammatical right texts, respectively. Additionally, we carry out pre-processing step with grammatical wrong text using spelling checker such as MS Word spelling tool before using Machine translation model. Our experiments based on the state-of-the-art Machine Translation systems combining with pre-processing step. Experimental results achieved 84.32 BLEU score with Vietnamese grammatical error correct based on SMT architecture and 88.71 BLEU score system based on NMT architecture, which indicates that our method achieves promising results. TI - Grammatical error correction for Vietnamese using Machine Translation AV - public T2 - 2019 16th International Conference of the Pacific Association for Computational Linguistics ER - TY - CONF ID - SisLab4143 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4143/ A1 - Pham Thanh, Tung A1 - Ma Thi, Chau A1 - Nguyen Manh, Tuan A1 - Le Dinh, Linh A1 - Le Thanh, Ha Y1 - 2020/// N2 - Ground truth is one of the most important component for training, testing, and benchmarking algorithms for objective quality assessment. In this paper, we propose an image patch quality database with compression artifacts. We create a new database of image patches with High Efficiency Video Coding (HEVC) compression artifacts. Then, the subjective test is conducted in a controlled environment to obtain the ground truth of image patch quality, where we collect differential mean opinion scores (DMOS) from a larger amount of observers. Finally, the rank order correlation factors between DMOS and a set of popular image quality metrics are calculated and presented. The proposed database is expected for learning patch based IQA model for block size in video rate-distortion optimization. TI - Compression Artifacts Image Patch database for Perceptual Quality Assessment AV - public T2 - KSE-2020 ER - TY - UNPB ID - SisLab3349 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3349/ A1 - Pham Van, Long A1 - Vu Ngoc, Sang A1 - Nguyen Van, Vinh Y1 - 2018/// N2 - This paper deals with the parsing application developed for the resumes (or CV) received in multiple formats like doc, docx, pdf, txt. These resumes can be automatically retrieved and processed by a resume information extraction system. Extracted information such as name, phone / mobile number, e-mail id, qualification, experience, skill sets etc., can be stored as a structured information in a database and then can be used in many different areas. Our system consists of 4 phases: Text Segmentation, Name Entity Recognition using Rule-based, Find Name Entities using Deep Neural Network and Text Normalization. Our work is conducted on a medium-sized collections of CV files in Vietnamese. We archived promising results with over 81% F1 for NER and also compared our model with other systems PB - Conference M1 - technical_report TI - Study of Information Extraction in Resume AV - public ER - TY - INPR ID - SisLab3131 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3131/ A1 - Phan, Anh A1 - Chu, Thua Vu A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh A1 - Nguyen, Viet Ha Y1 - 2018/// N2 - Hanoi is the one of the fastest-growing cities in Vietnam, which sets the target to turn into a smart city in 2030. Nowadays, 3D city models are being increasingly employed for many domains and tasks beyond visualization, then it will take an important role in smart city. In order to develop 3D city models, 2D geographic data such as building footprint and building height attribute are required. However, the lack of the height attribute for various types of building and low performance of rendering and visualizing 3D city models are two big remaining problems. In this paper, available data from open sources is used to predict the building height. The prediction has carried out with machine learning techniques using the combination of different attributes. After that, the models will be created using 3D tiles specification to improve the visualization performance. The preliminary results of the proposed method highlight the potential of generation of massive 3D city models from the available data in Vietnam. TI - Preliminary Result of 3D City Modelling For Hanoi, Vietnam M2 - Ho Chi Minh city, Vietnam AV - none T2 - 2018 The 5th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - CONF ID - SisLab2769 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2769/ A1 - Phan, Anh A1 - Man, Duc Chuc A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2017/// TI - Development of Virtual Campus Using 3D GIS Technology: a case study for Vietnam National University, Hanoi. AV - none T2 - The 9th International Conference on Knowledge and Systems Engineering (KSE 2017), 19-21 October 2017, Hue, Vietnam ER - TY - RPRT ID - SisLab3201 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3201/ A1 - Phan, Huy Kinh A1 - Dang, Thanh Hai Y1 - 2018/// PB - VNU University of Engineering and Technology VL - UET-FIT-2018xyz M1 - technical_report TI - Protein structure prediction using Deep Learning AV - public ER - TY - CONF ID - SisLab2301 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2301/ A1 - Phan, Xuan Hieu A1 - Horiguchi, Susumu A1 - Nguyen, Le Minh A1 - Nguyen, Cam Tu Y1 - 2007/09/19/ TI - Semantic Analysis of Entity Contexts towards Open Named Entity Classification on the Web SP - 137 M2 - Melbourne, Australia AV - none EP - 144 T2 - The 10th Conference of the Pacific Association for Computational Linguistics (PACLING) ER - TY - JOUR ID - SisLab1888 UR - http://doi.org/10.1109/TKDE.2010.27 IS - 7 A1 - Phan, Xuan Hieu A1 - Nguyen, Cam Tu A1 - Le, Dieu Thu A1 - Nguyen, Le Minh A1 - Horiguchi, Susumu A1 - Ha, Quang Thuy Y1 - 2011/// N2 - This paper introduces a hidden topic-based framework for processing short and sparse documents (e.g., search result snippets, product descriptions, book/movie summaries, and advertising messages) on the Web. The framework focuses on solving two main challenges posed by these kinds of documents: 1) data sparseness and 2) synonyms/homonyms. The former leads to the lack of shared words and contexts among documents while the latter are big linguistic obstacles in natural language processing (NLP) and information retrieval (IR). The underlying idea of the framework is that common hidden topics discovered from large external data sets (universal data sets), when included, can make short documents less sparse and more topic-oriented. Furthermore, hidden topics from universal data sets help handle unseen data better. The proposed framework can also be applied for different natural languages and data domains. We carefully evaluated the framework by carrying out two experiments for two important online applications (Web search result classification and matching/ranking for contextual advertising) with large-scale universal data sets and we achieved significant results. JF - IEEE Transactions on Knowledge and Data Engineering VL - 23 SN - 1041-4347 TI - A Hidden Topic-Based Framework toward Building Applications with Short Web Documents SP - 961 AV - none EP - 976 ER - TY - CONF ID - SisLab2297 UR - http://doi.org/10.1145/1367497.1367510 A1 - Phan, Xuan Hieu A1 - Nguyen, Le Minh A1 - Horiguchi, Susumu Y1 - 2008/04/21/ TI - Learning to classify short and sparse text & web with hidden topics from large-scale data collections SP - 91 M2 - Beijing, China AV - none EP - 100 T2 - The 17th International World Wide Web Conference (WWW) ER - TY - JOUR ID - SisLab2303 UR - http://search.ieice.org/bin/summary.php?id=e90-d_1_13&category=D&year=2007&lang=E&abst= IS - 1 A1 - Phan, Xuan Hieu A1 - Nguyen, Le Minh A1 - Inoguchi, Yasushi A1 - Horiguchi, Susumu Y1 - 2007/01/01/ PB - IEICE JF - IEICE Transactions on Information and Systems VL - E90-D SN - 0916-8532 TI - High-Performance Training of Conditional Random Fields for Large-scale Applications of Labeling Sequence Data SP - 13 AV - none EP - 21 ER - TY - INPR ID - SisLab3452 UR - https://www.bmsb2019.org/main.do A1 - Phi, Cong Huy A1 - Stuart, Perry A1 - Hoang, Van Xiem Y1 - 2019/06/06/ N2 - Compressing Light Field (LF) imaging data is a challenging but very important task for both LF image transmission and storage applications. In this paper, we propose a novel coding solution for LF images using the well-known Wyner-Ziv information theorem. First, the LF image is decomposed into 4D LF data format. Using a spiral scanning mechanismprocedure, a pseudo-sequence of LF 4D images is generated. This sequence is then compressed in a distributed coding manner as specified in the Wyner-Ziv theorem. In this context, low computational complexity can be achieved at the encoder since the high computational complexity motion estimation part is shifted to the decoderá commonly. In addition, we introduce a novel adaptive frame skipping algorithm to further explore the high correlation between 4D LF images. Experimental results show that the proposed WZ coding based LF image is able to achieve a significant compression gain, notably around 54% bitrate saving when compared with the standard High Efficiency Video Coding (HEVC) Intra benchmark while requiring less computational complexity. TI - A LOW COMPLEXITY WYNER-ZIV CODING SOLUTION FOR LIGHT FIELD IMAGE TRANSMISSION AND STORAGE SP - 1 AV - public EP - 5 T2 - IEEE International Symposium on Broadband Multimedia Systems and Broadcasting 2019 ER - TY - INPR ID - SisLab4075 UR - https://doi.org/10.1016/j.asoc.2020.106705 A1 - Phung, Manh Duong A1 - Ha, Quang Y1 - 2020/09/10/ N2 - This paper presents a novel algorithm named the motion-encoded particle swarm optimization (MPSO) for finding a moving target with unmanned aerial vehicles (UAVs). From the Bayesian theory, the search problem can be converted to the optimization of a cost function that represents the probability of detecting the target. Here, the proposed MPSO is developed to solve that problem by encoding the search trajectory as a series of UAV motion paths evolving over the generation of particles in a PSO algorithm. This motion-encoded approach allows for preserving important properties of the swarm including the cognitive and social coherence, and thus resulting in better solutions. Results from extensive simulations with existing methods show that the proposed MPSO improves the detection performance by 24\% and time performance by 4.71 times compared to the original PSO, and moreover, also outperforms other state-of-the-art metaheuristic optimization algorithms including the artificial bee colony (ABC), ant colony optimization (ACO), genetic algorithm (GA), differential evolution (DE), and tree-seed algorithm (TSA) in most search scenarios. Experiments have been conducted with real UAVs in searching for a dynamic target in different scenarios to demonstrate MPSO merits in a practical application. PB - Elsevier JF - Applied Soft Computing SN - 1568-4946 TI - Motion-Encoded Particle Swarm Optimization for Moving Target Search Using UAVs AV - public ER - TY - JOUR ID - SisLab4436 UR - https://doi.org/10.1016/j.asoc.2021.107376 A1 - Phung, Manh Duong A1 - Quang, Ha Y1 - 2021/08// N2 - This paper presents a new algorithm named spherical vector-based particle swarm optimization (SPSO) to deal with the problem of path planning for unmanned aerial vehicles (UAVs) in complicated environments subjected to multiple threats. A cost function is first formulated to convert the path planning into an optimization problem that incorporates requirements and constraints for the feasible and safe operation of the UAV. SPSO is then used to find the optimal path that minimizes the cost function by efficiently searching the configuration space of the UAV via the correspondence between the particle position and the speed, turn angle and climb/dive angle of the UAV. To evaluate the performance of SPSO, eight benchmarking scenarios have been generated from real digital elevation model maps. The results show that the proposed SPSO outperforms not only other particle swarm optimization (PSO) variants including the classic PSO, phase angle-encoded PSO and quantum-behave PSO but also other state-of-the-art metaheuristic optimization algorithms including the genetic algorithm (GA), artificial bee colony (ABC), and differential evolution (DE) in most scenarios. In addition, experiments have been conducted to demonstrate the validity of the generated paths for real UAV operations. Source code of the algorithm can be found at https://github.com/duongpm/SPSO. PB - Elsevier JF - Applied Soft Computing VL - 107 SN - 1568-4946 TI - Safety-enhanced UAV Path Planning with Spherical Vector-based Particle Swarm Optimization SP - 107376 AV - public EP - 107376 ER - TY - INPR ID - SisLab4467 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4467/ A1 - Phung, Van On A1 - Le, Viet Ha A1 - Nguyen, Ngoc Hoa Y1 - 2021/08// JF - T?p chí An toàn thông tin SN - 1859-1256 TI - Gi?i pháp qu?n lý, ?ánh giá r?i ro an toàn h? th?ng Công ngh? Thông tin trong Chính ph? ?i?n t? AV - none ER - TY - JOUR ID - SisLab3297 UR - https://www.mdpi.com/2313-433X/4/7/90 IS - 7 A1 - Prativadibhayankaram, Srivatsa A1 - Huynh, Van Luong A1 - Le, Thanh Ha A1 - Kaup, André Y1 - 2018/// N2 - In the context of video background?foreground separation, we propose a compressive online Robust Principal Component Analysis (RPCA) with optical flow that separates recursively a sequence of video frames into foreground (sparse) and background (low-rank) components. This separation method operates on a small set of measurements taken per frame, in contrast to conventional batch-based RPCA, which processes the full data. The proposed method also leverages multiple prior information by incorporating previously separated background and foreground frames in an n-?1 minimization problem. Moreover, optical flow is utilized to estimate motions between the previous foreground frames and then compensate the motions to achieve higher quality prior foregrounds for improving the separation. Our method is tested on several video sequences in different scenarios for online background?foreground separation given compressive measurements. The visual and quantitative results show that the proposed method outperforms other existing methods. JF - Journal of Imaging VL - 4 TI - Compressive Online Video Background?Foreground Separation Using Multiple Prior Information and Optical Flow AV - none ER - TY - CONF ID - SisLab2755 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2755/ A1 - Prativadibhayankaram, Srivatsa A1 - Luong, Van Huynh A1 - Le, Thanh Ha A1 - Kaup, Andre Y1 - 2017/// TI - Compressive Online Robust Principal Component Analysis with Optical Flow for Video Foreground-Background Separation AV - none M2 - Nha Trang T2 - The 8th International Symposium on Information and Communication Technology (SoICT) ER - TY - CONF ID - SisLab1548 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1548/ A1 - Quach, Xuan Truong Y1 - 2016/03/26/ N2 - Trong m?t vài th?p k? tr? l?i ?ây, s? l??ng các thi?t b? di ??ng không dây ngày càng tr? nên ph? bi?n. ?i kèm v?i nó là các ??i h?i và nhu c?u s? d?ng v? các d?ch v? ch?t l??ng cao nh? truy?n thông ?a ph??ng ti?n, VoIP, VIDEO ngày càng t?ng lên Nhu c?u c?p phát d?i t?n s? cho các d?ch v? m?ng không dây t?ng lên m?t cách ?áng k? d?n ??n c?n ki?t ngu?n tài nguyên t?n s?. Tuy nhiên, trong quá trình ?o ??c v? m?c ?? s? d?ng t?i ?u t?n s? ?ã ch? ra r?ng ph?n l?n các d?i t?n c?p phát ?ang b? s? d?ng m?t cách kém hi?u qu?, mà nguyên nhân bao g?m vi?c cách c?p phát, qu?n lý và khai thác kém hi?u qu? . ?? t?n d?ng m?t cách hi?u qu? các d?i t?n s?, m?t ph??ng pháp s? d?ng và qu?n lý các d?i t?n s? m?i ???c ???c ?? xu?t b?i J Mitola v?i tên g?i m?ng vô tuy?n nh?n th?c - Cognitive radio networks (CRNs). Gi?i pháp này ???c xem nh? là m?t b??c tiên phong cho các th? h? ti?p theo c?a m?ng không dây. Tuy nhiên, CRNs c?ng ??i m?t v?i nh?ng thách th?c. Vi?c ?ánh giá, l?a ch?n và qu?n lý ph? t?n nh? th? nào ?? phù h?p cho nhu c?u truy?n hi?n t?i c?a các ??i t??ng trong h? th?ng m?ng là m?t trong nh?ng thách th?c không nh? ??i v?i CRNs. M?t khác, v?i tính ch?t truy?n thông qu?ng bá t? nhiên c?a các m?ng không dây nói chung, b?t k? ng??i nh?n nào trong ph?m vi c?a m?t truy?n d?n không dây ??u có kh? n?ng nghe ???c thông tin truy?n ?i. Do ?ó, b?o m?t thông tin là m?i quan tâm then ch?t trong các m?ng không dây. Do có ?? ph?c t?p và ?? tr? th?p, c?ng nh? tính kh? thi ? l?p v?t lý và kh? n?ng cùng t?n t?i v?i các c? ch? b?o m?t mã hóa hi?n có mà nó có th? nâng cao m?c ?? t?ng th? v? an toàn thông tin. Vì v?y, b?o m?t ? l?p v?t lý ?ã và ?ang thu hút ???c s? quan tâm nghiên c?u c?a các h?c gi? trên kh?p th? gi?i trong th?i gian g?n ?ây. Trong ph?m vi mô hình m?ng CRNs khi có nhi?u ng??i dùng ??ng th?i trong cùng b?ng t?n thì m?c công su?t c?a m?i ng??i dùng c?n ph?i ???c ?i?u khi?n sao cho có th? gi?m nh? nhi?u không mong mu?n, ??ng th?i c?ng ph?i ?áp ?ng ???c nhu c?u b?o m?t thông tin, b?o v? ch?ng l?i s? xâm nh?p ho?c rò r? thông tin. Vì v?y, kh? n?ng ??m b?o b?o m?t thông tin c?a m?ng CRNs nh? th? nào là v?n ?? ???c nhi?u ng??i quan tâm. D?a trên nh?ng hi?n tr?ng ? trên, nghiê c?u sinh ?ã l?a ch?n ?? tài ??ánh giá hi?u n?ng b?o m?t t?i t?ng v?t lý trong m?ng không dây? nh?m nghiên c?u, ?ánh giá các v?n ?? liên quan ??n hi?u su?t ho?t ??ng và kh? n?ng b?o m?t thông tin c?a các mô hình m?ng nêu trên, góp ph?n vào gi?i quy?t các thách th?c và khó kh?n trong vi?c hi?n th?c hóa h? th?ng m?ng vô tuy?n nh?n th?c vào th?c ti?n, làm cho công ngh? m?ng không dây linh ho?t, thích nghi, ??t hi?u qu? cao và an toàn trong liên l?c không dây. TI - Báo cáo tóm t?t ?? tài nghiên c?u M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3387 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3387/ A1 - Quach, Xuan Truong A1 - Tran, Hung A1 - Uhlemann, Elisabeth A1 - Tran, Truc Mai Y1 - 2017/// N2 - Although cognitive radio networks (CRNs) were originally intended as a powerful solution to enhance spectrum utilization, it can also be used to improve reliability by avoiding interference in the 2.4 or 5 GHz band. Using multiple relay nodes in CRNs, the outage probability, i.e., the probability that the endto-end signal-to-noise ratio drops below a predefined threshold, can be reduced significantly. This implies that the probability that a message is not delivered within a specific time frame, can be kept below a required threshold, even when there are constraints on energy efficiency in terms of peak transmit power. This is particularly useful for industrial networks with realtime constraints. However, using CRNs may also reveal secret information to eavesdroppers (EAVs). Therefore, guaranteeing secure and reliable communications in CRNs is still a challenging problem. To this end, the secrecy performance of a proactive decode-and-forward relaying scheme in a cognitive cooperative radio network is investigated. More specifically, analytical as well as approximate expressions for the secrecy outage probability and probability of non-zero secrecy capacity are derived to evaluate the system performance. Numerical results show that the approximation tightly match the analytical results and simulations, and thus it can be used to provide a fast evaluation of the security and reliability of communications using a considered assignment of relay nodes in a cognitive cooperative radio network (CCRN). Consequently, our results enable to secure the communication, and increasing the reliability, availability, robustness, and maintainability of wireless industrial network, subject to various constraints from the CRN TI - Secrecy Performance of Cognitive Cooperative Industrial Radio Networks M2 - Limassol, Cyprus AV - public T2 - 22nd IEEE International Conference on Emerging Technologies and factory automation ER - TY - JOUR ID - SisLab3995 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3995/ A1 - Quach, Xuan Truong A1 - Tran, Hung A1 - Uhlemann, Elisabeth A1 - Tran, Truc Mai Y1 - 2020/// N2 - In this paper, we investigate the secrecy performance of a Cooperative Cognitive Radio Network (CCRN) in the presence of an eavesdropper (EAV). The secondary users (SUs) are subject to three constraints which include peak transmit power level and interference limitation with respect to the primary user (PU) as well as secrecy outage constraints due to the EAV. Secrecy outage is achieved when the EAV cannot decode the targeted signal, but communications in the secondary network is still possible (non-zero capacity exists). Approximation expressions of the secrecy outage probability and the probability of non-zero secrecy capacity are derived to evaluate the secrecy performance. Monte Carlo simulations are provided to examine the accuracy of the derived approximation expressions. Based on this, power allocation policies for the SUs are derived, satisfying all the constraints while maximizing the secrecy performance as well as the quality of service performance of the secondary network. It can be concluded that with knowledge of the channel state information (CSI) of the EAV it is possible to calculate the optimal value for the secrecy outage threshold of the secondary user (SU) which in turn allows maximizing the secrecy performance. Most interestingly, our numerical results illustrate that the secrecy performance of the system is much improved when the parameters obtained using the CSI of the EAV are calculated optimally. Thence, the system can adjust the power allocation so that no eavesdropping occurs even without reducing quality of service (QoS) performance compared to a network without any EAV. JF - IEEE Access VL - 8 SN - ISSN: 2169-3536 TI - Secrecy Performance of Cooperative Cognitive Radio Networks Under Joint Secrecy Outage and Primary User Interference Constraints SP - 18442 AV - public EP - 18442 ER - TY - JOUR ID - SisLab2076 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2076/ IS - 10 A1 - Remmerie, Noor A1 - De Vijlder, Thomas A1 - Laukens, Kris A1 - Dang, Thanh Hai A1 - Lemiere, Filip A1 - Mertens, Inge A1 - Valkenborg, Dirk A1 - Blust, Ronny A1 - Witters, Erwin Y1 - 2011/// PB - Pergamon JF - Phytochemistry VL - 72 SN - 0031-9422 TI - Next generation functional proteomics in non-model plants: a survey on techniques and applications for the analysis of protein complexes and post-translational modifications SP - 1192 AV - none EP - 1218 ER - TY - CONF ID - SisLab2645 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2645/ A1 - Salem, Benferhat A1 - Zied, Bouraoui A1 - Ma, Thi Chau A1 - Sylvain, Lagrue A1 - Julien, Rossit Y1 - 2017/01// TI - A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption AV - none M2 - Portugal T2 - 9th International Conference on Agents and Artificial Intelligence (ICCART) ER - TY - CONF ID - SisLab3924 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3924/ A1 - Sanya, Praseuth A1 - Pham, Tuan Dung A1 - Man, Duc Chuc A1 - Bui, Quang Hung A1 - Nguyen, Thi Nhat Thanh Y1 - 2019/// TI - Mapping Land Cover Types in Vientiane, Laos Using Multi-Temporal Composite Landsat 8 Images AV - none M2 - Hanoi T2 - 2019 6th NAFOSTED Conference on Information and Computer Science (NICS) 2019 6th NAFOSTED Conference on Information and Computer Science (NICS) ER - TY - JOUR ID - SisLab1844 UR - http://doi.org/10.1080/15501320500201235 IS - 2 A1 - Seetharaman, Guna A1 - Le, Vu Ha Y1 - 2006/06// JF - International Journal of Distributed Sensor Networks VL - 2 SN - 1550-1329 TI - Video-Assisted Global Positioning in Terrain Navigation with Known Landmarks SP - 103 AV - none EP - 119 ER - TY - BOOK ID - SisLab3158 UR - https://dblp.uni-trier.de/db/conf/aciids/aciids2018p.html IS - 769 A1 - Sieminski, Andrzej A1 - Kozierkiewicz,, Adrianna A1 - Nunez, Manuel A1 - Ha, Quang Thuy Y1 - 2018/// PB - Springer T3 - Studies in Computational Intelligence 769 SN - ISBN 978-3-319-76080-3 ED - Sieminski, Andrzej ED - Kozierkiewicz,, Adrianna ED - Nunez, Manuel ED - Ha, Quang Thuy TI - Modern Approaches for Intelligent Information and Database Systems. AV - public ER - TY - JOUR ID - SisLab3923 UR - https://www.mdpi.com/1424-8220/20/2/405 IS - 2 A1 - Ta, Viet Cuong A1 - Dao, Trung Kien A1 - Vaufreydaz, Dominique A1 - Castelli, Eric Y1 - 2020/01/10/ N2 - For the localization of multiple users, Bluetooth data from the smartphone is able to complement Wi?Fi?based methods with additional information, by providing an approximation of the relative distances between users. In practice, both positions provided by Wi?Fi data and relative distance provided by Bluetooth data are subject to a certain degree of noise due to the uncertainty of radio propagation in complex indoor environments. In this study, we propose and evaluate two approaches, namely Non?temporal and Temporal ones, of collaborative positioning to combine these two cohabiting technologies to improve the tracking performance. In the Non?temporal approach, our model establishes an error observation function in a specific interval of the Bluetooth and Wi?Fi output. It is then able to reduce the positioning error by looking for ways to minimize the error function. The Temporal approach employs an extended error model that takes into account the time component between users? movements. For performance evaluation, several multi?user scenarios in an indoor environment are set up. Results show that for certain scenarios, the proposed approaches attain over 40% of improvement in terms of average accuracy PB - MDPI JF - Sensors VL - 20 SN - 1424-8220 TI - Collaborative Smartphone-Based User Positioning in a Multiple-User Context Using Wireless Technologies AV - public ER - TY - CONF ID - SisLab3215 UR - https://ieeexplore.ieee.org/document/8533809 A1 - Ta, Viet Cuong A1 - Dao, Trung Kien A1 - Vaufreydaz, Dominique A1 - Castelli, Eric Y1 - 2018/09/24/ N2 - In a multi-user context, the Bluetooth data from the smartphone could give an approximation of the distance between users. Meanwhile, the Wi-Fi data can be used to calculate the user?s position directly. However, both the Wi-Fi-based position outputs and Bluetooth-based distances are affected by some degree of noise. In our work, we propose several approaches to combine the two types of outputs for improving the tracking accuracy in the context of collaborative positioning. The two proposed approaches attempt to build a model for measuring the errors of the Bluetooth output and Wi-Fi output. In a non-temporal approach, the model establishes the relationship in a specific interval of the Bluetooth output and Wi-Fi output. In a temporal approach, the error measurement model is expanded to include the time component between users? movement. To evaluate the performance of the two approaches, we collected the data from several multi-user scenarios in indoor environment. The results show that the proposed approaches could reach a distance error around 3.0m for 75 percent of time, which outperforms the positioning results of the standard Wi-Fi fingerprinting model. TI - Smartphone-based user positioning in a multiple-user context with Wi-Fi and Bluetooth SP - 206 M2 - Nantes, France AV - none EP - 212 T2 - 2018 International Conference on Indoor Positioning and Indoor Navigation (IPIN) ER - TY - CONF ID - SisLab2128 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2128/ A1 - Ta, Viet Cuong A1 - Vu, Thi Hong Nhan A1 - Bui, The Duy Y1 - 2012/01// TI - A Multi-Agent Architecture for Smart Home AV - none M2 - Vietnam T2 - International Conference on Convergence Technology ER - TY - JOUR ID - SisLab2236 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2236/ A1 - Tan, Nguyen Duy A1 - Viet, Nguyen Dinh Y1 - 2014/// N2 - A unique challenge for designing routing protocols in wireless sensor network (WSN) is how to use energy efficiency. To solve this problem, in this paper, we propose data fusion and chain-base routing protocol (DFCB). In DFCB designing consists of two main works. In the first work, the chain-based routing technique is used to connect sensor nodes into a chain where each node communicates only with a nearest neighbor using distance and remaining energy of nodes to decide which node will be the chain leader. In the second work, we fuse and compress one or more packets to generate a less than size resultant packet base on the Slepian-Wolf and Dempster-Shafer theory. Simulation results show that the network lifetime of our proposed protocol can be improved about 370% and 20% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively. JF - K? y?u H?i ngh? Khoa h?c Công ngh? Qu?c gia l?n th? VII v? Nghiên c?u c? b?n và ?ng d?ng Công ngh? thông tin (FAIR'7) VL - 2 SN - ISBN 978-604-913-300-8 TI - DFCB: DATA FUSION AND CHAIN-BASED ROUTING PROTOCOL FOR ENERGY-EFFICIENT IN WIRELESS SENSOR NETWORK SP - 102 AV - none EP - 111 ER - TY - JOUR ID - SisLab2234 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2234/ A1 - Tan, Nguyen Duy A1 - Viet, Nguyen Dinh Y1 - 2014/// N2 - Energy efficiency is a unique challenge for designing routing protocols in wireless sensor network (WSN) to extend the lifetime of the entire network because sensor nodes are power constrained devices. To solve this problem, in this paper, we propose a data fusion and tree-based clustering routing algorithm (DFTBC). DFTBC designing consists of two main works. In the first work, tree-based clustering routing technique is used to connect the nodes in a cluster to form a minimum spanning tree, where each node communicates only with its nearest neighbor using distance and remaining energy of nodes to decide which node will be the cluster head (CH). In the second work, we fuse one or more packets to generate a packet with a smaller size based on the Dempster-Shafer and Slepian-Wolf theory. Our simulation results show that the network lifetime with using of our proposed protocol can be improved about 350% and 35% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively. JF - Proceedings of the Sixth International Conference KSE 2014 VL - 2 TI - DFTBC: Data Fusion and Tree-Based Clustering Routing Protocol for Energy-Efficient in Wireless Sensor Networks SP - 61 AV - none EP - 77 ER - TY - CONF ID - SisLab2231 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2231/ A1 - Tan, Nguyen Duy A1 - Viet, Nguyen Dinh Y1 - 2015/// N2 - One of the most important challenges in heterogeneous wireless sensor network (WSN) is to design a routing protocol that use energy efficiently to prolong the lifetime of the entire network due to the limited battery power of sensor nodes. To solve this problem, in this paper, we propose Sector-Chain Based Clustering (SCBC) Routing Protocol, in which, entire network area is divided into sectors (clusters), which balance to the number of nodes. SCBC further reduces energy dissipation of communication in network by constructing chain for each cluster with the chain leader as the cluster head (CH) or secondary cluster head (SCH) that has high residual energy and the shortest distance between candidate nodes and base station (BS) in network. In addition, SCBC improves energy efficiency by calculating the time length of each round in the steady data transmission phase for CHs or SCHs but still guarantee that it is alive in next round. Our simulation results show that the network lifetime of our proposed protocol can be improved about 70% and 20% in comparison with PEGASIS (Power-Efficient Gathering in Sensor Information System) and IEEPB (An Improved Energy- Efficient PEGASIS-Based) protocols, respectively. Index Terms?Wireless Sensor Networks, heterogeneous sensor network, energy efficiency, routing protocol, chain-based. VL - 2 TI - SCBC: Sector-Chain Based Clustering Routing Protocol for Energy Efficiency in Heterogeneous Wireless Sensor Network SP - 314 M2 - Ho Chi Minh city, Vietnam AV - public EP - 319 T2 - The 2015 International Conference Advanced Technologies for Communications (ATC) ER - TY - CONF ID - SisLab2230 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2230/ A1 - Tan, Nguyen Duy A1 - Viet, Nguyen Dinh Y1 - 2015/// N2 - Abstract?Since sensor nodes are battery power constrained devices in wireless sensor network (WSN), so how to use the energy of sensor nodes efficiently to prolong the network lifetime is a chief challenge for designing routing protocols. To solve this problem, in this paper, we propose sleep scheduled and tree-based clustering approach routing algorithm (SSTBC) for energy-efficient in WSN. SSTBC preserves energy by turning off radio (entering sleep mode) of either impossible or unnecessary nodes, which observe almost the same information, base on their location information to remove redundant data. In addition, to further reduce energy dissipation of communication in network, we build minimum spanning tree with the root as the cluster head (CH) from active nodes in a cluster to forward data packets to base station (BS). Our simulation results show that the network lifetime with using of our proposed protocol can be improved about 250% and 23% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively. Keywords?Wireless Sensor Networks, energy-efficient, routing protocol, tree-based clustering. VL - 2 SN - 978-1-4799-8043-7 TI - SSTBC: Sleep Scheduled and Tree-Based Clustering Routing Protocol for Energy-Efficient in Wireless Sensor Networks SP - 180 M2 - Can Tho, Vietnam AV - public EP - 185 T2 - The 2015 IEEE RIVF International Conference on Computing Communication Technologies - Research, Innovation, and Vision for the Future ER - TY - CONF ID - SisLab1636 UR - http://dx.doi.org/10.1007/978-3-662-49390-8_22 A1 - Thi Le, Ngoc Anh A1 - Ngo, Thi Oanh A1 - Thi Lai, Huyen Trang A1 - Le, Hoang Quynh A1 - Nguyen, Hai Chau A1 - Ha, Quang Thuy Y1 - 2016/// VL - 9622 SN - 0302-9743 TI - An Experimental Study on Cholera Modeling in Hanoi SP - 230 M2 - Da Nang, Vietnam AV - none EP - 240 T2 - The 8th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - RPRT CY - VNU-UET ID - SisLab3053 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3053/ A1 - To, Van Khanh A1 - Nguyen, Thi Van Anh A1 - Nguyen, Thi Thuy Y1 - 2018/07/26/ N2 - This paper gives an overview of modern symbolic execution techniques and presents a tool VTSE (Verification Tool based on Symbolic Execution) which allows users to verify some properties of C/C++ program based on symbolic execution technique. As two inputs including program?s source code and user?s assertion, VTSE reports whether user?s assertion are always satisfied with the program. Results of experiments performed on two sets of benchmark which are Floats-cdfpl (SV-COMP) and Kratos (FBK-IRST) are relatively positive. As for the former, VTSE has a greater advantage in solving speed although not all the problems are solved. Moreover, VTSE is also able to verify problems in Kratos benchmark which have a large number lines of code with about 500 ? 2000 LOC. PB - VNU-UET M1 - technical_report TI - VTSE ? Verification Tool based on Symbolic Execution AV - public EP - 10 ER - TY - JOUR ID - SisLab3267 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3267/ IS - 6 A1 - Toh, Kar-Ann A1 - Tran, Quoc Long A1 - Srinivasan, Dipti Y1 - 2004/// PB - IEEE JF - IEEE Transactions on pattern analysis and machine intelligence VL - 26 SN - 0162-8828 TI - Benchmarking a reduced multivariate polynomial pattern classifier SP - 740 AV - public EP - 755 ER - TY - CHAP ID - SisLab3276 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3276/ A1 - Toh, Kar-Ann A1 - Tran, Quoc Long A1 - Srinivasan, Dipti Y1 - 2007/// PB - Springer TI - Hyperbolic function networks for pattern classification SP - 1 AV - none EP - 33 T2 - Trends in Neural Computation ER - TY - CHAP ID - SisLab3274 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3274/ A1 - Toh, Kar-Ann A1 - Tran, Quoc Long A1 - Yau, Wei-Yun Y1 - 2004/// PB - Springer TI - Some issues pertaining to adaptive multimodal biometric authentication SP - 617 AV - none EP - 628 T2 - Advances in Biometric Person Authentication ER - TY - JOUR ID - SisLab1471 UR - http://www.worldscientific.com/doi/abs/10.1142/S1793005715400013 IS - 2 A1 - Tran, Dang Hien A1 - Do, Van Tuan A1 - Pham, Van At A1 - Le, Hung Son Y1 - 2015/// N2 - Non-negative matrix factorization (NMF) is an emerging technique with a wide spectrum of potential applications in data analysis. Mathematically, NMF can be formulated as a minimization problem with non-negative constraints. This problem attracts much attention from researchers for theoretical reasons and for potential applications. Currently, the most popular approach to solve NMF is the multiplicative update algorithm proposed by Lee and Seung. In this paper, we propose an additive update algorithm that has a faster computational speed than Lee and Seung's multiplicative update algorithm. PB - World Scientific JF - Journal of New Mathematics and Natural Computation VL - 11 SN - 1793-7027 TI - Novel Algorithm for Nonnegative Matrix Factorization SP - 121 AV - none EP - 133 ER - TY - RPRT ID - SisLab3204 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3204/ A1 - Tran, Dinh Duong A1 - Nguyen, Manh Hung A1 - Pham, Ngoc Hung Y1 - 2018/// PB - VNU University of Engineering and Technology VL - UET-FIT-2018xyz M1 - technical_report TI - A method of Automated User Interface Testing for Windows-based Applications AV - public ER - TY - CONF ID - SisLab4037 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4037/ A1 - Tran, Dinh Duong A1 - Ogata, Kazuhiro Y1 - 2020/// N2 - Anderson protocol is a mutual exclusion protocol. It uses a finite Boolean array shared by all processes and the modulo (or remainder) operation of natural numbers. This is why it is challenging to formally verify that the protocol enjoys the mutual exclusion property in a sense of theorem proving. Then, we make an abstract version of the protocol called A-Anderson protocol that uses an infinite Boolean array instead. We describe how to formally specify A-Anderson protocol in CafeOBJ, an algebraic specification language and how to formally verify that the protocol enjoys the mutual exclusion property in three ways: (1) by writing proof scores in CafeOBJ, (2) with a proof assistant CiMPA for CafeOBJ and (3) with a proof generator CiMPG for CafeOBJ. We mention how to formally verify that Anderson protocol enjoys the property by showing that A-Anderson protocol simulates Anderson protocol. TI - Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG M2 - Wyndham Pittsburgh University Center, Pittsburgh, USA AV - public T2 - International Conference on Software Engineering and Knowledge Engineering ER - TY - CONF ID - SisLab4284 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4284/ A1 - Tran, Dinh Duong A1 - Ogata, Kazuhiro A1 - Bui, Duy Dang A1 - Gupta, Parth Y1 - 2020/12/04/ N2 - Lemma conjecture is one of the most challenging tasks in theorem proving. The paper focuses on invariant properties (or invariants) of state machines. Thus, lemmas are also invariants. To prove that a state predicate p is an invariant of a state machine M, in general, we need to find an inductive invariant q of M such that q(s) implies p(s) for all states s of M. q is often in the form p?p', and p' is often in the form q1 ?...?qn. q1, ..., qn are the lemmas of the proof that p is an invariant of M. The paper proposes a technique called Lemma Weakening (LW). LW replaces qi with qi' such that qi(s) implies qi'(s) for all states s of M, which can make the proof reasonably tractable that may become otherwise unreasonably hard. MCS mutual exclusion protocol is used as an example to demonstrate the power of LW. TI - Lemma Weakening for State Machine Invariant Proofs AV - public T2 - THE 27TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE ER - TY - INPR ID - SisLab3124 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3124/ A1 - Tran, Dinh Duong A1 - Pham, Ngoc Hung A1 - Nguyen, Duy Tung Y1 - 2018/// TI - A Method for Automated User Interface Testing of Windows-based Applications AV - none M2 - Da Nang City, Viet Nam T2 - 2018 the 9th International Symposium on Information and Communication Technology (SoICT) ER - TY - JOUR ID - SisLab3951 UR - http://dx.doi.org/10.3390/electronics9040684 IS - 4 A1 - Tran, Dinh Lam A1 - Tran, Xuan Tu A1 - Bui, Duy Hieu A1 - Pham, Cong Kha Y1 - 2020/// N2 - HEVC-standardized encoders employ the CABAC (context-based adaptive binary arithmetic coding) to achieve high compression ratios and video quality that supports modern real-time high-quality video services. Binarizer is one of three main blocks in a CABAC architecture, where binary symbols (bins) are generated to feed the binary arithmetic encoder (BAE). The residual video data occupied an average of 75% of the CABAC?s work-load, thus its performance will significantly contribute to the overall performance of whole CABAC design. This paper proposes an efficient hardware implementation of a binarizer for CABAC that focuses on low area cost, low power consumption while still providing enough bins for high-throughput CABAC. On the average, the proposed design can process upto 3.5 residual syntax elements (SEs) per clock cycle at the maximum frequency of 500 MHz with an area cost of 9.45 Kgates (6.41 Kgates for the binarizer core) and power consumption of 0.239 mW (0.184 mW for the binarizer core) with NanGate 45 nm technology. It shows that our proposal achieved a high overhead-efficiency of 1.293 Mbins/Kgate/mW, much better than the other related high performance designs. In addition, our design also achieved a high power-efficiency of 8288 Mbins/mW; this is important factor for handheld applications. PB - MDPI JF - Electronics VL - 9 SN - 2079-9292 TI - An Efficient Hardware Implementation of Residual Data Binarization in HEVC CABAC Encoder SP - subjects AV - none EP - IT ER - TY - CONF ID - SisLab2258 UR - http://dx.doi.org/10.1109/KSE.2016.7758035 A1 - Tran, Duc Duong A1 - Tan, Hanh A1 - Pham, Son Bao Y1 - 2016/// TI - Customer gender prediction based on E-commerce data SP - 91 M2 - Hanoi, Vietnam AV - none EP - 95 T2 - The 8th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - RPRT ID - SisLab3203 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3203/ A1 - Tran, Duc Toan A1 - Pham, Ngoc Hung Y1 - 2018/// PB - VNU University of Engineering and Technology VL - UET-FIT-2018xyz M1 - technical_report TI - "Smart Codefun": A tool supporting programming skills for students AV - public ER - TY - CONF ID - SisLab1297 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1297/ A1 - Tran, Hoang Viet A1 - Le, Chi Luan A1 - Nguyen, Quang Trung A1 - Pham, Ngoc Hung Y1 - 2014/10// TI - An Efficient Method for Automated Generating Models of Component-Based Software. AV - none M2 - Hanoi, Vietnam T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab1985 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1985/ A1 - Tran, Hoang Viet A1 - Le, Chi Luan A1 - Pham, Ngoc Hung Y1 - 2016/11// N2 - This paper presents a method for generating strongest assumptions during component-based software veri?cation. The key idea of this method is to improve the technique for answering membership queries of the Teacher when responding to the Learner in the TI - A Strongest Assumption Generation Method for Component-Based Software Verification SP - 1 M2 - Hanoi, Vietnam AV - public EP - 6 T2 - The 2016 IEEE RIVF International Conference on Computing and Communication Technologies ER - TY - INPR ID - SisLab3598 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3598/ A1 - Tran, Hoang Viet A1 - Nguyen, Quang-Trung A1 - Pham, Ngoc Hung Y1 - 2019/12// TI - On Implementation of the Improved Assume-Guarantee Verification Method for Timed Systems AV - public M2 - Ha Long Bay, Quang Ninh, Vietnam T2 - THE 10TH INTERNATIONAL SYMPOSIUM ON INFORMATION AND COMMUNICATION TECHNOLOGY ER - TY - JOUR ID - SisLab3500 UR - http://www.jcsce.vnu.edu.vn IS - 2 A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung Y1 - 2018/12/25/ N2 - Assume-guarantee reasoning, a well-known approach in component-based software (CBS) verification, is in fact a language containment problem whose computational cost depends on the sizes of languages of the software components under checking and the assumption to be generated. Therefore, the smaller language assumptions, the more computational cost we can reduce in software verification. Moreover, strong assumptions are more important in CBS verification in the context of software evolution because they can be reused many times in the verification process. For this reason, this paper presents a method for generating locally strongest assumptions with locally smallest languages during CBS verification. The key idea of this method is to create a variant technique for answering membership queries of the Teacher when responding to the Learner in the L?based assumption learning process. This variant technique is then integrated into an algorithm in order to generate locally strongest assumptions. These assumptions will effectively reduce the computational cost when verifying CBS, especially for large?scale and evolving ones. The correctness proof, experimental results, and some discussions about the proposed method are also presented. PB - VNU JF - VNU Journal of Science: Computer Science and Communication Engineering VL - 34 SN - 2588-1086 TI - On Locally Strongest Assumption Generation Method for Component-Based Software Verification SP - 16 AV - public EP - 32 ER - TY - INPR ID - SisLab3120 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3120/ A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung A1 - Dang, Van Hung Y1 - 2018/// TI - On Improvement of Assume-Guarantee Verification Method for Timed Component-Based Software AV - none M2 - Ho Chi Minh city, Vietnam T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab3503 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3503/ A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2019/// N2 - Since software becomes more complex during its life cycle, the veri?cation cost becomes higher, especially for such methods which are using model checking in general and assume-guarantee reasoning in speci?c. To address the problem of reducing the assume-guarantee veri?cation cost, this paper presents a method to generate locally minimum and strongest assumptions for veri?cation of component-based software. For this purpose, we integrate a variant of membership queries answering technique to an algorithm which considers candidate assumptions that are smaller and stronger ?rst, larger and weaker later. Because the algorithm stops as soon as it reaches a conclusive result, the generated assumptions are the locally minimum and strongest ones. The correctness proof of the proposed algorithm is also included in the paper. An implemented tool, test data, and experimental results are presented and discussed. PB - IEICE JF - IEICE Transactions on Information and Systems SN - 0916-8532 TI - ON LOCALLY MINIMUM AND STRONGEST ASSUMPTION GENERATION METHOD FOR COMPONENT-BASED SOFTWARE VERIFICATION AV - none ER - TY - CONF ID - SisLab445 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_40 A1 - Tran, Hoang-Viet A1 - Pham, Ngoc Hung A1 - Le, Chi-Luan A1 - Nguyen, Quang-Trung Y1 - 2014/10/09/ TI - An Efficient Method for Automated Generating Models of Component-Based Software SP - 499 M2 - Hanoi, Vietnam AV - none EP - 511 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab1549 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1549/ A1 - Tran, Hong Viet A1 - Nguyen, Van Vinh A1 - Nguyen, Le Minh Y1 - 2016/03/26/ N2 - In this paper, we would like to present a new reordering approach based on a dependency parser in phrase based statistical machine translation (SMT) for English to Vietnamese. The proposed method can efficiently incorporate linguistic knowledge into SMT systems. We inspired from [1] using preprocessing reordering approaches. Dependency parser and transformation rules are used to reorder the source sentence and applied for systems translating English to Vietnamese. The experiment results showed that the proposed approach achieved improvements in BLEU scores over MOSES which is the state-of-the art phrase based SMT system. TI - Improving English-Vietnamese Statistical Machine Translation Using Preprocessing Dependency Syntactic M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1716 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1716/ A1 - Tran, Hong Viet A1 - Nguyen, Van Vinh A1 - Nguyen, Le Minh Y1 - 2015/// TI - Improving English-Vietnamese Statistical Machine Translation Using Preprocessing Dependency Syntactic AV - none M2 - Bali, Indonesia T2 - The 2015 Conference of the Pacific Association for Computational Linguistics ER - TY - CONF ID - SisLab439 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_10 A1 - Tran, Hung Quan A1 - Nguyen, Dinh Nien A1 - Do, Duc Kien A1 - Nguyen, Khanh Thinh A1 - Tran, Hai Dang A1 - Nguyen, LeMinh A1 - Pham, Bao Son Y1 - 2014/10/09/ TI - A Community-Based Vietnamese Question Answering System SP - 117 M2 - Hanoi, Vietnam AV - none EP - 128 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab3764 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3764/ A1 - Tran, Huu Quoc Dong A1 - Chu, Duc Trinh A1 - Bui, Thanh Tung A1 - Nguyen, Thi Thanh Van A1 - Phan, Hoang Anh A1 - Nguyen, Dinh Tuan A1 - Bui, Duy Nam Y1 - 2019/10/11/ N2 - IPS (Indoor Positioning System) is used to localize the robot position in a narrow environment. However, IPS signal is not accurate in some cases, the IPS signal transmission will be obstructed by people the public museums, for example. The combination with other sensors will reduce the poor signal from IPS and noise in the environment with many obstacles. The Extended Kalman Filter (EKF) have been widely used for mobile robot localization system and gained certain results. In this paper, EKF is embedded to Central Processing Unit with Robot Operating System on ?UET-FuSo? robot to fuse IPS signal with encoder and IMU sensor for the determination of position and orientation robot. The obtained results show the effect of the proposed method when the robot localization is more stable and accurate than using only IPS signal. This localization will be applied for mapping and navigation of mobile robot in exhibition guidance robot. TI - Employing Extended Kalman Filter with Indoor Positioning System for Robot Localization Application M2 - Ha Noi AV - public T2 - The 5 th International Conference on Engineering Mechanics and Automation (ICEMA 5) Ha Noi ER - TY - CONF ID - SisLab3292 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3292/ A1 - Tran, Huy Hoang A1 - Nguyen, The Hoang Anh A1 - Do, Quoc Vuong A1 - Le, Thanh Ha Y1 - 2018/// TI - EOG Detection using Haar Wavelet Transform toward implementation of an IOT Brain computer interface AV - none T2 - M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông 2018 ER - TY - INPR ID - SisLab3716 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3716/ A1 - Tran, Mai Vu Y1 - 2019/// N2 - Tóm t?t v?n b?n là m?t v?n ?? nh?n ???c nhi?u s? quan tâm c?a c?ng ??ng nghiên c?u v?i r?t nhi?u các bài báo khoa h?c xu?t hi?n t?i các h?i ngh? l?n nh?: ACL, DUC, TAC, COLING, EMNLP... M?c ?ích chính c?a tóm t?t v?n b?n ?ó chính là ??a ra v?n b?n ng?n g?n và xúc tích h?n t? m?t v?n b?n ??u vào. Bài toán này c?ng ???c ?ng d?ng nhi?u trong các h? th?ng th?c t? nh?: tóm t?t các trang web trong máy tìm ki?m, tóm t?t các tin t?c, tóm t?t các quan ?i?m ng??i dùng? M?t trong nh?ng bài toán ?ang ???c quan tâm hi?n nay ??i v?i tóm t?t ?ó chính là tóm t?t s? ki?n. PB - UET, VNU M1 - technical_report TI - H? th?ng tóm t?t s? ki?n AV - public ER - TY - CONF ID - SisLab1550 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1550/ A1 - Tran, Mai Vu A1 - Le, Hoang Quynh A1 - Phi, Van Thuy A1 - Pham, Thanh Binh A1 - Nigel, Collier Y1 - 2016/03/26/ N2 - We describe a high precision system for extracting events of biomedical significance that was developed during the BioNLP shared task 2013 and tested on the Cancer Genetics data set. Our system explored a multi-stage approach including trigger detection, edge detection and event composition. After trigger edge detection is finished we are left with a semantic graph from which we must select the optimal subset that is consistent with the semantic frames for each event type. The system achieved an F-score on the development data of 73.67 but was ranked 5th out of six with an F-score of 29.94 on the test data. How-ever, precision was the second highest ranked on the task at 62.73. Analysis suggests the need to continue to improve our system for complex events particularly taking into account cross-domain differences in argument distributions. TI - Exploring a Probabilistic Earley Parser for Event Composition in Biomedical Texts M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab100 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/100/ A1 - Tran, Mai Vu A1 - Nguyen, Minh Hoang A1 - Nguyen, Sy Quan A1 - Nguyen, Minh Tien A1 - Phan, Xuan Hieu Y1 - 2012/08/17/ N2 - Event Extraction is a complex and interesting topic in Information Extraction that includes event extraction methods from free text or web data. The result of event extraction systems can be used in several fields such as risk analysis systems, online monitoring systems or decide support tools. In this paper, we introduce a method that combines lexico ? semantic and machine learning to extract event from Vietnamese news. Furthermore, we concentrate to describe event online monitoring system named VnLoc based on the method that was proposed above to extract event in Vietnamese language. Besides, in experiment phase, we have evaluated this method based on precision, recall and F1 measure. At this time of experiment, we on investigated on three types of event: FIRE, CRIME and TRANSPORT ACCIDENT. KW - Data mining;Detectors;Entropy;Feature extraction;Fires;Machine learning;Monitoring;Internet;information retrieval;learning (artificial intelligence);natural language processing;text analysis;F1 measure;Vietnamese language;Vietnamese news;VnLoc;Web data;crime;decide support tools;event extraction method;event online monitoring system;fire;free text;information extraction;lexico-semantic learning;machine learning;precision;real-time news event extraction framework;recall;risk analysis system;transport accident; TI - VnLoc: A Real ? Time News Event Extraction Framework for Vietnamese SP - 161 M2 - Danang, Vietnam AV - none EP - 166 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab192 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/192/ A1 - Tran, Mai-Vu A1 - Collier, Nigel A1 - Le, Hoang-Quynh A1 - Phi, Van-Thuy A1 - Pham, Thanh-Binh Y1 - 2013/08/03/ TI - Exploring a Probabilistic Earley Parser for Event Decomposition in Biomedical Texts AV - none M2 - Bulgaria T2 - 2013 the BioNLP Shared Task 2013 Workshop. Association for Computational Linguistics (ACL) ER - TY - CONF ID - SisLab4686 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4686/ A1 - Tran, Manh Cuong A1 - Tran, Trung Kien A1 - Nguyen, Minh Tan A1 - Nguyen, Thu Trang A1 - Nguyen, Son A1 - Vo, Dinh Hieu Y1 - 2021/12/06/ N2 - APIs are extensively and frequently used in source code to leverage existing libraries and improve programming productivity. However, correctly and effectively using APIs, es- pecially from unfamiliar libraries, is a non-trivial task. Although various approaches have been proposed for recommending API method calls in code completion, suggesting actual parameters for such APIs still needs further investigating. In this paper, we introduce FLUTE, an efficient and novel approach combining program analysis and language models for recommending API parameters. With FLUTE, the source code of programs is first analyzed to generate syntactically legal and type-valid candidates. Then, these candidates are ranked using language models. Our empirical results on two large real-world projects Netbeans and Eclipse indicate that FLUTE achieves 80% and +90% in Top- 1 and Top-5 Precision, which means the tool outperforms the state-of-the-art approach. TI - API parameter recommendation based on language model and program analysis AV - public T2 - THE 28TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE ER - TY - INPR ID - SisLab3757 UR - https://www.hindawi.com/journals/scn/ A1 - Tran, Nghi Phu A1 - Hoang, Dang Kien A1 - Ngo, Quoc Dung A1 - Nguyen, Dai Tho A1 - Nguyen, Ngoc Binh Y1 - 2019/// N2 - Malware on devices connected to the Internet via the Internet of Things (IoT) ) is evolving and is a core component of the fourth industrial revolution. IoT devices use the MIPS architecture with a large proportion running on embedded Linux operating systems, but the automatic analysis of IoT malware has not resolved. We proposed a framework to classify malware in IoT devices by using MIPS-based system behavior (system call - syscall) got from our F-Sandbox passive process and machine learning techniques. The F-Sandbox is a new type for IoT sandbox, automatically created from the real firmware of the specialized IoT devices, inheriting the specialized environment in the real firmware, therefore creating a diverse environment for sandboxing as an important characteristic of IoT sandbox. This framework classifies five families of IoT malware with F1-Weight = 97.44%. PB - Hindawi JF - Security and Communication Networks SN - 1939-0114 TI - A Novel Framework to Classify Malware in MIPS Architecture-based IoT Devices AV - public ER - TY - CONF ID - SisLab3765 UR - http://iscit2019.org/ A1 - Tran, Nghi Phu A1 - Le, Huy Hoang A1 - Nguyen, Ngoc Toan A1 - Nguyen, Dai Tho A1 - Nguyen, Ngoc Binh Y1 - 2019/09// N2 - Control flow-based features proposed by Ding, static characteristic extraction method, has the ability to detect malicious code with higher accuracy than traditional Text-based methods. However, this method resolved NP-hard problem in a graph, therefore it is not feasible with the large-size and highcomplexity programs. So, we propose the C500-CFG algorithm in Control flow-based features based on the idea of dynamic programming, solving Ding?s NP-hard problem by polynomial complexity O(N^2) algorithm, where N is the number of basic blocks in decompiled executable codes. Our algorithm is more efficient and more outstanding in detecting malware than Ding?s algorithm: fast processing time, allowing processing large files, using less memory and extracting more feature information. Applying our algorithms with IoT data sets gives outstanding results on 2 measures: Accuracy = 99.34%, F1-Score = 99.32%. TI - C500-CFG: A Novel Algorithm to Extract Control Flow-Based Features for IoT Malware Detection SP - 568 M2 - Ho Chi Minh City AV - public EP - 573 T2 - 19th International Symposium on Communications and Information Technologies (ISCIT 2019) ER - TY - CONF ID - SisLab3763 UR - https://soict.org/ A1 - Tran, Nghi Phu A1 - Le, Huy Hoang A1 - Nguyen, Ngoc Toan A1 - Nguyen, Dai Tho A1 - Nguyen, Ngoc Binh Y1 - 2019/12// N2 - The widespread adoption of Internet of Things (IoT) devices built on different architectures gave rise to the creation and development of multi-architecture malware for mass compromise. Crossarchitecture malware detection plays an important role in detecting malware early on devices using new or strange architectures. Prior knowledge of malware detection on traditional architectures can be inherited for the same task on new and uncommon ones. Basing on CFD and Vex intermediate representation, we propose a feature selection method to detect cross-architecture malware, called CFDVex. Experimental evaluation of the proposed approach on our large IoT dataset achieved good results for cross-architecture malware detection. We only trained a SVM model by Intel 80386 architecture samples, our method could detect the IoT malware for the MIPS architecture samples with 95.72% of accuracy and 2.81% false positive rate. TI - CFDVex: A Novel Feature Extraction Method for Detecting Cross-Architecture IoT Malware SP - 248 M2 - Ha Noi - Ha Long AV - public EP - 254 T2 - 10th International Symposium on Information and Communication Technology (SoICT 2019) ER - TY - CONF ID - SisLab3379 UR - https://sois2018.hust.edu.vn/ A1 - Tran, Nghi Phu A1 - Ngo, Quoc Dung A1 - Hoang, Dang Kien A1 - Nguyen, Ngoc Binh A1 - Nguyen, Dai Tho Y1 - 2018/// N2 - - Ma? ???c tre?n ca?c thiê?t bi? Va?n v??t kê?t nô?i Internet - Internet of Things (IoT), tha?nh phâ?n cô?t lo?i trong cu??c ca?ch ma?ng 4.0, ?ang nga?y ca?ng ta?ng nhanh. Ca?c thiê?t bi? IoT co? kiê?n tru?c MIPS chiê?m ti? l?? l??n, song ca?c nghie?n c??u pha?t hi??n ma? ???c d??a tre?n ha?nh vi cu?a ca?c thiê?t bi? na?y chu?a ?u???c ?ê? c??p. Chu?ng to?i ?ê? xuâ?t quy tri?nh pha?n ti?ch pha?t hi??n ma? ???c trong ca?c thiê?t bi? IoT s?? du?ng kiê?n tru?c MIPS d??a tre?n l??i go?i h?? thô?ng syscall (hay system call) b??ng ky? thu??t pha?n loa?i m??t l??p SVM. Ca?c chu?o?ng tri?nh ?u???c cha?y trong C500-Sandbox ?ê? thu th??p ca?c syscall ?u???c go?i, ca?c syscall ?u???c biê?u diê?n du???i da?ng ???c tru?ng n-gram, sau ?o? s?? du?ng phu?o?ng pha?p pha?n ti?ch tha?nh phâ?n chi?nh (Principal Component Analysis - PCA) ?ê? gia?m sô? chiê?u tru???c khi ?u???c huâ?n luy??n/nh??n da?ng b??ng mo? hi?nh pha?n loa?i m??t l??p SVM (One class SVM). Quy tri?nh cho kê?t qua? pha?t hi??n tô?t v??i chi? sô? F-Score (F1) = 0,976, Average precision (AP) = 0,992, Accuracy (AC) = 0,956. TI - Phát hi?n mã ??c trên các thi?t b? IoT d?a trên l?i g?i Syscall và phân lo?i m?t l?p SVM M2 - Da Nang AV - public T2 - H?i th?o l?n th? III M?t s? v?n ?? ch?n l?c v? an toàn an ninh thông tin ER - TY - JOUR ID - SisLab3761 UR - https://www.ijitee.org/ IS - 11 A1 - Tran, Nghi Phu A1 - Ngo, Quoc Dung A1 - Le, Van Hoang A1 - Nguyen, Dai Tho A1 - Nguyen, Ngoc Binh Y1 - 2019/09// N2 - Nowadays, there are many discussions on the fourth industrial revolution with a combination of real physical and virtual systems (Cyber Physical Systems), Internet of Things (IoT) and Internet of Services (IoS). Along with this revolution is the rapid development of malicious code on IoT devices, leading to not only the risk of personal privacy information leaking but also the risk of network security in general. In this paper, we propose C500-toolkit, a novel tool for malware detection in Commercial-off-the-shelf routers, based on dynamic analysis approach. The main contribution of C500-toolkit is to provide an environment for fully emulating router firmware image including both operating system and web-interface. To show the advantage of C500-toolkit, experiments of this tool with embedded malwares Linux/TheMoon and Linux/Mirai are presented. PB - Blue Eyes Intelligence Engineering & Sciences Publication JF - International Journal of Innovative Technology and Exploring Engineering (IJITEE) VL - 8 SN - 2278-3075 TI - A System Emulation for Malware Detection in Routers SP - 32 AV - public EP - 40 ER - TY - INPR ID - SisLab3998 UR - https://academic.oup.com/comjnl A1 - Tran, Nghi Phu A1 - Nguyen, Dai Tho A1 - Le, Huy Hoang A1 - Nguyen, Ngoc Toan A1 - Nguyen, Ngoc Binh Y1 - 2020/// N2 - Control flow-based feature extraction method has the ability to detect malicious code with higher accuracy than traditional text-based methods. Unfortunately, this method has been encountering with the NP-hard problem, which is infeasible for the large-sized and high-complexity programs. To tackle this, we propose a control flow-based features extraction dynamic programming algorithm (CFD) for fast extraction of control flow-based features with polynomial time O(N^2), where N is the number of basic blocks in decompiled executable codes. From the experimental results, it is demonstrated that the proposed algorithm is more efficient and effective in detecting malware than the existing ones. Applying our algorithm to an IoT dataset gives better results on 3 measures: Accuracy (AC) = 99.05%, False Positive Rate (FPR) = 1.31% and False Negative Rate (FNR) = 0.66%. PB - Oxford University Press JF - The Computer Journal SN - 0010-4620 TI - An Efficient Algorithm to Extract Control Flow-based Features for IoT Malware Detection AV - public ER - TY - CONF ID - SisLab2362 UR - http://sois.actvn.edu.vn A1 - Tran, Nghi Phu A1 - Nguyen, Huy Trung A1 - Ngo, Quoc Dung A1 - Nguyen, Ngoc Binh A1 - Nguyen, Dai Tho Y1 - 2016/11/29/ N2 - V?n v?t k?t n?i (Internet of Things) hi?n nay ???c s? d?ng ngày càng r?ng rãi trong cu?c s?ng, ?i kèm v?i nh?ng ti?n ích m?i công ngh? này mang l?i ?ó chính là v?n ?? an ninh, an toàn thông tin. K?t qu? các nghiên c?u g?n ?ây ?ã ch? ra r?ng các l? h?ng b?o m?t và ??c bi?t là mã ??c xu?t hi?n r?t nhi?u trên h? ?i?u hành c?a các thi?t b? m?ng (firmware). Vì tính ??c thù cao c?a các thi?t b? m?ng c?ng nh? c?a các firmware mà vi?c phân tích, rà quét các l? h?ng b?o m?t và mã ??c g?p r?t nhi?u tr? ng?i. H?n n?a, do ch?a có ???c s? quan tâm ?úng m?c c?a cá nhân, t? ch?c l?n nên vi?c phát tri?n các công c? c?ng nh? ph??ng pháp phân tích, phát hi?n còn nhi?u h?n ch?. H?n ch? có th? k? ??n là kh? n?ng trích ch?n firmware và d?ch ng??c chúng thành mã t??ng minh ?? t? ?ó có th? s? d?ng các ph??ng pháp phân tích l? h?ng, mã ??c khác nhau. Trong bài báo này, C500-Toolkit s? ???c gi?i thi?u v?i m?c tiêu t?ng hi?u su?t trích ch?n và d?ch ng??c firmware c?a các thi?t b? ??nh tuy?n. G?n 13.674 firmware t? 27 nhà phân ph?i ???c s? d?ng ?? ?ánh giá và so sánh v?i các công c? hi?n có nh? fmk, binwalk và mô ?un trích ch?n, d?ch ng??c c?a firmadyne. TI - Phát tri?n công c? d?ch ng??c firmware trên thi?t b? ??nh tuy?n M2 - Hanoi, Vietnam AV - public T2 - H?i th?o l?n th? I M?t s? v?n ?? ch?n l?c v? An toàn an ninh thông tin ER - TY - CONF ID - SisLab1551 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1551/ A1 - Tran, Nghi Phu A1 - Nguyen, Ngoc Binh Y1 - 2016/03/26/ N2 - Công ngh? ngày càng phát tri?n mãnh m?, ?i sâu vào m?i khía c?nh c?a cu?c s?ng, do ?ó v?n ?? an ninh an toàn tr? thành m?t trong nh?ng v?n ?? ???c quan tâm nh?t trong th? gi?i ngày nay. Nguy c? v? m?t an ninh thông tin không ch? d?ng l?i m?c ?ng d?ng ph?n m?m mà ??t ra c? ? m?c ph?n c?ng thi?t b? và ngày nay m?t l?nh v?c ?ang d?y lên nhi?u lo ng?i là nguy c? t? các h? th?ng nhúng tích h?p, firmware c?a các thi?t b?, ??c bi?t các thi?t b? ?óng vai trò trung tâm trong k?t n?i, truy?n d?n thông tin nh? các thi?t b? m?ng. Các nghiên c?u t? tr??c t?p trung cho các ?ng d?ng m?c cao trên ki?n trúc i386, h? ?i?u hành Windows, các ph??ng pháp và công c? h? tr? cho vi?c phân tích firmware còn r?t h?n ch? và g?p nhi?u khó kh?n do ti?p c?n m?c th?p, ki?n trúc ?a d?ng, thi?u tài li?u ??c t? ??y ??. Nghiên c?u c?a chúng tôi t?p trung vào vi?c tìm hi?u ki?n trúc c?a các thi?t b? m?ng, t? ?ó tìm cách trích xu?t firmware t? các thi?t b? này, sau ?ó phân tích nh?m phát hi?n có hay không các l? h?ng b?o m?t hay malware cài c?m trong firmware. Vi?c phân tích và phát hi?n d?a trên 2 ph??ng pháp t?nh và ??ng. Các firmware ???c ti?n hành phân tách, thu th?p l?y ph?n th?c thi chính c?a firmware th??ng là các Embeded Web trên n?n Linux 2.6, ph?n lõi này ???c ti?n hành phân tích t?nh tìm ra backdoor ho?c ch?y trong môi tr??ng mô ph?ng ?? quét phát hi?n l? h?ng b?o m?t. TI - Phân tích và phát hi?n l? h?ng b?o m?t trong firmware c?a các thi?t b? m?ng M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1186 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1186/ A1 - Tran, Ngoc Anh A1 - Nguyen, Phuong Thai A1 - Dao, Thanh Tinh A1 - Nguyen, Hong Quan Y1 - 2015/01/25/ TI - Identifying Reduplicative Words for Vietnamese Word Segmentation AV - none M2 - Can Tho, Vietnam T2 - 2015: The 11th IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF 2015) ER - TY - CONF ID - SisLab136 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/136/ A1 - Tran, Ngoc Ha A1 - Do, Duc Dong A1 - Hoang, Xuan-Huan Y1 - 2013/01/21/ N2 - The Multiple Graph Alignment (MGA) is a new method to analyze the structure of biological molecules. This method allows detect functional similarities in the structure of biological systems. This article introduces an ant colony optimization algorithm combined with local search for optimal align multi-graph analysis of protein structures. Experiment results showed that the new algorithm outperformed the other heuristic approach and existing evolutionary computing. KW - Algorithm design and analysis;Ant colony optimization;Greedy algorithms;Heuristic algorithms;Proteins;Runtime;Vectors;Ant Colony Optimization;Local Search;Multiple Graph Alignment;Pheromone update rule;label TI - An Efficient Ant Colony Optimization Algorithm for Multiple Graph Alignment SP - 386 M2 - HoChiMinh city AV - none EP - 391 T2 - 2013 International Conference on Computing, Management and Telecommunications (ComManTel) ER - TY - CONF ID - SisLab1188 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1188/ A1 - Tran, Ngoc Ha A1 - Do, Duc Dong A1 - Hoang, Xuan-Huan Y1 - 2014/// TI - A Novel Ant Based Algorithm for Multiple Graph Alignment SP - 181 M2 - Bali, Indonesia AV - none EP - 186 T2 - 2014: The 11th IEEE International Conference on Autonomic and Trusted Computing (ATC-2014) ER - TY - CONF ID - SisLab1553 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1553/ A1 - Tran, Ngoc Ha A1 - Hoang, Xuan Huan Y1 - 2016/03/26/ N2 - Global aligning two protein-protein interaction networks is an essentially important task in bioinformatics. It is a challenging and widely studied research topic in recent years. Accurately aligned networks allow us to identify functional modules of proteins and/ororthologous proteins from which unknown functions of a protein can be inferred. In this article, we introduce an ant based global network alignment algorithm called ACOGA. The experiments show that the method that we proposed get better results than the introduced methods recently. TI - An Efficient Ant Based Algorithm for Global Alignment of Protein-Protein Interaction Networks M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab1719 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1719/ A1 - Tran, Ngoc Ha A1 - Hoang, Xuan Huan Y1 - 2015/// TI - M?t thu?t toán t?i ?u ?àn ki?n dóng hàng toàn c?c m?ng t??ng tác protein AV - none M2 - Hanoi, Vietnam T2 - H?i ngh? khoa h?c qu?c gia l?n th? 8 Nghiên c?u c? b?n và ?ng d?ng CNTT (FAIR 2015) ER - TY - CONF ID - SisLab2371 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2371/ A1 - Tran, Ngoc Ha A1 - Hoang, Xuan-Huan Y1 - 2016/// N2 - Protein?protein interaction network alignment enables us to identify orthologous proteins, predict protein functions and build evolutionary relationships of species. This article introduces an algorithm for global alignment of protein- protein interaction network based on ant colony optimization (ACO) method. The experimental results offer outstanding advantages of the proposed algorithms. TI - ACOGNA: An Efficient Method for Protein-Protein Interaction Network Alignment AV - public T2 - KSE 2016 ER - TY - INPR ID - SisLab4069 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4069/ A1 - Tran, Nguyen Huong A1 - Do, Minh Kha A1 - Tran, Hoang Viet A1 - Pham, Ngoc Hung Y1 - 2020/11// N2 - This paper presents two test data automatic generation methods which are based on weighted control flow graph (named WCFT) and boundary values of input parameters (named BVTG). Firstly, WCFT method generates a CFG from a given unit function, updates weight for it, then generates test data from the greatest weight test paths. In the meantime, WCFT can find dead code that can be used for automatic source code errors fix. Secondly, BVTG method generates test data from boundary values of input parameters of the given unit function. The combination of the two generated test data sets from these two methods will improve the error detection ability while maintaining a high code coverage. An implemented tool (named WCFT4Cpp) and experimental results are also presented to show the effectiveness of the two proposed methods in both time required to generate test data and error detection ability. TI - Generate Test Data from C/C++ Source Code using Weighted CFG and Boundary Values M2 - Can Tho, Vietnam AV - public T2 - 12th International Conference on Knowledge and Systems Engineering (KSE 2020) ER - TY - CONF ID - SisLab791 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/791/ A1 - Tran, Nguyen Le A1 - Do, Thanh Cong A1 - Nguyen, Ba Tung A1 - Ta, Viet Cuong A1 - Le, Thanh Ha Y1 - 2013/// TI - Contour Based Hand Gesture Recognition Using Depth Data SP - 60 AV - none EP - 65 T2 - 2013: 6th International Conference on Signal Processing, Image Processing and Pattern Recognition (SIP) ER - TY - RPRT ID - SisLab3196 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3196/ A1 - Tran, Nhu Thuat A1 - Nguyen, Huu Hong A1 - Nguyen, Thanh Tung A1 - Dang, Tien Son A1 - Luong, Thai Le A1 - Phan, Xuan Hieu Y1 - 2018/12// N2 - Identifying user?s intents from texts on online channels has wide range of applications from entrepreneurship, banking to e-commerce. However, intent identification is not a simple task due to intent and its attributes are various and strongly depend on the domain of data. In our research, we study the problem of domain-independent intent identification from posts and comments crawled from social networks and discussion forums. We present ten general labels, i.e. labels do not depend on a specific domain, and utilize them when extracting intent and its related information. We also propose the map between general labels and domain-specific labels. We extensively conduct experiments to explore the efficiency of using general labels compared to specific labels in extracting user?s intents when the number of intent domains increases. Our study is conducted on a medium-sized dataset from three selected domains: Tourism, Real Estate and Transportation. In term of accuracy, when the number of domains grows, our proposal achieves significantly better results than the domain-specific method in identifying user?s intent. PB - VNU-UET VL - TR2018-FIT-01 M1 - technical_report TI - Domain-independent Intent Extraction from Online Texts AV - public EP - 10 ER - TY - CONF ID - SisLab1639 UR - http://dx.doi.org/10.1007/978-3-662-49381-6_17 A1 - Tran, Phuong Nam A1 - Ta, Van Duc A1 - Truong, Quoc Tuan A1 - Duong, Quang Vu A1 - Nguyen, Thac Thong A1 - Phan, Xuan Hieu Y1 - 2016/// VL - 9621 SN - 0302-9743 TI - Named Entity Recognition for Vietnamese Spoken Texts and Its Application in Smart Mobile Voice Interaction SP - 170 M2 - Da Nang, Vietnam AV - none EP - 180 T2 - ACIIDS: the 8th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab851 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/851/ A1 - Tran, Phuong Nhung A1 - Nguyen, Cam Tu A1 - Chun, Jinhee A1 - Le, Vu Ha A1 - Tokuyama, Takeshi Y1 - 2013/09// TI - A Multiple Instance Learning Approach to Image Annotation with Saliency Map AV - none T2 - 2013: International Conference on Knowledge Discovery and Information Retrieval (KDIR) ER - TY - CONF ID - SisLab449 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_51 A1 - Tran, Quan Hung A1 - Nguyen, Le Minh A1 - Pham, Bao Son Y1 - 2014/10/09/ TI - Question Analysis for a Community-Based Vietnamese Question Answering System SP - 641 M2 - Hanoi, Vietnam AV - none EP - 651 T2 - 2014: The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab1717 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1717/ A1 - Tran, Quoc Long A1 - Farajtabar, Mehrdad A1 - Le, Song A1 - Zha, Hongyuan Y1 - 2015/// TI - NetCodec: Community Detection AV - none T2 - Individual Activities 2015 SIAM International Conference on Data Mining ER - TY - CONF ID - SisLab3268 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3268/ A1 - Tran, Quoc Long A1 - Farajtabar, Mehrdad A1 - Song, Le A1 - Zha, Hongyuan Y1 - 2015/06/30/ TI - Netcodec: Community detection from individual activities SP - 91 AV - public EP - 99 T2 - Proceedings of the 2015 SIAM International Conference on Data Mining ER - TY - JOUR ID - SisLab3273 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3273/ IS - 5 A1 - Tran, Quoc Long A1 - Toh, K-A A1 - Srinivasan, Dipti A1 - Wong, K-L A1 - Low, Shaun Qiu-Cen Y1 - 2005/// PB - IEEE JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) VL - 35 TI - An empirical comparison of nine pattern classifiers SP - 1079 AV - none EP - 1091 ER - TY - CONF ID - SisLab3269 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3269/ A1 - Tran, Quoc Long A1 - Toh, Kar-Ann A1 - Srinivasan, Dipti Y1 - 2004/// VL - 2 TI - Adaptation to changes in multimodal biometric authentication SP - 982 AV - none EP - 986 T2 - IEEE Conference on Cybernetics and Intelligent Systems, 2004. ER - TY - CONF ID - SisLab3277 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3277/ A1 - Tran, Quoc Long A1 - Walker, LD A1 - Mazencev, R A1 - Jones, C A1 - Gray, A A1 - Fernandez, F A1 - McDonald, J A1 - Benigno, B Y1 - 2015/// VL - 25 TI - SPECTROMETRIC METABOLIC PROFILING OF BLOOD SERA DETECTS EARLY STAGE OVARIAN CANCER WITH HIGH ACCURACY SP - 1293 AV - none EP - 1293 T2 - INTERNATIONAL JOURNAL OF GYNECOLOGICAL CANCER ER - TY - CONF ID - SisLab1554 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1554/ A1 - Tran, Thai Son Y1 - 2016/03/26/ N2 - H? th?ng nhúng (embedded system) ???c ??nh ngh?a là m?t h? th?ng chuyên d?ng, có kh? n?ng t? hành và ???c thi?t k? tích h?p vào m?t h? th?ng l?n h?n ?? th?c hi?n các ch?c n?ng chuyên bi?t. H? th?ng nhúng bao g?m c? thi?t b? ph?n c?ng và ph?n m?m, th?a mãn yêu c?u ho?t ??ng theo th?i gian th?c. H? th?ng nhúng ??c tr?ng áp d?ng trong l?nh v?c xây d?ng và dân d?ng là h? th?ng ?i?u khi?n, giám sát và qu?n lý tòa nhà BMS (Building Management System). BMS bao g?m t? h?p c?a các h? th?ng nhúng thành ph?n và vi?c ?ng d?ng các h? th?ng này giúp t?ng ti?n nghi cho ng??i s? d?ng, gi?m chi phí v?n hành c?a tòa nhà, ti?t ki?m n?ng l??ng và b?o v? môi tr??ng. Nghiên c?u này t?p trung vào v?n ?? b?o m?t, v?n ?? t?i ?u hóa ngu?n n?ng l??ng và hi?u n?ng c?a h? th?ng nhúng trong qu?n lý, giám sát tòa nhà TI - Nghiên c?u nâng cao hi?u qu? và ?? b?o m?t cho các h? th?ng nhúng M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab3295 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3295/ A1 - Tran, Thanh Huyen A1 - Cao, Duc Thinh A1 - Yamada, Koichi A1 - Nguyen, Do Van Y1 - 2018/// TI - Incremental Updating Methods with Three-way Decision Models in Incomplete Information Systems AV - none T2 - Joint 10th International Conference on Soft Computing and Intelligent Systems and 19th International Symposium on Advanced Intelligent Systems in conjunction with Intelligent Systems Workshop 2018 (SCIS&ISIS 2018) ER - TY - JOUR ID - SisLab1301 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1301/ IS - 2 A1 - Tran, Thanh Luong A1 - Ha, Quang Thuy A1 - Hoang, Thi Lan Giao A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son Y1 - 2014/03// JF - Fundamenta Informaticae VL - 133 SN - 1875-8681 TI - Bisimulation-Based Concept Learning in Description Logics SP - 287 AV - none EP - 303 ER - TY - CONF ID - SisLab108 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/108/ A1 - Tran, Thanh Luong A1 - Ha, Quang Thuy A1 - Hoang, Thi Lan Giao A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son A1 - Szalas, Andrzej Y1 - 2012/08/17/ N2 - The work [1] by Nguyen and Szalas is a pioneering one that uses bisimulation for machine learning in the context of description logics. In this paper we generalize and extend their concept learning method [1] for description logic-based information systems. We take attributes as basic elements of the language. Each attribute may be discrete or numeric. A Boolean attribute is treated as a concept name. This approach is more general and much more suitable for practical information systems based on description logic than the one of [1]. As further extensions we allow also data roles and the concept constructors "functionality" and "unquantified number restrictions". We formulate and prove an important theorem on basic selectors. We also provide new examples to illustrate our approach. KW - Educational institutions;Electronic mail;Information systems;Knowledge based systems;Machine learning;Standards;Boolean functions;bisimulation equivalence;information systems;learning (artificial intelligence);Boolean attribute;bisimulation;concept constructor;concept learning method;concept name;data role;description logic-based information system;discrete attribute;functionality;machine learning;numeric attribute;unquantified number restriction;bisimulation;concept learning;description logic;machine learning; TI - Concept Learning for Description Logic-Based Information Systems SP - 65 M2 - Danang, Vietnam AV - none EP - 73 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab83 UR - http://doi.ieeecomputersociety.org/10.1109/KSE.2012.23 A1 - Tran, Thanh Luong A1 - Ha, Quang Thuy A1 - Hoang, Thi Lan Giao A1 - Nguyen, Linh Anh A1 - Nguyen, Hung Son A1 - Szalas, Andrzej Y1 - 2012/08/17/ TI - Concept Learning for Description Logic-based Information Systems SP - 65 M2 - Danang, Vietnam AV - none EP - 73 T2 - 2012: 4th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1715 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1715/ A1 - Tran, The Hung A1 - Nguyen, Van Hung A1 - Hoang, Anh Minh Y1 - 2015/// TI - Fast Approximate near Neighbor Algorithm by Clustering in High Dimensions AV - none M2 - Ho Chi Minh city, Vietnam T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - JOUR ID - SisLab2545 UR - http://doi.org/10.1515/cait-2017-0024 IS - 2 A1 - Tran, Thi Oanh A1 - Dang, Hai Trieu A1 - Dinh, Viet Thuong A1 - Truong, Thi Minh Ngoc A1 - Vuong, Thi Phuong Thao A1 - Phan, Xuan Hieu Y1 - 2017/06// N2 - This paper presents a study on Predicting Student Performance (PSP) in academic systems. In order to solve the task, we have proposed and investigated different strategies. Specifically, we consider this task as a regression problem and a rating prediction problem in recommender systems. To improve the performance of the former, we proposed the use of additional features based on course-related skills. Moreover, to effectively utilize the outputs of these two strategies, we also proposed a combination of the two methods to enhance the prediction performance. We evaluated the proposed methods on a dataset which was built using the mark data of students in information technology at Vietnam National University, Hanoi (VNU). The experimental results have demonstrated that unlike the PSP in e-Learning systems, the regression-based approach should give better performance than the recommender system-based approach. The integration of the proposed features also helps to enhance the performance of the regression-based systems. Overall, the proposed hybrid method achieved the best RMSE score of 1.668. These promising results are expected to provide students early feedbacks about their (predicted) performance on their future courses, and therefore saving times of students and their tutors in determining which courses are appropriate for students? ability. JF - Cybernetics and Information Technologies VL - 17 SN - 1314-4081 TI - Performance Prediction for Students: A Multi-Strategy Approach SP - 164 AV - none EP - 182 ER - TY - CONF ID - SisLab1720 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1720/ A1 - Tran, Trong Hieu A1 - Nguyen, Thi Hong Khanh A1 - Ha, Quang Thuy A1 - Vu, Ngoc Trinh Y1 - 2015/// TI - Argumentation framework for merging stratified belief bases AV - none M2 - Da Nang, Vietnam T2 - ACIIDS: the 8th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1197 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1197/ A1 - Tran, Trong Hoa A1 - Vu, Quang Dung A1 - Nakajima, Nobuyasu Y1 - 2014/04/27/ SN - 978-1-4799-2904-7, DOI: 10.1109/ComManTel.2014.6825616 TI - A Method of Collecting and Analyzing Web Data Automatically SP - 269 M2 - Danang, Vietnam AV - none EP - 274 T2 - 2014: The 2nd International Conference on Computing, Management and Telecommunications (ComManTel 2014) ER - TY - JOUR ID - SisLab779 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/779/ A1 - Tran, Truc Mai A1 - Duong, Le Minh Y1 - 2013/// JF - T?p chí B?u chính Vi?n thông VL - 29 TI - C?i ti?n cho ?i?u khi?n t?c ?? t?ng giao v?n trong m?ng ?i?u khi?n không dây ?a b??c AV - none ER - TY - JOUR ID - SisLab183 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/183/ IS - 29 A1 - Tran, Truc Mai A1 - Duong, Le Minh Y1 - 2013/06// JF - Chuyên san B?u chính Vi?n thông TI - MAC-based Improvement for Transport Rate Control in Multihop Wireless Networks AV - none ER - TY - JOUR ID - SisLab781 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/781/ A1 - Tran, Truc Mai A1 - Duong, Le Minh Y1 - 2013/// JF - T?p chí công ngh? thông tin và truy?n thông VL - 29 TI - ?i?u khi?n t?c ?? d?a trên thông s? t?ng MAC cho giao th?c t?ng giao v?n trong m?ng không dây ?a b??c AV - none ER - TY - CONF CY - Ho Chi Minh City, Vietnam ID - SisLab3205 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3205/ A1 - Tran, Tuan A1 - Khanh, Nguyen A1 - Le, Son A1 - Phan, Anh A1 - Mizuhito, Ogawa A1 - Nguyen, Minh Y1 - 2018/10/01/ N2 - The development of IoT brings many opportunities but also many challenges. Recently, increasing more malware has been appeared to target IoT devices. Machine learning is one of the typical techniques used in the detection of malware. In this paper, we survey three approaches for IoT malware detection based on the application of convolutional neural networks on different data representations including sequences, images, and assembly code. The comparison was conducted on the task of distinguishing malware from nonmalware. We also analyze the results to assess the pros/cons of each method. KW - malware detection; malware analysis; deep learning; convolutional neural network TI - Comparison of Three Deep Learning-based Approaches for IoT Malware Detection AV - public T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE) (KSE'18) ER - TY - CONF ID - SisLab1555 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1555/ A1 - Tran, Tuan Vinh A1 - Nguyen, Thanh Thuy A1 - Nguyen, Thi Nhat Thanh Y1 - 2016/03/26/ N2 - Ô nhi?m không khí là m?t trong nh?ng v?n ?? nghiêm tr?ng nh?t trên th? gi?i, ??c bi?t là t?i các n??c ?ang phát tri?n. ?? ki?m soát m?c ?? ô nhi?m không khí, m?t trong nh?ng ph??ng pháp ???c áp d?ng là phân lo?i sol khí và các thành ph?n gây ô nhi?m, t? ?ó phát hi?n các ngu?n phát th?i chính c?a chúng ?? có bi?n pháp x? lý. G?n ?ây, k? thu?t LiDAR phát tri?n ???c dùng trong nghiên c?u các quá trình h?n lo?n, các chu trình trong khí quy?n, các hi?n t??ng khí t??ng h?c nh? bão, áp th?p, các lu?ng gió d??i tác ??ng c?a núi. LiDAR cho phép theo dõi s? thay ??i c?a m?t ?? khí th?i, các l? th?ng t?ng ozone, cung c?p d? li?u v? ?nh h??ng c?a các hi?u ?ng th?i ti?t, các ?ám b?i núi l?a và s? lan truy?n xuyên châu l?c c?a khí th?i, b?i sa m?c, và khói c?a các v? cháy r?ng. ??nh h??ng c?a ?? tài này là t?p trung vào các thu?t toán x? lý ngu?n d? li?u LiDAR ?? phân lo?i sol khí nói chung và sol khí có ngu?n g?c t? các ho?t ??ng nông nghi?p và áp d?ng trong giám sát ô nhi?m không khí. TI - Nghiên c?u và ?ng d?ng ?nh LiDAR trong giám sát sol khí phát th?i t? nông nghi?p M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab4322 UR - http://dx.doi.org/10.1109/KSE50997.2020.9287409 A1 - Tran, Tuan Vinh A1 - Pham, Van Ha A1 - Nguyen, Thanh Thuy A1 - Nguyen, Thi Nhat Thanh Y1 - 2020/// TI - Analysis of CALIPSO satellite imagery for air pollution source identification in Hanoi, Vietnam SP - 73 AV - none EP - 78 T2 - The 2020 12th International Conference on Knowledge and Systems Engineering (KSE) ER - TY - INPR ID - SisLab2767 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2767/ A1 - Tran, Tuan Vinh A1 - Pham, Van Ha A1 - Pham, Xuan Thanh A1 - Nguyen, Xuan Anh A1 - Bui, Quang Hung A1 - Nguyen, Thanh Thuy A1 - Nguyen, Thi Nhat Thanh Y1 - 2017/// PB - Springer Nature TI - Satellite Aerosol Optical Depth over Vietnam, an analysis from VIIRS and CALIOP aerosol products. AV - none T2 - Land-Atmospheric Research Applications in South and Southeast Asia ER - TY - RPRT ID - SisLab3195 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3195/ A1 - Tran, Van Lien A1 - Nguyen, Viet Thang A1 - Quach, Cong Hoang A1 - Phan, Xuan Hieu A1 - Pham, Minh Trien Y1 - 2018/12// N2 - How can we efficiently search an object in a room? This report introduces a method for a single indoor mobile robot to find a hidden item based on states of the room when the robot is moving. A 2D distribution, called cognitive map, is built during robot movements to boost the exploring time. It is known that in the filed of exploring algorithms, A? usually takes more time to reach the target than recent invented algorithms such as rapidly-exploring random trees (RRT) and probabilistic roadmap (PRM). However, by adapting the cognitive map as a cost map, the A? algorithm is significantly improved and surpasses the two algorithms in Scannet 3D dataset. We also introduce application of depth sensors and SLAM solvers on reconstructing the room and updating cognitive map. By running a virtual robot in Gazebo simulator, it is proved that our method can work well on synthetic environment and hence, is very promising to be worked on real-life environment. PB - VNU-UET VL - TR2018-FIT-16 M1 - technical_report TI - Depth camera based navigation algorithms for indoor mobile robot AV - public EP - 10 ER - TY - CONF ID - SisLab4286 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4286/ A1 - Tran, Van Manh A1 - Vu, Thi Hong Nhan TI - Design of architecture for carpooling based on flexible pickup and delivery locations AV - none T2 - IIHMSP/FITAT ER - TY - CONF ID - SisLab1413 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1413/ A1 - Tran, Viet Hong A1 - Pham, Anh Tuan A1 - Nguyen, Van Vinh A1 - Nguyen, Hoai Xuan A1 - Nguyen, Huy Quang Y1 - 2014/// TI - Parameter Learning for Statistical Machine Translation using CMA-ES AV - none M2 - Hanoi, Vietnam T2 - KSE: the 6th International Conference on Knowledge and Systems Engineering ER - TY - BOOK ID - SisLab3956 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3956/ A1 - Tran, Xuan Tu Y1 - 2020/04/22/ PB - Vietnam National University Publishing House SN - 978-604-9947-49-0 ED - Tran, Xuan Tu TI - M?ng trên chip AV - public EP - 235 ER - TY - BOOK ID - SisLab2062 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2062/ IS - 1 A1 - Tran, Xuan Tu A1 - Le, Anh Cuong A1 - Tran, Duc Tan A1 - Pham, Manh Thang A1 - Do, Thi Huong Giang Y1 - 2016/03/01/ N2 - The University of Engineering and Technology (UET) was founded in 2004 as a member university of Vietnam National University, Hanoi (VNU). The last only five years have seen immense progresses in the development of our university in various aspects of its activities thanks to the great efforts put in by the government with strong financial supports, by the VNU with steering leadership and administration, by the national and international educational institutions and corporations in fruitful collaborations and advices, and by all the staff and students of the UET with determination, hard work and patience. Today, our university has built up a solid foundation for a sustainable and dynamic development in coming years. This solid foundation consists of a completed system of well-designed programs at both undergraduate and graduate levels, renovated teaching and learning facilities, a just limited but strong and advanced research infrastructure with state-of-the-art and completed equipment systems, a sustainable and fruitful collaboration with leading research and educational institutions in the country, and a bright, young, well-educated and welltrained faculty who are eager to take on advanced research and studies. All these have made our university a prestigious institution and firmly established its education and research capabilities. This is proved by the facts that only in the last four years our university has established close and solid ties and cooperation with prestigious foreign universities, just to name a few, the University Paris-Sud 11 (France), Japan Advanced Institute of Science and Technology, the National University of Singapore, Nanyang Technological University (Singapore), University of New South Wales and with famous international industrial and technological corporations such as Samsung, Toshiba, NEC, Mitani, Human Resocia, IBM, and other well-known institutions in the region and around the world. This is also proved in a convincing way by the facts that only in the last two years, our university has been granted several significant research projects from various national research programs. Our university has become an attractive destination for talented students at all training levels. We are proud that our university is the only Vietnamese higher-education institution that has one among the 100 best student?s teams all over the world participating the World Final of the ACM International Collegiate Programming Contest (rank #29 in 2015). We are also proud that in this year, our faculty has won an award in the National Contest in Information Technology entitled ?Vietnamese Talent Award? and three awards in the VNU Science & Technology Award for the period of 2011-2015. In the coming period, we shall put our great efforts to solidify our strength and prestige. We shall widen our training scope while paying significant attention to further improvement on the education quality. We shall strongly enhance our concentrated research activity by exploring efficiently and effectively our well established foundation for a further dynamic development and, thus, contributing our crucial part to the socio-economic development of our nation and fulfilling our great missions clearly assigned by the government in the decision on the establishment of our university. To do that, innovative thinking and acting by all faculty, administrative staff and students are of deciding role and of crucial importance. PB - VNU University of Engineering and Technology TI - The 2016 Annual Scientific Report of VNU University of Engineering and Technology AV - public EP - 56 ER - TY - PAT ID - SisLab3545 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3545/ IS - 1-0021424 (1-2017-00868) A1 - Tran, Xuan Tu A1 - Nguyen, Ngoc Sinh A1 - Bui, Duy Hieu Y1 - 2019/06/24/ N2 - Sáng ch? ?? c?p ??n quy trình mã hóa liên khung hình (inter-frame coding) cho phép xác ??nh các kh?i ?nh l?p l?i. Sau ?ó, th?c hi?n m?t quy trình mã hóa riêng cho các kh?i ?nh l?p l?i nh?m gi?m kích th??c chu?i bit mã hóa và lo?i b? các ?nh h??ng tiêu c?c c?a sai s? l??ng t?. Bên c?nh ?ó, sáng ch? c?ng trình bày m?t s? gi?i pháp ?? t?ng t?c công ?o?n xác ??nh kh?i ?nh l?p l?i. TI - Quy trình mã hóa liên khung hình h? tr? xác ??nh kh?i ?nh l?p l?i, gi?m kích th??c chu?i bit sau mã hóa và lo?i b? hi?u ?ng do sai s? l??ng t? cho kh?i ?nh l?p l?i AV - public EP - 31 ER - TY - CONF ID - SisLab56 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/56/ A1 - Tran, Xuan Tu A1 - Phan, Hai Phong A1 - Tran, Van Huan A1 - Tran, Quang Vinh A1 - Nguyen, Ngoc Binh Y1 - 2010/03/10/ N2 - To meet the increasing demands of recent applications, systems-on-chips (SoCs) are more and more complex and one system can be composed of many computing resources. The communication solution between these resources becomes one of big challenges in the design of SoCs. In this paper, we present the design and implementation of an AMBA Advanced High-performance Bus based bus architecture for a SoC platform on a Xilinx Virtex-4 XC4VLX40 FPGA. This architecture includes bus master and bus slave wrappers in order to ease the integration of intellectual property cores in systems. Simulation and implementation results are also reported and analyzed to prove the performance of the designed architecture. TI - Design and Implementation of an AMBA AHB Compliant Bus Architecture on FPGA SP - 169 M2 - Okinawa, Japan AV - none EP - 174 T2 - The IEICE VLSI Design Technologies (VLD) Conference ER - TY - BOOK CY - Hanoi, Vietnam ID - SisLab2561 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2561/ A1 - Tran, Xuan Tu A1 - Phan, Xuan Hieu A1 - Tran, Duc Tan A1 - Pham, Manh Thang A1 - Pham, Duc Thang A1 - Pham, Bao Son Y1 - 2017/06/01/ N2 - The VNU-UET Annual Scientific Report has been started from 2016. PB - VNU-UET ED - Tran, Xuan Tu ED - Pham, Bao Son TI - Annual Scientific Report 2017 (ASR 2017) AV - public EP - 35 ER - TY - INPR ID - SisLab3996 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3996/ A1 - Tran, Xuan Tuyen A1 - Dinh, Tran Hiep A1 - Le, Vu Ha A1 - Zhu, Qiuchen A1 - Ha, Quang Y1 - 2020/07// N2 - This paper presents a novel method for defect detection based on singular value decomposition (SVD) and histogram thresholding. First, the input image is divided into blocks, where SVD is applied to determine if a region contains crack pixels. The detected crack blocks are then merged to construct a histogram to calculate the best binarization threshold by incoporating a recent technique for multiple peaks detection and Otsu algorithm. To validate the effectiveness and advantage of the proposed approach over related thresholding algorithms, experiments on images collected by an unmanned aerial vehicle have been conducted for surface crack detection. The obtained results have confirmed the merits of the proposed approach in terms of accuracy when using some well-known evaluation metrics. TI - Defect detection based on singular value decomposition and histogram thresholding AV - public T2 - The 2020 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2020) ER - TY - JOUR ID - SisLab4565 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4565/ A1 - Tran Dinh, Duong A1 - Bui Duy, Dang A1 - Ogata, Kazuhiro N2 - We demonstrate the power of the simulation-based invariant verification technique through two case studies in which it is formally verified that two mutual exclusion protocols, MCS protocol and Anderson protocol, enjoy the mutual exclusion property by the simulation-based invariant verification technique. We initially attempted formally verifying that the two protocols enjoy the property by the induction-based invariant verification technique. We successfully completed the formal proof for MCS protocol by the simulation-based invariant verification technique earlier than the one by the induction- based invariant verification technique even though we started the latter earlier than the former. We did not successfully complete the formal proof for Anderson protocol by the induction-based invariant verification technique as of the time of this paper submission. We define a variant of simulation, "observably equivalent simulations," and prove some theorems on them to conduct the MCS case study. Given a state machine M, another state machine M' constructed by introducing auxiliary variables into M observably equivalently simulates M. In this sense, M' can be regarded as an abstract version of M. PB - IEEE JF - IEEE Access SN - 2169-3536 TI - Simulation-based invariant verification technique for the OTS/CafeOBJ method AV - none ER - TY - CONF ID - SisLab4566 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4566/ A1 - Tran Dinh, Duong A1 - Waki, Kentaro A1 - Ogata, Kazuhiro N2 - MCS is widely known as one of the most efficient and influential spinning lock mutual exclusion protocols. The protocol, however, only works under the assumption that processes do not crash while acquiring/releasing the lock or being in the critical section. Furthermore, the exit segment pseudo-code of MCS?s algorithm is not wait-free since a process releasing the lock needs to wait for the next process in the virtual queue to perform some steps. A new version of MCS has been proposed by S. Dhoked and N. Mittal such that the new version is wait-free and recoverable (i.e., if some processes crash, the protocol can recover and work normally). In this paper, we formally specify the recoverable wait-free version of MCS and conduct model checking to check whether the protocol enjoys the mutual exclusion property. Our experiments say that: (1) the property is not satisfied if crashes are allowed to occur without any restriction, (2) the protocol enjoys the property if crashes never happen at all, or (3) if crashes have not occurred recently. We also describe the challenge of how to formally specify dynamic memory allocation and present our solution to solve that problem. TI - Formal specification and model checking of a recoverable wait-free version of MCS AV - none M2 - Wyndham Pittsburgh University Center, Pittsburgh, USA T2 - International Conference on Software Engineering and Knowledge Engineering ER - TY - INPR ID - SisLab3381 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3381/ A1 - Tran Hong, Viet A1 - Nguyen Hoang, Quan A1 - Nguyen Van, Vinh Y1 - 2018/// N2 - Reordering in MT is a major challenge when translating between languages with different of sentence structures. In Phrase-based statistical machine translation (PBSMT) systems, syntactic pre-ordering is a commonly used preprocessing technique. This technique can be used to adjust the syntax of the source language to that of the target language by changing the word order of a source sentence prior to translation and solving to overcome a weakness of classical phrase-based translation systems: long distance reordering. In this paper, we propose a new pre-ordering approach by defining dependency-based features and using a neural network classifier for reordering the words in the source sentence into the same order in target sentence. Experiments on English-Vietnamese machine translation showed that our approach yielded a statistically significant improvement compared to our prior baseline phrase-based SMT system. TI - A Neural Network Classifier Based on Dependency Tree for English-Vietnamese Statistical Machine Translation AV - public T2 - Cicling 2018 ER - TY - CONF ID - SisLab4000 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4000/ A1 - Tran Viet, Khoa A1 - Yuris Mulya, Saputra A1 - Dinh Thai, Hoang A1 - Nguyen Linh, Trung A1 - Nguyen N, Diep A1 - Nguyen Viet, Ha A1 - Eryk, Dutkiewicz Y1 - 2020/05// N2 - Although the development of IoT Industry 4.0 has brought breakthrough achievements in many sectors, e.g., manufacturing, healthcare, and agriculture, it also raises many security issues to human beings due to a huge of emerging cybersecurity threats recently. In this paper, we propose a novel collaborative learning-based intrusion detection system which can be ef?ciently implemented in IoT Industry 4.0. In the system under consideration, we develop smart "filters" which can be deployed at the IoT gateways to promptly detect and prevent cyberattacks. In particular, each ?lter uses the collected data in its network to train its cyberattack detection model based on the deep learning algorithm. After that, the trained model will be shared with other IoT gateways to improve the accuracy in detecting intrusions in the whole system. In this way, not only the detection accuracy is improved, but our proposed system also can signi?cantly reduce the information disclosure as well as network traf?c in exchanging data among the IoT gateways. Through thorough simulations on real datasets, we show that the performance obtained by our proposed method can outperform those of the conventional machine learning methods. TI - Collaborative learning model for cyberattack detection systems in IoT industry 4.0 M2 - Seoul, South Korea AV - none T2 - IEEE Wireless Communications and Networking Conference (WCNC) ER - TY - CONF ID - SisLab1713 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1713/ A1 - Trieu, Hai Long A1 - Dang, Thanh Quyen A1 - Nguyen, Phuong Thai A1 - Nguyen, Le Minh Y1 - 2015/// TI - Phrase-based Machine Translation System AV - none M2 - Da Nang, Vietnam T2 - IWSLT: the 2015 International Workshop on Spoken Language Translation ER - TY - JOUR ID - SisLab1714 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1714/ IS - 1 A1 - Trieu, Hai Long A1 - Nguyen, Phuong Thai A1 - Nguyen, Le Minh Y1 - 2015/// PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering VL - 31 SN - 0866-8612 TI - A New Feature to Improve Moore's Sentence Alignment Method SP - 32 AV - none EP - 44 ER - TY - CONF ID - SisLab1768 UR - http://dx.doi.org/10.1109/KSE.2011.29 A1 - Trinh, Thanh Binh A1 - Truong, Ninh Thuan A1 - Nguyen, Viet Ha Y1 - 2011/// N2 - Development of many system features in a robust specification is a challenge in reactive system design. This paper presents a formal approach for specifying concurrent programs by refining undetermined events in Event-B. This approach investigates the concurrent aspect in specification and provides a general structure of models using Event-B specification. According to this structure, we illustrate the specification of three concurrent mechanisms: critical section access, reader-writer and producer-consumer. It is shown that the concurrent aspects in programming can be specified coherently using Event-B refinement. TI - Refining Undetermined Events for Specifying Concurrent Programs SP - 143 M2 - Vietnam AV - none EP - 149 T2 - KSE: the 2011 International Conference on Knowledge and Systems Engineering ER - TY - INPR ID - SisLab3654 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3654/ A1 - Trinh, Tuan Duong A1 - Nguyen, Ngoc Linh Y1 - 2019/// N2 - Bài báo trình bày vi?c áp d?ng thu?t toán l?c Kalman trong vi?c x? lý tín hi?u thu th?p ???c t? c?m bi?n ?o n?ng ?? b?i Sharp GP2Y1010AU0F. K?t qu? ???c ki?m ch?ng trên m?t h? th?ng ???c thi?t k? g?m: M?t module có nhi?m v? thu th?p và bi?n ??i d? li?u thu ???c t? c?m bi?n ?o n?ng ?? b?i; m?t module có nhi?m v? x? lý và l?c d? li?u này nh? b? l?c Kalman, r?i g?i d? li?u lên máy tính thông qua giao ti?p RS232. Hai module giao ti?p không dây v?i nhau b?ng sóng vô tuy?n 2.4 GHz. This paper presents the application of using Kalman filtering to filter the data which collected from Sharp GP2Y1010AU0F dust level sensor. A real system combined by two modules communicating with each other through a 2.4 GHz radio frequency line is designed to apply the method. One module collects and transforms data while the other one filters data with a Kalman filter then transfers this data to PC. PB - Hanoi University of Industry JF - Journal of Science and Technology TI - ?ng d?ng b? l?c kalman trong vi?c x? lý tín hi?u thu ???c t? c?m bi?n ?o n?ng ?? b?i SHARP GP2Y1010AU0F AV - public ER - TY - CONF ID - SisLab1953 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1953/ A1 - Truong, Anh Hoang A1 - Dang, Van Hung A1 - Dang, Duc Hanh A1 - Vu, Xuan Tung Y1 - 2016/// PB - Springer T3 - LNCS VL - 9581 TI - A Type System for Counting Logs of Multi-threaded Nested Transactional Programs SP - 157 AV - none EP - 168 T2 - 12th International Conference on Distributed Computing and Internet Technology (ICDCIT) ER - TY - JOUR ID - SisLab1739 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1739/ A1 - Truong, Anh Hoang A1 - Nguyen, Ngoc Khai Y1 - 2015/// PB - Tr??ng ??i h?c S? ph?m Hà N?i JF - T?p chí khoa h?c TI - H? th?ng ki?u tính c?n trên s? log cho ngôn ng? giao d?ch ?a lu?ng t?i gi?n AV - none ER - TY - CONF ID - SisLab1740 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1740/ A1 - Truong, Anh Hoang A1 - Nguyen, Ngoc Khai Y1 - 2015/// TI - H? th?ng ki?u ?? tính biên tài nguyên c?a các ch??ng trình giao d?ch l?ng nhau và ?a lu?ng AV - none M2 - Hanoi, Vietnam T2 - H?i ngh? nghiên c?u và ?ng d?ng Công ngh? thông tin 2015 ER - TY - CONF ID - SisLab1954 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1954/ A1 - Truong, Anh Hoang A1 - Nguyen, Ngoc Khai A1 - Dang, Van Hung A1 - Dang, Duc Hanh Y1 - 2016/// PB - Springer T3 - LNCS VL - 9965 TI - Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs SP - 82 AV - none EP - 99 T2 - 13th International Conference on Theoretical Aspects of Computing (ICTAC) ER - TY - JOUR ID - SisLab1191 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1191/ IS - 3 A1 - Truong, Anh Hoang A1 - Tran, Huy Vu A1 - Nguyen, Bao Ngoc Y1 - 2014/// JF - VNU Journal of Science: Comp. Science & Com. Eng. VL - 30 TI - Symbolic round-off error between ?oating-point and ?xed-point SP - 12 AV - none EP - 21 ER - TY - CONF ID - SisLab2677 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2677/ A1 - Truong, Dac Duy A1 - Nguyen, Ngoc Hoa Y1 - 2017/08// N2 - M?t trong nh?ng m?c tiêu quan tr?ng c?a cách m?ng công nghi?p l?n th? 4 (industrial 4.0) là ??a các thi?t b? v?t lý s? d?ng trong công nghi?p có kh? n?ng t? ??ng truy?n t?i d? li?u, tr?ng thái lên m?ng Internet và ti?p nh?n ?i?u khi?n mà không c?n ??n s? can thi?p c?a con ng??i. ?? làm ???c vi?c ?ó, m?t trong nh?ng bài toán c?n ph?i gi?i quy?t là xây d?ng m?t ph??ng pháp thu th?p và qu?n lý d? li?u phù h?p trong ?ó các d? li?u tr?ng thái, ho?t ??ng c?a thi?t b? c? khí s? ???c x? lý và l?u tr? trên các c? s? d? li?u ?ám mây (cloud database). Qua ?ó, ng??i dùng s? có th? tr?c ti?p quan sát, giám sát và ?i?u khi?n các thi?t b? thông qua trình duy?t Web, ?ng d?ng ?i?n tho?i thông minh,?, ??c l?p v? m?t ??a lý mà không c?n thi?t ph?i hi?n di?n trong môi tr??ng làm vi?c c?a thi?t b?. Chính vì nh?ng yêu c?u và l?i ích trên, trong bài báo này, chúng tôi gi?i thi?u k?t qu? nghiên c?u, xây d?ng và ?? xu?t mô hình thu th?p và qu?n lý d? li?u c?a các thi?t b? s? dung trong công nghi?p cho h? th?ng qu?n lý, giám sát và ?i?u khi?n ???c xây d?ng trên ?ám mây. Th? nghi?m ?ã ???c ti?n hành trên h? th?ng giám sát và ?i?u khi?n các tr?m tr?n bê tông cho phép kh?ng ??nh nh?ng l?i ?i?m c?a mô hình ?? xu?t so v?i nh?ng h? th?ng SCADA truy?n th?ng. TI - MÔ HÌNH THU TH?P VÀ QU?N LÝ D? LI?U TRONG CÁC H? TH?NG GIÁM SÁT VÀ ?I?U KHI?N CÔNG NGHI?P ?NG D?NG ?I?N TOÁN ?ÁM MÂY SP - 449 M2 - Da Nang AV - none EP - 458 T2 - FAIR'10 - Fundamental and Applied IT Research. ER - TY - JOUR ID - SisLab767 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/767/ A1 - Truong, Ninh Thuan A1 - Nguyen, Viet Ha Y1 - 2013/// JF - International journal of software engineering and knowledge engineering (IJSEKE) SN - 0218-1940 TI - An Approach to Checking Security Policy in Software Development AV - none ER - TY - CONF ID - SisLab1774 UR - http://dx.doi.org/10.1109/ASPEC.2007.61 A1 - Truong, Ninh Thuan A1 - Nguyen, Viet Ha Y1 - 2007/// N2 - Aspect J is an aspect-oriented extension of the Java language that enables a modular implementation of crosscutting concerns. Despite this, aspects lack support for formal specification and verification. This paper expresses the base class and some related aspects of Aspect J model in B notation. It aims to benefit from proof obligations generated by B tools to ensure the correctness of Aspect J component composition. Static crosscuts of aspects are guaranteed by proof obligations of relation clauses between B abstract machines and dynamic crosscuts are proved by proof obligations of B refinement machines. This approach is illustrated by verifying a simple example. TI - Using B to Verify the Weaving of Aspects SP - 199 AV - none EP - 205 T2 - 14th Asia-Pacific Software Engineering Conference (APSEC'07) ER - TY - CONF ID - SisLab1778 UR - http://dx.doi.org/10.1109/SEFM.2009.24 A1 - Truong, Ninh Thuan A1 - Trinh, Thanh Binh A1 - Nguyen, Viet Ha Y1 - 2009/// N2 - Formal specifications and reasoning techniques in software modelling are needed to ensure the correctness of the system at the design phase. Event-B is a formal method with support tools that allows the stepwise development of reactive systems. Such systems include multi-agent systems as a subclass. In this paper, we propose an approach to specify capabilities of a number of software agents. We then verify whether these capabilities help the agents to accomplish a certain task using a supported tool for Event-B. We use the binary numeral system as a case study to illustrate our approach. TI - Coordinated Consensus Analysis of Multi-agent Systems Using Event-B SP - 201 M2 - Hanoi, Vietnam AV - none EP - 209 T2 - Seventh IEEE International Conference on Software Engineering and Formal Methods ER - TY - CHAP ID - SisLab3206 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3206/ A1 - Tr??ng, Anh Hoàng A1 - Nguyen, Van Vinh Y1 - 2018/// N2 - S? phát tri?n m?nh và có nhi?u thành t?u ??t phá c?a c?a công ngh? thông tin và truy?n thông trong nh?ng n?m g?n ?ây ?ã và ?ang và s? ti?p t?c thay ??i cách con ng??i s?ng, làm vi?c, và gi?i trí. Trong l?nh v?c giáo d?c nói chung và ??c bi?t là sách giáo khoa và sách tham kh?o nói riêng, vi?c khai thác ?ng d?ng công ngh? thông tin trong giáo d?c ?ã ???c chú ý t? lâu. Sách ?i?n t? theo d?ng s? hóa sách gi?y, có th? thêm m?t s? thông tin ?a ph??ng ti?n, ?ã không còn xa l?i v?i ?a s? ng??i dùng. Tuy nhiên sách ?i?n t? d?ng này ch?a khai thác ???c nhi?u ti?m n?ng c?a công ngh? có th? giúp h?c sinh, sinh viên khai thác sách hi?u qu? h?n. Trong bài này chúng tôi phân tích s? phát tri?n c?a ?ng d?ng công ngh? trong sách giáo d?c và ?ng d?ng công ngh? trong h?c t?p ?? t? ?ó ??a ra m?t s? ?? xu?t ?? giúp vi?c phát tri?n các sách giáo d?c nói chung và ??c bi?t sách giáo khoa nói riêng nh?m nâng cao giá tr? cho sách, giúp ng??i h?c ti?p thu ki?n th?c hi?u qu? h?n mà tác gi? c?ng không m?t thêm quá nhi?u công s?c. Các ?? xu?t này c?ng áp d?ng cho các th? vi?n truy?n th?ng, có kho n?i n?i dung r?t phong phú c?a sách gi?y nh?ng ngày càng t? ra h?n ch? ?? thu hút ng??i h?c ??n khai thác. PB - VNU TI - Nâng cao hi?u qu? sách giáo d?c v?i công ngh? AV - public T2 - Th? vi?n thông minh 4.0: Công ngh? - D? li?u - Con ng??i ER - TY - JOUR ID - SisLab2543 UR - http://dx.doi.org/10.1007/s10703-017-0284-9 A1 - Tung, Vu Xuan A1 - To, Van Khanh A1 - Ogawa, Mizuhito Y1 - 2017/06/27/ N2 - This paper presents raSAT SMT solver, which is aimed to handle polynomial constraints over both reals and integers with simple unified methodologies. Its three main features are (1) a raSAT loop for inequalities, which adds testing to interval constraint propagation to accelerate SAT detection, (2) a non-constructive reasoning for equations over reals based on the generalized intermediate value theorem, and (3) soundness of floating-point arithmetic that is guaranteed by (a) rounding up/down over-approximations of intervals, and (b) confirmation of a satisfying instance detected by testing using the iRRAM package, which guarantees error bounds. PB - Springer JF - Formal Methods in System Design SN - 1572-8102 TI - raSAT: an SMT solver for polynomial constraints SP - 1 AV - none EP - 38 ER - TY - JOUR ID - SisLab2074 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2074/ IS - 1 A1 - Van Damme, Ellen A1 - Laukens, Kris A1 - Dang, Thanh Hai A1 - Van Ostade, Xaveer Y1 - 2010/// JF - International Journal of Biological Sciences VL - 6 SN - 1568-1577 TI - A manually curated network of the PML nuclear body interactome reveals an important role for PML-NBs in SUMOylation dynamics SP - 51 AV - none EP - 67 ER - TY - CONF ID - SisLab1966 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1966/ A1 - Varró, Dániel A1 - Asztalos, Márk A1 - Bisztray, Dénes A1 - Boronat, Artur A1 - Dang, Duc Hanh A1 - Geiß, Rubino A1 - Greenyer, Joel A1 - Gorp, Pieter Van A1 - Kniemeyer, Ole A1 - Narayanan, Anantha A1 - Rencis, Edgars A1 - Weinell, Erhard Y1 - 2007/// PB - Springer T3 - LNCS VL - 5088 TI - Transformation of UML Models to CSP: A Case Study for Graph Transformation Tools SP - 540 AV - none EP - 565 T2 - The 3rd International Conference on Applications of Graph Transformations with Industrial Relevance (AGTIVE) ER - TY - CONF ID - SisLab1310 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1310/ A1 - Vo, Chi My A1 - Nguyen, Tri Thanh A1 - Nguyen, Quoc Long A1 - Bui, Khac Luyen Y1 - 2014/// TI - Applicability of Artificial Neural Networks on Surface Subsidence Prediction due to Underground Mining AV - none M2 - Vung Tau, Viet Nam T2 - 2014: the 3nd International Conference on Advances in Mining and Tunneling (ICAMT) ER - TY - PAT ID - SisLab4353 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4353/ IS - 1-2018-05587 A1 - Vo, Dinh Hieu A1 - Nguy?n, Ng?c S?n A1 - Tr?n, Minh Tu?n A1 - Nguy?n, V?n S?n Y1 - 2020/11/02/ TI - Quy trình ki?m tra trùng l?p trong nhóm v?n b?n AV - none ER - TY - CONF ID - SisLab107 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/107/ A1 - Vo, Hieu Dinh A1 - Phung, Dung Chi A1 - Vu, Quang Dung A1 - Nguyen, Viet Ha Y1 - 2012/08/17/ N2 - Service-oriented architecture (SOA) provides a solution for building information systems with reusability, flexibility, and extensibility. In SOA, new services can be developed by using existing services. BPEL is considered as the main means for composing services. In service composition, a composite service may be built from element services which belong to different administrative domains. Therefore, in order to exploit the benefits of service composition, we must carefully consider security issues. One of them is to protect users' information. In this paper, we describe an approach for securing BPEL composite Web services. We assume that some users' data received by the composite services needs securing. The proposed approach makes sure that when the data is sent out from the composite service appropriate security policies will be applied. KW - Cryptography;Privacy;Protocols;Runtime;Service oriented architecture;Web services;information systems;security of data;service-oriented architecture;specification languages;BPEL;SOA;administrative domains;composite Web services;data security;information systems;security issues;service composition;service-oriented architecture;BPEL;SOA;security;service composition; TI - Securing Data in Composite Web Services SP - 60 M2 - Danang, Vietnam AV - none EP - 64 T2 - 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab3193 UR - https://doi.org/10.1016/j.procs.2016.08.142 A1 - Vo, Quoc Bao A1 - Tran, Trong Hieu A1 - Nguyen, Thi Hong Khanh Y1 - 2016/// TI - On the Use of Surplus Division to Facilitate Efficient Negotiation in the Presence of Incomplete Information SP - 295 AV - none EP - 304 T2 - Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 20th International Conference KES-2016, York, UK, 5-7 September 2016. ER - TY - CONF ID - SisLab3165 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3165/ A1 - Vo, Van Hoang A1 - Nguyen, Nam Hai A1 - Nguyen, Ngoc Hoa Y1 - 2018/10// N2 - T?n công m?ng ngày càng di?n bi?n ph?c t?p, ?a d?ng v? hình th?c và ch?ng lo?i. ??c bi?t ??i v?i các ??i t??ng ng??i dùng khi s? d?ng h? th?ng th? ?i?n t? ?? trao ??i, là m?t trong nh?ng m?c tiêu mà Hacker h??ng ??n. Các v?n b?n ???c giao d?ch ngày càng nhi?u thông qua h? th?ng th? ?i?n t?, nó d??ng nh? không th? thi?u trong th?i bu?i công ngh? chính ph? ?i?n t? hi?n nay, ?ó c?ng là m?t trong nh?ng ?i?m y?u d?n ??n các cu?c t?n công m?ng vào ng??i dùng, khi Hacker s? d?ng các k? thu?t che d?u mã ??c vào file v?n b?n ?? t?n công máy tính ng??i dùng thông qua h? th?ng th? ?i?n t?. ?ây c?ng là m?t trong nh?ng hình th?c t?n công ph? bi?n hi?n nay ???c Hacker s? d?ng, k? t?n công không c?n ph?i t?o ra nh?ng ch?ng lo?i mã ??c m?i, ph?c t?p, mà ch? c?n thay ??i làm r?i các d?u hi?u nh?n d?ng, ?? tránh s? phát hi?n c?a các ch??ng trình, thi?t b? an ninh. Bài báo này ?? xu?t ph??ng pháp m?i gây r?i mã ??c và k?t h?p các k? thu?t gây r?i nh?m m?c ?ích che d?u mã ??c ?? l?n tránh s? tr??c s? phát hi?n c?a các ch??ng trình b?o v? nh? IDS/IPS, AV????c s? d?ng thông qua tính n?ng macro trong ch??ng trình Office c?a Microsoft. ?ây là m?t trong nh?ng trình so?n th?o v?n b?n ph? bi?n nh?t và ???c s? d?ng r?ng r?i trong vi?c giao d?ch qua h? th?ng th? ?i?n t?. ?ó là s? k?t h?p các k? thu?t làm r?i mã ??c macro, khi k?t h?p các k? thu?t này, cho phép k? t?n công che d?u mã ??c tr??c ph?n l?n s? phát hi?n c?a các ch??ng trình, thi?t b? b?o v?, ??c bi?t là các thi?t b? phát hi?n và ng?n ch?n mã ??c nh? Anti-virus. ?? t? ?ó giúp ng??i dùng, và ng??i qu?n tr? m?ng có cái nhìn rõ h?n, ??ng th?i có nh?ng gi?i pháp phòng tránh tr??c các d?ng t?n công này TI - M?T S? K? THU?T GÂY R?I, CHE D?U MÃ ??C MACRO M2 - Hà N?i AV - none T2 - K? y?u H?i ngh? Qu?c gia l?n th? XI v? Nghiên c?u c? b?n và ?ng d?ng Công Ngh? thông tin (FAIR) ER - TY - JOUR ID - SisLab1415 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1415/ IS - 3 A1 - Vu, Ba Duy A1 - Du, Phuong Hanh Y1 - 2014/// JF - T?p chí ??i h?c Qu?c gia Hà N?i VL - 30 TI - Nâng cao hi?u n?ng x? lý giao tác v?i mô hình CSDL trong b? nh? SP - 1 AV - none EP - 6 ER - TY - JOUR ID - SisLab1473 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1473/ IS - 6 A1 - Vu, Dieu Huong A1 - Chiba, Yuki A1 - Yatake, Kenro A1 - Aoki, Toshiaki Y1 - 2015/// PB - IEICE JF - IEICE Transactions on Information and Systems VL - E98-D SN - 1745-1361 TI - A Framework for Verifying the Conformance of Design to Its Formal Specifications SP - 1137 AV - none EP - 1149 ER - TY - CONF ID - SisLab2379 UR - http://tase2016.ecnu.edu.cn/ A1 - Vu, Dieu Huong A1 - Chiba, Yuki A1 - Yatake, Kenro A1 - Aoki, Toshiaki Y1 - 2016/07/19/ N2 - Automotive systems are widely used in industry and our daily life. As the reliability of automotive systems is becoming a greater challenge in our community, increasingly more automotive companies are interested in applying formal methods to improve the reliability of automotive systems. We focus on automotive operating systems conforming to the OSEK/VDX standard. Such operating systems are considered as important components to ensure the reliability of the automotive systems. In previous work, we proposed a framework to verify the design models of reactive systems against their specifications. This framework allows us to check whether the design model conforms to the specification based on a simulation relation. This paper shows a case study in which the framework is applied to a real design of the OSEK/VDX operating system. As a result, we found that we were able to check several important properties of the design model. We show the effectiveness and practicality of the framework based on the results of the case study. TI - Verifying OSEK/VDX OS Design using Its Formal Specification SP - 81 M2 - Shanghai, China AV - public EP - 88 T2 - TASE 2016 ER - TY - CONF ID - SisLab2711 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2711/ A1 - Vu, Dieu Huong A1 - Truong, Anh Hoang A1 - Chiba, Yuki A1 - Aoki, Toshiaki Y1 - 2017/// N2 - We present a model-based testing approach for reactive systems where both test inputs and expected results are generated from `restricted' Event-B specifications. We show that it is possible to automatically build the restricted Event-B specifications from the original ones base on a knowledge base of the system under tests. The restricted models are to reduce the state space of the original Event-B models while preserving the possible testing paths, so that our model-based generated test suite can archive equivalent path coverage as using the original models. We also present a tool and a testing skeleton that are easy to use so that system developers can effectively test an arbitrary number of scenarios with reactive systems. TI - Automated testing reactive systems from Event-B model M2 - Ha Noi, Viet Nam AV - public T2 - 2017 4th National Foundation for Science and Technology Development Conference on Information and Computer Science ER - TY - CONF ID - SisLab2366 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2366/ A1 - Vu, Duc Quang A1 - Hoang, Xuan Huan A1 - Do, Thanh Mai Y1 - 2016/// TI - M?t thu?t toán hi?u qu? d?a trên gi?i thu?t t?i ?u ?àn ki?n gi?i bài toán r|p trung tâm AV - public T2 - FAIR 2016 ER - TY - CONF ID - SisLab2369 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2369/ A1 - Vu, Duc Quang A1 - Nguyen, Van Truong A1 - Hoang, Xuan-Huan Y1 - 2016/// N2 - Nature-inspired algorithms are often used to find optimal solutions for many combinatorial problems. An immune inspired algorithm, opt-aiNet algorithm, is well known for func- tion optimization. In this paper, we develop a combination of local search with opt-aiNet, called lopt-aiNet, to solve construction site layout (CSL) problem. The effectiveness of the proposed algorithm is investigated through experiments on some datasets taken from the state-of-art and a randomly created dataset. Ex- perimental results show that the lopt-aiNet can produce optimal transportation cost with lower run time compared to the site layouts generated by metaheuristics: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and aiNet. TI - An Improved Arti?cial Immune Network For Solving Construction Site Layout Optimization AV - public T2 - RIVF 2016 ER - TY - CONF ID - SisLab2987 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2987/ A1 - Vu, Duy Loi A1 - Nguyen, Dinh Viet A1 - Ta, Huu Trung Y1 - 2007/09// N2 - Bài báo trình bày m?t s? k?t qu? nghiên c?u b??c ??u v? m?ng di ??ng cá nhân theo tiêu chu?n IEEE 802.15.4, m?t tiêu chu?n c?a m?ng IEEE 802.15 v?i t?c ?? th?p, ??c bi?t phù h?p ?? t? ch?c các m?ng c?m bi?n (sensor networks) trong t??ng lai. Sau khi gi?i thi?u t?ng quan v? ??c tr?ng công ngh? c?a m?ng di ??ng cá nhân IEEE 802.15, bài báo trình bày m?t s? nguyên t?c ho?t ??ng c? b?n c?a m?ng di ??ng IEEE 802.15.4, ví d?: t? ch?c k?t n?i ngang hàng p2p và k?t n?i theo hình sao, ?i?u khi?n truy nh?p MAC, ??c tr?ng trao ??i s? li?u gi?a tr?m ?i?u khi?n và các tr?m làm vi?c. M?t s? thông s? hi?u su?t ho?t ??ng c?a m?ng nh?: t? l? các gói tin ???c phân phát ??n ?ích (packet delivery ratio), ?? tr? trung bình trên m?t ch?ng (hop delay), t? su?t liên k?t thành công tr?m làm vi?c v?i tr?m ?i?u khi?n, ... ???c tính toán trên c? s? s? d?ng b? ch??ng trình mô ph?ng m?ng NS-2 cho phép b??c ??u phân tích, ?ánh giá hi?u qu? ho?t ??ng c?a m?ng IEEE 802.15.4. TI - Nguyên t?c và hi?u su?t ho?t ??ng c?a m?ng di ??ng cá nhân theo tiêu chu?n IEEE 802.15.4 SP - 239 M2 - Da Lat, Viet Nam AV - none EP - 248 T2 - H?i th?o Qu?c gia l?n th? IX: ?M?t s? v?n ?? ch?n l?c c?a Công ngh? thông tin và Truy?n thông? ER - TY - CONF ID - SisLab2763 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2763/ A1 - Vu, Minh Manh A1 - Hoang, Xuan Huan Y1 - 2017/10/19/ N2 - In this article, we propose a linear threshold model to the problem of minimizing the spread of misinformation for cases where partial knowledge of misinformation sources is available by using monitors,the misinformation propagation time and the budget for placing monitors are restricted, and proved it is NP-Hardness. At the same time, we also suggest two greedy algorithms to solve the problem. Experimental results show the dominant advantages of the algorithms in comparison with other commonly used algorithms. TI - Minimizing the Spread of Misinformation on online Social Networks with Time and Budget constraint SP - subjects M2 - Hue, Vietnam AV - public EP - IT T2 - The 2017 International Conference on Knowledge and Systems Engineering (KSE) ER - TY - CONF ID - SisLab1556 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1556/ A1 - Vu, Ngoc Trinh A1 - Ha, Quang Thuy A1 - Nguyen, Hung Son Y1 - 2016/03/26/ N2 - Tích h?p d? li?u là v?n ?? nghiên c?u có nhi?u ?ng d?ng quan tr?ng trong Khoa h?c máy tính c?ng nh? nhi?u l?nh v?c c?a cu?c s?ng. Vi?c nghiên c?u v? tích h?p d? li?u ?ã ???c ti?n hành trong nhi?u th?p k? g?n ?ây và ?ã ??t ???c nhi?u k?t qu? quan tr?ng. Tuy nhiên, v?i m?t s? l?nh v?c ??c thù, các k?t qu? nghiên c?u v? tích h?p d? li?u còn nhi?u h?n ch?. Trong nghiên c?u này chúng tôi xem xét v?n ?? tích h?p mô hình d? li?u trong trung tâm d? li?u ngành d?u khí Vi?t Nam. T? vi?c kh?o sát, ?ánh giá th?c tr?ng công tác t? ch?c, l?u tr? và s? d?ng d? li?u c?a các ??n v? trong T?p ?oàn D?u khí Vi?t Nam, chúng tôi xây d?ng mô hình tích h?p d? li?u cho ngành D?u khí. Các k?t qu? chính ?ã ??t ???c bao g?m: a) xác ??nh các mô hình d? li?u t? các ph?n m?m qu?n lý d? li?u th?m dò khai thác ph? bi?n hi?n nay; b) xây d?ng m?t Ontology v? th?m dò khai thác d?u khí và c) ?? xu?t gi?i pháp tích h?p các ontology chuyên ngành d?u khí có s? d?ng m?t s? thu?t toán h?c máy. TI - Nghiên c?u tích h?p mô hình d? li?u trong trung tâm d? li?u ngành d?u khí vi?t nam M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - CONF ID - SisLab2942 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2942/ A1 - Vu, Ngoc Trinh A1 - Nguyen, Quoc Dat A1 - Nguyen, Tien Dat A1 - Nguyen, Manh Cuong A1 - Vu, Van Vuong A1 - Ha, Quang Thuy Y1 - 2018/03// N2 - This study provides a positive-unlabeled learning model for extending a Vietnamese petroleum dictionary based on Vietnamese Wikipedia data. Machine learning algorithms with positive and unlabeled data together with separated and combined between Google similarity distance and Cosine similarity distance, used in this study. The data sources used to integrate are English - Vietnamese oil and gas dictionary and the Vietnamese Wikipedia. In the results, a novelty way for data integration with higher accuracy by using a combination of algorithms. The first Vietnamese oil and gas ontology was built in Vietnam. This ontology is a useful tool for staff in the oil and gas industry in training, research, search daily. PB - Springer Nature 2018 VL - 10751 TI - A Positive-Unlabeled Learning Model for Extending a Vietnamese Petroleum Dictionary Based on Vietnamese Wikipedia Data SP - 190 M2 - Dong Hoi, Vietnam AV - none EP - 199 T2 - 2018 10th Asian Conference on Intelligent Information and Database Systems (ACIIDS) ER - TY - CONF ID - SisLab1611 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1611/ A1 - Vu, Ngoc Trinh A1 - Tran, Van Hien A1 - Le, Hoang Quynh A1 - Tran, Mai Vu Y1 - 2015/// N2 - Building a labeled corpus which contains sufficient data and good coverage along with solving the problems of cost, effort and time is a popular research topic in natural language processing. The problem of constructing automatic or semi-automatic training data has become a matter of the research community. For this reason, we consider the problem of building a corpus in phenotype entity recognition problem, class-specific feature detectors from unlabeled data based on over 10260 unique terms (more than 15000 synonyms) describing human phenotypic features in the Human Phenotype Ontology (HPO) and about 9000 unique terms (about 24000 synonyms) of mouse abnormal phenotype descriptions in the Mammalian Phenotype Ontology. This corpus evaluated on three corpora: Khordad corpus, Phenominer 2012 and Phenominer 2013 corpora with Maximum Entropy and Beam Search method. The performance is good for three corpora, with F-scores of 31.71% and 35.77% for Phenominer 2012 corpus and Phenominer 2013 corpus; 78.36% for Khordad corpus. TI - A Method for Building a Labeled Named Entity Recognition Corpus Using Ontologies SP - 141 M2 - Ho Chi Minh city, Vietnam AV - none EP - 149 T2 - KSE: the 2015 International Conference on Knowledge and Systems Engineering ER - TY - JOUR ID - SisLab3395 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3395/ A1 - Vu, Nguyen Thuc A1 - Le, Tuan Linh Y1 - 2018/12// N2 - Trong nh?ng n?m v?a qua, cùng v?i s? xu?t hi?n c?a các thu?t ng? ?Cách m?ng Công nghi?p l?n th? 4? (hay còn g?i là CMCN 4.0), Internet v?n v?t (Internet of Things - IoT) và phong trào kh?i nghi?p sáng t?o kh?p n?i trên th? gi?i d?a vào Công ngh? Thông tin - Truy?n thông (ICT) chúng ta ?ã ???c th?y s? xu?t hi?n c?a r?t nhi?u ph?n m?m và n?n t?ng làm thay ??i hoàn toàn cu?c s?ng c?a c?ng ??ng. Các ?ng d?ng này ?em ??n r?t nhi?u s? ti?n l?i trong cu?c s?ng, làm gi?m các chi phí không c?n thi?t, ti?t ki?m th?i gian, công s?c c?a con ng??i m?t cách ?áng k?. ? Vi?t Nam, chúng ta d? dàng ki?m ??m m?t s? tên tu?i n?i b?t trong các l?nh v?c chính nh?: Grab, Go-Viet, EMDDI, FastGo, Be, Aber, XELO,? (l?nh v?c giao thông); MoMo, 1Pay, VTCPay, ViettelPay, VNPTPay, ZaloPay, SamsungPay, Vimo, Tima, ? (l?nh v?c công ngh? tài chính); Now, Giaohangtietkiem.vn, LaLamove, GHN, ShipVN,? (l?nh v?c giao v?n); Booking.com, Trivago, Tripi, Traveloka,? (l?nh v?c du l?ch). Trong l?nh v?c Y t? c?ng ?ã có m?t s? ?ng d?ng ???c xây d?ng và tri?n khai ? Vi?t Nam nh? eDoctor, Vicare, Jio Health, VieVie, Bacsi24, Udr,? Tuy nhiên, theo tìm hi?u c?a chúng tôi thì ? l?nh v?c Y t? ch?a có ?ng d?ng (ph?n m?m) nào cung c?p n?n t?ng dùng chung (Platform) ?? các c? s? Y t? ch? vi?c dùng nh? là m?t h? th?ng riêng c?a mình mà không ph?i b? công s?c và ti?n b?c ra xây d?ng c?ng nh? ph?i có ??i ng? cán b? Công ngh? Thông tin chuyên trách (?ây là m?t v?n ?? r?t nan gi?i v?i các c? s? Y t? ? quy mô còn nh?, ??i ng? cán b? m?ng và n?ng l?c qu?n tr? v?n còn h?n ch? do ? trong giai ?o?n ??u phát tri?n). Trong bài này, chúng tôi ?? c?p ??n vi?c thi?t k? c?u trúc và xây d?ng m?t n?n t?ng Y t? thông minh dùng chung (?ng d?ng ViDoctor) h??ng t?i cá nhân PB - T?p chí khoa h?c qu?n lý và công ngh? - Tr??ng ??i h?c Công Ngh? và Qu?n Lý H?u Ngh? JF - T?p chí khoa h?c qu?n lý và công ngh? - Tr??ng ??i h?c Công Ngh? và Qu?n Lý H?u Ngh? VL - 06 SN - 2525-2348 TI - Thi?t k? và xây d?ng ph?n m?m n?n t?ng (Platform) cung c?p, qu?ng bá d?ch v? Y t? thông minh h??ng t?i cá nhân Structural design and the development, setting up the Platform for individualized commom uses to provide and advertise the Smart Medical Service AV - public ER - TY - CONF ID - SisLab1198 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1198/ A1 - Vu, Quang Dung A1 - Nguyen, Ha Thanh A1 - Vu, Danh Viet A1 - Nguyen, Viet Ha A1 - Nakajima, Nobuyasu Y1 - 2014/12/04/ TI - An Architecture for Web Services Mash-Up based on Mobile Agents AV - none M2 - Ha Noi, Viet Nam T2 - 2014 : The 5th Symposium on Information and Communication Technology (SoICT 2014) ER - TY - CONF ID - SisLab1195 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1195/ A1 - Vu, Quang Dung A1 - Nguyen, Viet Ha A1 - Nobuyasu, Nakajima Y1 - 2014/// SN - 978-1-4799-2904-7, DOI: 10.1109/ComManTel TI - Agent based Adaptive Connection of Mobile Devices SP - 257 M2 - Danang, Vietnam AV - none EP - 262 T2 - 2014: The 2nd International Conference on Computing, Management and Telecommunications (ComManTel 2014) ER - TY - CONF ID - SisLab1196 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1196/ A1 - Vu, Quang Dung A1 - Vu, Danh Viet A1 - Nguyen, Ha Thanh A1 - Bui, Phi Diep A1 - Nguyen, Viet Ha A1 - Nakajima, Nobuyasu Y1 - 2014/04/27/ SN - 978-1-4799-2904-7, DOI: 10.1109/ComManTel.2014.6825615 TI - Adaptive Web Page Layout for Mobile Devices SP - 263 M2 - Danang, Vietnam AV - none EP - 268 T2 - 2014: The 2nd International Conference on Computing, Management and Telecommunications (ComManTel 2014) ER - TY - CONF ID - SisLab2121 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2121/ A1 - Vu, Quang Hiep A1 - Li, Meijing A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2013/11// TI - A novel clustering method for animal trajectory analysis using Wireless Sensor Network AV - none T2 - Conference on Awareness Science and Technology and Ubi-Media Computing ER - TY - CONF ID - SisLab2123 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2123/ A1 - Vu, Quang Hiep A1 - Vu, Thi Hong Nhan A1 - Kim, Yonggil Y1 - 2013/09// TI - Predicting the intended wildlife movement in the Wireless Sensor Networks AV - none T2 - 6th International Conference FITAT ER - TY - CONF ID - SisLab1426 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1426/ A1 - Vu, Quang Hiep A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2014/08// TI - Constructing a System for Monitoring, Managing Groundwater in the Industrial Zones of Hanoi City AV - none M2 - Chiang Mai, Thailand T2 - 2014: the 7th International Conference on Frontiers of Information Technology, Applications and Tools (FITAT?14), The Fourth PT-ERC International Symposium on Personalized Medicine (FITAT & ISPM) ER - TY - CONF ID - SisLab2120 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2120/ A1 - Vu, Quang Hiep A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2014/08// TI - Constructing a System for Monitoring, Managing Groundwater in the Industrial Zones of Hanoi City AV - none M2 - Thailand T2 - FITAT/ISPM 2014 ER - TY - CONF ID - SisLab1313 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1313/ A1 - Vu, T. Thai A1 - Nguyen, Dinh Viet A1 - Nguyen, M. Hien Y1 - 2014/// TI - An Energy-Aware Routing Protocol for Wireless Sensor Networks Based on K-Means Clustering SP - 297 M2 - Saigon, Vietnam AV - none EP - 306 T2 - 2013: International Conference on Advanced Engineering - Theory and Application (AETA 2013) ER - TY - CONF ID - SisLab1557 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1557/ A1 - Vu, Thi Dao A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2016/03/26/ N2 - Model- based testing plays a significant role in practice and a lot of researches on it has been investigated in recent years due to great benefits. There are some approaches for model- based testing: test data generation, test cases generation from behavior models and test scripts generation from abstract tests. Current research focuses on generating executable test cases from Unified Modeling Language (UML) sequence diagrams and object constraint language (OCL). In this paper we propose an automated test cases generation method from sequence diagrams, class diagrams, and object constraint language. The method supports UML 2.0 sequence diagrams including eight kinds of combined fragments describing control follow of systems. Test cases are generated with respect to the given concurrency coverage criteria. With strong concurrency coverage, generating exhaustive test cases for all concurrent interleaving sequences is exponential in size. The key idea of this method is to create selection of possible test scenarios in special case of exploring the message sequence with their possible interleaving in parallel or weak sequencing fragments. Test data for testing loop fragments is also generated. We implemented a tool to automate the proposed method and studied its feasibility and effectiveness. Experimental results show that the method can generate test cases on demand to satisfy a given concurrency coverage criterion and can detect up to 74.5% of seeded faults. TI - A Method for Automated Test Cases Generation from Sequence Diagrams and Object Constraint Language for Concurrent Programs M2 - Hanoi AV - public T2 - SW4PHD: the 2016 Scientific Workshop for PhD Students ER - TY - INPR ID - SisLab1982 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1982/ A1 - Vu, Thi Dao A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2016/// N2 - This paper proposes an automated test cases generation method from sequence diagrams, class diagrams, and object constraint language. The method supports UML 2.0 sequence diagrams including eight kinds of combined fragments describing control ?ow of systems. Test cases are generated with respect to the given concurrency coverage criteria. With strong concurrency coverage, generating exhaustive test cases for all concurrent interleaving sequences is exponential in size. The key idea of this method is to create selection of possible test scenarios in special case of exploring the message sequence with their possible interleaving in parallel or weak sequencing fragments. Test data for testing loop fragments are also generated. We implement a tool to automate the proposed method and studied its feasibility and e?ectiveness. Experimental results show that the method can generate test cases on demand to satisfy a given concurrency coverage criterion and can detect up to 74. 5% of seeded faults. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering SN - 0866-8612 TI - A Method for Automated Test Cases Generation from Sequence Diagrams and Object Constraint Language for Concurrent Programs AV - public ER - TY - CONF ID - SisLab2697 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2697/ A1 - Vu, Thi Dao A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2017/// N2 - This paper proposes an automated test cases generation method from sequence diagrams and class diagrams with string constraints. The method supports UML 2.0 sequence diagrams including twelve combined fragments. An algorithm for generating test scenarios are developed to avoid test paths explosion without having data sharing points of threads in parallel fragments or weak sequencing fragments. Test data are also generated with solving constraints of string variables. We standardize string constraints and equations at the boundary of variables that are input formula of Z3-str solver. Comparing with the current approach of the solver, some preprocessing rules are extended for other operations such as charAt, lastindexOf, trim, startsWith and endsWith. If a result of the Z3-str is SAT, test data of each test scenario are generated to satisfy the constraints with boundary coverage. A tool is implemented to support the proposed method, and some experiments are also presented to illustrate the e?ectiveness of the tool. TI - A Method for Automated Test Cases Generation from UML Models with String Constraints SP - 525 M2 - Japan AV - public EP - 536 T2 - The 9th Asian Conference on Intelligent Information and Database Systems ER - TY - CONF ID - SisLab1540 UR - http://dl.acm.org/citation.cfm?doid=2833258.2833294 A1 - Vu, Thi Dao A1 - Pham, Ngoc Hung A1 - Nguyen, Viet Ha Y1 - 2015/// N2 - This paper proposes an automated test data generation method from the information embedded in model elements such as Unified Modeling Language (UML) sequence diagrams, class diagrams, and Object Constraint Language (OCL). The method supports UML 2.0 sequence diagrams including eight kinds of combined fragments describing control flow of systems. Comparing with some approaches by using depth first search (DFS) or breadth first search (BFS) algorithms, the proposed method generates all possible test scenarios with the higher error uncover capability. Test data for testing loop fragment is also generated. Therefore, it helps to detect errors in testing loops and the concurrency errors such as safety and liveness property of the systems. TI - A Method for Automated Test Data Generation from Sequence Diagrams and Object Constraint Language SP - 335 M2 - Hue, Vietnam AV - none EP - 341 T2 - SoICT: the 2015 Symposium on Information and Communication Technology ER - TY - JOUR ID - SisLab1772 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1772/ IS - 11 A1 - Vu, Thi Dao A1 - To, Van Khanh A1 - Nguyen, Viet Ha Y1 - 2014/06// JF - T?p chí CNTT & TT: Các công trình nghiên c?u, phát tri?n và ?ng d?ng CNTT & TT VL - V TI - Ph??ng pháp sinh các ca ki?m th? t? ??ng t? các mô hình thi?t k? UML và ngôn ng? ràng bu?c ??i t??ng OCL SP - 70 AV - none EP - 82 ER - TY - CONF ID - SisLab2122 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2122/ A1 - Vu, Thi Hong Nhan Y1 - 2013/09// TI - An Android-based Intelligent Tourism Recommendation System AV - none T2 - 6th International Conference FITAT ER - TY - CONF ID - SisLab2132 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2132/ A1 - Vu, Thi Hong Nhan Y1 - 2011/05// TI - A Framework for Detecting Health Condition of a Mobile Subject AV - none M2 - Korea T2 - 4th International Conference FITAT/DBMI ER - TY - CONF ID - SisLab3749 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3749/ A1 - Vu, Thi Hong Nhan Y1 - 2019/07// TI - A Framework for Ridesharing Recommendation Services AV - none T2 - Advances in Intelligent Information Hiding and Multimedia Signal Processing, Smart Innovation, Systems and Technologies ER - TY - CONF ID - SisLab2127 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2127/ A1 - Vu, Thi Hong Nhan A1 - Bui, The Duy A1 - Vu, Quang Hiep A1 - Ta, Viet Cuong Y1 - 2012/01// TI - A Breadth-First Search Based Algorithm for Mining Frequent Movements From Spatiotemporal Databases AV - none M2 - Vietnam T2 - International Conference on Convergence Technology ER - TY - CONF ID - SisLab2145 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2145/ A1 - Vu, Thi Hong Nhan A1 - Chi, Cheong Hee A1 - Ryu, Keun Ho Y1 - 2005/// TI - Mining Sequential Patterns from Moving Object Databases AV - none M2 - Japan T2 - Asian Symposium on Geographic Information Systems ER - TY - CONF ID - SisLab2146 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2146/ A1 - Vu, Thi Hong Nhan A1 - Chi, Jeong Hee A1 - Ryu, Keun Ho Y1 - 2004/// TI - A Data Model for Region with Indeterminate Boundaries AV - none M2 - China T2 - Asian Symposium on Geographic Information System ER - TY - CONF ID - SisLab2142 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2142/ A1 - Vu, Thi Hong Nhan A1 - Chi, Jeong Hee A1 - Ryu, Keun Ho Y1 - 2006/// TI - Discovery of Spatiotemporal Patterns in Mobile Environment AV - none M2 - China T2 - Asia Pacific Web Conference, LNCS ER - TY - CONF ID - SisLab2144 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2144/ A1 - Vu, Thi Hong Nhan A1 - Chi, Jeong Hee A1 - Ryu, Keun Ho Y1 - 2005/// TI - An Efficient Algorithm for Mining Frequent Sequences in Spatiotemporal Data AV - none T2 - Korea Spatial Information System Society ER - TY - CONF ID - SisLab2147 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2147/ A1 - Vu, Thi Hong Nhan A1 - Chi, Jeong Hee A1 - Ryu, Keun Ho Y1 - 2004/// TI - Query Operations for Fuzzy Spatiotemporal Databases AV - none T2 - OpenGIS ER - TY - CONF ID - SisLab2149 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2149/ A1 - Vu, Thi Hong Nhan A1 - Kim, Sang Ho A1 - Ryu, Keun Ho Y1 - 2003/// TI - A Fuzzy Spatio-Temporal Data Model and Dynamic Query Operations AV - none M2 - Korea T2 - Asian Conference on Remote Sensing and International Symposium on Remote Sensing ER - TY - CONF ID - SisLab2143 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2143/ A1 - Vu, Thi Hong Nhan A1 - Kim, Sang Ho A1 - Ryu, Keun Ho Y1 - 2005/// TI - Representation and Manipulation of Geospatial Objects with Indeterminate Extents AV - none M2 - China T2 - Asia Pacific Web Conference ER - TY - CONF ID - SisLab2148 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2148/ A1 - Vu, Thi Hong Nhan A1 - Kim, Sang Ho A1 - Ryu, Keun Ho Y1 - 2003/// TI - Spatio-Temporal Data Modeling for Fuzzy Regions AV - none T2 - First Asian Symposium on Geographic Information Systems from Computer Science and Engineering View ER - TY - JOUR ID - SisLab2136 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2136/ A1 - Vu, Thi Hong Nhan A1 - Lee, Bum Ju A1 - Ryu, Keun Ho Y1 - 2008/// JF - Korea Information Processing Society (KIPS) journal TI - Discovery of Frequent Sequence Patterns in Moving Object Databases AV - none ER - TY - CONF ID - SisLab2135 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2135/ A1 - Vu, Thi Hong Nhan A1 - Lee, Jun Wook A1 - Kim, Hiseok A1 - Ryu, Keun Ho Y1 - 2008/07// TI - An HRV Patterns Discovering Neural Network for Mobile Healthcare Services AV - none M2 - Australia T2 - IEEE 8th International Conference on Computer and Information Technology Workhops ER - TY - CONF ID - SisLab2125 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2125/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo Y1 - 2012/08// TI - Development of a Mobile Tourism System AV - none M2 - Mongolia T2 - the ACM 5th International Conference FITAT ER - TY - JOUR ID - SisLab1424 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1424/ IS - 3 A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Bui, The Duy Y1 - 2014/03// JF - Computing Journal VL - 96 SN - 0010-485X TI - A Technique for Extracting Behavioral Sequence Patterns From GPS Data SP - 163 AV - none EP - 188 ER - TY - JOUR ID - SisLab785 UR - http://dx.doi.org/10.1007/s00607-013-0333-1 IS - 3 A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Bui, The Duy Y1 - 2013/06// PB - Springer JF - Computing Springer VL - 96 TI - A Technique for Extracting Behavioral Sequence Patterns from GPS Recorded Data SP - 163 AV - none EP - 188 ER - TY - CONF ID - SisLab2124 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2124/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Bui, The Duy Y1 - 2012/08// TI - Trajectory Classification Using Spatiotemporal Sequence AV - none M2 - Mongolia T2 - the ACM 5th International Conference FITAT ER - TY - CONF ID - SisLab1425 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1425/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Le, Thanh Ha Y1 - 2014/// TI - Forecasting Moving Object Position based on Temporal Patterns AV - none M2 - Busan, Korea T2 - 2014: International Conference on Indoor Positioning and Indoor Navigation (IPIN 2014) ER - TY - CONF ID - SisLab2131 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2131/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Le, Thanh Ha A1 - Bui, The Duy Y1 - 2011/05// TI - Location-based Information Disseminating System with Integration of Various Georeferenced Data AV - none M2 - Korea T2 - ACM 4th International Conference FITAT/DBMI 2011 ER - TY - CONF ID - SisLab2977 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2977/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Namsrai, Oyun-Erdene Y1 - 2018/// TI - An Approach to Cab-sharing Service Development AV - none T2 - International Conference on Frontiers of Information Technology, Applications and Tools ER - TY - CONF ID - SisLab2065 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2065/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Oyun-Erdene, Namsrai Y1 - 2016/04/02/ N2 - In modern society, most seniors prolong their independence. To guarantee the safety of them when living on their own, we need to monitor their activities all the time and react to critical situations. The rapid advances in wireless networks, wearable sensors, and communications technologies pave the way for the advent of homecare service systems. Activity recognition is a crucial task in building such systems. This paper investigates two clustering methods, kmeans and Self-organizing map (SOM) for recognizing human daily activities. An experiment is performed on a real data set. The results show that k-means performs pretty well in classifying two activities; however the accuracy is pretty low when the data set is scaled up to five activities. SOM outperforms k-means in most cases of data sets. On average, the resulting accuracy of SOM is 87% and of k-means is 54% for five activities. As a result, SOM is most suitable to be integrated in systems for providing remote homecare services. TI - Activity Recognition based on Clustering Methods for Senior Homecare Services M2 - Zhuhai, China AV - none T2 - The 9th International Conference on Frontiers of Information Technology, Applications and Tools ER - TY - CONF ID - SisLab2129 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2129/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Vu, Quang Hiep A1 - Bui, The Duy Y1 - 2011/12// TI - Mining Constraint-Based Patterns in Moving Object Database AV - none M2 - Korea T2 - 6th International Conference on Computer Sciences and Convergence Information Technology, IEEE ER - TY - CONF ID - SisLab2126 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2126/ A1 - Vu, Thi Hong Nhan A1 - Lee, Yang Koo A1 - Vu, Quang Hiep A1 - Bui, The Duy Y1 - 2012/04// TI - A user context recognition for ubiquitous computing systems AV - none M2 - Korea T2 - ICCM ER - TY - CONF ID - SisLab2691 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2691/ A1 - Vu, Thi Hong Nhan A1 - Namsrai, Oyun-Erdene A1 - Lee, Yang Koo Y1 - 2017/08// TI - A design of ridesharing recommendation system AV - none T2 - The 10th International Conference on the Frontiers of Information Technology, Applications and Tools ER - TY - CONF ID - SisLab2693 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2693/ A1 - Vu, Thi Hong Nhan A1 - Nguyen, Chi Thuc A1 - Lee, Yang Koo A1 - Namsrai, Oyun-Erdene Y1 - 2017/08// TI - Discovery of frequent routes for ridesharing services AV - none T2 - International conference on information information, system, and convergence applications ER - TY - CONF ID - SisLab2134 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2134/ A1 - Vu, Thi Hong Nhan A1 - Park, Namkyu Y1 - 2010/07// TI - Heart Rate Variability Pattern Recognition in Ambulatory Environments AV - none M2 - Japan T2 - IEEE 40th International Conference on Computers & Industrial Engineering, Soft Computing Techniques for Advanced Manufacturing and Service Systems ER - TY - CONF ID - SisLab2137 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2137/ A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2007/// TI - An Approach to Mining Frequent Movement Patterns in Traffic Data AV - none M2 - Malaysia T2 - 6th Asia Pacific International Symposium on Information Technology ER - TY - CONF ID - SisLab2138 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2138/ A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2006/// TI - An Approach to Mining Mobility Association Rules AV - none M2 - Korea T2 - Asian Symposium on Geographic Information System ER - TY - CONF ID - SisLab2139 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2139/ A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2006/// TI - Estimating Object Location in Location-based Services AV - none M2 - Korea T2 - Korea Spatial Information System Society ER - TY - CONF ID - SisLab2141 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2141/ A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho Y1 - 2006/// TI - Future Location prediction of Moving Objects Based on Movement Rules AV - none M2 - China T2 - International Conference on Intelligent Computing, LNCS ER - TY - JOUR ID - SisLab2117 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2117/ A1 - Vu, Thi Hong Nhan A1 - Ryu, Keun Ho A1 - Park, Namkyu Y1 - 2009/08// JF - Journal of Computer & Industrial Engineering TI - A Method for Predicting Location of Mobile User for Location-based Services System AV - none ER - TY - INPR ID - SisLab3508 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3508/ A1 - Vu, Thi Ngoc Anh A1 - Nguyen, Trong Dong A1 - Nguyen, Vu Hoang Vuong A1 - Dang, Thanh Hai A1 - Do, Duc Dong Y1 - 2019/// PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering SN - 0866-8612 TI - Adaptive Large Neighborhood Search Enhances Global Protein-Protein Network Alignment AV - none ER - TY - CONF ID - SisLab2706 UR - http://ieeexplore.ieee.org/document/8108031/ A1 - Vu, Thi Ngoc Anh A1 - Nguyen, Vu Hoang Vuong A1 - Dang, Thanh Hai A1 - Do, Duc Dong Y1 - 2017/11/25/ N2 - Biological molecules (e.g. DNAs, RNs, proteins, etc.) do not function in isolation themselves but in a sophisticated manner of various interactions between them to carry out every biological processes in living cells. Data about these interactions are exponentially increased thanks to advanced technologies. Analyzing biological interaction networks is essential to get insights into how biological system works. Among analytics tasks querying a small network of interest against a well studied large-scale one is regarded as one of the most essential task and is proven to be a NP-complete problem. This paper presents an efficient biological network querying method called APP-RB, which is an improvement of the state-of-the-art biological network queyring method APPAGATO introduced in 2016 by taking advantages of FASTAn, an PPI alignment algorithm. Experimental results showed that our algorithm performed much better than the original APPAGATO. With these results, we hope that our proposed method APP-RB will be helpful to biologists and those who are interested in network comparison problems. TI - APP-RB: An efficient method for biological network querying based on rebuild procedure SP - 13 M2 - Hanoi, Vietnam AV - none EP - 18 T2 - 2017 4th NAFOSTED Conference on Information and Computer Science (NICS 2017) ER - TY - CONF ID - SisLab1309 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1309/ A1 - Vu, Trong Hoa A1 - Neubig, Graham A1 - Sakti, Sakriani A1 - Toda, Tomoki A1 - Nakamura, Satoshi Y1 - 2014/// TI - Acquiring a Dictionary of Emotion-Provoking Event SP - 128 M2 - Gothenburg, Sweden AV - none EP - 132 T2 - 2014: the 14th Conference of the European Chapter of the Association for Computational Linguistics ER - TY - CONF ID - SisLab3265 UR - http://kse-conf.org/ A1 - Vu, Trung Kien A1 - Tran, Quoc Long Y1 - 2018/11/01/ N2 - Current deep learning methods and technologies have reached the level of deployment in softwares and hardwares for real-life applications. However, recent studies have shown deep learning architectures are highly vulnerable to attacks and exploitation via input perturbations. In this works, we investigate the effects of these attacks on the outputs of each layer of deep architectures and on theirs performance in term of classi?cation accuracy measures. The results show that without defense mechanism, even simple attacks devastated deep architectures? outputs in every layer and theirs classi?cation performance. We then propose multiple defense mechanisms in order to protect deep architectures and to make them more robust to input perturbation attacks. TI - Robust Loss Functions: Defense Mechanisms for Deep Architectures SP - 164 M2 - Ho Chi Minh City, Vietnam AV - public EP - 168 T2 - 2018 10th International Conference on Knowledge and Systems Engineering (KSE 2018) ER - TY - RPRT ID - SisLab3194 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3194/ A1 - Vu, Van Phong A1 - Nguyen, Huy Tuyen A1 - Nguyen, Manh Hung A1 - Nguyen, Ha Thanh Y1 - 2018/// N2 - Human are trying to create intelligent systems, the creation of systems that can win intellectual games are problems researched for a long time. With the goal of building a system that is capable of answering the questions of "Who want to be a millionaire", we find that the main challenge of the system is how to build the knowledge source as well as the use of its data to serve for making the most accurate decision in the game. In this article, we focus on proposing an architecture, a method to build a part of the system having question answering function of the "Who want to be a millionaire" program by exploring the source of knowledge from Wikipedia, besides, we install and test the method based on that architecture and evaluate the results obtained. PB - University of Engineering and Technology, VNU M1 - technical_report TI - A virtual player for Vietnamese version of "Who Want to Be a Millionaire" AV - none ER - TY - CONF ID - SisLab1194 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1194/ A1 - Vu, Van Phuc A1 - Pham, Van Huong A1 - Nguyen, Ngoc-Binh Y1 - 2014/// TI - T?i ?u ?i?n n?ng tiêu th? c?a h? th?ng nhúng d?a trên k? ngh? ng??c và tái c?u hình CPU AV - none M2 - Th?a Thiên Hu?, Vi?t Nam T2 - 2014: H?i ngh? qu?c gia l?n th? VII v? Nghiên c?u c? b?n và ?ng d?ng Công ngh? thông tin (FAIR 2014) ER - TY - CONF ID - SisLab4260 UR - https://doi.org/10.1145/3394171.3414047 A1 - Vu, Xuan Son A1 - Le, Duc Trong A1 - Edlund, Christoffer A1 - Jiang, Lili A1 - Nguyen, Hoang D. Y1 - 2020/10// N2 - With the rapid growth of Internet media, content tagging has become an important topic with many multimedia understanding applications, including efficient organisation and search. Nevertheless, existing visual tagging approaches are susceptible to inherent privacy risks in which private information may be exposed unintentionally. The use of anonymisation and privacy-protection methods is desirable, but with the expense of task performance.Therefore, this paper proposes an end-to-end framework (SGTN) using Graph Transformer and Convolutional Networks to significantly improve classification and privacy preservation of visual data. Especially, we employ several mechanisms such as differential privacy based graph construction and noise-induced graph transformation to protect the privacy of knowledge graphs. Our approach unveils new state-of-the-art on MS-COCO dataset in various semisupervised settings. In addition, we showcase a real experiment in the education domain to address the automation of sensitive document tagging. Experimental results show that our approach achieves an excellent balance of model accuracy and privacy preservation on both public and private datasets. Codes are available at https://github.com/ReML-AI/sgtn. TI - Privacy-Preserving Visual Content Tagging using Graph Transformer Networks AV - public T2 - The 28th ACM International Conference on Multimedia ER - TY - CONF ID - SisLab3967 UR - https://www.aclweb.org/anthology/2020.coling-main.37/ A1 - Vu, Xuan Son A1 - Nguyen, Thanh Son A1 - Le, Duc Trong A1 - Jiang, Lili Y1 - 2020/12// N2 - Users express their opinions towards entities (e.g., restaurants) via online reviews which can bein diverse forms such as text, ratings, and images. Modeling reviews are advantageous for userbehavior understanding which, in turn, supports various user-oriented tasks such as recommen-dation, sentiment analysis, and review generation. In this paper, we propose MG-PriFair, a multi-modal neural-based framework, which generates personalized reviews with privacy and fairnessawareness. Motivated by the fact that reviews might contain personal information and sentimentbias, we propose a novel differentially private (dp)-embedding model for training privacy guar-anteed embeddings and an evaluation approach for sentiment fairness in the food-review domain.Experiments on our novel review dataset show that MG-PriFair is capable of generating plausiblylong reviews while controlling the amount of exploited user data and using the least sentiment-biased word embeddings. To the best of our knowledge, we are the first to bring user privacy andsentiment fairness into the review generation task. The dataset and source codes are available athttps://github.com/ReML-AI/MG-PriFair. TI - Multimodal Review Generation with Privacy and Fairness Awareness SP - 414 AV - public EP - 425 T2 - Proceedings of the 28th International Conference on Computational Linguistics ER - TY - CONF ID - SisLab442 UR - http://dx.doi.org/10.1007/978-3-319-11680-8_19 A1 - Vu, Xuan Son A1 - Vu, Thanh A1 - Nguyen, Huong A1 - Ha, Quang Thuy Y1 - 2014/10/09/ TI - Improving Text-Based Image Search with Textual and Visual Features Combination SP - 233 M2 - Hanoi, Vietnam AV - none EP - 245 T2 - The 6th International Conference on Knowledge and Systems Engineering (KSE 2014) ER - TY - CONF ID - SisLab1741 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1741/ A1 - Vu, Xuan Tung A1 - Hoang, Truong Y1 - 2015/// N2 - This paper presents an improved type system to estimate an upper bound for the resource consumption of programs with nested and multi-threaded transactions. This work improves our previous type system to which in comparison the new one is more precise. In addition, the soundness of the system is sketched by the help of rewriting techniques. TI - An Improved Type System for Counting Logs of Transactional Multi-threaded Programs M2 - Beijing, China AV - none T2 - PAS: the 4th International Seminar on Program Verification, Automated Debugging and Symbolic Computation ER - TY - CONF CY - New York, NY, USA ID - SisLab2153 UR - http://dx.doi.org/10.1007/978-3-319-40229-1_16 A1 - Vu, Xuan Tung A1 - To, Van Khanh A1 - Ogawa, Mizuhito Y1 - 2016/// PB - Springer-Verlag New York, Inc. TI - raSAT: An SMT Solver for Polynomial Constraints SP - 228 AV - none EP - 237 T2 - The 8th International Joint Conference on Automated Reasoning ER - TY - INPR ID - SisLab2892 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2892/ A1 - Vu Thi Ngoc, Anh A1 - Thai Dinh, Phuc A1 - Nguyen, Hoang Duc A1 - Dang, Thanh Hai A1 - Do Duc, Dong Y1 - 2017/// N2 - Reconstruction of founder (ancestor) genes for a given population is an important problem in evolutionary biology. It involves finding a set of genes that can combine together to form genes of all individuals in that population. Such reconstruction can be modeled as a combinatorial optimization problem, in which we have to find a set of founder (gene) sequences so that the individuals in a given population can be generated by the smallest number of recombination on these founder sequences. In this paper we propose a novel ant colony optimization algorithm (ACO) based method, equipped with some important improvements, for the founder gene sequence reconstruction problem. The proposed method yields excellent performance when validating on 108 test sets from three benchmark datasets. Comparing with the best by far method for founder sequence reconstruction, our proposed method performs better in 45 test sets, equally well in 44 and worse only in 19 sets. These experimental results demonstrate the efficacy and perspective of our proposed method. PB - VNU Journal of Science JF - VNU Journal of Computer Science and Communication Engineering SN - 0866-8612 TI - Ant colony optimization based founder sequence reconstruction AV - none ER - TY - UNPB ID - SisLab3739 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3739/ A1 - Vuong, Thi Hai Yen Y1 - 2019/// PB - VNU-UET TI - Formal Specification and Model Checking of Some Variants of Anderson Mutual Exclusion Protocol M1 - technical_report AV - restricted ER - TY - CONF ID - SisLab3663 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3663/ A1 - Vuong, Thi Hai Yen A1 - Nguyen, Thi Thu Trang A1 - Tran, Nhu Thuat A1 - Nguyen, Le Minh A1 - Phan, Xuan Hieu Y1 - 2019/10/24/ N2 - In the field of data management, users traditionally manipulates their data using structured query language (SQL). However, this method requires an understanding of relational database, data schema, and SQL syntax as well as the way it works. Database manipulation using natural language, therefore, is much more convenient since any normal user can interact with their data without a background of database and SQL. This is, however, really tough because transforming natural language commands into SQL queries is a challenging task in natural language processing and understanding. In this paper, we propose a novel two?phase approach to automatically analyzing and converting natural language queries into the corresponding SQL forms. In our approach, the first phase is component segmenta- tion which identifies primary clauses in SQL such as SELECT, FROM, WHERE, ORDER BY, etc. The second phase is slot? filling that helps extract sub?components for each primary clause such as SELECT column(s), SELECT aggregation operation, etc. We carefully conducted an empirical evaluation for our method using conditional random fields (CRFs) on a medium? sized corpus of natural language queries in Vietnamese, and have achieved promising results with an average accuracy of more than 90%. TI - Learning to Transform Vietnamese Natural Language Queries into SQL Commands M2 - Da Nang, Vietnam AV - none T2 - The 11th International Conference on Knowledge and Systems Engineering (KSE 2019) ER - TY - CONF ID - SisLab1494 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1494/ A1 - Vuong, Thi Hai Yen A1 - Nguyen, Van Hop A1 - Duong, Quang Vu A1 - Phi, Thi Thu A1 - Nguyen, Thac Thong A1 - Truong, Quoc Tuan A1 - Phan, Xuan Hieu Y1 - 2016/04/29/ TI - On the design and development of a mobile virtual assistant for Vietnamese (VAV) AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - CONF ID - SisLab1500 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1500/ A1 - Vuong, Thi Hong A1 - Nguyen, Minh Duc A1 - Nguyen, Thi Cam Van A1 - Tran, Mai Vu Y1 - 2016/04/29/ TI - H? th?ng t? v?n xã h?i d?a trên phân tích ý ??nh và hành vi ng??i s? d?ng AV - public M2 - Hanoi T2 - SSC: the 2016 Student Scientific Contest ER - TY - INPR ID - SisLab4290 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4290/ A1 - Vuong, Thi Hong A1 - Nguyen, Thi Cam Van A1 - Ha, Quang Thuy N2 - Distributed Denial of Service (DDoS) attack is a menace to network security that aims at exhausting the target networks with malicious traffic. With simple but powerful attack mechanisms, it introduces an immense threat to the current Internet community. In this paper, we propose a novel multi-tier architecture intrusion detection model based on a machine learning method that possibly detects DDoS attacks. We evaluate our model using the newly released dataset CICDDoS2019, which contains a comprehensive variety of DDoS attacks and address the gaps of the existing current datasets. Experimental results indicated that the proposed method is more efficient than other existing ones. The experiments demonstrated that the proposed model accurately recognize DDoS attacks outperforming the state-of-the-art by F1-score. JF - Asian Conference on Intelligent Information and Database Systems VL - 13 TI - N-tier machine learning-based architecture for DDoS attack detection AV - public ER - TY - CONF ID - SisLab2961 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2961/ A1 - Vuong, Thi Hong A1 - Pham, Thanh Huyen A1 - Nguyen, Tri Thanh A1 - Ha, Quang Thuy Y1 - 2019/// N2 - An Adversarial Learning and Canonical Correlation Analysis based Cross-Modal Retrieval Model PB - Springer TI - An Adversarial Learning and Canonical Correlation Analysis based Cross-Modal Retrieval Model M2 - Yogyakarta, Indonesia AV - public T2 - 11th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2019) ER - TY - CONF ID - SisLab2521 UR - http://doi.org/10.1109/KSE.2016.7758064 A1 - Vuong, Thi Hong A1 - Tran, Van Hien A1 - Nguyen, Minh Duc A1 - Nguyen, Thi Cam Van A1 - Pham, Thanh Huyen A1 - Tran, Mai Vu Y1 - 2016/// N2 - Web-based social system enables new community-based opportunities for participants to engage, share and interact. The rapid growth of Facebook has triggered a dramatic increase in spam volume and sophistication. Spammers post their status or comment in Page to send spam content to their friends or other users in the network. In this paper, we consider the problem of detecting spam accounts on Facebook based on comment content and user social behavior. We will propose a hybrid approach using Maximum Entropy (Maxent) model for classifying user comments as either spam or non-spam. We carefully conducted an empirical evaluation for our model on a large collection of comments in Vietnamese Facebook Pages and achieved promising results with an average accuracy of more than 90%. TI - Social-spam profile detection based on content classification and user behavior SP - 264 AV - public EP - 267 T2 - Knowledge and Systems Engineering (KSE) ER - TY - JOUR ID - SisLab2546 UR - https://js.vnu.edu.vn/ER/article/view/4063 IS - 1 A1 - Vuong, Thi Phuong Thao A1 - Phan, Xuan Hieu Y1 - 2017/// N2 - Theo ti?p c?n ?a chi?u v? ??m b?o ch?t l??ng giáo d?c, bài báo này kh?o sát, ?ánh giá công tác qu?n lý ?ào t?o ??i h?c ? ??i h?c Qu?c gia Hà N?i m?t cách toàn di?n (?a tham s?) và khách quan (?a ph??ng pháp, ?a ngu?n). Trong ?ó, ?ánh giá c?a cán b? ???c th?c hi?n qua 8 nhân t? v?i 48 tiêu chí bao g?m: m?c tiêu và k? ho?ch ?ào t?o; qu?n lý ch??ng trình ?ào t?o; tuy?n sinh; t? ch?c th?c hi?n ?ào t?o; qu?n lý ho?t ??ng gi?ng d?y c?a gi?ng viên; qu?n lý ho?t ??ng h?c t?p c?a sinh viên; qu?n lý ??i ng? cán b? qu?n lý, nhân viên h? tr? ho?t ??ng ?ào t?o; qu?n lý môi tr??ng h?c t?p, c? s? v?t ch?t và trang thi?t b?. ?ánh giá c?a sinh viên ???c th? hi?n qua 4 nhân t?: n?i dung ch??ng trình ?ào t?o; ho?t ??ng gi?ng d?y; ho?t ??ng ?ào t?o; môi tr??ng, c? s? v?t ch?t, thi?t b? ph?c v? gi?ng d?y và h?c t?p. Các k?t qu? nghiên c?u ?ã ???c c?ng c?, kh?ng ??nh qua so sánh v?i k?t qu? ?ánh giá ki?m ??nh ?i?u ki?n ??m b?o ch?t l??ng c?a các chuyên gia m?ng l??i các ??i h?c ASEAN. Tám khuy?n ngh? ???c ??a ra ?? t?ng c??ng ?i?u ki?n ??m b?o ch?t l??ng ?ào t?o. JF - VNU Journal of Science: Education Research VL - 33 TI - Ti?p c?n ?a chi?u v? qu?n lý ho?t ??ng ?ào t?o ? ??i h?c Qu?c gia Hà N?i SP - 10 AV - none EP - 22 ER - TY - JOUR ID - SisLab3289 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3289/ A1 - Vuong, Tung Long A1 - Le, Dinh Minh A1 - Hoang, Van Xiem A1 - Dinh, Trieu Duong A1 - Vu, Huu Tien A1 - Le, Thanh Ha Y1 - 2018/// PB - The Institution of Engineering and Technology JF - IET Image Processing SN - 1751-9659 TI - View Synthesis Method for 3D Video Coding Based on Temporal and Inter View AV - none ER - TY - CONF ID - SisLab2034 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2034/ A1 - Vuong, Tung Long A1 - Le, Dinh Minh A1 - Le, Thi Thuy A1 - Le, Thanh Ha Y1 - 2016/// TI - Pre-rendered subtitles removal in video sequences using text detection and inpainting AV - none M2 - Danang, Vietnam T2 - The 2016 International Conference on Electronics, Information and Communication (ICEIC) ER - TY - CONF ID - SisLab3742 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3742/ A1 - Vuong, Tung Long A1 - Nguyen, Do Van A1 - Nguyen, Tai Long A1 - Bui, Cong Minh A1 - Kieu, Hai Dang A1 - Ta, Viet Cuong A1 - Tran, Quoc Long A1 - Le, Thanh Ha Y1 - 2019/08/10/ TI - Sharing Experience in Multitask Reinforcement Learning AV - none T2 - Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence ER - TY - CONF ID - SisLab4484 UR - https://link.springer.com/chapter/10.1007%2F978-3-030-73280-6_30 A1 - V??ng, Th? H?ng A1 - Nguyen, Thi Cam Van A1 - Ha, Quang Thuy Y1 - 2021/04/07/ N2 - Distributed Denial of Service (DDoS) attack is a menace to network security that aims at exhausting the target networks with malicious traffic. With simple but powerful attack mechanisms, it introduces an immense threat to the current Internet community. In this paper, we propose a novel multi-tier architecture intrusion detection model based on a machine learning method that possibly detects DDoS attacks. We evaluate our model using the newly released dataset CICDDoS2019, which contains a comprehensive variety of DDoS attacks and address the gaps of the existing current datasets. Experimental results indicated that the proposed method is more efficient than other existing ones. The experiments demonstrated that the proposed model accurately recognize DDoS attacks outperforming the state-of-the-art by F1-score. PB - Springer TI - N-Tier Machine Learning-Based Architecture for DDoS Attack Detection SP - 375 AV - none EP - 385 ER - TY - CONF ID - SisLab1602 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1602/ A1 - Xiao, Han A1 - Reda, Elbarougy A1 - Masato, Akagi A1 - Junfeng, Li A1 - Ngo, Thi Duyen Y1 - 2015/// N2 - Human beings can judge emotional states of a voice only by listening, no matter thay understand the language or not. Investigating the commonalities and differences of emotional states perception among multiple languages is important to understand how human beings perceive emotional states among multiple languages, and to build a human perceptionmodel independent to used languages. This paper investigates commonalities and differences among multiple languages in human perception of emotional states based on a dimensional approach. The results suggest that human beings can perceive emotional states regardless of languages. Moreover, the results can be used to build a human perceptionmodel regardless of languages only by control the deviations between neutral voices and other emotional states. TI - A study on perception of emotional states in multiple languages on Valence-Activation approach SP - 86 AV - none EP - 89 T2 - The 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing ER - TY - JOUR ID - SisLab1183 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1183/ IS - 7 A1 - Zang, Xiaoling A1 - Christina M., Jones A1 - Tran, Quoc Long A1 - Maria, Eugenia Monge A1 - Zhou, Manshui A1 - Walker L., DeEtte A1 - Roman, Mezencev A1 - Alexander, Gray A1 - John F., McDonald A1 - Facundo M., Ferna?ndez Y1 - 2014/06/25/ JF - Journal of Proteome Research VL - 13 SN - doi: 10.1021/pr500409q TI - Feasibility of Detecting Prostate Cancer by Ultraperformance Liquid Chromatography-Mass Spectrometry Serum Metabolomics SP - 3444 AV - none EP - 3457 ER - TY - JOUR ID - SisLab3271 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3271/ IS - 7 A1 - Zang, Xiaoling A1 - Jones, Christina M A1 - Tran, Quoc Long A1 - Monge, Maria Eugenia A1 - Zhou, Manshui A1 - Walker, L DeEtte A1 - Mezencev, Roman A1 - Gray, Alexander A1 - McDonald, John F A1 - Fernandez, Facundo M Y1 - 2014/// PB - ACS Publications JF - Journal of proteome research VL - 13 TI - Feasibility of detecting prostate cancer by ultraperformance liquid chromatography--mass spectrometry serum metabolomics SP - 3444 AV - none EP - 3454 ER - TY - CONF ID - SisLab2300 UR - http://doi.org/10.1109/WAINA.2008.137 A1 - Zhang, Zhiwei A1 - Phan, Xuan Hieu A1 - Horiguchi, Susumu Y1 - 2008/03/25/ TI - An Efficient Feature Selection Using Hidden Topic in Text Categorization SP - 1223 M2 - Okinawa, Japan AV - none EP - 1228 T2 - The 2008 IEEE Symposium on Mining and Web, The 22nd International Conference on Advanced Information Networking and Applications (IEEE AINA) ER - TY - JOUR ID - SisLab4437 UR - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4437/ A1 - Zhu, Qiuchen A1 - Dinh, Tran Hiep A1 - Phung, Manh Duong A1 - Quang, Ha Y1 - 2021/04/21/ N2 - Drone imagery is increasingly used in automated inspection for infrastructure surface defects, especially in hazardous or unreachable environments. In machine vision, the key to crack detection rests with robust and accurate algorithms for image processing. To this end, this paper proposes a deep learning approach using hierarchical convolutional neural networks with feature preservation (HCNNFP) and an intercontrast iterative thresholding algorithm for image binarization. First, a set of branch networks is proposed, wherein the output of previous convolutional blocks is half-sizedly concatenated to the current ones to reduce the obscuration in the down-sampling stage taking into account the overall information loss. Next, to extract the feature map generated from the enhanced HCNN, a binary contrast-based autotuned thresholding (CBAT) approach is developed at the post-processing step, where patterns of interest are clustered within the probability map of the identified features. The proposed technique is then applied to identify surface cracks on the surface of roads, bridges or pavements. An extensive comparison with existing techniques is conducted on various datasets and subject to a number of evaluation criteria including the average F-measure (AF?) introduced here for dynamic quantification of the performance. Experiments on crack images, including those captured by unmanned aerial vehicles inspecting a monorail bridge. The proposed technique outperforms the existing methods on various tested datasets especially for GAPs dataset with an increase of about 1.4% in terms of AF? while the mean percentage error drops by 2.2%. Such performance demonstrates the merits of the proposed HCNNFP architecture for surface defect inspection. PB - IEEE JF - IEEE Access SN - 2169-3536 TI - Hierarchical Convolutional Neural Network with Feature Preservation and Autotuned Thresholding for Crack Detection AV - public ER -