HI NGH KHOA HC QUC GIA LN TH VII

NGHIN CU C BN V NG DNG
CNG NGH THNG TIN

TM TT BO CO

Thi Nguyn, 19-20/6/2014

LI NI U

Nhm gp phn thc y nghin cu c bn v nghin cu ng dng v Cng ngh

thng tin v Truyn thng ti Vit Nam, Lin hip Cc hi Khoa hc v K thut Vit
Nam, i hc Thi Nguyn phi hp vi Vin Hn lm Khoa hc v Cng ngh Vit
Nam, B Gio dc v o to, B Khoa hc v Cng ngh cng vi cc trng i hc
v vin nghin cu trong c nc t chc Hi ngh quc gia ln th VII "Nghin cu c
bn v ng dng Cng ngh thng tin" (gi tt l FAIR7) vo hai ngy 19 v 20 thng 6
nm 2014 ti Trng i hc cng ngh thng tin v truyn thng, i hc Thi Nguyn
(http://fair.conf.vn/2014).
S kin ny thu ht s quan tm ln ca cng ng ng o nhng ngi lm
nghin cu c bn v ng dng cng ngh thng tin trong c nc. 221 bo co khoa hc
v tt c cc ch thi s ca cng ngh thng tin v truyn thng c gi ti Ban
t chc.
m bo cht lng ca mt hi ngh khoa hc quc gia v nghin cu c bn
v nghin cu ng dng cng ngh thng tin, Ban chng trnh ca Hi ngh bao gm
cc nh khoa hc c uy tn v tm huyt tin hnh phn bin s b tt c cc bi bo
co nhn c. Tiu ch chp nhn bi l tnh mi v tnh thi s ca cc nghin cu c
bn, tnh sng to v tnh cp thit ca cc nghin cu ng dng. y l nhng bi c
ton vn bo co vi ni dung p ng tiu ch la chn mt cch tng i.
Tp ti liu ny bao gm tm tt ca 170 bo co c chp nhn trnh by ti
Hi ngh. Ton vn cc bo co ny c a ln website ca Hi ngh ti a ch nu
trn. Tuyn tp cng trnh bao gm cc bo co c trnh by ti Hi ngh v c
cc nh khoa hc trong Ban chng trnh phn bin sau Hi ngh s c xut bn.
Xin cm n tt c cc tc gi gi bi tham gia Hi ngh v cm n tt c cc anh
ch, cc bn ng nghip gp phn vo thnh cng ca Hi ngh.
BAN CHNG TRNH

Ban ch o
Trng ban
GS.VS. ng V Minh
Thnh vin:
GS.TSKH. Trn Vn Nhung
GS.TSKH Dng Ngc Hi
GS.TSKH. Hong Vn Kim
GS.TS. V c Thi
GS.TS. ng Kim Vui
PGS.TS. Mai H
PGS.TS. Trn Vn Lng
Ban T chc:
Trng ban:
GS.TS. V c Thi
Ph trng ban:
PGS.TS. Nguyn Ngc Bnh
PGS.TS. Hynh Quyt Thng
TS. Nguyn i Vit
Thnh vin:
PGS.TS. Phm Vit Bnh
PGS.TS. Li Khc Li
PGS.TS. Trn Vn Lng
PGS.TS. Nng Ton
Ban T chc a phng:
Trng ban:
PGS.TS. Phm Vit Bnh
Thnh vin:
PGS.TS. Li Khc Li
TS. V c Thi
TS. Nguyn Vn To
ThS. Mai Ngc Anh
CN. Lng Th Hong Dung
ThS. Nguyn Xun Hng
TS. ng Th Oanh
Ban Chng trnh:
Trng ban:
GS.TS. ng Quang
Ph trng ban:
PGS.TS. Trn nh Khang
PGS.TS. Trn Vn Lng

Lin hip cc hi KHKT VN

B GD&T
Vin HLKHCN VN
Trng H CNTT
Vin CNTT, HQG-HN
H Thi Nguyn
B KH&CN
Vin CH&THD

Vin CNTT, HQG-HN

Trng H Cng ngh
Trng HBK H Ni
Vin CNTT, HQG-HN
Trng H CNTT&TT
H Thi Nguyn
Vin CH&THD
Vin CNTT

Trng H CNTT&TT
H Thi Nguyn
Trng H CNTT&TT
Trng H CNTT&TT
Trng H CNTT&TT
Trng H CNTT&TT
Trng H CNTT&TT
Trng H CNTT&TT

Vin CNTT
Trng HBK H Ni
Vin CH&THD
5

GS.TS. Nguyn Thanh Thy

Thnh vin:
PGS.TS. Trn Quang Anh
PGS.TS. on Vn Ban
PGS.TS. Nguyn Ngc Bnh
PGS.TS. Phm Vit Bnh
PGS.TS. L Hoi Bc
PGS.TS. Nguyn Hu Cng
GS.VS. Demetrovics Janos
TS. Nguyn c Dng
PGS.TS. inh in
PGS.TS. H S m
PGS.TS. Dng Anh c
PGS.TS. ng Vn c
TS. Nguyn Huy c
TS. Hong Th Lan Giao
PGS.TS. Nguyn Vit H
TS. m Quang Hng Hi
PGS.TS. Hunh Xun Hip
PGS.TSKH. V nh Ho
PGS.TSKH. Nguyn Ct H
PGS.TS. Bi Th Hng
TS. Trn Vn Hoi
PGS.TS. V Chn Hng
PGS.TS. L Thanh Hng
GS.TSKH. Hong Vn Kim
PGS.TS. ng Trn Khnh
TS. V Nh Ln
TS. Phm c Long
PGS.TS. V Duy Li
TS. V c Lung
TS. L Quang Minh
TS. Trnh Ngc Minh
TS. Thanh Ngh
TS. L Quc Ngc
PGS.TS. Nguyn Hong Phng
PGS.TS. T Minh Phng
TS. Nguyn Hng Quang
TS. V Vinh Quang
TS. Nguyn Hu Qunh
PGS.TS. L Vn Sn

Trng H Cng ngh

Trng H H Ni
Vin CNTT
Trng H Cng ngh
Trng H CNTT&TT
Trng H KHTN Tp.HCM
H Thi Nguyn
Vin HLKH Hungary
Vin CNTT
Trng H KHTN Tp.HCM
Trng H Cng ngh
Trng H CNTT
Vin CNTT
Trng CSP TW
Trng HKH Hu
Trng H Cng ngh
Trng H CNTT
Trng H Cn Th
Trng HSP H Hi
Vin CNTT
Trng HSP K thut Hng Yn
Trng HBK Tp.HCM
Vin CNTT
Trng HBK H Ni
Trng H CNTT
Trng HBK Tp.HCM
Trng H Thng Long
Trng H CNTT&TT
Vn phng TW
Trng H CNTT
Vin CNTT, HQG-HN
HQG Tp.HCM
Trng H Cn Th
Trng H KHTN Tp.HCM
B Y t
Hc vin Cng ngh BCVT
Vin Tin hc Php ng
Trng H CNTT&TT
Trng H in lc
Trng HSP Nng
6

PGS.TS. Ng Quc To
PGS.TS. L Mnh Thnh
PGS.TS. Hunh Quyt Thng
PGS.TS. L Huy Thp
GS.TS. V c Thi
PGS.TS. Nguyn nh Thc
TS. Nguyn nh Thun
PGS.TS. Trn an Th
PGS.TS. o Thanh Tnh
PGS.TS. Nng Ton
TS. Nguyn Hu Trng
PGS.TS. Nguyn Thanh Tng
PGS.TS. V Thanh T
TS. Nguyn Anh Tun
GS.TS. Phan Th Ti
PGS.TS. Nguyn nh Vit
TS. Phan Cng Vinh
TS. H Tng Vinh
PGS.TS. Trnh nh Thng
TS. L S Vinh
TS. Phm Trn V
Ban K thut
Trng ban
PGS.TS. Trn Vn Lng
Thnh vin
ThS. Phan Mnh Thng
ThS. Nguyn Th Thu D
Ban Th k
Trng ban
TS. ng Th Oanh
Thnh vin
TS. Nguyn Vn Hun
ThS. L Hng Linh
Ban Xut bn
Trng ban
PGS.TS. Nng Ton
Thnh vin
ThS. Phan Th Qu Anh
ThS. Trnh Hin Anh

Vin CNTT
i hc Hu
Trng HBK H Ni
Trng H Lc Hng
Vin CNTT, HQG-HN
Trng H KHTN Tp.HCM
Trng H CNTT
Trng H KHTN Tp.HCM
Hc vin KTQS
Vin CNTT
Trng H Nha Trang
Trng H Lc Hng
Trng HKH Hu
Trng H CNTT
Trng HBK Tp.HCM
Trng H Cng ngh
Trng H Nguyn Tt Thnh
Vin Tin hc Php ng
Trng H SP 2 H Ni
Trng i hc Cng ngh
Trng HBK Tp.HCM

Vin CH&THD
Trng H Lc Hng
Vin C hc v Tin hc ng dng

Trng H CNTT&TT
Trng H CNTT&TT
Trng H CNTT&TT

Vin CNTT
Tp ch TH&KH
Vin CNTT

A Bayesian Network Approach for Forecasting the Bacillus Necrosis

Pangasius Disease on the Shark Catfish
Hunh Xun Hip1, Hunh Tn Sang2, Lm Hoi Bo1, Phan Phng Lan1
1

Khoa CNTT & TT, H Cn Th, 2Trung tm cng ngh phn mm Tp. Cn Th

Based on the Bayesian network approach and the Markov chain, this paper proposes
models to forecast the propagation of Bacillus Necrosis Pangasius (BNP) disease on the
shark catfish in a pond, ponds in the same area, and along river routes. The key factors
considered in these models are: care and management conditions of fish farmers (such as
water changes, nutrient levels, stocking densities); the environment change including
physical factors (such as temperature, salty) and chemical factors (such as pH, H2S, CO2,
heavy metals); the health status of fishes; and pathogens. Using these models, aquaculture
experts can consolidate their judgments about the pathogenesis and the transmission of
BNP, and especially can recommend fish farmers some ways to prevent BNP effectively.

A fine-grained parallel Apriori algorithm for mining of frequent

itemsets
Th Mai Hng, Nguyn Mnh Hng
Hc vin KTQS
Apriori l mt thut ton ni ting trong khai ph tp ph bin. Tuy nhin, y l
mt thut ton c phc tp tnh ton cao v thi gian chy c th ko di n vi ngy
khi c s d liu c kch thc ln t vi Gigabyte. Song song ha c s dng tng
hiu sut v gim thi gian thc hin khai ph tp ph bin. c nhiu xut song
song ha thut ton Apriori trn c hai m hnh: m hnh b nh phn tn v m hnh b
nh chia s. Trong bi bo ny, chng ti xut mt thut ton Apriori song song ht
mn khai ph tp ph bin. Thut ton song song xut gim c thi gian khai ph do
thc hin cn bng ti trn h thng tnh ton a nhn vi b nh chia s. Thut ton
song song xut c th nghim trn tp d liu ln v so snh vi thut ton c
xut trc y.

A modeling for picture archiving and communication system at a

hospital, traditional and multimedia medical database approach
Dao Van Tuyet1, Vu Duc Thi2, Nguyen Long Giang2, Truong Cong Thang1,
Dang Tran Duc2, Tran Duc Hieu1, Tran Viet Lam1, Nguyen The Hiep3
1

Institute of Applied Mechanics and Informatics, 2Institute of Information Technology,

3
Binh Duong General Hospital

There are two main tendencies in Medical Imaging Informatics. One is the
development of core theory in the information technology itself and the other one is the
9

use of technologies in applications for health improving. In recent years, the deployment
of Health Information Technology applications in some hospitals has enhanced the
quality of administrative management and actively supported the diagnosis and treatment
tasks. Currently, some large hospitals in the developed countries have deployed Picture
Archiving and Communication Systems aiming to further enhance the quality of the
diagnosis and treatment tasks of the doctor at the hospital. In this paper, we will present
an architectural model of the PACS System, a system to perform the mission of
collecting and archiving photos created from creating photo devices. Such images include
X-ray images (digital X-ray machine), Computerized Tomography images, MRI images
(Magnetic Resonance Machines), ultrasound images (Ultrasound Machines) and some
recent results at the medical Informatics of the Institute of Applied Mechanics and
Informatics in the deployment of applications that combine PACS System with
Radiology Information Sytems to manage files and support the diagnosis and treatment
tasks of patients in the Department of Radiology.

A new distance-based attribute selection measure for decision tree

construction
Phm Cng Xuyn, Nguyn Thanh Tng, Vn nh V Phng
i hc Lc Hng
Classification is one of major tasks in Data Mining and Machine Learning. It is to
find the rules for assigning objects to one of several predefined categories based on
decision data set. Many classification techniques have been proposed in the literature, but
decision tree is the most popular due to their simplicity and transparency. The
construction of decision trees is centered around the selection algorithm of an attribute
that generates a partition of the subset of the training data set that is located in the node
about to be split. Over the years, several greedy techniques for choosing the splitting
attribute have been proposed including the entropy gain and the gain ratio, the Gini index,
the Kolmogorov-Smirnov metric, or a metric derived from Shannon entropy. In this paper
we introduce a new type of metric on partitions of finite sets that is derived from the new
concept of conditional information entropy proposed by Jiye Liang. We show that this
metric can be applied succesfully as an attribute selection criterion to the construction of
decision trees.

A new method for detecting virus based on the maximum

entropy model
Phm Vn Hng, L B Cng, L c Thun, L Th Hng Vn
Khoa Cng ngh Thng tin, Hc vin K thut Mt M
The paper presents a new method for detecting virus based on the Maximum
Entropy Model. This method is also used to detect unknown viruses. Maximum Entropy
is a machine learning method based on probability distribution and has been successfully
10

applied in the classification problem. From the background knowledge, we improve and
apply this model to solve the problem of virus detection. In the training phase, virus
samples in the virus warehouse are extracted their features and trained to create the
Entropy Model. In the detection process, the Entropy Model is used to recognize virus
based on the corresponding features of a checked file.

A Study of Transfer Learning in Genetic Programming

Phm Th Thng1, Nguyn Quang Uy2, Ng Th Lan1
1

H Cng ngh Thng tin & Truyn thng Thi Nguyn, 2HV K thut Qun s

In this paper, we propose a model for implementing transfer learning in Genetic

Programming (GP). The model for transfer learning in Genetic Programming is
constructed by copying some good solutions from source problems to the population for
the target problem. The method is then tested on some families of some structured
symbolic regression problems and the experimental results show that using transfer
learning help Genetic Programming perform better on a family of related problems.
However, transferring too much knowledge may also degrade its performance leading to
negative transfer. Therefore, it is important to study how much knowledge we should
transfer from the source to the target problem. In this paper, we also attempt to give a
preliminary to this answer.

A Survey Of Confidence Measures For Machine Translation Based On

Bilingual French - Vietnamese Corpora
Le Ngoc Tien, Le Ngoc Tan
Faculty of Information Technology, Industrial University of Ho Chi Minh
Machine Translation (Automatic translation) is the process of automatic translation
from a source language to one or more target language without human intervention. In
the automatic translation process, the attributes of complex grammatical structures,
semantic ambiguity will affect the quality of the translation results as ambiguity of
language, ambiguity of POS or ambiguity from multiple meanings of a word (or a phrase).
Therefore, the study of these characteristics to assess the reliability of automatic
translation results is important and necessary to improve the quality of automatic
translation. In this paper, we are interested in survey and building characteristics to assess
the confidence of translation results based on sentences, phrases and words (sentencelevel, phrase-level and word-level) in the experiments with the bilingual corpus French Vietnamese. The result of this paper is the premise for the following research and
application in confidence estimation for machine translation within the bilingual corpus
between Vietnamese and other languages.

11

Add-Border-Smote: phng php mi sinh thm phn t trong phn

lp d liu mt cn bng
Nguyn Th Hng, ng Xun Th
Khoa Cng ngh Thng tin, HSP H Ni
Phn lp d liu l mt bi ton c ng dng rng ri trong thc t. Tuy nhin,
nhiu bi ton xut hin d liu mt cn bng ngha l c s chnh lch rt ln v s
lng cc phn t gia hai lp, khi , vic phn lp ng cc phn t thiu s ng vai
tr rt quan trng. Hin nay, s lng cc bi ton c d liu mt cn bng ngy cng
nhiu nh bi ton pht hin ngi b bnh, pht hin gian ln truyn thng, pht hin
trn du t nh radar b mt i dng nhng nu p dng cc phng php phn lp
truyn thng th hiu qu khng cao. c nhiu nghin cu v khai ph d liu mt cn
bng vi cc hng tip cn khc nhau trong c hng tip cn trn mc d liu
bng phng php sinh thm phn t nh: SMOTE, Borderline-SMOTE. Bi bo ny
gii thiu v d liu mt cn bng v phn tch mt s phng php tip cn hin nay, t
xut mt phng php sinh thm phn t mi cho lp thiu s l Add-BorderSMOTE. Add-Border-SMOTE c ci tin da trn thut ton Borderline-SMOTE
nhm tm ra cc phn t bin ca lp thiu s v thc hin sinh thm phn t gia cc
phn t bin theo phng php SMOTE. Phng php ca chng ti c thc nghim
vi cc b d liu t kho d liu chun quc t UCI: Blood, Breast-p, Haberman, v
Pima. Chng ti so snh kt qu phn lp vi cc o G.mean, F.measure ca b d
liu mi c sinh bi Add-Border-SMOTE vi cc b d liu c sinh bi cc thut
ton SMOTE, Borderline-SMOTE, v b d liu ban u. Vic phn lp c thc hin
bng thut ton phn lp SVM. Cc kt qu thc nghim ch ra rng phng php mi
ca chng ti tt hn v nh gi t-test c ngha thng k vi p-value nh hn 0.05
hu ht cc b d liu.

Algorithms apllication of reducing gradient to Kohonen neural network

to improve nonlinear distortion in m-qam digital information system
on Th Thanh Tho1, L Hi Nam2, Phm B Bnh2, Phm Vn Ngc1
1

H Cng ngh Thng tin & Truyn thng, H Thi nguyn, 2Military University of
Science and Technology

A long with continuous development of neural network theory, many network

structures and training algorithms are given with aim to enhance incessantly predistortion
quality in conditions of large nonlinear. One of those research orientations is to use
Kohonen Complex Neural Network to build pre-distortion to apply to the digital
information system with m- QAM modulation. On nature, Kohonen network shall selfexplore sample, characteristic, correlation or inputs. While these features are explored,
the network parameters will be changed. Thanks to this self-organized algorithm, the
necessary neural will be added after training process and residual neural in network will
be removed. After training process, the network will receive the most reasonable
structure. However, training quality of network will depend on the way of selecting
12

parameter for training algorithm. The research proposes to apply algorithm of reducing
gradient to Kohonen complex neural network improving nonlinear distortion in order to
enhance quality-improved effect of M-QAM digital information system.

An abundance-based binning approach for metagenomic reads using a

fuzzy k-mediods method
L Vn Vinh1, Trn Vn Lng2, Trn Vn Hoi1
1

HBK Tp. H Ch Minh, 2Vin C hc v Tin hc ng dng

As a crucial step in metagenomic analysis, the binning of reads aims to classify the
reads into different groups that represent individual species or closely related organisms.
This paper presents a new binning approach for metagenomic reads basing on species
abundances and not requiring any reference databases. The proposed approach consists of
three steps in which a fuzzy k-mediods method is applied in its major step for the
classification of l-mers. Our experiments show that the proposed approach can work with
short read datasets and achieves better overall results than a recent abundance-based
binning method.

An approach to detecting duplicate bug reports using BM25 term

weighting
Nhan Minh Phc, Nguyn Hong Duy Thin
i hc Tr Vinh
According to past research studies, detection duplicate bug report is an important
issue in software maintenance. First, triaging these duplicate bug reports may cost a large
amount of human resources. Second, these duplicate bug reports may contain abundant
debugging information which can be mined in depth to help testing and debugging
processes. In this paper, we propose a novel scheme using natural language and BM25
feature weighting to improve the detection performance. With three open-source projects,
Apache, ArgoUML, and SVN, we have conducted empirical studies. The experimental
results show that the proposed scheme can effectively improve the detection performance.
Keyword Bug Reports, Duplication Detection, Feature Weighting, BM25

An overview of job scheduling in multi-core processor based

computational system
inh Vn Nam, Trn Th Xun
Thai Nguyen University of Information and Communication Technology

13

Recently, the advance of multi-core processors has become critical in industry

manufacture, due to the physical limits on complexity, speed, and power consumption of
uni-core processors. As this technology, however, is quite new, the studies on it are quite
limited and incomplete. The questions that whether homogeneous or heterogeneous
architecture is preferred, how cores communicate to each other most effectively, and how
operating system divides workload into cores - symmetrically or asymmetrically - still
remain in debate. A comprehensive understanding these properties will be helpful for
dealing with job scheduling problem in multi core based system, especially in complex,
distributed systems. To be able to take full advantage of this technology, in this paper we
express an overview of its characteristics in both hardware and software viewpoint, and
the multi core related researches focusing on job scheduling issue in the literature.

Automatic Extraction of Bilingual Named Entities by using multiple

features from Small Parallel Vietnamese-French Corpora
Le Ngoc Tan1, Le Ngoc Tien1, Nguyen Thi Thanh Thao2, Trinh Thanh Duy3,
Tran Le Tam Linh4
1

Industrial University of Ho Chi Minh city, 2Trng Cao ng Kinh T Ph Lm

Tp. HCM, 3Cng ty Kim Tu Dien, 4i hc khoa hc t nhin

Information comes in many shapes and sizes. The amount of natural language text
that is available in electronic form is truly staggering, and is increasing every day. In
order to improve the quality of machine translation systems, the constitution of
multilingual resources (dictionaries, written corpora and bilingual lexicons) is essential
and fundamental. But these resources are not yet available publicly for all language pairs,
especially with Asean languages. And the researches in natural language processing for
Asian languages are currently on the edge of major developments. This paper aims to
describe an approach on the automatic extraction of bilingual named entities (NE) pairs
by projection from a small bilingual Vietnamese-French corpus. We present in this paper
how to extract the bilingual NE pairs by identifying the relationships between the
bilingual sentence pairs in the bilingual corpus. The experimentations show that this
novel approach has identified NE-pairs with the higher accuracy (90.65%) in our
Vietnamese-French NE automatic extraction task.

Bi ton phn lung giao thng a phng tin tuyn tnh trn mng
giao thng
Trn Ngc Vit, Trn Quc Chin, Nguyn nh Lu, Nguyn Mu Tu
762 Trn Cao Vn, Thanh Kh, Nng
A graph is a powerful mathematical tool applied in many fields such as
transportation, communication, informatics, economy, In an ordinary graph, the
weights of edges and vertexes are considered independently where the length of a path is
14

the sum of weights of the edges and the vertexes on this path. However, in practice,
weights at a vertex are not the same for all paths passing this vertex, but dependent on
coming and leaving edges. This paper develops a model of extended network that can be
applied to modelize many practical problems more exactly and effectively. The maximal
concurent multicomodity linear flow problem with minimal cost and the optimal
multicomodity linear flow problem are defined with the linear programming model. Dual
problems and related questions are dealt with. The results from this study will be a
theoretical base for effective algorithms that solve the problems above in the following
works [7] and [8].

Biu din cc m hnh ER thi gian bng logic m t

Nguyn Vit Chnh1, Hong Quang2
1

i hc ng Nai, 2i hc Khoa hc Hu

Mi quan h gia logic m t v c s d liu (CSDL) l kh khng kht. Thc t

cho thy nhu cu ca vic xy dng cc h thng va c kh nng biu din tri thc, va
cho php qun tr CSDL l tht s cn thit. H biu din c s tri thc logic m t ngoi
vic cho php qun l cc tri thc ni hm, cn cung cp mt khung chun c xem l
gn gi vi cc ngn ng c dng biu din m hnh thc th - mi quan h (m
hnh ER). Mt khc, m hnh ER thi gian c dng m hnh ha cc kha cnh thi
gian ca lc CSDL mc khi nim. V vy, vic s dng logic m t biu din cc
m hnh ER thi gian l tht s hu ch trong vic hnh thc ha cc m hnh d liu
mc khi nim. Da vo logic m t c yu t thi gian, Alessandro Artale v cc cng
s (2011) biu din cc lc ER thi gian v cc rng buc ton vn bng cch
hnh thc ha cc ph thuc bao hm bi cc tin bao hm. Nghin cu ny, ngoi
vic gii thiu mt phng php biu din ca cc tc gi trn, b sung vo , chng ti
mun xut vic biu din cc thuc tnh a tr trn cc m hnh ER thi gian bng
logic m t.

B iu khin in p da trn i s gia t cho h thng my pht

t kch t
Nguyn Ct H1, V Nh Ln1, Nguyn Tin Duy2
1

Vin cng ngh thng tin, 2Khoa in t, H k thut cng nghip, H Thi Nguyn

Trong bi bo ny, chng ti trnh by mt h thng iu khin theo hng t

trng roto gin tip (IRFO) ca cc my pht cm ng t cm (SEIG), trong s kch
t c thc hin bng b bin tn ngun in p iu khin dng in (CC- VSI) v mt
t in n. Trong s iu khin xut, c tn ho st t v bo hau c xt n
v u c tnh ton trc tuyn. Mc ch chnh l gi cho in p mt chiu trn t
in khng i v bng vi gi tr t, bt k nhng thay i trong c tc rotor v ti.
Vic kim tra ch yu tp trung vo vic iu khin in p mt chiu, c th hn l vo
15

vic la chn b iu khin in p mt chiu ph hp. Ngoi vic xt n cc loi b

iu khin c bit n mt cch rng ri nh l b iu khin PI kinh in hoc b
iu khin m (FL), bi vit ny xut mt gii php thay th bng mt b iu khin
in p mi da trn i s gia t (HA). Theo chng ti, y l ln u tin mt b iu
khin nh vy c ng dng trong k thut in. Hiu sut ca b iu khin i s gia
t c nh gi thng qua vic so snh vi c hai b iu khin PI kinh in c iu
chnh ti u v b iu khin m kiu Sugeno. Chng ti tin hnh c phn tch m
phng v thc nghim. Kt qu c thit lp i vi in p mt chiu, ti v c tc
rotor bin thin trong phm vi rng. Kt qu ch ra rng b iu khin HA m chng ti
xut m bo c tnh tt hn v kh nng bm theo gi tr t , v tnh bn vng i
vi nhiu tc v c nhiu ph ti trong h thng.

Cc chin lc tm kim cy khung ln cn trong cc thut ton

metaheuristic gii bi ton cy khung chi ph nh tuyn nh nht
Phan Tn Quc1, Nguyn c Ngha2
1

i hc Si Gn. 2i hc Bch khoa H Ni

-Bi ton cy khung chi ph nh tuyn nh nht (Minimum Routing Cost Spanning
Tree - MRCST) l mt bi ton ti u th c nhiu ng dng trong lnh vc thit k
mng v trong tnh ton sinh hc. Trong trng hp tng qut, bi ton MRCST c
chng minh l thuc vo lp bi ton NP-kh. gii cc bi ton MRCST thc tin
kch thc ln ngi ta thng s dng cc thut ton metaheuristic, chng hn nh thut
ton leo i, thut ton tm kim a phng, thut ton tm kim tabu, cc thut ton di
truyn, cc thut ton by ong, Mi thut ton nh vy u s dng mt chin lc
tm kim cy khung ln cn ring. Bi bo ny trnh by phn tch tng quan cc chin
lc tm kim cy khung ln cn hin bit v vic s dng chng trong cc thut ton
metaheuristic gii bi ton MRCST. Cc kt qu thc nghim c trnh by trong bi
bo ny cho thy cc chin lc tm kim cy khung ln cn gi vai tr trung tm trong
vic khm ph khng gian li gii v c nh hng quyt nh n cht lng ca li gii
thu c bi cc thut ton metaheuristic.

Cc ph thuc i tng trong c s d liu hng i tng m

on Vn Thng1, Nguyn Xun Nht1, Nguyn ng Quang Huy2,
Lng Vn Ngha3
1

Trng C Cng Thng HCM, 2H Duy Tn, 3H Phm Vn ng

Trong bi bo ny, chng ti tp trung nghin cu ph thuc m gia cc thuc tnh

v gia thuc tnh vi phng thc trong mt lp i tng m da trn xp x ng
ngha theo cch tip cn i s gia t (SGT). Tng t nh trong c s d liu (CSDL)
quan h r/m, bi bo a ra cc nh ngha ph thuc thuc tnh m v ph thuc

16

phng thc m, cng nh cc lut suy dn ca n trn m hnh CSDL hng i tng
(HT) vi thng tin m v khng chc chn

Cch tip cn i s gia t vi h tr gip quyt nh thng minh

ng cu thin tai
Phm Vn Hi, Trn nh Khang
i hc Bch Khoa H Ni
Trong lnh vc ng cu thin tai nh thm ha, thin tai v l lt, cc nh iu hnh
v qun l a ra nhiu phng n gii quyt vi a mc tiu v a tiu ch vi cc rng
buc phc tp. La chn phng n ra quyt nh ti u ng cu thin tai trong iu
kin phc tp hin, v ang c nhiu nh khoa hc trong nc, quc t tm cc gii
php vi nhiu a mc ch, a tiu ch v gim thiu ri ro trong mi trng ng.
Nghin cu ny xut m hnh tr gip quyt nh thng minh vi cch tip cn min
gi tr u vo ca i s gia t (SGT) nhm gii quyt a tiu ch vi nhiu rng buc,
gim thiu ri ro cho cc bi ton giao thng trong cu nn-thin tai. Trong m hnh ra
quyt nh, cc kin v tham kho ca cc chuyn gia c a vo h thng qua bc
tin x l kt hp vi lng ha m ca i s gia t. Hm mc tiu c xc nh da
trn mc ch la chn phng n ti u v cc tiu ha ri ro trong vic iu hnh cc
phng tin ng cu thm ha, thin tai. Vi cu trc tnh ton phong ph ca SGT,
hm nh x min ngn ng t nhin ca bin ngn ng sang min gi tr m cho bi ton
ra quyt nh a mc tiu, kt hp vi cc kin ca chuyn gia di pht biu ngn ng
t nhin s c lng ha v gi tr m trong khong [0, 1]. nh gi m hnh
xut trn, v d c nu ra cho bi ton ra quyt nh iu hnh cc phng tin giao
thng ng cu thm ha, thin tai c m t bng minh chng c th c trnh by
trong bi nghin cu. H tr gip quyt nh thng minh c ci t v chy thc
nghim m phng (simulation) v so snh cc thut ton khc nhau da trn cc kin
chuyn gia trong bi ton ng cu thin tai. Kt qu nghin cu ca m hnh xut
ch ra cch tip cn i s gia t cho cc bi ton ra quyt nh phc tp trong iu hnh
ng cu giao thng trong thm ha v thin tai nhm tng quyt nh ng n cho cc
bi ton a mc tiu cho gii php ti u, vi nhiu rng buc v gim thiu ri ro.

Chn tp i tng i din cho bi ton rt gn thuc tnh ca h

thng tin khng y
V Vn nh1, Nguyn Long Giang2
1

i hc in Lc, 2Vin Cng ngh thng tin, VAST

Trong my nm gn y, mt s cng b xut m hnh tp th m rng da

trn quan h dung sai nhm gii quyt bi ton rt gn thuc tnh v khai ph lut trn
cc h thng tin khng y . Vi bi ton rt gn thuc tnh, vn c cc nh
nghin cu quan tm l ti u thi gian thc hin cc thut ton tm tp rt gn, nh
17

c th thc hin trn cc h thng tin c kch thc ln. c nhiu phng php rt
gn thuc tnh c xut, tuy nhin cc phng php ny u tm tp rt gn trn ton
b tp i tng ban u. Trong bi bo ny, chng ti xut phng php la chn tp
i tng i din t tp i tng ban u cho bi ton rt gn thuc tnh trn h thng
tin khng y . V kch thc tp i tng i din nh hn kch thc tp i tng
ban u nn phng php ca chng ti gim thiu ng k thi gian thc hin cc thut
ton tm tp rt gn

Ch k s tp th - M hnh v thut ton

Lu Hng Dng1, L Vn Tun2, Nguyn Tin Giang3
1

HV K thut Qun s, 2HV Khoa hc Qun s, 3Cc CNTT B Quc phng

Bi bo xut mt m hnh ng dng ch k ph hp cho i tng l cc c

quan nh nc, n v hnh chnh, doanh nghip, ...m cc thng ip d liu cn
phi c chng thc v ngun gc v tnh ton vn 2 cp : thc th k v t
chc(c quan, n v, ...) m thc th k l thnh vin ca n. Bi bo cng xut xy
dng lc ch k s theo m hnh ng dng mi ny. Cc lc ch k xut
y l mt dng lc ch k s mi c xy dng da trn tnh kh ca bi ton
khai cn trn vnh Zn=p.q vi p v q l cc s nguyn t phn bit.

Chu trnh Hamilton trong th _3 3/2 n-1

V nh Ha1, Nguyn Hu Xun Trng2
1

H S Phm H Ni, 2HV Ti Chnh

Cho trc th G n v hng vi n nh, ta k hiu _k l tng bc b nht ca

k nh i mt khng k nhau trong G. Bi ton HC xc nh chu trnh Hamilton (chu
trnh i qua tt c cc nh ca th) vn c bit l bi ton NPC. Trong bi bo ny,
chng ti chng minh bi ton HC vn cn l bi ton NPC trong lp th tha mn
_3tn vi t<3/2, v bi ton ny thuc lp P khi t3/2. Ngoi ra, trong bi bo, chng
ti cn chng minh mnh mnh hn l mi th 2-lin thng vi _33/2 n-1 l
Hamilton v ch ra l gi tr 3/2 n-1 l tt nht c th. Cui cng, chng ti xy dng
thut ton a thc xc nh chu trnh Hamilton cho lp th tha mn _33/2 n-1.

Combination of sequential patterns mining and clustering for mobility

prediction in wireless networks
Dng Th Thy Vn1, Trn nh Qu2
1

i hc Tn c Thng, 2Hc vin Cng ngh Bu chnh Vin thng

18

Wide WLANs such as city or campus WLAN support a large number of mobile
users to access Internet applications from where they want and still remain connected to
the Internet whilst on the move. Due to dynamic relocation, WLAN has some problems
of location management and network resource management. Mobility prediction may
produce mobility information of mobile users as well as accurate estimation of network
resource demands at future time. Therefore, mobility prediction has attracted recently a
great deal of research interests toward efficient location management and resource
management. Most previous approaches have utilized individual movement history to
predict. A few other works have investigated group of users with similar movement
behaviors. Most of them have some deficiencies. The first group of mobility prediction is
only based on individual mobility behaviors so the lack of information on personal
movement profile may cause false prediction. The second group of mobility prediction
applies similar mobility behaviors of multiple users to facilitate the predicting in the case
of new users or ones with movements on novel paths. However, they do not distinguish
between regular movements and random movements of mobile users, so they may cause
significant degradation in prediction accuracy. Towards these two deficiencies of
previous approaches, this paper is proposed as a combination of sequential pattern mining
and clustering. Sequential pattern mining is used to discover frequent mobility patterns to
deal with noise of random movements in the entire body of mobile users histories.
Whilst, clustering technique take full responsibility for partition mobile users into groups
of similar mobility behaviors to deal with the lack of information on personal profile. We
have conducted experiments to investigate the efficiency of the proposed mobility
prediction approach. Its the combination of sequential patterns mining and clustering
that makes the mobility prediction accuracy so improvable.

Computational techniques for fourth order semilinear elliptic boundary

value problems
ng Quang 1, Trng H Hi2, V Vinh Quang2
1

Vin Cng ngh thng tin, 2H CNTT v Truyn thng - H Thi Nguyn

In this paper we propose numerical techniques for solving some boundary value
problems (BVPs) for a fourth order semilinear equation. They are based on the reduction
of the fourth order problems to the solution of a sequence of BVPs for the Poisson
equation. It is an extension of our method developed by ourselves recently for linear
fourth order BVPs. The performed numerical experiments show the very fast
convergence of the proposed techniques.

COREDATA M&D Qun l - iu khin doanh nghip

L Ph 1, L Trung Thc1, Mai Mnh Trng2
1

H Cng ngh - HQG HN, 2H KTKT Cng nghip H Ni

19

i vi cc doanh nghip lun cn kim sot tt quy trnh hot ng, trnh mt
kim sot cht lng v tht thot ti sn. Quy trnh ISO gip cc doanh nghip hn ch
tht thot v kim sot tt quy trnh cng nh cht lng cng vic. im yu ca ISO
l: thc hin cng vic trn giy t, rt kh tm kim, vic lin kt d liu l khng d
dng. Cng ngh ha hot ng doanh nghip da trn ISO ang l xu th pht trin rt
mnh. u im l: tin ch v tm kim, qun l d liu tt, gim ti s dng giy t, lin
kt d liu cc phng ban. Hin ti, cc gii php cng ngh & phn mm thng ch p
ng mt b phn nht nh, m cha c giao tip vi k ton trn cng mt c s d liu.
Core-data M&D l gii php c s d liu SQL server, c pht trin nhm tm trung
tt c d liu ca mt doanh nghip bao gm c d liu k ton.

Crowding for the Direction-guided Evolutionary Algorithm

V Ch Cng1, Bi Thu Lm2
1

i hc Vinh, 2Hc vin k thut qun s

In evolutionary computation, crowding is a popular technique to handle multimodal optimization problems, which include many possible local or global solutions. In
our previous publication, we proposed a new direction-based evolutionary algorithm,
called DEAL. It was shown working effectively on nonlinear optimization problems. In
this paper, we extend further DEAL towards the area of multi-modality by applying
fitness sharing, and called the new version as CrowdingDEAL. We validated
CrowdingDEAL with a wide range of 15 popular test problems. The obtained results
indicated a strong performance of CrowdingDEAL in dealing with multi-modality and in
comparison with other algorithms.

nh gi c quan in t theo m hnh ITI GAF

Nguyn i Vit1, on Hu Hu2, Ng Don Lp3,
Th Thanh Thy4, L Quang Minh5
Vin CNTT - i hc Quc gia H Ni
M hnh ITI-GAF c bit n vi u im c rt nhng kinh nghim xy dng
EA th gii v c tinh gin cho ph hp vi iu kin Vit Nam. Bn cnh , m
hnh cng c th dng xy dng phng php iu tra nh gi hin trng ng dng
CNTT cho cc c quan nh nc ti Vit Nam mt cch hiu qu v chnh xc. Chng
ti xut khi nim c quan in t nh mt giai on chun b cho vic trin khai
chnh ph in t. Trn c s cch tip cn ny, chng ti tin hnh nh gi trnh
ng dng CNTT ti mt c quan nh nc v rt ra mt s bi hc kinh nghim p
dng trn quy m ph bin ti Vit Nam.

20

 xut ci tin c ch iu khin ti nt mng trn mi trng

mng tc cao
Nguyn Kim Quc1, V Thanh T2, Nguyn Thc Hi3
1

H Nguyn Tt Thnh, 2H Khoa hc Hu, 3HBK H Ni

Cc c ch iu khin hin c ti nt mng hot ng tt v rt hiu qu ti tng

b nh tuyn cc b, nhng vn khng mnh kim sot tnh ng v phi tuyn ca
mng. Do , yu cu h thng iu khin phi c thit k linh hot nm bt y
cc thng tin trng thi quan trng ca s bin thin trong mng v c phng php iu
khin thng minh kim sot tc nghn trong mng phi tuyn. gii quyt vn ny,
chng ti a ra gii php kt hp iu khin lp lun m vi c ch qun l hng i
tch cc hot ng ti cc nt mng. V thng qua h thng iu khin logic m c th
nm bt nhng bin i ng v phi tuyn ca h thng mng. T , kt hp cc c ch
qun l hng i tch cc kim sot v iu khin trnh tc nghn tt hn trn mi
trng mng tc cao

xut ci tin hiu nng mng Peer-to-Peer Chord cho tin trnh gia
nhp v ri i ca cc nt mng
Phm Thnh Nam, Nguyn Th Minh Huyn
H Cng Ngh Thng Tin v Truyn Thng Thi Nguyn
Ngy nay, cc m hnh mng ngang hng peer-to-peer (P2P) c tnh hn lon, tp
hp bao gm nhiu thnh phn nt mng di ng tham gia kt ni vo mng. Cc nt
mng di ng ny thng khng n nh v c thi gian tham gia kt ni ngn. S khng
n nh ca cc nt mng dn n vic suy gim nghim trng hiu nng tm kim d
liu ca cc mng P2P. Trong cc mng Peer-to-Peer (P2P) c cu trc c t chc theo
cc bng bm phn tn DHT th vn quan trng l vic tm kim d liu chnh xc v
nhanh nht. Khi mng n nh thp c ngha l thi gian gia nhp v ri i khi mng ca
cc nt din ra trong thi gian ngn dn ti cn phi tm ra cc c ch qun l m bo
duy tr hiu nng tm kim d liu n nh trong mng. Trong bi bo ny, chng ti
xut mt thut ton mi cho vic qun l cc nt gia nhp v ri i khi mng khi mng
Peer-to-Peer c t chc theo thut ton Chord DHT trong mng c n nh thp.
Thut ton ca chng ti xut tin hnh cp nhp tc thi bng nh tuyn ca cc nt
mng khi c s gia nhp/ri i mi ca cc nt. Cc kt qu m phng ca thut ton
ch ra rng thut ton ca chng ti ci tin ng k hiu nng mng Chord trong iu
kin mng c n nh thp.

xut gii php vnh ai an ton nhm pht hin tn cng l en

trong giao thc nh tuyn AODV trn mng MANET
Lng Thi Ngc1, V Thanh T2
1

i hc ng Thp, 2i hc Khoa hc Hu
21

Bi bo ny phn tch khuyt im xut hin trong qu trnh khm ph ng i

dn n b tn cng l en ca giao thc nh tuyn AODV trn mng MANET. Qua ,
bi bo xut mt gii php vnh ai an ton (SC - safe cycle) cho php pht hin tn
cng l en. Gii php mi ny s dng khong cch ln nht n tt c cc nt lng
ging da trn gi tr SN (Sequence Number) xy dng SC ti mi nt mng. Giao
thc AODVSC ci tin c to ra c thi gian tr thp v giao tip c vi AODV nn
ci thin khuyt im ca cc nghin cu trc y. Vic ci t m phng giao thc
AODVSC trong mi trng tn cng l en trn h m phng NS2 cng c trnh by
nhm nh gi kt qu nghin cu.

DFCB: Data Fusion and Chain-Based Routing Protocol for EnergyEfficient in Wireless Sensor Networks
Nguyn Duy Tn1, Nguyn nh Vit2
1

H SPKT Hng Yn, 2H Cng ngh - HQG H Ni

A chief challenging task for designing routing protocols in wireless sensor network
(WSN) is how to use energy efficiency. To solve this problem, in this paper, we propose
to combine data fusion and chain-base routing (DFCB) protocol. 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, which communicates with only the closest neighbor, a
like PEGASIS. In the second work, we fuse 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.

iu khin h thng phn hi khp kn qua mng vi hiu chnh thch

nghi tham s iu khin
V Chn Hng, H Mnh o, Hong Vn Tun
Vin Cng ngh Thng tin - Vin Hn lm Khoa hc v Cng Ngh Vit Nam
Cc h thng iu khin qua mng (Networked Control Systems - NCS) c nh
ngha l cc h thng iu khin phn hi, trong vng phn hi c khp kn thng
qua mng truyn thng thi gian thc. Cc yu t c ngun gc mng xut hin trong
vng iu khin ca h thng nh hng n cht lng iu khin v n nh h
thng. Trong bi bo ny, chng ti xut hng tip cn thc tin trong gii quyt vn
iu khin h thng phn hi khp kn qua mng, trong vic iu khin i tng
ng hc c tr phn hi khp kn qua mng c thc hin vi s hiu chnh thch nghi
tham s iu khin.

22

Efficient Processing Of Regular Queries Over Fragmented XML Tree

Le Anh Vu1, Vo Hoang Hai2, Le Trung Hieu3, Nguyen Kim Long1, Tran Tan Tai1
1

Nguyen Tat Thanh University, 2Informations Technology College, 3Duy Tan University,

This work is about the processing of regular queries over the very large XML trees
which are fragmented over a shared-nothing parallel database system (SNPDS for short).
SNPDS is a system of machines connected to each other by high-speed links. The
fragments which are sub-trees of XML tree are stored on machines. The partial
processing approach is the most popular and famous algorithm for processing regular
queries on SNPDS. The query is sent to and evaluated partially at each machine. The
parallelism reduces the waiting time, but there are many unnecessary operations to be
computed. Our algorithm is also based on the partial evaluation, but unnecessary
operations are restrained by tree index and structural indexes. Two types of unnecessary
fragment operations are defined. The unnecessary fragment operations: type 1 are
unreachable operations that are determined by pre-processing on the tree index. The
unnecessary operations type 2 return no result. These are restrained by pre-processing on
the structural indexes of the fragments. Since the tree- and the structural indexes are
small, our algorithm overcomes the existing algorithms according to criteria of the
waiting time or the total processing and communication cost

Enhance WSN lifetime based on Optimizing Cluster formation by

distance and energy
Ngo Manh Dung1, Dinh Quang Huy2, Nguyen Kim Khanh2, Nguyen Thuc Hai2
1

VNU Hanoi, 2Hanoi University of Science Technology

There have been many research papers improved LEACH routing algorithm to
prolong the lifespan of wireless sensor networks but that is not enough that we still have
to improve LEACH routing protocol to get better result in WSN lifetime. In this paper,
we improve LEACH routing protocol to use energy efficiency to prolong the lifetime of
wireless sensor networks, called LEACH-FFC (Free to Fix LEACH Cluster). LEACH FFC implements the clusters in two different states are: freely to fix clustering and after a
number of rounds, when the number of clusters in WSN is proved to be optimal number,
BS will fixed that number of clusters at that round and the next rounds, there is no reclustering in WSN to save energy. The selection of Cluster Heads then will be performed
by criteria function, called fc. fc function selects CH based on the consideration of
residual energy of nodes required greater than the average residual energy of the whole
network and the distance from the candidate Cluster Head node to BS [3]. The simulation
results show that our proposed algorithm is approximate 12% energy efficiency more
than LEACH - DE algorithm and 22% compared to LEACH algorithm in terms of energy
saving and wireless sensor networks lifetime.

23

Exchange rate forecasting using Hidden Markov Model

Th Kim Chi
The University of Finance and Business Administration
Analysising and forecasting time series are an area of interest in the present time.
There are many different methods have been introduced to analyze and predict time
series for instance Autoregression, Moving Average model, Artificial Neural Network
and Fuzzy Logic. This paper presents Autoregression, Autoregression Moving Average
model, Hidden Markov model and Diffirential Evolution Algorithm for forecasting a
number of foreign curriencies. Prediction results are evaluated by statistical standards as
the coefficient of determination R2, mean square error, and mean square percent error.

Gii php bo v an ton thng tin cho cc mng ni b ca c quan

nh nc v doanh nghip c kt ni vi Internet da trn cng ngh
o ha
Nguyn i Vit, Nguyn Tn Tn Tht V, Nguyn Duy Khnh
Vin Cng ngh thng tin, HQG H Ni
Cc mng LAN c s dng ph bin, c kt ni vi Internet, khng an ton i
vi vic thm lu thng tin thng qua nhng ngi dng Internet bn trong v nhng
ngi lm vic lu ng t xa. Chng ti xut mt gii php mi da trn mt giao
thc c bit kt hp vi cng ngh o ha mc ng dng. Cc t th nghim tin
hnh chng t rng gii php c th ngn chn cc c gng chuyn thng tin t mng ni
b ra Internet v cc m c t Internet vo mng ni b bi nhng ngi dng Internet
bn trong v nhng ngi lm vic lu ng t xa. Gii php ny cho php tit kim ti
hn 80% chi ph so vi cc gii php ang c ngh s dng v bo m mc an
ton cao hn.

Gii php sinh d liu th cho ng dng tng tc

L Thanh Long1, Nguyn Thanh Bnh1, Ioannis Parissis2
1

HBK Nng, 2Grenoble INP LCIS

Pht trin cc ng dng tng tc l hot ng phc tp v gy ra li do kha cnh

tng tc ngi-my. Kim th cc ng dng ny l c bit quan trng v i hi nhiu
n lc. T ng ho sinh d liu kim th c th gim chi ph ng k pht trin v nng
cao cht lng ca ng dng. Hin nay, kim th da vo m hnh ang thu ht rt nhiu
nh nghin cu tham gia. Trong bi bo ny, chng ti xut phng php sinh ca kim
th cho cc ng dng tng tc da trn ngn ng m hnh ha kim th. Phng php
ny c th c t ng ha d dng v sinh cc ca kim th thch hp cho ng dng
tng tc.
24

Gii phng trnh Navier-Stokes bng cng ngh mng n ron

t bo CNN
V c Thi1, Chu B V2
1

H CNTT&TT Thi Nguyn, 2Trng C ngh C in v Xy dng Bc Ninh

Bo co ny trnh by vic ng dng cng ngh mng n ron t bo vo gii

phng trnh thu lc Navier-Stokes. y l h phng trnh o hm ring khng dng
phc tp vi 3 n hm, mi n hm l hm ba bin mt bin thi gian v hai bin khng
gian. Bo co chia lm 4 phn: phn 1 gii thiu khi qut bi ton c hc thu lc v
phng trnh Navier-Stokes; phn 2 gii thiu v kin trc v m hnh ton hc, in t
ca mng n ron t bo; phn 3 trnh by v phng trnh Navier-Stokes vi cc rng
buc ca iu kin bin v iu kin ban u. Phn tch h phng trnh Navier-Stokes
tm mu cho vic thit k mng CNN. Ci t m phng tnh ton trn Matlab; phn
cui cng l kt lun v hng pht trin

Gii quyt mt s vn thc t khi pht trin ng dng trn nn thit

b MS Kinect
on Th Hng Giang, V Hi, Trn Th Thanh Hi
i hc Bch Khoa H Ni
Thit b Microsoft (MS) Kinect ngy cng c s dng rng ri trong cc ng
dng th gic my, tng tc ngi my, robot dn ng Khc vi cc thit b Timeof-flight camera t tin trc y, Kinect c u im l gi r nhng vn cung cp d
liu v su ng thi vi nh RGB phn gii chp nhn c. Tuy nhin Kinect
c thit k ng kn c v phn cng v phn mm, do pht trin ng dng trn
Kinect thng gp mt s vn kh khn nh: khng tng ng gia ta hnh nh
v su, nhiu v li o trong nh su Bi bo ny s trnh by mt s hng gii
quyt nhng vn cn bn ny, to nn tng pht trin cc ng dng trn thit b Kinect.
u tin, chng ti gii thiu v phn cng Kinect v cc b th vin m h tr Kinect,
c bit l b th vin m OpenKinect. Tip theo, chng ti trnh by phng php cn
chnh, sa mo, lm khp (Kinect Calibration) d liu hnh nh v su. Khai thc
thng tin v su l mt trong nhng im mnh ca Kinect, chng ti s trnh by
phng php s dng nh su tch nn, ng dng trong bi ton pht hin c ch
tay nhm h tr trong vic nhn dng trong cc bi ton tip theo. Kt qu tch c so
snh nh gi vi phng php s dng d liu nh RGB truyn thng, cho thy u vit
vt tri ca thit b Kinect trong gii quyt vn tch i tng ra khi nn trong cc
ng dng th gic my tnh.

Gii thut iu khin t ng thit b ko ct sng

L Mnh Hi
H Cng ngh Tp. H Ch Minh
25

Ging ko ct sng iu khin t ng l thit b c ch to theo cc tiu chun

tng ng thit b ngoi nhp. Ngoi cc thit k c kh c chnh xc cao, thit b
cn c lp trnh m bo hot ng an ton v chnh xc. m bo tnh chnh xc
khi lc ko thay i thng xuyn, thit b c trang b gii thut Chnh Gi - B do
Vin Vt l Y Sinh nghin cu pht minh. Gii thut ny cho php thit b t c lc
ko cn thit trong nhng khong thi gian t trc v gi n nh lc ko t ln bnh
nhn trong sut qu trnh iu tr. Bi bo ny trnh by cc ni dung chnh ca gii thut
Chnh-Gi - B ni trn

Giao thc xuyn lp Phy-Mac cho mng v tuyn hp tc phn tn

Hong Quang Trung, Bi Th Thanh Xun
i hc CNTT&TT Thi Nguyn
Truyn thng hp tc ngy cng c ng o cc nh nghin cu quan tm do
nhng u im vt tri m n mang li. Tuy nhin, c nhiu cch tip cn khc nhau
cho lnh vc ny. Trong bo co ny, chng ti xut mt thit k giao thc xuyn lp
PHY-MAC cho mng v tuyn hp tc phn tn. Trong giao thc xut, chng ti quan
tm n bi ton la chn nt chuyn tip v phng php truyn dn hp tc hiu qu,
thch hp vi yu cu ca truyn thng a phng tin vi tc cao v tr thp.
nh gi giao thc xut, chng ti tin hnh thng qua phn tch l thuyt v m
phng trn my tnh s dng matlab. Kt qu m phng cho thy giao thc ca chng ti
hot ng tt hn so vi mt s giao thc trc y v thng lng v tr trung bnh
gi tin.

Gom cm d liu web video theo hng tip cn early fusion cho
c trng vn bn
Nguyn Quang Phc, Nguyn Hong T Anh, Ng c Thnh, L nh Duy4
Multimedia Communications Laboratory, University of Information Technology HCM
Gom cm kt qu tm kim video l bi ton nhm gip ngi dng xc nh c
cc video clip m h quan tm mt cch hiu qu hn. Cc nghin cu gom cm video
trc ch yu tp trung khai thc tng t c trng hnh nh ca d liu video
cho chnh xc khng cao. Tuy nhin, bn cnh c trng hnh nh th c trng vn
bn cng mang nhiu thng tin ng ngha gip tng chnh xc gom cm. Do , trong
bi bo ny, chng ti xut mt phng php kt hp a c trng vi cch kt hp
mi cho bi ton gom cm video nhm tng chnh xc gom cm. Cc th nghim c
tin hnh trn kt qu tm kim video ca YouTube vi phng php th nghim theo
cch kt hp mi cho kt qu tt hn.

26

H thng khuyn ngh cng vic

1

Phm Minh Chun , L Thanh Hng2, Trn nh Khang2, Cao Xun Bch2
1

Khoa CNTT - H SPKT Hng Yn, 2Vin CNTT & TT - i hc BKHN

H thng khuyn ngh l cng c h tr ra quyt nh, nhm mc ch cung cp cho

ngi s dng nhng gi v thng tin, sn phm, v dch v ph hp nht vi yu cu
v s thch ring ca tng ngi trong tng tnh hung hoc yu cu c th. Bi bo ny
trnh by h thng khuyn ngh cng vic bng cch s dng phng php pht hin ch
n da trn m hnh xc sut ton hc kt hp vi k thut da trn lc cng tc

H thng phn tch quan im xc nh xu th nng t mng x hi

Trinh Th Vn Anh
Hc Vin Cng ngh Bu chnh Vin thng
Trong nhng nm gn y, phn tch quan im trn tp d liu ca mng x hi l
bi ton ang thu ht nhiu nh nghin cu. Trong bi bo ny, chng ti ci t mt h
thng t ng xc nh cc ch chnh ang c ngi dng tho lun trn mng x
hi. truy vn c cc tin nhn (tweets trn twitter) hay cc tin ng (posts trn
facebook) chng ta cn phi c cc t kha ch , cc t ny c t ng trch ra t
cc tiu ca rt nhiu cc bi bo mng Vit. Hu ht cc trang bo mng Vit hin
nay lin tc cp nht cc xu th nng trong nc v quc t. xy dng c h thng
ny, chng ti coi nh cc xu th nng c trn mng x hi v trn cc trang bo mng l
tng t nhau, bi v chng u c ngi dng Vit a ln. Chng ti dng m hnh
LDA (Latent Dirichlet Allocation) a ra phn phi ch ti liu-ch v ch - t.
Cui cng dng gii thut hc my SVM (Support Vector Machine), Nave Bayes v
Maximum entropy phn loi quan im ngi dng.

H thng rt trch s kin trn vn bn sinh hc

Huynh Huu Nghia1, Ho Bao Quoc2
1

H Lao ng - X hi (CSII), 2H Khoa hc T nhin, Tp. H Ch Minh

Trong bi bo ny chng ti trnh by mt gii php rt trch s kin sinh hc t

vn bn da trn hng tip cn lai ghp gia my hc v lut. H thng ny c s
dng tham gia gii quyt bi ton GE trong BioNLP Shared Task 2013. Hiu qu ca h
thng c nh gi trc tuyn ca Shared Task c o F l 52.50.

H thng thc ti tng cng s dng thng tin ng cnh t

bng k hiu n
Ng Ngc ng Khoa, Trn Minh Trit
FIT, HCMUS
27

Tng tc ngi my l lnh vc nghin cu nhm khng ngng ci tin nhng

phng php v th thc tng tc gia ngi dng vi cc h thng tnh ton nhm
cung cp cho ngi dng giao din tng tc hiu qu hn vi nhng tri nghim ngi
dng th v hn, t nhin hn. Bi bo xut mt dng marker trong sut vi mt ngi,
s dng tia sng thu c t cc n LED hng ngoi c b tr theo mt th t xc
nh trc phc v mc ch xc nh thng tin ng cnh hoc nhn bit i tng
trong cc h thng tng tc thng minh ni chung hoc h thng thc ti tng cng
khng gian trong nh ni ring m vn m bo c tnh t nhin i vi ngi s dng.

H thng tm kim bi bo khoa hc CSPubGuru

Vn Tin, Hunh Ngc Tn, Ng c Thnh, L nh Duy, Dng Anh c
Phng Th Nghim Truyn Thng a Phng Tin, H CNTT Tp. H Ch Minh
Trong bi bo ny, chng ti gii thiu CSPubGuru, h thng h tr cng ng
nghin cu trong vic tm kim cc bi bo thuc chuyn ngnh khoa hc my tnh. D
liu ca h thng c thu thp v tch hp t nhiu ngun vi nhiu phng thc khc
nhau m bo tnh y v thng nht. H thng bao gm 3 module chnh: (1) rt
trch v tch hp thng tin cc bi bo khoa hc t nhiu ngun khng ng nht , (2)
module tm kim v hin th thng tin kt qu trc quan (3) cc chc nng h tr tm
kim nng cao nh khuyn ngh, tm kim bng ngn ng t nhin. Hin ti, tp d liu
ca h thng bao gm 5.2 triu bi bo ca hn 1.5 triu tc gi, trong chnh xc
trong vic gii quyt nhp nhng tn tc gi t 98, 39%. Bn cnh tp d liu ca h
thng c th d dng truy cp phc v cho cc nhm nghin cu lin quan.

H thng tra cu thng tin tuyn sinh i hc HUFLIT

bng ting ni
Trn Khi Thin, Vn Th Quc, Nguyn Phm Bo Nguyn,
Nguyn V Kiu Anh, V Thanh Hin
Khoa CNTT, H Huflit
Bi bo gii thiu h thng iVoiceServer - ng dng trong cc h hi p thng tin
qua mng in thoi (PSTN). H thng c th hiu c cc cu lnh ting ni ca ngi
dng, gip cho vic tra cu thng tin tuyn sinh ti i hc Huflit bng ting ni ting
Vit thng qua mng in thoi. im c bit ca h thng l c kh nng phn tch c
php v ng ngha ca cc cu lnh ting ni sau khi c nhn dng bi thnh phn
nhn dng ting ni. iVoiceServer bao gm cc thnh phn chnh nh sau: thnh phn
giao tip mng in thoi; thnh phn nhn dng ting ni ting Vit; thnh phn x l
ngn ng t nhin v thnh phn tng hp ting ni ting Vit. Theo hiu bit ca chng
ti, y l h thng u tin ti Vit Nam thc hin vic tch hp c ch x l ngn ng
t nhin vo cc ng dng ting ni. iu ny gip cho cc ng dng ting ni tr ln
thng minh hn, c th giao tip vi con ngi bng ngn ng t nhin vi chnh xc
28

cao v tc x l nhanh. H thng qua thc nghim t chnh xc cao v thn thin
vi ngi dng l minh chng r nt cho tnh thc t ca nghin cu.

H thng t vn thi trang DAFashion

Nguyn c Anh, Trn nh Khang
Vin Cng ngh thng tin v truyn thng, i hc Bch khoa H Ni
Thi trang l nhu cu thit yu ca con ngi. Vic la chn mt trang phc ph
hp ph thuc vo nhiu yu t khc nhau: dng ngi, tui, ... cng vi cc yu t
mi trng : thi tit, sng, nhit ... c nhng website t vn thi trang, nh trn
trang web fashionbeans.com[2] nh thit k Matthew Ward a ra cch chn la trang
phc theo dng ngi, hay trn wikihow Maluniu, Chaosc, David, Teresa [3] a ra cch
chn mt trang phc khc nhau theo nc da v mu tc ... Mt trang phc c la
chn l s tng ha ca nhiu yu t, v d, trang phc c th ph hp vi dng ngi
nhng rt c th khng ph hp vi iu kin mi trng xung quanh... Thm vo
nhiu thng tin c biu din di dng gi tr ngn ng, v d ph hp, tng i ph
hp H thng DAFashion c xy dng vi mc nh t vn cho ngi dng xem
mt trang phc vi c im v mu sc, kiu mu s ph hp nh th no i vi ngi
dng. Thng tin v cc yu t tc ng c biu din trong min gi tr ngn ng i s
gia t, phng php x l da trn cc k thut suy din v tch hp vi cc gi tr
ngn ng.

Improving localization precision of visual SLAM using Kalman filter

Nguyn Quc Hng1, V Hi1, Trn Th Thanh Hi1, Nguyn Quang Hoan2
1

Vin MICA- HBK H Ni, 2Khoa CNTT- H SPKT Hng Yn

This paper describes a Visual SLAM (Simultaneous Localization And Mapping)

system developed on an intelligent system. The proposed system aims to support
navigation services to visually impaired people in indoor environments. Toward this end,
we utilize the Fast Appearance-Based Mapping (FABMAP) algorithm that is an
appearance-based place recognition method. Although the FABMAP is reliable in the
outdoor scenarios, it still needs further improvements in indoor environments where the
place recognition is still a hard problem. Therefore, two improvements are proposed.
Firstly, we propose a scheme to learn discriminative scenes from experimental
environments. This is to build a robust visual dictionary for FAB-MAP algorithms.
Secondly, we utilize a Kalman Filter to update position of the vehicle. The Kalman Filter
keeps track of an estimate of the uncertainty in the robots position and also the
uncertainty in the recognized scene that has seen in the environments. By this way, a
feasible navigation on a mobile robot is up and run. We do not mean this is a perfect
solution, what we mean is that mobile robot could serve a more reliable navigation
service to blind/visually impaired people

29

Intelligent Traffic Management System for Hanoi City

Phm Hng Quang
Center for Informatics and Computing
Bo co gii thiu tng quan v thit k h thng iu khin giao thng thng minh
cho mng li ng giao thng trn a bn thnh ph H Ni ang c trin khai lp
t trong nm 2014. Mt s m hnh ton hc v trin khai tnh ton ti u ha p dng
trong iu khin giao thng thnh ph s c trnh by.

Interactive Image Retrieval with SVM Active Learning

Ng Trng Giang1, Ng Quc To2
1

Trng HDL Hi Phng, 2Vin Cng ngh Thng tin

Trong tra cu nh da trn ni dung, phn hi lin quan l cng ngh thng c
s dng thu hp khong cch gia c trng mc thp v khi nim mc cao. Mc
ch ca n l ci thin hiu qu tra cu thng qua vic hc vi cc iu chnh ca ngi
dng trn cc kt qu tra cu. Mc d c quan tm rng ri, nhng cng ngh phn hi
lin quan thng phi i mt vi mt vi hn ch nht nh. Mt trong s cc hn ch r
nht l i hi ngi dng phi lp i lp li mt s bc trc khi thu c cc kt qu
tm kim c ci thin. iu ny to ra qu trnh khng hiu qu v thiu hp dn cho
cc ng dng tra cu trc tuyn. Trong bi bo ny, mt m hnh phn hi lin quan hiu
qu cho tra cu nh da trn ni dung c xut. Trc ht, mt ng bao quyt
nh c hc thng qua SVM lc cc nh trong c s d liu. Sau mt o
tng t cho vic sp hng cc nh c gn nhn s c tnh ton da trn vic tch
hp gia gi tr ca hm phn lp SVM vi gi tr ca hm tng t ca nh c gn
nhn so vi nh tuy vn. Cc kt qu th nghim trn tp d liu chun ch ra tnh
hiu qu ca phng php xut.

Khai ph cc th con ph bin

on Vn Ban1, Nguyn Hin Trinh2
1

Vin Cng ngh thng tin, 2H Cng ngh thng tin & truyn thng

Khai ph th con thng xuyn l mt vn ang c nhiu quan tm trong

khai ph d liu. th l mt m hnh chung biu din cho d liu c cu trc v
ang c s dng trong nhiu lnh vc khc nhau, nh tin ha v tin sinh hc. M hnh
khai thc t c s d liu th c nhiu th thch khi thc hin cc qu trnh nh i
snh th con, xc nh nhng th con no l ph bin ca mt th xc nh, ...
thng c phc tp cao. Trong bi bo ny, chng ti gii thiu thut ton FSGM ci
tin khai ph th con thng xuyn, trong s dng mt chng trnh tm kim
cc nh c i snh trc (danh sch nhng) trong mt khung th i s. Thut

30

ton c pht trin nhm mc tiu lit k cc th con ng vin tt hn, kim tra tnh
ph bin ca cc th con hiu qu hn.

Khai thc c s d liu Freebase theo ty chn ca ngi dng

Phm Huy Hong, Bch Ngc Sn
H Bch khoa H Ni
Freebase l mt c s tri thc m rt ln, c to ra theo hnh thc ng gp ca
cng ng ging nh Wikipedia. tng Freebase c cc nh nghin cu trong lnh
vc d liu web a ra ln u tin vo nm 2000 da trn khi nim "web tri thc"
(knowledge web). Cho n nm 2010, Freebase c cng ty Metaweb qun l v lng
d liu t n con s 20 triu mc (topic). nh gi cao tm quan trng ca cch
tip cn mi ny, Freebase c Google mua li t Metaweb vo thng 6/2010 v tip
tc pht trin Freebase cho n nay. Da trn nn tng l khi nim cc i tng d liu
web, vic khai thc thng tin trn Freebase c thc hin thng qua cc Freebase API
chy trn giao thc HTTP. Phng php ny p ng yu cu truy vn d liu thng
thng, tuy nhin nhc im l khng cho php ty bin theo tng ngi s dng, hoc
theo tng ng dng cn truy vn n Freebase. Trong bi bo ny chng ti xut mt
hng tip cn mi truy vn d liu Freebase c tnh n kh nng ty bin theo tng
ngi dng. Mt cch vn tt, h thng cho php ngi dng duy tr mt th nh
ngha mong mun (user's preference graph). Tip theo, ngi dng s dng Freebase API
truy vn d liu Freebase. im khc bit y l thay v tr v kt qu cho ngi s
dng nh m hnh Freebase API thng thng, h thng s s dng th mong mun
ca ngi s dng iu chnh kt qu truy vn, hoc tip tc thc hin cu truy vn
mi. Qu trnh ny s c tin hnh lp li mt s ln t c ch n l d liu
tm kim ph hp vi mong mun ca ngi dng

Khng gian kha trong m ha xo trn ting ni

La Hu Phc, Nguyn Hng Quang, Dng Phc Phn
Hc vin K thut Mt m, Ban C yu Chnh Ph
Trong h thng m ha xo trn ting ni, tn hiu c m ha thng qua sp xp
li d liu ting ni s dng hon v. Hiu qu xo trn, c nh gi nh l r cn
li (Residual Intelligibility), ph thuc vo s sp xp li. Hai tham s c th s dng
nh gi s thay i v tr ca hon v, l bc thay th (Order of Displacement-OD) v
khong cch hon v trung bnh (Mean Permutation Distance-MDP). iu kin r
cn li thp l MDP c gi tr ln nht v OD nh nht bng 1. Trn c s , khng gian
kha b co li. Trong bi ny trnh by cch tnh MDP ln nht v khng gian kha tng
ng vi OD bng 1.

31

K thut loi sm gi tin theo hai chiu da trn cy cn bng bo v

tng la trc cc tn cng DoS
Nguyn Mnh Hng1, V Duy Nht2
1

Phng Sau i hc - HVKTQS, 2Cc C yu - BTTM

Trong cc h thng mng CNTT hin nay tng la l mt thit b khng th thiu
cho mc ch bo m an ton cho h thng. Vi vai tr l thit b kim sot tt c cc
kt ni vo ra mt mng nn tng la c t v tr kt ni duy nht gia mng cn
c bo v vi mng bn ngoi. Nng cao tc phn loi v x l gi tin trn firewall
s nng cao c thng lng trao i d liu gia mng ni b vi mng bn ngoi v
trnh c tnh trng qu ti ca firewall trong cc trng hp c th. lm c iu
ny th mt tng c s dng l da vo c im ca b lc hay tnh cht ca
cc lung thng tin i qua firewall nhm hn ch thp nht cc thao tc trn mt gi tin
trong qu trnh phn loi, chnh l vic loi b sm gi tin. Mt s k thut loi b
sm gi tin trong h thng tng la c xut nh: k thut to tp gi tr ph
(Field Value Set Cover - FVSC), k thut s dng cy nh phn t hiu chnh theo di
tin t (Self Adjusting Binary Search on Prefix Length-SA-BSPL), k thut s dng cy
nh phn t hiu chnh da trn thng k theo di tin t(Statistical Splaying Filters
with Binary Search on Prefix Length - SSF-BSPL). Trong bi bo ny chng ti thc
hin phn tch cc im mnh yu ca cc k thut ni trn v xut k thut loi sm
gi tin theo hai chiu da trn cy cn bng. K thut xut c so snh vi cc k
thut khc bng thc nghim.

K thut tra cu nh cy dc liu da vo ni dung phc v cho pht

hin, qun l v khai thc
Nguyn Vn To, Nguyn Vn Hun, L Triu Tun
H Cng ngh thng tin v Truyn thng - H Thi Nguyn
Bi bo ny xut p dng k thut tra cu nh v cy dc liu theo ni dung s
dng du hiu nh phn ca nh nh xc nh vc t c trng, biu din v trch rt c
trng v tnh tng t nhm h tr cho cng tc tm kim, nhn dng v pht hin v
cy dc liu. ng thi, xut pht trin ng dng c s dng k thut tra cu nh cy
dc liu vo phc v cho vic qun l, khai thc v duy tr mt cch c hiu qu cc
ngun cy dc liu ca Vit Nam. Kt qu xut ny s gp phn gip cho cc nh
qun l, nh dc liu c c mt cng c hu ch nhm theo di, thng k, nhn dng
v qun l cy dc liu mt cch hiu qu.

Lm vic cng tc t xa trong m phng tin hc cc h thng phc tp

Nguyn Trng Khnh1, H Tng Vinh2, Marilleau Nicolas3
1

Khoa Cng Ngh Thng Tin, i Hc in Lc, 2Vin Tin hc Php Ng, HQG H
Ni, 3UMMISCO 209, Institut de Recherche pour le development
32

Trao i kin thc, tng v kt qu l mt hot ng thng xuynv cn thit

trong cc d n nghin cu. Mc tiu nghin cu ca chng ti l tm hiu v xut
mt hng i mi cho cc hot ng cng tc nghin cu trong cc d n nghin cu lin
quan n m hnh ha v m phng cc h thng phc tp. Cc m hnh v chng trnh
m phng c xem nh l cc i tng dng chung, c s dng v vn hnh bi
mt nhm cc nh nghin cu phn b nhiu v tr a l khc nhau. Tuy nhin hin
nay, phn ln cc chng trnh m phng u l nhng ng dng n ngi dng. Do
chng ti xut mt phng php cho php chuyn i nhng chng trnh m
phng hin nay thnh nhng ng dng a ngi dng. Phng php ny c tch hp
vi cc cng c cng tc ph bin (v d nh hi tho trc tuyn) v cng c chuyn
dng cho php cc nh nghin cu ti cc v tr khc nhau cng s dng chung cc
chng trnh m phng v thc hin cc th nghim qua mng Internet. Bi bo ny s
gii thiu phng php chuyn i ny.

Mining information dependencies between attribute sets in a relation

Nguyn Minh Huy1, Nguyn Huy c1, Nguyn Thanh Tng2
1

Trng CSP Trung ng, 2 Trng H Lc Hng

In this paper we present an information-theoretic approach to mining dependencies

between sets of attributes in a given relation instance. We describe the dependence of a
rule based on conditional entropy of consequent given antecedent, and using the entropy
of a rule to describe its complexity. This allows us to discover rules with a high statistical
dependence, and a low complexity. The problem of redundancy in this context is also
investigated, and we present two techniques to prune redundant rules. An efficient and
scalable algorithm is proposed, which exploits the inclusion-exclusion principle for fast
entropy computation. This algorithm is empirically evaluated through experiments on
synthetic and real-world data.

M hnh h thng qun l tri thc nhm to u th cnh tranh cho

doanh nghip
V Xun Nam1, Trng Vn T2
1

H Cng ngh thng tin v truyn thng, 2H Kinh t Quc dn

Tri thc c xem l mt trong nhng yu t gp phn to nn thnh cng v qun

l tri thc tr thnh mt chin lc cnh tranh hiu qu nht ca doanh nghip (Nonaka,
2011). Nhiu cng trnh khoa hc xut m hnh qun l tri thc theo cc trng
phi l thuyt khc nhau nh: l thuyt thng tin, l thuyt tri thc, kinh t tri thc, h
thng thng tin, h chuyn gia, Tip cn theo l thuyt tng quan v h thng, bi bo
xut m hnh h thng qun l tri thc nhm to u th cnh tranh cho doanh nghip.

33

M hnh nhn dng ging ni ting Vit trong iu khin theo gc

t ring bit
o Anh Nguyn, V c Lung, Nguyn Thi n
Trng i hc Cng ngh Thng tin - HQG HCM
Bi bo xut mt m hnh mi cho nhn dng ging ni ting Vit da trn thut
ton qui hoch ng v m hnh Markov n. T vic quan st thy s khc bit ca ting
Vit so vi ting Anh l mi t n ting Vit l mt m thanh ring bit. Chnh v vy
m hnh chng ti xut s da vo nhn dng tng t. Theo mt cu lnh s qua
giai on tch t (dng sng m thanh), tip theo da vo b d liu hun luyn mu
nhn dng tng t ny v cui cng a vo b phn tch kt qu hiu chnh cu cn
nhn dng. S t vng c a ra nhn dng v hun luyn l 10 t, tng ng vi
10 ch s. D liu hun luyn c thu m t 4 ngi, trong mi trng gn nh khng
c nhiu v tc c cu lnh khong 0.3s n 0.7s. Kt qu nhn dng cu lnh trung
bnh t chnh xc l 92, 94% vi thut ton quy hoch ng, v 97, 76% vi m hnh
Markov n.

M hnh phn cp cho d bo lng ma

Nguyn Hi Thanh1, Thanh Ngh 2, Hunh Xun Hip2
1

V KHCN v Mi trng, B GD&T, 2Khoa CNTT-TT, H Cn Th

Trong by vit ny, chng ti trnh by m hnh phn cp hiu qu d bo lng

ma t ngun d liu kh hu ca SEA-START. Thay v s dng cc m hnh d bo
truyn thng ch vi mt m hnh hi quy, m hnh phn cp c xy dng qua hai giai
on: hun luyn m hnh my hc phn lp xc nh mt ngy thuc mt trong cc
lp l khng ma, ma nh, ma va, ma to v ma rt to; tip n tng ng vi mi
lp, xy dng m hnh hi quy d bo lng ma. Kt qu thc nghim trn tp d
liu thu thp t ngun SEA-START cho thy rng m hnh d bo phn cp lun tt hn
cc m hnh hi quy n nh hi quy tuyn tnh, k lng ging, cy quyt nh, my hc
vc t h tr. M hnh phn cp xy dng da trn Bagging cy quyt nh d bo chnh
xc nht lng ma trong ngy. Ngoi ra, m hnh d bo phn cp ny c th c ng
dng gii cc bi ton d bo tng t mi trng trong thc tin.

M hnh tnh ton chi ph pht hnh phn mm s dng yu t ri ro

da trn m hnh tnh ton tin cy Pham-Nordman-Zhang
Nguyn Hng Cng, Hunh Quyt Thng
Vin Cng ngh Thng tin v Truyn thng, H Bch Khoa H Ni
Hin nay c rt nhiu cch thc khc nhau tnh ton chi ph pht hnh phn mm
nhm hng n mt gi tr ti u ca qu trnh pht trin. Trong bi bo ny, cc tc gi
34

s dng m hnh tnh ton chi ph pht hnh s dng yu t ri ro da trn m hnh tnh
ton tin cy. Pht trin m hnh Pham-Nordmann-Zhang [4, 6], chng ti tin hnh
thc nghim vi mt b d liu thc t NTDS [4]. Trn c s kho st cc s liu thc t
ti M v Vit Nam, chng ti tin hnh phn tch v nh gi nh hng ca cc tham
s nh chi ph cha li, chi ph ri ro, thi gian cha li trung bnh n thi im pht
hnh ti u T^* v tng chi ph pht hnh ti u E[T^*].

M hnh t hp ti u h tr bi ton vn hnh mng trm pht sng

BTS. p dng th im h thng BTS mng Viettel ti khu vc H Ni
Khu Minh Cnh1, Trng nh Minh c2, H Nguyn Cc Phng3,
Trn Vn Hoi1
1

i hc Bch Khoa Tp.H Ch Minh, , 2H Nng lm Tp.H Ch Minh, 3Trng Cao

ng Kinh T K thut Ph Lm Tp.H Ch Minh

S pht trin ca mng li in thoi di ng Vit Nam hn 10 nm tr li y

l rt ln. Trong s pht trin, nhng vn ti u tng cht lng dch v lun tm tng.
Trong , vic tm kim li gii b tr iu hng pht sng BTS ti u l iu cn thit
nhm tit kim nng lng v gim bt nhiu sng, nht l i vi cc th. T d liu
khong hn 1600 ct pht sng BTS ca Viettel phc v in thoi khu vc H Ni cho
thy h thng BTS rt dy c v cn s phn b pht sng a l hp l. Bi vit xut
m hnh s dng thut ton x l tp c lp (independent set) ca th m hnh ha
vic ti u ha da trn nh hng pht sng hnh hc 2D ca cc BTS

M hnh tri thc ton t v ng dng xy dng h c s tri thc

v dng in mt chiu
Vn Nhn, Nguyn nh Hin
Trng i hc Cng ngh thng tin, HQG - HCM
Biu din tri thc ng vai tr rt quan trng trong vic xy dng cc h thng
thng minh. Hin nay, c nhiu phng php hu hiu biu din tri thc nh: mng
ng ngha, h lut dn, mng tnh ton. M hnh tri thc v cc i tng tnh ton
(COKB) rt hiu qu trong vic thit k c s tri thc ca cc ng dng. Trong thc t,
mt dng tri thc kh ph bin l tri thc vi cc ton t cng cc quan h tnh ton trn
n, c bit l cc min tri thc tnh ton, chng hn nh tri thc v ai s tuyn tnh, tri
thc v hnh hc gii tch. Tuy nhin, trong m hnh COKB cng nh cc m hnh biu
din tri thc khc, mt s vn lin quan n thnh phn ton t vn cha c gii
quyt nh: c t ton t, tnh cht ca ton t, rt gn biu thc. Trong bi bo ny,
chng ti s trnh by mt m hnh thu gn ca m hnh COKB biu din cc tri thc c
cha thnh phn ton t gia cc i tng trong tri thc, gi l tri thc ton t. Trn c
s m hnh ny, chng t cng s thit k cc thut gii trn my tnh cho vic gii quyt
cc bi ton trn m hnh. T , m hnh ny c vn dng c t mt phn ca
35

kin thc v dng in mt chiu v xy dng mt h thng h tr gii t ng mt s

dng ton trong min tri thc ny.

M phng a tc t nh gi cht lng Quy hoch m my

L Quyt Thng1, Mai Yn Trinh2, V Ngc Cm T2, V Hong T3
1

i hc Cn th, 2i hc Cu long, 3Cao ng Kinh t - K thut Cn th

Cng ngh Tnh ton m my ngy cng tr nn hu ch mt cch r rng hn,

l: tit kim ti nguyn tnh ton nhng vn c kh nng m bo cht lng dch v
(QoS). V vy vn Quy hoch m my theo hai tiu ch: Tit kim v Cht lng; s
c vai tr quan trng nhm h tr nhu cu cung cp cc dch v trc tuyn trn nn Tnh
ton m my. Bi bo ny trnh by gii php Quy hoch m my da trn m hnh
Mng cc hng ch, sau nh gi cht lng bng phng php m phng a tc t.
Gii php ny c ng dng trn tnh hung Quy hoch h thng ng k hc phn
trc tuyn trong chng trnh o to theo tn ch ca i hc Cu Long.

M phng hin trng ngp a hnh do nc bin dng ti vng ng

bng Sng Cu Long
Hong Ngc Hin1, Triu Yn Yn1, Phan Vn Sa2, Hunh Xun Hip3
1

i hc Bc Liu., 2Trung tm Kh tng Thy vn Bc Liu, 3Nhm nghin cu lin

ngnh DREAM-CTU/IRD, i hc Cn Th

Trong bi bo ny, t tnh hnh nc bin dng din bin phc tp hin nay. Chng
ti xy dng mt m hnh m phng hin trng ngp a hnh do nc bin dng vng
ng bng sng Cu Long, th im ti tnh Bc Liu. Qu trnh ngp a hnh do nc
bin dng c m phng trn b mt v din tch a hnh ca tnh Bc Liu chy trn
nn cng c m phng GAMA. Kt qu m phng cho ra cc bn ngp v bn
nguy c ngp, thng k din tch ngp. M phng qu trnh ngp a hnh do nc bin
dng qua cc giai on trong qu kh (t nm 1992 n nm 2012). a ra kch bn m
phng ngp a hnh do nc bin dng trong tng lai (t nm 2013 n nm 2050).

M phng s pht tn ry nu di tc ng ca cn trng thin ch

v mi trng t nhin
ng Th M Linh, Trng Xun Vit, Hunh Xun Hip
i hc Cn Th
Bi vit gii thiu m hnh m phng s pht tn ca ry nu di s tc ng ca
cn trng thin ch trn ng rung. Ngoi thin ch, bi vit cng cp n s tc

36

ng ca yu t sinh thi v t nhin ln qu trnh sinh trng, pht tn ry. Kt qu m

phng ca m hnh h tr tch cc vic phng v chng ry. M hnh c xy dng trn
nn tc m phng a tc t s dng bn a l GIS nn c th m phng trc quan s
pht tn ry v xc nh c mt ry theo khng gian v thi gian. Kt qu nghin
cu c kim nh da vo s liu ry nu ca tnh ng Thp.

M phng trng quan st ca ngi lnh trong chin trng o

Kin Nguyn Trung, Anh L, Lim Nguyn Huy
Vin Cng ngh m phng, Hc vin K thut qun s
Kh nng quan st c ca ngi lnh ng vai tr quan trng n tnh hiu qu
tc chin ca ngi lnh . Trong tc chin, la chn v tr c kh nng quan st c
ln nht s gip ngi lnh kim sot tnh hnh tt nht. Trong cc ng dng m phng,
vic tnh ton th trng quan st ca ngi lnh rt phc tp v n thng b che khut
bi rt nhiu cc i tng khc. Bi bo ny trnh by cch tip cn v a ra thut ton
m phng vng quan st c ca ngi lnh trong mt khu vc tc chin c tnh n s
che khut do a hnh v cc vt cn khc. y l c s cho vic nh gi tnh hiu qu
ca mt phng n trong cc ng dng m phng h tr tc chin.

M phng xm nhp mn trn h thng sng ti vng ng bng

Sng Cu Long
Hong Ngc Hin1, Dng Vit Hng1, Nguyn Hiu Trung2, Hunh Xun Hip2
1

Khoa Cng ngh Thng tin, i hc Bc Liu, 2Nhm nghin cu lin ngnh DREAMCTU/IRD, i hc Cn Th

Trong bi bo ny, chng ti xy dng mt m hnh m phng hin trng xm nhp

mn trong qu kh v kch bn xm nhp mn cho tng lai vng ng bng sng Cu
Long th im ti tnh Bc Liu. Qu trnh xm nhp mn c m phng trn h thng
sng/knh v trn din tch ca tnh Bc Liu (thit k t GIS) chy trn nn m phng
GAMA. Kt qu m phng s cho ra cc ng ng mn, din tch mn, thng k
mn trung bnh gia cc vng, thng k xm nhp mn qua cc giai on 2000 2010
v 2011 2020.

Modeling and simulating of air filtration in selected dimensional

fiber arrays
Le Thi Thuy Van, Dao Van Tuyet
Institute of Applied Mechanics and Informatics

37

Air purification is an essential process for human consumption, medical, or for

industrial applications. In general, the method commonly used is filtration. Undesirable
chemicals, biological contaminants, suspended solids will be filtrated from contaminated
water. The knowledge obtained from modeling these complex systems will provide a
better prediction of filter efficiency and filter lifetime. Stochastic differential equations
(SDEs) are applied in simulating the movement of suspended particles immersed in water.
The fluid velocity field is computed by a fluid solver in an irregular region containing the
fiber matrix. The obtained velocities field is then incorporated to the Langevin equations
to capture the Brownian motions of the suspended particles. Three most predominant
filtration mechanisms including interception, inertial impaction and diffusion
are simulated.

Mt cch tip cn mi cho bi ton kh nhp nhng ngha t Ting Vit

inh Ph Hng, Phm Thy Trang, Phm Th Hoa, Phan Tun Tip
Khoa Cng ngh thng tin, i hc Thy Li
Kh nhp nhng ngha t l bi ton la chn ngha thch hp ca mt t a ngha
trong mt ng cnh cho trc. Bi ton ny ng vai tr quan trng trong cc ng dng
ca x l ngn ng t nhin nh: Dch my, tm kim thng tin, lin kt thc th ...
Trong rt nhiu cc phng php tip cn gii quyt cho bi ton ny, hc my thng
k cho thy nhng u im ca n so vi cc phng php khc. Tuy nhin, vn cn
vi trng hp m m hnh hc my thng k cha th gii quyt c. Bi bo ny
xut mt phng php mi, trong chng ti s dng cc lut kt hp ci thin hiu
nng ca m hnh hc my thng k. Kt qu thc nghim cho thy rng, phng php
ny c chnh xc cao hn khi so snh vi mt vi phng php tt hin nay.

Mt gii php chuyn i giao din tnh Web RIA sang giao din
di ng
Nguyn c Huy, Nguyn Vn V, Trn Minh Trit
H Khoa hc T nhin - HQG Tp.H Ch Minh
Trong nhng nm gn y, lnh vc cng ngh Web c s pht trin mnh m, c
bit l s pht trin ca cc cng ngh RIA(Rich Internet Application) nh: Adobe
Flash/Flex, Microsoft Silverlight, JavaFX. Vi cng ngh RIA, cc nh pht trin Web c
th d dng hn trong vic pht trin nhiu ng dng c tnh tng tc cao v c giao
din tin dng v p hn trn mi trng web. Tuy nhin vic ti s dng ti nguyn
ca mt ng dng trn mt nn tng c th chuyn i sang mt nn tng khc l mt
vn kh khn. Bn cnh , cng vi s pht trin ca cc thit b di ng trn cc nn
tng nh Windows Phone, iOS, Android... ngng cng mnh m. V vic chuyn i t
ng hoc bn t ng t cc ng dng c tn ti trc t cc nn tng Web
RIA sang cc nn tng trn cc thit b ng gn nh l khng th thc hin c. Do ,
38

ni dung ca ti tp trung vo vic xut mt gii php v m hnh chuyn i giao

din tnh tng qut (CUI) t cc nn tng Web RIA sang cc nn tng thit b di ng
nh: Windows Phone, iOS, Android theo hng tip cn m hnh.

Mt k thut du tin theo tip cn hnh thi

Nng Ton1, Nguyn Minh Nht2, Nguyn c Mn2, H Tin Sung2,
Trng Tin V2, Hunh B Diu2
1

Vin Cng Ngh Thng Tin, 2i hc Duy Tn

Bi bo ny a ra khi nim bit t ngha nht di gc hnh thi. Bit t ngha

nht c hiu l bit t hoc khng c tc dng trong php ton hnh thi. Trn c s khi
nim bit t ngha a ra, bi bo xut thut ton giu tin da vo bt t ngha nht
theo cch tip cn hnh thi. Thut ton c ci t v t ra hiu qu i vi nh
nh phn.

Mt k thut tng tc tnh ton bng cho hin th cc i tng 3D

trong thc ti o
Trnh Xun Hng, Trnh Hin Anh, Vn Thin, H Mnh Ton
Vin CNTT-Vin Hn Lm KH&CNVN
Bo co ny a ra mt cch phn chia bn bng da vo vic nh gi mc
chi tit ca tng khu vc trong phm vi xc nh. Da vo cc khu vc phn chia ny, h
thng ch phi cp nht li mt phn ca bn bng do c th gim thiu c thi
gian tnh ton bng cho cc i tng 3D c hin th. K thut c ci t th
nghim trn GPU s dng nn tng ha OpenGL 4.3 v t ra hiu qu i vi cc i
tng chuyn ng trong phm vi ca camera c nh.

Mt m hnh tru tng trong phn tch tnh kh t ca chng trnh

Nguyn Vn Tri, inh Quang t, Nguyn Trng Thng,
Nguyn Th nh Phng, Bi Th Th
Vin Cng ngh thng tin - Vin Hn lm Khoa hc v Cng ngh Vit Nam
ng dng k thut tru tng ha trong phn tch chng trnh (program analysis)
gip m rng phm vi x l ti cc h thng c khng gian trng thi ln. Cc k thut
tru tng ang c s dng ngy cng nhiu trong phn tch pht hin li chng trnh.
Qu trnh phn tch pht hin li mt chng trnh thng gn cht vi vic xc nh tnh
kh t (reachability) ca chng trnh . Nu tnh kh t c chng minh l ng
trn m hnh tru tng, l xp x ca chng trnh, th n cng ng trong chng trnh

39

thc do tnh bo ton ca php tru tng ha. Tuy nhin, s dng cc k thut tru
tng i khi lm mt i tnh chnh xc trong phn tch tnh kh t do mt s trng thi
b b qua, c bit khi c s xut hin ca cc vng lp. Mt s gii php hin thi
gii quyt vn ny bng cch s dng cc tp b chn di v cc hm xp hng
(ranking function). Gii php ca chng ti gii quyt vn theo mt cch tip cn khc,
khng s dng cc tp b chn di v hm xp hng. Thay vo , chng ti da trn
vic kim tra cc iu kin trn th chng trnh (program graph) ng vi h thng
thc, cc iu kin ny c kim tra t ng i vi m hnh tru tng.

Mt phng php chng tn cng tuyn tnh trong h thng iu khin

cng nghip
Nguyn o Trng, L Mnh Hng, Nguyn c Tm, La Hu Phc
Hc vin K thut Mt m
Bi bo phn tch nguyn tc hot ng ca cc thit b trong cc h thng iu
khin, vi nhng yu cu chnh xc cao, tc nhanh ca cc tn hiu t cc b cm
bin v b iu khin v t b iu khin n cc c cu chp hnh thng qua mng kt
ni khu vc trng. Phn tch m hnh mt s tn cng trong h thng iu khin c
bit l tn cng gi mo v tn cng DoS, t xut gii php s dng mt m AES
m ha bo mt thng tin iu khin v s dng hm bm xc thc. ng thi
xy dng c hai m-un pht hin tn cng v m-un phn ng khi pht hin b sai
lch thng tin iu khin gia cc thit b trong h thng iu khin cng nghip.

Mt phng php lc cng tc bng phng php hc chuyn giao

Th Lin, Nguyn Xun Anh, Nguyn Duy Phng
Hc vin bu chnh vin thng
Lc cng tc (collaborative filtering) l phng php d on quan im ca ngi
dng hin thi i vi cc sn phm ph hp da trn thi quen s dng sn phm ca
cng ng ngi dng c cng chung s thch. Hin nay, lc cng tc c xem l
phng php hiu qu c p dng thnh cng cho nhiu h thng thng mi in
t. Trong bi bo ny, chng ti xut mt phng php hc chuyn giao cho lc cng
tc bng cch thit lp hai c ch hc: hc t ngi dng n sn phm v hc t sn
phm n ngi dng. Hc theo ngi dng pht hin ra tp nhn phn loi tin cy
chuyn giao cho qu trnh hc theo sn phm. Ngc li, hc theo sn phm suy lun ra
tp s nhn phn loi chc chn chuyn giao cho qu trnh hc theo ngi dng. Hai qu
trnh hc tng tc v chuyn giao cc nhn phn loi chc chn cho nhau ci thin
kt qu d on v hn ch c nh hng ca vn d liu tha ca lc cng tc. Kt
qu th nghim trn trn cc tp d liu thc cho thy phng php xut ci thin
ng k cht lng d on so vi cc phng php hc kinh in.

40

Mt phng php tng cng nh vin thm da trn phn cm m

Nguyn Tu Trung1, V Vn Tho2
1

Vin Cng Ngh Thng Tin, 2Hc Vin Cng ngh Bu chnh Vin thng

Cc phng php tng cng nh da trn phn cm m cho nh vi cht lng

cao hn r rt so vi cc phng php truyn thng. Tuy nhin, hin ti, cc phng
php ny u gp vn vi nh vin thm kch thc ln, vn l nhc im c hu
ca thut ton phn cm m. Ngoi ra, cc phng php ny mi ch x l trn tng
knh nh nn khng bo tn c mu ca nh sau tng cng. Bi bo ny trnh by
mt thut ton tng cng nh mi da trn phn cm m c th khc phc c cc
nhc im trn ng thi kt hp tnh ngng t ng theo tng cm.

Mt phng php tra cu nh s dng vng thun nht v phn hi

lin quan
Nguyn Hu Qunh1, V Vn Hiu2, Ng Quc To3, Nguyn Th Thu H1
1

i hc in lc, 2i hc Hi Phng, 3Vin CNTT

Phn hi lin quan v tra cu nh da vo vng l hai cch hiu qu ci tin

chnh xc trong tra cu nh da vo ni dung. Trong bi bo ny, chng ti xut mt
phng php tra cu nh s dng phn hi lin quan v cc vng thun nht. Bng vic
trch rt t nh ra mt s vng mu thun nht v tnh tn sut xut hin ca cc vng,
chng ti chuyn vc t c trng ca nh v cc vc t trng s. Trn c s cc vc t
trng s c c, chng ti s dng tnh tng t gia hai vc t trng s v s dng
k thut phn hi lin quan. Chng ti thc nghim trn c s d liu nh gm 10.000
nh. Cc kt qu thc nghim ch ra rng k thut ny ci tin c hiu nng ca h
thng tra cu nh da vo ni dung so vi phng php FourEyes v CCH v cho kt
qu gn vi nhn thc ca ngi dng.

Mt s c trng tng quan ca cc cp cu song ng Anh-Vit v

mt m hnh dng cu thng k
Nguyn i Vit, Nguyn Tn Tn Tht V
Vin Cng ngh thng tin, HQG-HN
Dng cu thng k da trn tng quan gia di ca cc cp cu song ng.
Tng quan ny c gi thit nh l mt phn b xc sut dng Gauss. Chng ti
ngh s dng mt khi liu song ng Anh-Vit ln xc nh cc tham s ca phn b
ny vi cc o v di khc nhau theo k t, m v v t. Bng cc so snh hiu
nng ca phng php dng cu mi da trn m hnh thng k ny o ca di cu

41

tt nht c xc nh. Vic so snh phng php ny vi cc k qu ca Gale v Church

cng c tin hnh i vi mt s tp th. S ph thuc ca t l li vo kch thc ca
vn bn cn dng cng c kho st.

Mt s k thut ti u v kim th hiu nng p dng trong pht trin

ng dng trn Android
Hunh Quyt Thng1, Nguyn c Mn2, L Nam1
1

i hc Bch Khoa H Ni, 2i hc Duy Tn

Trong mi trng di ng, ng dng cn phi c kim th v ti u ha bi nh

pht trin nhm to ra cc sn phm mm cht lng, hiu nng cao vi chi ph thp nht.
Trong bi bo ny chng ti trnh by mt s k thut ti u m ngun v kim th hiu
nng trong pht trin ng dng di ng. C th, cc k thut c thc hin trn nn
tng di ng thng qua mt s kt qu thc nghim trn mt gi lp in thoi di ng
Android. Kt qu thc nghim cho thy cc k thut nh ti u m ngun, ti u b nh
s dng, a lung v ng b ha v s dng Android Native Development Kit (NDK) s
mang li hiu nng cho ng dng cao hn vi cc cch pht trin thng thng hin nay.

Mt thut ton nh tuyn gim thiu nh hng ca tn sc trong mi

trng mng OBS/EON
L Hu Bnh1, L Nguyn Bnh2, Hong Vn V3
1

Khoa Cng ngh Thng tin - Trng Cao ng Cng nghip Hu, 2Huawei
Technologies, European Research Center, 3Hc vin Cng ngh Bu chnh Vin thng
In elastic optical networks (EON), the signal channels are transmitted on the
lightpath with their carriers variable as well as their flexible spectral width. The bit rate of
each channel can also be able to be flexibly changed from 10 Gb/s to 400 Gb/s or beyond.
Furthermore the channels spacing can be 50, 25, 12.5GHz, and even 6.25GHz. Thus the
impact on transmission performance due to the linear dispersion and nonlinear effects on
interconnecting optical paths in elastic optical networks are critical. We present in this
paper the impact of the linear dispersion with regard to the performance of the elastic
optical networks operating under burst switching. An optimal burst routing algorithm is
then proposed to minimize such impacts. The results obtained by simulation show that
the proposed novel algorithm reduces the broadening due to the linear dispersion about
46% for the mesh network topologies. Keywords - Elastic Optical Networks, OBS,
Physical Impairment Routing, Linear Dispersion, Network Simulation. Tm tt. Trong
mng truyn ti quang EON (Elastic Optical Networks) , tn hiu d liu c truyn qua
mng bng cc knh quang c rng ph thay i linh hot. Tc d liu ca mi
knh c th thay i t 10 Gb/s n 400 Gb/s, hoc c th ln hn, khong cch gia cc
knh l 25 GHz, 12.5 GHz hoc 6.25 GHz. Khi tc truyn dn trn cc knh tng v
khong cch gia cc knh nh, nh hng ca cc hiu ng tuyn tnh cng nh phi
42

tuyn cn phi c xem xt n. Trong bi bo ny, chng ti trnh by cc kt qu

nghin cu v nh hng ca tn sc tuyn tnh n vic truyn d liu qua mng EON
s dng OBS (Optical Burst Switching). T , xut mt thut ton nh tuyn ti u
nhm gim thiu nh hng ca hiu ng ny. Kt qu m phng chng minh rng,
thut ton nh tuyn c xut khc phc mo tn hiu do tn sc khong 46% i
vi cc tp mng mt li.

Mt thut ton pht hin nh gi mo dng ct/dn s dng php bin

i DWT ng
Trn ng Hin1, Phm Vn t2, Trnh Nht Tin1
1

i hc Cng ngh, 2i hc Giao thng Vn ti

Trong bi bo ny chng ti xut mt php bin i ng kiu wavelet ri rc

(gi l DWT ng), php bin i ny c kh nng tp trung nng lng cao hn so vi
mt s php bin i DWT thng dng nh php bin i DWT Haar v DWT
Daubechies D4. Chng ti s dng php bin i ny xy dng thut ton mi pht hin
nh gi mo dng ct/dn. So vi mt s thut ton s dng php bin i DWT gn y
th thut ton mi bn vng hn trc cc php tn cng nh nn JPEG, thm nhiu, lm
m v kt hp cc php tn cng trn.

Mt tip cn kim chng chng trnh da trn sinh iu kin kim

chng v chng minh nh l
Trn Mnh ng, Nguyn Trng Thng, Nguyn c Giang, Trn B Hng
Vin Cng ngh thng tin
Phn mm ngy cng ng vai tr rt quan trng trong hu ht cc lnh vc ca i
sng x hi. Tuy nhin, c mt thc t l phn mm v quy trnh pht trin phn mm
ngy cng tr nn phc tp v t . Chnh v vy, nghin cu m bo cht lng phn
mm lun l mt trong nhng vn cp thit v thi s trong lnh vc cng ngh phn
mm. Bi bo ny cp n k thut kim chng chng trnh da trn s kt hp sinh
d liu kim chng v chng minh nh l t ng.

Nng cao hiu qu phn lp ung th bng kt hp la chn thuc tnh

v sinh thm phn t
Nguyn Mnh Cng, ng Xun Th
Khoa Cng ngh thng tin, HSP H Ni

43

Trong nhiu lnh vc thc t hin nay nh phn loi ri ro ngn hng, phn loi vn
bn, chun on bnh ang xut hin ngy cng nhiu d liu mt cn bng, trong s
lng cc phn t thuc mt lp chim s lng ln hn rt nhiu so vi lp cn li. i
vi nhng d liu ny, s khng cn bng nh hng rt ln n hiu qu phn lp, c
th phn loi c th thu c chnh xc cao trn lp a s nhng d dng b phn lp
nhm cc phn t thuc lp thiu s. D liu khng cn bng l mt trong nhng vn
kh v ang rt c quan tm trong lnh vc hc my v khai ph d liu. Nhiu gii
php c xut gii quyt vn trn, trong , thut ton SMOTE l mt
phng php ni ting v ph bin trong cc phng php sinh thm phn t nhn to
mi cho lp thiu s. Bn cnh , chng ti nhn thy trong mt s b d liu mt cn
bng c nhiu thuc tnh d tha, khng cn thit, khng c ngha d bo. Mt s bi
bo co ch ra nu loi b nhng thuc tnh ny i th s lm tng chnh xc trong
phn lp d liu mt cn bng. T , chng ti pht trin mt phng php mi kt
hp gim s thuc tnh v sinh thm phn t trong phn lp d liu mt cn bng. Cc
kt qu thc nghim trn b d liu thc t v phn lp ung th l leukemia v coloncancer cho thy phng php mi ca chng ti phn lp chnh xc hn vi o Gmean so vi phng php s dng d liu gc, SMOTE, hoc ch s dng la chn thuc
tnh. Thm vo , chng minh tnh hiu qu ca phng php mi, chng ti thc
nghim i vi b d liu chun mt cn bng breast-p, ionosphere, v satimage c ly
t ngun UCI. Nhng kt qu ny cng cho thy rng phng php ca chng ti t
c kt qu tt hn vi o G-mean. ng thi, vi vic s dng nh gi t-test ch ra
rng cc kt qu trn c ngha thng k vi p-value nh hn 0.05.

Nghin cu k thut gii m mm cho m LDPC

Nguyn Anh Tun
H cng ngh thng tin v truyn thng
K thut gii m quyt nh mm vi cc thut ton gii m lp cho php tng hiu
qu sa li i vi m LDPC. Tuy nhin vi cc phng php truyn thng vn tn ti
hiu ng sn li do cc vng lp ngn trong ma trn kim tra gy ra v thi gian gii m
kh ln. Bi bo ny trnh by mt k thut gii m mi trn c s ma trn kim tra
tng ng v thut ton thu phn tp i vi cc tia pha inh a ng my thu. Kt
qu m phng cho thy ci thin ng k li m ha v gim bt thi gian gii m.

Nghin cu phng php m xe t s dng m hnh gauss hn hp

v lung quang hc
Ng Quc To1, Nguyn Vn Cn2
1

Vin Cng ngh Thng tin, 2H K thut - Hu cn CAND

Nhiu phng php pht hin, phn loi v theo di i tng chuyn ng trong
video giao thng c pht trin trong nhng nm gn y. Mc ch ca bi vit ny l
44

trnh by phng php m s lng xe trong vng quan st gm: Th nht, tin hnh ci
tin phng php m hnh nn hn hp Gaussian thch ng tt vi s thay i nh sng
v nn ng. Th hai, kt hp phng php pht hin i tng chuyn ng bng
phng php hn hp Gaussian thch ng, lm sch khung hnh bng phng php loi
b bng v theo di, m s lng i tng da trn lung quang hc. Chng ti tin
hnh th nghim m xe vi phng php xut trn cc tp d liu video thu c t
mt s tuyn ng H Ni v ph cn. Kt qu thu c tng i chnh xc vi mt
xe thp trn cc ng cao tc.

Nghin cu phng php ging hng cu cho cp ngn ng Anh Vit

Nguyn Quang Huy1, Nguyn Vn Vinh2, Triu Hi Long3
1

Trng Cao ng ngh Vit - c Vnh Phc, 2H Cng ngh - HQG H Ni, 3i
hc S phm Thi Nguyn

Abstract Trong dch my thng k, kho d liu song ng l mt trong nhng nhn
t quan trng quyt nh cht lng ca h dch. xy dng kho d liu song ng,
ngoi phng php th cng truyn thng, ngi ta s dng cc phng php ging hng
cu t ng nhm rt trch mt cch t ng cc cp cu song ng t cc vn bn song
ng. Cht lng ca h dch t l thun vi kch thc kho d liu song ng. Vic xy
dng kho d liu song ng ln bng phng php th cng thng rt tn km thi gian
v chi ph. V vy, trong bi bo ny, chng ti xut mt phng php ging hng mi.
Phng php ny m rng t phng php ca Ma (2006) bng cch s dng bng cm
t song ng v xc sut tng ng c hc t ng t kho ng liu song ng tnh
tng t ca cc on vn bn tng ng. Chng ti tin hnh th nghim trn tp cc
vn bn song ng Anh-Vit. Cc kt qu th nghim cho thy phng php ny cho kt
qu kh quan v ng tin cy.

Nghin cu ng dng ch k s m v gii php m bo an ton thng

tin trong bi ton b phiu in t
H Vn Hng1, Nguyn Thnh Trung2, Hong Vnh H3
1

Ban C yu Chnh ph, 2H Cng ngh- HQG H Ni, 3H CNTT&TT Thi nguyn

Trong bi bo ny, nhm tc gi trnh by vn m bo an ton thng tin, cc

nguy c mt an ton thng tin, thc trng an ton thng tin trong giao dch in t ti
Vit nam, i su nghin cu thc trng bo m an ninh thng tin trong bi ton bu c
in t. Ngoi ra, bi bo cng nghin cu v h mt m, h tng kho cng khai, ch k
s, ch k s m, nghin cu ng dng ch k s m nhm m bo an ninh trong giao
dch in t, c th l trong tin in t v bu c in t. xut gii php tch hp ch
k s m vi c s h tng kho cng khai m bo an ton thng tin trong bu c
in t. Xy dng ng dng h thng b phiu in t trc tuyn s dng gii php m
bo an ton thng tin.
45

Nhn dng hot ng ca ngi bng in thoi thng minh

Nguyn Thng Ngc1, Bi Th Trang2, Nguyn Tun Linh3, Phm Vn Cng2
1

B phn Nghin cu v Pht trin, Cng ty Samsung, 2Hc vin Cng ngh BCVT,
3
Trng CKT Thi Nguyn

Bi bo ny xut phng php v h thng nhn dng hot ng ca ngi t d

liu cm bin gia tc c tch hp trong in thoi thng minh. Phng php nhn dng
ca chng ti c thc hin vi 4 bc: tin x l d liu cm bin, phn on, trch
chn c trng v phn loi. Hn th na, phin bn u tin ca h thng c trin
khai trn in thoi thng minh c th nhn dng c 6 hot ng ca ngi trong thi
gian thc. Chng ti tin hnh th nghim v nh gi phng php xut trn mt tp
d liu gm 6 hot ng t 17 ngi khc nhau s dng mt s thut ton hc my bao
gm: my vc t h tr, mng Bayes n gin, k lng ging gn nht, cy quyt nh, suy
din da trn lut, mng n ron. Qua nh gi bng phng php leave-one-subject out,
thut ton cy quyt nh (Decision Tree C4.5) cho kt qu tt nht vi 82% chnh xc
v 83% bao ph. Kt qu ny cho thy tnh kh thi ca nhn dng hot ng ca
ngi trong thi gian thc bng thit b di ng.

Nhn dng phng ng ting Vit s dng m hnh Gauss hn hp

Phm Ngc Hng1, Trnh Vn Loan2, Nguyn Hng Quang2, Phm Quc Hng1
1

Khoa CNTT H S phm K thut Hng Yn, 2Vin CNTT & TT HBK HN

Trong cc h thng nhn dng ting ni, yu t phng ng ca ting ni cn c

nhn dng c nh hng nhiu ti cht lng, hiu qu nhn dng. Nht l vi ting Vit,
mt ngn ng tn ti nhiu phng ng khc nhau vi cch pht m rt khc bit, nh
hng ca phng ng ti h thng nhn dng ting Vit ni cng r rt. Trong bi vit
ny, tc gi trnh by phng php nhn dng phng ng ting Vit theo phng thc
pht m s dng m hnh Gauss hn hp. Trong nghin cu ca mnh, tc gi s dng
m hnh GMM vi cc la chn, b sung cc tham s thch hp v th nghim nhn dng
thnh cng trn b d liu ghi m ting ni pht m lin tc i din cho 3 phng ng
chnh l Phng ng Bc, Phng ng Trung v Phng ng Nam. Kt qu ca nghin
cu c th ng dng trong cc h thng nhn dng t ng ting Vit ni nhm ci thin
cht lng, hiu qu nhn dng.

Nhn din t ly v t ghp ng lp cho bi ton tch t Ting Vit

Trn Ngc Anh1, o Thanh Tnh1, Nguyn Phng Thi2
1

Khoa CNTT, Hc vin KTQS, 2Khoa CNTT, HCN, HQGHN

46

Bi bo a ra phng php da vo lut v t in xc nh t ly v t ghp

ng lp ting Vit. tng chnh xc nh hai m tit k nhau trong vn bn c to
thnh mt t ly hay t ghp ng lp da vo cc c im ring bit ca chng: (a) i
vi t ly, hai m tit lin k ting Vit cn tun theo mt s lut ly (ip v i cho ph
m u, vn v du thanh); (b) i vi t ghp song tit ng lp, hai t n phi cng t
loi, l ng ngha hoc i ngha hoc c tng t theo nh ngha cao trong t in
VCL (Vietnamese Computational Lexicon); (c) trn c s , s dng cc lut m rng
cho vic nhn din cc t ly, t ghp hay thnh ng c ba hoc bn m tit. Th nghim
nhn din cc t ly mi ngoi t in VCL trn mt s kho ng liu t chnh xc 91,
02%; nhn din t ghp ng lp t 94, 40%; Khi th nghim vi tch t ting Vit,
vic nhn din t ly v t ghp ng lp lm tng chnh xc tch t vi cc o F1scores tng t 0, 15% n 0, 46%. y l hng tip cn mi, c gi tr thc t cao.

Noise suppression in depth map for improved background segmentation

Nguyn Vn Ti, V Hi, Trn Th Thanh Hi, L Th Lan
Vin nghin cu quc t MICA - H Bch Khoa H Ni
Noise suppression is a crucial problem. For this, in this paper, we propose a new
model of noise in depth map received from Microsoft Kinect. This model is based on the
stability of pixels during a duration of time. Using this model, the noise pixels then will
be detected and their values will be recovered using knowledge of measured values. In
order to evaluate the effectiveness and the robustness of the proposed denoising method,
we have conducted an extensive experiments in background segmentation application.
The experimental results show that thanks to the denoising step, the accuracy of
background segmentation is increased from 75% to 83%.

Numerical solution of a strongly mixed elliptic boundary value problem

in a semistrip
ng Quang 1, Trn nh Hng2
1

Vin Cng ngh Thng tin, Vin Hn lm KH&CN Vit Nam, 2HSP- H Thi Nguyn

Many problems of mechanics and physics are posed in unbounded (or infinite)
domains. For solving these problems one typically limits them to bounded domains and
find ways to set appropriate conditions on artificial boundaries or use quasi-uniform grid
that maps unbounded domains to bounded ones. Differently from the above methods we
approach to problems in unbounded domains by infinite systems of equations. Some
initial results of this method are obtained for some 1D nonstationary problems. Recently,
we have developed the method for an elliptic problem in a semistrip. Using the idea of
Polozhii in the method of summary representations we transform infinite system of threepoint vector equations to infinite systems of three-point scalar equations. In this paper we
continue to develop the method for a strongly mixed elliptic boundary value problem in a
47

semistrip, where there is one point of separation of boundary conditions on a unbounded

boundary. Numerical experiments show the effectiveness of the proposed method.

Optimizing the power consumption of embedded systems based on

reverse engineering and the CPU reconfiguration
V Vn Phc1, Phm Vn Hng2, Nguyn Ngc Bnh2
1

Phng sn xut phn mm TT CNTT VDC 2i hc Cng ngh, HQG H Ni

In this paper, we propose and deploy a new method to optimize the power
consumption of embedded systems based on reverse engineering and the processor reconfiguration. Basing oneself on the analysis of the power consumption of the
components in the processor, we build formulas for evaluating the power consumption
and propose the optimization model. Techniques of the reverse engineering are used to
decompile machine code into assembly code of a processor. We analyze assembly code
and the processor profile to find the functional units that are not used. Relying on the
analyzing results, the processor is reconfigured to optimize the power consumption.

Outage Performance of Cognitive SC/TAS Relay Network under Joint

Constraints
V L Qunh Giang1, Phm Hu Tng2, Quch Xun Trng3, Trn Hng1
1

Khoa CNTT - Hc Vin Qun L Gio Dc 2Khoa CNTT - H Xy Dng H Ni,

3
H CNTT v Truyn Thng, HTN

In this paper, we investigate outage performance of a cognitive cooperative

underlay network in which secondary transmitter (SU-Tx) sends signals to the secondary
receiver (SURx) through the help of a single relay (SR). Here, we assume that the relay is
equipped with multiple antennas and operates in the decode-and-forward mode.
Furthermore, the relay uses the selection combining (SC)/transmit antenna selection
(TAS)technique to process the signal. Given this setting, an adaptive transmit power
allocation policy for the SU-Tx and SR are derived. Accordingly, simulations for the
outage probability of the considered system is executed. Our numerical results will show
the impact of different channel mean power gains between primary user and secondary
user on the outage performance. Also, the impact of massive antennas at the SR on the
performance of the considered system model is addressed.

Phn tch xc sut nghn ca thut ton ci tin giao thc nh tuyn
AODV da trn tc t di ng bng phng php m phng
Cung Trng Cng1, V Thanh T2, Nguyn Thc Hi3
1

Trng Cao ng Cng nghip Hu, 2Trng HKH, H Hu, 3H Bch khoa H Ni

48

nh tuyn trong mng MANET v ang c nhiu nh nghin cu quan tm,

c nhiu nghin cu xut cc thut ton nh tuyn ci tin cho mng MANET
nhm nng cao hiu qu s dng ti nguyn mng. Hiu qu hot ng ca cc thut ton
nh tuyn thng c nh gi bng phng php m phng. Chng ti cng
xut hai thut ton nh tuyn ci tin s dng tc t di ng l MAR-AODV v MAR2AODV vi mc tiu gim xc sut nghn mng v phng php m phng c s dng
nh gi hiu qu hot ng ca thut ton. Tuy nhin, vn t ra l tnh n nh
ca cc thut ton thng qua kt qu m phng. Trong bi bo ny, chng ti phn tch
ph ca kt qu theo cc ln m phng khc nhau thy r tnh n nh ca kt qu m
phng ca thut ton, t xc nh phm vi thay i gi tr v xc sut nghn mng
theo mt lu lng u vo.

Phn tch kin ca nhn xt da trn phng php hc my

Trn Th Ngc Tho, Nguyn Ngc Kim Lin, Ng Minh Vng
i hc Tn c Thng
Cng trnh nghin cu ti Phn tch kin ca nhn xt (Sentiment Analysis)
da trn phng php hc my. Phn tch kin hoc khai thc tm l nhm mc ch
xc nh thi , kin nh gi l tch cc, tiu cc, hoc trung lp ca ngi s dng
i vi mt sn phm. y l mt cng trnh gip ch cho nhng nh sn xut bit c
mc hi lng ca khch hng v sn phm t c mc iu chnh thch hp.
Chng ti s dng phng php hc my ph bin l Support Vector Machine kt hp
vi th vin phn mm WEKA (Waikato Environment for Knowledge Analysis) xy
dng chng trnh trn nn web Java phn tch kin ca nhn xt ting Anh v mt
trong bn loi sn phm dnh cho n gii l m, ti xch, giy v nhn. Hin ti, chng
ti xy dng chng trnh vi tp hun luyn gm 300 nhn xt, tp kim tra gm 400
nhn xt v kt qu nh gi hiu sut t c i vi positive l Precision 89.3%,
Recall 95.0% v F-measure 92.1%; i vi negative l Precision 97.1.%, Recall 78.5% v
F-measure 86.8%; i vi neutral l Precision 76.7%, Recall 86.2% v F-measure 81.2%.

Pht hin chy sm da trn k thut x l nh

H i Dng, o Thanh Tnh
Khoa Cng ngh thng tin, Hc vin K thut Qun s
Chy c th gy ra thm ha rt ln v con ngi v ca ci vt cht nn t lu cc
nh khoa hc nghin cu, pht minh ra nhiu phng php t ng pht hin v cnh
bo chy. Phng php pht hin v cnh bo chy da trn k thut x l nh l mt
hng tip cn mi, c th b sung cho nhng mt hn ch ca cc h thng bo chy
hin c nh cho php s dng trong khng gian m, cung cp thm nhng thng tin hu
ch v m chy v c th a ra cnh bo sm. Bi bo ny trnh by mt phng php
pht hin v cnh bo chy sm da trn k thut x l nh bao gm phn tch s bin

49

i theo thi gian, phn tch cc im nh da trn mu sc v phn tch c tnh lay
ng ca m la pht hin v cnh bo chy. Lc x l gm cc bc: 1) phn
tch s bin i gia hai nh lin tip s dng phng php i snh theo h s tng
quan pht hin vng chuyn ng; 2) phn tch mu sc cc im nh trn vng
chuyn ng xc nh vng tim nng l m la, k thut phn tch bc ny s
dng phn lp Bayes trong khng gian RGB; v 3) phn tch c tnh lay ng ca m
la da trn s bin i v kch thc bao ca vng tim nng khng nh v a ra
cnh bo. Kt qu th nghim cho thy xut trong nghin cu ny gim c t l
cnh bo nhm v thi gian x l trung bnh mi nh so vi mt s nghin cu trc,
ng thi c th pht hin v cnh bo trong thi gian khong 20ms ngay sau khi m
chy xut hin trong khun hnh

