diep bài số 1

You might also like

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 15

MT S NG DNG CA M HNH VC T

Abstract: M phng l qu trnh "bt chc" mt hin tng c thc vi mt tp cc cng


thc ton hc. Cc chng trnh my tnh c th m phng cc iu kin thi tit, a l, s
dn nhit trong cc vt liu, cc phn ng ho hc, qu trnh sinh hc thm ch cn m
phng thit b thng tin v knh thng tin.
Trong topic ny ch nghin cu mt phn trong qu trnh m phng l s dng
php tuyn tnh ha, tuyn tnh ha bng vc t v dng cc chng trnh con
SAMT/DESIRE chy trn h iu hnh Linux, Windows m phng qu trnh dn nhit v
m phng H thng thng tin a l

I. Gii thiu:
Bi vit ny gii thiu phng php tuyn tnh ha, tuyn tnh ha bng vc t
v dng cc chng trnh con SAMT/DESIRE m phng qu trnh dn nhit v trao
i nhit trn mt thanh cn v m phng h thng thong tin a l, m hnh ha s
pht trin ca cc c im a l.

II. Ni dung
1. Phng php tuyn tnh
Phng php tuyn tnh s hc (MOL) gim cc phng trnh vi phn tng phn xung
mt tp hp cc phng trnh vi phn thng . MOL khng phi l phng php chung tt
nht mc ch gii phng trnh vi phn; cc chng trnh sai phn hu hn s tng
qut hn v thng thun li hn, chnh xc hn. Nhng MOL li hp dn hn cho s m
phng qu trnh iu khin, bi MOL to ra phng trnh vi phn thng i din cho
cc l phn ng hoc trao i nhit ch n gin c gii quyt cng vi cc ph ng
trnh vi phn thng vn dng lm m hnh cho phn cn li ca h thng iu khin.

Hnh 1a. Phn ng ting n-u vo ca c cu ph tng t cng vi mt b iu khin


m (nh) v mt b iu khin tuyn tnh (di cng).

Hnh 1b. Nm chc nng thnh vin li m t ph fuzzy-set cho cc gi tr li nh.Chc


nng thnh vin hp trung tm c s dng n p gim xc m t kh nhiu cho cc
li nh.
2. Phng php vc-t tuyn tnh ha
(a) Gii thiu
Nhng bi ton phng trnh vi phn tng phn n gin nht lin quan ti hm u = u (t, x)
ca thi gian t v mt khng gian mt phi hp x. Chng ta s s dng php biu din ch
s di cho hm ring, nh trong

Mt v d hu ch l phng trnh dn nhit mt hoc phng trnh khuch tn


