How to choose a home loan agent

The following helps us to select a home loan agent

1. Loan to home value ratio: 80% up to 100%
2. Exit fee
3. Evaluation fee
4. Minimum and maximum term (e.g. 1 year to 30 years)
5. Application fee
6. Fixed interest or variable interests
7. Different payment period options (e.g. monthly, fortnightly, weekly)
8. Payment options: principle and interest or interest only
9. Options to redraw
10. Options to make extra payment
11. Account transfer fee

Source from infochoice.com.au

Perspectives

1. One object to another object
2. One thing to another thing
3. One idea to another idea
4. One image to another image
5. One situation to another situation

Oracle recruitment channels

1. http://oraclerecruiter.blogspot.com/
2. Create your own profile on

1. LinkedIn.com
2. Twitter.com
3. Facebook
4. Myspace

to attract potential Oracle recruiters.

Visual communication

1/ Tools for effective visual communcation

-Tables
-Graphs and charts
-Diagrams and sketches
-Maps, drawings and photographs
-Scientific and information visualisation

2/ References

Terry Mohan, Helen McGregor, Shirley Saunders and Ray Archee "Communicating as professionals", 3nd Ed, Thomson, 2008.

Quicksort algorithm

Quicksort algorithm has the worst-case time complexity of O(n^2), and the best-case time complexity of O(nlogn).

Problem solving as search

Problem solving as search

Uninformed search

I/ Breath-first search
II/ Depth-first search

Depth-first search is not optimal and incomplete.

"Incomplete" means it can start down an infinite path and never return to try other possibilities.

Informed search

I/Best-first search approach

1. Greedy best-first search

"Greedy" means at each step it tries to get as close to the goal node as it can.

2. A* search

A* search tries to minimize the total estimated solution cost.

f(n)=g(n) + h(n)

h(n) represents the heuristic cost from the considering node to the goal.
g(n) represents the cost from the current node to the considering node.

A* search is both complete and optimal.

A* search is optimal if h(n) is an admissible heuristic. That means h(n) never overestimates the cost to reach the goal.

A* tends to run out of space faster than out of time as it keeps all the previous generated nodes.

Reference
Stuart Russel and Peter Norvig "Artificial intelligence: a modern approach", 2nd Ed, 2003.

Video compression

Parameters to affect digital video quality

1. Number of scan lines in each frame
2. Number of pixels in each scan line
3. Number of frames per second
4. Scanning techniques

Video compression makes use of two different compression techniques

1. Partial redundancy (intra-frame compression)
2. Temporal redundancy (inter-frame compression)