Pht hin hnh vi gt u v ng dng trong bi ton li xe ng gt

Lm Thnh Hin1, Nng Ton2, Trn Vn Lng3, Trn Hnh1
1

H Lc Hng, 2Vin Cng ngh thng tin, VAST, 3Vin C hc v Tin hc ng dng

i cng vi s pht trin ca x hi, an ton giao thng l vn lun c t ra

v trong , pht hin li xe ng gt l vn rt c quan tm hin nay. Trong bi bo
ny, chng ti a ra mt tip cn pht hin li xe ng gt da trn hnh vi gt u vi
tiu ch la chn ti u mt vi thng s hnh dng c trng cho hnh vi gt u.
Phng php t ra hiu qu khi ci t th nghim tch hp trong h thng gim st
ngi li xe v cnh bo ng gt

Pht hin lut chui lin kt giao dch t c s d liu thi gian
Trng c Phng1, Vn Thnh2
1

Khoa CNTT, Trng CSP H Ni

Trung tm Thng tin v D bo kinh t x hi Quc gia, B K hoch v u t

Bi bo gii quyt bi ton pht hin cc lut chui lin kt giao dch t c s d
liu tc v thi gian, lut ny a ra d bo c th v thi gian xy ra gia cc s kin
trong mt chui. Thut ton SITARM c xut da trn vic pht trin thut ton
CHARM, mt thut ton tm tp ph bin hiu qu, kt hp ca s thi gian nhm gii
quyt bi ton trn. Kt qu th nghim thut ton mi SITARM cho thy tnh kh thi v
trin vng ca thut ton ny

