1
2
TR NG I H C S PH M K THU T HNG YN HUNG YEN UNIVERSITY OF
TECHNOLOGY AND EDUCATION a ch : Dn Ti n, Khoi Chu, Hng Yn Tel:
03213-713015 Fax: 03213-713017 Website: http://www.utehy.edu.vn Gi
i thi u chung Tr ng i h c S ph m K thu t Hng Yn l m t tr ng i h c
cng l p tr c thu c B Gio d c v o t o, c pht tri n v i ln t truy n
th ng o t o theo nh h ng ng d ng; ang ti n t i v th c a m t tr ng i
h c a ngnh, tr ng i m v khoa h c v cng ngh c a khu v c ng b ng sng
H ng. Truy n th ng o t o theo nh h ng ng d ng - thng hi u c a nh tr
ng, c kh i ngu n t nm 1966 v i hai ngnh o t o chnh l C kh v i n. Th
i i m ny, tr ng c tn l Tr ng Trung h c Cng nghi p H i Hng. Nm 1979,
tr ng c i tn thnh Tr ng Cao ng S ph m K thu t I. Sau , c s u t v h
tr c a Chnh ph C ng ha Lin bang c, tr ng c nh ng b c pht tri n v t
b c, ngoi hai ngnh truy n th ng, nm ngnh m i c o t o bao g m: ngnh
Cng ngh thng tin, C kh ng l c, i n t , K thu t May v Th i trang, v
S ph m K thu t. T y, thng hi u c a nh tr ng c bi t n r ng ri trong
c ng ng. Sau 24 nm pht tri n, v th c a nh tr ng ti p t c c kh ng
nh. Nm 2003, Th t ng Chnh ph quy t nh nng c p tr ng thnh m t tr ng
i h c tr ng i m, a ngnh, a lnh v c v i cc ngnh o t o chnh: ngnh Cng
ngh Ha v Mi tr ng, Cng ngh thng tin, C kh, C kh ng l c, i n-i n t ,
Kinh t , K thu t May v Th i trang, Ngo i Ng v S ph m K thu t. Trong
, cc lnh v c nghin c u mi nh n c u tin pht tri n l cng ngh thng
tin, cng ngh sinh h c, cng ngh khoa h c v t li u (nano) v robotics.
Ngy 21 thng 12 hng nm l ngy H i truy n th ng c a tr ng. Hi n t i,
tr ng c 3 c s : C s 1 t i huy n Khoi Chu, Hng Yn C s 2 t i Ph N i,
M Ho, Hng Yn C s 3 t i 189 Nguy n Lng B ng, TP H i Dng 3
Tri t l gio d c v s m ng c a tr ng Phng chm hnh ng c a tr ng i h
c S ph m K thu t Hng Yn l: Nhn c, nhn ti, nhn tr th c Sng t o tng
lai, ph c v nhn dn Tr ng i h c S ph m K thu t Hng Yn l tr ng i h c
S ph m K thu t v Cng ngh tr ng i m c a khu v c ng b ng sng H ng, o
t o nh h ng ngh nghi p- ng d ng c ch t l ng cao cho cc chuyn ngnh
trong nh ng lnh v c: S ph m k thu t, cng ngh , kinh t , ngo i ng .
Nh tr ng l ni cung c p cho th tr ng lao ng i ng k s, k thu t vin,
gio vin k thu t, cn b nghin c u c trnh khoa h c cng ngh , k nng
chuyn mn, o c ngh nghi p gp ph n thc y s nghi p cng nghi p ha, hi n
i ha t n c, pht tri n kinh t x h i v n n gio d c i h c Vi t Nam. Cc
chng trnh v d ch v o t o chnh Cng ngh B o tr v B o d ng thi t b Cng
ngh Ch t o my Cng ngh C-i n t Cng ngh Hn v Gia cng t m Cng ngh Ha h
c Cng ngh K thu t i n Cng ngh K thu t i n t Cng ngh K thu t t Cng
ngh May v Thi t k th i trang Cng ngh Mi tr ng Cng ngh Thng tin/My
tnh Qu n tr Kinh doanh, K ton S ph m K thu t Cng nghi p Ti ng Anh
Ti ng Trung
4
H I TH O QU C GIA L N TH
13
M T S V N CH N L C C A CNG NGH THNG TIN V TRUY N THNGCH : CC CNG
NGH TNH TON HI N I
BO CO TM T T
Hng Yn, 19-20 thng 8 nm 2010
5
A method for data mining in incomplete information systemsHoang
Thi Lan Giao1, Nguyen Thi Lan Anh21
Department of Information Technology, College of Sciences, Hue
University, 2Department of Information Technology, College of
Pedagogy, Hue University
To deal with missing attribute values in incomplete information
systems, G.Busse used the characteristic relation instead of the
indiscernibility relation. Based on this relation and the
information theory, in this paper, we propose an algorithm to find
a reduct of an incomplete decision table and the other - HLEM
algorithm - to induce rules from it. Keywords: missing attribute
value, characteristic relation, rough entropy, reduct, rule
induction.
An introduction somedirections of modelchecking real programNguy
n Tr nh ng1, Trng Anh Hong21
Tr ng HDL H i Phng, 2Tr ng H Cng ngh -HQG H N i
Ki m ch ng m hnh c bi t nh cc phng php c t v ki m ch ng chng
trnh trong lnh v c cng ngh ph n m m. c nhi u phng php, ngn ng v cng
c dng c t v ki m ch ng chng trnh c xu t. Nh LTL, CTL, CTL*,
Promela, SMV, Alloy tng ng v i cc cng c Spin, NuSMV, Alloy
Analyzer, Ki m ch ng m hnh ang c quan tm nh m t gi i php h u hi u
trong vi c ch ng minh tnh ng n c a cc ph n m m c bi t l cc chng
trnh trong cc h th ng i h i chnh xc tuy t i. Tuy nhin, h n ch l n
nh t c a ki m ch ng m hnh l v n bng n tr ng thi v m hnh ph i c t
chnh xc h th ng c n ki m ch ng. Trong bi ny chng ti gi i thi u m t
h ng ti p c n khc l ki m tra tr c ti p m ngu n chng trnh v i thi t
k ban u m b qua b c chuy n m ngu n chng trnh v m hnh r i m i ki m
tra. Nh v y chng ta khng c n ph i ch ng minh xem m hnh c xy d ng t
m ngu n chng trnh c ng v i chng trnh ngu n hay khng. Keywords: LTL,
CTL, CTL*, Promela, Alloy, Verification, Model-checking, JPF, PEX.
6
nh h ng c a tham s cc gia t trong h lu t m phn l p d a trn i s
gia tDng Thng Long, Lng Cao ng, Trng Cng on Khoa Cng ngh Tin h c,
Vi n i h c M H N i H lu t m phn l p d a trn i s gia t (SGT) c xu t
trong [1,2] v c m t s k t qu nghin c u kh quan [3,18]. Theo ti p c
n trong [23,24], phng php sinh lu t d a trn s phn ho ch m theo cc
gi tr ngn ng trong SGT trn mi n cc thu c tnh t o nn khng gian phn
ho ch g m cc siu h p (hyperbox) c a bi ton, m i siu h p s c xem xt
sinh lu t n u n c ch a m u d li u. Nh v y k t qu phn ho ch s tc ng
l n n h lu t c sinh ra. Hn n a, cc gi tr ngn ng trong SGT c sinh b
ng cch dng cc gia t tc ng ln cc ph n t sinh [19,20,15]. i u ny cho
th y nh h ng r t l n c a cc tham s gia t n phng php sinh lu t nh
trn. Bi bo ny s t p trung xem xt, phn tch nh ng nh h ng c a cc gia
t cng nh tham s m c a chng n vi c phn ho ch m , t d n n hi u qu phn
l p c a h lu t c sinh ra i v i bi ton ng d ng. Cc th nghi m s c th
c hi n trn m t s t p d li u m u c a UCI. Keywords: Fuzzy
classification, hedge algebras, fuzzy rules, fuzzy rules
learning.
B ng cu v n trn cc quan h v x l cu v n tin trn b ngL Huy Th p Vi
n Cng ngh Thng tin, Vi n KH&CN Vi t Nam Chng ta chuy n cu truy
v n d ng quan h SQL sang cu truy v n i s quan h sau th hi n n b ng
m t b ng g i l b ng truy v n. Cc tiu hng (c t) s l cc quan h c s ho
c quan h trung gian ho c l k t q a th c hin cu v n tin. Cn cc cell
s l cc ton t th c hi n cc php ton i s quan h nh m sinh ra cc quan h
l tiu c a c t. Hn n a, cng v i tiu hng (c t) ta s g n m t tr ng s
no (l chi ph x l php ton trn quan h ); cc cellij cng c gn tr ng s
(l chi ph chuy n s li u t ton t i n ton t j). Minh h a x l cu v n
tin b ng b ng truy v n s c th c hi n cho vi c l p l ch truy v n, t
c l phn chia cc ton t (hng (c t)) cho cc b x l th i gian tr l i
truy v n nh nh t. 7
Vi c th hin cc cu v n tin b ng b ng t o ra kh nng x l n t t hn.
Khi c b ng th hi n cu v n tin, chng ta d dng dng cc thu t ton x l m
ng x l cu v n tin. X l cu v n tin, khi c th c hi n trn cc tr ng s
hng v n i dung cc cell l cch lm quen thu c v d dng cho cc l p trnh
vin. Cc thu t gi i Heuristic l p l ch t i u, cn b ng t i t i u, cng
hon ton c x l trn b ng cu truy v n.
B o v b n quy n cng khai cho cc c s d li u quan hBi Th H ng1, Lu
Th Bch Hng21
Vi n Cng ngh Thng tin, Vi n KH&CN Vi t Nam, 2Tr ng HSP H N i
2 n nay, t t c nh ng l c th y vn c s d li u quan h vo kha b m t v
th i h i ph i c m t kha b m t ng b n quy n. i u c ngha l b n quy n
ch c th c ng v c cng nh n tr c cng chng (v d tr c ta n).
Hi ud a minh ch minh ch
Tuy nhin, sau kha b m t ny b l v v v y th y vn nhng s d dng b ph
h y b i nh ng k t m. Trong bi bo ny, chng ti xu t m t l c th y vn v
v i l c ny b t c ai cng c th ch ng minh m t cch cng khai b n quy n
d li u bao nhiu l n ty . L c ny khng lm sai l ch d li u v th r t ph
h p th y vn b t k ki u d li u no v khng s g p ph i cc sai st.
B o v tnh ring t cho ng i s d ng cc d ch v d a vo v tr trn
mobileL Vn Sn1, Nguy n V21
Tr ng H S ph m N ng, 2Tr ng C Cng ngh Thng tin H u ngh Vi
t-Hn
Cng v i s pht tri n ngy cng tng c a cc thi t b di ng, cc nh cung
c p quan tm n cc d ch v d a trn v tr. V i cc d ch v d a trn v tr ng
i s d ng c th a ra m t s truy v n v khng gian xung quanh c a h b t
c ni no, vo b t c th i gian no. i u ny mang n nhi u thu n l i trong
vi c truy c p thng tin, cng nh ti t ki m th i gian v chi ph. Nhng n
cng l nguyn nhn c a nguy c xm nh p n tnh ring t c a ng i dng, c bi
t l 8
thng tin v v tr. b o v tnh ring t ny, m t trong nh ng cch ti p c
n i n hnh l che gi u khng gian v tr c a ng i dng. Trong bi vi t ny,
chng ti trnh by m t s v n lin quan n vi c ti p c n cc phng php che
gi u v tr nh bi u di n vng che gi u, k thu t che gi u v tr d a trn
tnh di ng ngn c n cc t n cng phn tch v t v nh gi k t qu truy v n.
Ti p theo, chng ti p d ng nh ng k thu t trn xy d ng m t h th ng h
ng d n du l ch trn a bn thnh ph N ng nh m h tr tra c u thng tin d a
trn v tr nh thng tin v my ATM, qun caf, nh hng, cho khch du l ch
trong khi v n b o m tnh ring t c a chnh h .
Bi n i Fourier trong thu t ton l ng tTr n Huy Th ng Khoa Cng ngh
Thng tin, Tr ng H Nng nghi p H N i Hi n nay ng i ta tm c kho ng 50
thu t ton l ng t (1) nhanh hn h n thu t ton c i n (2). Bi bo ny i m
l i cc thu t ton l ng t s d ng php bi n i Fourier trong 50 thu t
ton hi n nay qua rt ra khi qut chung v vi c s d ng php bi n i
Fourier.
Bi u di n c s c a h sinh nh x ngBi c Minh1, Lng Nguy n Hong
Hoa2, Cao Tng Anh3, Nguy n Gia Nh4, Nguy n Xun Huy51
Tr ng C GTVT Tp. HCM, 2C c Cng ngh Tin h c Nghi p v , B Cng an,
3Tr ng H KTCN Tp. HCM, 4Tr ng H Duy Tn, 5Vi n Cng ngh Thng tin, Vi
n KH&CN Vi t Nam
Nhi u k t qu trong tin h c l thuy t d a trn khi ni m nh x ng nh
m t ton t thi t l p tng ng gi a cc t p con c a t p h u h n cho tr
c, th a cc tin ph n x , ng bi n v ly ng. Vi c nghin c u t ng qut v
cc nh x ng cho php thi t l p m t s c u n i gi a cc lnh v c t ng nh
khc nhau nh c s d li u, cc h suy d n, logic, l thuy t t p th v t p
m . M i nh x ng c m t thng qua m t h suy d n g i l h sinh. Bo co
trnh by m t s k t qu m i lin quan n vi c bi u di n c s c a h sinh
nh x ng thng qua v tri t i ti u c a t p lu t sinh. K t qu ch y u c
a bo co l nh l cho php bi u di n m i c s K c a nh x ng d i d ng m t
h p LV, trong L l m t v tri t i ti u c a h sinh 9
ban u v V l m t c s m i c a h sinh nh n c thng qua m t php thu g
n h sinh ban u theo t p f(L). Ni chung, V nh hn K v t p lu t sinh
thu g n s nh hn t p lu t sinh ban u. T ng h p l i, thng qua m t dy
h u h n cc php thu g n lin ti p ta c th bi u di n c s K thnh m t dy
php h p c a cc v tri t i ti u v c s c a h sinh t i ti u L1L2LmV. K
t qu ny c th c v n d ng thu g n qu trnh l p lu n v suy di n trong
cc h suy d n.
Building CPI Forecasting Models by Combining Smooth Transition
Regression Model and Mining Association RulesDo Van Thanh1, Cu Thu
Thuy2, Pham Thi Thu Trang1 National Center for Socio-Economic
Information and Forecast, Ministry of Plan and Ivestment, 2Faculty
of Economic Information System, Academy of Finance Inflation
forecast plays a very important role for stabilizing the economy.
In Viet Nam, inflation is measured via consumer price index (CPI).
CPIs changes depend on many factors in which changes of
merchandises price are direct factors and it is not difficult to
observe these factors. CPI forecasting models based on the change
of merchandises price still have not been built. The purpose of our
research is to build these models. Specifically, in this paper we
will propose a new approach for building CPI forecasting models and
analyzing effects of the price changes of some merchandises on CPI
by applying the Nonlinear Smooth Transition Regression Model and
the Mining Association Rules. Test forecasting Results for the
built model showed features of the proposed approach. Keywords: CPI
Forecasting Model, Nonlinear Smooth Transition Regression.
Association Rules,1
Cc k thu t thi t k h th ng suy lu n mL B Dng1, Tr n M nh Tu
n21
Vi n CNTT, Vi n KH&CN Vi t Nam, 2Khoa CNTT, H Thi Nguyn Cc h
th ng suy lu n m c ng d ng r ng ri trong nhi u lnh 10
v c, c bi t l trong lnh v c m ph ng qu trnh v i u khi n. Vi c
thi t k cc h th ng suy lu n m r t quan tr ng. M t h th ng suy lu n
m c th c thi t k t tri th c chuyn gia ho c t d li u. M i k thu t
thi t k u c nh ng thu n l i v h n ch ring c a n. Bi ny phn tch cc
phng php chnh trong kh i t o cc lu t t ng v t i u ha c u trc. Chng
c nhm l i thnh cc h v c so snh theo cc tiu chu n v tnh di n gi i c
c a lu t.
Cc rng bu c trong s p x p th i kha bi u v qu n l gi ng d y trong
tr ng ph thngNguy n Tu Trung, Ng Hong Huy Vi n Cng ngh Thng tin, Vi
n KH&CN Vi t Nam Trong nh tr ng ph thng, l p k ho ch v qu n l
gi ng d y l cc cng vi c r t quan tr ng. Chng c th c hi n m t cch th
ng xuyn v lin t c trong m i nm h c. Trong vi c l p k ho ch gi ng d
y, ph c t p s p x p th i kha bi u t l v i s l ng cc yu c u rng bu c
c a gio vin, l p h c, mn h c, phng h c v phn cng gi ng d y c n ph i
th a mn. Vi c s ha cc yu c u rng bu c ny hi n ny hi n nay t c nh ng
thnh cng nh t nh nhng v n cha tri t , v n l m t v n m cho nh ng ai
quan tm. Bn c nh , vi c qu n l gi ng d y d a trn k ho ch gi ng d y
gip cho ng i qu n l n m c tnh hnh gi ng d y c a n v mnh. C th , l
vi c ki m sot ho t ng gi ng d y v th ng k ch t l ng d y c a cc gio
vin. Trong bi bo ny chng ti s gi i thi u t ng quan v vi c s ha cc
yu c u rng bu c v v n qu n l gi ng d y trong tr ng h c.
C i thi n gi i thu t MRSI thng qua i u khi n m c h i tTr n H ng
Quang Khoa CNTT, H c vi n KTQS Gi i thu t MRSI tri n khai trn d li
u t p m u MD5 t hi u 11
qu kh cao, tuy nhin v i t p m u nh phn th qu trnh h i t di n ra
r t nhanh lm gi m t c c a gi i thu t. Bo co trnh by phng th c i u
khi n m c h i t trn MRSI gip tng t c trn t p m u l n.
Clustering Objects in Object-Oriented Databases based on vector
spaceTrng Ng c Chu Khoa Cng ngh Thng tin, Tr ng H Bch Khoa, H N ng
Clustering objects in the storage is an important problem in
Object-Oriented Database. Based on the relationship sets found in
the system, we describe the objects as vectors in m-dimensional
space, where m is the number of relationship sets found. After
that, we define a distance between pairs of objects in oder to
build a clustering sequence of all objects existing in the system
with their smallest total distance. Keywords: object-oriented
database, clustering objects.
Combining DEMO models with RAD's techniques in the analysis
phase of software development processNguyen Hoang Thuan1, Jan
L.G.Dietz2, Tran Van Lang3 1Can Tho In-service University, 2Delft
University of Technology, the Netherlands, 3Vietnam Academy of
Science and Technology The software development process needs to be
improved due to the high failure rate of software projects. In main
reasons of this failure, there are two reasons, the first one is
lacking of business process modeling, and the second one is poor
requirements definition in the software development process, which
are however not satisfactorily resolved yet. This paper analyses
the potentials to solve these issues by combining RAD (Rapid
Application Development) and DEMO (Design and Engineering
Methodology for Organizations). In particular, it creates a new
framework for the 12
analysis phase of RAD. It is shown that the new framework can
capture the business process modeling of the organization before
developing its supporting information systems. In addition, by
comparing between the requirements definition with the business
processes, the new framework can improve the requirements
definition in the software development process.
Cng c qu n l kho cu h i tr c nghi m theo chu n QTI v i h qu n tr
c s d li u XMLNguy n nh Ha, Ng c Minh Vi n Cng ngh Thng tin, HQG H
N i Chu n QTI i v i cc h th ng st h ch tr c nghi m b ng my tnh c
vai tr tng t nh chu n SCORM v i cc h th ng o t o i n t
(e-learning). Nghin c u ny trnh by m t m hnh h th ng kho cu h i tr
c nghi m theo chu n QTI, s d ng cc cng c ph n m m m ngu n m c quy m
nh , g n nh , d dng tri n khai b c u khuy n khch pht tri n chu n
QTI. M hnh xu t l m t ng d ng web v i c s d li u nguyn sinh XML
eXist v ngn ng XQuery cho php pht huy l i th qu n tr n i dung cc ti
li u XML. Ki n trc MVC mang l i cho h th ng tnh linh ho t cao, m l
nh ng n g n v d b o tr.
m b o tnh ring t trong khai ph lu t k t h pinh Th Thu Hng Khoa
Cng ngh Thng tin, Tr ng H Th D u M t Hi n nay, Khai ph d li u v Pht
hi n tri th c l m t lnh v c nghin c u t c nhi u thnh cng. Cng v i s
bng n thng tin qua internet v cc phng ti n truy n thng th v n chng
ta ph i i m t l vi c b o m t nh ng thng tin nh y c m, thng tin ring
t. Trong bi bo ny ti nghin c u thu t ton Blocking khai ph lu t k t
h p m b o tnh ring t c a d li u v c a nh ng tri th c c rt ra sau
khi x l khai ph d li u.
13
xu t m t s thay i trn thu t ton SOM p d ng cho phn c m d li uL
Anh T, L Vi t c H Thi Nguyn Hi n nay c r t nhi u gi i php th c hi n
vi c phn c m d li u. Trong c cc gi i php v phn c m d li u r v phn c
m d li u m . Trong bi bo ny chng ti c tm hi u m t s gi i php c, v i
su vo nghin c u gi i php phn c m d li u s d ng m ng SOM, m t trong
nh ng thu t ton h c khng c n b t c s gim st bn ngoi no. T c xu t m
t s thay i trong thu t ton SOM v ci t th nghi m.
i u khi n robot v i m ng n ron RBF c t i u b ng d i thu t di
truy nNguy n Tr n Hi p1, Ph m Th ng Ct21
H c vi n K thu t Qun s , 2Vi n Cng ngh Thng tin, Vi n KH&CN
Vi t Nam
G n y, m ng hm bn knh c s (RBF) c s d ng kh r ng ri khi s d ng m
ng nron lm b i u khi n cho cc i t ng c nhi u tham s b t nh nh cc lo
i robot. i u quan trong nh t khi s d ng m ng nron h c online l l a
ch n h s cho m ng c t c h i t nhanh. T tr c n nay h s ny v n c ch n
theo kinh nghi m v nhi u khi cng m t kh nhi u th i gian tm c m t h
s h c tho mn yu c u c a bi ton i u khi n. M t v n n a l, khi tm c h
s h c tho mn c yu c u c a bi ton i u khi n r i, chng ta cng cha th
k t lu n c h s l t i u nh t. Bi bo ny c p n vi c s d ng d i thu t
di truy n (GAs) tm c h s h c t i u cho m ng RBF khi c s d ng lm b i
u khi n cho cc i t ng c cc tham s b t nh.
nh tuy n t i u trong m ng v tuy n Ad-HocNguy n Duy Tn, Ph m Minh
Chu n Khoa Cng ngh Thng tin, Tr ng HSPKT Hng Yn Cng ngh m ng v tuy
n Ad Hoc hay cn g i l m ng MANET (Mobile Ad Hoc Network) c nhi u u
i m n i tr i th 14
hi n tnh tnh phn tn, tnh di ng, tnh t t ch c v tnh thch ng. Cc
nt tham gia m ng c vai tr v a l my ch , v a l my khch l i v a l b
nh tuy n, nn t i cc nt m ng s d ng cc giao th c nh tuy n khm ph tuy
n, tm ng i cho cc gi tin. C cc phng php nh tuy n th ng dng l nh tuy
n theo b ng, nh tuy n theo yu c u v lai ghp, ni chung cc phng php
nh tuy n ny u s d ng phng php g i pht trn ([1],[3],[5]) khm ph tuy
n v c p nh t thay i hnh m ng. Phng php g i tin nh n pht trn tiu t n
qu nhi u bng thng, nng l ng m ng i u ny d n n hi u nng ho t ng m ng
km hi u qu , ngu n nng l ng nhanh b h t m cc nt m ng Ad Hoc ch y u
dng ngu n nng l ng l pin. Trong bo co ny chng ti xin gi i thi u m t
phng php lm h n ch thng tin g i pht trn b ng cch s d ng b chuy n
pht a i m MPR (Multipoints Relay) c s d ng trong giao th c nh tuy n
t i u theo tr ng thi ng lin k t OLSR (Optimized Link State Routing)
ng d ng cho m ng v tuy n Ad Hoc.
o m lo i hai v ng d ng trong thu t ton phn ng ng nhNguy n M u
Uyn1, Ng Thnh Long1, Bi nh H21
Khoa CNTT, H c vi n KTQS, 2Phng Khoa h c Cng ngh , H c vi n H uc
n
T p m lo i hai l s m r ng t t p m lo i m t v i u i m l kh tnh
khng ch c ch n (uncertainty) trong cc h th ng th c. nh l m t trong
nh ng u vo c tnh khng ch c ch n cao, do x l nh l m t trong nh ng
lnh v c ng d ng hi u qu c a t p m lo i hai. Bi bo trnh by m t phng
php tnh o m c a nh s d ng t p m lo i hai t ng qut. T ng d ng vo thu
t ton tm ng ng t ng v phn ng ng nh, l b c ti n x l quan tr ng lm c
s cho cc ng d ng x l nh. Phng php xu t c th nghi m v so snh k t qu
v i cc phng php phn ng ng nh khc ch ng minh u i m v kh khng ch c ch
n c a t p m lo i hai.
15
o tng t gi a cc i t ng trong c s d li u h ng i t ngNguy n Th Kim
Anh1, Ph m Th Kim Ngoan21
Tr ng H Bch khoa H N i, 2Tr ng H Nha Trang
Nhi u phng php trong khai ph d li u c n s d ng n o tng t gi a cc
i t ng. i v i cc c s d li u (CSDL) h ng i t ng, m t i t ng d li u
bao g m nhi u thu c tnh: thu c tnh nguyn t , thu c tnh ph c v c thu
c tnh tham chi u. Hi n nay, c m t s nghin c u v o tng t gi a cc i t
ng; song nh ng k t qu nghin c u m i ch d ng l i vi c a ra cch tnh
tng t gi a cc i t ng theo cc thu c tnh ki u s , ho c l so snh tng t
gi a cc i t ng d a trn phn c p l p. Trong bo co ny, chng ti xu t
cch tnh tng t gi a cc i t ng bao g m cc thu c tnh nguyn t , ph c v
cc thu c tnh tham chi u. Trong , tng t c a thu c tnh nguyn t (ki u
phi s ) c tnh d a trn phn c p kho ng cch, thu c tnh ph c (t p h p)
c tnh trn c s t i n ng ngha.
th chnh quy m nh n = 7(2 p + 1) nh v i 2 p + 1 l s nguyn tV nh
Ha1, Minh Tun21
Khoa CNTT, Tr ng HSP H N i, 2Khoa T nhin, Tr ng CSP Nam nh
Ta ni r ng th chnh quy G v i n nh b c r 1 l m t th chnh quy m nh
n u t n t i hai s khng m v nguyn sao cho Si S j = v i m i c p nh k
nhau i , j v Si S j = v i m i c p nh khng k nhau i , j . Sk k hi u
cho ln c n c a nh k . y chng ta s m t cc ch s n, r , , trong th
chnh quy m nh c n = 7(2 p + 1) nh v i 2 p + 1 l s nguyn t Keywords:
Strongly regular graph, conference graph, integral graph.
16
D bo n r y theo th i gianV Duy Linh1, L Quy t Th ng2, Hunh Xun
Hi p2 1 Khoa Khoa h c T nhin, Tr ng H C n Th, 2 Khoa Cng ngh Thng
tin & Truy n thng, Tr ng H C n Th S d ng cng c cng ngh thng tin
trong m hnh ha cng tc d bo d ch h i, nh t l i v i s xu t hi n c a r
y nu l m t v n c p thi t hi n nay t i khu v c pha Nam trong ngnh b
o v th c v t. Vi c d bo c kho ng th i gian no r y di tr r a ra l ch
n r y s gip cho cc chuyn gia cng nh ng i nng dn ch ng trong vi c xu
ng gi ng ng lo t trn di n r ng. M i quan h gi a vi c xu t hi n r y
nu v cc tc ng c a mi tr ng l m t ti p c n c nhi u chuyn gia trong
ngnh b o v th c v t p d ng v c cng nh n l m t ti n b khoa h c hi n
nay. Trong bi bo ny chng ti xu t h ng ti p c n d bo m i, l s d ng m
ng Bayes k t h p v i h i quy d bo kh nng r y di tr t nh vo kho ng
ngy no trong m i thng, lm c s ra l ch s gi ng n r y cho v m i. K t
qu thu c t m hnh ny s h tr cho cc chuyn gia Trung tm b o v th c v t
pha Nam trong cng tc ch o gieo s m t cch ng lo t c a m t khu v c
canh tc c th , th i m cho 22 t nh thnh pha Nam. T kha: r y nu, n r
y, m ng Bayes, b ng CPT (Conditional Probability Table), suy di n,
h i quy, m ng Bayes theo th i gian, d bo.
D bo s bi n i c a m t s thng s th i ti t v i ng d ng c a m ng
nron nhn t oNguy n Tn n1, Nguy n Quang Hoan21
Khoa CNTT, Tr ng H S ph m H N i, 2Khoa CNTT, Tr ng H SPKT Hng
Yn
Bi bo gi i thi u m t m hnh h d bo s bi n i c a m t s thng s th i
ti t dng m ng nron nhn t o. S kh i c a m hnh, v n hu n luy n m ng,
v n tm ra nh ng tham s h p l cho m hnh nh s nron l p n, ph m vi gi
tr kh i t o cc tr ng s , t c hu n luy n m ng cng c th o lu n cho m
t bi ton th c t v c xc nh b ng th c nghi m. H th ng d bo v i cc gi
tr cc tham s v a tm c lm vi c t t. K t qu d bo c x nh b ng cch ch y
th ng th i c so snh v i d li u th ng k th c t . 17
T kha: M ng nron nhn t o, d bo, d bo th i ti t, thu t ton lan
truy n ng c.
Dng phng php bi n i Wavelet Packet v th ng k b c cao HOS tch v
nh v xung radar trong mi tr ng nhi uNguy n Thnh Nhn, Hong nh Chi n,
Thi Quang Tm, Ng Vn Bnh Khoa i n-i n t , Tr ng H L c H ng Tch v nh
v tn hi u y u l cc v n c b n v quan trong trong cc h th ng radar.
Radar s cho kh nng m nh hn n u t s tn hiu trn nhi u SNR ng ra my
thu c gia tng. nh v tn hi u thu c l nhi m v quan tr ng tch tn hi u
ra kh i nhi u. Sai l ch trong vi c nh v tn hi u thu c th d n t i vi
c o c ly m c tiu sai. ti ny nh m ngh m t thu t ton trong k t h p
hai cng c m nh l php phn tch wavelet v php th ng k b c cao HOS (cng
c th c hi n vi c phn tch cc thnh ph n c l p ICA) tch v nh v xung
radar kh i n n nhi u. Vi c s d ng cc k thu t c ngh s hy v ng s gip
cho vi c tch v nh v xung radar trong i u ki n c SNR r t th p nh gi
m cng su t pht x hay ni cch khc l m r ng c ly pht hi n c a cc h th
ng radar v cho php tch ngay v i cc Radar qut nhanh - Radar n
xung.
Examining the Factors influence to successful of Ecommerce
activities in VietnamNguy n Ti n Dng Tr ng H S ph m K thu t Hng Yn
At the present, Business-to-Consumer Electronic Commerce,
Business-to-Business Electronic Commerce and Electronic Business
are widely adopted as new strategies to gain more business
advantages over the competitors, its will bring many success for
business and customer. Beside that, the success in deploying such
electronic business applications does not rely only on business
contribution but involves many business factors as well. The
purposes of the paper are mainly to identify the potential common
and specific factors dealing with the success of implementing
18
Business-to-Consumer Electronic Commerce, Business-to-Business
Electronic Commerce and Electronic Business, as well as to provide
the guidelines for achieving the development of these applications.
Principally, the factors are organized into a class of factors:
ecommerce strategies factors, customer knowledge and readiness
factors, privacy and trust factors, system quality factor,
information quality factor, service quality factor, intention to
use/use, use satisfaction factor and e-commerce succes factor.
Finally, the results of the study will give a useful direction for
the future development of Electronic Commerce and Electronic
Business in Vietnam business environment suit with new challenges
in new century. Keywords: E-commerce, Business-to-Business,
Business-toConsumer, IS success model, e-commerce strategies,
customer knowledge, customer readiness, privacy, trust, system
quality, information quality, service quality, intention to use,
user satisfaction, e-commerce success.
Gi i php xc th c RSA SECURID cho INTERNET BANKINGV nh Ha1, ng Th
Thu H21
Khoa CNTT, Tr ng HSPHN, 2Khoa Ngo i ng - Tin h c, Tr ng H Hoa
L
Lnh v c ti chnh ngn hng lun c m t s i h i kh t khe v s an ton
trong cc giao d ch, ho t ng c a h th ng h t ng cng ngh khi tri n
khai cc d ch v khch hng. R i ro trong giao d ch Internet Banking
cng ch y u l nh c p thng tin c nhn, m t kh u, l a o chuy n ti n t i
m t ti kho n no c ch . Gi i php xc th c b ng m t kh u thng th ng
khng b o m t v qu n l kh khn, trong khi cc gi i php xc th c PKI d a
trn th thng minh ho c qua d u vn tay qu ph c t p v t n km tri n
khai r ng ri t i ng i s d ng. Trong bo co ny chng ti gi i thi u Gi
i php xc th c RSA SecurID cho Internet Baking l s l a ch n ph h p,
t i u cho cc ngn hng, v a m b o b o m t cao nhng l i d dng trong vi
c tri n khai. Cc thu t ton c i ti n cho RSA SecurID nng cao tnh b o
m t cho gi i php ny. T kha: gi i php xc th c, authentication
solution, RSA SecurID, Internet Banking. 19
Gio d c o t o k s ph n m mNg Trung Vi t1, John Vu21
Vi n Cng ngh Thng tin, Vi n KH&CN Vi t Nam,2
Carnegie Mellon University
B c sang th k 21, ton th gi i i vo nh ng bi n i l n trn nhi u
phng di n v nhi u chi u. Nh ng bi n i trong cc cng ngh s n xu t em
t i nh ng phng php v cng c lm vi c m i, thay i cc quan h v n c
trong cc t ch c, trong x h i. c bi t cng ngh thng tin bi n i t vai
tr h tr sang vai tr chi n l c v t o kh nng m i cho m i t ch c. S xu
t hi n c a Internet v cc ng d ng ton c u t o i u ki n cho ton c u
ho pht tri n, lm bi n i hnh thi ki n trc doanh nghi p v cc t ch c.
i u ny a nhi u n c chuy n d n t cc hnh thi x h i khc nhau sang giai
o n pht tri n x h i thng tin v tri th c. Vai tr c a thng tin v tri
th c v i t cch l ti s n chnh c a th i i ang ngy cng tr thnh n n t
ng cho m i ng thi pht tri n c a t ng c nhn, t ng t ch c - doanh
nghi p v t ng qu c gia. Nh ng bi n i m i t ra nh ng i h i thay i cn
b n i v i h th ng gio d c xem nh mi tr ng nui d ng ngu n tri th c v
k nng m x h i c n t i. M t khc i u ny cng a t i nh ng bi n i cn b n
trong cch t ng c nhn nhn nh n v tri th c v k nng c a mnh, v cch u t
v pht tri n chnh nng l c c a mnh lun thch ng v i nh ng i h i m i c
a x h i thng tin tri th c.
H th ng g i tin t c NEWSARDLng Xun Bch, Nguy n Nh t Quang Vi n
Cng ngh Thng tin v Truy n thng, Tr ng H Bch Khoa H N i Trong bi bo
ny, chng ti xu t m t phng php g i tin t c, ho t ng theo m hnh y
(the push model), cho php h th ng t ng cung c p k p th i nh ng tin
t c ph h p nh t v i nhu c u v s thch c tin c a m i ng i dng. Phng
php g i ny h tr ng i dng g n km cc ch gi i (tags) cho cc tin bi, v
khai thc cc thng tin ch gi i ny tnh ton t p g i ph h p. h tr ng i
dng ch gi i m i tin bi quan tm, h th ng tnh ton v a ra g i m t t p
nh ch n l c g m cc ch gi i ph h p nh t v i: i) n i dung c a tin bi
20
hi n t i, v ii) s thch c tin c a anh ta. H th ng tnh ton t p ch
n l c cc ch gi i ny d a trn phng php h c my suy di n theo tr ng h p
(case-based reasoning). Vi c khai thc thng tin ch gi i cng v i n i
dung c a tin bi s gip h th ng hi u r hn v nhu c u v s thch c tin c
a ng i dng, nh s a ra cc g i tin bi ngy cng ph h p hn. Chng ti cng
gi i thi u Newsard, m t h th ng t ng g i tin t c ti ng Vi t cho ng
i dng, c ci t d a trn phng php c xu t.
H th ng pht hi n v ch ng xm nh p trn c s m ng nronL Vn Sn1, ng
Quang Hi n21
Tr ng HSP, H N ng, 2Khoa Khoa h c My tnh, Tr ng C CNTT H u ngh
Vi t - Hn
C nhi u lo i h th ng pht hi n xm nh p khc nhau v bi bo ny ni v m
t phng php m i l s d ng gi i thu t SOM (SelfOrganizing Maps). Gi i
thu t ny s d ng cc dn n-ron n m b t c trng m u c a lu thng m ng bnh
th ng. Phng php ny m t m t h th ng pht hi n xm nh p c nh bo th i
gian th c s d ng s t t ch c (SOM). H th ng s d ng m t c u trc SOM
phn lo i d li u m ng Ethernet th i gian th c. M t cng c h a s
monitoring nhm d li u ph n nh ho t ng c a m ng. Cc thng s h th ng
khc nhau ch ng h n thu th p d li u, ti n x l d li u v c u trc phn
lo i c nghin c u. H th ng cho th y kh nng c a n trong vi c phn lo i
bnh th ng v khng bnh th ng trn m t my ch xc nh.
H th ng thng tin ph c v bnh n gi v ki m ch l m pht Vn Thnh Trung
tm Thng tin v D bo KT-XH Qu c gia, B K ho ch v u t M c ch c a bi bo
ny l gi i thi u H th ng thng tin ph c v cng tc i u hnh tc nghi p v
h tr cc qu trnh ra quy t nh, xy d ng ban hnh chnh sch v lnh v c bnh
n gi v ki m ch l m pht d a trn th c ti n s li u c a n n kinh t lm
cn c v a c xy d ng B Cng thng. 21
H th ng nh v y g m 3 c u ph n c b n: c s d li u ph c v cng tc i
u hnh tc nghi p c xy d ng theo m hnh quan h nh m thu th p s li u v
bi n ng gi c v m t s ch tiu kinh t t nhi u a phng, lu tr , x l, t
ng h p v ph bi n thng tin v bi n ng gi; c s d li u ph c v phn tch v
d bo nh ng v n ch y u v bi n ng gi v l m pht th c ch t l c s d li u
ch (data mart) c xy d ng d a trn m hnh hnh bng tuy t; ph n m m d bo
nng l c s n xu t m t s s n ph m ch y u, l m pht v gi c c a m t s m
t hng thi t y u c a i s ng dn sinh, m t s m t hng xu t nh p kh u ch
o c a n n kinh t c pht tri n d a trn m hnh d bo c xy d ng trn c s k
t h p ng d ng k thu t pht hi n lu t k t h p m u m v i m hnh h i quy
chuy n ti p trn phi tuy n ho c c d a trn m hnh lm trn hm m chu i th
i gian Holt-Winter.
H th ng tra c u t bi n gen VN-DBSNPNguy n Vn nh, Ph m H Th y1,
Tr n Vn Lng, Vn Long, Hunh Th M Trang, Nguy n Th Thu D , L Vn Vinh,
Ninh Khnh Trung, Trang H ng Sn21
Tr ng H Nng nghi p I H N i, 2DSLab, Vi n C h c v Tin h c ng d
ng
SNP l m t s bi n i thnh ph n c u trc c a chu i DNA x y ra khi m
t Nucleotid A, T, C ho c G (trong b gen ho c m t trnh t khc), khc v
i a s trong m t loi. S khc bi t ch x y ra t i v tr c a m t
Nucleotid, g i l i m t bi n SNP (Single Nucleotide Polymorphism, t
m d ch l i m a hnh n nucleotide). Vi c khc bi t ny l nguyn nhn gy
ra kh nng nhi m m t s b nh trn ng i v gia sc ho c t o ra kh nng
khng su b nh cy tr ng. Hi n t ng bi n i trn cng lm cho m t s virus
c kh nng khng thu c. Vi c nghin c u t bi n gen SNP hi n l tiu i m
thu ht s quan tm c a nhi u nh khoa h c v cc t ch c nghin c u. Cc
thnh t u thu c trong lnh v c nghin c u ny c ng d ng v em l i nhi u
k t qu to l n trong nghin c u c u trc DNA, l p b n gen c a con ng
i; trong nghin c u phng ch a b nh cho con ng i v v t nui, cy tr ng;
trong nghin c u t o cc gi ng v t nui, cy tr ng m i c kh nng cho nng
su t, ch t l ng cao ng th i ch ng c su b nh v cc virus gy b nh. Cc
nh khoa h c th gi i v ang xy d ng m t c s d li u 22
v SNP c tn l dbSNP v tch h p trong c s d li u v gen c a NCBI. T
i h i th o Chu Thi bnh dng l n th 5 v Di truy n h c t i Pattaya
Thai lan, Hi p h i SNP chu kh i x ng vi c xy d ng CSDL SNP cho chu
, theo , m i qu c gia, bao g m Nh t b n, Trung qu c, Hn qu c, n ,
Singapore, Malaysia v Thi lan..., c n xy d ng m t CSDL SNP c a mnh,
trao i thng tin v SNP, k thu t ghi chp SNP v cc cng c tin sinh h c
phn tch s lin quan gi a SNP v b nh t t. Hi n nay, cc nghin c u v
SNP c a n c ngoi t p trung ch y u vo gi i m b gen con ng i. Vi c i
su vo nghin c u t bi n gen SNP i v i v t nui v cy tr ng cn t c
nghin c u hn. Cc ti v cng trnh nghin c u v SNP trong n c th ng t p
trung vo nh ng m c tiu c th , d li u v k t qu c lu tr phn tn. Nh v
y, vi c xy d ng m t CSDL v SNP i v i v t nui cy tr ng t i Vi t nam
l th c s c n thi t v c p bch. Chnh v nh ng l do , nhm nghin c u
Tin-Sinh h c c a tr ng i h c Nng nghi p H N i cng v i nhm nghin c u
DSLab c a Vi n C h c v Tin h c ng d ng TP HCM ph i h p nghin c u xy
d ng m t c s d li u v t bi n SNP cho m t s v t nui v cy tr ng tiu
bi u Vi t nam v i tn g i VN-dbSNP. C s d li u ny s c t t i tr ng i
h c Nng nghi p H N i, k t n i qua m ng Internet cc nh nghin c u, cn
b gi ng d y v sinh vin h c t p trong lnh v c cng ngh sinh h c trong
v ngoi n c c th d dng khai thc v chia s d li u v t bi n SNP, c bi t
l nh ng d li u c th lin quan n nh ng cy tr ng v t nui ch y u c a Vi
t nam. T kho: Tin sinh h c, ngn hng d li u.
Hi n th c ha m t m u thi t k b ng m t chuy n m hnhChu th Minh Hu
1, ng c H nh21
Khoa CNTT, Tr ng HSPKT Hng Yn, 2Khoa CNTT, Tr ng H Cng ngh , HQG
H N i
Trong cng ngh ph n m m, m t m u thi t k (Design pattern) l m t
gi i php t ng th cho cc v n chung trong thi t k ph n m m, n ng m t
vai tr quan tr ng. M t m u thi t k khng ph i l m t thi t k hon thi
n m ta c th chuy n i tr c ti p thnh m chng trnh. M n l m t m t hay
l s n (template) m t cch th c gi i 23
quy t m t v n m c th c s d ng trong nhi u tnh hu ng khc nhau.
Design pattern l m t k thu t dnh cho l p trnh h ng i t ng. N cung c
p cho ta cch t duy trong t ng tnh hu ng c a vi c l p trnh h ng i t
ng, v phn tch thi t k h th ng ph n m m. Cc m u thi t k h ng i t ng
thng th ng cho th y cc m i quan h v s tng tc gi a cc l p hay cc i t
ng, m khng c n ph i ch r cc i t ng c a t ng ng d ng c th . Pattern
c hi u theo ngha ti s d ng t ng hn l m l nh, n cho chng ta bi t hi
u bi t chung v cc v n ki n trc ph n m m. Ngoi ra, pattern cng cung
c p nh ng thu t ng v khi ni m chung trong thi t k , gip chng ta hnh
dung ra b c tranh c a gi i php ph n m m, n u p d ng d ng pattern hi
u qu th vi c b o tr ph n m m cng c ti n hnh thu n l i hn, n m b t
ki n trc h th ng nhanh hn. Pattern h tr ti s d ng ki n trc v m hnh
thi t k ph n m m theo quy m l n. Pattern a tng thch. Pattern khng
ph thu c vo ngn ng l p trnh, cng ngh ho c cc n n t ng l n nh J2EE c
a Sun hay Microsoft. NET Framework. Ti m nng ng d ng c a pattern l
r t l n. Cc thi t k d a trn pattern c s d ng kh nhi u cc ph n m m m
ngu n m , trong n n t ng J2EE ho c. NET... Trong cc d ng ng d ng
ny, c th d dng nh n ra m t s tn l p ch a cc ti n t ho c h u t nh
Factory, Proxy, Adapter... Trong ph m vi bi bo nhm tc gi xin trnh
by cc v n sau: T ng quan v m u thi t k M u thi t k Proxy pattern S
d ng php ton OCL th c hi n lu t chuy n hi n th c ha m t m u thi t k
b ng m t chuy n m hnh.
H c my tr c tuy n v ng d ng trong pht hi n, theo di & nh n d
ng i t ngNguy n ng Bnh Khoa Cng ngh thng tin, Tr ng H Khoa h c Hu H
c my tr c tuy n (On-line Learning) ang tr nn m t v n 24
thi t y u cho nhi u nghin c u trong lnh v c th gic my tnh i v i
th gi i th c. M t s l ng d li u dng trong hu n luy n m u c s n ngy
cng gia tng m t cch nhanh chng m th i gian dnh hu n luy n ngo i tuy
n (off-line) r t m t nhi u th i gian. Cc thu t ton tr c tuy n x l m
t lc ch m t m u d li u, v v y, n cng thch h p hn v i cc nghin c u c
d li u l n. Thm vo c nhi u ng d ng m hu n luy n m u theo cch tr c
tuy n l m t l a ch n thch h p ( d li u sinh ra theo cch h c c a tr
c tuy n). H c tr c tuy n c th thch nghi v p ng v i cc thng tin m i
vo c s tri th c hi n c. Ni m t cch khc, g n y cc nghin c u v h c tr
c tuy n cho th y s c m nh c a n v ti m nng ng d ng cn r t l n. Cc
phng php h c ngo i tuy n ng r ng qu trnh hu n luy n v nh gi l c tch
bi t. Hu n luy n b phn lo i theo cch tr c tuy n c hi u l khi c d li
u n th cho php k t h p vo cc giai o n trong qu trnh hu n luy n. S
khc bi t chnh gi a h c ngo i tuy n v tr c tuy n trong hu n luy n c
a cc thu t ton Boosting l cch m d li u thu nh n c v a d li u vo
trong qu trnh h c v lm th no xy d ng cc b phn lo i (classifiers).
Theo hu n luy n ngo i tuy n th d li u ph i c s n v cho tr c. Hu n
luy n theo cch ngo i tuy n th m i b phn lo i y u s c b sung sau m i
vng l p cn trong hu n luy n tr c tuy n th b phn lo i s c kh i t o
lc ban u v c c p nh t b i m i m u c a vo hu n luy n. Trong bi ny
chng t p trung vo cc thu n ton tr c tuy n Boosting dng cho vi c l a
ch n cc c tnh ng d ng trong pht hi n, theo di v nh n d ng i t ng tr
c quang cng nh c p n tnh h u hi u, chnh xc v cc l i ch c a phng php
h c my ny mang l i.
Improving negative selection algorithm in artificial immune
system for virus detectionNguyen Van Truong Pedagogical University,
Thai Nguyen University The field of Artificial Immune Systems (AIS)
concerns the study and development of computationally interesting
abstraction levels of the biology immune system. This paper
presents overview of biology immune system theory, general AIS
model, and applications of AIS. Besides, recent our research
achievement and some future research directions in the area are
also given. 25
IT solutions supporting telecommunication companyNguyen Hoang
Tien Warsaw School of Economics Efficient managerswork is to
explain data acquired and processed by transactional and analytical
IT systems, then to make proper decisions based on rational
information. IT systems make it easy to acquire data (OLTP and Data
Warehouses), perform multidimensional analyses (BI, OLAP) and
reduce time to make a decision. The use of MS Excel to analyse
company performance is advantageous as this application is easily
available and easy to use, with functionality including
calculations and charts. However, up-todate BI systems are much
more sophisticated (therefore more expensive) solutions to perform
multi-dimensional analyses supporting company management processes.
Key words: IT (Information Technology), OLTP (Online Transactional
Processing), BI (Business Intelligence), OLAP (Online Analytical
Processing), EWS (Early Warning System), ETL (Extract, Transfer,
Load), Managerial Cockpit.
K t h p n i suy v i bi n i l p trong php o h s PAR c a h th ng
truy n d li uPh m Ng c Th ng Khoa i n-i n t , Tr ng H S ph m K thu
t Hng Yn Bi bo a ra cc thu t ton ng d ng phng php n i suy b c 2 qua
3 i m d li u k ti p k t h p v i bi n i l p nng cao chnh xc trong
php o h s PAR c a h th ng truy n d li u. Cc gi i php xu t s c ki m
ch ng v nh gi sai s b ng m ph ng my tnh.
Kh nng s d ng t i u h lu t trn c s tham s ho m hnh sam v ng d ng
trong i u khi n mNguy n Duy Minh Khoa Cng ngh Thng tin, H Thi Nguyn
Trong cc h th ng i u khi n thng minh, vi c i u ch nh tham s h ng n
t i u c ngha quy t nh n ch t l ng v hi u qu 26
c a h th ng i u khi n. Nh ng nghin c u g n y [1,2,3,4] cho th y
ti p c n i u khi n d a trn i s gia t v i m hnh SAM ( Semantization
Associate Memory ) c kh nng mang l i hi u qu t t hn so v i i u khi
n m truy n th ng. Bi bo ny a ra m t phng php i u khi n hon ton m i
cho php nng cao ch t l ng i u khi n qua vi c t i u h lu t trn c s
tham s ho m hnh SAM h ng n t i u, cc tham s nh l ng ng ngha sau khi
t i u c b sung vo m hnh SAM thay cho vi c t i u ha cc tham s th hi
n tnh m c a cc gia t [8,12]. K t qu nghin c u c p d ng cho bi ton i
u khi n con l c ng c.
Khai thc lu t k t h p phn tn c tr ng sL Vn Sn1, Nguy n ng
Huy21
Tr ng H S ph m, H N ng, 2Ban o t o i h c, H N ng
Hi n nay, lnh v c khai thc lu t k t h p c tr ng s ang c cc nh
chuyn mn quan tm nghin c u [2,5], c bi t l khai thc lu t k t h p c
tr ng s trong mi tr ng phn tn, trong vi c p d ng tr n v n phng php
x l d li u t p trung t ra khng ph h p. Hn n a, trong mi tr ng phn
tn qu trnh x l thng tin (chng trnh, d li u) c phn b trn cc a i m
khc nhau. Vi c p d ng cc thu t ton song song cho x l d li u phn tn
cn nhi u h n ch , c bi t l chi ph trao i d li u gi a cc kho phn b
trn cc Server khc nhau qua ng truy n v i kh i l ng r t l n. Bi bo
ny nh m vo vi c xy d ng gi i php kh thi khai thc lu t k t h p c tr
ng s trong mi tr ng phn tn d a trn cng ngh tc t di ng h tr cho cc
doanh nghi p ho ch nh cc chi n l c kinh doanh.
Kh o st cc thu t ton v ng d ng trong Model CheckingTr n Anh Ti1,
Hunh Quy t Th ng1, Nguy n Minh Qu21
Tr ng H Bch Khoa H N i, 2Khoa CNTT, Tr ng H SPKT Hng Yn
Trong nh ng nm g n y, vi c ng d ng cc k thu t ki m nh hnh th
c(formal verification) trong cc h th ng ph n c ng v ph n m m ngy
cng tr nn quan tr ng, gip pht hi n s m cc l i 27
h th ng, gi m ng k r i ro cng nh chi ph thi t k . Nh ng k thu t
ny c th gip pht hi n ra cc l i m qu trnh testing c th khng pht hi n
ra. Cc k thu t l Static Analysis, Model Checking v Bounded Model
Checking. Trong bo co ny, chng ti gi i thi u v Model checking, kh o
st cc thu t ton lin quan v ng d ng r ng ri c a n trong ki m nh h th
ng ph n c ng v ph n m m. Phng php ny s d ng cc ki u logic th i gian
( c bi t l logic th i gian tuy n tnh- Linear Temporal Logic) m ph
ng h th ng v cc thu c tnh c n ki m tra. i m thu n l i c a phng php
ny so v i phng php Static analysic l n c th a ra cc ph n v d
(counterexample) tm ra v tr g p l i n u c, tuy nhin i m h n ch l v
n bng n khng gian tr ng thi khi s tr ng thi c a h th ng v t qu t m
ki m sot. Tuy nhin, v n ny c kh c ph c ng k b i nh ng thu t ton m i
c pht tri n trong th i gian g n y, cc thu t ton ton m i ny cng c c
p y.
Ki m ch ng t ng ph n cho ph n m m h ng thnh ph no Anh Hi n1, Ph
m Ng c Hng2, Nguy n Vi t H21
Khoa CNTT, Tr ng HSPKT Hng Yn, 2Khoa CNTT, Tr ng H Cng ngh , HQG
H N i
Bo co ny trnh by phng php ki m ch ng t ng ph n cho ph n m m h ng
thnh ph n. Thay v ki m ch ng trn ton b m hnh c ghp n i t t t c cc m
hnh c a cc thnh ph n ph n m m, phng php xu t ti n hnh ki m ch ng
trn t ng thnh ph n ring bi t. V i phng php ny, chng ta c th gi i
quy t v n bng n khng gian tr ng thi m t trong nh ng v n kh nh t
trong ki m ch ng m hnh. Cng c h tr v k t qu th c nghi m cng c trnh
by trong bo co ny.
Ki m nh h t g o dng phng php x l nhPhan Nh Qun, Hunh Tu n T Khoa
i n-i n t , Tr ng H L c H ng Phng php ki m tra kch th c, sng c a h
t g o dng phng php x l nh c a h t g o c trnh by trong bi bo ny. Thu
t ton Canny dng pht hi n bin nh, m xch dng tm chu vi v trung bnh m
c xm dng ki m tra sng c a h t. Phng 28
php ny c th thay th cho phng php ki m nh ch quan truy n th ng. V
i i u ki n kho ng cch ch p nh, nh sng khng i th t l thnh cng c a ti
l r t cao.
K thu t hi n th v i u ph i hi n th hnh nhNguy n Pht Nh t, on Thi
n Minh Khoa Cng ngh Thng tin, Tr ng H L c H ng Trong bi bo ny, chng
ti trnh by m t phng php ti p c n m i nh m i u ph i hi n th hnh nh
trn h th ng hi n th g m nhi u mn hnh LCD ghp lt g ch, c phn gi i
cao. phn gi i c a mn hnh ghp l t ng cc phn gi i c a cc mn hnh.
Trong m i mn hnh c i u khi n b i m t my tnh v cc my tnh t ch c thnh
c m tnh ton theo m hnh my tnh c m (PC cluster) trn c s tnh ton song
song v phn tn b nh . Cng trnh ny s d ng cng c SAGE (Scalable
Adaptive Graphics Environment) v thu t ton ng b ha gi a cc my tnh
trong c m i u ph i hnh nh v m b o hnh nh hi n th trn cc mn hnh m t
cch li n m ch, ch t l ng phn gi i cao. Chng ti cng th nghi m SAGE v
i cc cng c SDL, Quanta, OpenGL, Glut, VNC trn h th ng g m 6 mn hnh
LCD, v i phn gi i 6 x (1024 x 768) pixels, cho k t qu l h th ng c
th hi n th nhi u ng d ng tr c quan nh: truy c p t xa, video, hnh
nh. T kho: h a, tnh ton song song, tnh ton phn tn, hnh nh.
K thu t pht hi n nh c gi u tin s d ng k thu t gi u thu n ngh ch
d a trn Difference ImageH Th Hng Thm1, H Vn Canh2, Tr nh Nh t Ti
n31
Tr ng HDL H i Phng, 2C c K thu t Nghi p v I, B Cng an, 3 Tr ng H
Cng ngh , H Qu c gia H N i
Th i gian g n y k thu t gi u tin thu t ngh ch (reversible data
hiding) trong nh s r t c quan tm trong lnh v c an ton b o m t thng
tin. Tnh nng u vi c c a k thu t ny cho php sau khi tch thng i p gi
u trong nh chng ta c th khi ph c c x p x nh g c. Nh k thu t gi u
NSAS (do Ni v cc ng nghi p xu t), k thu t HKC (do Hwang v cc ng
nghi p xu t) u d a trn d ch chuy n histogram c a nh. Sau , nh m m c
ch tng dung l ng 29
thng i p c th gi u trong nh Lin v Xianting Zeng cng cc ng nghi p
c a mnh xu t hai k thu t gi u d a trn difference image. Tuy nhin
hai k thu t ny l i m t gi u hi u khng bnh th ng trn histogram c a
difference image c a nh sau khi gi u tin. V v y, d a trn m t lo t
cc th nghi m v phn tch gi a nh khng gi u tin ( nh t nhin hay nh g
c) v nh gi u tin s d ng hai k thu t gi u c a Lin v Zeng chng ti a
ra phng php pht hi n nh c gi u tin s d ng hai k thu t gi u ny. Ph n
th nghi m a ra kh nng pht hi n cao c a k thu t pht hi n xu t v i cc
l ng gi u khc nhau. T kha: steganography, steganalysis, difference
image, stego image, cover image, reversible data hiding.
Lm m n h th ng i t ng v thnh ph nNguy n M nh c Khoa Ton, Tr ng H
S ph m, H Thi Nguyn Bi bo s trnh by m t cch ti p c n m hnh ha cc ph
n m m i t ng v thnh ph n. Chng ti m r ng m t s k t qu nghin c u v
lm m n cho cc h th ng i t ng v thnh ph n d a trn l thuy t l p trnh
th ng nh t, xu t m t s v n cho ti n trnh lm m n... Nh ng k t qu ny
c th p d ng ph c v cho vi c thi t k cc h th ng ph n m m trong cc
giai o n khc nhau c a qu trnh pht tri n. Keywords: rCOS, UTP, UML,
RUP, design, refinement.
L p ch m c theo nhm nng cao hi u qu khai thc c s d li u virus
cmTrng Th c, Trng Th Qunh Hng, Nguy n Th y Mai Trm, V H ng B o Chu,
T Thc Nhu Khoa Cng ngh Thng tin, Tr ng H L c H ng Virus cm
(influenza) l m t lo i RNA virus, chnh l nguyn nhn gy ra b nh cm ng
i v ng v t. V i kh nng bi n i v lan truy n nhanh t ng v t sang ng v
t, t ng v t sang ng i, v c bi t l t ng i sang ng i; virus cm l m t
trong nh ng loi virus nguy hi m nh t cho n n kinh t cng nh s c kh e
con ng i trn ton th gi i t tr c n nay. Chnh v v y, s hi u bi t v c
u trc phn t c a n l m t nhu c u l n trong cc nghin c u v d ch b nh.
30
Hi n nay, cc t ch c y t , cng nh cc ngn hng d li u trn th gi i
lu tr nhi u trnh t sinh h c lin quan n virus cm. Tuy nhin, cc ngn
hng d li u sinh h c ny khng ch a thng tin chi ti t n cc t nh thnh c
a m t qu c gia. V v y, chng ta khng c y thng tin bi u di n qu trnh
ly nhi m, cng nh phn tch virus cm Vi t Nam m t cch y , c bi t c
thng tin ph c v c ng ng. Bi vi t ny trnh by gi i php xy d ng c s d
li u c th b sung d li u virus cm Vi t Nam cho n m c t nh thnh; ng
th i a ra thu t ton l p ch m c theo nhm qua c th gip cho vi c khai
thc thng tin theo tiu ch ng i dng v virus cm nhanh chng v hi u qu .
Thu t ton cho php ch n l a nh ng trnh t sinh h c v i m c tng ng khc
nhau truy v n; sau nhm nh ng k t qu d a trn quan h h hng c a chng v
i nhau. Bn c nh , bi vi t cng trnh by gi i php cho php c p nh t d
li u m t cch t ng t cc ngn hng d li u v virus cm trn th gi i, c bi
t l ngn hng d li u c a NCBI (National Center for Biotechnology
Information).
Logic Programming Based MatchingNguyen Trung Lap Faculty of
Science and Technology, Hoa Sen University Matching has been used
in many applications, especially in ecommerce. Nowadays, finding a
proper approach for matching is an interesting research. In
addition, each of most current approaches focuses on a specific
application domain like web service matching, so it is difficult to
apply those researches to other domains or real applications. In
this research, we try to develop a combinative method in which the
advantages of logic programming, description logic, and user
preference are used for matching. The aim of this research is to
specify a general model for common objects matching, and in this
model an abstract model, algorithm, and system architecture are
proposed. According to this approach, matching objects is based on
matching their attributes values, and those values are matched by
reasoning (using knowledge base and rules). Each object has some
31
attributes which may have more than one value, and each value is
assigned a weight factor which handles user preference. Keywords:
matching, semantic matching, logic programming, description
logic.
M v i t nh binH Ng c Vinh1, Phan Trung Huy2, Long Vn31
Khoa CNTT, Tr ng HSPKT Vinh, 2Khoa Ton-Tin ng d ng, Tr ng HBK H
N i, 3Vi n Ton h c, Vi n KH&CN Vi t Nam
Nghin c u m c nh ngha b i cc y u t i u khi n, a tr , nh p nh ng
i v i tch c a cc t m l h ng m i trong nghin c u l thuy t m. Trong
bi bo ny, chng ti gi i thi u khi ni m t nh bin v tch c a cc t nh
bin trn b ng ch h u h n A. T cho php nh ngha v nhm c a cc t nh bin
trn A, m c a cc t nh bin, otomat h u h n, ngn ng c on b i otomat,
ngn ng tha b i v nhm h u h n cho tr ng h p cc t nh bin. M t s k t
qu i v i ngn ng c on nh n, m v i t nh bin, thu t ton kim tra m v i
t nh bin c thi t l p. T kha: L thuy t m, m lun phin, t nh bin, ng c
u v nhm, thu t ton.
M hnh c p k t cho nh n d ng ch vi t tay li n nt tr c tuy nTr n
Cao Khoa Cng ngh Thng tin v Truy n thng, Tr ng H C n Th Bi bo ny c
p n v n nh n d ng ch vi t tay li n nt tr c tuy n. Cch ti p c n phn
tch (Analytical approach) c dng. Cch ti p c n ny d a trn vi c phn
tch cc nt ch vi t thnh cc m nh nh hay m nh ghp (graphemes). y l b c
c nh h ng quan tr ng n hi u qu nh n d ng. Qu trnh nh n d ng th k t
n i cc m nh nh l i v i nhau tng ng v i cc k t trong ch vi t li n
nt. Trong th c t , khng c cch no hi u qu nh n bi t m nh nh no thu c
k t no. Do v y, qu trnh nh n d ng s thi t l p cc gi thi t khc nhau
v vi c ghp cc m nh nh , sau ti n hnh nh n d ng 32
t ng t h p cc m nh ny nh m t k t . T h p cc m nh ghp cho k t qu
nh n d ng k t v i xc su t cao (nh t) s c ch n. Tuy nhin, khng c cch
no ki m tra l i m t t h p gi thi t nh v y l ph h p hay khng. Bi vi
t ny ra m hnh c p k t (bi-character) nh l m t gi i php ki m tra l i
vi c ghp cc m nh nh l ph h p thng qua vi c k t h p cc m nh ghp c a
t ng c p hai k t xem n c l t h p ng c a hai k t khng. K t qu th c
nghi m trn 30 t vi t li n nt ch ra r ng, m hnh ny gip tng hi u qu
nh n d ng t 65% ln 83%. T kha: Nh n d ng k t , Nh n d ng ch vi t
tay li n nt, M hnh c p k t , M hnh, Markov n, My h c SVM.
M hnh ho v i u khi n t i u t th v tinh nh dng thanh t l cPh m Th
ng Ct, Ph m Minh Tu n, Nguy n Vn Tnh Vi n Cng ngh Thng tin, Vi n
KH&CN Vi t Nam c i m chnh c a v tinh nh l kh i l ng c a n
