VNU-UET Repository: No conditions. Results ordered -Date Deposited. 2024-03-28T23:24:02ZEPrintshttp://eprints.uet.vnu.edu.vn/images/sitelogo.pnghttps://eprints.uet.vnu.edu.vn/eprints/2019-12-11T08:45:34Z2019-12-11T08:45:34Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3821This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/38212019-12-11T08:45:34ZA Regional Food's Features Extraction Algorithm and Its ApplicationAutomatically 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.Duc Trung NguyenDiep Thi Ngoc Nguyenngocdiep@vnu.edu.vnYasushi Kiyoki2019-12-11T08:45:25Z2019-12-11T08:45:25Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3820This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/38202019-12-11T08:45:25ZWEE: A Mashup System Using Social Networks For Collaborative Environmental Monitoring Education With Spatiotemporal Analysis And VisualizationThe 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.Diep Thi Ngoc Nguyenngocdiep@vnu.edu.vnShiori SasakiSasushi Kiyoki2019-12-11T08:45:11Z2019-12-11T08:45:11Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3819This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/38192019-12-11T08:45:11ZAn imagination-based query creation method for image retrievalOur 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.Diep Thi Ngoc Nguyenngocdiep@vnu.edu.vnYasushi Kiyoki2018-12-17T02:47:27Z2018-12-17T02:47:27Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3272This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/32722018-12-17T02:47:27ZStochastic alternating direction method of multipliersHua OuyangNiao HeQuoc Long Trantqlong@vnu.edu.vnAlexander Gray2016-12-29T08:28:53Z2016-12-29T08:28:53Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2374This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/23742016-12-29T08:28:53ZPower Save Protocol Using Chain Based RoutingSensor 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.Thanh Tung Nguyentungnt@isvnu.vnVan Duc Nguyenducnv-fet@mail.hut.edu.vnHai Thanh Nguyenthanh@isvnu.vnCong Vinh Phanpcvinh@ntt.edu.vnDai Tho Nguyennguyendaitho@vnu.edu.vn2016-12-29T08:28:33Z2016-12-29T08:28:33Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2368This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/23682016-12-29T08:28:33ZImprovements to a Protocol for the Maintenance of Common Data in Distributed SystemsIn 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.Dai Tho Nguyennguyendaitho@vnu.edu.vnThuan Hohothuan@vast.ac.vnDinh Thanh Lethanhld@vnu.edu.vn2016-12-28T09:45:57Z2016-12-28T14:51:15Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2251This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/22512016-12-28T09:45:57ZToward an approach to improving the consolidation stage of fingerprint matchingConsolidation 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.Hong Hai LeNgoc Hoa Nguyenhoa.nguyen@vnu.edu.vn2016-12-27T07:22:25Z2016-12-27T07:22:25Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2123This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/21232016-12-27T07:22:25ZPredicting the intended wildlife movement in the Wireless Sensor NetworksQuang Hiep VuThi Hong Nhan Vuvthnhan@vnu.edu.vnYonggil Kim2016-12-27T07:21:59Z2016-12-27T07:21:59Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2122This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/21222016-12-27T07:21:59ZAn Android-based Intelligent Tourism Recommendation SystemThi Hong Nhan Vuvthnhan@vnu.edu.vn2016-12-27T07:21:20Z2016-12-27T07:21:20Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2121This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/21212016-12-27T07:21:20ZA novel clustering method for animal trajectory analysis using Wireless Sensor NetworkQuang Hiep VuMeijing LiThi Hong Nhan Vuvthnhan@vnu.edu.vnKeun Ho Ryu2016-12-23T06:37:04Z2016-12-23T06:37:04Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2281This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/22812016-12-23T06:37:04ZImprovement for Rate-Based Protocols in Multihop Wireless NetworksTransport 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.Le Minh Duongminhdl@vnu.edu.vnL. Zitounel.zitoune@esiee.frVeronique Vequeveronique.veque@u-psud.fr2016-12-03T07:17:50Z2016-12-03T07:17:50Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1931This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/19312016-12-03T07:17:50ZTrademark image retrieval based on scale, rotation, translation invariant featuresTien Dung NguyenHuu Hiep Hai NguyenThanh Ha Leltha@vnu.edu.vn2016-11-14T02:39:11Z2016-11-14T02:39:11Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1889This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/18892016-11-14T02:39:11ZA feature-word-topic model for image annotation and retrievalImage 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.Cam Tu NguyenNatsuda KaothanthongTakeshi TokuyamaXuan Hieu Phanhieupx@vnu.edu.vn2016-11-14T02:37:03Z2016-11-14T02:37:03Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1886This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/18862016-11-14T02:37:03ZOn the effect of the label bias problem in part-of-speech taggingThis 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.Hong Phuong Lephuonglh@vnu.edu.vnXuan Hieu Phanhieupx@vnu.edu.vnThe Trung Trantrung@fpt.edu.vn2016-09-03T06:24:08Z2016-09-03T06:24:08Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1861This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/18612016-09-03T06:24:08ZSupport Measures to Estimate the Reliability of Evolutionary Events Predicted by Reconciliation MethodsThe 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.Thi Hau Nguyennguyenhau@vnu.edu.vnVincent BerryVincent RanwezCeline Scornavacca2016-09-03T03:01:29Z2016-09-03T03:01:29Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1859This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/18592016-09-03T03:01:29ZReconciliation and local gene tree rearrangement can be of mutual profitReconciliation 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/.Thi Hau NguyenVincent RanwezStéphanie PointetAnne-Muriel ChifolleauJean-Philippe DoyonVincent Berry2016-05-24T01:31:11Z2016-05-24T01:32:16Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/1595This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/15952016-05-24T01:31:11ZA runtime approach for estimating resource usageIn 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.Phi Diep BuiTrong Khanh NguyenViet Ha Nguyenhanv@vnu.edu.vn2015-12-14T03:03:05Z2015-12-14T03:08:06Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/851This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/8512015-12-14T03:03:05ZA Multiple Instance Learning Approach to Image Annotation with Saliency MapPhuong Nhung TranCam Tu NguyenJinhee ChunVu Ha Lehalv@vnu.edu.vnTakeshi Tokuyama2015-11-03T14:41:11Z2015-11-03T14:43:27Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/791This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7912015-11-03T14:41:11ZContour Based Hand Gesture Recognition Using Depth DataNguyen Le TranThanh Cong DoBa Tung NguyenViet Cuong TaThanh Ha Leltha@vnu.edu.vn2015-11-03T11:25:17Z2015-11-03T11:25:48Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/790This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7902015-11-03T11:25:17ZTrademark Image Retieval Based on Scale, Rotation, Translation Invariant FeaturesTien Dung NguyenHuu Hiep Hai NguyenThanh Ha Leltha@vnu.edu.vn2015-11-03T11:24:24Z2015-11-03T11:25:09Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/789This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7892015-11-03T11:24:24ZIlumination-Adaptive Color Reproduction Method for Daylight ConditionThanh Ha Leltha@vnu.edu.vnJae-Young ChoHyun-Ji KimSung-Jea Ko2015-11-03T11:23:05Z2015-11-03T11:23:58Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/788This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7882015-11-03T11:23:05ZParticulate Matter Concentration Estimation from Satellite Aerosol and Meteorological Parametters: Data-Driven AproachesThi Nhat Thanh Nguyenthanhntn@vnu.edu.vnViet Cuong TaThanh Ha Leltha@vnu.edu.vnSimone Mantovani2015-11-03T11:19:55Z2015-11-03T11:20:43Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/787This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7872015-11-03T11:19:55ZText Recognition Method for Trademark ImagesNgoc Tuan NguyenThi Nhat Thanh Nguyenthanhntn@vnu.edu.vnThanh Ha Leltha@vnu.edu.vn2015-11-03T11:18:17Z2015-11-03T11:19:46Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/786This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7862015-11-03T11:18:17ZBurned Area Detection After Wildfire Using Landsat 7 ETM+ SLC-off ImagesQuoc Khanh LeSy Tan NguyenThi Nhat Thanh Nguyenthanhntn@vnu.edu.vnThanh Ha Leltha@vnu.edu.vn2015-11-03T11:16:48Z2015-11-03T11:17:59Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/785This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7852015-11-03T11:16:48ZA Technique for Extracting Behavioral Sequence Patterns from GPS Recorded DataThi Hong Nhan VuYang Koo LeeThe Duy Buiduybt@vnu.edu.vn2015-11-03T11:14:40Z2015-11-03T11:16:30Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/782This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7822015-11-03T11:14:40ZMore Efficient Path Optimization for Greedy Geographic Routing in Wireless Sensor NetworksDinh Thanh Lethanhld@vnu.edu.vn2015-11-03T10:34:38Z2015-11-03T11:14:02Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/781This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7812015-11-03T10:34:38ZĐ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ướcTruc Mai Tranmai.tran@vnu.edu.vnLe Minh Duongminhdl@vnu.edu.vn2015-11-03T10:23:20Z2015-11-03T10:24:21Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/779This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7792015-11-03T10:23:20ZCả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ướcTruc Mai Tranmai.tran@vnu.edu.vnLe Minh Duongminhdl@vnu.edu.vn2015-11-03T10:22:31Z2015-11-03T10:23:10Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/778This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7782015-11-03T10:22:31ZBuilding High-Accuracy Thermal Simulation for Evaluation of Thermal Comfort in Real HousesHoai Son Nguyensonnh@vnu.edu.vnYoshiki MakinoAzman Osman LimYasuo TanYoichi Shinoda2015-08-31T07:45:11Z2015-08-31T07:45:11Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/777This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7772015-08-31T07:45:11ZD-AVTree: A DHT-based Search System Supporting Scalable Multi-Attribute QueryHoai-Son Nguyensonnh@vnu.edu.vnYasuo Tan2015-08-28T10:05:04Z2015-08-28T10:05:04Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/776This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7762015-08-28T10:05:04ZBAM-Chord: DHT-based Bandwidth Adaptive Multicast SystemHoai-Son Nguyensonnh@vnu.edu.vnNgoc Anh NguyenThi Huong Lan Bui2015-07-29T09:55:57Z2015-07-29T09:55:57Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/774This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7742015-07-29T09:55:57ZApproximation Scheme for Real-Time Tasks under Fixed-Priority Scheduling with Deferred PreemptionThi Huyen Chau NguyenN.S. TranV.H. LePascal Richard2015-07-29T09:52:33Z2015-07-29T09:52:33Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/772This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7722015-07-29T09:52:33ZCollaborative Filtering by CO-TRAINING MethodDuy Phương NguyễnViet Tan Nguyentannv@vnu.edu.vnMinh Phuong Tu2015-07-29T09:50:46Z2015-07-29T09:50:46Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/773This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7732015-07-29T09:50:46ZSAT and SMT: Their algorithm Designs and ApplicationsMizuhito OgawaVan Khanh Tokhanhtv@vnu.edu.vn2015-07-29T09:45:25Z2016-08-31T09:50:48Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/771This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7712015-07-29T09:45:25ZAutomating Inference of OCL Business Rules from User ScenariosDuc Hanh Danghanhdd@vnu.edu.vnJordi Cabot2015-07-29T09:37:23Z2015-07-29T09:37:23Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/770This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7702015-07-29T09:37:23ZAn Efficient Method for Automated Control Flow Testing of ProgramsQuang-Trung NguyenNgoc Hung Phamhungpn@vnu.edu.vn2015-07-29T09:32:12Z2015-07-29T09:32:13Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/769This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7692015-07-29T09:32:12ZA Method and Tool Support for Automated Data Flow Testing of Java ProgramsVan-Cuong PhamNgoc Hung Phamhungpn@vnu.edu.vn2015-07-22T13:58:05Z2015-07-22T13:58:05Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/768This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7682015-07-22T13:58:05ZAn Assume-Guarantee Model Checker for Component-Based SystemsMinh Duong HoangKhanh Trinh LeNgoc Hung Phamhungpn@vnu.edu.vn2015-07-22T13:55:38Z2016-05-20T09:18:15Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/767This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7672015-07-22T13:55:38ZAn Approach to Checking Security Policy in Software DevelopmentNinh Thuan Truongthuannt@vnu.edu.vnViet Ha Nguyenhanv@vnu.edu.vn2015-07-22T13:52:20Z2015-07-22T13:52:20Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/758This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7582015-07-22T13:52:20ZLọc cộng tác bằng phương pháp đồng huấn luyệnViet Tan Nguyentannv@vnu.edu.vn2015-05-22T08:18:27Z2015-05-22T08:18:27Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/757This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7572015-05-22T08:18:27ZA New Improved Term Weighting Scheme for Text CategorizationPham Xuan NguyenQuang Hieu Le2015-05-22T08:15:17Z2015-05-22T08:15:17Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/756This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7562015-05-22T08:15:17ZSiplicial Nonnegative Matrix FactorizationDuy Khuong NguyenKhoat ThanTu Bao Ho2015-05-22T08:09:26Z2015-05-22T08:09:26Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/755This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7552015-05-22T08:09:26ZParallel Phrase Extraction from English-Vienamese Parllel CorporaQuang Hung LeAnh Cuong LeVan Nam Huynh2015-04-20T07:55:01Z2015-05-22T08:04:52Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/754This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7542015-04-20T07:55:01ZParagraph Alignment for English-Vietnamese Parallel E-booksQuang Hung LeDuy Cuong NguyenDuc Hong PhamAnh Cuong Le2015-01-29T07:52:46Z2015-01-29T07:52:46Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/784This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7842015-01-29T07:52:46ZEfficiency improvements for fuzzy associative memoryNong Thi HoaThe Duy BuiTrung Kien Dang2015-01-29T07:47:26Z2015-09-06T08:15:38Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/783This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/7832015-01-29T07:47:26ZA Max-Min Learning Rule for Fuzzy ARTFuzzy 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.Thi-Hoa NongThe Duy Buiduybt@vnu.edu.vn2013-08-23T03:18:27Z2013-08-23T03:18:27Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/192This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1922013-08-23T03:18:27ZExploring a Probabilistic Earley Parser for Event Decomposition in Biomedical TextsMai-Vu Tranvutranmai@gmail.comNigel CollierHoang-Quynh LeVan-Thuy PhiThanh-Binh Pham2013-08-23T02:58:51Z2013-08-23T02:58:51Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/190This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1902013-08-23T02:58:51ZMulti-Modal Image Annotation with Multi-Instance Multi-Label LDACam-Tu Nguyenncamtu@vnu.edu.vnD.-C. ZhanZ.-H. Zhou2013-08-23T02:50:18Z2015-01-22T07:08:27Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/189This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1892013-08-23T02:50:18ZParallelization of the Fast Multipole Method for Molecular Dynamics Simulations on Multicore ComputersHai Chau Nguyenchaunh@vnu.edu.vn2013-08-23T02:36:33Z2017-01-13T02:19:55Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/188This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1882013-08-23T02:36:33ZMining Phenotype Candidates from the Scientific Literature with Diverse Hypothesis Resolution StrategiesNigel CollierMai Vu Tranvutm@vnu.edu.vnHoang Quynh Lelhquynh@gmail.comQuang Thuy Hathuyhq@vnu.edu.vnAnika OellrichDietrich Rebholz-Schuhmann2013-08-23T02:25:29Z2013-08-23T02:25:29Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/186This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1862013-08-23T02:25:29ZACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony ProblemDong Do Ducdongdd@vnu.edu.vnSy Vinh Levinhls@vnu.edu.vnXuan-Huan Hoanghuanhx@vnu.edu.vn2013-08-08T06:30:59Z2015-01-22T07:05:02Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/184This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1842013-08-08T06:30:59ZACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony ProblemDong Do Ducdongdd@vnu.edu.vnSy Vinh Levinhls@vnu.edu.vnXuan-Huan Hoanghuanhx@vnu.edu.vn2013-08-08T06:26:21Z2013-08-08T06:26:21Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/183This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1832013-08-08T06:26:21ZMAC-based Improvement for Transport Rate Control in Multihop Wireless NetworksTruc Mai Tranmai.tran@vnu.edu.vnLe Minh Duongminhdl@vnu.edu.vn2013-06-20T05:02:36Z2017-01-13T02:17:31Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/159This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1592013-06-20T05:02:36ZHidden Topic Models for Multi-Label Review Classification: An Experimental StudyThi Ngan PhamThi Thom PhanPhuoc Thao NguyenQuang Thuy Hathuyhq@vnu.edu.vn2013-03-27T05:50:25Z2013-06-29T04:37:01Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/135This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1352013-03-27T05:50:25ZAn Efficient Method for Fingerprint Matching based on Local Point ModelThis 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.Thi Huong Thuy NguyenXuan-Huan Hoanghuanhx@vnu.edu.vnNgoc Ky Nguyen2013-03-27T05:48:48Z2013-06-29T04:37:57Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/136This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1362013-03-27T05:48:48ZAn Efficient Ant Colony Optimization Algorithm for Multiple Graph AlignmentThe 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.Ngoc Ha TranDuc Dong DoXuan-Huan Hoanghuanhx@vnu.edu.vn