Pht trin b tham s ca thut gii by ong ng dng cho bi ton

phn cm d liu
Nguyn Vn Hin1, Phan Cng Vinh2
1

Cao Thang College of Technology, 2Nguyen Tat Thanh University

50

Phn cm d liu l mt trong nhng bc ca qu trnh khai thc d liu, phn

cm d liu gip a ra nhng c im chung t cc thuc tnh ca d liu, phn cm
d liu c s dng nh mt bc tin x l cho cc thut gii khai thc d liu. Bi
bo ny trnh by vic ng dng thut gii by ong vo bi ton phn cm d liu. Cc
tc gi i su vo vic nghin cu cc b tham s cho thut gii by ong v xut b
tham s khi p dng gii bi ton phn cm d liu. Cc kt qu thc nghim cho thy
b tham s xut gip thut gii by ong hot ng tt hn nhiu so vi cc b tham
s khc.

Pht trin c ch x l cm t truy vn ting Vit cho h thng truy vn

thng tin tuyn dng da trn cc phng php tnh ton ng ngha
Phan Th Th1, Nguyn Tun ng2
1

Khoa CNTT, Trng C Cng ngh th c 2Khoa KHMT, H CNTT, HQG-HCM

Trc y, mt h thng truy vn thng tin tuyn dng nhn s c chng ti