ut = uxx
c tha mn bi nhit u = u (t, x) ti thanh cn u m rng t x = 0 n x = L.
Chng ta mun tm lch s thi gian ca u (x, t) = u [1], u [2], ... , u [n] n im khng gian
u x [1] = 0, x [2], ..., x [n] = L dc thanh cn ny.
MOL thay th uxx vi mt trong vi xp x khc c th, ni (u [i - 1] - 2U [i] + u [i +
1])) / DX2 v sau gii quyt c h thng kt qu
(d/dt)u[i ] = {u[i 1] 2u[i ] + u[i + 1])}/DX 2 (i = 1, 2, ..., n)
ca phng trnh vi phn thng n cho x [1], x [2], .... Vc t ha i din cho h thng ny
nh l mt phng trnh vi phn n vector. Tham kho [9] cho thy lm th no gi tr
ranh gii ca u [i] c th c thit lp cho iu kin ranh gii nht nh, nhng y l mt
qu trnh vn c th v d b li.
(b) S dng Ton t sai phn
Schiesser [6] thay th th tc ad hoc cho vic la chn xp x khc v v thit lp cc iu
kin ban u vi mt cch tip cn c h thng. ng tuyn b dy n chiu ring bit Ux,
uxx, ... cho cc o hm khng gian Ux, uxx,... v nh ngha mt hm Fortran DDx hot
ng trn u sinh ra ux, trn ux sinh ra uxx, v tng t trn:
Chng ta s thc hin nhng o hm khng gian nh vy vi mt mu con (mc
3-17) [9]. Mu con DESIRE khng p t bt k hm gi thi gian chy trn u v c th
c lu tr ti s dng. Bng 7-1 cho cc danh sch mu con hu ch cho cc xp x
o hm khc bit trung tm yu cu th hai v th t.
Cc kch bn th nghim giao thc trong hnh 7-7 tuyn b mt vc t u n-chiu v vc t
ux v uxx n-chiu vi
STATE u[n] | ARRAY ux[n], uxx[n]
Bng 1-1 M hnh ph cho hot ng o hm tng phn Schiesser
yu cu th hai : vi phn gn ng gia
lin quan n dy v (v[1], v[2], , v[n$]) cho dy phi sinh tng ng vx
(vx[1], vx[2], , vx[n$]), s dng
vx[i] = (v[i + 1] v[i 1])/2DX
(i = 2, 3, ... , n$ 1)
vx[1] = (- 3v[1] + 4v[2] v[3])/2DX vx[n$] = (3v[n$] 4v[n$ 1] + v[n$ 2])/2DX

y l m hnh con c thc hin vi DESIRE


