Today, the accelerating development in traveling demand and the number of vehicle circulating on the roads in Viet Nams densely populated cities has been putting the transportation infrastructure under high pressure. The traffic congestion consecutively occurs especially in the rush hours. Besides, the publics conception as participating in transportation also directly have detrimental impacts on this burning issue.
With the widespread growth of GPS satellite located equipment, especially according to the circulars 91/2009/ND-CP of Viet Nam Transportation Ministry, the vehicles must be equipped monitoring facilitates which send transportation information continuously to the converging data centers. In fact, there is massive amount of transportation data being directed to these centers per second, hence it consists of features of big data a key word which is used for huge and complicated sets of data. Thereby, it is impossible for traditional data processing to tackle this problem.
The ultimate goal of this graduation thesis is to build a system which is capable to process, analysis consecutive blocks of GPS data in real-time and then show the information about transportation state of roads and provide capacity of finding the fastest way in time-dependent spatial networks. With this information, the participants can chose an appropriate route to avoid traffic jam and the managers can schedule for developing policies of infrastructure, therefore making great contribution to tackling traffic congestion and giving a boost for the development of the society.
This graduation thesis will show the result of study process, requirement analyzing, real-time big data processing system installing and designing, putting the reduction of traffic jam in realistic perspective..
T畛ng h畛p c叩c tour du l畛ch Nha Trang gi叩 c畛c s畛c v nhi畛u 動u 達i m湛a h竪 2014 t畛 Puta Travels. Website book tour du l畛ch s畛 1 Nha Trang.www.putatravels.com
Today, the accelerating development in traveling demand and the number of vehicle circulating on the roads in Viet Nams densely populated cities has been putting the transportation infrastructure under high pressure. The traffic congestion consecutively occurs especially in the rush hours. Besides, the publics conception as participating in transportation also directly have detrimental impacts on this burning issue.
With the widespread growth of GPS satellite located equipment, especially according to the circulars 91/2009/ND-CP of Viet Nam Transportation Ministry, the vehicles must be equipped monitoring facilitates which send transportation information continuously to the converging data centers. In fact, there is massive amount of transportation data being directed to these centers per second, hence it consists of features of big data a key word which is used for huge and complicated sets of data. Thereby, it is impossible for traditional data processing to tackle this problem.
The ultimate goal of this graduation thesis is to build a system which is capable to process, analysis consecutive blocks of GPS data in real-time and then show the information about transportation state of roads and provide capacity of finding the fastest way in time-dependent spatial networks. With this information, the participants can chose an appropriate route to avoid traffic jam and the managers can schedule for developing policies of infrastructure, therefore making great contribution to tackling traffic congestion and giving a boost for the development of the society.
This graduation thesis will show the result of study process, requirement analyzing, real-time big data processing system installing and designing, putting the reduction of traffic jam in realistic perspective..
T畛ng h畛p c叩c tour du l畛ch Nha Trang gi叩 c畛c s畛c v nhi畛u 動u 達i m湛a h竪 2014 t畛 Puta Travels. Website book tour du l畛ch s畛 1 Nha Trang.www.putatravels.com
Tuong ky cao cap giao trinh vgl (china chess)Hung Pham Thai
油
The document discusses the history and importance of chocolate in human civilization. It notes that chocolate originated in Mesoamerica over 3000 years ago and was prized by the Aztecs and Mayans for its taste. Cocoa beans were used as currency and their cultivation was tightly regulated. The Spanish brought cocoa beans back to Europe in the 16th century, starting chocolate's global spread and popularity as both a drink and candy.
M担n h畛c "M叩y t鱈nh trong kinh doanh" trang b畛 cho sinh vi棚n kinh t畉 nh畛ng ki畉n th畛c v k畛 nng c畉n thi畉t 畛 畛ng d畛ng c担ng ngh畛 th担ng tin vo ho畉t 畛ng qu畉n l箪 v kinh doanh. Qua m担n h畛c, sinh vi棚n s畉 hi畛u r探 vai tr嘆 quan tr畛ng c畛a c担ng ngh畛 trong vi畛c n但ng cao hi畛u qu畉 lm vi畛c, h畛 tr畛 ra quy畉t 畛nh v t畉o ra l畛i th畉 c畉nh tranh cho doanh nghi畛p.
Bi 3: Tri畛n khai d畛ch v畛 Active Directory - Gi叩o tr狸nh FPTMasterCode.vn
油
Gi畛i thi畛u 畉c i畛m c畛a m担 h狸nh AD
C叩c kh叩i ni畛m trong m担i tr動畛ng AD
C叩c b動畛c ci 畉t 1 h畛 th畛ng AD
Kh叩i ni畛m v畛 ti kho畉n ng動畛i d湛ng v qu畉n tr畛 ti kho畉n ng動畛i d湛ng
AVL Trees
Adelson-Velskii and Landis
Binary Search Tree - Best Time
All BST operations are O(d), where d is tree depth
minimum d is for a binary tree with N nodes
What is the best case tree?
What is the worst case tree?
So, best case running time of BST operations is O(log N)
Binary Search Tree - Worst Time
Worst case running time is O(N)
What happens when you Insert elements in ascending order?
Insert: 2, 4, 6, 8, 10, 12 into an empty BST
Problem: Lack of balance:
compare depths of left and right subtree
Unbalanced degenerate tree
Balanced and unbalanced BST
Approaches to balancing trees
Don't balance
May end up with some nodes very deep
Strict balance
The tree must always be balanced perfectly
Pretty good balance
Only allow a little out of balance
Adjust on access
Self-adjusting
Balancing Binary Search Trees
Many algorithms exist for keeping binary search trees balanced
Adelson-Velskii and Landis (AVL) trees (height-balanced trees)
Splay trees and other self-adjusting trees
B-trees and other multiway search trees
Perfect Balance
Want a complete tree after every operation
tree is full except possibly in the lower right
This is expensive
For example, insert 2 in the tree on the left and then rebuild as a complete tree
AVL - Good but not Perfect Balance
AVL trees are height-balanced binary search trees
Balance factor of a node
height(left subtree) - height(right subtree)
An AVL tree has balance factor calculated at every node
For every node, heights of left and right subtree can differ by no more than 1
Store current heights in each node
Height of an AVL Tree
N(h) = minimum number of nodes in an AVL tree of height h.
Basis
N(0) = 1, N(1) = 2
Induction
N(h) = N(h-1) + N(h-2) + 1
Solution (recall Fibonacci analysis)
N(h) > h ( 1.62)
Height of an AVL Tree
N(h) > h ( 1.62)
Suppose we have n nodes in an AVL tree of height h.
n > N(h) (because N(h) was the minimum)
n > h hence log n > h (relatively well balanced tree!!)
h < 1.44 log2n (i.e., Find takes O(logn))
Node Heights
Node Heights after Insert 7
Insert and Rotation in AVL Trees
Insert operation may cause balance factor to become 2 or 2 for some node
only nodes on the path from insertion point to root node have possibly changed in height
So after the Insert, go back up to the root node by node, updating heights
If a new balance factor is 2 or 2, adjust tree by rotation around the node
Single Rotation in an AVL Tree
Implementation
Single Rotation
Double Rotation
Implement Double Rotation in two lines.
Insertion in AVL Trees
Insert at the leaf (as for all BST)
only nodes on the path from insertion point to root node have possibly changed in height
So after the Insert, go back up to the root node by node, updating heights
If a new balance factor is 2 or 2, adjust tree by rotation around the node
Insert in BST
Insert in AVL trees
Example of Insertions in an A
This document provides an overview of cloud computing. It defines cloud computing as network-based computing that takes place over the Internet, providing hardware, software, and networking services to clients. Key characteristics of cloud computing include on-demand services that are available anywhere and anytime, elastic scaling, and pay-as-you-go pricing. The document discusses different cloud service models including Software as a Service (SaaS), Platform as a Service (PaaS), and Infrastructure as a Service (IaaS). It also covers advantages such as lower costs, improved performance and collaboration, and unlimited storage, as well as disadvantages like reliance on internet connectivity and potential security and data loss issues.
This document provides an introduction and overview of cloud computing and related topics. It discusses web-scale problems involving large amounts of data, the use of large data centers to process this data in parallel, and different models for cloud computing including utility computing, platform as a service, and software as a service. It also covers challenges in parallel and distributed processing like assigning work units across workers and managing shared resources and synchronization.
Thus cloud computing provides super-computing power by connecting hundreds or thousands of computers together in a cloud. This cloud of computers extends beyond a single company or enterprise, making the applications and data accessible to a broad group of users across different companies and platforms. Users can access documents, software programs, and other data from any Internet-connected computer rather than just their own personal computer.
1. 4/14/2010
QU N TR M NG
WINDOWS SERVER 2003
Bi 2
ACTIVE DIRECTORY
C叩c m担 h狸nh m ng
M担 h狸nh Workgroup
M担 h狸nh Workgroup c嘆n g i l m担 h狸nh peer to
peer.
C叩c m叩y t鱈nh trong m ng c坦 vai tr嘆 nh動 nhau.
Th担ng tin ti kho n ng動 i d湛ng 動 c l動u
trong t p tin SAM (Security Accounts
Manager) tr棚n m i m叩y c c b .
Qu叩 tr狸nh ch ng th c cho ng動 i d湛ng ng
nh p di n ra t i m叩y c c b m user ng
nh p.
1
2. 4/14/2010
C叩c m担 h狸nh m ng (t.t)
M担 h狸nh Domain
Ho t ng theo c董 ch client-server (client server
m担 h狸nh m ng kh叩ch ch c坦 m t h th ng m叩y t鱈nh
cung c p c叩c ti nguy棚n v d ch v cho c h th ng
m ng s d ng g i l c叩c m叩y ch )
C坦 鱈t nh t m t server lm ch c nng i u khi n v湛ng
(Domain Controller).
Th担ng tin ng動 i d湛ng 動 c qu n l箪 b i d ch v
Active Directory v 動 c l動u tr tr棚n Domain
Controller (DC) v i t棚n t p tin l NTDS.DIT.
Qu叩 tr狸nh ch ng th c cho ng動 i d湛ng ng nh p di n
ra t p trung t i m叩y Domain Controller.
M担 h狸nh Domain (t.t)
2
3. 4/14/2010
Active Directory
Gi i thi u Active Directory (AD)
L m t c董 s d li u c a c叩c ti nguy棚n tr棚n
m ng (c嘆n g i l i t動 ng) c滴ng nh動 th担ng
tin li棚n quan n c叩c i t動 ng 坦.
Ch c nng c a Active Directory
L動u gi a c叩c th担ng tin ng動 i d湛ng v c叩c ti
nguy棚n m ng m叩y t鱈nh
坦ng vai tr嘆 ch ng th c (Authentication
server) v qu n l箪 ng nh p (Logon server)
L動u tr th担ng tin m ng m叩y t鱈nh nh動 l c叩c
i t動 ng trong m t c u tr炭c ph但n c p
Active Directory
Ch c nng c a Active Directory(tt)
S qu n l箪 t p trung: Cho ph辿p t o ra nhi u
ti kho n ng動 i d湛ng v i m c quy n
(user right) kh叩c nhau
C叩c kh nng t狸m ki m nng cao: Duy tr狸 b n
ch m c (Index) gi炭p cho qu叩 tr狸nh t狸m ki m
ti nguy棚n m ng nhanh h董n
U quy n i di n: Chia nh domain thnh
nhi u subdomain hay OU (Organizational
Unit)
3
4. 4/14/2010
Active Directory
D o m a in
Computers
Objects
Userss
Active Directory (t.t)
Directory Service (d ch v danh b )
Gi i thi u Directory Service
L h th ng th担ng tin ch a trong NTDS.DIT v c叩c
ch動董ng tr狸nh qu n l箪, khai th叩c t p tin ny. L m t
d ch v c董 s lm n n t n h狸nh thnh h th ng AD
C叩c thnh ph n trong Directory Service
Object ( i t動 ng) th担ng tin v c叩c ti nguy棚n
nh動: m叩y in, ng動 i d湛ng, d ch v m ng
Attribute (Thu c t鱈nh) m t thu c t鱈nh m担 t m t
i t動 ng. Vd m t kh u v t棚n l thu c t鱈nh c a
i t動 ng ng動 i d湛ng m ng
4
5. 4/14/2010
Active Directory (t.t)
C叩c thnh ph n trong Directory Service (tt)
Schema (C u tr炭c t ch c) nh ngh挑a danh s叩ch
c叩c thu c t鱈nh d湛ng m担 t m t lo i i t動 ng
no 坦
Container (V t ch a) t動董ng t kh叩i ni m th動 m c
trong Windows.
Domain: 董n v n ng c t trong c u tr炭c AD
Site: m t site l m t v tr鱈. Site d湛ng ph但n bi t gi a
c叩c v tr鱈 c c b v c叩c v tr鱈 xa x担i
OU (Organizational Unit) l m t lo i v t ch a m b n
c坦 th 動a vo 坦 ng動 i d湛ng, nh坦m, m叩y t鱈nh v
nh ng OU kh叩c
Global catalog: D湛ng x叩c nh v tr鱈 c a m t i
t動 ng m ng動 i d湛ng 動 c c u quy n truy c p
Active Directory (t.t)
Ki n tr炭c c a Active Directory
5
6. 4/14/2010
Ki n tr炭c c a Active Directory
Objects
C叩c kh叩i ni m li棚n quan
Object classes: C叩c Object classes th担ng d ng l
User, Computer, Printer
Attributes: l t p h p c叩c gi叩 tr ph湛 h p v 動 c
g n k t v i m t i t動 ng c th .
Ki n tr炭c c a Active Directory
Organizational Units
OU l 董n v nh nh t trong h th ng AD
Hai c担ng d ng c a OU
Trao quy n ki m so叩t m t t p h p ti kho n
ng動 i d湛ng, m叩y t鱈nh hay c叩c thi t b m ng cho
m t ho c m t nh坦m ph t叩 qu n tr vi棚n (sub-
administrator) gi m b t g叩nh nng cho
Administrator
Ki m so叩t v kho叩 b t m t s ch c nng tr棚n m叩y
tr m th担ng qua ch鱈nh s叩ch nh坦m (Group Policy
Object)
6
7. 4/14/2010
Ki n tr炭c c a Active Directory
Domain
Domain l 董n v ch c nng n ng c t c a c u
tr炭c logic Active Diretory
Ba ch c nng c a domain
坦ng vai tr嘆 nh動 m t khu v c qu n tr
(administrative boundary) c叩c i t動 ng.
Gi炭p ch炭ng ta qu n l箪 b o m t c叩c ti nguy棚n chia
s .
Cung c p c叩c server d ph嘆ng lm ch c nng
i u khi n v湛ng (domain controller) v m b o
th担ng tin tr棚n c叩c server ny ng b v i nhau
Ki n tr炭c c a Active Directory
Domain: c p nh t th担ng tin gi a c叩c DC
7
8. 4/14/2010
Ki n tr炭c c a Active Directory
Domain Tree
L c u tr炭c bao g m nhi u domain 動 c s p x p
c坦 c p b c theo c u tr炭c h狸nh c但y.
Ki n tr炭c c a Active Directory
Forest
Forest (r ng) 動 c x但y d ng tr棚n m t ho c nhi u
Domain Tree, n坦i c叩ch kh叩c Forest l t p h p c叩c
Domain Tree c坦 thi t l p quan h v y quy n cho
nhau.
8
9. 4/14/2010
C u tr炭c v t l箪 c a Domain
Controller
L n董i l動u tr th動 m c SYSVOL.
Tham gia vo vi c m担 h狸nh h坦a Active
Directory
Th c hi n vai tr嘆 m t Domain
Ci t v c u h狸nh Active
Directory
N但ng c p server thnh Domain Controller
Gi i thi u
M c nh t t c c叩c m叩y Win2k3 khi m i ci u l
Server c l p (stand alone server). s d ng dc
ch c nng AD th狸 ph i nng c p thnh m叩y t鱈nh DC
Tr動 c khi ci t Domain Controller, ta ph i ti n hnh
ci t a ch IP cho DNS Server v狸 khai Domain 動 c
ci t n坦 y棚u c u a ch DNS tham chi u trong qu叩
tr狸nh c u h狸nh.
DNS Server Domain Name System: L h th ng t棚n
mi n tr棚n m叩y t鱈nh Server s d ng ph但n gi i,
chuy n i a ch IP thnh t棚n mi n d nh h董n v
ng動 c l i.
9
10. 4/14/2010
Ci t v c u h狸nh Active
Directory
C叩c b動 c ti n hnh thi t l p a ch IP cho
DNS
Vo Start > Setting > Control Pannel Ch n Netword
Connections > nh p ph i chu t vo Local Area Connection
ch n properties
Trong h p tho i Local Area Connection Properties t i th
General ch n Internet Protocol TCP/IP v ch n
Properties.
Ci t v c u h狸nh Active
Directory
Nh p a ch IP vo m c
IP Address, Subnet
mask. Sau 坦 nh p
ch n vo m c Use the
following DNS Server
Address v nh p a ch
cho DNS Server trong
m c Preferred DNS
Server
Ch炭 箪: a ch IP c a
DNS Server ph i tr湛ng
v i a ch IP c a
Server
10
11. 4/14/2010
N但ng c p server thnh Domain Controller
C叩c b動 c n但ng c p
D湛ng ti n 鱈ch Manage Your Server ho c d湛ng
l nh Start Run DCPROMO n但ng c p
Start Run DCPROMO
C叩c b動 c n但ng c p (t.t)
Ch c nng c a DC
DC qu n l箪 Domain m i
Th棚m DC vo Domain 達 t n t i s n
11
12. 4/14/2010
C叩c b動 c n但ng c p (t.t)
Lo i Domain mu n t o
Domain trong m t Forest m i
Domain con c a m t Domain Tree,
C叩c b動 c n但ng c p (t.t)
T棚n DNS y c a Domain mu n t o
V鱈 d : netclass.com ho c vina.com.vn
12
13. 4/14/2010
C叩c b動 c n但ng c p (t.t)
T棚n NetBIOS
T棚n Domain theo chu n NetBIOS t動董ng
th鱈ch v i h i u hnh Windows NT
C叩c b動 c n但ng c p (t.t)
Ch nh v tr鱈 l動u Database v Log c a
Active Directory
N棚n l動u Database v Log tr棚n 2 挑a v t l箪
13
14. 4/14/2010
C叩c b動 c n但ng c p (t.t)
Ch nh nh v tr鱈 l動u th動 m c SYSVOL
SYSVOL ph i n m tr棚n partition NTFS v.5
C叩c b動 c n但ng c p (t.t)
Ki m tra ho c ci t DNS
DNS l d ch v ph但n gi i t棚n k t h p v i AD
ph但n gi i t棚n c叩c m叩y t鱈nh trong mi n. H
th ng h at ng 動 c c坦 鱈t nh t 1 DNS server
14
15. 4/14/2010
C叩c b動 c n但ng c p (t.t)
Permissions
Cho ph辿p ho c kh担ng cho ph辿p c叩c m叩y s
d ng H H tr動 c Windows 2000 ng nh p
C叩c b動 c n但ng c p (t.t)
Restore Mode Administrator Password
Password s d ng khi kh i ng ch
Directory Services Restore Mode
15
16. 4/14/2010
C叩c b動 c n但ng c p (t.t)
C叩c th担ng tin c a AD
T ng k t c叩c th担ng tin m b n 達 cung c p
cho qu叩 tr狸nh ci AD
C叩c b動 c n但ng c p (t.t)
Nh n Finish
K t th炭c
Restart l i m叩y
16
17. 4/14/2010
C叩c b動 c n但ng c p (t.t)
Mn h狸nh ng nh p sau khi 達 n但ng c p
thnh domain controller nh動 sau:
C叩c b動 c n但ng c p (t.t)
C担ng c thay i sau khi nng c p
17
18. 4/14/2010
Gia nh p vo Domain
Gi i thi u
M t m叩y t鱈nh gia nh p vo domain t o m t
m i quan h tin c y gi a m叩y 坦 v i DC trong
v湛ng.
Vi c gia nh p vo domain ph i c坦 s ng 箪
c a ng動 i qu n tr m ng c p mi n. M叩y client
ph i c坦 quy n admin v khi gia nh p x叩c th c
b ng ti kho n ng動 i d湛ng c p mi n c坦
quy n add workstation to Domain
Gia nh p vo Domain
C叩c b動 c gia nh p
m叩y tr m vo
Domain
ng nh p vo m叩y
tr m v i vai tr嘆 c a
ng動 i qu n tr (C坦
th s d ng
Administrator)
1. Thi t l p a ch IP
cho DNS
18
19. 4/14/2010
Gia nh p vo Domain
C叩c b動 c gia nh p m叩y tr m vo Domain
2. Right click My Computer Properties
System Properties ch n tab Computer
Name ch n n炭t Change i n t棚n c a
Domain mu n gia nh p vo 担 Domain(H狸nh A)
DC y棚u c u ch ng th c, ph i i n username
v password c a ti kho n c坦 quy n 動a m叩y
tr m vo Domain (H狸nh B).
Gia nh p vo Domain
C叩c b動 c gia nh p m叩y tr m vo Domain
H狸nh B
H狸nh A
19
20. 4/14/2010
Gia nh p vo Domain
Ch炭 箪:
Ch l n u ti棚n ch炭ng ta m i ng nh p b ng
ti kho n Administrator v狸 c叩c user ch動a
動 c t o v ch動a 動 c c p quy n .
Trong m ng doanh nghi p tuy t i kh担ng
bao gi cho user th担ng th動 ng ng nh p
b ng ti kho n Administrator , v狸 v i ti kho n
ny h s c坦 quy n t i cao trong h th ng -
但y c滴ng l nguy棚n nh但n d n n t狸nh tr ng
m ng c a nhi u doanh nghi p b s p .
C担ng c qu n tr c叩c i t動 ng trong
Active Directory
Active Directory User and Computer
Builtin: ch a nh坦m ng動 i d湛ng t o s n
Computers: Ch a m叩y client m c nh ang l thnh vi棚n
c a mi n (domain)
Domain Controllers: ch a c叩c i u khi n v湛ng (DC)
ForeignSecurityPrincipals: m t v t ch a m c nh cho c叩c
i t動 ng b棚n ngoi mi n ang xem x辿t
Users: ch a c叩c ti kho n ng動 i d湛ng m c nh tr棚n mi n
20
21. 4/14/2010
X但y d ng OU
Organizational Unit (OU)
Start Programs Administrative Tools
Active Directory User and Computer
X但y d ng OU
Nh p t棚n OU mu n t o
21
22. 4/14/2010
X但y d ng OU
動a c叩c m叩y tr m v ng動 i d湛ng vo OU
X但y d ng OU
Ch n ng動 i ho c
nh坦m qu n l箪 OU
Click chu t ph i vo
OU v a t o, ch n
Properties h p tho i
xu t hi n, trong Tab
Managed By, ch n
Change thay i
ng動 i qu n l箪
22