nghin cu xy dng, h thng ny c kh nng phn tch v x l ng ngha cho mt s
lng ln cc dng cm t v t hp cm t truy vn ting Vit trong lnh vc tuyn
dng nhn s. Da trn h thng truy vn thng tin tuyn dng c xy dng, trong
nghin cu ny chng ti pht trin v m rng c ch x l ng ngha ca h thng
c c th x l thm nhiu dng cm t / t hp cm t truy vn ting Vit mi. Bi
bo ny tp trung vo vic gii thiu, th nghim v nh gi c ch x l ng ngha cho
cc dng cm t / t hp cm t truy vn ting Vit mi c b sung cho h thng.

Pht trin thng tin ngn iu cho h thng tng hp ting ni da trn
HMM dnh cho cc thng bo hng khng
Trn Lm Qun1, Phan ng Hng2, inh Anh Tun2, V Tt Thng2
1

Vin NC hng khng Vit Nam - Vietnam Airlines, 2Vin Cng ngh thng tin-VAST

Cht lng ca mt h thng tng hp ting ni u ph thuc trc tip vo nhng

c tnh ca tng min lnh vc m h thng s dng. tng lnh vc, nh th thao, gii
tr li c nhng cu trc ng php c trng. Cu trc ng php chim mt vai tr
quan trng trong bi ton phn tch thng tin ngn iu ca tp cu thuc tng min lnh
vc. Trong bi bo ny, chng ti s phn tch cc c tnh thng tin ngn iu cho ting
Vit trn lnh vc hng khng, t chn ra nhng c tnh quan trng nht lin quan
n sc thi ca cc thng bo ph dng ca ngnh hng khng

