The document summarizes a new social video chat platform called BottleGame that allows up to 24 users to interact, chat and play games together in virtual rooms. It aims to combine online dating and social communication in a unique way compared to traditional dating sites that rely on profiles and messaging. Key features include video chat rooms for gaming and conversations, optional private chats, online moderation and support for multiple languages. The platform has launched in Russia and seeks further funding to expand globally and enhance its technology.
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/20/2010
QU N TR M NG
WINDOWS SERVER 2003
Bi 5
CHNH SCH NHM
N i dung bi h c
Gi i thi u v ch鱈nh s叩ch nh坦m (Group
Policy)
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n mi n
M t s minh ho GPO tr棚n ng動 i d湛ng v
c u h狸nh m叩y
1
2. 4/20/2010
Gi i thi u
So s叩nh gi a System Policy v Group
Policy:
C坦 nhi u ch c nng h董n ch鱈nh s叩ch h th ng.
(ch c t t c ch c nng ch鱈nh s叩ch h th ng
v h董n th n a)
Ch鱈nh s叩ch nh坦m t ng hu b t叩c d ng khi
動 cg b .
C坦 th 叩p d ng ch鱈nh s叩ch nh坦m nhi u c p
(cho ng動 i d湛ng ho c t ng nh坦m)
Ch c坦 th 叩p d ng ch鱈nh s叩ch nh坦m cho c叩c
m叩y s d ng H H Windows 2K, Windows XP,
v Windows 2003
Gi i thi u
Ch c nng c a Group Policy
Tri n khai ph n m m ng d ng
G叩n c叩c quy n h th ng cho ng動 i d湛ng
Gi i h n nh ng ng d ng m ng動 i d湛ng
動 c ph辿p thi hnh
Ki m so叩t c叩c thi t l p h th ng
Ki m so叩t c叩c k ch b n ng nh p, ng xu t,
kh i ng, v t t m叩y.
董n gi n ho叩 v h n ch c叩c ch動董ng tr狸nh
H n ch t ng qu叩t mn h狸nh Desktop c a
ng動 i d湛ng
2
3. 4/20/2010
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n mi n
Group Policy Object (GPO)
t o GPO ta d湛ng Group Policy Object
Editor
Computer Configuration:
C u h狸nh m叩y t鱈nh
User Configuration:
C u h狸nh ng動 i d湛ng
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n mi n
Nh ng thi t l p dnh cho ng動 i d湛ng
(User Configuration)
Software Setting: C叩c c u h狸nh li棚n quan n
c叩c ph n m m 動 c ci t.
Windows Settings: C叩c ch鱈nh s叩ch h th ng
(system policy)
Administrative Templates: C叩c thi t l p cho
c叩c thnh ph n c a Windows v c叩c thi t l p
li棚n quan trong qu叩 tr狸nh s d ng Windows nh動
chia s t p tin, hi u ch nh ControlPanel..
3
4. 4/20/2010
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n mi n
Ch炭 箪:
Group Policy 動 c t鱈ch l滴y v k th a t c叩c v t
ch a (container) b棚n tr棚n c a Active Directory.
V鱈 d c叩c ng動 i d湛ng v m叩y t鱈nh v a
trong mi n v a trong OU n棚n s nh n 動 c c叩c
c u h狸nh t c hai ch鱈nh s叩ch c p mi n l n ch鱈nh
s叩ch c p OU.
N u d湛ng ch鱈nh s叩ch nh坦m th狸 ch鱈nh s叩ch nh坦m
t i ch tr棚n m叩y c c b s x l箪 tr動 c c叩c ch鱈nh
s叩ch dnh cho site, mi n ho c OU.
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n mi n
Xem ch鱈nh s叩ch c c b c a m t m叩y xa
GPEDIT.MSC /gpcomputer: machinename
T o ch鱈nh s叩ch tr棚n mi n
C坦 2 c叩ch truy xu t n c担ng c Group Policy
Object Editor:
Start Run GPEDIT.MSC
Active Directory Users and Computers Right
Click Properties tab Group Policy Edit (
Right Click vo t棚n mi n hay OU)
4
5. 4/20/2010
Tri n khai m t ch鱈nh s叩ch nh坦m tr棚n
mi n (t.t)
Group Policy Object Editor
M t s v鱈 d
n c叩c thnh ph n trong Control Panel
H n ch ch c nng c a Internet Explorer
Ch cho ph辿p thi hnh m t s ng d ng
T t ch Autoplay c a 挑a.
5