SUBMODEL DDx(n$, bb$, v, vx) Vector vx =
(v{1} v{-1}) * bb$
vx[1] = (-3 * v[1] + 4 * v[2] v[3]) * bb$ (
vx[n$] = (3 * v[n$] 4 * v[n$ 1] + v[n$ 2]) * bb$
end
[set bb$ = 1/(2 DX)]
Ghi ch n c n nh ti gi tr cui vx[1] v vx[n$] chng ln gi tr cui ca vc t
c n nh S dch ch s cng t thit lp v[i] = 0 cho i < 1 hoc i > n$ (phn 3-6).
yu cu th t : vi phn gn ng gia
chng trnh con th t tng ng l [6,9]
SUBMODEL DDx(n$, bb$, v, vx)
Vector vx = (2 * v{2} 16 * v{-1} + 16 * v{1} 2 * v{2}) * bb$
vx[1] = ( 50 * v[1] + 96 * v[2] 72 * v[3] + 32 * v[4] 6 * v[5]) * bb$
vx[2] = ( 6 * v[1] 20 * v[2] + 36 * v[3] 12 * v[4] + 2 * v[5]) * bb$
vx[n$-1] = ( 2 * v[n$-4] + 12 * v[n$-3] - 36 * v[n$-2] + 20 * v[n$-1] + 6 * v[n$])
* bb$ vx[n$] = (6 * v[n$-4] 32 * v[n$-3] + 72 * v[n$2] 96 * v[n$1] + 50 *
v[n$]) * bb$ end [SET bb$ = 1/(24 DX)]
Cui cng gi tr n nh li chng ln phn ca vc t n dnh trc
Nhit ban u u(x, 0) c thit lp 8000 K cho mi x dc theo thanh . ti x = 0, thanh
c cch ly, nhng ti x = L n bc x theo lut nng lng th t:v vy chng ta c
iu kin bin hn hp ti u cui ca thanh l
ux = 0 (for x = 0, aII t)

ux = E[UA4 u(L)4]

(for x = L, aII t)

E v UA4 = UA4 l khng i. Cc kch bn th nghim giao thc ban u t ra gi tr


hn hp bin i u [i] vi
for i = 1 to n I

u[i] = scaIe I

next

ti th t l scaIe c thit lp bng vi nhit nht nh ban u


u (x, 0) = 8.000
Cc on chng trnh ng trong hnh 2 chy DDx to ra o hm ring vector ux
vi
invoke DDx(n, bb, u, ux)

PHNG TRNH VI PHN TNG PHN CA S DN NHIT


--------------------------------------------------------------------------------------------------------------------- ARRAY vx$[1], v$[1] I -- dummy arrays for SUBMODEL
--Schiesser numericaI-differentiation operator
-SUBMODEL DDx(n$, bb$, v$, vx$)
Vector vx$ = bb$ * (v${1} - v${-1})
vx$[1] = bb$ * (-3 * v$[1] + 4 * v$[2] - v$[3]) vx$[n$] = bb$
* (3 * v$[n] - 4 * v$[n-1] + v$[n-2]) end
---------------------------------------------------------------------------------------------------- iruIe 15 I ERMAX = 0.001 I -Gear-type integration
n = 51
STATE u[n] I ARRAY ux[n], uxx[n], U[n]
---------------------------------------------------------------------------------------------------- scaIe = 8000 I TMAX = 2 I NN = 1200
for i = 1 to n I u[i] = scaIe I next I -- initiaI conditions
L = 2 I UA = 400
I E = 1.73E-09
I UA4 = UA^4
-DX = L/(n - 1) I bb = 1/(2 * DX) DT0 = 0.0025
I DT = DT0/(n^2)
-- drun
-------------------------------------------------------------------------------------------DYNAMIC
-----------------------------------------------------------------------------------------------

invoke DDx(n, bb, u, ux) I -- differentiate u to get ux


ux[1] = 0 I ux[n] = E * (UA4 - u[n]^4) I -- boundary vaIues
invoke DDx(n, bb, ux, uxx) I -differentiate ux to get uxx
Vectr d/dt u = uxx
v gi tr cui thay th ux[1] v ux[n] thit lp cc gi tr ranh gii nht nh
ux[1] = 0 I
ux[n] = E * (UA^4 u[n]^4)
DDx c gi ln na to ra uxx vi
invoke DDx(n, bb, ux, uxx)
Vic a ra mt phn phng trnh vi phn tng phn (1-2) sau c lp trnh
nh
Vectr d/dt u = uxx(1-3)
Bi ton khuch tn n gin ny c gii quyt bng cch s dng hi nhp Gear-type
vi li tng i ti a ERMAX = 0,001. Mt my tnh c nhn 2,4 GHz gi r a ra
cc gii php trong t hn 20 ms vi mn hnh tt. Thi gian chy trnh bin dch cng t
hn 20 ms. Mt cch th v, cc gii php ti x = L cho n = 11 nm trong vng 0,2% so vi
n = 51.
(c) Bi ton s hc
K thut lp trnh m t trong mc 1a v tr thun tin, v bi ton tr nn d dng cho n
= 200 nh i vi n = 10 nu mt khng vt qu b nh. Nhng tnh chnh xc gii php
phi c xem xt k lng trong mi trng hp .
Th nht, xp x o hm lin quan n s khc bit nh ca cc con s ln. Vi s hc
c chnh xc gp i (64-bit), li lm trn thng khng ng k. Nhng lu rng h
thng phng trnh vi phn (1-3) bao hm cc hng s thi gian phng trnh vi phn ca
lnh ca DX2. Lut hp nht bc c nh n gin sau yu cu bc hi nhp DT ca
yu cu ca ln [6], v tng s cc hot ng s tng (i vi trng hp v mt
chiu khng gian ca chng ta) vi n3. Nhng h phng trnh vi phn MOL cng c th
lin quan n hng s thi gian ln hn (h thng cng), v vy m vic s dng mt
quy lut hi nhm n a bc c ch nh. Hnh 1-7 cho thy bc hi nhp DT thay
i nh th no. V d n gin dn nhit ca chng ta l d dng gii quyt v u thay
i nhanh chng ch cho x nh, v sau ch ban u. Nhng n khng phi l lun lun
d dng nh vy c c mt gii php n nh. Tham kho [6,7] cho cc v d.
Hnh 1-7. Gii php v chng trnh cho cc dn nhit hay phng trnh khuch tn (xem
vn bn). Cc lnh hin th khng c ch ra.
3. Phng trnh nhit-dn trong trc ta Hnh tr
Phng trnh vi phn tng phn
ut = uxx + ux/x
(3-1)
m phng dn nhit i xng trc trong mt xi lanh di v hn ca bn knh R, s dng
tr phi hp vi bn knh x [6]. Chng ta s gii quyt c phng trnh vi phn tng
phn (3-4) cho nhit u (x, t), bit nhit ban u u (x, 0) = 0 v ranh gii nhit c
nh u (R, t) = u0. Chng ta cn th nghim khng c loop-giao thc cho cc u ban u [i]
= 0, v tt c cc mng thnh phn mc nh n 0. Nhng trn trc hnh tr (x = 0), chng
ta phi ln chng trnh iu kin bin ux(0, t) = 0 cho tt c cc gi tr ca t.

Hnh 7-8 cho thy chng trnh hon tt. Cc bn ghi giao thc th nghim xc nh
gi tr bn knh n x [1] = 0, x [2], ..., x [n] = R ca bn knh x vi
DX = R/(n-1)
and for i = 1 to n I
x[i] = (i - 1) * DX I next (3-2)
Cc phn on chng trnh DYNAMIC c ngun gc t cc vect ux v uxx v t cc
iu kin bin cho sn cho u [n] = u0 v [UX 1] = 0 bng cch ghi u [1] v n] u [.
Cc phng trnh vi phn tng phn (3-4) sau c i din bi
Vectr d/dt u = uxx + ux/x
trnh chia cho 0, chng ta ghi ln cc phng trnh vi phn cho u [1] vi cc phng
trnh vi phn chnh xc
d/dt u[1] = 2 * uxx[1]
Nhn c bi quy tc ca 1'Hspital's (UX / x 0). uxx / 1 l x Hnh 7-8 cho thy lch
s thi gian gii php ca nhit u cho n cc thng nht khong cch bn knh val-ues
c xc nh bi Eq. (3-5).
4. Khi qut
Nhng m hnh con o hm khng gian ca chng ta p dng cho nhiu h thng ca
phng trnh vi phn tng phn tuyn tnh parabol hoc phi tuyn vi mt chiu khng
gian, nhng bi ton
Hnh 1-8. Gii php ca phng trnh vi phn tng phn cho dn nhit trong mt xi lanh b
tr hnh trn v hn. Cc lnh hin th khng c ch ra.

-HEAT-CONDUCTION PARTIAL DIFFERENTIAL EQUATION


-radiaI heat conduction, in cyIindricaI coordinates; x is radius
---------------------------------------------------------------------------------------------------ARRAY vx[1], v[1] I -- dummy arrays for SUBMODEL
--

SUBMODEL DDx(n$, bb$, v, vx )


Vector vx = bb$ * (v{1} - v{-1})
vx[1] = bb$ * (-3 * v[1] + 4 * v[2] - v[3])
vx[n$] = bb$ * (3 * v[n] - 4 * v[n-1] + v[n - 2])
end
---------------------------------------------------------------------------------------------------iruIe 15 I ERMAX = 0.001 I -- Gear-type integration
n = 51
STATE u[n] I
ARRAY x[n], ux[n], uxx[n]
---------------------------------------------------------------------------------------------------R = 1 I u0 = 25 I -- cyIinder radius, surface temperature
scaIe = u0
-DX = R/(n - 1)
I
bb = 1/(2 * DX) DT0 =
0.00025
I DT = DT0/(n^2) TMAX = 0.5
I
NN = 1000
-for i = 1 to n I x[i] = (i-1) * DX I next
-initiaI conditions u[i] = 0 need not be programmed drun
-------------------------------------------------------------------------------------------------DYNAMIC
-------------------------------------------------------------------------------------------------u[n] = u0 I -- set boundary vaIue at x = R for each t
invoke DDx(n, bb, u, ux) I -- differentiate u to get ux ux[1] = 0
I -- set boundary vaIue for x = 0
invoke DDx(n, bb, ux, uxx) I -differentiate ux to get uxx Vectr
d/dt u = uxx + ux/x I -- note: not vaIid for x = 0 d/dt u[1] = 2 * uxx[1]
I -- from IHopitaIs ruIe
ca cc lnh ln hn 1 trong chiu thi gian thng chy vo cc vn nghim trng v s
lng, s n nh. Schiesser Silebi gii quyt thnh cng cc phng trnh bnh lu [6]
ut = Vux
v phng trnh vi phn tng phn lin quan
ut = Vux + a(U u)
Cc phng trnh m m phng mt trao i nhit n gin vi vn tc dng chy V .
Nhng ng dng trc tip ca cc m hnh con o hm khng gian trong Bng 1-1 vo
phng trnh sng:
utt = auxx
tht bi. Schiesser [6] gii quyt vn ny bng cch chuyn ha t mt ton t o hm
th hai cho my tnh uxx trong mt bc, nhng vic thit lp iu kin ranh gii s tr
thnh phc tp hn.
i vi nhng bi ton vi nhiu hn mt chiu khng gian, trnh bin dch vector to
phng trnh vi phn thng ch l mt cch d dng, i vi mt c th x l, v d, mng
hai chiu nh vect tng ng . Nhng cc gi tr chuyn nhng ranh gii a chiu c

th s l lam tr ngai-mt s, ging nh trong mt chng trnh Fortran. Mt s la chn


thng minh ca h thng phi hp c th m phng v ln chng trnh mt cch n gin,
nh trong v d ca hnh 1-12.
5. Mt m hnh trao i nhit n gin
Trong m hnh trao i nhit n gin c lp trnh trong hnh 7-9a, u (x, t) l nhit ca
mt cht lng chy qua mt ng gia x = 0 v x = L. Cc cht lng nhit ban u l u =
T0c = 0. Vic chuyn cht lng nhit n hoc t mt vnh khuyn c nhit khng i;
dn nhit theo chiu dc l b b qua. Mt s thay i bc khi u Tec nhit u vo
ti x = 0 sau i xung ng bi advection. u (x, t) tha mn cc phng trnh vi phn tng
phn
ut = Vux + a(U u)
ti V l cht lng khng i vn tc, v U nhit vnh khuyn, th m c gi nh
l khng i y. Cc chng trnh trong hnh 7-9 gii quyt phng trnh vi phn tng
phn ny bng cch s dng ton t vi phn Schiesser lnh th 2 .
-- SIMPLE HEAT EXCHANGER (Schiesser and SiIebi, 1997)
--------------------------------------------------------------------------------------------dispIay N1 I dispIay C8 I dispIay R
--------------------------------------------------------------------------------------------- -Schiesser numericaI-differentiation operator
-ARRAY vx[1], v[1] I -dummy arrays for submodeI SUBMODEL
DDx(n$, bb$, v, vx)
Vector vx = (v{1} - v{-1}) * bb$
vx[1] = (-3 * v[1] + 4 * v[2] - v[3]) * bb$
vx[n$] = (3 * v[n$] 4 * v[n$ - 1] + v[n$ - 2]) * bb$
end
--------------------------------------------------------------------------------------------L = 100 I -heat-exchanger tube Iength
V = 10
I -fIow veIocity
rho = 1

I --

density of fIuid in tube

CP = 1

I --

specific heat of fIuid

D=2
I -tube diameter
H = 0.1 I -heat-transfer coefficient
a = 4 * H/(rho * CP * D)
-Tac = 100 I -constant annuIus temperature
T0c = 0
I -initiaI temperature in tube
Tec = 50 I -tube-entry temperature
------------------------------------------------------------------------------------------------------------- n = 201 I STATE u[n] I ARRAY ux[n]
--

DX = L/(n-1) I bb = 0.5/DX
DT = 0.0005 I TMAX = 10 I NN = 20000 I scaIe = 100
iruIe 4
I RK4 ruIe
---------------X = 0.5 * (n-1) * DX/V I -time deIay used in theoreticaI soIution
---------------------------------------------------------------------------------------------program initiaI conditions u[k]
for k = 1 to n I u[k] = T0c I next
U = Tac I
constant annuIus temperature drun I write
n = ;n
-----------------------------------------------------------------------------------------------------DYNAMIC
-----------------------------------------------------------------------------------------------------u[1] = Tec I
set tube-entry boundary vaIue for u
invoke DDx(n, bb, u, ux) I --

differentiate u to get ux

Vectr d/dt u = - V * ux + a * (U - u)
compare u with theoreticaI soIution ff = 2 * (Tac + (T0c Tac * exp(-a * t) * (1 swtch(t - X))
+ swtch(t - X) * ((Tec - Tac) * exp(-a*X))) - scaIe uu = 2 * u[0.5*(n-1)] scaIe
I errx5 = 2.5 * (uu - f) - 0.5 * scaIe dispt uu, errx5, f
Hnh 1-9a chng trnh cho my tnh m phng ca bin i nhit n gin

10

Hnh 1-9b. L thuyt v lch s thi gian tnh ton ca trao i ng nhit (x, t) cho x =
L / 2.
i vi mi gi tr ca x dc theo ng, cc gii php mang tnh l thuyt trong hnh 7-9 kt
hp mt hm s tng t u (x, t) = 0 ti u (x, t) = U
vi mt bc chc nng, s thay i nhit do nhit bc u vo. Hnh 1-9b so snh gii php ny l thuyt vi cc gii php s. Nhng phn ng dao ng hin th cho n = 201

11

v
l in hnh ca cc gii php s ca phng trnh vi phn tng phn hyperbolic [6,7].

501

Nhn rng m hnh AGROECOLOGICAL trn li MAP


6. H thng thng tin a l
Chng trnh SAMT (Spatial Analysis and Modeling Tool) c pht trin bi R.
Wieland [10,11] l 1 h thng thong tin a l n gin vi mc ch m t v vn hnh
d liu v h sinh thi. SAMT khai bo m lu tr s liu v c im a l s
dng cho li v tr a l. V d v c im a l:
T r c a l c h o m i i m t r n l i (x, y, cao)
D liu vt l nh nhit , m v s lng cc loi ti mi
im.
SAMT c th gn v tnh ton cc gi tr lin quan n nhiu c im a l khc nhau
ti bt c im trn li no, ta c
q1 = q2 + q3

q1= cos(q2) q1 = caIc(q2, q3, ... )

Cc hm ging nh caIc(q2, q3, ... ) u l cc biu thc s hc hoc hi quy c to bi


mt mng t nhin n gin hoc mt m hnh nhn to [11].
SAMT cn c th gn v lu tr d liu v cc im li m chng ph thuc vo cc im
khc, v d nh khong cch gia im hin ti n cc im khc nh l khong cch t 1 thnh
ph n t chim; hoc khong cch ngn nht t 1 dng song ti 1 con ng no . SAMT c
th lm hn na, l tng hp cc thng k nh l trung bnh v cc chu k tnh cho ton b 1
tp hp cc im li. Cui cng, SAMT c th v bn th hin d liu cc im li vi cc
mu khc nhau hoc v cc ng cho cc c im a l khc nhau. (hnh. 1-10).
7. m hnh ha s pht trin ca cc c im a l
D liu ban u ca SAMT m t 1 a im bi 1 gi tr trong 1 khong thi gian t (nh
trong 1 ngy, 1 thng hoc 1 nm), tuy nhin chng trnh khng gn kt cc c im a
l vi cc thng tin v khong thi gian ly mu. Theo 1 cch khc, DESIRE s dng bc
thi gian nh DT ti hin s thay i lin tip. Vic kt hp SAMT v DESIRE c th
m hnh ha s thay i ca cc c im a l ti cc im ring bit trn li vi cc
phng trnh vi phn v sai phn. SAMT/DESIRE u chy di h iu hnh linux v
window. (hnh 1-11 v 1-12)

12

Hnh 7-10. Bn v v s lin quan gia mt cy c to b SAM [12]. (Bn


gc c mu)

13

Hnh 1-11. Biu 3D ca SAMT/DESIRE. Biu ba chiu cng c th hin th

Hnh 1-12. Ca s SAMT/DESIRE theo di song song trn mi trng Window. n


gin ha vic m hnh vi nhng ngi dung bnh tng, SAMT/DESIRE c lp trnh v
chy t 1 chng trnh sa t ng c thit k bi R. Wieland v X. Holtmann.
[12]. Mt chng trnh c th chy c t phi tri

Ti liu tham kho


1. F. Breitenecker and I. Husinsky, Results of the EUROSIM comparison
Lithium Cluster Dynamics, Proceedings of EUROSIM, Vienna, 1995.
2. G. A. Korn, Interactive Dynamic System Simulation with Microsoft Windows,
Francis and Taylor, London, 1998.
3. B. Kosko, Neural Networks and Fuzzy Systems, Prentice-Hall, Englewood
Cliffs, NJ, 1991.
4. G. A. Korn, Neural Networks and Fuzzy-logic Control on Personal Computers and
Workstations, MIT Press, Cambridge, MA, 1995.
5. G. A. Korn, Simulating a fuzzy-logic-controlled nonlinear servomechanism,
SAMS, 34, 1999, pp. 3552.
6. W. E. Schiesser, The Numerical Method of Lines, Academic Press, New York,
1991.
7. W. E. Schiesser and C. A. Silebi, Computational Transport Phenomena,
Cambridge University Press, Cambridge, 1997.
8. A. Tveito and R. Winther, Introduction to Partial Differential Equations,

14

Springer, New York, 1998.


9. G. A. Korn, Interactive solution of partial differential equations by the method of
lines, Math and Computers in Simulation, 1644, 1999, 110.
10. G. A. Korn, Using a runtime simulation-language compiler to solve partial differential equations by the method of lines, SAMS, 37, 2000, pp. 141149.
11. R. Wieland, Spatial Analysis and Modeling Tool, Report, ZALF Institut fur
Landschaftsystemanalyse, Muencheberg, Germany.
12. G. A. Korn and X. Holtmann, Spatial analysis and modeling tool a new soft- ware
package for landscape analysis, Simulation News Europe, December
2005.
13. G. A. Korn, Simplified
function generators based on fuzzy-logic interpolation,
Simulation Practice and Theory, 7, 2000, pp. 709717.
14. M. Wang and J. M. Mendel, Fuzzy basis functions, IEEE Trans. Neural
Networks, 3, 1992, pp. 807818.
15. R. Wieland and M. Voss, Spatial analysis and modeling tool possibilities and
applications, Proc. IASTED Conference on Environmental Modeling and
Simulation, November 2004.

Mc lc

MT S NG DNG CA M HNH VC T....................................................................1


I. Gii thiu:................................................................................................................... 1
II. Ni dung..................................................................................................................... 1
1. Phng php tuyn tnh.......................................................................................... 1
3. Phng trnh nhit-dn trong trc ta Hnh tr..................................................6
4. Khi qut................................................................................................................ 7
6. H thng thng tin a l....................................................................................... 12
7. m hnh ha s pht trin ca cc c im a l...............................................12
Ti liu tham kho........................................................................................................ 14

15

You might also like