51

Pht trin thut ton thy vn mng ng ph bn vng i vi php

bin i co gin bn
Phm c Th1, ng Vn c2
1

i hc Hng Vng, Vit Tr, Ph Th, 2Vin Cng ngh thng tin - VAST

Lc thy vn s bn vector dng mng ng ph c xut bi Yu-Chi

Pu & I-Chang Jou c tnh n v tnh bn vng cao, c kh nng chng c cc tn cng
nh php gin lc Douglas Peucker, php ct xn, o th t cc nh, thm nhiu,
Tuy nhin, khi bn vector c co gin (scaling) theo mt t l no , tng ng cc
ta ca cc im c thay i theo t l , th kha b mt l b rng cc vnh
khng cn dng trch c d liu thy vn c na. Trong bo co ny chng ti
xut mt thut ton ci tin thy vn mng ng ph b sung tnh bn vng ca
lc thy vn i vi php bin i co gin bn . Ngoi ra, thut ton ci tin
xut c th gip cho giu thy vn c nhng vo bn s hiu qu hn v cng c
phc tp nh thut ton gc.

Pht trin thut ton tm tp thng xuyn trn c s d liu ln

Nguyn Hu Trng1, Nguyn Th Minh Chu2, Phm Ngc Cng3, Mai Th Hin2
1

H Nha Trang, 2HV Hi Qun - Nha Trang 3Trng S quan khng qun - Nha Trang

Qu trnh nghin cu v khai thc d liu c tng kt bi Q. Zhao v B. Goethals.

T thut ton AIS nm 1993, n PP_Growth - 2006 u a ton b d liu vo b nh
trong x l. Hn ch ca cc thut tn ny l khng th gii c khi d liu ln. Nm
2008, Jia-Yu Dai v nhm nghin cu a thut ton M2TQT, dng k thut nn d liu
rt gn khng gian khai thc, c Indu Maurya v Ashish Maurya - 2012 pht trin
v c nhng kt qu tt v nn d liu. Hu ht cc thut ton xut, khi tm tp
thng xuyn vi ngng ti thiu mi, cng vic phi lm li t u. Cng vic s rt
tn km khi d liu ln. Bi bo ny xut mt thut ton mi tm tp thng xuyn
trn c s d liu ln. Thut ton gm hai bc: u tin, t chc li d liu ti u
lu tr v x l; tip theo l tm tp thng xuyn theo ngng ti thiu trn d liu t
chc li. Hai bc ca thut ton l c lp. D liu sau khi t chc li c lu tr di
dng mi, vic tm tp thng xuyn theo ngng ti thiu cho trc ch x l trn d
liu mi, c tc x l nhanh hn.

Phng php nh gi tng t vn bn trong ting Vit

Dng Thng Long, Trng Tin Tng, Trn Tin Dng
Vin i hc M H Ni
Hin nay vn nghin cu trong x l ngn ng t nhin ca ting Vit c mt
s kt qu nht nh, tuy nhin so vi cc kt qu nghin cu trong ting Anh rt ln v

52

a dng th trong ting Vit cn nhng hn ch nht nh, c v phng php lun v ng
dng. Vi mong mun gp thm nhng nghin cu v lnh vc mi m ny, bi bo s
da trn mt s phng php x l ngn ng t nhin trong ting Anh cng b, a ra
mt tip cn cho vic nh gi tng t trong vn bn ting Vit bng cch kt hp
mt s nh gi tng t trong vn bn ting Anh. Trn c s , bi bo a ra cc
phn tch, nh gi i vi kt qu th nghim c trin khai trn mt s ti liu
nht nh.

Phng php nh gi ri ro tn dng hiu qu da trn la chn c

trng v ti u ha by n
H Vn Sang1, Nguyn H Nam2, L ng Nhc3
1

Khoa HTTT Kinh T - Hc Vin Ti Chnh, 2VNU, 3Hc Vin Bo ch v Tuyn truyn

Vic s dng cc k thut khai ph d liu xy dng m hnh cho im tn dng

v ang l ch nng trong nhng nm gn y. Mt m hnh phn lp hiu qu s
gip cho ngi s dng a ra nhng quyt nh hp l thay v da trn kinh nghim.
Nhn chung, d liu tn dng l ln v c tnh cht l va tha, va thiu thng tin. La
chn c trng cho php tm ra nhng c trng tt nhm ci tin chnh xc phn lp.
Bi bo ny tm hiu v cc phng php la chn c trng sau xy dng mt
phng php la chn c da trn ti u ha by n. nh gi thc nghim trn cc b
d liu tn dng cho thy tp cc c trng c chn gip cho vic phn lp chnh
xc v hiu qu hn.

Phng php d phng bo v tch cc m bo tin cy ca h thng

tnh ton
L Quang Minh1, L Khnh Dng2, Nguyn Anh Khim3
1

Vin Cng ngh thng tin, HQG H Ni, 2 H Cng ngh thng tin v Truyn thng,
HTN, 3 H Cng nghip Tp. H Ch Minh

Bi bo ny trnh by nhng phng php d phng bo v nhm m bo tin

cy ca h thng tnh ton. Ni dung chnh ca bi bo l phn tch tin cy ca cc h
thng vi cc phn t cu thnh khng phc hi, trnh by phng php tnh tin cy
ca h thng da trn cu trc ca n. Trong bi bo trnh by 3 phng php: d phng
tnh, d phng ch ng, d phng tch cc nh l s kt hp gia d phng tnh v d
phng ch ng. p dng 3 phng php ny vo mt cu hnh h thng phn cp c
th (Hierarchical Computing Systems), qua rt ra bi hc kinh nghim trong vic la
chn phng php d phng m bo tin cy ca h thng.

53

Phng php lc thch nghi trong tch ting tim v ting phi
Phng Trung Ngha, Nguyn Thnh Trung, Nguyn Th Dng, on Th Hin
i hc Cng ngh Thng tin v Truyn thng
Nghe ting tim l phng php khm lm sng truyn thng v r tin. Tuy nhin
ting tim thu m vo my tnh thng b nh hng bi ting phi v ngc li. Bi bo
ny trnh by phng php s dng b lc thch nghi vi thut ton c lng trung bnh
phng ti thiu tch ting tim v ting phi t m thanh thu c t ng nghe. Sau
khi so snh hiu qu ca b lc vi cc tham s thc nghim khc nhau, bi bo a
ra b tham s thc nghim ti u tch ting tim v ting phi. Cc kt qu nghin cu
c th c p dng trong cc h thng h tr chn on lm sng dng ting tim.

Phng php ma trn pht hin ph thuc hm trong c s d liu

V Quc Tun1, V Chnh Thu2
1

Trng Cao ng Hi Dng, 2Cng ty Thng tin di ng VMS

Pht hin ph thuc hm t mt c s d liu l mt k thut khai ph d liu quan

trng. Trong bi bo ny, chng ti trnh by mt thut ton pht hin cc ph thuc hm
s dng ma trn tng ng. u im ca phng php ny l cc ma trn c th tnh
ton mt cch n gin v hiu qu.

Phng php marketing in t da vo quan h gia cc khch hng

s dng lut kt hp
Nguyn Vn Hun, Nguyn Th Hng, L Thu Trang, Nguyn Th Kim Tuyn
Khoa HTTTKT- H Cng ngh thng tin v Truyn thng - H Thi Nguyn
Vn doanh thu mi n v kinh doanh lun c ch trng, v tng doanh thu
s m bo cho s tn ti ca mi n v. Mt trong nhng phng php c s dng
tng doanh thu l p dng cc chin lc marketing, Tuy nhin, chin lc
marketing hin nay m cc n v kinh doanh s dng vn ch yu l marketing truyn
thng, c mt s n v p dng chin lc marketing in t. Nhng chin lc
marketing in t m cc n v kinh doanh s dng mi ch dng li vic nghin cu
v quan h gia n v kinh doanh vi khch hng. Bi bo ny xut mt phng
php mi trong hot ng marketing in t da vo nghin cu v qun tr mi quan h
gia cc khch hng vi nhau s dng lut kt hp nhm h tr xy dng k hoch kinh
doanh trong vic cung cp v nh gi hng ha, dch v ph hp vi nhu cu v s thch,
th yu ca ngi tiu dng. T , gp phn tng doanh s bn hng v dn n tng
doanh thu bn hng, m bo kinh doanh bn vng trn c s xy dng mi quan h cht
ch gia n v kinh doanh vi khch hng, gia cc khch hng vi nhau.

54

Phng php pht hin s suy gim vn tc ca xung siu m trong mi

trng b tng cc khoan nhi da trn logic m
Ng Hong Huy1, Nguyn Trnh Nguyn2, Nguyn Th Dng3, Nguyn c Hi4,
Ng Trn Anh1, Xun Thiu5, Nguyn Tu Trung1
1

Vin Cng Ngh Thng Tin, Vin Hn Lm Khoa Hc v Cng Ngh Vit Nam, 2i hc
Nng lm TP. H Ch Minh, 3Cng ty C phn T vn xy dng VietDelta, 4Cng ty C
phn Phn mm v Cng ngh ng dng, 5i hc Giao thng Vn ti

Phng php siu m xc nh ng nht ca b tng cc nhi da trn i

lng biu thi gian n (FAT- Biu thi gian n (first arrival time), biu nng
lng (E-energy) v vn tc truyn sng trong b tng (V-velocity) c p dng rng
ri pht hin khuyt tt, nh gi cht lng b tng v c chun ho thnh tiu
chun ASTM D6760. Cc gi tr vn tc truyn xung siu m theo cc su khc nhau
ca cc khoan nhi c thu thp v tnh ton theo phng php CSL (Crosshole Sonic
Logging). Bo co ny trnh by mt phng php mi pht hin t ng s suy gim
vn tc ca xung siu m l mt tiu chun quan trng nh gi ng nht ca
cc khoan nhi , da trn logic m. Cc gi tr vn tc ny sau khi ly mu c phn
loi thnh cc tp m v ri rc ha trn cc hm lin thuc. ng vi mi tp m c
phn hoch xc nh gi tr vn tc i din tng ng c tnh theo phng php im
trng tm. Gi tr vn tc ny dng so snh vi cc gi tr vn tc xung siu m c
ly mu theo su ca cc khoan nhi. Vic so snh s cho kt lun ti cc v tr ly
mu c suy gim vn tc hay khng v tr v kt qu gi tr suy gim nu c.

Phng php tng hp ting ni lai ghp chn n v-HMM i vi d

liu thch nghi
Phan ng Hng1, Phan Thanh Sn2, Dng T Cng2
1

Vin Hn Lm KH&CN Vit Nam, 2Khoa CNTT- i hc K thut L Qu n

Phng php tng hp ting ni da trn m hnh HMM c th to ra ting ni t

c s d liu thu m hn ch. Tuy nhin, vi c im ca mt m hnh thng k, tng
hp ting ni da trn HMM thng to ra ging ni b trung bnh ha v tham s v gy
ra nghe hiu thp hn so vi ting ni t nhin. Phng php tng hp ting ni da
trn ghp ni n v c th khc phc vn trung bnh ha, song phng php ny li
yu cu mt c s d liu thu m ln v thng xut hin cc im t gy khi ghp ni
n v. Nghin cu ca chng ti s a ra mt phng php kt hp gia tng hp ting
ni HMM c s vi phng php ghp ni vi mc ch nng cao thng minh,
tng t v t nhin ca ting ni tng hp. Bn cnh , nhng c im khi p
dng phng php lai ghp trn min d liu ting ni thch nghi vi dung lng rt nh
cng c trnh by v nh gi.

55

Phng php trit nhiu tn hiu s dng lut cc tiu ha pht hin li
(minFDR) trn c s bin i wavelet ri rc dch khng i
Huy Khi, V Thy Hng
i hc Cng ngh thng tin v Truyn thng
K thut trit nhiu tn hiu s dng bin i wavelet c nghin cu nhiu
trn th gii. Hu ht cc nghin cu tp trung vo cch c lng v t ngng mm
trn c s ca Iain Johnstone v David Dohono. Bi bo ny trnh by phng php trit
nhiu tn hiu s dng lut cc tiu ha tc pht hin li (minFDR rule)trn c s bin
i wavelet ri rc dch khng i(TIDWT).

Positive boolean dependency in the database model of block form

Trn Minh Tuyn1, Nguyn Xun Huy2, Trnh nh Thng3
1

B mn Tin hc, i hc Cng on, 2Vin Cng ngh thng tin, Vin Hn lm khoa
hc v Cng ngh Vit Nam, 3Trung tm Tin hc, i hc S phm H Ni 2

The report proposed the concept of positive Boolean dependency in the database
model of block form, proved the equivalence of three types derived: logically derived,
derived by block, derived by block not exceeding two elements, the necessary and
sufficient criteria of the derived types, the members problem... In addition, the properties
related to this concept while the block degenerate into relationship has been stated and
proved here.

Qu trnh tin ha ontology trong h thng a tc nhn

Hunh Nht Pht1, Hong Hu Hnh2, Phan Cng Vinh1
1

Nguyen Tat Thanh University, 2Hue University

Bi bo m t cch kim tra nhiu ontology min v th gii thc, xc nh cc sai

lch c th xy ra gia cc phin bn khc nhau ca mt ontology, chn mt s sai lch
kim tra, xy dng thut ton cc biu gii quyt cc trng hp sai lch v kt
hp cc thut ton chn on ORS (Ontology Refinement System) trong a ra l
thuyt khng i snh. M rng l thuyt khng i snh cho ORS thng qua vic chn
on v ci tin h thng nhm nng cao kh nng ca n chn on v tinh chnh a
dng hn cc sai lch, do cc tc nhn tng tc c th c c hi tt hn v trao i
thng tin. Bi bo thc hin nghin cu bng cch a ra s nh gi v phn tch trong
s cc trng hp khng i snh ban u v m rng ORS c th gii quyt cho mi
trng hp m n gp phi thng xuyn trong qu trnh trao i thng tin.

56

Quy np cy quyt nh da trn entropy v tp th dung sai

Phm Quang Dng1, Nguyn Thanh Tng2
1

i hc Cng ngh GTVT, 2i hc Lc Hng

Quy np cy quyt nh l mt trong nhng k thut khai ph d liu hiu qu, ph

bin nht v c ng dng trong nhiu lnh vc. Cho n nay c rt nhiu thut ton
quy np cy quyt nh c xut. Tuy nhin, cc thut ton ny cha gii quyt
c mt cch tha ng vn gi tr thiu trong cc h thng tin. Trong bi bo ny
trc tin, bng vic s dng quan h dung sai trong l thuyt tp th m rng, chng ti
trnh by khi nim t l li thng tin th (rough information gain ratio), sau gii thiu
mt thut ton quy np cy quyt nh da trn khi nim ny. Cc v d tnh ton cho
thy cy quyt nh xy dng c bng phng php xut c cu trc n gin hn,
cc tp lut sinh ra d hiu hn so vi thut ton C4.5.

Real-time Interface Model Building

Nguyn Trnh ng1, ng Vn Hng2, Trng Anh Hong2
1

i hc Dn Lp Hi Phng, 2 i hc Cng ngh - HQG H Ni

Biu din hu hn v kt hp cc thnh phn phn mm ng vai tr quan trng

trong thit k v m hnh ha h thng thi gian thc da trn thnh phn. Trong bi bo
ny, chng ti biu din hu hn Giao din thnh phn phn mm thi gian thc c quan
h u vo vi u ra bng cch m rng My hu hn trng thi vi Hm gn nhn
logic tn t cp 1 v cc rng buc thi gian c gi l My hu hn trng thi c
gn nhn (vit tt l LFSM). Bi bo thnh cng trong vic m hnh ha cc m hnh
vi php ghp ni tip v song song ca cc My hu hn trng thi c gn nhn; m
hnh c th cm ca cc My hu hn trng thi c gn nhn vi m hnh mi trng
ca n, v mt s tnh cht khc nh: Tnh cht giao hon trong vic ghp song song, tnh
cht kt hp trong vic ghp tun t, tnh cht lm mn v s lm mn c chia s ca
cc giao din thnh phn ca cc My hu hn trng thi c gn nhn. ng thi, da
trn l thuyt ny cc h thng thi gian thc da trn thnh phn hon ton c m
hnh ha bng My hu hn trng thi c gn nhn, sau chng ti dng cc m hnh
ny kim chng vi cc c t ca n v s kim chng c th thc hin giai on
u ca tin trnh pht trin t cc phn nh ca h thng.

Rt gn thuc tnh trong bng quyt nh thay i s dng khong cch

Nguyn Long Giang1, V c Thi2, Nguyn Th Lan Hng3
1

Vin CNTT - Vin Hn lm KH&CN VN, 2Vin CNTT - HQG HN, 3Hc vin Cnh st

Trong hai thp k tr li y, ch nghin cu v rt gn thuc tnh thu ht

ng o cng ng nghin cu v tp th tham gia. Tuy nhin, hu ht cc phng php

57

rt gn thuc tnh u thc hin trn cc bng quyt nh c nh, khng thay i. S
dng o khong cch, trong bi bo ny chng ti xut cc thut ton tm tp rt
gn ca bng quyt nh khi b sung v loi b i tng. V khng phi thc hin li
thut ton trn ton b tp i tng nn cc thut ton xut gim thiu ng k
phc tp v thi gian thc hin.

Semantics of a probabilistic tuple relation calculus language

Dao Van Tuyet, Le Thi Thuy Van
Institute of Applied Mechanics and Informatics
Nowadays, database systems are increasingly being used in advanced applications,
and they must handle uncertainties in the data that they store. Such uncertainties arise
from many factors, such as measurement errors and cognitive errors. As much, many
researchers have focused on defining comprehensive uncertainty data models of
uncertainty database systems. However, existing uncertainty data models do not
adequately support some applications. Moreover, very few works address uncertainty
tuple calculus. In this paper we extend a probabilistic data model for representing
uncertain information. We also extend a probabilistic tuple calculus language and its
semantics, some theorems of probabilistic relational algebra will be proposed.

So snh hiu sut m ha gia CPU v GPU s dng thut ton AES
Ng Minh Qun, Phm Vn Thun, Nguyn Anh Tun
i hc Cng ngh thng tin, HQG-HCM
Ti liu ny trnh vic so snh hiu sut x l ca CPU v GPU trong vic m ha
mt khi d liu u vo c kch thc khc nhau s dng thut ton m ha nng cao
AES (Advanced Encryption Standard). Vic m ha c thc hin trn my tnh Core i5,
2.5GHz, Ram 4GB, GPU Gefore 610M. Cc kt qu c s dng xy dng biu
biu din t sut tng ca thi gian khi kch thc khi d liu tng ln gia CPU
v GPU

Solving authentication, authorization and impersonation tasks in

ASP.NET-applications using aspect-oriented approach in Aspect.NET
system
Nguyn Vn on, V Duy Linh
Vin Cng ngh Thng tin - i hc Quc gia H Ni

58

In this article application of AOP for implementing basic security tasks in

ASP.NET-applications on the base of Aspect.NET system is considered. Aspect.NET
system is an AOP toolset for .NET platform, developed at Java technology laboratory,
faculty of mathematics and mechanics, Saint-Petersburg State University, led by
Professor V.O. Safonov. Target of the article applying aspect-oriented programming in
Aspect.NET system to implement basic security tasks in ASP.NET-applications:
authentication, authorization, impersonation; analyzing efficiency and productivity of
application of AOP for developing ASP.NET-applications.

Some compositions of picture fuzzy relations

Phm Hng Phong1, inh Trng Hiu2, Ron Hi Ngn3, Phm Th Thm4
1

Faculty of Information Technology, National University of Civil Engineering

Department of Management Information Systems, Banking Academy of Vietnam
3
Ha Noi University of Natural Resources and Environment
4
Institute of Mathematics, Vietnam Academy of Science and Technology, Vietnam

Quan h l mt cng c thch hp m t s tng ng gia cc i tng. Quan

h m v quan h m trc cm, c nh da trn khi nim tp m v tp m trc cm,
l nhng khi qut ca quan h r. Quan h m v quan h m trc cm c p dng
trong nhiu lnh vc nh: suy din m, iu khin m, chn on m, ... . Gn y, Bi
Cng Cng v Vladik Kreinovich nh ngha tp m bc tranh nh mt m rng ca tp
m v tp m trc cm. Quan h m bc tranh cng c nh ngha v l mt trong
nhng khi nim u tin khi xy dng l thuyt tp m bc tranh. Trong bi bo ny,
mt s tnh cht ca php hp thnh quan h m bc tranh c kim tra. Sau , chng
ti xut mt cch tip cn mi chn on y khoa s dng php hp thnh quan h
m trc cm.

Some properties of generalized rough fuzzy sets

Nguyn Vn nh, Nguyn Xun Tho
i hc Nng nghip H Ni
In this paper, we generalize some properties of rough fuzzy sets on two universal
sets. Lower and upper approximations of rough fuzzy sets are studied. Our main aim in
this paper is that we introduce the concept of a generalized rough fuzzy set (T- rough
fuzzy set) and study some properties of them based on some properties of T- rough sets

Song song ha thut ton Smith Waterman bng OpenCL

Chung Khnh Duy1, Trn Vn Lng2
1

Cng ty Formos VN, 2Vin C hc v Tin hc v ng dng

59

Bo co trnh by v cch song song ha thut ton Smith Waterman, thut ton bt
cp trnh t trong tin-sinh hc, theo hng ng cho ca ma trn khi to. Bi bo m
t vic ng dng cng ngh OpenCL hin thc song song thut ton Smith-Waterman
bng cch tnh ton cng lc cc ma trn con hnh vung kch thc k theo hng ng
cho, ng thi xc nh hm s bin thin theo k da trn kt qu thc nghim t c.
Bn cnh , t kt qu t c trong qu trnh thc nghim, bi bo xc nh c
gi tr k ph hp nht thi gian thc hin song song thut ton Smith-Waterman l ti
u nht.

S dng thut ton ACO vo bi ton d on cu trc bc hai RNA

on Duy Bnh1, Trn Quc Chin1, ng c Long2
1

i hc S Phm - i Hc Nng, 2i hc Bch Khoa - i Hc Nng

The problem of prediction of RNA secondary structure can achieve optimum

transfer of energy into the problem to find the link between the base pairs in the structure
reaches a minimum. The algorithm ACO (Ant Colony Optimization) algorithm is an
optimization of modern applications in complex optimization problems; basis of the
algorithm is based on the movement of ants in the process of finding sources eat through
the pheromone emitted. Can offer two solutions to the problem of prediction of RNA
secondary structure in this paper is: transfer all the elements of the sequence has been
checked into a matrix of energy, then moves problem as the problem of find the shortest
path on a graph, with each vertex is the base, edges are the links between the acceptable
bases. Then, the ACO algorithm to solve the problem.

Tng hiu sut tnh ton thut ton phn cm K-Means trn nn tng
CUDA
Trn Tng1, Nguyn Th Thy Anh2, on Duy Trung1
1

Vin Ton ng dng & Tin hc, HBK H Ni, 2Khoa HTTTQL, Hc vin Ngn Hng

One of the most difficult issues in the algorithms of Data Mining that having to
handle a large volume of data, large computational space. Parallel Computing is an
effective solution to solve these problems. In the world there are a lot of research to
improve the performance of the algorithms of Data Mining such as improved algorithm,
applied hardware, software to increase performance ... One of the most useful tools of
Parallel Computing are widely used today as technology GPU ( Graphic Processing
Unit ) to solve these problems. In this paper, we propose using graphics processors to
improve speed calculated in K -Means algorithms.

60

Tng kh nng chng li tn cng knh ph trong cc h thng thng

tin s dng h mt da trn ng cong Elliptic (ECC)
Trn Minh Tn
B Thng tin v Truyn thng
chng li cc tn cng knh ph trong h thng thng tin s dng h mt da
trn ng cong Elliptic, ngi ta a ra nhiu gii php, trong bao gm c vic
tng tc nhn v hng trn ng cong Elliptic bng phng php dng khng k
cn NAF, phng php ta hn hp. Bi bo ny s a ra mt thut ton c thi gian
thc hin nhanh hn nhm gp thm mt gii php chng tn cng knh ph trong cc h
thng thng tin dng h mt da trn ng cong Elliptic.

Tham s t do cho bi ton phn on trang nh ti liu

H i Tn1, Nguyn c Dng2, L c Hiu2
1

Trng Trung hc ph thng Chuyn H Long - Qung Ninh, 2IOIT Vit Nam

D c nghin cu trong nhiu nm nhng bi ton phn on trang vn bn vn

l mt vn quan trong v thi s do s thay i a dang ca cc dng cu trc vn bn.
Cc thut ton phn on trang hin nay u ph thuc rt nhiu vo cc tham s, cc
tham s ny hoc c nh hoc c xc nh trn ton trang nh, do chng c c
lng khng chnh xc trn cc trang nh c s thay i nhiu v kich c hoc kiu font.
Trong bi bo ny, chng ti trnh by mt thut ton mi (PFree) l s kt hp ca
phng php xc nh cc tham s t do v thut ton Docstrum cho bi ton phn on
trang. Kt qu nh gi thc nghim trn tp d liu PRImA chng t thut ton
PFree c chnh xc cao hn cc thut ton hng u.

Thit b o in nng tiu th s dng cng ngh mng cm bin

khng dy
V Chin Thng, Phm Vit Bnh, Nguyn Th Phng Thanh
i hc Cng ngh thng tin v truyn thng Thi Nguyn
Hin nay, nhu cu v tit kim nng lng in ang tr nn ht sc cp thit. V
vy, vic o lng in nng tiu th l mt trong cc yu t kch thch vic tit kim
nng lng in. Trong bi bo ny, chng ti gii thiu v mt thit b o in nng tiu
th s dng cng ngh mng cm bin khng dy. Thit b o ca chng ti c kh nng
trin khai gim st in nng tiu th trong cc h gia nh hoc cc t chc doanh
nghip. Mt s kt qu nh gi cho thy thit b o ca chng ti c chnh xc kh
cao v ph hp vi nhu cu gim st in nng tiu th cc thit b in ca ngi dng.

61

Thit k sn phm ng dng cng ngh mng cm bin khng dy trong

iu tr v chm sc sc khe bnh nhn
Nguyn Th Dng1, Phng Trung Ngha1, inh Qu Long1,
Nguyn Thi H2, Nguyn Vit Dng2
1

i hc Cng ngh Thng tin v Truyn thng, 2i hc Bch Khoa H Ni,

Hin nay, nc ta c khong 30 bnh vin tuyn trung ng v 300 bnh vin a
khoa, chuyn khoa tuyn tnh, c tnh mi nm c ti hn 150 triu lt khm bnh dn
n tnh trng h thng bnh vin nc ta lun trong tnh trng b qu ti. Trc thc
trng ny, B y t v ang trin khai rt nhiu phng n nhm gii quyt thc trng
trn. Tuy nhin do nhiu nguyn nhn khc nhau nh ngun nhn lc cn hn ch, trang
thit b phc v cn thiu thn, ch yu l thit b c in, thng thng do cha th
p ng c yu cu chm sc sc khe cho bnh nhn mt cch tt nht. Mt thc t
khc cng cho thy, vi s pht trin v mi mt ca x hi th nhu cu chm sc sc
khe cng ngy mt tng cao, chi ph chm sc cho sc kho gia tng theo cp s
nhn trong thp k va qua. Nhng ngi cao tui c bc s chm sc v theo di
thng xuyn thng qua nhng du hiu sc kho. T , hnh thnh mt th trng
rng ln nhm cung cp nhng gii php o c nhng du hiu quan trng ca sc kho.
xc nh c ng thi nhp tim v nhit c th ngi th khng c nhiu thit b
thc hin c cng vic ny. Bn cnh , vic theo di lin tc nhng du hiu sc
khe cng nh vic chm sc cho nhiu bnh nhn cng mt lc gy ra rt nhiu kh
khn cho bc s; Nhm gii quyt vn ny, mt gii php c a ra l ng dng
cng ngh mng cm bin khng dy theo di lin tc cc thng s sc khe ca
nhiu bnh nhn. Mc tiu ca thit k l thit k mt h thng vi chi ph thp, hot
ng hiu qu v chnh xc, cc thit b gim st c kh nng theo di ng thi thng s
sc khe ca nhiu bnh nhn mt cch thng xuyn v cnh bo trn thit b gim st
ca bc s khi c nhng du hiu bt thng. Thng s nhp tim v nhit c th s
c o c mt cch chnh xc vi mt thit b tch hp cc cm bin nhp tim v cm
bin nhit , kt qu thu thp c s c hin th thng qua mt chng trnh c
thit k trn my tnh. Ti Vit Nam, hin cha c n v no trong nc nghin cu,
thit k thit b hot ng nh nu trn. Cc thit b tng ng hin c u phi
nhp khu t nc ngoi vi gi thnh cao, trong khi nhu cu iu tr ca bnh nhn l
rt ln. Vic thit k thnh cng thit b ny s mang li nhng li ch to ln v mt khoa
hc v kinh t.

Thut gii kt hp BKG (BAK-means-GA) cho bi ton phn cm

d liu
Nguyn Vn Hin1, Phan Cng Vinh2
1

Cao Thang College of Technology, 2Nguyen Tat Thanh University

Bi bo ny trnh by vic ng dng ba thut gii l thut gii by ong (BA), thut
gii di truyn (GA) v thut gii K_means vo gii quyt bi ton phn cm d liu. c
bit tc gii xut thut gii kt hp gia cc thut gii by ong, thut gii K_means v
62

thut gii di truyn gi tt l BKG nhm lm tng hiu nng ca thut gii by ong cho
vn phn cm d liu. Khi thc nghim trn 10 b d liu c ly t ngun ICU v
SHAPE cho thy thut gii xut BKG cho kt qu tt hn nhiu so vi cc thut gii
cn li.

Thut ton Ford-Fulkerson ci bin tm lung cc i trn

mng m rng
Trn Ngc Vit1, Trn Quc Chin1, L Mnh Thnh2
1

i hc Nng , 2i hc Hu

Graph is a powerful mathematical tool applied in many fields as transportation,

communication, informatics, economy, In ordinary graph the weights of edges and
vertexes are considered indepently where the length of a path is the sum of weights of the
edges and the vertexes on this path. However, in many practical problems, weights at a
vertex are not the same for all paths passing this vertex, but depend on coming and
leaving edges. The paper develops a model of extended network that can be applied to
modelize many practical problems more exact and effective. The main contribution of
this paper is the revised Ford-Fulkerson algorithm finding maximal flows on extended
networks.

Thut ton gn nhn theo ng bin trong xy dng atlas gii phu b
xng ngi
L Thi Kim Nga1, Nguyn Quang Thnh2, Phm B My3, Nguyn Vn Hun4,
Hunh Cao Tun5, L Hng Qun5
1

H Qui Nhn, 2 HSP H Ni 2, 3Vin Cng ngh thng tin, 4 H Cng ngh thng tin
&Truyn thng, 5H Lc Hng, 5HSP H Ni

Gn nhn l ngun ca nhiu bi ton ti u ha hnh hc. Theo, ACM

Computational Geometry Task Force (i tnh ton hnh hc ACM) th ngay c khi nhn
c t vo v tr c nh tng ng vi mt im, y vn l bi ton NP-hard. Bo
co ny xut mt thut ton gn nhn im theo ng bin nh s dng mt s tnh
cht lin quan n thuc tnh ng bin c xut bi tc gi Nng Ton. Thut
ton c ci t th nghim v t ra hiu qu trong vic xy dng atlas gii phu b
xng ngi.

Thut ton hiu qu khai ph tp mc thng xuyn vi trng s

thch nghi
Nguyn Hng Long
i hc Thng mi

63

Khai ph tp mc thng xuyn vi trng s mang ngha thc tin hn khai ph

tp mc thng xuyn truyn thng, bi n c xt n trng s khc nhau ca cc mc
trong c s d liu. Nhiu m hnh v thut ton khai ph tp mc thng xuyn vi
trng s c xut. Tuy nhin, cc m hnh ny thng gi thit mi mc trong c
s d liu c gn vi mt trng s c nh. Trn thc t, trng s (gi c hay li tc
mang li) ca cc mc c th thay i theo thi gian. phn nh s thay i trng s ca
cc mc theo thi gian l rt cn thit trong nhiu ng dng, chng hn nh trong phn
tch d liu th trng bn l, phn tch cc dng kch hot Web . Vn khai ph tp
mc thng xuyn vi trng s thay i theo thi gian ch mi c xt n gn y bi
Chowdhury F. A. v cng s. Cc tc gi cng trnh ny xut m hnh v thut ton
AWFPM khai ph tp mc thng xuyn vi trng s thch nghi, theo ngha trng s ca
cc mc c th thay i theo thi gian, t l giao tc ny sang l giao tc khc ca c s
d liu. Trong bi bo ny, chng ti xem xt li m hnh khai ph tp mc thng xuyn
vi trng s thch nghi v xut thut ton ci tin AWFIminer. lu d liu trong b
nh, AWFIminer cng s dng cu trc cy WFI-tree, nhng so vi AWFPM,
AWFIminer c hai ng gp mi quan trng sau y: - Cho php gim bt lng thng
tin cn ghi li ti cc nt trn cy FP-tree, gip cho vic lu tr cy trong b nh kh thi
hn, - S dng mt o mi cho php ta hiu qu hn cy WFI-tree v cc cy iu
kin. Tnh ton thc nghim cho thy AWFIminer l thut ton hiu qu khai ph TMTX
vi trng s thch nghi i vi c CSDL dy ln CSDL tha. Hn na, v ch i hi mt
ln qut CSDL, AWFIminer c th p dng cho vic khai thc cc tp mc ny trn dng
d liu.

Thut ton khai ph mu dy thng xuyn ng trng s chun ha

vi khong cch thi gian
Trn Huy Dng1, V c Thi2, Trn Th Anh1
1

Vin Cng ngh thng tin- VAST, 2Vin Cng ngh thng tin, HQG H Ni

Khai ph mu dy (Mining Sequential Patterns) l mt trong nhng lnh vc rt

quan trng trong nghin cu khai ph d liu v c p dng trong nhiu lnh vc khc
nhau. Cc thut ton hin nay khai ph mu dy ch yu tnh ton n s ln xut hin
( h tr) m khng quan tm n mc quan trng khc nhau ca cc mc d liu.
V vy, trong bo co ny, chng ti xut khai ph mu dy trng s chun ha vi
khong cch thi gian, chng ti khng ch quan tm n s ln xut hin ca cc dy (
h tr), khong cch thi gian gia cc dy m cn quan tm n mc quan trng
khc nhau (trng s) ca chng. Chng ti s dng tnh cht rng buc gia h tr,
khong cch thi gian v trng s ca dy sinh cc tp ng vin trong khai ph mu
dy thng xuyn ng trng s chun ha vi khong cch thi gian trong khi vn s
dng tnh cht phn n iu cho php cn bng h tr, khong cch thi gian v
trng s ca mt dy

64

Thut ton tin ha a mc tiu hc ng thi ng ngha t ngn ng

v c s lut ca h lut m mamdani cho cc bi ton hi qui
Hong Vn Thng
i hc Giao thng Vn ti
Trong bi bo ny ti xut mt thut ton tin ha a mc tiu sinh h lut m
Mamdani cho cc bi ton hi qui. Thut ton thc hin hc ng thi ng ngha ca t
ngn ng v c s lut m. Cc t ngn ng s dng trong c s lut c chn t kho
t ngn ng vi s lng xc nh trc v c sinh ra bng i s gia t (SGT). Ng
ngha ca t c thit k theo kiu tp m tam gic v c iu chnh thng qua cc
tham s m ca SGT ph hp vi ng cnh bi ton. Phn hoch m c thit k theo
dng n th ht (single granularity) hoc a th ht (multi granularities). Qu trnh tin
ha c pht trin da trn lc tin ha M-PAES trong [5] c ng dng thnh
cng trong [5, 8, 9, 11, 15]. Thut ton xut c th nghim trn 6 bi ton hi qui
trong [16] c cng ng nghin cu chp nhn. Kt qu th nghim c i snh
gia hai phng php thit k phn hoch m theo dng n th ht vi a th ht vi
nhau, v vi cc thut ton cng s dng lc tin ha M-PAES trong [11] cho thy
thut ton c xut trong bi bo ny tt hn trn c hai mc tiu chnh xc v
phc tp. Kt qu th nghim cng ch ra rng thit k phn hoch m dng a th ht tt
hn n th ht.

Tip cn phi hp trong k thut watermark trn nh

Nguyn Hng Tr, Nguyn Tn Qu Long, Dng Minh c, Ng c Thnh,
Dng Anh c
Phng TN Truyn thng a phng tin, H Cng ngh Thng tin, HQG-HCM
Trong bi ny, chng ti xut mt hng tip cn phi hp trong k thut n
thng tin trn nh. Phng php xut s dng min bin i wavelet kt hp SVD
(Singular Value Decomposition) nhng thng tin, ng thi s dng k thut ROI
(Region of Interest ) chn vng nhng nhm tng cng an ton watermark m vn
gi c cht lng nh cha watermark. Kt qu thc nghim c th nghim
chng tn cng bng cng c Stirmark 4.0 cho thy thut ton c kh nng p ng yu
cu bn vng trc nhiu loi tn cng khc nhau. Ngoi ra, khi i snh vi cc tc gi
c cng hng tip cn, thut ton ca chng chng ti cng chng t c nhiu u im
hn trong vic khng li cc dng tn cng c th.

Tip cn phng php tng hp d liu nhiu cm bin trong mng

cm bin khng dy bng l thuyt tp th
Dng Vit Huy1, Nguyn Duy Tn2, H c i3, Nguyn nh Vit4
1

Trung tm CNTT, B VHTTDL, 2H S phm K thut Hng Yn, 3H H Tnh, 4H

Cng ngh, i hc Quc gia H Ni
65

Mng cm bin khng dy bao gm nhiu nt cm bin khng dy, thng c ri

ngu nhin trong vng cn gim st, thi gian hot ng ca mi nt ph thuc vo dung
lng ngun pin d tr. D liu m cc nt cm bin thu thp c cn c truyn n
mt nt ch; Tuy nhin, c th c nhiu nt cm bin cng gi v nt ch d liu lin
quan n mt tham s ca i tng cn gim st. trm ch nhn c thng tin
phn nh ng bn cht s kin xy ra t cc nt cm bin ng thi hn ch ti a cc
d liu d tha truyn i trong mng gy tiu tn nng lng v ch v nguy c nghn
mng, tng hp d liu l mt trong nhng la chn gii quyt vn . Vi mc
tiu nh trn, trong bi bo ny, chng ti xut quy trnh v m hnh ng dng l
thuyt tp th tng hp d liu nhiu cm bin trong mng cm bin khng dy.

Tiu chun nh gi cht lng dy gi ngu nhin

Nguyn Vn Chung1, H Vn Canh2, L Huy Thp3
1

Trng C ng kinh t - k thut Vnh Phc 2Cc KTNV I- B cng an, 3H Lc Hng

Bi bo ny xut cc thut ton pht hin thng tin du trong nh nh phn (bng
k thut Least Significant Bit) vi t l nhng thp, ng thi cc thut ton cng rt hiu
qu cho vic xc nh m php trong qu trnh phn tch cc H mt m kha i xng.

Tm hiu thut ton phn cm d liu da trn th s dng cy

khung cc tiu
Phm Th Thm1, Trn Quang Ho2
1

i hc Kinh Bc, 2i hc Kinh doanh v Cng ngh H Ni

Phn cm d liu l mt l mt cng c mnh m c nghin cu v p dng

trong nhiu lnh vc nghin cu. Trong bi bo ny nhm chng ti tm hiu thut ton
phn cm da trn th hai vng s dng cy khung cc tiu i din cho mt tp d
liu, v phng php phn nhm 2-MSTClus c xut. Cc phng php ny s
dng tt cc tnh nng ca MST da trn th, n khng yu cu s cm ngi dng
nh ngha, v hnh dng cm khc nhau, mt v kch c.

Tm v x l tin ti u cc cu SQL t chng trnh ngun

Vn nh V Phng, L Huy Thp, Quc Bo
i hc Lc Hng
Bi bo trnh by vic tm kim vt cn cc SQL trong chng trnh ngun l cu
vn tin a quan h trn CSDL tp trung; dng phng php phn r v thay th a
cu SQL a quan h v mt tp cc SQL n quan h. Cc cu SQL n quan h c

66

x l bi th x l vn tin ti u mt quan h (Optimal Processor Of One Relation Query,

OPORQ ) [4, 5, 7]. Tp cc cu vn tin SQL n quan h c tr li chng trnh ngun
thay th cu SQL tng ng chng trnh ngun thc hin

Ti u ha qu trnh xc thc cho h thng xc thc n danh

Cng Thnh, L Th Len
i hc Cng ngh
Trong ch k in t, nu ta c mt vn kin in t k dng kha ring, ta c
th dng kha cng cng xc minh ch k d dng. Tuy nhin, nu phi lm iu ny
vi hng triu vn kin th cng tn nhiu thi gian. tng ca mn mt m hng
lot (batch cryptography) l lm th no gim thi gian chy ca cc thut ton mt m
hc bng cch x l hng lot cc tc v loi ny cng mt lc. Ti y chng ti sut
mt phng php kim chng hnh lot xc thc v danh vi ch k-phng php xc
thc ch k m khng cn cng b ch nhn ca chng. Vi tnh cht ca ch k s RSA,
chng ti tin tng sut ca chng ti c th bo v s ring t ca ngi s dng
trong mi trng internet bt n hin nay.

Ti u lu tr v tnh ton tn hiu ting ni cho h tng hp Ting Vit

da trn ghp ni
Nguyn Tu Trung, Ng Hong Huy
Vin Cng Ngh Thng Tin, Vin Hn Lm Khoa Hc v Cng Ngh Vit Nam
X l ting ni ni chung v tng hp ting ni ni ring Vit Nam v trn th
gii t c nhng thnh tu rt ng khch l. Khi m nhu cu giao tip trn cc
thit b di ng v cc h thng ti nguyn hn ch tng rt nhanh, cc nh nghin cu
trn th gii cng ang tip tc ti u cc thnh phn xy dng h x l ting ni trn
cc h thng dng ny. Do c th ca h thng ti nguyn hn ch, cc h tng hp chy
trn cc h thng ny cng cn s dng lng b nh v ch ph tnh ton nh. Cc
nh nghin cu trn th gii t c nhng thnh cng ngay c trn nhng h thng
c ti nguyn rt khim tn nh cc loi chip vi kh nng lu tr v tnh ton rt thp.
Bi bo ny trnh by mt tip cn ti u lu tr v tnh ton tn hiu ting ni cho h
tng hp ting Vit da trn ghp ni p ng trn cc thit b di ng v cc h thng
ti nguyn hn ch.

Tng hp cc phng php tch m thanh ca mt t Ting Vit v

xut phng php ci tin
V c Lung, Nguyn Thi n, o Anh Nguyn
i hc Cng ngh Thng tin - HQG HCM

67

Bi bo ny trnh by phn tch tng hp cc phng php tch sng m thanh ca

mt cu ni ting vit thnh sng m thanh ca tng t ring bit. Cc nghin cu ca
nhm tc gi V c Lung cho thy c th da vo c trng ring ca ting ni ting
vit l mi ting (t n) c pht m thnh mt m thanh ring bit pht trin cc
h thng nhn dng ting ni ting Vit da trn tng t n. Theo qu trnh tch
sng m ca tng t ng vai tr rt quan trng trong qui trnh ny. Bi bo tin hnh
th nghim so snh cc phng php thng dng nht ngy nay l Volume, Short Time
Energy kt hp vi Zero Crossing Rate hoc High Oder Difference. T xut
phng php STE-ZCR-TIME da trn Short Time Energy vi Zero Crossing Rate v ci
tin tch hp thm c tnh v thi gian. Bi bo th nghim trn 4 b d liu, mi b
c thu m t 50 ngi khc nhau vi cc cu thu m l tn cc tnh thnh v s in
thoi di ng. Kt qu cho thy phng php xut cho chnh xc cao nht v t
khong 99%.

Trch chn c trng m hc ting Vit da trn F0 v bin th ca

MFCC vi c lng VTLN t cc gi tr Formant
Ng Hong Huy
Vin Cng ngh Thng tin, Vin Hn lm Khoa hc v Cng ngh Vit Nam
Kt hp c trng F0 v bin th ca MFCC da trn tham s VTLN (VTLN, vocal
tract length normalisation - chun ha di b phn cu m) chun ha tt bin thin
tn s ca ngi ni mi v ci tin c kt qu nhn dng cu ting Vit (c bit cho
cc tp tn ring c trng lp v m tit v t rt cao) trong ch pht m lin tc v
c lp ngi ni. Bi bo ny xut ng dng phng php c lng tham s VTLN
da trn b pht hin ting ni v cc gi tr Formant thay th cho phng php ML
(Maximum likelihood) ti u ha v tnh ton khi xy dng mt h thng nhn dng
tn ting Vit.

Truy vn hng i tng da trn th ch k nh phn

Trng Cng Tun1, Trn Minh Bo2
1

Khoa CNTT H Khoa hc Hu, 2TT CNTT H Cng nghip Thc phm Tp.HCM

Bi bo xy dng m hnh cu trc d liu t chc lu tr ch k ca cc i

tng trong c s d liu hng i tng, trong cc i tng c m ha v xy
dng di dng mt cu trc th ch k nh phn, t thc hinvic truy vn i
tng trn th ch k ny.

T hc v ng dng trong h thng pht hin xm nhp theo hnh vi

Hunh Hi u, Bi Thanh Phong, Trn Th Dung, Trnh Ngc Minh
ISeLAB
68

Thnh phn quan trng nht ca mt Intrusion Detection System (IDS) l thnh
phn nhn bit tn cng. n nay, c hai cch tip cn chnh nhn bit tn cng l
nhn bit trc tip qua cc thng tin dng mt on k t (thng gi l signature) c
trng ca chng trnh tn cng hoc nhn bit gin tip qua cc th hin ca tn cng
trn h thng (thng gi l nhn bit qua hnh vi). Nhn bit qua signature thng chnh
xc, t bo ng sai nhng nhiu bo ng thiu khi m c bin i v hon ton mt
kh nng nhn bit vi cc m c mi. Nhn bit qua hnh vi thng t chnh xc hn
(nhiu bo ng sai v bo ng thiu), nhng li c th nhn bit virus mi, ngay c khi
chng ta cha bit v n [4][8][10]. Pht trin h thng nhn bit qua hnh vi cng
phi hp vi nhn bit bng signature l xu hng nghin cu pht trin hin nay. Vi h
thng nhn bit tn cng qua hnh vi, h thng cn phi c hun luyn t trc v cc
hnh vi xu v bnh thng sau c th phn loi cc hnh vi m n s gp phi.
Tuy nhin, h thng s gp phi kh nhiu trng hp, khi m hnh vi ri vo vng m,
kh xc nh l xu hay bnh thng do tnh cht rt a dng ca hot ng ca mt h
thng ln hnh vi tn cng. Do , cng tc hun luyn thng c thc hin vi s
gip ca con ngi. Nhng qu trnh hun luyn ny khng bao gi l y v h
thng IDS nhn chung cha c kh nng t hun luyn, t trng thnh m khng cn s
can thio, hng dn ca con ngi. Mc tiu ca trnh by ny l xut phng n cho
php h thng IDS c th t lm giu kin thc trong qu trnh thc hin nhim v cnh
bo ca mnh. Vi kh nng t thu nhp thm kin thc, h thng IDS s nhn bit ngy
mt chnh xc hn, bit nhiu loi hnh hot ng mng hn theo cng vi thi gian
trin khai.

ng dng logic m trong khi phc thng tin nh RGB-D

Nguyn Mu Uyn, o Thanh Tnh, Ng Thanh Long
Khoa Cng ngh thng tin, Hc vin K thut qun s
Bi ton khi phc nhiu cho nh su ca Camera Kinect c nhiu nh
khoa hc khc nhau a ra cc phng php khc nhau da thng tin ca nh su,
nh su v nh mu. Trong phm vi bi ton nhm tc gi xut m hnh logic m
gii quyt bi ton kh nhiu cho nh su da trn nh su v nh mu. Vi
quan im, mi im thng tin b mt thng tin c th thuc cc mt khc nhau c th
cha c im , o m v logic m c s dng quyt nh im mt
thng tin s thuc mt no, v t xp x gi tr ca im mt thng tin hp l.

ng dng mng noron SOM trong vic xc nh trng thi nhm, m

ca mt ngi
L Anh T1, Phm Vit Bnh1, Nng Ton2, L Sn Thi1
1

H CNTT v truyn thng, 2Vin CNTT - Vin Hn lm Khoa hc Vit Nam

69

Trng thi mt nhm, mt m l thng tin hu ch cho bit mt ngi ang trang
thi ng hoc thc. Vic pht hin trng thi ny c th c ng dng trong nhiu bi
ton khc nhau nh pht hin li xe ng gt, nghin cu v cc biu cm trn khun
mt Trong phm vi bi bo ny, chng ti xut mt phng php s dng mng
noron SOM c gim st xc nh trng thi nhm hoc m ca mt ngi. Chng ti
thc nghim m hnh mng noron xut trn hai tp d liu c cng b. Tp
d liu th nht l cc nh mt ngi c tch ra t nh khun mt thu c trong cc
video thc t. Tp d liu th hai l tp cc c trng c trch chn t nh mt ngi.
Kt qu th nghim trn hai tp d liu c chnh xc cao hn so vi mt s nghin
cu khc cng b.

ng dng mt s k thut khai ph d liu trong phn tch hot cnh

m phng m ng
Bi Thu Lm1, Phan Nguyn Hi1, Mc Vn Vin2
1

Khoa CNTT Hc vin k thut qun s, 2Vin CNTT, Vin KH v Cng ngh qun s

Bi bo trnh by vn m hnh ha v m phng m ng nhm khm ph cc

quy lut, cc hnh vi c th ca m ng. Tng quan cc cch tip cn m hnh ha, cc
cng ngh v h thng m phng m ng. xut phng php ng dng cc k thut
khai ph d liu trch rt cc quy lut, cc hnh vi ca m ng t d liu thu c
qua m phng m ng. Cc quy lut, hnh vi thu c qua khai ph d liu c th h
tr ra nhng quyt nh ph hp cho vic iu khin m ng.

ng dng phng php ITI-GAF xy dng quy hoch

quc hi in t
Nguyn i Vit, on Hu Hu, Ng Don Lp, Th Thanh Thy,
L Quang Minh
Vin CNTT - i hc Quc gia H Ni
Theo cc nghin cu gn y [1, 2], cc d n ng dng CNTT quy m ln nh
Quc hi in t ti cc nc ang pht trin c nguy c tht bi rt cao. Trn c s kinh
nghim trin khai Quc hi in t trn th gii, chng ti tng kt mt s kh khn
ni bt. khc phc iu , nhm tc gi xut ng dng phng php lun ITIGAF [3] xy dng mt m hnh quy hoch Quc hi in t tinh gin cho cc nc
ang pht trin. M hnh ny c u im d s dng, hun luyn v ph bin, to s ng
h ca x hi i vi cng cuc hin i ha Quc hi. M hnh ny cn l c s khoa
hc gip cho vic kho st thc t, lp k hoch, xy dng danh mc cc d n, iu phi,
t chc thc hin, nh gi v gim st qu trnh xy dng Quc hi in t theo mt
kin trc c tnh tng th, thng nht v hiu qu.

70

ng dng thut ton m ha tin tintrong bo mt d liu

Nguyn Vn Thng, Nguyn Th Ngn
i hc CNTT&TT - i hc Thi Nguyn
This paperintroduction Advanced Encryption Standard (AES)which has initiated by
National institute of Standard and Technology of US. Algorithm of AES is based on two
basic operations as addition and multiplication modulo in the Galios field (GF28). The
AES algorithm is a symmetric block cipher that can encrypt (encipher) and decrypt
(decipher) information. The AES algorthim is capable of using cryptographic key of 128,
192 or 256 bits to encrypt and decrypt data in block of 128 bits. The input, output and key
are represented bythematrix (each of elements of matrix is the one byte). The
algorithmisimplementedwithNr rounds ( Nr = 10, 12, 14 depend on the key length is 128,
192, 256 bit ) at the each round executable four procedure following: SubBytes,
ShiftRows,
MixColumns
and
AddRoundkey
except
forthe
last
roundnoprocedureMixcolumn. Algorithm of this can be implemented with the hardware
and software. For the hardware, be used language VHDL combined with FPGA to
execute

ng dng thut ton Map/Reduce xy dng tp ch mc phc v tm

kim vn bn Ting Vit
Hunh Cng Php1, Hunh Tho Phc2
1

i hc Nng, 2Cng ty Axon Active Vit Nam

Trong vic xy dng h thng tm kim, vic lp ch mc cho cc d liu phn tn

trn nhiu h thng my ch khc nhau, s lng d liu lu tr rt ln (petabyte d liu)
v h tr tt cho Ting Vit vn cn l mt bi ton kh gii quyt hin nay. Trn c s
nn tng tnh ton phn tn Apache Hadoop Map Reduce, tc gi nghin cu ng dng
nn tng ny vo vic xy dng tp ch mc tm kim. Trong bi bo ny, tc gi phn
tch chi tit cch thc ng dng Map Reduce, kt hp tch t Ting Vit v thut ton
tnh TF-IDF vo vic x l to tp ch mc cho ngun d liu vn bn.

c lng quan h khng chc chn gia hai khong thi gian bt nh
da trn l thuyt kh nng
H ng Cao Tng
Cao ng S phm H Ni
Thng tin v thi gian thng mang t nhiu yu t khng chc chn. Trong nhiu
ng dng ca tr tu nhn to, chng hn khi cn phi x l cc truy vn trong c s d
liu thi gian, ngi ta cn phi xc nh quan h gia hai phn t thi gian ngay c khi
d liu v chng khng c bit mt cch chnh xc. Trong [7], Ryabov c lng
71

quan h khng chc chn gia hai khong thi gian bt nh bng phng php xc sut.
Trong [3], Dubois xut tip cn x l quan h khng chc chn gia cc im thi
gian da trn l thuyt kh nng. Bi nghin cu ny xut mt cch c lng quan
h khng chc chn gia hai khong thi gian bt nh da trn l thuyt kh nng nh
vo php bin i biu din ma trn sang biu din vc t ca quan h khng chc chn
gia hai khong thi gian c gii thiu trong [9]. ng dng trong c s d liu thi
gian c trnh by phn cui bi bo th hin ngha ca phng php c lng
c xut.

V phc tp tnh ton ca bi ton tm ton b cc tp rt gn trn

bng quyt nh
V c Thi
Vin CNTT, HQG-HN
Vic tm kim cc tp rt gn ng vai tr quan trng trong vic x l thng tin trn
bng quyt nh. Mc tiu ca rt gn thuc tnh l loi b cc thuc tnh d tha tm
ra cc thuc tnh c bn phc v cho vic x l thng tin. V thc cht, vic rt gn thuc
tnh l tm tp con nh nht ca tp cc thuc tnh bo ton thng tin phn lp trn
bng quyt nh. Trong bi bo ny chng ti ch cp ti cc bng quyt nh nht
qun. Trn thc tin, ty theo tng bi ton c th, chng ta c th chuyn bng quyt
nh khng nht qun v bng quyt nh nht qun. Bi bo ny trnh by v phc
tp tnh ton ca bi ton tm ton b cc rt gn trn bng quyt nh. Chng ti chng
minh phc tp tnh ton ca bi ton tm tt c cc rt gn trn bng quyt nh nht
qun l hm m i vi lc lng ca tp cc thuc tnh. Chng ti chng minh hai
bc: Tn ti mt thut ton hm m tnh ra tt c cc rt gn v bi ton tm tt c cc
rt gn c phc tp tnh tan khng nh hn hm m.

V phng php nhn dng i tng nh thy m s dng thut ton

tin ha vi phn kt hp mng n ron
Trn V i, Bi Thu Lm
i hc K Thut L Qu n
Trong bi bo ny, chng ti xut mt phng php tip cn h thng nhn dng
cc i tng nh thy m (sonar) da trn s kt hp mng n ron v thut ton tin ha
vi phn (Differential Evolution DE). c nhiu nghin cu i theo hng nhn dng
cc d liu nh di nc (SOund Navigation And Ranging SONAR) nhn dng cc
i tng trn nh sonar nh: s dng m hnh CSS (Co-operating Statistical Snake) [5],
mng n ron hi quy [6], thut ton thch nghi [21], cc phng php so khp nh [9], so
snh bin ca i tng quan tm. y, chng ti s kt hp thut ton DE hun
luyn mng v s dng kt qu a ra c b trng s tt nht da trn sai s bnh
phng nh nht. Th nghim kt qu trong bi ton nhn dng cc i tng ging mn
72

di nc v so snh vi mng c hun luyn bi thut ton lan truyn ngc (Back
Propagation BP)

Xc nh cc h s c trng bng gii thut di truyn cho bi ton

Tm tt vn bn ting Vit
Nguyn Nht An1, Trn Ngc Anh2, Nguyn c Hiu2, Nguyn Quang Bc1
1

Vin Khoa hc cng ngh Qun s, 2Hc vin K thut Qun s

Tm tt vn bn l qu trnh rt gn vn bn m vn gi c nhng thng tin quan

trng. Bi bo ny xut mt tip cn mi trong tm tt vn bn ting Vit theo hng
trch rt (Extraction Summarization) da trn cc c trng quan trng nh v tr cu,
di cu, trng s TFxISF, xc sut thc t, tng t vi ch , cu trung tm... u
tin, chng ti xc nh tp c trng quan trng trong vn bn ting Vit. Bc tip theo
s dng gii thut di truyn xc nh h s cc c trng t kho ng liu hun luyn.
Th nghim tm tt vn bn vi cc h s thu c t gii thut di truyn cho thy, vn
bn tm tt c chnh xc cao, c th p dng tt trong thc t.

Xy dng cng c qun l chi tiu c nhn iu khin bng ting ni

Trn Khi Thin, Vn Th Quc, Nguyn Phm Bo Nguyn, Nguyn V Kiu Anh,
V Thanh Hin
Khoa CNTT, H Huflit
Bi bo ny trnh by v h thng VNSExpenses - cng c c th hiu c cc cu
lnh ting ni ca ngi dng, gip cho vic qun l v truy vn cc khon chi tiu c
nhn bng ting ni ting Vit. c im ca h thng l n c kh nng phn tch c
php v ng ngha ca cc cu mnh lnh v cu hi sau khi c nhn dng bi thnh
phn nhn dng ting ni. C ch ny c gii quyt bng DCG (Definite Clause
Grammar) v cc phng php ca ng ngha hnh thc. Theo hiu bit ca chng ti,
y l ng dng ting ni u tin ti Vit Nam c trang b mt c ch x l ng ngha
c th v hiu qu. Tin hnh ci t v thc hin cc th nghim trn mi trng my
tnh c nhn, chng ti nhn thy c trn 95% kt qu l chnh xc.

Xy dng h thng nhn dng nhn vt phc v gim st

Ng c Thnh, Nguyn Th Bo Ngc, Nguyn Hong V, Cp Phm nh Thng,
L nh Duy, Dng Anh c
Multimedia Communications Lab, University of Information Technology, VNU-HCM

73

Vi s ph bin ca cc camera gim st, cc h thng nhn dng nhn vt ngy

cng tr nn quan trng. Trong , vn quan trng nht l nhn dng mt hoc nhiu
nhn vt xut hin trong cc video thu bi cc camera t cc v tr khc nhau. Trong
bi bo ny, chng ti gii thiu mt hng tip cn xy dng h thng nhn dng nhn
vt tch hp cc k thut rt trch c trng v so khp c trng trn c khun mt v c
th ngi. H thng ny c th c p dng nhm h tr gim st an ninh ti nhng ni
cng cng c mng li camera gim st nh ngn hng, siu th.

Xy dng h thng nhn dng v phn tch t ting Vit

L Trung Hiu1, L Anh V2, L Trung Kin3
1

i hc Duy Tn, 2i hc Nguyn Tt Thnh, 3i hc Hu

Bi bo ny trnh by mt hng tip cn mi, s dng m hnh xc sut kt hp t

in nhn dng v phn tch t trong cu ting Vit. M hnh xc sut da trn o lin
kt nhm lng ha tnh i lin nhau gia cc ting to thnh t.Vi mi m hnh xc
sut, t mi c nhn dng, cc ting thuc t mi c ni to thnh ting mi trong
m hnh xc sut mi. Qu trnh ni chui cc ting to thnh ting mi lm gim s
nhp nhng gia ting v t trong ting Vit, tng chnh xc cho cc hm xc sut,
tng hiu qu cho qu trnh nhn dng t mi. V vy, m hnh xc sut s hi t v m
hnh ti u. H thng c xy dng trn tp vn bn gm 250.034 bi bo online v hn
9.000 tc phm vn hc, gm 31.565.364 cu v cm t vi tng s 411.623.127 ting.
H thng nhn dng v phn tch t vi a dng th loi vn bn ting Vit vi chnh
xc khong 95%, v d dng ci tin p ng s pht trin lin tc ca ting Vit. T
in c xy dng gm hn 300.000 t v cm t ting Vit.

Xy dng h thng phn tch v x l m c

Nguyn Tn Khi
DaNang University
Trong nhiu nm gn y, s lng m c pht trin nhanh chng trn ton th
gii t ra nhiu vn v an ninh thng tin cho ton b nhng ngi s dng Internet
trn ton cu. Nm 2013, Vit Nam ng u danh sch cc nc chu c t l ly
nhim m c trn my tnh nhiu nht. Vi s lng m c ngy cng nhiu v nguy
him nh trn th vic p dng cc gii php nhm hn ch tc hi do m c gy ra l
thc s cn thit. Bi bo trnh by hng nghin cu xy dng h thng phn tch v x
l m c. H thng c xy dng v trin khai vn hnh th nghim ti Trung tm
ng cu khn cp my tnh Vit Nam (VNCERT) nhm phn tch v x l m c mt
cch sm nht hn ch tc hi do m c gy ra.

74

Xy dng m hnh trang tri chn nui gia sc thng minh da trn
kin trc hng dch v v mng cm bin khng dy
Nguyn Trnh Nguyn1, Xun Thiu2, Ng Hong Huy3,
Nguyn Tu Trung3, Nguyn c Hi4
1

H Nng lm Tp. H Ch Minh, 2H Giao thng Vn ti, 3Vin CNTT-VAST,

4
Cng ty c phn Phn mm v Cng ngh ng dng

Internet bng n, cng ngh thng tin pht trin, hin nay, c nhiu ng dng thng
minh. Cc ng dng thng minh hin mang n nhng thay i ng k trong cuc sng
ca chng ta. Hin nay, cc ng dng ny c mong i rng vic p dng cng ngh
trong nng nghip c th tng gi tr thng d v nng sut ca nng nghip vi vic s
dng khc nhau ca n. Bi bo ny xut m hnh nng tri thng minh cho vic kim
sot v qun l nng tri gia sc thi gian thc bt k thi im no, ni no da trn
kin trc hng dch v v mng cm bin khng dy. Trong , mng cm bin khng
dy v camera c ci t ti nng tri gia sc thu thp v kim sot mi trng
trang tri gia sc v thng tin hnh nh trong vic chn nui gia sc nh nh sng, m,
nhit v CO2. Cc thng s mi trng v thng tin hnh nh c gi v my ch,
ni ci t ng dng qun l nng tri kim sot v iu khin cc tin ch nng tri
gia sc v cnh bo ngi dng trong nhng trng hp khn cp. Vic qun l nng tri
c th thc hin ti bt k lc no, ni no khi ng dng trn my ch c th c truy
cp qua Internet hay in thoi thng minh. M hnh c p dng th nghim ti trang
tri nui ln ca hp tc x C ng Sn ty H ni.

Xy dng m-un sinh t ng m ngun trigger trong ngn ng C

thc hin cp nht gia tng, ng b cc khung nhn thc trong
PostgreSQL
Nguyn Trn Quc Vinh, Trn Trng Nhn
i hc S phm Nng
tng v khung nhn thc xut hin t nhng nm 1980, tuy nhin, n nay ch
c bn h qun tr c s d liu hng u th gii l Oracle, IBM DB2, Microsoft SQL
Server v Sybase trin khai thnh cng. Kh khn c xc nh vn trin khai thc
hin cp nht gia tng cc khung nhn thc theo c ch ng b, nh mt phn ca giao
tc thc hin cp nht d liu trn cc bng ca c s d liu cng nh nhn bit kh
nng s dng v s dng KNT tr li cc truy vn mt cch t ng. PostgreSQL l
h qun tr c s d liu m ngun m hng u th gii, c B Thng tin v Truyn
thng u tin khuyn co s dng. Tuy nhin, n nay n cng ch h tr thc hin cp
nht ton phn theo c ch bt ng b. Nghin cu ny xy dng m-un thc hin sinh
t ng m ngun cc trigger trong ngn ng C, thc hin cp nht gia tng, ng b cc
khung nhn thc trong PostgreSQL cho cc truy vn u vo bt k bao gm php
ni trong.

75

Xy dng phn mm qun l c s d liu ch th phn t ca cc ging

vt nui v cy trng Vit Nam
Phm H Thy, Dng Th Hi Yn
Khoa CNTT - i hc Nng nghip H Ni
Ni dung ca bi vit ny cp ti vic ng dng cng ngh thng tin trong vic
xy dng mt phn mm qun l nhm t chc thu thp, lu gi v qun l cc thng tin
v ch th phn t v cc thng s k thut ca cc th nghim lin quan n vic pht
hin cc ch th phn t ca cc vt nui v cy trng Vit Nam. Bi vit cng gii
thiu mt phn mm qun l cc ch th phn t i vi cy la c nhm nghin cu
thc hin ti i hc Nng nghip H Ni

Xy dng thut ton nhn dng k t quang hc v ng dng trong

vic c thng tin trn danh thip ting Vit
Chu Vn Nam, Hong Hi Huy, Nguyn Anh Tun
i hc Cng ngh thng tin, HQG-HCM
Bi bo ny trnh by thut ton nhn dng thng tin trn danh thip ting vit bao
gm h tn, s in thoi, email, a ch c chp t camera ca smartphone s dng h
iu hnh Android. Do gc chp khc nhau, iu kin nh sng, cht lng camera ca
in thoi dn n cht lng hnh nh thu c l khc nhau nh hng n kt qu
nhn dng. Chng ti s dng th vin OpenCV cho vic ti u ha nh danh thip thu
c. Vn bn trn hnh nh sau khi x l c trch xut bng cng c nhn dng k t
quang hc v phn loi chng thnh cc trng h tn, a ch, s in thoi, email, ni
lm vic v lu vo danh b in thoi gip cho vic lu tr v tm kim c d dng

X l xung t cp khi nim gia cc ontology theo tip cn l

thuyt ng thun
Nguyn Vn Trung1, Hong Hu Hnh2
1

i hc Khoa hc- i hc Hu, 2i hc Hu

Tham chiu n ontology c xy dng cc ontology mi to iu kin cho

vic chia s tri thc gia cc h thng thng minh c d dng. Tuy nhin, iu
khng gim hon ton nguy c c xung t gia cc ontology ca cc h thng ny. Bi
bo ny trnh by mt cch tip cn da trn l thuyt ng thun (consensus theory) v
hm nh gi tng ng ng ngha gia cc khi nim xy dng thut ton tch
hp cc ontology xung t cp khi nim.

76

Mt phng php phn cm trong c s d liu

a phng tin ln
Hong Minh Quang, V Th Lan Anh, ng Trn c,
Nguyn Khc Gio, ng Khng Duy
Vin Cng ngh thng tin, Vin Hn lm Khoa hc v Cng ngh Vit Nam.
Cc c s d liu a phng tin ang tr thnh xu hng d liu ton cu ha hin
nay. Vi s bng n thng tin trong nhng k nguyn gn y, vic thu thp, lu tr, v
x l mt s lng khng l d liu vi a dng cc kiu hnh d liu khc nhau ang l
mt thch thc ln. Vi vic xut hin nn tng c s d liu NoSQL m ra mt cng
c lu tr nhng khi lng khng l v hn th na c s d liu NoSQL cn rt hiu
qu trong vic lu tr nhng cu trc d liu khc nhau. Cng vic quan trng sau khi
thu thp khi lng ln d liu vo trong c s d liu chng ta cn hng n mc tiu
khai ph d liu tm ra nhng tri thc cn thit. Bi bo gii thiu mt phng php
phn cm cho c s d liu a phng tin ln trn nn tng ca h qun tr c s d liu
Apache CouchDB.

77

78

CH DN
Nguyn Nht An 73
Ng Trn Anh 55
Nguyn c Anh 29
Nguyn Hong T Anh 26
Nguyn Th Thy Anh 60
Nguyn V Kiu Anh 28, 73
Nguyn Xun Anh 40
Trn Ngc Anh 46, 73
Trn Th Anh 64
Trinh Th Vn Anh 27
Trnh Hin Anh 39
V Th Lan Anh 77
ng Quang 19, 47
H c i 65
Nguyn Thi n 34, 67
Hunh Hi u 68
Phm Vn t 43
on Vn Ban 30
Cao Xun Bch 27
Quc Bo 66
Lm Hoi Bo 9
Trn Minh Bo 68
Nguyn Quang Bc 73
on Duy Bnh 60
L Hu Bnh 42
L Nguyn Bnh 42
Nguyn Ngc Bnh 48
Nguyn Thanh Bnh 24
Phm B Bnh 12
Phm Vit Bnh 61, 69
H Vn Canh 66
Khu Minh Cnh 35
Nguyn Vn Cn 44
Nguyn Vit Chnh 15
Nguyn Th Minh Chu 52
Th Kim Chi 24
Trn Quc Chin 14, 60, 63
Phm Minh Chun 27

Nguyn Vn Chung 66
Phm Ngc Cng 52
Cung Trng Cng 48
Dng T Cng 55
L B Cng 10
Nguyn Hng Cng 34
Nguyn Mnh Cng 43
Phm Vn Cng 46
V Ch Cng 20
Hunh B Diu 39
Ngo Manh Dung 23
Trn Th Dung 68
Chung Khnh Duy 59
ng Khng Duy 77
L nh Duy 26, 28, 73
Nguyn Tin Duy 15
Trinh Thanh Duy 14
Lu Hng Dng 18
Nguyn c Dng 61
Nguyn Th Dng 54, 55, 62
Nguyn Vit Dng 62
Phm Quang Dng 57
Trn Tin Dng 52
H i Dng 49
L Khnh Dng 53
Trn Huy Dng 64
H Mnh o 22
Trn V i 72
inh Quang t 39
Nguyn Tun ng 51
Nguyn Vn nh 59
V Vn nh 17
Nguyn Vn on 58
L Ph 19
Nguyn Trnh ng 57
Trn Mnh ng 43
Dng Anh c 28, 65, 73
Dng Minh c 65

ng Trn c 9, 77
ng Vn c 52
Nguyn Huy c 33
Trng nh Minh c 35
on Th Hng Giang 25
Ng Trng Giang 30
Nguyn c Giang 43
Nguyn Long Giang 9, 17, 57
Nguyn Tin Giang 18
V L Qunh Giang 48
Nguyn Khc Gio 77
Nguyen Thuc Hai 23
Vo Hoang Hai 23
Hong Vnh H 45
Nguyn Thi H 62
Nguyn Th Thu H 41
Trn Hnh 50
Trn Quang Ho 66
L Mnh Hi 25
Nguyn c Hi 55, 75
Nguyn Thc Hi 21, 48
Phan Nguyn Hi 70
Phm Vn Hi 17
Trn Th Thanh Hi 25, 29, 47
Trng H Hi 19
V Hi 25, 29, 47
Hong Hu Hnh 56, 76
on Hu Hu 20, 70
Dng Vit Hng 37
Nguyn Th Hng 54
V Thy Hng 56
Mai Th Hin 52
Trn ng Hin 43
inh Trng Hiu 59
L c Hiu 61
L Trung Hiu 23, 74
Nguyn c Hiu 73
Trn c Hiu 9
on Th Hin 54
Nguyn Vn Hin 50, 62
V Thanh Hin 28, 73

Hong Ngc Hin 36, 37

Lm Thnh Hin 50
Nguyn nh Hin 35
Hunh Xun Hip 9, 34, 36, 36, 37
Tran The Hiep 9
V Vn Hiu 41
Phm Th Hoa 38
Nguyn Quang Hoan 29
Trn Vn Hoi 13, 35
Phm Huy Hong 31
Trng Anh Hong 57
V nh Ha 18
Nguyn Ct H 15
Nguyn Th Hng 12
Nguyn Vn Hun 32, 54, 63
Dinh Quang Huy 23
Dng Vit Huy 65
Hong Hi Huy 76
Lim Nguyn Huy 37
Ng Hong Huy 55, 67, 68, 75
Nguyn ng Quang Huy 16
Nguyn c Huy 38
Nguyn Minh Huy 33
Nguyn Quang Huy 45
Nguyn Xun Huy 56
Nguyn Th Minh Huyn 21
inh Ph Hng 38
L Mnh Hng 40
Nguyn Mnh Hng 9, 32
Nguyn Quc Hng 29
Phm Quc Hng 46
Trn B Hng 43
Trn nh Hng 47
Trn Hng 48
Trnh Xun Hng 39
ng Vn Hng 57
Phan ng Hng 51, 55
Phm Ngc Hng 46
V Chn Hng 22
H Vn Hng 45
L Thanh Hng 27

80

Nguyn Th Lan Hng 57

Th Mai Hng 9
Phm Vn Hng 10, 48
Trn nh Khang 17, 27, 29
Nguyen Kim Khanh 23
Nguyn Duy Khnh 24
Nguyn Trng Khnh 32
Nguyn Anh Khim 53
Ng Ngc ng Khoa 27
Huy Khi 56
Nguyn Tn Khi 74
L Trung Kin 74
Anh L 37
L Th Lan 47
Ng Th Lan 11
Phan Phng Lan 9
Tran Viet Lam 9
Bi Thu Lm 20, 70, 72
V Nh Ln 15
Nguyn nh Lu 14
Ng Don Lp 20, 70
Trn Vn Lng 13, 50, 59
L Th Len 67
Th Lin 40
Nguyn Ngc Kim Lin 49
Nguyn Tun Linh 46
ng Th M Linh 36
Tran Le Tam Linh 14
V Duy Linh 58
Trnh Vn Loan 46
Dng Thng Long 52
ng c Long 60
inh Qu Long 62
L Thanh Long 24
Ng Thanh Long 69
Nguyn Hng Long 63
Nguyn Tn Qu Long 65
Nguyen Kim Long 23
Triu Hi Long 45
V c Lung 34, 67
Phm B My 63

Nguyn c Mn 39, 42
L Quang Minh 20, 53, 70
Trnh Ngc Minh 68
Chu Vn Nam 76
inh Vn Nam 13
L Nam 42
L Hi Nam 12
Nguyn H Nam 53
Phm Thnh Nam 21
V Xun Nam 33
L Thi Kim Nga 63
Nguyn Th Ngn 71
Ron Hi Ngn 59
Huynh Huu Nghia 27
Lng Vn Ngha 16
Nguyn c Ngha 16
Phng Trung Ngha 54, 62
Thanh Ngh 34
Lng Thi Ngc 21
Nguyn Thng Ngc 46
Nguyn Th Bo Ngc 73
Phm Vn Ngc 12
o Anh Nguyn 34, 67
Nguyn Phm Bo Nguyn 28, 73
Nguyn Trnh Nguyn 55, 75
L ng Nhc 53
Trn Trng Nhn 75
V Duy Nht 32
Nguyn Minh Nht 39
Vn Nhn 35
Nguyn Xun Nht 16
Marilleau Nicolas 32
Ioannis Parissis 24
Hunh Cng Php 71
Hunh Nht Pht 56
Dng Phc Phn 31
Bi Thanh Phong 68
Phm Hng Phong 59
Hunh Tho Phc 71
La Hu Phc 31, 40
Nguyn Quang Phc 26

81

Nhan Minh Phc 13

V Vn Phc 48
H Nguyn Cc Phng 35
Nguyn Duy Phng 40
Trng c Phng 50
Vn nh V Phng 10, 66
Nguyn Th nh Phng 39
Trn nh Qu 18
Hong Quang 15
Hong Minh Quang 77
Nguyn Hng Quang 31, 46
Phm Hng Quang 30
V Vinh Quang 19
L Hng Qun 63
Ng Minh Qun 58
Trn Lm Qun 51
Ho Bao Quoc 27
Nguyn Kim Quc 21
Phan Tn Quc 16
Vn Th Quc 28, 73
Nguyn Hu Qunh 41
Phan Vn Sa 36
H Vn Sang 53
Hunh Tn Sang 9
Bch Ngc Sn 31
Phan Thanh Sn 55
H Tin Sung 39
Tran Tan Tai 23
Le Ngoc Tan 11, 14
Nguyn Vn To 32
Ng Quc To 30, 41, 44
Nguyn c Tm 40
Nguyn Duy Tn 22, 65
Trn Minh Tn 61
Phm Th Thm 59
Phan Th Th 51
Nguyn Hi Thanh 34
Nguyn Th Phng Thanh 61
Nguyen Thi Thanh Thao 14
L Sn Thi 69
Nguyn Phng Thi 46

V c Thi 25
Cng Thnh 67
Vn Thnh 50
Ng c Thnh 26, 28, 65, 73
Nguyn Quang Thnh 63
on Th Thanh Tho 12
Nguyn Xun Tho 59
Trn Th Ngc Tho 49
L Mnh Thnh 63
L Huy Thp 66, 66
Truong Cong Thang 9
Cp Phm nh Thng 73
on Vn Thng 16
Hunh Quyt Thng 34, 42
L Quyt Thng 36
Nguyn Trng Thng 39, 43
Nguyn Vn Thng 71
Trnh nh Thng 56
V Chin Thng 61
V Tt Thng 51
V c Thi 9, 57, 64, 72
Vn Thin 39
Nguyn Hong Duy Thin 13
Trn Khi Thin 28, 73
Xun Thiu 55, 75
V Vn Tho 41
ng Xun Th 12, 43
Phm c Th 52
Hong Vn Thng 65
Phm Th Thm 66
Phm Vn Thun 58
L c Thun 10
V Chnh Thu 54
Th Thanh Thy 20, 70
Phm H Thy 76
Bi Th Th 39
Phm Th Thng 11
L Trung Thc 19
Vn Tin 28
Trnh Nht Tin 43
Phan Tun Tip 38

82

Le Ngoc Tien 11, 14

Hunh Ngc Tn 28
o Thanh Tnh 46, 49, 69
Nng Ton 39, 50, 69
H Mnh Ton 39
H i Tn 61
Nguyn Vn Ti 47
Bi Th Trang 46
L Thu Trang 54
Phm Thy Trang 38
Nguyn Vn Tri 39
Trn Minh Trit 27, 38
Mai Yn Trinh 36
Nguyn Hin Trinh 30
Nguyn Hng Tr 65
Nguyn Hu Trng 52
on Duy Trung 60
Hong Quang Trung 26
Kin Nguyn Trung 37
Nguyn Hiu Trung 37
Nguyn Thnh Trung 45, 54
Nguyn Tu Trung 41, 55, 67, 75
Nguyn Vn Trung 76
Nguyn o Trng 40
Nguyn Hu Xun Trng 18
Quch Xun Trng 48
Mai Mnh Trng 19
Nguyn Mu Tu 14
inh Anh Tun 51
Hong Vn Tun 22
Hunh Cao Tun 63
L Triu Tun 32
L Vn Tun 18
Nguyn Anh Tun 44, 58, 76
Trng Cng Tun 68
V Quc Tun 54
Nguyn Th Kim Tuyn 54
Trn Minh Tuyn 56
o Vn Tuyt 9, 37, 58
L Anh T 69
Trng Vn T 33

V Hong T 36
V Ngc Cm T 36
V Thanh T 21, 21, 48
H ng Cao Tng 71
Nguyn Thanh Tng 10, 33, 57
Phm Hu Tng 48
Trn Tng 60
Trng Tin Tng 52
Nguyn Quang Uy 11
Nguyn Mu Uyn 69
Le Thi Thuy Van 37, 58
Dng Th Thy Vn 18
L Th Hng Vn 10
Mc Vn Vin 70
Nguyn i Vit 20, 24, 41, 70
Nguyn nh Vit 22, 65
Trn Ngc Vit 14, 63
Trng Xun Vit 36
H Tng Vinh 32
L Vn Vinh 13
Nguyn Trn Quc Vinh 75
Nguyn Vn Vinh 45
Phan Cng Vinh 50, 56, 62
Hong Vn V 42
Chu B V 25
L Anh V 23, 74
Nguyn Hong V 73
Nguyn Tn Tn Tht V 24, 41
Nguyn Vn V 38
Trng Tin V 39
Ng Minh Vng 49
Bi Th Thanh Xun 26
Trn Th Xun 13
Phm Cng Xuyn 10
Dng Th Hi Yn 76
Triu Yn Yn 36

83